1 /* Functions related to building classes and their related objects.
2 Copyright (C) 1987-2013 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
22 /* High-level class interface. */
26 #include "coretypes.h"
36 #include "splay-tree.h"
37 #include "pointer-set.h"
38 #include "hash-table.h"
42 /* The number of nested classes being processed. If we are not in the
43 scope of any class, this is zero. */
45 int current_class_depth
;
47 /* In order to deal with nested classes, we keep a stack of classes.
48 The topmost entry is the innermost class, and is the entry at index
49 CURRENT_CLASS_DEPTH */
51 typedef struct class_stack_node
{
52 /* The name of the class. */
55 /* The _TYPE node for the class. */
58 /* The access specifier pending for new declarations in the scope of
62 /* If were defining TYPE, the names used in this class. */
63 splay_tree names_used
;
65 /* Nonzero if this class is no longer open, because of a call to
68 }* class_stack_node_t
;
70 typedef struct vtbl_init_data_s
72 /* The base for which we're building initializers. */
74 /* The type of the most-derived type. */
76 /* The binfo for the dynamic type. This will be TYPE_BINFO (derived),
77 unless ctor_vtbl_p is true. */
79 /* The negative-index vtable initializers built up so far. These
80 are in order from least negative index to most negative index. */
81 vec
<constructor_elt
, va_gc
> *inits
;
82 /* The binfo for the virtual base for which we're building
83 vcall offset initializers. */
85 /* The functions in vbase for which we have already provided vcall
87 vec
<tree
, va_gc
> *fns
;
88 /* The vtable index of the next vcall or vbase offset. */
90 /* Nonzero if we are building the initializer for the primary
93 /* Nonzero if we are building the initializer for a construction
96 /* True when adding vcall offset entries to the vtable. False when
97 merely computing the indices. */
98 bool generate_vcall_entries
;
101 /* The type of a function passed to walk_subobject_offsets. */
102 typedef int (*subobject_offset_fn
) (tree
, tree
, splay_tree
);
104 /* The stack itself. This is a dynamically resized array. The
105 number of elements allocated is CURRENT_CLASS_STACK_SIZE. */
106 static int current_class_stack_size
;
107 static class_stack_node_t current_class_stack
;
109 /* The size of the largest empty class seen in this translation unit. */
110 static GTY (()) tree sizeof_biggest_empty_class
;
112 /* An array of all local classes present in this translation unit, in
113 declaration order. */
114 vec
<tree
, va_gc
> *local_classes
;
116 static tree
get_vfield_name (tree
);
117 static void finish_struct_anon (tree
);
118 static tree
get_vtable_name (tree
);
119 static tree
get_basefndecls (tree
, tree
);
120 static int build_primary_vtable (tree
, tree
);
121 static int build_secondary_vtable (tree
);
122 static void finish_vtbls (tree
);
123 static void modify_vtable_entry (tree
, tree
, tree
, tree
, tree
*);
124 static void finish_struct_bits (tree
);
125 static int alter_access (tree
, tree
, tree
);
126 static void handle_using_decl (tree
, tree
);
127 static tree
dfs_modify_vtables (tree
, void *);
128 static tree
modify_all_vtables (tree
, tree
);
129 static void determine_primary_bases (tree
);
130 static void finish_struct_methods (tree
);
131 static void maybe_warn_about_overly_private_class (tree
);
132 static int method_name_cmp (const void *, const void *);
133 static int resort_method_name_cmp (const void *, const void *);
134 static void add_implicitly_declared_members (tree
, tree
*, int, int);
135 static tree
fixed_type_or_null (tree
, int *, int *);
136 static tree
build_simple_base_path (tree expr
, tree binfo
);
137 static tree
build_vtbl_ref_1 (tree
, tree
);
138 static void build_vtbl_initializer (tree
, tree
, tree
, tree
, int *,
139 vec
<constructor_elt
, va_gc
> **);
140 static int count_fields (tree
);
141 static int add_fields_to_record_type (tree
, struct sorted_fields_type
*, int);
142 static void insert_into_classtype_sorted_fields (tree
, tree
, int);
143 static bool check_bitfield_decl (tree
);
144 static void check_field_decl (tree
, tree
, int *, int *, int *);
145 static void check_field_decls (tree
, tree
*, int *, int *);
146 static tree
*build_base_field (record_layout_info
, tree
, splay_tree
, tree
*);
147 static void build_base_fields (record_layout_info
, splay_tree
, tree
*);
148 static void check_methods (tree
);
149 static void remove_zero_width_bit_fields (tree
);
150 static void check_bases (tree
, int *, int *);
151 static void check_bases_and_members (tree
);
152 static tree
create_vtable_ptr (tree
, tree
*);
153 static void include_empty_classes (record_layout_info
);
154 static void layout_class_type (tree
, tree
*);
155 static void propagate_binfo_offsets (tree
, tree
);
156 static void layout_virtual_bases (record_layout_info
, splay_tree
);
157 static void build_vbase_offset_vtbl_entries (tree
, vtbl_init_data
*);
158 static void add_vcall_offset_vtbl_entries_r (tree
, vtbl_init_data
*);
159 static void add_vcall_offset_vtbl_entries_1 (tree
, vtbl_init_data
*);
160 static void build_vcall_offset_vtbl_entries (tree
, vtbl_init_data
*);
161 static void add_vcall_offset (tree
, tree
, vtbl_init_data
*);
162 static void layout_vtable_decl (tree
, int);
163 static tree
dfs_find_final_overrider_pre (tree
, void *);
164 static tree
dfs_find_final_overrider_post (tree
, void *);
165 static tree
find_final_overrider (tree
, tree
, tree
);
166 static int make_new_vtable (tree
, tree
);
167 static tree
get_primary_binfo (tree
);
168 static int maybe_indent_hierarchy (FILE *, int, int);
169 static tree
dump_class_hierarchy_r (FILE *, int, tree
, tree
, int);
170 static void dump_class_hierarchy (tree
);
171 static void dump_class_hierarchy_1 (FILE *, int, tree
);
172 static void dump_array (FILE *, tree
);
173 static void dump_vtable (tree
, tree
, tree
);
174 static void dump_vtt (tree
, tree
);
175 static void dump_thunk (FILE *, int, tree
);
176 static tree
build_vtable (tree
, tree
, tree
);
177 static void initialize_vtable (tree
, vec
<constructor_elt
, va_gc
> *);
178 static void layout_nonempty_base_or_field (record_layout_info
,
179 tree
, tree
, splay_tree
);
180 static tree
end_of_class (tree
, int);
181 static bool layout_empty_base (record_layout_info
, tree
, tree
, splay_tree
);
182 static void accumulate_vtbl_inits (tree
, tree
, tree
, tree
, tree
,
183 vec
<constructor_elt
, va_gc
> **);
184 static void dfs_accumulate_vtbl_inits (tree
, tree
, tree
, tree
, tree
,
185 vec
<constructor_elt
, va_gc
> **);
186 static void build_rtti_vtbl_entries (tree
, vtbl_init_data
*);
187 static void build_vcall_and_vbase_vtbl_entries (tree
, vtbl_init_data
*);
188 static void clone_constructors_and_destructors (tree
);
189 static tree
build_clone (tree
, tree
);
190 static void update_vtable_entry_for_fn (tree
, tree
, tree
, tree
*, unsigned);
191 static void build_ctor_vtbl_group (tree
, tree
);
192 static void build_vtt (tree
);
193 static tree
binfo_ctor_vtable (tree
);
194 static void build_vtt_inits (tree
, tree
, vec
<constructor_elt
, va_gc
> **,
196 static tree
dfs_build_secondary_vptr_vtt_inits (tree
, void *);
197 static tree
dfs_fixup_binfo_vtbls (tree
, void *);
198 static int record_subobject_offset (tree
, tree
, splay_tree
);
199 static int check_subobject_offset (tree
, tree
, splay_tree
);
200 static int walk_subobject_offsets (tree
, subobject_offset_fn
,
201 tree
, splay_tree
, tree
, int);
202 static void record_subobject_offsets (tree
, tree
, splay_tree
, bool);
203 static int layout_conflict_p (tree
, tree
, splay_tree
, int);
204 static int splay_tree_compare_integer_csts (splay_tree_key k1
,
206 static void warn_about_ambiguous_bases (tree
);
207 static bool type_requires_array_cookie (tree
);
208 static bool contains_empty_class_p (tree
);
209 static bool base_derived_from (tree
, tree
);
210 static int empty_base_at_nonzero_offset_p (tree
, tree
, splay_tree
);
211 static tree
end_of_base (tree
);
212 static tree
get_vcall_index (tree
, tree
);
214 /* Variables shared between class.c and call.c. */
217 int n_vtable_entries
= 0;
218 int n_vtable_searches
= 0;
219 int n_vtable_elems
= 0;
220 int n_convert_harshness
= 0;
221 int n_compute_conversion_costs
= 0;
222 int n_inner_fields_searched
= 0;
224 /* Convert to or from a base subobject. EXPR is an expression of type
225 `A' or `A*', an expression of type `B' or `B*' is returned. To
226 convert A to a base B, CODE is PLUS_EXPR and BINFO is the binfo for
227 the B base instance within A. To convert base A to derived B, CODE
228 is MINUS_EXPR and BINFO is the binfo for the A instance within B.
229 In this latter case, A must not be a morally virtual base of B.
230 NONNULL is true if EXPR is known to be non-NULL (this is only
231 needed when EXPR is of pointer type). CV qualifiers are preserved
235 build_base_path (enum tree_code code
,
239 tsubst_flags_t complain
)
241 tree v_binfo
= NULL_TREE
;
242 tree d_binfo
= NULL_TREE
;
246 tree null_test
= NULL
;
247 tree ptr_target_type
;
249 int want_pointer
= TYPE_PTR_P (TREE_TYPE (expr
));
250 bool has_empty
= false;
253 if (expr
== error_mark_node
|| binfo
== error_mark_node
|| !binfo
)
254 return error_mark_node
;
256 for (probe
= binfo
; probe
; probe
= BINFO_INHERITANCE_CHAIN (probe
))
259 if (is_empty_class (BINFO_TYPE (probe
)))
261 if (!v_binfo
&& BINFO_VIRTUAL_P (probe
))
265 probe
= TYPE_MAIN_VARIANT (TREE_TYPE (expr
));
267 probe
= TYPE_MAIN_VARIANT (TREE_TYPE (probe
));
269 if (code
== PLUS_EXPR
270 && !SAME_BINFO_TYPE_P (BINFO_TYPE (d_binfo
), probe
))
272 /* This can happen when adjust_result_of_qualified_name_lookup can't
273 find a unique base binfo in a call to a member function. We
274 couldn't give the diagnostic then since we might have been calling
275 a static member function, so we do it now. */
276 if (complain
& tf_error
)
278 tree base
= lookup_base (probe
, BINFO_TYPE (d_binfo
),
279 ba_unique
, NULL
, complain
);
280 gcc_assert (base
== error_mark_node
);
282 return error_mark_node
;
285 gcc_assert ((code
== MINUS_EXPR
286 && SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), probe
))
287 || code
== PLUS_EXPR
);
289 if (binfo
== d_binfo
)
293 if (code
== MINUS_EXPR
&& v_binfo
)
295 if (complain
& tf_error
)
297 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), BINFO_TYPE (v_binfo
)))
300 error ("cannot convert from pointer to base class %qT to "
301 "pointer to derived class %qT because the base is "
302 "virtual", BINFO_TYPE (binfo
), BINFO_TYPE (d_binfo
));
304 error ("cannot convert from base class %qT to derived "
305 "class %qT because the base is virtual",
306 BINFO_TYPE (binfo
), BINFO_TYPE (d_binfo
));
311 error ("cannot convert from pointer to base class %qT to "
312 "pointer to derived class %qT via virtual base %qT",
313 BINFO_TYPE (binfo
), BINFO_TYPE (d_binfo
),
314 BINFO_TYPE (v_binfo
));
316 error ("cannot convert from base class %qT to derived "
317 "class %qT via virtual base %qT", BINFO_TYPE (binfo
),
318 BINFO_TYPE (d_binfo
), BINFO_TYPE (v_binfo
));
321 return error_mark_node
;
325 /* This must happen before the call to save_expr. */
326 expr
= cp_build_addr_expr (expr
, complain
);
328 expr
= mark_rvalue_use (expr
);
330 offset
= BINFO_OFFSET (binfo
);
331 fixed_type_p
= resolves_to_fixed_type_p (expr
, &nonnull
);
332 target_type
= code
== PLUS_EXPR
? BINFO_TYPE (binfo
) : BINFO_TYPE (d_binfo
);
333 /* TARGET_TYPE has been extracted from BINFO, and, is therefore always
334 cv-unqualified. Extract the cv-qualifiers from EXPR so that the
335 expression returned matches the input. */
336 target_type
= cp_build_qualified_type
337 (target_type
, cp_type_quals (TREE_TYPE (TREE_TYPE (expr
))));
338 ptr_target_type
= build_pointer_type (target_type
);
340 /* Do we need to look in the vtable for the real offset? */
341 virtual_access
= (v_binfo
&& fixed_type_p
<= 0);
343 /* Don't bother with the calculations inside sizeof; they'll ICE if the
344 source type is incomplete and the pointer value doesn't matter. In a
345 template (even in fold_non_dependent_expr), we don't have vtables set
346 up properly yet, and the value doesn't matter there either; we're just
347 interested in the result of overload resolution. */
348 if (cp_unevaluated_operand
!= 0
349 || in_template_function ())
351 expr
= build_nop (ptr_target_type
, expr
);
353 expr
= build_indirect_ref (EXPR_LOCATION (expr
), expr
, RO_NULL
);
357 /* If we're in an NSDMI, we don't have the full constructor context yet
358 that we need for converting to a virtual base, so just build a stub
359 CONVERT_EXPR and expand it later in bot_replace. */
360 if (virtual_access
&& fixed_type_p
< 0
361 && current_scope () != current_function_decl
)
363 expr
= build1 (CONVERT_EXPR
, ptr_target_type
, expr
);
364 CONVERT_EXPR_VBASE_PATH (expr
) = true;
366 expr
= build_indirect_ref (EXPR_LOCATION (expr
), expr
, RO_NULL
);
370 /* Do we need to check for a null pointer? */
371 if (want_pointer
&& !nonnull
)
373 /* If we know the conversion will not actually change the value
374 of EXPR, then we can avoid testing the expression for NULL.
375 We have to avoid generating a COMPONENT_REF for a base class
376 field, because other parts of the compiler know that such
377 expressions are always non-NULL. */
378 if (!virtual_access
&& integer_zerop (offset
))
379 return build_nop (ptr_target_type
, expr
);
380 null_test
= error_mark_node
;
383 /* Protect against multiple evaluation if necessary. */
384 if (TREE_SIDE_EFFECTS (expr
) && (null_test
|| virtual_access
))
385 expr
= save_expr (expr
);
387 /* Now that we've saved expr, build the real null test. */
390 tree zero
= cp_convert (TREE_TYPE (expr
), nullptr_node
, complain
);
391 null_test
= fold_build2_loc (input_location
, NE_EXPR
, boolean_type_node
,
395 /* If this is a simple base reference, express it as a COMPONENT_REF. */
396 if (code
== PLUS_EXPR
&& !virtual_access
397 /* We don't build base fields for empty bases, and they aren't very
398 interesting to the optimizers anyway. */
401 expr
= cp_build_indirect_ref (expr
, RO_NULL
, complain
);
402 expr
= build_simple_base_path (expr
, binfo
);
404 expr
= build_address (expr
);
405 target_type
= TREE_TYPE (expr
);
411 /* Going via virtual base V_BINFO. We need the static offset
412 from V_BINFO to BINFO, and the dynamic offset from D_BINFO to
413 V_BINFO. That offset is an entry in D_BINFO's vtable. */
416 if (fixed_type_p
< 0 && in_base_initializer
)
418 /* In a base member initializer, we cannot rely on the
419 vtable being set up. We have to indirect via the
423 t
= TREE_TYPE (TYPE_VFIELD (current_class_type
));
424 t
= build_pointer_type (t
);
425 v_offset
= convert (t
, current_vtt_parm
);
426 v_offset
= cp_build_indirect_ref (v_offset
, RO_NULL
, complain
);
429 v_offset
= build_vfield_ref (cp_build_indirect_ref (expr
, RO_NULL
,
431 TREE_TYPE (TREE_TYPE (expr
)));
433 v_offset
= fold_build_pointer_plus (v_offset
, BINFO_VPTR_FIELD (v_binfo
));
434 v_offset
= build1 (NOP_EXPR
,
435 build_pointer_type (ptrdiff_type_node
),
437 v_offset
= cp_build_indirect_ref (v_offset
, RO_NULL
, complain
);
438 TREE_CONSTANT (v_offset
) = 1;
440 offset
= convert_to_integer (ptrdiff_type_node
,
441 size_diffop_loc (input_location
, offset
,
442 BINFO_OFFSET (v_binfo
)));
444 if (!integer_zerop (offset
))
445 v_offset
= build2 (code
, ptrdiff_type_node
, v_offset
, offset
);
447 if (fixed_type_p
< 0)
448 /* Negative fixed_type_p means this is a constructor or destructor;
449 virtual base layout is fixed in in-charge [cd]tors, but not in
451 offset
= build3 (COND_EXPR
, ptrdiff_type_node
,
452 build2 (EQ_EXPR
, boolean_type_node
,
453 current_in_charge_parm
, integer_zero_node
),
455 convert_to_integer (ptrdiff_type_node
,
456 BINFO_OFFSET (binfo
)));
462 target_type
= ptr_target_type
;
464 expr
= build1 (NOP_EXPR
, ptr_target_type
, expr
);
466 if (!integer_zerop (offset
))
468 offset
= fold_convert (sizetype
, offset
);
469 if (code
== MINUS_EXPR
)
470 offset
= fold_build1_loc (input_location
, NEGATE_EXPR
, sizetype
, offset
);
471 expr
= fold_build_pointer_plus (expr
, offset
);
477 expr
= cp_build_indirect_ref (expr
, RO_NULL
, complain
);
481 expr
= fold_build3_loc (input_location
, COND_EXPR
, target_type
, null_test
, expr
,
482 build_zero_cst (target_type
));
487 /* Subroutine of build_base_path; EXPR and BINFO are as in that function.
488 Perform a derived-to-base conversion by recursively building up a
489 sequence of COMPONENT_REFs to the appropriate base fields. */
492 build_simple_base_path (tree expr
, tree binfo
)
494 tree type
= BINFO_TYPE (binfo
);
495 tree d_binfo
= BINFO_INHERITANCE_CHAIN (binfo
);
498 if (d_binfo
== NULL_TREE
)
502 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (expr
)) == type
);
504 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x'
505 into `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only
506 an lvalue in the front end; only _DECLs and _REFs are lvalues
508 temp
= unary_complex_lvalue (ADDR_EXPR
, expr
);
510 expr
= cp_build_indirect_ref (temp
, RO_NULL
, tf_warning_or_error
);
516 expr
= build_simple_base_path (expr
, d_binfo
);
518 for (field
= TYPE_FIELDS (BINFO_TYPE (d_binfo
));
519 field
; field
= DECL_CHAIN (field
))
520 /* Is this the base field created by build_base_field? */
521 if (TREE_CODE (field
) == FIELD_DECL
522 && DECL_FIELD_IS_BASE (field
)
523 && TREE_TYPE (field
) == type
524 /* If we're looking for a field in the most-derived class,
525 also check the field offset; we can have two base fields
526 of the same type if one is an indirect virtual base and one
527 is a direct non-virtual base. */
528 && (BINFO_INHERITANCE_CHAIN (d_binfo
)
529 || tree_int_cst_equal (byte_position (field
),
530 BINFO_OFFSET (binfo
))))
532 /* We don't use build_class_member_access_expr here, as that
533 has unnecessary checks, and more importantly results in
534 recursive calls to dfs_walk_once. */
535 int type_quals
= cp_type_quals (TREE_TYPE (expr
));
537 expr
= build3 (COMPONENT_REF
,
538 cp_build_qualified_type (type
, type_quals
),
539 expr
, field
, NULL_TREE
);
540 expr
= fold_if_not_in_template (expr
);
542 /* Mark the expression const or volatile, as appropriate.
543 Even though we've dealt with the type above, we still have
544 to mark the expression itself. */
545 if (type_quals
& TYPE_QUAL_CONST
)
546 TREE_READONLY (expr
) = 1;
547 if (type_quals
& TYPE_QUAL_VOLATILE
)
548 TREE_THIS_VOLATILE (expr
) = 1;
553 /* Didn't find the base field?!? */
557 /* Convert OBJECT to the base TYPE. OBJECT is an expression whose
558 type is a class type or a pointer to a class type. In the former
559 case, TYPE is also a class type; in the latter it is another
560 pointer type. If CHECK_ACCESS is true, an error message is emitted
561 if TYPE is inaccessible. If OBJECT has pointer type, the value is
562 assumed to be non-NULL. */
565 convert_to_base (tree object
, tree type
, bool check_access
, bool nonnull
,
566 tsubst_flags_t complain
)
571 if (TYPE_PTR_P (TREE_TYPE (object
)))
573 object_type
= TREE_TYPE (TREE_TYPE (object
));
574 type
= TREE_TYPE (type
);
577 object_type
= TREE_TYPE (object
);
579 binfo
= lookup_base (object_type
, type
, check_access
? ba_check
: ba_unique
,
581 if (!binfo
|| binfo
== error_mark_node
)
582 return error_mark_node
;
584 return build_base_path (PLUS_EXPR
, object
, binfo
, nonnull
, complain
);
587 /* EXPR is an expression with unqualified class type. BASE is a base
588 binfo of that class type. Returns EXPR, converted to the BASE
589 type. This function assumes that EXPR is the most derived class;
590 therefore virtual bases can be found at their static offsets. */
593 convert_to_base_statically (tree expr
, tree base
)
597 expr_type
= TREE_TYPE (expr
);
598 if (!SAME_BINFO_TYPE_P (BINFO_TYPE (base
), expr_type
))
600 /* If this is a non-empty base, use a COMPONENT_REF. */
601 if (!is_empty_class (BINFO_TYPE (base
)))
602 return build_simple_base_path (expr
, base
);
604 /* We use fold_build2 and fold_convert below to simplify the trees
605 provided to the optimizers. It is not safe to call these functions
606 when processing a template because they do not handle C++-specific
608 gcc_assert (!processing_template_decl
);
609 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
610 if (!integer_zerop (BINFO_OFFSET (base
)))
611 expr
= fold_build_pointer_plus_loc (input_location
,
612 expr
, BINFO_OFFSET (base
));
613 expr
= fold_convert (build_pointer_type (BINFO_TYPE (base
)), expr
);
614 expr
= build_fold_indirect_ref_loc (input_location
, expr
);
622 build_vfield_ref (tree datum
, tree type
)
624 tree vfield
, vcontext
;
626 if (datum
== error_mark_node
)
627 return error_mark_node
;
629 /* First, convert to the requested type. */
630 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (datum
), type
))
631 datum
= convert_to_base (datum
, type
, /*check_access=*/false,
632 /*nonnull=*/true, tf_warning_or_error
);
634 /* Second, the requested type may not be the owner of its own vptr.
635 If not, convert to the base class that owns it. We cannot use
636 convert_to_base here, because VCONTEXT may appear more than once
637 in the inheritance hierarchy of TYPE, and thus direct conversion
638 between the types may be ambiguous. Following the path back up
639 one step at a time via primary bases avoids the problem. */
640 vfield
= TYPE_VFIELD (type
);
641 vcontext
= DECL_CONTEXT (vfield
);
642 while (!same_type_ignoring_top_level_qualifiers_p (vcontext
, type
))
644 datum
= build_simple_base_path (datum
, CLASSTYPE_PRIMARY_BINFO (type
));
645 type
= TREE_TYPE (datum
);
648 return build3 (COMPONENT_REF
, TREE_TYPE (vfield
), datum
, vfield
, NULL_TREE
);
651 /* Given an object INSTANCE, return an expression which yields the
652 vtable element corresponding to INDEX. There are many special
653 cases for INSTANCE which we take care of here, mainly to avoid
654 creating extra tree nodes when we don't have to. */
657 build_vtbl_ref_1 (tree instance
, tree idx
)
660 tree vtbl
= NULL_TREE
;
662 /* Try to figure out what a reference refers to, and
663 access its virtual function table directly. */
666 tree fixed_type
= fixed_type_or_null (instance
, NULL
, &cdtorp
);
668 tree basetype
= non_reference (TREE_TYPE (instance
));
670 if (fixed_type
&& !cdtorp
)
672 tree binfo
= lookup_base (fixed_type
, basetype
,
673 ba_unique
, NULL
, tf_none
);
674 if (binfo
&& binfo
!= error_mark_node
)
675 vtbl
= unshare_expr (BINFO_VTABLE (binfo
));
679 vtbl
= build_vfield_ref (instance
, basetype
);
681 aref
= build_array_ref (input_location
, vtbl
, idx
);
682 TREE_CONSTANT (aref
) |= TREE_CONSTANT (vtbl
) && TREE_CONSTANT (idx
);
688 build_vtbl_ref (tree instance
, tree idx
)
690 tree aref
= build_vtbl_ref_1 (instance
, idx
);
695 /* Given a stable object pointer INSTANCE_PTR, return an expression which
696 yields a function pointer corresponding to vtable element INDEX. */
699 build_vfn_ref (tree instance_ptr
, tree idx
)
703 aref
= build_vtbl_ref_1 (cp_build_indirect_ref (instance_ptr
, RO_NULL
,
704 tf_warning_or_error
),
707 /* When using function descriptors, the address of the
708 vtable entry is treated as a function pointer. */
709 if (TARGET_VTABLE_USES_DESCRIPTORS
)
710 aref
= build1 (NOP_EXPR
, TREE_TYPE (aref
),
711 cp_build_addr_expr (aref
, tf_warning_or_error
));
713 /* Remember this as a method reference, for later devirtualization. */
714 aref
= build3 (OBJ_TYPE_REF
, TREE_TYPE (aref
), aref
, instance_ptr
, idx
);
719 /* Return the name of the virtual function table (as an IDENTIFIER_NODE)
720 for the given TYPE. */
723 get_vtable_name (tree type
)
725 return mangle_vtbl_for_type (type
);
728 /* DECL is an entity associated with TYPE, like a virtual table or an
729 implicitly generated constructor. Determine whether or not DECL
730 should have external or internal linkage at the object file
731 level. This routine does not deal with COMDAT linkage and other
732 similar complexities; it simply sets TREE_PUBLIC if it possible for
733 entities in other translation units to contain copies of DECL, in
737 set_linkage_according_to_type (tree
/*type*/, tree decl
)
739 TREE_PUBLIC (decl
) = 1;
740 determine_visibility (decl
);
743 /* Create a VAR_DECL for a primary or secondary vtable for CLASS_TYPE.
744 (For a secondary vtable for B-in-D, CLASS_TYPE should be D, not B.)
745 Use NAME for the name of the vtable, and VTABLE_TYPE for its type. */
748 build_vtable (tree class_type
, tree name
, tree vtable_type
)
752 decl
= build_lang_decl (VAR_DECL
, name
, vtable_type
);
753 /* vtable names are already mangled; give them their DECL_ASSEMBLER_NAME
754 now to avoid confusion in mangle_decl. */
755 SET_DECL_ASSEMBLER_NAME (decl
, name
);
756 DECL_CONTEXT (decl
) = class_type
;
757 DECL_ARTIFICIAL (decl
) = 1;
758 TREE_STATIC (decl
) = 1;
759 TREE_READONLY (decl
) = 1;
760 DECL_VIRTUAL_P (decl
) = 1;
761 DECL_ALIGN (decl
) = TARGET_VTABLE_ENTRY_ALIGN
;
762 DECL_VTABLE_OR_VTT_P (decl
) = 1;
763 /* At one time the vtable info was grabbed 2 words at a time. This
764 fails on sparc unless you have 8-byte alignment. (tiemann) */
765 DECL_ALIGN (decl
) = MAX (TYPE_ALIGN (double_type_node
),
767 set_linkage_according_to_type (class_type
, decl
);
768 /* The vtable has not been defined -- yet. */
769 DECL_EXTERNAL (decl
) = 1;
770 DECL_NOT_REALLY_EXTERN (decl
) = 1;
772 /* Mark the VAR_DECL node representing the vtable itself as a
773 "gratuitous" one, thereby forcing dwarfout.c to ignore it. It
774 is rather important that such things be ignored because any
775 effort to actually generate DWARF for them will run into
776 trouble when/if we encounter code like:
779 struct S { virtual void member (); };
781 because the artificial declaration of the vtable itself (as
782 manufactured by the g++ front end) will say that the vtable is
783 a static member of `S' but only *after* the debug output for
784 the definition of `S' has already been output. This causes
785 grief because the DWARF entry for the definition of the vtable
786 will try to refer back to an earlier *declaration* of the
787 vtable as a static member of `S' and there won't be one. We
788 might be able to arrange to have the "vtable static member"
789 attached to the member list for `S' before the debug info for
790 `S' get written (which would solve the problem) but that would
791 require more intrusive changes to the g++ front end. */
792 DECL_IGNORED_P (decl
) = 1;
797 /* Get the VAR_DECL of the vtable for TYPE. TYPE need not be polymorphic,
798 or even complete. If this does not exist, create it. If COMPLETE is
799 nonzero, then complete the definition of it -- that will render it
800 impossible to actually build the vtable, but is useful to get at those
801 which are known to exist in the runtime. */
804 get_vtable_decl (tree type
, int complete
)
808 if (CLASSTYPE_VTABLES (type
))
809 return CLASSTYPE_VTABLES (type
);
811 decl
= build_vtable (type
, get_vtable_name (type
), vtbl_type_node
);
812 CLASSTYPE_VTABLES (type
) = decl
;
816 DECL_EXTERNAL (decl
) = 1;
817 cp_finish_decl (decl
, NULL_TREE
, false, NULL_TREE
, 0);
823 /* Build the primary virtual function table for TYPE. If BINFO is
824 non-NULL, build the vtable starting with the initial approximation
825 that it is the same as the one which is the head of the association
826 list. Returns a nonzero value if a new vtable is actually
830 build_primary_vtable (tree binfo
, tree type
)
835 decl
= get_vtable_decl (type
, /*complete=*/0);
839 if (BINFO_NEW_VTABLE_MARKED (binfo
))
840 /* We have already created a vtable for this base, so there's
841 no need to do it again. */
844 virtuals
= copy_list (BINFO_VIRTUALS (binfo
));
845 TREE_TYPE (decl
) = TREE_TYPE (get_vtbl_decl_for_binfo (binfo
));
846 DECL_SIZE (decl
) = TYPE_SIZE (TREE_TYPE (decl
));
847 DECL_SIZE_UNIT (decl
) = TYPE_SIZE_UNIT (TREE_TYPE (decl
));
851 gcc_assert (TREE_TYPE (decl
) == vtbl_type_node
);
852 virtuals
= NULL_TREE
;
855 if (GATHER_STATISTICS
)
858 n_vtable_elems
+= list_length (virtuals
);
861 /* Initialize the association list for this type, based
862 on our first approximation. */
863 BINFO_VTABLE (TYPE_BINFO (type
)) = decl
;
864 BINFO_VIRTUALS (TYPE_BINFO (type
)) = virtuals
;
865 SET_BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (type
));
869 /* Give BINFO a new virtual function table which is initialized
870 with a skeleton-copy of its original initialization. The only
871 entry that changes is the `delta' entry, so we can really
872 share a lot of structure.
874 FOR_TYPE is the most derived type which caused this table to
877 Returns nonzero if we haven't met BINFO before.
879 The order in which vtables are built (by calling this function) for
880 an object must remain the same, otherwise a binary incompatibility
884 build_secondary_vtable (tree binfo
)
886 if (BINFO_NEW_VTABLE_MARKED (binfo
))
887 /* We already created a vtable for this base. There's no need to
891 /* Remember that we've created a vtable for this BINFO, so that we
892 don't try to do so again. */
893 SET_BINFO_NEW_VTABLE_MARKED (binfo
);
895 /* Make fresh virtual list, so we can smash it later. */
896 BINFO_VIRTUALS (binfo
) = copy_list (BINFO_VIRTUALS (binfo
));
898 /* Secondary vtables are laid out as part of the same structure as
899 the primary vtable. */
900 BINFO_VTABLE (binfo
) = NULL_TREE
;
904 /* Create a new vtable for BINFO which is the hierarchy dominated by
905 T. Return nonzero if we actually created a new vtable. */
908 make_new_vtable (tree t
, tree binfo
)
910 if (binfo
== TYPE_BINFO (t
))
911 /* In this case, it is *type*'s vtable we are modifying. We start
912 with the approximation that its vtable is that of the
913 immediate base class. */
914 return build_primary_vtable (binfo
, t
);
916 /* This is our very own copy of `basetype' to play with. Later,
917 we will fill in all the virtual functions that override the
918 virtual functions in these base classes which are not defined
919 by the current type. */
920 return build_secondary_vtable (binfo
);
923 /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO
924 (which is in the hierarchy dominated by T) list FNDECL as its
925 BV_FN. DELTA is the required constant adjustment from the `this'
926 pointer where the vtable entry appears to the `this' required when
927 the function is actually called. */
930 modify_vtable_entry (tree t
,
940 if (fndecl
!= BV_FN (v
)
941 || !tree_int_cst_equal (delta
, BV_DELTA (v
)))
943 /* We need a new vtable for BINFO. */
944 if (make_new_vtable (t
, binfo
))
946 /* If we really did make a new vtable, we also made a copy
947 of the BINFO_VIRTUALS list. Now, we have to find the
948 corresponding entry in that list. */
949 *virtuals
= BINFO_VIRTUALS (binfo
);
950 while (BV_FN (*virtuals
) != BV_FN (v
))
951 *virtuals
= TREE_CHAIN (*virtuals
);
955 BV_DELTA (v
) = delta
;
956 BV_VCALL_INDEX (v
) = NULL_TREE
;
962 /* Add method METHOD to class TYPE. If USING_DECL is non-null, it is
963 the USING_DECL naming METHOD. Returns true if the method could be
964 added to the method vec. */
967 add_method (tree type
, tree method
, tree using_decl
)
971 bool template_conv_p
= false;
973 vec
<tree
, va_gc
> *method_vec
;
975 bool insert_p
= false;
979 if (method
== error_mark_node
)
982 complete_p
= COMPLETE_TYPE_P (type
);
983 conv_p
= DECL_CONV_FN_P (method
);
985 template_conv_p
= (TREE_CODE (method
) == TEMPLATE_DECL
986 && DECL_TEMPLATE_CONV_FN_P (method
));
988 method_vec
= CLASSTYPE_METHOD_VEC (type
);
991 /* Make a new method vector. We start with 8 entries. We must
992 allocate at least two (for constructors and destructors), and
993 we're going to end up with an assignment operator at some
995 vec_alloc (method_vec
, 8);
996 /* Create slots for constructors and destructors. */
997 method_vec
->quick_push (NULL_TREE
);
998 method_vec
->quick_push (NULL_TREE
);
999 CLASSTYPE_METHOD_VEC (type
) = method_vec
;
1002 /* Maintain TYPE_HAS_USER_CONSTRUCTOR, etc. */
1003 grok_special_member_properties (method
);
1005 /* Constructors and destructors go in special slots. */
1006 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (method
))
1007 slot
= CLASSTYPE_CONSTRUCTOR_SLOT
;
1008 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method
))
1010 slot
= CLASSTYPE_DESTRUCTOR_SLOT
;
1012 if (TYPE_FOR_JAVA (type
))
1014 if (!DECL_ARTIFICIAL (method
))
1015 error ("Java class %qT cannot have a destructor", type
);
1016 else if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
1017 error ("Java class %qT cannot have an implicit non-trivial "
1027 /* See if we already have an entry with this name. */
1028 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
1029 vec_safe_iterate (method_vec
, slot
, &m
);
1032 m
= OVL_CURRENT (m
);
1033 if (template_conv_p
)
1035 if (TREE_CODE (m
) == TEMPLATE_DECL
1036 && DECL_TEMPLATE_CONV_FN_P (m
))
1040 if (conv_p
&& !DECL_CONV_FN_P (m
))
1042 if (DECL_NAME (m
) == DECL_NAME (method
))
1048 && !DECL_CONV_FN_P (m
)
1049 && DECL_NAME (m
) > DECL_NAME (method
))
1053 current_fns
= insert_p
? NULL_TREE
: (*method_vec
)[slot
];
1055 /* Check to see if we've already got this method. */
1056 for (fns
= current_fns
; fns
; fns
= OVL_NEXT (fns
))
1058 tree fn
= OVL_CURRENT (fns
);
1064 if (TREE_CODE (fn
) != TREE_CODE (method
))
1067 /* [over.load] Member function declarations with the
1068 same name and the same parameter types cannot be
1069 overloaded if any of them is a static member
1070 function declaration.
1072 [over.load] Member function declarations with the same name and
1073 the same parameter-type-list as well as member function template
1074 declarations with the same name, the same parameter-type-list, and
1075 the same template parameter lists cannot be overloaded if any of
1076 them, but not all, have a ref-qualifier.
1078 [namespace.udecl] When a using-declaration brings names
1079 from a base class into a derived class scope, member
1080 functions in the derived class override and/or hide member
1081 functions with the same name and parameter types in a base
1082 class (rather than conflicting). */
1083 fn_type
= TREE_TYPE (fn
);
1084 method_type
= TREE_TYPE (method
);
1085 parms1
= TYPE_ARG_TYPES (fn_type
);
1086 parms2
= TYPE_ARG_TYPES (method_type
);
1088 /* Compare the quals on the 'this' parm. Don't compare
1089 the whole types, as used functions are treated as
1090 coming from the using class in overload resolution. */
1091 if (! DECL_STATIC_FUNCTION_P (fn
)
1092 && ! DECL_STATIC_FUNCTION_P (method
)
1093 /* Either both or neither need to be ref-qualified for
1094 differing quals to allow overloading. */
1095 && (FUNCTION_REF_QUALIFIED (fn_type
)
1096 == FUNCTION_REF_QUALIFIED (method_type
))
1097 && (type_memfn_quals (fn_type
) != type_memfn_quals (method_type
)
1098 || type_memfn_rqual (fn_type
) != type_memfn_rqual (method_type
)))
1101 /* For templates, the return type and template parameters
1102 must be identical. */
1103 if (TREE_CODE (fn
) == TEMPLATE_DECL
1104 && (!same_type_p (TREE_TYPE (fn_type
),
1105 TREE_TYPE (method_type
))
1106 || !comp_template_parms (DECL_TEMPLATE_PARMS (fn
),
1107 DECL_TEMPLATE_PARMS (method
))))
1110 if (! DECL_STATIC_FUNCTION_P (fn
))
1111 parms1
= TREE_CHAIN (parms1
);
1112 if (! DECL_STATIC_FUNCTION_P (method
))
1113 parms2
= TREE_CHAIN (parms2
);
1115 if (compparms (parms1
, parms2
)
1116 && (!DECL_CONV_FN_P (fn
)
1117 || same_type_p (TREE_TYPE (fn_type
),
1118 TREE_TYPE (method_type
))))
1120 /* For function versions, their parms and types match
1121 but they are not duplicates. Record function versions
1122 as and when they are found. extern "C" functions are
1123 not treated as versions. */
1124 if (TREE_CODE (fn
) == FUNCTION_DECL
1125 && TREE_CODE (method
) == FUNCTION_DECL
1126 && !DECL_EXTERN_C_P (fn
)
1127 && !DECL_EXTERN_C_P (method
)
1128 && targetm
.target_option
.function_versions (fn
, method
))
1130 /* Mark functions as versions if necessary. Modify the mangled
1131 decl name if necessary. */
1132 if (!DECL_FUNCTION_VERSIONED (fn
))
1134 DECL_FUNCTION_VERSIONED (fn
) = 1;
1135 if (DECL_ASSEMBLER_NAME_SET_P (fn
))
1138 if (!DECL_FUNCTION_VERSIONED (method
))
1140 DECL_FUNCTION_VERSIONED (method
) = 1;
1141 if (DECL_ASSEMBLER_NAME_SET_P (method
))
1142 mangle_decl (method
);
1144 record_function_versions (fn
, method
);
1147 if (DECL_INHERITED_CTOR_BASE (method
))
1149 if (DECL_INHERITED_CTOR_BASE (fn
))
1151 error_at (DECL_SOURCE_LOCATION (method
),
1152 "%q#D inherited from %qT", method
,
1153 DECL_INHERITED_CTOR_BASE (method
));
1154 error_at (DECL_SOURCE_LOCATION (fn
),
1155 "conflicts with version inherited from %qT",
1156 DECL_INHERITED_CTOR_BASE (fn
));
1158 /* Otherwise defer to the other function. */
1163 if (DECL_CONTEXT (fn
) == type
)
1164 /* Defer to the local function. */
1169 error ("%q+#D cannot be overloaded", method
);
1170 error ("with %q+#D", fn
);
1173 /* We don't call duplicate_decls here to merge the
1174 declarations because that will confuse things if the
1175 methods have inline definitions. In particular, we
1176 will crash while processing the definitions. */
1181 /* A class should never have more than one destructor. */
1182 if (current_fns
&& DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method
))
1185 /* Add the new binding. */
1188 overload
= ovl_cons (method
, current_fns
);
1189 OVL_USED (overload
) = true;
1192 overload
= build_overload (method
, current_fns
);
1195 TYPE_HAS_CONVERSION (type
) = 1;
1196 else if (slot
>= CLASSTYPE_FIRST_CONVERSION_SLOT
&& !complete_p
)
1197 push_class_level_binding (DECL_NAME (method
), overload
);
1203 /* We only expect to add few methods in the COMPLETE_P case, so
1204 just make room for one more method in that case. */
1206 reallocated
= vec_safe_reserve_exact (method_vec
, 1);
1208 reallocated
= vec_safe_reserve (method_vec
, 1);
1210 CLASSTYPE_METHOD_VEC (type
) = method_vec
;
1211 if (slot
== method_vec
->length ())
1212 method_vec
->quick_push (overload
);
1214 method_vec
->quick_insert (slot
, overload
);
1217 /* Replace the current slot. */
1218 (*method_vec
)[slot
] = overload
;
1222 /* Subroutines of finish_struct. */
1224 /* Change the access of FDECL to ACCESS in T. Return 1 if change was
1225 legit, otherwise return 0. */
1228 alter_access (tree t
, tree fdecl
, tree access
)
1232 if (!DECL_LANG_SPECIFIC (fdecl
))
1233 retrofit_lang_decl (fdecl
);
1235 gcc_assert (!DECL_DISCRIMINATOR_P (fdecl
));
1237 elem
= purpose_member (t
, DECL_ACCESS (fdecl
));
1240 if (TREE_VALUE (elem
) != access
)
1242 if (TREE_CODE (TREE_TYPE (fdecl
)) == FUNCTION_DECL
)
1243 error ("conflicting access specifications for method"
1244 " %q+D, ignored", TREE_TYPE (fdecl
));
1246 error ("conflicting access specifications for field %qE, ignored",
1251 /* They're changing the access to the same thing they changed
1252 it to before. That's OK. */
1258 perform_or_defer_access_check (TYPE_BINFO (t
), fdecl
, fdecl
,
1259 tf_warning_or_error
);
1260 DECL_ACCESS (fdecl
) = tree_cons (t
, access
, DECL_ACCESS (fdecl
));
1266 /* Process the USING_DECL, which is a member of T. */
1269 handle_using_decl (tree using_decl
, tree t
)
1271 tree decl
= USING_DECL_DECLS (using_decl
);
1272 tree name
= DECL_NAME (using_decl
);
1274 = TREE_PRIVATE (using_decl
) ? access_private_node
1275 : TREE_PROTECTED (using_decl
) ? access_protected_node
1276 : access_public_node
;
1277 tree flist
= NULL_TREE
;
1280 gcc_assert (!processing_template_decl
&& decl
);
1282 old_value
= lookup_member (t
, name
, /*protect=*/0, /*want_type=*/false,
1283 tf_warning_or_error
);
1286 if (is_overloaded_fn (old_value
))
1287 old_value
= OVL_CURRENT (old_value
);
1289 if (DECL_P (old_value
) && DECL_CONTEXT (old_value
) == t
)
1292 old_value
= NULL_TREE
;
1295 cp_emit_debug_info_for_using (decl
, USING_DECL_SCOPE (using_decl
));
1297 if (is_overloaded_fn (decl
))
1302 else if (is_overloaded_fn (old_value
))
1305 /* It's OK to use functions from a base when there are functions with
1306 the same name already present in the current class. */;
1309 error ("%q+D invalid in %q#T", using_decl
, t
);
1310 error (" because of local method %q+#D with same name",
1311 OVL_CURRENT (old_value
));
1315 else if (!DECL_ARTIFICIAL (old_value
))
1317 error ("%q+D invalid in %q#T", using_decl
, t
);
1318 error (" because of local member %q+#D with same name", old_value
);
1322 /* Make type T see field decl FDECL with access ACCESS. */
1324 for (; flist
; flist
= OVL_NEXT (flist
))
1326 add_method (t
, OVL_CURRENT (flist
), using_decl
);
1327 alter_access (t
, OVL_CURRENT (flist
), access
);
1330 alter_access (t
, decl
, access
);
1333 /* walk_tree callback for check_abi_tags: if the type at *TP involves any
1334 types with abi tags, add the corresponding identifiers to the VEC in
1335 *DATA and set IDENTIFIER_MARKED. */
1344 find_abi_tags_r (tree
*tp
, int */
*walk_subtrees*/
, void *data
)
1346 if (!OVERLOAD_TYPE_P (*tp
))
1349 if (tree attributes
= lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (*tp
)))
1351 struct abi_tag_data
*p
= static_cast<struct abi_tag_data
*>(data
);
1352 for (tree list
= TREE_VALUE (attributes
); list
;
1353 list
= TREE_CHAIN (list
))
1355 tree tag
= TREE_VALUE (list
);
1356 tree id
= get_identifier (TREE_STRING_POINTER (tag
));
1357 if (!IDENTIFIER_MARKED (id
))
1359 if (TYPE_P (p
->subob
))
1361 warning (OPT_Wabi_tag
, "%qT does not have the %E abi tag "
1362 "that base %qT has", p
->t
, tag
, p
->subob
);
1363 inform (location_of (p
->subob
), "%qT declared here",
1368 warning (OPT_Wabi_tag
, "%qT does not have the %E abi tag "
1369 "that %qT (used in the type of %qD) has",
1370 p
->t
, tag
, *tp
, p
->subob
);
1371 inform (location_of (p
->subob
), "%qD declared here",
1373 inform (location_of (*tp
), "%qT declared here", *tp
);
1381 /* Set IDENTIFIER_MARKED on all the ABI tags on T and its (transitively
1382 complete) template arguments. */
1385 mark_type_abi_tags (tree t
, bool val
)
1387 tree attributes
= lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (t
));
1390 for (tree list
= TREE_VALUE (attributes
); list
;
1391 list
= TREE_CHAIN (list
))
1393 tree tag
= TREE_VALUE (list
);
1394 tree id
= get_identifier (TREE_STRING_POINTER (tag
));
1395 IDENTIFIER_MARKED (id
) = val
;
1399 /* Also mark ABI tags from template arguments. */
1400 if (CLASSTYPE_TEMPLATE_INFO (t
))
1402 tree args
= CLASSTYPE_TI_ARGS (t
);
1403 for (int i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
1405 tree level
= TMPL_ARGS_LEVEL (args
, i
+1);
1406 for (int j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
1408 tree arg
= TREE_VEC_ELT (level
, j
);
1409 if (CLASS_TYPE_P (arg
))
1410 mark_type_abi_tags (arg
, val
);
1416 /* Check that class T has all the abi tags that subobject SUBOB has, or
1420 check_abi_tags (tree t
, tree subob
)
1422 mark_type_abi_tags (t
, true);
1424 tree subtype
= TYPE_P (subob
) ? subob
: TREE_TYPE (subob
);
1425 struct abi_tag_data data
= { t
, subob
};
1427 cp_walk_tree_without_duplicates (&subtype
, find_abi_tags_r
, &data
);
1429 mark_type_abi_tags (t
, false);
1432 /* Run through the base classes of T, updating CANT_HAVE_CONST_CTOR_P,
1433 and NO_CONST_ASN_REF_P. Also set flag bits in T based on
1434 properties of the bases. */
1437 check_bases (tree t
,
1438 int* cant_have_const_ctor_p
,
1439 int* no_const_asn_ref_p
)
1442 bool seen_non_virtual_nearly_empty_base_p
= 0;
1443 int seen_tm_mask
= 0;
1446 tree field
= NULL_TREE
;
1448 if (!CLASSTYPE_NON_STD_LAYOUT (t
))
1449 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
1450 if (TREE_CODE (field
) == FIELD_DECL
)
1453 for (binfo
= TYPE_BINFO (t
), i
= 0;
1454 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
1456 tree basetype
= TREE_TYPE (base_binfo
);
1458 gcc_assert (COMPLETE_TYPE_P (basetype
));
1460 if (CLASSTYPE_FINAL (basetype
))
1461 error ("cannot derive from %<final%> base %qT in derived type %qT",
1464 /* If any base class is non-literal, so is the derived class. */
1465 if (!CLASSTYPE_LITERAL_P (basetype
))
1466 CLASSTYPE_LITERAL_P (t
) = false;
1468 /* Effective C++ rule 14. We only need to check TYPE_POLYMORPHIC_P
1469 here because the case of virtual functions but non-virtual
1470 dtor is handled in finish_struct_1. */
1471 if (!TYPE_POLYMORPHIC_P (basetype
))
1472 warning (OPT_Weffc__
,
1473 "base class %q#T has a non-virtual destructor", basetype
);
1475 /* If the base class doesn't have copy constructors or
1476 assignment operators that take const references, then the
1477 derived class cannot have such a member automatically
1479 if (TYPE_HAS_COPY_CTOR (basetype
)
1480 && ! TYPE_HAS_CONST_COPY_CTOR (basetype
))
1481 *cant_have_const_ctor_p
= 1;
1482 if (TYPE_HAS_COPY_ASSIGN (basetype
)
1483 && !TYPE_HAS_CONST_COPY_ASSIGN (basetype
))
1484 *no_const_asn_ref_p
= 1;
1486 if (BINFO_VIRTUAL_P (base_binfo
))
1487 /* A virtual base does not effect nearly emptiness. */
1489 else if (CLASSTYPE_NEARLY_EMPTY_P (basetype
))
1491 if (seen_non_virtual_nearly_empty_base_p
)
1492 /* And if there is more than one nearly empty base, then the
1493 derived class is not nearly empty either. */
1494 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
1496 /* Remember we've seen one. */
1497 seen_non_virtual_nearly_empty_base_p
= 1;
1499 else if (!is_empty_class (basetype
))
1500 /* If the base class is not empty or nearly empty, then this
1501 class cannot be nearly empty. */
1502 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
1504 /* A lot of properties from the bases also apply to the derived
1506 TYPE_NEEDS_CONSTRUCTING (t
) |= TYPE_NEEDS_CONSTRUCTING (basetype
);
1507 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
1508 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (basetype
);
1509 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
)
1510 |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (basetype
)
1511 || !TYPE_HAS_COPY_ASSIGN (basetype
));
1512 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= (TYPE_HAS_COMPLEX_COPY_CTOR (basetype
)
1513 || !TYPE_HAS_COPY_CTOR (basetype
));
1514 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
)
1515 |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (basetype
);
1516 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_HAS_COMPLEX_MOVE_CTOR (basetype
);
1517 TYPE_POLYMORPHIC_P (t
) |= TYPE_POLYMORPHIC_P (basetype
);
1518 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
)
1519 |= CLASSTYPE_CONTAINS_EMPTY_CLASS_P (basetype
);
1520 TYPE_HAS_COMPLEX_DFLT (t
) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
1521 || TYPE_HAS_COMPLEX_DFLT (basetype
));
1522 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT
1523 (t
, CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
)
1524 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (basetype
));
1525 SET_CLASSTYPE_REF_FIELDS_NEED_INIT
1526 (t
, CLASSTYPE_REF_FIELDS_NEED_INIT (t
)
1527 | CLASSTYPE_REF_FIELDS_NEED_INIT (basetype
));
1529 /* A standard-layout class is a class that:
1531 * has no non-standard-layout base classes, */
1532 CLASSTYPE_NON_STD_LAYOUT (t
) |= CLASSTYPE_NON_STD_LAYOUT (basetype
);
1533 if (!CLASSTYPE_NON_STD_LAYOUT (t
))
1536 /* ...has no base classes of the same type as the first non-static
1538 if (field
&& DECL_CONTEXT (field
) == t
1539 && (same_type_ignoring_top_level_qualifiers_p
1540 (TREE_TYPE (field
), basetype
)))
1541 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
1543 /* ...either has no non-static data members in the most-derived
1544 class and at most one base class with non-static data
1545 members, or has no base classes with non-static data
1547 for (basefield
= TYPE_FIELDS (basetype
); basefield
;
1548 basefield
= DECL_CHAIN (basefield
))
1549 if (TREE_CODE (basefield
) == FIELD_DECL
)
1552 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
1559 /* Don't bother collecting tm attributes if transactional memory
1560 support is not enabled. */
1563 tree tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (basetype
));
1565 seen_tm_mask
|= tm_attr_to_mask (tm_attr
);
1568 check_abi_tags (t
, basetype
);
1571 /* If one of the base classes had TM attributes, and the current class
1572 doesn't define its own, then the current class inherits one. */
1573 if (seen_tm_mask
&& !find_tm_attribute (TYPE_ATTRIBUTES (t
)))
1575 tree tm_attr
= tm_mask_to_attr (seen_tm_mask
& -seen_tm_mask
);
1576 TYPE_ATTRIBUTES (t
) = tree_cons (tm_attr
, NULL
, TYPE_ATTRIBUTES (t
));
1580 /* Determine all the primary bases within T. Sets BINFO_PRIMARY_BASE_P for
1581 those that are primaries. Sets BINFO_LOST_PRIMARY_P for those
1582 that have had a nearly-empty virtual primary base stolen by some
1583 other base in the hierarchy. Determines CLASSTYPE_PRIMARY_BASE for
1587 determine_primary_bases (tree t
)
1590 tree primary
= NULL_TREE
;
1591 tree type_binfo
= TYPE_BINFO (t
);
1594 /* Determine the primary bases of our bases. */
1595 for (base_binfo
= TREE_CHAIN (type_binfo
); base_binfo
;
1596 base_binfo
= TREE_CHAIN (base_binfo
))
1598 tree primary
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (base_binfo
));
1600 /* See if we're the non-virtual primary of our inheritance
1602 if (!BINFO_VIRTUAL_P (base_binfo
))
1604 tree parent
= BINFO_INHERITANCE_CHAIN (base_binfo
);
1605 tree parent_primary
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (parent
));
1608 && SAME_BINFO_TYPE_P (BINFO_TYPE (base_binfo
),
1609 BINFO_TYPE (parent_primary
)))
1610 /* We are the primary binfo. */
1611 BINFO_PRIMARY_P (base_binfo
) = 1;
1613 /* Determine if we have a virtual primary base, and mark it so.
1615 if (primary
&& BINFO_VIRTUAL_P (primary
))
1617 tree this_primary
= copied_binfo (primary
, base_binfo
);
1619 if (BINFO_PRIMARY_P (this_primary
))
1620 /* Someone already claimed this base. */
1621 BINFO_LOST_PRIMARY_P (base_binfo
) = 1;
1626 BINFO_PRIMARY_P (this_primary
) = 1;
1627 BINFO_INHERITANCE_CHAIN (this_primary
) = base_binfo
;
1629 /* A virtual binfo might have been copied from within
1630 another hierarchy. As we're about to use it as a
1631 primary base, make sure the offsets match. */
1632 delta
= size_diffop_loc (input_location
,
1634 BINFO_OFFSET (base_binfo
)),
1636 BINFO_OFFSET (this_primary
)));
1638 propagate_binfo_offsets (this_primary
, delta
);
1643 /* First look for a dynamic direct non-virtual base. */
1644 for (i
= 0; BINFO_BASE_ITERATE (type_binfo
, i
, base_binfo
); i
++)
1646 tree basetype
= BINFO_TYPE (base_binfo
);
1648 if (TYPE_CONTAINS_VPTR_P (basetype
) && !BINFO_VIRTUAL_P (base_binfo
))
1650 primary
= base_binfo
;
1655 /* A "nearly-empty" virtual base class can be the primary base
1656 class, if no non-virtual polymorphic base can be found. Look for
1657 a nearly-empty virtual dynamic base that is not already a primary
1658 base of something in the hierarchy. If there is no such base,
1659 just pick the first nearly-empty virtual base. */
1661 for (base_binfo
= TREE_CHAIN (type_binfo
); base_binfo
;
1662 base_binfo
= TREE_CHAIN (base_binfo
))
1663 if (BINFO_VIRTUAL_P (base_binfo
)
1664 && CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (base_binfo
)))
1666 if (!BINFO_PRIMARY_P (base_binfo
))
1668 /* Found one that is not primary. */
1669 primary
= base_binfo
;
1673 /* Remember the first candidate. */
1674 primary
= base_binfo
;
1678 /* If we've got a primary base, use it. */
1681 tree basetype
= BINFO_TYPE (primary
);
1683 CLASSTYPE_PRIMARY_BINFO (t
) = primary
;
1684 if (BINFO_PRIMARY_P (primary
))
1685 /* We are stealing a primary base. */
1686 BINFO_LOST_PRIMARY_P (BINFO_INHERITANCE_CHAIN (primary
)) = 1;
1687 BINFO_PRIMARY_P (primary
) = 1;
1688 if (BINFO_VIRTUAL_P (primary
))
1692 BINFO_INHERITANCE_CHAIN (primary
) = type_binfo
;
1693 /* A virtual binfo might have been copied from within
1694 another hierarchy. As we're about to use it as a primary
1695 base, make sure the offsets match. */
1696 delta
= size_diffop_loc (input_location
, ssize_int (0),
1697 convert (ssizetype
, BINFO_OFFSET (primary
)));
1699 propagate_binfo_offsets (primary
, delta
);
1702 primary
= TYPE_BINFO (basetype
);
1704 TYPE_VFIELD (t
) = TYPE_VFIELD (basetype
);
1705 BINFO_VTABLE (type_binfo
) = BINFO_VTABLE (primary
);
1706 BINFO_VIRTUALS (type_binfo
) = BINFO_VIRTUALS (primary
);
1710 /* Update the variant types of T. */
1713 fixup_type_variants (tree t
)
1720 for (variants
= TYPE_NEXT_VARIANT (t
);
1722 variants
= TYPE_NEXT_VARIANT (variants
))
1724 /* These fields are in the _TYPE part of the node, not in
1725 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1726 TYPE_HAS_USER_CONSTRUCTOR (variants
) = TYPE_HAS_USER_CONSTRUCTOR (t
);
1727 TYPE_NEEDS_CONSTRUCTING (variants
) = TYPE_NEEDS_CONSTRUCTING (t
);
1728 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (variants
)
1729 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
);
1731 TYPE_POLYMORPHIC_P (variants
) = TYPE_POLYMORPHIC_P (t
);
1733 TYPE_BINFO (variants
) = TYPE_BINFO (t
);
1735 /* Copy whatever these are holding today. */
1736 TYPE_VFIELD (variants
) = TYPE_VFIELD (t
);
1737 TYPE_METHODS (variants
) = TYPE_METHODS (t
);
1738 TYPE_FIELDS (variants
) = TYPE_FIELDS (t
);
1742 /* Early variant fixups: we apply attributes at the beginning of the class
1743 definition, and we need to fix up any variants that have already been
1744 made via elaborated-type-specifier so that check_qualified_type works. */
1747 fixup_attribute_variants (tree t
)
1754 for (variants
= TYPE_NEXT_VARIANT (t
);
1756 variants
= TYPE_NEXT_VARIANT (variants
))
1758 /* These are the two fields that check_qualified_type looks at and
1759 are affected by attributes. */
1760 TYPE_ATTRIBUTES (variants
) = TYPE_ATTRIBUTES (t
);
1761 TYPE_ALIGN (variants
) = TYPE_ALIGN (t
);
1765 /* Set memoizing fields and bits of T (and its variants) for later
1769 finish_struct_bits (tree t
)
1771 /* Fix up variants (if any). */
1772 fixup_type_variants (t
);
1774 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t
)) && TYPE_POLYMORPHIC_P (t
))
1775 /* For a class w/o baseclasses, 'finish_struct' has set
1776 CLASSTYPE_PURE_VIRTUALS correctly (by definition).
1777 Similarly for a class whose base classes do not have vtables.
1778 When neither of these is true, we might have removed abstract
1779 virtuals (by providing a definition), added some (by declaring
1780 new ones), or redeclared ones from a base class. We need to
1781 recalculate what's really an abstract virtual at this point (by
1782 looking in the vtables). */
1783 get_pure_virtuals (t
);
1785 /* If this type has a copy constructor or a destructor, force its
1786 mode to be BLKmode, and force its TREE_ADDRESSABLE bit to be
1787 nonzero. This will cause it to be passed by invisible reference
1788 and prevent it from being returned in a register. */
1789 if (type_has_nontrivial_copy_init (t
)
1790 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
1793 DECL_MODE (TYPE_MAIN_DECL (t
)) = BLKmode
;
1794 for (variants
= t
; variants
; variants
= TYPE_NEXT_VARIANT (variants
))
1796 SET_TYPE_MODE (variants
, BLKmode
);
1797 TREE_ADDRESSABLE (variants
) = 1;
1802 /* Issue warnings about T having private constructors, but no friends,
1805 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
1806 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
1807 non-private static member functions. */
1810 maybe_warn_about_overly_private_class (tree t
)
1812 int has_member_fn
= 0;
1813 int has_nonprivate_method
= 0;
1816 if (!warn_ctor_dtor_privacy
1817 /* If the class has friends, those entities might create and
1818 access instances, so we should not warn. */
1819 || (CLASSTYPE_FRIEND_CLASSES (t
)
1820 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t
)))
1821 /* We will have warned when the template was declared; there's
1822 no need to warn on every instantiation. */
1823 || CLASSTYPE_TEMPLATE_INSTANTIATION (t
))
1824 /* There's no reason to even consider warning about this
1828 /* We only issue one warning, if more than one applies, because
1829 otherwise, on code like:
1832 // Oops - forgot `public:'
1838 we warn several times about essentially the same problem. */
1840 /* Check to see if all (non-constructor, non-destructor) member
1841 functions are private. (Since there are no friends or
1842 non-private statics, we can't ever call any of the private member
1844 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
1845 /* We're not interested in compiler-generated methods; they don't
1846 provide any way to call private members. */
1847 if (!DECL_ARTIFICIAL (fn
))
1849 if (!TREE_PRIVATE (fn
))
1851 if (DECL_STATIC_FUNCTION_P (fn
))
1852 /* A non-private static member function is just like a
1853 friend; it can create and invoke private member
1854 functions, and be accessed without a class
1858 has_nonprivate_method
= 1;
1859 /* Keep searching for a static member function. */
1861 else if (!DECL_CONSTRUCTOR_P (fn
) && !DECL_DESTRUCTOR_P (fn
))
1865 if (!has_nonprivate_method
&& has_member_fn
)
1867 /* There are no non-private methods, and there's at least one
1868 private member function that isn't a constructor or
1869 destructor. (If all the private members are
1870 constructors/destructors we want to use the code below that
1871 issues error messages specifically referring to
1872 constructors/destructors.) */
1874 tree binfo
= TYPE_BINFO (t
);
1876 for (i
= 0; i
!= BINFO_N_BASE_BINFOS (binfo
); i
++)
1877 if (BINFO_BASE_ACCESS (binfo
, i
) != access_private_node
)
1879 has_nonprivate_method
= 1;
1882 if (!has_nonprivate_method
)
1884 warning (OPT_Wctor_dtor_privacy
,
1885 "all member functions in class %qT are private", t
);
1890 /* Even if some of the member functions are non-private, the class
1891 won't be useful for much if all the constructors or destructors
1892 are private: such an object can never be created or destroyed. */
1893 fn
= CLASSTYPE_DESTRUCTORS (t
);
1894 if (fn
&& TREE_PRIVATE (fn
))
1896 warning (OPT_Wctor_dtor_privacy
,
1897 "%q#T only defines a private destructor and has no friends",
1902 /* Warn about classes that have private constructors and no friends. */
1903 if (TYPE_HAS_USER_CONSTRUCTOR (t
)
1904 /* Implicitly generated constructors are always public. */
1905 && (!CLASSTYPE_LAZY_DEFAULT_CTOR (t
)
1906 || !CLASSTYPE_LAZY_COPY_CTOR (t
)))
1908 int nonprivate_ctor
= 0;
1910 /* If a non-template class does not define a copy
1911 constructor, one is defined for it, enabling it to avoid
1912 this warning. For a template class, this does not
1913 happen, and so we would normally get a warning on:
1915 template <class T> class C { private: C(); };
1917 To avoid this asymmetry, we check TYPE_HAS_COPY_CTOR. All
1918 complete non-template or fully instantiated classes have this
1920 if (!TYPE_HAS_COPY_CTOR (t
))
1921 nonprivate_ctor
= 1;
1923 for (fn
= CLASSTYPE_CONSTRUCTORS (t
); fn
; fn
= OVL_NEXT (fn
))
1925 tree ctor
= OVL_CURRENT (fn
);
1926 /* Ideally, we wouldn't count copy constructors (or, in
1927 fact, any constructor that takes an argument of the
1928 class type as a parameter) because such things cannot
1929 be used to construct an instance of the class unless
1930 you already have one. But, for now at least, we're
1932 if (! TREE_PRIVATE (ctor
))
1934 nonprivate_ctor
= 1;
1939 if (nonprivate_ctor
== 0)
1941 warning (OPT_Wctor_dtor_privacy
,
1942 "%q#T only defines private constructors and has no friends",
1950 gt_pointer_operator new_value
;
1954 /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */
1957 method_name_cmp (const void* m1_p
, const void* m2_p
)
1959 const tree
*const m1
= (const tree
*) m1_p
;
1960 const tree
*const m2
= (const tree
*) m2_p
;
1962 if (*m1
== NULL_TREE
&& *m2
== NULL_TREE
)
1964 if (*m1
== NULL_TREE
)
1966 if (*m2
== NULL_TREE
)
1968 if (DECL_NAME (OVL_CURRENT (*m1
)) < DECL_NAME (OVL_CURRENT (*m2
)))
1973 /* This routine compares two fields like method_name_cmp but using the
1974 pointer operator in resort_field_decl_data. */
1977 resort_method_name_cmp (const void* m1_p
, const void* m2_p
)
1979 const tree
*const m1
= (const tree
*) m1_p
;
1980 const tree
*const m2
= (const tree
*) m2_p
;
1981 if (*m1
== NULL_TREE
&& *m2
== NULL_TREE
)
1983 if (*m1
== NULL_TREE
)
1985 if (*m2
== NULL_TREE
)
1988 tree d1
= DECL_NAME (OVL_CURRENT (*m1
));
1989 tree d2
= DECL_NAME (OVL_CURRENT (*m2
));
1990 resort_data
.new_value (&d1
, resort_data
.cookie
);
1991 resort_data
.new_value (&d2
, resort_data
.cookie
);
1998 /* Resort TYPE_METHOD_VEC because pointers have been reordered. */
2001 resort_type_method_vec (void* obj
,
2003 gt_pointer_operator new_value
,
2006 vec
<tree
, va_gc
> *method_vec
= (vec
<tree
, va_gc
> *) obj
;
2007 int len
= vec_safe_length (method_vec
);
2011 /* The type conversion ops have to live at the front of the vec, so we
2013 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2014 vec_safe_iterate (method_vec
, slot
, &fn
);
2016 if (!DECL_CONV_FN_P (OVL_CURRENT (fn
)))
2021 resort_data
.new_value
= new_value
;
2022 resort_data
.cookie
= cookie
;
2023 qsort (method_vec
->address () + slot
, len
- slot
, sizeof (tree
),
2024 resort_method_name_cmp
);
2028 /* Warn about duplicate methods in fn_fields.
2030 Sort methods that are not special (i.e., constructors, destructors,
2031 and type conversion operators) so that we can find them faster in
2035 finish_struct_methods (tree t
)
2038 vec
<tree
, va_gc
> *method_vec
;
2041 method_vec
= CLASSTYPE_METHOD_VEC (t
);
2045 len
= method_vec
->length ();
2047 /* Clear DECL_IN_AGGR_P for all functions. */
2048 for (fn_fields
= TYPE_METHODS (t
); fn_fields
;
2049 fn_fields
= DECL_CHAIN (fn_fields
))
2050 DECL_IN_AGGR_P (fn_fields
) = 0;
2052 /* Issue warnings about private constructors and such. If there are
2053 no methods, then some public defaults are generated. */
2054 maybe_warn_about_overly_private_class (t
);
2056 /* The type conversion ops have to live at the front of the vec, so we
2058 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2059 method_vec
->iterate (slot
, &fn_fields
);
2061 if (!DECL_CONV_FN_P (OVL_CURRENT (fn_fields
)))
2064 qsort (method_vec
->address () + slot
,
2065 len
-slot
, sizeof (tree
), method_name_cmp
);
2068 /* Make BINFO's vtable have N entries, including RTTI entries,
2069 vbase and vcall offsets, etc. Set its type and call the back end
2073 layout_vtable_decl (tree binfo
, int n
)
2078 atype
= build_array_of_n_type (vtable_entry_type
, n
);
2079 layout_type (atype
);
2081 /* We may have to grow the vtable. */
2082 vtable
= get_vtbl_decl_for_binfo (binfo
);
2083 if (!same_type_p (TREE_TYPE (vtable
), atype
))
2085 TREE_TYPE (vtable
) = atype
;
2086 DECL_SIZE (vtable
) = DECL_SIZE_UNIT (vtable
) = NULL_TREE
;
2087 layout_decl (vtable
, 0);
2091 /* True iff FNDECL and BASE_FNDECL (both non-static member functions)
2092 have the same signature. */
2095 same_signature_p (const_tree fndecl
, const_tree base_fndecl
)
2097 /* One destructor overrides another if they are the same kind of
2099 if (DECL_DESTRUCTOR_P (base_fndecl
) && DECL_DESTRUCTOR_P (fndecl
)
2100 && special_function_p (base_fndecl
) == special_function_p (fndecl
))
2102 /* But a non-destructor never overrides a destructor, nor vice
2103 versa, nor do different kinds of destructors override
2104 one-another. For example, a complete object destructor does not
2105 override a deleting destructor. */
2106 if (DECL_DESTRUCTOR_P (base_fndecl
) || DECL_DESTRUCTOR_P (fndecl
))
2109 if (DECL_NAME (fndecl
) == DECL_NAME (base_fndecl
)
2110 || (DECL_CONV_FN_P (fndecl
)
2111 && DECL_CONV_FN_P (base_fndecl
)
2112 && same_type_p (DECL_CONV_FN_TYPE (fndecl
),
2113 DECL_CONV_FN_TYPE (base_fndecl
))))
2115 tree fntype
= TREE_TYPE (fndecl
);
2116 tree base_fntype
= TREE_TYPE (base_fndecl
);
2117 if (type_memfn_quals (fntype
) == type_memfn_quals (base_fntype
)
2118 && type_memfn_rqual (fntype
) == type_memfn_rqual (base_fntype
)
2119 && compparms (FUNCTION_FIRST_USER_PARMTYPE (fndecl
),
2120 FUNCTION_FIRST_USER_PARMTYPE (base_fndecl
)))
2126 /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a
2130 base_derived_from (tree derived
, tree base
)
2134 for (probe
= base
; probe
; probe
= BINFO_INHERITANCE_CHAIN (probe
))
2136 if (probe
== derived
)
2138 else if (BINFO_VIRTUAL_P (probe
))
2139 /* If we meet a virtual base, we can't follow the inheritance
2140 any more. See if the complete type of DERIVED contains
2141 such a virtual base. */
2142 return (binfo_for_vbase (BINFO_TYPE (probe
), BINFO_TYPE (derived
))
2148 typedef struct find_final_overrider_data_s
{
2149 /* The function for which we are trying to find a final overrider. */
2151 /* The base class in which the function was declared. */
2152 tree declaring_base
;
2153 /* The candidate overriders. */
2155 /* Path to most derived. */
2157 } find_final_overrider_data
;
2159 /* Add the overrider along the current path to FFOD->CANDIDATES.
2160 Returns true if an overrider was found; false otherwise. */
2163 dfs_find_final_overrider_1 (tree binfo
,
2164 find_final_overrider_data
*ffod
,
2169 /* If BINFO is not the most derived type, try a more derived class.
2170 A definition there will overrider a definition here. */
2174 if (dfs_find_final_overrider_1
2175 (ffod
->path
[depth
], ffod
, depth
))
2179 method
= look_for_overrides_here (BINFO_TYPE (binfo
), ffod
->fn
);
2182 tree
*candidate
= &ffod
->candidates
;
2184 /* Remove any candidates overridden by this new function. */
2187 /* If *CANDIDATE overrides METHOD, then METHOD
2188 cannot override anything else on the list. */
2189 if (base_derived_from (TREE_VALUE (*candidate
), binfo
))
2191 /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */
2192 if (base_derived_from (binfo
, TREE_VALUE (*candidate
)))
2193 *candidate
= TREE_CHAIN (*candidate
);
2195 candidate
= &TREE_CHAIN (*candidate
);
2198 /* Add the new function. */
2199 ffod
->candidates
= tree_cons (method
, binfo
, ffod
->candidates
);
2206 /* Called from find_final_overrider via dfs_walk. */
2209 dfs_find_final_overrider_pre (tree binfo
, void *data
)
2211 find_final_overrider_data
*ffod
= (find_final_overrider_data
*) data
;
2213 if (binfo
== ffod
->declaring_base
)
2214 dfs_find_final_overrider_1 (binfo
, ffod
, ffod
->path
.length ());
2215 ffod
->path
.safe_push (binfo
);
2221 dfs_find_final_overrider_post (tree
/*binfo*/, void *data
)
2223 find_final_overrider_data
*ffod
= (find_final_overrider_data
*) data
;
2229 /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for
2230 FN and whose TREE_VALUE is the binfo for the base where the
2231 overriding occurs. BINFO (in the hierarchy dominated by the binfo
2232 DERIVED) is the base object in which FN is declared. */
2235 find_final_overrider (tree derived
, tree binfo
, tree fn
)
2237 find_final_overrider_data ffod
;
2239 /* Getting this right is a little tricky. This is valid:
2241 struct S { virtual void f (); };
2242 struct T { virtual void f (); };
2243 struct U : public S, public T { };
2245 even though calling `f' in `U' is ambiguous. But,
2247 struct R { virtual void f(); };
2248 struct S : virtual public R { virtual void f (); };
2249 struct T : virtual public R { virtual void f (); };
2250 struct U : public S, public T { };
2252 is not -- there's no way to decide whether to put `S::f' or
2253 `T::f' in the vtable for `R'.
2255 The solution is to look at all paths to BINFO. If we find
2256 different overriders along any two, then there is a problem. */
2257 if (DECL_THUNK_P (fn
))
2258 fn
= THUNK_TARGET (fn
);
2260 /* Determine the depth of the hierarchy. */
2262 ffod
.declaring_base
= binfo
;
2263 ffod
.candidates
= NULL_TREE
;
2264 ffod
.path
.create (30);
2266 dfs_walk_all (derived
, dfs_find_final_overrider_pre
,
2267 dfs_find_final_overrider_post
, &ffod
);
2269 ffod
.path
.release ();
2271 /* If there was no winner, issue an error message. */
2272 if (!ffod
.candidates
|| TREE_CHAIN (ffod
.candidates
))
2273 return error_mark_node
;
2275 return ffod
.candidates
;
2278 /* Return the index of the vcall offset for FN when TYPE is used as a
2282 get_vcall_index (tree fn
, tree type
)
2284 vec
<tree_pair_s
, va_gc
> *indices
= CLASSTYPE_VCALL_INDICES (type
);
2288 FOR_EACH_VEC_SAFE_ELT (indices
, ix
, p
)
2289 if ((DECL_DESTRUCTOR_P (fn
) && DECL_DESTRUCTOR_P (p
->purpose
))
2290 || same_signature_p (fn
, p
->purpose
))
2293 /* There should always be an appropriate index. */
2297 /* Update an entry in the vtable for BINFO, which is in the hierarchy
2298 dominated by T. FN is the old function; VIRTUALS points to the
2299 corresponding position in the new BINFO_VIRTUALS list. IX is the index
2300 of that entry in the list. */
2303 update_vtable_entry_for_fn (tree t
, tree binfo
, tree fn
, tree
* virtuals
,
2311 tree overrider_fn
, overrider_target
;
2312 tree target_fn
= DECL_THUNK_P (fn
) ? THUNK_TARGET (fn
) : fn
;
2313 tree over_return
, base_return
;
2316 /* Find the nearest primary base (possibly binfo itself) which defines
2317 this function; this is the class the caller will convert to when
2318 calling FN through BINFO. */
2319 for (b
= binfo
; ; b
= get_primary_binfo (b
))
2322 if (look_for_overrides_here (BINFO_TYPE (b
), target_fn
))
2325 /* The nearest definition is from a lost primary. */
2326 if (BINFO_LOST_PRIMARY_P (b
))
2331 /* Find the final overrider. */
2332 overrider
= find_final_overrider (TYPE_BINFO (t
), b
, target_fn
);
2333 if (overrider
== error_mark_node
)
2335 error ("no unique final overrider for %qD in %qT", target_fn
, t
);
2338 overrider_target
= overrider_fn
= TREE_PURPOSE (overrider
);
2340 /* Check for adjusting covariant return types. */
2341 over_return
= TREE_TYPE (TREE_TYPE (overrider_target
));
2342 base_return
= TREE_TYPE (TREE_TYPE (target_fn
));
2344 if (POINTER_TYPE_P (over_return
)
2345 && TREE_CODE (over_return
) == TREE_CODE (base_return
)
2346 && CLASS_TYPE_P (TREE_TYPE (over_return
))
2347 && CLASS_TYPE_P (TREE_TYPE (base_return
))
2348 /* If the overrider is invalid, don't even try. */
2349 && !DECL_INVALID_OVERRIDER_P (overrider_target
))
2351 /* If FN is a covariant thunk, we must figure out the adjustment
2352 to the final base FN was converting to. As OVERRIDER_TARGET might
2353 also be converting to the return type of FN, we have to
2354 combine the two conversions here. */
2355 tree fixed_offset
, virtual_offset
;
2357 over_return
= TREE_TYPE (over_return
);
2358 base_return
= TREE_TYPE (base_return
);
2360 if (DECL_THUNK_P (fn
))
2362 gcc_assert (DECL_RESULT_THUNK_P (fn
));
2363 fixed_offset
= ssize_int (THUNK_FIXED_OFFSET (fn
));
2364 virtual_offset
= THUNK_VIRTUAL_OFFSET (fn
);
2367 fixed_offset
= virtual_offset
= NULL_TREE
;
2370 /* Find the equivalent binfo within the return type of the
2371 overriding function. We will want the vbase offset from
2373 virtual_offset
= binfo_for_vbase (BINFO_TYPE (virtual_offset
),
2375 else if (!same_type_ignoring_top_level_qualifiers_p
2376 (over_return
, base_return
))
2378 /* There was no existing virtual thunk (which takes
2379 precedence). So find the binfo of the base function's
2380 return type within the overriding function's return type.
2381 We cannot call lookup base here, because we're inside a
2382 dfs_walk, and will therefore clobber the BINFO_MARKED
2383 flags. Fortunately we know the covariancy is valid (it
2384 has already been checked), so we can just iterate along
2385 the binfos, which have been chained in inheritance graph
2386 order. Of course it is lame that we have to repeat the
2387 search here anyway -- we should really be caching pieces
2388 of the vtable and avoiding this repeated work. */
2389 tree thunk_binfo
, base_binfo
;
2391 /* Find the base binfo within the overriding function's
2392 return type. We will always find a thunk_binfo, except
2393 when the covariancy is invalid (which we will have
2394 already diagnosed). */
2395 for (base_binfo
= TYPE_BINFO (base_return
),
2396 thunk_binfo
= TYPE_BINFO (over_return
);
2398 thunk_binfo
= TREE_CHAIN (thunk_binfo
))
2399 if (SAME_BINFO_TYPE_P (BINFO_TYPE (thunk_binfo
),
2400 BINFO_TYPE (base_binfo
)))
2403 /* See if virtual inheritance is involved. */
2404 for (virtual_offset
= thunk_binfo
;
2406 virtual_offset
= BINFO_INHERITANCE_CHAIN (virtual_offset
))
2407 if (BINFO_VIRTUAL_P (virtual_offset
))
2411 || (thunk_binfo
&& !BINFO_OFFSET_ZEROP (thunk_binfo
)))
2413 tree offset
= convert (ssizetype
, BINFO_OFFSET (thunk_binfo
));
2417 /* We convert via virtual base. Adjust the fixed
2418 offset to be from there. */
2420 size_diffop (offset
,
2422 BINFO_OFFSET (virtual_offset
)));
2425 /* There was an existing fixed offset, this must be
2426 from the base just converted to, and the base the
2427 FN was thunking to. */
2428 fixed_offset
= size_binop (PLUS_EXPR
, fixed_offset
, offset
);
2430 fixed_offset
= offset
;
2434 if (fixed_offset
|| virtual_offset
)
2435 /* Replace the overriding function with a covariant thunk. We
2436 will emit the overriding function in its own slot as
2438 overrider_fn
= make_thunk (overrider_target
, /*this_adjusting=*/0,
2439 fixed_offset
, virtual_offset
);
2442 gcc_assert (DECL_INVALID_OVERRIDER_P (overrider_target
) ||
2443 !DECL_THUNK_P (fn
));
2445 /* If we need a covariant thunk, then we may need to adjust first_defn.
2446 The ABI specifies that the thunks emitted with a function are
2447 determined by which bases the function overrides, so we need to be
2448 sure that we're using a thunk for some overridden base; even if we
2449 know that the necessary this adjustment is zero, there may not be an
2450 appropriate zero-this-adjusment thunk for us to use since thunks for
2451 overriding virtual bases always use the vcall offset.
2453 Furthermore, just choosing any base that overrides this function isn't
2454 quite right, as this slot won't be used for calls through a type that
2455 puts a covariant thunk here. Calling the function through such a type
2456 will use a different slot, and that slot is the one that determines
2457 the thunk emitted for that base.
2459 So, keep looking until we find the base that we're really overriding
2460 in this slot: the nearest primary base that doesn't use a covariant
2461 thunk in this slot. */
2462 if (overrider_target
!= overrider_fn
)
2464 if (BINFO_TYPE (b
) == DECL_CONTEXT (overrider_target
))
2465 /* We already know that the overrider needs a covariant thunk. */
2466 b
= get_primary_binfo (b
);
2467 for (; ; b
= get_primary_binfo (b
))
2469 tree main_binfo
= TYPE_BINFO (BINFO_TYPE (b
));
2470 tree bv
= chain_index (ix
, BINFO_VIRTUALS (main_binfo
));
2471 if (!DECL_THUNK_P (TREE_VALUE (bv
)))
2473 if (BINFO_LOST_PRIMARY_P (b
))
2479 /* Assume that we will produce a thunk that convert all the way to
2480 the final overrider, and not to an intermediate virtual base. */
2481 virtual_base
= NULL_TREE
;
2483 /* See if we can convert to an intermediate virtual base first, and then
2484 use the vcall offset located there to finish the conversion. */
2485 for (; b
; b
= BINFO_INHERITANCE_CHAIN (b
))
2487 /* If we find the final overrider, then we can stop
2489 if (SAME_BINFO_TYPE_P (BINFO_TYPE (b
),
2490 BINFO_TYPE (TREE_VALUE (overrider
))))
2493 /* If we find a virtual base, and we haven't yet found the
2494 overrider, then there is a virtual base between the
2495 declaring base (first_defn) and the final overrider. */
2496 if (BINFO_VIRTUAL_P (b
))
2503 /* Compute the constant adjustment to the `this' pointer. The
2504 `this' pointer, when this function is called, will point at BINFO
2505 (or one of its primary bases, which are at the same offset). */
2507 /* The `this' pointer needs to be adjusted from the declaration to
2508 the nearest virtual base. */
2509 delta
= size_diffop_loc (input_location
,
2510 convert (ssizetype
, BINFO_OFFSET (virtual_base
)),
2511 convert (ssizetype
, BINFO_OFFSET (first_defn
)));
2513 /* If the nearest definition is in a lost primary, we don't need an
2514 entry in our vtable. Except possibly in a constructor vtable,
2515 if we happen to get our primary back. In that case, the offset
2516 will be zero, as it will be a primary base. */
2517 delta
= size_zero_node
;
2519 /* The `this' pointer needs to be adjusted from pointing to
2520 BINFO to pointing at the base where the final overrider
2522 delta
= size_diffop_loc (input_location
,
2524 BINFO_OFFSET (TREE_VALUE (overrider
))),
2525 convert (ssizetype
, BINFO_OFFSET (binfo
)));
2527 modify_vtable_entry (t
, binfo
, overrider_fn
, delta
, virtuals
);
2530 BV_VCALL_INDEX (*virtuals
)
2531 = get_vcall_index (overrider_target
, BINFO_TYPE (virtual_base
));
2533 BV_VCALL_INDEX (*virtuals
) = NULL_TREE
;
2535 BV_LOST_PRIMARY (*virtuals
) = lost
;
2538 /* Called from modify_all_vtables via dfs_walk. */
2541 dfs_modify_vtables (tree binfo
, void* data
)
2543 tree t
= (tree
) data
;
2548 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
2549 /* A base without a vtable needs no modification, and its bases
2550 are uninteresting. */
2551 return dfs_skip_bases
;
2553 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
)
2554 && !CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
2555 /* Don't do the primary vtable, if it's new. */
2558 if (BINFO_PRIMARY_P (binfo
) && !BINFO_VIRTUAL_P (binfo
))
2559 /* There's no need to modify the vtable for a non-virtual primary
2560 base; we're not going to use that vtable anyhow. We do still
2561 need to do this for virtual primary bases, as they could become
2562 non-primary in a construction vtable. */
2565 make_new_vtable (t
, binfo
);
2567 /* Now, go through each of the virtual functions in the virtual
2568 function table for BINFO. Find the final overrider, and update
2569 the BINFO_VIRTUALS list appropriately. */
2570 for (ix
= 0, virtuals
= BINFO_VIRTUALS (binfo
),
2571 old_virtuals
= BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo
)));
2573 ix
++, virtuals
= TREE_CHAIN (virtuals
),
2574 old_virtuals
= TREE_CHAIN (old_virtuals
))
2575 update_vtable_entry_for_fn (t
,
2577 BV_FN (old_virtuals
),
2583 /* Update all of the primary and secondary vtables for T. Create new
2584 vtables as required, and initialize their RTTI information. Each
2585 of the functions in VIRTUALS is declared in T and may override a
2586 virtual function from a base class; find and modify the appropriate
2587 entries to point to the overriding functions. Returns a list, in
2588 declaration order, of the virtual functions that are declared in T,
2589 but do not appear in the primary base class vtable, and which
2590 should therefore be appended to the end of the vtable for T. */
2593 modify_all_vtables (tree t
, tree virtuals
)
2595 tree binfo
= TYPE_BINFO (t
);
2598 /* Mangle the vtable name before entering dfs_walk (c++/51884). */
2599 if (TYPE_CONTAINS_VPTR_P (t
))
2600 get_vtable_decl (t
, false);
2602 /* Update all of the vtables. */
2603 dfs_walk_once (binfo
, dfs_modify_vtables
, NULL
, t
);
2605 /* Add virtual functions not already in our primary vtable. These
2606 will be both those introduced by this class, and those overridden
2607 from secondary bases. It does not include virtuals merely
2608 inherited from secondary bases. */
2609 for (fnsp
= &virtuals
; *fnsp
; )
2611 tree fn
= TREE_VALUE (*fnsp
);
2613 if (!value_member (fn
, BINFO_VIRTUALS (binfo
))
2614 || DECL_VINDEX (fn
) == error_mark_node
)
2616 /* We don't need to adjust the `this' pointer when
2617 calling this function. */
2618 BV_DELTA (*fnsp
) = integer_zero_node
;
2619 BV_VCALL_INDEX (*fnsp
) = NULL_TREE
;
2621 /* This is a function not already in our vtable. Keep it. */
2622 fnsp
= &TREE_CHAIN (*fnsp
);
2625 /* We've already got an entry for this function. Skip it. */
2626 *fnsp
= TREE_CHAIN (*fnsp
);
2632 /* Get the base virtual function declarations in T that have the
2636 get_basefndecls (tree name
, tree t
)
2639 tree base_fndecls
= NULL_TREE
;
2640 int n_baseclasses
= BINFO_N_BASE_BINFOS (TYPE_BINFO (t
));
2643 /* Find virtual functions in T with the indicated NAME. */
2644 i
= lookup_fnfields_1 (t
, name
);
2646 for (methods
= (*CLASSTYPE_METHOD_VEC (t
))[i
];
2648 methods
= OVL_NEXT (methods
))
2650 tree method
= OVL_CURRENT (methods
);
2652 if (TREE_CODE (method
) == FUNCTION_DECL
2653 && DECL_VINDEX (method
))
2654 base_fndecls
= tree_cons (NULL_TREE
, method
, base_fndecls
);
2658 return base_fndecls
;
2660 for (i
= 0; i
< n_baseclasses
; i
++)
2662 tree basetype
= BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (t
), i
));
2663 base_fndecls
= chainon (get_basefndecls (name
, basetype
),
2667 return base_fndecls
;
2670 /* If this declaration supersedes the declaration of
2671 a method declared virtual in the base class, then
2672 mark this field as being virtual as well. */
2675 check_for_override (tree decl
, tree ctype
)
2677 bool overrides_found
= false;
2678 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2679 /* In [temp.mem] we have:
2681 A specialization of a member function template does not
2682 override a virtual function from a base class. */
2684 if ((DECL_DESTRUCTOR_P (decl
)
2685 || IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
))
2686 || DECL_CONV_FN_P (decl
))
2687 && look_for_overrides (ctype
, decl
)
2688 && !DECL_STATIC_FUNCTION_P (decl
))
2689 /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor
2690 the error_mark_node so that we know it is an overriding
2693 DECL_VINDEX (decl
) = decl
;
2694 overrides_found
= true;
2697 if (DECL_VIRTUAL_P (decl
))
2699 if (!DECL_VINDEX (decl
))
2700 DECL_VINDEX (decl
) = error_mark_node
;
2701 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
2702 if (DECL_DESTRUCTOR_P (decl
))
2703 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (ctype
) = true;
2705 else if (DECL_FINAL_P (decl
))
2706 error ("%q+#D marked final, but is not virtual", decl
);
2707 if (DECL_OVERRIDE_P (decl
) && !overrides_found
)
2708 error ("%q+#D marked override, but does not override", decl
);
2711 /* Warn about hidden virtual functions that are not overridden in t.
2712 We know that constructors and destructors don't apply. */
2715 warn_hidden (tree t
)
2717 vec
<tree
, va_gc
> *method_vec
= CLASSTYPE_METHOD_VEC (t
);
2721 /* We go through each separately named virtual function. */
2722 for (i
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2723 vec_safe_iterate (method_vec
, i
, &fns
);
2734 /* All functions in this slot in the CLASSTYPE_METHOD_VEC will
2735 have the same name. Figure out what name that is. */
2736 name
= DECL_NAME (OVL_CURRENT (fns
));
2737 /* There are no possibly hidden functions yet. */
2738 base_fndecls
= NULL_TREE
;
2739 /* Iterate through all of the base classes looking for possibly
2740 hidden functions. */
2741 for (binfo
= TYPE_BINFO (t
), j
= 0;
2742 BINFO_BASE_ITERATE (binfo
, j
, base_binfo
); j
++)
2744 tree basetype
= BINFO_TYPE (base_binfo
);
2745 base_fndecls
= chainon (get_basefndecls (name
, basetype
),
2749 /* If there are no functions to hide, continue. */
2753 /* Remove any overridden functions. */
2754 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
2756 fndecl
= OVL_CURRENT (fn
);
2757 if (DECL_VINDEX (fndecl
))
2759 tree
*prev
= &base_fndecls
;
2762 /* If the method from the base class has the same
2763 signature as the method from the derived class, it
2764 has been overridden. */
2765 if (same_signature_p (fndecl
, TREE_VALUE (*prev
)))
2766 *prev
= TREE_CHAIN (*prev
);
2768 prev
= &TREE_CHAIN (*prev
);
2772 /* Now give a warning for all base functions without overriders,
2773 as they are hidden. */
2774 while (base_fndecls
)
2776 /* Here we know it is a hider, and no overrider exists. */
2777 warning (OPT_Woverloaded_virtual
, "%q+D was hidden", TREE_VALUE (base_fndecls
));
2778 warning (OPT_Woverloaded_virtual
, " by %q+D", fns
);
2779 base_fndecls
= TREE_CHAIN (base_fndecls
);
2784 /* Recursive helper for finish_struct_anon. */
2787 finish_struct_anon_r (tree field
, bool complain
)
2789 bool is_union
= TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
;
2790 tree elt
= TYPE_FIELDS (TREE_TYPE (field
));
2791 for (; elt
; elt
= DECL_CHAIN (elt
))
2793 /* We're generally only interested in entities the user
2794 declared, but we also find nested classes by noticing
2795 the TYPE_DECL that we create implicitly. You're
2796 allowed to put one anonymous union inside another,
2797 though, so we explicitly tolerate that. We use
2798 TYPE_ANONYMOUS_P rather than ANON_AGGR_TYPE_P so that
2799 we also allow unnamed types used for defining fields. */
2800 if (DECL_ARTIFICIAL (elt
)
2801 && (!DECL_IMPLICIT_TYPEDEF_P (elt
)
2802 || TYPE_ANONYMOUS_P (TREE_TYPE (elt
))))
2805 if (TREE_CODE (elt
) != FIELD_DECL
)
2810 permerror (input_location
,
2811 "%q+#D invalid; an anonymous union can "
2812 "only have non-static data members", elt
);
2814 permerror (input_location
,
2815 "%q+#D invalid; an anonymous struct can "
2816 "only have non-static data members", elt
);
2823 if (TREE_PRIVATE (elt
))
2826 permerror (input_location
,
2827 "private member %q+#D in anonymous union", elt
);
2829 permerror (input_location
,
2830 "private member %q+#D in anonymous struct", elt
);
2832 else if (TREE_PROTECTED (elt
))
2835 permerror (input_location
,
2836 "protected member %q+#D in anonymous union", elt
);
2838 permerror (input_location
,
2839 "protected member %q+#D in anonymous struct", elt
);
2843 TREE_PRIVATE (elt
) = TREE_PRIVATE (field
);
2844 TREE_PROTECTED (elt
) = TREE_PROTECTED (field
);
2846 /* Recurse into the anonymous aggregates to handle correctly
2847 access control (c++/24926):
2858 if (DECL_NAME (elt
) == NULL_TREE
2859 && ANON_AGGR_TYPE_P (TREE_TYPE (elt
)))
2860 finish_struct_anon_r (elt
, /*complain=*/false);
2864 /* Check for things that are invalid. There are probably plenty of other
2865 things we should check for also. */
2868 finish_struct_anon (tree t
)
2870 for (tree field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
2872 if (TREE_STATIC (field
))
2874 if (TREE_CODE (field
) != FIELD_DECL
)
2877 if (DECL_NAME (field
) == NULL_TREE
2878 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2879 finish_struct_anon_r (field
, /*complain=*/true);
2883 /* Add T to CLASSTYPE_DECL_LIST of current_class_type which
2884 will be used later during class template instantiation.
2885 When FRIEND_P is zero, T can be a static member data (VAR_DECL),
2886 a non-static member data (FIELD_DECL), a member function
2887 (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE),
2888 a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL)
2889 When FRIEND_P is nonzero, T is either a friend class
2890 (RECORD_TYPE, TEMPLATE_DECL) or a friend function
2891 (FUNCTION_DECL, TEMPLATE_DECL). */
2894 maybe_add_class_template_decl_list (tree type
, tree t
, int friend_p
)
2896 /* Save some memory by not creating TREE_LIST if TYPE is not template. */
2897 if (CLASSTYPE_TEMPLATE_INFO (type
))
2898 CLASSTYPE_DECL_LIST (type
)
2899 = tree_cons (friend_p
? NULL_TREE
: type
,
2900 t
, CLASSTYPE_DECL_LIST (type
));
2903 /* This function is called from declare_virt_assop_and_dtor via
2906 DATA is a type that direcly or indirectly inherits the base
2907 represented by BINFO. If BINFO contains a virtual assignment [copy
2908 assignment or move assigment] operator or a virtual constructor,
2909 declare that function in DATA if it hasn't been already declared. */
2912 dfs_declare_virt_assop_and_dtor (tree binfo
, void *data
)
2914 tree bv
, fn
, t
= (tree
)data
;
2915 tree opname
= ansi_assopname (NOP_EXPR
);
2917 gcc_assert (t
&& CLASS_TYPE_P (t
));
2918 gcc_assert (binfo
&& TREE_CODE (binfo
) == TREE_BINFO
);
2920 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
2921 /* A base without a vtable needs no modification, and its bases
2922 are uninteresting. */
2923 return dfs_skip_bases
;
2925 if (BINFO_PRIMARY_P (binfo
))
2926 /* If this is a primary base, then we have already looked at the
2927 virtual functions of its vtable. */
2930 for (bv
= BINFO_VIRTUALS (binfo
); bv
; bv
= TREE_CHAIN (bv
))
2934 if (DECL_NAME (fn
) == opname
)
2936 if (CLASSTYPE_LAZY_COPY_ASSIGN (t
))
2937 lazily_declare_fn (sfk_copy_assignment
, t
);
2938 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
2939 lazily_declare_fn (sfk_move_assignment
, t
);
2941 else if (DECL_DESTRUCTOR_P (fn
)
2942 && CLASSTYPE_LAZY_DESTRUCTOR (t
))
2943 lazily_declare_fn (sfk_destructor
, t
);
2949 /* If the class type T has a direct or indirect base that contains a
2950 virtual assignment operator or a virtual destructor, declare that
2951 function in T if it hasn't been already declared. */
2954 declare_virt_assop_and_dtor (tree t
)
2956 if (!(TYPE_POLYMORPHIC_P (t
)
2957 && (CLASSTYPE_LAZY_COPY_ASSIGN (t
)
2958 || CLASSTYPE_LAZY_MOVE_ASSIGN (t
)
2959 || CLASSTYPE_LAZY_DESTRUCTOR (t
))))
2962 dfs_walk_all (TYPE_BINFO (t
),
2963 dfs_declare_virt_assop_and_dtor
,
2967 /* Declare the inheriting constructor for class T inherited from base
2968 constructor CTOR with the parameter array PARMS of size NPARMS. */
2971 one_inheriting_sig (tree t
, tree ctor
, tree
*parms
, int nparms
)
2973 /* We don't declare an inheriting ctor that would be a default,
2974 copy or move ctor for derived or base. */
2978 && TREE_CODE (parms
[0]) == REFERENCE_TYPE
)
2980 tree parm
= TYPE_MAIN_VARIANT (TREE_TYPE (parms
[0]));
2981 if (parm
== t
|| parm
== DECL_CONTEXT (ctor
))
2985 tree parmlist
= void_list_node
;
2986 for (int i
= nparms
- 1; i
>= 0; i
--)
2987 parmlist
= tree_cons (NULL_TREE
, parms
[i
], parmlist
);
2988 tree fn
= implicitly_declare_fn (sfk_inheriting_constructor
,
2989 t
, false, ctor
, parmlist
);
2990 if (add_method (t
, fn
, NULL_TREE
))
2992 DECL_CHAIN (fn
) = TYPE_METHODS (t
);
2993 TYPE_METHODS (t
) = fn
;
2997 /* Declare all the inheriting constructors for class T inherited from base
2998 constructor CTOR. */
3001 one_inherited_ctor (tree ctor
, tree t
)
3003 tree parms
= FUNCTION_FIRST_USER_PARMTYPE (ctor
);
3005 tree
*new_parms
= XALLOCAVEC (tree
, list_length (parms
));
3007 for (; parms
&& parms
!= void_list_node
; parms
= TREE_CHAIN (parms
))
3009 if (TREE_PURPOSE (parms
))
3010 one_inheriting_sig (t
, ctor
, new_parms
, i
);
3011 new_parms
[i
++] = TREE_VALUE (parms
);
3013 one_inheriting_sig (t
, ctor
, new_parms
, i
);
3014 if (parms
== NULL_TREE
)
3016 warning (OPT_Winherited_variadic_ctor
,
3017 "the ellipsis in %qD is not inherited", ctor
);
3018 inform (DECL_SOURCE_LOCATION (ctor
), "%qD declared here", ctor
);
3022 /* Create default constructors, assignment operators, and so forth for
3023 the type indicated by T, if they are needed. CANT_HAVE_CONST_CTOR,
3024 and CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason,
3025 the class cannot have a default constructor, copy constructor
3026 taking a const reference argument, or an assignment operator taking
3027 a const reference, respectively. */
3030 add_implicitly_declared_members (tree t
, tree
* access_decls
,
3031 int cant_have_const_cctor
,
3032 int cant_have_const_assignment
)
3034 bool move_ok
= false;
3036 if (cxx_dialect
>= cxx11
&& !CLASSTYPE_DESTRUCTORS (t
)
3037 && !TYPE_HAS_COPY_CTOR (t
) && !TYPE_HAS_COPY_ASSIGN (t
)
3038 && !type_has_move_constructor (t
) && !type_has_move_assign (t
))
3042 if (!CLASSTYPE_DESTRUCTORS (t
))
3044 /* In general, we create destructors lazily. */
3045 CLASSTYPE_LAZY_DESTRUCTOR (t
) = 1;
3047 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3048 && TYPE_FOR_JAVA (t
))
3049 /* But if this is a Java class, any non-trivial destructor is
3050 invalid, even if compiler-generated. Therefore, if the
3051 destructor is non-trivial we create it now. */
3052 lazily_declare_fn (sfk_destructor
, t
);
3057 If there is no user-declared constructor for a class, a default
3058 constructor is implicitly declared. */
3059 if (! TYPE_HAS_USER_CONSTRUCTOR (t
))
3061 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 1;
3062 CLASSTYPE_LAZY_DEFAULT_CTOR (t
) = 1;
3063 if (cxx_dialect
>= cxx11
)
3064 TYPE_HAS_CONSTEXPR_CTOR (t
)
3065 /* This might force the declaration. */
3066 = type_has_constexpr_default_constructor (t
);
3071 If a class definition does not explicitly declare a copy
3072 constructor, one is declared implicitly. */
3073 if (! TYPE_HAS_COPY_CTOR (t
) && ! TYPE_FOR_JAVA (t
))
3075 TYPE_HAS_COPY_CTOR (t
) = 1;
3076 TYPE_HAS_CONST_COPY_CTOR (t
) = !cant_have_const_cctor
;
3077 CLASSTYPE_LAZY_COPY_CTOR (t
) = 1;
3079 CLASSTYPE_LAZY_MOVE_CTOR (t
) = 1;
3082 /* If there is no assignment operator, one will be created if and
3083 when it is needed. For now, just record whether or not the type
3084 of the parameter to the assignment operator will be a const or
3085 non-const reference. */
3086 if (!TYPE_HAS_COPY_ASSIGN (t
) && !TYPE_FOR_JAVA (t
))
3088 TYPE_HAS_COPY_ASSIGN (t
) = 1;
3089 TYPE_HAS_CONST_COPY_ASSIGN (t
) = !cant_have_const_assignment
;
3090 CLASSTYPE_LAZY_COPY_ASSIGN (t
) = 1;
3092 CLASSTYPE_LAZY_MOVE_ASSIGN (t
) = 1;
3095 /* We can't be lazy about declaring functions that might override
3096 a virtual function from a base class. */
3097 declare_virt_assop_and_dtor (t
);
3099 while (*access_decls
)
3101 tree using_decl
= TREE_VALUE (*access_decls
);
3102 tree decl
= USING_DECL_DECLS (using_decl
);
3103 if (DECL_NAME (using_decl
) == ctor_identifier
)
3105 /* declare, then remove the decl */
3106 tree ctor_list
= decl
;
3107 location_t loc
= input_location
;
3108 input_location
= DECL_SOURCE_LOCATION (using_decl
);
3110 for (; ctor_list
; ctor_list
= OVL_NEXT (ctor_list
))
3111 one_inherited_ctor (OVL_CURRENT (ctor_list
), t
);
3112 *access_decls
= TREE_CHAIN (*access_decls
);
3113 input_location
= loc
;
3116 access_decls
= &TREE_CHAIN (*access_decls
);
3120 /* Subroutine of insert_into_classtype_sorted_fields. Recursively
3121 count the number of fields in TYPE, including anonymous union
3125 count_fields (tree fields
)
3129 for (x
= fields
; x
; x
= DECL_CHAIN (x
))
3131 if (TREE_CODE (x
) == FIELD_DECL
&& ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
3132 n_fields
+= count_fields (TYPE_FIELDS (TREE_TYPE (x
)));
3139 /* Subroutine of insert_into_classtype_sorted_fields. Recursively add
3140 all the fields in the TREE_LIST FIELDS to the SORTED_FIELDS_TYPE
3141 elts, starting at offset IDX. */
3144 add_fields_to_record_type (tree fields
, struct sorted_fields_type
*field_vec
, int idx
)
3147 for (x
= fields
; x
; x
= DECL_CHAIN (x
))
3149 if (TREE_CODE (x
) == FIELD_DECL
&& ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
3150 idx
= add_fields_to_record_type (TYPE_FIELDS (TREE_TYPE (x
)), field_vec
, idx
);
3152 field_vec
->elts
[idx
++] = x
;
3157 /* Add all of the enum values of ENUMTYPE, to the FIELD_VEC elts,
3158 starting at offset IDX. */
3161 add_enum_fields_to_record_type (tree enumtype
,
3162 struct sorted_fields_type
*field_vec
,
3166 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
3167 field_vec
->elts
[idx
++] = TREE_VALUE (values
);
3171 /* FIELD is a bit-field. We are finishing the processing for its
3172 enclosing type. Issue any appropriate messages and set appropriate
3173 flags. Returns false if an error has been diagnosed. */
3176 check_bitfield_decl (tree field
)
3178 tree type
= TREE_TYPE (field
);
3181 /* Extract the declared width of the bitfield, which has been
3182 temporarily stashed in DECL_INITIAL. */
3183 w
= DECL_INITIAL (field
);
3184 gcc_assert (w
!= NULL_TREE
);
3185 /* Remove the bit-field width indicator so that the rest of the
3186 compiler does not treat that value as an initializer. */
3187 DECL_INITIAL (field
) = NULL_TREE
;
3189 /* Detect invalid bit-field type. */
3190 if (!INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
3192 error ("bit-field %q+#D with non-integral type", field
);
3193 w
= error_mark_node
;
3197 location_t loc
= input_location
;
3198 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
3201 /* detect invalid field size. */
3202 input_location
= DECL_SOURCE_LOCATION (field
);
3203 w
= cxx_constant_value (w
);
3204 input_location
= loc
;
3206 if (TREE_CODE (w
) != INTEGER_CST
)
3208 error ("bit-field %q+D width not an integer constant", field
);
3209 w
= error_mark_node
;
3211 else if (tree_int_cst_sgn (w
) < 0)
3213 error ("negative width in bit-field %q+D", field
);
3214 w
= error_mark_node
;
3216 else if (integer_zerop (w
) && DECL_NAME (field
) != 0)
3218 error ("zero width for bit-field %q+D", field
);
3219 w
= error_mark_node
;
3221 else if ((TREE_CODE (type
) != ENUMERAL_TYPE
3222 && TREE_CODE (type
) != BOOLEAN_TYPE
3223 && compare_tree_int (w
, TYPE_PRECISION (type
)) > 0)
3224 || ((TREE_CODE (type
) == ENUMERAL_TYPE
3225 || TREE_CODE (type
) == BOOLEAN_TYPE
)
3226 && tree_int_cst_lt (TYPE_SIZE (type
), w
)))
3227 warning (0, "width of %q+D exceeds its type", field
);
3228 else if (TREE_CODE (type
) == ENUMERAL_TYPE
3229 && (0 > (compare_tree_int
3230 (w
, TYPE_PRECISION (ENUM_UNDERLYING_TYPE (type
))))))
3231 warning (0, "%q+D is too small to hold all values of %q#T", field
, type
);
3234 if (w
!= error_mark_node
)
3236 DECL_SIZE (field
) = convert (bitsizetype
, w
);
3237 DECL_BIT_FIELD (field
) = 1;
3242 /* Non-bit-fields are aligned for their type. */
3243 DECL_BIT_FIELD (field
) = 0;
3244 CLEAR_DECL_C_BIT_FIELD (field
);
3249 /* FIELD is a non bit-field. We are finishing the processing for its
3250 enclosing type T. Issue any appropriate messages and set appropriate
3254 check_field_decl (tree field
,
3256 int* cant_have_const_ctor
,
3257 int* no_const_asn_ref
,
3258 int* any_default_members
)
3260 tree type
= strip_array_types (TREE_TYPE (field
));
3262 /* In C++98 an anonymous union cannot contain any fields which would change
3263 the settings of CANT_HAVE_CONST_CTOR and friends. */
3264 if (ANON_UNION_TYPE_P (type
) && cxx_dialect
< cxx11
)
3266 /* And, we don't set TYPE_HAS_CONST_COPY_CTOR, etc., for anonymous
3267 structs. So, we recurse through their fields here. */
3268 else if (ANON_AGGR_TYPE_P (type
))
3272 for (fields
= TYPE_FIELDS (type
); fields
; fields
= DECL_CHAIN (fields
))
3273 if (TREE_CODE (fields
) == FIELD_DECL
&& !DECL_C_BIT_FIELD (field
))
3274 check_field_decl (fields
, t
, cant_have_const_ctor
,
3275 no_const_asn_ref
, any_default_members
);
3277 /* Check members with class type for constructors, destructors,
3279 else if (CLASS_TYPE_P (type
))
3281 /* Never let anything with uninheritable virtuals
3282 make it through without complaint. */
3283 abstract_virtuals_error (field
, type
);
3285 if (TREE_CODE (t
) == UNION_TYPE
&& cxx_dialect
< cxx11
)
3288 int oldcount
= errorcount
;
3289 if (TYPE_NEEDS_CONSTRUCTING (type
))
3290 error ("member %q+#D with constructor not allowed in union",
3292 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
3293 error ("member %q+#D with destructor not allowed in union", field
);
3294 if (TYPE_HAS_COMPLEX_COPY_ASSIGN (type
))
3295 error ("member %q+#D with copy assignment operator not allowed in union",
3297 if (!warned
&& errorcount
> oldcount
)
3299 inform (DECL_SOURCE_LOCATION (field
), "unrestricted unions "
3300 "only available with -std=c++11 or -std=gnu++11");
3306 TYPE_NEEDS_CONSTRUCTING (t
) |= TYPE_NEEDS_CONSTRUCTING (type
);
3307 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3308 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
);
3309 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
)
3310 |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (type
)
3311 || !TYPE_HAS_COPY_ASSIGN (type
));
3312 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= (TYPE_HAS_COMPLEX_COPY_CTOR (type
)
3313 || !TYPE_HAS_COPY_CTOR (type
));
3314 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (type
);
3315 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_HAS_COMPLEX_MOVE_CTOR (type
);
3316 TYPE_HAS_COMPLEX_DFLT (t
) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (type
)
3317 || TYPE_HAS_COMPLEX_DFLT (type
));
3320 if (TYPE_HAS_COPY_CTOR (type
)
3321 && !TYPE_HAS_CONST_COPY_CTOR (type
))
3322 *cant_have_const_ctor
= 1;
3324 if (TYPE_HAS_COPY_ASSIGN (type
)
3325 && !TYPE_HAS_CONST_COPY_ASSIGN (type
))
3326 *no_const_asn_ref
= 1;
3329 check_abi_tags (t
, field
);
3331 if (DECL_INITIAL (field
) != NULL_TREE
)
3333 /* `build_class_init_list' does not recognize
3335 if (TREE_CODE (t
) == UNION_TYPE
&& *any_default_members
!= 0)
3336 error ("multiple fields in union %qT initialized", t
);
3337 *any_default_members
= 1;
3341 /* Check the data members (both static and non-static), class-scoped
3342 typedefs, etc., appearing in the declaration of T. Issue
3343 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
3344 declaration order) of access declarations; each TREE_VALUE in this
3345 list is a USING_DECL.
3347 In addition, set the following flags:
3350 The class is empty, i.e., contains no non-static data members.
3352 CANT_HAVE_CONST_CTOR_P
3353 This class cannot have an implicitly generated copy constructor
3354 taking a const reference.
3356 CANT_HAVE_CONST_ASN_REF
3357 This class cannot have an implicitly generated assignment
3358 operator taking a const reference.
3360 All of these flags should be initialized before calling this
3363 Returns a pointer to the end of the TYPE_FIELDs chain; additional
3364 fields can be added by adding to this chain. */
3367 check_field_decls (tree t
, tree
*access_decls
,
3368 int *cant_have_const_ctor_p
,
3369 int *no_const_asn_ref_p
)
3374 int any_default_members
;
3376 int field_access
= -1;
3378 /* Assume there are no access declarations. */
3379 *access_decls
= NULL_TREE
;
3380 /* Assume this class has no pointer members. */
3381 has_pointers
= false;
3382 /* Assume none of the members of this class have default
3384 any_default_members
= 0;
3386 for (field
= &TYPE_FIELDS (t
); *field
; field
= next
)
3389 tree type
= TREE_TYPE (x
);
3390 int this_field_access
;
3392 next
= &DECL_CHAIN (x
);
3394 if (TREE_CODE (x
) == USING_DECL
)
3396 /* Save the access declarations for our caller. */
3397 *access_decls
= tree_cons (NULL_TREE
, x
, *access_decls
);
3401 if (TREE_CODE (x
) == TYPE_DECL
3402 || TREE_CODE (x
) == TEMPLATE_DECL
)
3405 /* If we've gotten this far, it's a data member, possibly static,
3406 or an enumerator. */
3407 if (TREE_CODE (x
) != CONST_DECL
)
3408 DECL_CONTEXT (x
) = t
;
3410 /* When this goes into scope, it will be a non-local reference. */
3411 DECL_NONLOCAL (x
) = 1;
3413 if (TREE_CODE (t
) == UNION_TYPE
)
3417 If a union contains a static data member, or a member of
3418 reference type, the program is ill-formed. */
3421 error ("%q+D may not be static because it is a member of a union", x
);
3424 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3426 error ("%q+D may not have reference type %qT because"
3427 " it is a member of a union",
3433 /* Perform error checking that did not get done in
3435 if (TREE_CODE (type
) == FUNCTION_TYPE
)
3437 error ("field %q+D invalidly declared function type", x
);
3438 type
= build_pointer_type (type
);
3439 TREE_TYPE (x
) = type
;
3441 else if (TREE_CODE (type
) == METHOD_TYPE
)
3443 error ("field %q+D invalidly declared method type", x
);
3444 type
= build_pointer_type (type
);
3445 TREE_TYPE (x
) = type
;
3448 if (type
== error_mark_node
)
3451 if (TREE_CODE (x
) == CONST_DECL
|| VAR_P (x
))
3454 /* Now it can only be a FIELD_DECL. */
3456 if (TREE_PRIVATE (x
) || TREE_PROTECTED (x
))
3457 CLASSTYPE_NON_AGGREGATE (t
) = 1;
3459 /* If at least one non-static data member is non-literal, the whole
3460 class becomes non-literal. Note: if the type is incomplete we
3461 will complain later on. */
3462 if (COMPLETE_TYPE_P (type
) && !literal_type_p (type
))
3463 CLASSTYPE_LITERAL_P (t
) = false;
3465 /* A standard-layout class is a class that:
3467 has the same access control (Clause 11) for all non-static data members,
3469 this_field_access
= TREE_PROTECTED (x
) ? 1 : TREE_PRIVATE (x
) ? 2 : 0;
3470 if (field_access
== -1)
3471 field_access
= this_field_access
;
3472 else if (this_field_access
!= field_access
)
3473 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3475 /* If this is of reference type, check if it needs an init. */
3476 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3478 CLASSTYPE_NON_LAYOUT_POD_P (t
) = 1;
3479 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3480 if (DECL_INITIAL (x
) == NULL_TREE
)
3481 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t
, 1);
3483 /* ARM $12.6.2: [A member initializer list] (or, for an
3484 aggregate, initialization by a brace-enclosed list) is the
3485 only way to initialize nonstatic const and reference
3487 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
3488 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) = 1;
3491 type
= strip_array_types (type
);
3493 if (TYPE_PACKED (t
))
3495 if (!layout_pod_type_p (type
) && !TYPE_PACKED (type
))
3499 "ignoring packed attribute because of unpacked non-POD field %q+#D",
3503 else if (DECL_C_BIT_FIELD (x
)
3504 || TYPE_ALIGN (TREE_TYPE (x
)) > BITS_PER_UNIT
)
3505 DECL_PACKED (x
) = 1;
3508 if (DECL_C_BIT_FIELD (x
) && integer_zerop (DECL_INITIAL (x
)))
3509 /* We don't treat zero-width bitfields as making a class
3514 /* The class is non-empty. */
3515 CLASSTYPE_EMPTY_P (t
) = 0;
3516 /* The class is not even nearly empty. */
3517 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
3518 /* If one of the data members contains an empty class,
3520 if (CLASS_TYPE_P (type
)
3521 && CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type
))
3522 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 1;
3525 /* This is used by -Weffc++ (see below). Warn only for pointers
3526 to members which might hold dynamic memory. So do not warn
3527 for pointers to functions or pointers to members. */
3528 if (TYPE_PTR_P (type
)
3529 && !TYPE_PTRFN_P (type
))
3530 has_pointers
= true;
3532 if (CLASS_TYPE_P (type
))
3534 if (CLASSTYPE_REF_FIELDS_NEED_INIT (type
))
3535 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t
, 1);
3536 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (type
))
3537 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
, 1);
3540 if (DECL_MUTABLE_P (x
) || TYPE_HAS_MUTABLE_P (type
))
3541 CLASSTYPE_HAS_MUTABLE (t
) = 1;
3543 if (DECL_MUTABLE_P (x
))
3545 if (CP_TYPE_CONST_P (type
))
3547 error ("member %q+D cannot be declared both %<const%> "
3548 "and %<mutable%>", x
);
3551 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3553 error ("member %q+D cannot be declared as a %<mutable%> "
3559 if (! layout_pod_type_p (type
))
3560 /* DR 148 now allows pointers to members (which are POD themselves),
3561 to be allowed in POD structs. */
3562 CLASSTYPE_NON_LAYOUT_POD_P (t
) = 1;
3564 if (!std_layout_type_p (type
))
3565 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3567 if (! zero_init_p (type
))
3568 CLASSTYPE_NON_ZERO_INIT_P (t
) = 1;
3570 /* We set DECL_C_BIT_FIELD in grokbitfield.
3571 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
3572 if (! DECL_C_BIT_FIELD (x
) || ! check_bitfield_decl (x
))
3573 check_field_decl (x
, t
,
3574 cant_have_const_ctor_p
,
3576 &any_default_members
);
3578 /* Now that we've removed bit-field widths from DECL_INITIAL,
3579 anything left in DECL_INITIAL is an NSDMI that makes the class
3581 if (DECL_INITIAL (x
))
3582 CLASSTYPE_NON_AGGREGATE (t
) = true;
3584 /* If any field is const, the structure type is pseudo-const. */
3585 if (CP_TYPE_CONST_P (type
))
3587 C_TYPE_FIELDS_READONLY (t
) = 1;
3588 if (DECL_INITIAL (x
) == NULL_TREE
)
3589 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
, 1);
3591 /* ARM $12.6.2: [A member initializer list] (or, for an
3592 aggregate, initialization by a brace-enclosed list) is the
3593 only way to initialize nonstatic const and reference
3595 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
3596 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) = 1;
3598 /* A field that is pseudo-const makes the structure likewise. */
3599 else if (CLASS_TYPE_P (type
))
3601 C_TYPE_FIELDS_READONLY (t
) |= C_TYPE_FIELDS_READONLY (type
);
3602 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
,
3603 CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
)
3604 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (type
));
3607 /* Core issue 80: A nonstatic data member is required to have a
3608 different name from the class iff the class has a
3609 user-declared constructor. */
3610 if (constructor_name_p (DECL_NAME (x
), t
)
3611 && TYPE_HAS_USER_CONSTRUCTOR (t
))
3612 permerror (input_location
, "field %q+#D with same name as class", x
);
3615 /* Effective C++ rule 11: if a class has dynamic memory held by pointers,
3616 it should also define a copy constructor and an assignment operator to
3617 implement the correct copy semantic (deep vs shallow, etc.). As it is
3618 not feasible to check whether the constructors do allocate dynamic memory
3619 and store it within members, we approximate the warning like this:
3621 -- Warn only if there are members which are pointers
3622 -- Warn only if there is a non-trivial constructor (otherwise,
3623 there cannot be memory allocated).
3624 -- Warn only if there is a non-trivial destructor. We assume that the
3625 user at least implemented the cleanup correctly, and a destructor
3626 is needed to free dynamic memory.
3628 This seems enough for practical purposes. */
3631 && TYPE_HAS_USER_CONSTRUCTOR (t
)
3632 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3633 && !(TYPE_HAS_COPY_CTOR (t
) && TYPE_HAS_COPY_ASSIGN (t
)))
3635 warning (OPT_Weffc__
, "%q#T has pointer data members", t
);
3637 if (! TYPE_HAS_COPY_CTOR (t
))
3639 warning (OPT_Weffc__
,
3640 " but does not override %<%T(const %T&)%>", t
, t
);
3641 if (!TYPE_HAS_COPY_ASSIGN (t
))
3642 warning (OPT_Weffc__
, " or %<operator=(const %T&)%>", t
);
3644 else if (! TYPE_HAS_COPY_ASSIGN (t
))
3645 warning (OPT_Weffc__
,
3646 " but does not override %<operator=(const %T&)%>", t
);
3649 /* Non-static data member initializers make the default constructor
3651 if (any_default_members
)
3653 TYPE_NEEDS_CONSTRUCTING (t
) = true;
3654 TYPE_HAS_COMPLEX_DFLT (t
) = true;
3657 /* If any of the fields couldn't be packed, unset TYPE_PACKED. */
3659 TYPE_PACKED (t
) = 0;
3661 /* Check anonymous struct/anonymous union fields. */
3662 finish_struct_anon (t
);
3664 /* We've built up the list of access declarations in reverse order.
3666 *access_decls
= nreverse (*access_decls
);
3669 /* If TYPE is an empty class type, records its OFFSET in the table of
3673 record_subobject_offset (tree type
, tree offset
, splay_tree offsets
)
3677 if (!is_empty_class (type
))
3680 /* Record the location of this empty object in OFFSETS. */
3681 n
= splay_tree_lookup (offsets
, (splay_tree_key
) offset
);
3683 n
= splay_tree_insert (offsets
,
3684 (splay_tree_key
) offset
,
3685 (splay_tree_value
) NULL_TREE
);
3686 n
->value
= ((splay_tree_value
)
3687 tree_cons (NULL_TREE
,
3694 /* Returns nonzero if TYPE is an empty class type and there is
3695 already an entry in OFFSETS for the same TYPE as the same OFFSET. */
3698 check_subobject_offset (tree type
, tree offset
, splay_tree offsets
)
3703 if (!is_empty_class (type
))
3706 /* Record the location of this empty object in OFFSETS. */
3707 n
= splay_tree_lookup (offsets
, (splay_tree_key
) offset
);
3711 for (t
= (tree
) n
->value
; t
; t
= TREE_CHAIN (t
))
3712 if (same_type_p (TREE_VALUE (t
), type
))
3718 /* Walk through all the subobjects of TYPE (located at OFFSET). Call
3719 F for every subobject, passing it the type, offset, and table of
3720 OFFSETS. If VBASES_P is one, then virtual non-primary bases should
3723 If MAX_OFFSET is non-NULL, then subobjects with an offset greater
3724 than MAX_OFFSET will not be walked.
3726 If F returns a nonzero value, the traversal ceases, and that value
3727 is returned. Otherwise, returns zero. */
3730 walk_subobject_offsets (tree type
,
3731 subobject_offset_fn f
,
3738 tree type_binfo
= NULL_TREE
;
3740 /* If this OFFSET is bigger than the MAX_OFFSET, then we should
3742 if (max_offset
&& INT_CST_LT (max_offset
, offset
))
3745 if (type
== error_mark_node
)
3750 if (abi_version_at_least (2))
3752 type
= BINFO_TYPE (type
);
3755 if (CLASS_TYPE_P (type
))
3761 /* Avoid recursing into objects that are not interesting. */
3762 if (!CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type
))
3765 /* Record the location of TYPE. */
3766 r
= (*f
) (type
, offset
, offsets
);
3770 /* Iterate through the direct base classes of TYPE. */
3772 type_binfo
= TYPE_BINFO (type
);
3773 for (i
= 0; BINFO_BASE_ITERATE (type_binfo
, i
, binfo
); i
++)
3777 if (abi_version_at_least (2)
3778 && BINFO_VIRTUAL_P (binfo
))
3782 && BINFO_VIRTUAL_P (binfo
)
3783 && !BINFO_PRIMARY_P (binfo
))
3786 if (!abi_version_at_least (2))
3787 binfo_offset
= size_binop (PLUS_EXPR
,
3789 BINFO_OFFSET (binfo
));
3793 /* We cannot rely on BINFO_OFFSET being set for the base
3794 class yet, but the offsets for direct non-virtual
3795 bases can be calculated by going back to the TYPE. */
3796 orig_binfo
= BINFO_BASE_BINFO (TYPE_BINFO (type
), i
);
3797 binfo_offset
= size_binop (PLUS_EXPR
,
3799 BINFO_OFFSET (orig_binfo
));
3802 r
= walk_subobject_offsets (binfo
,
3807 (abi_version_at_least (2)
3808 ? /*vbases_p=*/0 : vbases_p
));
3813 if (abi_version_at_least (2) && CLASSTYPE_VBASECLASSES (type
))
3816 vec
<tree
, va_gc
> *vbases
;
3818 /* Iterate through the virtual base classes of TYPE. In G++
3819 3.2, we included virtual bases in the direct base class
3820 loop above, which results in incorrect results; the
3821 correct offsets for virtual bases are only known when
3822 working with the most derived type. */
3824 for (vbases
= CLASSTYPE_VBASECLASSES (type
), ix
= 0;
3825 vec_safe_iterate (vbases
, ix
, &binfo
); ix
++)
3827 r
= walk_subobject_offsets (binfo
,
3829 size_binop (PLUS_EXPR
,
3831 BINFO_OFFSET (binfo
)),
3840 /* We still have to walk the primary base, if it is
3841 virtual. (If it is non-virtual, then it was walked
3843 tree vbase
= get_primary_binfo (type_binfo
);
3845 if (vbase
&& BINFO_VIRTUAL_P (vbase
)
3846 && BINFO_PRIMARY_P (vbase
)
3847 && BINFO_INHERITANCE_CHAIN (vbase
) == type_binfo
)
3849 r
= (walk_subobject_offsets
3851 offsets
, max_offset
, /*vbases_p=*/0));
3858 /* Iterate through the fields of TYPE. */
3859 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3860 if (TREE_CODE (field
) == FIELD_DECL
3861 && TREE_TYPE (field
) != error_mark_node
3862 && !DECL_ARTIFICIAL (field
))
3866 if (abi_version_at_least (2))
3867 field_offset
= byte_position (field
);
3869 /* In G++ 3.2, DECL_FIELD_OFFSET was used. */
3870 field_offset
= DECL_FIELD_OFFSET (field
);
3872 r
= walk_subobject_offsets (TREE_TYPE (field
),
3874 size_binop (PLUS_EXPR
,
3884 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3886 tree element_type
= strip_array_types (type
);
3887 tree domain
= TYPE_DOMAIN (type
);
3890 /* Avoid recursing into objects that are not interesting. */
3891 if (!CLASS_TYPE_P (element_type
)
3892 || !CLASSTYPE_CONTAINS_EMPTY_CLASS_P (element_type
))
3895 /* Step through each of the elements in the array. */
3896 for (index
= size_zero_node
;
3897 /* G++ 3.2 had an off-by-one error here. */
3898 (abi_version_at_least (2)
3899 ? !INT_CST_LT (TYPE_MAX_VALUE (domain
), index
)
3900 : INT_CST_LT (index
, TYPE_MAX_VALUE (domain
)));
3901 index
= size_binop (PLUS_EXPR
, index
, size_one_node
))
3903 r
= walk_subobject_offsets (TREE_TYPE (type
),
3911 offset
= size_binop (PLUS_EXPR
, offset
,
3912 TYPE_SIZE_UNIT (TREE_TYPE (type
)));
3913 /* If this new OFFSET is bigger than the MAX_OFFSET, then
3914 there's no point in iterating through the remaining
3915 elements of the array. */
3916 if (max_offset
&& INT_CST_LT (max_offset
, offset
))
3924 /* Record all of the empty subobjects of TYPE (either a type or a
3925 binfo). If IS_DATA_MEMBER is true, then a non-static data member
3926 is being placed at OFFSET; otherwise, it is a base class that is
3927 being placed at OFFSET. */
3930 record_subobject_offsets (tree type
,
3933 bool is_data_member
)
3936 /* If recording subobjects for a non-static data member or a
3937 non-empty base class , we do not need to record offsets beyond
3938 the size of the biggest empty class. Additional data members
3939 will go at the end of the class. Additional base classes will go
3940 either at offset zero (if empty, in which case they cannot
3941 overlap with offsets past the size of the biggest empty class) or
3942 at the end of the class.
3944 However, if we are placing an empty base class, then we must record
3945 all offsets, as either the empty class is at offset zero (where
3946 other empty classes might later be placed) or at the end of the
3947 class (where other objects might then be placed, so other empty
3948 subobjects might later overlap). */
3950 || !is_empty_class (BINFO_TYPE (type
)))
3951 max_offset
= sizeof_biggest_empty_class
;
3953 max_offset
= NULL_TREE
;
3954 walk_subobject_offsets (type
, record_subobject_offset
, offset
,
3955 offsets
, max_offset
, is_data_member
);
3958 /* Returns nonzero if any of the empty subobjects of TYPE (located at
3959 OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero,
3960 virtual bases of TYPE are examined. */
3963 layout_conflict_p (tree type
,
3968 splay_tree_node max_node
;
3970 /* Get the node in OFFSETS that indicates the maximum offset where
3971 an empty subobject is located. */
3972 max_node
= splay_tree_max (offsets
);
3973 /* If there aren't any empty subobjects, then there's no point in
3974 performing this check. */
3978 return walk_subobject_offsets (type
, check_subobject_offset
, offset
,
3979 offsets
, (tree
) (max_node
->key
),
3983 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
3984 non-static data member of the type indicated by RLI. BINFO is the
3985 binfo corresponding to the base subobject, OFFSETS maps offsets to
3986 types already located at those offsets. This function determines
3987 the position of the DECL. */
3990 layout_nonempty_base_or_field (record_layout_info rli
,
3995 tree offset
= NULL_TREE
;
4001 /* For the purposes of determining layout conflicts, we want to
4002 use the class type of BINFO; TREE_TYPE (DECL) will be the
4003 CLASSTYPE_AS_BASE version, which does not contain entries for
4004 zero-sized bases. */
4005 type
= TREE_TYPE (binfo
);
4010 type
= TREE_TYPE (decl
);
4014 /* Try to place the field. It may take more than one try if we have
4015 a hard time placing the field without putting two objects of the
4016 same type at the same address. */
4019 struct record_layout_info_s old_rli
= *rli
;
4021 /* Place this field. */
4022 place_field (rli
, decl
);
4023 offset
= byte_position (decl
);
4025 /* We have to check to see whether or not there is already
4026 something of the same type at the offset we're about to use.
4027 For example, consider:
4030 struct T : public S { int i; };
4031 struct U : public S, public T {};
4033 Here, we put S at offset zero in U. Then, we can't put T at
4034 offset zero -- its S component would be at the same address
4035 as the S we already allocated. So, we have to skip ahead.
4036 Since all data members, including those whose type is an
4037 empty class, have nonzero size, any overlap can happen only
4038 with a direct or indirect base-class -- it can't happen with
4040 /* In a union, overlap is permitted; all members are placed at
4042 if (TREE_CODE (rli
->t
) == UNION_TYPE
)
4044 /* G++ 3.2 did not check for overlaps when placing a non-empty
4046 if (!abi_version_at_least (2) && binfo
&& BINFO_VIRTUAL_P (binfo
))
4048 if (layout_conflict_p (field_p
? type
: binfo
, offset
,
4051 /* Strip off the size allocated to this field. That puts us
4052 at the first place we could have put the field with
4053 proper alignment. */
4056 /* Bump up by the alignment required for the type. */
4058 = size_binop (PLUS_EXPR
, rli
->bitpos
,
4060 ? CLASSTYPE_ALIGN (type
)
4061 : TYPE_ALIGN (type
)));
4062 normalize_rli (rli
);
4065 /* There was no conflict. We're done laying out this field. */
4069 /* Now that we know where it will be placed, update its
4071 if (binfo
&& CLASS_TYPE_P (BINFO_TYPE (binfo
)))
4072 /* Indirect virtual bases may have a nonzero BINFO_OFFSET at
4073 this point because their BINFO_OFFSET is copied from another
4074 hierarchy. Therefore, we may not need to add the entire
4076 propagate_binfo_offsets (binfo
,
4077 size_diffop_loc (input_location
,
4078 convert (ssizetype
, offset
),
4080 BINFO_OFFSET (binfo
))));
4083 /* Returns true if TYPE is empty and OFFSET is nonzero. */
4086 empty_base_at_nonzero_offset_p (tree type
,
4088 splay_tree
/*offsets*/)
4090 return is_empty_class (type
) && !integer_zerop (offset
);
4093 /* Layout the empty base BINFO. EOC indicates the byte currently just
4094 past the end of the class, and should be correctly aligned for a
4095 class of the type indicated by BINFO; OFFSETS gives the offsets of
4096 the empty bases allocated so far. T is the most derived
4097 type. Return nonzero iff we added it at the end. */
4100 layout_empty_base (record_layout_info rli
, tree binfo
,
4101 tree eoc
, splay_tree offsets
)
4104 tree basetype
= BINFO_TYPE (binfo
);
4107 /* This routine should only be used for empty classes. */
4108 gcc_assert (is_empty_class (basetype
));
4109 alignment
= ssize_int (CLASSTYPE_ALIGN_UNIT (basetype
));
4111 if (!integer_zerop (BINFO_OFFSET (binfo
)))
4113 if (abi_version_at_least (2))
4114 propagate_binfo_offsets
4115 (binfo
, size_diffop_loc (input_location
,
4116 size_zero_node
, BINFO_OFFSET (binfo
)));
4119 "offset of empty base %qT may not be ABI-compliant and may"
4120 "change in a future version of GCC",
4121 BINFO_TYPE (binfo
));
4124 /* This is an empty base class. We first try to put it at offset
4126 if (layout_conflict_p (binfo
,
4127 BINFO_OFFSET (binfo
),
4131 /* That didn't work. Now, we move forward from the next
4132 available spot in the class. */
4134 propagate_binfo_offsets (binfo
, convert (ssizetype
, eoc
));
4137 if (!layout_conflict_p (binfo
,
4138 BINFO_OFFSET (binfo
),
4141 /* We finally found a spot where there's no overlap. */
4144 /* There's overlap here, too. Bump along to the next spot. */
4145 propagate_binfo_offsets (binfo
, alignment
);
4149 if (CLASSTYPE_USER_ALIGN (basetype
))
4151 rli
->record_align
= MAX (rli
->record_align
, CLASSTYPE_ALIGN (basetype
));
4153 rli
->unpacked_align
= MAX (rli
->unpacked_align
, CLASSTYPE_ALIGN (basetype
));
4154 TYPE_USER_ALIGN (rli
->t
) = 1;
4160 /* Layout the base given by BINFO in the class indicated by RLI.
4161 *BASE_ALIGN is a running maximum of the alignments of
4162 any base class. OFFSETS gives the location of empty base
4163 subobjects. T is the most derived type. Return nonzero if the new
4164 object cannot be nearly-empty. A new FIELD_DECL is inserted at
4165 *NEXT_FIELD, unless BINFO is for an empty base class.
4167 Returns the location at which the next field should be inserted. */
4170 build_base_field (record_layout_info rli
, tree binfo
,
4171 splay_tree offsets
, tree
*next_field
)
4174 tree basetype
= BINFO_TYPE (binfo
);
4176 if (!COMPLETE_TYPE_P (basetype
))
4177 /* This error is now reported in xref_tag, thus giving better
4178 location information. */
4181 /* Place the base class. */
4182 if (!is_empty_class (basetype
))
4186 /* The containing class is non-empty because it has a non-empty
4188 CLASSTYPE_EMPTY_P (t
) = 0;
4190 /* Create the FIELD_DECL. */
4191 decl
= build_decl (input_location
,
4192 FIELD_DECL
, NULL_TREE
, CLASSTYPE_AS_BASE (basetype
));
4193 DECL_ARTIFICIAL (decl
) = 1;
4194 DECL_IGNORED_P (decl
) = 1;
4195 DECL_FIELD_CONTEXT (decl
) = t
;
4196 if (CLASSTYPE_AS_BASE (basetype
))
4198 DECL_SIZE (decl
) = CLASSTYPE_SIZE (basetype
);
4199 DECL_SIZE_UNIT (decl
) = CLASSTYPE_SIZE_UNIT (basetype
);
4200 DECL_ALIGN (decl
) = CLASSTYPE_ALIGN (basetype
);
4201 DECL_USER_ALIGN (decl
) = CLASSTYPE_USER_ALIGN (basetype
);
4202 DECL_MODE (decl
) = TYPE_MODE (basetype
);
4203 DECL_FIELD_IS_BASE (decl
) = 1;
4205 /* Try to place the field. It may take more than one try if we
4206 have a hard time placing the field without putting two
4207 objects of the same type at the same address. */
4208 layout_nonempty_base_or_field (rli
, decl
, binfo
, offsets
);
4209 /* Add the new FIELD_DECL to the list of fields for T. */
4210 DECL_CHAIN (decl
) = *next_field
;
4212 next_field
= &DECL_CHAIN (decl
);
4220 /* On some platforms (ARM), even empty classes will not be
4222 eoc
= round_up_loc (input_location
,
4223 rli_size_unit_so_far (rli
),
4224 CLASSTYPE_ALIGN_UNIT (basetype
));
4225 atend
= layout_empty_base (rli
, binfo
, eoc
, offsets
);
4226 /* A nearly-empty class "has no proper base class that is empty,
4227 not morally virtual, and at an offset other than zero." */
4228 if (!BINFO_VIRTUAL_P (binfo
) && CLASSTYPE_NEARLY_EMPTY_P (t
))
4231 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
4232 /* The check above (used in G++ 3.2) is insufficient because
4233 an empty class placed at offset zero might itself have an
4234 empty base at a nonzero offset. */
4235 else if (walk_subobject_offsets (basetype
,
4236 empty_base_at_nonzero_offset_p
,
4239 /*max_offset=*/NULL_TREE
,
4242 if (abi_version_at_least (2))
4243 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
4246 "class %qT will be considered nearly empty in a "
4247 "future version of GCC", t
);
4251 /* We do not create a FIELD_DECL for empty base classes because
4252 it might overlap some other field. We want to be able to
4253 create CONSTRUCTORs for the class by iterating over the
4254 FIELD_DECLs, and the back end does not handle overlapping
4257 /* An empty virtual base causes a class to be non-empty
4258 -- but in that case we do not need to clear CLASSTYPE_EMPTY_P
4259 here because that was already done when the virtual table
4260 pointer was created. */
4263 /* Record the offsets of BINFO and its base subobjects. */
4264 record_subobject_offsets (binfo
,
4265 BINFO_OFFSET (binfo
),
4267 /*is_data_member=*/false);
4272 /* Layout all of the non-virtual base classes. Record empty
4273 subobjects in OFFSETS. T is the most derived type. Return nonzero
4274 if the type cannot be nearly empty. The fields created
4275 corresponding to the base classes will be inserted at
4279 build_base_fields (record_layout_info rli
,
4280 splay_tree offsets
, tree
*next_field
)
4282 /* Chain to hold all the new FIELD_DECLs which stand in for base class
4285 int n_baseclasses
= BINFO_N_BASE_BINFOS (TYPE_BINFO (t
));
4288 /* The primary base class is always allocated first. */
4289 if (CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
4290 next_field
= build_base_field (rli
, CLASSTYPE_PRIMARY_BINFO (t
),
4291 offsets
, next_field
);
4293 /* Now allocate the rest of the bases. */
4294 for (i
= 0; i
< n_baseclasses
; ++i
)
4298 base_binfo
= BINFO_BASE_BINFO (TYPE_BINFO (t
), i
);
4300 /* The primary base was already allocated above, so we don't
4301 need to allocate it again here. */
4302 if (base_binfo
== CLASSTYPE_PRIMARY_BINFO (t
))
4305 /* Virtual bases are added at the end (a primary virtual base
4306 will have already been added). */
4307 if (BINFO_VIRTUAL_P (base_binfo
))
4310 next_field
= build_base_field (rli
, base_binfo
,
4311 offsets
, next_field
);
4315 /* Go through the TYPE_METHODS of T issuing any appropriate
4316 diagnostics, figuring out which methods override which other
4317 methods, and so forth. */
4320 check_methods (tree t
)
4324 for (x
= TYPE_METHODS (t
); x
; x
= DECL_CHAIN (x
))
4326 check_for_override (x
, t
);
4327 if (DECL_PURE_VIRTUAL_P (x
) && ! DECL_VINDEX (x
))
4328 error ("initializer specified for non-virtual method %q+D", x
);
4329 /* The name of the field is the original field name
4330 Save this in auxiliary field for later overloading. */
4331 if (DECL_VINDEX (x
))
4333 TYPE_POLYMORPHIC_P (t
) = 1;
4334 if (DECL_PURE_VIRTUAL_P (x
))
4335 vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t
), x
);
4337 /* All user-provided destructors are non-trivial.
4338 Constructors and assignment ops are handled in
4339 grok_special_member_properties. */
4340 if (DECL_DESTRUCTOR_P (x
) && user_provided_p (x
))
4341 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = 1;
4345 /* FN is a constructor or destructor. Clone the declaration to create
4346 a specialized in-charge or not-in-charge version, as indicated by
4350 build_clone (tree fn
, tree name
)
4355 /* Copy the function. */
4356 clone
= copy_decl (fn
);
4357 /* Reset the function name. */
4358 DECL_NAME (clone
) = name
;
4359 SET_DECL_ASSEMBLER_NAME (clone
, NULL_TREE
);
4360 /* Remember where this function came from. */
4361 DECL_ABSTRACT_ORIGIN (clone
) = fn
;
4362 /* Make it easy to find the CLONE given the FN. */
4363 DECL_CHAIN (clone
) = DECL_CHAIN (fn
);
4364 DECL_CHAIN (fn
) = clone
;
4366 /* If this is a template, do the rest on the DECL_TEMPLATE_RESULT. */
4367 if (TREE_CODE (clone
) == TEMPLATE_DECL
)
4369 tree result
= build_clone (DECL_TEMPLATE_RESULT (clone
), name
);
4370 DECL_TEMPLATE_RESULT (clone
) = result
;
4371 DECL_TEMPLATE_INFO (result
) = copy_node (DECL_TEMPLATE_INFO (result
));
4372 DECL_TI_TEMPLATE (result
) = clone
;
4373 TREE_TYPE (clone
) = TREE_TYPE (result
);
4377 DECL_CLONED_FUNCTION (clone
) = fn
;
4378 /* There's no pending inline data for this function. */
4379 DECL_PENDING_INLINE_INFO (clone
) = NULL
;
4380 DECL_PENDING_INLINE_P (clone
) = 0;
4382 /* The base-class destructor is not virtual. */
4383 if (name
== base_dtor_identifier
)
4385 DECL_VIRTUAL_P (clone
) = 0;
4386 if (TREE_CODE (clone
) != TEMPLATE_DECL
)
4387 DECL_VINDEX (clone
) = NULL_TREE
;
4390 /* If there was an in-charge parameter, drop it from the function
4392 if (DECL_HAS_IN_CHARGE_PARM_P (clone
))
4398 exceptions
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone
));
4399 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (clone
));
4400 parmtypes
= TYPE_ARG_TYPES (TREE_TYPE (clone
));
4401 /* Skip the `this' parameter. */
4402 parmtypes
= TREE_CHAIN (parmtypes
);
4403 /* Skip the in-charge parameter. */
4404 parmtypes
= TREE_CHAIN (parmtypes
);
4405 /* And the VTT parm, in a complete [cd]tor. */
4406 if (DECL_HAS_VTT_PARM_P (fn
)
4407 && ! DECL_NEEDS_VTT_PARM_P (clone
))
4408 parmtypes
= TREE_CHAIN (parmtypes
);
4409 /* If this is subobject constructor or destructor, add the vtt
4412 = build_method_type_directly (basetype
,
4413 TREE_TYPE (TREE_TYPE (clone
)),
4416 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
),
4419 = cp_build_type_attribute_variant (TREE_TYPE (clone
),
4420 TYPE_ATTRIBUTES (TREE_TYPE (fn
)));
4423 /* Copy the function parameters. */
4424 DECL_ARGUMENTS (clone
) = copy_list (DECL_ARGUMENTS (clone
));
4425 /* Remove the in-charge parameter. */
4426 if (DECL_HAS_IN_CHARGE_PARM_P (clone
))
4428 DECL_CHAIN (DECL_ARGUMENTS (clone
))
4429 = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone
)));
4430 DECL_HAS_IN_CHARGE_PARM_P (clone
) = 0;
4432 /* And the VTT parm, in a complete [cd]tor. */
4433 if (DECL_HAS_VTT_PARM_P (fn
))
4435 if (DECL_NEEDS_VTT_PARM_P (clone
))
4436 DECL_HAS_VTT_PARM_P (clone
) = 1;
4439 DECL_CHAIN (DECL_ARGUMENTS (clone
))
4440 = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone
)));
4441 DECL_HAS_VTT_PARM_P (clone
) = 0;
4445 for (parms
= DECL_ARGUMENTS (clone
); parms
; parms
= DECL_CHAIN (parms
))
4447 DECL_CONTEXT (parms
) = clone
;
4448 cxx_dup_lang_specific_decl (parms
);
4451 /* Create the RTL for this function. */
4452 SET_DECL_RTL (clone
, NULL
);
4453 rest_of_decl_compilation (clone
, /*top_level=*/1, at_eof
);
4456 note_decl_for_pch (clone
);
4461 /* Implementation of DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P, do
4462 not invoke this function directly.
4464 For a non-thunk function, returns the address of the slot for storing
4465 the function it is a clone of. Otherwise returns NULL_TREE.
4467 If JUST_TESTING, looks through TEMPLATE_DECL and returns NULL if
4468 cloned_function is unset. This is to support the separate
4469 DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P modes; using the latter
4470 on a template makes sense, but not the former. */
4473 decl_cloned_function_p (const_tree decl
, bool just_testing
)
4477 decl
= STRIP_TEMPLATE (decl
);
4479 if (TREE_CODE (decl
) != FUNCTION_DECL
4480 || !DECL_LANG_SPECIFIC (decl
)
4481 || DECL_LANG_SPECIFIC (decl
)->u
.fn
.thunk_p
)
4483 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4485 lang_check_failed (__FILE__
, __LINE__
, __FUNCTION__
);
4491 ptr
= &DECL_LANG_SPECIFIC (decl
)->u
.fn
.u5
.cloned_function
;
4492 if (just_testing
&& *ptr
== NULL_TREE
)
4498 /* Produce declarations for all appropriate clones of FN. If
4499 UPDATE_METHOD_VEC_P is nonzero, the clones are added to the
4500 CLASTYPE_METHOD_VEC as well. */
4503 clone_function_decl (tree fn
, int update_method_vec_p
)
4507 /* Avoid inappropriate cloning. */
4509 && DECL_CLONED_FUNCTION_P (DECL_CHAIN (fn
)))
4512 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
4514 /* For each constructor, we need two variants: an in-charge version
4515 and a not-in-charge version. */
4516 clone
= build_clone (fn
, complete_ctor_identifier
);
4517 if (update_method_vec_p
)
4518 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4519 clone
= build_clone (fn
, base_ctor_identifier
);
4520 if (update_method_vec_p
)
4521 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4525 gcc_assert (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn
));
4527 /* For each destructor, we need three variants: an in-charge
4528 version, a not-in-charge version, and an in-charge deleting
4529 version. We clone the deleting version first because that
4530 means it will go second on the TYPE_METHODS list -- and that
4531 corresponds to the correct layout order in the virtual
4534 For a non-virtual destructor, we do not build a deleting
4536 if (DECL_VIRTUAL_P (fn
))
4538 clone
= build_clone (fn
, deleting_dtor_identifier
);
4539 if (update_method_vec_p
)
4540 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4542 clone
= build_clone (fn
, complete_dtor_identifier
);
4543 if (update_method_vec_p
)
4544 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4545 clone
= build_clone (fn
, base_dtor_identifier
);
4546 if (update_method_vec_p
)
4547 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4550 /* Note that this is an abstract function that is never emitted. */
4551 DECL_ABSTRACT (fn
) = 1;
4554 /* DECL is an in charge constructor, which is being defined. This will
4555 have had an in class declaration, from whence clones were
4556 declared. An out-of-class definition can specify additional default
4557 arguments. As it is the clones that are involved in overload
4558 resolution, we must propagate the information from the DECL to its
4562 adjust_clone_args (tree decl
)
4566 for (clone
= DECL_CHAIN (decl
); clone
&& DECL_CLONED_FUNCTION_P (clone
);
4567 clone
= DECL_CHAIN (clone
))
4569 tree orig_clone_parms
= TYPE_ARG_TYPES (TREE_TYPE (clone
));
4570 tree orig_decl_parms
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
4571 tree decl_parms
, clone_parms
;
4573 clone_parms
= orig_clone_parms
;
4575 /* Skip the 'this' parameter. */
4576 orig_clone_parms
= TREE_CHAIN (orig_clone_parms
);
4577 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4579 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
4580 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4581 if (DECL_HAS_VTT_PARM_P (decl
))
4582 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4584 clone_parms
= orig_clone_parms
;
4585 if (DECL_HAS_VTT_PARM_P (clone
))
4586 clone_parms
= TREE_CHAIN (clone_parms
);
4588 for (decl_parms
= orig_decl_parms
; decl_parms
;
4589 decl_parms
= TREE_CHAIN (decl_parms
),
4590 clone_parms
= TREE_CHAIN (clone_parms
))
4592 gcc_assert (same_type_p (TREE_TYPE (decl_parms
),
4593 TREE_TYPE (clone_parms
)));
4595 if (TREE_PURPOSE (decl_parms
) && !TREE_PURPOSE (clone_parms
))
4597 /* A default parameter has been added. Adjust the
4598 clone's parameters. */
4599 tree exceptions
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone
));
4600 tree attrs
= TYPE_ATTRIBUTES (TREE_TYPE (clone
));
4601 tree basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (clone
));
4604 clone_parms
= orig_decl_parms
;
4606 if (DECL_HAS_VTT_PARM_P (clone
))
4608 clone_parms
= tree_cons (TREE_PURPOSE (orig_clone_parms
),
4609 TREE_VALUE (orig_clone_parms
),
4611 TREE_TYPE (clone_parms
) = TREE_TYPE (orig_clone_parms
);
4613 type
= build_method_type_directly (basetype
,
4614 TREE_TYPE (TREE_TYPE (clone
)),
4617 type
= build_exception_variant (type
, exceptions
);
4619 type
= cp_build_type_attribute_variant (type
, attrs
);
4620 TREE_TYPE (clone
) = type
;
4622 clone_parms
= NULL_TREE
;
4626 gcc_assert (!clone_parms
);
4630 /* For each of the constructors and destructors in T, create an
4631 in-charge and not-in-charge variant. */
4634 clone_constructors_and_destructors (tree t
)
4638 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4640 if (!CLASSTYPE_METHOD_VEC (t
))
4643 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4644 clone_function_decl (OVL_CURRENT (fns
), /*update_method_vec_p=*/1);
4645 for (fns
= CLASSTYPE_DESTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4646 clone_function_decl (OVL_CURRENT (fns
), /*update_method_vec_p=*/1);
4649 /* Deduce noexcept for a destructor DTOR. */
4652 deduce_noexcept_on_destructor (tree dtor
)
4654 if (!TYPE_RAISES_EXCEPTIONS (TREE_TYPE (dtor
)))
4656 tree ctx
= DECL_CONTEXT (dtor
);
4657 tree implicit_fn
= implicitly_declare_fn (sfk_destructor
, ctx
,
4660 tree eh_spec
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (implicit_fn
));
4661 TREE_TYPE (dtor
) = build_exception_variant (TREE_TYPE (dtor
), eh_spec
);
4665 /* For each destructor in T, deduce noexcept:
4667 12.4/3: A declaration of a destructor that does not have an
4668 exception-specification is implicitly considered to have the
4669 same exception-specification as an implicit declaration (15.4). */
4672 deduce_noexcept_on_destructors (tree t
)
4674 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4676 if (!CLASSTYPE_METHOD_VEC (t
))
4679 for (tree fns
= CLASSTYPE_DESTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4680 deduce_noexcept_on_destructor (OVL_CURRENT (fns
));
4683 /* Subroutine of set_one_vmethod_tm_attributes. Search base classes
4684 of TYPE for virtual functions which FNDECL overrides. Return a
4685 mask of the tm attributes found therein. */
4688 look_for_tm_attr_overrides (tree type
, tree fndecl
)
4690 tree binfo
= TYPE_BINFO (type
);
4694 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ++ix
)
4696 tree o
, basetype
= BINFO_TYPE (base_binfo
);
4698 if (!TYPE_POLYMORPHIC_P (basetype
))
4701 o
= look_for_overrides_here (basetype
, fndecl
);
4703 found
|= tm_attr_to_mask (find_tm_attribute
4704 (TYPE_ATTRIBUTES (TREE_TYPE (o
))));
4706 found
|= look_for_tm_attr_overrides (basetype
, fndecl
);
4712 /* Subroutine of set_method_tm_attributes. Handle the checks and
4713 inheritance for one virtual method FNDECL. */
4716 set_one_vmethod_tm_attributes (tree type
, tree fndecl
)
4721 found
= look_for_tm_attr_overrides (type
, fndecl
);
4723 /* If FNDECL doesn't actually override anything (i.e. T is the
4724 class that first declares FNDECL virtual), then we're done. */
4728 tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl
)));
4729 have
= tm_attr_to_mask (tm_attr
);
4731 /* Intel STM Language Extension 3.0, Section 4.2 table 4:
4732 tm_pure must match exactly, otherwise no weakening of
4733 tm_safe > tm_callable > nothing. */
4734 /* ??? The tm_pure attribute didn't make the transition to the
4735 multivendor language spec. */
4736 if (have
== TM_ATTR_PURE
)
4738 if (found
!= TM_ATTR_PURE
)
4744 /* If the overridden function is tm_pure, then FNDECL must be. */
4745 else if (found
== TM_ATTR_PURE
&& tm_attr
)
4747 /* Look for base class combinations that cannot be satisfied. */
4748 else if (found
!= TM_ATTR_PURE
&& (found
& TM_ATTR_PURE
))
4750 found
&= ~TM_ATTR_PURE
;
4752 error_at (DECL_SOURCE_LOCATION (fndecl
),
4753 "method overrides both %<transaction_pure%> and %qE methods",
4754 tm_mask_to_attr (found
));
4756 /* If FNDECL did not declare an attribute, then inherit the most
4758 else if (tm_attr
== NULL
)
4760 apply_tm_attr (fndecl
, tm_mask_to_attr (found
& -found
));
4762 /* Otherwise validate that we're not weaker than a function
4763 that is being overridden. */
4767 if (found
<= TM_ATTR_CALLABLE
&& have
> found
)
4773 error_at (DECL_SOURCE_LOCATION (fndecl
),
4774 "method declared %qE overriding %qE method",
4775 tm_attr
, tm_mask_to_attr (found
));
4778 /* For each of the methods in T, propagate a class-level tm attribute. */
4781 set_method_tm_attributes (tree t
)
4783 tree class_tm_attr
, fndecl
;
4785 /* Don't bother collecting tm attributes if transactional memory
4786 support is not enabled. */
4790 /* Process virtual methods first, as they inherit directly from the
4791 base virtual function and also require validation of new attributes. */
4792 if (TYPE_CONTAINS_VPTR_P (t
))
4795 for (vchain
= BINFO_VIRTUALS (TYPE_BINFO (t
)); vchain
;
4796 vchain
= TREE_CHAIN (vchain
))
4798 fndecl
= BV_FN (vchain
);
4799 if (DECL_THUNK_P (fndecl
))
4800 fndecl
= THUNK_TARGET (fndecl
);
4801 set_one_vmethod_tm_attributes (t
, fndecl
);
4805 /* If the class doesn't have an attribute, nothing more to do. */
4806 class_tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (t
));
4807 if (class_tm_attr
== NULL
)
4810 /* Any method that does not yet have a tm attribute inherits
4811 the one from the class. */
4812 for (fndecl
= TYPE_METHODS (t
); fndecl
; fndecl
= TREE_CHAIN (fndecl
))
4814 if (!find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl
))))
4815 apply_tm_attr (fndecl
, class_tm_attr
);
4819 /* Returns true iff class T has a user-defined constructor other than
4820 the default constructor. */
4823 type_has_user_nondefault_constructor (tree t
)
4827 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4830 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4832 tree fn
= OVL_CURRENT (fns
);
4833 if (!DECL_ARTIFICIAL (fn
)
4834 && (TREE_CODE (fn
) == TEMPLATE_DECL
4835 || (skip_artificial_parms_for (fn
, DECL_ARGUMENTS (fn
))
4843 /* Returns the defaulted constructor if T has one. Otherwise, returns
4847 in_class_defaulted_default_constructor (tree t
)
4851 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4854 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4856 tree fn
= OVL_CURRENT (fns
);
4858 if (DECL_DEFAULTED_IN_CLASS_P (fn
))
4860 args
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
4861 while (args
&& TREE_PURPOSE (args
))
4862 args
= TREE_CHAIN (args
);
4863 if (!args
|| args
== void_list_node
)
4871 /* Returns true iff FN is a user-provided function, i.e. user-declared
4872 and not defaulted at its first declaration; or explicit, private,
4873 protected, or non-const. */
4876 user_provided_p (tree fn
)
4878 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4881 return (!DECL_ARTIFICIAL (fn
)
4882 && !(DECL_INITIALIZED_IN_CLASS_P (fn
)
4883 && (DECL_DEFAULTED_FN (fn
) || DECL_DELETED_FN (fn
))));
4886 /* Returns true iff class T has a user-provided constructor. */
4889 type_has_user_provided_constructor (tree t
)
4893 if (!CLASS_TYPE_P (t
))
4896 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4899 /* This can happen in error cases; avoid crashing. */
4900 if (!CLASSTYPE_METHOD_VEC (t
))
4903 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4904 if (user_provided_p (OVL_CURRENT (fns
)))
4910 /* Returns true iff class T has a user-provided default constructor. */
4913 type_has_user_provided_default_constructor (tree t
)
4917 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4920 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4922 tree fn
= OVL_CURRENT (fns
);
4923 if (TREE_CODE (fn
) == FUNCTION_DECL
4924 && user_provided_p (fn
)
4925 && sufficient_parms_p (FUNCTION_FIRST_USER_PARMTYPE (fn
)))
4932 /* TYPE is being used as a virtual base, and has a non-trivial move
4933 assignment. Return true if this is due to there being a user-provided
4934 move assignment in TYPE or one of its subobjects; if there isn't, then
4935 multiple move assignment can't cause any harm. */
4938 vbase_has_user_provided_move_assign (tree type
)
4940 /* Does the type itself have a user-provided move assignment operator? */
4942 = lookup_fnfields_slot_nolazy (type
, ansi_assopname (NOP_EXPR
));
4943 fns
; fns
= OVL_NEXT (fns
))
4945 tree fn
= OVL_CURRENT (fns
);
4946 if (move_fn_p (fn
) && user_provided_p (fn
))
4950 /* Do any of its bases? */
4951 tree binfo
= TYPE_BINFO (type
);
4953 for (int i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
4954 if (vbase_has_user_provided_move_assign (BINFO_TYPE (base_binfo
)))
4957 /* Or non-static data members? */
4958 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
4960 if (TREE_CODE (field
) == FIELD_DECL
4961 && CLASS_TYPE_P (TREE_TYPE (field
))
4962 && vbase_has_user_provided_move_assign (TREE_TYPE (field
)))
4970 /* If default-initialization leaves part of TYPE uninitialized, returns
4971 a DECL for the field or TYPE itself (DR 253). */
4974 default_init_uninitialized_part (tree type
)
4979 type
= strip_array_types (type
);
4980 if (!CLASS_TYPE_P (type
))
4982 if (type_has_user_provided_default_constructor (type
))
4984 for (binfo
= TYPE_BINFO (type
), i
= 0;
4985 BINFO_BASE_ITERATE (binfo
, i
, t
); ++i
)
4987 r
= default_init_uninitialized_part (BINFO_TYPE (t
));
4991 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
4992 if (TREE_CODE (t
) == FIELD_DECL
4993 && !DECL_ARTIFICIAL (t
)
4994 && !DECL_INITIAL (t
))
4996 r
= default_init_uninitialized_part (TREE_TYPE (t
));
4998 return DECL_P (r
) ? r
: t
;
5004 /* Returns true iff for class T, a trivial synthesized default constructor
5005 would be constexpr. */
5008 trivial_default_constructor_is_constexpr (tree t
)
5010 /* A defaulted trivial default constructor is constexpr
5011 if there is nothing to initialize. */
5012 gcc_assert (!TYPE_HAS_COMPLEX_DFLT (t
));
5013 return is_really_empty_class (t
);
5016 /* Returns true iff class T has a constexpr default constructor. */
5019 type_has_constexpr_default_constructor (tree t
)
5023 if (!CLASS_TYPE_P (t
))
5025 /* The caller should have stripped an enclosing array. */
5026 gcc_assert (TREE_CODE (t
) != ARRAY_TYPE
);
5029 if (CLASSTYPE_LAZY_DEFAULT_CTOR (t
))
5031 if (!TYPE_HAS_COMPLEX_DFLT (t
))
5032 return trivial_default_constructor_is_constexpr (t
);
5033 /* Non-trivial, we need to check subobject constructors. */
5034 lazily_declare_fn (sfk_constructor
, t
);
5036 fns
= locate_ctor (t
);
5037 return (fns
&& DECL_DECLARED_CONSTEXPR_P (fns
));
5040 /* Returns true iff class TYPE has a virtual destructor. */
5043 type_has_virtual_destructor (tree type
)
5047 if (!CLASS_TYPE_P (type
))
5050 gcc_assert (COMPLETE_TYPE_P (type
));
5051 dtor
= CLASSTYPE_DESTRUCTORS (type
);
5052 return (dtor
&& DECL_VIRTUAL_P (dtor
));
5055 /* Returns true iff class T has a move constructor. */
5058 type_has_move_constructor (tree t
)
5062 if (CLASSTYPE_LAZY_MOVE_CTOR (t
))
5064 gcc_assert (COMPLETE_TYPE_P (t
));
5065 lazily_declare_fn (sfk_move_constructor
, t
);
5068 if (!CLASSTYPE_METHOD_VEC (t
))
5071 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5072 if (move_fn_p (OVL_CURRENT (fns
)))
5078 /* Returns true iff class T has a move assignment operator. */
5081 type_has_move_assign (tree t
)
5085 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
5087 gcc_assert (COMPLETE_TYPE_P (t
));
5088 lazily_declare_fn (sfk_move_assignment
, t
);
5091 for (fns
= lookup_fnfields_slot_nolazy (t
, ansi_assopname (NOP_EXPR
));
5092 fns
; fns
= OVL_NEXT (fns
))
5093 if (move_fn_p (OVL_CURRENT (fns
)))
5099 /* Returns true iff class T has a move constructor that was explicitly
5100 declared in the class body. Note that this is different from
5101 "user-provided", which doesn't include functions that are defaulted in
5105 type_has_user_declared_move_constructor (tree t
)
5109 if (CLASSTYPE_LAZY_MOVE_CTOR (t
))
5112 if (!CLASSTYPE_METHOD_VEC (t
))
5115 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5117 tree fn
= OVL_CURRENT (fns
);
5118 if (move_fn_p (fn
) && !DECL_ARTIFICIAL (fn
))
5125 /* Returns true iff class T has a move assignment operator that was
5126 explicitly declared in the class body. */
5129 type_has_user_declared_move_assign (tree t
)
5133 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
5136 for (fns
= lookup_fnfields_slot_nolazy (t
, ansi_assopname (NOP_EXPR
));
5137 fns
; fns
= OVL_NEXT (fns
))
5139 tree fn
= OVL_CURRENT (fns
);
5140 if (move_fn_p (fn
) && !DECL_ARTIFICIAL (fn
))
5147 /* Nonzero if we need to build up a constructor call when initializing an
5148 object of this class, either because it has a user-declared constructor
5149 or because it doesn't have a default constructor (so we need to give an
5150 error if no initializer is provided). Use TYPE_NEEDS_CONSTRUCTING when
5151 what you care about is whether or not an object can be produced by a
5152 constructor (e.g. so we don't set TREE_READONLY on const variables of
5153 such type); use this function when what you care about is whether or not
5154 to try to call a constructor to create an object. The latter case is
5155 the former plus some cases of constructors that cannot be called. */
5158 type_build_ctor_call (tree t
)
5161 if (TYPE_NEEDS_CONSTRUCTING (t
))
5163 inner
= strip_array_types (t
);
5164 if (!CLASS_TYPE_P (inner
) || ANON_AGGR_TYPE_P (inner
))
5166 if (!TYPE_HAS_DEFAULT_CONSTRUCTOR (inner
))
5168 if (cxx_dialect
< cxx11
)
5170 /* A user-declared constructor might be private, and a constructor might
5171 be trivial but deleted. */
5172 for (tree fns
= lookup_fnfields_slot (inner
, complete_ctor_identifier
);
5173 fns
; fns
= OVL_NEXT (fns
))
5175 tree fn
= OVL_CURRENT (fns
);
5176 if (!DECL_ARTIFICIAL (fn
)
5177 || DECL_DELETED_FN (fn
))
5183 /* Like type_build_ctor_call, but for destructors. */
5186 type_build_dtor_call (tree t
)
5189 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5191 inner
= strip_array_types (t
);
5192 if (!CLASS_TYPE_P (inner
) || ANON_AGGR_TYPE_P (inner
)
5193 || !COMPLETE_TYPE_P (inner
))
5195 if (cxx_dialect
< cxx11
)
5197 /* A user-declared destructor might be private, and a destructor might
5198 be trivial but deleted. */
5199 for (tree fns
= lookup_fnfields_slot (inner
, complete_dtor_identifier
);
5200 fns
; fns
= OVL_NEXT (fns
))
5202 tree fn
= OVL_CURRENT (fns
);
5203 if (!DECL_ARTIFICIAL (fn
)
5204 || DECL_DELETED_FN (fn
))
5210 /* Remove all zero-width bit-fields from T. */
5213 remove_zero_width_bit_fields (tree t
)
5217 fieldsp
= &TYPE_FIELDS (t
);
5220 if (TREE_CODE (*fieldsp
) == FIELD_DECL
5221 && DECL_C_BIT_FIELD (*fieldsp
)
5222 /* We should not be confused by the fact that grokbitfield
5223 temporarily sets the width of the bit field into
5224 DECL_INITIAL (*fieldsp).
5225 check_bitfield_decl eventually sets DECL_SIZE (*fieldsp)
5227 && integer_zerop (DECL_SIZE (*fieldsp
)))
5228 *fieldsp
= DECL_CHAIN (*fieldsp
);
5230 fieldsp
= &DECL_CHAIN (*fieldsp
);
5234 /* Returns TRUE iff we need a cookie when dynamically allocating an
5235 array whose elements have the indicated class TYPE. */
5238 type_requires_array_cookie (tree type
)
5241 bool has_two_argument_delete_p
= false;
5243 gcc_assert (CLASS_TYPE_P (type
));
5245 /* If there's a non-trivial destructor, we need a cookie. In order
5246 to iterate through the array calling the destructor for each
5247 element, we'll have to know how many elements there are. */
5248 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
5251 /* If the usual deallocation function is a two-argument whose second
5252 argument is of type `size_t', then we have to pass the size of
5253 the array to the deallocation function, so we will need to store
5255 fns
= lookup_fnfields (TYPE_BINFO (type
),
5256 ansi_opname (VEC_DELETE_EXPR
),
5258 /* If there are no `operator []' members, or the lookup is
5259 ambiguous, then we don't need a cookie. */
5260 if (!fns
|| fns
== error_mark_node
)
5262 /* Loop through all of the functions. */
5263 for (fns
= BASELINK_FUNCTIONS (fns
); fns
; fns
= OVL_NEXT (fns
))
5268 /* Select the current function. */
5269 fn
= OVL_CURRENT (fns
);
5270 /* See if this function is a one-argument delete function. If
5271 it is, then it will be the usual deallocation function. */
5272 second_parm
= TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (fn
)));
5273 if (second_parm
== void_list_node
)
5275 /* Do not consider this function if its second argument is an
5279 /* Otherwise, if we have a two-argument function and the second
5280 argument is `size_t', it will be the usual deallocation
5281 function -- unless there is one-argument function, too. */
5282 if (TREE_CHAIN (second_parm
) == void_list_node
5283 && same_type_p (TREE_VALUE (second_parm
), size_type_node
))
5284 has_two_argument_delete_p
= true;
5287 return has_two_argument_delete_p
;
5290 /* Finish computing the `literal type' property of class type T.
5292 At this point, we have already processed base classes and
5293 non-static data members. We need to check whether the copy
5294 constructor is trivial, the destructor is trivial, and there
5295 is a trivial default constructor or at least one constexpr
5296 constructor other than the copy constructor. */
5299 finalize_literal_type_property (tree t
)
5303 if (cxx_dialect
< cxx11
5304 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5305 CLASSTYPE_LITERAL_P (t
) = false;
5306 else if (CLASSTYPE_LITERAL_P (t
) && !TYPE_HAS_TRIVIAL_DFLT (t
)
5307 && CLASSTYPE_NON_AGGREGATE (t
)
5308 && !TYPE_HAS_CONSTEXPR_CTOR (t
))
5309 CLASSTYPE_LITERAL_P (t
) = false;
5311 if (!CLASSTYPE_LITERAL_P (t
))
5312 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5313 if (DECL_DECLARED_CONSTEXPR_P (fn
)
5314 && TREE_CODE (fn
) != TEMPLATE_DECL
5315 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
5316 && !DECL_CONSTRUCTOR_P (fn
))
5318 DECL_DECLARED_CONSTEXPR_P (fn
) = false;
5319 if (!DECL_GENERATED_P (fn
))
5321 error ("enclosing class of constexpr non-static member "
5322 "function %q+#D is not a literal type", fn
);
5323 explain_non_literal_class (t
);
5328 /* T is a non-literal type used in a context which requires a constant
5329 expression. Explain why it isn't literal. */
5332 explain_non_literal_class (tree t
)
5334 static struct pointer_set_t
*diagnosed
;
5336 if (!CLASS_TYPE_P (t
))
5338 t
= TYPE_MAIN_VARIANT (t
);
5340 if (diagnosed
== NULL
)
5341 diagnosed
= pointer_set_create ();
5342 if (pointer_set_insert (diagnosed
, t
) != 0)
5343 /* Already explained. */
5346 inform (0, "%q+T is not literal because:", t
);
5347 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5348 inform (0, " %q+T has a non-trivial destructor", t
);
5349 else if (CLASSTYPE_NON_AGGREGATE (t
)
5350 && !TYPE_HAS_TRIVIAL_DFLT (t
)
5351 && !TYPE_HAS_CONSTEXPR_CTOR (t
))
5353 inform (0, " %q+T is not an aggregate, does not have a trivial "
5354 "default constructor, and has no constexpr constructor that "
5355 "is not a copy or move constructor", t
);
5356 if (TYPE_HAS_DEFAULT_CONSTRUCTOR (t
)
5357 && !type_has_user_provided_default_constructor (t
))
5359 /* Note that we can't simply call locate_ctor because when the
5360 constructor is deleted it just returns NULL_TREE. */
5362 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5364 tree fn
= OVL_CURRENT (fns
);
5365 tree parms
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5367 parms
= skip_artificial_parms_for (fn
, parms
);
5369 if (sufficient_parms_p (parms
))
5371 if (DECL_DELETED_FN (fn
))
5372 maybe_explain_implicit_delete (fn
);
5374 explain_invalid_constexpr_fn (fn
);
5382 tree binfo
, base_binfo
, field
; int i
;
5383 for (binfo
= TYPE_BINFO (t
), i
= 0;
5384 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
5386 tree basetype
= TREE_TYPE (base_binfo
);
5387 if (!CLASSTYPE_LITERAL_P (basetype
))
5389 inform (0, " base class %qT of %q+T is non-literal",
5391 explain_non_literal_class (basetype
);
5395 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
5398 if (TREE_CODE (field
) != FIELD_DECL
)
5400 ftype
= TREE_TYPE (field
);
5401 if (!literal_type_p (ftype
))
5403 inform (0, " non-static data member %q+D has "
5404 "non-literal type", field
);
5405 if (CLASS_TYPE_P (ftype
))
5406 explain_non_literal_class (ftype
);
5412 /* Check the validity of the bases and members declared in T. Add any
5413 implicitly-generated functions (like copy-constructors and
5414 assignment operators). Compute various flag bits (like
5415 CLASSTYPE_NON_LAYOUT_POD_T) for T. This routine works purely at the C++
5416 level: i.e., independently of the ABI in use. */
5419 check_bases_and_members (tree t
)
5421 /* Nonzero if the implicitly generated copy constructor should take
5422 a non-const reference argument. */
5423 int cant_have_const_ctor
;
5424 /* Nonzero if the implicitly generated assignment operator
5425 should take a non-const reference argument. */
5426 int no_const_asn_ref
;
5428 bool saved_complex_asn_ref
;
5429 bool saved_nontrivial_dtor
;
5432 /* By default, we use const reference arguments and generate default
5434 cant_have_const_ctor
= 0;
5435 no_const_asn_ref
= 0;
5437 /* Check all the base-classes. */
5438 check_bases (t
, &cant_have_const_ctor
,
5441 /* Deduce noexcept on destructors. This needs to happen after we've set
5442 triviality flags appropriately for our bases. */
5443 if (cxx_dialect
>= cxx11
)
5444 deduce_noexcept_on_destructors (t
);
5446 /* Check all the method declarations. */
5449 /* Save the initial values of these flags which only indicate whether
5450 or not the class has user-provided functions. As we analyze the
5451 bases and members we can set these flags for other reasons. */
5452 saved_complex_asn_ref
= TYPE_HAS_COMPLEX_COPY_ASSIGN (t
);
5453 saved_nontrivial_dtor
= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
);
5455 /* Check all the data member declarations. We cannot call
5456 check_field_decls until we have called check_bases check_methods,
5457 as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR
5458 being set appropriately. */
5459 check_field_decls (t
, &access_decls
,
5460 &cant_have_const_ctor
,
5463 /* A nearly-empty class has to be vptr-containing; a nearly empty
5464 class contains just a vptr. */
5465 if (!TYPE_CONTAINS_VPTR_P (t
))
5466 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
5468 /* Do some bookkeeping that will guide the generation of implicitly
5469 declared member functions. */
5470 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5471 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5472 /* We need to call a constructor for this class if it has a
5473 user-provided constructor, or if the default constructor is going
5474 to initialize the vptr. (This is not an if-and-only-if;
5475 TYPE_NEEDS_CONSTRUCTING is set elsewhere if bases or members
5476 themselves need constructing.) */
5477 TYPE_NEEDS_CONSTRUCTING (t
)
5478 |= (type_has_user_provided_constructor (t
) || TYPE_CONTAINS_VPTR_P (t
));
5481 An aggregate is an array or a class with no user-provided
5482 constructors ... and no virtual functions.
5484 Again, other conditions for being an aggregate are checked
5486 CLASSTYPE_NON_AGGREGATE (t
)
5487 |= (type_has_user_provided_constructor (t
) || TYPE_POLYMORPHIC_P (t
));
5488 /* This is the C++98/03 definition of POD; it changed in C++0x, but we
5489 retain the old definition internally for ABI reasons. */
5490 CLASSTYPE_NON_LAYOUT_POD_P (t
)
5491 |= (CLASSTYPE_NON_AGGREGATE (t
)
5492 || saved_nontrivial_dtor
|| saved_complex_asn_ref
);
5493 CLASSTYPE_NON_STD_LAYOUT (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5494 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5495 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5496 TYPE_HAS_COMPLEX_DFLT (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5498 /* If the class has no user-declared constructor, but does have
5499 non-static const or reference data members that can never be
5500 initialized, issue a warning. */
5501 if (warn_uninitialized
5502 /* Classes with user-declared constructors are presumed to
5503 initialize these members. */
5504 && !TYPE_HAS_USER_CONSTRUCTOR (t
)
5505 /* Aggregates can be initialized with brace-enclosed
5507 && CLASSTYPE_NON_AGGREGATE (t
))
5511 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
5515 if (TREE_CODE (field
) != FIELD_DECL
5516 || DECL_INITIAL (field
) != NULL_TREE
)
5519 type
= TREE_TYPE (field
);
5520 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5521 warning (OPT_Wuninitialized
, "non-static reference %q+#D "
5522 "in class without a constructor", field
);
5523 else if (CP_TYPE_CONST_P (type
)
5524 && (!CLASS_TYPE_P (type
)
5525 || !TYPE_HAS_DEFAULT_CONSTRUCTOR (type
)))
5526 warning (OPT_Wuninitialized
, "non-static const member %q+#D "
5527 "in class without a constructor", field
);
5531 /* Synthesize any needed methods. */
5532 add_implicitly_declared_members (t
, &access_decls
,
5533 cant_have_const_ctor
,
5536 /* Check defaulted declarations here so we have cant_have_const_ctor
5537 and don't need to worry about clones. */
5538 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5539 if (!DECL_ARTIFICIAL (fn
) && DECL_DEFAULTED_IN_CLASS_P (fn
))
5541 int copy
= copy_fn_p (fn
);
5545 = (DECL_CONSTRUCTOR_P (fn
) ? !cant_have_const_ctor
5546 : !no_const_asn_ref
);
5547 bool fn_const_p
= (copy
== 2);
5549 if (fn_const_p
&& !imp_const_p
)
5550 /* If the function is defaulted outside the class, we just
5551 give the synthesis error. */
5552 error ("%q+D declared to take const reference, but implicit "
5553 "declaration would take non-const", fn
);
5555 defaulted_late_check (fn
);
5558 if (LAMBDA_TYPE_P (t
))
5560 /* "The closure type associated with a lambda-expression has a deleted
5561 default constructor and a deleted copy assignment operator." */
5562 TYPE_NEEDS_CONSTRUCTING (t
) = 1;
5563 TYPE_HAS_COMPLEX_DFLT (t
) = 1;
5564 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
5565 CLASSTYPE_LAZY_MOVE_ASSIGN (t
) = 0;
5567 /* "This class type is not an aggregate." */
5568 CLASSTYPE_NON_AGGREGATE (t
) = 1;
5571 /* Compute the 'literal type' property before we
5572 do anything with non-static member functions. */
5573 finalize_literal_type_property (t
);
5575 /* Create the in-charge and not-in-charge variants of constructors
5577 clone_constructors_and_destructors (t
);
5579 /* Process the using-declarations. */
5580 for (; access_decls
; access_decls
= TREE_CHAIN (access_decls
))
5581 handle_using_decl (TREE_VALUE (access_decls
), t
);
5583 /* Build and sort the CLASSTYPE_METHOD_VEC. */
5584 finish_struct_methods (t
);
5586 /* Figure out whether or not we will need a cookie when dynamically
5587 allocating an array of this type. */
5588 TYPE_LANG_SPECIFIC (t
)->u
.c
.vec_new_uses_cookie
5589 = type_requires_array_cookie (t
);
5592 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
5593 accordingly. If a new vfield was created (because T doesn't have a
5594 primary base class), then the newly created field is returned. It
5595 is not added to the TYPE_FIELDS list; it is the caller's
5596 responsibility to do that. Accumulate declared virtual functions
5600 create_vtable_ptr (tree t
, tree
* virtuals_p
)
5604 /* Collect the virtual functions declared in T. */
5605 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5606 if (DECL_VINDEX (fn
) && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn
)
5607 && TREE_CODE (DECL_VINDEX (fn
)) != INTEGER_CST
)
5609 tree new_virtual
= make_node (TREE_LIST
);
5611 BV_FN (new_virtual
) = fn
;
5612 BV_DELTA (new_virtual
) = integer_zero_node
;
5613 BV_VCALL_INDEX (new_virtual
) = NULL_TREE
;
5615 TREE_CHAIN (new_virtual
) = *virtuals_p
;
5616 *virtuals_p
= new_virtual
;
5619 /* If we couldn't find an appropriate base class, create a new field
5620 here. Even if there weren't any new virtual functions, we might need a
5621 new virtual function table if we're supposed to include vptrs in
5622 all classes that need them. */
5623 if (!TYPE_VFIELD (t
) && (*virtuals_p
|| TYPE_CONTAINS_VPTR_P (t
)))
5625 /* We build this decl with vtbl_ptr_type_node, which is a
5626 `vtable_entry_type*'. It might seem more precise to use
5627 `vtable_entry_type (*)[N]' where N is the number of virtual
5628 functions. However, that would require the vtable pointer in
5629 base classes to have a different type than the vtable pointer
5630 in derived classes. We could make that happen, but that
5631 still wouldn't solve all the problems. In particular, the
5632 type-based alias analysis code would decide that assignments
5633 to the base class vtable pointer can't alias assignments to
5634 the derived class vtable pointer, since they have different
5635 types. Thus, in a derived class destructor, where the base
5636 class constructor was inlined, we could generate bad code for
5637 setting up the vtable pointer.
5639 Therefore, we use one type for all vtable pointers. We still
5640 use a type-correct type; it's just doesn't indicate the array
5641 bounds. That's better than using `void*' or some such; it's
5642 cleaner, and it let's the alias analysis code know that these
5643 stores cannot alias stores to void*! */
5646 field
= build_decl (input_location
,
5647 FIELD_DECL
, get_vfield_name (t
), vtbl_ptr_type_node
);
5648 DECL_VIRTUAL_P (field
) = 1;
5649 DECL_ARTIFICIAL (field
) = 1;
5650 DECL_FIELD_CONTEXT (field
) = t
;
5651 DECL_FCONTEXT (field
) = t
;
5652 if (TYPE_PACKED (t
))
5653 DECL_PACKED (field
) = 1;
5655 TYPE_VFIELD (t
) = field
;
5657 /* This class is non-empty. */
5658 CLASSTYPE_EMPTY_P (t
) = 0;
5666 /* Add OFFSET to all base types of BINFO which is a base in the
5667 hierarchy dominated by T.
5669 OFFSET, which is a type offset, is number of bytes. */
5672 propagate_binfo_offsets (tree binfo
, tree offset
)
5678 /* Update BINFO's offset. */
5679 BINFO_OFFSET (binfo
)
5680 = convert (sizetype
,
5681 size_binop (PLUS_EXPR
,
5682 convert (ssizetype
, BINFO_OFFSET (binfo
)),
5685 /* Find the primary base class. */
5686 primary_binfo
= get_primary_binfo (binfo
);
5688 if (primary_binfo
&& BINFO_INHERITANCE_CHAIN (primary_binfo
) == binfo
)
5689 propagate_binfo_offsets (primary_binfo
, offset
);
5691 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
5693 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5695 /* Don't do the primary base twice. */
5696 if (base_binfo
== primary_binfo
)
5699 if (BINFO_VIRTUAL_P (base_binfo
))
5702 propagate_binfo_offsets (base_binfo
, offset
);
5706 /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update
5707 TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of
5708 empty subobjects of T. */
5711 layout_virtual_bases (record_layout_info rli
, splay_tree offsets
)
5715 bool first_vbase
= true;
5718 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t
)) == 0)
5721 if (!abi_version_at_least(2))
5723 /* In G++ 3.2, we incorrectly rounded the size before laying out
5724 the virtual bases. */
5725 finish_record_layout (rli
, /*free_p=*/false);
5726 #ifdef STRUCTURE_SIZE_BOUNDARY
5727 /* Packed structures don't need to have minimum size. */
5728 if (! TYPE_PACKED (t
))
5729 TYPE_ALIGN (t
) = MAX (TYPE_ALIGN (t
), (unsigned) STRUCTURE_SIZE_BOUNDARY
);
5731 rli
->offset
= TYPE_SIZE_UNIT (t
);
5732 rli
->bitpos
= bitsize_zero_node
;
5733 rli
->record_align
= TYPE_ALIGN (t
);
5736 /* Find the last field. The artificial fields created for virtual
5737 bases will go after the last extant field to date. */
5738 next_field
= &TYPE_FIELDS (t
);
5740 next_field
= &DECL_CHAIN (*next_field
);
5742 /* Go through the virtual bases, allocating space for each virtual
5743 base that is not already a primary base class. These are
5744 allocated in inheritance graph order. */
5745 for (vbase
= TYPE_BINFO (t
); vbase
; vbase
= TREE_CHAIN (vbase
))
5747 if (!BINFO_VIRTUAL_P (vbase
))
5750 if (!BINFO_PRIMARY_P (vbase
))
5752 tree basetype
= TREE_TYPE (vbase
);
5754 /* This virtual base is not a primary base of any class in the
5755 hierarchy, so we have to add space for it. */
5756 next_field
= build_base_field (rli
, vbase
,
5757 offsets
, next_field
);
5759 /* If the first virtual base might have been placed at a
5760 lower address, had we started from CLASSTYPE_SIZE, rather
5761 than TYPE_SIZE, issue a warning. There can be both false
5762 positives and false negatives from this warning in rare
5763 cases; to deal with all the possibilities would probably
5764 require performing both layout algorithms and comparing
5765 the results which is not particularly tractable. */
5769 (size_binop (CEIL_DIV_EXPR
,
5770 round_up_loc (input_location
,
5772 CLASSTYPE_ALIGN (basetype
)),
5774 BINFO_OFFSET (vbase
))))
5776 "offset of virtual base %qT is not ABI-compliant and "
5777 "may change in a future version of GCC",
5780 first_vbase
= false;
5785 /* Returns the offset of the byte just past the end of the base class
5789 end_of_base (tree binfo
)
5793 if (!CLASSTYPE_AS_BASE (BINFO_TYPE (binfo
)))
5794 size
= TYPE_SIZE_UNIT (char_type_node
);
5795 else if (is_empty_class (BINFO_TYPE (binfo
)))
5796 /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to
5797 allocate some space for it. It cannot have virtual bases, so
5798 TYPE_SIZE_UNIT is fine. */
5799 size
= TYPE_SIZE_UNIT (BINFO_TYPE (binfo
));
5801 size
= CLASSTYPE_SIZE_UNIT (BINFO_TYPE (binfo
));
5803 return size_binop (PLUS_EXPR
, BINFO_OFFSET (binfo
), size
);
5806 /* Returns the offset of the byte just past the end of the base class
5807 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
5808 only non-virtual bases are included. */
5811 end_of_class (tree t
, int include_virtuals_p
)
5813 tree result
= size_zero_node
;
5814 vec
<tree
, va_gc
> *vbases
;
5820 for (binfo
= TYPE_BINFO (t
), i
= 0;
5821 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5823 if (!include_virtuals_p
5824 && BINFO_VIRTUAL_P (base_binfo
)
5825 && (!BINFO_PRIMARY_P (base_binfo
)
5826 || BINFO_INHERITANCE_CHAIN (base_binfo
) != TYPE_BINFO (t
)))
5829 offset
= end_of_base (base_binfo
);
5830 if (INT_CST_LT_UNSIGNED (result
, offset
))
5834 /* G++ 3.2 did not check indirect virtual bases. */
5835 if (abi_version_at_least (2) && include_virtuals_p
)
5836 for (vbases
= CLASSTYPE_VBASECLASSES (t
), i
= 0;
5837 vec_safe_iterate (vbases
, i
, &base_binfo
); i
++)
5839 offset
= end_of_base (base_binfo
);
5840 if (INT_CST_LT_UNSIGNED (result
, offset
))
5847 /* Warn about bases of T that are inaccessible because they are
5848 ambiguous. For example:
5851 struct T : public S {};
5852 struct U : public S, public T {};
5854 Here, `(S*) new U' is not allowed because there are two `S'
5858 warn_about_ambiguous_bases (tree t
)
5861 vec
<tree
, va_gc
> *vbases
;
5866 /* If there are no repeated bases, nothing can be ambiguous. */
5867 if (!CLASSTYPE_REPEATED_BASE_P (t
))
5870 /* Check direct bases. */
5871 for (binfo
= TYPE_BINFO (t
), i
= 0;
5872 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5874 basetype
= BINFO_TYPE (base_binfo
);
5876 if (!uniquely_derived_from_p (basetype
, t
))
5877 warning (0, "direct base %qT inaccessible in %qT due to ambiguity",
5881 /* Check for ambiguous virtual bases. */
5883 for (vbases
= CLASSTYPE_VBASECLASSES (t
), i
= 0;
5884 vec_safe_iterate (vbases
, i
, &binfo
); i
++)
5886 basetype
= BINFO_TYPE (binfo
);
5888 if (!uniquely_derived_from_p (basetype
, t
))
5889 warning (OPT_Wextra
, "virtual base %qT inaccessible in %qT due "
5890 "to ambiguity", basetype
, t
);
5894 /* Compare two INTEGER_CSTs K1 and K2. */
5897 splay_tree_compare_integer_csts (splay_tree_key k1
, splay_tree_key k2
)
5899 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
5902 /* Increase the size indicated in RLI to account for empty classes
5903 that are "off the end" of the class. */
5906 include_empty_classes (record_layout_info rli
)
5911 /* It might be the case that we grew the class to allocate a
5912 zero-sized base class. That won't be reflected in RLI, yet,
5913 because we are willing to overlay multiple bases at the same
5914 offset. However, now we need to make sure that RLI is big enough
5915 to reflect the entire class. */
5916 eoc
= end_of_class (rli
->t
,
5917 CLASSTYPE_AS_BASE (rli
->t
) != NULL_TREE
);
5918 rli_size
= rli_size_unit_so_far (rli
);
5919 if (TREE_CODE (rli_size
) == INTEGER_CST
5920 && INT_CST_LT_UNSIGNED (rli_size
, eoc
))
5922 if (!abi_version_at_least (2))
5923 /* In version 1 of the ABI, the size of a class that ends with
5924 a bitfield was not rounded up to a whole multiple of a
5925 byte. Because rli_size_unit_so_far returns only the number
5926 of fully allocated bytes, any extra bits were not included
5928 rli
->bitpos
= round_down (rli
->bitpos
, BITS_PER_UNIT
);
5930 /* The size should have been rounded to a whole byte. */
5931 gcc_assert (tree_int_cst_equal
5932 (rli
->bitpos
, round_down (rli
->bitpos
, BITS_PER_UNIT
)));
5934 = size_binop (PLUS_EXPR
,
5936 size_binop (MULT_EXPR
,
5937 convert (bitsizetype
,
5938 size_binop (MINUS_EXPR
,
5940 bitsize_int (BITS_PER_UNIT
)));
5941 normalize_rli (rli
);
5945 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
5946 BINFO_OFFSETs for all of the base-classes. Position the vtable
5947 pointer. Accumulate declared virtual functions on VIRTUALS_P. */
5950 layout_class_type (tree t
, tree
*virtuals_p
)
5952 tree non_static_data_members
;
5955 record_layout_info rli
;
5956 /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of
5957 types that appear at that offset. */
5958 splay_tree empty_base_offsets
;
5959 /* True if the last field laid out was a bit-field. */
5960 bool last_field_was_bitfield
= false;
5961 /* The location at which the next field should be inserted. */
5963 /* T, as a base class. */
5966 /* Keep track of the first non-static data member. */
5967 non_static_data_members
= TYPE_FIELDS (t
);
5969 /* Start laying out the record. */
5970 rli
= start_record_layout (t
);
5972 /* Mark all the primary bases in the hierarchy. */
5973 determine_primary_bases (t
);
5975 /* Create a pointer to our virtual function table. */
5976 vptr
= create_vtable_ptr (t
, virtuals_p
);
5978 /* The vptr is always the first thing in the class. */
5981 DECL_CHAIN (vptr
) = TYPE_FIELDS (t
);
5982 TYPE_FIELDS (t
) = vptr
;
5983 next_field
= &DECL_CHAIN (vptr
);
5984 place_field (rli
, vptr
);
5987 next_field
= &TYPE_FIELDS (t
);
5989 /* Build FIELD_DECLs for all of the non-virtual base-types. */
5990 empty_base_offsets
= splay_tree_new (splay_tree_compare_integer_csts
,
5992 build_base_fields (rli
, empty_base_offsets
, next_field
);
5994 /* Layout the non-static data members. */
5995 for (field
= non_static_data_members
; field
; field
= DECL_CHAIN (field
))
6000 /* We still pass things that aren't non-static data members to
6001 the back end, in case it wants to do something with them. */
6002 if (TREE_CODE (field
) != FIELD_DECL
)
6004 place_field (rli
, field
);
6005 /* If the static data member has incomplete type, keep track
6006 of it so that it can be completed later. (The handling
6007 of pending statics in finish_record_layout is
6008 insufficient; consider:
6011 struct S2 { static S1 s1; };
6013 At this point, finish_record_layout will be called, but
6014 S1 is still incomplete.) */
6017 maybe_register_incomplete_var (field
);
6018 /* The visibility of static data members is determined
6019 at their point of declaration, not their point of
6021 determine_visibility (field
);
6026 type
= TREE_TYPE (field
);
6027 if (type
== error_mark_node
)
6030 padding
= NULL_TREE
;
6032 /* If this field is a bit-field whose width is greater than its
6033 type, then there are some special rules for allocating
6035 if (DECL_C_BIT_FIELD (field
)
6036 && INT_CST_LT (TYPE_SIZE (type
), DECL_SIZE (field
)))
6040 bool was_unnamed_p
= false;
6041 /* We must allocate the bits as if suitably aligned for the
6042 longest integer type that fits in this many bits. type
6043 of the field. Then, we are supposed to use the left over
6044 bits as additional padding. */
6045 for (itk
= itk_char
; itk
!= itk_none
; ++itk
)
6046 if (integer_types
[itk
] != NULL_TREE
6047 && (INT_CST_LT (size_int (MAX_FIXED_MODE_SIZE
),
6048 TYPE_SIZE (integer_types
[itk
]))
6049 || INT_CST_LT (DECL_SIZE (field
),
6050 TYPE_SIZE (integer_types
[itk
]))))
6053 /* ITK now indicates a type that is too large for the
6054 field. We have to back up by one to find the largest
6059 integer_type
= integer_types
[itk
];
6060 } while (itk
> 0 && integer_type
== NULL_TREE
);
6062 /* Figure out how much additional padding is required. GCC
6063 3.2 always created a padding field, even if it had zero
6065 if (!abi_version_at_least (2)
6066 || INT_CST_LT (TYPE_SIZE (integer_type
), DECL_SIZE (field
)))
6068 if (abi_version_at_least (2) && TREE_CODE (t
) == UNION_TYPE
)
6069 /* In a union, the padding field must have the full width
6070 of the bit-field; all fields start at offset zero. */
6071 padding
= DECL_SIZE (field
);
6074 if (TREE_CODE (t
) == UNION_TYPE
)
6075 warning (OPT_Wabi
, "size assigned to %qT may not be "
6076 "ABI-compliant and may change in a future "
6079 padding
= size_binop (MINUS_EXPR
, DECL_SIZE (field
),
6080 TYPE_SIZE (integer_type
));
6083 #ifdef PCC_BITFIELD_TYPE_MATTERS
6084 /* An unnamed bitfield does not normally affect the
6085 alignment of the containing class on a target where
6086 PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not
6087 make any exceptions for unnamed bitfields when the
6088 bitfields are longer than their types. Therefore, we
6089 temporarily give the field a name. */
6090 if (PCC_BITFIELD_TYPE_MATTERS
&& !DECL_NAME (field
))
6092 was_unnamed_p
= true;
6093 DECL_NAME (field
) = make_anon_name ();
6096 DECL_SIZE (field
) = TYPE_SIZE (integer_type
);
6097 DECL_ALIGN (field
) = TYPE_ALIGN (integer_type
);
6098 DECL_USER_ALIGN (field
) = TYPE_USER_ALIGN (integer_type
);
6099 layout_nonempty_base_or_field (rli
, field
, NULL_TREE
,
6100 empty_base_offsets
);
6102 DECL_NAME (field
) = NULL_TREE
;
6103 /* Now that layout has been performed, set the size of the
6104 field to the size of its declared type; the rest of the
6105 field is effectively invisible. */
6106 DECL_SIZE (field
) = TYPE_SIZE (type
);
6107 /* We must also reset the DECL_MODE of the field. */
6108 if (abi_version_at_least (2))
6109 DECL_MODE (field
) = TYPE_MODE (type
);
6111 && DECL_MODE (field
) != TYPE_MODE (type
))
6112 /* Versions of G++ before G++ 3.4 did not reset the
6115 "the offset of %qD may not be ABI-compliant and may "
6116 "change in a future version of GCC", field
);
6119 layout_nonempty_base_or_field (rli
, field
, NULL_TREE
,
6120 empty_base_offsets
);
6122 /* Remember the location of any empty classes in FIELD. */
6123 if (abi_version_at_least (2))
6124 record_subobject_offsets (TREE_TYPE (field
),
6125 byte_position(field
),
6127 /*is_data_member=*/true);
6129 /* If a bit-field does not immediately follow another bit-field,
6130 and yet it starts in the middle of a byte, we have failed to
6131 comply with the ABI. */
6133 && DECL_C_BIT_FIELD (field
)
6134 /* The TREE_NO_WARNING flag gets set by Objective-C when
6135 laying out an Objective-C class. The ObjC ABI differs
6136 from the C++ ABI, and so we do not want a warning
6138 && !TREE_NO_WARNING (field
)
6139 && !last_field_was_bitfield
6140 && !integer_zerop (size_binop (TRUNC_MOD_EXPR
,
6141 DECL_FIELD_BIT_OFFSET (field
),
6142 bitsize_unit_node
)))
6143 warning (OPT_Wabi
, "offset of %q+D is not ABI-compliant and may "
6144 "change in a future version of GCC", field
);
6146 /* G++ used to use DECL_FIELD_OFFSET as if it were the byte
6147 offset of the field. */
6149 && !abi_version_at_least (2)
6150 && !tree_int_cst_equal (DECL_FIELD_OFFSET (field
),
6151 byte_position (field
))
6152 && contains_empty_class_p (TREE_TYPE (field
)))
6153 warning (OPT_Wabi
, "%q+D contains empty classes which may cause base "
6154 "classes to be placed at different locations in a "
6155 "future version of GCC", field
);
6157 /* The middle end uses the type of expressions to determine the
6158 possible range of expression values. In order to optimize
6159 "x.i > 7" to "false" for a 2-bit bitfield "i", the middle end
6160 must be made aware of the width of "i", via its type.
6162 Because C++ does not have integer types of arbitrary width,
6163 we must (for the purposes of the front end) convert from the
6164 type assigned here to the declared type of the bitfield
6165 whenever a bitfield expression is used as an rvalue.
6166 Similarly, when assigning a value to a bitfield, the value
6167 must be converted to the type given the bitfield here. */
6168 if (DECL_C_BIT_FIELD (field
))
6170 unsigned HOST_WIDE_INT width
;
6171 tree ftype
= TREE_TYPE (field
);
6172 width
= tree_low_cst (DECL_SIZE (field
), /*unsignedp=*/1);
6173 if (width
!= TYPE_PRECISION (ftype
))
6176 = c_build_bitfield_integer_type (width
,
6177 TYPE_UNSIGNED (ftype
));
6179 = cp_build_qualified_type (TREE_TYPE (field
),
6180 cp_type_quals (ftype
));
6184 /* If we needed additional padding after this field, add it
6190 padding_field
= build_decl (input_location
,
6194 DECL_BIT_FIELD (padding_field
) = 1;
6195 DECL_SIZE (padding_field
) = padding
;
6196 DECL_CONTEXT (padding_field
) = t
;
6197 DECL_ARTIFICIAL (padding_field
) = 1;
6198 DECL_IGNORED_P (padding_field
) = 1;
6199 layout_nonempty_base_or_field (rli
, padding_field
,
6201 empty_base_offsets
);
6204 last_field_was_bitfield
= DECL_C_BIT_FIELD (field
);
6207 if (abi_version_at_least (2) && !integer_zerop (rli
->bitpos
))
6209 /* Make sure that we are on a byte boundary so that the size of
6210 the class without virtual bases will always be a round number
6212 rli
->bitpos
= round_up_loc (input_location
, rli
->bitpos
, BITS_PER_UNIT
);
6213 normalize_rli (rli
);
6216 /* G++ 3.2 does not allow virtual bases to be overlaid with tail
6218 if (!abi_version_at_least (2))
6219 include_empty_classes(rli
);
6221 /* Delete all zero-width bit-fields from the list of fields. Now
6222 that the type is laid out they are no longer important. */
6223 remove_zero_width_bit_fields (t
);
6225 /* Create the version of T used for virtual bases. We do not use
6226 make_class_type for this version; this is an artificial type. For
6227 a POD type, we just reuse T. */
6228 if (CLASSTYPE_NON_LAYOUT_POD_P (t
) || CLASSTYPE_EMPTY_P (t
))
6230 base_t
= make_node (TREE_CODE (t
));
6232 /* Set the size and alignment for the new type. In G++ 3.2, all
6233 empty classes were considered to have size zero when used as
6235 if (!abi_version_at_least (2) && CLASSTYPE_EMPTY_P (t
))
6237 TYPE_SIZE (base_t
) = bitsize_zero_node
;
6238 TYPE_SIZE_UNIT (base_t
) = size_zero_node
;
6239 if (warn_abi
&& !integer_zerop (rli_size_unit_so_far (rli
)))
6241 "layout of classes derived from empty class %qT "
6242 "may change in a future version of GCC",
6249 /* If the ABI version is not at least two, and the last
6250 field was a bit-field, RLI may not be on a byte
6251 boundary. In particular, rli_size_unit_so_far might
6252 indicate the last complete byte, while rli_size_so_far
6253 indicates the total number of bits used. Therefore,
6254 rli_size_so_far, rather than rli_size_unit_so_far, is
6255 used to compute TYPE_SIZE_UNIT. */
6256 eoc
= end_of_class (t
, /*include_virtuals_p=*/0);
6257 TYPE_SIZE_UNIT (base_t
)
6258 = size_binop (MAX_EXPR
,
6260 size_binop (CEIL_DIV_EXPR
,
6261 rli_size_so_far (rli
),
6262 bitsize_int (BITS_PER_UNIT
))),
6265 = size_binop (MAX_EXPR
,
6266 rli_size_so_far (rli
),
6267 size_binop (MULT_EXPR
,
6268 convert (bitsizetype
, eoc
),
6269 bitsize_int (BITS_PER_UNIT
)));
6271 TYPE_ALIGN (base_t
) = rli
->record_align
;
6272 TYPE_USER_ALIGN (base_t
) = TYPE_USER_ALIGN (t
);
6274 /* Copy the fields from T. */
6275 next_field
= &TYPE_FIELDS (base_t
);
6276 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
6277 if (TREE_CODE (field
) == FIELD_DECL
)
6279 *next_field
= build_decl (input_location
,
6283 DECL_CONTEXT (*next_field
) = base_t
;
6284 DECL_FIELD_OFFSET (*next_field
) = DECL_FIELD_OFFSET (field
);
6285 DECL_FIELD_BIT_OFFSET (*next_field
)
6286 = DECL_FIELD_BIT_OFFSET (field
);
6287 DECL_SIZE (*next_field
) = DECL_SIZE (field
);
6288 DECL_MODE (*next_field
) = DECL_MODE (field
);
6289 next_field
= &DECL_CHAIN (*next_field
);
6292 /* Record the base version of the type. */
6293 CLASSTYPE_AS_BASE (t
) = base_t
;
6294 TYPE_CONTEXT (base_t
) = t
;
6297 CLASSTYPE_AS_BASE (t
) = t
;
6299 /* Every empty class contains an empty class. */
6300 if (CLASSTYPE_EMPTY_P (t
))
6301 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 1;
6303 /* Set the TYPE_DECL for this type to contain the right
6304 value for DECL_OFFSET, so that we can use it as part
6305 of a COMPONENT_REF for multiple inheritance. */
6306 layout_decl (TYPE_MAIN_DECL (t
), 0);
6308 /* Now fix up any virtual base class types that we left lying
6309 around. We must get these done before we try to lay out the
6310 virtual function table. As a side-effect, this will remove the
6311 base subobject fields. */
6312 layout_virtual_bases (rli
, empty_base_offsets
);
6314 /* Make sure that empty classes are reflected in RLI at this
6316 include_empty_classes(rli
);
6318 /* Make sure not to create any structures with zero size. */
6319 if (integer_zerop (rli_size_unit_so_far (rli
)) && CLASSTYPE_EMPTY_P (t
))
6321 build_decl (input_location
,
6322 FIELD_DECL
, NULL_TREE
, char_type_node
));
6324 /* If this is a non-POD, declaring it packed makes a difference to how it
6325 can be used as a field; don't let finalize_record_size undo it. */
6326 if (TYPE_PACKED (t
) && !layout_pod_type_p (t
))
6327 rli
->packed_maybe_necessary
= true;
6329 /* Let the back end lay out the type. */
6330 finish_record_layout (rli
, /*free_p=*/true);
6332 if (TYPE_SIZE_UNIT (t
)
6333 && TREE_CODE (TYPE_SIZE_UNIT (t
)) == INTEGER_CST
6334 && !TREE_OVERFLOW (TYPE_SIZE_UNIT (t
))
6335 && !valid_constant_size_p (TYPE_SIZE_UNIT (t
)))
6336 error ("type %qT is too large", t
);
6338 /* Warn about bases that can't be talked about due to ambiguity. */
6339 warn_about_ambiguous_bases (t
);
6341 /* Now that we're done with layout, give the base fields the real types. */
6342 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
6343 if (DECL_ARTIFICIAL (field
) && IS_FAKE_BASE_TYPE (TREE_TYPE (field
)))
6344 TREE_TYPE (field
) = TYPE_CONTEXT (TREE_TYPE (field
));
6347 splay_tree_delete (empty_base_offsets
);
6349 if (CLASSTYPE_EMPTY_P (t
)
6350 && tree_int_cst_lt (sizeof_biggest_empty_class
,
6351 TYPE_SIZE_UNIT (t
)))
6352 sizeof_biggest_empty_class
= TYPE_SIZE_UNIT (t
);
6355 /* Determine the "key method" for the class type indicated by TYPE,
6356 and set CLASSTYPE_KEY_METHOD accordingly. */
6359 determine_key_method (tree type
)
6363 if (TYPE_FOR_JAVA (type
)
6364 || processing_template_decl
6365 || CLASSTYPE_TEMPLATE_INSTANTIATION (type
)
6366 || CLASSTYPE_INTERFACE_KNOWN (type
))
6369 /* The key method is the first non-pure virtual function that is not
6370 inline at the point of class definition. On some targets the
6371 key function may not be inline; those targets should not call
6372 this function until the end of the translation unit. */
6373 for (method
= TYPE_METHODS (type
); method
!= NULL_TREE
;
6374 method
= DECL_CHAIN (method
))
6375 if (DECL_VINDEX (method
) != NULL_TREE
6376 && ! DECL_DECLARED_INLINE_P (method
)
6377 && ! DECL_PURE_VIRTUAL_P (method
))
6379 CLASSTYPE_KEY_METHOD (type
) = method
;
6387 /* Allocate and return an instance of struct sorted_fields_type with
6390 static struct sorted_fields_type
*
6391 sorted_fields_type_new (int n
)
6393 struct sorted_fields_type
*sft
;
6394 sft
= ggc_alloc_sorted_fields_type (sizeof (struct sorted_fields_type
)
6395 + n
* sizeof (tree
));
6402 /* Perform processing required when the definition of T (a class type)
6406 finish_struct_1 (tree t
)
6409 /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */
6410 tree virtuals
= NULL_TREE
;
6412 if (COMPLETE_TYPE_P (t
))
6414 gcc_assert (MAYBE_CLASS_TYPE_P (t
));
6415 error ("redefinition of %q#T", t
);
6420 /* If this type was previously laid out as a forward reference,
6421 make sure we lay it out again. */
6422 TYPE_SIZE (t
) = NULL_TREE
;
6423 CLASSTYPE_PRIMARY_BINFO (t
) = NULL_TREE
;
6425 /* Make assumptions about the class; we'll reset the flags if
6427 CLASSTYPE_EMPTY_P (t
) = 1;
6428 CLASSTYPE_NEARLY_EMPTY_P (t
) = 1;
6429 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 0;
6430 CLASSTYPE_LITERAL_P (t
) = true;
6432 /* Do end-of-class semantic processing: checking the validity of the
6433 bases and members and add implicitly generated methods. */
6434 check_bases_and_members (t
);
6436 /* Find the key method. */
6437 if (TYPE_CONTAINS_VPTR_P (t
))
6439 /* The Itanium C++ ABI permits the key method to be chosen when
6440 the class is defined -- even though the key method so
6441 selected may later turn out to be an inline function. On
6442 some systems (such as ARM Symbian OS) the key method cannot
6443 be determined until the end of the translation unit. On such
6444 systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which
6445 will cause the class to be added to KEYED_CLASSES. Then, in
6446 finish_file we will determine the key method. */
6447 if (targetm
.cxx
.key_method_may_be_inline ())
6448 determine_key_method (t
);
6450 /* If a polymorphic class has no key method, we may emit the vtable
6451 in every translation unit where the class definition appears. */
6452 if (CLASSTYPE_KEY_METHOD (t
) == NULL_TREE
)
6453 keyed_classes
= tree_cons (NULL_TREE
, t
, keyed_classes
);
6456 /* Layout the class itself. */
6457 layout_class_type (t
, &virtuals
);
6458 if (CLASSTYPE_AS_BASE (t
) != t
)
6459 /* We use the base type for trivial assignments, and hence it
6461 compute_record_mode (CLASSTYPE_AS_BASE (t
));
6463 virtuals
= modify_all_vtables (t
, nreverse (virtuals
));
6465 /* If necessary, create the primary vtable for this class. */
6466 if (virtuals
|| TYPE_CONTAINS_VPTR_P (t
))
6468 /* We must enter these virtuals into the table. */
6469 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
6470 build_primary_vtable (NULL_TREE
, t
);
6471 else if (! BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (t
)))
6472 /* Here we know enough to change the type of our virtual
6473 function table, but we will wait until later this function. */
6474 build_primary_vtable (CLASSTYPE_PRIMARY_BINFO (t
), t
);
6476 /* If we're warning about ABI tags, check the types of the new
6477 virtual functions. */
6479 for (tree v
= virtuals
; v
; v
= TREE_CHAIN (v
))
6480 check_abi_tags (t
, TREE_VALUE (v
));
6483 if (TYPE_CONTAINS_VPTR_P (t
))
6488 if (BINFO_VTABLE (TYPE_BINFO (t
)))
6489 gcc_assert (DECL_VIRTUAL_P (BINFO_VTABLE (TYPE_BINFO (t
))));
6490 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
6491 gcc_assert (BINFO_VIRTUALS (TYPE_BINFO (t
)) == NULL_TREE
);
6493 /* Add entries for virtual functions introduced by this class. */
6494 BINFO_VIRTUALS (TYPE_BINFO (t
))
6495 = chainon (BINFO_VIRTUALS (TYPE_BINFO (t
)), virtuals
);
6497 /* Set DECL_VINDEX for all functions declared in this class. */
6498 for (vindex
= 0, fn
= BINFO_VIRTUALS (TYPE_BINFO (t
));
6500 fn
= TREE_CHAIN (fn
),
6501 vindex
+= (TARGET_VTABLE_USES_DESCRIPTORS
6502 ? TARGET_VTABLE_USES_DESCRIPTORS
: 1))
6504 tree fndecl
= BV_FN (fn
);
6506 if (DECL_THUNK_P (fndecl
))
6507 /* A thunk. We should never be calling this entry directly
6508 from this vtable -- we'd use the entry for the non
6509 thunk base function. */
6510 DECL_VINDEX (fndecl
) = NULL_TREE
;
6511 else if (TREE_CODE (DECL_VINDEX (fndecl
)) != INTEGER_CST
)
6512 DECL_VINDEX (fndecl
) = build_int_cst (NULL_TREE
, vindex
);
6516 finish_struct_bits (t
);
6517 set_method_tm_attributes (t
);
6519 /* Complete the rtl for any static member objects of the type we're
6521 for (x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
6522 if (VAR_P (x
) && TREE_STATIC (x
)
6523 && TREE_TYPE (x
) != error_mark_node
6524 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (x
)), t
))
6525 DECL_MODE (x
) = TYPE_MODE (t
);
6527 /* Done with FIELDS...now decide whether to sort these for
6528 faster lookups later.
6530 We use a small number because most searches fail (succeeding
6531 ultimately as the search bores through the inheritance
6532 hierarchy), and we want this failure to occur quickly. */
6534 insert_into_classtype_sorted_fields (TYPE_FIELDS (t
), t
, 8);
6536 /* Complain if one of the field types requires lower visibility. */
6537 constrain_class_visibility (t
);
6539 /* Make the rtl for any new vtables we have created, and unmark
6540 the base types we marked. */
6543 /* Build the VTT for T. */
6546 /* This warning does not make sense for Java classes, since they
6547 cannot have destructors. */
6548 if (!TYPE_FOR_JAVA (t
) && warn_nonvdtor
&& TYPE_POLYMORPHIC_P (t
))
6552 dtor
= CLASSTYPE_DESTRUCTORS (t
);
6553 if (/* An implicitly declared destructor is always public. And,
6554 if it were virtual, we would have created it by now. */
6556 || (!DECL_VINDEX (dtor
)
6557 && (/* public non-virtual */
6558 (!TREE_PRIVATE (dtor
) && !TREE_PROTECTED (dtor
))
6559 || (/* non-public non-virtual with friends */
6560 (TREE_PRIVATE (dtor
) || TREE_PROTECTED (dtor
))
6561 && (CLASSTYPE_FRIEND_CLASSES (t
)
6562 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t
)))))))
6563 warning (OPT_Wnon_virtual_dtor
,
6564 "%q#T has virtual functions and accessible"
6565 " non-virtual destructor", t
);
6570 if (warn_overloaded_virtual
)
6573 /* Class layout, assignment of virtual table slots, etc., is now
6574 complete. Give the back end a chance to tweak the visibility of
6575 the class or perform any other required target modifications. */
6576 targetm
.cxx
.adjust_class_at_definition (t
);
6578 maybe_suppress_debug_info (t
);
6580 if (flag_vtable_verify
)
6581 vtv_save_class_info (t
);
6583 dump_class_hierarchy (t
);
6585 /* Finish debugging output for this type. */
6586 rest_of_type_compilation (t
, ! LOCAL_CLASS_P (t
));
6588 if (TYPE_TRANSPARENT_AGGR (t
))
6590 tree field
= first_field (t
);
6591 if (field
== NULL_TREE
|| error_operand_p (field
))
6593 error ("type transparent %q#T does not have any fields", t
);
6594 TYPE_TRANSPARENT_AGGR (t
) = 0;
6596 else if (DECL_ARTIFICIAL (field
))
6598 if (DECL_FIELD_IS_BASE (field
))
6599 error ("type transparent class %qT has base classes", t
);
6602 gcc_checking_assert (DECL_VIRTUAL_P (field
));
6603 error ("type transparent class %qT has virtual functions", t
);
6605 TYPE_TRANSPARENT_AGGR (t
) = 0;
6607 else if (TYPE_MODE (t
) != DECL_MODE (field
))
6609 error ("type transparent %q#T cannot be made transparent because "
6610 "the type of the first field has a different ABI from the "
6611 "class overall", t
);
6612 TYPE_TRANSPARENT_AGGR (t
) = 0;
6617 /* Insert FIELDS into T for the sorted case if the FIELDS count is
6618 equal to THRESHOLD or greater than THRESHOLD. */
6621 insert_into_classtype_sorted_fields (tree fields
, tree t
, int threshold
)
6623 int n_fields
= count_fields (fields
);
6624 if (n_fields
>= threshold
)
6626 struct sorted_fields_type
*field_vec
= sorted_fields_type_new (n_fields
);
6627 add_fields_to_record_type (fields
, field_vec
, 0);
6628 qsort (field_vec
->elts
, n_fields
, sizeof (tree
), field_decl_cmp
);
6629 CLASSTYPE_SORTED_FIELDS (t
) = field_vec
;
6633 /* Insert lately defined enum ENUMTYPE into T for the sorted case. */
6636 insert_late_enum_def_into_classtype_sorted_fields (tree enumtype
, tree t
)
6638 struct sorted_fields_type
*sorted_fields
= CLASSTYPE_SORTED_FIELDS (t
);
6643 = list_length (TYPE_VALUES (enumtype
)) + sorted_fields
->len
;
6644 struct sorted_fields_type
*field_vec
= sorted_fields_type_new (n_fields
);
6646 for (i
= 0; i
< sorted_fields
->len
; ++i
)
6647 field_vec
->elts
[i
] = sorted_fields
->elts
[i
];
6649 add_enum_fields_to_record_type (enumtype
, field_vec
,
6650 sorted_fields
->len
);
6651 qsort (field_vec
->elts
, n_fields
, sizeof (tree
), field_decl_cmp
);
6652 CLASSTYPE_SORTED_FIELDS (t
) = field_vec
;
6656 /* When T was built up, the member declarations were added in reverse
6657 order. Rearrange them to declaration order. */
6660 unreverse_member_declarations (tree t
)
6666 /* The following lists are all in reverse order. Put them in
6667 declaration order now. */
6668 TYPE_METHODS (t
) = nreverse (TYPE_METHODS (t
));
6669 CLASSTYPE_DECL_LIST (t
) = nreverse (CLASSTYPE_DECL_LIST (t
));
6671 /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in
6672 reverse order, so we can't just use nreverse. */
6674 for (x
= TYPE_FIELDS (t
);
6675 x
&& TREE_CODE (x
) != TYPE_DECL
;
6678 next
= DECL_CHAIN (x
);
6679 DECL_CHAIN (x
) = prev
;
6684 DECL_CHAIN (TYPE_FIELDS (t
)) = x
;
6686 TYPE_FIELDS (t
) = prev
;
6691 finish_struct (tree t
, tree attributes
)
6693 location_t saved_loc
= input_location
;
6695 /* Now that we've got all the field declarations, reverse everything
6697 unreverse_member_declarations (t
);
6699 cplus_decl_attributes (&t
, attributes
, (int) ATTR_FLAG_TYPE_IN_PLACE
);
6701 /* Nadger the current location so that diagnostics point to the start of
6702 the struct, not the end. */
6703 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (t
));
6705 if (processing_template_decl
)
6709 finish_struct_methods (t
);
6710 TYPE_SIZE (t
) = bitsize_zero_node
;
6711 TYPE_SIZE_UNIT (t
) = size_zero_node
;
6713 /* We need to emit an error message if this type was used as a parameter
6714 and it is an abstract type, even if it is a template. We construct
6715 a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into
6716 account and we call complete_vars with this type, which will check
6717 the PARM_DECLS. Note that while the type is being defined,
6718 CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends
6719 (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */
6720 CLASSTYPE_PURE_VIRTUALS (t
) = NULL
;
6721 for (x
= TYPE_METHODS (t
); x
; x
= DECL_CHAIN (x
))
6722 if (DECL_PURE_VIRTUAL_P (x
))
6723 vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t
), x
);
6725 /* We need to add the target functions to the CLASSTYPE_METHOD_VEC if
6726 an enclosing scope is a template class, so that this function be
6727 found by lookup_fnfields_1 when the using declaration is not
6728 instantiated yet. */
6729 for (x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
6730 if (TREE_CODE (x
) == USING_DECL
)
6732 tree fn
= strip_using_decl (x
);
6733 if (is_overloaded_fn (fn
))
6734 for (; fn
; fn
= OVL_NEXT (fn
))
6735 add_method (t
, OVL_CURRENT (fn
), x
);
6738 /* Remember current #pragma pack value. */
6739 TYPE_PRECISION (t
) = maximum_field_alignment
;
6741 /* Fix up any variants we've already built. */
6742 for (x
= TYPE_NEXT_VARIANT (t
); x
; x
= TYPE_NEXT_VARIANT (x
))
6744 TYPE_SIZE (x
) = TYPE_SIZE (t
);
6745 TYPE_SIZE_UNIT (x
) = TYPE_SIZE_UNIT (t
);
6746 TYPE_FIELDS (x
) = TYPE_FIELDS (t
);
6747 TYPE_METHODS (x
) = TYPE_METHODS (t
);
6751 finish_struct_1 (t
);
6753 input_location
= saved_loc
;
6755 TYPE_BEING_DEFINED (t
) = 0;
6757 if (current_class_type
)
6760 error ("trying to finish struct, but kicked out due to previous parse errors");
6762 if (processing_template_decl
&& at_function_scope_p ()
6763 /* Lambdas are defined by the LAMBDA_EXPR. */
6764 && !LAMBDA_TYPE_P (t
))
6765 add_stmt (build_min (TAG_DEFN
, t
));
6770 /* Hash table to avoid endless recursion when handling references. */
6771 static hash_table
<pointer_hash
<tree_node
> > fixed_type_or_null_ref_ht
;
6773 /* Return the dynamic type of INSTANCE, if known.
6774 Used to determine whether the virtual function table is needed
6777 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
6778 of our knowledge of its type. *NONNULL should be initialized
6779 before this function is called. */
6782 fixed_type_or_null (tree instance
, int *nonnull
, int *cdtorp
)
6784 #define RECUR(T) fixed_type_or_null((T), nonnull, cdtorp)
6786 switch (TREE_CODE (instance
))
6789 if (POINTER_TYPE_P (TREE_TYPE (instance
)))
6792 return RECUR (TREE_OPERAND (instance
, 0));
6795 /* This is a call to a constructor, hence it's never zero. */
6796 if (TREE_HAS_CONSTRUCTOR (instance
))
6800 return TREE_TYPE (instance
);
6805 /* This is a call to a constructor, hence it's never zero. */
6806 if (TREE_HAS_CONSTRUCTOR (instance
))
6810 return TREE_TYPE (instance
);
6812 return RECUR (TREE_OPERAND (instance
, 0));
6814 case POINTER_PLUS_EXPR
:
6817 if (TREE_CODE (TREE_OPERAND (instance
, 0)) == ADDR_EXPR
)
6818 return RECUR (TREE_OPERAND (instance
, 0));
6819 if (TREE_CODE (TREE_OPERAND (instance
, 1)) == INTEGER_CST
)
6820 /* Propagate nonnull. */
6821 return RECUR (TREE_OPERAND (instance
, 0));
6826 return RECUR (TREE_OPERAND (instance
, 0));
6829 instance
= TREE_OPERAND (instance
, 0);
6832 /* Just because we see an ADDR_EXPR doesn't mean we're dealing
6833 with a real object -- given &p->f, p can still be null. */
6834 tree t
= get_base_address (instance
);
6835 /* ??? Probably should check DECL_WEAK here. */
6836 if (t
&& DECL_P (t
))
6839 return RECUR (instance
);
6842 /* If this component is really a base class reference, then the field
6843 itself isn't definitive. */
6844 if (DECL_FIELD_IS_BASE (TREE_OPERAND (instance
, 1)))
6845 return RECUR (TREE_OPERAND (instance
, 0));
6846 return RECUR (TREE_OPERAND (instance
, 1));
6850 if (TREE_CODE (TREE_TYPE (instance
)) == ARRAY_TYPE
6851 && MAYBE_CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (instance
))))
6855 return TREE_TYPE (TREE_TYPE (instance
));
6857 /* fall through... */
6861 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (instance
)))
6865 return TREE_TYPE (instance
);
6867 else if (instance
== current_class_ptr
)
6872 /* if we're in a ctor or dtor, we know our type. If
6873 current_class_ptr is set but we aren't in a function, we're in
6874 an NSDMI (and therefore a constructor). */
6875 if (current_scope () != current_function_decl
6876 || (DECL_LANG_SPECIFIC (current_function_decl
)
6877 && (DECL_CONSTRUCTOR_P (current_function_decl
)
6878 || DECL_DESTRUCTOR_P (current_function_decl
))))
6882 return TREE_TYPE (TREE_TYPE (instance
));
6885 else if (TREE_CODE (TREE_TYPE (instance
)) == REFERENCE_TYPE
)
6887 /* We only need one hash table because it is always left empty. */
6888 if (!fixed_type_or_null_ref_ht
.is_created ())
6889 fixed_type_or_null_ref_ht
.create (37);
6891 /* Reference variables should be references to objects. */
6895 /* Enter the INSTANCE in a table to prevent recursion; a
6896 variable's initializer may refer to the variable
6898 if (VAR_P (instance
)
6899 && DECL_INITIAL (instance
)
6900 && !type_dependent_expression_p_push (DECL_INITIAL (instance
))
6901 && !fixed_type_or_null_ref_ht
.find (instance
))
6906 slot
= fixed_type_or_null_ref_ht
.find_slot (instance
, INSERT
);
6908 type
= RECUR (DECL_INITIAL (instance
));
6909 fixed_type_or_null_ref_ht
.remove_elt (instance
);
6922 /* Return nonzero if the dynamic type of INSTANCE is known, and
6923 equivalent to the static type. We also handle the case where
6924 INSTANCE is really a pointer. Return negative if this is a
6925 ctor/dtor. There the dynamic type is known, but this might not be
6926 the most derived base of the original object, and hence virtual
6927 bases may not be laid out according to this type.
6929 Used to determine whether the virtual function table is needed
6932 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
6933 of our knowledge of its type. *NONNULL should be initialized
6934 before this function is called. */
6937 resolves_to_fixed_type_p (tree instance
, int* nonnull
)
6939 tree t
= TREE_TYPE (instance
);
6943 /* processing_template_decl can be false in a template if we're in
6944 fold_non_dependent_expr, but we still want to suppress this check. */
6945 if (in_template_function ())
6947 /* In a template we only care about the type of the result. */
6953 fixed
= fixed_type_or_null (instance
, nonnull
, &cdtorp
);
6954 if (fixed
== NULL_TREE
)
6956 if (POINTER_TYPE_P (t
))
6958 if (!same_type_ignoring_top_level_qualifiers_p (t
, fixed
))
6960 return cdtorp
? -1 : 1;
6965 init_class_processing (void)
6967 current_class_depth
= 0;
6968 current_class_stack_size
= 10;
6970 = XNEWVEC (struct class_stack_node
, current_class_stack_size
);
6971 vec_alloc (local_classes
, 8);
6972 sizeof_biggest_empty_class
= size_zero_node
;
6974 ridpointers
[(int) RID_PUBLIC
] = access_public_node
;
6975 ridpointers
[(int) RID_PRIVATE
] = access_private_node
;
6976 ridpointers
[(int) RID_PROTECTED
] = access_protected_node
;
6979 /* Restore the cached PREVIOUS_CLASS_LEVEL. */
6982 restore_class_cache (void)
6986 /* We are re-entering the same class we just left, so we don't
6987 have to search the whole inheritance matrix to find all the
6988 decls to bind again. Instead, we install the cached
6989 class_shadowed list and walk through it binding names. */
6990 push_binding_level (previous_class_level
);
6991 class_binding_level
= previous_class_level
;
6992 /* Restore IDENTIFIER_TYPE_VALUE. */
6993 for (type
= class_binding_level
->type_shadowed
;
6995 type
= TREE_CHAIN (type
))
6996 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (type
), TREE_TYPE (type
));
6999 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as
7000 appropriate for TYPE.
7002 So that we may avoid calls to lookup_name, we cache the _TYPE
7003 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
7005 For multiple inheritance, we perform a two-pass depth-first search
7006 of the type lattice. */
7009 pushclass (tree type
)
7011 class_stack_node_t csn
;
7013 type
= TYPE_MAIN_VARIANT (type
);
7015 /* Make sure there is enough room for the new entry on the stack. */
7016 if (current_class_depth
+ 1 >= current_class_stack_size
)
7018 current_class_stack_size
*= 2;
7020 = XRESIZEVEC (struct class_stack_node
, current_class_stack
,
7021 current_class_stack_size
);
7024 /* Insert a new entry on the class stack. */
7025 csn
= current_class_stack
+ current_class_depth
;
7026 csn
->name
= current_class_name
;
7027 csn
->type
= current_class_type
;
7028 csn
->access
= current_access_specifier
;
7029 csn
->names_used
= 0;
7031 current_class_depth
++;
7033 /* Now set up the new type. */
7034 current_class_name
= TYPE_NAME (type
);
7035 if (TREE_CODE (current_class_name
) == TYPE_DECL
)
7036 current_class_name
= DECL_NAME (current_class_name
);
7037 current_class_type
= type
;
7039 /* By default, things in classes are private, while things in
7040 structures or unions are public. */
7041 current_access_specifier
= (CLASSTYPE_DECLARED_CLASS (type
)
7042 ? access_private_node
7043 : access_public_node
);
7045 if (previous_class_level
7046 && type
!= previous_class_level
->this_entity
7047 && current_class_depth
== 1)
7049 /* Forcibly remove any old class remnants. */
7050 invalidate_class_lookup_cache ();
7053 if (!previous_class_level
7054 || type
!= previous_class_level
->this_entity
7055 || current_class_depth
> 1)
7058 restore_class_cache ();
7061 /* When we exit a toplevel class scope, we save its binding level so
7062 that we can restore it quickly. Here, we've entered some other
7063 class, so we must invalidate our cache. */
7066 invalidate_class_lookup_cache (void)
7068 previous_class_level
= NULL
;
7071 /* Get out of the current class scope. If we were in a class scope
7072 previously, that is the one popped to. */
7079 current_class_depth
--;
7080 current_class_name
= current_class_stack
[current_class_depth
].name
;
7081 current_class_type
= current_class_stack
[current_class_depth
].type
;
7082 current_access_specifier
= current_class_stack
[current_class_depth
].access
;
7083 if (current_class_stack
[current_class_depth
].names_used
)
7084 splay_tree_delete (current_class_stack
[current_class_depth
].names_used
);
7087 /* Mark the top of the class stack as hidden. */
7090 push_class_stack (void)
7092 if (current_class_depth
)
7093 ++current_class_stack
[current_class_depth
- 1].hidden
;
7096 /* Mark the top of the class stack as un-hidden. */
7099 pop_class_stack (void)
7101 if (current_class_depth
)
7102 --current_class_stack
[current_class_depth
- 1].hidden
;
7105 /* Returns 1 if the class type currently being defined is either T or
7106 a nested type of T. */
7109 currently_open_class (tree t
)
7113 if (!CLASS_TYPE_P (t
))
7116 t
= TYPE_MAIN_VARIANT (t
);
7118 /* We start looking from 1 because entry 0 is from global scope,
7120 for (i
= current_class_depth
; i
> 0; --i
)
7123 if (i
== current_class_depth
)
7124 c
= current_class_type
;
7127 if (current_class_stack
[i
].hidden
)
7129 c
= current_class_stack
[i
].type
;
7133 if (same_type_p (c
, t
))
7139 /* If either current_class_type or one of its enclosing classes are derived
7140 from T, return the appropriate type. Used to determine how we found
7141 something via unqualified lookup. */
7144 currently_open_derived_class (tree t
)
7148 /* The bases of a dependent type are unknown. */
7149 if (dependent_type_p (t
))
7152 if (!current_class_type
)
7155 if (DERIVED_FROM_P (t
, current_class_type
))
7156 return current_class_type
;
7158 for (i
= current_class_depth
- 1; i
> 0; --i
)
7160 if (current_class_stack
[i
].hidden
)
7162 if (DERIVED_FROM_P (t
, current_class_stack
[i
].type
))
7163 return current_class_stack
[i
].type
;
7169 /* Returns the innermost class type which is not a lambda closure type. */
7172 current_nonlambda_class_type (void)
7176 /* We start looking from 1 because entry 0 is from global scope,
7178 for (i
= current_class_depth
; i
> 0; --i
)
7181 if (i
== current_class_depth
)
7182 c
= current_class_type
;
7185 if (current_class_stack
[i
].hidden
)
7187 c
= current_class_stack
[i
].type
;
7191 if (!LAMBDA_TYPE_P (c
))
7197 /* When entering a class scope, all enclosing class scopes' names with
7198 static meaning (static variables, static functions, types and
7199 enumerators) have to be visible. This recursive function calls
7200 pushclass for all enclosing class contexts until global or a local
7201 scope is reached. TYPE is the enclosed class. */
7204 push_nested_class (tree type
)
7206 /* A namespace might be passed in error cases, like A::B:C. */
7207 if (type
== NULL_TREE
7208 || !CLASS_TYPE_P (type
))
7211 push_nested_class (DECL_CONTEXT (TYPE_MAIN_DECL (type
)));
7216 /* Undoes a push_nested_class call. */
7219 pop_nested_class (void)
7221 tree context
= DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type
));
7224 if (context
&& CLASS_TYPE_P (context
))
7225 pop_nested_class ();
7228 /* Returns the number of extern "LANG" blocks we are nested within. */
7231 current_lang_depth (void)
7233 return vec_safe_length (current_lang_base
);
7236 /* Set global variables CURRENT_LANG_NAME to appropriate value
7237 so that behavior of name-mangling machinery is correct. */
7240 push_lang_context (tree name
)
7242 vec_safe_push (current_lang_base
, current_lang_name
);
7244 if (name
== lang_name_cplusplus
)
7246 current_lang_name
= name
;
7248 else if (name
== lang_name_java
)
7250 current_lang_name
= name
;
7251 /* DECL_IGNORED_P is initially set for these types, to avoid clutter.
7252 (See record_builtin_java_type in decl.c.) However, that causes
7253 incorrect debug entries if these types are actually used.
7254 So we re-enable debug output after extern "Java". */
7255 DECL_IGNORED_P (TYPE_NAME (java_byte_type_node
)) = 0;
7256 DECL_IGNORED_P (TYPE_NAME (java_short_type_node
)) = 0;
7257 DECL_IGNORED_P (TYPE_NAME (java_int_type_node
)) = 0;
7258 DECL_IGNORED_P (TYPE_NAME (java_long_type_node
)) = 0;
7259 DECL_IGNORED_P (TYPE_NAME (java_float_type_node
)) = 0;
7260 DECL_IGNORED_P (TYPE_NAME (java_double_type_node
)) = 0;
7261 DECL_IGNORED_P (TYPE_NAME (java_char_type_node
)) = 0;
7262 DECL_IGNORED_P (TYPE_NAME (java_boolean_type_node
)) = 0;
7264 else if (name
== lang_name_c
)
7266 current_lang_name
= name
;
7269 error ("language string %<\"%E\"%> not recognized", name
);
7272 /* Get out of the current language scope. */
7275 pop_lang_context (void)
7277 current_lang_name
= current_lang_base
->pop ();
7280 /* Type instantiation routines. */
7282 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
7283 matches the TARGET_TYPE. If there is no satisfactory match, return
7284 error_mark_node, and issue an error & warning messages under
7285 control of FLAGS. Permit pointers to member function if FLAGS
7286 permits. If TEMPLATE_ONLY, the name of the overloaded function was
7287 a template-id, and EXPLICIT_TARGS are the explicitly provided
7290 If OVERLOAD is for one or more member functions, then ACCESS_PATH
7291 is the base path used to reference those member functions. If
7292 the address is resolved to a member function, access checks will be
7293 performed and errors issued if appropriate. */
7296 resolve_address_of_overloaded_function (tree target_type
,
7298 tsubst_flags_t flags
,
7300 tree explicit_targs
,
7303 /* Here's what the standard says:
7307 If the name is a function template, template argument deduction
7308 is done, and if the argument deduction succeeds, the deduced
7309 arguments are used to generate a single template function, which
7310 is added to the set of overloaded functions considered.
7312 Non-member functions and static member functions match targets of
7313 type "pointer-to-function" or "reference-to-function." Nonstatic
7314 member functions match targets of type "pointer-to-member
7315 function;" the function type of the pointer to member is used to
7316 select the member function from the set of overloaded member
7317 functions. If a nonstatic member function is selected, the
7318 reference to the overloaded function name is required to have the
7319 form of a pointer to member as described in 5.3.1.
7321 If more than one function is selected, any template functions in
7322 the set are eliminated if the set also contains a non-template
7323 function, and any given template function is eliminated if the
7324 set contains a second template function that is more specialized
7325 than the first according to the partial ordering rules 14.5.5.2.
7326 After such eliminations, if any, there shall remain exactly one
7327 selected function. */
7330 /* We store the matches in a TREE_LIST rooted here. The functions
7331 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
7332 interoperability with most_specialized_instantiation. */
7333 tree matches
= NULL_TREE
;
7335 tree target_fn_type
;
7337 /* By the time we get here, we should be seeing only real
7338 pointer-to-member types, not the internal POINTER_TYPE to
7339 METHOD_TYPE representation. */
7340 gcc_assert (!TYPE_PTR_P (target_type
)
7341 || TREE_CODE (TREE_TYPE (target_type
)) != METHOD_TYPE
);
7343 gcc_assert (is_overloaded_fn (overload
));
7345 /* Check that the TARGET_TYPE is reasonable. */
7346 if (TYPE_PTRFN_P (target_type
)
7347 || TYPE_REFFN_P (target_type
))
7349 else if (TYPE_PTRMEMFUNC_P (target_type
))
7350 /* This is OK, too. */
7352 else if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
7353 /* This is OK, too. This comes from a conversion to reference
7355 target_type
= build_reference_type (target_type
);
7358 if (flags
& tf_error
)
7359 error ("cannot resolve overloaded function %qD based on"
7360 " conversion to type %qT",
7361 DECL_NAME (OVL_FUNCTION (overload
)), target_type
);
7362 return error_mark_node
;
7365 /* Non-member functions and static member functions match targets of type
7366 "pointer-to-function" or "reference-to-function." Nonstatic member
7367 functions match targets of type "pointer-to-member-function;" the
7368 function type of the pointer to member is used to select the member
7369 function from the set of overloaded member functions.
7371 So figure out the FUNCTION_TYPE that we want to match against. */
7372 target_fn_type
= static_fn_type (target_type
);
7374 /* If we can find a non-template function that matches, we can just
7375 use it. There's no point in generating template instantiations
7376 if we're just going to throw them out anyhow. But, of course, we
7377 can only do this when we don't *need* a template function. */
7382 for (fns
= overload
; fns
; fns
= OVL_NEXT (fns
))
7384 tree fn
= OVL_CURRENT (fns
);
7386 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
7387 /* We're not looking for templates just yet. */
7390 if ((TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7392 /* We're looking for a non-static member, and this isn't
7393 one, or vice versa. */
7396 /* Ignore functions which haven't been explicitly
7398 if (DECL_ANTICIPATED (fn
))
7401 /* See if there's a match. */
7402 if (same_type_p (target_fn_type
, static_fn_type (fn
)))
7403 matches
= tree_cons (fn
, NULL_TREE
, matches
);
7407 /* Now, if we've already got a match (or matches), there's no need
7408 to proceed to the template functions. But, if we don't have a
7409 match we need to look at them, too. */
7412 tree target_arg_types
;
7413 tree target_ret_type
;
7416 unsigned int nargs
, ia
;
7419 target_arg_types
= TYPE_ARG_TYPES (target_fn_type
);
7420 target_ret_type
= TREE_TYPE (target_fn_type
);
7422 nargs
= list_length (target_arg_types
);
7423 args
= XALLOCAVEC (tree
, nargs
);
7424 for (arg
= target_arg_types
, ia
= 0;
7425 arg
!= NULL_TREE
&& arg
!= void_list_node
;
7426 arg
= TREE_CHAIN (arg
), ++ia
)
7427 args
[ia
] = TREE_VALUE (arg
);
7430 for (fns
= overload
; fns
; fns
= OVL_NEXT (fns
))
7432 tree fn
= OVL_CURRENT (fns
);
7436 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7437 /* We're only looking for templates. */
7440 if ((TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7442 /* We're not looking for a non-static member, and this is
7443 one, or vice versa. */
7446 tree ret
= target_ret_type
;
7448 /* If the template has a deduced return type, don't expose it to
7449 template argument deduction. */
7450 if (undeduced_auto_decl (fn
))
7453 /* Try to do argument deduction. */
7454 targs
= make_tree_vec (DECL_NTPARMS (fn
));
7455 instantiation
= fn_type_unification (fn
, explicit_targs
, targs
, args
,
7457 DEDUCE_EXACT
, LOOKUP_NORMAL
,
7459 if (instantiation
== error_mark_node
)
7460 /* Instantiation failed. */
7463 /* And now force instantiation to do return type deduction. */
7464 if (undeduced_auto_decl (instantiation
))
7467 instantiate_decl (instantiation
, /*defer*/false, /*class*/false);
7470 require_deduced_type (instantiation
);
7473 /* See if there's a match. */
7474 if (same_type_p (target_fn_type
, static_fn_type (instantiation
)))
7475 matches
= tree_cons (instantiation
, fn
, matches
);
7480 /* Now, remove all but the most specialized of the matches. */
7483 tree match
= most_specialized_instantiation (matches
);
7485 if (match
!= error_mark_node
)
7486 matches
= tree_cons (TREE_PURPOSE (match
),
7492 /* Now we should have exactly one function in MATCHES. */
7493 if (matches
== NULL_TREE
)
7495 /* There were *no* matches. */
7496 if (flags
& tf_error
)
7498 error ("no matches converting function %qD to type %q#T",
7499 DECL_NAME (OVL_CURRENT (overload
)),
7502 print_candidates (overload
);
7504 return error_mark_node
;
7506 else if (TREE_CHAIN (matches
))
7508 /* There were too many matches. First check if they're all
7509 the same function. */
7510 tree match
= NULL_TREE
;
7512 fn
= TREE_PURPOSE (matches
);
7514 /* For multi-versioned functions, more than one match is just fine and
7515 decls_match will return false as they are different. */
7516 for (match
= TREE_CHAIN (matches
); match
; match
= TREE_CHAIN (match
))
7517 if (!decls_match (fn
, TREE_PURPOSE (match
))
7518 && !targetm
.target_option
.function_versions
7519 (fn
, TREE_PURPOSE (match
)))
7524 if (flags
& tf_error
)
7526 error ("converting overloaded function %qD to type %q#T is ambiguous",
7527 DECL_NAME (OVL_FUNCTION (overload
)),
7530 /* Since print_candidates expects the functions in the
7531 TREE_VALUE slot, we flip them here. */
7532 for (match
= matches
; match
; match
= TREE_CHAIN (match
))
7533 TREE_VALUE (match
) = TREE_PURPOSE (match
);
7535 print_candidates (matches
);
7538 return error_mark_node
;
7542 /* Good, exactly one match. Now, convert it to the correct type. */
7543 fn
= TREE_PURPOSE (matches
);
7545 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
7546 && !(flags
& tf_ptrmem_ok
) && !flag_ms_extensions
)
7548 static int explained
;
7550 if (!(flags
& tf_error
))
7551 return error_mark_node
;
7553 permerror (input_location
, "assuming pointer to member %qD", fn
);
7556 inform (input_location
, "(a pointer to member can only be formed with %<&%E%>)", fn
);
7561 /* If a pointer to a function that is multi-versioned is requested, the
7562 pointer to the dispatcher function is returned instead. This works
7563 well because indirectly calling the function will dispatch the right
7564 function version at run-time. */
7565 if (DECL_FUNCTION_VERSIONED (fn
))
7567 fn
= get_function_version_dispatcher (fn
);
7569 return error_mark_node
;
7570 /* Mark all the versions corresponding to the dispatcher as used. */
7571 if (!(flags
& tf_conv
))
7572 mark_versions_used (fn
);
7575 /* If we're doing overload resolution purely for the purpose of
7576 determining conversion sequences, we should not consider the
7577 function used. If this conversion sequence is selected, the
7578 function will be marked as used at this point. */
7579 if (!(flags
& tf_conv
))
7581 /* Make =delete work with SFINAE. */
7582 if (DECL_DELETED_FN (fn
) && !(flags
& tf_error
))
7583 return error_mark_node
;
7588 /* We could not check access to member functions when this
7589 expression was originally created since we did not know at that
7590 time to which function the expression referred. */
7591 if (DECL_FUNCTION_MEMBER_P (fn
))
7593 gcc_assert (access_path
);
7594 perform_or_defer_access_check (access_path
, fn
, fn
, flags
);
7597 if (TYPE_PTRFN_P (target_type
) || TYPE_PTRMEMFUNC_P (target_type
))
7598 return cp_build_addr_expr (fn
, flags
);
7601 /* The target must be a REFERENCE_TYPE. Above, cp_build_unary_op
7602 will mark the function as addressed, but here we must do it
7604 cxx_mark_addressable (fn
);
7610 /* This function will instantiate the type of the expression given in
7611 RHS to match the type of LHSTYPE. If errors exist, then return
7612 error_mark_node. FLAGS is a bit mask. If TF_ERROR is set, then
7613 we complain on errors. If we are not complaining, never modify rhs,
7614 as overload resolution wants to try many possible instantiations, in
7615 the hope that at least one will work.
7617 For non-recursive calls, LHSTYPE should be a function, pointer to
7618 function, or a pointer to member function. */
7621 instantiate_type (tree lhstype
, tree rhs
, tsubst_flags_t flags
)
7623 tsubst_flags_t flags_in
= flags
;
7624 tree access_path
= NULL_TREE
;
7626 flags
&= ~tf_ptrmem_ok
;
7628 if (lhstype
== unknown_type_node
)
7630 if (flags
& tf_error
)
7631 error ("not enough type information");
7632 return error_mark_node
;
7635 if (TREE_TYPE (rhs
) != NULL_TREE
&& ! (type_unknown_p (rhs
)))
7637 tree fntype
= non_reference (lhstype
);
7638 if (same_type_p (fntype
, TREE_TYPE (rhs
)))
7640 if (flag_ms_extensions
7641 && TYPE_PTRMEMFUNC_P (fntype
)
7642 && !TYPE_PTRMEMFUNC_P (TREE_TYPE (rhs
)))
7643 /* Microsoft allows `A::f' to be resolved to a
7644 pointer-to-member. */
7648 if (flags
& tf_error
)
7649 error ("cannot convert %qE from type %qT to type %qT",
7650 rhs
, TREE_TYPE (rhs
), fntype
);
7651 return error_mark_node
;
7655 if (BASELINK_P (rhs
))
7657 access_path
= BASELINK_ACCESS_BINFO (rhs
);
7658 rhs
= BASELINK_FUNCTIONS (rhs
);
7661 /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot
7662 deduce any type information. */
7663 if (TREE_CODE (rhs
) == NON_DEPENDENT_EXPR
)
7665 if (flags
& tf_error
)
7666 error ("not enough type information");
7667 return error_mark_node
;
7670 /* There only a few kinds of expressions that may have a type
7671 dependent on overload resolution. */
7672 gcc_assert (TREE_CODE (rhs
) == ADDR_EXPR
7673 || TREE_CODE (rhs
) == COMPONENT_REF
7674 || is_overloaded_fn (rhs
)
7675 || (flag_ms_extensions
&& TREE_CODE (rhs
) == FUNCTION_DECL
));
7677 /* This should really only be used when attempting to distinguish
7678 what sort of a pointer to function we have. For now, any
7679 arithmetic operation which is not supported on pointers
7680 is rejected as an error. */
7682 switch (TREE_CODE (rhs
))
7686 tree member
= TREE_OPERAND (rhs
, 1);
7688 member
= instantiate_type (lhstype
, member
, flags
);
7689 if (member
!= error_mark_node
7690 && TREE_SIDE_EFFECTS (TREE_OPERAND (rhs
, 0)))
7691 /* Do not lose object's side effects. */
7692 return build2 (COMPOUND_EXPR
, TREE_TYPE (member
),
7693 TREE_OPERAND (rhs
, 0), member
);
7698 rhs
= TREE_OPERAND (rhs
, 1);
7699 if (BASELINK_P (rhs
))
7700 return instantiate_type (lhstype
, rhs
, flags_in
);
7702 /* This can happen if we are forming a pointer-to-member for a
7704 gcc_assert (TREE_CODE (rhs
) == TEMPLATE_ID_EXPR
);
7708 case TEMPLATE_ID_EXPR
:
7710 tree fns
= TREE_OPERAND (rhs
, 0);
7711 tree args
= TREE_OPERAND (rhs
, 1);
7714 resolve_address_of_overloaded_function (lhstype
, fns
, flags_in
,
7715 /*template_only=*/true,
7722 resolve_address_of_overloaded_function (lhstype
, rhs
, flags_in
,
7723 /*template_only=*/false,
7724 /*explicit_targs=*/NULL_TREE
,
7729 if (PTRMEM_OK_P (rhs
))
7730 flags
|= tf_ptrmem_ok
;
7732 return instantiate_type (lhstype
, TREE_OPERAND (rhs
, 0), flags
);
7736 return error_mark_node
;
7741 return error_mark_node
;
7744 /* Return the name of the virtual function pointer field
7745 (as an IDENTIFIER_NODE) for the given TYPE. Note that
7746 this may have to look back through base types to find the
7747 ultimate field name. (For single inheritance, these could
7748 all be the same name. Who knows for multiple inheritance). */
7751 get_vfield_name (tree type
)
7753 tree binfo
, base_binfo
;
7756 for (binfo
= TYPE_BINFO (type
);
7757 BINFO_N_BASE_BINFOS (binfo
);
7760 base_binfo
= BINFO_BASE_BINFO (binfo
, 0);
7762 if (BINFO_VIRTUAL_P (base_binfo
)
7763 || !TYPE_CONTAINS_VPTR_P (BINFO_TYPE (base_binfo
)))
7767 type
= BINFO_TYPE (binfo
);
7768 buf
= (char *) alloca (sizeof (VFIELD_NAME_FORMAT
)
7769 + TYPE_NAME_LENGTH (type
) + 2);
7770 sprintf (buf
, VFIELD_NAME_FORMAT
,
7771 IDENTIFIER_POINTER (constructor_name (type
)));
7772 return get_identifier (buf
);
7776 print_class_statistics (void)
7778 if (! GATHER_STATISTICS
)
7781 fprintf (stderr
, "convert_harshness = %d\n", n_convert_harshness
);
7782 fprintf (stderr
, "compute_conversion_costs = %d\n", n_compute_conversion_costs
);
7785 fprintf (stderr
, "vtables = %d; vtable searches = %d\n",
7786 n_vtables
, n_vtable_searches
);
7787 fprintf (stderr
, "vtable entries = %d; vtable elems = %d\n",
7788 n_vtable_entries
, n_vtable_elems
);
7792 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
7793 according to [class]:
7794 The class-name is also inserted
7795 into the scope of the class itself. For purposes of access checking,
7796 the inserted class name is treated as if it were a public member name. */
7799 build_self_reference (void)
7801 tree name
= constructor_name (current_class_type
);
7802 tree value
= build_lang_decl (TYPE_DECL
, name
, current_class_type
);
7805 DECL_NONLOCAL (value
) = 1;
7806 DECL_CONTEXT (value
) = current_class_type
;
7807 DECL_ARTIFICIAL (value
) = 1;
7808 SET_DECL_SELF_REFERENCE_P (value
);
7809 set_underlying_type (value
);
7811 if (processing_template_decl
)
7812 value
= push_template_decl (value
);
7814 saved_cas
= current_access_specifier
;
7815 current_access_specifier
= access_public_node
;
7816 finish_member_declaration (value
);
7817 current_access_specifier
= saved_cas
;
7820 /* Returns 1 if TYPE contains only padding bytes. */
7823 is_empty_class (tree type
)
7825 if (type
== error_mark_node
)
7828 if (! CLASS_TYPE_P (type
))
7831 /* In G++ 3.2, whether or not a class was empty was determined by
7832 looking at its size. */
7833 if (abi_version_at_least (2))
7834 return CLASSTYPE_EMPTY_P (type
);
7836 return integer_zerop (CLASSTYPE_SIZE (type
));
7839 /* Returns true if TYPE contains an empty class. */
7842 contains_empty_class_p (tree type
)
7844 if (is_empty_class (type
))
7846 if (CLASS_TYPE_P (type
))
7853 for (binfo
= TYPE_BINFO (type
), i
= 0;
7854 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
7855 if (contains_empty_class_p (BINFO_TYPE (base_binfo
)))
7857 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
7858 if (TREE_CODE (field
) == FIELD_DECL
7859 && !DECL_ARTIFICIAL (field
)
7860 && is_empty_class (TREE_TYPE (field
)))
7863 else if (TREE_CODE (type
) == ARRAY_TYPE
)
7864 return contains_empty_class_p (TREE_TYPE (type
));
7868 /* Returns true if TYPE contains no actual data, just various
7869 possible combinations of empty classes and possibly a vptr. */
7872 is_really_empty_class (tree type
)
7874 if (CLASS_TYPE_P (type
))
7881 /* CLASSTYPE_EMPTY_P isn't set properly until the class is actually laid
7882 out, but we'd like to be able to check this before then. */
7883 if (COMPLETE_TYPE_P (type
) && is_empty_class (type
))
7886 for (binfo
= TYPE_BINFO (type
), i
= 0;
7887 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
7888 if (!is_really_empty_class (BINFO_TYPE (base_binfo
)))
7890 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
7891 if (TREE_CODE (field
) == FIELD_DECL
7892 && !DECL_ARTIFICIAL (field
)
7893 && !is_really_empty_class (TREE_TYPE (field
)))
7897 else if (TREE_CODE (type
) == ARRAY_TYPE
)
7898 return is_really_empty_class (TREE_TYPE (type
));
7902 /* Note that NAME was looked up while the current class was being
7903 defined and that the result of that lookup was DECL. */
7906 maybe_note_name_used_in_class (tree name
, tree decl
)
7908 splay_tree names_used
;
7910 /* If we're not defining a class, there's nothing to do. */
7911 if (!(innermost_scope_kind() == sk_class
7912 && TYPE_BEING_DEFINED (current_class_type
)
7913 && !LAMBDA_TYPE_P (current_class_type
)))
7916 /* If there's already a binding for this NAME, then we don't have
7917 anything to worry about. */
7918 if (lookup_member (current_class_type
, name
,
7919 /*protect=*/0, /*want_type=*/false, tf_warning_or_error
))
7922 if (!current_class_stack
[current_class_depth
- 1].names_used
)
7923 current_class_stack
[current_class_depth
- 1].names_used
7924 = splay_tree_new (splay_tree_compare_pointers
, 0, 0);
7925 names_used
= current_class_stack
[current_class_depth
- 1].names_used
;
7927 splay_tree_insert (names_used
,
7928 (splay_tree_key
) name
,
7929 (splay_tree_value
) decl
);
7932 /* Note that NAME was declared (as DECL) in the current class. Check
7933 to see that the declaration is valid. */
7936 note_name_declared_in_class (tree name
, tree decl
)
7938 splay_tree names_used
;
7941 /* Look to see if we ever used this name. */
7943 = current_class_stack
[current_class_depth
- 1].names_used
;
7946 /* The C language allows members to be declared with a type of the same
7947 name, and the C++ standard says this diagnostic is not required. So
7948 allow it in extern "C" blocks unless predantic is specified.
7949 Allow it in all cases if -ms-extensions is specified. */
7950 if ((!pedantic
&& current_lang_name
== lang_name_c
)
7951 || flag_ms_extensions
)
7953 n
= splay_tree_lookup (names_used
, (splay_tree_key
) name
);
7956 /* [basic.scope.class]
7958 A name N used in a class S shall refer to the same declaration
7959 in its context and when re-evaluated in the completed scope of
7961 permerror (input_location
, "declaration of %q#D", decl
);
7962 permerror (input_location
, "changes meaning of %qD from %q+#D",
7963 DECL_NAME (OVL_CURRENT (decl
)), (tree
) n
->value
);
7967 /* Returns the VAR_DECL for the complete vtable associated with BINFO.
7968 Secondary vtables are merged with primary vtables; this function
7969 will return the VAR_DECL for the primary vtable. */
7972 get_vtbl_decl_for_binfo (tree binfo
)
7976 decl
= BINFO_VTABLE (binfo
);
7977 if (decl
&& TREE_CODE (decl
) == POINTER_PLUS_EXPR
)
7979 gcc_assert (TREE_CODE (TREE_OPERAND (decl
, 0)) == ADDR_EXPR
);
7980 decl
= TREE_OPERAND (TREE_OPERAND (decl
, 0), 0);
7983 gcc_assert (VAR_P (decl
));
7988 /* Returns the binfo for the primary base of BINFO. If the resulting
7989 BINFO is a virtual base, and it is inherited elsewhere in the
7990 hierarchy, then the returned binfo might not be the primary base of
7991 BINFO in the complete object. Check BINFO_PRIMARY_P or
7992 BINFO_LOST_PRIMARY_P to be sure. */
7995 get_primary_binfo (tree binfo
)
7999 primary_base
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (binfo
));
8003 return copied_binfo (primary_base
, binfo
);
8006 /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */
8009 maybe_indent_hierarchy (FILE * stream
, int indent
, int indented_p
)
8012 fprintf (stream
, "%*s", indent
, "");
8016 /* Dump the offsets of all the bases rooted at BINFO to STREAM.
8017 INDENT should be zero when called from the top level; it is
8018 incremented recursively. IGO indicates the next expected BINFO in
8019 inheritance graph ordering. */
8022 dump_class_hierarchy_r (FILE *stream
,
8032 indented
= maybe_indent_hierarchy (stream
, indent
, 0);
8033 fprintf (stream
, "%s (0x" HOST_WIDE_INT_PRINT_HEX
") ",
8034 type_as_string (BINFO_TYPE (binfo
), TFF_PLAIN_IDENTIFIER
),
8035 (HOST_WIDE_INT
) (uintptr_t) binfo
);
8038 fprintf (stream
, "alternative-path\n");
8041 igo
= TREE_CHAIN (binfo
);
8043 fprintf (stream
, HOST_WIDE_INT_PRINT_DEC
,
8044 tree_low_cst (BINFO_OFFSET (binfo
), 0));
8045 if (is_empty_class (BINFO_TYPE (binfo
)))
8046 fprintf (stream
, " empty");
8047 else if (CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (binfo
)))
8048 fprintf (stream
, " nearly-empty");
8049 if (BINFO_VIRTUAL_P (binfo
))
8050 fprintf (stream
, " virtual");
8051 fprintf (stream
, "\n");
8054 if (BINFO_PRIMARY_P (binfo
))
8056 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8057 fprintf (stream
, " primary-for %s (0x" HOST_WIDE_INT_PRINT_HEX
")",
8058 type_as_string (BINFO_TYPE (BINFO_INHERITANCE_CHAIN (binfo
)),
8059 TFF_PLAIN_IDENTIFIER
),
8060 (HOST_WIDE_INT
) (uintptr_t) BINFO_INHERITANCE_CHAIN (binfo
));
8062 if (BINFO_LOST_PRIMARY_P (binfo
))
8064 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8065 fprintf (stream
, " lost-primary");
8068 fprintf (stream
, "\n");
8070 if (!(flags
& TDF_SLIM
))
8074 if (BINFO_SUBVTT_INDEX (binfo
))
8076 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8077 fprintf (stream
, " subvttidx=%s",
8078 expr_as_string (BINFO_SUBVTT_INDEX (binfo
),
8079 TFF_PLAIN_IDENTIFIER
));
8081 if (BINFO_VPTR_INDEX (binfo
))
8083 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8084 fprintf (stream
, " vptridx=%s",
8085 expr_as_string (BINFO_VPTR_INDEX (binfo
),
8086 TFF_PLAIN_IDENTIFIER
));
8088 if (BINFO_VPTR_FIELD (binfo
))
8090 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8091 fprintf (stream
, " vbaseoffset=%s",
8092 expr_as_string (BINFO_VPTR_FIELD (binfo
),
8093 TFF_PLAIN_IDENTIFIER
));
8095 if (BINFO_VTABLE (binfo
))
8097 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8098 fprintf (stream
, " vptr=%s",
8099 expr_as_string (BINFO_VTABLE (binfo
),
8100 TFF_PLAIN_IDENTIFIER
));
8104 fprintf (stream
, "\n");
8107 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
8108 igo
= dump_class_hierarchy_r (stream
, flags
, base_binfo
, igo
, indent
+ 2);
8113 /* Dump the BINFO hierarchy for T. */
8116 dump_class_hierarchy_1 (FILE *stream
, int flags
, tree t
)
8118 fprintf (stream
, "Class %s\n", type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8119 fprintf (stream
, " size=%lu align=%lu\n",
8120 (unsigned long)(tree_low_cst (TYPE_SIZE (t
), 0) / BITS_PER_UNIT
),
8121 (unsigned long)(TYPE_ALIGN (t
) / BITS_PER_UNIT
));
8122 fprintf (stream
, " base size=%lu base align=%lu\n",
8123 (unsigned long)(tree_low_cst (TYPE_SIZE (CLASSTYPE_AS_BASE (t
)), 0)
8125 (unsigned long)(TYPE_ALIGN (CLASSTYPE_AS_BASE (t
))
8127 dump_class_hierarchy_r (stream
, flags
, TYPE_BINFO (t
), TYPE_BINFO (t
), 0);
8128 fprintf (stream
, "\n");
8131 /* Debug interface to hierarchy dumping. */
8134 debug_class (tree t
)
8136 dump_class_hierarchy_1 (stderr
, TDF_SLIM
, t
);
8140 dump_class_hierarchy (tree t
)
8143 FILE *stream
= dump_begin (TDI_class
, &flags
);
8147 dump_class_hierarchy_1 (stream
, flags
, t
);
8148 dump_end (TDI_class
, stream
);
8153 dump_array (FILE * stream
, tree decl
)
8156 unsigned HOST_WIDE_INT ix
;
8158 tree size
= TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (decl
)));
8160 elt
= (tree_low_cst (TYPE_SIZE (TREE_TYPE (TREE_TYPE (decl
))), 0)
8162 fprintf (stream
, "%s:", decl_as_string (decl
, TFF_PLAIN_IDENTIFIER
));
8163 fprintf (stream
, " %s entries",
8164 expr_as_string (size_binop (PLUS_EXPR
, size
, size_one_node
),
8165 TFF_PLAIN_IDENTIFIER
));
8166 fprintf (stream
, "\n");
8168 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (DECL_INITIAL (decl
)),
8170 fprintf (stream
, "%-4ld %s\n", (long)(ix
* elt
),
8171 expr_as_string (value
, TFF_PLAIN_IDENTIFIER
));
8175 dump_vtable (tree t
, tree binfo
, tree vtable
)
8178 FILE *stream
= dump_begin (TDI_class
, &flags
);
8183 if (!(flags
& TDF_SLIM
))
8185 int ctor_vtbl_p
= TYPE_BINFO (t
) != binfo
;
8187 fprintf (stream
, "%s for %s",
8188 ctor_vtbl_p
? "Construction vtable" : "Vtable",
8189 type_as_string (BINFO_TYPE (binfo
), TFF_PLAIN_IDENTIFIER
));
8192 if (!BINFO_VIRTUAL_P (binfo
))
8193 fprintf (stream
, " (0x" HOST_WIDE_INT_PRINT_HEX
" instance)",
8194 (HOST_WIDE_INT
) (uintptr_t) binfo
);
8195 fprintf (stream
, " in %s", type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8197 fprintf (stream
, "\n");
8198 dump_array (stream
, vtable
);
8199 fprintf (stream
, "\n");
8202 dump_end (TDI_class
, stream
);
8206 dump_vtt (tree t
, tree vtt
)
8209 FILE *stream
= dump_begin (TDI_class
, &flags
);
8214 if (!(flags
& TDF_SLIM
))
8216 fprintf (stream
, "VTT for %s\n",
8217 type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8218 dump_array (stream
, vtt
);
8219 fprintf (stream
, "\n");
8222 dump_end (TDI_class
, stream
);
8225 /* Dump a function or thunk and its thunkees. */
8228 dump_thunk (FILE *stream
, int indent
, tree thunk
)
8230 static const char spaces
[] = " ";
8231 tree name
= DECL_NAME (thunk
);
8234 fprintf (stream
, "%.*s%p %s %s", indent
, spaces
,
8236 !DECL_THUNK_P (thunk
) ? "function"
8237 : DECL_THIS_THUNK_P (thunk
) ? "this-thunk" : "covariant-thunk",
8238 name
? IDENTIFIER_POINTER (name
) : "<unset>");
8239 if (DECL_THUNK_P (thunk
))
8241 HOST_WIDE_INT fixed_adjust
= THUNK_FIXED_OFFSET (thunk
);
8242 tree virtual_adjust
= THUNK_VIRTUAL_OFFSET (thunk
);
8244 fprintf (stream
, " fixed=" HOST_WIDE_INT_PRINT_DEC
, fixed_adjust
);
8245 if (!virtual_adjust
)
8247 else if (DECL_THIS_THUNK_P (thunk
))
8248 fprintf (stream
, " vcall=" HOST_WIDE_INT_PRINT_DEC
,
8249 tree_low_cst (virtual_adjust
, 0));
8251 fprintf (stream
, " vbase=" HOST_WIDE_INT_PRINT_DEC
"(%s)",
8252 tree_low_cst (BINFO_VPTR_FIELD (virtual_adjust
), 0),
8253 type_as_string (BINFO_TYPE (virtual_adjust
), TFF_SCOPE
));
8254 if (THUNK_ALIAS (thunk
))
8255 fprintf (stream
, " alias to %p", (void *)THUNK_ALIAS (thunk
));
8257 fprintf (stream
, "\n");
8258 for (thunks
= DECL_THUNKS (thunk
); thunks
; thunks
= TREE_CHAIN (thunks
))
8259 dump_thunk (stream
, indent
+ 2, thunks
);
8262 /* Dump the thunks for FN. */
8265 debug_thunks (tree fn
)
8267 dump_thunk (stderr
, 0, fn
);
8270 /* Virtual function table initialization. */
8272 /* Create all the necessary vtables for T and its base classes. */
8275 finish_vtbls (tree t
)
8278 vec
<constructor_elt
, va_gc
> *v
= NULL
;
8279 tree vtable
= BINFO_VTABLE (TYPE_BINFO (t
));
8281 /* We lay out the primary and secondary vtables in one contiguous
8282 vtable. The primary vtable is first, followed by the non-virtual
8283 secondary vtables in inheritance graph order. */
8284 accumulate_vtbl_inits (TYPE_BINFO (t
), TYPE_BINFO (t
), TYPE_BINFO (t
),
8287 /* Then come the virtual bases, also in inheritance graph order. */
8288 for (vbase
= TYPE_BINFO (t
); vbase
; vbase
= TREE_CHAIN (vbase
))
8290 if (!BINFO_VIRTUAL_P (vbase
))
8292 accumulate_vtbl_inits (vbase
, vbase
, TYPE_BINFO (t
), vtable
, t
, &v
);
8295 if (BINFO_VTABLE (TYPE_BINFO (t
)))
8296 initialize_vtable (TYPE_BINFO (t
), v
);
8299 /* Initialize the vtable for BINFO with the INITS. */
8302 initialize_vtable (tree binfo
, vec
<constructor_elt
, va_gc
> *inits
)
8306 layout_vtable_decl (binfo
, vec_safe_length (inits
));
8307 decl
= get_vtbl_decl_for_binfo (binfo
);
8308 initialize_artificial_var (decl
, inits
);
8309 dump_vtable (BINFO_TYPE (binfo
), binfo
, decl
);
8312 /* Build the VTT (virtual table table) for T.
8313 A class requires a VTT if it has virtual bases.
8316 1 - primary virtual pointer for complete object T
8317 2 - secondary VTTs for each direct non-virtual base of T which requires a
8319 3 - secondary virtual pointers for each direct or indirect base of T which
8320 has virtual bases or is reachable via a virtual path from T.
8321 4 - secondary VTTs for each direct or indirect virtual base of T.
8323 Secondary VTTs look like complete object VTTs without part 4. */
8331 vec
<constructor_elt
, va_gc
> *inits
;
8333 /* Build up the initializers for the VTT. */
8335 index
= size_zero_node
;
8336 build_vtt_inits (TYPE_BINFO (t
), t
, &inits
, &index
);
8338 /* If we didn't need a VTT, we're done. */
8342 /* Figure out the type of the VTT. */
8343 type
= build_array_of_n_type (const_ptr_type_node
,
8346 /* Now, build the VTT object itself. */
8347 vtt
= build_vtable (t
, mangle_vtt_for_type (t
), type
);
8348 initialize_artificial_var (vtt
, inits
);
8349 /* Add the VTT to the vtables list. */
8350 DECL_CHAIN (vtt
) = DECL_CHAIN (CLASSTYPE_VTABLES (t
));
8351 DECL_CHAIN (CLASSTYPE_VTABLES (t
)) = vtt
;
8356 /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with
8357 PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo,
8358 and CHAIN the vtable pointer for this binfo after construction is
8359 complete. VALUE can also be another BINFO, in which case we recurse. */
8362 binfo_ctor_vtable (tree binfo
)
8368 vt
= BINFO_VTABLE (binfo
);
8369 if (TREE_CODE (vt
) == TREE_LIST
)
8370 vt
= TREE_VALUE (vt
);
8371 if (TREE_CODE (vt
) == TREE_BINFO
)
8380 /* Data for secondary VTT initialization. */
8381 typedef struct secondary_vptr_vtt_init_data_s
8383 /* Is this the primary VTT? */
8386 /* Current index into the VTT. */
8389 /* Vector of initializers built up. */
8390 vec
<constructor_elt
, va_gc
> *inits
;
8392 /* The type being constructed by this secondary VTT. */
8393 tree type_being_constructed
;
8394 } secondary_vptr_vtt_init_data
;
8396 /* Recursively build the VTT-initializer for BINFO (which is in the
8397 hierarchy dominated by T). INITS points to the end of the initializer
8398 list to date. INDEX is the VTT index where the next element will be
8399 replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e.
8400 not a subvtt for some base of T). When that is so, we emit the sub-VTTs
8401 for virtual bases of T. When it is not so, we build the constructor
8402 vtables for the BINFO-in-T variant. */
8405 build_vtt_inits (tree binfo
, tree t
, vec
<constructor_elt
, va_gc
> **inits
,
8411 secondary_vptr_vtt_init_data data
;
8412 int top_level_p
= SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
);
8414 /* We only need VTTs for subobjects with virtual bases. */
8415 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
)))
8418 /* We need to use a construction vtable if this is not the primary
8422 build_ctor_vtbl_group (binfo
, t
);
8424 /* Record the offset in the VTT where this sub-VTT can be found. */
8425 BINFO_SUBVTT_INDEX (binfo
) = *index
;
8428 /* Add the address of the primary vtable for the complete object. */
8429 init
= binfo_ctor_vtable (binfo
);
8430 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
8433 gcc_assert (!BINFO_VPTR_INDEX (binfo
));
8434 BINFO_VPTR_INDEX (binfo
) = *index
;
8436 *index
= size_binop (PLUS_EXPR
, *index
, TYPE_SIZE_UNIT (ptr_type_node
));
8438 /* Recursively add the secondary VTTs for non-virtual bases. */
8439 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, b
); ++i
)
8440 if (!BINFO_VIRTUAL_P (b
))
8441 build_vtt_inits (b
, t
, inits
, index
);
8443 /* Add secondary virtual pointers for all subobjects of BINFO with
8444 either virtual bases or reachable along a virtual path, except
8445 subobjects that are non-virtual primary bases. */
8446 data
.top_level_p
= top_level_p
;
8447 data
.index
= *index
;
8448 data
.inits
= *inits
;
8449 data
.type_being_constructed
= BINFO_TYPE (binfo
);
8451 dfs_walk_once (binfo
, dfs_build_secondary_vptr_vtt_inits
, NULL
, &data
);
8453 *index
= data
.index
;
8455 /* data.inits might have grown as we added secondary virtual pointers.
8456 Make sure our caller knows about the new vector. */
8457 *inits
= data
.inits
;
8460 /* Add the secondary VTTs for virtual bases in inheritance graph
8462 for (b
= TYPE_BINFO (BINFO_TYPE (binfo
)); b
; b
= TREE_CHAIN (b
))
8464 if (!BINFO_VIRTUAL_P (b
))
8467 build_vtt_inits (b
, t
, inits
, index
);
8470 /* Remove the ctor vtables we created. */
8471 dfs_walk_all (binfo
, dfs_fixup_binfo_vtbls
, NULL
, binfo
);
8474 /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base
8475 in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */
8478 dfs_build_secondary_vptr_vtt_inits (tree binfo
, void *data_
)
8480 secondary_vptr_vtt_init_data
*data
= (secondary_vptr_vtt_init_data
*)data_
;
8482 /* We don't care about bases that don't have vtables. */
8483 if (!TYPE_VFIELD (BINFO_TYPE (binfo
)))
8484 return dfs_skip_bases
;
8486 /* We're only interested in proper subobjects of the type being
8488 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), data
->type_being_constructed
))
8491 /* We're only interested in bases with virtual bases or reachable
8492 via a virtual path from the type being constructed. */
8493 if (!(CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
))
8494 || binfo_via_virtual (binfo
, data
->type_being_constructed
)))
8495 return dfs_skip_bases
;
8497 /* We're not interested in non-virtual primary bases. */
8498 if (!BINFO_VIRTUAL_P (binfo
) && BINFO_PRIMARY_P (binfo
))
8501 /* Record the index where this secondary vptr can be found. */
8502 if (data
->top_level_p
)
8504 gcc_assert (!BINFO_VPTR_INDEX (binfo
));
8505 BINFO_VPTR_INDEX (binfo
) = data
->index
;
8507 if (BINFO_VIRTUAL_P (binfo
))
8509 /* It's a primary virtual base, and this is not a
8510 construction vtable. Find the base this is primary of in
8511 the inheritance graph, and use that base's vtable
8513 while (BINFO_PRIMARY_P (binfo
))
8514 binfo
= BINFO_INHERITANCE_CHAIN (binfo
);
8518 /* Add the initializer for the secondary vptr itself. */
8519 CONSTRUCTOR_APPEND_ELT (data
->inits
, NULL_TREE
, binfo_ctor_vtable (binfo
));
8521 /* Advance the vtt index. */
8522 data
->index
= size_binop (PLUS_EXPR
, data
->index
,
8523 TYPE_SIZE_UNIT (ptr_type_node
));
8528 /* Called from build_vtt_inits via dfs_walk. After building
8529 constructor vtables and generating the sub-vtt from them, we need
8530 to restore the BINFO_VTABLES that were scribbled on. DATA is the
8531 binfo of the base whose sub vtt was generated. */
8534 dfs_fixup_binfo_vtbls (tree binfo
, void* data
)
8536 tree vtable
= BINFO_VTABLE (binfo
);
8538 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
8539 /* If this class has no vtable, none of its bases do. */
8540 return dfs_skip_bases
;
8543 /* This might be a primary base, so have no vtable in this
8547 /* If we scribbled the construction vtable vptr into BINFO, clear it
8549 if (TREE_CODE (vtable
) == TREE_LIST
8550 && (TREE_PURPOSE (vtable
) == (tree
) data
))
8551 BINFO_VTABLE (binfo
) = TREE_CHAIN (vtable
);
8556 /* Build the construction vtable group for BINFO which is in the
8557 hierarchy dominated by T. */
8560 build_ctor_vtbl_group (tree binfo
, tree t
)
8566 vec
<constructor_elt
, va_gc
> *v
;
8568 /* See if we've already created this construction vtable group. */
8569 id
= mangle_ctor_vtbl_for_type (t
, binfo
);
8570 if (IDENTIFIER_GLOBAL_VALUE (id
))
8573 gcc_assert (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
));
8574 /* Build a version of VTBL (with the wrong type) for use in
8575 constructing the addresses of secondary vtables in the
8576 construction vtable group. */
8577 vtbl
= build_vtable (t
, id
, ptr_type_node
);
8578 DECL_CONSTRUCTION_VTABLE_P (vtbl
) = 1;
8579 /* Don't export construction vtables from shared libraries. Even on
8580 targets that don't support hidden visibility, this tells
8581 can_refer_decl_in_current_unit_p not to assume that it's safe to
8582 access from a different compilation unit (bz 54314). */
8583 DECL_VISIBILITY (vtbl
) = VISIBILITY_HIDDEN
;
8584 DECL_VISIBILITY_SPECIFIED (vtbl
) = true;
8587 accumulate_vtbl_inits (binfo
, TYPE_BINFO (TREE_TYPE (binfo
)),
8588 binfo
, vtbl
, t
, &v
);
8590 /* Add the vtables for each of our virtual bases using the vbase in T
8592 for (vbase
= TYPE_BINFO (BINFO_TYPE (binfo
));
8594 vbase
= TREE_CHAIN (vbase
))
8598 if (!BINFO_VIRTUAL_P (vbase
))
8600 b
= copied_binfo (vbase
, binfo
);
8602 accumulate_vtbl_inits (b
, vbase
, binfo
, vtbl
, t
, &v
);
8605 /* Figure out the type of the construction vtable. */
8606 type
= build_array_of_n_type (vtable_entry_type
, v
->length ());
8608 TREE_TYPE (vtbl
) = type
;
8609 DECL_SIZE (vtbl
) = DECL_SIZE_UNIT (vtbl
) = NULL_TREE
;
8610 layout_decl (vtbl
, 0);
8612 /* Initialize the construction vtable. */
8613 CLASSTYPE_VTABLES (t
) = chainon (CLASSTYPE_VTABLES (t
), vtbl
);
8614 initialize_artificial_var (vtbl
, v
);
8615 dump_vtable (t
, binfo
, vtbl
);
8618 /* Add the vtbl initializers for BINFO (and its bases other than
8619 non-virtual primaries) to the list of INITS. BINFO is in the
8620 hierarchy dominated by T. RTTI_BINFO is the binfo within T of
8621 the constructor the vtbl inits should be accumulated for. (If this
8622 is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).)
8623 ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO).
8624 BINFO is the active base equivalent of ORIG_BINFO in the inheritance
8625 graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE,
8626 but are not necessarily the same in terms of layout. */
8629 accumulate_vtbl_inits (tree binfo
,
8634 vec
<constructor_elt
, va_gc
> **inits
)
8638 int ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8640 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), BINFO_TYPE (orig_binfo
)));
8642 /* If it doesn't have a vptr, we don't do anything. */
8643 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
8646 /* If we're building a construction vtable, we're not interested in
8647 subobjects that don't require construction vtables. */
8649 && !CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
))
8650 && !binfo_via_virtual (orig_binfo
, BINFO_TYPE (rtti_binfo
)))
8653 /* Build the initializers for the BINFO-in-T vtable. */
8654 dfs_accumulate_vtbl_inits (binfo
, orig_binfo
, rtti_binfo
, vtbl
, t
, inits
);
8656 /* Walk the BINFO and its bases. We walk in preorder so that as we
8657 initialize each vtable we can figure out at what offset the
8658 secondary vtable lies from the primary vtable. We can't use
8659 dfs_walk here because we need to iterate through bases of BINFO
8660 and RTTI_BINFO simultaneously. */
8661 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
8663 /* Skip virtual bases. */
8664 if (BINFO_VIRTUAL_P (base_binfo
))
8666 accumulate_vtbl_inits (base_binfo
,
8667 BINFO_BASE_BINFO (orig_binfo
, i
),
8668 rtti_binfo
, vtbl
, t
,
8673 /* Called from accumulate_vtbl_inits. Adds the initializers for the
8674 BINFO vtable to L. */
8677 dfs_accumulate_vtbl_inits (tree binfo
,
8682 vec
<constructor_elt
, va_gc
> **l
)
8684 tree vtbl
= NULL_TREE
;
8685 int ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8689 && BINFO_VIRTUAL_P (orig_binfo
) && BINFO_PRIMARY_P (orig_binfo
))
8691 /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a
8692 primary virtual base. If it is not the same primary in
8693 the hierarchy of T, we'll need to generate a ctor vtable
8694 for it, to place at its location in T. If it is the same
8695 primary, we still need a VTT entry for the vtable, but it
8696 should point to the ctor vtable for the base it is a
8697 primary for within the sub-hierarchy of RTTI_BINFO.
8699 There are three possible cases:
8701 1) We are in the same place.
8702 2) We are a primary base within a lost primary virtual base of
8704 3) We are primary to something not a base of RTTI_BINFO. */
8707 tree last
= NULL_TREE
;
8709 /* First, look through the bases we are primary to for RTTI_BINFO
8710 or a virtual base. */
8712 while (BINFO_PRIMARY_P (b
))
8714 b
= BINFO_INHERITANCE_CHAIN (b
);
8716 if (BINFO_VIRTUAL_P (b
) || b
== rtti_binfo
)
8719 /* If we run out of primary links, keep looking down our
8720 inheritance chain; we might be an indirect primary. */
8721 for (b
= last
; b
; b
= BINFO_INHERITANCE_CHAIN (b
))
8722 if (BINFO_VIRTUAL_P (b
) || b
== rtti_binfo
)
8726 /* If we found RTTI_BINFO, this is case 1. If we found a virtual
8727 base B and it is a base of RTTI_BINFO, this is case 2. In
8728 either case, we share our vtable with LAST, i.e. the
8729 derived-most base within B of which we are a primary. */
8731 || (b
&& binfo_for_vbase (BINFO_TYPE (b
), BINFO_TYPE (rtti_binfo
))))
8732 /* Just set our BINFO_VTABLE to point to LAST, as we may not have
8733 set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in
8734 binfo_ctor_vtable after everything's been set up. */
8737 /* Otherwise, this is case 3 and we get our own. */
8739 else if (!BINFO_NEW_VTABLE_MARKED (orig_binfo
))
8742 n_inits
= vec_safe_length (*l
);
8749 /* Add the initializer for this vtable. */
8750 build_vtbl_initializer (binfo
, orig_binfo
, t
, rtti_binfo
,
8751 &non_fn_entries
, l
);
8753 /* Figure out the position to which the VPTR should point. */
8754 vtbl
= build1 (ADDR_EXPR
, vtbl_ptr_type_node
, orig_vtbl
);
8755 index
= size_binop (MULT_EXPR
,
8756 TYPE_SIZE_UNIT (vtable_entry_type
),
8757 size_int (non_fn_entries
+ n_inits
));
8758 vtbl
= fold_build_pointer_plus (vtbl
, index
);
8762 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
8763 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
8764 straighten this out. */
8765 BINFO_VTABLE (binfo
) = tree_cons (rtti_binfo
, vtbl
, BINFO_VTABLE (binfo
));
8766 else if (BINFO_PRIMARY_P (binfo
) && BINFO_VIRTUAL_P (binfo
))
8767 /* Throw away any unneeded intializers. */
8768 (*l
)->truncate (n_inits
);
8770 /* For an ordinary vtable, set BINFO_VTABLE. */
8771 BINFO_VTABLE (binfo
) = vtbl
;
8774 static GTY(()) tree abort_fndecl_addr
;
8776 /* Construct the initializer for BINFO's virtual function table. BINFO
8777 is part of the hierarchy dominated by T. If we're building a
8778 construction vtable, the ORIG_BINFO is the binfo we should use to
8779 find the actual function pointers to put in the vtable - but they
8780 can be overridden on the path to most-derived in the graph that
8781 ORIG_BINFO belongs. Otherwise,
8782 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
8783 BINFO that should be indicated by the RTTI information in the
8784 vtable; it will be a base class of T, rather than T itself, if we
8785 are building a construction vtable.
8787 The value returned is a TREE_LIST suitable for wrapping in a
8788 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
8789 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
8790 number of non-function entries in the vtable.
8792 It might seem that this function should never be called with a
8793 BINFO for which BINFO_PRIMARY_P holds, the vtable for such a
8794 base is always subsumed by a derived class vtable. However, when
8795 we are building construction vtables, we do build vtables for
8796 primary bases; we need these while the primary base is being
8800 build_vtbl_initializer (tree binfo
,
8804 int* non_fn_entries_p
,
8805 vec
<constructor_elt
, va_gc
> **inits
)
8811 vec
<tree
, va_gc
> *vbases
;
8814 /* Initialize VID. */
8815 memset (&vid
, 0, sizeof (vid
));
8818 vid
.rtti_binfo
= rtti_binfo
;
8819 vid
.primary_vtbl_p
= SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
);
8820 vid
.ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8821 vid
.generate_vcall_entries
= true;
8822 /* The first vbase or vcall offset is at index -3 in the vtable. */
8823 vid
.index
= ssize_int(-3 * TARGET_VTABLE_DATA_ENTRY_DISTANCE
);
8825 /* Add entries to the vtable for RTTI. */
8826 build_rtti_vtbl_entries (binfo
, &vid
);
8828 /* Create an array for keeping track of the functions we've
8829 processed. When we see multiple functions with the same
8830 signature, we share the vcall offsets. */
8831 vec_alloc (vid
.fns
, 32);
8832 /* Add the vcall and vbase offset entries. */
8833 build_vcall_and_vbase_vtbl_entries (binfo
, &vid
);
8835 /* Clear BINFO_VTABLE_PATH_MARKED; it's set by
8836 build_vbase_offset_vtbl_entries. */
8837 for (vbases
= CLASSTYPE_VBASECLASSES (t
), ix
= 0;
8838 vec_safe_iterate (vbases
, ix
, &vbinfo
); ix
++)
8839 BINFO_VTABLE_PATH_MARKED (vbinfo
) = 0;
8841 /* If the target requires padding between data entries, add that now. */
8842 if (TARGET_VTABLE_DATA_ENTRY_DISTANCE
> 1)
8844 int n_entries
= vec_safe_length (vid
.inits
);
8846 vec_safe_grow (vid
.inits
, TARGET_VTABLE_DATA_ENTRY_DISTANCE
* n_entries
);
8848 /* Move data entries into their new positions and add padding
8849 after the new positions. Iterate backwards so we don't
8850 overwrite entries that we would need to process later. */
8851 for (ix
= n_entries
- 1;
8852 vid
.inits
->iterate (ix
, &e
);
8856 int new_position
= (TARGET_VTABLE_DATA_ENTRY_DISTANCE
* ix
8857 + (TARGET_VTABLE_DATA_ENTRY_DISTANCE
- 1));
8859 (*vid
.inits
)[new_position
] = *e
;
8861 for (j
= 1; j
< TARGET_VTABLE_DATA_ENTRY_DISTANCE
; ++j
)
8863 constructor_elt
*f
= &(*vid
.inits
)[new_position
- j
];
8864 f
->index
= NULL_TREE
;
8865 f
->value
= build1 (NOP_EXPR
, vtable_entry_type
,
8871 if (non_fn_entries_p
)
8872 *non_fn_entries_p
= vec_safe_length (vid
.inits
);
8874 /* The initializers for virtual functions were built up in reverse
8875 order. Straighten them out and add them to the running list in one
8877 jx
= vec_safe_length (*inits
);
8878 vec_safe_grow (*inits
, jx
+ vid
.inits
->length ());
8880 for (ix
= vid
.inits
->length () - 1;
8881 vid
.inits
->iterate (ix
, &e
);
8885 /* Go through all the ordinary virtual functions, building up
8887 for (v
= BINFO_VIRTUALS (orig_binfo
); v
; v
= TREE_CHAIN (v
))
8891 tree fn
, fn_original
;
8892 tree init
= NULL_TREE
;
8896 if (DECL_THUNK_P (fn
))
8898 if (!DECL_NAME (fn
))
8900 if (THUNK_ALIAS (fn
))
8902 fn
= THUNK_ALIAS (fn
);
8905 fn_original
= THUNK_TARGET (fn
);
8908 /* If the only definition of this function signature along our
8909 primary base chain is from a lost primary, this vtable slot will
8910 never be used, so just zero it out. This is important to avoid
8911 requiring extra thunks which cannot be generated with the function.
8913 We first check this in update_vtable_entry_for_fn, so we handle
8914 restored primary bases properly; we also need to do it here so we
8915 zero out unused slots in ctor vtables, rather than filling them
8916 with erroneous values (though harmless, apart from relocation
8918 if (BV_LOST_PRIMARY (v
))
8919 init
= size_zero_node
;
8923 /* Pull the offset for `this', and the function to call, out of
8925 delta
= BV_DELTA (v
);
8926 vcall_index
= BV_VCALL_INDEX (v
);
8928 gcc_assert (TREE_CODE (delta
) == INTEGER_CST
);
8929 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
8931 /* You can't call an abstract virtual function; it's abstract.
8932 So, we replace these functions with __pure_virtual. */
8933 if (DECL_PURE_VIRTUAL_P (fn_original
))
8936 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
8938 if (abort_fndecl_addr
== NULL
)
8940 = fold_convert (vfunc_ptr_type_node
,
8941 build_fold_addr_expr (fn
));
8942 init
= abort_fndecl_addr
;
8945 /* Likewise for deleted virtuals. */
8946 else if (DECL_DELETED_FN (fn_original
))
8948 fn
= get_identifier ("__cxa_deleted_virtual");
8949 if (!get_global_value_if_present (fn
, &fn
))
8950 fn
= push_library_fn (fn
, (build_function_type_list
8951 (void_type_node
, NULL_TREE
)),
8952 NULL_TREE
, ECF_NORETURN
);
8953 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
8954 init
= fold_convert (vfunc_ptr_type_node
,
8955 build_fold_addr_expr (fn
));
8959 if (!integer_zerop (delta
) || vcall_index
)
8961 fn
= make_thunk (fn
, /*this_adjusting=*/1, delta
, vcall_index
);
8962 if (!DECL_NAME (fn
))
8965 /* Take the address of the function, considering it to be of an
8966 appropriate generic type. */
8967 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
8968 init
= fold_convert (vfunc_ptr_type_node
,
8969 build_fold_addr_expr (fn
));
8973 /* And add it to the chain of initializers. */
8974 if (TARGET_VTABLE_USES_DESCRIPTORS
)
8977 if (init
== size_zero_node
)
8978 for (i
= 0; i
< TARGET_VTABLE_USES_DESCRIPTORS
; ++i
)
8979 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
8981 for (i
= 0; i
< TARGET_VTABLE_USES_DESCRIPTORS
; ++i
)
8983 tree fdesc
= build2 (FDESC_EXPR
, vfunc_ptr_type_node
,
8984 fn
, build_int_cst (NULL_TREE
, i
));
8985 TREE_CONSTANT (fdesc
) = 1;
8987 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, fdesc
);
8991 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
8995 /* Adds to vid->inits the initializers for the vbase and vcall
8996 offsets in BINFO, which is in the hierarchy dominated by T. */
8999 build_vcall_and_vbase_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9003 /* If this is a derived class, we must first create entries
9004 corresponding to the primary base class. */
9005 b
= get_primary_binfo (binfo
);
9007 build_vcall_and_vbase_vtbl_entries (b
, vid
);
9009 /* Add the vbase entries for this base. */
9010 build_vbase_offset_vtbl_entries (binfo
, vid
);
9011 /* Add the vcall entries for this base. */
9012 build_vcall_offset_vtbl_entries (binfo
, vid
);
9015 /* Returns the initializers for the vbase offset entries in the vtable
9016 for BINFO (which is part of the class hierarchy dominated by T), in
9017 reverse order. VBASE_OFFSET_INDEX gives the vtable index
9018 where the next vbase offset will go. */
9021 build_vbase_offset_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9025 tree non_primary_binfo
;
9027 /* If there are no virtual baseclasses, then there is nothing to
9029 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
)))
9034 /* We might be a primary base class. Go up the inheritance hierarchy
9035 until we find the most derived class of which we are a primary base:
9036 it is the offset of that which we need to use. */
9037 non_primary_binfo
= binfo
;
9038 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo
))
9042 /* If we have reached a virtual base, then it must be a primary
9043 base (possibly multi-level) of vid->binfo, or we wouldn't
9044 have called build_vcall_and_vbase_vtbl_entries for it. But it
9045 might be a lost primary, so just skip down to vid->binfo. */
9046 if (BINFO_VIRTUAL_P (non_primary_binfo
))
9048 non_primary_binfo
= vid
->binfo
;
9052 b
= BINFO_INHERITANCE_CHAIN (non_primary_binfo
);
9053 if (get_primary_binfo (b
) != non_primary_binfo
)
9055 non_primary_binfo
= b
;
9058 /* Go through the virtual bases, adding the offsets. */
9059 for (vbase
= TYPE_BINFO (BINFO_TYPE (binfo
));
9061 vbase
= TREE_CHAIN (vbase
))
9066 if (!BINFO_VIRTUAL_P (vbase
))
9069 /* Find the instance of this virtual base in the complete
9071 b
= copied_binfo (vbase
, binfo
);
9073 /* If we've already got an offset for this virtual base, we
9074 don't need another one. */
9075 if (BINFO_VTABLE_PATH_MARKED (b
))
9077 BINFO_VTABLE_PATH_MARKED (b
) = 1;
9079 /* Figure out where we can find this vbase offset. */
9080 delta
= size_binop (MULT_EXPR
,
9083 TYPE_SIZE_UNIT (vtable_entry_type
)));
9084 if (vid
->primary_vtbl_p
)
9085 BINFO_VPTR_FIELD (b
) = delta
;
9087 if (binfo
!= TYPE_BINFO (t
))
9088 /* The vbase offset had better be the same. */
9089 gcc_assert (tree_int_cst_equal (delta
, BINFO_VPTR_FIELD (vbase
)));
9091 /* The next vbase will come at a more negative offset. */
9092 vid
->index
= size_binop (MINUS_EXPR
, vid
->index
,
9093 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE
));
9095 /* The initializer is the delta from BINFO to this virtual base.
9096 The vbase offsets go in reverse inheritance-graph order, and
9097 we are walking in inheritance graph order so these end up in
9099 delta
= size_diffop_loc (input_location
,
9100 BINFO_OFFSET (b
), BINFO_OFFSET (non_primary_binfo
));
9102 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
,
9103 fold_build1_loc (input_location
, NOP_EXPR
,
9104 vtable_entry_type
, delta
));
9108 /* Adds the initializers for the vcall offset entries in the vtable
9109 for BINFO (which is part of the class hierarchy dominated by VID->DERIVED)
9113 build_vcall_offset_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9115 /* We only need these entries if this base is a virtual base. We
9116 compute the indices -- but do not add to the vtable -- when
9117 building the main vtable for a class. */
9118 if (binfo
== TYPE_BINFO (vid
->derived
)
9119 || (BINFO_VIRTUAL_P (binfo
)
9120 /* If BINFO is RTTI_BINFO, then (since BINFO does not
9121 correspond to VID->DERIVED), we are building a primary
9122 construction virtual table. Since this is a primary
9123 virtual table, we do not need the vcall offsets for
9125 && binfo
!= vid
->rtti_binfo
))
9127 /* We need a vcall offset for each of the virtual functions in this
9128 vtable. For example:
9130 class A { virtual void f (); };
9131 class B1 : virtual public A { virtual void f (); };
9132 class B2 : virtual public A { virtual void f (); };
9133 class C: public B1, public B2 { virtual void f (); };
9135 A C object has a primary base of B1, which has a primary base of A. A
9136 C also has a secondary base of B2, which no longer has a primary base
9137 of A. So the B2-in-C construction vtable needs a secondary vtable for
9138 A, which will adjust the A* to a B2* to call f. We have no way of
9139 knowing what (or even whether) this offset will be when we define B2,
9140 so we store this "vcall offset" in the A sub-vtable and look it up in
9141 a "virtual thunk" for B2::f.
9143 We need entries for all the functions in our primary vtable and
9144 in our non-virtual bases' secondary vtables. */
9146 /* If we are just computing the vcall indices -- but do not need
9147 the actual entries -- not that. */
9148 if (!BINFO_VIRTUAL_P (binfo
))
9149 vid
->generate_vcall_entries
= false;
9150 /* Now, walk through the non-virtual bases, adding vcall offsets. */
9151 add_vcall_offset_vtbl_entries_r (binfo
, vid
);
9155 /* Build vcall offsets, starting with those for BINFO. */
9158 add_vcall_offset_vtbl_entries_r (tree binfo
, vtbl_init_data
* vid
)
9164 /* Don't walk into virtual bases -- except, of course, for the
9165 virtual base for which we are building vcall offsets. Any
9166 primary virtual base will have already had its offsets generated
9167 through the recursion in build_vcall_and_vbase_vtbl_entries. */
9168 if (BINFO_VIRTUAL_P (binfo
) && vid
->vbase
!= binfo
)
9171 /* If BINFO has a primary base, process it first. */
9172 primary_binfo
= get_primary_binfo (binfo
);
9174 add_vcall_offset_vtbl_entries_r (primary_binfo
, vid
);
9176 /* Add BINFO itself to the list. */
9177 add_vcall_offset_vtbl_entries_1 (binfo
, vid
);
9179 /* Scan the non-primary bases of BINFO. */
9180 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
9181 if (base_binfo
!= primary_binfo
)
9182 add_vcall_offset_vtbl_entries_r (base_binfo
, vid
);
9185 /* Called from build_vcall_offset_vtbl_entries_r. */
9188 add_vcall_offset_vtbl_entries_1 (tree binfo
, vtbl_init_data
* vid
)
9190 /* Make entries for the rest of the virtuals. */
9191 if (abi_version_at_least (2))
9195 /* The ABI requires that the methods be processed in declaration
9196 order. G++ 3.2 used the order in the vtable. */
9197 for (orig_fn
= TYPE_METHODS (BINFO_TYPE (binfo
));
9199 orig_fn
= DECL_CHAIN (orig_fn
))
9200 if (DECL_VINDEX (orig_fn
))
9201 add_vcall_offset (orig_fn
, binfo
, vid
);
9205 tree derived_virtuals
;
9208 /* If BINFO is a primary base, the most derived class which has
9209 BINFO as a primary base; otherwise, just BINFO. */
9210 tree non_primary_binfo
;
9212 /* We might be a primary base class. Go up the inheritance hierarchy
9213 until we find the most derived class of which we are a primary base:
9214 it is the BINFO_VIRTUALS there that we need to consider. */
9215 non_primary_binfo
= binfo
;
9216 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo
))
9220 /* If we have reached a virtual base, then it must be vid->vbase,
9221 because we ignore other virtual bases in
9222 add_vcall_offset_vtbl_entries_r. In turn, it must be a primary
9223 base (possibly multi-level) of vid->binfo, or we wouldn't
9224 have called build_vcall_and_vbase_vtbl_entries for it. But it
9225 might be a lost primary, so just skip down to vid->binfo. */
9226 if (BINFO_VIRTUAL_P (non_primary_binfo
))
9228 gcc_assert (non_primary_binfo
== vid
->vbase
);
9229 non_primary_binfo
= vid
->binfo
;
9233 b
= BINFO_INHERITANCE_CHAIN (non_primary_binfo
);
9234 if (get_primary_binfo (b
) != non_primary_binfo
)
9236 non_primary_binfo
= b
;
9239 if (vid
->ctor_vtbl_p
)
9240 /* For a ctor vtable we need the equivalent binfo within the hierarchy
9241 where rtti_binfo is the most derived type. */
9243 = original_binfo (non_primary_binfo
, vid
->rtti_binfo
);
9245 for (base_virtuals
= BINFO_VIRTUALS (binfo
),
9246 derived_virtuals
= BINFO_VIRTUALS (non_primary_binfo
),
9247 orig_virtuals
= BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo
)));
9249 base_virtuals
= TREE_CHAIN (base_virtuals
),
9250 derived_virtuals
= TREE_CHAIN (derived_virtuals
),
9251 orig_virtuals
= TREE_CHAIN (orig_virtuals
))
9255 /* Find the declaration that originally caused this function to
9256 be present in BINFO_TYPE (binfo). */
9257 orig_fn
= BV_FN (orig_virtuals
);
9259 /* When processing BINFO, we only want to generate vcall slots for
9260 function slots introduced in BINFO. So don't try to generate
9261 one if the function isn't even defined in BINFO. */
9262 if (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), DECL_CONTEXT (orig_fn
)))
9265 add_vcall_offset (orig_fn
, binfo
, vid
);
9270 /* Add a vcall offset entry for ORIG_FN to the vtable. */
9273 add_vcall_offset (tree orig_fn
, tree binfo
, vtbl_init_data
*vid
)
9279 /* If there is already an entry for a function with the same
9280 signature as FN, then we do not need a second vcall offset.
9281 Check the list of functions already present in the derived
9283 FOR_EACH_VEC_SAFE_ELT (vid
->fns
, i
, derived_entry
)
9285 if (same_signature_p (derived_entry
, orig_fn
)
9286 /* We only use one vcall offset for virtual destructors,
9287 even though there are two virtual table entries. */
9288 || (DECL_DESTRUCTOR_P (derived_entry
)
9289 && DECL_DESTRUCTOR_P (orig_fn
)))
9293 /* If we are building these vcall offsets as part of building
9294 the vtable for the most derived class, remember the vcall
9296 if (vid
->binfo
== TYPE_BINFO (vid
->derived
))
9298 tree_pair_s elt
= {orig_fn
, vid
->index
};
9299 vec_safe_push (CLASSTYPE_VCALL_INDICES (vid
->derived
), elt
);
9302 /* The next vcall offset will be found at a more negative
9304 vid
->index
= size_binop (MINUS_EXPR
, vid
->index
,
9305 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE
));
9307 /* Keep track of this function. */
9308 vec_safe_push (vid
->fns
, orig_fn
);
9310 if (vid
->generate_vcall_entries
)
9315 /* Find the overriding function. */
9316 fn
= find_final_overrider (vid
->rtti_binfo
, binfo
, orig_fn
);
9317 if (fn
== error_mark_node
)
9318 vcall_offset
= build_zero_cst (vtable_entry_type
);
9321 base
= TREE_VALUE (fn
);
9323 /* The vbase we're working on is a primary base of
9324 vid->binfo. But it might be a lost primary, so its
9325 BINFO_OFFSET might be wrong, so we just use the
9326 BINFO_OFFSET from vid->binfo. */
9327 vcall_offset
= size_diffop_loc (input_location
,
9328 BINFO_OFFSET (base
),
9329 BINFO_OFFSET (vid
->binfo
));
9330 vcall_offset
= fold_build1_loc (input_location
,
9331 NOP_EXPR
, vtable_entry_type
,
9334 /* Add the initializer to the vtable. */
9335 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, vcall_offset
);
9339 /* Return vtbl initializers for the RTTI entries corresponding to the
9340 BINFO's vtable. The RTTI entries should indicate the object given
9341 by VID->rtti_binfo. */
9344 build_rtti_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9352 t
= BINFO_TYPE (vid
->rtti_binfo
);
9354 /* To find the complete object, we will first convert to our most
9355 primary base, and then add the offset in the vtbl to that value. */
9357 while (CLASSTYPE_HAS_PRIMARY_BASE_P (BINFO_TYPE (b
))
9358 && !BINFO_LOST_PRIMARY_P (b
))
9362 primary_base
= get_primary_binfo (b
);
9363 gcc_assert (BINFO_PRIMARY_P (primary_base
)
9364 && BINFO_INHERITANCE_CHAIN (primary_base
) == b
);
9367 offset
= size_diffop_loc (input_location
,
9368 BINFO_OFFSET (vid
->rtti_binfo
), BINFO_OFFSET (b
));
9370 /* The second entry is the address of the typeinfo object. */
9372 decl
= build_address (get_tinfo_decl (t
));
9374 decl
= integer_zero_node
;
9376 /* Convert the declaration to a type that can be stored in the
9378 init
= build_nop (vfunc_ptr_type_node
, decl
);
9379 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, init
);
9381 /* Add the offset-to-top entry. It comes earlier in the vtable than
9382 the typeinfo entry. Convert the offset to look like a
9383 function pointer, so that we can put it in the vtable. */
9384 init
= build_nop (vfunc_ptr_type_node
, offset
);
9385 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, init
);
9388 /* TRUE iff TYPE is uniquely derived from PARENT. Ignores
9392 uniquely_derived_from_p (tree parent
, tree type
)
9394 tree base
= lookup_base (type
, parent
, ba_unique
, NULL
, tf_none
);
9395 return base
&& base
!= error_mark_node
;
9398 /* TRUE iff TYPE is publicly & uniquely derived from PARENT. */
9401 publicly_uniquely_derived_p (tree parent
, tree type
)
9403 tree base
= lookup_base (type
, parent
, ba_ignore_scope
| ba_check
,
9405 return base
&& base
!= error_mark_node
;
9408 /* CTX1 and CTX2 are declaration contexts. Return the innermost common
9409 class between them, if any. */
9412 common_enclosing_class (tree ctx1
, tree ctx2
)
9414 if (!TYPE_P (ctx1
) || !TYPE_P (ctx2
))
9416 gcc_assert (ctx1
== TYPE_MAIN_VARIANT (ctx1
)
9417 && ctx2
== TYPE_MAIN_VARIANT (ctx2
));
9420 for (tree t
= ctx1
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9421 TYPE_MARKED_P (t
) = true;
9422 tree found
= NULL_TREE
;
9423 for (tree t
= ctx2
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9424 if (TYPE_MARKED_P (t
))
9429 for (tree t
= ctx1
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9430 TYPE_MARKED_P (t
) = false;
9434 #include "gt-cp-class.h"