1 /* Functions related to building classes and their related objects.
2 Copyright (C) 1987-2014 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
22 /* High-level class interface. */
26 #include "coretypes.h"
29 #include "stringpool.h"
30 #include "stor-layout.h"
32 #include "pointer-set.h"
33 #include "hash-table.h"
41 #include "splay-tree.h"
45 /* The number of nested classes being processed. If we are not in the
46 scope of any class, this is zero. */
48 int current_class_depth
;
50 /* In order to deal with nested classes, we keep a stack of classes.
51 The topmost entry is the innermost class, and is the entry at index
52 CURRENT_CLASS_DEPTH */
54 typedef struct class_stack_node
{
55 /* The name of the class. */
58 /* The _TYPE node for the class. */
61 /* The access specifier pending for new declarations in the scope of
65 /* If were defining TYPE, the names used in this class. */
66 splay_tree names_used
;
68 /* Nonzero if this class is no longer open, because of a call to
71 }* class_stack_node_t
;
73 typedef struct vtbl_init_data_s
75 /* The base for which we're building initializers. */
77 /* The type of the most-derived type. */
79 /* The binfo for the dynamic type. This will be TYPE_BINFO (derived),
80 unless ctor_vtbl_p is true. */
82 /* The negative-index vtable initializers built up so far. These
83 are in order from least negative index to most negative index. */
84 vec
<constructor_elt
, va_gc
> *inits
;
85 /* The binfo for the virtual base for which we're building
86 vcall offset initializers. */
88 /* The functions in vbase for which we have already provided vcall
90 vec
<tree
, va_gc
> *fns
;
91 /* The vtable index of the next vcall or vbase offset. */
93 /* Nonzero if we are building the initializer for the primary
96 /* Nonzero if we are building the initializer for a construction
99 /* True when adding vcall offset entries to the vtable. False when
100 merely computing the indices. */
101 bool generate_vcall_entries
;
104 /* The type of a function passed to walk_subobject_offsets. */
105 typedef int (*subobject_offset_fn
) (tree
, tree
, splay_tree
);
107 /* The stack itself. This is a dynamically resized array. The
108 number of elements allocated is CURRENT_CLASS_STACK_SIZE. */
109 static int current_class_stack_size
;
110 static class_stack_node_t current_class_stack
;
112 /* The size of the largest empty class seen in this translation unit. */
113 static GTY (()) tree sizeof_biggest_empty_class
;
115 /* An array of all local classes present in this translation unit, in
116 declaration order. */
117 vec
<tree
, va_gc
> *local_classes
;
119 static tree
get_vfield_name (tree
);
120 static void finish_struct_anon (tree
);
121 static tree
get_vtable_name (tree
);
122 static tree
get_basefndecls (tree
, tree
);
123 static int build_primary_vtable (tree
, tree
);
124 static int build_secondary_vtable (tree
);
125 static void finish_vtbls (tree
);
126 static void modify_vtable_entry (tree
, tree
, tree
, tree
, tree
*);
127 static void finish_struct_bits (tree
);
128 static int alter_access (tree
, tree
, tree
);
129 static void handle_using_decl (tree
, tree
);
130 static tree
dfs_modify_vtables (tree
, void *);
131 static tree
modify_all_vtables (tree
, tree
);
132 static void determine_primary_bases (tree
);
133 static void finish_struct_methods (tree
);
134 static void maybe_warn_about_overly_private_class (tree
);
135 static int method_name_cmp (const void *, const void *);
136 static int resort_method_name_cmp (const void *, const void *);
137 static void add_implicitly_declared_members (tree
, tree
*, int, int);
138 static tree
fixed_type_or_null (tree
, int *, int *);
139 static tree
build_simple_base_path (tree expr
, tree binfo
);
140 static tree
build_vtbl_ref_1 (tree
, tree
);
141 static void build_vtbl_initializer (tree
, tree
, tree
, tree
, int *,
142 vec
<constructor_elt
, va_gc
> **);
143 static int count_fields (tree
);
144 static int add_fields_to_record_type (tree
, struct sorted_fields_type
*, int);
145 static void insert_into_classtype_sorted_fields (tree
, tree
, int);
146 static bool check_bitfield_decl (tree
);
147 static void check_field_decl (tree
, tree
, int *, int *, int *);
148 static void check_field_decls (tree
, tree
*, int *, int *);
149 static tree
*build_base_field (record_layout_info
, tree
, splay_tree
, tree
*);
150 static void build_base_fields (record_layout_info
, splay_tree
, tree
*);
151 static void check_methods (tree
);
152 static void remove_zero_width_bit_fields (tree
);
153 static bool accessible_nvdtor_p (tree
);
154 static void check_bases (tree
, int *, int *);
155 static void check_bases_and_members (tree
);
156 static tree
create_vtable_ptr (tree
, tree
*);
157 static void include_empty_classes (record_layout_info
);
158 static void layout_class_type (tree
, tree
*);
159 static void propagate_binfo_offsets (tree
, tree
);
160 static void layout_virtual_bases (record_layout_info
, splay_tree
);
161 static void build_vbase_offset_vtbl_entries (tree
, vtbl_init_data
*);
162 static void add_vcall_offset_vtbl_entries_r (tree
, vtbl_init_data
*);
163 static void add_vcall_offset_vtbl_entries_1 (tree
, vtbl_init_data
*);
164 static void build_vcall_offset_vtbl_entries (tree
, vtbl_init_data
*);
165 static void add_vcall_offset (tree
, tree
, vtbl_init_data
*);
166 static void layout_vtable_decl (tree
, int);
167 static tree
dfs_find_final_overrider_pre (tree
, void *);
168 static tree
dfs_find_final_overrider_post (tree
, void *);
169 static tree
find_final_overrider (tree
, tree
, tree
);
170 static int make_new_vtable (tree
, tree
);
171 static tree
get_primary_binfo (tree
);
172 static int maybe_indent_hierarchy (FILE *, int, int);
173 static tree
dump_class_hierarchy_r (FILE *, int, tree
, tree
, int);
174 static void dump_class_hierarchy (tree
);
175 static void dump_class_hierarchy_1 (FILE *, int, tree
);
176 static void dump_array (FILE *, tree
);
177 static void dump_vtable (tree
, tree
, tree
);
178 static void dump_vtt (tree
, tree
);
179 static void dump_thunk (FILE *, int, tree
);
180 static tree
build_vtable (tree
, tree
, tree
);
181 static void initialize_vtable (tree
, vec
<constructor_elt
, va_gc
> *);
182 static void layout_nonempty_base_or_field (record_layout_info
,
183 tree
, tree
, splay_tree
);
184 static tree
end_of_class (tree
, int);
185 static bool layout_empty_base (record_layout_info
, tree
, tree
, splay_tree
);
186 static void accumulate_vtbl_inits (tree
, tree
, tree
, tree
, tree
,
187 vec
<constructor_elt
, va_gc
> **);
188 static void dfs_accumulate_vtbl_inits (tree
, tree
, tree
, tree
, tree
,
189 vec
<constructor_elt
, va_gc
> **);
190 static void build_rtti_vtbl_entries (tree
, vtbl_init_data
*);
191 static void build_vcall_and_vbase_vtbl_entries (tree
, vtbl_init_data
*);
192 static void clone_constructors_and_destructors (tree
);
193 static tree
build_clone (tree
, tree
);
194 static void update_vtable_entry_for_fn (tree
, tree
, tree
, tree
*, unsigned);
195 static void build_ctor_vtbl_group (tree
, tree
);
196 static void build_vtt (tree
);
197 static tree
binfo_ctor_vtable (tree
);
198 static void build_vtt_inits (tree
, tree
, vec
<constructor_elt
, va_gc
> **,
200 static tree
dfs_build_secondary_vptr_vtt_inits (tree
, void *);
201 static tree
dfs_fixup_binfo_vtbls (tree
, void *);
202 static int record_subobject_offset (tree
, tree
, splay_tree
);
203 static int check_subobject_offset (tree
, tree
, splay_tree
);
204 static int walk_subobject_offsets (tree
, subobject_offset_fn
,
205 tree
, splay_tree
, tree
, int);
206 static void record_subobject_offsets (tree
, tree
, splay_tree
, bool);
207 static int layout_conflict_p (tree
, tree
, splay_tree
, int);
208 static int splay_tree_compare_integer_csts (splay_tree_key k1
,
210 static void warn_about_ambiguous_bases (tree
);
211 static bool type_requires_array_cookie (tree
);
212 static bool contains_empty_class_p (tree
);
213 static bool base_derived_from (tree
, tree
);
214 static int empty_base_at_nonzero_offset_p (tree
, tree
, splay_tree
);
215 static tree
end_of_base (tree
);
216 static tree
get_vcall_index (tree
, tree
);
218 /* Variables shared between class.c and call.c. */
221 int n_vtable_entries
= 0;
222 int n_vtable_searches
= 0;
223 int n_vtable_elems
= 0;
224 int n_convert_harshness
= 0;
225 int n_compute_conversion_costs
= 0;
226 int n_inner_fields_searched
= 0;
228 /* Convert to or from a base subobject. EXPR is an expression of type
229 `A' or `A*', an expression of type `B' or `B*' is returned. To
230 convert A to a base B, CODE is PLUS_EXPR and BINFO is the binfo for
231 the B base instance within A. To convert base A to derived B, CODE
232 is MINUS_EXPR and BINFO is the binfo for the A instance within B.
233 In this latter case, A must not be a morally virtual base of B.
234 NONNULL is true if EXPR is known to be non-NULL (this is only
235 needed when EXPR is of pointer type). CV qualifiers are preserved
239 build_base_path (enum tree_code code
,
243 tsubst_flags_t complain
)
245 tree v_binfo
= NULL_TREE
;
246 tree d_binfo
= NULL_TREE
;
250 tree null_test
= NULL
;
251 tree ptr_target_type
;
253 int want_pointer
= TYPE_PTR_P (TREE_TYPE (expr
));
254 bool has_empty
= false;
257 if (expr
== error_mark_node
|| binfo
== error_mark_node
|| !binfo
)
258 return error_mark_node
;
260 for (probe
= binfo
; probe
; probe
= BINFO_INHERITANCE_CHAIN (probe
))
263 if (is_empty_class (BINFO_TYPE (probe
)))
265 if (!v_binfo
&& BINFO_VIRTUAL_P (probe
))
269 probe
= TYPE_MAIN_VARIANT (TREE_TYPE (expr
));
271 probe
= TYPE_MAIN_VARIANT (TREE_TYPE (probe
));
273 if (code
== PLUS_EXPR
274 && !SAME_BINFO_TYPE_P (BINFO_TYPE (d_binfo
), probe
))
276 /* This can happen when adjust_result_of_qualified_name_lookup can't
277 find a unique base binfo in a call to a member function. We
278 couldn't give the diagnostic then since we might have been calling
279 a static member function, so we do it now. */
280 if (complain
& tf_error
)
282 tree base
= lookup_base (probe
, BINFO_TYPE (d_binfo
),
283 ba_unique
, NULL
, complain
);
284 gcc_assert (base
== error_mark_node
);
286 return error_mark_node
;
289 gcc_assert ((code
== MINUS_EXPR
290 && SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), probe
))
291 || code
== PLUS_EXPR
);
293 if (binfo
== d_binfo
)
297 if (code
== MINUS_EXPR
&& v_binfo
)
299 if (complain
& tf_error
)
301 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), BINFO_TYPE (v_binfo
)))
304 error ("cannot convert from pointer to base class %qT to "
305 "pointer to derived class %qT because the base is "
306 "virtual", BINFO_TYPE (binfo
), BINFO_TYPE (d_binfo
));
308 error ("cannot convert from base class %qT to derived "
309 "class %qT because the base is virtual",
310 BINFO_TYPE (binfo
), BINFO_TYPE (d_binfo
));
315 error ("cannot convert from pointer to base class %qT to "
316 "pointer to derived class %qT via virtual base %qT",
317 BINFO_TYPE (binfo
), BINFO_TYPE (d_binfo
),
318 BINFO_TYPE (v_binfo
));
320 error ("cannot convert from base class %qT to derived "
321 "class %qT via virtual base %qT", BINFO_TYPE (binfo
),
322 BINFO_TYPE (d_binfo
), BINFO_TYPE (v_binfo
));
325 return error_mark_node
;
329 /* This must happen before the call to save_expr. */
330 expr
= cp_build_addr_expr (expr
, complain
);
332 expr
= mark_rvalue_use (expr
);
334 offset
= BINFO_OFFSET (binfo
);
335 fixed_type_p
= resolves_to_fixed_type_p (expr
, &nonnull
);
336 target_type
= code
== PLUS_EXPR
? BINFO_TYPE (binfo
) : BINFO_TYPE (d_binfo
);
337 /* TARGET_TYPE has been extracted from BINFO, and, is therefore always
338 cv-unqualified. Extract the cv-qualifiers from EXPR so that the
339 expression returned matches the input. */
340 target_type
= cp_build_qualified_type
341 (target_type
, cp_type_quals (TREE_TYPE (TREE_TYPE (expr
))));
342 ptr_target_type
= build_pointer_type (target_type
);
344 /* Do we need to look in the vtable for the real offset? */
345 virtual_access
= (v_binfo
&& fixed_type_p
<= 0);
347 /* Don't bother with the calculations inside sizeof; they'll ICE if the
348 source type is incomplete and the pointer value doesn't matter. In a
349 template (even in fold_non_dependent_expr), we don't have vtables set
350 up properly yet, and the value doesn't matter there either; we're just
351 interested in the result of overload resolution. */
352 if (cp_unevaluated_operand
!= 0
353 || in_template_function ())
355 expr
= build_nop (ptr_target_type
, expr
);
357 expr
= build_indirect_ref (EXPR_LOCATION (expr
), expr
, RO_NULL
);
361 /* If we're in an NSDMI, we don't have the full constructor context yet
362 that we need for converting to a virtual base, so just build a stub
363 CONVERT_EXPR and expand it later in bot_replace. */
364 if (virtual_access
&& fixed_type_p
< 0
365 && current_scope () != current_function_decl
)
367 expr
= build1 (CONVERT_EXPR
, ptr_target_type
, expr
);
368 CONVERT_EXPR_VBASE_PATH (expr
) = true;
370 expr
= build_indirect_ref (EXPR_LOCATION (expr
), expr
, RO_NULL
);
374 /* Do we need to check for a null pointer? */
375 if (want_pointer
&& !nonnull
)
377 /* If we know the conversion will not actually change the value
378 of EXPR, then we can avoid testing the expression for NULL.
379 We have to avoid generating a COMPONENT_REF for a base class
380 field, because other parts of the compiler know that such
381 expressions are always non-NULL. */
382 if (!virtual_access
&& integer_zerop (offset
))
383 return build_nop (ptr_target_type
, expr
);
384 null_test
= error_mark_node
;
387 /* Protect against multiple evaluation if necessary. */
388 if (TREE_SIDE_EFFECTS (expr
) && (null_test
|| virtual_access
))
389 expr
= save_expr (expr
);
391 /* Now that we've saved expr, build the real null test. */
394 tree zero
= cp_convert (TREE_TYPE (expr
), nullptr_node
, complain
);
395 null_test
= fold_build2_loc (input_location
, NE_EXPR
, boolean_type_node
,
399 /* If this is a simple base reference, express it as a COMPONENT_REF. */
400 if (code
== PLUS_EXPR
&& !virtual_access
401 /* We don't build base fields for empty bases, and they aren't very
402 interesting to the optimizers anyway. */
405 expr
= cp_build_indirect_ref (expr
, RO_NULL
, complain
);
406 expr
= build_simple_base_path (expr
, binfo
);
408 expr
= build_address (expr
);
409 target_type
= TREE_TYPE (expr
);
415 /* Going via virtual base V_BINFO. We need the static offset
416 from V_BINFO to BINFO, and the dynamic offset from D_BINFO to
417 V_BINFO. That offset is an entry in D_BINFO's vtable. */
420 if (fixed_type_p
< 0 && in_base_initializer
)
422 /* In a base member initializer, we cannot rely on the
423 vtable being set up. We have to indirect via the
427 t
= TREE_TYPE (TYPE_VFIELD (current_class_type
));
428 t
= build_pointer_type (t
);
429 v_offset
= convert (t
, current_vtt_parm
);
430 v_offset
= cp_build_indirect_ref (v_offset
, RO_NULL
, complain
);
433 v_offset
= build_vfield_ref (cp_build_indirect_ref (expr
, RO_NULL
,
435 TREE_TYPE (TREE_TYPE (expr
)));
437 if (v_offset
== error_mark_node
)
438 return error_mark_node
;
440 v_offset
= fold_build_pointer_plus (v_offset
, BINFO_VPTR_FIELD (v_binfo
));
441 v_offset
= build1 (NOP_EXPR
,
442 build_pointer_type (ptrdiff_type_node
),
444 v_offset
= cp_build_indirect_ref (v_offset
, RO_NULL
, complain
);
445 TREE_CONSTANT (v_offset
) = 1;
447 offset
= convert_to_integer (ptrdiff_type_node
,
448 size_diffop_loc (input_location
, offset
,
449 BINFO_OFFSET (v_binfo
)));
451 if (!integer_zerop (offset
))
452 v_offset
= build2 (code
, ptrdiff_type_node
, v_offset
, offset
);
454 if (fixed_type_p
< 0)
455 /* Negative fixed_type_p means this is a constructor or destructor;
456 virtual base layout is fixed in in-charge [cd]tors, but not in
458 offset
= build3 (COND_EXPR
, ptrdiff_type_node
,
459 build2 (EQ_EXPR
, boolean_type_node
,
460 current_in_charge_parm
, integer_zero_node
),
462 convert_to_integer (ptrdiff_type_node
,
463 BINFO_OFFSET (binfo
)));
469 target_type
= ptr_target_type
;
471 expr
= build1 (NOP_EXPR
, ptr_target_type
, expr
);
473 if (!integer_zerop (offset
))
475 offset
= fold_convert (sizetype
, offset
);
476 if (code
== MINUS_EXPR
)
477 offset
= fold_build1_loc (input_location
, NEGATE_EXPR
, sizetype
, offset
);
478 expr
= fold_build_pointer_plus (expr
, offset
);
484 expr
= cp_build_indirect_ref (expr
, RO_NULL
, complain
);
488 expr
= fold_build3_loc (input_location
, COND_EXPR
, target_type
, null_test
, expr
,
489 build_zero_cst (target_type
));
494 /* Subroutine of build_base_path; EXPR and BINFO are as in that function.
495 Perform a derived-to-base conversion by recursively building up a
496 sequence of COMPONENT_REFs to the appropriate base fields. */
499 build_simple_base_path (tree expr
, tree binfo
)
501 tree type
= BINFO_TYPE (binfo
);
502 tree d_binfo
= BINFO_INHERITANCE_CHAIN (binfo
);
505 if (d_binfo
== NULL_TREE
)
509 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (expr
)) == type
);
511 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x'
512 into `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only
513 an lvalue in the front end; only _DECLs and _REFs are lvalues
515 temp
= unary_complex_lvalue (ADDR_EXPR
, expr
);
517 expr
= cp_build_indirect_ref (temp
, RO_NULL
, tf_warning_or_error
);
523 expr
= build_simple_base_path (expr
, d_binfo
);
525 for (field
= TYPE_FIELDS (BINFO_TYPE (d_binfo
));
526 field
; field
= DECL_CHAIN (field
))
527 /* Is this the base field created by build_base_field? */
528 if (TREE_CODE (field
) == FIELD_DECL
529 && DECL_FIELD_IS_BASE (field
)
530 && TREE_TYPE (field
) == type
531 /* If we're looking for a field in the most-derived class,
532 also check the field offset; we can have two base fields
533 of the same type if one is an indirect virtual base and one
534 is a direct non-virtual base. */
535 && (BINFO_INHERITANCE_CHAIN (d_binfo
)
536 || tree_int_cst_equal (byte_position (field
),
537 BINFO_OFFSET (binfo
))))
539 /* We don't use build_class_member_access_expr here, as that
540 has unnecessary checks, and more importantly results in
541 recursive calls to dfs_walk_once. */
542 int type_quals
= cp_type_quals (TREE_TYPE (expr
));
544 expr
= build3 (COMPONENT_REF
,
545 cp_build_qualified_type (type
, type_quals
),
546 expr
, field
, NULL_TREE
);
547 expr
= fold_if_not_in_template (expr
);
549 /* Mark the expression const or volatile, as appropriate.
550 Even though we've dealt with the type above, we still have
551 to mark the expression itself. */
552 if (type_quals
& TYPE_QUAL_CONST
)
553 TREE_READONLY (expr
) = 1;
554 if (type_quals
& TYPE_QUAL_VOLATILE
)
555 TREE_THIS_VOLATILE (expr
) = 1;
560 /* Didn't find the base field?!? */
564 /* Convert OBJECT to the base TYPE. OBJECT is an expression whose
565 type is a class type or a pointer to a class type. In the former
566 case, TYPE is also a class type; in the latter it is another
567 pointer type. If CHECK_ACCESS is true, an error message is emitted
568 if TYPE is inaccessible. If OBJECT has pointer type, the value is
569 assumed to be non-NULL. */
572 convert_to_base (tree object
, tree type
, bool check_access
, bool nonnull
,
573 tsubst_flags_t complain
)
578 if (TYPE_PTR_P (TREE_TYPE (object
)))
580 object_type
= TREE_TYPE (TREE_TYPE (object
));
581 type
= TREE_TYPE (type
);
584 object_type
= TREE_TYPE (object
);
586 binfo
= lookup_base (object_type
, type
, check_access
? ba_check
: ba_unique
,
588 if (!binfo
|| binfo
== error_mark_node
)
589 return error_mark_node
;
591 return build_base_path (PLUS_EXPR
, object
, binfo
, nonnull
, complain
);
594 /* EXPR is an expression with unqualified class type. BASE is a base
595 binfo of that class type. Returns EXPR, converted to the BASE
596 type. This function assumes that EXPR is the most derived class;
597 therefore virtual bases can be found at their static offsets. */
600 convert_to_base_statically (tree expr
, tree base
)
604 expr_type
= TREE_TYPE (expr
);
605 if (!SAME_BINFO_TYPE_P (BINFO_TYPE (base
), expr_type
))
607 /* If this is a non-empty base, use a COMPONENT_REF. */
608 if (!is_empty_class (BINFO_TYPE (base
)))
609 return build_simple_base_path (expr
, base
);
611 /* We use fold_build2 and fold_convert below to simplify the trees
612 provided to the optimizers. It is not safe to call these functions
613 when processing a template because they do not handle C++-specific
615 gcc_assert (!processing_template_decl
);
616 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
617 if (!integer_zerop (BINFO_OFFSET (base
)))
618 expr
= fold_build_pointer_plus_loc (input_location
,
619 expr
, BINFO_OFFSET (base
));
620 expr
= fold_convert (build_pointer_type (BINFO_TYPE (base
)), expr
);
621 expr
= build_fold_indirect_ref_loc (input_location
, expr
);
629 build_vfield_ref (tree datum
, tree type
)
631 tree vfield
, vcontext
;
633 if (datum
== error_mark_node
634 /* Can happen in case of duplicate base types (c++/59082). */
635 || !TYPE_VFIELD (type
))
636 return error_mark_node
;
638 /* First, convert to the requested type. */
639 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (datum
), type
))
640 datum
= convert_to_base (datum
, type
, /*check_access=*/false,
641 /*nonnull=*/true, tf_warning_or_error
);
643 /* Second, the requested type may not be the owner of its own vptr.
644 If not, convert to the base class that owns it. We cannot use
645 convert_to_base here, because VCONTEXT may appear more than once
646 in the inheritance hierarchy of TYPE, and thus direct conversion
647 between the types may be ambiguous. Following the path back up
648 one step at a time via primary bases avoids the problem. */
649 vfield
= TYPE_VFIELD (type
);
650 vcontext
= DECL_CONTEXT (vfield
);
651 while (!same_type_ignoring_top_level_qualifiers_p (vcontext
, type
))
653 datum
= build_simple_base_path (datum
, CLASSTYPE_PRIMARY_BINFO (type
));
654 type
= TREE_TYPE (datum
);
657 return build3 (COMPONENT_REF
, TREE_TYPE (vfield
), datum
, vfield
, NULL_TREE
);
660 /* Given an object INSTANCE, return an expression which yields the
661 vtable element corresponding to INDEX. There are many special
662 cases for INSTANCE which we take care of here, mainly to avoid
663 creating extra tree nodes when we don't have to. */
666 build_vtbl_ref_1 (tree instance
, tree idx
)
669 tree vtbl
= NULL_TREE
;
671 /* Try to figure out what a reference refers to, and
672 access its virtual function table directly. */
675 tree fixed_type
= fixed_type_or_null (instance
, NULL
, &cdtorp
);
677 tree basetype
= non_reference (TREE_TYPE (instance
));
679 if (fixed_type
&& !cdtorp
)
681 tree binfo
= lookup_base (fixed_type
, basetype
,
682 ba_unique
, NULL
, tf_none
);
683 if (binfo
&& binfo
!= error_mark_node
)
684 vtbl
= unshare_expr (BINFO_VTABLE (binfo
));
688 vtbl
= build_vfield_ref (instance
, basetype
);
690 aref
= build_array_ref (input_location
, vtbl
, idx
);
691 TREE_CONSTANT (aref
) |= TREE_CONSTANT (vtbl
) && TREE_CONSTANT (idx
);
697 build_vtbl_ref (tree instance
, tree idx
)
699 tree aref
= build_vtbl_ref_1 (instance
, idx
);
704 /* Given a stable object pointer INSTANCE_PTR, return an expression which
705 yields a function pointer corresponding to vtable element INDEX. */
708 build_vfn_ref (tree instance_ptr
, tree idx
)
712 aref
= build_vtbl_ref_1 (cp_build_indirect_ref (instance_ptr
, RO_NULL
,
713 tf_warning_or_error
),
716 /* When using function descriptors, the address of the
717 vtable entry is treated as a function pointer. */
718 if (TARGET_VTABLE_USES_DESCRIPTORS
)
719 aref
= build1 (NOP_EXPR
, TREE_TYPE (aref
),
720 cp_build_addr_expr (aref
, tf_warning_or_error
));
722 /* Remember this as a method reference, for later devirtualization. */
723 aref
= build3 (OBJ_TYPE_REF
, TREE_TYPE (aref
), aref
, instance_ptr
, idx
);
728 /* Return the name of the virtual function table (as an IDENTIFIER_NODE)
729 for the given TYPE. */
732 get_vtable_name (tree type
)
734 return mangle_vtbl_for_type (type
);
737 /* DECL is an entity associated with TYPE, like a virtual table or an
738 implicitly generated constructor. Determine whether or not DECL
739 should have external or internal linkage at the object file
740 level. This routine does not deal with COMDAT linkage and other
741 similar complexities; it simply sets TREE_PUBLIC if it possible for
742 entities in other translation units to contain copies of DECL, in
746 set_linkage_according_to_type (tree
/*type*/, tree decl
)
748 TREE_PUBLIC (decl
) = 1;
749 determine_visibility (decl
);
752 /* Create a VAR_DECL for a primary or secondary vtable for CLASS_TYPE.
753 (For a secondary vtable for B-in-D, CLASS_TYPE should be D, not B.)
754 Use NAME for the name of the vtable, and VTABLE_TYPE for its type. */
757 build_vtable (tree class_type
, tree name
, tree vtable_type
)
761 decl
= build_lang_decl (VAR_DECL
, name
, vtable_type
);
762 /* vtable names are already mangled; give them their DECL_ASSEMBLER_NAME
763 now to avoid confusion in mangle_decl. */
764 SET_DECL_ASSEMBLER_NAME (decl
, name
);
765 DECL_CONTEXT (decl
) = class_type
;
766 DECL_ARTIFICIAL (decl
) = 1;
767 TREE_STATIC (decl
) = 1;
768 TREE_READONLY (decl
) = 1;
769 DECL_VIRTUAL_P (decl
) = 1;
770 DECL_ALIGN (decl
) = TARGET_VTABLE_ENTRY_ALIGN
;
771 DECL_USER_ALIGN (decl
) = true;
772 DECL_VTABLE_OR_VTT_P (decl
) = 1;
773 set_linkage_according_to_type (class_type
, decl
);
774 /* The vtable has not been defined -- yet. */
775 DECL_EXTERNAL (decl
) = 1;
776 DECL_NOT_REALLY_EXTERN (decl
) = 1;
778 /* Mark the VAR_DECL node representing the vtable itself as a
779 "gratuitous" one, thereby forcing dwarfout.c to ignore it. It
780 is rather important that such things be ignored because any
781 effort to actually generate DWARF for them will run into
782 trouble when/if we encounter code like:
785 struct S { virtual void member (); };
787 because the artificial declaration of the vtable itself (as
788 manufactured by the g++ front end) will say that the vtable is
789 a static member of `S' but only *after* the debug output for
790 the definition of `S' has already been output. This causes
791 grief because the DWARF entry for the definition of the vtable
792 will try to refer back to an earlier *declaration* of the
793 vtable as a static member of `S' and there won't be one. We
794 might be able to arrange to have the "vtable static member"
795 attached to the member list for `S' before the debug info for
796 `S' get written (which would solve the problem) but that would
797 require more intrusive changes to the g++ front end. */
798 DECL_IGNORED_P (decl
) = 1;
803 /* Get the VAR_DECL of the vtable for TYPE. TYPE need not be polymorphic,
804 or even complete. If this does not exist, create it. If COMPLETE is
805 nonzero, then complete the definition of it -- that will render it
806 impossible to actually build the vtable, but is useful to get at those
807 which are known to exist in the runtime. */
810 get_vtable_decl (tree type
, int complete
)
814 if (CLASSTYPE_VTABLES (type
))
815 return CLASSTYPE_VTABLES (type
);
817 decl
= build_vtable (type
, get_vtable_name (type
), vtbl_type_node
);
818 CLASSTYPE_VTABLES (type
) = decl
;
822 DECL_EXTERNAL (decl
) = 1;
823 cp_finish_decl (decl
, NULL_TREE
, false, NULL_TREE
, 0);
829 /* Build the primary virtual function table for TYPE. If BINFO is
830 non-NULL, build the vtable starting with the initial approximation
831 that it is the same as the one which is the head of the association
832 list. Returns a nonzero value if a new vtable is actually
836 build_primary_vtable (tree binfo
, tree type
)
841 decl
= get_vtable_decl (type
, /*complete=*/0);
845 if (BINFO_NEW_VTABLE_MARKED (binfo
))
846 /* We have already created a vtable for this base, so there's
847 no need to do it again. */
850 virtuals
= copy_list (BINFO_VIRTUALS (binfo
));
851 TREE_TYPE (decl
) = TREE_TYPE (get_vtbl_decl_for_binfo (binfo
));
852 DECL_SIZE (decl
) = TYPE_SIZE (TREE_TYPE (decl
));
853 DECL_SIZE_UNIT (decl
) = TYPE_SIZE_UNIT (TREE_TYPE (decl
));
857 gcc_assert (TREE_TYPE (decl
) == vtbl_type_node
);
858 virtuals
= NULL_TREE
;
861 if (GATHER_STATISTICS
)
864 n_vtable_elems
+= list_length (virtuals
);
867 /* Initialize the association list for this type, based
868 on our first approximation. */
869 BINFO_VTABLE (TYPE_BINFO (type
)) = decl
;
870 BINFO_VIRTUALS (TYPE_BINFO (type
)) = virtuals
;
871 SET_BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (type
));
875 /* Give BINFO a new virtual function table which is initialized
876 with a skeleton-copy of its original initialization. The only
877 entry that changes is the `delta' entry, so we can really
878 share a lot of structure.
880 FOR_TYPE is the most derived type which caused this table to
883 Returns nonzero if we haven't met BINFO before.
885 The order in which vtables are built (by calling this function) for
886 an object must remain the same, otherwise a binary incompatibility
890 build_secondary_vtable (tree binfo
)
892 if (BINFO_NEW_VTABLE_MARKED (binfo
))
893 /* We already created a vtable for this base. There's no need to
897 /* Remember that we've created a vtable for this BINFO, so that we
898 don't try to do so again. */
899 SET_BINFO_NEW_VTABLE_MARKED (binfo
);
901 /* Make fresh virtual list, so we can smash it later. */
902 BINFO_VIRTUALS (binfo
) = copy_list (BINFO_VIRTUALS (binfo
));
904 /* Secondary vtables are laid out as part of the same structure as
905 the primary vtable. */
906 BINFO_VTABLE (binfo
) = NULL_TREE
;
910 /* Create a new vtable for BINFO which is the hierarchy dominated by
911 T. Return nonzero if we actually created a new vtable. */
914 make_new_vtable (tree t
, tree binfo
)
916 if (binfo
== TYPE_BINFO (t
))
917 /* In this case, it is *type*'s vtable we are modifying. We start
918 with the approximation that its vtable is that of the
919 immediate base class. */
920 return build_primary_vtable (binfo
, t
);
922 /* This is our very own copy of `basetype' to play with. Later,
923 we will fill in all the virtual functions that override the
924 virtual functions in these base classes which are not defined
925 by the current type. */
926 return build_secondary_vtable (binfo
);
929 /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO
930 (which is in the hierarchy dominated by T) list FNDECL as its
931 BV_FN. DELTA is the required constant adjustment from the `this'
932 pointer where the vtable entry appears to the `this' required when
933 the function is actually called. */
936 modify_vtable_entry (tree t
,
946 if (fndecl
!= BV_FN (v
)
947 || !tree_int_cst_equal (delta
, BV_DELTA (v
)))
949 /* We need a new vtable for BINFO. */
950 if (make_new_vtable (t
, binfo
))
952 /* If we really did make a new vtable, we also made a copy
953 of the BINFO_VIRTUALS list. Now, we have to find the
954 corresponding entry in that list. */
955 *virtuals
= BINFO_VIRTUALS (binfo
);
956 while (BV_FN (*virtuals
) != BV_FN (v
))
957 *virtuals
= TREE_CHAIN (*virtuals
);
961 BV_DELTA (v
) = delta
;
962 BV_VCALL_INDEX (v
) = NULL_TREE
;
968 /* Add method METHOD to class TYPE. If USING_DECL is non-null, it is
969 the USING_DECL naming METHOD. Returns true if the method could be
970 added to the method vec. */
973 add_method (tree type
, tree method
, tree using_decl
)
977 bool template_conv_p
= false;
979 vec
<tree
, va_gc
> *method_vec
;
981 bool insert_p
= false;
985 if (method
== error_mark_node
)
988 complete_p
= COMPLETE_TYPE_P (type
);
989 conv_p
= DECL_CONV_FN_P (method
);
991 template_conv_p
= (TREE_CODE (method
) == TEMPLATE_DECL
992 && DECL_TEMPLATE_CONV_FN_P (method
));
994 method_vec
= CLASSTYPE_METHOD_VEC (type
);
997 /* Make a new method vector. We start with 8 entries. We must
998 allocate at least two (for constructors and destructors), and
999 we're going to end up with an assignment operator at some
1001 vec_alloc (method_vec
, 8);
1002 /* Create slots for constructors and destructors. */
1003 method_vec
->quick_push (NULL_TREE
);
1004 method_vec
->quick_push (NULL_TREE
);
1005 CLASSTYPE_METHOD_VEC (type
) = method_vec
;
1008 /* Maintain TYPE_HAS_USER_CONSTRUCTOR, etc. */
1009 grok_special_member_properties (method
);
1011 /* Constructors and destructors go in special slots. */
1012 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (method
))
1013 slot
= CLASSTYPE_CONSTRUCTOR_SLOT
;
1014 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method
))
1016 slot
= CLASSTYPE_DESTRUCTOR_SLOT
;
1018 if (TYPE_FOR_JAVA (type
))
1020 if (!DECL_ARTIFICIAL (method
))
1021 error ("Java class %qT cannot have a destructor", type
);
1022 else if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
1023 error ("Java class %qT cannot have an implicit non-trivial "
1033 /* See if we already have an entry with this name. */
1034 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
1035 vec_safe_iterate (method_vec
, slot
, &m
);
1038 m
= OVL_CURRENT (m
);
1039 if (template_conv_p
)
1041 if (TREE_CODE (m
) == TEMPLATE_DECL
1042 && DECL_TEMPLATE_CONV_FN_P (m
))
1046 if (conv_p
&& !DECL_CONV_FN_P (m
))
1048 if (DECL_NAME (m
) == DECL_NAME (method
))
1054 && !DECL_CONV_FN_P (m
)
1055 && DECL_NAME (m
) > DECL_NAME (method
))
1059 current_fns
= insert_p
? NULL_TREE
: (*method_vec
)[slot
];
1061 /* Check to see if we've already got this method. */
1062 for (fns
= current_fns
; fns
; fns
= OVL_NEXT (fns
))
1064 tree fn
= OVL_CURRENT (fns
);
1070 if (TREE_CODE (fn
) != TREE_CODE (method
))
1073 /* [over.load] Member function declarations with the
1074 same name and the same parameter types cannot be
1075 overloaded if any of them is a static member
1076 function declaration.
1078 [over.load] Member function declarations with the same name and
1079 the same parameter-type-list as well as member function template
1080 declarations with the same name, the same parameter-type-list, and
1081 the same template parameter lists cannot be overloaded if any of
1082 them, but not all, have a ref-qualifier.
1084 [namespace.udecl] When a using-declaration brings names
1085 from a base class into a derived class scope, member
1086 functions in the derived class override and/or hide member
1087 functions with the same name and parameter types in a base
1088 class (rather than conflicting). */
1089 fn_type
= TREE_TYPE (fn
);
1090 method_type
= TREE_TYPE (method
);
1091 parms1
= TYPE_ARG_TYPES (fn_type
);
1092 parms2
= TYPE_ARG_TYPES (method_type
);
1094 /* Compare the quals on the 'this' parm. Don't compare
1095 the whole types, as used functions are treated as
1096 coming from the using class in overload resolution. */
1097 if (! DECL_STATIC_FUNCTION_P (fn
)
1098 && ! DECL_STATIC_FUNCTION_P (method
)
1099 /* Either both or neither need to be ref-qualified for
1100 differing quals to allow overloading. */
1101 && (FUNCTION_REF_QUALIFIED (fn_type
)
1102 == FUNCTION_REF_QUALIFIED (method_type
))
1103 && (type_memfn_quals (fn_type
) != type_memfn_quals (method_type
)
1104 || type_memfn_rqual (fn_type
) != type_memfn_rqual (method_type
)))
1107 /* For templates, the return type and template parameters
1108 must be identical. */
1109 if (TREE_CODE (fn
) == TEMPLATE_DECL
1110 && (!same_type_p (TREE_TYPE (fn_type
),
1111 TREE_TYPE (method_type
))
1112 || !comp_template_parms (DECL_TEMPLATE_PARMS (fn
),
1113 DECL_TEMPLATE_PARMS (method
))))
1116 if (! DECL_STATIC_FUNCTION_P (fn
))
1117 parms1
= TREE_CHAIN (parms1
);
1118 if (! DECL_STATIC_FUNCTION_P (method
))
1119 parms2
= TREE_CHAIN (parms2
);
1121 if (compparms (parms1
, parms2
)
1122 && (!DECL_CONV_FN_P (fn
)
1123 || same_type_p (TREE_TYPE (fn_type
),
1124 TREE_TYPE (method_type
))))
1126 /* For function versions, their parms and types match
1127 but they are not duplicates. Record function versions
1128 as and when they are found. extern "C" functions are
1129 not treated as versions. */
1130 if (TREE_CODE (fn
) == FUNCTION_DECL
1131 && TREE_CODE (method
) == FUNCTION_DECL
1132 && !DECL_EXTERN_C_P (fn
)
1133 && !DECL_EXTERN_C_P (method
)
1134 && targetm
.target_option
.function_versions (fn
, method
))
1136 /* Mark functions as versions if necessary. Modify the mangled
1137 decl name if necessary. */
1138 if (!DECL_FUNCTION_VERSIONED (fn
))
1140 DECL_FUNCTION_VERSIONED (fn
) = 1;
1141 if (DECL_ASSEMBLER_NAME_SET_P (fn
))
1144 if (!DECL_FUNCTION_VERSIONED (method
))
1146 DECL_FUNCTION_VERSIONED (method
) = 1;
1147 if (DECL_ASSEMBLER_NAME_SET_P (method
))
1148 mangle_decl (method
);
1150 record_function_versions (fn
, method
);
1153 if (DECL_INHERITED_CTOR_BASE (method
))
1155 if (DECL_INHERITED_CTOR_BASE (fn
))
1157 error_at (DECL_SOURCE_LOCATION (method
),
1158 "%q#D inherited from %qT", method
,
1159 DECL_INHERITED_CTOR_BASE (method
));
1160 error_at (DECL_SOURCE_LOCATION (fn
),
1161 "conflicts with version inherited from %qT",
1162 DECL_INHERITED_CTOR_BASE (fn
));
1164 /* Otherwise defer to the other function. */
1169 if (DECL_CONTEXT (fn
) == type
)
1170 /* Defer to the local function. */
1175 error ("%q+#D cannot be overloaded", method
);
1176 error ("with %q+#D", fn
);
1179 /* We don't call duplicate_decls here to merge the
1180 declarations because that will confuse things if the
1181 methods have inline definitions. In particular, we
1182 will crash while processing the definitions. */
1187 /* A class should never have more than one destructor. */
1188 if (current_fns
&& DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method
))
1191 /* Add the new binding. */
1194 overload
= ovl_cons (method
, current_fns
);
1195 OVL_USED (overload
) = true;
1198 overload
= build_overload (method
, current_fns
);
1201 TYPE_HAS_CONVERSION (type
) = 1;
1202 else if (slot
>= CLASSTYPE_FIRST_CONVERSION_SLOT
&& !complete_p
)
1203 push_class_level_binding (DECL_NAME (method
), overload
);
1209 /* We only expect to add few methods in the COMPLETE_P case, so
1210 just make room for one more method in that case. */
1212 reallocated
= vec_safe_reserve_exact (method_vec
, 1);
1214 reallocated
= vec_safe_reserve (method_vec
, 1);
1216 CLASSTYPE_METHOD_VEC (type
) = method_vec
;
1217 if (slot
== method_vec
->length ())
1218 method_vec
->quick_push (overload
);
1220 method_vec
->quick_insert (slot
, overload
);
1223 /* Replace the current slot. */
1224 (*method_vec
)[slot
] = overload
;
1228 /* Subroutines of finish_struct. */
1230 /* Change the access of FDECL to ACCESS in T. Return 1 if change was
1231 legit, otherwise return 0. */
1234 alter_access (tree t
, tree fdecl
, tree access
)
1238 if (!DECL_LANG_SPECIFIC (fdecl
))
1239 retrofit_lang_decl (fdecl
);
1241 gcc_assert (!DECL_DISCRIMINATOR_P (fdecl
));
1243 elem
= purpose_member (t
, DECL_ACCESS (fdecl
));
1246 if (TREE_VALUE (elem
) != access
)
1248 if (TREE_CODE (TREE_TYPE (fdecl
)) == FUNCTION_DECL
)
1249 error ("conflicting access specifications for method"
1250 " %q+D, ignored", TREE_TYPE (fdecl
));
1252 error ("conflicting access specifications for field %qE, ignored",
1257 /* They're changing the access to the same thing they changed
1258 it to before. That's OK. */
1264 perform_or_defer_access_check (TYPE_BINFO (t
), fdecl
, fdecl
,
1265 tf_warning_or_error
);
1266 DECL_ACCESS (fdecl
) = tree_cons (t
, access
, DECL_ACCESS (fdecl
));
1272 /* Process the USING_DECL, which is a member of T. */
1275 handle_using_decl (tree using_decl
, tree t
)
1277 tree decl
= USING_DECL_DECLS (using_decl
);
1278 tree name
= DECL_NAME (using_decl
);
1280 = TREE_PRIVATE (using_decl
) ? access_private_node
1281 : TREE_PROTECTED (using_decl
) ? access_protected_node
1282 : access_public_node
;
1283 tree flist
= NULL_TREE
;
1286 gcc_assert (!processing_template_decl
&& decl
);
1288 old_value
= lookup_member (t
, name
, /*protect=*/0, /*want_type=*/false,
1289 tf_warning_or_error
);
1292 if (is_overloaded_fn (old_value
))
1293 old_value
= OVL_CURRENT (old_value
);
1295 if (DECL_P (old_value
) && DECL_CONTEXT (old_value
) == t
)
1298 old_value
= NULL_TREE
;
1301 cp_emit_debug_info_for_using (decl
, t
);
1303 if (is_overloaded_fn (decl
))
1308 else if (is_overloaded_fn (old_value
))
1311 /* It's OK to use functions from a base when there are functions with
1312 the same name already present in the current class. */;
1315 error ("%q+D invalid in %q#T", using_decl
, t
);
1316 error (" because of local method %q+#D with same name",
1317 OVL_CURRENT (old_value
));
1321 else if (!DECL_ARTIFICIAL (old_value
))
1323 error ("%q+D invalid in %q#T", using_decl
, t
);
1324 error (" because of local member %q+#D with same name", old_value
);
1328 /* Make type T see field decl FDECL with access ACCESS. */
1330 for (; flist
; flist
= OVL_NEXT (flist
))
1332 add_method (t
, OVL_CURRENT (flist
), using_decl
);
1333 alter_access (t
, OVL_CURRENT (flist
), access
);
1336 alter_access (t
, decl
, access
);
1339 /* walk_tree callback for check_abi_tags: if the type at *TP involves any
1340 types with abi tags, add the corresponding identifiers to the VEC in
1341 *DATA and set IDENTIFIER_MARKED. */
1347 // error_mark_node to get diagnostics; otherwise collect missing tags here
1352 find_abi_tags_r (tree
*tp
, int *walk_subtrees
, void *data
)
1354 if (!OVERLOAD_TYPE_P (*tp
))
1357 /* walk_tree shouldn't be walking into any subtrees of a RECORD_TYPE
1358 anyway, but let's make sure of it. */
1359 *walk_subtrees
= false;
1361 if (tree attributes
= lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (*tp
)))
1363 struct abi_tag_data
*p
= static_cast<struct abi_tag_data
*>(data
);
1364 for (tree list
= TREE_VALUE (attributes
); list
;
1365 list
= TREE_CHAIN (list
))
1367 tree tag
= TREE_VALUE (list
);
1368 tree id
= get_identifier (TREE_STRING_POINTER (tag
));
1369 if (!IDENTIFIER_MARKED (id
))
1371 if (p
->tags
!= error_mark_node
)
1373 /* We're collecting tags from template arguments. */
1374 tree str
= build_string (IDENTIFIER_LENGTH (id
),
1375 IDENTIFIER_POINTER (id
));
1376 p
->tags
= tree_cons (NULL_TREE
, str
, p
->tags
);
1377 ABI_TAG_IMPLICIT (p
->tags
) = true;
1379 /* Don't inherit this tag multiple times. */
1380 IDENTIFIER_MARKED (id
) = true;
1383 /* Otherwise we're diagnosing missing tags. */
1384 else if (TYPE_P (p
->subob
))
1386 if (warning (OPT_Wabi_tag
, "%qT does not have the %E abi tag "
1387 "that base %qT has", p
->t
, tag
, p
->subob
))
1388 inform (location_of (p
->subob
), "%qT declared here",
1393 if (warning (OPT_Wabi_tag
, "%qT does not have the %E abi tag "
1394 "that %qT (used in the type of %qD) has",
1395 p
->t
, tag
, *tp
, p
->subob
))
1397 inform (location_of (p
->subob
), "%qD declared here",
1399 inform (location_of (*tp
), "%qT declared here", *tp
);
1408 /* Set IDENTIFIER_MARKED on all the ABI tags on T and its (transitively
1409 complete) template arguments. */
1412 mark_type_abi_tags (tree t
, bool val
)
1414 tree attributes
= lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (t
));
1417 for (tree list
= TREE_VALUE (attributes
); list
;
1418 list
= TREE_CHAIN (list
))
1420 tree tag
= TREE_VALUE (list
);
1421 tree id
= get_identifier (TREE_STRING_POINTER (tag
));
1422 IDENTIFIER_MARKED (id
) = val
;
1427 /* Check that class T has all the abi tags that subobject SUBOB has, or
1431 check_abi_tags (tree t
, tree subob
)
1433 mark_type_abi_tags (t
, true);
1435 tree subtype
= TYPE_P (subob
) ? subob
: TREE_TYPE (subob
);
1436 struct abi_tag_data data
= { t
, subob
, error_mark_node
};
1438 cp_walk_tree_without_duplicates (&subtype
, find_abi_tags_r
, &data
);
1440 mark_type_abi_tags (t
, false);
1444 inherit_targ_abi_tags (tree t
)
1446 if (CLASSTYPE_TEMPLATE_INFO (t
) == NULL_TREE
)
1449 mark_type_abi_tags (t
, true);
1451 tree args
= CLASSTYPE_TI_ARGS (t
);
1452 struct abi_tag_data data
= { t
, NULL_TREE
, NULL_TREE
};
1453 for (int i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
1455 tree level
= TMPL_ARGS_LEVEL (args
, i
+1);
1456 for (int j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
1458 tree arg
= TREE_VEC_ELT (level
, j
);
1460 cp_walk_tree_without_duplicates (&arg
, find_abi_tags_r
, &data
);
1464 // If we found some tags on our template arguments, add them to our
1465 // abi_tag attribute.
1468 tree attr
= lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (t
));
1470 TREE_VALUE (attr
) = chainon (data
.tags
, TREE_VALUE (attr
));
1473 = tree_cons (get_identifier ("abi_tag"), data
.tags
,
1474 TYPE_ATTRIBUTES (t
));
1477 mark_type_abi_tags (t
, false);
1480 /* Return true, iff class T has a non-virtual destructor that is
1481 accessible from outside the class heirarchy (i.e. is public, or
1482 there's a suitable friend. */
1485 accessible_nvdtor_p (tree t
)
1487 tree dtor
= CLASSTYPE_DESTRUCTORS (t
);
1489 /* An implicitly declared destructor is always public. And,
1490 if it were virtual, we would have created it by now. */
1494 if (DECL_VINDEX (dtor
))
1495 return false; /* Virtual */
1497 if (!TREE_PRIVATE (dtor
) && !TREE_PROTECTED (dtor
))
1498 return true; /* Public */
1500 if (CLASSTYPE_FRIEND_CLASSES (t
)
1501 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t
)))
1502 return true; /* Has friends */
1507 /* Run through the base classes of T, updating CANT_HAVE_CONST_CTOR_P,
1508 and NO_CONST_ASN_REF_P. Also set flag bits in T based on
1509 properties of the bases. */
1512 check_bases (tree t
,
1513 int* cant_have_const_ctor_p
,
1514 int* no_const_asn_ref_p
)
1517 bool seen_non_virtual_nearly_empty_base_p
= 0;
1518 int seen_tm_mask
= 0;
1521 tree field
= NULL_TREE
;
1523 if (!CLASSTYPE_NON_STD_LAYOUT (t
))
1524 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
1525 if (TREE_CODE (field
) == FIELD_DECL
)
1528 for (binfo
= TYPE_BINFO (t
), i
= 0;
1529 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
1531 tree basetype
= TREE_TYPE (base_binfo
);
1533 gcc_assert (COMPLETE_TYPE_P (basetype
));
1535 if (CLASSTYPE_FINAL (basetype
))
1536 error ("cannot derive from %<final%> base %qT in derived type %qT",
1539 /* If any base class is non-literal, so is the derived class. */
1540 if (!CLASSTYPE_LITERAL_P (basetype
))
1541 CLASSTYPE_LITERAL_P (t
) = false;
1543 /* If the base class doesn't have copy constructors or
1544 assignment operators that take const references, then the
1545 derived class cannot have such a member automatically
1547 if (TYPE_HAS_COPY_CTOR (basetype
)
1548 && ! TYPE_HAS_CONST_COPY_CTOR (basetype
))
1549 *cant_have_const_ctor_p
= 1;
1550 if (TYPE_HAS_COPY_ASSIGN (basetype
)
1551 && !TYPE_HAS_CONST_COPY_ASSIGN (basetype
))
1552 *no_const_asn_ref_p
= 1;
1554 if (BINFO_VIRTUAL_P (base_binfo
))
1555 /* A virtual base does not effect nearly emptiness. */
1557 else if (CLASSTYPE_NEARLY_EMPTY_P (basetype
))
1559 if (seen_non_virtual_nearly_empty_base_p
)
1560 /* And if there is more than one nearly empty base, then the
1561 derived class is not nearly empty either. */
1562 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
1564 /* Remember we've seen one. */
1565 seen_non_virtual_nearly_empty_base_p
= 1;
1567 else if (!is_empty_class (basetype
))
1568 /* If the base class is not empty or nearly empty, then this
1569 class cannot be nearly empty. */
1570 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
1572 /* A lot of properties from the bases also apply to the derived
1574 TYPE_NEEDS_CONSTRUCTING (t
) |= TYPE_NEEDS_CONSTRUCTING (basetype
);
1575 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
1576 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (basetype
);
1577 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
)
1578 |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (basetype
)
1579 || !TYPE_HAS_COPY_ASSIGN (basetype
));
1580 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= (TYPE_HAS_COMPLEX_COPY_CTOR (basetype
)
1581 || !TYPE_HAS_COPY_CTOR (basetype
));
1582 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
)
1583 |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (basetype
);
1584 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_HAS_COMPLEX_MOVE_CTOR (basetype
);
1585 TYPE_POLYMORPHIC_P (t
) |= TYPE_POLYMORPHIC_P (basetype
);
1586 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
)
1587 |= CLASSTYPE_CONTAINS_EMPTY_CLASS_P (basetype
);
1588 TYPE_HAS_COMPLEX_DFLT (t
) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
1589 || TYPE_HAS_COMPLEX_DFLT (basetype
));
1590 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT
1591 (t
, CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
)
1592 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (basetype
));
1593 SET_CLASSTYPE_REF_FIELDS_NEED_INIT
1594 (t
, CLASSTYPE_REF_FIELDS_NEED_INIT (t
)
1595 | CLASSTYPE_REF_FIELDS_NEED_INIT (basetype
));
1597 /* A standard-layout class is a class that:
1599 * has no non-standard-layout base classes, */
1600 CLASSTYPE_NON_STD_LAYOUT (t
) |= CLASSTYPE_NON_STD_LAYOUT (basetype
);
1601 if (!CLASSTYPE_NON_STD_LAYOUT (t
))
1604 /* ...has no base classes of the same type as the first non-static
1606 if (field
&& DECL_CONTEXT (field
) == t
1607 && (same_type_ignoring_top_level_qualifiers_p
1608 (TREE_TYPE (field
), basetype
)))
1609 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
1611 /* ...either has no non-static data members in the most-derived
1612 class and at most one base class with non-static data
1613 members, or has no base classes with non-static data
1615 for (basefield
= TYPE_FIELDS (basetype
); basefield
;
1616 basefield
= DECL_CHAIN (basefield
))
1617 if (TREE_CODE (basefield
) == FIELD_DECL
)
1620 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
1627 /* Don't bother collecting tm attributes if transactional memory
1628 support is not enabled. */
1631 tree tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (basetype
));
1633 seen_tm_mask
|= tm_attr_to_mask (tm_attr
);
1636 check_abi_tags (t
, basetype
);
1639 /* If one of the base classes had TM attributes, and the current class
1640 doesn't define its own, then the current class inherits one. */
1641 if (seen_tm_mask
&& !find_tm_attribute (TYPE_ATTRIBUTES (t
)))
1643 tree tm_attr
= tm_mask_to_attr (seen_tm_mask
& -seen_tm_mask
);
1644 TYPE_ATTRIBUTES (t
) = tree_cons (tm_attr
, NULL
, TYPE_ATTRIBUTES (t
));
1648 /* Determine all the primary bases within T. Sets BINFO_PRIMARY_BASE_P for
1649 those that are primaries. Sets BINFO_LOST_PRIMARY_P for those
1650 that have had a nearly-empty virtual primary base stolen by some
1651 other base in the hierarchy. Determines CLASSTYPE_PRIMARY_BASE for
1655 determine_primary_bases (tree t
)
1658 tree primary
= NULL_TREE
;
1659 tree type_binfo
= TYPE_BINFO (t
);
1662 /* Determine the primary bases of our bases. */
1663 for (base_binfo
= TREE_CHAIN (type_binfo
); base_binfo
;
1664 base_binfo
= TREE_CHAIN (base_binfo
))
1666 tree primary
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (base_binfo
));
1668 /* See if we're the non-virtual primary of our inheritance
1670 if (!BINFO_VIRTUAL_P (base_binfo
))
1672 tree parent
= BINFO_INHERITANCE_CHAIN (base_binfo
);
1673 tree parent_primary
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (parent
));
1676 && SAME_BINFO_TYPE_P (BINFO_TYPE (base_binfo
),
1677 BINFO_TYPE (parent_primary
)))
1678 /* We are the primary binfo. */
1679 BINFO_PRIMARY_P (base_binfo
) = 1;
1681 /* Determine if we have a virtual primary base, and mark it so.
1683 if (primary
&& BINFO_VIRTUAL_P (primary
))
1685 tree this_primary
= copied_binfo (primary
, base_binfo
);
1687 if (BINFO_PRIMARY_P (this_primary
))
1688 /* Someone already claimed this base. */
1689 BINFO_LOST_PRIMARY_P (base_binfo
) = 1;
1694 BINFO_PRIMARY_P (this_primary
) = 1;
1695 BINFO_INHERITANCE_CHAIN (this_primary
) = base_binfo
;
1697 /* A virtual binfo might have been copied from within
1698 another hierarchy. As we're about to use it as a
1699 primary base, make sure the offsets match. */
1700 delta
= size_diffop_loc (input_location
,
1702 BINFO_OFFSET (base_binfo
)),
1704 BINFO_OFFSET (this_primary
)));
1706 propagate_binfo_offsets (this_primary
, delta
);
1711 /* First look for a dynamic direct non-virtual base. */
1712 for (i
= 0; BINFO_BASE_ITERATE (type_binfo
, i
, base_binfo
); i
++)
1714 tree basetype
= BINFO_TYPE (base_binfo
);
1716 if (TYPE_CONTAINS_VPTR_P (basetype
) && !BINFO_VIRTUAL_P (base_binfo
))
1718 primary
= base_binfo
;
1723 /* A "nearly-empty" virtual base class can be the primary base
1724 class, if no non-virtual polymorphic base can be found. Look for
1725 a nearly-empty virtual dynamic base that is not already a primary
1726 base of something in the hierarchy. If there is no such base,
1727 just pick the first nearly-empty virtual base. */
1729 for (base_binfo
= TREE_CHAIN (type_binfo
); base_binfo
;
1730 base_binfo
= TREE_CHAIN (base_binfo
))
1731 if (BINFO_VIRTUAL_P (base_binfo
)
1732 && CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (base_binfo
)))
1734 if (!BINFO_PRIMARY_P (base_binfo
))
1736 /* Found one that is not primary. */
1737 primary
= base_binfo
;
1741 /* Remember the first candidate. */
1742 primary
= base_binfo
;
1746 /* If we've got a primary base, use it. */
1749 tree basetype
= BINFO_TYPE (primary
);
1751 CLASSTYPE_PRIMARY_BINFO (t
) = primary
;
1752 if (BINFO_PRIMARY_P (primary
))
1753 /* We are stealing a primary base. */
1754 BINFO_LOST_PRIMARY_P (BINFO_INHERITANCE_CHAIN (primary
)) = 1;
1755 BINFO_PRIMARY_P (primary
) = 1;
1756 if (BINFO_VIRTUAL_P (primary
))
1760 BINFO_INHERITANCE_CHAIN (primary
) = type_binfo
;
1761 /* A virtual binfo might have been copied from within
1762 another hierarchy. As we're about to use it as a primary
1763 base, make sure the offsets match. */
1764 delta
= size_diffop_loc (input_location
, ssize_int (0),
1765 convert (ssizetype
, BINFO_OFFSET (primary
)));
1767 propagate_binfo_offsets (primary
, delta
);
1770 primary
= TYPE_BINFO (basetype
);
1772 TYPE_VFIELD (t
) = TYPE_VFIELD (basetype
);
1773 BINFO_VTABLE (type_binfo
) = BINFO_VTABLE (primary
);
1774 BINFO_VIRTUALS (type_binfo
) = BINFO_VIRTUALS (primary
);
1778 /* Update the variant types of T. */
1781 fixup_type_variants (tree t
)
1788 for (variants
= TYPE_NEXT_VARIANT (t
);
1790 variants
= TYPE_NEXT_VARIANT (variants
))
1792 /* These fields are in the _TYPE part of the node, not in
1793 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1794 TYPE_HAS_USER_CONSTRUCTOR (variants
) = TYPE_HAS_USER_CONSTRUCTOR (t
);
1795 TYPE_NEEDS_CONSTRUCTING (variants
) = TYPE_NEEDS_CONSTRUCTING (t
);
1796 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (variants
)
1797 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
);
1799 TYPE_POLYMORPHIC_P (variants
) = TYPE_POLYMORPHIC_P (t
);
1801 TYPE_BINFO (variants
) = TYPE_BINFO (t
);
1803 /* Copy whatever these are holding today. */
1804 TYPE_VFIELD (variants
) = TYPE_VFIELD (t
);
1805 TYPE_METHODS (variants
) = TYPE_METHODS (t
);
1806 TYPE_FIELDS (variants
) = TYPE_FIELDS (t
);
1810 /* Early variant fixups: we apply attributes at the beginning of the class
1811 definition, and we need to fix up any variants that have already been
1812 made via elaborated-type-specifier so that check_qualified_type works. */
1815 fixup_attribute_variants (tree t
)
1822 for (variants
= TYPE_NEXT_VARIANT (t
);
1824 variants
= TYPE_NEXT_VARIANT (variants
))
1826 /* These are the two fields that check_qualified_type looks at and
1827 are affected by attributes. */
1828 TYPE_ATTRIBUTES (variants
) = TYPE_ATTRIBUTES (t
);
1829 TYPE_ALIGN (variants
) = TYPE_ALIGN (t
);
1833 /* Set memoizing fields and bits of T (and its variants) for later
1837 finish_struct_bits (tree t
)
1839 /* Fix up variants (if any). */
1840 fixup_type_variants (t
);
1842 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t
)) && TYPE_POLYMORPHIC_P (t
))
1843 /* For a class w/o baseclasses, 'finish_struct' has set
1844 CLASSTYPE_PURE_VIRTUALS correctly (by definition).
1845 Similarly for a class whose base classes do not have vtables.
1846 When neither of these is true, we might have removed abstract
1847 virtuals (by providing a definition), added some (by declaring
1848 new ones), or redeclared ones from a base class. We need to
1849 recalculate what's really an abstract virtual at this point (by
1850 looking in the vtables). */
1851 get_pure_virtuals (t
);
1853 /* If this type has a copy constructor or a destructor, force its
1854 mode to be BLKmode, and force its TREE_ADDRESSABLE bit to be
1855 nonzero. This will cause it to be passed by invisible reference
1856 and prevent it from being returned in a register. */
1857 if (type_has_nontrivial_copy_init (t
)
1858 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
1861 DECL_MODE (TYPE_MAIN_DECL (t
)) = BLKmode
;
1862 for (variants
= t
; variants
; variants
= TYPE_NEXT_VARIANT (variants
))
1864 SET_TYPE_MODE (variants
, BLKmode
);
1865 TREE_ADDRESSABLE (variants
) = 1;
1870 /* Issue warnings about T having private constructors, but no friends,
1873 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
1874 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
1875 non-private static member functions. */
1878 maybe_warn_about_overly_private_class (tree t
)
1880 int has_member_fn
= 0;
1881 int has_nonprivate_method
= 0;
1884 if (!warn_ctor_dtor_privacy
1885 /* If the class has friends, those entities might create and
1886 access instances, so we should not warn. */
1887 || (CLASSTYPE_FRIEND_CLASSES (t
)
1888 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t
)))
1889 /* We will have warned when the template was declared; there's
1890 no need to warn on every instantiation. */
1891 || CLASSTYPE_TEMPLATE_INSTANTIATION (t
))
1892 /* There's no reason to even consider warning about this
1896 /* We only issue one warning, if more than one applies, because
1897 otherwise, on code like:
1900 // Oops - forgot `public:'
1906 we warn several times about essentially the same problem. */
1908 /* Check to see if all (non-constructor, non-destructor) member
1909 functions are private. (Since there are no friends or
1910 non-private statics, we can't ever call any of the private member
1912 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
1913 /* We're not interested in compiler-generated methods; they don't
1914 provide any way to call private members. */
1915 if (!DECL_ARTIFICIAL (fn
))
1917 if (!TREE_PRIVATE (fn
))
1919 if (DECL_STATIC_FUNCTION_P (fn
))
1920 /* A non-private static member function is just like a
1921 friend; it can create and invoke private member
1922 functions, and be accessed without a class
1926 has_nonprivate_method
= 1;
1927 /* Keep searching for a static member function. */
1929 else if (!DECL_CONSTRUCTOR_P (fn
) && !DECL_DESTRUCTOR_P (fn
))
1933 if (!has_nonprivate_method
&& has_member_fn
)
1935 /* There are no non-private methods, and there's at least one
1936 private member function that isn't a constructor or
1937 destructor. (If all the private members are
1938 constructors/destructors we want to use the code below that
1939 issues error messages specifically referring to
1940 constructors/destructors.) */
1942 tree binfo
= TYPE_BINFO (t
);
1944 for (i
= 0; i
!= BINFO_N_BASE_BINFOS (binfo
); i
++)
1945 if (BINFO_BASE_ACCESS (binfo
, i
) != access_private_node
)
1947 has_nonprivate_method
= 1;
1950 if (!has_nonprivate_method
)
1952 warning (OPT_Wctor_dtor_privacy
,
1953 "all member functions in class %qT are private", t
);
1958 /* Even if some of the member functions are non-private, the class
1959 won't be useful for much if all the constructors or destructors
1960 are private: such an object can never be created or destroyed. */
1961 fn
= CLASSTYPE_DESTRUCTORS (t
);
1962 if (fn
&& TREE_PRIVATE (fn
))
1964 warning (OPT_Wctor_dtor_privacy
,
1965 "%q#T only defines a private destructor and has no friends",
1970 /* Warn about classes that have private constructors and no friends. */
1971 if (TYPE_HAS_USER_CONSTRUCTOR (t
)
1972 /* Implicitly generated constructors are always public. */
1973 && (!CLASSTYPE_LAZY_DEFAULT_CTOR (t
)
1974 || !CLASSTYPE_LAZY_COPY_CTOR (t
)))
1976 int nonprivate_ctor
= 0;
1978 /* If a non-template class does not define a copy
1979 constructor, one is defined for it, enabling it to avoid
1980 this warning. For a template class, this does not
1981 happen, and so we would normally get a warning on:
1983 template <class T> class C { private: C(); };
1985 To avoid this asymmetry, we check TYPE_HAS_COPY_CTOR. All
1986 complete non-template or fully instantiated classes have this
1988 if (!TYPE_HAS_COPY_CTOR (t
))
1989 nonprivate_ctor
= 1;
1991 for (fn
= CLASSTYPE_CONSTRUCTORS (t
); fn
; fn
= OVL_NEXT (fn
))
1993 tree ctor
= OVL_CURRENT (fn
);
1994 /* Ideally, we wouldn't count copy constructors (or, in
1995 fact, any constructor that takes an argument of the
1996 class type as a parameter) because such things cannot
1997 be used to construct an instance of the class unless
1998 you already have one. But, for now at least, we're
2000 if (! TREE_PRIVATE (ctor
))
2002 nonprivate_ctor
= 1;
2007 if (nonprivate_ctor
== 0)
2009 warning (OPT_Wctor_dtor_privacy
,
2010 "%q#T only defines private constructors and has no friends",
2018 gt_pointer_operator new_value
;
2022 /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */
2025 method_name_cmp (const void* m1_p
, const void* m2_p
)
2027 const tree
*const m1
= (const tree
*) m1_p
;
2028 const tree
*const m2
= (const tree
*) m2_p
;
2030 if (*m1
== NULL_TREE
&& *m2
== NULL_TREE
)
2032 if (*m1
== NULL_TREE
)
2034 if (*m2
== NULL_TREE
)
2036 if (DECL_NAME (OVL_CURRENT (*m1
)) < DECL_NAME (OVL_CURRENT (*m2
)))
2041 /* This routine compares two fields like method_name_cmp but using the
2042 pointer operator in resort_field_decl_data. */
2045 resort_method_name_cmp (const void* m1_p
, const void* m2_p
)
2047 const tree
*const m1
= (const tree
*) m1_p
;
2048 const tree
*const m2
= (const tree
*) m2_p
;
2049 if (*m1
== NULL_TREE
&& *m2
== NULL_TREE
)
2051 if (*m1
== NULL_TREE
)
2053 if (*m2
== NULL_TREE
)
2056 tree d1
= DECL_NAME (OVL_CURRENT (*m1
));
2057 tree d2
= DECL_NAME (OVL_CURRENT (*m2
));
2058 resort_data
.new_value (&d1
, resort_data
.cookie
);
2059 resort_data
.new_value (&d2
, resort_data
.cookie
);
2066 /* Resort TYPE_METHOD_VEC because pointers have been reordered. */
2069 resort_type_method_vec (void* obj
,
2071 gt_pointer_operator new_value
,
2074 vec
<tree
, va_gc
> *method_vec
= (vec
<tree
, va_gc
> *) obj
;
2075 int len
= vec_safe_length (method_vec
);
2079 /* The type conversion ops have to live at the front of the vec, so we
2081 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2082 vec_safe_iterate (method_vec
, slot
, &fn
);
2084 if (!DECL_CONV_FN_P (OVL_CURRENT (fn
)))
2089 resort_data
.new_value
= new_value
;
2090 resort_data
.cookie
= cookie
;
2091 qsort (method_vec
->address () + slot
, len
- slot
, sizeof (tree
),
2092 resort_method_name_cmp
);
2096 /* Warn about duplicate methods in fn_fields.
2098 Sort methods that are not special (i.e., constructors, destructors,
2099 and type conversion operators) so that we can find them faster in
2103 finish_struct_methods (tree t
)
2106 vec
<tree
, va_gc
> *method_vec
;
2109 method_vec
= CLASSTYPE_METHOD_VEC (t
);
2113 len
= method_vec
->length ();
2115 /* Clear DECL_IN_AGGR_P for all functions. */
2116 for (fn_fields
= TYPE_METHODS (t
); fn_fields
;
2117 fn_fields
= DECL_CHAIN (fn_fields
))
2118 DECL_IN_AGGR_P (fn_fields
) = 0;
2120 /* Issue warnings about private constructors and such. If there are
2121 no methods, then some public defaults are generated. */
2122 maybe_warn_about_overly_private_class (t
);
2124 /* The type conversion ops have to live at the front of the vec, so we
2126 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2127 method_vec
->iterate (slot
, &fn_fields
);
2129 if (!DECL_CONV_FN_P (OVL_CURRENT (fn_fields
)))
2132 qsort (method_vec
->address () + slot
,
2133 len
-slot
, sizeof (tree
), method_name_cmp
);
2136 /* Make BINFO's vtable have N entries, including RTTI entries,
2137 vbase and vcall offsets, etc. Set its type and call the back end
2141 layout_vtable_decl (tree binfo
, int n
)
2146 atype
= build_array_of_n_type (vtable_entry_type
, n
);
2147 layout_type (atype
);
2149 /* We may have to grow the vtable. */
2150 vtable
= get_vtbl_decl_for_binfo (binfo
);
2151 if (!same_type_p (TREE_TYPE (vtable
), atype
))
2153 TREE_TYPE (vtable
) = atype
;
2154 DECL_SIZE (vtable
) = DECL_SIZE_UNIT (vtable
) = NULL_TREE
;
2155 layout_decl (vtable
, 0);
2159 /* True iff FNDECL and BASE_FNDECL (both non-static member functions)
2160 have the same signature. */
2163 same_signature_p (const_tree fndecl
, const_tree base_fndecl
)
2165 /* One destructor overrides another if they are the same kind of
2167 if (DECL_DESTRUCTOR_P (base_fndecl
) && DECL_DESTRUCTOR_P (fndecl
)
2168 && special_function_p (base_fndecl
) == special_function_p (fndecl
))
2170 /* But a non-destructor never overrides a destructor, nor vice
2171 versa, nor do different kinds of destructors override
2172 one-another. For example, a complete object destructor does not
2173 override a deleting destructor. */
2174 if (DECL_DESTRUCTOR_P (base_fndecl
) || DECL_DESTRUCTOR_P (fndecl
))
2177 if (DECL_NAME (fndecl
) == DECL_NAME (base_fndecl
)
2178 || (DECL_CONV_FN_P (fndecl
)
2179 && DECL_CONV_FN_P (base_fndecl
)
2180 && same_type_p (DECL_CONV_FN_TYPE (fndecl
),
2181 DECL_CONV_FN_TYPE (base_fndecl
))))
2183 tree fntype
= TREE_TYPE (fndecl
);
2184 tree base_fntype
= TREE_TYPE (base_fndecl
);
2185 if (type_memfn_quals (fntype
) == type_memfn_quals (base_fntype
)
2186 && type_memfn_rqual (fntype
) == type_memfn_rqual (base_fntype
)
2187 && compparms (FUNCTION_FIRST_USER_PARMTYPE (fndecl
),
2188 FUNCTION_FIRST_USER_PARMTYPE (base_fndecl
)))
2194 /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a
2198 base_derived_from (tree derived
, tree base
)
2202 for (probe
= base
; probe
; probe
= BINFO_INHERITANCE_CHAIN (probe
))
2204 if (probe
== derived
)
2206 else if (BINFO_VIRTUAL_P (probe
))
2207 /* If we meet a virtual base, we can't follow the inheritance
2208 any more. See if the complete type of DERIVED contains
2209 such a virtual base. */
2210 return (binfo_for_vbase (BINFO_TYPE (probe
), BINFO_TYPE (derived
))
2216 typedef struct find_final_overrider_data_s
{
2217 /* The function for which we are trying to find a final overrider. */
2219 /* The base class in which the function was declared. */
2220 tree declaring_base
;
2221 /* The candidate overriders. */
2223 /* Path to most derived. */
2225 } find_final_overrider_data
;
2227 /* Add the overrider along the current path to FFOD->CANDIDATES.
2228 Returns true if an overrider was found; false otherwise. */
2231 dfs_find_final_overrider_1 (tree binfo
,
2232 find_final_overrider_data
*ffod
,
2237 /* If BINFO is not the most derived type, try a more derived class.
2238 A definition there will overrider a definition here. */
2242 if (dfs_find_final_overrider_1
2243 (ffod
->path
[depth
], ffod
, depth
))
2247 method
= look_for_overrides_here (BINFO_TYPE (binfo
), ffod
->fn
);
2250 tree
*candidate
= &ffod
->candidates
;
2252 /* Remove any candidates overridden by this new function. */
2255 /* If *CANDIDATE overrides METHOD, then METHOD
2256 cannot override anything else on the list. */
2257 if (base_derived_from (TREE_VALUE (*candidate
), binfo
))
2259 /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */
2260 if (base_derived_from (binfo
, TREE_VALUE (*candidate
)))
2261 *candidate
= TREE_CHAIN (*candidate
);
2263 candidate
= &TREE_CHAIN (*candidate
);
2266 /* Add the new function. */
2267 ffod
->candidates
= tree_cons (method
, binfo
, ffod
->candidates
);
2274 /* Called from find_final_overrider via dfs_walk. */
2277 dfs_find_final_overrider_pre (tree binfo
, void *data
)
2279 find_final_overrider_data
*ffod
= (find_final_overrider_data
*) data
;
2281 if (binfo
== ffod
->declaring_base
)
2282 dfs_find_final_overrider_1 (binfo
, ffod
, ffod
->path
.length ());
2283 ffod
->path
.safe_push (binfo
);
2289 dfs_find_final_overrider_post (tree
/*binfo*/, void *data
)
2291 find_final_overrider_data
*ffod
= (find_final_overrider_data
*) data
;
2297 /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for
2298 FN and whose TREE_VALUE is the binfo for the base where the
2299 overriding occurs. BINFO (in the hierarchy dominated by the binfo
2300 DERIVED) is the base object in which FN is declared. */
2303 find_final_overrider (tree derived
, tree binfo
, tree fn
)
2305 find_final_overrider_data ffod
;
2307 /* Getting this right is a little tricky. This is valid:
2309 struct S { virtual void f (); };
2310 struct T { virtual void f (); };
2311 struct U : public S, public T { };
2313 even though calling `f' in `U' is ambiguous. But,
2315 struct R { virtual void f(); };
2316 struct S : virtual public R { virtual void f (); };
2317 struct T : virtual public R { virtual void f (); };
2318 struct U : public S, public T { };
2320 is not -- there's no way to decide whether to put `S::f' or
2321 `T::f' in the vtable for `R'.
2323 The solution is to look at all paths to BINFO. If we find
2324 different overriders along any two, then there is a problem. */
2325 if (DECL_THUNK_P (fn
))
2326 fn
= THUNK_TARGET (fn
);
2328 /* Determine the depth of the hierarchy. */
2330 ffod
.declaring_base
= binfo
;
2331 ffod
.candidates
= NULL_TREE
;
2332 ffod
.path
.create (30);
2334 dfs_walk_all (derived
, dfs_find_final_overrider_pre
,
2335 dfs_find_final_overrider_post
, &ffod
);
2337 ffod
.path
.release ();
2339 /* If there was no winner, issue an error message. */
2340 if (!ffod
.candidates
|| TREE_CHAIN (ffod
.candidates
))
2341 return error_mark_node
;
2343 return ffod
.candidates
;
2346 /* Return the index of the vcall offset for FN when TYPE is used as a
2350 get_vcall_index (tree fn
, tree type
)
2352 vec
<tree_pair_s
, va_gc
> *indices
= CLASSTYPE_VCALL_INDICES (type
);
2356 FOR_EACH_VEC_SAFE_ELT (indices
, ix
, p
)
2357 if ((DECL_DESTRUCTOR_P (fn
) && DECL_DESTRUCTOR_P (p
->purpose
))
2358 || same_signature_p (fn
, p
->purpose
))
2361 /* There should always be an appropriate index. */
2365 /* Update an entry in the vtable for BINFO, which is in the hierarchy
2366 dominated by T. FN is the old function; VIRTUALS points to the
2367 corresponding position in the new BINFO_VIRTUALS list. IX is the index
2368 of that entry in the list. */
2371 update_vtable_entry_for_fn (tree t
, tree binfo
, tree fn
, tree
* virtuals
,
2379 tree overrider_fn
, overrider_target
;
2380 tree target_fn
= DECL_THUNK_P (fn
) ? THUNK_TARGET (fn
) : fn
;
2381 tree over_return
, base_return
;
2384 /* Find the nearest primary base (possibly binfo itself) which defines
2385 this function; this is the class the caller will convert to when
2386 calling FN through BINFO. */
2387 for (b
= binfo
; ; b
= get_primary_binfo (b
))
2390 if (look_for_overrides_here (BINFO_TYPE (b
), target_fn
))
2393 /* The nearest definition is from a lost primary. */
2394 if (BINFO_LOST_PRIMARY_P (b
))
2399 /* Find the final overrider. */
2400 overrider
= find_final_overrider (TYPE_BINFO (t
), b
, target_fn
);
2401 if (overrider
== error_mark_node
)
2403 error ("no unique final overrider for %qD in %qT", target_fn
, t
);
2406 overrider_target
= overrider_fn
= TREE_PURPOSE (overrider
);
2408 /* Check for adjusting covariant return types. */
2409 over_return
= TREE_TYPE (TREE_TYPE (overrider_target
));
2410 base_return
= TREE_TYPE (TREE_TYPE (target_fn
));
2412 if (POINTER_TYPE_P (over_return
)
2413 && TREE_CODE (over_return
) == TREE_CODE (base_return
)
2414 && CLASS_TYPE_P (TREE_TYPE (over_return
))
2415 && CLASS_TYPE_P (TREE_TYPE (base_return
))
2416 /* If the overrider is invalid, don't even try. */
2417 && !DECL_INVALID_OVERRIDER_P (overrider_target
))
2419 /* If FN is a covariant thunk, we must figure out the adjustment
2420 to the final base FN was converting to. As OVERRIDER_TARGET might
2421 also be converting to the return type of FN, we have to
2422 combine the two conversions here. */
2423 tree fixed_offset
, virtual_offset
;
2425 over_return
= TREE_TYPE (over_return
);
2426 base_return
= TREE_TYPE (base_return
);
2428 if (DECL_THUNK_P (fn
))
2430 gcc_assert (DECL_RESULT_THUNK_P (fn
));
2431 fixed_offset
= ssize_int (THUNK_FIXED_OFFSET (fn
));
2432 virtual_offset
= THUNK_VIRTUAL_OFFSET (fn
);
2435 fixed_offset
= virtual_offset
= NULL_TREE
;
2438 /* Find the equivalent binfo within the return type of the
2439 overriding function. We will want the vbase offset from
2441 virtual_offset
= binfo_for_vbase (BINFO_TYPE (virtual_offset
),
2443 else if (!same_type_ignoring_top_level_qualifiers_p
2444 (over_return
, base_return
))
2446 /* There was no existing virtual thunk (which takes
2447 precedence). So find the binfo of the base function's
2448 return type within the overriding function's return type.
2449 We cannot call lookup base here, because we're inside a
2450 dfs_walk, and will therefore clobber the BINFO_MARKED
2451 flags. Fortunately we know the covariancy is valid (it
2452 has already been checked), so we can just iterate along
2453 the binfos, which have been chained in inheritance graph
2454 order. Of course it is lame that we have to repeat the
2455 search here anyway -- we should really be caching pieces
2456 of the vtable and avoiding this repeated work. */
2457 tree thunk_binfo
, base_binfo
;
2459 /* Find the base binfo within the overriding function's
2460 return type. We will always find a thunk_binfo, except
2461 when the covariancy is invalid (which we will have
2462 already diagnosed). */
2463 for (base_binfo
= TYPE_BINFO (base_return
),
2464 thunk_binfo
= TYPE_BINFO (over_return
);
2466 thunk_binfo
= TREE_CHAIN (thunk_binfo
))
2467 if (SAME_BINFO_TYPE_P (BINFO_TYPE (thunk_binfo
),
2468 BINFO_TYPE (base_binfo
)))
2471 /* See if virtual inheritance is involved. */
2472 for (virtual_offset
= thunk_binfo
;
2474 virtual_offset
= BINFO_INHERITANCE_CHAIN (virtual_offset
))
2475 if (BINFO_VIRTUAL_P (virtual_offset
))
2479 || (thunk_binfo
&& !BINFO_OFFSET_ZEROP (thunk_binfo
)))
2481 tree offset
= convert (ssizetype
, BINFO_OFFSET (thunk_binfo
));
2485 /* We convert via virtual base. Adjust the fixed
2486 offset to be from there. */
2488 size_diffop (offset
,
2490 BINFO_OFFSET (virtual_offset
)));
2493 /* There was an existing fixed offset, this must be
2494 from the base just converted to, and the base the
2495 FN was thunking to. */
2496 fixed_offset
= size_binop (PLUS_EXPR
, fixed_offset
, offset
);
2498 fixed_offset
= offset
;
2502 if (fixed_offset
|| virtual_offset
)
2503 /* Replace the overriding function with a covariant thunk. We
2504 will emit the overriding function in its own slot as
2506 overrider_fn
= make_thunk (overrider_target
, /*this_adjusting=*/0,
2507 fixed_offset
, virtual_offset
);
2510 gcc_assert (DECL_INVALID_OVERRIDER_P (overrider_target
) ||
2511 !DECL_THUNK_P (fn
));
2513 /* If we need a covariant thunk, then we may need to adjust first_defn.
2514 The ABI specifies that the thunks emitted with a function are
2515 determined by which bases the function overrides, so we need to be
2516 sure that we're using a thunk for some overridden base; even if we
2517 know that the necessary this adjustment is zero, there may not be an
2518 appropriate zero-this-adjusment thunk for us to use since thunks for
2519 overriding virtual bases always use the vcall offset.
2521 Furthermore, just choosing any base that overrides this function isn't
2522 quite right, as this slot won't be used for calls through a type that
2523 puts a covariant thunk here. Calling the function through such a type
2524 will use a different slot, and that slot is the one that determines
2525 the thunk emitted for that base.
2527 So, keep looking until we find the base that we're really overriding
2528 in this slot: the nearest primary base that doesn't use a covariant
2529 thunk in this slot. */
2530 if (overrider_target
!= overrider_fn
)
2532 if (BINFO_TYPE (b
) == DECL_CONTEXT (overrider_target
))
2533 /* We already know that the overrider needs a covariant thunk. */
2534 b
= get_primary_binfo (b
);
2535 for (; ; b
= get_primary_binfo (b
))
2537 tree main_binfo
= TYPE_BINFO (BINFO_TYPE (b
));
2538 tree bv
= chain_index (ix
, BINFO_VIRTUALS (main_binfo
));
2539 if (!DECL_THUNK_P (TREE_VALUE (bv
)))
2541 if (BINFO_LOST_PRIMARY_P (b
))
2547 /* Assume that we will produce a thunk that convert all the way to
2548 the final overrider, and not to an intermediate virtual base. */
2549 virtual_base
= NULL_TREE
;
2551 /* See if we can convert to an intermediate virtual base first, and then
2552 use the vcall offset located there to finish the conversion. */
2553 for (; b
; b
= BINFO_INHERITANCE_CHAIN (b
))
2555 /* If we find the final overrider, then we can stop
2557 if (SAME_BINFO_TYPE_P (BINFO_TYPE (b
),
2558 BINFO_TYPE (TREE_VALUE (overrider
))))
2561 /* If we find a virtual base, and we haven't yet found the
2562 overrider, then there is a virtual base between the
2563 declaring base (first_defn) and the final overrider. */
2564 if (BINFO_VIRTUAL_P (b
))
2571 /* Compute the constant adjustment to the `this' pointer. The
2572 `this' pointer, when this function is called, will point at BINFO
2573 (or one of its primary bases, which are at the same offset). */
2575 /* The `this' pointer needs to be adjusted from the declaration to
2576 the nearest virtual base. */
2577 delta
= size_diffop_loc (input_location
,
2578 convert (ssizetype
, BINFO_OFFSET (virtual_base
)),
2579 convert (ssizetype
, BINFO_OFFSET (first_defn
)));
2581 /* If the nearest definition is in a lost primary, we don't need an
2582 entry in our vtable. Except possibly in a constructor vtable,
2583 if we happen to get our primary back. In that case, the offset
2584 will be zero, as it will be a primary base. */
2585 delta
= size_zero_node
;
2587 /* The `this' pointer needs to be adjusted from pointing to
2588 BINFO to pointing at the base where the final overrider
2590 delta
= size_diffop_loc (input_location
,
2592 BINFO_OFFSET (TREE_VALUE (overrider
))),
2593 convert (ssizetype
, BINFO_OFFSET (binfo
)));
2595 modify_vtable_entry (t
, binfo
, overrider_fn
, delta
, virtuals
);
2598 BV_VCALL_INDEX (*virtuals
)
2599 = get_vcall_index (overrider_target
, BINFO_TYPE (virtual_base
));
2601 BV_VCALL_INDEX (*virtuals
) = NULL_TREE
;
2603 BV_LOST_PRIMARY (*virtuals
) = lost
;
2606 /* Called from modify_all_vtables via dfs_walk. */
2609 dfs_modify_vtables (tree binfo
, void* data
)
2611 tree t
= (tree
) data
;
2616 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
2617 /* A base without a vtable needs no modification, and its bases
2618 are uninteresting. */
2619 return dfs_skip_bases
;
2621 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
)
2622 && !CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
2623 /* Don't do the primary vtable, if it's new. */
2626 if (BINFO_PRIMARY_P (binfo
) && !BINFO_VIRTUAL_P (binfo
))
2627 /* There's no need to modify the vtable for a non-virtual primary
2628 base; we're not going to use that vtable anyhow. We do still
2629 need to do this for virtual primary bases, as they could become
2630 non-primary in a construction vtable. */
2633 make_new_vtable (t
, binfo
);
2635 /* Now, go through each of the virtual functions in the virtual
2636 function table for BINFO. Find the final overrider, and update
2637 the BINFO_VIRTUALS list appropriately. */
2638 for (ix
= 0, virtuals
= BINFO_VIRTUALS (binfo
),
2639 old_virtuals
= BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo
)));
2641 ix
++, virtuals
= TREE_CHAIN (virtuals
),
2642 old_virtuals
= TREE_CHAIN (old_virtuals
))
2643 update_vtable_entry_for_fn (t
,
2645 BV_FN (old_virtuals
),
2651 /* Update all of the primary and secondary vtables for T. Create new
2652 vtables as required, and initialize their RTTI information. Each
2653 of the functions in VIRTUALS is declared in T and may override a
2654 virtual function from a base class; find and modify the appropriate
2655 entries to point to the overriding functions. Returns a list, in
2656 declaration order, of the virtual functions that are declared in T,
2657 but do not appear in the primary base class vtable, and which
2658 should therefore be appended to the end of the vtable for T. */
2661 modify_all_vtables (tree t
, tree virtuals
)
2663 tree binfo
= TYPE_BINFO (t
);
2666 /* Mangle the vtable name before entering dfs_walk (c++/51884). */
2667 if (TYPE_CONTAINS_VPTR_P (t
))
2668 get_vtable_decl (t
, false);
2670 /* Update all of the vtables. */
2671 dfs_walk_once (binfo
, dfs_modify_vtables
, NULL
, t
);
2673 /* Add virtual functions not already in our primary vtable. These
2674 will be both those introduced by this class, and those overridden
2675 from secondary bases. It does not include virtuals merely
2676 inherited from secondary bases. */
2677 for (fnsp
= &virtuals
; *fnsp
; )
2679 tree fn
= TREE_VALUE (*fnsp
);
2681 if (!value_member (fn
, BINFO_VIRTUALS (binfo
))
2682 || DECL_VINDEX (fn
) == error_mark_node
)
2684 /* We don't need to adjust the `this' pointer when
2685 calling this function. */
2686 BV_DELTA (*fnsp
) = integer_zero_node
;
2687 BV_VCALL_INDEX (*fnsp
) = NULL_TREE
;
2689 /* This is a function not already in our vtable. Keep it. */
2690 fnsp
= &TREE_CHAIN (*fnsp
);
2693 /* We've already got an entry for this function. Skip it. */
2694 *fnsp
= TREE_CHAIN (*fnsp
);
2700 /* Get the base virtual function declarations in T that have the
2704 get_basefndecls (tree name
, tree t
)
2707 tree base_fndecls
= NULL_TREE
;
2708 int n_baseclasses
= BINFO_N_BASE_BINFOS (TYPE_BINFO (t
));
2711 /* Find virtual functions in T with the indicated NAME. */
2712 i
= lookup_fnfields_1 (t
, name
);
2714 for (methods
= (*CLASSTYPE_METHOD_VEC (t
))[i
];
2716 methods
= OVL_NEXT (methods
))
2718 tree method
= OVL_CURRENT (methods
);
2720 if (TREE_CODE (method
) == FUNCTION_DECL
2721 && DECL_VINDEX (method
))
2722 base_fndecls
= tree_cons (NULL_TREE
, method
, base_fndecls
);
2726 return base_fndecls
;
2728 for (i
= 0; i
< n_baseclasses
; i
++)
2730 tree basetype
= BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (t
), i
));
2731 base_fndecls
= chainon (get_basefndecls (name
, basetype
),
2735 return base_fndecls
;
2738 /* If this declaration supersedes the declaration of
2739 a method declared virtual in the base class, then
2740 mark this field as being virtual as well. */
2743 check_for_override (tree decl
, tree ctype
)
2745 bool overrides_found
= false;
2746 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2747 /* In [temp.mem] we have:
2749 A specialization of a member function template does not
2750 override a virtual function from a base class. */
2752 if ((DECL_DESTRUCTOR_P (decl
)
2753 || IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
))
2754 || DECL_CONV_FN_P (decl
))
2755 && look_for_overrides (ctype
, decl
)
2756 && !DECL_STATIC_FUNCTION_P (decl
))
2757 /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor
2758 the error_mark_node so that we know it is an overriding
2761 DECL_VINDEX (decl
) = decl
;
2762 overrides_found
= true;
2765 if (DECL_VIRTUAL_P (decl
))
2767 if (!DECL_VINDEX (decl
))
2768 DECL_VINDEX (decl
) = error_mark_node
;
2769 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
2770 if (DECL_DESTRUCTOR_P (decl
))
2771 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (ctype
) = true;
2773 else if (DECL_FINAL_P (decl
))
2774 error ("%q+#D marked final, but is not virtual", decl
);
2775 if (DECL_OVERRIDE_P (decl
) && !overrides_found
)
2776 error ("%q+#D marked override, but does not override", decl
);
2779 /* Warn about hidden virtual functions that are not overridden in t.
2780 We know that constructors and destructors don't apply. */
2783 warn_hidden (tree t
)
2785 vec
<tree
, va_gc
> *method_vec
= CLASSTYPE_METHOD_VEC (t
);
2789 /* We go through each separately named virtual function. */
2790 for (i
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2791 vec_safe_iterate (method_vec
, i
, &fns
);
2802 /* All functions in this slot in the CLASSTYPE_METHOD_VEC will
2803 have the same name. Figure out what name that is. */
2804 name
= DECL_NAME (OVL_CURRENT (fns
));
2805 /* There are no possibly hidden functions yet. */
2806 base_fndecls
= NULL_TREE
;
2807 /* Iterate through all of the base classes looking for possibly
2808 hidden functions. */
2809 for (binfo
= TYPE_BINFO (t
), j
= 0;
2810 BINFO_BASE_ITERATE (binfo
, j
, base_binfo
); j
++)
2812 tree basetype
= BINFO_TYPE (base_binfo
);
2813 base_fndecls
= chainon (get_basefndecls (name
, basetype
),
2817 /* If there are no functions to hide, continue. */
2821 /* Remove any overridden functions. */
2822 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
2824 fndecl
= OVL_CURRENT (fn
);
2825 if (DECL_VINDEX (fndecl
))
2827 tree
*prev
= &base_fndecls
;
2830 /* If the method from the base class has the same
2831 signature as the method from the derived class, it
2832 has been overridden. */
2833 if (same_signature_p (fndecl
, TREE_VALUE (*prev
)))
2834 *prev
= TREE_CHAIN (*prev
);
2836 prev
= &TREE_CHAIN (*prev
);
2840 /* Now give a warning for all base functions without overriders,
2841 as they are hidden. */
2842 while (base_fndecls
)
2844 /* Here we know it is a hider, and no overrider exists. */
2845 warning (OPT_Woverloaded_virtual
, "%q+D was hidden", TREE_VALUE (base_fndecls
));
2846 warning (OPT_Woverloaded_virtual
, " by %q+D", fns
);
2847 base_fndecls
= TREE_CHAIN (base_fndecls
);
2852 /* Recursive helper for finish_struct_anon. */
2855 finish_struct_anon_r (tree field
, bool complain
)
2857 bool is_union
= TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
;
2858 tree elt
= TYPE_FIELDS (TREE_TYPE (field
));
2859 for (; elt
; elt
= DECL_CHAIN (elt
))
2861 /* We're generally only interested in entities the user
2862 declared, but we also find nested classes by noticing
2863 the TYPE_DECL that we create implicitly. You're
2864 allowed to put one anonymous union inside another,
2865 though, so we explicitly tolerate that. We use
2866 TYPE_ANONYMOUS_P rather than ANON_AGGR_TYPE_P so that
2867 we also allow unnamed types used for defining fields. */
2868 if (DECL_ARTIFICIAL (elt
)
2869 && (!DECL_IMPLICIT_TYPEDEF_P (elt
)
2870 || TYPE_ANONYMOUS_P (TREE_TYPE (elt
))))
2873 if (TREE_CODE (elt
) != FIELD_DECL
)
2875 /* We already complained about static data members in
2876 finish_static_data_member_decl. */
2877 if (complain
&& TREE_CODE (elt
) != VAR_DECL
)
2880 permerror (input_location
,
2881 "%q+#D invalid; an anonymous union can "
2882 "only have non-static data members", elt
);
2884 permerror (input_location
,
2885 "%q+#D invalid; an anonymous struct can "
2886 "only have non-static data members", elt
);
2893 if (TREE_PRIVATE (elt
))
2896 permerror (input_location
,
2897 "private member %q+#D in anonymous union", elt
);
2899 permerror (input_location
,
2900 "private member %q+#D in anonymous struct", elt
);
2902 else if (TREE_PROTECTED (elt
))
2905 permerror (input_location
,
2906 "protected member %q+#D in anonymous union", elt
);
2908 permerror (input_location
,
2909 "protected member %q+#D in anonymous struct", elt
);
2913 TREE_PRIVATE (elt
) = TREE_PRIVATE (field
);
2914 TREE_PROTECTED (elt
) = TREE_PROTECTED (field
);
2916 /* Recurse into the anonymous aggregates to handle correctly
2917 access control (c++/24926):
2928 if (DECL_NAME (elt
) == NULL_TREE
2929 && ANON_AGGR_TYPE_P (TREE_TYPE (elt
)))
2930 finish_struct_anon_r (elt
, /*complain=*/false);
2934 /* Check for things that are invalid. There are probably plenty of other
2935 things we should check for also. */
2938 finish_struct_anon (tree t
)
2940 for (tree field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
2942 if (TREE_STATIC (field
))
2944 if (TREE_CODE (field
) != FIELD_DECL
)
2947 if (DECL_NAME (field
) == NULL_TREE
2948 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2949 finish_struct_anon_r (field
, /*complain=*/true);
2953 /* Add T to CLASSTYPE_DECL_LIST of current_class_type which
2954 will be used later during class template instantiation.
2955 When FRIEND_P is zero, T can be a static member data (VAR_DECL),
2956 a non-static member data (FIELD_DECL), a member function
2957 (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE),
2958 a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL)
2959 When FRIEND_P is nonzero, T is either a friend class
2960 (RECORD_TYPE, TEMPLATE_DECL) or a friend function
2961 (FUNCTION_DECL, TEMPLATE_DECL). */
2964 maybe_add_class_template_decl_list (tree type
, tree t
, int friend_p
)
2966 /* Save some memory by not creating TREE_LIST if TYPE is not template. */
2967 if (CLASSTYPE_TEMPLATE_INFO (type
))
2968 CLASSTYPE_DECL_LIST (type
)
2969 = tree_cons (friend_p
? NULL_TREE
: type
,
2970 t
, CLASSTYPE_DECL_LIST (type
));
2973 /* This function is called from declare_virt_assop_and_dtor via
2976 DATA is a type that direcly or indirectly inherits the base
2977 represented by BINFO. If BINFO contains a virtual assignment [copy
2978 assignment or move assigment] operator or a virtual constructor,
2979 declare that function in DATA if it hasn't been already declared. */
2982 dfs_declare_virt_assop_and_dtor (tree binfo
, void *data
)
2984 tree bv
, fn
, t
= (tree
)data
;
2985 tree opname
= ansi_assopname (NOP_EXPR
);
2987 gcc_assert (t
&& CLASS_TYPE_P (t
));
2988 gcc_assert (binfo
&& TREE_CODE (binfo
) == TREE_BINFO
);
2990 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
2991 /* A base without a vtable needs no modification, and its bases
2992 are uninteresting. */
2993 return dfs_skip_bases
;
2995 if (BINFO_PRIMARY_P (binfo
))
2996 /* If this is a primary base, then we have already looked at the
2997 virtual functions of its vtable. */
3000 for (bv
= BINFO_VIRTUALS (binfo
); bv
; bv
= TREE_CHAIN (bv
))
3004 if (DECL_NAME (fn
) == opname
)
3006 if (CLASSTYPE_LAZY_COPY_ASSIGN (t
))
3007 lazily_declare_fn (sfk_copy_assignment
, t
);
3008 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
3009 lazily_declare_fn (sfk_move_assignment
, t
);
3011 else if (DECL_DESTRUCTOR_P (fn
)
3012 && CLASSTYPE_LAZY_DESTRUCTOR (t
))
3013 lazily_declare_fn (sfk_destructor
, t
);
3019 /* If the class type T has a direct or indirect base that contains a
3020 virtual assignment operator or a virtual destructor, declare that
3021 function in T if it hasn't been already declared. */
3024 declare_virt_assop_and_dtor (tree t
)
3026 if (!(TYPE_POLYMORPHIC_P (t
)
3027 && (CLASSTYPE_LAZY_COPY_ASSIGN (t
)
3028 || CLASSTYPE_LAZY_MOVE_ASSIGN (t
)
3029 || CLASSTYPE_LAZY_DESTRUCTOR (t
))))
3032 dfs_walk_all (TYPE_BINFO (t
),
3033 dfs_declare_virt_assop_and_dtor
,
3037 /* Declare the inheriting constructor for class T inherited from base
3038 constructor CTOR with the parameter array PARMS of size NPARMS. */
3041 one_inheriting_sig (tree t
, tree ctor
, tree
*parms
, int nparms
)
3043 /* We don't declare an inheriting ctor that would be a default,
3044 copy or move ctor for derived or base. */
3048 && TREE_CODE (parms
[0]) == REFERENCE_TYPE
)
3050 tree parm
= TYPE_MAIN_VARIANT (TREE_TYPE (parms
[0]));
3051 if (parm
== t
|| parm
== DECL_CONTEXT (ctor
))
3055 tree parmlist
= void_list_node
;
3056 for (int i
= nparms
- 1; i
>= 0; i
--)
3057 parmlist
= tree_cons (NULL_TREE
, parms
[i
], parmlist
);
3058 tree fn
= implicitly_declare_fn (sfk_inheriting_constructor
,
3059 t
, false, ctor
, parmlist
);
3060 if (add_method (t
, fn
, NULL_TREE
))
3062 DECL_CHAIN (fn
) = TYPE_METHODS (t
);
3063 TYPE_METHODS (t
) = fn
;
3067 /* Declare all the inheriting constructors for class T inherited from base
3068 constructor CTOR. */
3071 one_inherited_ctor (tree ctor
, tree t
)
3073 tree parms
= FUNCTION_FIRST_USER_PARMTYPE (ctor
);
3075 tree
*new_parms
= XALLOCAVEC (tree
, list_length (parms
));
3077 for (; parms
&& parms
!= void_list_node
; parms
= TREE_CHAIN (parms
))
3079 if (TREE_PURPOSE (parms
))
3080 one_inheriting_sig (t
, ctor
, new_parms
, i
);
3081 new_parms
[i
++] = TREE_VALUE (parms
);
3083 one_inheriting_sig (t
, ctor
, new_parms
, i
);
3084 if (parms
== NULL_TREE
)
3086 if (warning (OPT_Winherited_variadic_ctor
,
3087 "the ellipsis in %qD is not inherited", ctor
))
3088 inform (DECL_SOURCE_LOCATION (ctor
), "%qD declared here", ctor
);
3092 /* Create default constructors, assignment operators, and so forth for
3093 the type indicated by T, if they are needed. CANT_HAVE_CONST_CTOR,
3094 and CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason,
3095 the class cannot have a default constructor, copy constructor
3096 taking a const reference argument, or an assignment operator taking
3097 a const reference, respectively. */
3100 add_implicitly_declared_members (tree t
, tree
* access_decls
,
3101 int cant_have_const_cctor
,
3102 int cant_have_const_assignment
)
3104 bool move_ok
= false;
3106 if (cxx_dialect
>= cxx11
&& !CLASSTYPE_DESTRUCTORS (t
)
3107 && !TYPE_HAS_COPY_CTOR (t
) && !TYPE_HAS_COPY_ASSIGN (t
)
3108 && !type_has_move_constructor (t
) && !type_has_move_assign (t
))
3112 if (!CLASSTYPE_DESTRUCTORS (t
))
3114 /* In general, we create destructors lazily. */
3115 CLASSTYPE_LAZY_DESTRUCTOR (t
) = 1;
3117 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3118 && TYPE_FOR_JAVA (t
))
3119 /* But if this is a Java class, any non-trivial destructor is
3120 invalid, even if compiler-generated. Therefore, if the
3121 destructor is non-trivial we create it now. */
3122 lazily_declare_fn (sfk_destructor
, t
);
3127 If there is no user-declared constructor for a class, a default
3128 constructor is implicitly declared. */
3129 if (! TYPE_HAS_USER_CONSTRUCTOR (t
))
3131 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 1;
3132 CLASSTYPE_LAZY_DEFAULT_CTOR (t
) = 1;
3133 if (cxx_dialect
>= cxx11
)
3134 TYPE_HAS_CONSTEXPR_CTOR (t
)
3135 /* This might force the declaration. */
3136 = type_has_constexpr_default_constructor (t
);
3141 If a class definition does not explicitly declare a copy
3142 constructor, one is declared implicitly. */
3143 if (! TYPE_HAS_COPY_CTOR (t
) && ! TYPE_FOR_JAVA (t
))
3145 TYPE_HAS_COPY_CTOR (t
) = 1;
3146 TYPE_HAS_CONST_COPY_CTOR (t
) = !cant_have_const_cctor
;
3147 CLASSTYPE_LAZY_COPY_CTOR (t
) = 1;
3149 CLASSTYPE_LAZY_MOVE_CTOR (t
) = 1;
3152 /* If there is no assignment operator, one will be created if and
3153 when it is needed. For now, just record whether or not the type
3154 of the parameter to the assignment operator will be a const or
3155 non-const reference. */
3156 if (!TYPE_HAS_COPY_ASSIGN (t
) && !TYPE_FOR_JAVA (t
))
3158 TYPE_HAS_COPY_ASSIGN (t
) = 1;
3159 TYPE_HAS_CONST_COPY_ASSIGN (t
) = !cant_have_const_assignment
;
3160 CLASSTYPE_LAZY_COPY_ASSIGN (t
) = 1;
3162 CLASSTYPE_LAZY_MOVE_ASSIGN (t
) = 1;
3165 /* We can't be lazy about declaring functions that might override
3166 a virtual function from a base class. */
3167 declare_virt_assop_and_dtor (t
);
3169 while (*access_decls
)
3171 tree using_decl
= TREE_VALUE (*access_decls
);
3172 tree decl
= USING_DECL_DECLS (using_decl
);
3173 if (DECL_NAME (using_decl
) == ctor_identifier
)
3175 /* declare, then remove the decl */
3176 tree ctor_list
= decl
;
3177 location_t loc
= input_location
;
3178 input_location
= DECL_SOURCE_LOCATION (using_decl
);
3180 for (; ctor_list
; ctor_list
= OVL_NEXT (ctor_list
))
3181 one_inherited_ctor (OVL_CURRENT (ctor_list
), t
);
3182 *access_decls
= TREE_CHAIN (*access_decls
);
3183 input_location
= loc
;
3186 access_decls
= &TREE_CHAIN (*access_decls
);
3190 /* Subroutine of insert_into_classtype_sorted_fields. Recursively
3191 count the number of fields in TYPE, including anonymous union
3195 count_fields (tree fields
)
3199 for (x
= fields
; x
; x
= DECL_CHAIN (x
))
3201 if (TREE_CODE (x
) == FIELD_DECL
&& ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
3202 n_fields
+= count_fields (TYPE_FIELDS (TREE_TYPE (x
)));
3209 /* Subroutine of insert_into_classtype_sorted_fields. Recursively add
3210 all the fields in the TREE_LIST FIELDS to the SORTED_FIELDS_TYPE
3211 elts, starting at offset IDX. */
3214 add_fields_to_record_type (tree fields
, struct sorted_fields_type
*field_vec
, int idx
)
3217 for (x
= fields
; x
; x
= DECL_CHAIN (x
))
3219 if (TREE_CODE (x
) == FIELD_DECL
&& ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
3220 idx
= add_fields_to_record_type (TYPE_FIELDS (TREE_TYPE (x
)), field_vec
, idx
);
3222 field_vec
->elts
[idx
++] = x
;
3227 /* Add all of the enum values of ENUMTYPE, to the FIELD_VEC elts,
3228 starting at offset IDX. */
3231 add_enum_fields_to_record_type (tree enumtype
,
3232 struct sorted_fields_type
*field_vec
,
3236 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
3237 field_vec
->elts
[idx
++] = TREE_VALUE (values
);
3241 /* FIELD is a bit-field. We are finishing the processing for its
3242 enclosing type. Issue any appropriate messages and set appropriate
3243 flags. Returns false if an error has been diagnosed. */
3246 check_bitfield_decl (tree field
)
3248 tree type
= TREE_TYPE (field
);
3251 /* Extract the declared width of the bitfield, which has been
3252 temporarily stashed in DECL_INITIAL. */
3253 w
= DECL_INITIAL (field
);
3254 gcc_assert (w
!= NULL_TREE
);
3255 /* Remove the bit-field width indicator so that the rest of the
3256 compiler does not treat that value as an initializer. */
3257 DECL_INITIAL (field
) = NULL_TREE
;
3259 /* Detect invalid bit-field type. */
3260 if (!INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
3262 error ("bit-field %q+#D with non-integral type", field
);
3263 w
= error_mark_node
;
3267 location_t loc
= input_location
;
3268 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
3271 /* detect invalid field size. */
3272 input_location
= DECL_SOURCE_LOCATION (field
);
3273 w
= cxx_constant_value (w
);
3274 input_location
= loc
;
3276 if (TREE_CODE (w
) != INTEGER_CST
)
3278 error ("bit-field %q+D width not an integer constant", field
);
3279 w
= error_mark_node
;
3281 else if (tree_int_cst_sgn (w
) < 0)
3283 error ("negative width in bit-field %q+D", field
);
3284 w
= error_mark_node
;
3286 else if (integer_zerop (w
) && DECL_NAME (field
) != 0)
3288 error ("zero width for bit-field %q+D", field
);
3289 w
= error_mark_node
;
3291 else if ((TREE_CODE (type
) != ENUMERAL_TYPE
3292 && TREE_CODE (type
) != BOOLEAN_TYPE
3293 && compare_tree_int (w
, TYPE_PRECISION (type
)) > 0)
3294 || ((TREE_CODE (type
) == ENUMERAL_TYPE
3295 || TREE_CODE (type
) == BOOLEAN_TYPE
)
3296 && tree_int_cst_lt (TYPE_SIZE (type
), w
)))
3297 warning (0, "width of %q+D exceeds its type", field
);
3298 else if (TREE_CODE (type
) == ENUMERAL_TYPE
3299 && (0 > (compare_tree_int
3300 (w
, TYPE_PRECISION (ENUM_UNDERLYING_TYPE (type
))))))
3301 warning (0, "%q+D is too small to hold all values of %q#T", field
, type
);
3304 if (w
!= error_mark_node
)
3306 DECL_SIZE (field
) = convert (bitsizetype
, w
);
3307 DECL_BIT_FIELD (field
) = 1;
3312 /* Non-bit-fields are aligned for their type. */
3313 DECL_BIT_FIELD (field
) = 0;
3314 CLEAR_DECL_C_BIT_FIELD (field
);
3319 /* FIELD is a non bit-field. We are finishing the processing for its
3320 enclosing type T. Issue any appropriate messages and set appropriate
3324 check_field_decl (tree field
,
3326 int* cant_have_const_ctor
,
3327 int* no_const_asn_ref
,
3328 int* any_default_members
)
3330 tree type
= strip_array_types (TREE_TYPE (field
));
3332 /* In C++98 an anonymous union cannot contain any fields which would change
3333 the settings of CANT_HAVE_CONST_CTOR and friends. */
3334 if (ANON_UNION_TYPE_P (type
) && cxx_dialect
< cxx11
)
3336 /* And, we don't set TYPE_HAS_CONST_COPY_CTOR, etc., for anonymous
3337 structs. So, we recurse through their fields here. */
3338 else if (ANON_AGGR_TYPE_P (type
))
3342 for (fields
= TYPE_FIELDS (type
); fields
; fields
= DECL_CHAIN (fields
))
3343 if (TREE_CODE (fields
) == FIELD_DECL
&& !DECL_C_BIT_FIELD (field
))
3344 check_field_decl (fields
, t
, cant_have_const_ctor
,
3345 no_const_asn_ref
, any_default_members
);
3347 /* Check members with class type for constructors, destructors,
3349 else if (CLASS_TYPE_P (type
))
3351 /* Never let anything with uninheritable virtuals
3352 make it through without complaint. */
3353 abstract_virtuals_error (field
, type
);
3355 if (TREE_CODE (t
) == UNION_TYPE
&& cxx_dialect
< cxx11
)
3358 int oldcount
= errorcount
;
3359 if (TYPE_NEEDS_CONSTRUCTING (type
))
3360 error ("member %q+#D with constructor not allowed in union",
3362 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
3363 error ("member %q+#D with destructor not allowed in union", field
);
3364 if (TYPE_HAS_COMPLEX_COPY_ASSIGN (type
))
3365 error ("member %q+#D with copy assignment operator not allowed in union",
3367 if (!warned
&& errorcount
> oldcount
)
3369 inform (DECL_SOURCE_LOCATION (field
), "unrestricted unions "
3370 "only available with -std=c++11 or -std=gnu++11");
3376 TYPE_NEEDS_CONSTRUCTING (t
) |= TYPE_NEEDS_CONSTRUCTING (type
);
3377 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3378 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
);
3379 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
)
3380 |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (type
)
3381 || !TYPE_HAS_COPY_ASSIGN (type
));
3382 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= (TYPE_HAS_COMPLEX_COPY_CTOR (type
)
3383 || !TYPE_HAS_COPY_CTOR (type
));
3384 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (type
);
3385 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_HAS_COMPLEX_MOVE_CTOR (type
);
3386 TYPE_HAS_COMPLEX_DFLT (t
) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (type
)
3387 || TYPE_HAS_COMPLEX_DFLT (type
));
3390 if (TYPE_HAS_COPY_CTOR (type
)
3391 && !TYPE_HAS_CONST_COPY_CTOR (type
))
3392 *cant_have_const_ctor
= 1;
3394 if (TYPE_HAS_COPY_ASSIGN (type
)
3395 && !TYPE_HAS_CONST_COPY_ASSIGN (type
))
3396 *no_const_asn_ref
= 1;
3399 check_abi_tags (t
, field
);
3401 if (DECL_INITIAL (field
) != NULL_TREE
)
3403 /* `build_class_init_list' does not recognize
3405 if (TREE_CODE (t
) == UNION_TYPE
&& *any_default_members
!= 0)
3406 error ("multiple fields in union %qT initialized", t
);
3407 *any_default_members
= 1;
3411 /* Check the data members (both static and non-static), class-scoped
3412 typedefs, etc., appearing in the declaration of T. Issue
3413 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
3414 declaration order) of access declarations; each TREE_VALUE in this
3415 list is a USING_DECL.
3417 In addition, set the following flags:
3420 The class is empty, i.e., contains no non-static data members.
3422 CANT_HAVE_CONST_CTOR_P
3423 This class cannot have an implicitly generated copy constructor
3424 taking a const reference.
3426 CANT_HAVE_CONST_ASN_REF
3427 This class cannot have an implicitly generated assignment
3428 operator taking a const reference.
3430 All of these flags should be initialized before calling this
3433 Returns a pointer to the end of the TYPE_FIELDs chain; additional
3434 fields can be added by adding to this chain. */
3437 check_field_decls (tree t
, tree
*access_decls
,
3438 int *cant_have_const_ctor_p
,
3439 int *no_const_asn_ref_p
)
3444 int any_default_members
;
3446 int field_access
= -1;
3448 /* Assume there are no access declarations. */
3449 *access_decls
= NULL_TREE
;
3450 /* Assume this class has no pointer members. */
3451 has_pointers
= false;
3452 /* Assume none of the members of this class have default
3454 any_default_members
= 0;
3456 for (field
= &TYPE_FIELDS (t
); *field
; field
= next
)
3459 tree type
= TREE_TYPE (x
);
3460 int this_field_access
;
3462 next
= &DECL_CHAIN (x
);
3464 if (TREE_CODE (x
) == USING_DECL
)
3466 /* Save the access declarations for our caller. */
3467 *access_decls
= tree_cons (NULL_TREE
, x
, *access_decls
);
3471 if (TREE_CODE (x
) == TYPE_DECL
3472 || TREE_CODE (x
) == TEMPLATE_DECL
)
3475 /* If we've gotten this far, it's a data member, possibly static,
3476 or an enumerator. */
3477 if (TREE_CODE (x
) != CONST_DECL
)
3478 DECL_CONTEXT (x
) = t
;
3480 /* When this goes into scope, it will be a non-local reference. */
3481 DECL_NONLOCAL (x
) = 1;
3483 if (TREE_CODE (t
) == UNION_TYPE
3484 && cxx_dialect
< cxx11
)
3486 /* [class.union] (C++98)
3488 If a union contains a static data member, or a member of
3489 reference type, the program is ill-formed.
3491 In C++11 this limitation doesn't exist anymore. */
3494 error ("in C++98 %q+D may not be static because it is "
3495 "a member of a union", x
);
3498 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3500 error ("in C++98 %q+D may not have reference type %qT "
3501 "because it is a member of a union", x
, type
);
3506 /* Perform error checking that did not get done in
3508 if (TREE_CODE (type
) == FUNCTION_TYPE
)
3510 error ("field %q+D invalidly declared function type", x
);
3511 type
= build_pointer_type (type
);
3512 TREE_TYPE (x
) = type
;
3514 else if (TREE_CODE (type
) == METHOD_TYPE
)
3516 error ("field %q+D invalidly declared method type", x
);
3517 type
= build_pointer_type (type
);
3518 TREE_TYPE (x
) = type
;
3521 if (type
== error_mark_node
)
3524 if (TREE_CODE (x
) == CONST_DECL
|| VAR_P (x
))
3527 /* Now it can only be a FIELD_DECL. */
3529 if (TREE_PRIVATE (x
) || TREE_PROTECTED (x
))
3530 CLASSTYPE_NON_AGGREGATE (t
) = 1;
3532 /* If at least one non-static data member is non-literal, the whole
3533 class becomes non-literal. Note: if the type is incomplete we
3534 will complain later on. */
3535 if (COMPLETE_TYPE_P (type
) && !literal_type_p (type
))
3536 CLASSTYPE_LITERAL_P (t
) = false;
3538 /* A standard-layout class is a class that:
3540 has the same access control (Clause 11) for all non-static data members,
3542 this_field_access
= TREE_PROTECTED (x
) ? 1 : TREE_PRIVATE (x
) ? 2 : 0;
3543 if (field_access
== -1)
3544 field_access
= this_field_access
;
3545 else if (this_field_access
!= field_access
)
3546 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3548 /* If this is of reference type, check if it needs an init. */
3549 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3551 CLASSTYPE_NON_LAYOUT_POD_P (t
) = 1;
3552 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3553 if (DECL_INITIAL (x
) == NULL_TREE
)
3554 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t
, 1);
3556 /* ARM $12.6.2: [A member initializer list] (or, for an
3557 aggregate, initialization by a brace-enclosed list) is the
3558 only way to initialize nonstatic const and reference
3560 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
3561 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) = 1;
3564 type
= strip_array_types (type
);
3566 if (TYPE_PACKED (t
))
3568 if (!layout_pod_type_p (type
) && !TYPE_PACKED (type
))
3572 "ignoring packed attribute because of unpacked non-POD field %q+#D",
3576 else if (DECL_C_BIT_FIELD (x
)
3577 || TYPE_ALIGN (TREE_TYPE (x
)) > BITS_PER_UNIT
)
3578 DECL_PACKED (x
) = 1;
3581 if (DECL_C_BIT_FIELD (x
) && integer_zerop (DECL_INITIAL (x
)))
3582 /* We don't treat zero-width bitfields as making a class
3587 /* The class is non-empty. */
3588 CLASSTYPE_EMPTY_P (t
) = 0;
3589 /* The class is not even nearly empty. */
3590 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
3591 /* If one of the data members contains an empty class,
3593 if (CLASS_TYPE_P (type
)
3594 && CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type
))
3595 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 1;
3598 /* This is used by -Weffc++ (see below). Warn only for pointers
3599 to members which might hold dynamic memory. So do not warn
3600 for pointers to functions or pointers to members. */
3601 if (TYPE_PTR_P (type
)
3602 && !TYPE_PTRFN_P (type
))
3603 has_pointers
= true;
3605 if (CLASS_TYPE_P (type
))
3607 if (CLASSTYPE_REF_FIELDS_NEED_INIT (type
))
3608 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t
, 1);
3609 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (type
))
3610 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
, 1);
3613 if (DECL_MUTABLE_P (x
) || TYPE_HAS_MUTABLE_P (type
))
3614 CLASSTYPE_HAS_MUTABLE (t
) = 1;
3616 if (DECL_MUTABLE_P (x
))
3618 if (CP_TYPE_CONST_P (type
))
3620 error ("member %q+D cannot be declared both %<const%> "
3621 "and %<mutable%>", x
);
3624 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3626 error ("member %q+D cannot be declared as a %<mutable%> "
3632 if (! layout_pod_type_p (type
))
3633 /* DR 148 now allows pointers to members (which are POD themselves),
3634 to be allowed in POD structs. */
3635 CLASSTYPE_NON_LAYOUT_POD_P (t
) = 1;
3637 if (!std_layout_type_p (type
))
3638 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3640 if (! zero_init_p (type
))
3641 CLASSTYPE_NON_ZERO_INIT_P (t
) = 1;
3643 /* We set DECL_C_BIT_FIELD in grokbitfield.
3644 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
3645 if (! DECL_C_BIT_FIELD (x
) || ! check_bitfield_decl (x
))
3646 check_field_decl (x
, t
,
3647 cant_have_const_ctor_p
,
3649 &any_default_members
);
3651 /* Now that we've removed bit-field widths from DECL_INITIAL,
3652 anything left in DECL_INITIAL is an NSDMI that makes the class
3654 if (DECL_INITIAL (x
))
3655 CLASSTYPE_NON_AGGREGATE (t
) = true;
3657 /* If any field is const, the structure type is pseudo-const. */
3658 if (CP_TYPE_CONST_P (type
))
3660 C_TYPE_FIELDS_READONLY (t
) = 1;
3661 if (DECL_INITIAL (x
) == NULL_TREE
)
3662 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
, 1);
3664 /* ARM $12.6.2: [A member initializer list] (or, for an
3665 aggregate, initialization by a brace-enclosed list) is the
3666 only way to initialize nonstatic const and reference
3668 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
3669 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) = 1;
3671 /* A field that is pseudo-const makes the structure likewise. */
3672 else if (CLASS_TYPE_P (type
))
3674 C_TYPE_FIELDS_READONLY (t
) |= C_TYPE_FIELDS_READONLY (type
);
3675 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
,
3676 CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
)
3677 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (type
));
3680 /* Core issue 80: A nonstatic data member is required to have a
3681 different name from the class iff the class has a
3682 user-declared constructor. */
3683 if (constructor_name_p (DECL_NAME (x
), t
)
3684 && TYPE_HAS_USER_CONSTRUCTOR (t
))
3685 permerror (input_location
, "field %q+#D with same name as class", x
);
3688 /* Effective C++ rule 11: if a class has dynamic memory held by pointers,
3689 it should also define a copy constructor and an assignment operator to
3690 implement the correct copy semantic (deep vs shallow, etc.). As it is
3691 not feasible to check whether the constructors do allocate dynamic memory
3692 and store it within members, we approximate the warning like this:
3694 -- Warn only if there are members which are pointers
3695 -- Warn only if there is a non-trivial constructor (otherwise,
3696 there cannot be memory allocated).
3697 -- Warn only if there is a non-trivial destructor. We assume that the
3698 user at least implemented the cleanup correctly, and a destructor
3699 is needed to free dynamic memory.
3701 This seems enough for practical purposes. */
3704 && TYPE_HAS_USER_CONSTRUCTOR (t
)
3705 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3706 && !(TYPE_HAS_COPY_CTOR (t
) && TYPE_HAS_COPY_ASSIGN (t
)))
3708 warning (OPT_Weffc__
, "%q#T has pointer data members", t
);
3710 if (! TYPE_HAS_COPY_CTOR (t
))
3712 warning (OPT_Weffc__
,
3713 " but does not override %<%T(const %T&)%>", t
, t
);
3714 if (!TYPE_HAS_COPY_ASSIGN (t
))
3715 warning (OPT_Weffc__
, " or %<operator=(const %T&)%>", t
);
3717 else if (! TYPE_HAS_COPY_ASSIGN (t
))
3718 warning (OPT_Weffc__
,
3719 " but does not override %<operator=(const %T&)%>", t
);
3722 /* Non-static data member initializers make the default constructor
3724 if (any_default_members
)
3726 TYPE_NEEDS_CONSTRUCTING (t
) = true;
3727 TYPE_HAS_COMPLEX_DFLT (t
) = true;
3730 /* If any of the fields couldn't be packed, unset TYPE_PACKED. */
3732 TYPE_PACKED (t
) = 0;
3734 /* Check anonymous struct/anonymous union fields. */
3735 finish_struct_anon (t
);
3737 /* We've built up the list of access declarations in reverse order.
3739 *access_decls
= nreverse (*access_decls
);
3742 /* If TYPE is an empty class type, records its OFFSET in the table of
3746 record_subobject_offset (tree type
, tree offset
, splay_tree offsets
)
3750 if (!is_empty_class (type
))
3753 /* Record the location of this empty object in OFFSETS. */
3754 n
= splay_tree_lookup (offsets
, (splay_tree_key
) offset
);
3756 n
= splay_tree_insert (offsets
,
3757 (splay_tree_key
) offset
,
3758 (splay_tree_value
) NULL_TREE
);
3759 n
->value
= ((splay_tree_value
)
3760 tree_cons (NULL_TREE
,
3767 /* Returns nonzero if TYPE is an empty class type and there is
3768 already an entry in OFFSETS for the same TYPE as the same OFFSET. */
3771 check_subobject_offset (tree type
, tree offset
, splay_tree offsets
)
3776 if (!is_empty_class (type
))
3779 /* Record the location of this empty object in OFFSETS. */
3780 n
= splay_tree_lookup (offsets
, (splay_tree_key
) offset
);
3784 for (t
= (tree
) n
->value
; t
; t
= TREE_CHAIN (t
))
3785 if (same_type_p (TREE_VALUE (t
), type
))
3791 /* Walk through all the subobjects of TYPE (located at OFFSET). Call
3792 F for every subobject, passing it the type, offset, and table of
3793 OFFSETS. If VBASES_P is one, then virtual non-primary bases should
3796 If MAX_OFFSET is non-NULL, then subobjects with an offset greater
3797 than MAX_OFFSET will not be walked.
3799 If F returns a nonzero value, the traversal ceases, and that value
3800 is returned. Otherwise, returns zero. */
3803 walk_subobject_offsets (tree type
,
3804 subobject_offset_fn f
,
3811 tree type_binfo
= NULL_TREE
;
3813 /* If this OFFSET is bigger than the MAX_OFFSET, then we should
3815 if (max_offset
&& tree_int_cst_lt (max_offset
, offset
))
3818 if (type
== error_mark_node
)
3823 if (abi_version_at_least (2))
3825 type
= BINFO_TYPE (type
);
3828 if (CLASS_TYPE_P (type
))
3834 /* Avoid recursing into objects that are not interesting. */
3835 if (!CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type
))
3838 /* Record the location of TYPE. */
3839 r
= (*f
) (type
, offset
, offsets
);
3843 /* Iterate through the direct base classes of TYPE. */
3845 type_binfo
= TYPE_BINFO (type
);
3846 for (i
= 0; BINFO_BASE_ITERATE (type_binfo
, i
, binfo
); i
++)
3850 if (abi_version_at_least (2)
3851 && BINFO_VIRTUAL_P (binfo
))
3855 && BINFO_VIRTUAL_P (binfo
)
3856 && !BINFO_PRIMARY_P (binfo
))
3859 if (!abi_version_at_least (2))
3860 binfo_offset
= size_binop (PLUS_EXPR
,
3862 BINFO_OFFSET (binfo
));
3866 /* We cannot rely on BINFO_OFFSET being set for the base
3867 class yet, but the offsets for direct non-virtual
3868 bases can be calculated by going back to the TYPE. */
3869 orig_binfo
= BINFO_BASE_BINFO (TYPE_BINFO (type
), i
);
3870 binfo_offset
= size_binop (PLUS_EXPR
,
3872 BINFO_OFFSET (orig_binfo
));
3875 r
= walk_subobject_offsets (binfo
,
3880 (abi_version_at_least (2)
3881 ? /*vbases_p=*/0 : vbases_p
));
3886 if (abi_version_at_least (2) && CLASSTYPE_VBASECLASSES (type
))
3889 vec
<tree
, va_gc
> *vbases
;
3891 /* Iterate through the virtual base classes of TYPE. In G++
3892 3.2, we included virtual bases in the direct base class
3893 loop above, which results in incorrect results; the
3894 correct offsets for virtual bases are only known when
3895 working with the most derived type. */
3897 for (vbases
= CLASSTYPE_VBASECLASSES (type
), ix
= 0;
3898 vec_safe_iterate (vbases
, ix
, &binfo
); ix
++)
3900 r
= walk_subobject_offsets (binfo
,
3902 size_binop (PLUS_EXPR
,
3904 BINFO_OFFSET (binfo
)),
3913 /* We still have to walk the primary base, if it is
3914 virtual. (If it is non-virtual, then it was walked
3916 tree vbase
= get_primary_binfo (type_binfo
);
3918 if (vbase
&& BINFO_VIRTUAL_P (vbase
)
3919 && BINFO_PRIMARY_P (vbase
)
3920 && BINFO_INHERITANCE_CHAIN (vbase
) == type_binfo
)
3922 r
= (walk_subobject_offsets
3924 offsets
, max_offset
, /*vbases_p=*/0));
3931 /* Iterate through the fields of TYPE. */
3932 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3933 if (TREE_CODE (field
) == FIELD_DECL
3934 && TREE_TYPE (field
) != error_mark_node
3935 && !DECL_ARTIFICIAL (field
))
3939 if (abi_version_at_least (2))
3940 field_offset
= byte_position (field
);
3942 /* In G++ 3.2, DECL_FIELD_OFFSET was used. */
3943 field_offset
= DECL_FIELD_OFFSET (field
);
3945 r
= walk_subobject_offsets (TREE_TYPE (field
),
3947 size_binop (PLUS_EXPR
,
3957 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3959 tree element_type
= strip_array_types (type
);
3960 tree domain
= TYPE_DOMAIN (type
);
3963 /* Avoid recursing into objects that are not interesting. */
3964 if (!CLASS_TYPE_P (element_type
)
3965 || !CLASSTYPE_CONTAINS_EMPTY_CLASS_P (element_type
))
3968 /* Step through each of the elements in the array. */
3969 for (index
= size_zero_node
;
3970 /* G++ 3.2 had an off-by-one error here. */
3971 (abi_version_at_least (2)
3972 ? !tree_int_cst_lt (TYPE_MAX_VALUE (domain
), index
)
3973 : tree_int_cst_lt (index
, TYPE_MAX_VALUE (domain
)));
3974 index
= size_binop (PLUS_EXPR
, index
, size_one_node
))
3976 r
= walk_subobject_offsets (TREE_TYPE (type
),
3984 offset
= size_binop (PLUS_EXPR
, offset
,
3985 TYPE_SIZE_UNIT (TREE_TYPE (type
)));
3986 /* If this new OFFSET is bigger than the MAX_OFFSET, then
3987 there's no point in iterating through the remaining
3988 elements of the array. */
3989 if (max_offset
&& tree_int_cst_lt (max_offset
, offset
))
3997 /* Record all of the empty subobjects of TYPE (either a type or a
3998 binfo). If IS_DATA_MEMBER is true, then a non-static data member
3999 is being placed at OFFSET; otherwise, it is a base class that is
4000 being placed at OFFSET. */
4003 record_subobject_offsets (tree type
,
4006 bool is_data_member
)
4009 /* If recording subobjects for a non-static data member or a
4010 non-empty base class , we do not need to record offsets beyond
4011 the size of the biggest empty class. Additional data members
4012 will go at the end of the class. Additional base classes will go
4013 either at offset zero (if empty, in which case they cannot
4014 overlap with offsets past the size of the biggest empty class) or
4015 at the end of the class.
4017 However, if we are placing an empty base class, then we must record
4018 all offsets, as either the empty class is at offset zero (where
4019 other empty classes might later be placed) or at the end of the
4020 class (where other objects might then be placed, so other empty
4021 subobjects might later overlap). */
4023 || !is_empty_class (BINFO_TYPE (type
)))
4024 max_offset
= sizeof_biggest_empty_class
;
4026 max_offset
= NULL_TREE
;
4027 walk_subobject_offsets (type
, record_subobject_offset
, offset
,
4028 offsets
, max_offset
, is_data_member
);
4031 /* Returns nonzero if any of the empty subobjects of TYPE (located at
4032 OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero,
4033 virtual bases of TYPE are examined. */
4036 layout_conflict_p (tree type
,
4041 splay_tree_node max_node
;
4043 /* Get the node in OFFSETS that indicates the maximum offset where
4044 an empty subobject is located. */
4045 max_node
= splay_tree_max (offsets
);
4046 /* If there aren't any empty subobjects, then there's no point in
4047 performing this check. */
4051 return walk_subobject_offsets (type
, check_subobject_offset
, offset
,
4052 offsets
, (tree
) (max_node
->key
),
4056 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
4057 non-static data member of the type indicated by RLI. BINFO is the
4058 binfo corresponding to the base subobject, OFFSETS maps offsets to
4059 types already located at those offsets. This function determines
4060 the position of the DECL. */
4063 layout_nonempty_base_or_field (record_layout_info rli
,
4068 tree offset
= NULL_TREE
;
4074 /* For the purposes of determining layout conflicts, we want to
4075 use the class type of BINFO; TREE_TYPE (DECL) will be the
4076 CLASSTYPE_AS_BASE version, which does not contain entries for
4077 zero-sized bases. */
4078 type
= TREE_TYPE (binfo
);
4083 type
= TREE_TYPE (decl
);
4087 /* Try to place the field. It may take more than one try if we have
4088 a hard time placing the field without putting two objects of the
4089 same type at the same address. */
4092 struct record_layout_info_s old_rli
= *rli
;
4094 /* Place this field. */
4095 place_field (rli
, decl
);
4096 offset
= byte_position (decl
);
4098 /* We have to check to see whether or not there is already
4099 something of the same type at the offset we're about to use.
4100 For example, consider:
4103 struct T : public S { int i; };
4104 struct U : public S, public T {};
4106 Here, we put S at offset zero in U. Then, we can't put T at
4107 offset zero -- its S component would be at the same address
4108 as the S we already allocated. So, we have to skip ahead.
4109 Since all data members, including those whose type is an
4110 empty class, have nonzero size, any overlap can happen only
4111 with a direct or indirect base-class -- it can't happen with
4113 /* In a union, overlap is permitted; all members are placed at
4115 if (TREE_CODE (rli
->t
) == UNION_TYPE
)
4117 /* G++ 3.2 did not check for overlaps when placing a non-empty
4119 if (!abi_version_at_least (2) && binfo
&& BINFO_VIRTUAL_P (binfo
))
4121 if (layout_conflict_p (field_p
? type
: binfo
, offset
,
4124 /* Strip off the size allocated to this field. That puts us
4125 at the first place we could have put the field with
4126 proper alignment. */
4129 /* Bump up by the alignment required for the type. */
4131 = size_binop (PLUS_EXPR
, rli
->bitpos
,
4133 ? CLASSTYPE_ALIGN (type
)
4134 : TYPE_ALIGN (type
)));
4135 normalize_rli (rli
);
4138 /* There was no conflict. We're done laying out this field. */
4142 /* Now that we know where it will be placed, update its
4144 if (binfo
&& CLASS_TYPE_P (BINFO_TYPE (binfo
)))
4145 /* Indirect virtual bases may have a nonzero BINFO_OFFSET at
4146 this point because their BINFO_OFFSET is copied from another
4147 hierarchy. Therefore, we may not need to add the entire
4149 propagate_binfo_offsets (binfo
,
4150 size_diffop_loc (input_location
,
4151 convert (ssizetype
, offset
),
4153 BINFO_OFFSET (binfo
))));
4156 /* Returns true if TYPE is empty and OFFSET is nonzero. */
4159 empty_base_at_nonzero_offset_p (tree type
,
4161 splay_tree
/*offsets*/)
4163 return is_empty_class (type
) && !integer_zerop (offset
);
4166 /* Layout the empty base BINFO. EOC indicates the byte currently just
4167 past the end of the class, and should be correctly aligned for a
4168 class of the type indicated by BINFO; OFFSETS gives the offsets of
4169 the empty bases allocated so far. T is the most derived
4170 type. Return nonzero iff we added it at the end. */
4173 layout_empty_base (record_layout_info rli
, tree binfo
,
4174 tree eoc
, splay_tree offsets
)
4177 tree basetype
= BINFO_TYPE (binfo
);
4180 /* This routine should only be used for empty classes. */
4181 gcc_assert (is_empty_class (basetype
));
4182 alignment
= ssize_int (CLASSTYPE_ALIGN_UNIT (basetype
));
4184 if (!integer_zerop (BINFO_OFFSET (binfo
)))
4186 if (abi_version_at_least (2))
4187 propagate_binfo_offsets
4188 (binfo
, size_diffop_loc (input_location
,
4189 size_zero_node
, BINFO_OFFSET (binfo
)));
4192 "offset of empty base %qT may not be ABI-compliant and may"
4193 "change in a future version of GCC",
4194 BINFO_TYPE (binfo
));
4197 /* This is an empty base class. We first try to put it at offset
4199 if (layout_conflict_p (binfo
,
4200 BINFO_OFFSET (binfo
),
4204 /* That didn't work. Now, we move forward from the next
4205 available spot in the class. */
4207 propagate_binfo_offsets (binfo
, convert (ssizetype
, eoc
));
4210 if (!layout_conflict_p (binfo
,
4211 BINFO_OFFSET (binfo
),
4214 /* We finally found a spot where there's no overlap. */
4217 /* There's overlap here, too. Bump along to the next spot. */
4218 propagate_binfo_offsets (binfo
, alignment
);
4222 if (CLASSTYPE_USER_ALIGN (basetype
))
4224 rli
->record_align
= MAX (rli
->record_align
, CLASSTYPE_ALIGN (basetype
));
4226 rli
->unpacked_align
= MAX (rli
->unpacked_align
, CLASSTYPE_ALIGN (basetype
));
4227 TYPE_USER_ALIGN (rli
->t
) = 1;
4233 /* Layout the base given by BINFO in the class indicated by RLI.
4234 *BASE_ALIGN is a running maximum of the alignments of
4235 any base class. OFFSETS gives the location of empty base
4236 subobjects. T is the most derived type. Return nonzero if the new
4237 object cannot be nearly-empty. A new FIELD_DECL is inserted at
4238 *NEXT_FIELD, unless BINFO is for an empty base class.
4240 Returns the location at which the next field should be inserted. */
4243 build_base_field (record_layout_info rli
, tree binfo
,
4244 splay_tree offsets
, tree
*next_field
)
4247 tree basetype
= BINFO_TYPE (binfo
);
4249 if (!COMPLETE_TYPE_P (basetype
))
4250 /* This error is now reported in xref_tag, thus giving better
4251 location information. */
4254 /* Place the base class. */
4255 if (!is_empty_class (basetype
))
4259 /* The containing class is non-empty because it has a non-empty
4261 CLASSTYPE_EMPTY_P (t
) = 0;
4263 /* Create the FIELD_DECL. */
4264 decl
= build_decl (input_location
,
4265 FIELD_DECL
, NULL_TREE
, CLASSTYPE_AS_BASE (basetype
));
4266 DECL_ARTIFICIAL (decl
) = 1;
4267 DECL_IGNORED_P (decl
) = 1;
4268 DECL_FIELD_CONTEXT (decl
) = t
;
4269 if (CLASSTYPE_AS_BASE (basetype
))
4271 DECL_SIZE (decl
) = CLASSTYPE_SIZE (basetype
);
4272 DECL_SIZE_UNIT (decl
) = CLASSTYPE_SIZE_UNIT (basetype
);
4273 DECL_ALIGN (decl
) = CLASSTYPE_ALIGN (basetype
);
4274 DECL_USER_ALIGN (decl
) = CLASSTYPE_USER_ALIGN (basetype
);
4275 DECL_MODE (decl
) = TYPE_MODE (basetype
);
4276 DECL_FIELD_IS_BASE (decl
) = 1;
4278 /* Try to place the field. It may take more than one try if we
4279 have a hard time placing the field without putting two
4280 objects of the same type at the same address. */
4281 layout_nonempty_base_or_field (rli
, decl
, binfo
, offsets
);
4282 /* Add the new FIELD_DECL to the list of fields for T. */
4283 DECL_CHAIN (decl
) = *next_field
;
4285 next_field
= &DECL_CHAIN (decl
);
4293 /* On some platforms (ARM), even empty classes will not be
4295 eoc
= round_up_loc (input_location
,
4296 rli_size_unit_so_far (rli
),
4297 CLASSTYPE_ALIGN_UNIT (basetype
));
4298 atend
= layout_empty_base (rli
, binfo
, eoc
, offsets
);
4299 /* A nearly-empty class "has no proper base class that is empty,
4300 not morally virtual, and at an offset other than zero." */
4301 if (!BINFO_VIRTUAL_P (binfo
) && CLASSTYPE_NEARLY_EMPTY_P (t
))
4304 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
4305 /* The check above (used in G++ 3.2) is insufficient because
4306 an empty class placed at offset zero might itself have an
4307 empty base at a nonzero offset. */
4308 else if (walk_subobject_offsets (basetype
,
4309 empty_base_at_nonzero_offset_p
,
4312 /*max_offset=*/NULL_TREE
,
4315 if (abi_version_at_least (2))
4316 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
4319 "class %qT will be considered nearly empty in a "
4320 "future version of GCC", t
);
4324 /* We do not create a FIELD_DECL for empty base classes because
4325 it might overlap some other field. We want to be able to
4326 create CONSTRUCTORs for the class by iterating over the
4327 FIELD_DECLs, and the back end does not handle overlapping
4330 /* An empty virtual base causes a class to be non-empty
4331 -- but in that case we do not need to clear CLASSTYPE_EMPTY_P
4332 here because that was already done when the virtual table
4333 pointer was created. */
4336 /* Record the offsets of BINFO and its base subobjects. */
4337 record_subobject_offsets (binfo
,
4338 BINFO_OFFSET (binfo
),
4340 /*is_data_member=*/false);
4345 /* Layout all of the non-virtual base classes. Record empty
4346 subobjects in OFFSETS. T is the most derived type. Return nonzero
4347 if the type cannot be nearly empty. The fields created
4348 corresponding to the base classes will be inserted at
4352 build_base_fields (record_layout_info rli
,
4353 splay_tree offsets
, tree
*next_field
)
4355 /* Chain to hold all the new FIELD_DECLs which stand in for base class
4358 int n_baseclasses
= BINFO_N_BASE_BINFOS (TYPE_BINFO (t
));
4361 /* The primary base class is always allocated first. */
4362 if (CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
4363 next_field
= build_base_field (rli
, CLASSTYPE_PRIMARY_BINFO (t
),
4364 offsets
, next_field
);
4366 /* Now allocate the rest of the bases. */
4367 for (i
= 0; i
< n_baseclasses
; ++i
)
4371 base_binfo
= BINFO_BASE_BINFO (TYPE_BINFO (t
), i
);
4373 /* The primary base was already allocated above, so we don't
4374 need to allocate it again here. */
4375 if (base_binfo
== CLASSTYPE_PRIMARY_BINFO (t
))
4378 /* Virtual bases are added at the end (a primary virtual base
4379 will have already been added). */
4380 if (BINFO_VIRTUAL_P (base_binfo
))
4383 next_field
= build_base_field (rli
, base_binfo
,
4384 offsets
, next_field
);
4388 /* Go through the TYPE_METHODS of T issuing any appropriate
4389 diagnostics, figuring out which methods override which other
4390 methods, and so forth. */
4393 check_methods (tree t
)
4397 for (x
= TYPE_METHODS (t
); x
; x
= DECL_CHAIN (x
))
4399 check_for_override (x
, t
);
4400 if (DECL_PURE_VIRTUAL_P (x
) && ! DECL_VINDEX (x
))
4401 error ("initializer specified for non-virtual method %q+D", x
);
4402 /* The name of the field is the original field name
4403 Save this in auxiliary field for later overloading. */
4404 if (DECL_VINDEX (x
))
4406 TYPE_POLYMORPHIC_P (t
) = 1;
4407 if (DECL_PURE_VIRTUAL_P (x
))
4408 vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t
), x
);
4410 /* All user-provided destructors are non-trivial.
4411 Constructors and assignment ops are handled in
4412 grok_special_member_properties. */
4413 if (DECL_DESTRUCTOR_P (x
) && user_provided_p (x
))
4414 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = 1;
4418 /* FN is a constructor or destructor. Clone the declaration to create
4419 a specialized in-charge or not-in-charge version, as indicated by
4423 build_clone (tree fn
, tree name
)
4428 /* Copy the function. */
4429 clone
= copy_decl (fn
);
4430 /* Reset the function name. */
4431 DECL_NAME (clone
) = name
;
4432 SET_DECL_ASSEMBLER_NAME (clone
, NULL_TREE
);
4433 /* Remember where this function came from. */
4434 DECL_ABSTRACT_ORIGIN (clone
) = fn
;
4435 /* Make it easy to find the CLONE given the FN. */
4436 DECL_CHAIN (clone
) = DECL_CHAIN (fn
);
4437 DECL_CHAIN (fn
) = clone
;
4439 /* If this is a template, do the rest on the DECL_TEMPLATE_RESULT. */
4440 if (TREE_CODE (clone
) == TEMPLATE_DECL
)
4442 tree result
= build_clone (DECL_TEMPLATE_RESULT (clone
), name
);
4443 DECL_TEMPLATE_RESULT (clone
) = result
;
4444 DECL_TEMPLATE_INFO (result
) = copy_node (DECL_TEMPLATE_INFO (result
));
4445 DECL_TI_TEMPLATE (result
) = clone
;
4446 TREE_TYPE (clone
) = TREE_TYPE (result
);
4450 DECL_CLONED_FUNCTION (clone
) = fn
;
4451 /* There's no pending inline data for this function. */
4452 DECL_PENDING_INLINE_INFO (clone
) = NULL
;
4453 DECL_PENDING_INLINE_P (clone
) = 0;
4455 /* The base-class destructor is not virtual. */
4456 if (name
== base_dtor_identifier
)
4458 DECL_VIRTUAL_P (clone
) = 0;
4459 if (TREE_CODE (clone
) != TEMPLATE_DECL
)
4460 DECL_VINDEX (clone
) = NULL_TREE
;
4463 /* If there was an in-charge parameter, drop it from the function
4465 if (DECL_HAS_IN_CHARGE_PARM_P (clone
))
4471 exceptions
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone
));
4472 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (clone
));
4473 parmtypes
= TYPE_ARG_TYPES (TREE_TYPE (clone
));
4474 /* Skip the `this' parameter. */
4475 parmtypes
= TREE_CHAIN (parmtypes
);
4476 /* Skip the in-charge parameter. */
4477 parmtypes
= TREE_CHAIN (parmtypes
);
4478 /* And the VTT parm, in a complete [cd]tor. */
4479 if (DECL_HAS_VTT_PARM_P (fn
)
4480 && ! DECL_NEEDS_VTT_PARM_P (clone
))
4481 parmtypes
= TREE_CHAIN (parmtypes
);
4482 /* If this is subobject constructor or destructor, add the vtt
4485 = build_method_type_directly (basetype
,
4486 TREE_TYPE (TREE_TYPE (clone
)),
4489 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
),
4492 = cp_build_type_attribute_variant (TREE_TYPE (clone
),
4493 TYPE_ATTRIBUTES (TREE_TYPE (fn
)));
4496 /* Copy the function parameters. */
4497 DECL_ARGUMENTS (clone
) = copy_list (DECL_ARGUMENTS (clone
));
4498 /* Remove the in-charge parameter. */
4499 if (DECL_HAS_IN_CHARGE_PARM_P (clone
))
4501 DECL_CHAIN (DECL_ARGUMENTS (clone
))
4502 = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone
)));
4503 DECL_HAS_IN_CHARGE_PARM_P (clone
) = 0;
4505 /* And the VTT parm, in a complete [cd]tor. */
4506 if (DECL_HAS_VTT_PARM_P (fn
))
4508 if (DECL_NEEDS_VTT_PARM_P (clone
))
4509 DECL_HAS_VTT_PARM_P (clone
) = 1;
4512 DECL_CHAIN (DECL_ARGUMENTS (clone
))
4513 = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone
)));
4514 DECL_HAS_VTT_PARM_P (clone
) = 0;
4518 for (parms
= DECL_ARGUMENTS (clone
); parms
; parms
= DECL_CHAIN (parms
))
4520 DECL_CONTEXT (parms
) = clone
;
4521 cxx_dup_lang_specific_decl (parms
);
4524 /* Create the RTL for this function. */
4525 SET_DECL_RTL (clone
, NULL
);
4526 rest_of_decl_compilation (clone
, /*top_level=*/1, at_eof
);
4529 note_decl_for_pch (clone
);
4534 /* Implementation of DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P, do
4535 not invoke this function directly.
4537 For a non-thunk function, returns the address of the slot for storing
4538 the function it is a clone of. Otherwise returns NULL_TREE.
4540 If JUST_TESTING, looks through TEMPLATE_DECL and returns NULL if
4541 cloned_function is unset. This is to support the separate
4542 DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P modes; using the latter
4543 on a template makes sense, but not the former. */
4546 decl_cloned_function_p (const_tree decl
, bool just_testing
)
4550 decl
= STRIP_TEMPLATE (decl
);
4552 if (TREE_CODE (decl
) != FUNCTION_DECL
4553 || !DECL_LANG_SPECIFIC (decl
)
4554 || DECL_LANG_SPECIFIC (decl
)->u
.fn
.thunk_p
)
4556 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4558 lang_check_failed (__FILE__
, __LINE__
, __FUNCTION__
);
4564 ptr
= &DECL_LANG_SPECIFIC (decl
)->u
.fn
.u5
.cloned_function
;
4565 if (just_testing
&& *ptr
== NULL_TREE
)
4571 /* Produce declarations for all appropriate clones of FN. If
4572 UPDATE_METHOD_VEC_P is nonzero, the clones are added to the
4573 CLASTYPE_METHOD_VEC as well. */
4576 clone_function_decl (tree fn
, int update_method_vec_p
)
4580 /* Avoid inappropriate cloning. */
4582 && DECL_CLONED_FUNCTION_P (DECL_CHAIN (fn
)))
4585 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
4587 /* For each constructor, we need two variants: an in-charge version
4588 and a not-in-charge version. */
4589 clone
= build_clone (fn
, complete_ctor_identifier
);
4590 if (update_method_vec_p
)
4591 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4592 clone
= build_clone (fn
, base_ctor_identifier
);
4593 if (update_method_vec_p
)
4594 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4598 gcc_assert (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn
));
4600 /* For each destructor, we need three variants: an in-charge
4601 version, a not-in-charge version, and an in-charge deleting
4602 version. We clone the deleting version first because that
4603 means it will go second on the TYPE_METHODS list -- and that
4604 corresponds to the correct layout order in the virtual
4607 For a non-virtual destructor, we do not build a deleting
4609 if (DECL_VIRTUAL_P (fn
))
4611 clone
= build_clone (fn
, deleting_dtor_identifier
);
4612 if (update_method_vec_p
)
4613 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4615 clone
= build_clone (fn
, complete_dtor_identifier
);
4616 if (update_method_vec_p
)
4617 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4618 clone
= build_clone (fn
, base_dtor_identifier
);
4619 if (update_method_vec_p
)
4620 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4623 /* Note that this is an abstract function that is never emitted. */
4624 DECL_ABSTRACT (fn
) = 1;
4627 /* DECL is an in charge constructor, which is being defined. This will
4628 have had an in class declaration, from whence clones were
4629 declared. An out-of-class definition can specify additional default
4630 arguments. As it is the clones that are involved in overload
4631 resolution, we must propagate the information from the DECL to its
4635 adjust_clone_args (tree decl
)
4639 for (clone
= DECL_CHAIN (decl
); clone
&& DECL_CLONED_FUNCTION_P (clone
);
4640 clone
= DECL_CHAIN (clone
))
4642 tree orig_clone_parms
= TYPE_ARG_TYPES (TREE_TYPE (clone
));
4643 tree orig_decl_parms
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
4644 tree decl_parms
, clone_parms
;
4646 clone_parms
= orig_clone_parms
;
4648 /* Skip the 'this' parameter. */
4649 orig_clone_parms
= TREE_CHAIN (orig_clone_parms
);
4650 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4652 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
4653 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4654 if (DECL_HAS_VTT_PARM_P (decl
))
4655 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4657 clone_parms
= orig_clone_parms
;
4658 if (DECL_HAS_VTT_PARM_P (clone
))
4659 clone_parms
= TREE_CHAIN (clone_parms
);
4661 for (decl_parms
= orig_decl_parms
; decl_parms
;
4662 decl_parms
= TREE_CHAIN (decl_parms
),
4663 clone_parms
= TREE_CHAIN (clone_parms
))
4665 gcc_assert (same_type_p (TREE_TYPE (decl_parms
),
4666 TREE_TYPE (clone_parms
)));
4668 if (TREE_PURPOSE (decl_parms
) && !TREE_PURPOSE (clone_parms
))
4670 /* A default parameter has been added. Adjust the
4671 clone's parameters. */
4672 tree exceptions
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone
));
4673 tree attrs
= TYPE_ATTRIBUTES (TREE_TYPE (clone
));
4674 tree basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (clone
));
4677 clone_parms
= orig_decl_parms
;
4679 if (DECL_HAS_VTT_PARM_P (clone
))
4681 clone_parms
= tree_cons (TREE_PURPOSE (orig_clone_parms
),
4682 TREE_VALUE (orig_clone_parms
),
4684 TREE_TYPE (clone_parms
) = TREE_TYPE (orig_clone_parms
);
4686 type
= build_method_type_directly (basetype
,
4687 TREE_TYPE (TREE_TYPE (clone
)),
4690 type
= build_exception_variant (type
, exceptions
);
4692 type
= cp_build_type_attribute_variant (type
, attrs
);
4693 TREE_TYPE (clone
) = type
;
4695 clone_parms
= NULL_TREE
;
4699 gcc_assert (!clone_parms
);
4703 /* For each of the constructors and destructors in T, create an
4704 in-charge and not-in-charge variant. */
4707 clone_constructors_and_destructors (tree t
)
4711 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4713 if (!CLASSTYPE_METHOD_VEC (t
))
4716 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4717 clone_function_decl (OVL_CURRENT (fns
), /*update_method_vec_p=*/1);
4718 for (fns
= CLASSTYPE_DESTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4719 clone_function_decl (OVL_CURRENT (fns
), /*update_method_vec_p=*/1);
4722 /* Deduce noexcept for a destructor DTOR. */
4725 deduce_noexcept_on_destructor (tree dtor
)
4727 if (!TYPE_RAISES_EXCEPTIONS (TREE_TYPE (dtor
)))
4729 tree eh_spec
= unevaluated_noexcept_spec ();
4730 TREE_TYPE (dtor
) = build_exception_variant (TREE_TYPE (dtor
), eh_spec
);
4734 /* For each destructor in T, deduce noexcept:
4736 12.4/3: A declaration of a destructor that does not have an
4737 exception-specification is implicitly considered to have the
4738 same exception-specification as an implicit declaration (15.4). */
4741 deduce_noexcept_on_destructors (tree t
)
4743 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4745 if (!CLASSTYPE_METHOD_VEC (t
))
4748 for (tree fns
= CLASSTYPE_DESTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4749 deduce_noexcept_on_destructor (OVL_CURRENT (fns
));
4752 /* Subroutine of set_one_vmethod_tm_attributes. Search base classes
4753 of TYPE for virtual functions which FNDECL overrides. Return a
4754 mask of the tm attributes found therein. */
4757 look_for_tm_attr_overrides (tree type
, tree fndecl
)
4759 tree binfo
= TYPE_BINFO (type
);
4763 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ++ix
)
4765 tree o
, basetype
= BINFO_TYPE (base_binfo
);
4767 if (!TYPE_POLYMORPHIC_P (basetype
))
4770 o
= look_for_overrides_here (basetype
, fndecl
);
4772 found
|= tm_attr_to_mask (find_tm_attribute
4773 (TYPE_ATTRIBUTES (TREE_TYPE (o
))));
4775 found
|= look_for_tm_attr_overrides (basetype
, fndecl
);
4781 /* Subroutine of set_method_tm_attributes. Handle the checks and
4782 inheritance for one virtual method FNDECL. */
4785 set_one_vmethod_tm_attributes (tree type
, tree fndecl
)
4790 found
= look_for_tm_attr_overrides (type
, fndecl
);
4792 /* If FNDECL doesn't actually override anything (i.e. T is the
4793 class that first declares FNDECL virtual), then we're done. */
4797 tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl
)));
4798 have
= tm_attr_to_mask (tm_attr
);
4800 /* Intel STM Language Extension 3.0, Section 4.2 table 4:
4801 tm_pure must match exactly, otherwise no weakening of
4802 tm_safe > tm_callable > nothing. */
4803 /* ??? The tm_pure attribute didn't make the transition to the
4804 multivendor language spec. */
4805 if (have
== TM_ATTR_PURE
)
4807 if (found
!= TM_ATTR_PURE
)
4813 /* If the overridden function is tm_pure, then FNDECL must be. */
4814 else if (found
== TM_ATTR_PURE
&& tm_attr
)
4816 /* Look for base class combinations that cannot be satisfied. */
4817 else if (found
!= TM_ATTR_PURE
&& (found
& TM_ATTR_PURE
))
4819 found
&= ~TM_ATTR_PURE
;
4821 error_at (DECL_SOURCE_LOCATION (fndecl
),
4822 "method overrides both %<transaction_pure%> and %qE methods",
4823 tm_mask_to_attr (found
));
4825 /* If FNDECL did not declare an attribute, then inherit the most
4827 else if (tm_attr
== NULL
)
4829 apply_tm_attr (fndecl
, tm_mask_to_attr (found
& -found
));
4831 /* Otherwise validate that we're not weaker than a function
4832 that is being overridden. */
4836 if (found
<= TM_ATTR_CALLABLE
&& have
> found
)
4842 error_at (DECL_SOURCE_LOCATION (fndecl
),
4843 "method declared %qE overriding %qE method",
4844 tm_attr
, tm_mask_to_attr (found
));
4847 /* For each of the methods in T, propagate a class-level tm attribute. */
4850 set_method_tm_attributes (tree t
)
4852 tree class_tm_attr
, fndecl
;
4854 /* Don't bother collecting tm attributes if transactional memory
4855 support is not enabled. */
4859 /* Process virtual methods first, as they inherit directly from the
4860 base virtual function and also require validation of new attributes. */
4861 if (TYPE_CONTAINS_VPTR_P (t
))
4864 for (vchain
= BINFO_VIRTUALS (TYPE_BINFO (t
)); vchain
;
4865 vchain
= TREE_CHAIN (vchain
))
4867 fndecl
= BV_FN (vchain
);
4868 if (DECL_THUNK_P (fndecl
))
4869 fndecl
= THUNK_TARGET (fndecl
);
4870 set_one_vmethod_tm_attributes (t
, fndecl
);
4874 /* If the class doesn't have an attribute, nothing more to do. */
4875 class_tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (t
));
4876 if (class_tm_attr
== NULL
)
4879 /* Any method that does not yet have a tm attribute inherits
4880 the one from the class. */
4881 for (fndecl
= TYPE_METHODS (t
); fndecl
; fndecl
= TREE_CHAIN (fndecl
))
4883 if (!find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl
))))
4884 apply_tm_attr (fndecl
, class_tm_attr
);
4888 /* Returns true iff class T has a user-defined constructor other than
4889 the default constructor. */
4892 type_has_user_nondefault_constructor (tree t
)
4896 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4899 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4901 tree fn
= OVL_CURRENT (fns
);
4902 if (!DECL_ARTIFICIAL (fn
)
4903 && (TREE_CODE (fn
) == TEMPLATE_DECL
4904 || (skip_artificial_parms_for (fn
, DECL_ARGUMENTS (fn
))
4912 /* Returns the defaulted constructor if T has one. Otherwise, returns
4916 in_class_defaulted_default_constructor (tree t
)
4920 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4923 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4925 tree fn
= OVL_CURRENT (fns
);
4927 if (DECL_DEFAULTED_IN_CLASS_P (fn
))
4929 args
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
4930 while (args
&& TREE_PURPOSE (args
))
4931 args
= TREE_CHAIN (args
);
4932 if (!args
|| args
== void_list_node
)
4940 /* Returns true iff FN is a user-provided function, i.e. user-declared
4941 and not defaulted at its first declaration; or explicit, private,
4942 protected, or non-const. */
4945 user_provided_p (tree fn
)
4947 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4950 return (!DECL_ARTIFICIAL (fn
)
4951 && !(DECL_INITIALIZED_IN_CLASS_P (fn
)
4952 && (DECL_DEFAULTED_FN (fn
) || DECL_DELETED_FN (fn
))));
4955 /* Returns true iff class T has a user-provided constructor. */
4958 type_has_user_provided_constructor (tree t
)
4962 if (!CLASS_TYPE_P (t
))
4965 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4968 /* This can happen in error cases; avoid crashing. */
4969 if (!CLASSTYPE_METHOD_VEC (t
))
4972 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4973 if (user_provided_p (OVL_CURRENT (fns
)))
4979 /* Returns true iff class T has a user-provided default constructor. */
4982 type_has_user_provided_default_constructor (tree t
)
4986 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4989 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4991 tree fn
= OVL_CURRENT (fns
);
4992 if (TREE_CODE (fn
) == FUNCTION_DECL
4993 && user_provided_p (fn
)
4994 && sufficient_parms_p (FUNCTION_FIRST_USER_PARMTYPE (fn
)))
5001 /* TYPE is being used as a virtual base, and has a non-trivial move
5002 assignment. Return true if this is due to there being a user-provided
5003 move assignment in TYPE or one of its subobjects; if there isn't, then
5004 multiple move assignment can't cause any harm. */
5007 vbase_has_user_provided_move_assign (tree type
)
5009 /* Does the type itself have a user-provided move assignment operator? */
5011 = lookup_fnfields_slot_nolazy (type
, ansi_assopname (NOP_EXPR
));
5012 fns
; fns
= OVL_NEXT (fns
))
5014 tree fn
= OVL_CURRENT (fns
);
5015 if (move_fn_p (fn
) && user_provided_p (fn
))
5019 /* Do any of its bases? */
5020 tree binfo
= TYPE_BINFO (type
);
5022 for (int i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5023 if (vbase_has_user_provided_move_assign (BINFO_TYPE (base_binfo
)))
5026 /* Or non-static data members? */
5027 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
5029 if (TREE_CODE (field
) == FIELD_DECL
5030 && CLASS_TYPE_P (TREE_TYPE (field
))
5031 && vbase_has_user_provided_move_assign (TREE_TYPE (field
)))
5039 /* If default-initialization leaves part of TYPE uninitialized, returns
5040 a DECL for the field or TYPE itself (DR 253). */
5043 default_init_uninitialized_part (tree type
)
5048 type
= strip_array_types (type
);
5049 if (!CLASS_TYPE_P (type
))
5051 if (type_has_user_provided_default_constructor (type
))
5053 for (binfo
= TYPE_BINFO (type
), i
= 0;
5054 BINFO_BASE_ITERATE (binfo
, i
, t
); ++i
)
5056 r
= default_init_uninitialized_part (BINFO_TYPE (t
));
5060 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
5061 if (TREE_CODE (t
) == FIELD_DECL
5062 && !DECL_ARTIFICIAL (t
)
5063 && !DECL_INITIAL (t
))
5065 r
= default_init_uninitialized_part (TREE_TYPE (t
));
5067 return DECL_P (r
) ? r
: t
;
5073 /* Returns true iff for class T, a trivial synthesized default constructor
5074 would be constexpr. */
5077 trivial_default_constructor_is_constexpr (tree t
)
5079 /* A defaulted trivial default constructor is constexpr
5080 if there is nothing to initialize. */
5081 gcc_assert (!TYPE_HAS_COMPLEX_DFLT (t
));
5082 return is_really_empty_class (t
);
5085 /* Returns true iff class T has a constexpr default constructor. */
5088 type_has_constexpr_default_constructor (tree t
)
5092 if (!CLASS_TYPE_P (t
))
5094 /* The caller should have stripped an enclosing array. */
5095 gcc_assert (TREE_CODE (t
) != ARRAY_TYPE
);
5098 if (CLASSTYPE_LAZY_DEFAULT_CTOR (t
))
5100 if (!TYPE_HAS_COMPLEX_DFLT (t
))
5101 return trivial_default_constructor_is_constexpr (t
);
5102 /* Non-trivial, we need to check subobject constructors. */
5103 lazily_declare_fn (sfk_constructor
, t
);
5105 fns
= locate_ctor (t
);
5106 return (fns
&& DECL_DECLARED_CONSTEXPR_P (fns
));
5109 /* Returns true iff class TYPE has a virtual destructor. */
5112 type_has_virtual_destructor (tree type
)
5116 if (!CLASS_TYPE_P (type
))
5119 gcc_assert (COMPLETE_TYPE_P (type
));
5120 dtor
= CLASSTYPE_DESTRUCTORS (type
);
5121 return (dtor
&& DECL_VIRTUAL_P (dtor
));
5124 /* Returns true iff class T has a move constructor. */
5127 type_has_move_constructor (tree t
)
5131 if (CLASSTYPE_LAZY_MOVE_CTOR (t
))
5133 gcc_assert (COMPLETE_TYPE_P (t
));
5134 lazily_declare_fn (sfk_move_constructor
, t
);
5137 if (!CLASSTYPE_METHOD_VEC (t
))
5140 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5141 if (move_fn_p (OVL_CURRENT (fns
)))
5147 /* Returns true iff class T has a move assignment operator. */
5150 type_has_move_assign (tree t
)
5154 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
5156 gcc_assert (COMPLETE_TYPE_P (t
));
5157 lazily_declare_fn (sfk_move_assignment
, t
);
5160 for (fns
= lookup_fnfields_slot_nolazy (t
, ansi_assopname (NOP_EXPR
));
5161 fns
; fns
= OVL_NEXT (fns
))
5162 if (move_fn_p (OVL_CURRENT (fns
)))
5168 /* Returns true iff class T has a move constructor that was explicitly
5169 declared in the class body. Note that this is different from
5170 "user-provided", which doesn't include functions that are defaulted in
5174 type_has_user_declared_move_constructor (tree t
)
5178 if (CLASSTYPE_LAZY_MOVE_CTOR (t
))
5181 if (!CLASSTYPE_METHOD_VEC (t
))
5184 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5186 tree fn
= OVL_CURRENT (fns
);
5187 if (move_fn_p (fn
) && !DECL_ARTIFICIAL (fn
))
5194 /* Returns true iff class T has a move assignment operator that was
5195 explicitly declared in the class body. */
5198 type_has_user_declared_move_assign (tree t
)
5202 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
5205 for (fns
= lookup_fnfields_slot_nolazy (t
, ansi_assopname (NOP_EXPR
));
5206 fns
; fns
= OVL_NEXT (fns
))
5208 tree fn
= OVL_CURRENT (fns
);
5209 if (move_fn_p (fn
) && !DECL_ARTIFICIAL (fn
))
5216 /* Nonzero if we need to build up a constructor call when initializing an
5217 object of this class, either because it has a user-declared constructor
5218 or because it doesn't have a default constructor (so we need to give an
5219 error if no initializer is provided). Use TYPE_NEEDS_CONSTRUCTING when
5220 what you care about is whether or not an object can be produced by a
5221 constructor (e.g. so we don't set TREE_READONLY on const variables of
5222 such type); use this function when what you care about is whether or not
5223 to try to call a constructor to create an object. The latter case is
5224 the former plus some cases of constructors that cannot be called. */
5227 type_build_ctor_call (tree t
)
5230 if (TYPE_NEEDS_CONSTRUCTING (t
))
5232 inner
= strip_array_types (t
);
5233 if (!CLASS_TYPE_P (inner
) || ANON_AGGR_TYPE_P (inner
))
5235 if (!TYPE_HAS_DEFAULT_CONSTRUCTOR (inner
))
5237 if (cxx_dialect
< cxx11
)
5239 /* A user-declared constructor might be private, and a constructor might
5240 be trivial but deleted. */
5241 for (tree fns
= lookup_fnfields_slot (inner
, complete_ctor_identifier
);
5242 fns
; fns
= OVL_NEXT (fns
))
5244 tree fn
= OVL_CURRENT (fns
);
5245 if (!DECL_ARTIFICIAL (fn
)
5246 || DECL_DELETED_FN (fn
))
5252 /* Like type_build_ctor_call, but for destructors. */
5255 type_build_dtor_call (tree t
)
5258 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5260 inner
= strip_array_types (t
);
5261 if (!CLASS_TYPE_P (inner
) || ANON_AGGR_TYPE_P (inner
)
5262 || !COMPLETE_TYPE_P (inner
))
5264 if (cxx_dialect
< cxx11
)
5266 /* A user-declared destructor might be private, and a destructor might
5267 be trivial but deleted. */
5268 for (tree fns
= lookup_fnfields_slot (inner
, complete_dtor_identifier
);
5269 fns
; fns
= OVL_NEXT (fns
))
5271 tree fn
= OVL_CURRENT (fns
);
5272 if (!DECL_ARTIFICIAL (fn
)
5273 || DECL_DELETED_FN (fn
))
5279 /* Remove all zero-width bit-fields from T. */
5282 remove_zero_width_bit_fields (tree t
)
5286 fieldsp
= &TYPE_FIELDS (t
);
5289 if (TREE_CODE (*fieldsp
) == FIELD_DECL
5290 && DECL_C_BIT_FIELD (*fieldsp
)
5291 /* We should not be confused by the fact that grokbitfield
5292 temporarily sets the width of the bit field into
5293 DECL_INITIAL (*fieldsp).
5294 check_bitfield_decl eventually sets DECL_SIZE (*fieldsp)
5296 && integer_zerop (DECL_SIZE (*fieldsp
)))
5297 *fieldsp
= DECL_CHAIN (*fieldsp
);
5299 fieldsp
= &DECL_CHAIN (*fieldsp
);
5303 /* Returns TRUE iff we need a cookie when dynamically allocating an
5304 array whose elements have the indicated class TYPE. */
5307 type_requires_array_cookie (tree type
)
5310 bool has_two_argument_delete_p
= false;
5312 gcc_assert (CLASS_TYPE_P (type
));
5314 /* If there's a non-trivial destructor, we need a cookie. In order
5315 to iterate through the array calling the destructor for each
5316 element, we'll have to know how many elements there are. */
5317 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
5320 /* If the usual deallocation function is a two-argument whose second
5321 argument is of type `size_t', then we have to pass the size of
5322 the array to the deallocation function, so we will need to store
5324 fns
= lookup_fnfields (TYPE_BINFO (type
),
5325 ansi_opname (VEC_DELETE_EXPR
),
5327 /* If there are no `operator []' members, or the lookup is
5328 ambiguous, then we don't need a cookie. */
5329 if (!fns
|| fns
== error_mark_node
)
5331 /* Loop through all of the functions. */
5332 for (fns
= BASELINK_FUNCTIONS (fns
); fns
; fns
= OVL_NEXT (fns
))
5337 /* Select the current function. */
5338 fn
= OVL_CURRENT (fns
);
5339 /* See if this function is a one-argument delete function. If
5340 it is, then it will be the usual deallocation function. */
5341 second_parm
= TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (fn
)));
5342 if (second_parm
== void_list_node
)
5344 /* Do not consider this function if its second argument is an
5348 /* Otherwise, if we have a two-argument function and the second
5349 argument is `size_t', it will be the usual deallocation
5350 function -- unless there is one-argument function, too. */
5351 if (TREE_CHAIN (second_parm
) == void_list_node
5352 && same_type_p (TREE_VALUE (second_parm
), size_type_node
))
5353 has_two_argument_delete_p
= true;
5356 return has_two_argument_delete_p
;
5359 /* Finish computing the `literal type' property of class type T.
5361 At this point, we have already processed base classes and
5362 non-static data members. We need to check whether the copy
5363 constructor is trivial, the destructor is trivial, and there
5364 is a trivial default constructor or at least one constexpr
5365 constructor other than the copy constructor. */
5368 finalize_literal_type_property (tree t
)
5372 if (cxx_dialect
< cxx11
5373 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5374 CLASSTYPE_LITERAL_P (t
) = false;
5375 else if (CLASSTYPE_LITERAL_P (t
) && !TYPE_HAS_TRIVIAL_DFLT (t
)
5376 && CLASSTYPE_NON_AGGREGATE (t
)
5377 && !TYPE_HAS_CONSTEXPR_CTOR (t
))
5378 CLASSTYPE_LITERAL_P (t
) = false;
5380 if (!CLASSTYPE_LITERAL_P (t
))
5381 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5382 if (DECL_DECLARED_CONSTEXPR_P (fn
)
5383 && TREE_CODE (fn
) != TEMPLATE_DECL
5384 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
5385 && !DECL_CONSTRUCTOR_P (fn
))
5387 DECL_DECLARED_CONSTEXPR_P (fn
) = false;
5388 if (!DECL_GENERATED_P (fn
))
5390 error ("enclosing class of constexpr non-static member "
5391 "function %q+#D is not a literal type", fn
);
5392 explain_non_literal_class (t
);
5397 /* T is a non-literal type used in a context which requires a constant
5398 expression. Explain why it isn't literal. */
5401 explain_non_literal_class (tree t
)
5403 static struct pointer_set_t
*diagnosed
;
5405 if (!CLASS_TYPE_P (t
))
5407 t
= TYPE_MAIN_VARIANT (t
);
5409 if (diagnosed
== NULL
)
5410 diagnosed
= pointer_set_create ();
5411 if (pointer_set_insert (diagnosed
, t
) != 0)
5412 /* Already explained. */
5415 inform (0, "%q+T is not literal because:", t
);
5416 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5417 inform (0, " %q+T has a non-trivial destructor", t
);
5418 else if (CLASSTYPE_NON_AGGREGATE (t
)
5419 && !TYPE_HAS_TRIVIAL_DFLT (t
)
5420 && !TYPE_HAS_CONSTEXPR_CTOR (t
))
5422 inform (0, " %q+T is not an aggregate, does not have a trivial "
5423 "default constructor, and has no constexpr constructor that "
5424 "is not a copy or move constructor", t
);
5425 if (TYPE_HAS_DEFAULT_CONSTRUCTOR (t
)
5426 && !type_has_user_provided_default_constructor (t
))
5428 /* Note that we can't simply call locate_ctor because when the
5429 constructor is deleted it just returns NULL_TREE. */
5431 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5433 tree fn
= OVL_CURRENT (fns
);
5434 tree parms
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5436 parms
= skip_artificial_parms_for (fn
, parms
);
5438 if (sufficient_parms_p (parms
))
5440 if (DECL_DELETED_FN (fn
))
5441 maybe_explain_implicit_delete (fn
);
5443 explain_invalid_constexpr_fn (fn
);
5451 tree binfo
, base_binfo
, field
; int i
;
5452 for (binfo
= TYPE_BINFO (t
), i
= 0;
5453 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
5455 tree basetype
= TREE_TYPE (base_binfo
);
5456 if (!CLASSTYPE_LITERAL_P (basetype
))
5458 inform (0, " base class %qT of %q+T is non-literal",
5460 explain_non_literal_class (basetype
);
5464 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
5467 if (TREE_CODE (field
) != FIELD_DECL
)
5469 ftype
= TREE_TYPE (field
);
5470 if (!literal_type_p (ftype
))
5472 inform (0, " non-static data member %q+D has "
5473 "non-literal type", field
);
5474 if (CLASS_TYPE_P (ftype
))
5475 explain_non_literal_class (ftype
);
5481 /* Check the validity of the bases and members declared in T. Add any
5482 implicitly-generated functions (like copy-constructors and
5483 assignment operators). Compute various flag bits (like
5484 CLASSTYPE_NON_LAYOUT_POD_T) for T. This routine works purely at the C++
5485 level: i.e., independently of the ABI in use. */
5488 check_bases_and_members (tree t
)
5490 /* Nonzero if the implicitly generated copy constructor should take
5491 a non-const reference argument. */
5492 int cant_have_const_ctor
;
5493 /* Nonzero if the implicitly generated assignment operator
5494 should take a non-const reference argument. */
5495 int no_const_asn_ref
;
5497 bool saved_complex_asn_ref
;
5498 bool saved_nontrivial_dtor
;
5501 /* Pick up any abi_tags from our template arguments before checking. */
5502 inherit_targ_abi_tags (t
);
5504 /* By default, we use const reference arguments and generate default
5506 cant_have_const_ctor
= 0;
5507 no_const_asn_ref
= 0;
5509 /* Check all the base-classes. */
5510 check_bases (t
, &cant_have_const_ctor
,
5513 /* Deduce noexcept on destructors. This needs to happen after we've set
5514 triviality flags appropriately for our bases. */
5515 if (cxx_dialect
>= cxx11
)
5516 deduce_noexcept_on_destructors (t
);
5518 /* Check all the method declarations. */
5521 /* Save the initial values of these flags which only indicate whether
5522 or not the class has user-provided functions. As we analyze the
5523 bases and members we can set these flags for other reasons. */
5524 saved_complex_asn_ref
= TYPE_HAS_COMPLEX_COPY_ASSIGN (t
);
5525 saved_nontrivial_dtor
= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
);
5527 /* Check all the data member declarations. We cannot call
5528 check_field_decls until we have called check_bases check_methods,
5529 as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR
5530 being set appropriately. */
5531 check_field_decls (t
, &access_decls
,
5532 &cant_have_const_ctor
,
5535 /* A nearly-empty class has to be vptr-containing; a nearly empty
5536 class contains just a vptr. */
5537 if (!TYPE_CONTAINS_VPTR_P (t
))
5538 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
5540 /* Do some bookkeeping that will guide the generation of implicitly
5541 declared member functions. */
5542 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5543 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5544 /* We need to call a constructor for this class if it has a
5545 user-provided constructor, or if the default constructor is going
5546 to initialize the vptr. (This is not an if-and-only-if;
5547 TYPE_NEEDS_CONSTRUCTING is set elsewhere if bases or members
5548 themselves need constructing.) */
5549 TYPE_NEEDS_CONSTRUCTING (t
)
5550 |= (type_has_user_provided_constructor (t
) || TYPE_CONTAINS_VPTR_P (t
));
5553 An aggregate is an array or a class with no user-provided
5554 constructors ... and no virtual functions.
5556 Again, other conditions for being an aggregate are checked
5558 CLASSTYPE_NON_AGGREGATE (t
)
5559 |= (type_has_user_provided_constructor (t
) || TYPE_POLYMORPHIC_P (t
));
5560 /* This is the C++98/03 definition of POD; it changed in C++0x, but we
5561 retain the old definition internally for ABI reasons. */
5562 CLASSTYPE_NON_LAYOUT_POD_P (t
)
5563 |= (CLASSTYPE_NON_AGGREGATE (t
)
5564 || saved_nontrivial_dtor
|| saved_complex_asn_ref
);
5565 CLASSTYPE_NON_STD_LAYOUT (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5566 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5567 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5568 TYPE_HAS_COMPLEX_DFLT (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5570 /* Warn if a public base of a polymorphic type has an accessible
5571 non-virtual destructor. It is only now that we know the class is
5572 polymorphic. Although a polymorphic base will have a already
5573 been diagnosed during its definition, we warn on use too. */
5574 if (TYPE_POLYMORPHIC_P (t
) && warn_nonvdtor
)
5576 tree binfo
= TYPE_BINFO (t
);
5577 vec
<tree
, va_gc
> *accesses
= BINFO_BASE_ACCESSES (binfo
);
5581 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
5583 tree basetype
= TREE_TYPE (base_binfo
);
5585 if ((*accesses
)[i
] == access_public_node
5586 && (TYPE_POLYMORPHIC_P (basetype
) || warn_ecpp
)
5587 && accessible_nvdtor_p (basetype
))
5588 warning (OPT_Wnon_virtual_dtor
,
5589 "base class %q#T has accessible non-virtual destructor",
5594 /* If the class has no user-declared constructor, but does have
5595 non-static const or reference data members that can never be
5596 initialized, issue a warning. */
5597 if (warn_uninitialized
5598 /* Classes with user-declared constructors are presumed to
5599 initialize these members. */
5600 && !TYPE_HAS_USER_CONSTRUCTOR (t
)
5601 /* Aggregates can be initialized with brace-enclosed
5603 && CLASSTYPE_NON_AGGREGATE (t
))
5607 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
5611 if (TREE_CODE (field
) != FIELD_DECL
5612 || DECL_INITIAL (field
) != NULL_TREE
)
5615 type
= TREE_TYPE (field
);
5616 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5617 warning (OPT_Wuninitialized
, "non-static reference %q+#D "
5618 "in class without a constructor", field
);
5619 else if (CP_TYPE_CONST_P (type
)
5620 && (!CLASS_TYPE_P (type
)
5621 || !TYPE_HAS_DEFAULT_CONSTRUCTOR (type
)))
5622 warning (OPT_Wuninitialized
, "non-static const member %q+#D "
5623 "in class without a constructor", field
);
5627 /* Synthesize any needed methods. */
5628 add_implicitly_declared_members (t
, &access_decls
,
5629 cant_have_const_ctor
,
5632 /* Check defaulted declarations here so we have cant_have_const_ctor
5633 and don't need to worry about clones. */
5634 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5635 if (!DECL_ARTIFICIAL (fn
) && DECL_DEFAULTED_IN_CLASS_P (fn
))
5637 int copy
= copy_fn_p (fn
);
5641 = (DECL_CONSTRUCTOR_P (fn
) ? !cant_have_const_ctor
5642 : !no_const_asn_ref
);
5643 bool fn_const_p
= (copy
== 2);
5645 if (fn_const_p
&& !imp_const_p
)
5646 /* If the function is defaulted outside the class, we just
5647 give the synthesis error. */
5648 error ("%q+D declared to take const reference, but implicit "
5649 "declaration would take non-const", fn
);
5651 defaulted_late_check (fn
);
5654 if (LAMBDA_TYPE_P (t
))
5656 /* "The closure type associated with a lambda-expression has a deleted
5657 default constructor and a deleted copy assignment operator." */
5658 TYPE_NEEDS_CONSTRUCTING (t
) = 1;
5659 TYPE_HAS_COMPLEX_DFLT (t
) = 1;
5660 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
5661 CLASSTYPE_LAZY_MOVE_ASSIGN (t
) = 0;
5663 /* "This class type is not an aggregate." */
5664 CLASSTYPE_NON_AGGREGATE (t
) = 1;
5667 /* Compute the 'literal type' property before we
5668 do anything with non-static member functions. */
5669 finalize_literal_type_property (t
);
5671 /* Create the in-charge and not-in-charge variants of constructors
5673 clone_constructors_and_destructors (t
);
5675 /* Process the using-declarations. */
5676 for (; access_decls
; access_decls
= TREE_CHAIN (access_decls
))
5677 handle_using_decl (TREE_VALUE (access_decls
), t
);
5679 /* Build and sort the CLASSTYPE_METHOD_VEC. */
5680 finish_struct_methods (t
);
5682 /* Figure out whether or not we will need a cookie when dynamically
5683 allocating an array of this type. */
5684 TYPE_LANG_SPECIFIC (t
)->u
.c
.vec_new_uses_cookie
5685 = type_requires_array_cookie (t
);
5688 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
5689 accordingly. If a new vfield was created (because T doesn't have a
5690 primary base class), then the newly created field is returned. It
5691 is not added to the TYPE_FIELDS list; it is the caller's
5692 responsibility to do that. Accumulate declared virtual functions
5696 create_vtable_ptr (tree t
, tree
* virtuals_p
)
5700 /* Collect the virtual functions declared in T. */
5701 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5702 if (DECL_VINDEX (fn
) && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn
)
5703 && TREE_CODE (DECL_VINDEX (fn
)) != INTEGER_CST
)
5705 tree new_virtual
= make_node (TREE_LIST
);
5707 BV_FN (new_virtual
) = fn
;
5708 BV_DELTA (new_virtual
) = integer_zero_node
;
5709 BV_VCALL_INDEX (new_virtual
) = NULL_TREE
;
5711 TREE_CHAIN (new_virtual
) = *virtuals_p
;
5712 *virtuals_p
= new_virtual
;
5715 /* If we couldn't find an appropriate base class, create a new field
5716 here. Even if there weren't any new virtual functions, we might need a
5717 new virtual function table if we're supposed to include vptrs in
5718 all classes that need them. */
5719 if (!TYPE_VFIELD (t
) && (*virtuals_p
|| TYPE_CONTAINS_VPTR_P (t
)))
5721 /* We build this decl with vtbl_ptr_type_node, which is a
5722 `vtable_entry_type*'. It might seem more precise to use
5723 `vtable_entry_type (*)[N]' where N is the number of virtual
5724 functions. However, that would require the vtable pointer in
5725 base classes to have a different type than the vtable pointer
5726 in derived classes. We could make that happen, but that
5727 still wouldn't solve all the problems. In particular, the
5728 type-based alias analysis code would decide that assignments
5729 to the base class vtable pointer can't alias assignments to
5730 the derived class vtable pointer, since they have different
5731 types. Thus, in a derived class destructor, where the base
5732 class constructor was inlined, we could generate bad code for
5733 setting up the vtable pointer.
5735 Therefore, we use one type for all vtable pointers. We still
5736 use a type-correct type; it's just doesn't indicate the array
5737 bounds. That's better than using `void*' or some such; it's
5738 cleaner, and it let's the alias analysis code know that these
5739 stores cannot alias stores to void*! */
5742 field
= build_decl (input_location
,
5743 FIELD_DECL
, get_vfield_name (t
), vtbl_ptr_type_node
);
5744 DECL_VIRTUAL_P (field
) = 1;
5745 DECL_ARTIFICIAL (field
) = 1;
5746 DECL_FIELD_CONTEXT (field
) = t
;
5747 DECL_FCONTEXT (field
) = t
;
5748 if (TYPE_PACKED (t
))
5749 DECL_PACKED (field
) = 1;
5751 TYPE_VFIELD (t
) = field
;
5753 /* This class is non-empty. */
5754 CLASSTYPE_EMPTY_P (t
) = 0;
5762 /* Add OFFSET to all base types of BINFO which is a base in the
5763 hierarchy dominated by T.
5765 OFFSET, which is a type offset, is number of bytes. */
5768 propagate_binfo_offsets (tree binfo
, tree offset
)
5774 /* Update BINFO's offset. */
5775 BINFO_OFFSET (binfo
)
5776 = convert (sizetype
,
5777 size_binop (PLUS_EXPR
,
5778 convert (ssizetype
, BINFO_OFFSET (binfo
)),
5781 /* Find the primary base class. */
5782 primary_binfo
= get_primary_binfo (binfo
);
5784 if (primary_binfo
&& BINFO_INHERITANCE_CHAIN (primary_binfo
) == binfo
)
5785 propagate_binfo_offsets (primary_binfo
, offset
);
5787 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
5789 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5791 /* Don't do the primary base twice. */
5792 if (base_binfo
== primary_binfo
)
5795 if (BINFO_VIRTUAL_P (base_binfo
))
5798 propagate_binfo_offsets (base_binfo
, offset
);
5802 /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update
5803 TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of
5804 empty subobjects of T. */
5807 layout_virtual_bases (record_layout_info rli
, splay_tree offsets
)
5811 bool first_vbase
= true;
5814 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t
)) == 0)
5817 if (!abi_version_at_least(2))
5819 /* In G++ 3.2, we incorrectly rounded the size before laying out
5820 the virtual bases. */
5821 finish_record_layout (rli
, /*free_p=*/false);
5822 #ifdef STRUCTURE_SIZE_BOUNDARY
5823 /* Packed structures don't need to have minimum size. */
5824 if (! TYPE_PACKED (t
))
5825 TYPE_ALIGN (t
) = MAX (TYPE_ALIGN (t
), (unsigned) STRUCTURE_SIZE_BOUNDARY
);
5827 rli
->offset
= TYPE_SIZE_UNIT (t
);
5828 rli
->bitpos
= bitsize_zero_node
;
5829 rli
->record_align
= TYPE_ALIGN (t
);
5832 /* Find the last field. The artificial fields created for virtual
5833 bases will go after the last extant field to date. */
5834 next_field
= &TYPE_FIELDS (t
);
5836 next_field
= &DECL_CHAIN (*next_field
);
5838 /* Go through the virtual bases, allocating space for each virtual
5839 base that is not already a primary base class. These are
5840 allocated in inheritance graph order. */
5841 for (vbase
= TYPE_BINFO (t
); vbase
; vbase
= TREE_CHAIN (vbase
))
5843 if (!BINFO_VIRTUAL_P (vbase
))
5846 if (!BINFO_PRIMARY_P (vbase
))
5848 tree basetype
= TREE_TYPE (vbase
);
5850 /* This virtual base is not a primary base of any class in the
5851 hierarchy, so we have to add space for it. */
5852 next_field
= build_base_field (rli
, vbase
,
5853 offsets
, next_field
);
5855 /* If the first virtual base might have been placed at a
5856 lower address, had we started from CLASSTYPE_SIZE, rather
5857 than TYPE_SIZE, issue a warning. There can be both false
5858 positives and false negatives from this warning in rare
5859 cases; to deal with all the possibilities would probably
5860 require performing both layout algorithms and comparing
5861 the results which is not particularly tractable. */
5865 (size_binop (CEIL_DIV_EXPR
,
5866 round_up_loc (input_location
,
5868 CLASSTYPE_ALIGN (basetype
)),
5870 BINFO_OFFSET (vbase
))))
5872 "offset of virtual base %qT is not ABI-compliant and "
5873 "may change in a future version of GCC",
5876 first_vbase
= false;
5881 /* Returns the offset of the byte just past the end of the base class
5885 end_of_base (tree binfo
)
5889 if (!CLASSTYPE_AS_BASE (BINFO_TYPE (binfo
)))
5890 size
= TYPE_SIZE_UNIT (char_type_node
);
5891 else if (is_empty_class (BINFO_TYPE (binfo
)))
5892 /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to
5893 allocate some space for it. It cannot have virtual bases, so
5894 TYPE_SIZE_UNIT is fine. */
5895 size
= TYPE_SIZE_UNIT (BINFO_TYPE (binfo
));
5897 size
= CLASSTYPE_SIZE_UNIT (BINFO_TYPE (binfo
));
5899 return size_binop (PLUS_EXPR
, BINFO_OFFSET (binfo
), size
);
5902 /* Returns the offset of the byte just past the end of the base class
5903 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
5904 only non-virtual bases are included. */
5907 end_of_class (tree t
, int include_virtuals_p
)
5909 tree result
= size_zero_node
;
5910 vec
<tree
, va_gc
> *vbases
;
5916 for (binfo
= TYPE_BINFO (t
), i
= 0;
5917 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5919 if (!include_virtuals_p
5920 && BINFO_VIRTUAL_P (base_binfo
)
5921 && (!BINFO_PRIMARY_P (base_binfo
)
5922 || BINFO_INHERITANCE_CHAIN (base_binfo
) != TYPE_BINFO (t
)))
5925 offset
= end_of_base (base_binfo
);
5926 if (tree_int_cst_lt (result
, offset
))
5930 /* G++ 3.2 did not check indirect virtual bases. */
5931 if (abi_version_at_least (2) && include_virtuals_p
)
5932 for (vbases
= CLASSTYPE_VBASECLASSES (t
), i
= 0;
5933 vec_safe_iterate (vbases
, i
, &base_binfo
); i
++)
5935 offset
= end_of_base (base_binfo
);
5936 if (tree_int_cst_lt (result
, offset
))
5943 /* Warn about bases of T that are inaccessible because they are
5944 ambiguous. For example:
5947 struct T : public S {};
5948 struct U : public S, public T {};
5950 Here, `(S*) new U' is not allowed because there are two `S'
5954 warn_about_ambiguous_bases (tree t
)
5957 vec
<tree
, va_gc
> *vbases
;
5962 /* If there are no repeated bases, nothing can be ambiguous. */
5963 if (!CLASSTYPE_REPEATED_BASE_P (t
))
5966 /* Check direct bases. */
5967 for (binfo
= TYPE_BINFO (t
), i
= 0;
5968 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5970 basetype
= BINFO_TYPE (base_binfo
);
5972 if (!uniquely_derived_from_p (basetype
, t
))
5973 warning (0, "direct base %qT inaccessible in %qT due to ambiguity",
5977 /* Check for ambiguous virtual bases. */
5979 for (vbases
= CLASSTYPE_VBASECLASSES (t
), i
= 0;
5980 vec_safe_iterate (vbases
, i
, &binfo
); i
++)
5982 basetype
= BINFO_TYPE (binfo
);
5984 if (!uniquely_derived_from_p (basetype
, t
))
5985 warning (OPT_Wextra
, "virtual base %qT inaccessible in %qT due "
5986 "to ambiguity", basetype
, t
);
5990 /* Compare two INTEGER_CSTs K1 and K2. */
5993 splay_tree_compare_integer_csts (splay_tree_key k1
, splay_tree_key k2
)
5995 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
5998 /* Increase the size indicated in RLI to account for empty classes
5999 that are "off the end" of the class. */
6002 include_empty_classes (record_layout_info rli
)
6007 /* It might be the case that we grew the class to allocate a
6008 zero-sized base class. That won't be reflected in RLI, yet,
6009 because we are willing to overlay multiple bases at the same
6010 offset. However, now we need to make sure that RLI is big enough
6011 to reflect the entire class. */
6012 eoc
= end_of_class (rli
->t
,
6013 CLASSTYPE_AS_BASE (rli
->t
) != NULL_TREE
);
6014 rli_size
= rli_size_unit_so_far (rli
);
6015 if (TREE_CODE (rli_size
) == INTEGER_CST
6016 && tree_int_cst_lt (rli_size
, eoc
))
6018 if (!abi_version_at_least (2))
6019 /* In version 1 of the ABI, the size of a class that ends with
6020 a bitfield was not rounded up to a whole multiple of a
6021 byte. Because rli_size_unit_so_far returns only the number
6022 of fully allocated bytes, any extra bits were not included
6024 rli
->bitpos
= round_down (rli
->bitpos
, BITS_PER_UNIT
);
6026 /* The size should have been rounded to a whole byte. */
6027 gcc_assert (tree_int_cst_equal
6028 (rli
->bitpos
, round_down (rli
->bitpos
, BITS_PER_UNIT
)));
6030 = size_binop (PLUS_EXPR
,
6032 size_binop (MULT_EXPR
,
6033 convert (bitsizetype
,
6034 size_binop (MINUS_EXPR
,
6036 bitsize_int (BITS_PER_UNIT
)));
6037 normalize_rli (rli
);
6041 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
6042 BINFO_OFFSETs for all of the base-classes. Position the vtable
6043 pointer. Accumulate declared virtual functions on VIRTUALS_P. */
6046 layout_class_type (tree t
, tree
*virtuals_p
)
6048 tree non_static_data_members
;
6051 record_layout_info rli
;
6052 /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of
6053 types that appear at that offset. */
6054 splay_tree empty_base_offsets
;
6055 /* True if the last field laid out was a bit-field. */
6056 bool last_field_was_bitfield
= false;
6057 /* The location at which the next field should be inserted. */
6059 /* T, as a base class. */
6062 /* Keep track of the first non-static data member. */
6063 non_static_data_members
= TYPE_FIELDS (t
);
6065 /* Start laying out the record. */
6066 rli
= start_record_layout (t
);
6068 /* Mark all the primary bases in the hierarchy. */
6069 determine_primary_bases (t
);
6071 /* Create a pointer to our virtual function table. */
6072 vptr
= create_vtable_ptr (t
, virtuals_p
);
6074 /* The vptr is always the first thing in the class. */
6077 DECL_CHAIN (vptr
) = TYPE_FIELDS (t
);
6078 TYPE_FIELDS (t
) = vptr
;
6079 next_field
= &DECL_CHAIN (vptr
);
6080 place_field (rli
, vptr
);
6083 next_field
= &TYPE_FIELDS (t
);
6085 /* Build FIELD_DECLs for all of the non-virtual base-types. */
6086 empty_base_offsets
= splay_tree_new (splay_tree_compare_integer_csts
,
6088 build_base_fields (rli
, empty_base_offsets
, next_field
);
6090 /* Layout the non-static data members. */
6091 for (field
= non_static_data_members
; field
; field
= DECL_CHAIN (field
))
6096 /* We still pass things that aren't non-static data members to
6097 the back end, in case it wants to do something with them. */
6098 if (TREE_CODE (field
) != FIELD_DECL
)
6100 place_field (rli
, field
);
6101 /* If the static data member has incomplete type, keep track
6102 of it so that it can be completed later. (The handling
6103 of pending statics in finish_record_layout is
6104 insufficient; consider:
6107 struct S2 { static S1 s1; };
6109 At this point, finish_record_layout will be called, but
6110 S1 is still incomplete.) */
6113 maybe_register_incomplete_var (field
);
6114 /* The visibility of static data members is determined
6115 at their point of declaration, not their point of
6117 determine_visibility (field
);
6122 type
= TREE_TYPE (field
);
6123 if (type
== error_mark_node
)
6126 padding
= NULL_TREE
;
6128 /* If this field is a bit-field whose width is greater than its
6129 type, then there are some special rules for allocating
6131 if (DECL_C_BIT_FIELD (field
)
6132 && tree_int_cst_lt (TYPE_SIZE (type
), DECL_SIZE (field
)))
6136 bool was_unnamed_p
= false;
6137 /* We must allocate the bits as if suitably aligned for the
6138 longest integer type that fits in this many bits. type
6139 of the field. Then, we are supposed to use the left over
6140 bits as additional padding. */
6141 for (itk
= itk_char
; itk
!= itk_none
; ++itk
)
6142 if (integer_types
[itk
] != NULL_TREE
6143 && (tree_int_cst_lt (size_int (MAX_FIXED_MODE_SIZE
),
6144 TYPE_SIZE (integer_types
[itk
]))
6145 || tree_int_cst_lt (DECL_SIZE (field
),
6146 TYPE_SIZE (integer_types
[itk
]))))
6149 /* ITK now indicates a type that is too large for the
6150 field. We have to back up by one to find the largest
6155 integer_type
= integer_types
[itk
];
6156 } while (itk
> 0 && integer_type
== NULL_TREE
);
6158 /* Figure out how much additional padding is required. GCC
6159 3.2 always created a padding field, even if it had zero
6161 if (!abi_version_at_least (2)
6162 || tree_int_cst_lt (TYPE_SIZE (integer_type
), DECL_SIZE (field
)))
6164 if (abi_version_at_least (2) && TREE_CODE (t
) == UNION_TYPE
)
6165 /* In a union, the padding field must have the full width
6166 of the bit-field; all fields start at offset zero. */
6167 padding
= DECL_SIZE (field
);
6170 if (TREE_CODE (t
) == UNION_TYPE
)
6171 warning (OPT_Wabi
, "size assigned to %qT may not be "
6172 "ABI-compliant and may change in a future "
6175 padding
= size_binop (MINUS_EXPR
, DECL_SIZE (field
),
6176 TYPE_SIZE (integer_type
));
6179 #ifdef PCC_BITFIELD_TYPE_MATTERS
6180 /* An unnamed bitfield does not normally affect the
6181 alignment of the containing class on a target where
6182 PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not
6183 make any exceptions for unnamed bitfields when the
6184 bitfields are longer than their types. Therefore, we
6185 temporarily give the field a name. */
6186 if (PCC_BITFIELD_TYPE_MATTERS
&& !DECL_NAME (field
))
6188 was_unnamed_p
= true;
6189 DECL_NAME (field
) = make_anon_name ();
6192 DECL_SIZE (field
) = TYPE_SIZE (integer_type
);
6193 DECL_ALIGN (field
) = TYPE_ALIGN (integer_type
);
6194 DECL_USER_ALIGN (field
) = TYPE_USER_ALIGN (integer_type
);
6195 layout_nonempty_base_or_field (rli
, field
, NULL_TREE
,
6196 empty_base_offsets
);
6198 DECL_NAME (field
) = NULL_TREE
;
6199 /* Now that layout has been performed, set the size of the
6200 field to the size of its declared type; the rest of the
6201 field is effectively invisible. */
6202 DECL_SIZE (field
) = TYPE_SIZE (type
);
6203 /* We must also reset the DECL_MODE of the field. */
6204 if (abi_version_at_least (2))
6205 DECL_MODE (field
) = TYPE_MODE (type
);
6207 && DECL_MODE (field
) != TYPE_MODE (type
))
6208 /* Versions of G++ before G++ 3.4 did not reset the
6211 "the offset of %qD may not be ABI-compliant and may "
6212 "change in a future version of GCC", field
);
6215 layout_nonempty_base_or_field (rli
, field
, NULL_TREE
,
6216 empty_base_offsets
);
6218 /* Remember the location of any empty classes in FIELD. */
6219 if (abi_version_at_least (2))
6220 record_subobject_offsets (TREE_TYPE (field
),
6221 byte_position(field
),
6223 /*is_data_member=*/true);
6225 /* If a bit-field does not immediately follow another bit-field,
6226 and yet it starts in the middle of a byte, we have failed to
6227 comply with the ABI. */
6229 && DECL_C_BIT_FIELD (field
)
6230 /* The TREE_NO_WARNING flag gets set by Objective-C when
6231 laying out an Objective-C class. The ObjC ABI differs
6232 from the C++ ABI, and so we do not want a warning
6234 && !TREE_NO_WARNING (field
)
6235 && !last_field_was_bitfield
6236 && !integer_zerop (size_binop (TRUNC_MOD_EXPR
,
6237 DECL_FIELD_BIT_OFFSET (field
),
6238 bitsize_unit_node
)))
6239 warning (OPT_Wabi
, "offset of %q+D is not ABI-compliant and may "
6240 "change in a future version of GCC", field
);
6242 /* G++ used to use DECL_FIELD_OFFSET as if it were the byte
6243 offset of the field. */
6245 && !abi_version_at_least (2)
6246 && !tree_int_cst_equal (DECL_FIELD_OFFSET (field
),
6247 byte_position (field
))
6248 && contains_empty_class_p (TREE_TYPE (field
)))
6249 warning (OPT_Wabi
, "%q+D contains empty classes which may cause base "
6250 "classes to be placed at different locations in a "
6251 "future version of GCC", field
);
6253 /* The middle end uses the type of expressions to determine the
6254 possible range of expression values. In order to optimize
6255 "x.i > 7" to "false" for a 2-bit bitfield "i", the middle end
6256 must be made aware of the width of "i", via its type.
6258 Because C++ does not have integer types of arbitrary width,
6259 we must (for the purposes of the front end) convert from the
6260 type assigned here to the declared type of the bitfield
6261 whenever a bitfield expression is used as an rvalue.
6262 Similarly, when assigning a value to a bitfield, the value
6263 must be converted to the type given the bitfield here. */
6264 if (DECL_C_BIT_FIELD (field
))
6266 unsigned HOST_WIDE_INT width
;
6267 tree ftype
= TREE_TYPE (field
);
6268 width
= tree_to_uhwi (DECL_SIZE (field
));
6269 if (width
!= TYPE_PRECISION (ftype
))
6272 = c_build_bitfield_integer_type (width
,
6273 TYPE_UNSIGNED (ftype
));
6275 = cp_build_qualified_type (TREE_TYPE (field
),
6276 cp_type_quals (ftype
));
6280 /* If we needed additional padding after this field, add it
6286 padding_field
= build_decl (input_location
,
6290 DECL_BIT_FIELD (padding_field
) = 1;
6291 DECL_SIZE (padding_field
) = padding
;
6292 DECL_CONTEXT (padding_field
) = t
;
6293 DECL_ARTIFICIAL (padding_field
) = 1;
6294 DECL_IGNORED_P (padding_field
) = 1;
6295 layout_nonempty_base_or_field (rli
, padding_field
,
6297 empty_base_offsets
);
6300 last_field_was_bitfield
= DECL_C_BIT_FIELD (field
);
6303 if (abi_version_at_least (2) && !integer_zerop (rli
->bitpos
))
6305 /* Make sure that we are on a byte boundary so that the size of
6306 the class without virtual bases will always be a round number
6308 rli
->bitpos
= round_up_loc (input_location
, rli
->bitpos
, BITS_PER_UNIT
);
6309 normalize_rli (rli
);
6312 /* G++ 3.2 does not allow virtual bases to be overlaid with tail
6314 if (!abi_version_at_least (2))
6315 include_empty_classes(rli
);
6317 /* Delete all zero-width bit-fields from the list of fields. Now
6318 that the type is laid out they are no longer important. */
6319 remove_zero_width_bit_fields (t
);
6321 /* Create the version of T used for virtual bases. We do not use
6322 make_class_type for this version; this is an artificial type. For
6323 a POD type, we just reuse T. */
6324 if (CLASSTYPE_NON_LAYOUT_POD_P (t
) || CLASSTYPE_EMPTY_P (t
))
6326 base_t
= make_node (TREE_CODE (t
));
6328 /* Set the size and alignment for the new type. In G++ 3.2, all
6329 empty classes were considered to have size zero when used as
6331 if (!abi_version_at_least (2) && CLASSTYPE_EMPTY_P (t
))
6333 TYPE_SIZE (base_t
) = bitsize_zero_node
;
6334 TYPE_SIZE_UNIT (base_t
) = size_zero_node
;
6335 if (warn_abi
&& !integer_zerop (rli_size_unit_so_far (rli
)))
6337 "layout of classes derived from empty class %qT "
6338 "may change in a future version of GCC",
6345 /* If the ABI version is not at least two, and the last
6346 field was a bit-field, RLI may not be on a byte
6347 boundary. In particular, rli_size_unit_so_far might
6348 indicate the last complete byte, while rli_size_so_far
6349 indicates the total number of bits used. Therefore,
6350 rli_size_so_far, rather than rli_size_unit_so_far, is
6351 used to compute TYPE_SIZE_UNIT. */
6352 eoc
= end_of_class (t
, /*include_virtuals_p=*/0);
6353 TYPE_SIZE_UNIT (base_t
)
6354 = size_binop (MAX_EXPR
,
6356 size_binop (CEIL_DIV_EXPR
,
6357 rli_size_so_far (rli
),
6358 bitsize_int (BITS_PER_UNIT
))),
6361 = size_binop (MAX_EXPR
,
6362 rli_size_so_far (rli
),
6363 size_binop (MULT_EXPR
,
6364 convert (bitsizetype
, eoc
),
6365 bitsize_int (BITS_PER_UNIT
)));
6367 TYPE_ALIGN (base_t
) = rli
->record_align
;
6368 TYPE_USER_ALIGN (base_t
) = TYPE_USER_ALIGN (t
);
6370 /* Copy the fields from T. */
6371 next_field
= &TYPE_FIELDS (base_t
);
6372 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
6373 if (TREE_CODE (field
) == FIELD_DECL
)
6375 *next_field
= build_decl (input_location
,
6379 DECL_CONTEXT (*next_field
) = base_t
;
6380 DECL_FIELD_OFFSET (*next_field
) = DECL_FIELD_OFFSET (field
);
6381 DECL_FIELD_BIT_OFFSET (*next_field
)
6382 = DECL_FIELD_BIT_OFFSET (field
);
6383 DECL_SIZE (*next_field
) = DECL_SIZE (field
);
6384 DECL_MODE (*next_field
) = DECL_MODE (field
);
6385 next_field
= &DECL_CHAIN (*next_field
);
6388 /* Record the base version of the type. */
6389 CLASSTYPE_AS_BASE (t
) = base_t
;
6390 TYPE_CONTEXT (base_t
) = t
;
6393 CLASSTYPE_AS_BASE (t
) = t
;
6395 /* Every empty class contains an empty class. */
6396 if (CLASSTYPE_EMPTY_P (t
))
6397 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 1;
6399 /* Set the TYPE_DECL for this type to contain the right
6400 value for DECL_OFFSET, so that we can use it as part
6401 of a COMPONENT_REF for multiple inheritance. */
6402 layout_decl (TYPE_MAIN_DECL (t
), 0);
6404 /* Now fix up any virtual base class types that we left lying
6405 around. We must get these done before we try to lay out the
6406 virtual function table. As a side-effect, this will remove the
6407 base subobject fields. */
6408 layout_virtual_bases (rli
, empty_base_offsets
);
6410 /* Make sure that empty classes are reflected in RLI at this
6412 include_empty_classes(rli
);
6414 /* Make sure not to create any structures with zero size. */
6415 if (integer_zerop (rli_size_unit_so_far (rli
)) && CLASSTYPE_EMPTY_P (t
))
6417 build_decl (input_location
,
6418 FIELD_DECL
, NULL_TREE
, char_type_node
));
6420 /* If this is a non-POD, declaring it packed makes a difference to how it
6421 can be used as a field; don't let finalize_record_size undo it. */
6422 if (TYPE_PACKED (t
) && !layout_pod_type_p (t
))
6423 rli
->packed_maybe_necessary
= true;
6425 /* Let the back end lay out the type. */
6426 finish_record_layout (rli
, /*free_p=*/true);
6428 if (TYPE_SIZE_UNIT (t
)
6429 && TREE_CODE (TYPE_SIZE_UNIT (t
)) == INTEGER_CST
6430 && !TREE_OVERFLOW (TYPE_SIZE_UNIT (t
))
6431 && !valid_constant_size_p (TYPE_SIZE_UNIT (t
)))
6432 error ("type %qT is too large", t
);
6434 /* Warn about bases that can't be talked about due to ambiguity. */
6435 warn_about_ambiguous_bases (t
);
6437 /* Now that we're done with layout, give the base fields the real types. */
6438 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
6439 if (DECL_ARTIFICIAL (field
) && IS_FAKE_BASE_TYPE (TREE_TYPE (field
)))
6440 TREE_TYPE (field
) = TYPE_CONTEXT (TREE_TYPE (field
));
6443 splay_tree_delete (empty_base_offsets
);
6445 if (CLASSTYPE_EMPTY_P (t
)
6446 && tree_int_cst_lt (sizeof_biggest_empty_class
,
6447 TYPE_SIZE_UNIT (t
)))
6448 sizeof_biggest_empty_class
= TYPE_SIZE_UNIT (t
);
6451 /* Determine the "key method" for the class type indicated by TYPE,
6452 and set CLASSTYPE_KEY_METHOD accordingly. */
6455 determine_key_method (tree type
)
6459 if (TYPE_FOR_JAVA (type
)
6460 || processing_template_decl
6461 || CLASSTYPE_TEMPLATE_INSTANTIATION (type
)
6462 || CLASSTYPE_INTERFACE_KNOWN (type
))
6465 /* The key method is the first non-pure virtual function that is not
6466 inline at the point of class definition. On some targets the
6467 key function may not be inline; those targets should not call
6468 this function until the end of the translation unit. */
6469 for (method
= TYPE_METHODS (type
); method
!= NULL_TREE
;
6470 method
= DECL_CHAIN (method
))
6471 if (DECL_VINDEX (method
) != NULL_TREE
6472 && ! DECL_DECLARED_INLINE_P (method
)
6473 && ! DECL_PURE_VIRTUAL_P (method
))
6475 CLASSTYPE_KEY_METHOD (type
) = method
;
6483 /* Allocate and return an instance of struct sorted_fields_type with
6486 static struct sorted_fields_type
*
6487 sorted_fields_type_new (int n
)
6489 struct sorted_fields_type
*sft
;
6490 sft
= (sorted_fields_type
*) ggc_internal_alloc (sizeof (sorted_fields_type
)
6491 + n
* sizeof (tree
));
6498 /* Perform processing required when the definition of T (a class type)
6502 finish_struct_1 (tree t
)
6505 /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */
6506 tree virtuals
= NULL_TREE
;
6508 if (COMPLETE_TYPE_P (t
))
6510 gcc_assert (MAYBE_CLASS_TYPE_P (t
));
6511 error ("redefinition of %q#T", t
);
6516 /* If this type was previously laid out as a forward reference,
6517 make sure we lay it out again. */
6518 TYPE_SIZE (t
) = NULL_TREE
;
6519 CLASSTYPE_PRIMARY_BINFO (t
) = NULL_TREE
;
6521 /* Make assumptions about the class; we'll reset the flags if
6523 CLASSTYPE_EMPTY_P (t
) = 1;
6524 CLASSTYPE_NEARLY_EMPTY_P (t
) = 1;
6525 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 0;
6526 CLASSTYPE_LITERAL_P (t
) = true;
6528 /* Do end-of-class semantic processing: checking the validity of the
6529 bases and members and add implicitly generated methods. */
6530 check_bases_and_members (t
);
6532 /* Find the key method. */
6533 if (TYPE_CONTAINS_VPTR_P (t
))
6535 /* The Itanium C++ ABI permits the key method to be chosen when
6536 the class is defined -- even though the key method so
6537 selected may later turn out to be an inline function. On
6538 some systems (such as ARM Symbian OS) the key method cannot
6539 be determined until the end of the translation unit. On such
6540 systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which
6541 will cause the class to be added to KEYED_CLASSES. Then, in
6542 finish_file we will determine the key method. */
6543 if (targetm
.cxx
.key_method_may_be_inline ())
6544 determine_key_method (t
);
6546 /* If a polymorphic class has no key method, we may emit the vtable
6547 in every translation unit where the class definition appears. */
6548 if (CLASSTYPE_KEY_METHOD (t
) == NULL_TREE
)
6549 keyed_classes
= tree_cons (NULL_TREE
, t
, keyed_classes
);
6552 /* Layout the class itself. */
6553 layout_class_type (t
, &virtuals
);
6554 if (CLASSTYPE_AS_BASE (t
) != t
)
6555 /* We use the base type for trivial assignments, and hence it
6557 compute_record_mode (CLASSTYPE_AS_BASE (t
));
6559 virtuals
= modify_all_vtables (t
, nreverse (virtuals
));
6561 /* If necessary, create the primary vtable for this class. */
6562 if (virtuals
|| TYPE_CONTAINS_VPTR_P (t
))
6564 /* We must enter these virtuals into the table. */
6565 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
6566 build_primary_vtable (NULL_TREE
, t
);
6567 else if (! BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (t
)))
6568 /* Here we know enough to change the type of our virtual
6569 function table, but we will wait until later this function. */
6570 build_primary_vtable (CLASSTYPE_PRIMARY_BINFO (t
), t
);
6572 /* If we're warning about ABI tags, check the types of the new
6573 virtual functions. */
6575 for (tree v
= virtuals
; v
; v
= TREE_CHAIN (v
))
6576 check_abi_tags (t
, TREE_VALUE (v
));
6579 if (TYPE_CONTAINS_VPTR_P (t
))
6584 if (BINFO_VTABLE (TYPE_BINFO (t
)))
6585 gcc_assert (DECL_VIRTUAL_P (BINFO_VTABLE (TYPE_BINFO (t
))));
6586 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
6587 gcc_assert (BINFO_VIRTUALS (TYPE_BINFO (t
)) == NULL_TREE
);
6589 /* Add entries for virtual functions introduced by this class. */
6590 BINFO_VIRTUALS (TYPE_BINFO (t
))
6591 = chainon (BINFO_VIRTUALS (TYPE_BINFO (t
)), virtuals
);
6593 /* Set DECL_VINDEX for all functions declared in this class. */
6594 for (vindex
= 0, fn
= BINFO_VIRTUALS (TYPE_BINFO (t
));
6596 fn
= TREE_CHAIN (fn
),
6597 vindex
+= (TARGET_VTABLE_USES_DESCRIPTORS
6598 ? TARGET_VTABLE_USES_DESCRIPTORS
: 1))
6600 tree fndecl
= BV_FN (fn
);
6602 if (DECL_THUNK_P (fndecl
))
6603 /* A thunk. We should never be calling this entry directly
6604 from this vtable -- we'd use the entry for the non
6605 thunk base function. */
6606 DECL_VINDEX (fndecl
) = NULL_TREE
;
6607 else if (TREE_CODE (DECL_VINDEX (fndecl
)) != INTEGER_CST
)
6608 DECL_VINDEX (fndecl
) = build_int_cst (NULL_TREE
, vindex
);
6612 finish_struct_bits (t
);
6613 set_method_tm_attributes (t
);
6615 /* Complete the rtl for any static member objects of the type we're
6617 for (x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
6618 if (VAR_P (x
) && TREE_STATIC (x
)
6619 && TREE_TYPE (x
) != error_mark_node
6620 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (x
)), t
))
6621 DECL_MODE (x
) = TYPE_MODE (t
);
6623 /* Done with FIELDS...now decide whether to sort these for
6624 faster lookups later.
6626 We use a small number because most searches fail (succeeding
6627 ultimately as the search bores through the inheritance
6628 hierarchy), and we want this failure to occur quickly. */
6630 insert_into_classtype_sorted_fields (TYPE_FIELDS (t
), t
, 8);
6632 /* Complain if one of the field types requires lower visibility. */
6633 constrain_class_visibility (t
);
6635 /* Make the rtl for any new vtables we have created, and unmark
6636 the base types we marked. */
6639 /* Build the VTT for T. */
6642 /* This warning does not make sense for Java classes, since they
6643 cannot have destructors. */
6644 if (!TYPE_FOR_JAVA (t
) && warn_nonvdtor
6645 && TYPE_POLYMORPHIC_P (t
) && accessible_nvdtor_p (t
))
6646 warning (OPT_Wnon_virtual_dtor
,
6647 "%q#T has virtual functions and accessible"
6648 " non-virtual destructor", t
);
6652 if (warn_overloaded_virtual
)
6655 /* Class layout, assignment of virtual table slots, etc., is now
6656 complete. Give the back end a chance to tweak the visibility of
6657 the class or perform any other required target modifications. */
6658 targetm
.cxx
.adjust_class_at_definition (t
);
6660 maybe_suppress_debug_info (t
);
6662 if (flag_vtable_verify
)
6663 vtv_save_class_info (t
);
6665 dump_class_hierarchy (t
);
6667 /* Finish debugging output for this type. */
6668 rest_of_type_compilation (t
, ! LOCAL_CLASS_P (t
));
6670 if (TYPE_TRANSPARENT_AGGR (t
))
6672 tree field
= first_field (t
);
6673 if (field
== NULL_TREE
|| error_operand_p (field
))
6675 error ("type transparent %q#T does not have any fields", t
);
6676 TYPE_TRANSPARENT_AGGR (t
) = 0;
6678 else if (DECL_ARTIFICIAL (field
))
6680 if (DECL_FIELD_IS_BASE (field
))
6681 error ("type transparent class %qT has base classes", t
);
6684 gcc_checking_assert (DECL_VIRTUAL_P (field
));
6685 error ("type transparent class %qT has virtual functions", t
);
6687 TYPE_TRANSPARENT_AGGR (t
) = 0;
6689 else if (TYPE_MODE (t
) != DECL_MODE (field
))
6691 error ("type transparent %q#T cannot be made transparent because "
6692 "the type of the first field has a different ABI from the "
6693 "class overall", t
);
6694 TYPE_TRANSPARENT_AGGR (t
) = 0;
6699 /* Insert FIELDS into T for the sorted case if the FIELDS count is
6700 equal to THRESHOLD or greater than THRESHOLD. */
6703 insert_into_classtype_sorted_fields (tree fields
, tree t
, int threshold
)
6705 int n_fields
= count_fields (fields
);
6706 if (n_fields
>= threshold
)
6708 struct sorted_fields_type
*field_vec
= sorted_fields_type_new (n_fields
);
6709 add_fields_to_record_type (fields
, field_vec
, 0);
6710 qsort (field_vec
->elts
, n_fields
, sizeof (tree
), field_decl_cmp
);
6711 CLASSTYPE_SORTED_FIELDS (t
) = field_vec
;
6715 /* Insert lately defined enum ENUMTYPE into T for the sorted case. */
6718 insert_late_enum_def_into_classtype_sorted_fields (tree enumtype
, tree t
)
6720 struct sorted_fields_type
*sorted_fields
= CLASSTYPE_SORTED_FIELDS (t
);
6725 = list_length (TYPE_VALUES (enumtype
)) + sorted_fields
->len
;
6726 struct sorted_fields_type
*field_vec
= sorted_fields_type_new (n_fields
);
6728 for (i
= 0; i
< sorted_fields
->len
; ++i
)
6729 field_vec
->elts
[i
] = sorted_fields
->elts
[i
];
6731 add_enum_fields_to_record_type (enumtype
, field_vec
,
6732 sorted_fields
->len
);
6733 qsort (field_vec
->elts
, n_fields
, sizeof (tree
), field_decl_cmp
);
6734 CLASSTYPE_SORTED_FIELDS (t
) = field_vec
;
6738 /* When T was built up, the member declarations were added in reverse
6739 order. Rearrange them to declaration order. */
6742 unreverse_member_declarations (tree t
)
6748 /* The following lists are all in reverse order. Put them in
6749 declaration order now. */
6750 TYPE_METHODS (t
) = nreverse (TYPE_METHODS (t
));
6751 CLASSTYPE_DECL_LIST (t
) = nreverse (CLASSTYPE_DECL_LIST (t
));
6753 /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in
6754 reverse order, so we can't just use nreverse. */
6756 for (x
= TYPE_FIELDS (t
);
6757 x
&& TREE_CODE (x
) != TYPE_DECL
;
6760 next
= DECL_CHAIN (x
);
6761 DECL_CHAIN (x
) = prev
;
6766 DECL_CHAIN (TYPE_FIELDS (t
)) = x
;
6768 TYPE_FIELDS (t
) = prev
;
6773 finish_struct (tree t
, tree attributes
)
6775 location_t saved_loc
= input_location
;
6777 /* Now that we've got all the field declarations, reverse everything
6779 unreverse_member_declarations (t
);
6781 cplus_decl_attributes (&t
, attributes
, (int) ATTR_FLAG_TYPE_IN_PLACE
);
6783 /* Nadger the current location so that diagnostics point to the start of
6784 the struct, not the end. */
6785 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (t
));
6787 if (processing_template_decl
)
6791 finish_struct_methods (t
);
6792 TYPE_SIZE (t
) = bitsize_zero_node
;
6793 TYPE_SIZE_UNIT (t
) = size_zero_node
;
6795 /* We need to emit an error message if this type was used as a parameter
6796 and it is an abstract type, even if it is a template. We construct
6797 a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into
6798 account and we call complete_vars with this type, which will check
6799 the PARM_DECLS. Note that while the type is being defined,
6800 CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends
6801 (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */
6802 CLASSTYPE_PURE_VIRTUALS (t
) = NULL
;
6803 for (x
= TYPE_METHODS (t
); x
; x
= DECL_CHAIN (x
))
6804 if (DECL_PURE_VIRTUAL_P (x
))
6805 vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t
), x
);
6807 /* We need to add the target functions to the CLASSTYPE_METHOD_VEC if
6808 an enclosing scope is a template class, so that this function be
6809 found by lookup_fnfields_1 when the using declaration is not
6810 instantiated yet. */
6811 for (x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
6812 if (TREE_CODE (x
) == USING_DECL
)
6814 tree fn
= strip_using_decl (x
);
6815 if (is_overloaded_fn (fn
))
6816 for (; fn
; fn
= OVL_NEXT (fn
))
6817 add_method (t
, OVL_CURRENT (fn
), x
);
6820 /* Remember current #pragma pack value. */
6821 TYPE_PRECISION (t
) = maximum_field_alignment
;
6823 /* Fix up any variants we've already built. */
6824 for (x
= TYPE_NEXT_VARIANT (t
); x
; x
= TYPE_NEXT_VARIANT (x
))
6826 TYPE_SIZE (x
) = TYPE_SIZE (t
);
6827 TYPE_SIZE_UNIT (x
) = TYPE_SIZE_UNIT (t
);
6828 TYPE_FIELDS (x
) = TYPE_FIELDS (t
);
6829 TYPE_METHODS (x
) = TYPE_METHODS (t
);
6833 finish_struct_1 (t
);
6835 input_location
= saved_loc
;
6837 TYPE_BEING_DEFINED (t
) = 0;
6839 if (current_class_type
)
6842 error ("trying to finish struct, but kicked out due to previous parse errors");
6844 if (processing_template_decl
&& at_function_scope_p ()
6845 /* Lambdas are defined by the LAMBDA_EXPR. */
6846 && !LAMBDA_TYPE_P (t
))
6847 add_stmt (build_min (TAG_DEFN
, t
));
6852 /* Hash table to avoid endless recursion when handling references. */
6853 static hash_table
<pointer_hash
<tree_node
> > fixed_type_or_null_ref_ht
;
6855 /* Return the dynamic type of INSTANCE, if known.
6856 Used to determine whether the virtual function table is needed
6859 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
6860 of our knowledge of its type. *NONNULL should be initialized
6861 before this function is called. */
6864 fixed_type_or_null (tree instance
, int *nonnull
, int *cdtorp
)
6866 #define RECUR(T) fixed_type_or_null((T), nonnull, cdtorp)
6868 switch (TREE_CODE (instance
))
6871 if (POINTER_TYPE_P (TREE_TYPE (instance
)))
6874 return RECUR (TREE_OPERAND (instance
, 0));
6877 /* This is a call to a constructor, hence it's never zero. */
6878 if (TREE_HAS_CONSTRUCTOR (instance
))
6882 return TREE_TYPE (instance
);
6887 /* This is a call to a constructor, hence it's never zero. */
6888 if (TREE_HAS_CONSTRUCTOR (instance
))
6892 return TREE_TYPE (instance
);
6894 return RECUR (TREE_OPERAND (instance
, 0));
6896 case POINTER_PLUS_EXPR
:
6899 if (TREE_CODE (TREE_OPERAND (instance
, 0)) == ADDR_EXPR
)
6900 return RECUR (TREE_OPERAND (instance
, 0));
6901 if (TREE_CODE (TREE_OPERAND (instance
, 1)) == INTEGER_CST
)
6902 /* Propagate nonnull. */
6903 return RECUR (TREE_OPERAND (instance
, 0));
6908 return RECUR (TREE_OPERAND (instance
, 0));
6911 instance
= TREE_OPERAND (instance
, 0);
6914 /* Just because we see an ADDR_EXPR doesn't mean we're dealing
6915 with a real object -- given &p->f, p can still be null. */
6916 tree t
= get_base_address (instance
);
6917 /* ??? Probably should check DECL_WEAK here. */
6918 if (t
&& DECL_P (t
))
6921 return RECUR (instance
);
6924 /* If this component is really a base class reference, then the field
6925 itself isn't definitive. */
6926 if (DECL_FIELD_IS_BASE (TREE_OPERAND (instance
, 1)))
6927 return RECUR (TREE_OPERAND (instance
, 0));
6928 return RECUR (TREE_OPERAND (instance
, 1));
6932 if (TREE_CODE (TREE_TYPE (instance
)) == ARRAY_TYPE
6933 && MAYBE_CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (instance
))))
6937 return TREE_TYPE (TREE_TYPE (instance
));
6939 /* fall through... */
6943 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (instance
)))
6947 return TREE_TYPE (instance
);
6949 else if (instance
== current_class_ptr
)
6954 /* if we're in a ctor or dtor, we know our type. If
6955 current_class_ptr is set but we aren't in a function, we're in
6956 an NSDMI (and therefore a constructor). */
6957 if (current_scope () != current_function_decl
6958 || (DECL_LANG_SPECIFIC (current_function_decl
)
6959 && (DECL_CONSTRUCTOR_P (current_function_decl
)
6960 || DECL_DESTRUCTOR_P (current_function_decl
))))
6964 return TREE_TYPE (TREE_TYPE (instance
));
6967 else if (TREE_CODE (TREE_TYPE (instance
)) == REFERENCE_TYPE
)
6969 /* We only need one hash table because it is always left empty. */
6970 if (!fixed_type_or_null_ref_ht
.is_created ())
6971 fixed_type_or_null_ref_ht
.create (37);
6973 /* Reference variables should be references to objects. */
6977 /* Enter the INSTANCE in a table to prevent recursion; a
6978 variable's initializer may refer to the variable
6980 if (VAR_P (instance
)
6981 && DECL_INITIAL (instance
)
6982 && !type_dependent_expression_p_push (DECL_INITIAL (instance
))
6983 && !fixed_type_or_null_ref_ht
.find (instance
))
6988 slot
= fixed_type_or_null_ref_ht
.find_slot (instance
, INSERT
);
6990 type
= RECUR (DECL_INITIAL (instance
));
6991 fixed_type_or_null_ref_ht
.remove_elt (instance
);
7004 /* Return nonzero if the dynamic type of INSTANCE is known, and
7005 equivalent to the static type. We also handle the case where
7006 INSTANCE is really a pointer. Return negative if this is a
7007 ctor/dtor. There the dynamic type is known, but this might not be
7008 the most derived base of the original object, and hence virtual
7009 bases may not be laid out according to this type.
7011 Used to determine whether the virtual function table is needed
7014 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
7015 of our knowledge of its type. *NONNULL should be initialized
7016 before this function is called. */
7019 resolves_to_fixed_type_p (tree instance
, int* nonnull
)
7021 tree t
= TREE_TYPE (instance
);
7025 /* processing_template_decl can be false in a template if we're in
7026 fold_non_dependent_expr, but we still want to suppress this check. */
7027 if (in_template_function ())
7029 /* In a template we only care about the type of the result. */
7035 fixed
= fixed_type_or_null (instance
, nonnull
, &cdtorp
);
7036 if (fixed
== NULL_TREE
)
7038 if (POINTER_TYPE_P (t
))
7040 if (!same_type_ignoring_top_level_qualifiers_p (t
, fixed
))
7042 return cdtorp
? -1 : 1;
7047 init_class_processing (void)
7049 current_class_depth
= 0;
7050 current_class_stack_size
= 10;
7052 = XNEWVEC (struct class_stack_node
, current_class_stack_size
);
7053 vec_alloc (local_classes
, 8);
7054 sizeof_biggest_empty_class
= size_zero_node
;
7056 ridpointers
[(int) RID_PUBLIC
] = access_public_node
;
7057 ridpointers
[(int) RID_PRIVATE
] = access_private_node
;
7058 ridpointers
[(int) RID_PROTECTED
] = access_protected_node
;
7061 /* Restore the cached PREVIOUS_CLASS_LEVEL. */
7064 restore_class_cache (void)
7068 /* We are re-entering the same class we just left, so we don't
7069 have to search the whole inheritance matrix to find all the
7070 decls to bind again. Instead, we install the cached
7071 class_shadowed list and walk through it binding names. */
7072 push_binding_level (previous_class_level
);
7073 class_binding_level
= previous_class_level
;
7074 /* Restore IDENTIFIER_TYPE_VALUE. */
7075 for (type
= class_binding_level
->type_shadowed
;
7077 type
= TREE_CHAIN (type
))
7078 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (type
), TREE_TYPE (type
));
7081 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as
7082 appropriate for TYPE.
7084 So that we may avoid calls to lookup_name, we cache the _TYPE
7085 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
7087 For multiple inheritance, we perform a two-pass depth-first search
7088 of the type lattice. */
7091 pushclass (tree type
)
7093 class_stack_node_t csn
;
7095 type
= TYPE_MAIN_VARIANT (type
);
7097 /* Make sure there is enough room for the new entry on the stack. */
7098 if (current_class_depth
+ 1 >= current_class_stack_size
)
7100 current_class_stack_size
*= 2;
7102 = XRESIZEVEC (struct class_stack_node
, current_class_stack
,
7103 current_class_stack_size
);
7106 /* Insert a new entry on the class stack. */
7107 csn
= current_class_stack
+ current_class_depth
;
7108 csn
->name
= current_class_name
;
7109 csn
->type
= current_class_type
;
7110 csn
->access
= current_access_specifier
;
7111 csn
->names_used
= 0;
7113 current_class_depth
++;
7115 /* Now set up the new type. */
7116 current_class_name
= TYPE_NAME (type
);
7117 if (TREE_CODE (current_class_name
) == TYPE_DECL
)
7118 current_class_name
= DECL_NAME (current_class_name
);
7119 current_class_type
= type
;
7121 /* By default, things in classes are private, while things in
7122 structures or unions are public. */
7123 current_access_specifier
= (CLASSTYPE_DECLARED_CLASS (type
)
7124 ? access_private_node
7125 : access_public_node
);
7127 if (previous_class_level
7128 && type
!= previous_class_level
->this_entity
7129 && current_class_depth
== 1)
7131 /* Forcibly remove any old class remnants. */
7132 invalidate_class_lookup_cache ();
7135 if (!previous_class_level
7136 || type
!= previous_class_level
->this_entity
7137 || current_class_depth
> 1)
7140 restore_class_cache ();
7143 /* When we exit a toplevel class scope, we save its binding level so
7144 that we can restore it quickly. Here, we've entered some other
7145 class, so we must invalidate our cache. */
7148 invalidate_class_lookup_cache (void)
7150 previous_class_level
= NULL
;
7153 /* Get out of the current class scope. If we were in a class scope
7154 previously, that is the one popped to. */
7161 current_class_depth
--;
7162 current_class_name
= current_class_stack
[current_class_depth
].name
;
7163 current_class_type
= current_class_stack
[current_class_depth
].type
;
7164 current_access_specifier
= current_class_stack
[current_class_depth
].access
;
7165 if (current_class_stack
[current_class_depth
].names_used
)
7166 splay_tree_delete (current_class_stack
[current_class_depth
].names_used
);
7169 /* Mark the top of the class stack as hidden. */
7172 push_class_stack (void)
7174 if (current_class_depth
)
7175 ++current_class_stack
[current_class_depth
- 1].hidden
;
7178 /* Mark the top of the class stack as un-hidden. */
7181 pop_class_stack (void)
7183 if (current_class_depth
)
7184 --current_class_stack
[current_class_depth
- 1].hidden
;
7187 /* Returns 1 if the class type currently being defined is either T or
7188 a nested type of T. */
7191 currently_open_class (tree t
)
7195 if (!CLASS_TYPE_P (t
))
7198 t
= TYPE_MAIN_VARIANT (t
);
7200 /* We start looking from 1 because entry 0 is from global scope,
7202 for (i
= current_class_depth
; i
> 0; --i
)
7205 if (i
== current_class_depth
)
7206 c
= current_class_type
;
7209 if (current_class_stack
[i
].hidden
)
7211 c
= current_class_stack
[i
].type
;
7215 if (same_type_p (c
, t
))
7221 /* If either current_class_type or one of its enclosing classes are derived
7222 from T, return the appropriate type. Used to determine how we found
7223 something via unqualified lookup. */
7226 currently_open_derived_class (tree t
)
7230 /* The bases of a dependent type are unknown. */
7231 if (dependent_type_p (t
))
7234 if (!current_class_type
)
7237 if (DERIVED_FROM_P (t
, current_class_type
))
7238 return current_class_type
;
7240 for (i
= current_class_depth
- 1; i
> 0; --i
)
7242 if (current_class_stack
[i
].hidden
)
7244 if (DERIVED_FROM_P (t
, current_class_stack
[i
].type
))
7245 return current_class_stack
[i
].type
;
7251 /* Returns the innermost class type which is not a lambda closure type. */
7254 current_nonlambda_class_type (void)
7258 /* We start looking from 1 because entry 0 is from global scope,
7260 for (i
= current_class_depth
; i
> 0; --i
)
7263 if (i
== current_class_depth
)
7264 c
= current_class_type
;
7267 if (current_class_stack
[i
].hidden
)
7269 c
= current_class_stack
[i
].type
;
7273 if (!LAMBDA_TYPE_P (c
))
7279 /* When entering a class scope, all enclosing class scopes' names with
7280 static meaning (static variables, static functions, types and
7281 enumerators) have to be visible. This recursive function calls
7282 pushclass for all enclosing class contexts until global or a local
7283 scope is reached. TYPE is the enclosed class. */
7286 push_nested_class (tree type
)
7288 /* A namespace might be passed in error cases, like A::B:C. */
7289 if (type
== NULL_TREE
7290 || !CLASS_TYPE_P (type
))
7293 push_nested_class (DECL_CONTEXT (TYPE_MAIN_DECL (type
)));
7298 /* Undoes a push_nested_class call. */
7301 pop_nested_class (void)
7303 tree context
= DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type
));
7306 if (context
&& CLASS_TYPE_P (context
))
7307 pop_nested_class ();
7310 /* Returns the number of extern "LANG" blocks we are nested within. */
7313 current_lang_depth (void)
7315 return vec_safe_length (current_lang_base
);
7318 /* Set global variables CURRENT_LANG_NAME to appropriate value
7319 so that behavior of name-mangling machinery is correct. */
7322 push_lang_context (tree name
)
7324 vec_safe_push (current_lang_base
, current_lang_name
);
7326 if (name
== lang_name_cplusplus
)
7328 current_lang_name
= name
;
7330 else if (name
== lang_name_java
)
7332 current_lang_name
= name
;
7333 /* DECL_IGNORED_P is initially set for these types, to avoid clutter.
7334 (See record_builtin_java_type in decl.c.) However, that causes
7335 incorrect debug entries if these types are actually used.
7336 So we re-enable debug output after extern "Java". */
7337 DECL_IGNORED_P (TYPE_NAME (java_byte_type_node
)) = 0;
7338 DECL_IGNORED_P (TYPE_NAME (java_short_type_node
)) = 0;
7339 DECL_IGNORED_P (TYPE_NAME (java_int_type_node
)) = 0;
7340 DECL_IGNORED_P (TYPE_NAME (java_long_type_node
)) = 0;
7341 DECL_IGNORED_P (TYPE_NAME (java_float_type_node
)) = 0;
7342 DECL_IGNORED_P (TYPE_NAME (java_double_type_node
)) = 0;
7343 DECL_IGNORED_P (TYPE_NAME (java_char_type_node
)) = 0;
7344 DECL_IGNORED_P (TYPE_NAME (java_boolean_type_node
)) = 0;
7346 else if (name
== lang_name_c
)
7348 current_lang_name
= name
;
7351 error ("language string %<\"%E\"%> not recognized", name
);
7354 /* Get out of the current language scope. */
7357 pop_lang_context (void)
7359 current_lang_name
= current_lang_base
->pop ();
7362 /* Type instantiation routines. */
7364 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
7365 matches the TARGET_TYPE. If there is no satisfactory match, return
7366 error_mark_node, and issue an error & warning messages under
7367 control of FLAGS. Permit pointers to member function if FLAGS
7368 permits. If TEMPLATE_ONLY, the name of the overloaded function was
7369 a template-id, and EXPLICIT_TARGS are the explicitly provided
7372 If OVERLOAD is for one or more member functions, then ACCESS_PATH
7373 is the base path used to reference those member functions. If
7374 the address is resolved to a member function, access checks will be
7375 performed and errors issued if appropriate. */
7378 resolve_address_of_overloaded_function (tree target_type
,
7380 tsubst_flags_t flags
,
7382 tree explicit_targs
,
7385 /* Here's what the standard says:
7389 If the name is a function template, template argument deduction
7390 is done, and if the argument deduction succeeds, the deduced
7391 arguments are used to generate a single template function, which
7392 is added to the set of overloaded functions considered.
7394 Non-member functions and static member functions match targets of
7395 type "pointer-to-function" or "reference-to-function." Nonstatic
7396 member functions match targets of type "pointer-to-member
7397 function;" the function type of the pointer to member is used to
7398 select the member function from the set of overloaded member
7399 functions. If a nonstatic member function is selected, the
7400 reference to the overloaded function name is required to have the
7401 form of a pointer to member as described in 5.3.1.
7403 If more than one function is selected, any template functions in
7404 the set are eliminated if the set also contains a non-template
7405 function, and any given template function is eliminated if the
7406 set contains a second template function that is more specialized
7407 than the first according to the partial ordering rules 14.5.5.2.
7408 After such eliminations, if any, there shall remain exactly one
7409 selected function. */
7412 /* We store the matches in a TREE_LIST rooted here. The functions
7413 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
7414 interoperability with most_specialized_instantiation. */
7415 tree matches
= NULL_TREE
;
7417 tree target_fn_type
;
7419 /* By the time we get here, we should be seeing only real
7420 pointer-to-member types, not the internal POINTER_TYPE to
7421 METHOD_TYPE representation. */
7422 gcc_assert (!TYPE_PTR_P (target_type
)
7423 || TREE_CODE (TREE_TYPE (target_type
)) != METHOD_TYPE
);
7425 gcc_assert (is_overloaded_fn (overload
));
7427 /* Check that the TARGET_TYPE is reasonable. */
7428 if (TYPE_PTRFN_P (target_type
)
7429 || TYPE_REFFN_P (target_type
))
7431 else if (TYPE_PTRMEMFUNC_P (target_type
))
7432 /* This is OK, too. */
7434 else if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
7435 /* This is OK, too. This comes from a conversion to reference
7437 target_type
= build_reference_type (target_type
);
7440 if (flags
& tf_error
)
7441 error ("cannot resolve overloaded function %qD based on"
7442 " conversion to type %qT",
7443 DECL_NAME (OVL_FUNCTION (overload
)), target_type
);
7444 return error_mark_node
;
7447 /* Non-member functions and static member functions match targets of type
7448 "pointer-to-function" or "reference-to-function." Nonstatic member
7449 functions match targets of type "pointer-to-member-function;" the
7450 function type of the pointer to member is used to select the member
7451 function from the set of overloaded member functions.
7453 So figure out the FUNCTION_TYPE that we want to match against. */
7454 target_fn_type
= static_fn_type (target_type
);
7456 /* If we can find a non-template function that matches, we can just
7457 use it. There's no point in generating template instantiations
7458 if we're just going to throw them out anyhow. But, of course, we
7459 can only do this when we don't *need* a template function. */
7464 for (fns
= overload
; fns
; fns
= OVL_NEXT (fns
))
7466 tree fn
= OVL_CURRENT (fns
);
7468 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
7469 /* We're not looking for templates just yet. */
7472 if ((TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7474 /* We're looking for a non-static member, and this isn't
7475 one, or vice versa. */
7478 /* Ignore functions which haven't been explicitly
7480 if (DECL_ANTICIPATED (fn
))
7483 /* See if there's a match. */
7484 if (same_type_p (target_fn_type
, static_fn_type (fn
)))
7485 matches
= tree_cons (fn
, NULL_TREE
, matches
);
7489 /* Now, if we've already got a match (or matches), there's no need
7490 to proceed to the template functions. But, if we don't have a
7491 match we need to look at them, too. */
7494 tree target_arg_types
;
7495 tree target_ret_type
;
7498 unsigned int nargs
, ia
;
7501 target_arg_types
= TYPE_ARG_TYPES (target_fn_type
);
7502 target_ret_type
= TREE_TYPE (target_fn_type
);
7504 nargs
= list_length (target_arg_types
);
7505 args
= XALLOCAVEC (tree
, nargs
);
7506 for (arg
= target_arg_types
, ia
= 0;
7507 arg
!= NULL_TREE
&& arg
!= void_list_node
;
7508 arg
= TREE_CHAIN (arg
), ++ia
)
7509 args
[ia
] = TREE_VALUE (arg
);
7512 for (fns
= overload
; fns
; fns
= OVL_NEXT (fns
))
7514 tree fn
= OVL_CURRENT (fns
);
7518 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7519 /* We're only looking for templates. */
7522 if ((TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7524 /* We're not looking for a non-static member, and this is
7525 one, or vice versa. */
7528 tree ret
= target_ret_type
;
7530 /* If the template has a deduced return type, don't expose it to
7531 template argument deduction. */
7532 if (undeduced_auto_decl (fn
))
7535 /* Try to do argument deduction. */
7536 targs
= make_tree_vec (DECL_NTPARMS (fn
));
7537 instantiation
= fn_type_unification (fn
, explicit_targs
, targs
, args
,
7539 DEDUCE_EXACT
, LOOKUP_NORMAL
,
7541 if (instantiation
== error_mark_node
)
7542 /* Instantiation failed. */
7545 /* And now force instantiation to do return type deduction. */
7546 if (undeduced_auto_decl (instantiation
))
7549 instantiate_decl (instantiation
, /*defer*/false, /*class*/false);
7552 require_deduced_type (instantiation
);
7555 /* See if there's a match. */
7556 if (same_type_p (target_fn_type
, static_fn_type (instantiation
)))
7557 matches
= tree_cons (instantiation
, fn
, matches
);
7560 /* Now, remove all but the most specialized of the matches. */
7563 tree match
= most_specialized_instantiation (matches
);
7565 if (match
!= error_mark_node
)
7566 matches
= tree_cons (TREE_PURPOSE (match
),
7572 /* Now we should have exactly one function in MATCHES. */
7573 if (matches
== NULL_TREE
)
7575 /* There were *no* matches. */
7576 if (flags
& tf_error
)
7578 error ("no matches converting function %qD to type %q#T",
7579 DECL_NAME (OVL_CURRENT (overload
)),
7582 print_candidates (overload
);
7584 return error_mark_node
;
7586 else if (TREE_CHAIN (matches
))
7588 /* There were too many matches. First check if they're all
7589 the same function. */
7590 tree match
= NULL_TREE
;
7592 fn
= TREE_PURPOSE (matches
);
7594 /* For multi-versioned functions, more than one match is just fine and
7595 decls_match will return false as they are different. */
7596 for (match
= TREE_CHAIN (matches
); match
; match
= TREE_CHAIN (match
))
7597 if (!decls_match (fn
, TREE_PURPOSE (match
))
7598 && !targetm
.target_option
.function_versions
7599 (fn
, TREE_PURPOSE (match
)))
7604 if (flags
& tf_error
)
7606 error ("converting overloaded function %qD to type %q#T is ambiguous",
7607 DECL_NAME (OVL_FUNCTION (overload
)),
7610 /* Since print_candidates expects the functions in the
7611 TREE_VALUE slot, we flip them here. */
7612 for (match
= matches
; match
; match
= TREE_CHAIN (match
))
7613 TREE_VALUE (match
) = TREE_PURPOSE (match
);
7615 print_candidates (matches
);
7618 return error_mark_node
;
7622 /* Good, exactly one match. Now, convert it to the correct type. */
7623 fn
= TREE_PURPOSE (matches
);
7625 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
7626 && !(flags
& tf_ptrmem_ok
) && !flag_ms_extensions
)
7628 static int explained
;
7630 if (!(flags
& tf_error
))
7631 return error_mark_node
;
7633 permerror (input_location
, "assuming pointer to member %qD", fn
);
7636 inform (input_location
, "(a pointer to member can only be formed with %<&%E%>)", fn
);
7641 /* If a pointer to a function that is multi-versioned is requested, the
7642 pointer to the dispatcher function is returned instead. This works
7643 well because indirectly calling the function will dispatch the right
7644 function version at run-time. */
7645 if (DECL_FUNCTION_VERSIONED (fn
))
7647 fn
= get_function_version_dispatcher (fn
);
7649 return error_mark_node
;
7650 /* Mark all the versions corresponding to the dispatcher as used. */
7651 if (!(flags
& tf_conv
))
7652 mark_versions_used (fn
);
7655 /* If we're doing overload resolution purely for the purpose of
7656 determining conversion sequences, we should not consider the
7657 function used. If this conversion sequence is selected, the
7658 function will be marked as used at this point. */
7659 if (!(flags
& tf_conv
))
7661 /* Make =delete work with SFINAE. */
7662 if (DECL_DELETED_FN (fn
) && !(flags
& tf_error
))
7663 return error_mark_node
;
7668 /* We could not check access to member functions when this
7669 expression was originally created since we did not know at that
7670 time to which function the expression referred. */
7671 if (DECL_FUNCTION_MEMBER_P (fn
))
7673 gcc_assert (access_path
);
7674 perform_or_defer_access_check (access_path
, fn
, fn
, flags
);
7677 if (TYPE_PTRFN_P (target_type
) || TYPE_PTRMEMFUNC_P (target_type
))
7678 return cp_build_addr_expr (fn
, flags
);
7681 /* The target must be a REFERENCE_TYPE. Above, cp_build_unary_op
7682 will mark the function as addressed, but here we must do it
7684 cxx_mark_addressable (fn
);
7690 /* This function will instantiate the type of the expression given in
7691 RHS to match the type of LHSTYPE. If errors exist, then return
7692 error_mark_node. FLAGS is a bit mask. If TF_ERROR is set, then
7693 we complain on errors. If we are not complaining, never modify rhs,
7694 as overload resolution wants to try many possible instantiations, in
7695 the hope that at least one will work.
7697 For non-recursive calls, LHSTYPE should be a function, pointer to
7698 function, or a pointer to member function. */
7701 instantiate_type (tree lhstype
, tree rhs
, tsubst_flags_t flags
)
7703 tsubst_flags_t flags_in
= flags
;
7704 tree access_path
= NULL_TREE
;
7706 flags
&= ~tf_ptrmem_ok
;
7708 if (lhstype
== unknown_type_node
)
7710 if (flags
& tf_error
)
7711 error ("not enough type information");
7712 return error_mark_node
;
7715 if (TREE_TYPE (rhs
) != NULL_TREE
&& ! (type_unknown_p (rhs
)))
7717 tree fntype
= non_reference (lhstype
);
7718 if (same_type_p (fntype
, TREE_TYPE (rhs
)))
7720 if (flag_ms_extensions
7721 && TYPE_PTRMEMFUNC_P (fntype
)
7722 && !TYPE_PTRMEMFUNC_P (TREE_TYPE (rhs
)))
7723 /* Microsoft allows `A::f' to be resolved to a
7724 pointer-to-member. */
7728 if (flags
& tf_error
)
7729 error ("cannot convert %qE from type %qT to type %qT",
7730 rhs
, TREE_TYPE (rhs
), fntype
);
7731 return error_mark_node
;
7735 if (BASELINK_P (rhs
))
7737 access_path
= BASELINK_ACCESS_BINFO (rhs
);
7738 rhs
= BASELINK_FUNCTIONS (rhs
);
7741 /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot
7742 deduce any type information. */
7743 if (TREE_CODE (rhs
) == NON_DEPENDENT_EXPR
)
7745 if (flags
& tf_error
)
7746 error ("not enough type information");
7747 return error_mark_node
;
7750 /* There only a few kinds of expressions that may have a type
7751 dependent on overload resolution. */
7752 gcc_assert (TREE_CODE (rhs
) == ADDR_EXPR
7753 || TREE_CODE (rhs
) == COMPONENT_REF
7754 || is_overloaded_fn (rhs
)
7755 || (flag_ms_extensions
&& TREE_CODE (rhs
) == FUNCTION_DECL
));
7757 /* This should really only be used when attempting to distinguish
7758 what sort of a pointer to function we have. For now, any
7759 arithmetic operation which is not supported on pointers
7760 is rejected as an error. */
7762 switch (TREE_CODE (rhs
))
7766 tree member
= TREE_OPERAND (rhs
, 1);
7768 member
= instantiate_type (lhstype
, member
, flags
);
7769 if (member
!= error_mark_node
7770 && TREE_SIDE_EFFECTS (TREE_OPERAND (rhs
, 0)))
7771 /* Do not lose object's side effects. */
7772 return build2 (COMPOUND_EXPR
, TREE_TYPE (member
),
7773 TREE_OPERAND (rhs
, 0), member
);
7778 rhs
= TREE_OPERAND (rhs
, 1);
7779 if (BASELINK_P (rhs
))
7780 return instantiate_type (lhstype
, rhs
, flags_in
);
7782 /* This can happen if we are forming a pointer-to-member for a
7784 gcc_assert (TREE_CODE (rhs
) == TEMPLATE_ID_EXPR
);
7788 case TEMPLATE_ID_EXPR
:
7790 tree fns
= TREE_OPERAND (rhs
, 0);
7791 tree args
= TREE_OPERAND (rhs
, 1);
7794 resolve_address_of_overloaded_function (lhstype
, fns
, flags_in
,
7795 /*template_only=*/true,
7802 resolve_address_of_overloaded_function (lhstype
, rhs
, flags_in
,
7803 /*template_only=*/false,
7804 /*explicit_targs=*/NULL_TREE
,
7809 if (PTRMEM_OK_P (rhs
))
7810 flags
|= tf_ptrmem_ok
;
7812 return instantiate_type (lhstype
, TREE_OPERAND (rhs
, 0), flags
);
7816 return error_mark_node
;
7821 return error_mark_node
;
7824 /* Return the name of the virtual function pointer field
7825 (as an IDENTIFIER_NODE) for the given TYPE. Note that
7826 this may have to look back through base types to find the
7827 ultimate field name. (For single inheritance, these could
7828 all be the same name. Who knows for multiple inheritance). */
7831 get_vfield_name (tree type
)
7833 tree binfo
, base_binfo
;
7836 for (binfo
= TYPE_BINFO (type
);
7837 BINFO_N_BASE_BINFOS (binfo
);
7840 base_binfo
= BINFO_BASE_BINFO (binfo
, 0);
7842 if (BINFO_VIRTUAL_P (base_binfo
)
7843 || !TYPE_CONTAINS_VPTR_P (BINFO_TYPE (base_binfo
)))
7847 type
= BINFO_TYPE (binfo
);
7848 buf
= (char *) alloca (sizeof (VFIELD_NAME_FORMAT
)
7849 + TYPE_NAME_LENGTH (type
) + 2);
7850 sprintf (buf
, VFIELD_NAME_FORMAT
,
7851 IDENTIFIER_POINTER (constructor_name (type
)));
7852 return get_identifier (buf
);
7856 print_class_statistics (void)
7858 if (! GATHER_STATISTICS
)
7861 fprintf (stderr
, "convert_harshness = %d\n", n_convert_harshness
);
7862 fprintf (stderr
, "compute_conversion_costs = %d\n", n_compute_conversion_costs
);
7865 fprintf (stderr
, "vtables = %d; vtable searches = %d\n",
7866 n_vtables
, n_vtable_searches
);
7867 fprintf (stderr
, "vtable entries = %d; vtable elems = %d\n",
7868 n_vtable_entries
, n_vtable_elems
);
7872 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
7873 according to [class]:
7874 The class-name is also inserted
7875 into the scope of the class itself. For purposes of access checking,
7876 the inserted class name is treated as if it were a public member name. */
7879 build_self_reference (void)
7881 tree name
= constructor_name (current_class_type
);
7882 tree value
= build_lang_decl (TYPE_DECL
, name
, current_class_type
);
7885 DECL_NONLOCAL (value
) = 1;
7886 DECL_CONTEXT (value
) = current_class_type
;
7887 DECL_ARTIFICIAL (value
) = 1;
7888 SET_DECL_SELF_REFERENCE_P (value
);
7889 set_underlying_type (value
);
7891 if (processing_template_decl
)
7892 value
= push_template_decl (value
);
7894 saved_cas
= current_access_specifier
;
7895 current_access_specifier
= access_public_node
;
7896 finish_member_declaration (value
);
7897 current_access_specifier
= saved_cas
;
7900 /* Returns 1 if TYPE contains only padding bytes. */
7903 is_empty_class (tree type
)
7905 if (type
== error_mark_node
)
7908 if (! CLASS_TYPE_P (type
))
7911 /* In G++ 3.2, whether or not a class was empty was determined by
7912 looking at its size. */
7913 if (abi_version_at_least (2))
7914 return CLASSTYPE_EMPTY_P (type
);
7916 return integer_zerop (CLASSTYPE_SIZE (type
));
7919 /* Returns true if TYPE contains an empty class. */
7922 contains_empty_class_p (tree type
)
7924 if (is_empty_class (type
))
7926 if (CLASS_TYPE_P (type
))
7933 for (binfo
= TYPE_BINFO (type
), i
= 0;
7934 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
7935 if (contains_empty_class_p (BINFO_TYPE (base_binfo
)))
7937 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
7938 if (TREE_CODE (field
) == FIELD_DECL
7939 && !DECL_ARTIFICIAL (field
)
7940 && is_empty_class (TREE_TYPE (field
)))
7943 else if (TREE_CODE (type
) == ARRAY_TYPE
)
7944 return contains_empty_class_p (TREE_TYPE (type
));
7948 /* Returns true if TYPE contains no actual data, just various
7949 possible combinations of empty classes and possibly a vptr. */
7952 is_really_empty_class (tree type
)
7954 if (CLASS_TYPE_P (type
))
7961 /* CLASSTYPE_EMPTY_P isn't set properly until the class is actually laid
7962 out, but we'd like to be able to check this before then. */
7963 if (COMPLETE_TYPE_P (type
) && is_empty_class (type
))
7966 for (binfo
= TYPE_BINFO (type
), i
= 0;
7967 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
7968 if (!is_really_empty_class (BINFO_TYPE (base_binfo
)))
7970 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
7971 if (TREE_CODE (field
) == FIELD_DECL
7972 && !DECL_ARTIFICIAL (field
)
7973 && !is_really_empty_class (TREE_TYPE (field
)))
7977 else if (TREE_CODE (type
) == ARRAY_TYPE
)
7978 return is_really_empty_class (TREE_TYPE (type
));
7982 /* Note that NAME was looked up while the current class was being
7983 defined and that the result of that lookup was DECL. */
7986 maybe_note_name_used_in_class (tree name
, tree decl
)
7988 splay_tree names_used
;
7990 /* If we're not defining a class, there's nothing to do. */
7991 if (!(innermost_scope_kind() == sk_class
7992 && TYPE_BEING_DEFINED (current_class_type
)
7993 && !LAMBDA_TYPE_P (current_class_type
)))
7996 /* If there's already a binding for this NAME, then we don't have
7997 anything to worry about. */
7998 if (lookup_member (current_class_type
, name
,
7999 /*protect=*/0, /*want_type=*/false, tf_warning_or_error
))
8002 if (!current_class_stack
[current_class_depth
- 1].names_used
)
8003 current_class_stack
[current_class_depth
- 1].names_used
8004 = splay_tree_new (splay_tree_compare_pointers
, 0, 0);
8005 names_used
= current_class_stack
[current_class_depth
- 1].names_used
;
8007 splay_tree_insert (names_used
,
8008 (splay_tree_key
) name
,
8009 (splay_tree_value
) decl
);
8012 /* Note that NAME was declared (as DECL) in the current class. Check
8013 to see that the declaration is valid. */
8016 note_name_declared_in_class (tree name
, tree decl
)
8018 splay_tree names_used
;
8021 /* Look to see if we ever used this name. */
8023 = current_class_stack
[current_class_depth
- 1].names_used
;
8026 /* The C language allows members to be declared with a type of the same
8027 name, and the C++ standard says this diagnostic is not required. So
8028 allow it in extern "C" blocks unless predantic is specified.
8029 Allow it in all cases if -ms-extensions is specified. */
8030 if ((!pedantic
&& current_lang_name
== lang_name_c
)
8031 || flag_ms_extensions
)
8033 n
= splay_tree_lookup (names_used
, (splay_tree_key
) name
);
8036 /* [basic.scope.class]
8038 A name N used in a class S shall refer to the same declaration
8039 in its context and when re-evaluated in the completed scope of
8041 permerror (input_location
, "declaration of %q#D", decl
);
8042 permerror (input_location
, "changes meaning of %qD from %q+#D",
8043 DECL_NAME (OVL_CURRENT (decl
)), (tree
) n
->value
);
8047 /* Returns the VAR_DECL for the complete vtable associated with BINFO.
8048 Secondary vtables are merged with primary vtables; this function
8049 will return the VAR_DECL for the primary vtable. */
8052 get_vtbl_decl_for_binfo (tree binfo
)
8056 decl
= BINFO_VTABLE (binfo
);
8057 if (decl
&& TREE_CODE (decl
) == POINTER_PLUS_EXPR
)
8059 gcc_assert (TREE_CODE (TREE_OPERAND (decl
, 0)) == ADDR_EXPR
);
8060 decl
= TREE_OPERAND (TREE_OPERAND (decl
, 0), 0);
8063 gcc_assert (VAR_P (decl
));
8068 /* Returns the binfo for the primary base of BINFO. If the resulting
8069 BINFO is a virtual base, and it is inherited elsewhere in the
8070 hierarchy, then the returned binfo might not be the primary base of
8071 BINFO in the complete object. Check BINFO_PRIMARY_P or
8072 BINFO_LOST_PRIMARY_P to be sure. */
8075 get_primary_binfo (tree binfo
)
8079 primary_base
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (binfo
));
8083 return copied_binfo (primary_base
, binfo
);
8086 /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */
8089 maybe_indent_hierarchy (FILE * stream
, int indent
, int indented_p
)
8092 fprintf (stream
, "%*s", indent
, "");
8096 /* Dump the offsets of all the bases rooted at BINFO to STREAM.
8097 INDENT should be zero when called from the top level; it is
8098 incremented recursively. IGO indicates the next expected BINFO in
8099 inheritance graph ordering. */
8102 dump_class_hierarchy_r (FILE *stream
,
8112 indented
= maybe_indent_hierarchy (stream
, indent
, 0);
8113 fprintf (stream
, "%s (0x" HOST_WIDE_INT_PRINT_HEX
") ",
8114 type_as_string (BINFO_TYPE (binfo
), TFF_PLAIN_IDENTIFIER
),
8115 (HOST_WIDE_INT
) (uintptr_t) binfo
);
8118 fprintf (stream
, "alternative-path\n");
8121 igo
= TREE_CHAIN (binfo
);
8123 fprintf (stream
, HOST_WIDE_INT_PRINT_DEC
,
8124 tree_to_shwi (BINFO_OFFSET (binfo
)));
8125 if (is_empty_class (BINFO_TYPE (binfo
)))
8126 fprintf (stream
, " empty");
8127 else if (CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (binfo
)))
8128 fprintf (stream
, " nearly-empty");
8129 if (BINFO_VIRTUAL_P (binfo
))
8130 fprintf (stream
, " virtual");
8131 fprintf (stream
, "\n");
8134 if (BINFO_PRIMARY_P (binfo
))
8136 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8137 fprintf (stream
, " primary-for %s (0x" HOST_WIDE_INT_PRINT_HEX
")",
8138 type_as_string (BINFO_TYPE (BINFO_INHERITANCE_CHAIN (binfo
)),
8139 TFF_PLAIN_IDENTIFIER
),
8140 (HOST_WIDE_INT
) (uintptr_t) BINFO_INHERITANCE_CHAIN (binfo
));
8142 if (BINFO_LOST_PRIMARY_P (binfo
))
8144 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8145 fprintf (stream
, " lost-primary");
8148 fprintf (stream
, "\n");
8150 if (!(flags
& TDF_SLIM
))
8154 if (BINFO_SUBVTT_INDEX (binfo
))
8156 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8157 fprintf (stream
, " subvttidx=%s",
8158 expr_as_string (BINFO_SUBVTT_INDEX (binfo
),
8159 TFF_PLAIN_IDENTIFIER
));
8161 if (BINFO_VPTR_INDEX (binfo
))
8163 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8164 fprintf (stream
, " vptridx=%s",
8165 expr_as_string (BINFO_VPTR_INDEX (binfo
),
8166 TFF_PLAIN_IDENTIFIER
));
8168 if (BINFO_VPTR_FIELD (binfo
))
8170 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8171 fprintf (stream
, " vbaseoffset=%s",
8172 expr_as_string (BINFO_VPTR_FIELD (binfo
),
8173 TFF_PLAIN_IDENTIFIER
));
8175 if (BINFO_VTABLE (binfo
))
8177 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8178 fprintf (stream
, " vptr=%s",
8179 expr_as_string (BINFO_VTABLE (binfo
),
8180 TFF_PLAIN_IDENTIFIER
));
8184 fprintf (stream
, "\n");
8187 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
8188 igo
= dump_class_hierarchy_r (stream
, flags
, base_binfo
, igo
, indent
+ 2);
8193 /* Dump the BINFO hierarchy for T. */
8196 dump_class_hierarchy_1 (FILE *stream
, int flags
, tree t
)
8198 fprintf (stream
, "Class %s\n", type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8199 fprintf (stream
, " size=%lu align=%lu\n",
8200 (unsigned long)(tree_to_shwi (TYPE_SIZE (t
)) / BITS_PER_UNIT
),
8201 (unsigned long)(TYPE_ALIGN (t
) / BITS_PER_UNIT
));
8202 fprintf (stream
, " base size=%lu base align=%lu\n",
8203 (unsigned long)(tree_to_shwi (TYPE_SIZE (CLASSTYPE_AS_BASE (t
)))
8205 (unsigned long)(TYPE_ALIGN (CLASSTYPE_AS_BASE (t
))
8207 dump_class_hierarchy_r (stream
, flags
, TYPE_BINFO (t
), TYPE_BINFO (t
), 0);
8208 fprintf (stream
, "\n");
8211 /* Debug interface to hierarchy dumping. */
8214 debug_class (tree t
)
8216 dump_class_hierarchy_1 (stderr
, TDF_SLIM
, t
);
8220 dump_class_hierarchy (tree t
)
8223 FILE *stream
= dump_begin (TDI_class
, &flags
);
8227 dump_class_hierarchy_1 (stream
, flags
, t
);
8228 dump_end (TDI_class
, stream
);
8233 dump_array (FILE * stream
, tree decl
)
8236 unsigned HOST_WIDE_INT ix
;
8238 tree size
= TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (decl
)));
8240 elt
= (tree_to_shwi (TYPE_SIZE (TREE_TYPE (TREE_TYPE (decl
))))
8242 fprintf (stream
, "%s:", decl_as_string (decl
, TFF_PLAIN_IDENTIFIER
));
8243 fprintf (stream
, " %s entries",
8244 expr_as_string (size_binop (PLUS_EXPR
, size
, size_one_node
),
8245 TFF_PLAIN_IDENTIFIER
));
8246 fprintf (stream
, "\n");
8248 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (DECL_INITIAL (decl
)),
8250 fprintf (stream
, "%-4ld %s\n", (long)(ix
* elt
),
8251 expr_as_string (value
, TFF_PLAIN_IDENTIFIER
));
8255 dump_vtable (tree t
, tree binfo
, tree vtable
)
8258 FILE *stream
= dump_begin (TDI_class
, &flags
);
8263 if (!(flags
& TDF_SLIM
))
8265 int ctor_vtbl_p
= TYPE_BINFO (t
) != binfo
;
8267 fprintf (stream
, "%s for %s",
8268 ctor_vtbl_p
? "Construction vtable" : "Vtable",
8269 type_as_string (BINFO_TYPE (binfo
), TFF_PLAIN_IDENTIFIER
));
8272 if (!BINFO_VIRTUAL_P (binfo
))
8273 fprintf (stream
, " (0x" HOST_WIDE_INT_PRINT_HEX
" instance)",
8274 (HOST_WIDE_INT
) (uintptr_t) binfo
);
8275 fprintf (stream
, " in %s", type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8277 fprintf (stream
, "\n");
8278 dump_array (stream
, vtable
);
8279 fprintf (stream
, "\n");
8282 dump_end (TDI_class
, stream
);
8286 dump_vtt (tree t
, tree vtt
)
8289 FILE *stream
= dump_begin (TDI_class
, &flags
);
8294 if (!(flags
& TDF_SLIM
))
8296 fprintf (stream
, "VTT for %s\n",
8297 type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8298 dump_array (stream
, vtt
);
8299 fprintf (stream
, "\n");
8302 dump_end (TDI_class
, stream
);
8305 /* Dump a function or thunk and its thunkees. */
8308 dump_thunk (FILE *stream
, int indent
, tree thunk
)
8310 static const char spaces
[] = " ";
8311 tree name
= DECL_NAME (thunk
);
8314 fprintf (stream
, "%.*s%p %s %s", indent
, spaces
,
8316 !DECL_THUNK_P (thunk
) ? "function"
8317 : DECL_THIS_THUNK_P (thunk
) ? "this-thunk" : "covariant-thunk",
8318 name
? IDENTIFIER_POINTER (name
) : "<unset>");
8319 if (DECL_THUNK_P (thunk
))
8321 HOST_WIDE_INT fixed_adjust
= THUNK_FIXED_OFFSET (thunk
);
8322 tree virtual_adjust
= THUNK_VIRTUAL_OFFSET (thunk
);
8324 fprintf (stream
, " fixed=" HOST_WIDE_INT_PRINT_DEC
, fixed_adjust
);
8325 if (!virtual_adjust
)
8327 else if (DECL_THIS_THUNK_P (thunk
))
8328 fprintf (stream
, " vcall=" HOST_WIDE_INT_PRINT_DEC
,
8329 tree_to_shwi (virtual_adjust
));
8331 fprintf (stream
, " vbase=" HOST_WIDE_INT_PRINT_DEC
"(%s)",
8332 tree_to_shwi (BINFO_VPTR_FIELD (virtual_adjust
)),
8333 type_as_string (BINFO_TYPE (virtual_adjust
), TFF_SCOPE
));
8334 if (THUNK_ALIAS (thunk
))
8335 fprintf (stream
, " alias to %p", (void *)THUNK_ALIAS (thunk
));
8337 fprintf (stream
, "\n");
8338 for (thunks
= DECL_THUNKS (thunk
); thunks
; thunks
= TREE_CHAIN (thunks
))
8339 dump_thunk (stream
, indent
+ 2, thunks
);
8342 /* Dump the thunks for FN. */
8345 debug_thunks (tree fn
)
8347 dump_thunk (stderr
, 0, fn
);
8350 /* Virtual function table initialization. */
8352 /* Create all the necessary vtables for T and its base classes. */
8355 finish_vtbls (tree t
)
8358 vec
<constructor_elt
, va_gc
> *v
= NULL
;
8359 tree vtable
= BINFO_VTABLE (TYPE_BINFO (t
));
8361 /* We lay out the primary and secondary vtables in one contiguous
8362 vtable. The primary vtable is first, followed by the non-virtual
8363 secondary vtables in inheritance graph order. */
8364 accumulate_vtbl_inits (TYPE_BINFO (t
), TYPE_BINFO (t
), TYPE_BINFO (t
),
8367 /* Then come the virtual bases, also in inheritance graph order. */
8368 for (vbase
= TYPE_BINFO (t
); vbase
; vbase
= TREE_CHAIN (vbase
))
8370 if (!BINFO_VIRTUAL_P (vbase
))
8372 accumulate_vtbl_inits (vbase
, vbase
, TYPE_BINFO (t
), vtable
, t
, &v
);
8375 if (BINFO_VTABLE (TYPE_BINFO (t
)))
8376 initialize_vtable (TYPE_BINFO (t
), v
);
8379 /* Initialize the vtable for BINFO with the INITS. */
8382 initialize_vtable (tree binfo
, vec
<constructor_elt
, va_gc
> *inits
)
8386 layout_vtable_decl (binfo
, vec_safe_length (inits
));
8387 decl
= get_vtbl_decl_for_binfo (binfo
);
8388 initialize_artificial_var (decl
, inits
);
8389 dump_vtable (BINFO_TYPE (binfo
), binfo
, decl
);
8392 /* Build the VTT (virtual table table) for T.
8393 A class requires a VTT if it has virtual bases.
8396 1 - primary virtual pointer for complete object T
8397 2 - secondary VTTs for each direct non-virtual base of T which requires a
8399 3 - secondary virtual pointers for each direct or indirect base of T which
8400 has virtual bases or is reachable via a virtual path from T.
8401 4 - secondary VTTs for each direct or indirect virtual base of T.
8403 Secondary VTTs look like complete object VTTs without part 4. */
8411 vec
<constructor_elt
, va_gc
> *inits
;
8413 /* Build up the initializers for the VTT. */
8415 index
= size_zero_node
;
8416 build_vtt_inits (TYPE_BINFO (t
), t
, &inits
, &index
);
8418 /* If we didn't need a VTT, we're done. */
8422 /* Figure out the type of the VTT. */
8423 type
= build_array_of_n_type (const_ptr_type_node
,
8426 /* Now, build the VTT object itself. */
8427 vtt
= build_vtable (t
, mangle_vtt_for_type (t
), type
);
8428 initialize_artificial_var (vtt
, inits
);
8429 /* Add the VTT to the vtables list. */
8430 DECL_CHAIN (vtt
) = DECL_CHAIN (CLASSTYPE_VTABLES (t
));
8431 DECL_CHAIN (CLASSTYPE_VTABLES (t
)) = vtt
;
8436 /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with
8437 PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo,
8438 and CHAIN the vtable pointer for this binfo after construction is
8439 complete. VALUE can also be another BINFO, in which case we recurse. */
8442 binfo_ctor_vtable (tree binfo
)
8448 vt
= BINFO_VTABLE (binfo
);
8449 if (TREE_CODE (vt
) == TREE_LIST
)
8450 vt
= TREE_VALUE (vt
);
8451 if (TREE_CODE (vt
) == TREE_BINFO
)
8460 /* Data for secondary VTT initialization. */
8461 typedef struct secondary_vptr_vtt_init_data_s
8463 /* Is this the primary VTT? */
8466 /* Current index into the VTT. */
8469 /* Vector of initializers built up. */
8470 vec
<constructor_elt
, va_gc
> *inits
;
8472 /* The type being constructed by this secondary VTT. */
8473 tree type_being_constructed
;
8474 } secondary_vptr_vtt_init_data
;
8476 /* Recursively build the VTT-initializer for BINFO (which is in the
8477 hierarchy dominated by T). INITS points to the end of the initializer
8478 list to date. INDEX is the VTT index where the next element will be
8479 replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e.
8480 not a subvtt for some base of T). When that is so, we emit the sub-VTTs
8481 for virtual bases of T. When it is not so, we build the constructor
8482 vtables for the BINFO-in-T variant. */
8485 build_vtt_inits (tree binfo
, tree t
, vec
<constructor_elt
, va_gc
> **inits
,
8491 secondary_vptr_vtt_init_data data
;
8492 int top_level_p
= SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
);
8494 /* We only need VTTs for subobjects with virtual bases. */
8495 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
)))
8498 /* We need to use a construction vtable if this is not the primary
8502 build_ctor_vtbl_group (binfo
, t
);
8504 /* Record the offset in the VTT where this sub-VTT can be found. */
8505 BINFO_SUBVTT_INDEX (binfo
) = *index
;
8508 /* Add the address of the primary vtable for the complete object. */
8509 init
= binfo_ctor_vtable (binfo
);
8510 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
8513 gcc_assert (!BINFO_VPTR_INDEX (binfo
));
8514 BINFO_VPTR_INDEX (binfo
) = *index
;
8516 *index
= size_binop (PLUS_EXPR
, *index
, TYPE_SIZE_UNIT (ptr_type_node
));
8518 /* Recursively add the secondary VTTs for non-virtual bases. */
8519 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, b
); ++i
)
8520 if (!BINFO_VIRTUAL_P (b
))
8521 build_vtt_inits (b
, t
, inits
, index
);
8523 /* Add secondary virtual pointers for all subobjects of BINFO with
8524 either virtual bases or reachable along a virtual path, except
8525 subobjects that are non-virtual primary bases. */
8526 data
.top_level_p
= top_level_p
;
8527 data
.index
= *index
;
8528 data
.inits
= *inits
;
8529 data
.type_being_constructed
= BINFO_TYPE (binfo
);
8531 dfs_walk_once (binfo
, dfs_build_secondary_vptr_vtt_inits
, NULL
, &data
);
8533 *index
= data
.index
;
8535 /* data.inits might have grown as we added secondary virtual pointers.
8536 Make sure our caller knows about the new vector. */
8537 *inits
= data
.inits
;
8540 /* Add the secondary VTTs for virtual bases in inheritance graph
8542 for (b
= TYPE_BINFO (BINFO_TYPE (binfo
)); b
; b
= TREE_CHAIN (b
))
8544 if (!BINFO_VIRTUAL_P (b
))
8547 build_vtt_inits (b
, t
, inits
, index
);
8550 /* Remove the ctor vtables we created. */
8551 dfs_walk_all (binfo
, dfs_fixup_binfo_vtbls
, NULL
, binfo
);
8554 /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base
8555 in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */
8558 dfs_build_secondary_vptr_vtt_inits (tree binfo
, void *data_
)
8560 secondary_vptr_vtt_init_data
*data
= (secondary_vptr_vtt_init_data
*)data_
;
8562 /* We don't care about bases that don't have vtables. */
8563 if (!TYPE_VFIELD (BINFO_TYPE (binfo
)))
8564 return dfs_skip_bases
;
8566 /* We're only interested in proper subobjects of the type being
8568 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), data
->type_being_constructed
))
8571 /* We're only interested in bases with virtual bases or reachable
8572 via a virtual path from the type being constructed. */
8573 if (!(CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
))
8574 || binfo_via_virtual (binfo
, data
->type_being_constructed
)))
8575 return dfs_skip_bases
;
8577 /* We're not interested in non-virtual primary bases. */
8578 if (!BINFO_VIRTUAL_P (binfo
) && BINFO_PRIMARY_P (binfo
))
8581 /* Record the index where this secondary vptr can be found. */
8582 if (data
->top_level_p
)
8584 gcc_assert (!BINFO_VPTR_INDEX (binfo
));
8585 BINFO_VPTR_INDEX (binfo
) = data
->index
;
8587 if (BINFO_VIRTUAL_P (binfo
))
8589 /* It's a primary virtual base, and this is not a
8590 construction vtable. Find the base this is primary of in
8591 the inheritance graph, and use that base's vtable
8593 while (BINFO_PRIMARY_P (binfo
))
8594 binfo
= BINFO_INHERITANCE_CHAIN (binfo
);
8598 /* Add the initializer for the secondary vptr itself. */
8599 CONSTRUCTOR_APPEND_ELT (data
->inits
, NULL_TREE
, binfo_ctor_vtable (binfo
));
8601 /* Advance the vtt index. */
8602 data
->index
= size_binop (PLUS_EXPR
, data
->index
,
8603 TYPE_SIZE_UNIT (ptr_type_node
));
8608 /* Called from build_vtt_inits via dfs_walk. After building
8609 constructor vtables and generating the sub-vtt from them, we need
8610 to restore the BINFO_VTABLES that were scribbled on. DATA is the
8611 binfo of the base whose sub vtt was generated. */
8614 dfs_fixup_binfo_vtbls (tree binfo
, void* data
)
8616 tree vtable
= BINFO_VTABLE (binfo
);
8618 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
8619 /* If this class has no vtable, none of its bases do. */
8620 return dfs_skip_bases
;
8623 /* This might be a primary base, so have no vtable in this
8627 /* If we scribbled the construction vtable vptr into BINFO, clear it
8629 if (TREE_CODE (vtable
) == TREE_LIST
8630 && (TREE_PURPOSE (vtable
) == (tree
) data
))
8631 BINFO_VTABLE (binfo
) = TREE_CHAIN (vtable
);
8636 /* Build the construction vtable group for BINFO which is in the
8637 hierarchy dominated by T. */
8640 build_ctor_vtbl_group (tree binfo
, tree t
)
8646 vec
<constructor_elt
, va_gc
> *v
;
8648 /* See if we've already created this construction vtable group. */
8649 id
= mangle_ctor_vtbl_for_type (t
, binfo
);
8650 if (IDENTIFIER_GLOBAL_VALUE (id
))
8653 gcc_assert (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
));
8654 /* Build a version of VTBL (with the wrong type) for use in
8655 constructing the addresses of secondary vtables in the
8656 construction vtable group. */
8657 vtbl
= build_vtable (t
, id
, ptr_type_node
);
8658 DECL_CONSTRUCTION_VTABLE_P (vtbl
) = 1;
8659 /* Don't export construction vtables from shared libraries. Even on
8660 targets that don't support hidden visibility, this tells
8661 can_refer_decl_in_current_unit_p not to assume that it's safe to
8662 access from a different compilation unit (bz 54314). */
8663 DECL_VISIBILITY (vtbl
) = VISIBILITY_HIDDEN
;
8664 DECL_VISIBILITY_SPECIFIED (vtbl
) = true;
8667 accumulate_vtbl_inits (binfo
, TYPE_BINFO (TREE_TYPE (binfo
)),
8668 binfo
, vtbl
, t
, &v
);
8670 /* Add the vtables for each of our virtual bases using the vbase in T
8672 for (vbase
= TYPE_BINFO (BINFO_TYPE (binfo
));
8674 vbase
= TREE_CHAIN (vbase
))
8678 if (!BINFO_VIRTUAL_P (vbase
))
8680 b
= copied_binfo (vbase
, binfo
);
8682 accumulate_vtbl_inits (b
, vbase
, binfo
, vtbl
, t
, &v
);
8685 /* Figure out the type of the construction vtable. */
8686 type
= build_array_of_n_type (vtable_entry_type
, v
->length ());
8688 TREE_TYPE (vtbl
) = type
;
8689 DECL_SIZE (vtbl
) = DECL_SIZE_UNIT (vtbl
) = NULL_TREE
;
8690 layout_decl (vtbl
, 0);
8692 /* Initialize the construction vtable. */
8693 CLASSTYPE_VTABLES (t
) = chainon (CLASSTYPE_VTABLES (t
), vtbl
);
8694 initialize_artificial_var (vtbl
, v
);
8695 dump_vtable (t
, binfo
, vtbl
);
8698 /* Add the vtbl initializers for BINFO (and its bases other than
8699 non-virtual primaries) to the list of INITS. BINFO is in the
8700 hierarchy dominated by T. RTTI_BINFO is the binfo within T of
8701 the constructor the vtbl inits should be accumulated for. (If this
8702 is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).)
8703 ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO).
8704 BINFO is the active base equivalent of ORIG_BINFO in the inheritance
8705 graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE,
8706 but are not necessarily the same in terms of layout. */
8709 accumulate_vtbl_inits (tree binfo
,
8714 vec
<constructor_elt
, va_gc
> **inits
)
8718 int ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8720 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), BINFO_TYPE (orig_binfo
)));
8722 /* If it doesn't have a vptr, we don't do anything. */
8723 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
8726 /* If we're building a construction vtable, we're not interested in
8727 subobjects that don't require construction vtables. */
8729 && !CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
))
8730 && !binfo_via_virtual (orig_binfo
, BINFO_TYPE (rtti_binfo
)))
8733 /* Build the initializers for the BINFO-in-T vtable. */
8734 dfs_accumulate_vtbl_inits (binfo
, orig_binfo
, rtti_binfo
, vtbl
, t
, inits
);
8736 /* Walk the BINFO and its bases. We walk in preorder so that as we
8737 initialize each vtable we can figure out at what offset the
8738 secondary vtable lies from the primary vtable. We can't use
8739 dfs_walk here because we need to iterate through bases of BINFO
8740 and RTTI_BINFO simultaneously. */
8741 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
8743 /* Skip virtual bases. */
8744 if (BINFO_VIRTUAL_P (base_binfo
))
8746 accumulate_vtbl_inits (base_binfo
,
8747 BINFO_BASE_BINFO (orig_binfo
, i
),
8748 rtti_binfo
, vtbl
, t
,
8753 /* Called from accumulate_vtbl_inits. Adds the initializers for the
8754 BINFO vtable to L. */
8757 dfs_accumulate_vtbl_inits (tree binfo
,
8762 vec
<constructor_elt
, va_gc
> **l
)
8764 tree vtbl
= NULL_TREE
;
8765 int ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8769 && BINFO_VIRTUAL_P (orig_binfo
) && BINFO_PRIMARY_P (orig_binfo
))
8771 /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a
8772 primary virtual base. If it is not the same primary in
8773 the hierarchy of T, we'll need to generate a ctor vtable
8774 for it, to place at its location in T. If it is the same
8775 primary, we still need a VTT entry for the vtable, but it
8776 should point to the ctor vtable for the base it is a
8777 primary for within the sub-hierarchy of RTTI_BINFO.
8779 There are three possible cases:
8781 1) We are in the same place.
8782 2) We are a primary base within a lost primary virtual base of
8784 3) We are primary to something not a base of RTTI_BINFO. */
8787 tree last
= NULL_TREE
;
8789 /* First, look through the bases we are primary to for RTTI_BINFO
8790 or a virtual base. */
8792 while (BINFO_PRIMARY_P (b
))
8794 b
= BINFO_INHERITANCE_CHAIN (b
);
8796 if (BINFO_VIRTUAL_P (b
) || b
== rtti_binfo
)
8799 /* If we run out of primary links, keep looking down our
8800 inheritance chain; we might be an indirect primary. */
8801 for (b
= last
; b
; b
= BINFO_INHERITANCE_CHAIN (b
))
8802 if (BINFO_VIRTUAL_P (b
) || b
== rtti_binfo
)
8806 /* If we found RTTI_BINFO, this is case 1. If we found a virtual
8807 base B and it is a base of RTTI_BINFO, this is case 2. In
8808 either case, we share our vtable with LAST, i.e. the
8809 derived-most base within B of which we are a primary. */
8811 || (b
&& binfo_for_vbase (BINFO_TYPE (b
), BINFO_TYPE (rtti_binfo
))))
8812 /* Just set our BINFO_VTABLE to point to LAST, as we may not have
8813 set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in
8814 binfo_ctor_vtable after everything's been set up. */
8817 /* Otherwise, this is case 3 and we get our own. */
8819 else if (!BINFO_NEW_VTABLE_MARKED (orig_binfo
))
8822 n_inits
= vec_safe_length (*l
);
8829 /* Add the initializer for this vtable. */
8830 build_vtbl_initializer (binfo
, orig_binfo
, t
, rtti_binfo
,
8831 &non_fn_entries
, l
);
8833 /* Figure out the position to which the VPTR should point. */
8834 vtbl
= build1 (ADDR_EXPR
, vtbl_ptr_type_node
, orig_vtbl
);
8835 index
= size_binop (MULT_EXPR
,
8836 TYPE_SIZE_UNIT (vtable_entry_type
),
8837 size_int (non_fn_entries
+ n_inits
));
8838 vtbl
= fold_build_pointer_plus (vtbl
, index
);
8842 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
8843 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
8844 straighten this out. */
8845 BINFO_VTABLE (binfo
) = tree_cons (rtti_binfo
, vtbl
, BINFO_VTABLE (binfo
));
8846 else if (BINFO_PRIMARY_P (binfo
) && BINFO_VIRTUAL_P (binfo
))
8847 /* Throw away any unneeded intializers. */
8848 (*l
)->truncate (n_inits
);
8850 /* For an ordinary vtable, set BINFO_VTABLE. */
8851 BINFO_VTABLE (binfo
) = vtbl
;
8854 static GTY(()) tree abort_fndecl_addr
;
8856 /* Construct the initializer for BINFO's virtual function table. BINFO
8857 is part of the hierarchy dominated by T. If we're building a
8858 construction vtable, the ORIG_BINFO is the binfo we should use to
8859 find the actual function pointers to put in the vtable - but they
8860 can be overridden on the path to most-derived in the graph that
8861 ORIG_BINFO belongs. Otherwise,
8862 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
8863 BINFO that should be indicated by the RTTI information in the
8864 vtable; it will be a base class of T, rather than T itself, if we
8865 are building a construction vtable.
8867 The value returned is a TREE_LIST suitable for wrapping in a
8868 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
8869 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
8870 number of non-function entries in the vtable.
8872 It might seem that this function should never be called with a
8873 BINFO for which BINFO_PRIMARY_P holds, the vtable for such a
8874 base is always subsumed by a derived class vtable. However, when
8875 we are building construction vtables, we do build vtables for
8876 primary bases; we need these while the primary base is being
8880 build_vtbl_initializer (tree binfo
,
8884 int* non_fn_entries_p
,
8885 vec
<constructor_elt
, va_gc
> **inits
)
8891 vec
<tree
, va_gc
> *vbases
;
8894 /* Initialize VID. */
8895 memset (&vid
, 0, sizeof (vid
));
8898 vid
.rtti_binfo
= rtti_binfo
;
8899 vid
.primary_vtbl_p
= SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
);
8900 vid
.ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8901 vid
.generate_vcall_entries
= true;
8902 /* The first vbase or vcall offset is at index -3 in the vtable. */
8903 vid
.index
= ssize_int(-3 * TARGET_VTABLE_DATA_ENTRY_DISTANCE
);
8905 /* Add entries to the vtable for RTTI. */
8906 build_rtti_vtbl_entries (binfo
, &vid
);
8908 /* Create an array for keeping track of the functions we've
8909 processed. When we see multiple functions with the same
8910 signature, we share the vcall offsets. */
8911 vec_alloc (vid
.fns
, 32);
8912 /* Add the vcall and vbase offset entries. */
8913 build_vcall_and_vbase_vtbl_entries (binfo
, &vid
);
8915 /* Clear BINFO_VTABLE_PATH_MARKED; it's set by
8916 build_vbase_offset_vtbl_entries. */
8917 for (vbases
= CLASSTYPE_VBASECLASSES (t
), ix
= 0;
8918 vec_safe_iterate (vbases
, ix
, &vbinfo
); ix
++)
8919 BINFO_VTABLE_PATH_MARKED (vbinfo
) = 0;
8921 /* If the target requires padding between data entries, add that now. */
8922 if (TARGET_VTABLE_DATA_ENTRY_DISTANCE
> 1)
8924 int n_entries
= vec_safe_length (vid
.inits
);
8926 vec_safe_grow (vid
.inits
, TARGET_VTABLE_DATA_ENTRY_DISTANCE
* n_entries
);
8928 /* Move data entries into their new positions and add padding
8929 after the new positions. Iterate backwards so we don't
8930 overwrite entries that we would need to process later. */
8931 for (ix
= n_entries
- 1;
8932 vid
.inits
->iterate (ix
, &e
);
8936 int new_position
= (TARGET_VTABLE_DATA_ENTRY_DISTANCE
* ix
8937 + (TARGET_VTABLE_DATA_ENTRY_DISTANCE
- 1));
8939 (*vid
.inits
)[new_position
] = *e
;
8941 for (j
= 1; j
< TARGET_VTABLE_DATA_ENTRY_DISTANCE
; ++j
)
8943 constructor_elt
*f
= &(*vid
.inits
)[new_position
- j
];
8944 f
->index
= NULL_TREE
;
8945 f
->value
= build1 (NOP_EXPR
, vtable_entry_type
,
8951 if (non_fn_entries_p
)
8952 *non_fn_entries_p
= vec_safe_length (vid
.inits
);
8954 /* The initializers for virtual functions were built up in reverse
8955 order. Straighten them out and add them to the running list in one
8957 jx
= vec_safe_length (*inits
);
8958 vec_safe_grow (*inits
, jx
+ vid
.inits
->length ());
8960 for (ix
= vid
.inits
->length () - 1;
8961 vid
.inits
->iterate (ix
, &e
);
8965 /* Go through all the ordinary virtual functions, building up
8967 for (v
= BINFO_VIRTUALS (orig_binfo
); v
; v
= TREE_CHAIN (v
))
8971 tree fn
, fn_original
;
8972 tree init
= NULL_TREE
;
8976 if (DECL_THUNK_P (fn
))
8978 if (!DECL_NAME (fn
))
8980 if (THUNK_ALIAS (fn
))
8982 fn
= THUNK_ALIAS (fn
);
8985 fn_original
= THUNK_TARGET (fn
);
8988 /* If the only definition of this function signature along our
8989 primary base chain is from a lost primary, this vtable slot will
8990 never be used, so just zero it out. This is important to avoid
8991 requiring extra thunks which cannot be generated with the function.
8993 We first check this in update_vtable_entry_for_fn, so we handle
8994 restored primary bases properly; we also need to do it here so we
8995 zero out unused slots in ctor vtables, rather than filling them
8996 with erroneous values (though harmless, apart from relocation
8998 if (BV_LOST_PRIMARY (v
))
8999 init
= size_zero_node
;
9003 /* Pull the offset for `this', and the function to call, out of
9005 delta
= BV_DELTA (v
);
9006 vcall_index
= BV_VCALL_INDEX (v
);
9008 gcc_assert (TREE_CODE (delta
) == INTEGER_CST
);
9009 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
9011 /* You can't call an abstract virtual function; it's abstract.
9012 So, we replace these functions with __pure_virtual. */
9013 if (DECL_PURE_VIRTUAL_P (fn_original
))
9016 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
9018 if (abort_fndecl_addr
== NULL
)
9020 = fold_convert (vfunc_ptr_type_node
,
9021 build_fold_addr_expr (fn
));
9022 init
= abort_fndecl_addr
;
9025 /* Likewise for deleted virtuals. */
9026 else if (DECL_DELETED_FN (fn_original
))
9028 fn
= get_identifier ("__cxa_deleted_virtual");
9029 if (!get_global_value_if_present (fn
, &fn
))
9030 fn
= push_library_fn (fn
, (build_function_type_list
9031 (void_type_node
, NULL_TREE
)),
9032 NULL_TREE
, ECF_NORETURN
);
9033 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
9034 init
= fold_convert (vfunc_ptr_type_node
,
9035 build_fold_addr_expr (fn
));
9039 if (!integer_zerop (delta
) || vcall_index
)
9041 fn
= make_thunk (fn
, /*this_adjusting=*/1, delta
, vcall_index
);
9042 if (!DECL_NAME (fn
))
9045 /* Take the address of the function, considering it to be of an
9046 appropriate generic type. */
9047 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
9048 init
= fold_convert (vfunc_ptr_type_node
,
9049 build_fold_addr_expr (fn
));
9050 /* Don't refer to a virtual destructor from a constructor
9051 vtable or a vtable for an abstract class, since destroying
9052 an object under construction is undefined behavior and we
9053 don't want it to be considered a candidate for speculative
9054 devirtualization. But do create the thunk for ABI
9056 if (DECL_DESTRUCTOR_P (fn_original
)
9057 && (CLASSTYPE_PURE_VIRTUALS (DECL_CONTEXT (fn_original
))
9058 || orig_binfo
!= binfo
))
9059 init
= size_zero_node
;
9063 /* And add it to the chain of initializers. */
9064 if (TARGET_VTABLE_USES_DESCRIPTORS
)
9067 if (init
== size_zero_node
)
9068 for (i
= 0; i
< TARGET_VTABLE_USES_DESCRIPTORS
; ++i
)
9069 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
9071 for (i
= 0; i
< TARGET_VTABLE_USES_DESCRIPTORS
; ++i
)
9073 tree fdesc
= build2 (FDESC_EXPR
, vfunc_ptr_type_node
,
9074 fn
, build_int_cst (NULL_TREE
, i
));
9075 TREE_CONSTANT (fdesc
) = 1;
9077 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, fdesc
);
9081 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
9085 /* Adds to vid->inits the initializers for the vbase and vcall
9086 offsets in BINFO, which is in the hierarchy dominated by T. */
9089 build_vcall_and_vbase_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9093 /* If this is a derived class, we must first create entries
9094 corresponding to the primary base class. */
9095 b
= get_primary_binfo (binfo
);
9097 build_vcall_and_vbase_vtbl_entries (b
, vid
);
9099 /* Add the vbase entries for this base. */
9100 build_vbase_offset_vtbl_entries (binfo
, vid
);
9101 /* Add the vcall entries for this base. */
9102 build_vcall_offset_vtbl_entries (binfo
, vid
);
9105 /* Returns the initializers for the vbase offset entries in the vtable
9106 for BINFO (which is part of the class hierarchy dominated by T), in
9107 reverse order. VBASE_OFFSET_INDEX gives the vtable index
9108 where the next vbase offset will go. */
9111 build_vbase_offset_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9115 tree non_primary_binfo
;
9117 /* If there are no virtual baseclasses, then there is nothing to
9119 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
)))
9124 /* We might be a primary base class. Go up the inheritance hierarchy
9125 until we find the most derived class of which we are a primary base:
9126 it is the offset of that which we need to use. */
9127 non_primary_binfo
= binfo
;
9128 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo
))
9132 /* If we have reached a virtual base, then it must be a primary
9133 base (possibly multi-level) of vid->binfo, or we wouldn't
9134 have called build_vcall_and_vbase_vtbl_entries for it. But it
9135 might be a lost primary, so just skip down to vid->binfo. */
9136 if (BINFO_VIRTUAL_P (non_primary_binfo
))
9138 non_primary_binfo
= vid
->binfo
;
9142 b
= BINFO_INHERITANCE_CHAIN (non_primary_binfo
);
9143 if (get_primary_binfo (b
) != non_primary_binfo
)
9145 non_primary_binfo
= b
;
9148 /* Go through the virtual bases, adding the offsets. */
9149 for (vbase
= TYPE_BINFO (BINFO_TYPE (binfo
));
9151 vbase
= TREE_CHAIN (vbase
))
9156 if (!BINFO_VIRTUAL_P (vbase
))
9159 /* Find the instance of this virtual base in the complete
9161 b
= copied_binfo (vbase
, binfo
);
9163 /* If we've already got an offset for this virtual base, we
9164 don't need another one. */
9165 if (BINFO_VTABLE_PATH_MARKED (b
))
9167 BINFO_VTABLE_PATH_MARKED (b
) = 1;
9169 /* Figure out where we can find this vbase offset. */
9170 delta
= size_binop (MULT_EXPR
,
9173 TYPE_SIZE_UNIT (vtable_entry_type
)));
9174 if (vid
->primary_vtbl_p
)
9175 BINFO_VPTR_FIELD (b
) = delta
;
9177 if (binfo
!= TYPE_BINFO (t
))
9178 /* The vbase offset had better be the same. */
9179 gcc_assert (tree_int_cst_equal (delta
, BINFO_VPTR_FIELD (vbase
)));
9181 /* The next vbase will come at a more negative offset. */
9182 vid
->index
= size_binop (MINUS_EXPR
, vid
->index
,
9183 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE
));
9185 /* The initializer is the delta from BINFO to this virtual base.
9186 The vbase offsets go in reverse inheritance-graph order, and
9187 we are walking in inheritance graph order so these end up in
9189 delta
= size_diffop_loc (input_location
,
9190 BINFO_OFFSET (b
), BINFO_OFFSET (non_primary_binfo
));
9192 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
,
9193 fold_build1_loc (input_location
, NOP_EXPR
,
9194 vtable_entry_type
, delta
));
9198 /* Adds the initializers for the vcall offset entries in the vtable
9199 for BINFO (which is part of the class hierarchy dominated by VID->DERIVED)
9203 build_vcall_offset_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9205 /* We only need these entries if this base is a virtual base. We
9206 compute the indices -- but do not add to the vtable -- when
9207 building the main vtable for a class. */
9208 if (binfo
== TYPE_BINFO (vid
->derived
)
9209 || (BINFO_VIRTUAL_P (binfo
)
9210 /* If BINFO is RTTI_BINFO, then (since BINFO does not
9211 correspond to VID->DERIVED), we are building a primary
9212 construction virtual table. Since this is a primary
9213 virtual table, we do not need the vcall offsets for
9215 && binfo
!= vid
->rtti_binfo
))
9217 /* We need a vcall offset for each of the virtual functions in this
9218 vtable. For example:
9220 class A { virtual void f (); };
9221 class B1 : virtual public A { virtual void f (); };
9222 class B2 : virtual public A { virtual void f (); };
9223 class C: public B1, public B2 { virtual void f (); };
9225 A C object has a primary base of B1, which has a primary base of A. A
9226 C also has a secondary base of B2, which no longer has a primary base
9227 of A. So the B2-in-C construction vtable needs a secondary vtable for
9228 A, which will adjust the A* to a B2* to call f. We have no way of
9229 knowing what (or even whether) this offset will be when we define B2,
9230 so we store this "vcall offset" in the A sub-vtable and look it up in
9231 a "virtual thunk" for B2::f.
9233 We need entries for all the functions in our primary vtable and
9234 in our non-virtual bases' secondary vtables. */
9236 /* If we are just computing the vcall indices -- but do not need
9237 the actual entries -- not that. */
9238 if (!BINFO_VIRTUAL_P (binfo
))
9239 vid
->generate_vcall_entries
= false;
9240 /* Now, walk through the non-virtual bases, adding vcall offsets. */
9241 add_vcall_offset_vtbl_entries_r (binfo
, vid
);
9245 /* Build vcall offsets, starting with those for BINFO. */
9248 add_vcall_offset_vtbl_entries_r (tree binfo
, vtbl_init_data
* vid
)
9254 /* Don't walk into virtual bases -- except, of course, for the
9255 virtual base for which we are building vcall offsets. Any
9256 primary virtual base will have already had its offsets generated
9257 through the recursion in build_vcall_and_vbase_vtbl_entries. */
9258 if (BINFO_VIRTUAL_P (binfo
) && vid
->vbase
!= binfo
)
9261 /* If BINFO has a primary base, process it first. */
9262 primary_binfo
= get_primary_binfo (binfo
);
9264 add_vcall_offset_vtbl_entries_r (primary_binfo
, vid
);
9266 /* Add BINFO itself to the list. */
9267 add_vcall_offset_vtbl_entries_1 (binfo
, vid
);
9269 /* Scan the non-primary bases of BINFO. */
9270 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
9271 if (base_binfo
!= primary_binfo
)
9272 add_vcall_offset_vtbl_entries_r (base_binfo
, vid
);
9275 /* Called from build_vcall_offset_vtbl_entries_r. */
9278 add_vcall_offset_vtbl_entries_1 (tree binfo
, vtbl_init_data
* vid
)
9280 /* Make entries for the rest of the virtuals. */
9281 if (abi_version_at_least (2))
9285 /* The ABI requires that the methods be processed in declaration
9286 order. G++ 3.2 used the order in the vtable. */
9287 for (orig_fn
= TYPE_METHODS (BINFO_TYPE (binfo
));
9289 orig_fn
= DECL_CHAIN (orig_fn
))
9290 if (DECL_VINDEX (orig_fn
))
9291 add_vcall_offset (orig_fn
, binfo
, vid
);
9295 tree derived_virtuals
;
9298 /* If BINFO is a primary base, the most derived class which has
9299 BINFO as a primary base; otherwise, just BINFO. */
9300 tree non_primary_binfo
;
9302 /* We might be a primary base class. Go up the inheritance hierarchy
9303 until we find the most derived class of which we are a primary base:
9304 it is the BINFO_VIRTUALS there that we need to consider. */
9305 non_primary_binfo
= binfo
;
9306 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo
))
9310 /* If we have reached a virtual base, then it must be vid->vbase,
9311 because we ignore other virtual bases in
9312 add_vcall_offset_vtbl_entries_r. In turn, it must be a primary
9313 base (possibly multi-level) of vid->binfo, or we wouldn't
9314 have called build_vcall_and_vbase_vtbl_entries for it. But it
9315 might be a lost primary, so just skip down to vid->binfo. */
9316 if (BINFO_VIRTUAL_P (non_primary_binfo
))
9318 gcc_assert (non_primary_binfo
== vid
->vbase
);
9319 non_primary_binfo
= vid
->binfo
;
9323 b
= BINFO_INHERITANCE_CHAIN (non_primary_binfo
);
9324 if (get_primary_binfo (b
) != non_primary_binfo
)
9326 non_primary_binfo
= b
;
9329 if (vid
->ctor_vtbl_p
)
9330 /* For a ctor vtable we need the equivalent binfo within the hierarchy
9331 where rtti_binfo is the most derived type. */
9333 = original_binfo (non_primary_binfo
, vid
->rtti_binfo
);
9335 for (base_virtuals
= BINFO_VIRTUALS (binfo
),
9336 derived_virtuals
= BINFO_VIRTUALS (non_primary_binfo
),
9337 orig_virtuals
= BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo
)));
9339 base_virtuals
= TREE_CHAIN (base_virtuals
),
9340 derived_virtuals
= TREE_CHAIN (derived_virtuals
),
9341 orig_virtuals
= TREE_CHAIN (orig_virtuals
))
9345 /* Find the declaration that originally caused this function to
9346 be present in BINFO_TYPE (binfo). */
9347 orig_fn
= BV_FN (orig_virtuals
);
9349 /* When processing BINFO, we only want to generate vcall slots for
9350 function slots introduced in BINFO. So don't try to generate
9351 one if the function isn't even defined in BINFO. */
9352 if (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), DECL_CONTEXT (orig_fn
)))
9355 add_vcall_offset (orig_fn
, binfo
, vid
);
9360 /* Add a vcall offset entry for ORIG_FN to the vtable. */
9363 add_vcall_offset (tree orig_fn
, tree binfo
, vtbl_init_data
*vid
)
9369 /* If there is already an entry for a function with the same
9370 signature as FN, then we do not need a second vcall offset.
9371 Check the list of functions already present in the derived
9373 FOR_EACH_VEC_SAFE_ELT (vid
->fns
, i
, derived_entry
)
9375 if (same_signature_p (derived_entry
, orig_fn
)
9376 /* We only use one vcall offset for virtual destructors,
9377 even though there are two virtual table entries. */
9378 || (DECL_DESTRUCTOR_P (derived_entry
)
9379 && DECL_DESTRUCTOR_P (orig_fn
)))
9383 /* If we are building these vcall offsets as part of building
9384 the vtable for the most derived class, remember the vcall
9386 if (vid
->binfo
== TYPE_BINFO (vid
->derived
))
9388 tree_pair_s elt
= {orig_fn
, vid
->index
};
9389 vec_safe_push (CLASSTYPE_VCALL_INDICES (vid
->derived
), elt
);
9392 /* The next vcall offset will be found at a more negative
9394 vid
->index
= size_binop (MINUS_EXPR
, vid
->index
,
9395 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE
));
9397 /* Keep track of this function. */
9398 vec_safe_push (vid
->fns
, orig_fn
);
9400 if (vid
->generate_vcall_entries
)
9405 /* Find the overriding function. */
9406 fn
= find_final_overrider (vid
->rtti_binfo
, binfo
, orig_fn
);
9407 if (fn
== error_mark_node
)
9408 vcall_offset
= build_zero_cst (vtable_entry_type
);
9411 base
= TREE_VALUE (fn
);
9413 /* The vbase we're working on is a primary base of
9414 vid->binfo. But it might be a lost primary, so its
9415 BINFO_OFFSET might be wrong, so we just use the
9416 BINFO_OFFSET from vid->binfo. */
9417 vcall_offset
= size_diffop_loc (input_location
,
9418 BINFO_OFFSET (base
),
9419 BINFO_OFFSET (vid
->binfo
));
9420 vcall_offset
= fold_build1_loc (input_location
,
9421 NOP_EXPR
, vtable_entry_type
,
9424 /* Add the initializer to the vtable. */
9425 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, vcall_offset
);
9429 /* Return vtbl initializers for the RTTI entries corresponding to the
9430 BINFO's vtable. The RTTI entries should indicate the object given
9431 by VID->rtti_binfo. */
9434 build_rtti_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9442 t
= BINFO_TYPE (vid
->rtti_binfo
);
9444 /* To find the complete object, we will first convert to our most
9445 primary base, and then add the offset in the vtbl to that value. */
9447 while (CLASSTYPE_HAS_PRIMARY_BASE_P (BINFO_TYPE (b
))
9448 && !BINFO_LOST_PRIMARY_P (b
))
9452 primary_base
= get_primary_binfo (b
);
9453 gcc_assert (BINFO_PRIMARY_P (primary_base
)
9454 && BINFO_INHERITANCE_CHAIN (primary_base
) == b
);
9457 offset
= size_diffop_loc (input_location
,
9458 BINFO_OFFSET (vid
->rtti_binfo
), BINFO_OFFSET (b
));
9460 /* The second entry is the address of the typeinfo object. */
9462 decl
= build_address (get_tinfo_decl (t
));
9464 decl
= integer_zero_node
;
9466 /* Convert the declaration to a type that can be stored in the
9468 init
= build_nop (vfunc_ptr_type_node
, decl
);
9469 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, init
);
9471 /* Add the offset-to-top entry. It comes earlier in the vtable than
9472 the typeinfo entry. Convert the offset to look like a
9473 function pointer, so that we can put it in the vtable. */
9474 init
= build_nop (vfunc_ptr_type_node
, offset
);
9475 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, init
);
9478 /* TRUE iff TYPE is uniquely derived from PARENT. Ignores
9482 uniquely_derived_from_p (tree parent
, tree type
)
9484 tree base
= lookup_base (type
, parent
, ba_unique
, NULL
, tf_none
);
9485 return base
&& base
!= error_mark_node
;
9488 /* TRUE iff TYPE is publicly & uniquely derived from PARENT. */
9491 publicly_uniquely_derived_p (tree parent
, tree type
)
9493 tree base
= lookup_base (type
, parent
, ba_ignore_scope
| ba_check
,
9495 return base
&& base
!= error_mark_node
;
9498 /* CTX1 and CTX2 are declaration contexts. Return the innermost common
9499 class between them, if any. */
9502 common_enclosing_class (tree ctx1
, tree ctx2
)
9504 if (!TYPE_P (ctx1
) || !TYPE_P (ctx2
))
9506 gcc_assert (ctx1
== TYPE_MAIN_VARIANT (ctx1
)
9507 && ctx2
== TYPE_MAIN_VARIANT (ctx2
));
9510 for (tree t
= ctx1
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9511 TYPE_MARKED_P (t
) = true;
9512 tree found
= NULL_TREE
;
9513 for (tree t
= ctx2
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9514 if (TYPE_MARKED_P (t
))
9519 for (tree t
= ctx1
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9520 TYPE_MARKED_P (t
) = false;
9524 #include "gt-cp-class.h"