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 "hash-table.h"
40 #include "splay-tree.h"
44 /* The number of nested classes being processed. If we are not in the
45 scope of any class, this is zero. */
47 int current_class_depth
;
49 /* In order to deal with nested classes, we keep a stack of classes.
50 The topmost entry is the innermost class, and is the entry at index
51 CURRENT_CLASS_DEPTH */
53 typedef struct class_stack_node
{
54 /* The name of the class. */
57 /* The _TYPE node for the class. */
60 /* The access specifier pending for new declarations in the scope of
64 /* If were defining TYPE, the names used in this class. */
65 splay_tree names_used
;
67 /* Nonzero if this class is no longer open, because of a call to
70 }* class_stack_node_t
;
72 typedef struct vtbl_init_data_s
74 /* The base for which we're building initializers. */
76 /* The type of the most-derived type. */
78 /* The binfo for the dynamic type. This will be TYPE_BINFO (derived),
79 unless ctor_vtbl_p is true. */
81 /* The negative-index vtable initializers built up so far. These
82 are in order from least negative index to most negative index. */
83 vec
<constructor_elt
, va_gc
> *inits
;
84 /* The binfo for the virtual base for which we're building
85 vcall offset initializers. */
87 /* The functions in vbase for which we have already provided vcall
89 vec
<tree
, va_gc
> *fns
;
90 /* The vtable index of the next vcall or vbase offset. */
92 /* Nonzero if we are building the initializer for the primary
95 /* Nonzero if we are building the initializer for a construction
98 /* True when adding vcall offset entries to the vtable. False when
99 merely computing the indices. */
100 bool generate_vcall_entries
;
103 /* The type of a function passed to walk_subobject_offsets. */
104 typedef int (*subobject_offset_fn
) (tree
, tree
, splay_tree
);
106 /* The stack itself. This is a dynamically resized array. The
107 number of elements allocated is CURRENT_CLASS_STACK_SIZE. */
108 static int current_class_stack_size
;
109 static class_stack_node_t current_class_stack
;
111 /* The size of the largest empty class seen in this translation unit. */
112 static GTY (()) tree sizeof_biggest_empty_class
;
114 /* An array of all local classes present in this translation unit, in
115 declaration order. */
116 vec
<tree
, va_gc
> *local_classes
;
118 static tree
get_vfield_name (tree
);
119 static void finish_struct_anon (tree
);
120 static tree
get_vtable_name (tree
);
121 static tree
get_basefndecls (tree
, tree
);
122 static int build_primary_vtable (tree
, tree
);
123 static int build_secondary_vtable (tree
);
124 static void finish_vtbls (tree
);
125 static void modify_vtable_entry (tree
, tree
, tree
, tree
, tree
*);
126 static void finish_struct_bits (tree
);
127 static int alter_access (tree
, tree
, tree
);
128 static void handle_using_decl (tree
, tree
);
129 static tree
dfs_modify_vtables (tree
, void *);
130 static tree
modify_all_vtables (tree
, tree
);
131 static void determine_primary_bases (tree
);
132 static void finish_struct_methods (tree
);
133 static void maybe_warn_about_overly_private_class (tree
);
134 static int method_name_cmp (const void *, const void *);
135 static int resort_method_name_cmp (const void *, const void *);
136 static void add_implicitly_declared_members (tree
, tree
*, int, int);
137 static tree
fixed_type_or_null (tree
, int *, int *);
138 static tree
build_simple_base_path (tree expr
, tree binfo
);
139 static tree
build_vtbl_ref_1 (tree
, tree
);
140 static void build_vtbl_initializer (tree
, tree
, tree
, tree
, int *,
141 vec
<constructor_elt
, va_gc
> **);
142 static int count_fields (tree
);
143 static int add_fields_to_record_type (tree
, struct sorted_fields_type
*, int);
144 static void insert_into_classtype_sorted_fields (tree
, tree
, int);
145 static bool check_bitfield_decl (tree
);
146 static void check_field_decl (tree
, tree
, int *, int *, int *);
147 static void check_field_decls (tree
, tree
*, int *, int *);
148 static tree
*build_base_field (record_layout_info
, tree
, splay_tree
, tree
*);
149 static void build_base_fields (record_layout_info
, splay_tree
, tree
*);
150 static void check_methods (tree
);
151 static void remove_zero_width_bit_fields (tree
);
152 static bool accessible_nvdtor_p (tree
);
153 static void check_bases (tree
, int *, int *);
154 static void check_bases_and_members (tree
);
155 static tree
create_vtable_ptr (tree
, tree
*);
156 static void include_empty_classes (record_layout_info
);
157 static void layout_class_type (tree
, tree
*);
158 static void propagate_binfo_offsets (tree
, tree
);
159 static void layout_virtual_bases (record_layout_info
, splay_tree
);
160 static void build_vbase_offset_vtbl_entries (tree
, vtbl_init_data
*);
161 static void add_vcall_offset_vtbl_entries_r (tree
, vtbl_init_data
*);
162 static void add_vcall_offset_vtbl_entries_1 (tree
, vtbl_init_data
*);
163 static void build_vcall_offset_vtbl_entries (tree
, vtbl_init_data
*);
164 static void add_vcall_offset (tree
, tree
, vtbl_init_data
*);
165 static void layout_vtable_decl (tree
, int);
166 static tree
dfs_find_final_overrider_pre (tree
, void *);
167 static tree
dfs_find_final_overrider_post (tree
, void *);
168 static tree
find_final_overrider (tree
, tree
, tree
);
169 static int make_new_vtable (tree
, tree
);
170 static tree
get_primary_binfo (tree
);
171 static int maybe_indent_hierarchy (FILE *, int, int);
172 static tree
dump_class_hierarchy_r (FILE *, int, tree
, tree
, int);
173 static void dump_class_hierarchy (tree
);
174 static void dump_class_hierarchy_1 (FILE *, int, tree
);
175 static void dump_array (FILE *, tree
);
176 static void dump_vtable (tree
, tree
, tree
);
177 static void dump_vtt (tree
, tree
);
178 static void dump_thunk (FILE *, int, tree
);
179 static tree
build_vtable (tree
, tree
, tree
);
180 static void initialize_vtable (tree
, vec
<constructor_elt
, va_gc
> *);
181 static void layout_nonempty_base_or_field (record_layout_info
,
182 tree
, tree
, splay_tree
);
183 static tree
end_of_class (tree
, int);
184 static bool layout_empty_base (record_layout_info
, tree
, tree
, splay_tree
);
185 static void accumulate_vtbl_inits (tree
, tree
, tree
, tree
, tree
,
186 vec
<constructor_elt
, va_gc
> **);
187 static void dfs_accumulate_vtbl_inits (tree
, tree
, tree
, tree
, tree
,
188 vec
<constructor_elt
, va_gc
> **);
189 static void build_rtti_vtbl_entries (tree
, vtbl_init_data
*);
190 static void build_vcall_and_vbase_vtbl_entries (tree
, vtbl_init_data
*);
191 static void clone_constructors_and_destructors (tree
);
192 static tree
build_clone (tree
, tree
);
193 static void update_vtable_entry_for_fn (tree
, tree
, tree
, tree
*, unsigned);
194 static void build_ctor_vtbl_group (tree
, tree
);
195 static void build_vtt (tree
);
196 static tree
binfo_ctor_vtable (tree
);
197 static void build_vtt_inits (tree
, tree
, vec
<constructor_elt
, va_gc
> **,
199 static tree
dfs_build_secondary_vptr_vtt_inits (tree
, void *);
200 static tree
dfs_fixup_binfo_vtbls (tree
, void *);
201 static int record_subobject_offset (tree
, tree
, splay_tree
);
202 static int check_subobject_offset (tree
, tree
, splay_tree
);
203 static int walk_subobject_offsets (tree
, subobject_offset_fn
,
204 tree
, splay_tree
, tree
, int);
205 static void record_subobject_offsets (tree
, tree
, splay_tree
, bool);
206 static int layout_conflict_p (tree
, tree
, splay_tree
, int);
207 static int splay_tree_compare_integer_csts (splay_tree_key k1
,
209 static void warn_about_ambiguous_bases (tree
);
210 static bool type_requires_array_cookie (tree
);
211 static bool base_derived_from (tree
, tree
);
212 static int empty_base_at_nonzero_offset_p (tree
, tree
, splay_tree
);
213 static tree
end_of_base (tree
);
214 static tree
get_vcall_index (tree
, tree
);
216 /* Variables shared between class.c and call.c. */
219 int n_vtable_entries
= 0;
220 int n_vtable_searches
= 0;
221 int n_vtable_elems
= 0;
222 int n_convert_harshness
= 0;
223 int n_compute_conversion_costs
= 0;
224 int n_inner_fields_searched
= 0;
226 /* Convert to or from a base subobject. EXPR is an expression of type
227 `A' or `A*', an expression of type `B' or `B*' is returned. To
228 convert A to a base B, CODE is PLUS_EXPR and BINFO is the binfo for
229 the B base instance within A. To convert base A to derived B, CODE
230 is MINUS_EXPR and BINFO is the binfo for the A instance within B.
231 In this latter case, A must not be a morally virtual base of B.
232 NONNULL is true if EXPR is known to be non-NULL (this is only
233 needed when EXPR is of pointer type). CV qualifiers are preserved
237 build_base_path (enum tree_code code
,
241 tsubst_flags_t complain
)
243 tree v_binfo
= NULL_TREE
;
244 tree d_binfo
= NULL_TREE
;
248 tree null_test
= NULL
;
249 tree ptr_target_type
;
251 int want_pointer
= TYPE_PTR_P (TREE_TYPE (expr
));
252 bool has_empty
= false;
256 if (expr
== error_mark_node
|| binfo
== error_mark_node
|| !binfo
)
257 return error_mark_node
;
259 for (probe
= binfo
; probe
; probe
= BINFO_INHERITANCE_CHAIN (probe
))
262 if (is_empty_class (BINFO_TYPE (probe
)))
264 if (!v_binfo
&& BINFO_VIRTUAL_P (probe
))
268 probe
= TYPE_MAIN_VARIANT (TREE_TYPE (expr
));
270 probe
= TYPE_MAIN_VARIANT (TREE_TYPE (probe
));
272 if (code
== PLUS_EXPR
273 && !SAME_BINFO_TYPE_P (BINFO_TYPE (d_binfo
), probe
))
275 /* This can happen when adjust_result_of_qualified_name_lookup can't
276 find a unique base binfo in a call to a member function. We
277 couldn't give the diagnostic then since we might have been calling
278 a static member function, so we do it now. */
279 if (complain
& tf_error
)
281 tree base
= lookup_base (probe
, BINFO_TYPE (d_binfo
),
282 ba_unique
, NULL
, complain
);
283 gcc_assert (base
== error_mark_node
);
285 return error_mark_node
;
288 gcc_assert ((code
== MINUS_EXPR
289 && SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), probe
))
290 || code
== PLUS_EXPR
);
292 if (binfo
== d_binfo
)
296 if (code
== MINUS_EXPR
&& v_binfo
)
298 if (complain
& tf_error
)
300 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), BINFO_TYPE (v_binfo
)))
303 error ("cannot convert from pointer to base class %qT to "
304 "pointer to derived class %qT because the base is "
305 "virtual", BINFO_TYPE (binfo
), BINFO_TYPE (d_binfo
));
307 error ("cannot convert from base class %qT to derived "
308 "class %qT because the base is virtual",
309 BINFO_TYPE (binfo
), BINFO_TYPE (d_binfo
));
314 error ("cannot convert from pointer to base class %qT to "
315 "pointer to derived class %qT via virtual base %qT",
316 BINFO_TYPE (binfo
), BINFO_TYPE (d_binfo
),
317 BINFO_TYPE (v_binfo
));
319 error ("cannot convert from base class %qT to derived "
320 "class %qT via virtual base %qT", BINFO_TYPE (binfo
),
321 BINFO_TYPE (d_binfo
), BINFO_TYPE (v_binfo
));
324 return error_mark_node
;
329 rvalue
= !real_lvalue_p (expr
);
330 /* This must happen before the call to save_expr. */
331 expr
= cp_build_addr_expr (expr
, complain
);
334 expr
= mark_rvalue_use (expr
);
336 offset
= BINFO_OFFSET (binfo
);
337 fixed_type_p
= resolves_to_fixed_type_p (expr
, &nonnull
);
338 target_type
= code
== PLUS_EXPR
? BINFO_TYPE (binfo
) : BINFO_TYPE (d_binfo
);
339 /* TARGET_TYPE has been extracted from BINFO, and, is therefore always
340 cv-unqualified. Extract the cv-qualifiers from EXPR so that the
341 expression returned matches the input. */
342 target_type
= cp_build_qualified_type
343 (target_type
, cp_type_quals (TREE_TYPE (TREE_TYPE (expr
))));
344 ptr_target_type
= build_pointer_type (target_type
);
346 /* Do we need to look in the vtable for the real offset? */
347 virtual_access
= (v_binfo
&& fixed_type_p
<= 0);
349 /* Don't bother with the calculations inside sizeof; they'll ICE if the
350 source type is incomplete and the pointer value doesn't matter. In a
351 template (even in fold_non_dependent_expr), we don't have vtables set
352 up properly yet, and the value doesn't matter there either; we're just
353 interested in the result of overload resolution. */
354 if (cp_unevaluated_operand
!= 0
355 || in_template_function ())
357 expr
= build_nop (ptr_target_type
, expr
);
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;
372 /* Do we need to check for a null pointer? */
373 if (want_pointer
&& !nonnull
)
375 /* If we know the conversion will not actually change the value
376 of EXPR, then we can avoid testing the expression for NULL.
377 We have to avoid generating a COMPONENT_REF for a base class
378 field, because other parts of the compiler know that such
379 expressions are always non-NULL. */
380 if (!virtual_access
&& integer_zerop (offset
))
381 return build_nop (ptr_target_type
, expr
);
382 null_test
= error_mark_node
;
385 /* Protect against multiple evaluation if necessary. */
386 if (TREE_SIDE_EFFECTS (expr
) && (null_test
|| virtual_access
))
387 expr
= save_expr (expr
);
389 /* Now that we've saved expr, build the real null test. */
392 tree zero
= cp_convert (TREE_TYPE (expr
), nullptr_node
, complain
);
393 null_test
= fold_build2_loc (input_location
, NE_EXPR
, boolean_type_node
,
397 /* If this is a simple base reference, express it as a COMPONENT_REF. */
398 if (code
== PLUS_EXPR
&& !virtual_access
399 /* We don't build base fields for empty bases, and they aren't very
400 interesting to the optimizers anyway. */
403 expr
= cp_build_indirect_ref (expr
, RO_NULL
, complain
);
404 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
);
486 expr
= cp_build_indirect_ref (expr
, RO_NULL
, complain
);
493 expr
= fold_build3_loc (input_location
, COND_EXPR
, target_type
, null_test
, expr
,
494 build_zero_cst (target_type
));
499 /* Subroutine of build_base_path; EXPR and BINFO are as in that function.
500 Perform a derived-to-base conversion by recursively building up a
501 sequence of COMPONENT_REFs to the appropriate base fields. */
504 build_simple_base_path (tree expr
, tree binfo
)
506 tree type
= BINFO_TYPE (binfo
);
507 tree d_binfo
= BINFO_INHERITANCE_CHAIN (binfo
);
510 if (d_binfo
== NULL_TREE
)
514 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (expr
)) == type
);
516 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x'
517 into `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only
518 an lvalue in the front end; only _DECLs and _REFs are lvalues
520 temp
= unary_complex_lvalue (ADDR_EXPR
, expr
);
522 expr
= cp_build_indirect_ref (temp
, RO_NULL
, tf_warning_or_error
);
528 expr
= build_simple_base_path (expr
, d_binfo
);
530 for (field
= TYPE_FIELDS (BINFO_TYPE (d_binfo
));
531 field
; field
= DECL_CHAIN (field
))
532 /* Is this the base field created by build_base_field? */
533 if (TREE_CODE (field
) == FIELD_DECL
534 && DECL_FIELD_IS_BASE (field
)
535 && TREE_TYPE (field
) == type
536 /* If we're looking for a field in the most-derived class,
537 also check the field offset; we can have two base fields
538 of the same type if one is an indirect virtual base and one
539 is a direct non-virtual base. */
540 && (BINFO_INHERITANCE_CHAIN (d_binfo
)
541 || tree_int_cst_equal (byte_position (field
),
542 BINFO_OFFSET (binfo
))))
544 /* We don't use build_class_member_access_expr here, as that
545 has unnecessary checks, and more importantly results in
546 recursive calls to dfs_walk_once. */
547 int type_quals
= cp_type_quals (TREE_TYPE (expr
));
549 expr
= build3 (COMPONENT_REF
,
550 cp_build_qualified_type (type
, type_quals
),
551 expr
, field
, NULL_TREE
);
552 expr
= fold_if_not_in_template (expr
);
554 /* Mark the expression const or volatile, as appropriate.
555 Even though we've dealt with the type above, we still have
556 to mark the expression itself. */
557 if (type_quals
& TYPE_QUAL_CONST
)
558 TREE_READONLY (expr
) = 1;
559 if (type_quals
& TYPE_QUAL_VOLATILE
)
560 TREE_THIS_VOLATILE (expr
) = 1;
565 /* Didn't find the base field?!? */
569 /* Convert OBJECT to the base TYPE. OBJECT is an expression whose
570 type is a class type or a pointer to a class type. In the former
571 case, TYPE is also a class type; in the latter it is another
572 pointer type. If CHECK_ACCESS is true, an error message is emitted
573 if TYPE is inaccessible. If OBJECT has pointer type, the value is
574 assumed to be non-NULL. */
577 convert_to_base (tree object
, tree type
, bool check_access
, bool nonnull
,
578 tsubst_flags_t complain
)
583 if (TYPE_PTR_P (TREE_TYPE (object
)))
585 object_type
= TREE_TYPE (TREE_TYPE (object
));
586 type
= TREE_TYPE (type
);
589 object_type
= TREE_TYPE (object
);
591 binfo
= lookup_base (object_type
, type
, check_access
? ba_check
: ba_unique
,
593 if (!binfo
|| binfo
== error_mark_node
)
594 return error_mark_node
;
596 return build_base_path (PLUS_EXPR
, object
, binfo
, nonnull
, complain
);
599 /* EXPR is an expression with unqualified class type. BASE is a base
600 binfo of that class type. Returns EXPR, converted to the BASE
601 type. This function assumes that EXPR is the most derived class;
602 therefore virtual bases can be found at their static offsets. */
605 convert_to_base_statically (tree expr
, tree base
)
609 expr_type
= TREE_TYPE (expr
);
610 if (!SAME_BINFO_TYPE_P (BINFO_TYPE (base
), expr_type
))
612 /* If this is a non-empty base, use a COMPONENT_REF. */
613 if (!is_empty_class (BINFO_TYPE (base
)))
614 return build_simple_base_path (expr
, base
);
616 /* We use fold_build2 and fold_convert below to simplify the trees
617 provided to the optimizers. It is not safe to call these functions
618 when processing a template because they do not handle C++-specific
620 gcc_assert (!processing_template_decl
);
621 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
622 if (!integer_zerop (BINFO_OFFSET (base
)))
623 expr
= fold_build_pointer_plus_loc (input_location
,
624 expr
, BINFO_OFFSET (base
));
625 expr
= fold_convert (build_pointer_type (BINFO_TYPE (base
)), expr
);
626 expr
= build_fold_indirect_ref_loc (input_location
, expr
);
634 build_vfield_ref (tree datum
, tree type
)
636 tree vfield
, vcontext
;
638 if (datum
== error_mark_node
639 /* Can happen in case of duplicate base types (c++/59082). */
640 || !TYPE_VFIELD (type
))
641 return error_mark_node
;
643 /* First, convert to the requested type. */
644 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (datum
), type
))
645 datum
= convert_to_base (datum
, type
, /*check_access=*/false,
646 /*nonnull=*/true, tf_warning_or_error
);
648 /* Second, the requested type may not be the owner of its own vptr.
649 If not, convert to the base class that owns it. We cannot use
650 convert_to_base here, because VCONTEXT may appear more than once
651 in the inheritance hierarchy of TYPE, and thus direct conversion
652 between the types may be ambiguous. Following the path back up
653 one step at a time via primary bases avoids the problem. */
654 vfield
= TYPE_VFIELD (type
);
655 vcontext
= DECL_CONTEXT (vfield
);
656 while (!same_type_ignoring_top_level_qualifiers_p (vcontext
, type
))
658 datum
= build_simple_base_path (datum
, CLASSTYPE_PRIMARY_BINFO (type
));
659 type
= TREE_TYPE (datum
);
662 return build3 (COMPONENT_REF
, TREE_TYPE (vfield
), datum
, vfield
, NULL_TREE
);
665 /* Given an object INSTANCE, return an expression which yields the
666 vtable element corresponding to INDEX. There are many special
667 cases for INSTANCE which we take care of here, mainly to avoid
668 creating extra tree nodes when we don't have to. */
671 build_vtbl_ref_1 (tree instance
, tree idx
)
674 tree vtbl
= NULL_TREE
;
676 /* Try to figure out what a reference refers to, and
677 access its virtual function table directly. */
680 tree fixed_type
= fixed_type_or_null (instance
, NULL
, &cdtorp
);
682 tree basetype
= non_reference (TREE_TYPE (instance
));
684 if (fixed_type
&& !cdtorp
)
686 tree binfo
= lookup_base (fixed_type
, basetype
,
687 ba_unique
, NULL
, tf_none
);
688 if (binfo
&& binfo
!= error_mark_node
)
689 vtbl
= unshare_expr (BINFO_VTABLE (binfo
));
693 vtbl
= build_vfield_ref (instance
, basetype
);
695 aref
= build_array_ref (input_location
, vtbl
, idx
);
696 TREE_CONSTANT (aref
) |= TREE_CONSTANT (vtbl
) && TREE_CONSTANT (idx
);
702 build_vtbl_ref (tree instance
, tree idx
)
704 tree aref
= build_vtbl_ref_1 (instance
, idx
);
709 /* Given a stable object pointer INSTANCE_PTR, return an expression which
710 yields a function pointer corresponding to vtable element INDEX. */
713 build_vfn_ref (tree instance_ptr
, tree idx
)
717 aref
= build_vtbl_ref_1 (cp_build_indirect_ref (instance_ptr
, RO_NULL
,
718 tf_warning_or_error
),
721 /* When using function descriptors, the address of the
722 vtable entry is treated as a function pointer. */
723 if (TARGET_VTABLE_USES_DESCRIPTORS
)
724 aref
= build1 (NOP_EXPR
, TREE_TYPE (aref
),
725 cp_build_addr_expr (aref
, tf_warning_or_error
));
727 /* Remember this as a method reference, for later devirtualization. */
728 aref
= build3 (OBJ_TYPE_REF
, TREE_TYPE (aref
), aref
, instance_ptr
, idx
);
733 /* Return the name of the virtual function table (as an IDENTIFIER_NODE)
734 for the given TYPE. */
737 get_vtable_name (tree type
)
739 return mangle_vtbl_for_type (type
);
742 /* DECL is an entity associated with TYPE, like a virtual table or an
743 implicitly generated constructor. Determine whether or not DECL
744 should have external or internal linkage at the object file
745 level. This routine does not deal with COMDAT linkage and other
746 similar complexities; it simply sets TREE_PUBLIC if it possible for
747 entities in other translation units to contain copies of DECL, in
751 set_linkage_according_to_type (tree
/*type*/, tree decl
)
753 TREE_PUBLIC (decl
) = 1;
754 determine_visibility (decl
);
757 /* Create a VAR_DECL for a primary or secondary vtable for CLASS_TYPE.
758 (For a secondary vtable for B-in-D, CLASS_TYPE should be D, not B.)
759 Use NAME for the name of the vtable, and VTABLE_TYPE for its type. */
762 build_vtable (tree class_type
, tree name
, tree vtable_type
)
766 decl
= build_lang_decl (VAR_DECL
, name
, vtable_type
);
767 /* vtable names are already mangled; give them their DECL_ASSEMBLER_NAME
768 now to avoid confusion in mangle_decl. */
769 SET_DECL_ASSEMBLER_NAME (decl
, name
);
770 DECL_CONTEXT (decl
) = class_type
;
771 DECL_ARTIFICIAL (decl
) = 1;
772 TREE_STATIC (decl
) = 1;
773 TREE_READONLY (decl
) = 1;
774 DECL_VIRTUAL_P (decl
) = 1;
775 DECL_ALIGN (decl
) = TARGET_VTABLE_ENTRY_ALIGN
;
776 DECL_USER_ALIGN (decl
) = true;
777 DECL_VTABLE_OR_VTT_P (decl
) = 1;
778 set_linkage_according_to_type (class_type
, decl
);
779 /* The vtable has not been defined -- yet. */
780 DECL_EXTERNAL (decl
) = 1;
781 DECL_NOT_REALLY_EXTERN (decl
) = 1;
783 /* Mark the VAR_DECL node representing the vtable itself as a
784 "gratuitous" one, thereby forcing dwarfout.c to ignore it. It
785 is rather important that such things be ignored because any
786 effort to actually generate DWARF for them will run into
787 trouble when/if we encounter code like:
790 struct S { virtual void member (); };
792 because the artificial declaration of the vtable itself (as
793 manufactured by the g++ front end) will say that the vtable is
794 a static member of `S' but only *after* the debug output for
795 the definition of `S' has already been output. This causes
796 grief because the DWARF entry for the definition of the vtable
797 will try to refer back to an earlier *declaration* of the
798 vtable as a static member of `S' and there won't be one. We
799 might be able to arrange to have the "vtable static member"
800 attached to the member list for `S' before the debug info for
801 `S' get written (which would solve the problem) but that would
802 require more intrusive changes to the g++ front end. */
803 DECL_IGNORED_P (decl
) = 1;
808 /* Get the VAR_DECL of the vtable for TYPE. TYPE need not be polymorphic,
809 or even complete. If this does not exist, create it. If COMPLETE is
810 nonzero, then complete the definition of it -- that will render it
811 impossible to actually build the vtable, but is useful to get at those
812 which are known to exist in the runtime. */
815 get_vtable_decl (tree type
, int complete
)
819 if (CLASSTYPE_VTABLES (type
))
820 return CLASSTYPE_VTABLES (type
);
822 decl
= build_vtable (type
, get_vtable_name (type
), vtbl_type_node
);
823 CLASSTYPE_VTABLES (type
) = decl
;
827 DECL_EXTERNAL (decl
) = 1;
828 cp_finish_decl (decl
, NULL_TREE
, false, NULL_TREE
, 0);
834 /* Build the primary virtual function table for TYPE. If BINFO is
835 non-NULL, build the vtable starting with the initial approximation
836 that it is the same as the one which is the head of the association
837 list. Returns a nonzero value if a new vtable is actually
841 build_primary_vtable (tree binfo
, tree type
)
846 decl
= get_vtable_decl (type
, /*complete=*/0);
850 if (BINFO_NEW_VTABLE_MARKED (binfo
))
851 /* We have already created a vtable for this base, so there's
852 no need to do it again. */
855 virtuals
= copy_list (BINFO_VIRTUALS (binfo
));
856 TREE_TYPE (decl
) = TREE_TYPE (get_vtbl_decl_for_binfo (binfo
));
857 DECL_SIZE (decl
) = TYPE_SIZE (TREE_TYPE (decl
));
858 DECL_SIZE_UNIT (decl
) = TYPE_SIZE_UNIT (TREE_TYPE (decl
));
862 gcc_assert (TREE_TYPE (decl
) == vtbl_type_node
);
863 virtuals
= NULL_TREE
;
866 if (GATHER_STATISTICS
)
869 n_vtable_elems
+= list_length (virtuals
);
872 /* Initialize the association list for this type, based
873 on our first approximation. */
874 BINFO_VTABLE (TYPE_BINFO (type
)) = decl
;
875 BINFO_VIRTUALS (TYPE_BINFO (type
)) = virtuals
;
876 SET_BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (type
));
880 /* Give BINFO a new virtual function table which is initialized
881 with a skeleton-copy of its original initialization. The only
882 entry that changes is the `delta' entry, so we can really
883 share a lot of structure.
885 FOR_TYPE is the most derived type which caused this table to
888 Returns nonzero if we haven't met BINFO before.
890 The order in which vtables are built (by calling this function) for
891 an object must remain the same, otherwise a binary incompatibility
895 build_secondary_vtable (tree binfo
)
897 if (BINFO_NEW_VTABLE_MARKED (binfo
))
898 /* We already created a vtable for this base. There's no need to
902 /* Remember that we've created a vtable for this BINFO, so that we
903 don't try to do so again. */
904 SET_BINFO_NEW_VTABLE_MARKED (binfo
);
906 /* Make fresh virtual list, so we can smash it later. */
907 BINFO_VIRTUALS (binfo
) = copy_list (BINFO_VIRTUALS (binfo
));
909 /* Secondary vtables are laid out as part of the same structure as
910 the primary vtable. */
911 BINFO_VTABLE (binfo
) = NULL_TREE
;
915 /* Create a new vtable for BINFO which is the hierarchy dominated by
916 T. Return nonzero if we actually created a new vtable. */
919 make_new_vtable (tree t
, tree binfo
)
921 if (binfo
== TYPE_BINFO (t
))
922 /* In this case, it is *type*'s vtable we are modifying. We start
923 with the approximation that its vtable is that of the
924 immediate base class. */
925 return build_primary_vtable (binfo
, t
);
927 /* This is our very own copy of `basetype' to play with. Later,
928 we will fill in all the virtual functions that override the
929 virtual functions in these base classes which are not defined
930 by the current type. */
931 return build_secondary_vtable (binfo
);
934 /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO
935 (which is in the hierarchy dominated by T) list FNDECL as its
936 BV_FN. DELTA is the required constant adjustment from the `this'
937 pointer where the vtable entry appears to the `this' required when
938 the function is actually called. */
941 modify_vtable_entry (tree t
,
951 if (fndecl
!= BV_FN (v
)
952 || !tree_int_cst_equal (delta
, BV_DELTA (v
)))
954 /* We need a new vtable for BINFO. */
955 if (make_new_vtable (t
, binfo
))
957 /* If we really did make a new vtable, we also made a copy
958 of the BINFO_VIRTUALS list. Now, we have to find the
959 corresponding entry in that list. */
960 *virtuals
= BINFO_VIRTUALS (binfo
);
961 while (BV_FN (*virtuals
) != BV_FN (v
))
962 *virtuals
= TREE_CHAIN (*virtuals
);
966 BV_DELTA (v
) = delta
;
967 BV_VCALL_INDEX (v
) = NULL_TREE
;
973 /* Add method METHOD to class TYPE. If USING_DECL is non-null, it is
974 the USING_DECL naming METHOD. Returns true if the method could be
975 added to the method vec. */
978 add_method (tree type
, tree method
, tree using_decl
)
982 bool template_conv_p
= false;
984 vec
<tree
, va_gc
> *method_vec
;
986 bool insert_p
= false;
990 if (method
== error_mark_node
)
993 complete_p
= COMPLETE_TYPE_P (type
);
994 conv_p
= DECL_CONV_FN_P (method
);
996 template_conv_p
= (TREE_CODE (method
) == TEMPLATE_DECL
997 && DECL_TEMPLATE_CONV_FN_P (method
));
999 method_vec
= CLASSTYPE_METHOD_VEC (type
);
1002 /* Make a new method vector. We start with 8 entries. We must
1003 allocate at least two (for constructors and destructors), and
1004 we're going to end up with an assignment operator at some
1006 vec_alloc (method_vec
, 8);
1007 /* Create slots for constructors and destructors. */
1008 method_vec
->quick_push (NULL_TREE
);
1009 method_vec
->quick_push (NULL_TREE
);
1010 CLASSTYPE_METHOD_VEC (type
) = method_vec
;
1013 /* Maintain TYPE_HAS_USER_CONSTRUCTOR, etc. */
1014 grok_special_member_properties (method
);
1016 /* Constructors and destructors go in special slots. */
1017 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (method
))
1018 slot
= CLASSTYPE_CONSTRUCTOR_SLOT
;
1019 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method
))
1021 slot
= CLASSTYPE_DESTRUCTOR_SLOT
;
1023 if (TYPE_FOR_JAVA (type
))
1025 if (!DECL_ARTIFICIAL (method
))
1026 error ("Java class %qT cannot have a destructor", type
);
1027 else if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
1028 error ("Java class %qT cannot have an implicit non-trivial "
1038 /* See if we already have an entry with this name. */
1039 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
1040 vec_safe_iterate (method_vec
, slot
, &m
);
1043 m
= OVL_CURRENT (m
);
1044 if (template_conv_p
)
1046 if (TREE_CODE (m
) == TEMPLATE_DECL
1047 && DECL_TEMPLATE_CONV_FN_P (m
))
1051 if (conv_p
&& !DECL_CONV_FN_P (m
))
1053 if (DECL_NAME (m
) == DECL_NAME (method
))
1059 && !DECL_CONV_FN_P (m
)
1060 && DECL_NAME (m
) > DECL_NAME (method
))
1064 current_fns
= insert_p
? NULL_TREE
: (*method_vec
)[slot
];
1066 /* Check to see if we've already got this method. */
1067 for (fns
= current_fns
; fns
; fns
= OVL_NEXT (fns
))
1069 tree fn
= OVL_CURRENT (fns
);
1075 if (TREE_CODE (fn
) != TREE_CODE (method
))
1078 /* [over.load] Member function declarations with the
1079 same name and the same parameter types cannot be
1080 overloaded if any of them is a static member
1081 function declaration.
1083 [over.load] Member function declarations with the same name and
1084 the same parameter-type-list as well as member function template
1085 declarations with the same name, the same parameter-type-list, and
1086 the same template parameter lists cannot be overloaded if any of
1087 them, but not all, have a ref-qualifier.
1089 [namespace.udecl] When a using-declaration brings names
1090 from a base class into a derived class scope, member
1091 functions in the derived class override and/or hide member
1092 functions with the same name and parameter types in a base
1093 class (rather than conflicting). */
1094 fn_type
= TREE_TYPE (fn
);
1095 method_type
= TREE_TYPE (method
);
1096 parms1
= TYPE_ARG_TYPES (fn_type
);
1097 parms2
= TYPE_ARG_TYPES (method_type
);
1099 /* Compare the quals on the 'this' parm. Don't compare
1100 the whole types, as used functions are treated as
1101 coming from the using class in overload resolution. */
1102 if (! DECL_STATIC_FUNCTION_P (fn
)
1103 && ! DECL_STATIC_FUNCTION_P (method
)
1104 /* Either both or neither need to be ref-qualified for
1105 differing quals to allow overloading. */
1106 && (FUNCTION_REF_QUALIFIED (fn_type
)
1107 == FUNCTION_REF_QUALIFIED (method_type
))
1108 && (type_memfn_quals (fn_type
) != type_memfn_quals (method_type
)
1109 || type_memfn_rqual (fn_type
) != type_memfn_rqual (method_type
)))
1112 /* For templates, the return type and template parameters
1113 must be identical. */
1114 if (TREE_CODE (fn
) == TEMPLATE_DECL
1115 && (!same_type_p (TREE_TYPE (fn_type
),
1116 TREE_TYPE (method_type
))
1117 || !comp_template_parms (DECL_TEMPLATE_PARMS (fn
),
1118 DECL_TEMPLATE_PARMS (method
))))
1121 if (! DECL_STATIC_FUNCTION_P (fn
))
1122 parms1
= TREE_CHAIN (parms1
);
1123 if (! DECL_STATIC_FUNCTION_P (method
))
1124 parms2
= TREE_CHAIN (parms2
);
1126 if (compparms (parms1
, parms2
)
1127 && (!DECL_CONV_FN_P (fn
)
1128 || same_type_p (TREE_TYPE (fn_type
),
1129 TREE_TYPE (method_type
))))
1131 /* For function versions, their parms and types match
1132 but they are not duplicates. Record function versions
1133 as and when they are found. extern "C" functions are
1134 not treated as versions. */
1135 if (TREE_CODE (fn
) == FUNCTION_DECL
1136 && TREE_CODE (method
) == FUNCTION_DECL
1137 && !DECL_EXTERN_C_P (fn
)
1138 && !DECL_EXTERN_C_P (method
)
1139 && targetm
.target_option
.function_versions (fn
, method
))
1141 /* Mark functions as versions if necessary. Modify the mangled
1142 decl name if necessary. */
1143 if (!DECL_FUNCTION_VERSIONED (fn
))
1145 DECL_FUNCTION_VERSIONED (fn
) = 1;
1146 if (DECL_ASSEMBLER_NAME_SET_P (fn
))
1149 if (!DECL_FUNCTION_VERSIONED (method
))
1151 DECL_FUNCTION_VERSIONED (method
) = 1;
1152 if (DECL_ASSEMBLER_NAME_SET_P (method
))
1153 mangle_decl (method
);
1155 cgraph_node::record_function_versions (fn
, method
);
1158 if (DECL_INHERITED_CTOR_BASE (method
))
1160 if (DECL_INHERITED_CTOR_BASE (fn
))
1162 error_at (DECL_SOURCE_LOCATION (method
),
1163 "%q#D inherited from %qT", method
,
1164 DECL_INHERITED_CTOR_BASE (method
));
1165 error_at (DECL_SOURCE_LOCATION (fn
),
1166 "conflicts with version inherited from %qT",
1167 DECL_INHERITED_CTOR_BASE (fn
));
1169 /* Otherwise defer to the other function. */
1174 if (DECL_CONTEXT (fn
) == type
)
1175 /* Defer to the local function. */
1180 error ("%q+#D cannot be overloaded", method
);
1181 error ("with %q+#D", fn
);
1184 /* We don't call duplicate_decls here to merge the
1185 declarations because that will confuse things if the
1186 methods have inline definitions. In particular, we
1187 will crash while processing the definitions. */
1192 /* A class should never have more than one destructor. */
1193 if (current_fns
&& DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method
))
1196 /* Add the new binding. */
1199 overload
= ovl_cons (method
, current_fns
);
1200 OVL_USED (overload
) = true;
1203 overload
= build_overload (method
, current_fns
);
1206 TYPE_HAS_CONVERSION (type
) = 1;
1207 else if (slot
>= CLASSTYPE_FIRST_CONVERSION_SLOT
&& !complete_p
)
1208 push_class_level_binding (DECL_NAME (method
), overload
);
1214 /* We only expect to add few methods in the COMPLETE_P case, so
1215 just make room for one more method in that case. */
1217 reallocated
= vec_safe_reserve_exact (method_vec
, 1);
1219 reallocated
= vec_safe_reserve (method_vec
, 1);
1221 CLASSTYPE_METHOD_VEC (type
) = method_vec
;
1222 if (slot
== method_vec
->length ())
1223 method_vec
->quick_push (overload
);
1225 method_vec
->quick_insert (slot
, overload
);
1228 /* Replace the current slot. */
1229 (*method_vec
)[slot
] = overload
;
1233 /* Subroutines of finish_struct. */
1235 /* Change the access of FDECL to ACCESS in T. Return 1 if change was
1236 legit, otherwise return 0. */
1239 alter_access (tree t
, tree fdecl
, tree access
)
1243 if (!DECL_LANG_SPECIFIC (fdecl
))
1244 retrofit_lang_decl (fdecl
);
1246 gcc_assert (!DECL_DISCRIMINATOR_P (fdecl
));
1248 elem
= purpose_member (t
, DECL_ACCESS (fdecl
));
1251 if (TREE_VALUE (elem
) != access
)
1253 if (TREE_CODE (TREE_TYPE (fdecl
)) == FUNCTION_DECL
)
1254 error ("conflicting access specifications for method"
1255 " %q+D, ignored", TREE_TYPE (fdecl
));
1257 error ("conflicting access specifications for field %qE, ignored",
1262 /* They're changing the access to the same thing they changed
1263 it to before. That's OK. */
1269 perform_or_defer_access_check (TYPE_BINFO (t
), fdecl
, fdecl
,
1270 tf_warning_or_error
);
1271 DECL_ACCESS (fdecl
) = tree_cons (t
, access
, DECL_ACCESS (fdecl
));
1277 /* Process the USING_DECL, which is a member of T. */
1280 handle_using_decl (tree using_decl
, tree t
)
1282 tree decl
= USING_DECL_DECLS (using_decl
);
1283 tree name
= DECL_NAME (using_decl
);
1285 = TREE_PRIVATE (using_decl
) ? access_private_node
1286 : TREE_PROTECTED (using_decl
) ? access_protected_node
1287 : access_public_node
;
1288 tree flist
= NULL_TREE
;
1291 gcc_assert (!processing_template_decl
&& decl
);
1293 old_value
= lookup_member (t
, name
, /*protect=*/0, /*want_type=*/false,
1294 tf_warning_or_error
);
1297 if (is_overloaded_fn (old_value
))
1298 old_value
= OVL_CURRENT (old_value
);
1300 if (DECL_P (old_value
) && DECL_CONTEXT (old_value
) == t
)
1303 old_value
= NULL_TREE
;
1306 cp_emit_debug_info_for_using (decl
, t
);
1308 if (is_overloaded_fn (decl
))
1313 else if (is_overloaded_fn (old_value
))
1316 /* It's OK to use functions from a base when there are functions with
1317 the same name already present in the current class. */;
1320 error ("%q+D invalid in %q#T", using_decl
, t
);
1321 error (" because of local method %q+#D with same name",
1322 OVL_CURRENT (old_value
));
1326 else if (!DECL_ARTIFICIAL (old_value
))
1328 error ("%q+D invalid in %q#T", using_decl
, t
);
1329 error (" because of local member %q+#D with same name", old_value
);
1333 /* Make type T see field decl FDECL with access ACCESS. */
1335 for (; flist
; flist
= OVL_NEXT (flist
))
1337 add_method (t
, OVL_CURRENT (flist
), using_decl
);
1338 alter_access (t
, OVL_CURRENT (flist
), access
);
1341 alter_access (t
, decl
, access
);
1344 /* walk_tree callback for check_abi_tags: if the type at *TP involves any
1345 types with abi tags, add the corresponding identifiers to the VEC in
1346 *DATA and set IDENTIFIER_MARKED. */
1352 // error_mark_node to get diagnostics; otherwise collect missing tags here
1357 find_abi_tags_r (tree
*tp
, int *walk_subtrees
, void *data
)
1359 if (!OVERLOAD_TYPE_P (*tp
))
1362 /* walk_tree shouldn't be walking into any subtrees of a RECORD_TYPE
1363 anyway, but let's make sure of it. */
1364 *walk_subtrees
= false;
1366 if (tree attributes
= lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (*tp
)))
1368 struct abi_tag_data
*p
= static_cast<struct abi_tag_data
*>(data
);
1369 for (tree list
= TREE_VALUE (attributes
); list
;
1370 list
= TREE_CHAIN (list
))
1372 tree tag
= TREE_VALUE (list
);
1373 tree id
= get_identifier (TREE_STRING_POINTER (tag
));
1374 if (!IDENTIFIER_MARKED (id
))
1376 if (p
->tags
!= error_mark_node
)
1378 /* We're collecting tags from template arguments. */
1379 tree str
= build_string (IDENTIFIER_LENGTH (id
),
1380 IDENTIFIER_POINTER (id
));
1381 p
->tags
= tree_cons (NULL_TREE
, str
, p
->tags
);
1382 ABI_TAG_IMPLICIT (p
->tags
) = true;
1384 /* Don't inherit this tag multiple times. */
1385 IDENTIFIER_MARKED (id
) = true;
1388 /* Otherwise we're diagnosing missing tags. */
1389 else if (TYPE_P (p
->subob
))
1391 if (warning (OPT_Wabi_tag
, "%qT does not have the %E abi tag "
1392 "that base %qT has", p
->t
, tag
, p
->subob
))
1393 inform (location_of (p
->subob
), "%qT declared here",
1398 if (warning (OPT_Wabi_tag
, "%qT does not have the %E abi tag "
1399 "that %qT (used in the type of %qD) has",
1400 p
->t
, tag
, *tp
, p
->subob
))
1402 inform (location_of (p
->subob
), "%qD declared here",
1404 inform (location_of (*tp
), "%qT declared here", *tp
);
1413 /* Set IDENTIFIER_MARKED on all the ABI tags on T and its (transitively
1414 complete) template arguments. */
1417 mark_type_abi_tags (tree t
, bool val
)
1419 tree attributes
= lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (t
));
1422 for (tree list
= TREE_VALUE (attributes
); list
;
1423 list
= TREE_CHAIN (list
))
1425 tree tag
= TREE_VALUE (list
);
1426 tree id
= get_identifier (TREE_STRING_POINTER (tag
));
1427 IDENTIFIER_MARKED (id
) = val
;
1432 /* Check that class T has all the abi tags that subobject SUBOB has, or
1436 check_abi_tags (tree t
, tree subob
)
1438 mark_type_abi_tags (t
, true);
1440 tree subtype
= TYPE_P (subob
) ? subob
: TREE_TYPE (subob
);
1441 struct abi_tag_data data
= { t
, subob
, error_mark_node
};
1443 cp_walk_tree_without_duplicates (&subtype
, find_abi_tags_r
, &data
);
1445 mark_type_abi_tags (t
, false);
1449 inherit_targ_abi_tags (tree t
)
1451 if (!CLASS_TYPE_P (t
)
1452 || CLASSTYPE_TEMPLATE_INFO (t
) == NULL_TREE
)
1455 mark_type_abi_tags (t
, true);
1457 tree args
= CLASSTYPE_TI_ARGS (t
);
1458 struct abi_tag_data data
= { t
, NULL_TREE
, NULL_TREE
};
1459 for (int i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
1461 tree level
= TMPL_ARGS_LEVEL (args
, i
+1);
1462 for (int j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
1464 tree arg
= TREE_VEC_ELT (level
, j
);
1466 cp_walk_tree_without_duplicates (&arg
, find_abi_tags_r
, &data
);
1470 // If we found some tags on our template arguments, add them to our
1471 // abi_tag attribute.
1474 tree attr
= lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (t
));
1476 TREE_VALUE (attr
) = chainon (data
.tags
, TREE_VALUE (attr
));
1479 = tree_cons (get_identifier ("abi_tag"), data
.tags
,
1480 TYPE_ATTRIBUTES (t
));
1483 mark_type_abi_tags (t
, false);
1486 /* Return true, iff class T has a non-virtual destructor that is
1487 accessible from outside the class heirarchy (i.e. is public, or
1488 there's a suitable friend. */
1491 accessible_nvdtor_p (tree t
)
1493 tree dtor
= CLASSTYPE_DESTRUCTORS (t
);
1495 /* An implicitly declared destructor is always public. And,
1496 if it were virtual, we would have created it by now. */
1500 if (DECL_VINDEX (dtor
))
1501 return false; /* Virtual */
1503 if (!TREE_PRIVATE (dtor
) && !TREE_PROTECTED (dtor
))
1504 return true; /* Public */
1506 if (CLASSTYPE_FRIEND_CLASSES (t
)
1507 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t
)))
1508 return true; /* Has friends */
1513 /* Run through the base classes of T, updating CANT_HAVE_CONST_CTOR_P,
1514 and NO_CONST_ASN_REF_P. Also set flag bits in T based on
1515 properties of the bases. */
1518 check_bases (tree t
,
1519 int* cant_have_const_ctor_p
,
1520 int* no_const_asn_ref_p
)
1523 bool seen_non_virtual_nearly_empty_base_p
= 0;
1524 int seen_tm_mask
= 0;
1527 tree field
= NULL_TREE
;
1529 if (!CLASSTYPE_NON_STD_LAYOUT (t
))
1530 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
1531 if (TREE_CODE (field
) == FIELD_DECL
)
1534 for (binfo
= TYPE_BINFO (t
), i
= 0;
1535 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
1537 tree basetype
= TREE_TYPE (base_binfo
);
1539 gcc_assert (COMPLETE_TYPE_P (basetype
));
1541 if (CLASSTYPE_FINAL (basetype
))
1542 error ("cannot derive from %<final%> base %qT in derived type %qT",
1545 /* If any base class is non-literal, so is the derived class. */
1546 if (!CLASSTYPE_LITERAL_P (basetype
))
1547 CLASSTYPE_LITERAL_P (t
) = false;
1549 /* If the base class doesn't have copy constructors or
1550 assignment operators that take const references, then the
1551 derived class cannot have such a member automatically
1553 if (TYPE_HAS_COPY_CTOR (basetype
)
1554 && ! TYPE_HAS_CONST_COPY_CTOR (basetype
))
1555 *cant_have_const_ctor_p
= 1;
1556 if (TYPE_HAS_COPY_ASSIGN (basetype
)
1557 && !TYPE_HAS_CONST_COPY_ASSIGN (basetype
))
1558 *no_const_asn_ref_p
= 1;
1560 if (BINFO_VIRTUAL_P (base_binfo
))
1561 /* A virtual base does not effect nearly emptiness. */
1563 else if (CLASSTYPE_NEARLY_EMPTY_P (basetype
))
1565 if (seen_non_virtual_nearly_empty_base_p
)
1566 /* And if there is more than one nearly empty base, then the
1567 derived class is not nearly empty either. */
1568 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
1570 /* Remember we've seen one. */
1571 seen_non_virtual_nearly_empty_base_p
= 1;
1573 else if (!is_empty_class (basetype
))
1574 /* If the base class is not empty or nearly empty, then this
1575 class cannot be nearly empty. */
1576 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
1578 /* A lot of properties from the bases also apply to the derived
1580 TYPE_NEEDS_CONSTRUCTING (t
) |= TYPE_NEEDS_CONSTRUCTING (basetype
);
1581 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
1582 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (basetype
);
1583 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
)
1584 |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (basetype
)
1585 || !TYPE_HAS_COPY_ASSIGN (basetype
));
1586 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= (TYPE_HAS_COMPLEX_COPY_CTOR (basetype
)
1587 || !TYPE_HAS_COPY_CTOR (basetype
));
1588 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
)
1589 |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (basetype
);
1590 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_HAS_COMPLEX_MOVE_CTOR (basetype
);
1591 TYPE_POLYMORPHIC_P (t
) |= TYPE_POLYMORPHIC_P (basetype
);
1592 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
)
1593 |= CLASSTYPE_CONTAINS_EMPTY_CLASS_P (basetype
);
1594 TYPE_HAS_COMPLEX_DFLT (t
) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
1595 || TYPE_HAS_COMPLEX_DFLT (basetype
));
1596 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT
1597 (t
, CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
)
1598 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (basetype
));
1599 SET_CLASSTYPE_REF_FIELDS_NEED_INIT
1600 (t
, CLASSTYPE_REF_FIELDS_NEED_INIT (t
)
1601 | CLASSTYPE_REF_FIELDS_NEED_INIT (basetype
));
1603 /* A standard-layout class is a class that:
1605 * has no non-standard-layout base classes, */
1606 CLASSTYPE_NON_STD_LAYOUT (t
) |= CLASSTYPE_NON_STD_LAYOUT (basetype
);
1607 if (!CLASSTYPE_NON_STD_LAYOUT (t
))
1610 /* ...has no base classes of the same type as the first non-static
1612 if (field
&& DECL_CONTEXT (field
) == t
1613 && (same_type_ignoring_top_level_qualifiers_p
1614 (TREE_TYPE (field
), basetype
)))
1615 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
1617 /* ...either has no non-static data members in the most-derived
1618 class and at most one base class with non-static data
1619 members, or has no base classes with non-static data
1621 for (basefield
= TYPE_FIELDS (basetype
); basefield
;
1622 basefield
= DECL_CHAIN (basefield
))
1623 if (TREE_CODE (basefield
) == FIELD_DECL
)
1626 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
1633 /* Don't bother collecting tm attributes if transactional memory
1634 support is not enabled. */
1637 tree tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (basetype
));
1639 seen_tm_mask
|= tm_attr_to_mask (tm_attr
);
1642 check_abi_tags (t
, basetype
);
1645 /* If one of the base classes had TM attributes, and the current class
1646 doesn't define its own, then the current class inherits one. */
1647 if (seen_tm_mask
&& !find_tm_attribute (TYPE_ATTRIBUTES (t
)))
1649 tree tm_attr
= tm_mask_to_attr (seen_tm_mask
& -seen_tm_mask
);
1650 TYPE_ATTRIBUTES (t
) = tree_cons (tm_attr
, NULL
, TYPE_ATTRIBUTES (t
));
1654 /* Determine all the primary bases within T. Sets BINFO_PRIMARY_BASE_P for
1655 those that are primaries. Sets BINFO_LOST_PRIMARY_P for those
1656 that have had a nearly-empty virtual primary base stolen by some
1657 other base in the hierarchy. Determines CLASSTYPE_PRIMARY_BASE for
1661 determine_primary_bases (tree t
)
1664 tree primary
= NULL_TREE
;
1665 tree type_binfo
= TYPE_BINFO (t
);
1668 /* Determine the primary bases of our bases. */
1669 for (base_binfo
= TREE_CHAIN (type_binfo
); base_binfo
;
1670 base_binfo
= TREE_CHAIN (base_binfo
))
1672 tree primary
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (base_binfo
));
1674 /* See if we're the non-virtual primary of our inheritance
1676 if (!BINFO_VIRTUAL_P (base_binfo
))
1678 tree parent
= BINFO_INHERITANCE_CHAIN (base_binfo
);
1679 tree parent_primary
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (parent
));
1682 && SAME_BINFO_TYPE_P (BINFO_TYPE (base_binfo
),
1683 BINFO_TYPE (parent_primary
)))
1684 /* We are the primary binfo. */
1685 BINFO_PRIMARY_P (base_binfo
) = 1;
1687 /* Determine if we have a virtual primary base, and mark it so.
1689 if (primary
&& BINFO_VIRTUAL_P (primary
))
1691 tree this_primary
= copied_binfo (primary
, base_binfo
);
1693 if (BINFO_PRIMARY_P (this_primary
))
1694 /* Someone already claimed this base. */
1695 BINFO_LOST_PRIMARY_P (base_binfo
) = 1;
1700 BINFO_PRIMARY_P (this_primary
) = 1;
1701 BINFO_INHERITANCE_CHAIN (this_primary
) = base_binfo
;
1703 /* A virtual binfo might have been copied from within
1704 another hierarchy. As we're about to use it as a
1705 primary base, make sure the offsets match. */
1706 delta
= size_diffop_loc (input_location
,
1708 BINFO_OFFSET (base_binfo
)),
1710 BINFO_OFFSET (this_primary
)));
1712 propagate_binfo_offsets (this_primary
, delta
);
1717 /* First look for a dynamic direct non-virtual base. */
1718 for (i
= 0; BINFO_BASE_ITERATE (type_binfo
, i
, base_binfo
); i
++)
1720 tree basetype
= BINFO_TYPE (base_binfo
);
1722 if (TYPE_CONTAINS_VPTR_P (basetype
) && !BINFO_VIRTUAL_P (base_binfo
))
1724 primary
= base_binfo
;
1729 /* A "nearly-empty" virtual base class can be the primary base
1730 class, if no non-virtual polymorphic base can be found. Look for
1731 a nearly-empty virtual dynamic base that is not already a primary
1732 base of something in the hierarchy. If there is no such base,
1733 just pick the first nearly-empty virtual base. */
1735 for (base_binfo
= TREE_CHAIN (type_binfo
); base_binfo
;
1736 base_binfo
= TREE_CHAIN (base_binfo
))
1737 if (BINFO_VIRTUAL_P (base_binfo
)
1738 && CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (base_binfo
)))
1740 if (!BINFO_PRIMARY_P (base_binfo
))
1742 /* Found one that is not primary. */
1743 primary
= base_binfo
;
1747 /* Remember the first candidate. */
1748 primary
= base_binfo
;
1752 /* If we've got a primary base, use it. */
1755 tree basetype
= BINFO_TYPE (primary
);
1757 CLASSTYPE_PRIMARY_BINFO (t
) = primary
;
1758 if (BINFO_PRIMARY_P (primary
))
1759 /* We are stealing a primary base. */
1760 BINFO_LOST_PRIMARY_P (BINFO_INHERITANCE_CHAIN (primary
)) = 1;
1761 BINFO_PRIMARY_P (primary
) = 1;
1762 if (BINFO_VIRTUAL_P (primary
))
1766 BINFO_INHERITANCE_CHAIN (primary
) = type_binfo
;
1767 /* A virtual binfo might have been copied from within
1768 another hierarchy. As we're about to use it as a primary
1769 base, make sure the offsets match. */
1770 delta
= size_diffop_loc (input_location
, ssize_int (0),
1771 convert (ssizetype
, BINFO_OFFSET (primary
)));
1773 propagate_binfo_offsets (primary
, delta
);
1776 primary
= TYPE_BINFO (basetype
);
1778 TYPE_VFIELD (t
) = TYPE_VFIELD (basetype
);
1779 BINFO_VTABLE (type_binfo
) = BINFO_VTABLE (primary
);
1780 BINFO_VIRTUALS (type_binfo
) = BINFO_VIRTUALS (primary
);
1784 /* Update the variant types of T. */
1787 fixup_type_variants (tree t
)
1794 for (variants
= TYPE_NEXT_VARIANT (t
);
1796 variants
= TYPE_NEXT_VARIANT (variants
))
1798 /* These fields are in the _TYPE part of the node, not in
1799 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1800 TYPE_HAS_USER_CONSTRUCTOR (variants
) = TYPE_HAS_USER_CONSTRUCTOR (t
);
1801 TYPE_NEEDS_CONSTRUCTING (variants
) = TYPE_NEEDS_CONSTRUCTING (t
);
1802 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (variants
)
1803 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
);
1805 TYPE_POLYMORPHIC_P (variants
) = TYPE_POLYMORPHIC_P (t
);
1807 TYPE_BINFO (variants
) = TYPE_BINFO (t
);
1809 /* Copy whatever these are holding today. */
1810 TYPE_VFIELD (variants
) = TYPE_VFIELD (t
);
1811 TYPE_METHODS (variants
) = TYPE_METHODS (t
);
1812 TYPE_FIELDS (variants
) = TYPE_FIELDS (t
);
1816 /* Early variant fixups: we apply attributes at the beginning of the class
1817 definition, and we need to fix up any variants that have already been
1818 made via elaborated-type-specifier so that check_qualified_type works. */
1821 fixup_attribute_variants (tree t
)
1828 for (variants
= TYPE_NEXT_VARIANT (t
);
1830 variants
= TYPE_NEXT_VARIANT (variants
))
1832 /* These are the two fields that check_qualified_type looks at and
1833 are affected by attributes. */
1834 TYPE_ATTRIBUTES (variants
) = TYPE_ATTRIBUTES (t
);
1835 TYPE_ALIGN (variants
) = TYPE_ALIGN (t
);
1839 /* Set memoizing fields and bits of T (and its variants) for later
1843 finish_struct_bits (tree t
)
1845 /* Fix up variants (if any). */
1846 fixup_type_variants (t
);
1848 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t
)) && TYPE_POLYMORPHIC_P (t
))
1849 /* For a class w/o baseclasses, 'finish_struct' has set
1850 CLASSTYPE_PURE_VIRTUALS correctly (by definition).
1851 Similarly for a class whose base classes do not have vtables.
1852 When neither of these is true, we might have removed abstract
1853 virtuals (by providing a definition), added some (by declaring
1854 new ones), or redeclared ones from a base class. We need to
1855 recalculate what's really an abstract virtual at this point (by
1856 looking in the vtables). */
1857 get_pure_virtuals (t
);
1859 /* If this type has a copy constructor or a destructor, force its
1860 mode to be BLKmode, and force its TREE_ADDRESSABLE bit to be
1861 nonzero. This will cause it to be passed by invisible reference
1862 and prevent it from being returned in a register. */
1863 if (type_has_nontrivial_copy_init (t
)
1864 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
1867 DECL_MODE (TYPE_MAIN_DECL (t
)) = BLKmode
;
1868 for (variants
= t
; variants
; variants
= TYPE_NEXT_VARIANT (variants
))
1870 SET_TYPE_MODE (variants
, BLKmode
);
1871 TREE_ADDRESSABLE (variants
) = 1;
1876 /* Issue warnings about T having private constructors, but no friends,
1879 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
1880 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
1881 non-private static member functions. */
1884 maybe_warn_about_overly_private_class (tree t
)
1886 int has_member_fn
= 0;
1887 int has_nonprivate_method
= 0;
1890 if (!warn_ctor_dtor_privacy
1891 /* If the class has friends, those entities might create and
1892 access instances, so we should not warn. */
1893 || (CLASSTYPE_FRIEND_CLASSES (t
)
1894 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t
)))
1895 /* We will have warned when the template was declared; there's
1896 no need to warn on every instantiation. */
1897 || CLASSTYPE_TEMPLATE_INSTANTIATION (t
))
1898 /* There's no reason to even consider warning about this
1902 /* We only issue one warning, if more than one applies, because
1903 otherwise, on code like:
1906 // Oops - forgot `public:'
1912 we warn several times about essentially the same problem. */
1914 /* Check to see if all (non-constructor, non-destructor) member
1915 functions are private. (Since there are no friends or
1916 non-private statics, we can't ever call any of the private member
1918 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
1919 /* We're not interested in compiler-generated methods; they don't
1920 provide any way to call private members. */
1921 if (!DECL_ARTIFICIAL (fn
))
1923 if (!TREE_PRIVATE (fn
))
1925 if (DECL_STATIC_FUNCTION_P (fn
))
1926 /* A non-private static member function is just like a
1927 friend; it can create and invoke private member
1928 functions, and be accessed without a class
1932 has_nonprivate_method
= 1;
1933 /* Keep searching for a static member function. */
1935 else if (!DECL_CONSTRUCTOR_P (fn
) && !DECL_DESTRUCTOR_P (fn
))
1939 if (!has_nonprivate_method
&& has_member_fn
)
1941 /* There are no non-private methods, and there's at least one
1942 private member function that isn't a constructor or
1943 destructor. (If all the private members are
1944 constructors/destructors we want to use the code below that
1945 issues error messages specifically referring to
1946 constructors/destructors.) */
1948 tree binfo
= TYPE_BINFO (t
);
1950 for (i
= 0; i
!= BINFO_N_BASE_BINFOS (binfo
); i
++)
1951 if (BINFO_BASE_ACCESS (binfo
, i
) != access_private_node
)
1953 has_nonprivate_method
= 1;
1956 if (!has_nonprivate_method
)
1958 warning (OPT_Wctor_dtor_privacy
,
1959 "all member functions in class %qT are private", t
);
1964 /* Even if some of the member functions are non-private, the class
1965 won't be useful for much if all the constructors or destructors
1966 are private: such an object can never be created or destroyed. */
1967 fn
= CLASSTYPE_DESTRUCTORS (t
);
1968 if (fn
&& TREE_PRIVATE (fn
))
1970 warning (OPT_Wctor_dtor_privacy
,
1971 "%q#T only defines a private destructor and has no friends",
1976 /* Warn about classes that have private constructors and no friends. */
1977 if (TYPE_HAS_USER_CONSTRUCTOR (t
)
1978 /* Implicitly generated constructors are always public. */
1979 && (!CLASSTYPE_LAZY_DEFAULT_CTOR (t
)
1980 || !CLASSTYPE_LAZY_COPY_CTOR (t
)))
1982 int nonprivate_ctor
= 0;
1984 /* If a non-template class does not define a copy
1985 constructor, one is defined for it, enabling it to avoid
1986 this warning. For a template class, this does not
1987 happen, and so we would normally get a warning on:
1989 template <class T> class C { private: C(); };
1991 To avoid this asymmetry, we check TYPE_HAS_COPY_CTOR. All
1992 complete non-template or fully instantiated classes have this
1994 if (!TYPE_HAS_COPY_CTOR (t
))
1995 nonprivate_ctor
= 1;
1997 for (fn
= CLASSTYPE_CONSTRUCTORS (t
); fn
; fn
= OVL_NEXT (fn
))
1999 tree ctor
= OVL_CURRENT (fn
);
2000 /* Ideally, we wouldn't count copy constructors (or, in
2001 fact, any constructor that takes an argument of the
2002 class type as a parameter) because such things cannot
2003 be used to construct an instance of the class unless
2004 you already have one. But, for now at least, we're
2006 if (! TREE_PRIVATE (ctor
))
2008 nonprivate_ctor
= 1;
2013 if (nonprivate_ctor
== 0)
2015 warning (OPT_Wctor_dtor_privacy
,
2016 "%q#T only defines private constructors and has no friends",
2024 gt_pointer_operator new_value
;
2028 /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */
2031 method_name_cmp (const void* m1_p
, const void* m2_p
)
2033 const tree
*const m1
= (const tree
*) m1_p
;
2034 const tree
*const m2
= (const tree
*) m2_p
;
2036 if (*m1
== NULL_TREE
&& *m2
== NULL_TREE
)
2038 if (*m1
== NULL_TREE
)
2040 if (*m2
== NULL_TREE
)
2042 if (DECL_NAME (OVL_CURRENT (*m1
)) < DECL_NAME (OVL_CURRENT (*m2
)))
2047 /* This routine compares two fields like method_name_cmp but using the
2048 pointer operator in resort_field_decl_data. */
2051 resort_method_name_cmp (const void* m1_p
, const void* m2_p
)
2053 const tree
*const m1
= (const tree
*) m1_p
;
2054 const tree
*const m2
= (const tree
*) m2_p
;
2055 if (*m1
== NULL_TREE
&& *m2
== NULL_TREE
)
2057 if (*m1
== NULL_TREE
)
2059 if (*m2
== NULL_TREE
)
2062 tree d1
= DECL_NAME (OVL_CURRENT (*m1
));
2063 tree d2
= DECL_NAME (OVL_CURRENT (*m2
));
2064 resort_data
.new_value (&d1
, resort_data
.cookie
);
2065 resort_data
.new_value (&d2
, resort_data
.cookie
);
2072 /* Resort TYPE_METHOD_VEC because pointers have been reordered. */
2075 resort_type_method_vec (void* obj
,
2077 gt_pointer_operator new_value
,
2080 vec
<tree
, va_gc
> *method_vec
= (vec
<tree
, va_gc
> *) obj
;
2081 int len
= vec_safe_length (method_vec
);
2085 /* The type conversion ops have to live at the front of the vec, so we
2087 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2088 vec_safe_iterate (method_vec
, slot
, &fn
);
2090 if (!DECL_CONV_FN_P (OVL_CURRENT (fn
)))
2095 resort_data
.new_value
= new_value
;
2096 resort_data
.cookie
= cookie
;
2097 qsort (method_vec
->address () + slot
, len
- slot
, sizeof (tree
),
2098 resort_method_name_cmp
);
2102 /* Warn about duplicate methods in fn_fields.
2104 Sort methods that are not special (i.e., constructors, destructors,
2105 and type conversion operators) so that we can find them faster in
2109 finish_struct_methods (tree t
)
2112 vec
<tree
, va_gc
> *method_vec
;
2115 method_vec
= CLASSTYPE_METHOD_VEC (t
);
2119 len
= method_vec
->length ();
2121 /* Clear DECL_IN_AGGR_P for all functions. */
2122 for (fn_fields
= TYPE_METHODS (t
); fn_fields
;
2123 fn_fields
= DECL_CHAIN (fn_fields
))
2124 DECL_IN_AGGR_P (fn_fields
) = 0;
2126 /* Issue warnings about private constructors and such. If there are
2127 no methods, then some public defaults are generated. */
2128 maybe_warn_about_overly_private_class (t
);
2130 /* The type conversion ops have to live at the front of the vec, so we
2132 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2133 method_vec
->iterate (slot
, &fn_fields
);
2135 if (!DECL_CONV_FN_P (OVL_CURRENT (fn_fields
)))
2138 qsort (method_vec
->address () + slot
,
2139 len
-slot
, sizeof (tree
), method_name_cmp
);
2142 /* Make BINFO's vtable have N entries, including RTTI entries,
2143 vbase and vcall offsets, etc. Set its type and call the back end
2147 layout_vtable_decl (tree binfo
, int n
)
2152 atype
= build_array_of_n_type (vtable_entry_type
, n
);
2153 layout_type (atype
);
2155 /* We may have to grow the vtable. */
2156 vtable
= get_vtbl_decl_for_binfo (binfo
);
2157 if (!same_type_p (TREE_TYPE (vtable
), atype
))
2159 TREE_TYPE (vtable
) = atype
;
2160 DECL_SIZE (vtable
) = DECL_SIZE_UNIT (vtable
) = NULL_TREE
;
2161 layout_decl (vtable
, 0);
2165 /* True iff FNDECL and BASE_FNDECL (both non-static member functions)
2166 have the same signature. */
2169 same_signature_p (const_tree fndecl
, const_tree base_fndecl
)
2171 /* One destructor overrides another if they are the same kind of
2173 if (DECL_DESTRUCTOR_P (base_fndecl
) && DECL_DESTRUCTOR_P (fndecl
)
2174 && special_function_p (base_fndecl
) == special_function_p (fndecl
))
2176 /* But a non-destructor never overrides a destructor, nor vice
2177 versa, nor do different kinds of destructors override
2178 one-another. For example, a complete object destructor does not
2179 override a deleting destructor. */
2180 if (DECL_DESTRUCTOR_P (base_fndecl
) || DECL_DESTRUCTOR_P (fndecl
))
2183 if (DECL_NAME (fndecl
) == DECL_NAME (base_fndecl
)
2184 || (DECL_CONV_FN_P (fndecl
)
2185 && DECL_CONV_FN_P (base_fndecl
)
2186 && same_type_p (DECL_CONV_FN_TYPE (fndecl
),
2187 DECL_CONV_FN_TYPE (base_fndecl
))))
2189 tree fntype
= TREE_TYPE (fndecl
);
2190 tree base_fntype
= TREE_TYPE (base_fndecl
);
2191 if (type_memfn_quals (fntype
) == type_memfn_quals (base_fntype
)
2192 && type_memfn_rqual (fntype
) == type_memfn_rqual (base_fntype
)
2193 && compparms (FUNCTION_FIRST_USER_PARMTYPE (fndecl
),
2194 FUNCTION_FIRST_USER_PARMTYPE (base_fndecl
)))
2200 /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a
2204 base_derived_from (tree derived
, tree base
)
2208 for (probe
= base
; probe
; probe
= BINFO_INHERITANCE_CHAIN (probe
))
2210 if (probe
== derived
)
2212 else if (BINFO_VIRTUAL_P (probe
))
2213 /* If we meet a virtual base, we can't follow the inheritance
2214 any more. See if the complete type of DERIVED contains
2215 such a virtual base. */
2216 return (binfo_for_vbase (BINFO_TYPE (probe
), BINFO_TYPE (derived
))
2222 typedef struct find_final_overrider_data_s
{
2223 /* The function for which we are trying to find a final overrider. */
2225 /* The base class in which the function was declared. */
2226 tree declaring_base
;
2227 /* The candidate overriders. */
2229 /* Path to most derived. */
2231 } find_final_overrider_data
;
2233 /* Add the overrider along the current path to FFOD->CANDIDATES.
2234 Returns true if an overrider was found; false otherwise. */
2237 dfs_find_final_overrider_1 (tree binfo
,
2238 find_final_overrider_data
*ffod
,
2243 /* If BINFO is not the most derived type, try a more derived class.
2244 A definition there will overrider a definition here. */
2248 if (dfs_find_final_overrider_1
2249 (ffod
->path
[depth
], ffod
, depth
))
2253 method
= look_for_overrides_here (BINFO_TYPE (binfo
), ffod
->fn
);
2256 tree
*candidate
= &ffod
->candidates
;
2258 /* Remove any candidates overridden by this new function. */
2261 /* If *CANDIDATE overrides METHOD, then METHOD
2262 cannot override anything else on the list. */
2263 if (base_derived_from (TREE_VALUE (*candidate
), binfo
))
2265 /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */
2266 if (base_derived_from (binfo
, TREE_VALUE (*candidate
)))
2267 *candidate
= TREE_CHAIN (*candidate
);
2269 candidate
= &TREE_CHAIN (*candidate
);
2272 /* Add the new function. */
2273 ffod
->candidates
= tree_cons (method
, binfo
, ffod
->candidates
);
2280 /* Called from find_final_overrider via dfs_walk. */
2283 dfs_find_final_overrider_pre (tree binfo
, void *data
)
2285 find_final_overrider_data
*ffod
= (find_final_overrider_data
*) data
;
2287 if (binfo
== ffod
->declaring_base
)
2288 dfs_find_final_overrider_1 (binfo
, ffod
, ffod
->path
.length ());
2289 ffod
->path
.safe_push (binfo
);
2295 dfs_find_final_overrider_post (tree
/*binfo*/, void *data
)
2297 find_final_overrider_data
*ffod
= (find_final_overrider_data
*) data
;
2303 /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for
2304 FN and whose TREE_VALUE is the binfo for the base where the
2305 overriding occurs. BINFO (in the hierarchy dominated by the binfo
2306 DERIVED) is the base object in which FN is declared. */
2309 find_final_overrider (tree derived
, tree binfo
, tree fn
)
2311 find_final_overrider_data ffod
;
2313 /* Getting this right is a little tricky. This is valid:
2315 struct S { virtual void f (); };
2316 struct T { virtual void f (); };
2317 struct U : public S, public T { };
2319 even though calling `f' in `U' is ambiguous. But,
2321 struct R { virtual void f(); };
2322 struct S : virtual public R { virtual void f (); };
2323 struct T : virtual public R { virtual void f (); };
2324 struct U : public S, public T { };
2326 is not -- there's no way to decide whether to put `S::f' or
2327 `T::f' in the vtable for `R'.
2329 The solution is to look at all paths to BINFO. If we find
2330 different overriders along any two, then there is a problem. */
2331 if (DECL_THUNK_P (fn
))
2332 fn
= THUNK_TARGET (fn
);
2334 /* Determine the depth of the hierarchy. */
2336 ffod
.declaring_base
= binfo
;
2337 ffod
.candidates
= NULL_TREE
;
2338 ffod
.path
.create (30);
2340 dfs_walk_all (derived
, dfs_find_final_overrider_pre
,
2341 dfs_find_final_overrider_post
, &ffod
);
2343 ffod
.path
.release ();
2345 /* If there was no winner, issue an error message. */
2346 if (!ffod
.candidates
|| TREE_CHAIN (ffod
.candidates
))
2347 return error_mark_node
;
2349 return ffod
.candidates
;
2352 /* Return the index of the vcall offset for FN when TYPE is used as a
2356 get_vcall_index (tree fn
, tree type
)
2358 vec
<tree_pair_s
, va_gc
> *indices
= CLASSTYPE_VCALL_INDICES (type
);
2362 FOR_EACH_VEC_SAFE_ELT (indices
, ix
, p
)
2363 if ((DECL_DESTRUCTOR_P (fn
) && DECL_DESTRUCTOR_P (p
->purpose
))
2364 || same_signature_p (fn
, p
->purpose
))
2367 /* There should always be an appropriate index. */
2371 /* Update an entry in the vtable for BINFO, which is in the hierarchy
2372 dominated by T. FN is the old function; VIRTUALS points to the
2373 corresponding position in the new BINFO_VIRTUALS list. IX is the index
2374 of that entry in the list. */
2377 update_vtable_entry_for_fn (tree t
, tree binfo
, tree fn
, tree
* virtuals
,
2385 tree overrider_fn
, overrider_target
;
2386 tree target_fn
= DECL_THUNK_P (fn
) ? THUNK_TARGET (fn
) : fn
;
2387 tree over_return
, base_return
;
2390 /* Find the nearest primary base (possibly binfo itself) which defines
2391 this function; this is the class the caller will convert to when
2392 calling FN through BINFO. */
2393 for (b
= binfo
; ; b
= get_primary_binfo (b
))
2396 if (look_for_overrides_here (BINFO_TYPE (b
), target_fn
))
2399 /* The nearest definition is from a lost primary. */
2400 if (BINFO_LOST_PRIMARY_P (b
))
2405 /* Find the final overrider. */
2406 overrider
= find_final_overrider (TYPE_BINFO (t
), b
, target_fn
);
2407 if (overrider
== error_mark_node
)
2409 error ("no unique final overrider for %qD in %qT", target_fn
, t
);
2412 overrider_target
= overrider_fn
= TREE_PURPOSE (overrider
);
2414 /* Check for adjusting covariant return types. */
2415 over_return
= TREE_TYPE (TREE_TYPE (overrider_target
));
2416 base_return
= TREE_TYPE (TREE_TYPE (target_fn
));
2418 if (POINTER_TYPE_P (over_return
)
2419 && TREE_CODE (over_return
) == TREE_CODE (base_return
)
2420 && CLASS_TYPE_P (TREE_TYPE (over_return
))
2421 && CLASS_TYPE_P (TREE_TYPE (base_return
))
2422 /* If the overrider is invalid, don't even try. */
2423 && !DECL_INVALID_OVERRIDER_P (overrider_target
))
2425 /* If FN is a covariant thunk, we must figure out the adjustment
2426 to the final base FN was converting to. As OVERRIDER_TARGET might
2427 also be converting to the return type of FN, we have to
2428 combine the two conversions here. */
2429 tree fixed_offset
, virtual_offset
;
2431 over_return
= TREE_TYPE (over_return
);
2432 base_return
= TREE_TYPE (base_return
);
2434 if (DECL_THUNK_P (fn
))
2436 gcc_assert (DECL_RESULT_THUNK_P (fn
));
2437 fixed_offset
= ssize_int (THUNK_FIXED_OFFSET (fn
));
2438 virtual_offset
= THUNK_VIRTUAL_OFFSET (fn
);
2441 fixed_offset
= virtual_offset
= NULL_TREE
;
2444 /* Find the equivalent binfo within the return type of the
2445 overriding function. We will want the vbase offset from
2447 virtual_offset
= binfo_for_vbase (BINFO_TYPE (virtual_offset
),
2449 else if (!same_type_ignoring_top_level_qualifiers_p
2450 (over_return
, base_return
))
2452 /* There was no existing virtual thunk (which takes
2453 precedence). So find the binfo of the base function's
2454 return type within the overriding function's return type.
2455 We cannot call lookup base here, because we're inside a
2456 dfs_walk, and will therefore clobber the BINFO_MARKED
2457 flags. Fortunately we know the covariancy is valid (it
2458 has already been checked), so we can just iterate along
2459 the binfos, which have been chained in inheritance graph
2460 order. Of course it is lame that we have to repeat the
2461 search here anyway -- we should really be caching pieces
2462 of the vtable and avoiding this repeated work. */
2463 tree thunk_binfo
, base_binfo
;
2465 /* Find the base binfo within the overriding function's
2466 return type. We will always find a thunk_binfo, except
2467 when the covariancy is invalid (which we will have
2468 already diagnosed). */
2469 for (base_binfo
= TYPE_BINFO (base_return
),
2470 thunk_binfo
= TYPE_BINFO (over_return
);
2472 thunk_binfo
= TREE_CHAIN (thunk_binfo
))
2473 if (SAME_BINFO_TYPE_P (BINFO_TYPE (thunk_binfo
),
2474 BINFO_TYPE (base_binfo
)))
2477 /* See if virtual inheritance is involved. */
2478 for (virtual_offset
= thunk_binfo
;
2480 virtual_offset
= BINFO_INHERITANCE_CHAIN (virtual_offset
))
2481 if (BINFO_VIRTUAL_P (virtual_offset
))
2485 || (thunk_binfo
&& !BINFO_OFFSET_ZEROP (thunk_binfo
)))
2487 tree offset
= convert (ssizetype
, BINFO_OFFSET (thunk_binfo
));
2491 /* We convert via virtual base. Adjust the fixed
2492 offset to be from there. */
2494 size_diffop (offset
,
2496 BINFO_OFFSET (virtual_offset
)));
2499 /* There was an existing fixed offset, this must be
2500 from the base just converted to, and the base the
2501 FN was thunking to. */
2502 fixed_offset
= size_binop (PLUS_EXPR
, fixed_offset
, offset
);
2504 fixed_offset
= offset
;
2508 if (fixed_offset
|| virtual_offset
)
2509 /* Replace the overriding function with a covariant thunk. We
2510 will emit the overriding function in its own slot as
2512 overrider_fn
= make_thunk (overrider_target
, /*this_adjusting=*/0,
2513 fixed_offset
, virtual_offset
);
2516 gcc_assert (DECL_INVALID_OVERRIDER_P (overrider_target
) ||
2517 !DECL_THUNK_P (fn
));
2519 /* If we need a covariant thunk, then we may need to adjust first_defn.
2520 The ABI specifies that the thunks emitted with a function are
2521 determined by which bases the function overrides, so we need to be
2522 sure that we're using a thunk for some overridden base; even if we
2523 know that the necessary this adjustment is zero, there may not be an
2524 appropriate zero-this-adjusment thunk for us to use since thunks for
2525 overriding virtual bases always use the vcall offset.
2527 Furthermore, just choosing any base that overrides this function isn't
2528 quite right, as this slot won't be used for calls through a type that
2529 puts a covariant thunk here. Calling the function through such a type
2530 will use a different slot, and that slot is the one that determines
2531 the thunk emitted for that base.
2533 So, keep looking until we find the base that we're really overriding
2534 in this slot: the nearest primary base that doesn't use a covariant
2535 thunk in this slot. */
2536 if (overrider_target
!= overrider_fn
)
2538 if (BINFO_TYPE (b
) == DECL_CONTEXT (overrider_target
))
2539 /* We already know that the overrider needs a covariant thunk. */
2540 b
= get_primary_binfo (b
);
2541 for (; ; b
= get_primary_binfo (b
))
2543 tree main_binfo
= TYPE_BINFO (BINFO_TYPE (b
));
2544 tree bv
= chain_index (ix
, BINFO_VIRTUALS (main_binfo
));
2545 if (!DECL_THUNK_P (TREE_VALUE (bv
)))
2547 if (BINFO_LOST_PRIMARY_P (b
))
2553 /* Assume that we will produce a thunk that convert all the way to
2554 the final overrider, and not to an intermediate virtual base. */
2555 virtual_base
= NULL_TREE
;
2557 /* See if we can convert to an intermediate virtual base first, and then
2558 use the vcall offset located there to finish the conversion. */
2559 for (; b
; b
= BINFO_INHERITANCE_CHAIN (b
))
2561 /* If we find the final overrider, then we can stop
2563 if (SAME_BINFO_TYPE_P (BINFO_TYPE (b
),
2564 BINFO_TYPE (TREE_VALUE (overrider
))))
2567 /* If we find a virtual base, and we haven't yet found the
2568 overrider, then there is a virtual base between the
2569 declaring base (first_defn) and the final overrider. */
2570 if (BINFO_VIRTUAL_P (b
))
2577 /* Compute the constant adjustment to the `this' pointer. The
2578 `this' pointer, when this function is called, will point at BINFO
2579 (or one of its primary bases, which are at the same offset). */
2581 /* The `this' pointer needs to be adjusted from the declaration to
2582 the nearest virtual base. */
2583 delta
= size_diffop_loc (input_location
,
2584 convert (ssizetype
, BINFO_OFFSET (virtual_base
)),
2585 convert (ssizetype
, BINFO_OFFSET (first_defn
)));
2587 /* If the nearest definition is in a lost primary, we don't need an
2588 entry in our vtable. Except possibly in a constructor vtable,
2589 if we happen to get our primary back. In that case, the offset
2590 will be zero, as it will be a primary base. */
2591 delta
= size_zero_node
;
2593 /* The `this' pointer needs to be adjusted from pointing to
2594 BINFO to pointing at the base where the final overrider
2596 delta
= size_diffop_loc (input_location
,
2598 BINFO_OFFSET (TREE_VALUE (overrider
))),
2599 convert (ssizetype
, BINFO_OFFSET (binfo
)));
2601 modify_vtable_entry (t
, binfo
, overrider_fn
, delta
, virtuals
);
2604 BV_VCALL_INDEX (*virtuals
)
2605 = get_vcall_index (overrider_target
, BINFO_TYPE (virtual_base
));
2607 BV_VCALL_INDEX (*virtuals
) = NULL_TREE
;
2609 BV_LOST_PRIMARY (*virtuals
) = lost
;
2612 /* Called from modify_all_vtables via dfs_walk. */
2615 dfs_modify_vtables (tree binfo
, void* data
)
2617 tree t
= (tree
) data
;
2622 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
2623 /* A base without a vtable needs no modification, and its bases
2624 are uninteresting. */
2625 return dfs_skip_bases
;
2627 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
)
2628 && !CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
2629 /* Don't do the primary vtable, if it's new. */
2632 if (BINFO_PRIMARY_P (binfo
) && !BINFO_VIRTUAL_P (binfo
))
2633 /* There's no need to modify the vtable for a non-virtual primary
2634 base; we're not going to use that vtable anyhow. We do still
2635 need to do this for virtual primary bases, as they could become
2636 non-primary in a construction vtable. */
2639 make_new_vtable (t
, binfo
);
2641 /* Now, go through each of the virtual functions in the virtual
2642 function table for BINFO. Find the final overrider, and update
2643 the BINFO_VIRTUALS list appropriately. */
2644 for (ix
= 0, virtuals
= BINFO_VIRTUALS (binfo
),
2645 old_virtuals
= BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo
)));
2647 ix
++, virtuals
= TREE_CHAIN (virtuals
),
2648 old_virtuals
= TREE_CHAIN (old_virtuals
))
2649 update_vtable_entry_for_fn (t
,
2651 BV_FN (old_virtuals
),
2657 /* Update all of the primary and secondary vtables for T. Create new
2658 vtables as required, and initialize their RTTI information. Each
2659 of the functions in VIRTUALS is declared in T and may override a
2660 virtual function from a base class; find and modify the appropriate
2661 entries to point to the overriding functions. Returns a list, in
2662 declaration order, of the virtual functions that are declared in T,
2663 but do not appear in the primary base class vtable, and which
2664 should therefore be appended to the end of the vtable for T. */
2667 modify_all_vtables (tree t
, tree virtuals
)
2669 tree binfo
= TYPE_BINFO (t
);
2672 /* Mangle the vtable name before entering dfs_walk (c++/51884). */
2673 if (TYPE_CONTAINS_VPTR_P (t
))
2674 get_vtable_decl (t
, false);
2676 /* Update all of the vtables. */
2677 dfs_walk_once (binfo
, dfs_modify_vtables
, NULL
, t
);
2679 /* Add virtual functions not already in our primary vtable. These
2680 will be both those introduced by this class, and those overridden
2681 from secondary bases. It does not include virtuals merely
2682 inherited from secondary bases. */
2683 for (fnsp
= &virtuals
; *fnsp
; )
2685 tree fn
= TREE_VALUE (*fnsp
);
2687 if (!value_member (fn
, BINFO_VIRTUALS (binfo
))
2688 || DECL_VINDEX (fn
) == error_mark_node
)
2690 /* We don't need to adjust the `this' pointer when
2691 calling this function. */
2692 BV_DELTA (*fnsp
) = integer_zero_node
;
2693 BV_VCALL_INDEX (*fnsp
) = NULL_TREE
;
2695 /* This is a function not already in our vtable. Keep it. */
2696 fnsp
= &TREE_CHAIN (*fnsp
);
2699 /* We've already got an entry for this function. Skip it. */
2700 *fnsp
= TREE_CHAIN (*fnsp
);
2706 /* Get the base virtual function declarations in T that have the
2710 get_basefndecls (tree name
, tree t
)
2713 tree base_fndecls
= NULL_TREE
;
2714 int n_baseclasses
= BINFO_N_BASE_BINFOS (TYPE_BINFO (t
));
2717 /* Find virtual functions in T with the indicated NAME. */
2718 i
= lookup_fnfields_1 (t
, name
);
2720 for (methods
= (*CLASSTYPE_METHOD_VEC (t
))[i
];
2722 methods
= OVL_NEXT (methods
))
2724 tree method
= OVL_CURRENT (methods
);
2726 if (TREE_CODE (method
) == FUNCTION_DECL
2727 && DECL_VINDEX (method
))
2728 base_fndecls
= tree_cons (NULL_TREE
, method
, base_fndecls
);
2732 return base_fndecls
;
2734 for (i
= 0; i
< n_baseclasses
; i
++)
2736 tree basetype
= BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (t
), i
));
2737 base_fndecls
= chainon (get_basefndecls (name
, basetype
),
2741 return base_fndecls
;
2744 /* If this declaration supersedes the declaration of
2745 a method declared virtual in the base class, then
2746 mark this field as being virtual as well. */
2749 check_for_override (tree decl
, tree ctype
)
2751 bool overrides_found
= false;
2752 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2753 /* In [temp.mem] we have:
2755 A specialization of a member function template does not
2756 override a virtual function from a base class. */
2758 if ((DECL_DESTRUCTOR_P (decl
)
2759 || IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
))
2760 || DECL_CONV_FN_P (decl
))
2761 && look_for_overrides (ctype
, decl
)
2762 && !DECL_STATIC_FUNCTION_P (decl
))
2763 /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor
2764 the error_mark_node so that we know it is an overriding
2767 DECL_VINDEX (decl
) = decl
;
2768 overrides_found
= true;
2771 if (DECL_VIRTUAL_P (decl
))
2773 if (!DECL_VINDEX (decl
))
2774 DECL_VINDEX (decl
) = error_mark_node
;
2775 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
2776 if (DECL_DESTRUCTOR_P (decl
))
2777 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (ctype
) = true;
2779 else if (DECL_FINAL_P (decl
))
2780 error ("%q+#D marked %<final%>, but is not virtual", decl
);
2781 if (DECL_OVERRIDE_P (decl
) && !overrides_found
)
2782 error ("%q+#D marked %<override%>, but does not override", decl
);
2785 /* Warn about hidden virtual functions that are not overridden in t.
2786 We know that constructors and destructors don't apply. */
2789 warn_hidden (tree t
)
2791 vec
<tree
, va_gc
> *method_vec
= CLASSTYPE_METHOD_VEC (t
);
2795 /* We go through each separately named virtual function. */
2796 for (i
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2797 vec_safe_iterate (method_vec
, i
, &fns
);
2808 /* All functions in this slot in the CLASSTYPE_METHOD_VEC will
2809 have the same name. Figure out what name that is. */
2810 name
= DECL_NAME (OVL_CURRENT (fns
));
2811 /* There are no possibly hidden functions yet. */
2812 base_fndecls
= NULL_TREE
;
2813 /* Iterate through all of the base classes looking for possibly
2814 hidden functions. */
2815 for (binfo
= TYPE_BINFO (t
), j
= 0;
2816 BINFO_BASE_ITERATE (binfo
, j
, base_binfo
); j
++)
2818 tree basetype
= BINFO_TYPE (base_binfo
);
2819 base_fndecls
= chainon (get_basefndecls (name
, basetype
),
2823 /* If there are no functions to hide, continue. */
2827 /* Remove any overridden functions. */
2828 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
2830 fndecl
= OVL_CURRENT (fn
);
2831 if (TREE_CODE (fndecl
) == FUNCTION_DECL
2832 && DECL_VINDEX (fndecl
))
2834 tree
*prev
= &base_fndecls
;
2837 /* If the method from the base class has the same
2838 signature as the method from the derived class, it
2839 has been overridden. */
2840 if (same_signature_p (fndecl
, TREE_VALUE (*prev
)))
2841 *prev
= TREE_CHAIN (*prev
);
2843 prev
= &TREE_CHAIN (*prev
);
2847 /* Now give a warning for all base functions without overriders,
2848 as they are hidden. */
2849 while (base_fndecls
)
2851 /* Here we know it is a hider, and no overrider exists. */
2852 warning (OPT_Woverloaded_virtual
, "%q+D was hidden", TREE_VALUE (base_fndecls
));
2853 warning (OPT_Woverloaded_virtual
, " by %q+D", fns
);
2854 base_fndecls
= TREE_CHAIN (base_fndecls
);
2859 /* Recursive helper for finish_struct_anon. */
2862 finish_struct_anon_r (tree field
, bool complain
)
2864 bool is_union
= TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
;
2865 tree elt
= TYPE_FIELDS (TREE_TYPE (field
));
2866 for (; elt
; elt
= DECL_CHAIN (elt
))
2868 /* We're generally only interested in entities the user
2869 declared, but we also find nested classes by noticing
2870 the TYPE_DECL that we create implicitly. You're
2871 allowed to put one anonymous union inside another,
2872 though, so we explicitly tolerate that. We use
2873 TYPE_ANONYMOUS_P rather than ANON_AGGR_TYPE_P so that
2874 we also allow unnamed types used for defining fields. */
2875 if (DECL_ARTIFICIAL (elt
)
2876 && (!DECL_IMPLICIT_TYPEDEF_P (elt
)
2877 || TYPE_ANONYMOUS_P (TREE_TYPE (elt
))))
2880 if (TREE_CODE (elt
) != FIELD_DECL
)
2882 /* We already complained about static data members in
2883 finish_static_data_member_decl. */
2884 if (complain
&& TREE_CODE (elt
) != VAR_DECL
)
2887 permerror (input_location
,
2888 "%q+#D invalid; an anonymous union can "
2889 "only have non-static data members", elt
);
2891 permerror (input_location
,
2892 "%q+#D invalid; an anonymous struct can "
2893 "only have non-static data members", elt
);
2900 if (TREE_PRIVATE (elt
))
2903 permerror (input_location
,
2904 "private member %q+#D in anonymous union", elt
);
2906 permerror (input_location
,
2907 "private member %q+#D in anonymous struct", elt
);
2909 else if (TREE_PROTECTED (elt
))
2912 permerror (input_location
,
2913 "protected member %q+#D in anonymous union", elt
);
2915 permerror (input_location
,
2916 "protected member %q+#D in anonymous struct", elt
);
2920 TREE_PRIVATE (elt
) = TREE_PRIVATE (field
);
2921 TREE_PROTECTED (elt
) = TREE_PROTECTED (field
);
2923 /* Recurse into the anonymous aggregates to handle correctly
2924 access control (c++/24926):
2935 if (DECL_NAME (elt
) == NULL_TREE
2936 && ANON_AGGR_TYPE_P (TREE_TYPE (elt
)))
2937 finish_struct_anon_r (elt
, /*complain=*/false);
2941 /* Check for things that are invalid. There are probably plenty of other
2942 things we should check for also. */
2945 finish_struct_anon (tree t
)
2947 for (tree field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
2949 if (TREE_STATIC (field
))
2951 if (TREE_CODE (field
) != FIELD_DECL
)
2954 if (DECL_NAME (field
) == NULL_TREE
2955 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2956 finish_struct_anon_r (field
, /*complain=*/true);
2960 /* Add T to CLASSTYPE_DECL_LIST of current_class_type which
2961 will be used later during class template instantiation.
2962 When FRIEND_P is zero, T can be a static member data (VAR_DECL),
2963 a non-static member data (FIELD_DECL), a member function
2964 (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE),
2965 a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL)
2966 When FRIEND_P is nonzero, T is either a friend class
2967 (RECORD_TYPE, TEMPLATE_DECL) or a friend function
2968 (FUNCTION_DECL, TEMPLATE_DECL). */
2971 maybe_add_class_template_decl_list (tree type
, tree t
, int friend_p
)
2973 /* Save some memory by not creating TREE_LIST if TYPE is not template. */
2974 if (CLASSTYPE_TEMPLATE_INFO (type
))
2975 CLASSTYPE_DECL_LIST (type
)
2976 = tree_cons (friend_p
? NULL_TREE
: type
,
2977 t
, CLASSTYPE_DECL_LIST (type
));
2980 /* This function is called from declare_virt_assop_and_dtor via
2983 DATA is a type that direcly or indirectly inherits the base
2984 represented by BINFO. If BINFO contains a virtual assignment [copy
2985 assignment or move assigment] operator or a virtual constructor,
2986 declare that function in DATA if it hasn't been already declared. */
2989 dfs_declare_virt_assop_and_dtor (tree binfo
, void *data
)
2991 tree bv
, fn
, t
= (tree
)data
;
2992 tree opname
= ansi_assopname (NOP_EXPR
);
2994 gcc_assert (t
&& CLASS_TYPE_P (t
));
2995 gcc_assert (binfo
&& TREE_CODE (binfo
) == TREE_BINFO
);
2997 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
2998 /* A base without a vtable needs no modification, and its bases
2999 are uninteresting. */
3000 return dfs_skip_bases
;
3002 if (BINFO_PRIMARY_P (binfo
))
3003 /* If this is a primary base, then we have already looked at the
3004 virtual functions of its vtable. */
3007 for (bv
= BINFO_VIRTUALS (binfo
); bv
; bv
= TREE_CHAIN (bv
))
3011 if (DECL_NAME (fn
) == opname
)
3013 if (CLASSTYPE_LAZY_COPY_ASSIGN (t
))
3014 lazily_declare_fn (sfk_copy_assignment
, t
);
3015 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
3016 lazily_declare_fn (sfk_move_assignment
, t
);
3018 else if (DECL_DESTRUCTOR_P (fn
)
3019 && CLASSTYPE_LAZY_DESTRUCTOR (t
))
3020 lazily_declare_fn (sfk_destructor
, t
);
3026 /* If the class type T has a direct or indirect base that contains a
3027 virtual assignment operator or a virtual destructor, declare that
3028 function in T if it hasn't been already declared. */
3031 declare_virt_assop_and_dtor (tree t
)
3033 if (!(TYPE_POLYMORPHIC_P (t
)
3034 && (CLASSTYPE_LAZY_COPY_ASSIGN (t
)
3035 || CLASSTYPE_LAZY_MOVE_ASSIGN (t
)
3036 || CLASSTYPE_LAZY_DESTRUCTOR (t
))))
3039 dfs_walk_all (TYPE_BINFO (t
),
3040 dfs_declare_virt_assop_and_dtor
,
3044 /* Declare the inheriting constructor for class T inherited from base
3045 constructor CTOR with the parameter array PARMS of size NPARMS. */
3048 one_inheriting_sig (tree t
, tree ctor
, tree
*parms
, int nparms
)
3050 /* We don't declare an inheriting ctor that would be a default,
3051 copy or move ctor for derived or base. */
3055 && TREE_CODE (parms
[0]) == REFERENCE_TYPE
)
3057 tree parm
= TYPE_MAIN_VARIANT (TREE_TYPE (parms
[0]));
3058 if (parm
== t
|| parm
== DECL_CONTEXT (ctor
))
3062 tree parmlist
= void_list_node
;
3063 for (int i
= nparms
- 1; i
>= 0; i
--)
3064 parmlist
= tree_cons (NULL_TREE
, parms
[i
], parmlist
);
3065 tree fn
= implicitly_declare_fn (sfk_inheriting_constructor
,
3066 t
, false, ctor
, parmlist
);
3067 if (add_method (t
, fn
, NULL_TREE
))
3069 DECL_CHAIN (fn
) = TYPE_METHODS (t
);
3070 TYPE_METHODS (t
) = fn
;
3074 /* Declare all the inheriting constructors for class T inherited from base
3075 constructor CTOR. */
3078 one_inherited_ctor (tree ctor
, tree t
)
3080 tree parms
= FUNCTION_FIRST_USER_PARMTYPE (ctor
);
3082 tree
*new_parms
= XALLOCAVEC (tree
, list_length (parms
));
3084 for (; parms
&& parms
!= void_list_node
; parms
= TREE_CHAIN (parms
))
3086 if (TREE_PURPOSE (parms
))
3087 one_inheriting_sig (t
, ctor
, new_parms
, i
);
3088 new_parms
[i
++] = TREE_VALUE (parms
);
3090 one_inheriting_sig (t
, ctor
, new_parms
, i
);
3091 if (parms
== NULL_TREE
)
3093 if (warning (OPT_Winherited_variadic_ctor
,
3094 "the ellipsis in %qD is not inherited", ctor
))
3095 inform (DECL_SOURCE_LOCATION (ctor
), "%qD declared here", ctor
);
3099 /* Create default constructors, assignment operators, and so forth for
3100 the type indicated by T, if they are needed. CANT_HAVE_CONST_CTOR,
3101 and CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason,
3102 the class cannot have a default constructor, copy constructor
3103 taking a const reference argument, or an assignment operator taking
3104 a const reference, respectively. */
3107 add_implicitly_declared_members (tree t
, tree
* access_decls
,
3108 int cant_have_const_cctor
,
3109 int cant_have_const_assignment
)
3111 bool move_ok
= false;
3113 if (cxx_dialect
>= cxx11
&& !CLASSTYPE_DESTRUCTORS (t
)
3114 && !TYPE_HAS_COPY_CTOR (t
) && !TYPE_HAS_COPY_ASSIGN (t
)
3115 && !type_has_move_constructor (t
) && !type_has_move_assign (t
))
3119 if (!CLASSTYPE_DESTRUCTORS (t
))
3121 /* In general, we create destructors lazily. */
3122 CLASSTYPE_LAZY_DESTRUCTOR (t
) = 1;
3124 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3125 && TYPE_FOR_JAVA (t
))
3126 /* But if this is a Java class, any non-trivial destructor is
3127 invalid, even if compiler-generated. Therefore, if the
3128 destructor is non-trivial we create it now. */
3129 lazily_declare_fn (sfk_destructor
, t
);
3134 If there is no user-declared constructor for a class, a default
3135 constructor is implicitly declared. */
3136 if (! TYPE_HAS_USER_CONSTRUCTOR (t
))
3138 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 1;
3139 CLASSTYPE_LAZY_DEFAULT_CTOR (t
) = 1;
3140 if (cxx_dialect
>= cxx11
)
3141 TYPE_HAS_CONSTEXPR_CTOR (t
)
3142 /* This might force the declaration. */
3143 = type_has_constexpr_default_constructor (t
);
3148 If a class definition does not explicitly declare a copy
3149 constructor, one is declared implicitly. */
3150 if (! TYPE_HAS_COPY_CTOR (t
) && ! TYPE_FOR_JAVA (t
))
3152 TYPE_HAS_COPY_CTOR (t
) = 1;
3153 TYPE_HAS_CONST_COPY_CTOR (t
) = !cant_have_const_cctor
;
3154 CLASSTYPE_LAZY_COPY_CTOR (t
) = 1;
3156 CLASSTYPE_LAZY_MOVE_CTOR (t
) = 1;
3159 /* If there is no assignment operator, one will be created if and
3160 when it is needed. For now, just record whether or not the type
3161 of the parameter to the assignment operator will be a const or
3162 non-const reference. */
3163 if (!TYPE_HAS_COPY_ASSIGN (t
) && !TYPE_FOR_JAVA (t
))
3165 TYPE_HAS_COPY_ASSIGN (t
) = 1;
3166 TYPE_HAS_CONST_COPY_ASSIGN (t
) = !cant_have_const_assignment
;
3167 CLASSTYPE_LAZY_COPY_ASSIGN (t
) = 1;
3168 if (move_ok
&& !LAMBDA_TYPE_P (t
))
3169 CLASSTYPE_LAZY_MOVE_ASSIGN (t
) = 1;
3172 /* We can't be lazy about declaring functions that might override
3173 a virtual function from a base class. */
3174 declare_virt_assop_and_dtor (t
);
3176 while (*access_decls
)
3178 tree using_decl
= TREE_VALUE (*access_decls
);
3179 tree decl
= USING_DECL_DECLS (using_decl
);
3180 if (DECL_NAME (using_decl
) == ctor_identifier
)
3182 /* declare, then remove the decl */
3183 tree ctor_list
= decl
;
3184 location_t loc
= input_location
;
3185 input_location
= DECL_SOURCE_LOCATION (using_decl
);
3187 for (; ctor_list
; ctor_list
= OVL_NEXT (ctor_list
))
3188 one_inherited_ctor (OVL_CURRENT (ctor_list
), t
);
3189 *access_decls
= TREE_CHAIN (*access_decls
);
3190 input_location
= loc
;
3193 access_decls
= &TREE_CHAIN (*access_decls
);
3197 /* Subroutine of insert_into_classtype_sorted_fields. Recursively
3198 count the number of fields in TYPE, including anonymous union
3202 count_fields (tree fields
)
3206 for (x
= fields
; x
; x
= DECL_CHAIN (x
))
3208 if (TREE_CODE (x
) == FIELD_DECL
&& ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
3209 n_fields
+= count_fields (TYPE_FIELDS (TREE_TYPE (x
)));
3216 /* Subroutine of insert_into_classtype_sorted_fields. Recursively add
3217 all the fields in the TREE_LIST FIELDS to the SORTED_FIELDS_TYPE
3218 elts, starting at offset IDX. */
3221 add_fields_to_record_type (tree fields
, struct sorted_fields_type
*field_vec
, int idx
)
3224 for (x
= fields
; x
; x
= DECL_CHAIN (x
))
3226 if (TREE_CODE (x
) == FIELD_DECL
&& ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
3227 idx
= add_fields_to_record_type (TYPE_FIELDS (TREE_TYPE (x
)), field_vec
, idx
);
3229 field_vec
->elts
[idx
++] = x
;
3234 /* Add all of the enum values of ENUMTYPE, to the FIELD_VEC elts,
3235 starting at offset IDX. */
3238 add_enum_fields_to_record_type (tree enumtype
,
3239 struct sorted_fields_type
*field_vec
,
3243 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
3244 field_vec
->elts
[idx
++] = TREE_VALUE (values
);
3248 /* FIELD is a bit-field. We are finishing the processing for its
3249 enclosing type. Issue any appropriate messages and set appropriate
3250 flags. Returns false if an error has been diagnosed. */
3253 check_bitfield_decl (tree field
)
3255 tree type
= TREE_TYPE (field
);
3258 /* Extract the declared width of the bitfield, which has been
3259 temporarily stashed in DECL_INITIAL. */
3260 w
= DECL_INITIAL (field
);
3261 gcc_assert (w
!= NULL_TREE
);
3262 /* Remove the bit-field width indicator so that the rest of the
3263 compiler does not treat that value as an initializer. */
3264 DECL_INITIAL (field
) = NULL_TREE
;
3266 /* Detect invalid bit-field type. */
3267 if (!INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
3269 error ("bit-field %q+#D with non-integral type", field
);
3270 w
= error_mark_node
;
3274 location_t loc
= input_location
;
3275 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
3278 /* detect invalid field size. */
3279 input_location
= DECL_SOURCE_LOCATION (field
);
3280 w
= cxx_constant_value (w
);
3281 input_location
= loc
;
3283 if (TREE_CODE (w
) != INTEGER_CST
)
3285 error ("bit-field %q+D width not an integer constant", field
);
3286 w
= error_mark_node
;
3288 else if (tree_int_cst_sgn (w
) < 0)
3290 error ("negative width in bit-field %q+D", field
);
3291 w
= error_mark_node
;
3293 else if (integer_zerop (w
) && DECL_NAME (field
) != 0)
3295 error ("zero width for bit-field %q+D", field
);
3296 w
= error_mark_node
;
3298 else if ((TREE_CODE (type
) != ENUMERAL_TYPE
3299 && TREE_CODE (type
) != BOOLEAN_TYPE
3300 && compare_tree_int (w
, TYPE_PRECISION (type
)) > 0)
3301 || ((TREE_CODE (type
) == ENUMERAL_TYPE
3302 || TREE_CODE (type
) == BOOLEAN_TYPE
)
3303 && tree_int_cst_lt (TYPE_SIZE (type
), w
)))
3304 warning (0, "width of %q+D exceeds its type", field
);
3305 else if (TREE_CODE (type
) == ENUMERAL_TYPE
3306 && (0 > (compare_tree_int
3307 (w
, TYPE_PRECISION (ENUM_UNDERLYING_TYPE (type
))))))
3308 warning (0, "%q+D is too small to hold all values of %q#T", field
, type
);
3311 if (w
!= error_mark_node
)
3313 DECL_SIZE (field
) = convert (bitsizetype
, w
);
3314 DECL_BIT_FIELD (field
) = 1;
3319 /* Non-bit-fields are aligned for their type. */
3320 DECL_BIT_FIELD (field
) = 0;
3321 CLEAR_DECL_C_BIT_FIELD (field
);
3326 /* FIELD is a non bit-field. We are finishing the processing for its
3327 enclosing type T. Issue any appropriate messages and set appropriate
3331 check_field_decl (tree field
,
3333 int* cant_have_const_ctor
,
3334 int* no_const_asn_ref
,
3335 int* any_default_members
)
3337 tree type
= strip_array_types (TREE_TYPE (field
));
3339 /* In C++98 an anonymous union cannot contain any fields which would change
3340 the settings of CANT_HAVE_CONST_CTOR and friends. */
3341 if (ANON_UNION_TYPE_P (type
) && cxx_dialect
< cxx11
)
3343 /* And, we don't set TYPE_HAS_CONST_COPY_CTOR, etc., for anonymous
3344 structs. So, we recurse through their fields here. */
3345 else if (ANON_AGGR_TYPE_P (type
))
3349 for (fields
= TYPE_FIELDS (type
); fields
; fields
= DECL_CHAIN (fields
))
3350 if (TREE_CODE (fields
) == FIELD_DECL
&& !DECL_C_BIT_FIELD (field
))
3351 check_field_decl (fields
, t
, cant_have_const_ctor
,
3352 no_const_asn_ref
, any_default_members
);
3354 /* Check members with class type for constructors, destructors,
3356 else if (CLASS_TYPE_P (type
))
3358 /* Never let anything with uninheritable virtuals
3359 make it through without complaint. */
3360 abstract_virtuals_error (field
, type
);
3362 if (TREE_CODE (t
) == UNION_TYPE
&& cxx_dialect
< cxx11
)
3365 int oldcount
= errorcount
;
3366 if (TYPE_NEEDS_CONSTRUCTING (type
))
3367 error ("member %q+#D with constructor not allowed in union",
3369 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
3370 error ("member %q+#D with destructor not allowed in union", field
);
3371 if (TYPE_HAS_COMPLEX_COPY_ASSIGN (type
))
3372 error ("member %q+#D with copy assignment operator not allowed in union",
3374 if (!warned
&& errorcount
> oldcount
)
3376 inform (DECL_SOURCE_LOCATION (field
), "unrestricted unions "
3377 "only available with -std=c++11 or -std=gnu++11");
3383 TYPE_NEEDS_CONSTRUCTING (t
) |= TYPE_NEEDS_CONSTRUCTING (type
);
3384 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3385 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
);
3386 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
)
3387 |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (type
)
3388 || !TYPE_HAS_COPY_ASSIGN (type
));
3389 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= (TYPE_HAS_COMPLEX_COPY_CTOR (type
)
3390 || !TYPE_HAS_COPY_CTOR (type
));
3391 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (type
);
3392 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_HAS_COMPLEX_MOVE_CTOR (type
);
3393 TYPE_HAS_COMPLEX_DFLT (t
) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (type
)
3394 || TYPE_HAS_COMPLEX_DFLT (type
));
3397 if (TYPE_HAS_COPY_CTOR (type
)
3398 && !TYPE_HAS_CONST_COPY_CTOR (type
))
3399 *cant_have_const_ctor
= 1;
3401 if (TYPE_HAS_COPY_ASSIGN (type
)
3402 && !TYPE_HAS_CONST_COPY_ASSIGN (type
))
3403 *no_const_asn_ref
= 1;
3406 check_abi_tags (t
, field
);
3408 if (DECL_INITIAL (field
) != NULL_TREE
)
3410 /* `build_class_init_list' does not recognize
3412 if (TREE_CODE (t
) == UNION_TYPE
&& *any_default_members
!= 0)
3413 error ("multiple fields in union %qT initialized", t
);
3414 *any_default_members
= 1;
3418 /* Check the data members (both static and non-static), class-scoped
3419 typedefs, etc., appearing in the declaration of T. Issue
3420 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
3421 declaration order) of access declarations; each TREE_VALUE in this
3422 list is a USING_DECL.
3424 In addition, set the following flags:
3427 The class is empty, i.e., contains no non-static data members.
3429 CANT_HAVE_CONST_CTOR_P
3430 This class cannot have an implicitly generated copy constructor
3431 taking a const reference.
3433 CANT_HAVE_CONST_ASN_REF
3434 This class cannot have an implicitly generated assignment
3435 operator taking a const reference.
3437 All of these flags should be initialized before calling this
3440 Returns a pointer to the end of the TYPE_FIELDs chain; additional
3441 fields can be added by adding to this chain. */
3444 check_field_decls (tree t
, tree
*access_decls
,
3445 int *cant_have_const_ctor_p
,
3446 int *no_const_asn_ref_p
)
3451 int any_default_members
;
3453 int field_access
= -1;
3455 /* Assume there are no access declarations. */
3456 *access_decls
= NULL_TREE
;
3457 /* Assume this class has no pointer members. */
3458 has_pointers
= false;
3459 /* Assume none of the members of this class have default
3461 any_default_members
= 0;
3463 for (field
= &TYPE_FIELDS (t
); *field
; field
= next
)
3466 tree type
= TREE_TYPE (x
);
3467 int this_field_access
;
3469 next
= &DECL_CHAIN (x
);
3471 if (TREE_CODE (x
) == USING_DECL
)
3473 /* Save the access declarations for our caller. */
3474 *access_decls
= tree_cons (NULL_TREE
, x
, *access_decls
);
3478 if (TREE_CODE (x
) == TYPE_DECL
3479 || TREE_CODE (x
) == TEMPLATE_DECL
)
3482 /* If we've gotten this far, it's a data member, possibly static,
3483 or an enumerator. */
3484 if (TREE_CODE (x
) != CONST_DECL
)
3485 DECL_CONTEXT (x
) = t
;
3487 /* When this goes into scope, it will be a non-local reference. */
3488 DECL_NONLOCAL (x
) = 1;
3490 if (TREE_CODE (t
) == UNION_TYPE
3491 && cxx_dialect
< cxx11
)
3493 /* [class.union] (C++98)
3495 If a union contains a static data member, or a member of
3496 reference type, the program is ill-formed.
3498 In C++11 this limitation doesn't exist anymore. */
3501 error ("in C++98 %q+D may not be static because it is "
3502 "a member of a union", x
);
3505 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3507 error ("in C++98 %q+D may not have reference type %qT "
3508 "because it is a member of a union", x
, type
);
3513 /* Perform error checking that did not get done in
3515 if (TREE_CODE (type
) == FUNCTION_TYPE
)
3517 error ("field %q+D invalidly declared function type", x
);
3518 type
= build_pointer_type (type
);
3519 TREE_TYPE (x
) = type
;
3521 else if (TREE_CODE (type
) == METHOD_TYPE
)
3523 error ("field %q+D invalidly declared method type", x
);
3524 type
= build_pointer_type (type
);
3525 TREE_TYPE (x
) = type
;
3528 if (type
== error_mark_node
)
3531 if (TREE_CODE (x
) == CONST_DECL
|| VAR_P (x
))
3534 /* Now it can only be a FIELD_DECL. */
3536 if (TREE_PRIVATE (x
) || TREE_PROTECTED (x
))
3537 CLASSTYPE_NON_AGGREGATE (t
) = 1;
3539 /* If at least one non-static data member is non-literal, the whole
3540 class becomes non-literal. Per Core/1453, volatile non-static
3541 data members and base classes are also not allowed.
3542 Note: if the type is incomplete we will complain later on. */
3543 if (COMPLETE_TYPE_P (type
)
3544 && (!literal_type_p (type
) || CP_TYPE_VOLATILE_P (type
)))
3545 CLASSTYPE_LITERAL_P (t
) = false;
3547 /* A standard-layout class is a class that:
3549 has the same access control (Clause 11) for all non-static data members,
3551 this_field_access
= TREE_PROTECTED (x
) ? 1 : TREE_PRIVATE (x
) ? 2 : 0;
3552 if (field_access
== -1)
3553 field_access
= this_field_access
;
3554 else if (this_field_access
!= field_access
)
3555 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3557 /* If this is of reference type, check if it needs an init. */
3558 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3560 CLASSTYPE_NON_LAYOUT_POD_P (t
) = 1;
3561 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3562 if (DECL_INITIAL (x
) == NULL_TREE
)
3563 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t
, 1);
3565 /* ARM $12.6.2: [A member initializer list] (or, for an
3566 aggregate, initialization by a brace-enclosed list) is the
3567 only way to initialize nonstatic const and reference
3569 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
3570 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) = 1;
3573 type
= strip_array_types (type
);
3575 if (TYPE_PACKED (t
))
3577 if (!layout_pod_type_p (type
) && !TYPE_PACKED (type
))
3581 "ignoring packed attribute because of unpacked non-POD field %q+#D",
3585 else if (DECL_C_BIT_FIELD (x
)
3586 || TYPE_ALIGN (TREE_TYPE (x
)) > BITS_PER_UNIT
)
3587 DECL_PACKED (x
) = 1;
3590 if (DECL_C_BIT_FIELD (x
) && integer_zerop (DECL_INITIAL (x
)))
3591 /* We don't treat zero-width bitfields as making a class
3596 /* The class is non-empty. */
3597 CLASSTYPE_EMPTY_P (t
) = 0;
3598 /* The class is not even nearly empty. */
3599 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
3600 /* If one of the data members contains an empty class,
3602 if (CLASS_TYPE_P (type
)
3603 && CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type
))
3604 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 1;
3607 /* This is used by -Weffc++ (see below). Warn only for pointers
3608 to members which might hold dynamic memory. So do not warn
3609 for pointers to functions or pointers to members. */
3610 if (TYPE_PTR_P (type
)
3611 && !TYPE_PTRFN_P (type
))
3612 has_pointers
= true;
3614 if (CLASS_TYPE_P (type
))
3616 if (CLASSTYPE_REF_FIELDS_NEED_INIT (type
))
3617 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t
, 1);
3618 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (type
))
3619 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
, 1);
3622 if (DECL_MUTABLE_P (x
) || TYPE_HAS_MUTABLE_P (type
))
3623 CLASSTYPE_HAS_MUTABLE (t
) = 1;
3625 if (DECL_MUTABLE_P (x
))
3627 if (CP_TYPE_CONST_P (type
))
3629 error ("member %q+D cannot be declared both %<const%> "
3630 "and %<mutable%>", x
);
3633 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3635 error ("member %q+D cannot be declared as a %<mutable%> "
3641 if (! layout_pod_type_p (type
))
3642 /* DR 148 now allows pointers to members (which are POD themselves),
3643 to be allowed in POD structs. */
3644 CLASSTYPE_NON_LAYOUT_POD_P (t
) = 1;
3646 if (!std_layout_type_p (type
))
3647 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3649 if (! zero_init_p (type
))
3650 CLASSTYPE_NON_ZERO_INIT_P (t
) = 1;
3652 /* We set DECL_C_BIT_FIELD in grokbitfield.
3653 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
3654 if (! DECL_C_BIT_FIELD (x
) || ! check_bitfield_decl (x
))
3655 check_field_decl (x
, t
,
3656 cant_have_const_ctor_p
,
3658 &any_default_members
);
3660 /* Now that we've removed bit-field widths from DECL_INITIAL,
3661 anything left in DECL_INITIAL is an NSDMI that makes the class
3663 if (DECL_INITIAL (x
))
3664 CLASSTYPE_NON_AGGREGATE (t
) = true;
3666 /* If any field is const, the structure type is pseudo-const. */
3667 if (CP_TYPE_CONST_P (type
))
3669 C_TYPE_FIELDS_READONLY (t
) = 1;
3670 if (DECL_INITIAL (x
) == NULL_TREE
)
3671 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
, 1);
3673 /* ARM $12.6.2: [A member initializer list] (or, for an
3674 aggregate, initialization by a brace-enclosed list) is the
3675 only way to initialize nonstatic const and reference
3677 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
3678 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) = 1;
3680 /* A field that is pseudo-const makes the structure likewise. */
3681 else if (CLASS_TYPE_P (type
))
3683 C_TYPE_FIELDS_READONLY (t
) |= C_TYPE_FIELDS_READONLY (type
);
3684 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
,
3685 CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
)
3686 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (type
));
3689 /* Core issue 80: A nonstatic data member is required to have a
3690 different name from the class iff the class has a
3691 user-declared constructor. */
3692 if (constructor_name_p (DECL_NAME (x
), t
)
3693 && TYPE_HAS_USER_CONSTRUCTOR (t
))
3694 permerror (input_location
, "field %q+#D with same name as class", x
);
3697 /* Effective C++ rule 11: if a class has dynamic memory held by pointers,
3698 it should also define a copy constructor and an assignment operator to
3699 implement the correct copy semantic (deep vs shallow, etc.). As it is
3700 not feasible to check whether the constructors do allocate dynamic memory
3701 and store it within members, we approximate the warning like this:
3703 -- Warn only if there are members which are pointers
3704 -- Warn only if there is a non-trivial constructor (otherwise,
3705 there cannot be memory allocated).
3706 -- Warn only if there is a non-trivial destructor. We assume that the
3707 user at least implemented the cleanup correctly, and a destructor
3708 is needed to free dynamic memory.
3710 This seems enough for practical purposes. */
3713 && TYPE_HAS_USER_CONSTRUCTOR (t
)
3714 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3715 && !(TYPE_HAS_COPY_CTOR (t
) && TYPE_HAS_COPY_ASSIGN (t
)))
3717 warning (OPT_Weffc__
, "%q#T has pointer data members", t
);
3719 if (! TYPE_HAS_COPY_CTOR (t
))
3721 warning (OPT_Weffc__
,
3722 " but does not override %<%T(const %T&)%>", t
, t
);
3723 if (!TYPE_HAS_COPY_ASSIGN (t
))
3724 warning (OPT_Weffc__
, " or %<operator=(const %T&)%>", t
);
3726 else if (! TYPE_HAS_COPY_ASSIGN (t
))
3727 warning (OPT_Weffc__
,
3728 " but does not override %<operator=(const %T&)%>", t
);
3731 /* Non-static data member initializers make the default constructor
3733 if (any_default_members
)
3735 TYPE_NEEDS_CONSTRUCTING (t
) = true;
3736 TYPE_HAS_COMPLEX_DFLT (t
) = true;
3739 /* If any of the fields couldn't be packed, unset TYPE_PACKED. */
3741 TYPE_PACKED (t
) = 0;
3743 /* Check anonymous struct/anonymous union fields. */
3744 finish_struct_anon (t
);
3746 /* We've built up the list of access declarations in reverse order.
3748 *access_decls
= nreverse (*access_decls
);
3751 /* If TYPE is an empty class type, records its OFFSET in the table of
3755 record_subobject_offset (tree type
, tree offset
, splay_tree offsets
)
3759 if (!is_empty_class (type
))
3762 /* Record the location of this empty object in OFFSETS. */
3763 n
= splay_tree_lookup (offsets
, (splay_tree_key
) offset
);
3765 n
= splay_tree_insert (offsets
,
3766 (splay_tree_key
) offset
,
3767 (splay_tree_value
) NULL_TREE
);
3768 n
->value
= ((splay_tree_value
)
3769 tree_cons (NULL_TREE
,
3776 /* Returns nonzero if TYPE is an empty class type and there is
3777 already an entry in OFFSETS for the same TYPE as the same OFFSET. */
3780 check_subobject_offset (tree type
, tree offset
, splay_tree offsets
)
3785 if (!is_empty_class (type
))
3788 /* Record the location of this empty object in OFFSETS. */
3789 n
= splay_tree_lookup (offsets
, (splay_tree_key
) offset
);
3793 for (t
= (tree
) n
->value
; t
; t
= TREE_CHAIN (t
))
3794 if (same_type_p (TREE_VALUE (t
), type
))
3800 /* Walk through all the subobjects of TYPE (located at OFFSET). Call
3801 F for every subobject, passing it the type, offset, and table of
3802 OFFSETS. If VBASES_P is one, then virtual non-primary bases should
3805 If MAX_OFFSET is non-NULL, then subobjects with an offset greater
3806 than MAX_OFFSET will not be walked.
3808 If F returns a nonzero value, the traversal ceases, and that value
3809 is returned. Otherwise, returns zero. */
3812 walk_subobject_offsets (tree type
,
3813 subobject_offset_fn f
,
3820 tree type_binfo
= NULL_TREE
;
3822 /* If this OFFSET is bigger than the MAX_OFFSET, then we should
3824 if (max_offset
&& tree_int_cst_lt (max_offset
, offset
))
3827 if (type
== error_mark_node
)
3833 type
= BINFO_TYPE (type
);
3836 if (CLASS_TYPE_P (type
))
3842 /* Avoid recursing into objects that are not interesting. */
3843 if (!CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type
))
3846 /* Record the location of TYPE. */
3847 r
= (*f
) (type
, offset
, offsets
);
3851 /* Iterate through the direct base classes of TYPE. */
3853 type_binfo
= TYPE_BINFO (type
);
3854 for (i
= 0; BINFO_BASE_ITERATE (type_binfo
, i
, binfo
); i
++)
3858 if (BINFO_VIRTUAL_P (binfo
))
3862 /* We cannot rely on BINFO_OFFSET being set for the base
3863 class yet, but the offsets for direct non-virtual
3864 bases can be calculated by going back to the TYPE. */
3865 orig_binfo
= BINFO_BASE_BINFO (TYPE_BINFO (type
), i
);
3866 binfo_offset
= size_binop (PLUS_EXPR
,
3868 BINFO_OFFSET (orig_binfo
));
3870 r
= walk_subobject_offsets (binfo
,
3880 if (CLASSTYPE_VBASECLASSES (type
))
3883 vec
<tree
, va_gc
> *vbases
;
3885 /* Iterate through the virtual base classes of TYPE. In G++
3886 3.2, we included virtual bases in the direct base class
3887 loop above, which results in incorrect results; the
3888 correct offsets for virtual bases are only known when
3889 working with the most derived type. */
3891 for (vbases
= CLASSTYPE_VBASECLASSES (type
), ix
= 0;
3892 vec_safe_iterate (vbases
, ix
, &binfo
); ix
++)
3894 r
= walk_subobject_offsets (binfo
,
3896 size_binop (PLUS_EXPR
,
3898 BINFO_OFFSET (binfo
)),
3907 /* We still have to walk the primary base, if it is
3908 virtual. (If it is non-virtual, then it was walked
3910 tree vbase
= get_primary_binfo (type_binfo
);
3912 if (vbase
&& BINFO_VIRTUAL_P (vbase
)
3913 && BINFO_PRIMARY_P (vbase
)
3914 && BINFO_INHERITANCE_CHAIN (vbase
) == type_binfo
)
3916 r
= (walk_subobject_offsets
3918 offsets
, max_offset
, /*vbases_p=*/0));
3925 /* Iterate through the fields of TYPE. */
3926 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3927 if (TREE_CODE (field
) == FIELD_DECL
3928 && TREE_TYPE (field
) != error_mark_node
3929 && !DECL_ARTIFICIAL (field
))
3933 field_offset
= byte_position (field
);
3935 r
= walk_subobject_offsets (TREE_TYPE (field
),
3937 size_binop (PLUS_EXPR
,
3947 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3949 tree element_type
= strip_array_types (type
);
3950 tree domain
= TYPE_DOMAIN (type
);
3953 /* Avoid recursing into objects that are not interesting. */
3954 if (!CLASS_TYPE_P (element_type
)
3955 || !CLASSTYPE_CONTAINS_EMPTY_CLASS_P (element_type
))
3958 /* Step through each of the elements in the array. */
3959 for (index
= size_zero_node
;
3960 !tree_int_cst_lt (TYPE_MAX_VALUE (domain
), index
);
3961 index
= size_binop (PLUS_EXPR
, index
, size_one_node
))
3963 r
= walk_subobject_offsets (TREE_TYPE (type
),
3971 offset
= size_binop (PLUS_EXPR
, offset
,
3972 TYPE_SIZE_UNIT (TREE_TYPE (type
)));
3973 /* If this new OFFSET is bigger than the MAX_OFFSET, then
3974 there's no point in iterating through the remaining
3975 elements of the array. */
3976 if (max_offset
&& tree_int_cst_lt (max_offset
, offset
))
3984 /* Record all of the empty subobjects of TYPE (either a type or a
3985 binfo). If IS_DATA_MEMBER is true, then a non-static data member
3986 is being placed at OFFSET; otherwise, it is a base class that is
3987 being placed at OFFSET. */
3990 record_subobject_offsets (tree type
,
3993 bool is_data_member
)
3996 /* If recording subobjects for a non-static data member or a
3997 non-empty base class , we do not need to record offsets beyond
3998 the size of the biggest empty class. Additional data members
3999 will go at the end of the class. Additional base classes will go
4000 either at offset zero (if empty, in which case they cannot
4001 overlap with offsets past the size of the biggest empty class) or
4002 at the end of the class.
4004 However, if we are placing an empty base class, then we must record
4005 all offsets, as either the empty class is at offset zero (where
4006 other empty classes might later be placed) or at the end of the
4007 class (where other objects might then be placed, so other empty
4008 subobjects might later overlap). */
4010 || !is_empty_class (BINFO_TYPE (type
)))
4011 max_offset
= sizeof_biggest_empty_class
;
4013 max_offset
= NULL_TREE
;
4014 walk_subobject_offsets (type
, record_subobject_offset
, offset
,
4015 offsets
, max_offset
, is_data_member
);
4018 /* Returns nonzero if any of the empty subobjects of TYPE (located at
4019 OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero,
4020 virtual bases of TYPE are examined. */
4023 layout_conflict_p (tree type
,
4028 splay_tree_node max_node
;
4030 /* Get the node in OFFSETS that indicates the maximum offset where
4031 an empty subobject is located. */
4032 max_node
= splay_tree_max (offsets
);
4033 /* If there aren't any empty subobjects, then there's no point in
4034 performing this check. */
4038 return walk_subobject_offsets (type
, check_subobject_offset
, offset
,
4039 offsets
, (tree
) (max_node
->key
),
4043 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
4044 non-static data member of the type indicated by RLI. BINFO is the
4045 binfo corresponding to the base subobject, OFFSETS maps offsets to
4046 types already located at those offsets. This function determines
4047 the position of the DECL. */
4050 layout_nonempty_base_or_field (record_layout_info rli
,
4055 tree offset
= NULL_TREE
;
4061 /* For the purposes of determining layout conflicts, we want to
4062 use the class type of BINFO; TREE_TYPE (DECL) will be the
4063 CLASSTYPE_AS_BASE version, which does not contain entries for
4064 zero-sized bases. */
4065 type
= TREE_TYPE (binfo
);
4070 type
= TREE_TYPE (decl
);
4074 /* Try to place the field. It may take more than one try if we have
4075 a hard time placing the field without putting two objects of the
4076 same type at the same address. */
4079 struct record_layout_info_s old_rli
= *rli
;
4081 /* Place this field. */
4082 place_field (rli
, decl
);
4083 offset
= byte_position (decl
);
4085 /* We have to check to see whether or not there is already
4086 something of the same type at the offset we're about to use.
4087 For example, consider:
4090 struct T : public S { int i; };
4091 struct U : public S, public T {};
4093 Here, we put S at offset zero in U. Then, we can't put T at
4094 offset zero -- its S component would be at the same address
4095 as the S we already allocated. So, we have to skip ahead.
4096 Since all data members, including those whose type is an
4097 empty class, have nonzero size, any overlap can happen only
4098 with a direct or indirect base-class -- it can't happen with
4100 /* In a union, overlap is permitted; all members are placed at
4102 if (TREE_CODE (rli
->t
) == UNION_TYPE
)
4104 if (layout_conflict_p (field_p
? type
: binfo
, offset
,
4107 /* Strip off the size allocated to this field. That puts us
4108 at the first place we could have put the field with
4109 proper alignment. */
4112 /* Bump up by the alignment required for the type. */
4114 = size_binop (PLUS_EXPR
, rli
->bitpos
,
4116 ? CLASSTYPE_ALIGN (type
)
4117 : TYPE_ALIGN (type
)));
4118 normalize_rli (rli
);
4121 /* There was no conflict. We're done laying out this field. */
4125 /* Now that we know where it will be placed, update its
4127 if (binfo
&& CLASS_TYPE_P (BINFO_TYPE (binfo
)))
4128 /* Indirect virtual bases may have a nonzero BINFO_OFFSET at
4129 this point because their BINFO_OFFSET is copied from another
4130 hierarchy. Therefore, we may not need to add the entire
4132 propagate_binfo_offsets (binfo
,
4133 size_diffop_loc (input_location
,
4134 convert (ssizetype
, offset
),
4136 BINFO_OFFSET (binfo
))));
4139 /* Returns true if TYPE is empty and OFFSET is nonzero. */
4142 empty_base_at_nonzero_offset_p (tree type
,
4144 splay_tree
/*offsets*/)
4146 return is_empty_class (type
) && !integer_zerop (offset
);
4149 /* Layout the empty base BINFO. EOC indicates the byte currently just
4150 past the end of the class, and should be correctly aligned for a
4151 class of the type indicated by BINFO; OFFSETS gives the offsets of
4152 the empty bases allocated so far. T is the most derived
4153 type. Return nonzero iff we added it at the end. */
4156 layout_empty_base (record_layout_info rli
, tree binfo
,
4157 tree eoc
, splay_tree offsets
)
4160 tree basetype
= BINFO_TYPE (binfo
);
4163 /* This routine should only be used for empty classes. */
4164 gcc_assert (is_empty_class (basetype
));
4165 alignment
= ssize_int (CLASSTYPE_ALIGN_UNIT (basetype
));
4167 if (!integer_zerop (BINFO_OFFSET (binfo
)))
4168 propagate_binfo_offsets
4169 (binfo
, size_diffop_loc (input_location
,
4170 size_zero_node
, BINFO_OFFSET (binfo
)));
4172 /* This is an empty base class. We first try to put it at offset
4174 if (layout_conflict_p (binfo
,
4175 BINFO_OFFSET (binfo
),
4179 /* That didn't work. Now, we move forward from the next
4180 available spot in the class. */
4182 propagate_binfo_offsets (binfo
, convert (ssizetype
, eoc
));
4185 if (!layout_conflict_p (binfo
,
4186 BINFO_OFFSET (binfo
),
4189 /* We finally found a spot where there's no overlap. */
4192 /* There's overlap here, too. Bump along to the next spot. */
4193 propagate_binfo_offsets (binfo
, alignment
);
4197 if (CLASSTYPE_USER_ALIGN (basetype
))
4199 rli
->record_align
= MAX (rli
->record_align
, CLASSTYPE_ALIGN (basetype
));
4201 rli
->unpacked_align
= MAX (rli
->unpacked_align
, CLASSTYPE_ALIGN (basetype
));
4202 TYPE_USER_ALIGN (rli
->t
) = 1;
4208 /* Layout the base given by BINFO in the class indicated by RLI.
4209 *BASE_ALIGN is a running maximum of the alignments of
4210 any base class. OFFSETS gives the location of empty base
4211 subobjects. T is the most derived type. Return nonzero if the new
4212 object cannot be nearly-empty. A new FIELD_DECL is inserted at
4213 *NEXT_FIELD, unless BINFO is for an empty base class.
4215 Returns the location at which the next field should be inserted. */
4218 build_base_field (record_layout_info rli
, tree binfo
,
4219 splay_tree offsets
, tree
*next_field
)
4222 tree basetype
= BINFO_TYPE (binfo
);
4224 if (!COMPLETE_TYPE_P (basetype
))
4225 /* This error is now reported in xref_tag, thus giving better
4226 location information. */
4229 /* Place the base class. */
4230 if (!is_empty_class (basetype
))
4234 /* The containing class is non-empty because it has a non-empty
4236 CLASSTYPE_EMPTY_P (t
) = 0;
4238 /* Create the FIELD_DECL. */
4239 decl
= build_decl (input_location
,
4240 FIELD_DECL
, NULL_TREE
, CLASSTYPE_AS_BASE (basetype
));
4241 DECL_ARTIFICIAL (decl
) = 1;
4242 DECL_IGNORED_P (decl
) = 1;
4243 DECL_FIELD_CONTEXT (decl
) = t
;
4244 if (CLASSTYPE_AS_BASE (basetype
))
4246 DECL_SIZE (decl
) = CLASSTYPE_SIZE (basetype
);
4247 DECL_SIZE_UNIT (decl
) = CLASSTYPE_SIZE_UNIT (basetype
);
4248 DECL_ALIGN (decl
) = CLASSTYPE_ALIGN (basetype
);
4249 DECL_USER_ALIGN (decl
) = CLASSTYPE_USER_ALIGN (basetype
);
4250 DECL_MODE (decl
) = TYPE_MODE (basetype
);
4251 DECL_FIELD_IS_BASE (decl
) = 1;
4253 /* Try to place the field. It may take more than one try if we
4254 have a hard time placing the field without putting two
4255 objects of the same type at the same address. */
4256 layout_nonempty_base_or_field (rli
, decl
, binfo
, offsets
);
4257 /* Add the new FIELD_DECL to the list of fields for T. */
4258 DECL_CHAIN (decl
) = *next_field
;
4260 next_field
= &DECL_CHAIN (decl
);
4268 /* On some platforms (ARM), even empty classes will not be
4270 eoc
= round_up_loc (input_location
,
4271 rli_size_unit_so_far (rli
),
4272 CLASSTYPE_ALIGN_UNIT (basetype
));
4273 atend
= layout_empty_base (rli
, binfo
, eoc
, offsets
);
4274 /* A nearly-empty class "has no proper base class that is empty,
4275 not morally virtual, and at an offset other than zero." */
4276 if (!BINFO_VIRTUAL_P (binfo
) && CLASSTYPE_NEARLY_EMPTY_P (t
))
4279 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
4280 /* The check above (used in G++ 3.2) is insufficient because
4281 an empty class placed at offset zero might itself have an
4282 empty base at a nonzero offset. */
4283 else if (walk_subobject_offsets (basetype
,
4284 empty_base_at_nonzero_offset_p
,
4287 /*max_offset=*/NULL_TREE
,
4289 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
4292 /* We do not create a FIELD_DECL for empty base classes because
4293 it might overlap some other field. We want to be able to
4294 create CONSTRUCTORs for the class by iterating over the
4295 FIELD_DECLs, and the back end does not handle overlapping
4298 /* An empty virtual base causes a class to be non-empty
4299 -- but in that case we do not need to clear CLASSTYPE_EMPTY_P
4300 here because that was already done when the virtual table
4301 pointer was created. */
4304 /* Record the offsets of BINFO and its base subobjects. */
4305 record_subobject_offsets (binfo
,
4306 BINFO_OFFSET (binfo
),
4308 /*is_data_member=*/false);
4313 /* Layout all of the non-virtual base classes. Record empty
4314 subobjects in OFFSETS. T is the most derived type. Return nonzero
4315 if the type cannot be nearly empty. The fields created
4316 corresponding to the base classes will be inserted at
4320 build_base_fields (record_layout_info rli
,
4321 splay_tree offsets
, tree
*next_field
)
4323 /* Chain to hold all the new FIELD_DECLs which stand in for base class
4326 int n_baseclasses
= BINFO_N_BASE_BINFOS (TYPE_BINFO (t
));
4329 /* The primary base class is always allocated first. */
4330 if (CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
4331 next_field
= build_base_field (rli
, CLASSTYPE_PRIMARY_BINFO (t
),
4332 offsets
, next_field
);
4334 /* Now allocate the rest of the bases. */
4335 for (i
= 0; i
< n_baseclasses
; ++i
)
4339 base_binfo
= BINFO_BASE_BINFO (TYPE_BINFO (t
), i
);
4341 /* The primary base was already allocated above, so we don't
4342 need to allocate it again here. */
4343 if (base_binfo
== CLASSTYPE_PRIMARY_BINFO (t
))
4346 /* Virtual bases are added at the end (a primary virtual base
4347 will have already been added). */
4348 if (BINFO_VIRTUAL_P (base_binfo
))
4351 next_field
= build_base_field (rli
, base_binfo
,
4352 offsets
, next_field
);
4356 /* Go through the TYPE_METHODS of T issuing any appropriate
4357 diagnostics, figuring out which methods override which other
4358 methods, and so forth. */
4361 check_methods (tree t
)
4365 for (x
= TYPE_METHODS (t
); x
; x
= DECL_CHAIN (x
))
4367 check_for_override (x
, t
);
4368 if (DECL_PURE_VIRTUAL_P (x
) && (TREE_CODE (x
) != FUNCTION_DECL
|| ! DECL_VINDEX (x
)))
4369 error ("initializer specified for non-virtual method %q+D", x
);
4370 /* The name of the field is the original field name
4371 Save this in auxiliary field for later overloading. */
4372 if (TREE_CODE (x
) == FUNCTION_DECL
&& DECL_VINDEX (x
))
4374 TYPE_POLYMORPHIC_P (t
) = 1;
4375 if (DECL_PURE_VIRTUAL_P (x
))
4376 vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t
), x
);
4378 /* All user-provided destructors are non-trivial.
4379 Constructors and assignment ops are handled in
4380 grok_special_member_properties. */
4381 if (DECL_DESTRUCTOR_P (x
) && user_provided_p (x
))
4382 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = 1;
4386 /* FN is a constructor or destructor. Clone the declaration to create
4387 a specialized in-charge or not-in-charge version, as indicated by
4391 build_clone (tree fn
, tree name
)
4396 /* Copy the function. */
4397 clone
= copy_decl (fn
);
4398 /* Reset the function name. */
4399 DECL_NAME (clone
) = name
;
4400 /* Remember where this function came from. */
4401 DECL_ABSTRACT_ORIGIN (clone
) = fn
;
4402 /* Make it easy to find the CLONE given the FN. */
4403 DECL_CHAIN (clone
) = DECL_CHAIN (fn
);
4404 DECL_CHAIN (fn
) = clone
;
4406 /* If this is a template, do the rest on the DECL_TEMPLATE_RESULT. */
4407 if (TREE_CODE (clone
) == TEMPLATE_DECL
)
4409 tree result
= build_clone (DECL_TEMPLATE_RESULT (clone
), name
);
4410 DECL_TEMPLATE_RESULT (clone
) = result
;
4411 DECL_TEMPLATE_INFO (result
) = copy_node (DECL_TEMPLATE_INFO (result
));
4412 DECL_TI_TEMPLATE (result
) = clone
;
4413 TREE_TYPE (clone
) = TREE_TYPE (result
);
4417 SET_DECL_ASSEMBLER_NAME (clone
, NULL_TREE
);
4418 DECL_CLONED_FUNCTION (clone
) = fn
;
4419 /* There's no pending inline data for this function. */
4420 DECL_PENDING_INLINE_INFO (clone
) = NULL
;
4421 DECL_PENDING_INLINE_P (clone
) = 0;
4423 /* The base-class destructor is not virtual. */
4424 if (name
== base_dtor_identifier
)
4426 DECL_VIRTUAL_P (clone
) = 0;
4427 if (TREE_CODE (clone
) != TEMPLATE_DECL
)
4428 DECL_VINDEX (clone
) = NULL_TREE
;
4431 /* If there was an in-charge parameter, drop it from the function
4433 if (DECL_HAS_IN_CHARGE_PARM_P (clone
))
4439 exceptions
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone
));
4440 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (clone
));
4441 parmtypes
= TYPE_ARG_TYPES (TREE_TYPE (clone
));
4442 /* Skip the `this' parameter. */
4443 parmtypes
= TREE_CHAIN (parmtypes
);
4444 /* Skip the in-charge parameter. */
4445 parmtypes
= TREE_CHAIN (parmtypes
);
4446 /* And the VTT parm, in a complete [cd]tor. */
4447 if (DECL_HAS_VTT_PARM_P (fn
)
4448 && ! DECL_NEEDS_VTT_PARM_P (clone
))
4449 parmtypes
= TREE_CHAIN (parmtypes
);
4450 /* If this is subobject constructor or destructor, add the vtt
4453 = build_method_type_directly (basetype
,
4454 TREE_TYPE (TREE_TYPE (clone
)),
4457 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
),
4460 = cp_build_type_attribute_variant (TREE_TYPE (clone
),
4461 TYPE_ATTRIBUTES (TREE_TYPE (fn
)));
4464 /* Copy the function parameters. */
4465 DECL_ARGUMENTS (clone
) = copy_list (DECL_ARGUMENTS (clone
));
4466 /* Remove the in-charge parameter. */
4467 if (DECL_HAS_IN_CHARGE_PARM_P (clone
))
4469 DECL_CHAIN (DECL_ARGUMENTS (clone
))
4470 = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone
)));
4471 DECL_HAS_IN_CHARGE_PARM_P (clone
) = 0;
4473 /* And the VTT parm, in a complete [cd]tor. */
4474 if (DECL_HAS_VTT_PARM_P (fn
))
4476 if (DECL_NEEDS_VTT_PARM_P (clone
))
4477 DECL_HAS_VTT_PARM_P (clone
) = 1;
4480 DECL_CHAIN (DECL_ARGUMENTS (clone
))
4481 = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone
)));
4482 DECL_HAS_VTT_PARM_P (clone
) = 0;
4486 for (parms
= DECL_ARGUMENTS (clone
); parms
; parms
= DECL_CHAIN (parms
))
4488 DECL_CONTEXT (parms
) = clone
;
4489 cxx_dup_lang_specific_decl (parms
);
4492 /* Create the RTL for this function. */
4493 SET_DECL_RTL (clone
, NULL
);
4494 rest_of_decl_compilation (clone
, /*top_level=*/1, at_eof
);
4497 note_decl_for_pch (clone
);
4502 /* Implementation of DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P, do
4503 not invoke this function directly.
4505 For a non-thunk function, returns the address of the slot for storing
4506 the function it is a clone of. Otherwise returns NULL_TREE.
4508 If JUST_TESTING, looks through TEMPLATE_DECL and returns NULL if
4509 cloned_function is unset. This is to support the separate
4510 DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P modes; using the latter
4511 on a template makes sense, but not the former. */
4514 decl_cloned_function_p (const_tree decl
, bool just_testing
)
4518 decl
= STRIP_TEMPLATE (decl
);
4520 if (TREE_CODE (decl
) != FUNCTION_DECL
4521 || !DECL_LANG_SPECIFIC (decl
)
4522 || DECL_LANG_SPECIFIC (decl
)->u
.fn
.thunk_p
)
4524 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4526 lang_check_failed (__FILE__
, __LINE__
, __FUNCTION__
);
4532 ptr
= &DECL_LANG_SPECIFIC (decl
)->u
.fn
.u5
.cloned_function
;
4533 if (just_testing
&& *ptr
== NULL_TREE
)
4539 /* Produce declarations for all appropriate clones of FN. If
4540 UPDATE_METHOD_VEC_P is nonzero, the clones are added to the
4541 CLASTYPE_METHOD_VEC as well. */
4544 clone_function_decl (tree fn
, int update_method_vec_p
)
4548 /* Avoid inappropriate cloning. */
4550 && DECL_CLONED_FUNCTION_P (DECL_CHAIN (fn
)))
4553 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
4555 /* For each constructor, we need two variants: an in-charge version
4556 and a not-in-charge version. */
4557 clone
= build_clone (fn
, complete_ctor_identifier
);
4558 if (update_method_vec_p
)
4559 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4560 clone
= build_clone (fn
, base_ctor_identifier
);
4561 if (update_method_vec_p
)
4562 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4566 gcc_assert (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn
));
4568 /* For each destructor, we need three variants: an in-charge
4569 version, a not-in-charge version, and an in-charge deleting
4570 version. We clone the deleting version first because that
4571 means it will go second on the TYPE_METHODS list -- and that
4572 corresponds to the correct layout order in the virtual
4575 For a non-virtual destructor, we do not build a deleting
4577 if (DECL_VIRTUAL_P (fn
))
4579 clone
= build_clone (fn
, deleting_dtor_identifier
);
4580 if (update_method_vec_p
)
4581 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4583 clone
= build_clone (fn
, complete_dtor_identifier
);
4584 if (update_method_vec_p
)
4585 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4586 clone
= build_clone (fn
, base_dtor_identifier
);
4587 if (update_method_vec_p
)
4588 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4591 /* Note that this is an abstract function that is never emitted. */
4592 DECL_ABSTRACT_P (fn
) = true;
4595 /* DECL is an in charge constructor, which is being defined. This will
4596 have had an in class declaration, from whence clones were
4597 declared. An out-of-class definition can specify additional default
4598 arguments. As it is the clones that are involved in overload
4599 resolution, we must propagate the information from the DECL to its
4603 adjust_clone_args (tree decl
)
4607 for (clone
= DECL_CHAIN (decl
); clone
&& DECL_CLONED_FUNCTION_P (clone
);
4608 clone
= DECL_CHAIN (clone
))
4610 tree orig_clone_parms
= TYPE_ARG_TYPES (TREE_TYPE (clone
));
4611 tree orig_decl_parms
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
4612 tree decl_parms
, clone_parms
;
4614 clone_parms
= orig_clone_parms
;
4616 /* Skip the 'this' parameter. */
4617 orig_clone_parms
= TREE_CHAIN (orig_clone_parms
);
4618 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4620 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
4621 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4622 if (DECL_HAS_VTT_PARM_P (decl
))
4623 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4625 clone_parms
= orig_clone_parms
;
4626 if (DECL_HAS_VTT_PARM_P (clone
))
4627 clone_parms
= TREE_CHAIN (clone_parms
);
4629 for (decl_parms
= orig_decl_parms
; decl_parms
;
4630 decl_parms
= TREE_CHAIN (decl_parms
),
4631 clone_parms
= TREE_CHAIN (clone_parms
))
4633 gcc_assert (same_type_p (TREE_TYPE (decl_parms
),
4634 TREE_TYPE (clone_parms
)));
4636 if (TREE_PURPOSE (decl_parms
) && !TREE_PURPOSE (clone_parms
))
4638 /* A default parameter has been added. Adjust the
4639 clone's parameters. */
4640 tree exceptions
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone
));
4641 tree attrs
= TYPE_ATTRIBUTES (TREE_TYPE (clone
));
4642 tree basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (clone
));
4645 clone_parms
= orig_decl_parms
;
4647 if (DECL_HAS_VTT_PARM_P (clone
))
4649 clone_parms
= tree_cons (TREE_PURPOSE (orig_clone_parms
),
4650 TREE_VALUE (orig_clone_parms
),
4652 TREE_TYPE (clone_parms
) = TREE_TYPE (orig_clone_parms
);
4654 type
= build_method_type_directly (basetype
,
4655 TREE_TYPE (TREE_TYPE (clone
)),
4658 type
= build_exception_variant (type
, exceptions
);
4660 type
= cp_build_type_attribute_variant (type
, attrs
);
4661 TREE_TYPE (clone
) = type
;
4663 clone_parms
= NULL_TREE
;
4667 gcc_assert (!clone_parms
);
4671 /* For each of the constructors and destructors in T, create an
4672 in-charge and not-in-charge variant. */
4675 clone_constructors_and_destructors (tree t
)
4679 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4681 if (!CLASSTYPE_METHOD_VEC (t
))
4684 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4685 clone_function_decl (OVL_CURRENT (fns
), /*update_method_vec_p=*/1);
4686 for (fns
= CLASSTYPE_DESTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4687 clone_function_decl (OVL_CURRENT (fns
), /*update_method_vec_p=*/1);
4690 /* Deduce noexcept for a destructor DTOR. */
4693 deduce_noexcept_on_destructor (tree dtor
)
4695 if (!TYPE_RAISES_EXCEPTIONS (TREE_TYPE (dtor
)))
4697 tree eh_spec
= unevaluated_noexcept_spec ();
4698 TREE_TYPE (dtor
) = build_exception_variant (TREE_TYPE (dtor
), eh_spec
);
4702 /* For each destructor in T, deduce noexcept:
4704 12.4/3: A declaration of a destructor that does not have an
4705 exception-specification is implicitly considered to have the
4706 same exception-specification as an implicit declaration (15.4). */
4709 deduce_noexcept_on_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 (tree fns
= CLASSTYPE_DESTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4717 deduce_noexcept_on_destructor (OVL_CURRENT (fns
));
4720 /* Subroutine of set_one_vmethod_tm_attributes. Search base classes
4721 of TYPE for virtual functions which FNDECL overrides. Return a
4722 mask of the tm attributes found therein. */
4725 look_for_tm_attr_overrides (tree type
, tree fndecl
)
4727 tree binfo
= TYPE_BINFO (type
);
4731 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ++ix
)
4733 tree o
, basetype
= BINFO_TYPE (base_binfo
);
4735 if (!TYPE_POLYMORPHIC_P (basetype
))
4738 o
= look_for_overrides_here (basetype
, fndecl
);
4740 found
|= tm_attr_to_mask (find_tm_attribute
4741 (TYPE_ATTRIBUTES (TREE_TYPE (o
))));
4743 found
|= look_for_tm_attr_overrides (basetype
, fndecl
);
4749 /* Subroutine of set_method_tm_attributes. Handle the checks and
4750 inheritance for one virtual method FNDECL. */
4753 set_one_vmethod_tm_attributes (tree type
, tree fndecl
)
4758 found
= look_for_tm_attr_overrides (type
, fndecl
);
4760 /* If FNDECL doesn't actually override anything (i.e. T is the
4761 class that first declares FNDECL virtual), then we're done. */
4765 tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl
)));
4766 have
= tm_attr_to_mask (tm_attr
);
4768 /* Intel STM Language Extension 3.0, Section 4.2 table 4:
4769 tm_pure must match exactly, otherwise no weakening of
4770 tm_safe > tm_callable > nothing. */
4771 /* ??? The tm_pure attribute didn't make the transition to the
4772 multivendor language spec. */
4773 if (have
== TM_ATTR_PURE
)
4775 if (found
!= TM_ATTR_PURE
)
4781 /* If the overridden function is tm_pure, then FNDECL must be. */
4782 else if (found
== TM_ATTR_PURE
&& tm_attr
)
4784 /* Look for base class combinations that cannot be satisfied. */
4785 else if (found
!= TM_ATTR_PURE
&& (found
& TM_ATTR_PURE
))
4787 found
&= ~TM_ATTR_PURE
;
4789 error_at (DECL_SOURCE_LOCATION (fndecl
),
4790 "method overrides both %<transaction_pure%> and %qE methods",
4791 tm_mask_to_attr (found
));
4793 /* If FNDECL did not declare an attribute, then inherit the most
4795 else if (tm_attr
== NULL
)
4797 apply_tm_attr (fndecl
, tm_mask_to_attr (found
& -found
));
4799 /* Otherwise validate that we're not weaker than a function
4800 that is being overridden. */
4804 if (found
<= TM_ATTR_CALLABLE
&& have
> found
)
4810 error_at (DECL_SOURCE_LOCATION (fndecl
),
4811 "method declared %qE overriding %qE method",
4812 tm_attr
, tm_mask_to_attr (found
));
4815 /* For each of the methods in T, propagate a class-level tm attribute. */
4818 set_method_tm_attributes (tree t
)
4820 tree class_tm_attr
, fndecl
;
4822 /* Don't bother collecting tm attributes if transactional memory
4823 support is not enabled. */
4827 /* Process virtual methods first, as they inherit directly from the
4828 base virtual function and also require validation of new attributes. */
4829 if (TYPE_CONTAINS_VPTR_P (t
))
4832 for (vchain
= BINFO_VIRTUALS (TYPE_BINFO (t
)); vchain
;
4833 vchain
= TREE_CHAIN (vchain
))
4835 fndecl
= BV_FN (vchain
);
4836 if (DECL_THUNK_P (fndecl
))
4837 fndecl
= THUNK_TARGET (fndecl
);
4838 set_one_vmethod_tm_attributes (t
, fndecl
);
4842 /* If the class doesn't have an attribute, nothing more to do. */
4843 class_tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (t
));
4844 if (class_tm_attr
== NULL
)
4847 /* Any method that does not yet have a tm attribute inherits
4848 the one from the class. */
4849 for (fndecl
= TYPE_METHODS (t
); fndecl
; fndecl
= TREE_CHAIN (fndecl
))
4851 if (!find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl
))))
4852 apply_tm_attr (fndecl
, class_tm_attr
);
4856 /* Returns true iff class T has a user-defined constructor other than
4857 the default constructor. */
4860 type_has_user_nondefault_constructor (tree t
)
4864 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4867 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4869 tree fn
= OVL_CURRENT (fns
);
4870 if (!DECL_ARTIFICIAL (fn
)
4871 && (TREE_CODE (fn
) == TEMPLATE_DECL
4872 || (skip_artificial_parms_for (fn
, DECL_ARGUMENTS (fn
))
4880 /* Returns the defaulted constructor if T has one. Otherwise, returns
4884 in_class_defaulted_default_constructor (tree t
)
4888 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4891 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4893 tree fn
= OVL_CURRENT (fns
);
4895 if (DECL_DEFAULTED_IN_CLASS_P (fn
))
4897 args
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
4898 while (args
&& TREE_PURPOSE (args
))
4899 args
= TREE_CHAIN (args
);
4900 if (!args
|| args
== void_list_node
)
4908 /* Returns true iff FN is a user-provided function, i.e. user-declared
4909 and not defaulted at its first declaration; or explicit, private,
4910 protected, or non-const. */
4913 user_provided_p (tree fn
)
4915 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4918 return (!DECL_ARTIFICIAL (fn
)
4919 && !(DECL_INITIALIZED_IN_CLASS_P (fn
)
4920 && (DECL_DEFAULTED_FN (fn
) || DECL_DELETED_FN (fn
))));
4923 /* Returns true iff class T has a user-provided constructor. */
4926 type_has_user_provided_constructor (tree t
)
4930 if (!CLASS_TYPE_P (t
))
4933 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4936 /* This can happen in error cases; avoid crashing. */
4937 if (!CLASSTYPE_METHOD_VEC (t
))
4940 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4941 if (user_provided_p (OVL_CURRENT (fns
)))
4947 /* Returns true iff class T has a non-user-provided (i.e. implicitly
4948 declared or explicitly defaulted in the class body) default
4952 type_has_non_user_provided_default_constructor (tree t
)
4956 if (!TYPE_HAS_DEFAULT_CONSTRUCTOR (t
))
4958 if (CLASSTYPE_LAZY_DEFAULT_CTOR (t
))
4961 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4963 tree fn
= OVL_CURRENT (fns
);
4964 if (TREE_CODE (fn
) == FUNCTION_DECL
4965 && !user_provided_p (fn
)
4966 && sufficient_parms_p (FUNCTION_FIRST_USER_PARMTYPE (fn
)))
4973 /* TYPE is being used as a virtual base, and has a non-trivial move
4974 assignment. Return true if this is due to there being a user-provided
4975 move assignment in TYPE or one of its subobjects; if there isn't, then
4976 multiple move assignment can't cause any harm. */
4979 vbase_has_user_provided_move_assign (tree type
)
4981 /* Does the type itself have a user-provided move assignment operator? */
4983 = lookup_fnfields_slot_nolazy (type
, ansi_assopname (NOP_EXPR
));
4984 fns
; fns
= OVL_NEXT (fns
))
4986 tree fn
= OVL_CURRENT (fns
);
4987 if (move_fn_p (fn
) && user_provided_p (fn
))
4991 /* Do any of its bases? */
4992 tree binfo
= TYPE_BINFO (type
);
4994 for (int i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
4995 if (vbase_has_user_provided_move_assign (BINFO_TYPE (base_binfo
)))
4998 /* Or non-static data members? */
4999 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
5001 if (TREE_CODE (field
) == FIELD_DECL
5002 && CLASS_TYPE_P (TREE_TYPE (field
))
5003 && vbase_has_user_provided_move_assign (TREE_TYPE (field
)))
5011 /* If default-initialization leaves part of TYPE uninitialized, returns
5012 a DECL for the field or TYPE itself (DR 253). */
5015 default_init_uninitialized_part (tree type
)
5020 type
= strip_array_types (type
);
5021 if (!CLASS_TYPE_P (type
))
5023 if (!type_has_non_user_provided_default_constructor (type
))
5025 for (binfo
= TYPE_BINFO (type
), i
= 0;
5026 BINFO_BASE_ITERATE (binfo
, i
, t
); ++i
)
5028 r
= default_init_uninitialized_part (BINFO_TYPE (t
));
5032 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
5033 if (TREE_CODE (t
) == FIELD_DECL
5034 && !DECL_ARTIFICIAL (t
)
5035 && !DECL_INITIAL (t
))
5037 r
= default_init_uninitialized_part (TREE_TYPE (t
));
5039 return DECL_P (r
) ? r
: t
;
5045 /* Returns true iff for class T, a trivial synthesized default constructor
5046 would be constexpr. */
5049 trivial_default_constructor_is_constexpr (tree t
)
5051 /* A defaulted trivial default constructor is constexpr
5052 if there is nothing to initialize. */
5053 gcc_assert (!TYPE_HAS_COMPLEX_DFLT (t
));
5054 return is_really_empty_class (t
);
5057 /* Returns true iff class T has a constexpr default constructor. */
5060 type_has_constexpr_default_constructor (tree t
)
5064 if (!CLASS_TYPE_P (t
))
5066 /* The caller should have stripped an enclosing array. */
5067 gcc_assert (TREE_CODE (t
) != ARRAY_TYPE
);
5070 if (CLASSTYPE_LAZY_DEFAULT_CTOR (t
))
5072 if (!TYPE_HAS_COMPLEX_DFLT (t
))
5073 return trivial_default_constructor_is_constexpr (t
);
5074 /* Non-trivial, we need to check subobject constructors. */
5075 lazily_declare_fn (sfk_constructor
, t
);
5077 fns
= locate_ctor (t
);
5078 return (fns
&& DECL_DECLARED_CONSTEXPR_P (fns
));
5081 /* Returns true iff class TYPE has a virtual destructor. */
5084 type_has_virtual_destructor (tree type
)
5088 if (!CLASS_TYPE_P (type
))
5091 gcc_assert (COMPLETE_TYPE_P (type
));
5092 dtor
= CLASSTYPE_DESTRUCTORS (type
);
5093 return (dtor
&& DECL_VIRTUAL_P (dtor
));
5096 /* Returns true iff class T has a move constructor. */
5099 type_has_move_constructor (tree t
)
5103 if (CLASSTYPE_LAZY_MOVE_CTOR (t
))
5105 gcc_assert (COMPLETE_TYPE_P (t
));
5106 lazily_declare_fn (sfk_move_constructor
, t
);
5109 if (!CLASSTYPE_METHOD_VEC (t
))
5112 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5113 if (move_fn_p (OVL_CURRENT (fns
)))
5119 /* Returns true iff class T has a move assignment operator. */
5122 type_has_move_assign (tree t
)
5126 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
5128 gcc_assert (COMPLETE_TYPE_P (t
));
5129 lazily_declare_fn (sfk_move_assignment
, t
);
5132 for (fns
= lookup_fnfields_slot_nolazy (t
, ansi_assopname (NOP_EXPR
));
5133 fns
; fns
= OVL_NEXT (fns
))
5134 if (move_fn_p (OVL_CURRENT (fns
)))
5140 /* Returns true iff class T has a move constructor that was explicitly
5141 declared in the class body. Note that this is different from
5142 "user-provided", which doesn't include functions that are defaulted in
5146 type_has_user_declared_move_constructor (tree t
)
5150 if (CLASSTYPE_LAZY_MOVE_CTOR (t
))
5153 if (!CLASSTYPE_METHOD_VEC (t
))
5156 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5158 tree fn
= OVL_CURRENT (fns
);
5159 if (move_fn_p (fn
) && !DECL_ARTIFICIAL (fn
))
5166 /* Returns true iff class T has a move assignment operator that was
5167 explicitly declared in the class body. */
5170 type_has_user_declared_move_assign (tree t
)
5174 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
5177 for (fns
= lookup_fnfields_slot_nolazy (t
, ansi_assopname (NOP_EXPR
));
5178 fns
; fns
= OVL_NEXT (fns
))
5180 tree fn
= OVL_CURRENT (fns
);
5181 if (move_fn_p (fn
) && !DECL_ARTIFICIAL (fn
))
5188 /* Nonzero if we need to build up a constructor call when initializing an
5189 object of this class, either because it has a user-declared constructor
5190 or because it doesn't have a default constructor (so we need to give an
5191 error if no initializer is provided). Use TYPE_NEEDS_CONSTRUCTING when
5192 what you care about is whether or not an object can be produced by a
5193 constructor (e.g. so we don't set TREE_READONLY on const variables of
5194 such type); use this function when what you care about is whether or not
5195 to try to call a constructor to create an object. The latter case is
5196 the former plus some cases of constructors that cannot be called. */
5199 type_build_ctor_call (tree t
)
5202 if (TYPE_NEEDS_CONSTRUCTING (t
))
5204 inner
= strip_array_types (t
);
5205 if (!CLASS_TYPE_P (inner
) || ANON_AGGR_TYPE_P (inner
))
5207 if (!TYPE_HAS_DEFAULT_CONSTRUCTOR (inner
))
5209 if (cxx_dialect
< cxx11
)
5211 /* A user-declared constructor might be private, and a constructor might
5212 be trivial but deleted. */
5213 for (tree fns
= lookup_fnfields_slot (inner
, complete_ctor_identifier
);
5214 fns
; fns
= OVL_NEXT (fns
))
5216 tree fn
= OVL_CURRENT (fns
);
5217 if (!DECL_ARTIFICIAL (fn
)
5218 || DECL_DELETED_FN (fn
))
5224 /* Like type_build_ctor_call, but for destructors. */
5227 type_build_dtor_call (tree t
)
5230 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5232 inner
= strip_array_types (t
);
5233 if (!CLASS_TYPE_P (inner
) || ANON_AGGR_TYPE_P (inner
)
5234 || !COMPLETE_TYPE_P (inner
))
5236 if (cxx_dialect
< cxx11
)
5238 /* A user-declared destructor might be private, and a destructor might
5239 be trivial but deleted. */
5240 for (tree fns
= lookup_fnfields_slot (inner
, complete_dtor_identifier
);
5241 fns
; fns
= OVL_NEXT (fns
))
5243 tree fn
= OVL_CURRENT (fns
);
5244 if (!DECL_ARTIFICIAL (fn
)
5245 || DECL_DELETED_FN (fn
))
5251 /* Remove all zero-width bit-fields from T. */
5254 remove_zero_width_bit_fields (tree t
)
5258 fieldsp
= &TYPE_FIELDS (t
);
5261 if (TREE_CODE (*fieldsp
) == FIELD_DECL
5262 && DECL_C_BIT_FIELD (*fieldsp
)
5263 /* We should not be confused by the fact that grokbitfield
5264 temporarily sets the width of the bit field into
5265 DECL_INITIAL (*fieldsp).
5266 check_bitfield_decl eventually sets DECL_SIZE (*fieldsp)
5268 && integer_zerop (DECL_SIZE (*fieldsp
)))
5269 *fieldsp
= DECL_CHAIN (*fieldsp
);
5271 fieldsp
= &DECL_CHAIN (*fieldsp
);
5275 /* Returns TRUE iff we need a cookie when dynamically allocating an
5276 array whose elements have the indicated class TYPE. */
5279 type_requires_array_cookie (tree type
)
5282 bool has_two_argument_delete_p
= false;
5284 gcc_assert (CLASS_TYPE_P (type
));
5286 /* If there's a non-trivial destructor, we need a cookie. In order
5287 to iterate through the array calling the destructor for each
5288 element, we'll have to know how many elements there are. */
5289 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
5292 /* If the usual deallocation function is a two-argument whose second
5293 argument is of type `size_t', then we have to pass the size of
5294 the array to the deallocation function, so we will need to store
5296 fns
= lookup_fnfields (TYPE_BINFO (type
),
5297 ansi_opname (VEC_DELETE_EXPR
),
5299 /* If there are no `operator []' members, or the lookup is
5300 ambiguous, then we don't need a cookie. */
5301 if (!fns
|| fns
== error_mark_node
)
5303 /* Loop through all of the functions. */
5304 for (fns
= BASELINK_FUNCTIONS (fns
); fns
; fns
= OVL_NEXT (fns
))
5309 /* Select the current function. */
5310 fn
= OVL_CURRENT (fns
);
5311 /* See if this function is a one-argument delete function. If
5312 it is, then it will be the usual deallocation function. */
5313 second_parm
= TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (fn
)));
5314 if (second_parm
== void_list_node
)
5316 /* Do not consider this function if its second argument is an
5320 /* Otherwise, if we have a two-argument function and the second
5321 argument is `size_t', it will be the usual deallocation
5322 function -- unless there is one-argument function, too. */
5323 if (TREE_CHAIN (second_parm
) == void_list_node
5324 && same_type_p (TREE_VALUE (second_parm
), size_type_node
))
5325 has_two_argument_delete_p
= true;
5328 return has_two_argument_delete_p
;
5331 /* Finish computing the `literal type' property of class type T.
5333 At this point, we have already processed base classes and
5334 non-static data members. We need to check whether the copy
5335 constructor is trivial, the destructor is trivial, and there
5336 is a trivial default constructor or at least one constexpr
5337 constructor other than the copy constructor. */
5340 finalize_literal_type_property (tree t
)
5344 if (cxx_dialect
< cxx11
5345 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5346 CLASSTYPE_LITERAL_P (t
) = false;
5347 else if (CLASSTYPE_LITERAL_P (t
) && !TYPE_HAS_TRIVIAL_DFLT (t
)
5348 && CLASSTYPE_NON_AGGREGATE (t
)
5349 && !TYPE_HAS_CONSTEXPR_CTOR (t
))
5350 CLASSTYPE_LITERAL_P (t
) = false;
5352 if (!CLASSTYPE_LITERAL_P (t
))
5353 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5354 if (DECL_DECLARED_CONSTEXPR_P (fn
)
5355 && TREE_CODE (fn
) != TEMPLATE_DECL
5356 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
5357 && !DECL_CONSTRUCTOR_P (fn
))
5359 DECL_DECLARED_CONSTEXPR_P (fn
) = false;
5360 if (!DECL_GENERATED_P (fn
))
5362 error ("enclosing class of constexpr non-static member "
5363 "function %q+#D is not a literal type", fn
);
5364 explain_non_literal_class (t
);
5369 /* T is a non-literal type used in a context which requires a constant
5370 expression. Explain why it isn't literal. */
5373 explain_non_literal_class (tree t
)
5375 static hash_set
<tree
> *diagnosed
;
5377 if (!CLASS_TYPE_P (t
))
5379 t
= TYPE_MAIN_VARIANT (t
);
5381 if (diagnosed
== NULL
)
5382 diagnosed
= new hash_set
<tree
>;
5383 if (diagnosed
->add (t
))
5384 /* Already explained. */
5387 inform (0, "%q+T is not literal because:", t
);
5388 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5389 inform (0, " %q+T has a non-trivial destructor", t
);
5390 else if (CLASSTYPE_NON_AGGREGATE (t
)
5391 && !TYPE_HAS_TRIVIAL_DFLT (t
)
5392 && !TYPE_HAS_CONSTEXPR_CTOR (t
))
5394 inform (0, " %q+T is not an aggregate, does not have a trivial "
5395 "default constructor, and has no constexpr constructor that "
5396 "is not a copy or move constructor", t
);
5397 if (type_has_non_user_provided_default_constructor (t
))
5399 /* Note that we can't simply call locate_ctor because when the
5400 constructor is deleted it just returns NULL_TREE. */
5402 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5404 tree fn
= OVL_CURRENT (fns
);
5405 tree parms
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5407 parms
= skip_artificial_parms_for (fn
, parms
);
5409 if (sufficient_parms_p (parms
))
5411 if (DECL_DELETED_FN (fn
))
5412 maybe_explain_implicit_delete (fn
);
5414 explain_invalid_constexpr_fn (fn
);
5422 tree binfo
, base_binfo
, field
; int i
;
5423 for (binfo
= TYPE_BINFO (t
), i
= 0;
5424 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
5426 tree basetype
= TREE_TYPE (base_binfo
);
5427 if (!CLASSTYPE_LITERAL_P (basetype
))
5429 inform (0, " base class %qT of %q+T is non-literal",
5431 explain_non_literal_class (basetype
);
5435 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
5438 if (TREE_CODE (field
) != FIELD_DECL
)
5440 ftype
= TREE_TYPE (field
);
5441 if (!literal_type_p (ftype
))
5443 inform (0, " non-static data member %q+D has "
5444 "non-literal type", field
);
5445 if (CLASS_TYPE_P (ftype
))
5446 explain_non_literal_class (ftype
);
5448 if (CP_TYPE_VOLATILE_P (ftype
))
5449 inform (0, " non-static data member %q+D has "
5450 "volatile type", field
);
5455 /* Check the validity of the bases and members declared in T. Add any
5456 implicitly-generated functions (like copy-constructors and
5457 assignment operators). Compute various flag bits (like
5458 CLASSTYPE_NON_LAYOUT_POD_T) for T. This routine works purely at the C++
5459 level: i.e., independently of the ABI in use. */
5462 check_bases_and_members (tree t
)
5464 /* Nonzero if the implicitly generated copy constructor should take
5465 a non-const reference argument. */
5466 int cant_have_const_ctor
;
5467 /* Nonzero if the implicitly generated assignment operator
5468 should take a non-const reference argument. */
5469 int no_const_asn_ref
;
5471 bool saved_complex_asn_ref
;
5472 bool saved_nontrivial_dtor
;
5475 /* By default, we use const reference arguments and generate default
5477 cant_have_const_ctor
= 0;
5478 no_const_asn_ref
= 0;
5480 /* Check all the base-classes. */
5481 check_bases (t
, &cant_have_const_ctor
,
5484 /* Deduce noexcept on destructors. This needs to happen after we've set
5485 triviality flags appropriately for our bases. */
5486 if (cxx_dialect
>= cxx11
)
5487 deduce_noexcept_on_destructors (t
);
5489 /* Check all the method declarations. */
5492 /* Save the initial values of these flags which only indicate whether
5493 or not the class has user-provided functions. As we analyze the
5494 bases and members we can set these flags for other reasons. */
5495 saved_complex_asn_ref
= TYPE_HAS_COMPLEX_COPY_ASSIGN (t
);
5496 saved_nontrivial_dtor
= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
);
5498 /* Check all the data member declarations. We cannot call
5499 check_field_decls until we have called check_bases check_methods,
5500 as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR
5501 being set appropriately. */
5502 check_field_decls (t
, &access_decls
,
5503 &cant_have_const_ctor
,
5506 /* A nearly-empty class has to be vptr-containing; a nearly empty
5507 class contains just a vptr. */
5508 if (!TYPE_CONTAINS_VPTR_P (t
))
5509 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
5511 /* Do some bookkeeping that will guide the generation of implicitly
5512 declared member functions. */
5513 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5514 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5515 /* We need to call a constructor for this class if it has a
5516 user-provided constructor, or if the default constructor is going
5517 to initialize the vptr. (This is not an if-and-only-if;
5518 TYPE_NEEDS_CONSTRUCTING is set elsewhere if bases or members
5519 themselves need constructing.) */
5520 TYPE_NEEDS_CONSTRUCTING (t
)
5521 |= (type_has_user_provided_constructor (t
) || TYPE_CONTAINS_VPTR_P (t
));
5524 An aggregate is an array or a class with no user-provided
5525 constructors ... and no virtual functions.
5527 Again, other conditions for being an aggregate are checked
5529 CLASSTYPE_NON_AGGREGATE (t
)
5530 |= (type_has_user_provided_constructor (t
) || TYPE_POLYMORPHIC_P (t
));
5531 /* This is the C++98/03 definition of POD; it changed in C++0x, but we
5532 retain the old definition internally for ABI reasons. */
5533 CLASSTYPE_NON_LAYOUT_POD_P (t
)
5534 |= (CLASSTYPE_NON_AGGREGATE (t
)
5535 || saved_nontrivial_dtor
|| saved_complex_asn_ref
);
5536 CLASSTYPE_NON_STD_LAYOUT (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5537 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5538 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5539 TYPE_HAS_COMPLEX_DFLT (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5541 /* If the only explicitly declared default constructor is user-provided,
5542 set TYPE_HAS_COMPLEX_DFLT. */
5543 if (!TYPE_HAS_COMPLEX_DFLT (t
)
5544 && TYPE_HAS_DEFAULT_CONSTRUCTOR (t
)
5545 && !type_has_non_user_provided_default_constructor (t
))
5546 TYPE_HAS_COMPLEX_DFLT (t
) = true;
5548 /* Warn if a public base of a polymorphic type has an accessible
5549 non-virtual destructor. It is only now that we know the class is
5550 polymorphic. Although a polymorphic base will have a already
5551 been diagnosed during its definition, we warn on use too. */
5552 if (TYPE_POLYMORPHIC_P (t
) && warn_nonvdtor
)
5554 tree binfo
= TYPE_BINFO (t
);
5555 vec
<tree
, va_gc
> *accesses
= BINFO_BASE_ACCESSES (binfo
);
5559 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
5561 tree basetype
= TREE_TYPE (base_binfo
);
5563 if ((*accesses
)[i
] == access_public_node
5564 && (TYPE_POLYMORPHIC_P (basetype
) || warn_ecpp
)
5565 && accessible_nvdtor_p (basetype
))
5566 warning (OPT_Wnon_virtual_dtor
,
5567 "base class %q#T has accessible non-virtual destructor",
5572 /* If the class has no user-declared constructor, but does have
5573 non-static const or reference data members that can never be
5574 initialized, issue a warning. */
5575 if (warn_uninitialized
5576 /* Classes with user-declared constructors are presumed to
5577 initialize these members. */
5578 && !TYPE_HAS_USER_CONSTRUCTOR (t
)
5579 /* Aggregates can be initialized with brace-enclosed
5581 && CLASSTYPE_NON_AGGREGATE (t
))
5585 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
5589 if (TREE_CODE (field
) != FIELD_DECL
5590 || DECL_INITIAL (field
) != NULL_TREE
)
5593 type
= TREE_TYPE (field
);
5594 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5595 warning (OPT_Wuninitialized
, "non-static reference %q+#D "
5596 "in class without a constructor", field
);
5597 else if (CP_TYPE_CONST_P (type
)
5598 && (!CLASS_TYPE_P (type
)
5599 || !TYPE_HAS_DEFAULT_CONSTRUCTOR (type
)))
5600 warning (OPT_Wuninitialized
, "non-static const member %q+#D "
5601 "in class without a constructor", field
);
5605 /* Synthesize any needed methods. */
5606 add_implicitly_declared_members (t
, &access_decls
,
5607 cant_have_const_ctor
,
5610 /* Check defaulted declarations here so we have cant_have_const_ctor
5611 and don't need to worry about clones. */
5612 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5613 if (!DECL_ARTIFICIAL (fn
) && DECL_DEFAULTED_IN_CLASS_P (fn
))
5615 int copy
= copy_fn_p (fn
);
5619 = (DECL_CONSTRUCTOR_P (fn
) ? !cant_have_const_ctor
5620 : !no_const_asn_ref
);
5621 bool fn_const_p
= (copy
== 2);
5623 if (fn_const_p
&& !imp_const_p
)
5624 /* If the function is defaulted outside the class, we just
5625 give the synthesis error. */
5626 error ("%q+D declared to take const reference, but implicit "
5627 "declaration would take non-const", fn
);
5629 defaulted_late_check (fn
);
5632 if (LAMBDA_TYPE_P (t
))
5634 /* "This class type is not an aggregate." */
5635 CLASSTYPE_NON_AGGREGATE (t
) = 1;
5638 /* Compute the 'literal type' property before we
5639 do anything with non-static member functions. */
5640 finalize_literal_type_property (t
);
5642 /* Create the in-charge and not-in-charge variants of constructors
5644 clone_constructors_and_destructors (t
);
5646 /* Process the using-declarations. */
5647 for (; access_decls
; access_decls
= TREE_CHAIN (access_decls
))
5648 handle_using_decl (TREE_VALUE (access_decls
), t
);
5650 /* Build and sort the CLASSTYPE_METHOD_VEC. */
5651 finish_struct_methods (t
);
5653 /* Figure out whether or not we will need a cookie when dynamically
5654 allocating an array of this type. */
5655 TYPE_LANG_SPECIFIC (t
)->u
.c
.vec_new_uses_cookie
5656 = type_requires_array_cookie (t
);
5659 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
5660 accordingly. If a new vfield was created (because T doesn't have a
5661 primary base class), then the newly created field is returned. It
5662 is not added to the TYPE_FIELDS list; it is the caller's
5663 responsibility to do that. Accumulate declared virtual functions
5667 create_vtable_ptr (tree t
, tree
* virtuals_p
)
5671 /* Collect the virtual functions declared in T. */
5672 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5673 if (TREE_CODE (fn
) == FUNCTION_DECL
5674 && DECL_VINDEX (fn
) && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn
)
5675 && TREE_CODE (DECL_VINDEX (fn
)) != INTEGER_CST
)
5677 tree new_virtual
= make_node (TREE_LIST
);
5679 BV_FN (new_virtual
) = fn
;
5680 BV_DELTA (new_virtual
) = integer_zero_node
;
5681 BV_VCALL_INDEX (new_virtual
) = NULL_TREE
;
5683 TREE_CHAIN (new_virtual
) = *virtuals_p
;
5684 *virtuals_p
= new_virtual
;
5687 /* If we couldn't find an appropriate base class, create a new field
5688 here. Even if there weren't any new virtual functions, we might need a
5689 new virtual function table if we're supposed to include vptrs in
5690 all classes that need them. */
5691 if (!TYPE_VFIELD (t
) && (*virtuals_p
|| TYPE_CONTAINS_VPTR_P (t
)))
5693 /* We build this decl with vtbl_ptr_type_node, which is a
5694 `vtable_entry_type*'. It might seem more precise to use
5695 `vtable_entry_type (*)[N]' where N is the number of virtual
5696 functions. However, that would require the vtable pointer in
5697 base classes to have a different type than the vtable pointer
5698 in derived classes. We could make that happen, but that
5699 still wouldn't solve all the problems. In particular, the
5700 type-based alias analysis code would decide that assignments
5701 to the base class vtable pointer can't alias assignments to
5702 the derived class vtable pointer, since they have different
5703 types. Thus, in a derived class destructor, where the base
5704 class constructor was inlined, we could generate bad code for
5705 setting up the vtable pointer.
5707 Therefore, we use one type for all vtable pointers. We still
5708 use a type-correct type; it's just doesn't indicate the array
5709 bounds. That's better than using `void*' or some such; it's
5710 cleaner, and it let's the alias analysis code know that these
5711 stores cannot alias stores to void*! */
5714 field
= build_decl (input_location
,
5715 FIELD_DECL
, get_vfield_name (t
), vtbl_ptr_type_node
);
5716 DECL_VIRTUAL_P (field
) = 1;
5717 DECL_ARTIFICIAL (field
) = 1;
5718 DECL_FIELD_CONTEXT (field
) = t
;
5719 DECL_FCONTEXT (field
) = t
;
5720 if (TYPE_PACKED (t
))
5721 DECL_PACKED (field
) = 1;
5723 TYPE_VFIELD (t
) = field
;
5725 /* This class is non-empty. */
5726 CLASSTYPE_EMPTY_P (t
) = 0;
5734 /* Add OFFSET to all base types of BINFO which is a base in the
5735 hierarchy dominated by T.
5737 OFFSET, which is a type offset, is number of bytes. */
5740 propagate_binfo_offsets (tree binfo
, tree offset
)
5746 /* Update BINFO's offset. */
5747 BINFO_OFFSET (binfo
)
5748 = convert (sizetype
,
5749 size_binop (PLUS_EXPR
,
5750 convert (ssizetype
, BINFO_OFFSET (binfo
)),
5753 /* Find the primary base class. */
5754 primary_binfo
= get_primary_binfo (binfo
);
5756 if (primary_binfo
&& BINFO_INHERITANCE_CHAIN (primary_binfo
) == binfo
)
5757 propagate_binfo_offsets (primary_binfo
, offset
);
5759 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
5761 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5763 /* Don't do the primary base twice. */
5764 if (base_binfo
== primary_binfo
)
5767 if (BINFO_VIRTUAL_P (base_binfo
))
5770 propagate_binfo_offsets (base_binfo
, offset
);
5774 /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update
5775 TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of
5776 empty subobjects of T. */
5779 layout_virtual_bases (record_layout_info rli
, splay_tree offsets
)
5785 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t
)) == 0)
5788 /* Find the last field. The artificial fields created for virtual
5789 bases will go after the last extant field to date. */
5790 next_field
= &TYPE_FIELDS (t
);
5792 next_field
= &DECL_CHAIN (*next_field
);
5794 /* Go through the virtual bases, allocating space for each virtual
5795 base that is not already a primary base class. These are
5796 allocated in inheritance graph order. */
5797 for (vbase
= TYPE_BINFO (t
); vbase
; vbase
= TREE_CHAIN (vbase
))
5799 if (!BINFO_VIRTUAL_P (vbase
))
5802 if (!BINFO_PRIMARY_P (vbase
))
5804 /* This virtual base is not a primary base of any class in the
5805 hierarchy, so we have to add space for it. */
5806 next_field
= build_base_field (rli
, vbase
,
5807 offsets
, next_field
);
5812 /* Returns the offset of the byte just past the end of the base class
5816 end_of_base (tree binfo
)
5820 if (!CLASSTYPE_AS_BASE (BINFO_TYPE (binfo
)))
5821 size
= TYPE_SIZE_UNIT (char_type_node
);
5822 else if (is_empty_class (BINFO_TYPE (binfo
)))
5823 /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to
5824 allocate some space for it. It cannot have virtual bases, so
5825 TYPE_SIZE_UNIT is fine. */
5826 size
= TYPE_SIZE_UNIT (BINFO_TYPE (binfo
));
5828 size
= CLASSTYPE_SIZE_UNIT (BINFO_TYPE (binfo
));
5830 return size_binop (PLUS_EXPR
, BINFO_OFFSET (binfo
), size
);
5833 /* Returns the offset of the byte just past the end of the base class
5834 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
5835 only non-virtual bases are included. */
5838 end_of_class (tree t
, int include_virtuals_p
)
5840 tree result
= size_zero_node
;
5841 vec
<tree
, va_gc
> *vbases
;
5847 for (binfo
= TYPE_BINFO (t
), i
= 0;
5848 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5850 if (!include_virtuals_p
5851 && BINFO_VIRTUAL_P (base_binfo
)
5852 && (!BINFO_PRIMARY_P (base_binfo
)
5853 || BINFO_INHERITANCE_CHAIN (base_binfo
) != TYPE_BINFO (t
)))
5856 offset
= end_of_base (base_binfo
);
5857 if (tree_int_cst_lt (result
, offset
))
5861 if (include_virtuals_p
)
5862 for (vbases
= CLASSTYPE_VBASECLASSES (t
), i
= 0;
5863 vec_safe_iterate (vbases
, i
, &base_binfo
); i
++)
5865 offset
= end_of_base (base_binfo
);
5866 if (tree_int_cst_lt (result
, offset
))
5873 /* Warn about bases of T that are inaccessible because they are
5874 ambiguous. For example:
5877 struct T : public S {};
5878 struct U : public S, public T {};
5880 Here, `(S*) new U' is not allowed because there are two `S'
5884 warn_about_ambiguous_bases (tree t
)
5887 vec
<tree
, va_gc
> *vbases
;
5892 /* If there are no repeated bases, nothing can be ambiguous. */
5893 if (!CLASSTYPE_REPEATED_BASE_P (t
))
5896 /* Check direct bases. */
5897 for (binfo
= TYPE_BINFO (t
), i
= 0;
5898 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5900 basetype
= BINFO_TYPE (base_binfo
);
5902 if (!uniquely_derived_from_p (basetype
, t
))
5903 warning (0, "direct base %qT inaccessible in %qT due to ambiguity",
5907 /* Check for ambiguous virtual bases. */
5909 for (vbases
= CLASSTYPE_VBASECLASSES (t
), i
= 0;
5910 vec_safe_iterate (vbases
, i
, &binfo
); i
++)
5912 basetype
= BINFO_TYPE (binfo
);
5914 if (!uniquely_derived_from_p (basetype
, t
))
5915 warning (OPT_Wextra
, "virtual base %qT inaccessible in %qT due "
5916 "to ambiguity", basetype
, t
);
5920 /* Compare two INTEGER_CSTs K1 and K2. */
5923 splay_tree_compare_integer_csts (splay_tree_key k1
, splay_tree_key k2
)
5925 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
5928 /* Increase the size indicated in RLI to account for empty classes
5929 that are "off the end" of the class. */
5932 include_empty_classes (record_layout_info rli
)
5937 /* It might be the case that we grew the class to allocate a
5938 zero-sized base class. That won't be reflected in RLI, yet,
5939 because we are willing to overlay multiple bases at the same
5940 offset. However, now we need to make sure that RLI is big enough
5941 to reflect the entire class. */
5942 eoc
= end_of_class (rli
->t
,
5943 CLASSTYPE_AS_BASE (rli
->t
) != NULL_TREE
);
5944 rli_size
= rli_size_unit_so_far (rli
);
5945 if (TREE_CODE (rli_size
) == INTEGER_CST
5946 && tree_int_cst_lt (rli_size
, eoc
))
5948 /* The size should have been rounded to a whole byte. */
5949 gcc_assert (tree_int_cst_equal
5950 (rli
->bitpos
, round_down (rli
->bitpos
, BITS_PER_UNIT
)));
5952 = size_binop (PLUS_EXPR
,
5954 size_binop (MULT_EXPR
,
5955 convert (bitsizetype
,
5956 size_binop (MINUS_EXPR
,
5958 bitsize_int (BITS_PER_UNIT
)));
5959 normalize_rli (rli
);
5963 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
5964 BINFO_OFFSETs for all of the base-classes. Position the vtable
5965 pointer. Accumulate declared virtual functions on VIRTUALS_P. */
5968 layout_class_type (tree t
, tree
*virtuals_p
)
5970 tree non_static_data_members
;
5973 record_layout_info rli
;
5974 /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of
5975 types that appear at that offset. */
5976 splay_tree empty_base_offsets
;
5977 /* True if the last field laid out was a bit-field. */
5978 bool last_field_was_bitfield
= false;
5979 /* The location at which the next field should be inserted. */
5981 /* T, as a base class. */
5984 /* Keep track of the first non-static data member. */
5985 non_static_data_members
= TYPE_FIELDS (t
);
5987 /* Start laying out the record. */
5988 rli
= start_record_layout (t
);
5990 /* Mark all the primary bases in the hierarchy. */
5991 determine_primary_bases (t
);
5993 /* Create a pointer to our virtual function table. */
5994 vptr
= create_vtable_ptr (t
, virtuals_p
);
5996 /* The vptr is always the first thing in the class. */
5999 DECL_CHAIN (vptr
) = TYPE_FIELDS (t
);
6000 TYPE_FIELDS (t
) = vptr
;
6001 next_field
= &DECL_CHAIN (vptr
);
6002 place_field (rli
, vptr
);
6005 next_field
= &TYPE_FIELDS (t
);
6007 /* Build FIELD_DECLs for all of the non-virtual base-types. */
6008 empty_base_offsets
= splay_tree_new (splay_tree_compare_integer_csts
,
6010 build_base_fields (rli
, empty_base_offsets
, next_field
);
6012 /* Layout the non-static data members. */
6013 for (field
= non_static_data_members
; field
; field
= DECL_CHAIN (field
))
6018 /* We still pass things that aren't non-static data members to
6019 the back end, in case it wants to do something with them. */
6020 if (TREE_CODE (field
) != FIELD_DECL
)
6022 place_field (rli
, field
);
6023 /* If the static data member has incomplete type, keep track
6024 of it so that it can be completed later. (The handling
6025 of pending statics in finish_record_layout is
6026 insufficient; consider:
6029 struct S2 { static S1 s1; };
6031 At this point, finish_record_layout will be called, but
6032 S1 is still incomplete.) */
6035 maybe_register_incomplete_var (field
);
6036 /* The visibility of static data members is determined
6037 at their point of declaration, not their point of
6039 determine_visibility (field
);
6044 type
= TREE_TYPE (field
);
6045 if (type
== error_mark_node
)
6048 padding
= NULL_TREE
;
6050 /* If this field is a bit-field whose width is greater than its
6051 type, then there are some special rules for allocating
6053 if (DECL_C_BIT_FIELD (field
)
6054 && tree_int_cst_lt (TYPE_SIZE (type
), DECL_SIZE (field
)))
6058 bool was_unnamed_p
= false;
6059 /* We must allocate the bits as if suitably aligned for the
6060 longest integer type that fits in this many bits. type
6061 of the field. Then, we are supposed to use the left over
6062 bits as additional padding. */
6063 for (itk
= itk_char
; itk
!= itk_none
; ++itk
)
6064 if (integer_types
[itk
] != NULL_TREE
6065 && (tree_int_cst_lt (size_int (MAX_FIXED_MODE_SIZE
),
6066 TYPE_SIZE (integer_types
[itk
]))
6067 || tree_int_cst_lt (DECL_SIZE (field
),
6068 TYPE_SIZE (integer_types
[itk
]))))
6071 /* ITK now indicates a type that is too large for the
6072 field. We have to back up by one to find the largest
6077 integer_type
= integer_types
[itk
];
6078 } while (itk
> 0 && integer_type
== NULL_TREE
);
6080 /* Figure out how much additional padding is required. */
6081 if (tree_int_cst_lt (TYPE_SIZE (integer_type
), DECL_SIZE (field
)))
6083 if (TREE_CODE (t
) == UNION_TYPE
)
6084 /* In a union, the padding field must have the full width
6085 of the bit-field; all fields start at offset zero. */
6086 padding
= DECL_SIZE (field
);
6088 padding
= size_binop (MINUS_EXPR
, DECL_SIZE (field
),
6089 TYPE_SIZE (integer_type
));
6091 #ifdef PCC_BITFIELD_TYPE_MATTERS
6092 /* An unnamed bitfield does not normally affect the
6093 alignment of the containing class on a target where
6094 PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not
6095 make any exceptions for unnamed bitfields when the
6096 bitfields are longer than their types. Therefore, we
6097 temporarily give the field a name. */
6098 if (PCC_BITFIELD_TYPE_MATTERS
&& !DECL_NAME (field
))
6100 was_unnamed_p
= true;
6101 DECL_NAME (field
) = make_anon_name ();
6104 DECL_SIZE (field
) = TYPE_SIZE (integer_type
);
6105 DECL_ALIGN (field
) = TYPE_ALIGN (integer_type
);
6106 DECL_USER_ALIGN (field
) = TYPE_USER_ALIGN (integer_type
);
6107 layout_nonempty_base_or_field (rli
, field
, NULL_TREE
,
6108 empty_base_offsets
);
6110 DECL_NAME (field
) = NULL_TREE
;
6111 /* Now that layout has been performed, set the size of the
6112 field to the size of its declared type; the rest of the
6113 field is effectively invisible. */
6114 DECL_SIZE (field
) = TYPE_SIZE (type
);
6115 /* We must also reset the DECL_MODE of the field. */
6116 DECL_MODE (field
) = TYPE_MODE (type
);
6119 layout_nonempty_base_or_field (rli
, field
, NULL_TREE
,
6120 empty_base_offsets
);
6122 /* Remember the location of any empty classes in FIELD. */
6123 record_subobject_offsets (TREE_TYPE (field
),
6124 byte_position(field
),
6126 /*is_data_member=*/true);
6128 /* If a bit-field does not immediately follow another bit-field,
6129 and yet it starts in the middle of a byte, we have failed to
6130 comply with the ABI. */
6132 && DECL_C_BIT_FIELD (field
)
6133 /* The TREE_NO_WARNING flag gets set by Objective-C when
6134 laying out an Objective-C class. The ObjC ABI differs
6135 from the C++ ABI, and so we do not want a warning
6137 && !TREE_NO_WARNING (field
)
6138 && !last_field_was_bitfield
6139 && !integer_zerop (size_binop (TRUNC_MOD_EXPR
,
6140 DECL_FIELD_BIT_OFFSET (field
),
6141 bitsize_unit_node
)))
6142 warning (OPT_Wabi
, "offset of %q+D is not ABI-compliant and may "
6143 "change in a future version of GCC", field
);
6145 /* The middle end uses the type of expressions to determine the
6146 possible range of expression values. In order to optimize
6147 "x.i > 7" to "false" for a 2-bit bitfield "i", the middle end
6148 must be made aware of the width of "i", via its type.
6150 Because C++ does not have integer types of arbitrary width,
6151 we must (for the purposes of the front end) convert from the
6152 type assigned here to the declared type of the bitfield
6153 whenever a bitfield expression is used as an rvalue.
6154 Similarly, when assigning a value to a bitfield, the value
6155 must be converted to the type given the bitfield here. */
6156 if (DECL_C_BIT_FIELD (field
))
6158 unsigned HOST_WIDE_INT width
;
6159 tree ftype
= TREE_TYPE (field
);
6160 width
= tree_to_uhwi (DECL_SIZE (field
));
6161 if (width
!= TYPE_PRECISION (ftype
))
6164 = c_build_bitfield_integer_type (width
,
6165 TYPE_UNSIGNED (ftype
));
6167 = cp_build_qualified_type (TREE_TYPE (field
),
6168 cp_type_quals (ftype
));
6172 /* If we needed additional padding after this field, add it
6178 padding_field
= build_decl (input_location
,
6182 DECL_BIT_FIELD (padding_field
) = 1;
6183 DECL_SIZE (padding_field
) = padding
;
6184 DECL_CONTEXT (padding_field
) = t
;
6185 DECL_ARTIFICIAL (padding_field
) = 1;
6186 DECL_IGNORED_P (padding_field
) = 1;
6187 layout_nonempty_base_or_field (rli
, padding_field
,
6189 empty_base_offsets
);
6192 last_field_was_bitfield
= DECL_C_BIT_FIELD (field
);
6195 if (!integer_zerop (rli
->bitpos
))
6197 /* Make sure that we are on a byte boundary so that the size of
6198 the class without virtual bases will always be a round number
6200 rli
->bitpos
= round_up_loc (input_location
, rli
->bitpos
, BITS_PER_UNIT
);
6201 normalize_rli (rli
);
6204 /* Delete all zero-width bit-fields from the list of fields. Now
6205 that the type is laid out they are no longer important. */
6206 remove_zero_width_bit_fields (t
);
6208 /* Create the version of T used for virtual bases. We do not use
6209 make_class_type for this version; this is an artificial type. For
6210 a POD type, we just reuse T. */
6211 if (CLASSTYPE_NON_LAYOUT_POD_P (t
) || CLASSTYPE_EMPTY_P (t
))
6213 base_t
= make_node (TREE_CODE (t
));
6215 /* Set the size and alignment for the new type. */
6218 /* If the ABI version is not at least two, and the last
6219 field was a bit-field, RLI may not be on a byte
6220 boundary. In particular, rli_size_unit_so_far might
6221 indicate the last complete byte, while rli_size_so_far
6222 indicates the total number of bits used. Therefore,
6223 rli_size_so_far, rather than rli_size_unit_so_far, is
6224 used to compute TYPE_SIZE_UNIT. */
6225 eoc
= end_of_class (t
, /*include_virtuals_p=*/0);
6226 TYPE_SIZE_UNIT (base_t
)
6227 = size_binop (MAX_EXPR
,
6229 size_binop (CEIL_DIV_EXPR
,
6230 rli_size_so_far (rli
),
6231 bitsize_int (BITS_PER_UNIT
))),
6234 = size_binop (MAX_EXPR
,
6235 rli_size_so_far (rli
),
6236 size_binop (MULT_EXPR
,
6237 convert (bitsizetype
, eoc
),
6238 bitsize_int (BITS_PER_UNIT
)));
6239 TYPE_ALIGN (base_t
) = rli
->record_align
;
6240 TYPE_USER_ALIGN (base_t
) = TYPE_USER_ALIGN (t
);
6242 /* Copy the fields from T. */
6243 next_field
= &TYPE_FIELDS (base_t
);
6244 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
6245 if (TREE_CODE (field
) == FIELD_DECL
)
6247 *next_field
= build_decl (input_location
,
6251 DECL_CONTEXT (*next_field
) = base_t
;
6252 DECL_FIELD_OFFSET (*next_field
) = DECL_FIELD_OFFSET (field
);
6253 DECL_FIELD_BIT_OFFSET (*next_field
)
6254 = DECL_FIELD_BIT_OFFSET (field
);
6255 DECL_SIZE (*next_field
) = DECL_SIZE (field
);
6256 DECL_MODE (*next_field
) = DECL_MODE (field
);
6257 next_field
= &DECL_CHAIN (*next_field
);
6260 /* Record the base version of the type. */
6261 CLASSTYPE_AS_BASE (t
) = base_t
;
6262 TYPE_CONTEXT (base_t
) = t
;
6265 CLASSTYPE_AS_BASE (t
) = t
;
6267 /* Every empty class contains an empty class. */
6268 if (CLASSTYPE_EMPTY_P (t
))
6269 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 1;
6271 /* Set the TYPE_DECL for this type to contain the right
6272 value for DECL_OFFSET, so that we can use it as part
6273 of a COMPONENT_REF for multiple inheritance. */
6274 layout_decl (TYPE_MAIN_DECL (t
), 0);
6276 /* Now fix up any virtual base class types that we left lying
6277 around. We must get these done before we try to lay out the
6278 virtual function table. As a side-effect, this will remove the
6279 base subobject fields. */
6280 layout_virtual_bases (rli
, empty_base_offsets
);
6282 /* Make sure that empty classes are reflected in RLI at this
6284 include_empty_classes(rli
);
6286 /* Make sure not to create any structures with zero size. */
6287 if (integer_zerop (rli_size_unit_so_far (rli
)) && CLASSTYPE_EMPTY_P (t
))
6289 build_decl (input_location
,
6290 FIELD_DECL
, NULL_TREE
, char_type_node
));
6292 /* If this is a non-POD, declaring it packed makes a difference to how it
6293 can be used as a field; don't let finalize_record_size undo it. */
6294 if (TYPE_PACKED (t
) && !layout_pod_type_p (t
))
6295 rli
->packed_maybe_necessary
= true;
6297 /* Let the back end lay out the type. */
6298 finish_record_layout (rli
, /*free_p=*/true);
6300 if (TYPE_SIZE_UNIT (t
)
6301 && TREE_CODE (TYPE_SIZE_UNIT (t
)) == INTEGER_CST
6302 && !TREE_OVERFLOW (TYPE_SIZE_UNIT (t
))
6303 && !valid_constant_size_p (TYPE_SIZE_UNIT (t
)))
6304 error ("type %qT is too large", t
);
6306 /* Warn about bases that can't be talked about due to ambiguity. */
6307 warn_about_ambiguous_bases (t
);
6309 /* Now that we're done with layout, give the base fields the real types. */
6310 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
6311 if (DECL_ARTIFICIAL (field
) && IS_FAKE_BASE_TYPE (TREE_TYPE (field
)))
6312 TREE_TYPE (field
) = TYPE_CONTEXT (TREE_TYPE (field
));
6315 splay_tree_delete (empty_base_offsets
);
6317 if (CLASSTYPE_EMPTY_P (t
)
6318 && tree_int_cst_lt (sizeof_biggest_empty_class
,
6319 TYPE_SIZE_UNIT (t
)))
6320 sizeof_biggest_empty_class
= TYPE_SIZE_UNIT (t
);
6323 /* Determine the "key method" for the class type indicated by TYPE,
6324 and set CLASSTYPE_KEY_METHOD accordingly. */
6327 determine_key_method (tree type
)
6331 if (TYPE_FOR_JAVA (type
)
6332 || processing_template_decl
6333 || CLASSTYPE_TEMPLATE_INSTANTIATION (type
)
6334 || CLASSTYPE_INTERFACE_KNOWN (type
))
6337 /* The key method is the first non-pure virtual function that is not
6338 inline at the point of class definition. On some targets the
6339 key function may not be inline; those targets should not call
6340 this function until the end of the translation unit. */
6341 for (method
= TYPE_METHODS (type
); method
!= NULL_TREE
;
6342 method
= DECL_CHAIN (method
))
6343 if (TREE_CODE (method
) == FUNCTION_DECL
6344 && DECL_VINDEX (method
) != NULL_TREE
6345 && ! DECL_DECLARED_INLINE_P (method
)
6346 && ! DECL_PURE_VIRTUAL_P (method
))
6348 CLASSTYPE_KEY_METHOD (type
) = method
;
6356 /* Allocate and return an instance of struct sorted_fields_type with
6359 static struct sorted_fields_type
*
6360 sorted_fields_type_new (int n
)
6362 struct sorted_fields_type
*sft
;
6363 sft
= (sorted_fields_type
*) ggc_internal_alloc (sizeof (sorted_fields_type
)
6364 + n
* sizeof (tree
));
6371 /* Perform processing required when the definition of T (a class type)
6375 finish_struct_1 (tree t
)
6378 /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */
6379 tree virtuals
= NULL_TREE
;
6381 if (COMPLETE_TYPE_P (t
))
6383 gcc_assert (MAYBE_CLASS_TYPE_P (t
));
6384 error ("redefinition of %q#T", t
);
6389 /* If this type was previously laid out as a forward reference,
6390 make sure we lay it out again. */
6391 TYPE_SIZE (t
) = NULL_TREE
;
6392 CLASSTYPE_PRIMARY_BINFO (t
) = NULL_TREE
;
6394 /* Make assumptions about the class; we'll reset the flags if
6396 CLASSTYPE_EMPTY_P (t
) = 1;
6397 CLASSTYPE_NEARLY_EMPTY_P (t
) = 1;
6398 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 0;
6399 CLASSTYPE_LITERAL_P (t
) = true;
6401 /* Do end-of-class semantic processing: checking the validity of the
6402 bases and members and add implicitly generated methods. */
6403 check_bases_and_members (t
);
6405 /* Find the key method. */
6406 if (TYPE_CONTAINS_VPTR_P (t
))
6408 /* The Itanium C++ ABI permits the key method to be chosen when
6409 the class is defined -- even though the key method so
6410 selected may later turn out to be an inline function. On
6411 some systems (such as ARM Symbian OS) the key method cannot
6412 be determined until the end of the translation unit. On such
6413 systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which
6414 will cause the class to be added to KEYED_CLASSES. Then, in
6415 finish_file we will determine the key method. */
6416 if (targetm
.cxx
.key_method_may_be_inline ())
6417 determine_key_method (t
);
6419 /* If a polymorphic class has no key method, we may emit the vtable
6420 in every translation unit where the class definition appears. If
6421 we're devirtualizing, we can look into the vtable even if we
6422 aren't emitting it. */
6423 if (CLASSTYPE_KEY_METHOD (t
) == NULL_TREE
)
6424 keyed_classes
= tree_cons (NULL_TREE
, t
, keyed_classes
);
6427 /* Layout the class itself. */
6428 layout_class_type (t
, &virtuals
);
6429 if (CLASSTYPE_AS_BASE (t
) != t
)
6430 /* We use the base type for trivial assignments, and hence it
6432 compute_record_mode (CLASSTYPE_AS_BASE (t
));
6434 virtuals
= modify_all_vtables (t
, nreverse (virtuals
));
6436 /* If necessary, create the primary vtable for this class. */
6437 if (virtuals
|| TYPE_CONTAINS_VPTR_P (t
))
6439 /* We must enter these virtuals into the table. */
6440 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
6441 build_primary_vtable (NULL_TREE
, t
);
6442 else if (! BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (t
)))
6443 /* Here we know enough to change the type of our virtual
6444 function table, but we will wait until later this function. */
6445 build_primary_vtable (CLASSTYPE_PRIMARY_BINFO (t
), t
);
6447 /* If we're warning about ABI tags, check the types of the new
6448 virtual functions. */
6450 for (tree v
= virtuals
; v
; v
= TREE_CHAIN (v
))
6451 check_abi_tags (t
, TREE_VALUE (v
));
6454 if (TYPE_CONTAINS_VPTR_P (t
))
6459 if (BINFO_VTABLE (TYPE_BINFO (t
)))
6460 gcc_assert (DECL_VIRTUAL_P (BINFO_VTABLE (TYPE_BINFO (t
))));
6461 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
6462 gcc_assert (BINFO_VIRTUALS (TYPE_BINFO (t
)) == NULL_TREE
);
6464 /* Add entries for virtual functions introduced by this class. */
6465 BINFO_VIRTUALS (TYPE_BINFO (t
))
6466 = chainon (BINFO_VIRTUALS (TYPE_BINFO (t
)), virtuals
);
6468 /* Set DECL_VINDEX for all functions declared in this class. */
6469 for (vindex
= 0, fn
= BINFO_VIRTUALS (TYPE_BINFO (t
));
6471 fn
= TREE_CHAIN (fn
),
6472 vindex
+= (TARGET_VTABLE_USES_DESCRIPTORS
6473 ? TARGET_VTABLE_USES_DESCRIPTORS
: 1))
6475 tree fndecl
= BV_FN (fn
);
6477 if (DECL_THUNK_P (fndecl
))
6478 /* A thunk. We should never be calling this entry directly
6479 from this vtable -- we'd use the entry for the non
6480 thunk base function. */
6481 DECL_VINDEX (fndecl
) = NULL_TREE
;
6482 else if (TREE_CODE (DECL_VINDEX (fndecl
)) != INTEGER_CST
)
6483 DECL_VINDEX (fndecl
) = build_int_cst (NULL_TREE
, vindex
);
6487 finish_struct_bits (t
);
6488 set_method_tm_attributes (t
);
6490 /* Complete the rtl for any static member objects of the type we're
6492 for (x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
6493 if (VAR_P (x
) && TREE_STATIC (x
)
6494 && TREE_TYPE (x
) != error_mark_node
6495 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (x
)), t
))
6496 DECL_MODE (x
) = TYPE_MODE (t
);
6498 /* Done with FIELDS...now decide whether to sort these for
6499 faster lookups later.
6501 We use a small number because most searches fail (succeeding
6502 ultimately as the search bores through the inheritance
6503 hierarchy), and we want this failure to occur quickly. */
6505 insert_into_classtype_sorted_fields (TYPE_FIELDS (t
), t
, 8);
6507 /* Complain if one of the field types requires lower visibility. */
6508 constrain_class_visibility (t
);
6510 /* Make the rtl for any new vtables we have created, and unmark
6511 the base types we marked. */
6514 /* Build the VTT for T. */
6517 /* This warning does not make sense for Java classes, since they
6518 cannot have destructors. */
6519 if (!TYPE_FOR_JAVA (t
) && warn_nonvdtor
6520 && TYPE_POLYMORPHIC_P (t
) && accessible_nvdtor_p (t
)
6521 && !CLASSTYPE_FINAL (t
))
6522 warning (OPT_Wnon_virtual_dtor
,
6523 "%q#T has virtual functions and accessible"
6524 " non-virtual destructor", t
);
6528 if (warn_overloaded_virtual
)
6531 /* Class layout, assignment of virtual table slots, etc., is now
6532 complete. Give the back end a chance to tweak the visibility of
6533 the class or perform any other required target modifications. */
6534 targetm
.cxx
.adjust_class_at_definition (t
);
6536 maybe_suppress_debug_info (t
);
6538 if (flag_vtable_verify
)
6539 vtv_save_class_info (t
);
6541 dump_class_hierarchy (t
);
6543 /* Finish debugging output for this type. */
6544 rest_of_type_compilation (t
, ! LOCAL_CLASS_P (t
));
6546 if (TYPE_TRANSPARENT_AGGR (t
))
6548 tree field
= first_field (t
);
6549 if (field
== NULL_TREE
|| error_operand_p (field
))
6551 error ("type transparent %q#T does not have any fields", t
);
6552 TYPE_TRANSPARENT_AGGR (t
) = 0;
6554 else if (DECL_ARTIFICIAL (field
))
6556 if (DECL_FIELD_IS_BASE (field
))
6557 error ("type transparent class %qT has base classes", t
);
6560 gcc_checking_assert (DECL_VIRTUAL_P (field
));
6561 error ("type transparent class %qT has virtual functions", t
);
6563 TYPE_TRANSPARENT_AGGR (t
) = 0;
6565 else if (TYPE_MODE (t
) != DECL_MODE (field
))
6567 error ("type transparent %q#T cannot be made transparent because "
6568 "the type of the first field has a different ABI from the "
6569 "class overall", t
);
6570 TYPE_TRANSPARENT_AGGR (t
) = 0;
6575 /* Insert FIELDS into T for the sorted case if the FIELDS count is
6576 equal to THRESHOLD or greater than THRESHOLD. */
6579 insert_into_classtype_sorted_fields (tree fields
, tree t
, int threshold
)
6581 int n_fields
= count_fields (fields
);
6582 if (n_fields
>= threshold
)
6584 struct sorted_fields_type
*field_vec
= sorted_fields_type_new (n_fields
);
6585 add_fields_to_record_type (fields
, field_vec
, 0);
6586 qsort (field_vec
->elts
, n_fields
, sizeof (tree
), field_decl_cmp
);
6587 CLASSTYPE_SORTED_FIELDS (t
) = field_vec
;
6591 /* Insert lately defined enum ENUMTYPE into T for the sorted case. */
6594 insert_late_enum_def_into_classtype_sorted_fields (tree enumtype
, tree t
)
6596 struct sorted_fields_type
*sorted_fields
= CLASSTYPE_SORTED_FIELDS (t
);
6601 = list_length (TYPE_VALUES (enumtype
)) + sorted_fields
->len
;
6602 struct sorted_fields_type
*field_vec
= sorted_fields_type_new (n_fields
);
6604 for (i
= 0; i
< sorted_fields
->len
; ++i
)
6605 field_vec
->elts
[i
] = sorted_fields
->elts
[i
];
6607 add_enum_fields_to_record_type (enumtype
, field_vec
,
6608 sorted_fields
->len
);
6609 qsort (field_vec
->elts
, n_fields
, sizeof (tree
), field_decl_cmp
);
6610 CLASSTYPE_SORTED_FIELDS (t
) = field_vec
;
6614 /* When T was built up, the member declarations were added in reverse
6615 order. Rearrange them to declaration order. */
6618 unreverse_member_declarations (tree t
)
6624 /* The following lists are all in reverse order. Put them in
6625 declaration order now. */
6626 TYPE_METHODS (t
) = nreverse (TYPE_METHODS (t
));
6627 CLASSTYPE_DECL_LIST (t
) = nreverse (CLASSTYPE_DECL_LIST (t
));
6629 /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in
6630 reverse order, so we can't just use nreverse. */
6632 for (x
= TYPE_FIELDS (t
);
6633 x
&& TREE_CODE (x
) != TYPE_DECL
;
6636 next
= DECL_CHAIN (x
);
6637 DECL_CHAIN (x
) = prev
;
6642 DECL_CHAIN (TYPE_FIELDS (t
)) = x
;
6644 TYPE_FIELDS (t
) = prev
;
6649 finish_struct (tree t
, tree attributes
)
6651 location_t saved_loc
= input_location
;
6653 /* Now that we've got all the field declarations, reverse everything
6655 unreverse_member_declarations (t
);
6657 cplus_decl_attributes (&t
, attributes
, (int) ATTR_FLAG_TYPE_IN_PLACE
);
6659 /* Nadger the current location so that diagnostics point to the start of
6660 the struct, not the end. */
6661 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (t
));
6663 if (processing_template_decl
)
6667 finish_struct_methods (t
);
6668 TYPE_SIZE (t
) = bitsize_zero_node
;
6669 TYPE_SIZE_UNIT (t
) = size_zero_node
;
6671 /* We need to emit an error message if this type was used as a parameter
6672 and it is an abstract type, even if it is a template. We construct
6673 a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into
6674 account and we call complete_vars with this type, which will check
6675 the PARM_DECLS. Note that while the type is being defined,
6676 CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends
6677 (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */
6678 CLASSTYPE_PURE_VIRTUALS (t
) = NULL
;
6679 for (x
= TYPE_METHODS (t
); x
; x
= DECL_CHAIN (x
))
6680 if (DECL_PURE_VIRTUAL_P (x
))
6681 vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t
), x
);
6683 /* We need to add the target functions to the CLASSTYPE_METHOD_VEC if
6684 an enclosing scope is a template class, so that this function be
6685 found by lookup_fnfields_1 when the using declaration is not
6686 instantiated yet. */
6687 for (x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
6688 if (TREE_CODE (x
) == USING_DECL
)
6690 tree fn
= strip_using_decl (x
);
6691 if (is_overloaded_fn (fn
))
6692 for (; fn
; fn
= OVL_NEXT (fn
))
6693 add_method (t
, OVL_CURRENT (fn
), x
);
6696 /* Remember current #pragma pack value. */
6697 TYPE_PRECISION (t
) = maximum_field_alignment
;
6699 /* Fix up any variants we've already built. */
6700 for (x
= TYPE_NEXT_VARIANT (t
); x
; x
= TYPE_NEXT_VARIANT (x
))
6702 TYPE_SIZE (x
) = TYPE_SIZE (t
);
6703 TYPE_SIZE_UNIT (x
) = TYPE_SIZE_UNIT (t
);
6704 TYPE_FIELDS (x
) = TYPE_FIELDS (t
);
6705 TYPE_METHODS (x
) = TYPE_METHODS (t
);
6709 finish_struct_1 (t
);
6711 if (is_std_init_list (t
))
6713 /* People keep complaining that the compiler crashes on an invalid
6714 definition of initializer_list, so I guess we should explicitly
6715 reject it. What the compiler internals care about is that it's a
6716 template and has a pointer field followed by an integer field. */
6718 if (processing_template_decl
)
6720 tree f
= next_initializable_field (TYPE_FIELDS (t
));
6721 if (f
&& TREE_CODE (TREE_TYPE (f
)) == POINTER_TYPE
)
6723 f
= next_initializable_field (DECL_CHAIN (f
));
6724 if (f
&& TREE_CODE (TREE_TYPE (f
)) == INTEGER_TYPE
)
6729 fatal_error ("definition of std::initializer_list does not match "
6730 "#include <initializer_list>");
6733 input_location
= saved_loc
;
6735 TYPE_BEING_DEFINED (t
) = 0;
6737 if (current_class_type
)
6740 error ("trying to finish struct, but kicked out due to previous parse errors");
6742 if (processing_template_decl
&& at_function_scope_p ()
6743 /* Lambdas are defined by the LAMBDA_EXPR. */
6744 && !LAMBDA_TYPE_P (t
))
6745 add_stmt (build_min (TAG_DEFN
, t
));
6750 /* Hash table to avoid endless recursion when handling references. */
6751 static hash_table
<pointer_hash
<tree_node
> > *fixed_type_or_null_ref_ht
;
6753 /* Return the dynamic type of INSTANCE, if known.
6754 Used to determine whether the virtual function table is needed
6757 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
6758 of our knowledge of its type. *NONNULL should be initialized
6759 before this function is called. */
6762 fixed_type_or_null (tree instance
, int *nonnull
, int *cdtorp
)
6764 #define RECUR(T) fixed_type_or_null((T), nonnull, cdtorp)
6766 switch (TREE_CODE (instance
))
6769 if (POINTER_TYPE_P (TREE_TYPE (instance
)))
6772 return RECUR (TREE_OPERAND (instance
, 0));
6775 /* This is a call to a constructor, hence it's never zero. */
6776 if (TREE_HAS_CONSTRUCTOR (instance
))
6780 return TREE_TYPE (instance
);
6785 /* This is a call to a constructor, hence it's never zero. */
6786 if (TREE_HAS_CONSTRUCTOR (instance
))
6790 return TREE_TYPE (instance
);
6792 return RECUR (TREE_OPERAND (instance
, 0));
6794 case POINTER_PLUS_EXPR
:
6797 if (TREE_CODE (TREE_OPERAND (instance
, 0)) == ADDR_EXPR
)
6798 return RECUR (TREE_OPERAND (instance
, 0));
6799 if (TREE_CODE (TREE_OPERAND (instance
, 1)) == INTEGER_CST
)
6800 /* Propagate nonnull. */
6801 return RECUR (TREE_OPERAND (instance
, 0));
6806 return RECUR (TREE_OPERAND (instance
, 0));
6809 instance
= TREE_OPERAND (instance
, 0);
6812 /* Just because we see an ADDR_EXPR doesn't mean we're dealing
6813 with a real object -- given &p->f, p can still be null. */
6814 tree t
= get_base_address (instance
);
6815 /* ??? Probably should check DECL_WEAK here. */
6816 if (t
&& DECL_P (t
))
6819 return RECUR (instance
);
6822 /* If this component is really a base class reference, then the field
6823 itself isn't definitive. */
6824 if (DECL_FIELD_IS_BASE (TREE_OPERAND (instance
, 1)))
6825 return RECUR (TREE_OPERAND (instance
, 0));
6826 return RECUR (TREE_OPERAND (instance
, 1));
6830 if (TREE_CODE (TREE_TYPE (instance
)) == ARRAY_TYPE
6831 && MAYBE_CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (instance
))))
6835 return TREE_TYPE (TREE_TYPE (instance
));
6837 /* fall through... */
6841 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (instance
)))
6845 return TREE_TYPE (instance
);
6847 else if (instance
== current_class_ptr
)
6852 /* if we're in a ctor or dtor, we know our type. If
6853 current_class_ptr is set but we aren't in a function, we're in
6854 an NSDMI (and therefore a constructor). */
6855 if (current_scope () != current_function_decl
6856 || (DECL_LANG_SPECIFIC (current_function_decl
)
6857 && (DECL_CONSTRUCTOR_P (current_function_decl
)
6858 || DECL_DESTRUCTOR_P (current_function_decl
))))
6862 return TREE_TYPE (TREE_TYPE (instance
));
6865 else if (TREE_CODE (TREE_TYPE (instance
)) == REFERENCE_TYPE
)
6867 /* We only need one hash table because it is always left empty. */
6868 if (!fixed_type_or_null_ref_ht
)
6869 fixed_type_or_null_ref_ht
6870 = new hash_table
<pointer_hash
<tree_node
> > (37);
6872 /* Reference variables should be references to objects. */
6876 /* Enter the INSTANCE in a table to prevent recursion; a
6877 variable's initializer may refer to the variable
6879 if (VAR_P (instance
)
6880 && DECL_INITIAL (instance
)
6881 && !type_dependent_expression_p_push (DECL_INITIAL (instance
))
6882 && !fixed_type_or_null_ref_ht
->find (instance
))
6887 slot
= fixed_type_or_null_ref_ht
->find_slot (instance
, INSERT
);
6889 type
= RECUR (DECL_INITIAL (instance
));
6890 fixed_type_or_null_ref_ht
->remove_elt (instance
);
6903 /* Return nonzero if the dynamic type of INSTANCE is known, and
6904 equivalent to the static type. We also handle the case where
6905 INSTANCE is really a pointer. Return negative if this is a
6906 ctor/dtor. There the dynamic type is known, but this might not be
6907 the most derived base of the original object, and hence virtual
6908 bases may not be laid out according to this type.
6910 Used to determine whether the virtual function table is needed
6913 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
6914 of our knowledge of its type. *NONNULL should be initialized
6915 before this function is called. */
6918 resolves_to_fixed_type_p (tree instance
, int* nonnull
)
6920 tree t
= TREE_TYPE (instance
);
6924 /* processing_template_decl can be false in a template if we're in
6925 fold_non_dependent_expr, but we still want to suppress this check. */
6926 if (in_template_function ())
6928 /* In a template we only care about the type of the result. */
6934 fixed
= fixed_type_or_null (instance
, nonnull
, &cdtorp
);
6935 if (fixed
== NULL_TREE
)
6937 if (POINTER_TYPE_P (t
))
6939 if (!same_type_ignoring_top_level_qualifiers_p (t
, fixed
))
6941 return cdtorp
? -1 : 1;
6946 init_class_processing (void)
6948 current_class_depth
= 0;
6949 current_class_stack_size
= 10;
6951 = XNEWVEC (struct class_stack_node
, current_class_stack_size
);
6952 vec_alloc (local_classes
, 8);
6953 sizeof_biggest_empty_class
= size_zero_node
;
6955 ridpointers
[(int) RID_PUBLIC
] = access_public_node
;
6956 ridpointers
[(int) RID_PRIVATE
] = access_private_node
;
6957 ridpointers
[(int) RID_PROTECTED
] = access_protected_node
;
6960 /* Restore the cached PREVIOUS_CLASS_LEVEL. */
6963 restore_class_cache (void)
6967 /* We are re-entering the same class we just left, so we don't
6968 have to search the whole inheritance matrix to find all the
6969 decls to bind again. Instead, we install the cached
6970 class_shadowed list and walk through it binding names. */
6971 push_binding_level (previous_class_level
);
6972 class_binding_level
= previous_class_level
;
6973 /* Restore IDENTIFIER_TYPE_VALUE. */
6974 for (type
= class_binding_level
->type_shadowed
;
6976 type
= TREE_CHAIN (type
))
6977 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (type
), TREE_TYPE (type
));
6980 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as
6981 appropriate for TYPE.
6983 So that we may avoid calls to lookup_name, we cache the _TYPE
6984 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
6986 For multiple inheritance, we perform a two-pass depth-first search
6987 of the type lattice. */
6990 pushclass (tree type
)
6992 class_stack_node_t csn
;
6994 type
= TYPE_MAIN_VARIANT (type
);
6996 /* Make sure there is enough room for the new entry on the stack. */
6997 if (current_class_depth
+ 1 >= current_class_stack_size
)
6999 current_class_stack_size
*= 2;
7001 = XRESIZEVEC (struct class_stack_node
, current_class_stack
,
7002 current_class_stack_size
);
7005 /* Insert a new entry on the class stack. */
7006 csn
= current_class_stack
+ current_class_depth
;
7007 csn
->name
= current_class_name
;
7008 csn
->type
= current_class_type
;
7009 csn
->access
= current_access_specifier
;
7010 csn
->names_used
= 0;
7012 current_class_depth
++;
7014 /* Now set up the new type. */
7015 current_class_name
= TYPE_NAME (type
);
7016 if (TREE_CODE (current_class_name
) == TYPE_DECL
)
7017 current_class_name
= DECL_NAME (current_class_name
);
7018 current_class_type
= type
;
7020 /* By default, things in classes are private, while things in
7021 structures or unions are public. */
7022 current_access_specifier
= (CLASSTYPE_DECLARED_CLASS (type
)
7023 ? access_private_node
7024 : access_public_node
);
7026 if (previous_class_level
7027 && type
!= previous_class_level
->this_entity
7028 && current_class_depth
== 1)
7030 /* Forcibly remove any old class remnants. */
7031 invalidate_class_lookup_cache ();
7034 if (!previous_class_level
7035 || type
!= previous_class_level
->this_entity
7036 || current_class_depth
> 1)
7039 restore_class_cache ();
7042 /* When we exit a toplevel class scope, we save its binding level so
7043 that we can restore it quickly. Here, we've entered some other
7044 class, so we must invalidate our cache. */
7047 invalidate_class_lookup_cache (void)
7049 previous_class_level
= NULL
;
7052 /* Get out of the current class scope. If we were in a class scope
7053 previously, that is the one popped to. */
7060 current_class_depth
--;
7061 current_class_name
= current_class_stack
[current_class_depth
].name
;
7062 current_class_type
= current_class_stack
[current_class_depth
].type
;
7063 current_access_specifier
= current_class_stack
[current_class_depth
].access
;
7064 if (current_class_stack
[current_class_depth
].names_used
)
7065 splay_tree_delete (current_class_stack
[current_class_depth
].names_used
);
7068 /* Mark the top of the class stack as hidden. */
7071 push_class_stack (void)
7073 if (current_class_depth
)
7074 ++current_class_stack
[current_class_depth
- 1].hidden
;
7077 /* Mark the top of the class stack as un-hidden. */
7080 pop_class_stack (void)
7082 if (current_class_depth
)
7083 --current_class_stack
[current_class_depth
- 1].hidden
;
7086 /* Returns 1 if the class type currently being defined is either T or
7087 a nested type of T. */
7090 currently_open_class (tree t
)
7094 if (!CLASS_TYPE_P (t
))
7097 t
= TYPE_MAIN_VARIANT (t
);
7099 /* We start looking from 1 because entry 0 is from global scope,
7101 for (i
= current_class_depth
; i
> 0; --i
)
7104 if (i
== current_class_depth
)
7105 c
= current_class_type
;
7108 if (current_class_stack
[i
].hidden
)
7110 c
= current_class_stack
[i
].type
;
7114 if (same_type_p (c
, t
))
7120 /* If either current_class_type or one of its enclosing classes are derived
7121 from T, return the appropriate type. Used to determine how we found
7122 something via unqualified lookup. */
7125 currently_open_derived_class (tree t
)
7129 /* The bases of a dependent type are unknown. */
7130 if (dependent_type_p (t
))
7133 if (!current_class_type
)
7136 if (DERIVED_FROM_P (t
, current_class_type
))
7137 return current_class_type
;
7139 for (i
= current_class_depth
- 1; i
> 0; --i
)
7141 if (current_class_stack
[i
].hidden
)
7143 if (DERIVED_FROM_P (t
, current_class_stack
[i
].type
))
7144 return current_class_stack
[i
].type
;
7150 /* Return the outermost enclosing class type that is still open, or
7154 outermost_open_class (void)
7156 if (!current_class_type
)
7159 if (TYPE_BEING_DEFINED (current_class_type
))
7160 r
= current_class_type
;
7161 for (int i
= current_class_depth
- 1; i
> 0; --i
)
7163 if (current_class_stack
[i
].hidden
)
7165 tree t
= current_class_stack
[i
].type
;
7166 if (!TYPE_BEING_DEFINED (t
))
7173 /* Returns the innermost class type which is not a lambda closure type. */
7176 current_nonlambda_class_type (void)
7180 /* We start looking from 1 because entry 0 is from global scope,
7182 for (i
= current_class_depth
; i
> 0; --i
)
7185 if (i
== current_class_depth
)
7186 c
= current_class_type
;
7189 if (current_class_stack
[i
].hidden
)
7191 c
= current_class_stack
[i
].type
;
7195 if (!LAMBDA_TYPE_P (c
))
7201 /* When entering a class scope, all enclosing class scopes' names with
7202 static meaning (static variables, static functions, types and
7203 enumerators) have to be visible. This recursive function calls
7204 pushclass for all enclosing class contexts until global or a local
7205 scope is reached. TYPE is the enclosed class. */
7208 push_nested_class (tree type
)
7210 /* A namespace might be passed in error cases, like A::B:C. */
7211 if (type
== NULL_TREE
7212 || !CLASS_TYPE_P (type
))
7215 push_nested_class (DECL_CONTEXT (TYPE_MAIN_DECL (type
)));
7220 /* Undoes a push_nested_class call. */
7223 pop_nested_class (void)
7225 tree context
= DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type
));
7228 if (context
&& CLASS_TYPE_P (context
))
7229 pop_nested_class ();
7232 /* Returns the number of extern "LANG" blocks we are nested within. */
7235 current_lang_depth (void)
7237 return vec_safe_length (current_lang_base
);
7240 /* Set global variables CURRENT_LANG_NAME to appropriate value
7241 so that behavior of name-mangling machinery is correct. */
7244 push_lang_context (tree name
)
7246 vec_safe_push (current_lang_base
, current_lang_name
);
7248 if (name
== lang_name_cplusplus
)
7250 current_lang_name
= name
;
7252 else if (name
== lang_name_java
)
7254 current_lang_name
= name
;
7255 /* DECL_IGNORED_P is initially set for these types, to avoid clutter.
7256 (See record_builtin_java_type in decl.c.) However, that causes
7257 incorrect debug entries if these types are actually used.
7258 So we re-enable debug output after extern "Java". */
7259 DECL_IGNORED_P (TYPE_NAME (java_byte_type_node
)) = 0;
7260 DECL_IGNORED_P (TYPE_NAME (java_short_type_node
)) = 0;
7261 DECL_IGNORED_P (TYPE_NAME (java_int_type_node
)) = 0;
7262 DECL_IGNORED_P (TYPE_NAME (java_long_type_node
)) = 0;
7263 DECL_IGNORED_P (TYPE_NAME (java_float_type_node
)) = 0;
7264 DECL_IGNORED_P (TYPE_NAME (java_double_type_node
)) = 0;
7265 DECL_IGNORED_P (TYPE_NAME (java_char_type_node
)) = 0;
7266 DECL_IGNORED_P (TYPE_NAME (java_boolean_type_node
)) = 0;
7268 else if (name
== lang_name_c
)
7270 current_lang_name
= name
;
7273 error ("language string %<\"%E\"%> not recognized", name
);
7276 /* Get out of the current language scope. */
7279 pop_lang_context (void)
7281 current_lang_name
= current_lang_base
->pop ();
7284 /* Type instantiation routines. */
7286 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
7287 matches the TARGET_TYPE. If there is no satisfactory match, return
7288 error_mark_node, and issue an error & warning messages under
7289 control of FLAGS. Permit pointers to member function if FLAGS
7290 permits. If TEMPLATE_ONLY, the name of the overloaded function was
7291 a template-id, and EXPLICIT_TARGS are the explicitly provided
7294 If OVERLOAD is for one or more member functions, then ACCESS_PATH
7295 is the base path used to reference those member functions. If
7296 the address is resolved to a member function, access checks will be
7297 performed and errors issued if appropriate. */
7300 resolve_address_of_overloaded_function (tree target_type
,
7302 tsubst_flags_t flags
,
7304 tree explicit_targs
,
7307 /* Here's what the standard says:
7311 If the name is a function template, template argument deduction
7312 is done, and if the argument deduction succeeds, the deduced
7313 arguments are used to generate a single template function, which
7314 is added to the set of overloaded functions considered.
7316 Non-member functions and static member functions match targets of
7317 type "pointer-to-function" or "reference-to-function." Nonstatic
7318 member functions match targets of type "pointer-to-member
7319 function;" the function type of the pointer to member is used to
7320 select the member function from the set of overloaded member
7321 functions. If a nonstatic member function is selected, the
7322 reference to the overloaded function name is required to have the
7323 form of a pointer to member as described in 5.3.1.
7325 If more than one function is selected, any template functions in
7326 the set are eliminated if the set also contains a non-template
7327 function, and any given template function is eliminated if the
7328 set contains a second template function that is more specialized
7329 than the first according to the partial ordering rules 14.5.5.2.
7330 After such eliminations, if any, there shall remain exactly one
7331 selected function. */
7334 /* We store the matches in a TREE_LIST rooted here. The functions
7335 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
7336 interoperability with most_specialized_instantiation. */
7337 tree matches
= NULL_TREE
;
7339 tree target_fn_type
;
7341 /* By the time we get here, we should be seeing only real
7342 pointer-to-member types, not the internal POINTER_TYPE to
7343 METHOD_TYPE representation. */
7344 gcc_assert (!TYPE_PTR_P (target_type
)
7345 || TREE_CODE (TREE_TYPE (target_type
)) != METHOD_TYPE
);
7347 gcc_assert (is_overloaded_fn (overload
));
7349 /* Check that the TARGET_TYPE is reasonable. */
7350 if (TYPE_PTRFN_P (target_type
)
7351 || TYPE_REFFN_P (target_type
))
7353 else if (TYPE_PTRMEMFUNC_P (target_type
))
7354 /* This is OK, too. */
7356 else if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
7357 /* This is OK, too. This comes from a conversion to reference
7359 target_type
= build_reference_type (target_type
);
7362 if (flags
& tf_error
)
7363 error ("cannot resolve overloaded function %qD based on"
7364 " conversion to type %qT",
7365 DECL_NAME (OVL_FUNCTION (overload
)), target_type
);
7366 return error_mark_node
;
7369 /* Non-member functions and static member functions match targets of type
7370 "pointer-to-function" or "reference-to-function." Nonstatic member
7371 functions match targets of type "pointer-to-member-function;" the
7372 function type of the pointer to member is used to select the member
7373 function from the set of overloaded member functions.
7375 So figure out the FUNCTION_TYPE that we want to match against. */
7376 target_fn_type
= static_fn_type (target_type
);
7378 /* If we can find a non-template function that matches, we can just
7379 use it. There's no point in generating template instantiations
7380 if we're just going to throw them out anyhow. But, of course, we
7381 can only do this when we don't *need* a template function. */
7386 for (fns
= overload
; fns
; fns
= OVL_NEXT (fns
))
7388 tree fn
= OVL_CURRENT (fns
);
7390 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
7391 /* We're not looking for templates just yet. */
7394 if ((TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7396 /* We're looking for a non-static member, and this isn't
7397 one, or vice versa. */
7400 /* Ignore functions which haven't been explicitly
7402 if (DECL_ANTICIPATED (fn
))
7405 /* See if there's a match. */
7406 if (same_type_p (target_fn_type
, static_fn_type (fn
)))
7407 matches
= tree_cons (fn
, NULL_TREE
, matches
);
7411 /* Now, if we've already got a match (or matches), there's no need
7412 to proceed to the template functions. But, if we don't have a
7413 match we need to look at them, too. */
7416 tree target_arg_types
;
7417 tree target_ret_type
;
7420 unsigned int nargs
, ia
;
7423 target_arg_types
= TYPE_ARG_TYPES (target_fn_type
);
7424 target_ret_type
= TREE_TYPE (target_fn_type
);
7426 nargs
= list_length (target_arg_types
);
7427 args
= XALLOCAVEC (tree
, nargs
);
7428 for (arg
= target_arg_types
, ia
= 0;
7429 arg
!= NULL_TREE
&& arg
!= void_list_node
;
7430 arg
= TREE_CHAIN (arg
), ++ia
)
7431 args
[ia
] = TREE_VALUE (arg
);
7434 for (fns
= overload
; fns
; fns
= OVL_NEXT (fns
))
7436 tree fn
= OVL_CURRENT (fns
);
7440 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7441 /* We're only looking for templates. */
7444 if ((TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7446 /* We're not looking for a non-static member, and this is
7447 one, or vice versa. */
7450 tree ret
= target_ret_type
;
7452 /* If the template has a deduced return type, don't expose it to
7453 template argument deduction. */
7454 if (undeduced_auto_decl (fn
))
7457 /* Try to do argument deduction. */
7458 targs
= make_tree_vec (DECL_NTPARMS (fn
));
7459 instantiation
= fn_type_unification (fn
, explicit_targs
, targs
, args
,
7461 DEDUCE_EXACT
, LOOKUP_NORMAL
,
7463 if (instantiation
== error_mark_node
)
7464 /* Instantiation failed. */
7467 /* And now force instantiation to do return type deduction. */
7468 if (undeduced_auto_decl (instantiation
))
7471 instantiate_decl (instantiation
, /*defer*/false, /*class*/false);
7474 require_deduced_type (instantiation
);
7477 /* See if there's a match. */
7478 if (same_type_p (target_fn_type
, static_fn_type (instantiation
)))
7479 matches
= tree_cons (instantiation
, fn
, matches
);
7482 /* Now, remove all but the most specialized of the matches. */
7485 tree match
= most_specialized_instantiation (matches
);
7487 if (match
!= error_mark_node
)
7488 matches
= tree_cons (TREE_PURPOSE (match
),
7494 /* Now we should have exactly one function in MATCHES. */
7495 if (matches
== NULL_TREE
)
7497 /* There were *no* matches. */
7498 if (flags
& tf_error
)
7500 error ("no matches converting function %qD to type %q#T",
7501 DECL_NAME (OVL_CURRENT (overload
)),
7504 print_candidates (overload
);
7506 return error_mark_node
;
7508 else if (TREE_CHAIN (matches
))
7510 /* There were too many matches. First check if they're all
7511 the same function. */
7512 tree match
= NULL_TREE
;
7514 fn
= TREE_PURPOSE (matches
);
7516 /* For multi-versioned functions, more than one match is just fine and
7517 decls_match will return false as they are different. */
7518 for (match
= TREE_CHAIN (matches
); match
; match
= TREE_CHAIN (match
))
7519 if (!decls_match (fn
, TREE_PURPOSE (match
))
7520 && !targetm
.target_option
.function_versions
7521 (fn
, TREE_PURPOSE (match
)))
7526 if (flags
& tf_error
)
7528 error ("converting overloaded function %qD to type %q#T is ambiguous",
7529 DECL_NAME (OVL_FUNCTION (overload
)),
7532 /* Since print_candidates expects the functions in the
7533 TREE_VALUE slot, we flip them here. */
7534 for (match
= matches
; match
; match
= TREE_CHAIN (match
))
7535 TREE_VALUE (match
) = TREE_PURPOSE (match
);
7537 print_candidates (matches
);
7540 return error_mark_node
;
7544 /* Good, exactly one match. Now, convert it to the correct type. */
7545 fn
= TREE_PURPOSE (matches
);
7547 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
7548 && !(flags
& tf_ptrmem_ok
) && !flag_ms_extensions
)
7550 static int explained
;
7552 if (!(flags
& tf_error
))
7553 return error_mark_node
;
7555 permerror (input_location
, "assuming pointer to member %qD", fn
);
7558 inform (input_location
, "(a pointer to member can only be formed with %<&%E%>)", fn
);
7563 /* If a pointer to a function that is multi-versioned is requested, the
7564 pointer to the dispatcher function is returned instead. This works
7565 well because indirectly calling the function will dispatch the right
7566 function version at run-time. */
7567 if (DECL_FUNCTION_VERSIONED (fn
))
7569 fn
= get_function_version_dispatcher (fn
);
7571 return error_mark_node
;
7572 /* Mark all the versions corresponding to the dispatcher as used. */
7573 if (!(flags
& tf_conv
))
7574 mark_versions_used (fn
);
7577 /* If we're doing overload resolution purely for the purpose of
7578 determining conversion sequences, we should not consider the
7579 function used. If this conversion sequence is selected, the
7580 function will be marked as used at this point. */
7581 if (!(flags
& tf_conv
))
7583 /* Make =delete work with SFINAE. */
7584 if (DECL_DELETED_FN (fn
) && !(flags
& tf_error
))
7585 return error_mark_node
;
7590 /* We could not check access to member functions when this
7591 expression was originally created since we did not know at that
7592 time to which function the expression referred. */
7593 if (DECL_FUNCTION_MEMBER_P (fn
))
7595 gcc_assert (access_path
);
7596 perform_or_defer_access_check (access_path
, fn
, fn
, flags
);
7599 if (TYPE_PTRFN_P (target_type
) || TYPE_PTRMEMFUNC_P (target_type
))
7600 return cp_build_addr_expr (fn
, flags
);
7603 /* The target must be a REFERENCE_TYPE. Above, cp_build_unary_op
7604 will mark the function as addressed, but here we must do it
7606 cxx_mark_addressable (fn
);
7612 /* This function will instantiate the type of the expression given in
7613 RHS to match the type of LHSTYPE. If errors exist, then return
7614 error_mark_node. FLAGS is a bit mask. If TF_ERROR is set, then
7615 we complain on errors. If we are not complaining, never modify rhs,
7616 as overload resolution wants to try many possible instantiations, in
7617 the hope that at least one will work.
7619 For non-recursive calls, LHSTYPE should be a function, pointer to
7620 function, or a pointer to member function. */
7623 instantiate_type (tree lhstype
, tree rhs
, tsubst_flags_t flags
)
7625 tsubst_flags_t flags_in
= flags
;
7626 tree access_path
= NULL_TREE
;
7628 flags
&= ~tf_ptrmem_ok
;
7630 if (lhstype
== unknown_type_node
)
7632 if (flags
& tf_error
)
7633 error ("not enough type information");
7634 return error_mark_node
;
7637 if (TREE_TYPE (rhs
) != NULL_TREE
&& ! (type_unknown_p (rhs
)))
7639 tree fntype
= non_reference (lhstype
);
7640 if (same_type_p (fntype
, TREE_TYPE (rhs
)))
7642 if (flag_ms_extensions
7643 && TYPE_PTRMEMFUNC_P (fntype
)
7644 && !TYPE_PTRMEMFUNC_P (TREE_TYPE (rhs
)))
7645 /* Microsoft allows `A::f' to be resolved to a
7646 pointer-to-member. */
7650 if (flags
& tf_error
)
7651 error ("cannot convert %qE from type %qT to type %qT",
7652 rhs
, TREE_TYPE (rhs
), fntype
);
7653 return error_mark_node
;
7657 if (BASELINK_P (rhs
))
7659 access_path
= BASELINK_ACCESS_BINFO (rhs
);
7660 rhs
= BASELINK_FUNCTIONS (rhs
);
7663 /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot
7664 deduce any type information. */
7665 if (TREE_CODE (rhs
) == NON_DEPENDENT_EXPR
)
7667 if (flags
& tf_error
)
7668 error ("not enough type information");
7669 return error_mark_node
;
7672 /* There only a few kinds of expressions that may have a type
7673 dependent on overload resolution. */
7674 gcc_assert (TREE_CODE (rhs
) == ADDR_EXPR
7675 || TREE_CODE (rhs
) == COMPONENT_REF
7676 || is_overloaded_fn (rhs
)
7677 || (flag_ms_extensions
&& TREE_CODE (rhs
) == FUNCTION_DECL
));
7679 /* This should really only be used when attempting to distinguish
7680 what sort of a pointer to function we have. For now, any
7681 arithmetic operation which is not supported on pointers
7682 is rejected as an error. */
7684 switch (TREE_CODE (rhs
))
7688 tree member
= TREE_OPERAND (rhs
, 1);
7690 member
= instantiate_type (lhstype
, member
, flags
);
7691 if (member
!= error_mark_node
7692 && TREE_SIDE_EFFECTS (TREE_OPERAND (rhs
, 0)))
7693 /* Do not lose object's side effects. */
7694 return build2 (COMPOUND_EXPR
, TREE_TYPE (member
),
7695 TREE_OPERAND (rhs
, 0), member
);
7700 rhs
= TREE_OPERAND (rhs
, 1);
7701 if (BASELINK_P (rhs
))
7702 return instantiate_type (lhstype
, rhs
, flags_in
);
7704 /* This can happen if we are forming a pointer-to-member for a
7706 gcc_assert (TREE_CODE (rhs
) == TEMPLATE_ID_EXPR
);
7710 case TEMPLATE_ID_EXPR
:
7712 tree fns
= TREE_OPERAND (rhs
, 0);
7713 tree args
= TREE_OPERAND (rhs
, 1);
7716 resolve_address_of_overloaded_function (lhstype
, fns
, flags_in
,
7717 /*template_only=*/true,
7724 resolve_address_of_overloaded_function (lhstype
, rhs
, flags_in
,
7725 /*template_only=*/false,
7726 /*explicit_targs=*/NULL_TREE
,
7731 if (PTRMEM_OK_P (rhs
))
7732 flags
|= tf_ptrmem_ok
;
7734 return instantiate_type (lhstype
, TREE_OPERAND (rhs
, 0), flags
);
7738 return error_mark_node
;
7743 return error_mark_node
;
7746 /* Return the name of the virtual function pointer field
7747 (as an IDENTIFIER_NODE) for the given TYPE. Note that
7748 this may have to look back through base types to find the
7749 ultimate field name. (For single inheritance, these could
7750 all be the same name. Who knows for multiple inheritance). */
7753 get_vfield_name (tree type
)
7755 tree binfo
, base_binfo
;
7758 for (binfo
= TYPE_BINFO (type
);
7759 BINFO_N_BASE_BINFOS (binfo
);
7762 base_binfo
= BINFO_BASE_BINFO (binfo
, 0);
7764 if (BINFO_VIRTUAL_P (base_binfo
)
7765 || !TYPE_CONTAINS_VPTR_P (BINFO_TYPE (base_binfo
)))
7769 type
= BINFO_TYPE (binfo
);
7770 buf
= (char *) alloca (sizeof (VFIELD_NAME_FORMAT
)
7771 + TYPE_NAME_LENGTH (type
) + 2);
7772 sprintf (buf
, VFIELD_NAME_FORMAT
,
7773 IDENTIFIER_POINTER (constructor_name (type
)));
7774 return get_identifier (buf
);
7778 print_class_statistics (void)
7780 if (! GATHER_STATISTICS
)
7783 fprintf (stderr
, "convert_harshness = %d\n", n_convert_harshness
);
7784 fprintf (stderr
, "compute_conversion_costs = %d\n", n_compute_conversion_costs
);
7787 fprintf (stderr
, "vtables = %d; vtable searches = %d\n",
7788 n_vtables
, n_vtable_searches
);
7789 fprintf (stderr
, "vtable entries = %d; vtable elems = %d\n",
7790 n_vtable_entries
, n_vtable_elems
);
7794 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
7795 according to [class]:
7796 The class-name is also inserted
7797 into the scope of the class itself. For purposes of access checking,
7798 the inserted class name is treated as if it were a public member name. */
7801 build_self_reference (void)
7803 tree name
= constructor_name (current_class_type
);
7804 tree value
= build_lang_decl (TYPE_DECL
, name
, current_class_type
);
7807 DECL_NONLOCAL (value
) = 1;
7808 DECL_CONTEXT (value
) = current_class_type
;
7809 DECL_ARTIFICIAL (value
) = 1;
7810 SET_DECL_SELF_REFERENCE_P (value
);
7811 set_underlying_type (value
);
7813 if (processing_template_decl
)
7814 value
= push_template_decl (value
);
7816 saved_cas
= current_access_specifier
;
7817 current_access_specifier
= access_public_node
;
7818 finish_member_declaration (value
);
7819 current_access_specifier
= saved_cas
;
7822 /* Returns 1 if TYPE contains only padding bytes. */
7825 is_empty_class (tree type
)
7827 if (type
== error_mark_node
)
7830 if (! CLASS_TYPE_P (type
))
7833 return CLASSTYPE_EMPTY_P (type
);
7836 /* Returns true if TYPE contains no actual data, just various
7837 possible combinations of empty classes and possibly a vptr. */
7840 is_really_empty_class (tree type
)
7842 if (CLASS_TYPE_P (type
))
7849 /* CLASSTYPE_EMPTY_P isn't set properly until the class is actually laid
7850 out, but we'd like to be able to check this before then. */
7851 if (COMPLETE_TYPE_P (type
) && is_empty_class (type
))
7854 for (binfo
= TYPE_BINFO (type
), i
= 0;
7855 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
7856 if (!is_really_empty_class (BINFO_TYPE (base_binfo
)))
7858 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
7859 if (TREE_CODE (field
) == FIELD_DECL
7860 && !DECL_ARTIFICIAL (field
)
7861 && !is_really_empty_class (TREE_TYPE (field
)))
7865 else if (TREE_CODE (type
) == ARRAY_TYPE
)
7866 return is_really_empty_class (TREE_TYPE (type
));
7870 /* Note that NAME was looked up while the current class was being
7871 defined and that the result of that lookup was DECL. */
7874 maybe_note_name_used_in_class (tree name
, tree decl
)
7876 splay_tree names_used
;
7878 /* If we're not defining a class, there's nothing to do. */
7879 if (!(innermost_scope_kind() == sk_class
7880 && TYPE_BEING_DEFINED (current_class_type
)
7881 && !LAMBDA_TYPE_P (current_class_type
)))
7884 /* If there's already a binding for this NAME, then we don't have
7885 anything to worry about. */
7886 if (lookup_member (current_class_type
, name
,
7887 /*protect=*/0, /*want_type=*/false, tf_warning_or_error
))
7890 if (!current_class_stack
[current_class_depth
- 1].names_used
)
7891 current_class_stack
[current_class_depth
- 1].names_used
7892 = splay_tree_new (splay_tree_compare_pointers
, 0, 0);
7893 names_used
= current_class_stack
[current_class_depth
- 1].names_used
;
7895 splay_tree_insert (names_used
,
7896 (splay_tree_key
) name
,
7897 (splay_tree_value
) decl
);
7900 /* Note that NAME was declared (as DECL) in the current class. Check
7901 to see that the declaration is valid. */
7904 note_name_declared_in_class (tree name
, tree decl
)
7906 splay_tree names_used
;
7909 /* Look to see if we ever used this name. */
7911 = current_class_stack
[current_class_depth
- 1].names_used
;
7914 /* The C language allows members to be declared with a type of the same
7915 name, and the C++ standard says this diagnostic is not required. So
7916 allow it in extern "C" blocks unless predantic is specified.
7917 Allow it in all cases if -ms-extensions is specified. */
7918 if ((!pedantic
&& current_lang_name
== lang_name_c
)
7919 || flag_ms_extensions
)
7921 n
= splay_tree_lookup (names_used
, (splay_tree_key
) name
);
7924 /* [basic.scope.class]
7926 A name N used in a class S shall refer to the same declaration
7927 in its context and when re-evaluated in the completed scope of
7929 permerror (input_location
, "declaration of %q#D", decl
);
7930 permerror (input_location
, "changes meaning of %qD from %q+#D",
7931 DECL_NAME (OVL_CURRENT (decl
)), (tree
) n
->value
);
7935 /* Returns the VAR_DECL for the complete vtable associated with BINFO.
7936 Secondary vtables are merged with primary vtables; this function
7937 will return the VAR_DECL for the primary vtable. */
7940 get_vtbl_decl_for_binfo (tree binfo
)
7944 decl
= BINFO_VTABLE (binfo
);
7945 if (decl
&& TREE_CODE (decl
) == POINTER_PLUS_EXPR
)
7947 gcc_assert (TREE_CODE (TREE_OPERAND (decl
, 0)) == ADDR_EXPR
);
7948 decl
= TREE_OPERAND (TREE_OPERAND (decl
, 0), 0);
7951 gcc_assert (VAR_P (decl
));
7956 /* Returns the binfo for the primary base of BINFO. If the resulting
7957 BINFO is a virtual base, and it is inherited elsewhere in the
7958 hierarchy, then the returned binfo might not be the primary base of
7959 BINFO in the complete object. Check BINFO_PRIMARY_P or
7960 BINFO_LOST_PRIMARY_P to be sure. */
7963 get_primary_binfo (tree binfo
)
7967 primary_base
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (binfo
));
7971 return copied_binfo (primary_base
, binfo
);
7974 /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */
7977 maybe_indent_hierarchy (FILE * stream
, int indent
, int indented_p
)
7980 fprintf (stream
, "%*s", indent
, "");
7984 /* Dump the offsets of all the bases rooted at BINFO to STREAM.
7985 INDENT should be zero when called from the top level; it is
7986 incremented recursively. IGO indicates the next expected BINFO in
7987 inheritance graph ordering. */
7990 dump_class_hierarchy_r (FILE *stream
,
8000 indented
= maybe_indent_hierarchy (stream
, indent
, 0);
8001 fprintf (stream
, "%s (0x" HOST_WIDE_INT_PRINT_HEX
") ",
8002 type_as_string (BINFO_TYPE (binfo
), TFF_PLAIN_IDENTIFIER
),
8003 (HOST_WIDE_INT
) (uintptr_t) binfo
);
8006 fprintf (stream
, "alternative-path\n");
8009 igo
= TREE_CHAIN (binfo
);
8011 fprintf (stream
, HOST_WIDE_INT_PRINT_DEC
,
8012 tree_to_shwi (BINFO_OFFSET (binfo
)));
8013 if (is_empty_class (BINFO_TYPE (binfo
)))
8014 fprintf (stream
, " empty");
8015 else if (CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (binfo
)))
8016 fprintf (stream
, " nearly-empty");
8017 if (BINFO_VIRTUAL_P (binfo
))
8018 fprintf (stream
, " virtual");
8019 fprintf (stream
, "\n");
8022 if (BINFO_PRIMARY_P (binfo
))
8024 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8025 fprintf (stream
, " primary-for %s (0x" HOST_WIDE_INT_PRINT_HEX
")",
8026 type_as_string (BINFO_TYPE (BINFO_INHERITANCE_CHAIN (binfo
)),
8027 TFF_PLAIN_IDENTIFIER
),
8028 (HOST_WIDE_INT
) (uintptr_t) BINFO_INHERITANCE_CHAIN (binfo
));
8030 if (BINFO_LOST_PRIMARY_P (binfo
))
8032 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8033 fprintf (stream
, " lost-primary");
8036 fprintf (stream
, "\n");
8038 if (!(flags
& TDF_SLIM
))
8042 if (BINFO_SUBVTT_INDEX (binfo
))
8044 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8045 fprintf (stream
, " subvttidx=%s",
8046 expr_as_string (BINFO_SUBVTT_INDEX (binfo
),
8047 TFF_PLAIN_IDENTIFIER
));
8049 if (BINFO_VPTR_INDEX (binfo
))
8051 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8052 fprintf (stream
, " vptridx=%s",
8053 expr_as_string (BINFO_VPTR_INDEX (binfo
),
8054 TFF_PLAIN_IDENTIFIER
));
8056 if (BINFO_VPTR_FIELD (binfo
))
8058 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8059 fprintf (stream
, " vbaseoffset=%s",
8060 expr_as_string (BINFO_VPTR_FIELD (binfo
),
8061 TFF_PLAIN_IDENTIFIER
));
8063 if (BINFO_VTABLE (binfo
))
8065 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8066 fprintf (stream
, " vptr=%s",
8067 expr_as_string (BINFO_VTABLE (binfo
),
8068 TFF_PLAIN_IDENTIFIER
));
8072 fprintf (stream
, "\n");
8075 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
8076 igo
= dump_class_hierarchy_r (stream
, flags
, base_binfo
, igo
, indent
+ 2);
8081 /* Dump the BINFO hierarchy for T. */
8084 dump_class_hierarchy_1 (FILE *stream
, int flags
, tree t
)
8086 fprintf (stream
, "Class %s\n", type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8087 fprintf (stream
, " size=%lu align=%lu\n",
8088 (unsigned long)(tree_to_shwi (TYPE_SIZE (t
)) / BITS_PER_UNIT
),
8089 (unsigned long)(TYPE_ALIGN (t
) / BITS_PER_UNIT
));
8090 fprintf (stream
, " base size=%lu base align=%lu\n",
8091 (unsigned long)(tree_to_shwi (TYPE_SIZE (CLASSTYPE_AS_BASE (t
)))
8093 (unsigned long)(TYPE_ALIGN (CLASSTYPE_AS_BASE (t
))
8095 dump_class_hierarchy_r (stream
, flags
, TYPE_BINFO (t
), TYPE_BINFO (t
), 0);
8096 fprintf (stream
, "\n");
8099 /* Debug interface to hierarchy dumping. */
8102 debug_class (tree t
)
8104 dump_class_hierarchy_1 (stderr
, TDF_SLIM
, t
);
8108 dump_class_hierarchy (tree t
)
8111 FILE *stream
= get_dump_info (TDI_class
, &flags
);
8115 dump_class_hierarchy_1 (stream
, flags
, t
);
8120 dump_array (FILE * stream
, tree decl
)
8123 unsigned HOST_WIDE_INT ix
;
8125 tree size
= TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (decl
)));
8127 elt
= (tree_to_shwi (TYPE_SIZE (TREE_TYPE (TREE_TYPE (decl
))))
8129 fprintf (stream
, "%s:", decl_as_string (decl
, TFF_PLAIN_IDENTIFIER
));
8130 fprintf (stream
, " %s entries",
8131 expr_as_string (size_binop (PLUS_EXPR
, size
, size_one_node
),
8132 TFF_PLAIN_IDENTIFIER
));
8133 fprintf (stream
, "\n");
8135 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (DECL_INITIAL (decl
)),
8137 fprintf (stream
, "%-4ld %s\n", (long)(ix
* elt
),
8138 expr_as_string (value
, TFF_PLAIN_IDENTIFIER
));
8142 dump_vtable (tree t
, tree binfo
, tree vtable
)
8145 FILE *stream
= get_dump_info (TDI_class
, &flags
);
8150 if (!(flags
& TDF_SLIM
))
8152 int ctor_vtbl_p
= TYPE_BINFO (t
) != binfo
;
8154 fprintf (stream
, "%s for %s",
8155 ctor_vtbl_p
? "Construction vtable" : "Vtable",
8156 type_as_string (BINFO_TYPE (binfo
), TFF_PLAIN_IDENTIFIER
));
8159 if (!BINFO_VIRTUAL_P (binfo
))
8160 fprintf (stream
, " (0x" HOST_WIDE_INT_PRINT_HEX
" instance)",
8161 (HOST_WIDE_INT
) (uintptr_t) binfo
);
8162 fprintf (stream
, " in %s", type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8164 fprintf (stream
, "\n");
8165 dump_array (stream
, vtable
);
8166 fprintf (stream
, "\n");
8171 dump_vtt (tree t
, tree vtt
)
8174 FILE *stream
= get_dump_info (TDI_class
, &flags
);
8179 if (!(flags
& TDF_SLIM
))
8181 fprintf (stream
, "VTT for %s\n",
8182 type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8183 dump_array (stream
, vtt
);
8184 fprintf (stream
, "\n");
8188 /* Dump a function or thunk and its thunkees. */
8191 dump_thunk (FILE *stream
, int indent
, tree thunk
)
8193 static const char spaces
[] = " ";
8194 tree name
= DECL_NAME (thunk
);
8197 fprintf (stream
, "%.*s%p %s %s", indent
, spaces
,
8199 !DECL_THUNK_P (thunk
) ? "function"
8200 : DECL_THIS_THUNK_P (thunk
) ? "this-thunk" : "covariant-thunk",
8201 name
? IDENTIFIER_POINTER (name
) : "<unset>");
8202 if (DECL_THUNK_P (thunk
))
8204 HOST_WIDE_INT fixed_adjust
= THUNK_FIXED_OFFSET (thunk
);
8205 tree virtual_adjust
= THUNK_VIRTUAL_OFFSET (thunk
);
8207 fprintf (stream
, " fixed=" HOST_WIDE_INT_PRINT_DEC
, fixed_adjust
);
8208 if (!virtual_adjust
)
8210 else if (DECL_THIS_THUNK_P (thunk
))
8211 fprintf (stream
, " vcall=" HOST_WIDE_INT_PRINT_DEC
,
8212 tree_to_shwi (virtual_adjust
));
8214 fprintf (stream
, " vbase=" HOST_WIDE_INT_PRINT_DEC
"(%s)",
8215 tree_to_shwi (BINFO_VPTR_FIELD (virtual_adjust
)),
8216 type_as_string (BINFO_TYPE (virtual_adjust
), TFF_SCOPE
));
8217 if (THUNK_ALIAS (thunk
))
8218 fprintf (stream
, " alias to %p", (void *)THUNK_ALIAS (thunk
));
8220 fprintf (stream
, "\n");
8221 for (thunks
= DECL_THUNKS (thunk
); thunks
; thunks
= TREE_CHAIN (thunks
))
8222 dump_thunk (stream
, indent
+ 2, thunks
);
8225 /* Dump the thunks for FN. */
8228 debug_thunks (tree fn
)
8230 dump_thunk (stderr
, 0, fn
);
8233 /* Virtual function table initialization. */
8235 /* Create all the necessary vtables for T and its base classes. */
8238 finish_vtbls (tree t
)
8241 vec
<constructor_elt
, va_gc
> *v
= NULL
;
8242 tree vtable
= BINFO_VTABLE (TYPE_BINFO (t
));
8244 /* We lay out the primary and secondary vtables in one contiguous
8245 vtable. The primary vtable is first, followed by the non-virtual
8246 secondary vtables in inheritance graph order. */
8247 accumulate_vtbl_inits (TYPE_BINFO (t
), TYPE_BINFO (t
), TYPE_BINFO (t
),
8250 /* Then come the virtual bases, also in inheritance graph order. */
8251 for (vbase
= TYPE_BINFO (t
); vbase
; vbase
= TREE_CHAIN (vbase
))
8253 if (!BINFO_VIRTUAL_P (vbase
))
8255 accumulate_vtbl_inits (vbase
, vbase
, TYPE_BINFO (t
), vtable
, t
, &v
);
8258 if (BINFO_VTABLE (TYPE_BINFO (t
)))
8259 initialize_vtable (TYPE_BINFO (t
), v
);
8262 /* Initialize the vtable for BINFO with the INITS. */
8265 initialize_vtable (tree binfo
, vec
<constructor_elt
, va_gc
> *inits
)
8269 layout_vtable_decl (binfo
, vec_safe_length (inits
));
8270 decl
= get_vtbl_decl_for_binfo (binfo
);
8271 initialize_artificial_var (decl
, inits
);
8272 dump_vtable (BINFO_TYPE (binfo
), binfo
, decl
);
8275 /* Build the VTT (virtual table table) for T.
8276 A class requires a VTT if it has virtual bases.
8279 1 - primary virtual pointer for complete object T
8280 2 - secondary VTTs for each direct non-virtual base of T which requires a
8282 3 - secondary virtual pointers for each direct or indirect base of T which
8283 has virtual bases or is reachable via a virtual path from T.
8284 4 - secondary VTTs for each direct or indirect virtual base of T.
8286 Secondary VTTs look like complete object VTTs without part 4. */
8294 vec
<constructor_elt
, va_gc
> *inits
;
8296 /* Build up the initializers for the VTT. */
8298 index
= size_zero_node
;
8299 build_vtt_inits (TYPE_BINFO (t
), t
, &inits
, &index
);
8301 /* If we didn't need a VTT, we're done. */
8305 /* Figure out the type of the VTT. */
8306 type
= build_array_of_n_type (const_ptr_type_node
,
8309 /* Now, build the VTT object itself. */
8310 vtt
= build_vtable (t
, mangle_vtt_for_type (t
), type
);
8311 initialize_artificial_var (vtt
, inits
);
8312 /* Add the VTT to the vtables list. */
8313 DECL_CHAIN (vtt
) = DECL_CHAIN (CLASSTYPE_VTABLES (t
));
8314 DECL_CHAIN (CLASSTYPE_VTABLES (t
)) = vtt
;
8319 /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with
8320 PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo,
8321 and CHAIN the vtable pointer for this binfo after construction is
8322 complete. VALUE can also be another BINFO, in which case we recurse. */
8325 binfo_ctor_vtable (tree binfo
)
8331 vt
= BINFO_VTABLE (binfo
);
8332 if (TREE_CODE (vt
) == TREE_LIST
)
8333 vt
= TREE_VALUE (vt
);
8334 if (TREE_CODE (vt
) == TREE_BINFO
)
8343 /* Data for secondary VTT initialization. */
8344 typedef struct secondary_vptr_vtt_init_data_s
8346 /* Is this the primary VTT? */
8349 /* Current index into the VTT. */
8352 /* Vector of initializers built up. */
8353 vec
<constructor_elt
, va_gc
> *inits
;
8355 /* The type being constructed by this secondary VTT. */
8356 tree type_being_constructed
;
8357 } secondary_vptr_vtt_init_data
;
8359 /* Recursively build the VTT-initializer for BINFO (which is in the
8360 hierarchy dominated by T). INITS points to the end of the initializer
8361 list to date. INDEX is the VTT index where the next element will be
8362 replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e.
8363 not a subvtt for some base of T). When that is so, we emit the sub-VTTs
8364 for virtual bases of T. When it is not so, we build the constructor
8365 vtables for the BINFO-in-T variant. */
8368 build_vtt_inits (tree binfo
, tree t
, vec
<constructor_elt
, va_gc
> **inits
,
8374 secondary_vptr_vtt_init_data data
;
8375 int top_level_p
= SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
);
8377 /* We only need VTTs for subobjects with virtual bases. */
8378 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
)))
8381 /* We need to use a construction vtable if this is not the primary
8385 build_ctor_vtbl_group (binfo
, t
);
8387 /* Record the offset in the VTT where this sub-VTT can be found. */
8388 BINFO_SUBVTT_INDEX (binfo
) = *index
;
8391 /* Add the address of the primary vtable for the complete object. */
8392 init
= binfo_ctor_vtable (binfo
);
8393 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
8396 gcc_assert (!BINFO_VPTR_INDEX (binfo
));
8397 BINFO_VPTR_INDEX (binfo
) = *index
;
8399 *index
= size_binop (PLUS_EXPR
, *index
, TYPE_SIZE_UNIT (ptr_type_node
));
8401 /* Recursively add the secondary VTTs for non-virtual bases. */
8402 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, b
); ++i
)
8403 if (!BINFO_VIRTUAL_P (b
))
8404 build_vtt_inits (b
, t
, inits
, index
);
8406 /* Add secondary virtual pointers for all subobjects of BINFO with
8407 either virtual bases or reachable along a virtual path, except
8408 subobjects that are non-virtual primary bases. */
8409 data
.top_level_p
= top_level_p
;
8410 data
.index
= *index
;
8411 data
.inits
= *inits
;
8412 data
.type_being_constructed
= BINFO_TYPE (binfo
);
8414 dfs_walk_once (binfo
, dfs_build_secondary_vptr_vtt_inits
, NULL
, &data
);
8416 *index
= data
.index
;
8418 /* data.inits might have grown as we added secondary virtual pointers.
8419 Make sure our caller knows about the new vector. */
8420 *inits
= data
.inits
;
8423 /* Add the secondary VTTs for virtual bases in inheritance graph
8425 for (b
= TYPE_BINFO (BINFO_TYPE (binfo
)); b
; b
= TREE_CHAIN (b
))
8427 if (!BINFO_VIRTUAL_P (b
))
8430 build_vtt_inits (b
, t
, inits
, index
);
8433 /* Remove the ctor vtables we created. */
8434 dfs_walk_all (binfo
, dfs_fixup_binfo_vtbls
, NULL
, binfo
);
8437 /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base
8438 in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */
8441 dfs_build_secondary_vptr_vtt_inits (tree binfo
, void *data_
)
8443 secondary_vptr_vtt_init_data
*data
= (secondary_vptr_vtt_init_data
*)data_
;
8445 /* We don't care about bases that don't have vtables. */
8446 if (!TYPE_VFIELD (BINFO_TYPE (binfo
)))
8447 return dfs_skip_bases
;
8449 /* We're only interested in proper subobjects of the type being
8451 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), data
->type_being_constructed
))
8454 /* We're only interested in bases with virtual bases or reachable
8455 via a virtual path from the type being constructed. */
8456 if (!(CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
))
8457 || binfo_via_virtual (binfo
, data
->type_being_constructed
)))
8458 return dfs_skip_bases
;
8460 /* We're not interested in non-virtual primary bases. */
8461 if (!BINFO_VIRTUAL_P (binfo
) && BINFO_PRIMARY_P (binfo
))
8464 /* Record the index where this secondary vptr can be found. */
8465 if (data
->top_level_p
)
8467 gcc_assert (!BINFO_VPTR_INDEX (binfo
));
8468 BINFO_VPTR_INDEX (binfo
) = data
->index
;
8470 if (BINFO_VIRTUAL_P (binfo
))
8472 /* It's a primary virtual base, and this is not a
8473 construction vtable. Find the base this is primary of in
8474 the inheritance graph, and use that base's vtable
8476 while (BINFO_PRIMARY_P (binfo
))
8477 binfo
= BINFO_INHERITANCE_CHAIN (binfo
);
8481 /* Add the initializer for the secondary vptr itself. */
8482 CONSTRUCTOR_APPEND_ELT (data
->inits
, NULL_TREE
, binfo_ctor_vtable (binfo
));
8484 /* Advance the vtt index. */
8485 data
->index
= size_binop (PLUS_EXPR
, data
->index
,
8486 TYPE_SIZE_UNIT (ptr_type_node
));
8491 /* Called from build_vtt_inits via dfs_walk. After building
8492 constructor vtables and generating the sub-vtt from them, we need
8493 to restore the BINFO_VTABLES that were scribbled on. DATA is the
8494 binfo of the base whose sub vtt was generated. */
8497 dfs_fixup_binfo_vtbls (tree binfo
, void* data
)
8499 tree vtable
= BINFO_VTABLE (binfo
);
8501 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
8502 /* If this class has no vtable, none of its bases do. */
8503 return dfs_skip_bases
;
8506 /* This might be a primary base, so have no vtable in this
8510 /* If we scribbled the construction vtable vptr into BINFO, clear it
8512 if (TREE_CODE (vtable
) == TREE_LIST
8513 && (TREE_PURPOSE (vtable
) == (tree
) data
))
8514 BINFO_VTABLE (binfo
) = TREE_CHAIN (vtable
);
8519 /* Build the construction vtable group for BINFO which is in the
8520 hierarchy dominated by T. */
8523 build_ctor_vtbl_group (tree binfo
, tree t
)
8529 vec
<constructor_elt
, va_gc
> *v
;
8531 /* See if we've already created this construction vtable group. */
8532 id
= mangle_ctor_vtbl_for_type (t
, binfo
);
8533 if (IDENTIFIER_GLOBAL_VALUE (id
))
8536 gcc_assert (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
));
8537 /* Build a version of VTBL (with the wrong type) for use in
8538 constructing the addresses of secondary vtables in the
8539 construction vtable group. */
8540 vtbl
= build_vtable (t
, id
, ptr_type_node
);
8541 DECL_CONSTRUCTION_VTABLE_P (vtbl
) = 1;
8542 /* Don't export construction vtables from shared libraries. Even on
8543 targets that don't support hidden visibility, this tells
8544 can_refer_decl_in_current_unit_p not to assume that it's safe to
8545 access from a different compilation unit (bz 54314). */
8546 DECL_VISIBILITY (vtbl
) = VISIBILITY_HIDDEN
;
8547 DECL_VISIBILITY_SPECIFIED (vtbl
) = true;
8550 accumulate_vtbl_inits (binfo
, TYPE_BINFO (TREE_TYPE (binfo
)),
8551 binfo
, vtbl
, t
, &v
);
8553 /* Add the vtables for each of our virtual bases using the vbase in T
8555 for (vbase
= TYPE_BINFO (BINFO_TYPE (binfo
));
8557 vbase
= TREE_CHAIN (vbase
))
8561 if (!BINFO_VIRTUAL_P (vbase
))
8563 b
= copied_binfo (vbase
, binfo
);
8565 accumulate_vtbl_inits (b
, vbase
, binfo
, vtbl
, t
, &v
);
8568 /* Figure out the type of the construction vtable. */
8569 type
= build_array_of_n_type (vtable_entry_type
, v
->length ());
8571 TREE_TYPE (vtbl
) = type
;
8572 DECL_SIZE (vtbl
) = DECL_SIZE_UNIT (vtbl
) = NULL_TREE
;
8573 layout_decl (vtbl
, 0);
8575 /* Initialize the construction vtable. */
8576 CLASSTYPE_VTABLES (t
) = chainon (CLASSTYPE_VTABLES (t
), vtbl
);
8577 initialize_artificial_var (vtbl
, v
);
8578 dump_vtable (t
, binfo
, vtbl
);
8581 /* Add the vtbl initializers for BINFO (and its bases other than
8582 non-virtual primaries) to the list of INITS. BINFO is in the
8583 hierarchy dominated by T. RTTI_BINFO is the binfo within T of
8584 the constructor the vtbl inits should be accumulated for. (If this
8585 is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).)
8586 ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO).
8587 BINFO is the active base equivalent of ORIG_BINFO in the inheritance
8588 graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE,
8589 but are not necessarily the same in terms of layout. */
8592 accumulate_vtbl_inits (tree binfo
,
8597 vec
<constructor_elt
, va_gc
> **inits
)
8601 int ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8603 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), BINFO_TYPE (orig_binfo
)));
8605 /* If it doesn't have a vptr, we don't do anything. */
8606 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
8609 /* If we're building a construction vtable, we're not interested in
8610 subobjects that don't require construction vtables. */
8612 && !CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
))
8613 && !binfo_via_virtual (orig_binfo
, BINFO_TYPE (rtti_binfo
)))
8616 /* Build the initializers for the BINFO-in-T vtable. */
8617 dfs_accumulate_vtbl_inits (binfo
, orig_binfo
, rtti_binfo
, vtbl
, t
, inits
);
8619 /* Walk the BINFO and its bases. We walk in preorder so that as we
8620 initialize each vtable we can figure out at what offset the
8621 secondary vtable lies from the primary vtable. We can't use
8622 dfs_walk here because we need to iterate through bases of BINFO
8623 and RTTI_BINFO simultaneously. */
8624 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
8626 /* Skip virtual bases. */
8627 if (BINFO_VIRTUAL_P (base_binfo
))
8629 accumulate_vtbl_inits (base_binfo
,
8630 BINFO_BASE_BINFO (orig_binfo
, i
),
8631 rtti_binfo
, vtbl
, t
,
8636 /* Called from accumulate_vtbl_inits. Adds the initializers for the
8637 BINFO vtable to L. */
8640 dfs_accumulate_vtbl_inits (tree binfo
,
8645 vec
<constructor_elt
, va_gc
> **l
)
8647 tree vtbl
= NULL_TREE
;
8648 int ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8652 && BINFO_VIRTUAL_P (orig_binfo
) && BINFO_PRIMARY_P (orig_binfo
))
8654 /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a
8655 primary virtual base. If it is not the same primary in
8656 the hierarchy of T, we'll need to generate a ctor vtable
8657 for it, to place at its location in T. If it is the same
8658 primary, we still need a VTT entry for the vtable, but it
8659 should point to the ctor vtable for the base it is a
8660 primary for within the sub-hierarchy of RTTI_BINFO.
8662 There are three possible cases:
8664 1) We are in the same place.
8665 2) We are a primary base within a lost primary virtual base of
8667 3) We are primary to something not a base of RTTI_BINFO. */
8670 tree last
= NULL_TREE
;
8672 /* First, look through the bases we are primary to for RTTI_BINFO
8673 or a virtual base. */
8675 while (BINFO_PRIMARY_P (b
))
8677 b
= BINFO_INHERITANCE_CHAIN (b
);
8679 if (BINFO_VIRTUAL_P (b
) || b
== rtti_binfo
)
8682 /* If we run out of primary links, keep looking down our
8683 inheritance chain; we might be an indirect primary. */
8684 for (b
= last
; b
; b
= BINFO_INHERITANCE_CHAIN (b
))
8685 if (BINFO_VIRTUAL_P (b
) || b
== rtti_binfo
)
8689 /* If we found RTTI_BINFO, this is case 1. If we found a virtual
8690 base B and it is a base of RTTI_BINFO, this is case 2. In
8691 either case, we share our vtable with LAST, i.e. the
8692 derived-most base within B of which we are a primary. */
8694 || (b
&& binfo_for_vbase (BINFO_TYPE (b
), BINFO_TYPE (rtti_binfo
))))
8695 /* Just set our BINFO_VTABLE to point to LAST, as we may not have
8696 set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in
8697 binfo_ctor_vtable after everything's been set up. */
8700 /* Otherwise, this is case 3 and we get our own. */
8702 else if (!BINFO_NEW_VTABLE_MARKED (orig_binfo
))
8705 n_inits
= vec_safe_length (*l
);
8712 /* Add the initializer for this vtable. */
8713 build_vtbl_initializer (binfo
, orig_binfo
, t
, rtti_binfo
,
8714 &non_fn_entries
, l
);
8716 /* Figure out the position to which the VPTR should point. */
8717 vtbl
= build1 (ADDR_EXPR
, vtbl_ptr_type_node
, orig_vtbl
);
8718 index
= size_binop (MULT_EXPR
,
8719 TYPE_SIZE_UNIT (vtable_entry_type
),
8720 size_int (non_fn_entries
+ n_inits
));
8721 vtbl
= fold_build_pointer_plus (vtbl
, index
);
8725 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
8726 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
8727 straighten this out. */
8728 BINFO_VTABLE (binfo
) = tree_cons (rtti_binfo
, vtbl
, BINFO_VTABLE (binfo
));
8729 else if (BINFO_PRIMARY_P (binfo
) && BINFO_VIRTUAL_P (binfo
))
8730 /* Throw away any unneeded intializers. */
8731 (*l
)->truncate (n_inits
);
8733 /* For an ordinary vtable, set BINFO_VTABLE. */
8734 BINFO_VTABLE (binfo
) = vtbl
;
8737 static GTY(()) tree abort_fndecl_addr
;
8739 /* Construct the initializer for BINFO's virtual function table. BINFO
8740 is part of the hierarchy dominated by T. If we're building a
8741 construction vtable, the ORIG_BINFO is the binfo we should use to
8742 find the actual function pointers to put in the vtable - but they
8743 can be overridden on the path to most-derived in the graph that
8744 ORIG_BINFO belongs. Otherwise,
8745 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
8746 BINFO that should be indicated by the RTTI information in the
8747 vtable; it will be a base class of T, rather than T itself, if we
8748 are building a construction vtable.
8750 The value returned is a TREE_LIST suitable for wrapping in a
8751 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
8752 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
8753 number of non-function entries in the vtable.
8755 It might seem that this function should never be called with a
8756 BINFO for which BINFO_PRIMARY_P holds, the vtable for such a
8757 base is always subsumed by a derived class vtable. However, when
8758 we are building construction vtables, we do build vtables for
8759 primary bases; we need these while the primary base is being
8763 build_vtbl_initializer (tree binfo
,
8767 int* non_fn_entries_p
,
8768 vec
<constructor_elt
, va_gc
> **inits
)
8774 vec
<tree
, va_gc
> *vbases
;
8777 /* Initialize VID. */
8778 memset (&vid
, 0, sizeof (vid
));
8781 vid
.rtti_binfo
= rtti_binfo
;
8782 vid
.primary_vtbl_p
= SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
);
8783 vid
.ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8784 vid
.generate_vcall_entries
= true;
8785 /* The first vbase or vcall offset is at index -3 in the vtable. */
8786 vid
.index
= ssize_int(-3 * TARGET_VTABLE_DATA_ENTRY_DISTANCE
);
8788 /* Add entries to the vtable for RTTI. */
8789 build_rtti_vtbl_entries (binfo
, &vid
);
8791 /* Create an array for keeping track of the functions we've
8792 processed. When we see multiple functions with the same
8793 signature, we share the vcall offsets. */
8794 vec_alloc (vid
.fns
, 32);
8795 /* Add the vcall and vbase offset entries. */
8796 build_vcall_and_vbase_vtbl_entries (binfo
, &vid
);
8798 /* Clear BINFO_VTABLE_PATH_MARKED; it's set by
8799 build_vbase_offset_vtbl_entries. */
8800 for (vbases
= CLASSTYPE_VBASECLASSES (t
), ix
= 0;
8801 vec_safe_iterate (vbases
, ix
, &vbinfo
); ix
++)
8802 BINFO_VTABLE_PATH_MARKED (vbinfo
) = 0;
8804 /* If the target requires padding between data entries, add that now. */
8805 if (TARGET_VTABLE_DATA_ENTRY_DISTANCE
> 1)
8807 int n_entries
= vec_safe_length (vid
.inits
);
8809 vec_safe_grow (vid
.inits
, TARGET_VTABLE_DATA_ENTRY_DISTANCE
* n_entries
);
8811 /* Move data entries into their new positions and add padding
8812 after the new positions. Iterate backwards so we don't
8813 overwrite entries that we would need to process later. */
8814 for (ix
= n_entries
- 1;
8815 vid
.inits
->iterate (ix
, &e
);
8819 int new_position
= (TARGET_VTABLE_DATA_ENTRY_DISTANCE
* ix
8820 + (TARGET_VTABLE_DATA_ENTRY_DISTANCE
- 1));
8822 (*vid
.inits
)[new_position
] = *e
;
8824 for (j
= 1; j
< TARGET_VTABLE_DATA_ENTRY_DISTANCE
; ++j
)
8826 constructor_elt
*f
= &(*vid
.inits
)[new_position
- j
];
8827 f
->index
= NULL_TREE
;
8828 f
->value
= build1 (NOP_EXPR
, vtable_entry_type
,
8834 if (non_fn_entries_p
)
8835 *non_fn_entries_p
= vec_safe_length (vid
.inits
);
8837 /* The initializers for virtual functions were built up in reverse
8838 order. Straighten them out and add them to the running list in one
8840 jx
= vec_safe_length (*inits
);
8841 vec_safe_grow (*inits
, jx
+ vid
.inits
->length ());
8843 for (ix
= vid
.inits
->length () - 1;
8844 vid
.inits
->iterate (ix
, &e
);
8848 /* Go through all the ordinary virtual functions, building up
8850 for (v
= BINFO_VIRTUALS (orig_binfo
); v
; v
= TREE_CHAIN (v
))
8854 tree fn
, fn_original
;
8855 tree init
= NULL_TREE
;
8859 if (DECL_THUNK_P (fn
))
8861 if (!DECL_NAME (fn
))
8863 if (THUNK_ALIAS (fn
))
8865 fn
= THUNK_ALIAS (fn
);
8868 fn_original
= THUNK_TARGET (fn
);
8871 /* If the only definition of this function signature along our
8872 primary base chain is from a lost primary, this vtable slot will
8873 never be used, so just zero it out. This is important to avoid
8874 requiring extra thunks which cannot be generated with the function.
8876 We first check this in update_vtable_entry_for_fn, so we handle
8877 restored primary bases properly; we also need to do it here so we
8878 zero out unused slots in ctor vtables, rather than filling them
8879 with erroneous values (though harmless, apart from relocation
8881 if (BV_LOST_PRIMARY (v
))
8882 init
= size_zero_node
;
8886 /* Pull the offset for `this', and the function to call, out of
8888 delta
= BV_DELTA (v
);
8889 vcall_index
= BV_VCALL_INDEX (v
);
8891 gcc_assert (TREE_CODE (delta
) == INTEGER_CST
);
8892 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
8894 /* You can't call an abstract virtual function; it's abstract.
8895 So, we replace these functions with __pure_virtual. */
8896 if (DECL_PURE_VIRTUAL_P (fn_original
))
8899 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
8901 if (abort_fndecl_addr
== NULL
)
8903 = fold_convert (vfunc_ptr_type_node
,
8904 build_fold_addr_expr (fn
));
8905 init
= abort_fndecl_addr
;
8908 /* Likewise for deleted virtuals. */
8909 else if (DECL_DELETED_FN (fn_original
))
8911 fn
= get_identifier ("__cxa_deleted_virtual");
8912 if (!get_global_value_if_present (fn
, &fn
))
8913 fn
= push_library_fn (fn
, (build_function_type_list
8914 (void_type_node
, NULL_TREE
)),
8915 NULL_TREE
, ECF_NORETURN
);
8916 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
8917 init
= fold_convert (vfunc_ptr_type_node
,
8918 build_fold_addr_expr (fn
));
8922 if (!integer_zerop (delta
) || vcall_index
)
8924 fn
= make_thunk (fn
, /*this_adjusting=*/1, delta
, vcall_index
);
8925 if (!DECL_NAME (fn
))
8928 /* Take the address of the function, considering it to be of an
8929 appropriate generic type. */
8930 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
8931 init
= fold_convert (vfunc_ptr_type_node
,
8932 build_fold_addr_expr (fn
));
8933 /* Don't refer to a virtual destructor from a constructor
8934 vtable or a vtable for an abstract class, since destroying
8935 an object under construction is undefined behavior and we
8936 don't want it to be considered a candidate for speculative
8937 devirtualization. But do create the thunk for ABI
8939 if (DECL_DESTRUCTOR_P (fn_original
)
8940 && (CLASSTYPE_PURE_VIRTUALS (DECL_CONTEXT (fn_original
))
8941 || orig_binfo
!= binfo
))
8942 init
= size_zero_node
;
8946 /* And add it to the chain of initializers. */
8947 if (TARGET_VTABLE_USES_DESCRIPTORS
)
8950 if (init
== size_zero_node
)
8951 for (i
= 0; i
< TARGET_VTABLE_USES_DESCRIPTORS
; ++i
)
8952 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
8954 for (i
= 0; i
< TARGET_VTABLE_USES_DESCRIPTORS
; ++i
)
8956 tree fdesc
= build2 (FDESC_EXPR
, vfunc_ptr_type_node
,
8957 fn
, build_int_cst (NULL_TREE
, i
));
8958 TREE_CONSTANT (fdesc
) = 1;
8960 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, fdesc
);
8964 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
8968 /* Adds to vid->inits the initializers for the vbase and vcall
8969 offsets in BINFO, which is in the hierarchy dominated by T. */
8972 build_vcall_and_vbase_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
8976 /* If this is a derived class, we must first create entries
8977 corresponding to the primary base class. */
8978 b
= get_primary_binfo (binfo
);
8980 build_vcall_and_vbase_vtbl_entries (b
, vid
);
8982 /* Add the vbase entries for this base. */
8983 build_vbase_offset_vtbl_entries (binfo
, vid
);
8984 /* Add the vcall entries for this base. */
8985 build_vcall_offset_vtbl_entries (binfo
, vid
);
8988 /* Returns the initializers for the vbase offset entries in the vtable
8989 for BINFO (which is part of the class hierarchy dominated by T), in
8990 reverse order. VBASE_OFFSET_INDEX gives the vtable index
8991 where the next vbase offset will go. */
8994 build_vbase_offset_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
8998 tree non_primary_binfo
;
9000 /* If there are no virtual baseclasses, then there is nothing to
9002 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
)))
9007 /* We might be a primary base class. Go up the inheritance hierarchy
9008 until we find the most derived class of which we are a primary base:
9009 it is the offset of that which we need to use. */
9010 non_primary_binfo
= binfo
;
9011 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo
))
9015 /* If we have reached a virtual base, then it must be a primary
9016 base (possibly multi-level) of vid->binfo, or we wouldn't
9017 have called build_vcall_and_vbase_vtbl_entries for it. But it
9018 might be a lost primary, so just skip down to vid->binfo. */
9019 if (BINFO_VIRTUAL_P (non_primary_binfo
))
9021 non_primary_binfo
= vid
->binfo
;
9025 b
= BINFO_INHERITANCE_CHAIN (non_primary_binfo
);
9026 if (get_primary_binfo (b
) != non_primary_binfo
)
9028 non_primary_binfo
= b
;
9031 /* Go through the virtual bases, adding the offsets. */
9032 for (vbase
= TYPE_BINFO (BINFO_TYPE (binfo
));
9034 vbase
= TREE_CHAIN (vbase
))
9039 if (!BINFO_VIRTUAL_P (vbase
))
9042 /* Find the instance of this virtual base in the complete
9044 b
= copied_binfo (vbase
, binfo
);
9046 /* If we've already got an offset for this virtual base, we
9047 don't need another one. */
9048 if (BINFO_VTABLE_PATH_MARKED (b
))
9050 BINFO_VTABLE_PATH_MARKED (b
) = 1;
9052 /* Figure out where we can find this vbase offset. */
9053 delta
= size_binop (MULT_EXPR
,
9056 TYPE_SIZE_UNIT (vtable_entry_type
)));
9057 if (vid
->primary_vtbl_p
)
9058 BINFO_VPTR_FIELD (b
) = delta
;
9060 if (binfo
!= TYPE_BINFO (t
))
9061 /* The vbase offset had better be the same. */
9062 gcc_assert (tree_int_cst_equal (delta
, BINFO_VPTR_FIELD (vbase
)));
9064 /* The next vbase will come at a more negative offset. */
9065 vid
->index
= size_binop (MINUS_EXPR
, vid
->index
,
9066 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE
));
9068 /* The initializer is the delta from BINFO to this virtual base.
9069 The vbase offsets go in reverse inheritance-graph order, and
9070 we are walking in inheritance graph order so these end up in
9072 delta
= size_diffop_loc (input_location
,
9073 BINFO_OFFSET (b
), BINFO_OFFSET (non_primary_binfo
));
9075 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
,
9076 fold_build1_loc (input_location
, NOP_EXPR
,
9077 vtable_entry_type
, delta
));
9081 /* Adds the initializers for the vcall offset entries in the vtable
9082 for BINFO (which is part of the class hierarchy dominated by VID->DERIVED)
9086 build_vcall_offset_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9088 /* We only need these entries if this base is a virtual base. We
9089 compute the indices -- but do not add to the vtable -- when
9090 building the main vtable for a class. */
9091 if (binfo
== TYPE_BINFO (vid
->derived
)
9092 || (BINFO_VIRTUAL_P (binfo
)
9093 /* If BINFO is RTTI_BINFO, then (since BINFO does not
9094 correspond to VID->DERIVED), we are building a primary
9095 construction virtual table. Since this is a primary
9096 virtual table, we do not need the vcall offsets for
9098 && binfo
!= vid
->rtti_binfo
))
9100 /* We need a vcall offset for each of the virtual functions in this
9101 vtable. For example:
9103 class A { virtual void f (); };
9104 class B1 : virtual public A { virtual void f (); };
9105 class B2 : virtual public A { virtual void f (); };
9106 class C: public B1, public B2 { virtual void f (); };
9108 A C object has a primary base of B1, which has a primary base of A. A
9109 C also has a secondary base of B2, which no longer has a primary base
9110 of A. So the B2-in-C construction vtable needs a secondary vtable for
9111 A, which will adjust the A* to a B2* to call f. We have no way of
9112 knowing what (or even whether) this offset will be when we define B2,
9113 so we store this "vcall offset" in the A sub-vtable and look it up in
9114 a "virtual thunk" for B2::f.
9116 We need entries for all the functions in our primary vtable and
9117 in our non-virtual bases' secondary vtables. */
9119 /* If we are just computing the vcall indices -- but do not need
9120 the actual entries -- not that. */
9121 if (!BINFO_VIRTUAL_P (binfo
))
9122 vid
->generate_vcall_entries
= false;
9123 /* Now, walk through the non-virtual bases, adding vcall offsets. */
9124 add_vcall_offset_vtbl_entries_r (binfo
, vid
);
9128 /* Build vcall offsets, starting with those for BINFO. */
9131 add_vcall_offset_vtbl_entries_r (tree binfo
, vtbl_init_data
* vid
)
9137 /* Don't walk into virtual bases -- except, of course, for the
9138 virtual base for which we are building vcall offsets. Any
9139 primary virtual base will have already had its offsets generated
9140 through the recursion in build_vcall_and_vbase_vtbl_entries. */
9141 if (BINFO_VIRTUAL_P (binfo
) && vid
->vbase
!= binfo
)
9144 /* If BINFO has a primary base, process it first. */
9145 primary_binfo
= get_primary_binfo (binfo
);
9147 add_vcall_offset_vtbl_entries_r (primary_binfo
, vid
);
9149 /* Add BINFO itself to the list. */
9150 add_vcall_offset_vtbl_entries_1 (binfo
, vid
);
9152 /* Scan the non-primary bases of BINFO. */
9153 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
9154 if (base_binfo
!= primary_binfo
)
9155 add_vcall_offset_vtbl_entries_r (base_binfo
, vid
);
9158 /* Called from build_vcall_offset_vtbl_entries_r. */
9161 add_vcall_offset_vtbl_entries_1 (tree binfo
, vtbl_init_data
* vid
)
9163 /* Make entries for the rest of the virtuals. */
9166 /* The ABI requires that the methods be processed in declaration
9168 for (orig_fn
= TYPE_METHODS (BINFO_TYPE (binfo
));
9170 orig_fn
= DECL_CHAIN (orig_fn
))
9171 if (TREE_CODE (orig_fn
) == FUNCTION_DECL
&& DECL_VINDEX (orig_fn
))
9172 add_vcall_offset (orig_fn
, binfo
, vid
);
9175 /* Add a vcall offset entry for ORIG_FN to the vtable. */
9178 add_vcall_offset (tree orig_fn
, tree binfo
, vtbl_init_data
*vid
)
9184 /* If there is already an entry for a function with the same
9185 signature as FN, then we do not need a second vcall offset.
9186 Check the list of functions already present in the derived
9188 FOR_EACH_VEC_SAFE_ELT (vid
->fns
, i
, derived_entry
)
9190 if (same_signature_p (derived_entry
, orig_fn
)
9191 /* We only use one vcall offset for virtual destructors,
9192 even though there are two virtual table entries. */
9193 || (DECL_DESTRUCTOR_P (derived_entry
)
9194 && DECL_DESTRUCTOR_P (orig_fn
)))
9198 /* If we are building these vcall offsets as part of building
9199 the vtable for the most derived class, remember the vcall
9201 if (vid
->binfo
== TYPE_BINFO (vid
->derived
))
9203 tree_pair_s elt
= {orig_fn
, vid
->index
};
9204 vec_safe_push (CLASSTYPE_VCALL_INDICES (vid
->derived
), elt
);
9207 /* The next vcall offset will be found at a more negative
9209 vid
->index
= size_binop (MINUS_EXPR
, vid
->index
,
9210 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE
));
9212 /* Keep track of this function. */
9213 vec_safe_push (vid
->fns
, orig_fn
);
9215 if (vid
->generate_vcall_entries
)
9220 /* Find the overriding function. */
9221 fn
= find_final_overrider (vid
->rtti_binfo
, binfo
, orig_fn
);
9222 if (fn
== error_mark_node
)
9223 vcall_offset
= build_zero_cst (vtable_entry_type
);
9226 base
= TREE_VALUE (fn
);
9228 /* The vbase we're working on is a primary base of
9229 vid->binfo. But it might be a lost primary, so its
9230 BINFO_OFFSET might be wrong, so we just use the
9231 BINFO_OFFSET from vid->binfo. */
9232 vcall_offset
= size_diffop_loc (input_location
,
9233 BINFO_OFFSET (base
),
9234 BINFO_OFFSET (vid
->binfo
));
9235 vcall_offset
= fold_build1_loc (input_location
,
9236 NOP_EXPR
, vtable_entry_type
,
9239 /* Add the initializer to the vtable. */
9240 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, vcall_offset
);
9244 /* Return vtbl initializers for the RTTI entries corresponding to the
9245 BINFO's vtable. The RTTI entries should indicate the object given
9246 by VID->rtti_binfo. */
9249 build_rtti_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9257 t
= BINFO_TYPE (vid
->rtti_binfo
);
9259 /* To find the complete object, we will first convert to our most
9260 primary base, and then add the offset in the vtbl to that value. */
9262 while (CLASSTYPE_HAS_PRIMARY_BASE_P (BINFO_TYPE (b
))
9263 && !BINFO_LOST_PRIMARY_P (b
))
9267 primary_base
= get_primary_binfo (b
);
9268 gcc_assert (BINFO_PRIMARY_P (primary_base
)
9269 && BINFO_INHERITANCE_CHAIN (primary_base
) == b
);
9272 offset
= size_diffop_loc (input_location
,
9273 BINFO_OFFSET (vid
->rtti_binfo
), BINFO_OFFSET (b
));
9275 /* The second entry is the address of the typeinfo object. */
9277 decl
= build_address (get_tinfo_decl (t
));
9279 decl
= integer_zero_node
;
9281 /* Convert the declaration to a type that can be stored in the
9283 init
= build_nop (vfunc_ptr_type_node
, decl
);
9284 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, init
);
9286 /* Add the offset-to-top entry. It comes earlier in the vtable than
9287 the typeinfo entry. Convert the offset to look like a
9288 function pointer, so that we can put it in the vtable. */
9289 init
= build_nop (vfunc_ptr_type_node
, offset
);
9290 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, init
);
9293 /* TRUE iff TYPE is uniquely derived from PARENT. Ignores
9297 uniquely_derived_from_p (tree parent
, tree type
)
9299 tree base
= lookup_base (type
, parent
, ba_unique
, NULL
, tf_none
);
9300 return base
&& base
!= error_mark_node
;
9303 /* TRUE iff TYPE is publicly & uniquely derived from PARENT. */
9306 publicly_uniquely_derived_p (tree parent
, tree type
)
9308 tree base
= lookup_base (type
, parent
, ba_ignore_scope
| ba_check
,
9310 return base
&& base
!= error_mark_node
;
9313 /* CTX1 and CTX2 are declaration contexts. Return the innermost common
9314 class between them, if any. */
9317 common_enclosing_class (tree ctx1
, tree ctx2
)
9319 if (!TYPE_P (ctx1
) || !TYPE_P (ctx2
))
9321 gcc_assert (ctx1
== TYPE_MAIN_VARIANT (ctx1
)
9322 && ctx2
== TYPE_MAIN_VARIANT (ctx2
));
9325 for (tree t
= ctx1
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9326 TYPE_MARKED_P (t
) = true;
9327 tree found
= NULL_TREE
;
9328 for (tree t
= ctx2
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9329 if (TYPE_MARKED_P (t
))
9334 for (tree t
= ctx1
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9335 TYPE_MARKED_P (t
) = false;
9339 #include "gt-cp-class.h"