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 contains_empty_class_p (tree
);
212 static bool base_derived_from (tree
, tree
);
213 static int empty_base_at_nonzero_offset_p (tree
, tree
, splay_tree
);
214 static tree
end_of_base (tree
);
215 static tree
get_vcall_index (tree
, tree
);
217 /* Variables shared between class.c and call.c. */
220 int n_vtable_entries
= 0;
221 int n_vtable_searches
= 0;
222 int n_vtable_elems
= 0;
223 int n_convert_harshness
= 0;
224 int n_compute_conversion_costs
= 0;
225 int n_inner_fields_searched
= 0;
227 /* Convert to or from a base subobject. EXPR is an expression of type
228 `A' or `A*', an expression of type `B' or `B*' is returned. To
229 convert A to a base B, CODE is PLUS_EXPR and BINFO is the binfo for
230 the B base instance within A. To convert base A to derived B, CODE
231 is MINUS_EXPR and BINFO is the binfo for the A instance within B.
232 In this latter case, A must not be a morally virtual base of B.
233 NONNULL is true if EXPR is known to be non-NULL (this is only
234 needed when EXPR is of pointer type). CV qualifiers are preserved
238 build_base_path (enum tree_code code
,
242 tsubst_flags_t complain
)
244 tree v_binfo
= NULL_TREE
;
245 tree d_binfo
= NULL_TREE
;
249 tree null_test
= NULL
;
250 tree ptr_target_type
;
252 int want_pointer
= TYPE_PTR_P (TREE_TYPE (expr
));
253 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
;
328 /* This must happen before the call to save_expr. */
329 expr
= cp_build_addr_expr (expr
, complain
);
331 expr
= mark_rvalue_use (expr
);
333 offset
= BINFO_OFFSET (binfo
);
334 fixed_type_p
= resolves_to_fixed_type_p (expr
, &nonnull
);
335 target_type
= code
== PLUS_EXPR
? BINFO_TYPE (binfo
) : BINFO_TYPE (d_binfo
);
336 /* TARGET_TYPE has been extracted from BINFO, and, is therefore always
337 cv-unqualified. Extract the cv-qualifiers from EXPR so that the
338 expression returned matches the input. */
339 target_type
= cp_build_qualified_type
340 (target_type
, cp_type_quals (TREE_TYPE (TREE_TYPE (expr
))));
341 ptr_target_type
= build_pointer_type (target_type
);
343 /* Do we need to look in the vtable for the real offset? */
344 virtual_access
= (v_binfo
&& fixed_type_p
<= 0);
346 /* Don't bother with the calculations inside sizeof; they'll ICE if the
347 source type is incomplete and the pointer value doesn't matter. In a
348 template (even in fold_non_dependent_expr), we don't have vtables set
349 up properly yet, and the value doesn't matter there either; we're just
350 interested in the result of overload resolution. */
351 if (cp_unevaluated_operand
!= 0
352 || in_template_function ())
354 expr
= build_nop (ptr_target_type
, expr
);
356 expr
= build_indirect_ref (EXPR_LOCATION (expr
), expr
, RO_NULL
);
360 /* If we're in an NSDMI, we don't have the full constructor context yet
361 that we need for converting to a virtual base, so just build a stub
362 CONVERT_EXPR and expand it later in bot_replace. */
363 if (virtual_access
&& fixed_type_p
< 0
364 && current_scope () != current_function_decl
)
366 expr
= build1 (CONVERT_EXPR
, ptr_target_type
, expr
);
367 CONVERT_EXPR_VBASE_PATH (expr
) = true;
369 expr
= build_indirect_ref (EXPR_LOCATION (expr
), expr
, RO_NULL
);
373 /* Do we need to check for a null pointer? */
374 if (want_pointer
&& !nonnull
)
376 /* If we know the conversion will not actually change the value
377 of EXPR, then we can avoid testing the expression for NULL.
378 We have to avoid generating a COMPONENT_REF for a base class
379 field, because other parts of the compiler know that such
380 expressions are always non-NULL. */
381 if (!virtual_access
&& integer_zerop (offset
))
382 return build_nop (ptr_target_type
, expr
);
383 null_test
= error_mark_node
;
386 /* Protect against multiple evaluation if necessary. */
387 if (TREE_SIDE_EFFECTS (expr
) && (null_test
|| virtual_access
))
388 expr
= save_expr (expr
);
390 /* Now that we've saved expr, build the real null test. */
393 tree zero
= cp_convert (TREE_TYPE (expr
), nullptr_node
, complain
);
394 null_test
= fold_build2_loc (input_location
, NE_EXPR
, boolean_type_node
,
398 /* If this is a simple base reference, express it as a COMPONENT_REF. */
399 if (code
== PLUS_EXPR
&& !virtual_access
400 /* We don't build base fields for empty bases, and they aren't very
401 interesting to the optimizers anyway. */
404 expr
= cp_build_indirect_ref (expr
, RO_NULL
, complain
);
405 expr
= build_simple_base_path (expr
, binfo
);
407 expr
= build_address (expr
);
408 target_type
= TREE_TYPE (expr
);
414 /* Going via virtual base V_BINFO. We need the static offset
415 from V_BINFO to BINFO, and the dynamic offset from D_BINFO to
416 V_BINFO. That offset is an entry in D_BINFO's vtable. */
419 if (fixed_type_p
< 0 && in_base_initializer
)
421 /* In a base member initializer, we cannot rely on the
422 vtable being set up. We have to indirect via the
426 t
= TREE_TYPE (TYPE_VFIELD (current_class_type
));
427 t
= build_pointer_type (t
);
428 v_offset
= convert (t
, current_vtt_parm
);
429 v_offset
= cp_build_indirect_ref (v_offset
, RO_NULL
, complain
);
432 v_offset
= build_vfield_ref (cp_build_indirect_ref (expr
, RO_NULL
,
434 TREE_TYPE (TREE_TYPE (expr
)));
436 if (v_offset
== error_mark_node
)
437 return error_mark_node
;
439 v_offset
= fold_build_pointer_plus (v_offset
, BINFO_VPTR_FIELD (v_binfo
));
440 v_offset
= build1 (NOP_EXPR
,
441 build_pointer_type (ptrdiff_type_node
),
443 v_offset
= cp_build_indirect_ref (v_offset
, RO_NULL
, complain
);
444 TREE_CONSTANT (v_offset
) = 1;
446 offset
= convert_to_integer (ptrdiff_type_node
,
447 size_diffop_loc (input_location
, offset
,
448 BINFO_OFFSET (v_binfo
)));
450 if (!integer_zerop (offset
))
451 v_offset
= build2 (code
, ptrdiff_type_node
, v_offset
, offset
);
453 if (fixed_type_p
< 0)
454 /* Negative fixed_type_p means this is a constructor or destructor;
455 virtual base layout is fixed in in-charge [cd]tors, but not in
457 offset
= build3 (COND_EXPR
, ptrdiff_type_node
,
458 build2 (EQ_EXPR
, boolean_type_node
,
459 current_in_charge_parm
, integer_zero_node
),
461 convert_to_integer (ptrdiff_type_node
,
462 BINFO_OFFSET (binfo
)));
468 target_type
= ptr_target_type
;
470 expr
= build1 (NOP_EXPR
, ptr_target_type
, expr
);
472 if (!integer_zerop (offset
))
474 offset
= fold_convert (sizetype
, offset
);
475 if (code
== MINUS_EXPR
)
476 offset
= fold_build1_loc (input_location
, NEGATE_EXPR
, sizetype
, offset
);
477 expr
= fold_build_pointer_plus (expr
, offset
);
483 expr
= cp_build_indirect_ref (expr
, RO_NULL
, complain
);
487 expr
= fold_build3_loc (input_location
, COND_EXPR
, target_type
, null_test
, expr
,
488 build_zero_cst (target_type
));
493 /* Subroutine of build_base_path; EXPR and BINFO are as in that function.
494 Perform a derived-to-base conversion by recursively building up a
495 sequence of COMPONENT_REFs to the appropriate base fields. */
498 build_simple_base_path (tree expr
, tree binfo
)
500 tree type
= BINFO_TYPE (binfo
);
501 tree d_binfo
= BINFO_INHERITANCE_CHAIN (binfo
);
504 if (d_binfo
== NULL_TREE
)
508 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (expr
)) == type
);
510 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x'
511 into `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only
512 an lvalue in the front end; only _DECLs and _REFs are lvalues
514 temp
= unary_complex_lvalue (ADDR_EXPR
, expr
);
516 expr
= cp_build_indirect_ref (temp
, RO_NULL
, tf_warning_or_error
);
522 expr
= build_simple_base_path (expr
, d_binfo
);
524 for (field
= TYPE_FIELDS (BINFO_TYPE (d_binfo
));
525 field
; field
= DECL_CHAIN (field
))
526 /* Is this the base field created by build_base_field? */
527 if (TREE_CODE (field
) == FIELD_DECL
528 && DECL_FIELD_IS_BASE (field
)
529 && TREE_TYPE (field
) == type
530 /* If we're looking for a field in the most-derived class,
531 also check the field offset; we can have two base fields
532 of the same type if one is an indirect virtual base and one
533 is a direct non-virtual base. */
534 && (BINFO_INHERITANCE_CHAIN (d_binfo
)
535 || tree_int_cst_equal (byte_position (field
),
536 BINFO_OFFSET (binfo
))))
538 /* We don't use build_class_member_access_expr here, as that
539 has unnecessary checks, and more importantly results in
540 recursive calls to dfs_walk_once. */
541 int type_quals
= cp_type_quals (TREE_TYPE (expr
));
543 expr
= build3 (COMPONENT_REF
,
544 cp_build_qualified_type (type
, type_quals
),
545 expr
, field
, NULL_TREE
);
546 expr
= fold_if_not_in_template (expr
);
548 /* Mark the expression const or volatile, as appropriate.
549 Even though we've dealt with the type above, we still have
550 to mark the expression itself. */
551 if (type_quals
& TYPE_QUAL_CONST
)
552 TREE_READONLY (expr
) = 1;
553 if (type_quals
& TYPE_QUAL_VOLATILE
)
554 TREE_THIS_VOLATILE (expr
) = 1;
559 /* Didn't find the base field?!? */
563 /* Convert OBJECT to the base TYPE. OBJECT is an expression whose
564 type is a class type or a pointer to a class type. In the former
565 case, TYPE is also a class type; in the latter it is another
566 pointer type. If CHECK_ACCESS is true, an error message is emitted
567 if TYPE is inaccessible. If OBJECT has pointer type, the value is
568 assumed to be non-NULL. */
571 convert_to_base (tree object
, tree type
, bool check_access
, bool nonnull
,
572 tsubst_flags_t complain
)
577 if (TYPE_PTR_P (TREE_TYPE (object
)))
579 object_type
= TREE_TYPE (TREE_TYPE (object
));
580 type
= TREE_TYPE (type
);
583 object_type
= TREE_TYPE (object
);
585 binfo
= lookup_base (object_type
, type
, check_access
? ba_check
: ba_unique
,
587 if (!binfo
|| binfo
== error_mark_node
)
588 return error_mark_node
;
590 return build_base_path (PLUS_EXPR
, object
, binfo
, nonnull
, complain
);
593 /* EXPR is an expression with unqualified class type. BASE is a base
594 binfo of that class type. Returns EXPR, converted to the BASE
595 type. This function assumes that EXPR is the most derived class;
596 therefore virtual bases can be found at their static offsets. */
599 convert_to_base_statically (tree expr
, tree base
)
603 expr_type
= TREE_TYPE (expr
);
604 if (!SAME_BINFO_TYPE_P (BINFO_TYPE (base
), expr_type
))
606 /* If this is a non-empty base, use a COMPONENT_REF. */
607 if (!is_empty_class (BINFO_TYPE (base
)))
608 return build_simple_base_path (expr
, base
);
610 /* We use fold_build2 and fold_convert below to simplify the trees
611 provided to the optimizers. It is not safe to call these functions
612 when processing a template because they do not handle C++-specific
614 gcc_assert (!processing_template_decl
);
615 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
616 if (!integer_zerop (BINFO_OFFSET (base
)))
617 expr
= fold_build_pointer_plus_loc (input_location
,
618 expr
, BINFO_OFFSET (base
));
619 expr
= fold_convert (build_pointer_type (BINFO_TYPE (base
)), expr
);
620 expr
= build_fold_indirect_ref_loc (input_location
, expr
);
628 build_vfield_ref (tree datum
, tree type
)
630 tree vfield
, vcontext
;
632 if (datum
== error_mark_node
633 /* Can happen in case of duplicate base types (c++/59082). */
634 || !TYPE_VFIELD (type
))
635 return error_mark_node
;
637 /* First, convert to the requested type. */
638 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (datum
), type
))
639 datum
= convert_to_base (datum
, type
, /*check_access=*/false,
640 /*nonnull=*/true, tf_warning_or_error
);
642 /* Second, the requested type may not be the owner of its own vptr.
643 If not, convert to the base class that owns it. We cannot use
644 convert_to_base here, because VCONTEXT may appear more than once
645 in the inheritance hierarchy of TYPE, and thus direct conversion
646 between the types may be ambiguous. Following the path back up
647 one step at a time via primary bases avoids the problem. */
648 vfield
= TYPE_VFIELD (type
);
649 vcontext
= DECL_CONTEXT (vfield
);
650 while (!same_type_ignoring_top_level_qualifiers_p (vcontext
, type
))
652 datum
= build_simple_base_path (datum
, CLASSTYPE_PRIMARY_BINFO (type
));
653 type
= TREE_TYPE (datum
);
656 return build3 (COMPONENT_REF
, TREE_TYPE (vfield
), datum
, vfield
, NULL_TREE
);
659 /* Given an object INSTANCE, return an expression which yields the
660 vtable element corresponding to INDEX. There are many special
661 cases for INSTANCE which we take care of here, mainly to avoid
662 creating extra tree nodes when we don't have to. */
665 build_vtbl_ref_1 (tree instance
, tree idx
)
668 tree vtbl
= NULL_TREE
;
670 /* Try to figure out what a reference refers to, and
671 access its virtual function table directly. */
674 tree fixed_type
= fixed_type_or_null (instance
, NULL
, &cdtorp
);
676 tree basetype
= non_reference (TREE_TYPE (instance
));
678 if (fixed_type
&& !cdtorp
)
680 tree binfo
= lookup_base (fixed_type
, basetype
,
681 ba_unique
, NULL
, tf_none
);
682 if (binfo
&& binfo
!= error_mark_node
)
683 vtbl
= unshare_expr (BINFO_VTABLE (binfo
));
687 vtbl
= build_vfield_ref (instance
, basetype
);
689 aref
= build_array_ref (input_location
, vtbl
, idx
);
690 TREE_CONSTANT (aref
) |= TREE_CONSTANT (vtbl
) && TREE_CONSTANT (idx
);
696 build_vtbl_ref (tree instance
, tree idx
)
698 tree aref
= build_vtbl_ref_1 (instance
, idx
);
703 /* Given a stable object pointer INSTANCE_PTR, return an expression which
704 yields a function pointer corresponding to vtable element INDEX. */
707 build_vfn_ref (tree instance_ptr
, tree idx
)
711 aref
= build_vtbl_ref_1 (cp_build_indirect_ref (instance_ptr
, RO_NULL
,
712 tf_warning_or_error
),
715 /* When using function descriptors, the address of the
716 vtable entry is treated as a function pointer. */
717 if (TARGET_VTABLE_USES_DESCRIPTORS
)
718 aref
= build1 (NOP_EXPR
, TREE_TYPE (aref
),
719 cp_build_addr_expr (aref
, tf_warning_or_error
));
721 /* Remember this as a method reference, for later devirtualization. */
722 aref
= build3 (OBJ_TYPE_REF
, TREE_TYPE (aref
), aref
, instance_ptr
, idx
);
727 /* Return the name of the virtual function table (as an IDENTIFIER_NODE)
728 for the given TYPE. */
731 get_vtable_name (tree type
)
733 return mangle_vtbl_for_type (type
);
736 /* DECL is an entity associated with TYPE, like a virtual table or an
737 implicitly generated constructor. Determine whether or not DECL
738 should have external or internal linkage at the object file
739 level. This routine does not deal with COMDAT linkage and other
740 similar complexities; it simply sets TREE_PUBLIC if it possible for
741 entities in other translation units to contain copies of DECL, in
745 set_linkage_according_to_type (tree
/*type*/, tree decl
)
747 TREE_PUBLIC (decl
) = 1;
748 determine_visibility (decl
);
751 /* Create a VAR_DECL for a primary or secondary vtable for CLASS_TYPE.
752 (For a secondary vtable for B-in-D, CLASS_TYPE should be D, not B.)
753 Use NAME for the name of the vtable, and VTABLE_TYPE for its type. */
756 build_vtable (tree class_type
, tree name
, tree vtable_type
)
760 decl
= build_lang_decl (VAR_DECL
, name
, vtable_type
);
761 /* vtable names are already mangled; give them their DECL_ASSEMBLER_NAME
762 now to avoid confusion in mangle_decl. */
763 SET_DECL_ASSEMBLER_NAME (decl
, name
);
764 DECL_CONTEXT (decl
) = class_type
;
765 DECL_ARTIFICIAL (decl
) = 1;
766 TREE_STATIC (decl
) = 1;
767 TREE_READONLY (decl
) = 1;
768 DECL_VIRTUAL_P (decl
) = 1;
769 DECL_ALIGN (decl
) = TARGET_VTABLE_ENTRY_ALIGN
;
770 DECL_USER_ALIGN (decl
) = true;
771 DECL_VTABLE_OR_VTT_P (decl
) = 1;
772 set_linkage_according_to_type (class_type
, decl
);
773 /* The vtable has not been defined -- yet. */
774 DECL_EXTERNAL (decl
) = 1;
775 DECL_NOT_REALLY_EXTERN (decl
) = 1;
777 /* Mark the VAR_DECL node representing the vtable itself as a
778 "gratuitous" one, thereby forcing dwarfout.c to ignore it. It
779 is rather important that such things be ignored because any
780 effort to actually generate DWARF for them will run into
781 trouble when/if we encounter code like:
784 struct S { virtual void member (); };
786 because the artificial declaration of the vtable itself (as
787 manufactured by the g++ front end) will say that the vtable is
788 a static member of `S' but only *after* the debug output for
789 the definition of `S' has already been output. This causes
790 grief because the DWARF entry for the definition of the vtable
791 will try to refer back to an earlier *declaration* of the
792 vtable as a static member of `S' and there won't be one. We
793 might be able to arrange to have the "vtable static member"
794 attached to the member list for `S' before the debug info for
795 `S' get written (which would solve the problem) but that would
796 require more intrusive changes to the g++ front end. */
797 DECL_IGNORED_P (decl
) = 1;
802 /* Get the VAR_DECL of the vtable for TYPE. TYPE need not be polymorphic,
803 or even complete. If this does not exist, create it. If COMPLETE is
804 nonzero, then complete the definition of it -- that will render it
805 impossible to actually build the vtable, but is useful to get at those
806 which are known to exist in the runtime. */
809 get_vtable_decl (tree type
, int complete
)
813 if (CLASSTYPE_VTABLES (type
))
814 return CLASSTYPE_VTABLES (type
);
816 decl
= build_vtable (type
, get_vtable_name (type
), vtbl_type_node
);
817 CLASSTYPE_VTABLES (type
) = decl
;
821 DECL_EXTERNAL (decl
) = 1;
822 cp_finish_decl (decl
, NULL_TREE
, false, NULL_TREE
, 0);
828 /* Build the primary virtual function table for TYPE. If BINFO is
829 non-NULL, build the vtable starting with the initial approximation
830 that it is the same as the one which is the head of the association
831 list. Returns a nonzero value if a new vtable is actually
835 build_primary_vtable (tree binfo
, tree type
)
840 decl
= get_vtable_decl (type
, /*complete=*/0);
844 if (BINFO_NEW_VTABLE_MARKED (binfo
))
845 /* We have already created a vtable for this base, so there's
846 no need to do it again. */
849 virtuals
= copy_list (BINFO_VIRTUALS (binfo
));
850 TREE_TYPE (decl
) = TREE_TYPE (get_vtbl_decl_for_binfo (binfo
));
851 DECL_SIZE (decl
) = TYPE_SIZE (TREE_TYPE (decl
));
852 DECL_SIZE_UNIT (decl
) = TYPE_SIZE_UNIT (TREE_TYPE (decl
));
856 gcc_assert (TREE_TYPE (decl
) == vtbl_type_node
);
857 virtuals
= NULL_TREE
;
860 if (GATHER_STATISTICS
)
863 n_vtable_elems
+= list_length (virtuals
);
866 /* Initialize the association list for this type, based
867 on our first approximation. */
868 BINFO_VTABLE (TYPE_BINFO (type
)) = decl
;
869 BINFO_VIRTUALS (TYPE_BINFO (type
)) = virtuals
;
870 SET_BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (type
));
874 /* Give BINFO a new virtual function table which is initialized
875 with a skeleton-copy of its original initialization. The only
876 entry that changes is the `delta' entry, so we can really
877 share a lot of structure.
879 FOR_TYPE is the most derived type which caused this table to
882 Returns nonzero if we haven't met BINFO before.
884 The order in which vtables are built (by calling this function) for
885 an object must remain the same, otherwise a binary incompatibility
889 build_secondary_vtable (tree binfo
)
891 if (BINFO_NEW_VTABLE_MARKED (binfo
))
892 /* We already created a vtable for this base. There's no need to
896 /* Remember that we've created a vtable for this BINFO, so that we
897 don't try to do so again. */
898 SET_BINFO_NEW_VTABLE_MARKED (binfo
);
900 /* Make fresh virtual list, so we can smash it later. */
901 BINFO_VIRTUALS (binfo
) = copy_list (BINFO_VIRTUALS (binfo
));
903 /* Secondary vtables are laid out as part of the same structure as
904 the primary vtable. */
905 BINFO_VTABLE (binfo
) = NULL_TREE
;
909 /* Create a new vtable for BINFO which is the hierarchy dominated by
910 T. Return nonzero if we actually created a new vtable. */
913 make_new_vtable (tree t
, tree binfo
)
915 if (binfo
== TYPE_BINFO (t
))
916 /* In this case, it is *type*'s vtable we are modifying. We start
917 with the approximation that its vtable is that of the
918 immediate base class. */
919 return build_primary_vtable (binfo
, t
);
921 /* This is our very own copy of `basetype' to play with. Later,
922 we will fill in all the virtual functions that override the
923 virtual functions in these base classes which are not defined
924 by the current type. */
925 return build_secondary_vtable (binfo
);
928 /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO
929 (which is in the hierarchy dominated by T) list FNDECL as its
930 BV_FN. DELTA is the required constant adjustment from the `this'
931 pointer where the vtable entry appears to the `this' required when
932 the function is actually called. */
935 modify_vtable_entry (tree t
,
945 if (fndecl
!= BV_FN (v
)
946 || !tree_int_cst_equal (delta
, BV_DELTA (v
)))
948 /* We need a new vtable for BINFO. */
949 if (make_new_vtable (t
, binfo
))
951 /* If we really did make a new vtable, we also made a copy
952 of the BINFO_VIRTUALS list. Now, we have to find the
953 corresponding entry in that list. */
954 *virtuals
= BINFO_VIRTUALS (binfo
);
955 while (BV_FN (*virtuals
) != BV_FN (v
))
956 *virtuals
= TREE_CHAIN (*virtuals
);
960 BV_DELTA (v
) = delta
;
961 BV_VCALL_INDEX (v
) = NULL_TREE
;
967 /* Add method METHOD to class TYPE. If USING_DECL is non-null, it is
968 the USING_DECL naming METHOD. Returns true if the method could be
969 added to the method vec. */
972 add_method (tree type
, tree method
, tree using_decl
)
976 bool template_conv_p
= false;
978 vec
<tree
, va_gc
> *method_vec
;
980 bool insert_p
= false;
984 if (method
== error_mark_node
)
987 complete_p
= COMPLETE_TYPE_P (type
);
988 conv_p
= DECL_CONV_FN_P (method
);
990 template_conv_p
= (TREE_CODE (method
) == TEMPLATE_DECL
991 && DECL_TEMPLATE_CONV_FN_P (method
));
993 method_vec
= CLASSTYPE_METHOD_VEC (type
);
996 /* Make a new method vector. We start with 8 entries. We must
997 allocate at least two (for constructors and destructors), and
998 we're going to end up with an assignment operator at some
1000 vec_alloc (method_vec
, 8);
1001 /* Create slots for constructors and destructors. */
1002 method_vec
->quick_push (NULL_TREE
);
1003 method_vec
->quick_push (NULL_TREE
);
1004 CLASSTYPE_METHOD_VEC (type
) = method_vec
;
1007 /* Maintain TYPE_HAS_USER_CONSTRUCTOR, etc. */
1008 grok_special_member_properties (method
);
1010 /* Constructors and destructors go in special slots. */
1011 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (method
))
1012 slot
= CLASSTYPE_CONSTRUCTOR_SLOT
;
1013 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method
))
1015 slot
= CLASSTYPE_DESTRUCTOR_SLOT
;
1017 if (TYPE_FOR_JAVA (type
))
1019 if (!DECL_ARTIFICIAL (method
))
1020 error ("Java class %qT cannot have a destructor", type
);
1021 else if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
1022 error ("Java class %qT cannot have an implicit non-trivial "
1032 /* See if we already have an entry with this name. */
1033 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
1034 vec_safe_iterate (method_vec
, slot
, &m
);
1037 m
= OVL_CURRENT (m
);
1038 if (template_conv_p
)
1040 if (TREE_CODE (m
) == TEMPLATE_DECL
1041 && DECL_TEMPLATE_CONV_FN_P (m
))
1045 if (conv_p
&& !DECL_CONV_FN_P (m
))
1047 if (DECL_NAME (m
) == DECL_NAME (method
))
1053 && !DECL_CONV_FN_P (m
)
1054 && DECL_NAME (m
) > DECL_NAME (method
))
1058 current_fns
= insert_p
? NULL_TREE
: (*method_vec
)[slot
];
1060 /* Check to see if we've already got this method. */
1061 for (fns
= current_fns
; fns
; fns
= OVL_NEXT (fns
))
1063 tree fn
= OVL_CURRENT (fns
);
1069 if (TREE_CODE (fn
) != TREE_CODE (method
))
1072 /* [over.load] Member function declarations with the
1073 same name and the same parameter types cannot be
1074 overloaded if any of them is a static member
1075 function declaration.
1077 [over.load] Member function declarations with the same name and
1078 the same parameter-type-list as well as member function template
1079 declarations with the same name, the same parameter-type-list, and
1080 the same template parameter lists cannot be overloaded if any of
1081 them, but not all, have a ref-qualifier.
1083 [namespace.udecl] When a using-declaration brings names
1084 from a base class into a derived class scope, member
1085 functions in the derived class override and/or hide member
1086 functions with the same name and parameter types in a base
1087 class (rather than conflicting). */
1088 fn_type
= TREE_TYPE (fn
);
1089 method_type
= TREE_TYPE (method
);
1090 parms1
= TYPE_ARG_TYPES (fn_type
);
1091 parms2
= TYPE_ARG_TYPES (method_type
);
1093 /* Compare the quals on the 'this' parm. Don't compare
1094 the whole types, as used functions are treated as
1095 coming from the using class in overload resolution. */
1096 if (! DECL_STATIC_FUNCTION_P (fn
)
1097 && ! DECL_STATIC_FUNCTION_P (method
)
1098 /* Either both or neither need to be ref-qualified for
1099 differing quals to allow overloading. */
1100 && (FUNCTION_REF_QUALIFIED (fn_type
)
1101 == FUNCTION_REF_QUALIFIED (method_type
))
1102 && (type_memfn_quals (fn_type
) != type_memfn_quals (method_type
)
1103 || type_memfn_rqual (fn_type
) != type_memfn_rqual (method_type
)))
1106 /* For templates, the return type and template parameters
1107 must be identical. */
1108 if (TREE_CODE (fn
) == TEMPLATE_DECL
1109 && (!same_type_p (TREE_TYPE (fn_type
),
1110 TREE_TYPE (method_type
))
1111 || !comp_template_parms (DECL_TEMPLATE_PARMS (fn
),
1112 DECL_TEMPLATE_PARMS (method
))))
1115 if (! DECL_STATIC_FUNCTION_P (fn
))
1116 parms1
= TREE_CHAIN (parms1
);
1117 if (! DECL_STATIC_FUNCTION_P (method
))
1118 parms2
= TREE_CHAIN (parms2
);
1120 if (compparms (parms1
, parms2
)
1121 && (!DECL_CONV_FN_P (fn
)
1122 || same_type_p (TREE_TYPE (fn_type
),
1123 TREE_TYPE (method_type
))))
1125 /* For function versions, their parms and types match
1126 but they are not duplicates. Record function versions
1127 as and when they are found. extern "C" functions are
1128 not treated as versions. */
1129 if (TREE_CODE (fn
) == FUNCTION_DECL
1130 && TREE_CODE (method
) == FUNCTION_DECL
1131 && !DECL_EXTERN_C_P (fn
)
1132 && !DECL_EXTERN_C_P (method
)
1133 && targetm
.target_option
.function_versions (fn
, method
))
1135 /* Mark functions as versions if necessary. Modify the mangled
1136 decl name if necessary. */
1137 if (!DECL_FUNCTION_VERSIONED (fn
))
1139 DECL_FUNCTION_VERSIONED (fn
) = 1;
1140 if (DECL_ASSEMBLER_NAME_SET_P (fn
))
1143 if (!DECL_FUNCTION_VERSIONED (method
))
1145 DECL_FUNCTION_VERSIONED (method
) = 1;
1146 if (DECL_ASSEMBLER_NAME_SET_P (method
))
1147 mangle_decl (method
);
1149 cgraph_node::record_function_versions (fn
, method
);
1152 if (DECL_INHERITED_CTOR_BASE (method
))
1154 if (DECL_INHERITED_CTOR_BASE (fn
))
1156 error_at (DECL_SOURCE_LOCATION (method
),
1157 "%q#D inherited from %qT", method
,
1158 DECL_INHERITED_CTOR_BASE (method
));
1159 error_at (DECL_SOURCE_LOCATION (fn
),
1160 "conflicts with version inherited from %qT",
1161 DECL_INHERITED_CTOR_BASE (fn
));
1163 /* Otherwise defer to the other function. */
1168 if (DECL_CONTEXT (fn
) == type
)
1169 /* Defer to the local function. */
1174 error ("%q+#D cannot be overloaded", method
);
1175 error ("with %q+#D", fn
);
1178 /* We don't call duplicate_decls here to merge the
1179 declarations because that will confuse things if the
1180 methods have inline definitions. In particular, we
1181 will crash while processing the definitions. */
1186 /* A class should never have more than one destructor. */
1187 if (current_fns
&& DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method
))
1190 /* Add the new binding. */
1193 overload
= ovl_cons (method
, current_fns
);
1194 OVL_USED (overload
) = true;
1197 overload
= build_overload (method
, current_fns
);
1200 TYPE_HAS_CONVERSION (type
) = 1;
1201 else if (slot
>= CLASSTYPE_FIRST_CONVERSION_SLOT
&& !complete_p
)
1202 push_class_level_binding (DECL_NAME (method
), overload
);
1208 /* We only expect to add few methods in the COMPLETE_P case, so
1209 just make room for one more method in that case. */
1211 reallocated
= vec_safe_reserve_exact (method_vec
, 1);
1213 reallocated
= vec_safe_reserve (method_vec
, 1);
1215 CLASSTYPE_METHOD_VEC (type
) = method_vec
;
1216 if (slot
== method_vec
->length ())
1217 method_vec
->quick_push (overload
);
1219 method_vec
->quick_insert (slot
, overload
);
1222 /* Replace the current slot. */
1223 (*method_vec
)[slot
] = overload
;
1227 /* Subroutines of finish_struct. */
1229 /* Change the access of FDECL to ACCESS in T. Return 1 if change was
1230 legit, otherwise return 0. */
1233 alter_access (tree t
, tree fdecl
, tree access
)
1237 if (!DECL_LANG_SPECIFIC (fdecl
))
1238 retrofit_lang_decl (fdecl
);
1240 gcc_assert (!DECL_DISCRIMINATOR_P (fdecl
));
1242 elem
= purpose_member (t
, DECL_ACCESS (fdecl
));
1245 if (TREE_VALUE (elem
) != access
)
1247 if (TREE_CODE (TREE_TYPE (fdecl
)) == FUNCTION_DECL
)
1248 error ("conflicting access specifications for method"
1249 " %q+D, ignored", TREE_TYPE (fdecl
));
1251 error ("conflicting access specifications for field %qE, ignored",
1256 /* They're changing the access to the same thing they changed
1257 it to before. That's OK. */
1263 perform_or_defer_access_check (TYPE_BINFO (t
), fdecl
, fdecl
,
1264 tf_warning_or_error
);
1265 DECL_ACCESS (fdecl
) = tree_cons (t
, access
, DECL_ACCESS (fdecl
));
1271 /* Process the USING_DECL, which is a member of T. */
1274 handle_using_decl (tree using_decl
, tree t
)
1276 tree decl
= USING_DECL_DECLS (using_decl
);
1277 tree name
= DECL_NAME (using_decl
);
1279 = TREE_PRIVATE (using_decl
) ? access_private_node
1280 : TREE_PROTECTED (using_decl
) ? access_protected_node
1281 : access_public_node
;
1282 tree flist
= NULL_TREE
;
1285 gcc_assert (!processing_template_decl
&& decl
);
1287 old_value
= lookup_member (t
, name
, /*protect=*/0, /*want_type=*/false,
1288 tf_warning_or_error
);
1291 if (is_overloaded_fn (old_value
))
1292 old_value
= OVL_CURRENT (old_value
);
1294 if (DECL_P (old_value
) && DECL_CONTEXT (old_value
) == t
)
1297 old_value
= NULL_TREE
;
1300 cp_emit_debug_info_for_using (decl
, t
);
1302 if (is_overloaded_fn (decl
))
1307 else if (is_overloaded_fn (old_value
))
1310 /* It's OK to use functions from a base when there are functions with
1311 the same name already present in the current class. */;
1314 error ("%q+D invalid in %q#T", using_decl
, t
);
1315 error (" because of local method %q+#D with same name",
1316 OVL_CURRENT (old_value
));
1320 else if (!DECL_ARTIFICIAL (old_value
))
1322 error ("%q+D invalid in %q#T", using_decl
, t
);
1323 error (" because of local member %q+#D with same name", old_value
);
1327 /* Make type T see field decl FDECL with access ACCESS. */
1329 for (; flist
; flist
= OVL_NEXT (flist
))
1331 add_method (t
, OVL_CURRENT (flist
), using_decl
);
1332 alter_access (t
, OVL_CURRENT (flist
), access
);
1335 alter_access (t
, decl
, access
);
1338 /* walk_tree callback for check_abi_tags: if the type at *TP involves any
1339 types with abi tags, add the corresponding identifiers to the VEC in
1340 *DATA and set IDENTIFIER_MARKED. */
1346 // error_mark_node to get diagnostics; otherwise collect missing tags here
1351 find_abi_tags_r (tree
*tp
, int *walk_subtrees
, void *data
)
1353 if (!OVERLOAD_TYPE_P (*tp
))
1356 /* walk_tree shouldn't be walking into any subtrees of a RECORD_TYPE
1357 anyway, but let's make sure of it. */
1358 *walk_subtrees
= false;
1360 if (tree attributes
= lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (*tp
)))
1362 struct abi_tag_data
*p
= static_cast<struct abi_tag_data
*>(data
);
1363 for (tree list
= TREE_VALUE (attributes
); list
;
1364 list
= TREE_CHAIN (list
))
1366 tree tag
= TREE_VALUE (list
);
1367 tree id
= get_identifier (TREE_STRING_POINTER (tag
));
1368 if (!IDENTIFIER_MARKED (id
))
1370 if (p
->tags
!= error_mark_node
)
1372 /* We're collecting tags from template arguments. */
1373 tree str
= build_string (IDENTIFIER_LENGTH (id
),
1374 IDENTIFIER_POINTER (id
));
1375 p
->tags
= tree_cons (NULL_TREE
, str
, p
->tags
);
1376 ABI_TAG_IMPLICIT (p
->tags
) = true;
1378 /* Don't inherit this tag multiple times. */
1379 IDENTIFIER_MARKED (id
) = true;
1382 /* Otherwise we're diagnosing missing tags. */
1383 else if (TYPE_P (p
->subob
))
1385 if (warning (OPT_Wabi_tag
, "%qT does not have the %E abi tag "
1386 "that base %qT has", p
->t
, tag
, p
->subob
))
1387 inform (location_of (p
->subob
), "%qT declared here",
1392 if (warning (OPT_Wabi_tag
, "%qT does not have the %E abi tag "
1393 "that %qT (used in the type of %qD) has",
1394 p
->t
, tag
, *tp
, p
->subob
))
1396 inform (location_of (p
->subob
), "%qD declared here",
1398 inform (location_of (*tp
), "%qT declared here", *tp
);
1407 /* Set IDENTIFIER_MARKED on all the ABI tags on T and its (transitively
1408 complete) template arguments. */
1411 mark_type_abi_tags (tree t
, bool val
)
1413 tree attributes
= lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (t
));
1416 for (tree list
= TREE_VALUE (attributes
); list
;
1417 list
= TREE_CHAIN (list
))
1419 tree tag
= TREE_VALUE (list
);
1420 tree id
= get_identifier (TREE_STRING_POINTER (tag
));
1421 IDENTIFIER_MARKED (id
) = val
;
1426 /* Check that class T has all the abi tags that subobject SUBOB has, or
1430 check_abi_tags (tree t
, tree subob
)
1432 mark_type_abi_tags (t
, true);
1434 tree subtype
= TYPE_P (subob
) ? subob
: TREE_TYPE (subob
);
1435 struct abi_tag_data data
= { t
, subob
, error_mark_node
};
1437 cp_walk_tree_without_duplicates (&subtype
, find_abi_tags_r
, &data
);
1439 mark_type_abi_tags (t
, false);
1443 inherit_targ_abi_tags (tree t
)
1445 if (CLASSTYPE_TEMPLATE_INFO (t
) == NULL_TREE
)
1448 mark_type_abi_tags (t
, true);
1450 tree args
= CLASSTYPE_TI_ARGS (t
);
1451 struct abi_tag_data data
= { t
, NULL_TREE
, NULL_TREE
};
1452 for (int i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
1454 tree level
= TMPL_ARGS_LEVEL (args
, i
+1);
1455 for (int j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
1457 tree arg
= TREE_VEC_ELT (level
, j
);
1459 cp_walk_tree_without_duplicates (&arg
, find_abi_tags_r
, &data
);
1463 // If we found some tags on our template arguments, add them to our
1464 // abi_tag attribute.
1467 tree attr
= lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (t
));
1469 TREE_VALUE (attr
) = chainon (data
.tags
, TREE_VALUE (attr
));
1472 = tree_cons (get_identifier ("abi_tag"), data
.tags
,
1473 TYPE_ATTRIBUTES (t
));
1476 mark_type_abi_tags (t
, false);
1479 /* Return true, iff class T has a non-virtual destructor that is
1480 accessible from outside the class heirarchy (i.e. is public, or
1481 there's a suitable friend. */
1484 accessible_nvdtor_p (tree t
)
1486 tree dtor
= CLASSTYPE_DESTRUCTORS (t
);
1488 /* An implicitly declared destructor is always public. And,
1489 if it were virtual, we would have created it by now. */
1493 if (DECL_VINDEX (dtor
))
1494 return false; /* Virtual */
1496 if (!TREE_PRIVATE (dtor
) && !TREE_PROTECTED (dtor
))
1497 return true; /* Public */
1499 if (CLASSTYPE_FRIEND_CLASSES (t
)
1500 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t
)))
1501 return true; /* Has friends */
1506 /* Run through the base classes of T, updating CANT_HAVE_CONST_CTOR_P,
1507 and NO_CONST_ASN_REF_P. Also set flag bits in T based on
1508 properties of the bases. */
1511 check_bases (tree t
,
1512 int* cant_have_const_ctor_p
,
1513 int* no_const_asn_ref_p
)
1516 bool seen_non_virtual_nearly_empty_base_p
= 0;
1517 int seen_tm_mask
= 0;
1520 tree field
= NULL_TREE
;
1522 if (!CLASSTYPE_NON_STD_LAYOUT (t
))
1523 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
1524 if (TREE_CODE (field
) == FIELD_DECL
)
1527 for (binfo
= TYPE_BINFO (t
), i
= 0;
1528 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
1530 tree basetype
= TREE_TYPE (base_binfo
);
1532 gcc_assert (COMPLETE_TYPE_P (basetype
));
1534 if (CLASSTYPE_FINAL (basetype
))
1535 error ("cannot derive from %<final%> base %qT in derived type %qT",
1538 /* If any base class is non-literal, so is the derived class. */
1539 if (!CLASSTYPE_LITERAL_P (basetype
))
1540 CLASSTYPE_LITERAL_P (t
) = false;
1542 /* If the base class doesn't have copy constructors or
1543 assignment operators that take const references, then the
1544 derived class cannot have such a member automatically
1546 if (TYPE_HAS_COPY_CTOR (basetype
)
1547 && ! TYPE_HAS_CONST_COPY_CTOR (basetype
))
1548 *cant_have_const_ctor_p
= 1;
1549 if (TYPE_HAS_COPY_ASSIGN (basetype
)
1550 && !TYPE_HAS_CONST_COPY_ASSIGN (basetype
))
1551 *no_const_asn_ref_p
= 1;
1553 if (BINFO_VIRTUAL_P (base_binfo
))
1554 /* A virtual base does not effect nearly emptiness. */
1556 else if (CLASSTYPE_NEARLY_EMPTY_P (basetype
))
1558 if (seen_non_virtual_nearly_empty_base_p
)
1559 /* And if there is more than one nearly empty base, then the
1560 derived class is not nearly empty either. */
1561 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
1563 /* Remember we've seen one. */
1564 seen_non_virtual_nearly_empty_base_p
= 1;
1566 else if (!is_empty_class (basetype
))
1567 /* If the base class is not empty or nearly empty, then this
1568 class cannot be nearly empty. */
1569 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
1571 /* A lot of properties from the bases also apply to the derived
1573 TYPE_NEEDS_CONSTRUCTING (t
) |= TYPE_NEEDS_CONSTRUCTING (basetype
);
1574 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
1575 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (basetype
);
1576 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
)
1577 |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (basetype
)
1578 || !TYPE_HAS_COPY_ASSIGN (basetype
));
1579 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= (TYPE_HAS_COMPLEX_COPY_CTOR (basetype
)
1580 || !TYPE_HAS_COPY_CTOR (basetype
));
1581 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
)
1582 |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (basetype
);
1583 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_HAS_COMPLEX_MOVE_CTOR (basetype
);
1584 TYPE_POLYMORPHIC_P (t
) |= TYPE_POLYMORPHIC_P (basetype
);
1585 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
)
1586 |= CLASSTYPE_CONTAINS_EMPTY_CLASS_P (basetype
);
1587 TYPE_HAS_COMPLEX_DFLT (t
) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
1588 || TYPE_HAS_COMPLEX_DFLT (basetype
));
1589 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT
1590 (t
, CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
)
1591 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (basetype
));
1592 SET_CLASSTYPE_REF_FIELDS_NEED_INIT
1593 (t
, CLASSTYPE_REF_FIELDS_NEED_INIT (t
)
1594 | CLASSTYPE_REF_FIELDS_NEED_INIT (basetype
));
1596 /* A standard-layout class is a class that:
1598 * has no non-standard-layout base classes, */
1599 CLASSTYPE_NON_STD_LAYOUT (t
) |= CLASSTYPE_NON_STD_LAYOUT (basetype
);
1600 if (!CLASSTYPE_NON_STD_LAYOUT (t
))
1603 /* ...has no base classes of the same type as the first non-static
1605 if (field
&& DECL_CONTEXT (field
) == t
1606 && (same_type_ignoring_top_level_qualifiers_p
1607 (TREE_TYPE (field
), basetype
)))
1608 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
1610 /* ...either has no non-static data members in the most-derived
1611 class and at most one base class with non-static data
1612 members, or has no base classes with non-static data
1614 for (basefield
= TYPE_FIELDS (basetype
); basefield
;
1615 basefield
= DECL_CHAIN (basefield
))
1616 if (TREE_CODE (basefield
) == FIELD_DECL
)
1619 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
1626 /* Don't bother collecting tm attributes if transactional memory
1627 support is not enabled. */
1630 tree tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (basetype
));
1632 seen_tm_mask
|= tm_attr_to_mask (tm_attr
);
1635 check_abi_tags (t
, basetype
);
1638 /* If one of the base classes had TM attributes, and the current class
1639 doesn't define its own, then the current class inherits one. */
1640 if (seen_tm_mask
&& !find_tm_attribute (TYPE_ATTRIBUTES (t
)))
1642 tree tm_attr
= tm_mask_to_attr (seen_tm_mask
& -seen_tm_mask
);
1643 TYPE_ATTRIBUTES (t
) = tree_cons (tm_attr
, NULL
, TYPE_ATTRIBUTES (t
));
1647 /* Determine all the primary bases within T. Sets BINFO_PRIMARY_BASE_P for
1648 those that are primaries. Sets BINFO_LOST_PRIMARY_P for those
1649 that have had a nearly-empty virtual primary base stolen by some
1650 other base in the hierarchy. Determines CLASSTYPE_PRIMARY_BASE for
1654 determine_primary_bases (tree t
)
1657 tree primary
= NULL_TREE
;
1658 tree type_binfo
= TYPE_BINFO (t
);
1661 /* Determine the primary bases of our bases. */
1662 for (base_binfo
= TREE_CHAIN (type_binfo
); base_binfo
;
1663 base_binfo
= TREE_CHAIN (base_binfo
))
1665 tree primary
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (base_binfo
));
1667 /* See if we're the non-virtual primary of our inheritance
1669 if (!BINFO_VIRTUAL_P (base_binfo
))
1671 tree parent
= BINFO_INHERITANCE_CHAIN (base_binfo
);
1672 tree parent_primary
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (parent
));
1675 && SAME_BINFO_TYPE_P (BINFO_TYPE (base_binfo
),
1676 BINFO_TYPE (parent_primary
)))
1677 /* We are the primary binfo. */
1678 BINFO_PRIMARY_P (base_binfo
) = 1;
1680 /* Determine if we have a virtual primary base, and mark it so.
1682 if (primary
&& BINFO_VIRTUAL_P (primary
))
1684 tree this_primary
= copied_binfo (primary
, base_binfo
);
1686 if (BINFO_PRIMARY_P (this_primary
))
1687 /* Someone already claimed this base. */
1688 BINFO_LOST_PRIMARY_P (base_binfo
) = 1;
1693 BINFO_PRIMARY_P (this_primary
) = 1;
1694 BINFO_INHERITANCE_CHAIN (this_primary
) = base_binfo
;
1696 /* A virtual binfo might have been copied from within
1697 another hierarchy. As we're about to use it as a
1698 primary base, make sure the offsets match. */
1699 delta
= size_diffop_loc (input_location
,
1701 BINFO_OFFSET (base_binfo
)),
1703 BINFO_OFFSET (this_primary
)));
1705 propagate_binfo_offsets (this_primary
, delta
);
1710 /* First look for a dynamic direct non-virtual base. */
1711 for (i
= 0; BINFO_BASE_ITERATE (type_binfo
, i
, base_binfo
); i
++)
1713 tree basetype
= BINFO_TYPE (base_binfo
);
1715 if (TYPE_CONTAINS_VPTR_P (basetype
) && !BINFO_VIRTUAL_P (base_binfo
))
1717 primary
= base_binfo
;
1722 /* A "nearly-empty" virtual base class can be the primary base
1723 class, if no non-virtual polymorphic base can be found. Look for
1724 a nearly-empty virtual dynamic base that is not already a primary
1725 base of something in the hierarchy. If there is no such base,
1726 just pick the first nearly-empty virtual base. */
1728 for (base_binfo
= TREE_CHAIN (type_binfo
); base_binfo
;
1729 base_binfo
= TREE_CHAIN (base_binfo
))
1730 if (BINFO_VIRTUAL_P (base_binfo
)
1731 && CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (base_binfo
)))
1733 if (!BINFO_PRIMARY_P (base_binfo
))
1735 /* Found one that is not primary. */
1736 primary
= base_binfo
;
1740 /* Remember the first candidate. */
1741 primary
= base_binfo
;
1745 /* If we've got a primary base, use it. */
1748 tree basetype
= BINFO_TYPE (primary
);
1750 CLASSTYPE_PRIMARY_BINFO (t
) = primary
;
1751 if (BINFO_PRIMARY_P (primary
))
1752 /* We are stealing a primary base. */
1753 BINFO_LOST_PRIMARY_P (BINFO_INHERITANCE_CHAIN (primary
)) = 1;
1754 BINFO_PRIMARY_P (primary
) = 1;
1755 if (BINFO_VIRTUAL_P (primary
))
1759 BINFO_INHERITANCE_CHAIN (primary
) = type_binfo
;
1760 /* A virtual binfo might have been copied from within
1761 another hierarchy. As we're about to use it as a primary
1762 base, make sure the offsets match. */
1763 delta
= size_diffop_loc (input_location
, ssize_int (0),
1764 convert (ssizetype
, BINFO_OFFSET (primary
)));
1766 propagate_binfo_offsets (primary
, delta
);
1769 primary
= TYPE_BINFO (basetype
);
1771 TYPE_VFIELD (t
) = TYPE_VFIELD (basetype
);
1772 BINFO_VTABLE (type_binfo
) = BINFO_VTABLE (primary
);
1773 BINFO_VIRTUALS (type_binfo
) = BINFO_VIRTUALS (primary
);
1777 /* Update the variant types of T. */
1780 fixup_type_variants (tree t
)
1787 for (variants
= TYPE_NEXT_VARIANT (t
);
1789 variants
= TYPE_NEXT_VARIANT (variants
))
1791 /* These fields are in the _TYPE part of the node, not in
1792 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1793 TYPE_HAS_USER_CONSTRUCTOR (variants
) = TYPE_HAS_USER_CONSTRUCTOR (t
);
1794 TYPE_NEEDS_CONSTRUCTING (variants
) = TYPE_NEEDS_CONSTRUCTING (t
);
1795 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (variants
)
1796 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
);
1798 TYPE_POLYMORPHIC_P (variants
) = TYPE_POLYMORPHIC_P (t
);
1800 TYPE_BINFO (variants
) = TYPE_BINFO (t
);
1802 /* Copy whatever these are holding today. */
1803 TYPE_VFIELD (variants
) = TYPE_VFIELD (t
);
1804 TYPE_METHODS (variants
) = TYPE_METHODS (t
);
1805 TYPE_FIELDS (variants
) = TYPE_FIELDS (t
);
1809 /* Early variant fixups: we apply attributes at the beginning of the class
1810 definition, and we need to fix up any variants that have already been
1811 made via elaborated-type-specifier so that check_qualified_type works. */
1814 fixup_attribute_variants (tree t
)
1821 for (variants
= TYPE_NEXT_VARIANT (t
);
1823 variants
= TYPE_NEXT_VARIANT (variants
))
1825 /* These are the two fields that check_qualified_type looks at and
1826 are affected by attributes. */
1827 TYPE_ATTRIBUTES (variants
) = TYPE_ATTRIBUTES (t
);
1828 TYPE_ALIGN (variants
) = TYPE_ALIGN (t
);
1832 /* Set memoizing fields and bits of T (and its variants) for later
1836 finish_struct_bits (tree t
)
1838 /* Fix up variants (if any). */
1839 fixup_type_variants (t
);
1841 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t
)) && TYPE_POLYMORPHIC_P (t
))
1842 /* For a class w/o baseclasses, 'finish_struct' has set
1843 CLASSTYPE_PURE_VIRTUALS correctly (by definition).
1844 Similarly for a class whose base classes do not have vtables.
1845 When neither of these is true, we might have removed abstract
1846 virtuals (by providing a definition), added some (by declaring
1847 new ones), or redeclared ones from a base class. We need to
1848 recalculate what's really an abstract virtual at this point (by
1849 looking in the vtables). */
1850 get_pure_virtuals (t
);
1852 /* If this type has a copy constructor or a destructor, force its
1853 mode to be BLKmode, and force its TREE_ADDRESSABLE bit to be
1854 nonzero. This will cause it to be passed by invisible reference
1855 and prevent it from being returned in a register. */
1856 if (type_has_nontrivial_copy_init (t
)
1857 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
1860 DECL_MODE (TYPE_MAIN_DECL (t
)) = BLKmode
;
1861 for (variants
= t
; variants
; variants
= TYPE_NEXT_VARIANT (variants
))
1863 SET_TYPE_MODE (variants
, BLKmode
);
1864 TREE_ADDRESSABLE (variants
) = 1;
1869 /* Issue warnings about T having private constructors, but no friends,
1872 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
1873 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
1874 non-private static member functions. */
1877 maybe_warn_about_overly_private_class (tree t
)
1879 int has_member_fn
= 0;
1880 int has_nonprivate_method
= 0;
1883 if (!warn_ctor_dtor_privacy
1884 /* If the class has friends, those entities might create and
1885 access instances, so we should not warn. */
1886 || (CLASSTYPE_FRIEND_CLASSES (t
)
1887 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t
)))
1888 /* We will have warned when the template was declared; there's
1889 no need to warn on every instantiation. */
1890 || CLASSTYPE_TEMPLATE_INSTANTIATION (t
))
1891 /* There's no reason to even consider warning about this
1895 /* We only issue one warning, if more than one applies, because
1896 otherwise, on code like:
1899 // Oops - forgot `public:'
1905 we warn several times about essentially the same problem. */
1907 /* Check to see if all (non-constructor, non-destructor) member
1908 functions are private. (Since there are no friends or
1909 non-private statics, we can't ever call any of the private member
1911 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
1912 /* We're not interested in compiler-generated methods; they don't
1913 provide any way to call private members. */
1914 if (!DECL_ARTIFICIAL (fn
))
1916 if (!TREE_PRIVATE (fn
))
1918 if (DECL_STATIC_FUNCTION_P (fn
))
1919 /* A non-private static member function is just like a
1920 friend; it can create and invoke private member
1921 functions, and be accessed without a class
1925 has_nonprivate_method
= 1;
1926 /* Keep searching for a static member function. */
1928 else if (!DECL_CONSTRUCTOR_P (fn
) && !DECL_DESTRUCTOR_P (fn
))
1932 if (!has_nonprivate_method
&& has_member_fn
)
1934 /* There are no non-private methods, and there's at least one
1935 private member function that isn't a constructor or
1936 destructor. (If all the private members are
1937 constructors/destructors we want to use the code below that
1938 issues error messages specifically referring to
1939 constructors/destructors.) */
1941 tree binfo
= TYPE_BINFO (t
);
1943 for (i
= 0; i
!= BINFO_N_BASE_BINFOS (binfo
); i
++)
1944 if (BINFO_BASE_ACCESS (binfo
, i
) != access_private_node
)
1946 has_nonprivate_method
= 1;
1949 if (!has_nonprivate_method
)
1951 warning (OPT_Wctor_dtor_privacy
,
1952 "all member functions in class %qT are private", t
);
1957 /* Even if some of the member functions are non-private, the class
1958 won't be useful for much if all the constructors or destructors
1959 are private: such an object can never be created or destroyed. */
1960 fn
= CLASSTYPE_DESTRUCTORS (t
);
1961 if (fn
&& TREE_PRIVATE (fn
))
1963 warning (OPT_Wctor_dtor_privacy
,
1964 "%q#T only defines a private destructor and has no friends",
1969 /* Warn about classes that have private constructors and no friends. */
1970 if (TYPE_HAS_USER_CONSTRUCTOR (t
)
1971 /* Implicitly generated constructors are always public. */
1972 && (!CLASSTYPE_LAZY_DEFAULT_CTOR (t
)
1973 || !CLASSTYPE_LAZY_COPY_CTOR (t
)))
1975 int nonprivate_ctor
= 0;
1977 /* If a non-template class does not define a copy
1978 constructor, one is defined for it, enabling it to avoid
1979 this warning. For a template class, this does not
1980 happen, and so we would normally get a warning on:
1982 template <class T> class C { private: C(); };
1984 To avoid this asymmetry, we check TYPE_HAS_COPY_CTOR. All
1985 complete non-template or fully instantiated classes have this
1987 if (!TYPE_HAS_COPY_CTOR (t
))
1988 nonprivate_ctor
= 1;
1990 for (fn
= CLASSTYPE_CONSTRUCTORS (t
); fn
; fn
= OVL_NEXT (fn
))
1992 tree ctor
= OVL_CURRENT (fn
);
1993 /* Ideally, we wouldn't count copy constructors (or, in
1994 fact, any constructor that takes an argument of the
1995 class type as a parameter) because such things cannot
1996 be used to construct an instance of the class unless
1997 you already have one. But, for now at least, we're
1999 if (! TREE_PRIVATE (ctor
))
2001 nonprivate_ctor
= 1;
2006 if (nonprivate_ctor
== 0)
2008 warning (OPT_Wctor_dtor_privacy
,
2009 "%q#T only defines private constructors and has no friends",
2017 gt_pointer_operator new_value
;
2021 /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */
2024 method_name_cmp (const void* m1_p
, const void* m2_p
)
2026 const tree
*const m1
= (const tree
*) m1_p
;
2027 const tree
*const m2
= (const tree
*) m2_p
;
2029 if (*m1
== NULL_TREE
&& *m2
== NULL_TREE
)
2031 if (*m1
== NULL_TREE
)
2033 if (*m2
== NULL_TREE
)
2035 if (DECL_NAME (OVL_CURRENT (*m1
)) < DECL_NAME (OVL_CURRENT (*m2
)))
2040 /* This routine compares two fields like method_name_cmp but using the
2041 pointer operator in resort_field_decl_data. */
2044 resort_method_name_cmp (const void* m1_p
, const void* m2_p
)
2046 const tree
*const m1
= (const tree
*) m1_p
;
2047 const tree
*const m2
= (const tree
*) m2_p
;
2048 if (*m1
== NULL_TREE
&& *m2
== NULL_TREE
)
2050 if (*m1
== NULL_TREE
)
2052 if (*m2
== NULL_TREE
)
2055 tree d1
= DECL_NAME (OVL_CURRENT (*m1
));
2056 tree d2
= DECL_NAME (OVL_CURRENT (*m2
));
2057 resort_data
.new_value (&d1
, resort_data
.cookie
);
2058 resort_data
.new_value (&d2
, resort_data
.cookie
);
2065 /* Resort TYPE_METHOD_VEC because pointers have been reordered. */
2068 resort_type_method_vec (void* obj
,
2070 gt_pointer_operator new_value
,
2073 vec
<tree
, va_gc
> *method_vec
= (vec
<tree
, va_gc
> *) obj
;
2074 int len
= vec_safe_length (method_vec
);
2078 /* The type conversion ops have to live at the front of the vec, so we
2080 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2081 vec_safe_iterate (method_vec
, slot
, &fn
);
2083 if (!DECL_CONV_FN_P (OVL_CURRENT (fn
)))
2088 resort_data
.new_value
= new_value
;
2089 resort_data
.cookie
= cookie
;
2090 qsort (method_vec
->address () + slot
, len
- slot
, sizeof (tree
),
2091 resort_method_name_cmp
);
2095 /* Warn about duplicate methods in fn_fields.
2097 Sort methods that are not special (i.e., constructors, destructors,
2098 and type conversion operators) so that we can find them faster in
2102 finish_struct_methods (tree t
)
2105 vec
<tree
, va_gc
> *method_vec
;
2108 method_vec
= CLASSTYPE_METHOD_VEC (t
);
2112 len
= method_vec
->length ();
2114 /* Clear DECL_IN_AGGR_P for all functions. */
2115 for (fn_fields
= TYPE_METHODS (t
); fn_fields
;
2116 fn_fields
= DECL_CHAIN (fn_fields
))
2117 DECL_IN_AGGR_P (fn_fields
) = 0;
2119 /* Issue warnings about private constructors and such. If there are
2120 no methods, then some public defaults are generated. */
2121 maybe_warn_about_overly_private_class (t
);
2123 /* The type conversion ops have to live at the front of the vec, so we
2125 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2126 method_vec
->iterate (slot
, &fn_fields
);
2128 if (!DECL_CONV_FN_P (OVL_CURRENT (fn_fields
)))
2131 qsort (method_vec
->address () + slot
,
2132 len
-slot
, sizeof (tree
), method_name_cmp
);
2135 /* Make BINFO's vtable have N entries, including RTTI entries,
2136 vbase and vcall offsets, etc. Set its type and call the back end
2140 layout_vtable_decl (tree binfo
, int n
)
2145 atype
= build_array_of_n_type (vtable_entry_type
, n
);
2146 layout_type (atype
);
2148 /* We may have to grow the vtable. */
2149 vtable
= get_vtbl_decl_for_binfo (binfo
);
2150 if (!same_type_p (TREE_TYPE (vtable
), atype
))
2152 TREE_TYPE (vtable
) = atype
;
2153 DECL_SIZE (vtable
) = DECL_SIZE_UNIT (vtable
) = NULL_TREE
;
2154 layout_decl (vtable
, 0);
2158 /* True iff FNDECL and BASE_FNDECL (both non-static member functions)
2159 have the same signature. */
2162 same_signature_p (const_tree fndecl
, const_tree base_fndecl
)
2164 /* One destructor overrides another if they are the same kind of
2166 if (DECL_DESTRUCTOR_P (base_fndecl
) && DECL_DESTRUCTOR_P (fndecl
)
2167 && special_function_p (base_fndecl
) == special_function_p (fndecl
))
2169 /* But a non-destructor never overrides a destructor, nor vice
2170 versa, nor do different kinds of destructors override
2171 one-another. For example, a complete object destructor does not
2172 override a deleting destructor. */
2173 if (DECL_DESTRUCTOR_P (base_fndecl
) || DECL_DESTRUCTOR_P (fndecl
))
2176 if (DECL_NAME (fndecl
) == DECL_NAME (base_fndecl
)
2177 || (DECL_CONV_FN_P (fndecl
)
2178 && DECL_CONV_FN_P (base_fndecl
)
2179 && same_type_p (DECL_CONV_FN_TYPE (fndecl
),
2180 DECL_CONV_FN_TYPE (base_fndecl
))))
2182 tree fntype
= TREE_TYPE (fndecl
);
2183 tree base_fntype
= TREE_TYPE (base_fndecl
);
2184 if (type_memfn_quals (fntype
) == type_memfn_quals (base_fntype
)
2185 && type_memfn_rqual (fntype
) == type_memfn_rqual (base_fntype
)
2186 && compparms (FUNCTION_FIRST_USER_PARMTYPE (fndecl
),
2187 FUNCTION_FIRST_USER_PARMTYPE (base_fndecl
)))
2193 /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a
2197 base_derived_from (tree derived
, tree base
)
2201 for (probe
= base
; probe
; probe
= BINFO_INHERITANCE_CHAIN (probe
))
2203 if (probe
== derived
)
2205 else if (BINFO_VIRTUAL_P (probe
))
2206 /* If we meet a virtual base, we can't follow the inheritance
2207 any more. See if the complete type of DERIVED contains
2208 such a virtual base. */
2209 return (binfo_for_vbase (BINFO_TYPE (probe
), BINFO_TYPE (derived
))
2215 typedef struct find_final_overrider_data_s
{
2216 /* The function for which we are trying to find a final overrider. */
2218 /* The base class in which the function was declared. */
2219 tree declaring_base
;
2220 /* The candidate overriders. */
2222 /* Path to most derived. */
2224 } find_final_overrider_data
;
2226 /* Add the overrider along the current path to FFOD->CANDIDATES.
2227 Returns true if an overrider was found; false otherwise. */
2230 dfs_find_final_overrider_1 (tree binfo
,
2231 find_final_overrider_data
*ffod
,
2236 /* If BINFO is not the most derived type, try a more derived class.
2237 A definition there will overrider a definition here. */
2241 if (dfs_find_final_overrider_1
2242 (ffod
->path
[depth
], ffod
, depth
))
2246 method
= look_for_overrides_here (BINFO_TYPE (binfo
), ffod
->fn
);
2249 tree
*candidate
= &ffod
->candidates
;
2251 /* Remove any candidates overridden by this new function. */
2254 /* If *CANDIDATE overrides METHOD, then METHOD
2255 cannot override anything else on the list. */
2256 if (base_derived_from (TREE_VALUE (*candidate
), binfo
))
2258 /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */
2259 if (base_derived_from (binfo
, TREE_VALUE (*candidate
)))
2260 *candidate
= TREE_CHAIN (*candidate
);
2262 candidate
= &TREE_CHAIN (*candidate
);
2265 /* Add the new function. */
2266 ffod
->candidates
= tree_cons (method
, binfo
, ffod
->candidates
);
2273 /* Called from find_final_overrider via dfs_walk. */
2276 dfs_find_final_overrider_pre (tree binfo
, void *data
)
2278 find_final_overrider_data
*ffod
= (find_final_overrider_data
*) data
;
2280 if (binfo
== ffod
->declaring_base
)
2281 dfs_find_final_overrider_1 (binfo
, ffod
, ffod
->path
.length ());
2282 ffod
->path
.safe_push (binfo
);
2288 dfs_find_final_overrider_post (tree
/*binfo*/, void *data
)
2290 find_final_overrider_data
*ffod
= (find_final_overrider_data
*) data
;
2296 /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for
2297 FN and whose TREE_VALUE is the binfo for the base where the
2298 overriding occurs. BINFO (in the hierarchy dominated by the binfo
2299 DERIVED) is the base object in which FN is declared. */
2302 find_final_overrider (tree derived
, tree binfo
, tree fn
)
2304 find_final_overrider_data ffod
;
2306 /* Getting this right is a little tricky. This is valid:
2308 struct S { virtual void f (); };
2309 struct T { virtual void f (); };
2310 struct U : public S, public T { };
2312 even though calling `f' in `U' is ambiguous. But,
2314 struct R { virtual void f(); };
2315 struct S : virtual public R { virtual void f (); };
2316 struct T : virtual public R { virtual void f (); };
2317 struct U : public S, public T { };
2319 is not -- there's no way to decide whether to put `S::f' or
2320 `T::f' in the vtable for `R'.
2322 The solution is to look at all paths to BINFO. If we find
2323 different overriders along any two, then there is a problem. */
2324 if (DECL_THUNK_P (fn
))
2325 fn
= THUNK_TARGET (fn
);
2327 /* Determine the depth of the hierarchy. */
2329 ffod
.declaring_base
= binfo
;
2330 ffod
.candidates
= NULL_TREE
;
2331 ffod
.path
.create (30);
2333 dfs_walk_all (derived
, dfs_find_final_overrider_pre
,
2334 dfs_find_final_overrider_post
, &ffod
);
2336 ffod
.path
.release ();
2338 /* If there was no winner, issue an error message. */
2339 if (!ffod
.candidates
|| TREE_CHAIN (ffod
.candidates
))
2340 return error_mark_node
;
2342 return ffod
.candidates
;
2345 /* Return the index of the vcall offset for FN when TYPE is used as a
2349 get_vcall_index (tree fn
, tree type
)
2351 vec
<tree_pair_s
, va_gc
> *indices
= CLASSTYPE_VCALL_INDICES (type
);
2355 FOR_EACH_VEC_SAFE_ELT (indices
, ix
, p
)
2356 if ((DECL_DESTRUCTOR_P (fn
) && DECL_DESTRUCTOR_P (p
->purpose
))
2357 || same_signature_p (fn
, p
->purpose
))
2360 /* There should always be an appropriate index. */
2364 /* Update an entry in the vtable for BINFO, which is in the hierarchy
2365 dominated by T. FN is the old function; VIRTUALS points to the
2366 corresponding position in the new BINFO_VIRTUALS list. IX is the index
2367 of that entry in the list. */
2370 update_vtable_entry_for_fn (tree t
, tree binfo
, tree fn
, tree
* virtuals
,
2378 tree overrider_fn
, overrider_target
;
2379 tree target_fn
= DECL_THUNK_P (fn
) ? THUNK_TARGET (fn
) : fn
;
2380 tree over_return
, base_return
;
2383 /* Find the nearest primary base (possibly binfo itself) which defines
2384 this function; this is the class the caller will convert to when
2385 calling FN through BINFO. */
2386 for (b
= binfo
; ; b
= get_primary_binfo (b
))
2389 if (look_for_overrides_here (BINFO_TYPE (b
), target_fn
))
2392 /* The nearest definition is from a lost primary. */
2393 if (BINFO_LOST_PRIMARY_P (b
))
2398 /* Find the final overrider. */
2399 overrider
= find_final_overrider (TYPE_BINFO (t
), b
, target_fn
);
2400 if (overrider
== error_mark_node
)
2402 error ("no unique final overrider for %qD in %qT", target_fn
, t
);
2405 overrider_target
= overrider_fn
= TREE_PURPOSE (overrider
);
2407 /* Check for adjusting covariant return types. */
2408 over_return
= TREE_TYPE (TREE_TYPE (overrider_target
));
2409 base_return
= TREE_TYPE (TREE_TYPE (target_fn
));
2411 if (POINTER_TYPE_P (over_return
)
2412 && TREE_CODE (over_return
) == TREE_CODE (base_return
)
2413 && CLASS_TYPE_P (TREE_TYPE (over_return
))
2414 && CLASS_TYPE_P (TREE_TYPE (base_return
))
2415 /* If the overrider is invalid, don't even try. */
2416 && !DECL_INVALID_OVERRIDER_P (overrider_target
))
2418 /* If FN is a covariant thunk, we must figure out the adjustment
2419 to the final base FN was converting to. As OVERRIDER_TARGET might
2420 also be converting to the return type of FN, we have to
2421 combine the two conversions here. */
2422 tree fixed_offset
, virtual_offset
;
2424 over_return
= TREE_TYPE (over_return
);
2425 base_return
= TREE_TYPE (base_return
);
2427 if (DECL_THUNK_P (fn
))
2429 gcc_assert (DECL_RESULT_THUNK_P (fn
));
2430 fixed_offset
= ssize_int (THUNK_FIXED_OFFSET (fn
));
2431 virtual_offset
= THUNK_VIRTUAL_OFFSET (fn
);
2434 fixed_offset
= virtual_offset
= NULL_TREE
;
2437 /* Find the equivalent binfo within the return type of the
2438 overriding function. We will want the vbase offset from
2440 virtual_offset
= binfo_for_vbase (BINFO_TYPE (virtual_offset
),
2442 else if (!same_type_ignoring_top_level_qualifiers_p
2443 (over_return
, base_return
))
2445 /* There was no existing virtual thunk (which takes
2446 precedence). So find the binfo of the base function's
2447 return type within the overriding function's return type.
2448 We cannot call lookup base here, because we're inside a
2449 dfs_walk, and will therefore clobber the BINFO_MARKED
2450 flags. Fortunately we know the covariancy is valid (it
2451 has already been checked), so we can just iterate along
2452 the binfos, which have been chained in inheritance graph
2453 order. Of course it is lame that we have to repeat the
2454 search here anyway -- we should really be caching pieces
2455 of the vtable and avoiding this repeated work. */
2456 tree thunk_binfo
, base_binfo
;
2458 /* Find the base binfo within the overriding function's
2459 return type. We will always find a thunk_binfo, except
2460 when the covariancy is invalid (which we will have
2461 already diagnosed). */
2462 for (base_binfo
= TYPE_BINFO (base_return
),
2463 thunk_binfo
= TYPE_BINFO (over_return
);
2465 thunk_binfo
= TREE_CHAIN (thunk_binfo
))
2466 if (SAME_BINFO_TYPE_P (BINFO_TYPE (thunk_binfo
),
2467 BINFO_TYPE (base_binfo
)))
2470 /* See if virtual inheritance is involved. */
2471 for (virtual_offset
= thunk_binfo
;
2473 virtual_offset
= BINFO_INHERITANCE_CHAIN (virtual_offset
))
2474 if (BINFO_VIRTUAL_P (virtual_offset
))
2478 || (thunk_binfo
&& !BINFO_OFFSET_ZEROP (thunk_binfo
)))
2480 tree offset
= convert (ssizetype
, BINFO_OFFSET (thunk_binfo
));
2484 /* We convert via virtual base. Adjust the fixed
2485 offset to be from there. */
2487 size_diffop (offset
,
2489 BINFO_OFFSET (virtual_offset
)));
2492 /* There was an existing fixed offset, this must be
2493 from the base just converted to, and the base the
2494 FN was thunking to. */
2495 fixed_offset
= size_binop (PLUS_EXPR
, fixed_offset
, offset
);
2497 fixed_offset
= offset
;
2501 if (fixed_offset
|| virtual_offset
)
2502 /* Replace the overriding function with a covariant thunk. We
2503 will emit the overriding function in its own slot as
2505 overrider_fn
= make_thunk (overrider_target
, /*this_adjusting=*/0,
2506 fixed_offset
, virtual_offset
);
2509 gcc_assert (DECL_INVALID_OVERRIDER_P (overrider_target
) ||
2510 !DECL_THUNK_P (fn
));
2512 /* If we need a covariant thunk, then we may need to adjust first_defn.
2513 The ABI specifies that the thunks emitted with a function are
2514 determined by which bases the function overrides, so we need to be
2515 sure that we're using a thunk for some overridden base; even if we
2516 know that the necessary this adjustment is zero, there may not be an
2517 appropriate zero-this-adjusment thunk for us to use since thunks for
2518 overriding virtual bases always use the vcall offset.
2520 Furthermore, just choosing any base that overrides this function isn't
2521 quite right, as this slot won't be used for calls through a type that
2522 puts a covariant thunk here. Calling the function through such a type
2523 will use a different slot, and that slot is the one that determines
2524 the thunk emitted for that base.
2526 So, keep looking until we find the base that we're really overriding
2527 in this slot: the nearest primary base that doesn't use a covariant
2528 thunk in this slot. */
2529 if (overrider_target
!= overrider_fn
)
2531 if (BINFO_TYPE (b
) == DECL_CONTEXT (overrider_target
))
2532 /* We already know that the overrider needs a covariant thunk. */
2533 b
= get_primary_binfo (b
);
2534 for (; ; b
= get_primary_binfo (b
))
2536 tree main_binfo
= TYPE_BINFO (BINFO_TYPE (b
));
2537 tree bv
= chain_index (ix
, BINFO_VIRTUALS (main_binfo
));
2538 if (!DECL_THUNK_P (TREE_VALUE (bv
)))
2540 if (BINFO_LOST_PRIMARY_P (b
))
2546 /* Assume that we will produce a thunk that convert all the way to
2547 the final overrider, and not to an intermediate virtual base. */
2548 virtual_base
= NULL_TREE
;
2550 /* See if we can convert to an intermediate virtual base first, and then
2551 use the vcall offset located there to finish the conversion. */
2552 for (; b
; b
= BINFO_INHERITANCE_CHAIN (b
))
2554 /* If we find the final overrider, then we can stop
2556 if (SAME_BINFO_TYPE_P (BINFO_TYPE (b
),
2557 BINFO_TYPE (TREE_VALUE (overrider
))))
2560 /* If we find a virtual base, and we haven't yet found the
2561 overrider, then there is a virtual base between the
2562 declaring base (first_defn) and the final overrider. */
2563 if (BINFO_VIRTUAL_P (b
))
2570 /* Compute the constant adjustment to the `this' pointer. The
2571 `this' pointer, when this function is called, will point at BINFO
2572 (or one of its primary bases, which are at the same offset). */
2574 /* The `this' pointer needs to be adjusted from the declaration to
2575 the nearest virtual base. */
2576 delta
= size_diffop_loc (input_location
,
2577 convert (ssizetype
, BINFO_OFFSET (virtual_base
)),
2578 convert (ssizetype
, BINFO_OFFSET (first_defn
)));
2580 /* If the nearest definition is in a lost primary, we don't need an
2581 entry in our vtable. Except possibly in a constructor vtable,
2582 if we happen to get our primary back. In that case, the offset
2583 will be zero, as it will be a primary base. */
2584 delta
= size_zero_node
;
2586 /* The `this' pointer needs to be adjusted from pointing to
2587 BINFO to pointing at the base where the final overrider
2589 delta
= size_diffop_loc (input_location
,
2591 BINFO_OFFSET (TREE_VALUE (overrider
))),
2592 convert (ssizetype
, BINFO_OFFSET (binfo
)));
2594 modify_vtable_entry (t
, binfo
, overrider_fn
, delta
, virtuals
);
2597 BV_VCALL_INDEX (*virtuals
)
2598 = get_vcall_index (overrider_target
, BINFO_TYPE (virtual_base
));
2600 BV_VCALL_INDEX (*virtuals
) = NULL_TREE
;
2602 BV_LOST_PRIMARY (*virtuals
) = lost
;
2605 /* Called from modify_all_vtables via dfs_walk. */
2608 dfs_modify_vtables (tree binfo
, void* data
)
2610 tree t
= (tree
) data
;
2615 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
2616 /* A base without a vtable needs no modification, and its bases
2617 are uninteresting. */
2618 return dfs_skip_bases
;
2620 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
)
2621 && !CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
2622 /* Don't do the primary vtable, if it's new. */
2625 if (BINFO_PRIMARY_P (binfo
) && !BINFO_VIRTUAL_P (binfo
))
2626 /* There's no need to modify the vtable for a non-virtual primary
2627 base; we're not going to use that vtable anyhow. We do still
2628 need to do this for virtual primary bases, as they could become
2629 non-primary in a construction vtable. */
2632 make_new_vtable (t
, binfo
);
2634 /* Now, go through each of the virtual functions in the virtual
2635 function table for BINFO. Find the final overrider, and update
2636 the BINFO_VIRTUALS list appropriately. */
2637 for (ix
= 0, virtuals
= BINFO_VIRTUALS (binfo
),
2638 old_virtuals
= BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo
)));
2640 ix
++, virtuals
= TREE_CHAIN (virtuals
),
2641 old_virtuals
= TREE_CHAIN (old_virtuals
))
2642 update_vtable_entry_for_fn (t
,
2644 BV_FN (old_virtuals
),
2650 /* Update all of the primary and secondary vtables for T. Create new
2651 vtables as required, and initialize their RTTI information. Each
2652 of the functions in VIRTUALS is declared in T and may override a
2653 virtual function from a base class; find and modify the appropriate
2654 entries to point to the overriding functions. Returns a list, in
2655 declaration order, of the virtual functions that are declared in T,
2656 but do not appear in the primary base class vtable, and which
2657 should therefore be appended to the end of the vtable for T. */
2660 modify_all_vtables (tree t
, tree virtuals
)
2662 tree binfo
= TYPE_BINFO (t
);
2665 /* Mangle the vtable name before entering dfs_walk (c++/51884). */
2666 if (TYPE_CONTAINS_VPTR_P (t
))
2667 get_vtable_decl (t
, false);
2669 /* Update all of the vtables. */
2670 dfs_walk_once (binfo
, dfs_modify_vtables
, NULL
, t
);
2672 /* Add virtual functions not already in our primary vtable. These
2673 will be both those introduced by this class, and those overridden
2674 from secondary bases. It does not include virtuals merely
2675 inherited from secondary bases. */
2676 for (fnsp
= &virtuals
; *fnsp
; )
2678 tree fn
= TREE_VALUE (*fnsp
);
2680 if (!value_member (fn
, BINFO_VIRTUALS (binfo
))
2681 || DECL_VINDEX (fn
) == error_mark_node
)
2683 /* We don't need to adjust the `this' pointer when
2684 calling this function. */
2685 BV_DELTA (*fnsp
) = integer_zero_node
;
2686 BV_VCALL_INDEX (*fnsp
) = NULL_TREE
;
2688 /* This is a function not already in our vtable. Keep it. */
2689 fnsp
= &TREE_CHAIN (*fnsp
);
2692 /* We've already got an entry for this function. Skip it. */
2693 *fnsp
= TREE_CHAIN (*fnsp
);
2699 /* Get the base virtual function declarations in T that have the
2703 get_basefndecls (tree name
, tree t
)
2706 tree base_fndecls
= NULL_TREE
;
2707 int n_baseclasses
= BINFO_N_BASE_BINFOS (TYPE_BINFO (t
));
2710 /* Find virtual functions in T with the indicated NAME. */
2711 i
= lookup_fnfields_1 (t
, name
);
2713 for (methods
= (*CLASSTYPE_METHOD_VEC (t
))[i
];
2715 methods
= OVL_NEXT (methods
))
2717 tree method
= OVL_CURRENT (methods
);
2719 if (TREE_CODE (method
) == FUNCTION_DECL
2720 && DECL_VINDEX (method
))
2721 base_fndecls
= tree_cons (NULL_TREE
, method
, base_fndecls
);
2725 return base_fndecls
;
2727 for (i
= 0; i
< n_baseclasses
; i
++)
2729 tree basetype
= BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (t
), i
));
2730 base_fndecls
= chainon (get_basefndecls (name
, basetype
),
2734 return base_fndecls
;
2737 /* If this declaration supersedes the declaration of
2738 a method declared virtual in the base class, then
2739 mark this field as being virtual as well. */
2742 check_for_override (tree decl
, tree ctype
)
2744 bool overrides_found
= false;
2745 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2746 /* In [temp.mem] we have:
2748 A specialization of a member function template does not
2749 override a virtual function from a base class. */
2751 if ((DECL_DESTRUCTOR_P (decl
)
2752 || IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
))
2753 || DECL_CONV_FN_P (decl
))
2754 && look_for_overrides (ctype
, decl
)
2755 && !DECL_STATIC_FUNCTION_P (decl
))
2756 /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor
2757 the error_mark_node so that we know it is an overriding
2760 DECL_VINDEX (decl
) = decl
;
2761 overrides_found
= true;
2764 if (DECL_VIRTUAL_P (decl
))
2766 if (!DECL_VINDEX (decl
))
2767 DECL_VINDEX (decl
) = error_mark_node
;
2768 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
2769 if (DECL_DESTRUCTOR_P (decl
))
2770 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (ctype
) = true;
2772 else if (DECL_FINAL_P (decl
))
2773 error ("%q+#D marked %<final%>, but is not virtual", decl
);
2774 if (DECL_OVERRIDE_P (decl
) && !overrides_found
)
2775 error ("%q+#D marked %<override%>, but does not override", decl
);
2778 /* Warn about hidden virtual functions that are not overridden in t.
2779 We know that constructors and destructors don't apply. */
2782 warn_hidden (tree t
)
2784 vec
<tree
, va_gc
> *method_vec
= CLASSTYPE_METHOD_VEC (t
);
2788 /* We go through each separately named virtual function. */
2789 for (i
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2790 vec_safe_iterate (method_vec
, i
, &fns
);
2801 /* All functions in this slot in the CLASSTYPE_METHOD_VEC will
2802 have the same name. Figure out what name that is. */
2803 name
= DECL_NAME (OVL_CURRENT (fns
));
2804 /* There are no possibly hidden functions yet. */
2805 base_fndecls
= NULL_TREE
;
2806 /* Iterate through all of the base classes looking for possibly
2807 hidden functions. */
2808 for (binfo
= TYPE_BINFO (t
), j
= 0;
2809 BINFO_BASE_ITERATE (binfo
, j
, base_binfo
); j
++)
2811 tree basetype
= BINFO_TYPE (base_binfo
);
2812 base_fndecls
= chainon (get_basefndecls (name
, basetype
),
2816 /* If there are no functions to hide, continue. */
2820 /* Remove any overridden functions. */
2821 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
2823 fndecl
= OVL_CURRENT (fn
);
2824 if (DECL_VINDEX (fndecl
))
2826 tree
*prev
= &base_fndecls
;
2829 /* If the method from the base class has the same
2830 signature as the method from the derived class, it
2831 has been overridden. */
2832 if (same_signature_p (fndecl
, TREE_VALUE (*prev
)))
2833 *prev
= TREE_CHAIN (*prev
);
2835 prev
= &TREE_CHAIN (*prev
);
2839 /* Now give a warning for all base functions without overriders,
2840 as they are hidden. */
2841 while (base_fndecls
)
2843 /* Here we know it is a hider, and no overrider exists. */
2844 warning (OPT_Woverloaded_virtual
, "%q+D was hidden", TREE_VALUE (base_fndecls
));
2845 warning (OPT_Woverloaded_virtual
, " by %q+D", fns
);
2846 base_fndecls
= TREE_CHAIN (base_fndecls
);
2851 /* Recursive helper for finish_struct_anon. */
2854 finish_struct_anon_r (tree field
, bool complain
)
2856 bool is_union
= TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
;
2857 tree elt
= TYPE_FIELDS (TREE_TYPE (field
));
2858 for (; elt
; elt
= DECL_CHAIN (elt
))
2860 /* We're generally only interested in entities the user
2861 declared, but we also find nested classes by noticing
2862 the TYPE_DECL that we create implicitly. You're
2863 allowed to put one anonymous union inside another,
2864 though, so we explicitly tolerate that. We use
2865 TYPE_ANONYMOUS_P rather than ANON_AGGR_TYPE_P so that
2866 we also allow unnamed types used for defining fields. */
2867 if (DECL_ARTIFICIAL (elt
)
2868 && (!DECL_IMPLICIT_TYPEDEF_P (elt
)
2869 || TYPE_ANONYMOUS_P (TREE_TYPE (elt
))))
2872 if (TREE_CODE (elt
) != FIELD_DECL
)
2874 /* We already complained about static data members in
2875 finish_static_data_member_decl. */
2876 if (complain
&& TREE_CODE (elt
) != VAR_DECL
)
2879 permerror (input_location
,
2880 "%q+#D invalid; an anonymous union can "
2881 "only have non-static data members", elt
);
2883 permerror (input_location
,
2884 "%q+#D invalid; an anonymous struct can "
2885 "only have non-static data members", elt
);
2892 if (TREE_PRIVATE (elt
))
2895 permerror (input_location
,
2896 "private member %q+#D in anonymous union", elt
);
2898 permerror (input_location
,
2899 "private member %q+#D in anonymous struct", elt
);
2901 else if (TREE_PROTECTED (elt
))
2904 permerror (input_location
,
2905 "protected member %q+#D in anonymous union", elt
);
2907 permerror (input_location
,
2908 "protected member %q+#D in anonymous struct", elt
);
2912 TREE_PRIVATE (elt
) = TREE_PRIVATE (field
);
2913 TREE_PROTECTED (elt
) = TREE_PROTECTED (field
);
2915 /* Recurse into the anonymous aggregates to handle correctly
2916 access control (c++/24926):
2927 if (DECL_NAME (elt
) == NULL_TREE
2928 && ANON_AGGR_TYPE_P (TREE_TYPE (elt
)))
2929 finish_struct_anon_r (elt
, /*complain=*/false);
2933 /* Check for things that are invalid. There are probably plenty of other
2934 things we should check for also. */
2937 finish_struct_anon (tree t
)
2939 for (tree field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
2941 if (TREE_STATIC (field
))
2943 if (TREE_CODE (field
) != FIELD_DECL
)
2946 if (DECL_NAME (field
) == NULL_TREE
2947 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2948 finish_struct_anon_r (field
, /*complain=*/true);
2952 /* Add T to CLASSTYPE_DECL_LIST of current_class_type which
2953 will be used later during class template instantiation.
2954 When FRIEND_P is zero, T can be a static member data (VAR_DECL),
2955 a non-static member data (FIELD_DECL), a member function
2956 (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE),
2957 a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL)
2958 When FRIEND_P is nonzero, T is either a friend class
2959 (RECORD_TYPE, TEMPLATE_DECL) or a friend function
2960 (FUNCTION_DECL, TEMPLATE_DECL). */
2963 maybe_add_class_template_decl_list (tree type
, tree t
, int friend_p
)
2965 /* Save some memory by not creating TREE_LIST if TYPE is not template. */
2966 if (CLASSTYPE_TEMPLATE_INFO (type
))
2967 CLASSTYPE_DECL_LIST (type
)
2968 = tree_cons (friend_p
? NULL_TREE
: type
,
2969 t
, CLASSTYPE_DECL_LIST (type
));
2972 /* This function is called from declare_virt_assop_and_dtor via
2975 DATA is a type that direcly or indirectly inherits the base
2976 represented by BINFO. If BINFO contains a virtual assignment [copy
2977 assignment or move assigment] operator or a virtual constructor,
2978 declare that function in DATA if it hasn't been already declared. */
2981 dfs_declare_virt_assop_and_dtor (tree binfo
, void *data
)
2983 tree bv
, fn
, t
= (tree
)data
;
2984 tree opname
= ansi_assopname (NOP_EXPR
);
2986 gcc_assert (t
&& CLASS_TYPE_P (t
));
2987 gcc_assert (binfo
&& TREE_CODE (binfo
) == TREE_BINFO
);
2989 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
2990 /* A base without a vtable needs no modification, and its bases
2991 are uninteresting. */
2992 return dfs_skip_bases
;
2994 if (BINFO_PRIMARY_P (binfo
))
2995 /* If this is a primary base, then we have already looked at the
2996 virtual functions of its vtable. */
2999 for (bv
= BINFO_VIRTUALS (binfo
); bv
; bv
= TREE_CHAIN (bv
))
3003 if (DECL_NAME (fn
) == opname
)
3005 if (CLASSTYPE_LAZY_COPY_ASSIGN (t
))
3006 lazily_declare_fn (sfk_copy_assignment
, t
);
3007 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
3008 lazily_declare_fn (sfk_move_assignment
, t
);
3010 else if (DECL_DESTRUCTOR_P (fn
)
3011 && CLASSTYPE_LAZY_DESTRUCTOR (t
))
3012 lazily_declare_fn (sfk_destructor
, t
);
3018 /* If the class type T has a direct or indirect base that contains a
3019 virtual assignment operator or a virtual destructor, declare that
3020 function in T if it hasn't been already declared. */
3023 declare_virt_assop_and_dtor (tree t
)
3025 if (!(TYPE_POLYMORPHIC_P (t
)
3026 && (CLASSTYPE_LAZY_COPY_ASSIGN (t
)
3027 || CLASSTYPE_LAZY_MOVE_ASSIGN (t
)
3028 || CLASSTYPE_LAZY_DESTRUCTOR (t
))))
3031 dfs_walk_all (TYPE_BINFO (t
),
3032 dfs_declare_virt_assop_and_dtor
,
3036 /* Declare the inheriting constructor for class T inherited from base
3037 constructor CTOR with the parameter array PARMS of size NPARMS. */
3040 one_inheriting_sig (tree t
, tree ctor
, tree
*parms
, int nparms
)
3042 /* We don't declare an inheriting ctor that would be a default,
3043 copy or move ctor for derived or base. */
3047 && TREE_CODE (parms
[0]) == REFERENCE_TYPE
)
3049 tree parm
= TYPE_MAIN_VARIANT (TREE_TYPE (parms
[0]));
3050 if (parm
== t
|| parm
== DECL_CONTEXT (ctor
))
3054 tree parmlist
= void_list_node
;
3055 for (int i
= nparms
- 1; i
>= 0; i
--)
3056 parmlist
= tree_cons (NULL_TREE
, parms
[i
], parmlist
);
3057 tree fn
= implicitly_declare_fn (sfk_inheriting_constructor
,
3058 t
, false, ctor
, parmlist
);
3059 if (add_method (t
, fn
, NULL_TREE
))
3061 DECL_CHAIN (fn
) = TYPE_METHODS (t
);
3062 TYPE_METHODS (t
) = fn
;
3066 /* Declare all the inheriting constructors for class T inherited from base
3067 constructor CTOR. */
3070 one_inherited_ctor (tree ctor
, tree t
)
3072 tree parms
= FUNCTION_FIRST_USER_PARMTYPE (ctor
);
3074 tree
*new_parms
= XALLOCAVEC (tree
, list_length (parms
));
3076 for (; parms
&& parms
!= void_list_node
; parms
= TREE_CHAIN (parms
))
3078 if (TREE_PURPOSE (parms
))
3079 one_inheriting_sig (t
, ctor
, new_parms
, i
);
3080 new_parms
[i
++] = TREE_VALUE (parms
);
3082 one_inheriting_sig (t
, ctor
, new_parms
, i
);
3083 if (parms
== NULL_TREE
)
3085 if (warning (OPT_Winherited_variadic_ctor
,
3086 "the ellipsis in %qD is not inherited", ctor
))
3087 inform (DECL_SOURCE_LOCATION (ctor
), "%qD declared here", ctor
);
3091 /* Create default constructors, assignment operators, and so forth for
3092 the type indicated by T, if they are needed. CANT_HAVE_CONST_CTOR,
3093 and CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason,
3094 the class cannot have a default constructor, copy constructor
3095 taking a const reference argument, or an assignment operator taking
3096 a const reference, respectively. */
3099 add_implicitly_declared_members (tree t
, tree
* access_decls
,
3100 int cant_have_const_cctor
,
3101 int cant_have_const_assignment
)
3103 bool move_ok
= false;
3105 if (cxx_dialect
>= cxx11
&& !CLASSTYPE_DESTRUCTORS (t
)
3106 && !TYPE_HAS_COPY_CTOR (t
) && !TYPE_HAS_COPY_ASSIGN (t
)
3107 && !type_has_move_constructor (t
) && !type_has_move_assign (t
))
3111 if (!CLASSTYPE_DESTRUCTORS (t
))
3113 /* In general, we create destructors lazily. */
3114 CLASSTYPE_LAZY_DESTRUCTOR (t
) = 1;
3116 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3117 && TYPE_FOR_JAVA (t
))
3118 /* But if this is a Java class, any non-trivial destructor is
3119 invalid, even if compiler-generated. Therefore, if the
3120 destructor is non-trivial we create it now. */
3121 lazily_declare_fn (sfk_destructor
, t
);
3126 If there is no user-declared constructor for a class, a default
3127 constructor is implicitly declared. */
3128 if (! TYPE_HAS_USER_CONSTRUCTOR (t
))
3130 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 1;
3131 CLASSTYPE_LAZY_DEFAULT_CTOR (t
) = 1;
3132 if (cxx_dialect
>= cxx11
)
3133 TYPE_HAS_CONSTEXPR_CTOR (t
)
3134 /* This might force the declaration. */
3135 = type_has_constexpr_default_constructor (t
);
3140 If a class definition does not explicitly declare a copy
3141 constructor, one is declared implicitly. */
3142 if (! TYPE_HAS_COPY_CTOR (t
) && ! TYPE_FOR_JAVA (t
))
3144 TYPE_HAS_COPY_CTOR (t
) = 1;
3145 TYPE_HAS_CONST_COPY_CTOR (t
) = !cant_have_const_cctor
;
3146 CLASSTYPE_LAZY_COPY_CTOR (t
) = 1;
3148 CLASSTYPE_LAZY_MOVE_CTOR (t
) = 1;
3151 /* If there is no assignment operator, one will be created if and
3152 when it is needed. For now, just record whether or not the type
3153 of the parameter to the assignment operator will be a const or
3154 non-const reference. */
3155 if (!TYPE_HAS_COPY_ASSIGN (t
) && !TYPE_FOR_JAVA (t
))
3157 TYPE_HAS_COPY_ASSIGN (t
) = 1;
3158 TYPE_HAS_CONST_COPY_ASSIGN (t
) = !cant_have_const_assignment
;
3159 CLASSTYPE_LAZY_COPY_ASSIGN (t
) = 1;
3161 CLASSTYPE_LAZY_MOVE_ASSIGN (t
) = 1;
3164 /* We can't be lazy about declaring functions that might override
3165 a virtual function from a base class. */
3166 declare_virt_assop_and_dtor (t
);
3168 while (*access_decls
)
3170 tree using_decl
= TREE_VALUE (*access_decls
);
3171 tree decl
= USING_DECL_DECLS (using_decl
);
3172 if (DECL_NAME (using_decl
) == ctor_identifier
)
3174 /* declare, then remove the decl */
3175 tree ctor_list
= decl
;
3176 location_t loc
= input_location
;
3177 input_location
= DECL_SOURCE_LOCATION (using_decl
);
3179 for (; ctor_list
; ctor_list
= OVL_NEXT (ctor_list
))
3180 one_inherited_ctor (OVL_CURRENT (ctor_list
), t
);
3181 *access_decls
= TREE_CHAIN (*access_decls
);
3182 input_location
= loc
;
3185 access_decls
= &TREE_CHAIN (*access_decls
);
3189 /* Subroutine of insert_into_classtype_sorted_fields. Recursively
3190 count the number of fields in TYPE, including anonymous union
3194 count_fields (tree fields
)
3198 for (x
= fields
; x
; x
= DECL_CHAIN (x
))
3200 if (TREE_CODE (x
) == FIELD_DECL
&& ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
3201 n_fields
+= count_fields (TYPE_FIELDS (TREE_TYPE (x
)));
3208 /* Subroutine of insert_into_classtype_sorted_fields. Recursively add
3209 all the fields in the TREE_LIST FIELDS to the SORTED_FIELDS_TYPE
3210 elts, starting at offset IDX. */
3213 add_fields_to_record_type (tree fields
, struct sorted_fields_type
*field_vec
, int idx
)
3216 for (x
= fields
; x
; x
= DECL_CHAIN (x
))
3218 if (TREE_CODE (x
) == FIELD_DECL
&& ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
3219 idx
= add_fields_to_record_type (TYPE_FIELDS (TREE_TYPE (x
)), field_vec
, idx
);
3221 field_vec
->elts
[idx
++] = x
;
3226 /* Add all of the enum values of ENUMTYPE, to the FIELD_VEC elts,
3227 starting at offset IDX. */
3230 add_enum_fields_to_record_type (tree enumtype
,
3231 struct sorted_fields_type
*field_vec
,
3235 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
3236 field_vec
->elts
[idx
++] = TREE_VALUE (values
);
3240 /* FIELD is a bit-field. We are finishing the processing for its
3241 enclosing type. Issue any appropriate messages and set appropriate
3242 flags. Returns false if an error has been diagnosed. */
3245 check_bitfield_decl (tree field
)
3247 tree type
= TREE_TYPE (field
);
3250 /* Extract the declared width of the bitfield, which has been
3251 temporarily stashed in DECL_INITIAL. */
3252 w
= DECL_INITIAL (field
);
3253 gcc_assert (w
!= NULL_TREE
);
3254 /* Remove the bit-field width indicator so that the rest of the
3255 compiler does not treat that value as an initializer. */
3256 DECL_INITIAL (field
) = NULL_TREE
;
3258 /* Detect invalid bit-field type. */
3259 if (!INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
3261 error ("bit-field %q+#D with non-integral type", field
);
3262 w
= error_mark_node
;
3266 location_t loc
= input_location
;
3267 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
3270 /* detect invalid field size. */
3271 input_location
= DECL_SOURCE_LOCATION (field
);
3272 w
= cxx_constant_value (w
);
3273 input_location
= loc
;
3275 if (TREE_CODE (w
) != INTEGER_CST
)
3277 error ("bit-field %q+D width not an integer constant", field
);
3278 w
= error_mark_node
;
3280 else if (tree_int_cst_sgn (w
) < 0)
3282 error ("negative width in bit-field %q+D", field
);
3283 w
= error_mark_node
;
3285 else if (integer_zerop (w
) && DECL_NAME (field
) != 0)
3287 error ("zero width for bit-field %q+D", field
);
3288 w
= error_mark_node
;
3290 else if ((TREE_CODE (type
) != ENUMERAL_TYPE
3291 && TREE_CODE (type
) != BOOLEAN_TYPE
3292 && compare_tree_int (w
, TYPE_PRECISION (type
)) > 0)
3293 || ((TREE_CODE (type
) == ENUMERAL_TYPE
3294 || TREE_CODE (type
) == BOOLEAN_TYPE
)
3295 && tree_int_cst_lt (TYPE_SIZE (type
), w
)))
3296 warning (0, "width of %q+D exceeds its type", field
);
3297 else if (TREE_CODE (type
) == ENUMERAL_TYPE
3298 && (0 > (compare_tree_int
3299 (w
, TYPE_PRECISION (ENUM_UNDERLYING_TYPE (type
))))))
3300 warning (0, "%q+D is too small to hold all values of %q#T", field
, type
);
3303 if (w
!= error_mark_node
)
3305 DECL_SIZE (field
) = convert (bitsizetype
, w
);
3306 DECL_BIT_FIELD (field
) = 1;
3311 /* Non-bit-fields are aligned for their type. */
3312 DECL_BIT_FIELD (field
) = 0;
3313 CLEAR_DECL_C_BIT_FIELD (field
);
3318 /* FIELD is a non bit-field. We are finishing the processing for its
3319 enclosing type T. Issue any appropriate messages and set appropriate
3323 check_field_decl (tree field
,
3325 int* cant_have_const_ctor
,
3326 int* no_const_asn_ref
,
3327 int* any_default_members
)
3329 tree type
= strip_array_types (TREE_TYPE (field
));
3331 /* In C++98 an anonymous union cannot contain any fields which would change
3332 the settings of CANT_HAVE_CONST_CTOR and friends. */
3333 if (ANON_UNION_TYPE_P (type
) && cxx_dialect
< cxx11
)
3335 /* And, we don't set TYPE_HAS_CONST_COPY_CTOR, etc., for anonymous
3336 structs. So, we recurse through their fields here. */
3337 else if (ANON_AGGR_TYPE_P (type
))
3341 for (fields
= TYPE_FIELDS (type
); fields
; fields
= DECL_CHAIN (fields
))
3342 if (TREE_CODE (fields
) == FIELD_DECL
&& !DECL_C_BIT_FIELD (field
))
3343 check_field_decl (fields
, t
, cant_have_const_ctor
,
3344 no_const_asn_ref
, any_default_members
);
3346 /* Check members with class type for constructors, destructors,
3348 else if (CLASS_TYPE_P (type
))
3350 /* Never let anything with uninheritable virtuals
3351 make it through without complaint. */
3352 abstract_virtuals_error (field
, type
);
3354 if (TREE_CODE (t
) == UNION_TYPE
&& cxx_dialect
< cxx11
)
3357 int oldcount
= errorcount
;
3358 if (TYPE_NEEDS_CONSTRUCTING (type
))
3359 error ("member %q+#D with constructor not allowed in union",
3361 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
3362 error ("member %q+#D with destructor not allowed in union", field
);
3363 if (TYPE_HAS_COMPLEX_COPY_ASSIGN (type
))
3364 error ("member %q+#D with copy assignment operator not allowed in union",
3366 if (!warned
&& errorcount
> oldcount
)
3368 inform (DECL_SOURCE_LOCATION (field
), "unrestricted unions "
3369 "only available with -std=c++11 or -std=gnu++11");
3375 TYPE_NEEDS_CONSTRUCTING (t
) |= TYPE_NEEDS_CONSTRUCTING (type
);
3376 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3377 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
);
3378 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
)
3379 |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (type
)
3380 || !TYPE_HAS_COPY_ASSIGN (type
));
3381 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= (TYPE_HAS_COMPLEX_COPY_CTOR (type
)
3382 || !TYPE_HAS_COPY_CTOR (type
));
3383 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (type
);
3384 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_HAS_COMPLEX_MOVE_CTOR (type
);
3385 TYPE_HAS_COMPLEX_DFLT (t
) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (type
)
3386 || TYPE_HAS_COMPLEX_DFLT (type
));
3389 if (TYPE_HAS_COPY_CTOR (type
)
3390 && !TYPE_HAS_CONST_COPY_CTOR (type
))
3391 *cant_have_const_ctor
= 1;
3393 if (TYPE_HAS_COPY_ASSIGN (type
)
3394 && !TYPE_HAS_CONST_COPY_ASSIGN (type
))
3395 *no_const_asn_ref
= 1;
3398 check_abi_tags (t
, field
);
3400 if (DECL_INITIAL (field
) != NULL_TREE
)
3402 /* `build_class_init_list' does not recognize
3404 if (TREE_CODE (t
) == UNION_TYPE
&& *any_default_members
!= 0)
3405 error ("multiple fields in union %qT initialized", t
);
3406 *any_default_members
= 1;
3410 /* Check the data members (both static and non-static), class-scoped
3411 typedefs, etc., appearing in the declaration of T. Issue
3412 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
3413 declaration order) of access declarations; each TREE_VALUE in this
3414 list is a USING_DECL.
3416 In addition, set the following flags:
3419 The class is empty, i.e., contains no non-static data members.
3421 CANT_HAVE_CONST_CTOR_P
3422 This class cannot have an implicitly generated copy constructor
3423 taking a const reference.
3425 CANT_HAVE_CONST_ASN_REF
3426 This class cannot have an implicitly generated assignment
3427 operator taking a const reference.
3429 All of these flags should be initialized before calling this
3432 Returns a pointer to the end of the TYPE_FIELDs chain; additional
3433 fields can be added by adding to this chain. */
3436 check_field_decls (tree t
, tree
*access_decls
,
3437 int *cant_have_const_ctor_p
,
3438 int *no_const_asn_ref_p
)
3443 int any_default_members
;
3445 int field_access
= -1;
3447 /* Assume there are no access declarations. */
3448 *access_decls
= NULL_TREE
;
3449 /* Assume this class has no pointer members. */
3450 has_pointers
= false;
3451 /* Assume none of the members of this class have default
3453 any_default_members
= 0;
3455 for (field
= &TYPE_FIELDS (t
); *field
; field
= next
)
3458 tree type
= TREE_TYPE (x
);
3459 int this_field_access
;
3461 next
= &DECL_CHAIN (x
);
3463 if (TREE_CODE (x
) == USING_DECL
)
3465 /* Save the access declarations for our caller. */
3466 *access_decls
= tree_cons (NULL_TREE
, x
, *access_decls
);
3470 if (TREE_CODE (x
) == TYPE_DECL
3471 || TREE_CODE (x
) == TEMPLATE_DECL
)
3474 /* If we've gotten this far, it's a data member, possibly static,
3475 or an enumerator. */
3476 if (TREE_CODE (x
) != CONST_DECL
)
3477 DECL_CONTEXT (x
) = t
;
3479 /* When this goes into scope, it will be a non-local reference. */
3480 DECL_NONLOCAL (x
) = 1;
3482 if (TREE_CODE (t
) == UNION_TYPE
3483 && cxx_dialect
< cxx11
)
3485 /* [class.union] (C++98)
3487 If a union contains a static data member, or a member of
3488 reference type, the program is ill-formed.
3490 In C++11 this limitation doesn't exist anymore. */
3493 error ("in C++98 %q+D may not be static because it is "
3494 "a member of a union", x
);
3497 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3499 error ("in C++98 %q+D may not have reference type %qT "
3500 "because it is a member of a union", x
, type
);
3505 /* Perform error checking that did not get done in
3507 if (TREE_CODE (type
) == FUNCTION_TYPE
)
3509 error ("field %q+D invalidly declared function type", x
);
3510 type
= build_pointer_type (type
);
3511 TREE_TYPE (x
) = type
;
3513 else if (TREE_CODE (type
) == METHOD_TYPE
)
3515 error ("field %q+D invalidly declared method type", x
);
3516 type
= build_pointer_type (type
);
3517 TREE_TYPE (x
) = type
;
3520 if (type
== error_mark_node
)
3523 if (TREE_CODE (x
) == CONST_DECL
|| VAR_P (x
))
3526 /* Now it can only be a FIELD_DECL. */
3528 if (TREE_PRIVATE (x
) || TREE_PROTECTED (x
))
3529 CLASSTYPE_NON_AGGREGATE (t
) = 1;
3531 /* If at least one non-static data member is non-literal, the whole
3532 class becomes non-literal. Note: if the type is incomplete we
3533 will complain later on. */
3534 if (COMPLETE_TYPE_P (type
) && !literal_type_p (type
))
3535 CLASSTYPE_LITERAL_P (t
) = false;
3537 /* A standard-layout class is a class that:
3539 has the same access control (Clause 11) for all non-static data members,
3541 this_field_access
= TREE_PROTECTED (x
) ? 1 : TREE_PRIVATE (x
) ? 2 : 0;
3542 if (field_access
== -1)
3543 field_access
= this_field_access
;
3544 else if (this_field_access
!= field_access
)
3545 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3547 /* If this is of reference type, check if it needs an init. */
3548 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3550 CLASSTYPE_NON_LAYOUT_POD_P (t
) = 1;
3551 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3552 if (DECL_INITIAL (x
) == NULL_TREE
)
3553 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t
, 1);
3555 /* ARM $12.6.2: [A member initializer list] (or, for an
3556 aggregate, initialization by a brace-enclosed list) is the
3557 only way to initialize nonstatic const and reference
3559 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
3560 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) = 1;
3563 type
= strip_array_types (type
);
3565 if (TYPE_PACKED (t
))
3567 if (!layout_pod_type_p (type
) && !TYPE_PACKED (type
))
3571 "ignoring packed attribute because of unpacked non-POD field %q+#D",
3575 else if (DECL_C_BIT_FIELD (x
)
3576 || TYPE_ALIGN (TREE_TYPE (x
)) > BITS_PER_UNIT
)
3577 DECL_PACKED (x
) = 1;
3580 if (DECL_C_BIT_FIELD (x
) && integer_zerop (DECL_INITIAL (x
)))
3581 /* We don't treat zero-width bitfields as making a class
3586 /* The class is non-empty. */
3587 CLASSTYPE_EMPTY_P (t
) = 0;
3588 /* The class is not even nearly empty. */
3589 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
3590 /* If one of the data members contains an empty class,
3592 if (CLASS_TYPE_P (type
)
3593 && CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type
))
3594 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 1;
3597 /* This is used by -Weffc++ (see below). Warn only for pointers
3598 to members which might hold dynamic memory. So do not warn
3599 for pointers to functions or pointers to members. */
3600 if (TYPE_PTR_P (type
)
3601 && !TYPE_PTRFN_P (type
))
3602 has_pointers
= true;
3604 if (CLASS_TYPE_P (type
))
3606 if (CLASSTYPE_REF_FIELDS_NEED_INIT (type
))
3607 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t
, 1);
3608 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (type
))
3609 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
, 1);
3612 if (DECL_MUTABLE_P (x
) || TYPE_HAS_MUTABLE_P (type
))
3613 CLASSTYPE_HAS_MUTABLE (t
) = 1;
3615 if (DECL_MUTABLE_P (x
))
3617 if (CP_TYPE_CONST_P (type
))
3619 error ("member %q+D cannot be declared both %<const%> "
3620 "and %<mutable%>", x
);
3623 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3625 error ("member %q+D cannot be declared as a %<mutable%> "
3631 if (! layout_pod_type_p (type
))
3632 /* DR 148 now allows pointers to members (which are POD themselves),
3633 to be allowed in POD structs. */
3634 CLASSTYPE_NON_LAYOUT_POD_P (t
) = 1;
3636 if (!std_layout_type_p (type
))
3637 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3639 if (! zero_init_p (type
))
3640 CLASSTYPE_NON_ZERO_INIT_P (t
) = 1;
3642 /* We set DECL_C_BIT_FIELD in grokbitfield.
3643 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
3644 if (! DECL_C_BIT_FIELD (x
) || ! check_bitfield_decl (x
))
3645 check_field_decl (x
, t
,
3646 cant_have_const_ctor_p
,
3648 &any_default_members
);
3650 /* Now that we've removed bit-field widths from DECL_INITIAL,
3651 anything left in DECL_INITIAL is an NSDMI that makes the class
3653 if (DECL_INITIAL (x
))
3654 CLASSTYPE_NON_AGGREGATE (t
) = true;
3656 /* If any field is const, the structure type is pseudo-const. */
3657 if (CP_TYPE_CONST_P (type
))
3659 C_TYPE_FIELDS_READONLY (t
) = 1;
3660 if (DECL_INITIAL (x
) == NULL_TREE
)
3661 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
, 1);
3663 /* ARM $12.6.2: [A member initializer list] (or, for an
3664 aggregate, initialization by a brace-enclosed list) is the
3665 only way to initialize nonstatic const and reference
3667 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
3668 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) = 1;
3670 /* A field that is pseudo-const makes the structure likewise. */
3671 else if (CLASS_TYPE_P (type
))
3673 C_TYPE_FIELDS_READONLY (t
) |= C_TYPE_FIELDS_READONLY (type
);
3674 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
,
3675 CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
)
3676 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (type
));
3679 /* Core issue 80: A nonstatic data member is required to have a
3680 different name from the class iff the class has a
3681 user-declared constructor. */
3682 if (constructor_name_p (DECL_NAME (x
), t
)
3683 && TYPE_HAS_USER_CONSTRUCTOR (t
))
3684 permerror (input_location
, "field %q+#D with same name as class", x
);
3687 /* Effective C++ rule 11: if a class has dynamic memory held by pointers,
3688 it should also define a copy constructor and an assignment operator to
3689 implement the correct copy semantic (deep vs shallow, etc.). As it is
3690 not feasible to check whether the constructors do allocate dynamic memory
3691 and store it within members, we approximate the warning like this:
3693 -- Warn only if there are members which are pointers
3694 -- Warn only if there is a non-trivial constructor (otherwise,
3695 there cannot be memory allocated).
3696 -- Warn only if there is a non-trivial destructor. We assume that the
3697 user at least implemented the cleanup correctly, and a destructor
3698 is needed to free dynamic memory.
3700 This seems enough for practical purposes. */
3703 && TYPE_HAS_USER_CONSTRUCTOR (t
)
3704 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3705 && !(TYPE_HAS_COPY_CTOR (t
) && TYPE_HAS_COPY_ASSIGN (t
)))
3707 warning (OPT_Weffc__
, "%q#T has pointer data members", t
);
3709 if (! TYPE_HAS_COPY_CTOR (t
))
3711 warning (OPT_Weffc__
,
3712 " but does not override %<%T(const %T&)%>", t
, t
);
3713 if (!TYPE_HAS_COPY_ASSIGN (t
))
3714 warning (OPT_Weffc__
, " or %<operator=(const %T&)%>", t
);
3716 else if (! TYPE_HAS_COPY_ASSIGN (t
))
3717 warning (OPT_Weffc__
,
3718 " but does not override %<operator=(const %T&)%>", t
);
3721 /* Non-static data member initializers make the default constructor
3723 if (any_default_members
)
3725 TYPE_NEEDS_CONSTRUCTING (t
) = true;
3726 TYPE_HAS_COMPLEX_DFLT (t
) = true;
3729 /* If any of the fields couldn't be packed, unset TYPE_PACKED. */
3731 TYPE_PACKED (t
) = 0;
3733 /* Check anonymous struct/anonymous union fields. */
3734 finish_struct_anon (t
);
3736 /* We've built up the list of access declarations in reverse order.
3738 *access_decls
= nreverse (*access_decls
);
3741 /* If TYPE is an empty class type, records its OFFSET in the table of
3745 record_subobject_offset (tree type
, tree offset
, splay_tree offsets
)
3749 if (!is_empty_class (type
))
3752 /* Record the location of this empty object in OFFSETS. */
3753 n
= splay_tree_lookup (offsets
, (splay_tree_key
) offset
);
3755 n
= splay_tree_insert (offsets
,
3756 (splay_tree_key
) offset
,
3757 (splay_tree_value
) NULL_TREE
);
3758 n
->value
= ((splay_tree_value
)
3759 tree_cons (NULL_TREE
,
3766 /* Returns nonzero if TYPE is an empty class type and there is
3767 already an entry in OFFSETS for the same TYPE as the same OFFSET. */
3770 check_subobject_offset (tree type
, tree offset
, splay_tree offsets
)
3775 if (!is_empty_class (type
))
3778 /* Record the location of this empty object in OFFSETS. */
3779 n
= splay_tree_lookup (offsets
, (splay_tree_key
) offset
);
3783 for (t
= (tree
) n
->value
; t
; t
= TREE_CHAIN (t
))
3784 if (same_type_p (TREE_VALUE (t
), type
))
3790 /* Walk through all the subobjects of TYPE (located at OFFSET). Call
3791 F for every subobject, passing it the type, offset, and table of
3792 OFFSETS. If VBASES_P is one, then virtual non-primary bases should
3795 If MAX_OFFSET is non-NULL, then subobjects with an offset greater
3796 than MAX_OFFSET will not be walked.
3798 If F returns a nonzero value, the traversal ceases, and that value
3799 is returned. Otherwise, returns zero. */
3802 walk_subobject_offsets (tree type
,
3803 subobject_offset_fn f
,
3810 tree type_binfo
= NULL_TREE
;
3812 /* If this OFFSET is bigger than the MAX_OFFSET, then we should
3814 if (max_offset
&& tree_int_cst_lt (max_offset
, offset
))
3817 if (type
== error_mark_node
)
3823 type
= BINFO_TYPE (type
);
3826 if (CLASS_TYPE_P (type
))
3832 /* Avoid recursing into objects that are not interesting. */
3833 if (!CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type
))
3836 /* Record the location of TYPE. */
3837 r
= (*f
) (type
, offset
, offsets
);
3841 /* Iterate through the direct base classes of TYPE. */
3843 type_binfo
= TYPE_BINFO (type
);
3844 for (i
= 0; BINFO_BASE_ITERATE (type_binfo
, i
, binfo
); i
++)
3848 if (BINFO_VIRTUAL_P (binfo
))
3852 /* We cannot rely on BINFO_OFFSET being set for the base
3853 class yet, but the offsets for direct non-virtual
3854 bases can be calculated by going back to the TYPE. */
3855 orig_binfo
= BINFO_BASE_BINFO (TYPE_BINFO (type
), i
);
3856 binfo_offset
= size_binop (PLUS_EXPR
,
3858 BINFO_OFFSET (orig_binfo
));
3860 r
= walk_subobject_offsets (binfo
,
3870 if (CLASSTYPE_VBASECLASSES (type
))
3873 vec
<tree
, va_gc
> *vbases
;
3875 /* Iterate through the virtual base classes of TYPE. In G++
3876 3.2, we included virtual bases in the direct base class
3877 loop above, which results in incorrect results; the
3878 correct offsets for virtual bases are only known when
3879 working with the most derived type. */
3881 for (vbases
= CLASSTYPE_VBASECLASSES (type
), ix
= 0;
3882 vec_safe_iterate (vbases
, ix
, &binfo
); ix
++)
3884 r
= walk_subobject_offsets (binfo
,
3886 size_binop (PLUS_EXPR
,
3888 BINFO_OFFSET (binfo
)),
3897 /* We still have to walk the primary base, if it is
3898 virtual. (If it is non-virtual, then it was walked
3900 tree vbase
= get_primary_binfo (type_binfo
);
3902 if (vbase
&& BINFO_VIRTUAL_P (vbase
)
3903 && BINFO_PRIMARY_P (vbase
)
3904 && BINFO_INHERITANCE_CHAIN (vbase
) == type_binfo
)
3906 r
= (walk_subobject_offsets
3908 offsets
, max_offset
, /*vbases_p=*/0));
3915 /* Iterate through the fields of TYPE. */
3916 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3917 if (TREE_CODE (field
) == FIELD_DECL
3918 && TREE_TYPE (field
) != error_mark_node
3919 && !DECL_ARTIFICIAL (field
))
3923 field_offset
= byte_position (field
);
3925 r
= walk_subobject_offsets (TREE_TYPE (field
),
3927 size_binop (PLUS_EXPR
,
3937 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3939 tree element_type
= strip_array_types (type
);
3940 tree domain
= TYPE_DOMAIN (type
);
3943 /* Avoid recursing into objects that are not interesting. */
3944 if (!CLASS_TYPE_P (element_type
)
3945 || !CLASSTYPE_CONTAINS_EMPTY_CLASS_P (element_type
))
3948 /* Step through each of the elements in the array. */
3949 for (index
= size_zero_node
;
3950 !tree_int_cst_lt (TYPE_MAX_VALUE (domain
), index
);
3951 index
= size_binop (PLUS_EXPR
, index
, size_one_node
))
3953 r
= walk_subobject_offsets (TREE_TYPE (type
),
3961 offset
= size_binop (PLUS_EXPR
, offset
,
3962 TYPE_SIZE_UNIT (TREE_TYPE (type
)));
3963 /* If this new OFFSET is bigger than the MAX_OFFSET, then
3964 there's no point in iterating through the remaining
3965 elements of the array. */
3966 if (max_offset
&& tree_int_cst_lt (max_offset
, offset
))
3974 /* Record all of the empty subobjects of TYPE (either a type or a
3975 binfo). If IS_DATA_MEMBER is true, then a non-static data member
3976 is being placed at OFFSET; otherwise, it is a base class that is
3977 being placed at OFFSET. */
3980 record_subobject_offsets (tree type
,
3983 bool is_data_member
)
3986 /* If recording subobjects for a non-static data member or a
3987 non-empty base class , we do not need to record offsets beyond
3988 the size of the biggest empty class. Additional data members
3989 will go at the end of the class. Additional base classes will go
3990 either at offset zero (if empty, in which case they cannot
3991 overlap with offsets past the size of the biggest empty class) or
3992 at the end of the class.
3994 However, if we are placing an empty base class, then we must record
3995 all offsets, as either the empty class is at offset zero (where
3996 other empty classes might later be placed) or at the end of the
3997 class (where other objects might then be placed, so other empty
3998 subobjects might later overlap). */
4000 || !is_empty_class (BINFO_TYPE (type
)))
4001 max_offset
= sizeof_biggest_empty_class
;
4003 max_offset
= NULL_TREE
;
4004 walk_subobject_offsets (type
, record_subobject_offset
, offset
,
4005 offsets
, max_offset
, is_data_member
);
4008 /* Returns nonzero if any of the empty subobjects of TYPE (located at
4009 OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero,
4010 virtual bases of TYPE are examined. */
4013 layout_conflict_p (tree type
,
4018 splay_tree_node max_node
;
4020 /* Get the node in OFFSETS that indicates the maximum offset where
4021 an empty subobject is located. */
4022 max_node
= splay_tree_max (offsets
);
4023 /* If there aren't any empty subobjects, then there's no point in
4024 performing this check. */
4028 return walk_subobject_offsets (type
, check_subobject_offset
, offset
,
4029 offsets
, (tree
) (max_node
->key
),
4033 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
4034 non-static data member of the type indicated by RLI. BINFO is the
4035 binfo corresponding to the base subobject, OFFSETS maps offsets to
4036 types already located at those offsets. This function determines
4037 the position of the DECL. */
4040 layout_nonempty_base_or_field (record_layout_info rli
,
4045 tree offset
= NULL_TREE
;
4051 /* For the purposes of determining layout conflicts, we want to
4052 use the class type of BINFO; TREE_TYPE (DECL) will be the
4053 CLASSTYPE_AS_BASE version, which does not contain entries for
4054 zero-sized bases. */
4055 type
= TREE_TYPE (binfo
);
4060 type
= TREE_TYPE (decl
);
4064 /* Try to place the field. It may take more than one try if we have
4065 a hard time placing the field without putting two objects of the
4066 same type at the same address. */
4069 struct record_layout_info_s old_rli
= *rli
;
4071 /* Place this field. */
4072 place_field (rli
, decl
);
4073 offset
= byte_position (decl
);
4075 /* We have to check to see whether or not there is already
4076 something of the same type at the offset we're about to use.
4077 For example, consider:
4080 struct T : public S { int i; };
4081 struct U : public S, public T {};
4083 Here, we put S at offset zero in U. Then, we can't put T at
4084 offset zero -- its S component would be at the same address
4085 as the S we already allocated. So, we have to skip ahead.
4086 Since all data members, including those whose type is an
4087 empty class, have nonzero size, any overlap can happen only
4088 with a direct or indirect base-class -- it can't happen with
4090 /* In a union, overlap is permitted; all members are placed at
4092 if (TREE_CODE (rli
->t
) == UNION_TYPE
)
4094 if (layout_conflict_p (field_p
? type
: binfo
, offset
,
4097 /* Strip off the size allocated to this field. That puts us
4098 at the first place we could have put the field with
4099 proper alignment. */
4102 /* Bump up by the alignment required for the type. */
4104 = size_binop (PLUS_EXPR
, rli
->bitpos
,
4106 ? CLASSTYPE_ALIGN (type
)
4107 : TYPE_ALIGN (type
)));
4108 normalize_rli (rli
);
4111 /* There was no conflict. We're done laying out this field. */
4115 /* Now that we know where it will be placed, update its
4117 if (binfo
&& CLASS_TYPE_P (BINFO_TYPE (binfo
)))
4118 /* Indirect virtual bases may have a nonzero BINFO_OFFSET at
4119 this point because their BINFO_OFFSET is copied from another
4120 hierarchy. Therefore, we may not need to add the entire
4122 propagate_binfo_offsets (binfo
,
4123 size_diffop_loc (input_location
,
4124 convert (ssizetype
, offset
),
4126 BINFO_OFFSET (binfo
))));
4129 /* Returns true if TYPE is empty and OFFSET is nonzero. */
4132 empty_base_at_nonzero_offset_p (tree type
,
4134 splay_tree
/*offsets*/)
4136 return is_empty_class (type
) && !integer_zerop (offset
);
4139 /* Layout the empty base BINFO. EOC indicates the byte currently just
4140 past the end of the class, and should be correctly aligned for a
4141 class of the type indicated by BINFO; OFFSETS gives the offsets of
4142 the empty bases allocated so far. T is the most derived
4143 type. Return nonzero iff we added it at the end. */
4146 layout_empty_base (record_layout_info rli
, tree binfo
,
4147 tree eoc
, splay_tree offsets
)
4150 tree basetype
= BINFO_TYPE (binfo
);
4153 /* This routine should only be used for empty classes. */
4154 gcc_assert (is_empty_class (basetype
));
4155 alignment
= ssize_int (CLASSTYPE_ALIGN_UNIT (basetype
));
4157 if (!integer_zerop (BINFO_OFFSET (binfo
)))
4158 propagate_binfo_offsets
4159 (binfo
, size_diffop_loc (input_location
,
4160 size_zero_node
, BINFO_OFFSET (binfo
)));
4162 /* This is an empty base class. We first try to put it at offset
4164 if (layout_conflict_p (binfo
,
4165 BINFO_OFFSET (binfo
),
4169 /* That didn't work. Now, we move forward from the next
4170 available spot in the class. */
4172 propagate_binfo_offsets (binfo
, convert (ssizetype
, eoc
));
4175 if (!layout_conflict_p (binfo
,
4176 BINFO_OFFSET (binfo
),
4179 /* We finally found a spot where there's no overlap. */
4182 /* There's overlap here, too. Bump along to the next spot. */
4183 propagate_binfo_offsets (binfo
, alignment
);
4187 if (CLASSTYPE_USER_ALIGN (basetype
))
4189 rli
->record_align
= MAX (rli
->record_align
, CLASSTYPE_ALIGN (basetype
));
4191 rli
->unpacked_align
= MAX (rli
->unpacked_align
, CLASSTYPE_ALIGN (basetype
));
4192 TYPE_USER_ALIGN (rli
->t
) = 1;
4198 /* Layout the base given by BINFO in the class indicated by RLI.
4199 *BASE_ALIGN is a running maximum of the alignments of
4200 any base class. OFFSETS gives the location of empty base
4201 subobjects. T is the most derived type. Return nonzero if the new
4202 object cannot be nearly-empty. A new FIELD_DECL is inserted at
4203 *NEXT_FIELD, unless BINFO is for an empty base class.
4205 Returns the location at which the next field should be inserted. */
4208 build_base_field (record_layout_info rli
, tree binfo
,
4209 splay_tree offsets
, tree
*next_field
)
4212 tree basetype
= BINFO_TYPE (binfo
);
4214 if (!COMPLETE_TYPE_P (basetype
))
4215 /* This error is now reported in xref_tag, thus giving better
4216 location information. */
4219 /* Place the base class. */
4220 if (!is_empty_class (basetype
))
4224 /* The containing class is non-empty because it has a non-empty
4226 CLASSTYPE_EMPTY_P (t
) = 0;
4228 /* Create the FIELD_DECL. */
4229 decl
= build_decl (input_location
,
4230 FIELD_DECL
, NULL_TREE
, CLASSTYPE_AS_BASE (basetype
));
4231 DECL_ARTIFICIAL (decl
) = 1;
4232 DECL_IGNORED_P (decl
) = 1;
4233 DECL_FIELD_CONTEXT (decl
) = t
;
4234 if (CLASSTYPE_AS_BASE (basetype
))
4236 DECL_SIZE (decl
) = CLASSTYPE_SIZE (basetype
);
4237 DECL_SIZE_UNIT (decl
) = CLASSTYPE_SIZE_UNIT (basetype
);
4238 DECL_ALIGN (decl
) = CLASSTYPE_ALIGN (basetype
);
4239 DECL_USER_ALIGN (decl
) = CLASSTYPE_USER_ALIGN (basetype
);
4240 DECL_MODE (decl
) = TYPE_MODE (basetype
);
4241 DECL_FIELD_IS_BASE (decl
) = 1;
4243 /* Try to place the field. It may take more than one try if we
4244 have a hard time placing the field without putting two
4245 objects of the same type at the same address. */
4246 layout_nonempty_base_or_field (rli
, decl
, binfo
, offsets
);
4247 /* Add the new FIELD_DECL to the list of fields for T. */
4248 DECL_CHAIN (decl
) = *next_field
;
4250 next_field
= &DECL_CHAIN (decl
);
4258 /* On some platforms (ARM), even empty classes will not be
4260 eoc
= round_up_loc (input_location
,
4261 rli_size_unit_so_far (rli
),
4262 CLASSTYPE_ALIGN_UNIT (basetype
));
4263 atend
= layout_empty_base (rli
, binfo
, eoc
, offsets
);
4264 /* A nearly-empty class "has no proper base class that is empty,
4265 not morally virtual, and at an offset other than zero." */
4266 if (!BINFO_VIRTUAL_P (binfo
) && CLASSTYPE_NEARLY_EMPTY_P (t
))
4269 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
4270 /* The check above (used in G++ 3.2) is insufficient because
4271 an empty class placed at offset zero might itself have an
4272 empty base at a nonzero offset. */
4273 else if (walk_subobject_offsets (basetype
,
4274 empty_base_at_nonzero_offset_p
,
4277 /*max_offset=*/NULL_TREE
,
4279 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
4282 /* We do not create a FIELD_DECL for empty base classes because
4283 it might overlap some other field. We want to be able to
4284 create CONSTRUCTORs for the class by iterating over the
4285 FIELD_DECLs, and the back end does not handle overlapping
4288 /* An empty virtual base causes a class to be non-empty
4289 -- but in that case we do not need to clear CLASSTYPE_EMPTY_P
4290 here because that was already done when the virtual table
4291 pointer was created. */
4294 /* Record the offsets of BINFO and its base subobjects. */
4295 record_subobject_offsets (binfo
,
4296 BINFO_OFFSET (binfo
),
4298 /*is_data_member=*/false);
4303 /* Layout all of the non-virtual base classes. Record empty
4304 subobjects in OFFSETS. T is the most derived type. Return nonzero
4305 if the type cannot be nearly empty. The fields created
4306 corresponding to the base classes will be inserted at
4310 build_base_fields (record_layout_info rli
,
4311 splay_tree offsets
, tree
*next_field
)
4313 /* Chain to hold all the new FIELD_DECLs which stand in for base class
4316 int n_baseclasses
= BINFO_N_BASE_BINFOS (TYPE_BINFO (t
));
4319 /* The primary base class is always allocated first. */
4320 if (CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
4321 next_field
= build_base_field (rli
, CLASSTYPE_PRIMARY_BINFO (t
),
4322 offsets
, next_field
);
4324 /* Now allocate the rest of the bases. */
4325 for (i
= 0; i
< n_baseclasses
; ++i
)
4329 base_binfo
= BINFO_BASE_BINFO (TYPE_BINFO (t
), i
);
4331 /* The primary base was already allocated above, so we don't
4332 need to allocate it again here. */
4333 if (base_binfo
== CLASSTYPE_PRIMARY_BINFO (t
))
4336 /* Virtual bases are added at the end (a primary virtual base
4337 will have already been added). */
4338 if (BINFO_VIRTUAL_P (base_binfo
))
4341 next_field
= build_base_field (rli
, base_binfo
,
4342 offsets
, next_field
);
4346 /* Go through the TYPE_METHODS of T issuing any appropriate
4347 diagnostics, figuring out which methods override which other
4348 methods, and so forth. */
4351 check_methods (tree t
)
4355 for (x
= TYPE_METHODS (t
); x
; x
= DECL_CHAIN (x
))
4357 check_for_override (x
, t
);
4358 if (DECL_PURE_VIRTUAL_P (x
) && (TREE_CODE (x
) != FUNCTION_DECL
|| ! DECL_VINDEX (x
)))
4359 error ("initializer specified for non-virtual method %q+D", x
);
4360 /* The name of the field is the original field name
4361 Save this in auxiliary field for later overloading. */
4362 if (TREE_CODE (x
) == FUNCTION_DECL
&& DECL_VINDEX (x
))
4364 TYPE_POLYMORPHIC_P (t
) = 1;
4365 if (DECL_PURE_VIRTUAL_P (x
))
4366 vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t
), x
);
4368 /* All user-provided destructors are non-trivial.
4369 Constructors and assignment ops are handled in
4370 grok_special_member_properties. */
4371 if (DECL_DESTRUCTOR_P (x
) && user_provided_p (x
))
4372 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = 1;
4376 /* FN is a constructor or destructor. Clone the declaration to create
4377 a specialized in-charge or not-in-charge version, as indicated by
4381 build_clone (tree fn
, tree name
)
4386 /* Copy the function. */
4387 clone
= copy_decl (fn
);
4388 /* Reset the function name. */
4389 DECL_NAME (clone
) = name
;
4390 /* Remember where this function came from. */
4391 DECL_ABSTRACT_ORIGIN (clone
) = fn
;
4392 /* Make it easy to find the CLONE given the FN. */
4393 DECL_CHAIN (clone
) = DECL_CHAIN (fn
);
4394 DECL_CHAIN (fn
) = clone
;
4396 /* If this is a template, do the rest on the DECL_TEMPLATE_RESULT. */
4397 if (TREE_CODE (clone
) == TEMPLATE_DECL
)
4399 tree result
= build_clone (DECL_TEMPLATE_RESULT (clone
), name
);
4400 DECL_TEMPLATE_RESULT (clone
) = result
;
4401 DECL_TEMPLATE_INFO (result
) = copy_node (DECL_TEMPLATE_INFO (result
));
4402 DECL_TI_TEMPLATE (result
) = clone
;
4403 TREE_TYPE (clone
) = TREE_TYPE (result
);
4407 SET_DECL_ASSEMBLER_NAME (clone
, NULL_TREE
);
4408 DECL_CLONED_FUNCTION (clone
) = fn
;
4409 /* There's no pending inline data for this function. */
4410 DECL_PENDING_INLINE_INFO (clone
) = NULL
;
4411 DECL_PENDING_INLINE_P (clone
) = 0;
4413 /* The base-class destructor is not virtual. */
4414 if (name
== base_dtor_identifier
)
4416 DECL_VIRTUAL_P (clone
) = 0;
4417 if (TREE_CODE (clone
) != TEMPLATE_DECL
)
4418 DECL_VINDEX (clone
) = NULL_TREE
;
4421 /* If there was an in-charge parameter, drop it from the function
4423 if (DECL_HAS_IN_CHARGE_PARM_P (clone
))
4429 exceptions
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone
));
4430 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (clone
));
4431 parmtypes
= TYPE_ARG_TYPES (TREE_TYPE (clone
));
4432 /* Skip the `this' parameter. */
4433 parmtypes
= TREE_CHAIN (parmtypes
);
4434 /* Skip the in-charge parameter. */
4435 parmtypes
= TREE_CHAIN (parmtypes
);
4436 /* And the VTT parm, in a complete [cd]tor. */
4437 if (DECL_HAS_VTT_PARM_P (fn
)
4438 && ! DECL_NEEDS_VTT_PARM_P (clone
))
4439 parmtypes
= TREE_CHAIN (parmtypes
);
4440 /* If this is subobject constructor or destructor, add the vtt
4443 = build_method_type_directly (basetype
,
4444 TREE_TYPE (TREE_TYPE (clone
)),
4447 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
),
4450 = cp_build_type_attribute_variant (TREE_TYPE (clone
),
4451 TYPE_ATTRIBUTES (TREE_TYPE (fn
)));
4454 /* Copy the function parameters. */
4455 DECL_ARGUMENTS (clone
) = copy_list (DECL_ARGUMENTS (clone
));
4456 /* Remove the in-charge parameter. */
4457 if (DECL_HAS_IN_CHARGE_PARM_P (clone
))
4459 DECL_CHAIN (DECL_ARGUMENTS (clone
))
4460 = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone
)));
4461 DECL_HAS_IN_CHARGE_PARM_P (clone
) = 0;
4463 /* And the VTT parm, in a complete [cd]tor. */
4464 if (DECL_HAS_VTT_PARM_P (fn
))
4466 if (DECL_NEEDS_VTT_PARM_P (clone
))
4467 DECL_HAS_VTT_PARM_P (clone
) = 1;
4470 DECL_CHAIN (DECL_ARGUMENTS (clone
))
4471 = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone
)));
4472 DECL_HAS_VTT_PARM_P (clone
) = 0;
4476 for (parms
= DECL_ARGUMENTS (clone
); parms
; parms
= DECL_CHAIN (parms
))
4478 DECL_CONTEXT (parms
) = clone
;
4479 cxx_dup_lang_specific_decl (parms
);
4482 /* Create the RTL for this function. */
4483 SET_DECL_RTL (clone
, NULL
);
4484 rest_of_decl_compilation (clone
, /*top_level=*/1, at_eof
);
4487 note_decl_for_pch (clone
);
4492 /* Implementation of DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P, do
4493 not invoke this function directly.
4495 For a non-thunk function, returns the address of the slot for storing
4496 the function it is a clone of. Otherwise returns NULL_TREE.
4498 If JUST_TESTING, looks through TEMPLATE_DECL and returns NULL if
4499 cloned_function is unset. This is to support the separate
4500 DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P modes; using the latter
4501 on a template makes sense, but not the former. */
4504 decl_cloned_function_p (const_tree decl
, bool just_testing
)
4508 decl
= STRIP_TEMPLATE (decl
);
4510 if (TREE_CODE (decl
) != FUNCTION_DECL
4511 || !DECL_LANG_SPECIFIC (decl
)
4512 || DECL_LANG_SPECIFIC (decl
)->u
.fn
.thunk_p
)
4514 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4516 lang_check_failed (__FILE__
, __LINE__
, __FUNCTION__
);
4522 ptr
= &DECL_LANG_SPECIFIC (decl
)->u
.fn
.u5
.cloned_function
;
4523 if (just_testing
&& *ptr
== NULL_TREE
)
4529 /* Produce declarations for all appropriate clones of FN. If
4530 UPDATE_METHOD_VEC_P is nonzero, the clones are added to the
4531 CLASTYPE_METHOD_VEC as well. */
4534 clone_function_decl (tree fn
, int update_method_vec_p
)
4538 /* Avoid inappropriate cloning. */
4540 && DECL_CLONED_FUNCTION_P (DECL_CHAIN (fn
)))
4543 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
4545 /* For each constructor, we need two variants: an in-charge version
4546 and a not-in-charge version. */
4547 clone
= build_clone (fn
, complete_ctor_identifier
);
4548 if (update_method_vec_p
)
4549 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4550 clone
= build_clone (fn
, base_ctor_identifier
);
4551 if (update_method_vec_p
)
4552 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4556 gcc_assert (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn
));
4558 /* For each destructor, we need three variants: an in-charge
4559 version, a not-in-charge version, and an in-charge deleting
4560 version. We clone the deleting version first because that
4561 means it will go second on the TYPE_METHODS list -- and that
4562 corresponds to the correct layout order in the virtual
4565 For a non-virtual destructor, we do not build a deleting
4567 if (DECL_VIRTUAL_P (fn
))
4569 clone
= build_clone (fn
, deleting_dtor_identifier
);
4570 if (update_method_vec_p
)
4571 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4573 clone
= build_clone (fn
, complete_dtor_identifier
);
4574 if (update_method_vec_p
)
4575 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4576 clone
= build_clone (fn
, base_dtor_identifier
);
4577 if (update_method_vec_p
)
4578 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4581 /* Note that this is an abstract function that is never emitted. */
4582 DECL_ABSTRACT (fn
) = 1;
4585 /* DECL is an in charge constructor, which is being defined. This will
4586 have had an in class declaration, from whence clones were
4587 declared. An out-of-class definition can specify additional default
4588 arguments. As it is the clones that are involved in overload
4589 resolution, we must propagate the information from the DECL to its
4593 adjust_clone_args (tree decl
)
4597 for (clone
= DECL_CHAIN (decl
); clone
&& DECL_CLONED_FUNCTION_P (clone
);
4598 clone
= DECL_CHAIN (clone
))
4600 tree orig_clone_parms
= TYPE_ARG_TYPES (TREE_TYPE (clone
));
4601 tree orig_decl_parms
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
4602 tree decl_parms
, clone_parms
;
4604 clone_parms
= orig_clone_parms
;
4606 /* Skip the 'this' parameter. */
4607 orig_clone_parms
= TREE_CHAIN (orig_clone_parms
);
4608 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4610 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
4611 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4612 if (DECL_HAS_VTT_PARM_P (decl
))
4613 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4615 clone_parms
= orig_clone_parms
;
4616 if (DECL_HAS_VTT_PARM_P (clone
))
4617 clone_parms
= TREE_CHAIN (clone_parms
);
4619 for (decl_parms
= orig_decl_parms
; decl_parms
;
4620 decl_parms
= TREE_CHAIN (decl_parms
),
4621 clone_parms
= TREE_CHAIN (clone_parms
))
4623 gcc_assert (same_type_p (TREE_TYPE (decl_parms
),
4624 TREE_TYPE (clone_parms
)));
4626 if (TREE_PURPOSE (decl_parms
) && !TREE_PURPOSE (clone_parms
))
4628 /* A default parameter has been added. Adjust the
4629 clone's parameters. */
4630 tree exceptions
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone
));
4631 tree attrs
= TYPE_ATTRIBUTES (TREE_TYPE (clone
));
4632 tree basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (clone
));
4635 clone_parms
= orig_decl_parms
;
4637 if (DECL_HAS_VTT_PARM_P (clone
))
4639 clone_parms
= tree_cons (TREE_PURPOSE (orig_clone_parms
),
4640 TREE_VALUE (orig_clone_parms
),
4642 TREE_TYPE (clone_parms
) = TREE_TYPE (orig_clone_parms
);
4644 type
= build_method_type_directly (basetype
,
4645 TREE_TYPE (TREE_TYPE (clone
)),
4648 type
= build_exception_variant (type
, exceptions
);
4650 type
= cp_build_type_attribute_variant (type
, attrs
);
4651 TREE_TYPE (clone
) = type
;
4653 clone_parms
= NULL_TREE
;
4657 gcc_assert (!clone_parms
);
4661 /* For each of the constructors and destructors in T, create an
4662 in-charge and not-in-charge variant. */
4665 clone_constructors_and_destructors (tree t
)
4669 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4671 if (!CLASSTYPE_METHOD_VEC (t
))
4674 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4675 clone_function_decl (OVL_CURRENT (fns
), /*update_method_vec_p=*/1);
4676 for (fns
= CLASSTYPE_DESTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4677 clone_function_decl (OVL_CURRENT (fns
), /*update_method_vec_p=*/1);
4680 /* Deduce noexcept for a destructor DTOR. */
4683 deduce_noexcept_on_destructor (tree dtor
)
4685 if (!TYPE_RAISES_EXCEPTIONS (TREE_TYPE (dtor
)))
4687 tree eh_spec
= unevaluated_noexcept_spec ();
4688 TREE_TYPE (dtor
) = build_exception_variant (TREE_TYPE (dtor
), eh_spec
);
4692 /* For each destructor in T, deduce noexcept:
4694 12.4/3: A declaration of a destructor that does not have an
4695 exception-specification is implicitly considered to have the
4696 same exception-specification as an implicit declaration (15.4). */
4699 deduce_noexcept_on_destructors (tree t
)
4701 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4703 if (!CLASSTYPE_METHOD_VEC (t
))
4706 for (tree fns
= CLASSTYPE_DESTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4707 deduce_noexcept_on_destructor (OVL_CURRENT (fns
));
4710 /* Subroutine of set_one_vmethod_tm_attributes. Search base classes
4711 of TYPE for virtual functions which FNDECL overrides. Return a
4712 mask of the tm attributes found therein. */
4715 look_for_tm_attr_overrides (tree type
, tree fndecl
)
4717 tree binfo
= TYPE_BINFO (type
);
4721 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ++ix
)
4723 tree o
, basetype
= BINFO_TYPE (base_binfo
);
4725 if (!TYPE_POLYMORPHIC_P (basetype
))
4728 o
= look_for_overrides_here (basetype
, fndecl
);
4730 found
|= tm_attr_to_mask (find_tm_attribute
4731 (TYPE_ATTRIBUTES (TREE_TYPE (o
))));
4733 found
|= look_for_tm_attr_overrides (basetype
, fndecl
);
4739 /* Subroutine of set_method_tm_attributes. Handle the checks and
4740 inheritance for one virtual method FNDECL. */
4743 set_one_vmethod_tm_attributes (tree type
, tree fndecl
)
4748 found
= look_for_tm_attr_overrides (type
, fndecl
);
4750 /* If FNDECL doesn't actually override anything (i.e. T is the
4751 class that first declares FNDECL virtual), then we're done. */
4755 tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl
)));
4756 have
= tm_attr_to_mask (tm_attr
);
4758 /* Intel STM Language Extension 3.0, Section 4.2 table 4:
4759 tm_pure must match exactly, otherwise no weakening of
4760 tm_safe > tm_callable > nothing. */
4761 /* ??? The tm_pure attribute didn't make the transition to the
4762 multivendor language spec. */
4763 if (have
== TM_ATTR_PURE
)
4765 if (found
!= TM_ATTR_PURE
)
4771 /* If the overridden function is tm_pure, then FNDECL must be. */
4772 else if (found
== TM_ATTR_PURE
&& tm_attr
)
4774 /* Look for base class combinations that cannot be satisfied. */
4775 else if (found
!= TM_ATTR_PURE
&& (found
& TM_ATTR_PURE
))
4777 found
&= ~TM_ATTR_PURE
;
4779 error_at (DECL_SOURCE_LOCATION (fndecl
),
4780 "method overrides both %<transaction_pure%> and %qE methods",
4781 tm_mask_to_attr (found
));
4783 /* If FNDECL did not declare an attribute, then inherit the most
4785 else if (tm_attr
== NULL
)
4787 apply_tm_attr (fndecl
, tm_mask_to_attr (found
& -found
));
4789 /* Otherwise validate that we're not weaker than a function
4790 that is being overridden. */
4794 if (found
<= TM_ATTR_CALLABLE
&& have
> found
)
4800 error_at (DECL_SOURCE_LOCATION (fndecl
),
4801 "method declared %qE overriding %qE method",
4802 tm_attr
, tm_mask_to_attr (found
));
4805 /* For each of the methods in T, propagate a class-level tm attribute. */
4808 set_method_tm_attributes (tree t
)
4810 tree class_tm_attr
, fndecl
;
4812 /* Don't bother collecting tm attributes if transactional memory
4813 support is not enabled. */
4817 /* Process virtual methods first, as they inherit directly from the
4818 base virtual function and also require validation of new attributes. */
4819 if (TYPE_CONTAINS_VPTR_P (t
))
4822 for (vchain
= BINFO_VIRTUALS (TYPE_BINFO (t
)); vchain
;
4823 vchain
= TREE_CHAIN (vchain
))
4825 fndecl
= BV_FN (vchain
);
4826 if (DECL_THUNK_P (fndecl
))
4827 fndecl
= THUNK_TARGET (fndecl
);
4828 set_one_vmethod_tm_attributes (t
, fndecl
);
4832 /* If the class doesn't have an attribute, nothing more to do. */
4833 class_tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (t
));
4834 if (class_tm_attr
== NULL
)
4837 /* Any method that does not yet have a tm attribute inherits
4838 the one from the class. */
4839 for (fndecl
= TYPE_METHODS (t
); fndecl
; fndecl
= TREE_CHAIN (fndecl
))
4841 if (!find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl
))))
4842 apply_tm_attr (fndecl
, class_tm_attr
);
4846 /* Returns true iff class T has a user-defined constructor other than
4847 the default constructor. */
4850 type_has_user_nondefault_constructor (tree t
)
4854 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4857 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4859 tree fn
= OVL_CURRENT (fns
);
4860 if (!DECL_ARTIFICIAL (fn
)
4861 && (TREE_CODE (fn
) == TEMPLATE_DECL
4862 || (skip_artificial_parms_for (fn
, DECL_ARGUMENTS (fn
))
4870 /* Returns the defaulted constructor if T has one. Otherwise, returns
4874 in_class_defaulted_default_constructor (tree t
)
4878 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4881 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4883 tree fn
= OVL_CURRENT (fns
);
4885 if (DECL_DEFAULTED_IN_CLASS_P (fn
))
4887 args
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
4888 while (args
&& TREE_PURPOSE (args
))
4889 args
= TREE_CHAIN (args
);
4890 if (!args
|| args
== void_list_node
)
4898 /* Returns true iff FN is a user-provided function, i.e. user-declared
4899 and not defaulted at its first declaration; or explicit, private,
4900 protected, or non-const. */
4903 user_provided_p (tree fn
)
4905 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4908 return (!DECL_ARTIFICIAL (fn
)
4909 && !(DECL_INITIALIZED_IN_CLASS_P (fn
)
4910 && (DECL_DEFAULTED_FN (fn
) || DECL_DELETED_FN (fn
))));
4913 /* Returns true iff class T has a user-provided constructor. */
4916 type_has_user_provided_constructor (tree t
)
4920 if (!CLASS_TYPE_P (t
))
4923 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4926 /* This can happen in error cases; avoid crashing. */
4927 if (!CLASSTYPE_METHOD_VEC (t
))
4930 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4931 if (user_provided_p (OVL_CURRENT (fns
)))
4937 /* Returns true iff class T has a user-provided default constructor. */
4940 type_has_user_provided_default_constructor (tree t
)
4944 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4947 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4949 tree fn
= OVL_CURRENT (fns
);
4950 if (TREE_CODE (fn
) == FUNCTION_DECL
4951 && user_provided_p (fn
)
4952 && sufficient_parms_p (FUNCTION_FIRST_USER_PARMTYPE (fn
)))
4959 /* TYPE is being used as a virtual base, and has a non-trivial move
4960 assignment. Return true if this is due to there being a user-provided
4961 move assignment in TYPE or one of its subobjects; if there isn't, then
4962 multiple move assignment can't cause any harm. */
4965 vbase_has_user_provided_move_assign (tree type
)
4967 /* Does the type itself have a user-provided move assignment operator? */
4969 = lookup_fnfields_slot_nolazy (type
, ansi_assopname (NOP_EXPR
));
4970 fns
; fns
= OVL_NEXT (fns
))
4972 tree fn
= OVL_CURRENT (fns
);
4973 if (move_fn_p (fn
) && user_provided_p (fn
))
4977 /* Do any of its bases? */
4978 tree binfo
= TYPE_BINFO (type
);
4980 for (int i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
4981 if (vbase_has_user_provided_move_assign (BINFO_TYPE (base_binfo
)))
4984 /* Or non-static data members? */
4985 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
4987 if (TREE_CODE (field
) == FIELD_DECL
4988 && CLASS_TYPE_P (TREE_TYPE (field
))
4989 && vbase_has_user_provided_move_assign (TREE_TYPE (field
)))
4997 /* If default-initialization leaves part of TYPE uninitialized, returns
4998 a DECL for the field or TYPE itself (DR 253). */
5001 default_init_uninitialized_part (tree type
)
5006 type
= strip_array_types (type
);
5007 if (!CLASS_TYPE_P (type
))
5009 if (type_has_user_provided_default_constructor (type
))
5011 for (binfo
= TYPE_BINFO (type
), i
= 0;
5012 BINFO_BASE_ITERATE (binfo
, i
, t
); ++i
)
5014 r
= default_init_uninitialized_part (BINFO_TYPE (t
));
5018 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
5019 if (TREE_CODE (t
) == FIELD_DECL
5020 && !DECL_ARTIFICIAL (t
)
5021 && !DECL_INITIAL (t
))
5023 r
= default_init_uninitialized_part (TREE_TYPE (t
));
5025 return DECL_P (r
) ? r
: t
;
5031 /* Returns true iff for class T, a trivial synthesized default constructor
5032 would be constexpr. */
5035 trivial_default_constructor_is_constexpr (tree t
)
5037 /* A defaulted trivial default constructor is constexpr
5038 if there is nothing to initialize. */
5039 gcc_assert (!TYPE_HAS_COMPLEX_DFLT (t
));
5040 return is_really_empty_class (t
);
5043 /* Returns true iff class T has a constexpr default constructor. */
5046 type_has_constexpr_default_constructor (tree t
)
5050 if (!CLASS_TYPE_P (t
))
5052 /* The caller should have stripped an enclosing array. */
5053 gcc_assert (TREE_CODE (t
) != ARRAY_TYPE
);
5056 if (CLASSTYPE_LAZY_DEFAULT_CTOR (t
))
5058 if (!TYPE_HAS_COMPLEX_DFLT (t
))
5059 return trivial_default_constructor_is_constexpr (t
);
5060 /* Non-trivial, we need to check subobject constructors. */
5061 lazily_declare_fn (sfk_constructor
, t
);
5063 fns
= locate_ctor (t
);
5064 return (fns
&& DECL_DECLARED_CONSTEXPR_P (fns
));
5067 /* Returns true iff class TYPE has a virtual destructor. */
5070 type_has_virtual_destructor (tree type
)
5074 if (!CLASS_TYPE_P (type
))
5077 gcc_assert (COMPLETE_TYPE_P (type
));
5078 dtor
= CLASSTYPE_DESTRUCTORS (type
);
5079 return (dtor
&& DECL_VIRTUAL_P (dtor
));
5082 /* Returns true iff class T has a move constructor. */
5085 type_has_move_constructor (tree t
)
5089 if (CLASSTYPE_LAZY_MOVE_CTOR (t
))
5091 gcc_assert (COMPLETE_TYPE_P (t
));
5092 lazily_declare_fn (sfk_move_constructor
, t
);
5095 if (!CLASSTYPE_METHOD_VEC (t
))
5098 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5099 if (move_fn_p (OVL_CURRENT (fns
)))
5105 /* Returns true iff class T has a move assignment operator. */
5108 type_has_move_assign (tree t
)
5112 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
5114 gcc_assert (COMPLETE_TYPE_P (t
));
5115 lazily_declare_fn (sfk_move_assignment
, t
);
5118 for (fns
= lookup_fnfields_slot_nolazy (t
, ansi_assopname (NOP_EXPR
));
5119 fns
; fns
= OVL_NEXT (fns
))
5120 if (move_fn_p (OVL_CURRENT (fns
)))
5126 /* Returns true iff class T has a move constructor that was explicitly
5127 declared in the class body. Note that this is different from
5128 "user-provided", which doesn't include functions that are defaulted in
5132 type_has_user_declared_move_constructor (tree t
)
5136 if (CLASSTYPE_LAZY_MOVE_CTOR (t
))
5139 if (!CLASSTYPE_METHOD_VEC (t
))
5142 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5144 tree fn
= OVL_CURRENT (fns
);
5145 if (move_fn_p (fn
) && !DECL_ARTIFICIAL (fn
))
5152 /* Returns true iff class T has a move assignment operator that was
5153 explicitly declared in the class body. */
5156 type_has_user_declared_move_assign (tree t
)
5160 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
5163 for (fns
= lookup_fnfields_slot_nolazy (t
, ansi_assopname (NOP_EXPR
));
5164 fns
; fns
= OVL_NEXT (fns
))
5166 tree fn
= OVL_CURRENT (fns
);
5167 if (move_fn_p (fn
) && !DECL_ARTIFICIAL (fn
))
5174 /* Nonzero if we need to build up a constructor call when initializing an
5175 object of this class, either because it has a user-declared constructor
5176 or because it doesn't have a default constructor (so we need to give an
5177 error if no initializer is provided). Use TYPE_NEEDS_CONSTRUCTING when
5178 what you care about is whether or not an object can be produced by a
5179 constructor (e.g. so we don't set TREE_READONLY on const variables of
5180 such type); use this function when what you care about is whether or not
5181 to try to call a constructor to create an object. The latter case is
5182 the former plus some cases of constructors that cannot be called. */
5185 type_build_ctor_call (tree t
)
5188 if (TYPE_NEEDS_CONSTRUCTING (t
))
5190 inner
= strip_array_types (t
);
5191 if (!CLASS_TYPE_P (inner
) || ANON_AGGR_TYPE_P (inner
))
5193 if (!TYPE_HAS_DEFAULT_CONSTRUCTOR (inner
))
5195 if (cxx_dialect
< cxx11
)
5197 /* A user-declared constructor might be private, and a constructor might
5198 be trivial but deleted. */
5199 for (tree fns
= lookup_fnfields_slot (inner
, complete_ctor_identifier
);
5200 fns
; fns
= OVL_NEXT (fns
))
5202 tree fn
= OVL_CURRENT (fns
);
5203 if (!DECL_ARTIFICIAL (fn
)
5204 || DECL_DELETED_FN (fn
))
5210 /* Like type_build_ctor_call, but for destructors. */
5213 type_build_dtor_call (tree t
)
5216 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5218 inner
= strip_array_types (t
);
5219 if (!CLASS_TYPE_P (inner
) || ANON_AGGR_TYPE_P (inner
)
5220 || !COMPLETE_TYPE_P (inner
))
5222 if (cxx_dialect
< cxx11
)
5224 /* A user-declared destructor might be private, and a destructor might
5225 be trivial but deleted. */
5226 for (tree fns
= lookup_fnfields_slot (inner
, complete_dtor_identifier
);
5227 fns
; fns
= OVL_NEXT (fns
))
5229 tree fn
= OVL_CURRENT (fns
);
5230 if (!DECL_ARTIFICIAL (fn
)
5231 || DECL_DELETED_FN (fn
))
5237 /* Remove all zero-width bit-fields from T. */
5240 remove_zero_width_bit_fields (tree t
)
5244 fieldsp
= &TYPE_FIELDS (t
);
5247 if (TREE_CODE (*fieldsp
) == FIELD_DECL
5248 && DECL_C_BIT_FIELD (*fieldsp
)
5249 /* We should not be confused by the fact that grokbitfield
5250 temporarily sets the width of the bit field into
5251 DECL_INITIAL (*fieldsp).
5252 check_bitfield_decl eventually sets DECL_SIZE (*fieldsp)
5254 && integer_zerop (DECL_SIZE (*fieldsp
)))
5255 *fieldsp
= DECL_CHAIN (*fieldsp
);
5257 fieldsp
= &DECL_CHAIN (*fieldsp
);
5261 /* Returns TRUE iff we need a cookie when dynamically allocating an
5262 array whose elements have the indicated class TYPE. */
5265 type_requires_array_cookie (tree type
)
5268 bool has_two_argument_delete_p
= false;
5270 gcc_assert (CLASS_TYPE_P (type
));
5272 /* If there's a non-trivial destructor, we need a cookie. In order
5273 to iterate through the array calling the destructor for each
5274 element, we'll have to know how many elements there are. */
5275 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
5278 /* If the usual deallocation function is a two-argument whose second
5279 argument is of type `size_t', then we have to pass the size of
5280 the array to the deallocation function, so we will need to store
5282 fns
= lookup_fnfields (TYPE_BINFO (type
),
5283 ansi_opname (VEC_DELETE_EXPR
),
5285 /* If there are no `operator []' members, or the lookup is
5286 ambiguous, then we don't need a cookie. */
5287 if (!fns
|| fns
== error_mark_node
)
5289 /* Loop through all of the functions. */
5290 for (fns
= BASELINK_FUNCTIONS (fns
); fns
; fns
= OVL_NEXT (fns
))
5295 /* Select the current function. */
5296 fn
= OVL_CURRENT (fns
);
5297 /* See if this function is a one-argument delete function. If
5298 it is, then it will be the usual deallocation function. */
5299 second_parm
= TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (fn
)));
5300 if (second_parm
== void_list_node
)
5302 /* Do not consider this function if its second argument is an
5306 /* Otherwise, if we have a two-argument function and the second
5307 argument is `size_t', it will be the usual deallocation
5308 function -- unless there is one-argument function, too. */
5309 if (TREE_CHAIN (second_parm
) == void_list_node
5310 && same_type_p (TREE_VALUE (second_parm
), size_type_node
))
5311 has_two_argument_delete_p
= true;
5314 return has_two_argument_delete_p
;
5317 /* Finish computing the `literal type' property of class type T.
5319 At this point, we have already processed base classes and
5320 non-static data members. We need to check whether the copy
5321 constructor is trivial, the destructor is trivial, and there
5322 is a trivial default constructor or at least one constexpr
5323 constructor other than the copy constructor. */
5326 finalize_literal_type_property (tree t
)
5330 if (cxx_dialect
< cxx11
5331 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5332 CLASSTYPE_LITERAL_P (t
) = false;
5333 else if (CLASSTYPE_LITERAL_P (t
) && !TYPE_HAS_TRIVIAL_DFLT (t
)
5334 && CLASSTYPE_NON_AGGREGATE (t
)
5335 && !TYPE_HAS_CONSTEXPR_CTOR (t
))
5336 CLASSTYPE_LITERAL_P (t
) = false;
5338 if (!CLASSTYPE_LITERAL_P (t
))
5339 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5340 if (DECL_DECLARED_CONSTEXPR_P (fn
)
5341 && TREE_CODE (fn
) != TEMPLATE_DECL
5342 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
5343 && !DECL_CONSTRUCTOR_P (fn
))
5345 DECL_DECLARED_CONSTEXPR_P (fn
) = false;
5346 if (!DECL_GENERATED_P (fn
))
5348 error ("enclosing class of constexpr non-static member "
5349 "function %q+#D is not a literal type", fn
);
5350 explain_non_literal_class (t
);
5355 /* T is a non-literal type used in a context which requires a constant
5356 expression. Explain why it isn't literal. */
5359 explain_non_literal_class (tree t
)
5361 static hash_set
<tree
> *diagnosed
;
5363 if (!CLASS_TYPE_P (t
))
5365 t
= TYPE_MAIN_VARIANT (t
);
5367 if (diagnosed
== NULL
)
5368 diagnosed
= new hash_set
<tree
>;
5369 if (diagnosed
->add (t
))
5370 /* Already explained. */
5373 inform (0, "%q+T is not literal because:", t
);
5374 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5375 inform (0, " %q+T has a non-trivial destructor", t
);
5376 else if (CLASSTYPE_NON_AGGREGATE (t
)
5377 && !TYPE_HAS_TRIVIAL_DFLT (t
)
5378 && !TYPE_HAS_CONSTEXPR_CTOR (t
))
5380 inform (0, " %q+T is not an aggregate, does not have a trivial "
5381 "default constructor, and has no constexpr constructor that "
5382 "is not a copy or move constructor", t
);
5383 if (TYPE_HAS_DEFAULT_CONSTRUCTOR (t
)
5384 && !type_has_user_provided_default_constructor (t
))
5386 /* Note that we can't simply call locate_ctor because when the
5387 constructor is deleted it just returns NULL_TREE. */
5389 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5391 tree fn
= OVL_CURRENT (fns
);
5392 tree parms
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5394 parms
= skip_artificial_parms_for (fn
, parms
);
5396 if (sufficient_parms_p (parms
))
5398 if (DECL_DELETED_FN (fn
))
5399 maybe_explain_implicit_delete (fn
);
5401 explain_invalid_constexpr_fn (fn
);
5409 tree binfo
, base_binfo
, field
; int i
;
5410 for (binfo
= TYPE_BINFO (t
), i
= 0;
5411 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
5413 tree basetype
= TREE_TYPE (base_binfo
);
5414 if (!CLASSTYPE_LITERAL_P (basetype
))
5416 inform (0, " base class %qT of %q+T is non-literal",
5418 explain_non_literal_class (basetype
);
5422 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
5425 if (TREE_CODE (field
) != FIELD_DECL
)
5427 ftype
= TREE_TYPE (field
);
5428 if (!literal_type_p (ftype
))
5430 inform (0, " non-static data member %q+D has "
5431 "non-literal type", field
);
5432 if (CLASS_TYPE_P (ftype
))
5433 explain_non_literal_class (ftype
);
5439 /* Check the validity of the bases and members declared in T. Add any
5440 implicitly-generated functions (like copy-constructors and
5441 assignment operators). Compute various flag bits (like
5442 CLASSTYPE_NON_LAYOUT_POD_T) for T. This routine works purely at the C++
5443 level: i.e., independently of the ABI in use. */
5446 check_bases_and_members (tree t
)
5448 /* Nonzero if the implicitly generated copy constructor should take
5449 a non-const reference argument. */
5450 int cant_have_const_ctor
;
5451 /* Nonzero if the implicitly generated assignment operator
5452 should take a non-const reference argument. */
5453 int no_const_asn_ref
;
5455 bool saved_complex_asn_ref
;
5456 bool saved_nontrivial_dtor
;
5459 /* Pick up any abi_tags from our template arguments before checking. */
5460 inherit_targ_abi_tags (t
);
5462 /* By default, we use const reference arguments and generate default
5464 cant_have_const_ctor
= 0;
5465 no_const_asn_ref
= 0;
5467 /* Check all the base-classes. */
5468 check_bases (t
, &cant_have_const_ctor
,
5471 /* Deduce noexcept on destructors. This needs to happen after we've set
5472 triviality flags appropriately for our bases. */
5473 if (cxx_dialect
>= cxx11
)
5474 deduce_noexcept_on_destructors (t
);
5476 /* Check all the method declarations. */
5479 /* Save the initial values of these flags which only indicate whether
5480 or not the class has user-provided functions. As we analyze the
5481 bases and members we can set these flags for other reasons. */
5482 saved_complex_asn_ref
= TYPE_HAS_COMPLEX_COPY_ASSIGN (t
);
5483 saved_nontrivial_dtor
= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
);
5485 /* Check all the data member declarations. We cannot call
5486 check_field_decls until we have called check_bases check_methods,
5487 as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR
5488 being set appropriately. */
5489 check_field_decls (t
, &access_decls
,
5490 &cant_have_const_ctor
,
5493 /* A nearly-empty class has to be vptr-containing; a nearly empty
5494 class contains just a vptr. */
5495 if (!TYPE_CONTAINS_VPTR_P (t
))
5496 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
5498 /* Do some bookkeeping that will guide the generation of implicitly
5499 declared member functions. */
5500 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5501 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5502 /* We need to call a constructor for this class if it has a
5503 user-provided constructor, or if the default constructor is going
5504 to initialize the vptr. (This is not an if-and-only-if;
5505 TYPE_NEEDS_CONSTRUCTING is set elsewhere if bases or members
5506 themselves need constructing.) */
5507 TYPE_NEEDS_CONSTRUCTING (t
)
5508 |= (type_has_user_provided_constructor (t
) || TYPE_CONTAINS_VPTR_P (t
));
5511 An aggregate is an array or a class with no user-provided
5512 constructors ... and no virtual functions.
5514 Again, other conditions for being an aggregate are checked
5516 CLASSTYPE_NON_AGGREGATE (t
)
5517 |= (type_has_user_provided_constructor (t
) || TYPE_POLYMORPHIC_P (t
));
5518 /* This is the C++98/03 definition of POD; it changed in C++0x, but we
5519 retain the old definition internally for ABI reasons. */
5520 CLASSTYPE_NON_LAYOUT_POD_P (t
)
5521 |= (CLASSTYPE_NON_AGGREGATE (t
)
5522 || saved_nontrivial_dtor
|| saved_complex_asn_ref
);
5523 CLASSTYPE_NON_STD_LAYOUT (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5524 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5525 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5526 TYPE_HAS_COMPLEX_DFLT (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5528 /* Warn if a public base of a polymorphic type has an accessible
5529 non-virtual destructor. It is only now that we know the class is
5530 polymorphic. Although a polymorphic base will have a already
5531 been diagnosed during its definition, we warn on use too. */
5532 if (TYPE_POLYMORPHIC_P (t
) && warn_nonvdtor
)
5534 tree binfo
= TYPE_BINFO (t
);
5535 vec
<tree
, va_gc
> *accesses
= BINFO_BASE_ACCESSES (binfo
);
5539 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
5541 tree basetype
= TREE_TYPE (base_binfo
);
5543 if ((*accesses
)[i
] == access_public_node
5544 && (TYPE_POLYMORPHIC_P (basetype
) || warn_ecpp
)
5545 && accessible_nvdtor_p (basetype
))
5546 warning (OPT_Wnon_virtual_dtor
,
5547 "base class %q#T has accessible non-virtual destructor",
5552 /* If the class has no user-declared constructor, but does have
5553 non-static const or reference data members that can never be
5554 initialized, issue a warning. */
5555 if (warn_uninitialized
5556 /* Classes with user-declared constructors are presumed to
5557 initialize these members. */
5558 && !TYPE_HAS_USER_CONSTRUCTOR (t
)
5559 /* Aggregates can be initialized with brace-enclosed
5561 && CLASSTYPE_NON_AGGREGATE (t
))
5565 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
5569 if (TREE_CODE (field
) != FIELD_DECL
5570 || DECL_INITIAL (field
) != NULL_TREE
)
5573 type
= TREE_TYPE (field
);
5574 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5575 warning (OPT_Wuninitialized
, "non-static reference %q+#D "
5576 "in class without a constructor", field
);
5577 else if (CP_TYPE_CONST_P (type
)
5578 && (!CLASS_TYPE_P (type
)
5579 || !TYPE_HAS_DEFAULT_CONSTRUCTOR (type
)))
5580 warning (OPT_Wuninitialized
, "non-static const member %q+#D "
5581 "in class without a constructor", field
);
5585 /* Synthesize any needed methods. */
5586 add_implicitly_declared_members (t
, &access_decls
,
5587 cant_have_const_ctor
,
5590 /* Check defaulted declarations here so we have cant_have_const_ctor
5591 and don't need to worry about clones. */
5592 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5593 if (!DECL_ARTIFICIAL (fn
) && DECL_DEFAULTED_IN_CLASS_P (fn
))
5595 int copy
= copy_fn_p (fn
);
5599 = (DECL_CONSTRUCTOR_P (fn
) ? !cant_have_const_ctor
5600 : !no_const_asn_ref
);
5601 bool fn_const_p
= (copy
== 2);
5603 if (fn_const_p
&& !imp_const_p
)
5604 /* If the function is defaulted outside the class, we just
5605 give the synthesis error. */
5606 error ("%q+D declared to take const reference, but implicit "
5607 "declaration would take non-const", fn
);
5609 defaulted_late_check (fn
);
5612 if (LAMBDA_TYPE_P (t
))
5614 /* "The closure type associated with a lambda-expression has a deleted
5615 default constructor and a deleted copy assignment operator." */
5616 TYPE_NEEDS_CONSTRUCTING (t
) = 1;
5617 TYPE_HAS_COMPLEX_DFLT (t
) = 1;
5618 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
5619 CLASSTYPE_LAZY_MOVE_ASSIGN (t
) = 0;
5621 /* "This class type is not an aggregate." */
5622 CLASSTYPE_NON_AGGREGATE (t
) = 1;
5625 /* Compute the 'literal type' property before we
5626 do anything with non-static member functions. */
5627 finalize_literal_type_property (t
);
5629 /* Create the in-charge and not-in-charge variants of constructors
5631 clone_constructors_and_destructors (t
);
5633 /* Process the using-declarations. */
5634 for (; access_decls
; access_decls
= TREE_CHAIN (access_decls
))
5635 handle_using_decl (TREE_VALUE (access_decls
), t
);
5637 /* Build and sort the CLASSTYPE_METHOD_VEC. */
5638 finish_struct_methods (t
);
5640 /* Figure out whether or not we will need a cookie when dynamically
5641 allocating an array of this type. */
5642 TYPE_LANG_SPECIFIC (t
)->u
.c
.vec_new_uses_cookie
5643 = type_requires_array_cookie (t
);
5646 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
5647 accordingly. If a new vfield was created (because T doesn't have a
5648 primary base class), then the newly created field is returned. It
5649 is not added to the TYPE_FIELDS list; it is the caller's
5650 responsibility to do that. Accumulate declared virtual functions
5654 create_vtable_ptr (tree t
, tree
* virtuals_p
)
5658 /* Collect the virtual functions declared in T. */
5659 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5660 if (TREE_CODE (fn
) == FUNCTION_DECL
5661 && DECL_VINDEX (fn
) && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn
)
5662 && TREE_CODE (DECL_VINDEX (fn
)) != INTEGER_CST
)
5664 tree new_virtual
= make_node (TREE_LIST
);
5666 BV_FN (new_virtual
) = fn
;
5667 BV_DELTA (new_virtual
) = integer_zero_node
;
5668 BV_VCALL_INDEX (new_virtual
) = NULL_TREE
;
5670 TREE_CHAIN (new_virtual
) = *virtuals_p
;
5671 *virtuals_p
= new_virtual
;
5674 /* If we couldn't find an appropriate base class, create a new field
5675 here. Even if there weren't any new virtual functions, we might need a
5676 new virtual function table if we're supposed to include vptrs in
5677 all classes that need them. */
5678 if (!TYPE_VFIELD (t
) && (*virtuals_p
|| TYPE_CONTAINS_VPTR_P (t
)))
5680 /* We build this decl with vtbl_ptr_type_node, which is a
5681 `vtable_entry_type*'. It might seem more precise to use
5682 `vtable_entry_type (*)[N]' where N is the number of virtual
5683 functions. However, that would require the vtable pointer in
5684 base classes to have a different type than the vtable pointer
5685 in derived classes. We could make that happen, but that
5686 still wouldn't solve all the problems. In particular, the
5687 type-based alias analysis code would decide that assignments
5688 to the base class vtable pointer can't alias assignments to
5689 the derived class vtable pointer, since they have different
5690 types. Thus, in a derived class destructor, where the base
5691 class constructor was inlined, we could generate bad code for
5692 setting up the vtable pointer.
5694 Therefore, we use one type for all vtable pointers. We still
5695 use a type-correct type; it's just doesn't indicate the array
5696 bounds. That's better than using `void*' or some such; it's
5697 cleaner, and it let's the alias analysis code know that these
5698 stores cannot alias stores to void*! */
5701 field
= build_decl (input_location
,
5702 FIELD_DECL
, get_vfield_name (t
), vtbl_ptr_type_node
);
5703 DECL_VIRTUAL_P (field
) = 1;
5704 DECL_ARTIFICIAL (field
) = 1;
5705 DECL_FIELD_CONTEXT (field
) = t
;
5706 DECL_FCONTEXT (field
) = t
;
5707 if (TYPE_PACKED (t
))
5708 DECL_PACKED (field
) = 1;
5710 TYPE_VFIELD (t
) = field
;
5712 /* This class is non-empty. */
5713 CLASSTYPE_EMPTY_P (t
) = 0;
5721 /* Add OFFSET to all base types of BINFO which is a base in the
5722 hierarchy dominated by T.
5724 OFFSET, which is a type offset, is number of bytes. */
5727 propagate_binfo_offsets (tree binfo
, tree offset
)
5733 /* Update BINFO's offset. */
5734 BINFO_OFFSET (binfo
)
5735 = convert (sizetype
,
5736 size_binop (PLUS_EXPR
,
5737 convert (ssizetype
, BINFO_OFFSET (binfo
)),
5740 /* Find the primary base class. */
5741 primary_binfo
= get_primary_binfo (binfo
);
5743 if (primary_binfo
&& BINFO_INHERITANCE_CHAIN (primary_binfo
) == binfo
)
5744 propagate_binfo_offsets (primary_binfo
, offset
);
5746 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
5748 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5750 /* Don't do the primary base twice. */
5751 if (base_binfo
== primary_binfo
)
5754 if (BINFO_VIRTUAL_P (base_binfo
))
5757 propagate_binfo_offsets (base_binfo
, offset
);
5761 /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update
5762 TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of
5763 empty subobjects of T. */
5766 layout_virtual_bases (record_layout_info rli
, splay_tree offsets
)
5772 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t
)) == 0)
5775 /* Find the last field. The artificial fields created for virtual
5776 bases will go after the last extant field to date. */
5777 next_field
= &TYPE_FIELDS (t
);
5779 next_field
= &DECL_CHAIN (*next_field
);
5781 /* Go through the virtual bases, allocating space for each virtual
5782 base that is not already a primary base class. These are
5783 allocated in inheritance graph order. */
5784 for (vbase
= TYPE_BINFO (t
); vbase
; vbase
= TREE_CHAIN (vbase
))
5786 if (!BINFO_VIRTUAL_P (vbase
))
5789 if (!BINFO_PRIMARY_P (vbase
))
5791 /* This virtual base is not a primary base of any class in the
5792 hierarchy, so we have to add space for it. */
5793 next_field
= build_base_field (rli
, vbase
,
5794 offsets
, next_field
);
5799 /* Returns the offset of the byte just past the end of the base class
5803 end_of_base (tree binfo
)
5807 if (!CLASSTYPE_AS_BASE (BINFO_TYPE (binfo
)))
5808 size
= TYPE_SIZE_UNIT (char_type_node
);
5809 else if (is_empty_class (BINFO_TYPE (binfo
)))
5810 /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to
5811 allocate some space for it. It cannot have virtual bases, so
5812 TYPE_SIZE_UNIT is fine. */
5813 size
= TYPE_SIZE_UNIT (BINFO_TYPE (binfo
));
5815 size
= CLASSTYPE_SIZE_UNIT (BINFO_TYPE (binfo
));
5817 return size_binop (PLUS_EXPR
, BINFO_OFFSET (binfo
), size
);
5820 /* Returns the offset of the byte just past the end of the base class
5821 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
5822 only non-virtual bases are included. */
5825 end_of_class (tree t
, int include_virtuals_p
)
5827 tree result
= size_zero_node
;
5828 vec
<tree
, va_gc
> *vbases
;
5834 for (binfo
= TYPE_BINFO (t
), i
= 0;
5835 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5837 if (!include_virtuals_p
5838 && BINFO_VIRTUAL_P (base_binfo
)
5839 && (!BINFO_PRIMARY_P (base_binfo
)
5840 || BINFO_INHERITANCE_CHAIN (base_binfo
) != TYPE_BINFO (t
)))
5843 offset
= end_of_base (base_binfo
);
5844 if (tree_int_cst_lt (result
, offset
))
5848 if (include_virtuals_p
)
5849 for (vbases
= CLASSTYPE_VBASECLASSES (t
), i
= 0;
5850 vec_safe_iterate (vbases
, i
, &base_binfo
); i
++)
5852 offset
= end_of_base (base_binfo
);
5853 if (tree_int_cst_lt (result
, offset
))
5860 /* Warn about bases of T that are inaccessible because they are
5861 ambiguous. For example:
5864 struct T : public S {};
5865 struct U : public S, public T {};
5867 Here, `(S*) new U' is not allowed because there are two `S'
5871 warn_about_ambiguous_bases (tree t
)
5874 vec
<tree
, va_gc
> *vbases
;
5879 /* If there are no repeated bases, nothing can be ambiguous. */
5880 if (!CLASSTYPE_REPEATED_BASE_P (t
))
5883 /* Check direct bases. */
5884 for (binfo
= TYPE_BINFO (t
), i
= 0;
5885 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5887 basetype
= BINFO_TYPE (base_binfo
);
5889 if (!uniquely_derived_from_p (basetype
, t
))
5890 warning (0, "direct base %qT inaccessible in %qT due to ambiguity",
5894 /* Check for ambiguous virtual bases. */
5896 for (vbases
= CLASSTYPE_VBASECLASSES (t
), i
= 0;
5897 vec_safe_iterate (vbases
, i
, &binfo
); i
++)
5899 basetype
= BINFO_TYPE (binfo
);
5901 if (!uniquely_derived_from_p (basetype
, t
))
5902 warning (OPT_Wextra
, "virtual base %qT inaccessible in %qT due "
5903 "to ambiguity", basetype
, t
);
5907 /* Compare two INTEGER_CSTs K1 and K2. */
5910 splay_tree_compare_integer_csts (splay_tree_key k1
, splay_tree_key k2
)
5912 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
5915 /* Increase the size indicated in RLI to account for empty classes
5916 that are "off the end" of the class. */
5919 include_empty_classes (record_layout_info rli
)
5924 /* It might be the case that we grew the class to allocate a
5925 zero-sized base class. That won't be reflected in RLI, yet,
5926 because we are willing to overlay multiple bases at the same
5927 offset. However, now we need to make sure that RLI is big enough
5928 to reflect the entire class. */
5929 eoc
= end_of_class (rli
->t
,
5930 CLASSTYPE_AS_BASE (rli
->t
) != NULL_TREE
);
5931 rli_size
= rli_size_unit_so_far (rli
);
5932 if (TREE_CODE (rli_size
) == INTEGER_CST
5933 && tree_int_cst_lt (rli_size
, eoc
))
5935 /* The size should have been rounded to a whole byte. */
5936 gcc_assert (tree_int_cst_equal
5937 (rli
->bitpos
, round_down (rli
->bitpos
, BITS_PER_UNIT
)));
5939 = size_binop (PLUS_EXPR
,
5941 size_binop (MULT_EXPR
,
5942 convert (bitsizetype
,
5943 size_binop (MINUS_EXPR
,
5945 bitsize_int (BITS_PER_UNIT
)));
5946 normalize_rli (rli
);
5950 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
5951 BINFO_OFFSETs for all of the base-classes. Position the vtable
5952 pointer. Accumulate declared virtual functions on VIRTUALS_P. */
5955 layout_class_type (tree t
, tree
*virtuals_p
)
5957 tree non_static_data_members
;
5960 record_layout_info rli
;
5961 /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of
5962 types that appear at that offset. */
5963 splay_tree empty_base_offsets
;
5964 /* True if the last field laid out was a bit-field. */
5965 bool last_field_was_bitfield
= false;
5966 /* The location at which the next field should be inserted. */
5968 /* T, as a base class. */
5971 /* Keep track of the first non-static data member. */
5972 non_static_data_members
= TYPE_FIELDS (t
);
5974 /* Start laying out the record. */
5975 rli
= start_record_layout (t
);
5977 /* Mark all the primary bases in the hierarchy. */
5978 determine_primary_bases (t
);
5980 /* Create a pointer to our virtual function table. */
5981 vptr
= create_vtable_ptr (t
, virtuals_p
);
5983 /* The vptr is always the first thing in the class. */
5986 DECL_CHAIN (vptr
) = TYPE_FIELDS (t
);
5987 TYPE_FIELDS (t
) = vptr
;
5988 next_field
= &DECL_CHAIN (vptr
);
5989 place_field (rli
, vptr
);
5992 next_field
= &TYPE_FIELDS (t
);
5994 /* Build FIELD_DECLs for all of the non-virtual base-types. */
5995 empty_base_offsets
= splay_tree_new (splay_tree_compare_integer_csts
,
5997 build_base_fields (rli
, empty_base_offsets
, next_field
);
5999 /* Layout the non-static data members. */
6000 for (field
= non_static_data_members
; field
; field
= DECL_CHAIN (field
))
6005 /* We still pass things that aren't non-static data members to
6006 the back end, in case it wants to do something with them. */
6007 if (TREE_CODE (field
) != FIELD_DECL
)
6009 place_field (rli
, field
);
6010 /* If the static data member has incomplete type, keep track
6011 of it so that it can be completed later. (The handling
6012 of pending statics in finish_record_layout is
6013 insufficient; consider:
6016 struct S2 { static S1 s1; };
6018 At this point, finish_record_layout will be called, but
6019 S1 is still incomplete.) */
6022 maybe_register_incomplete_var (field
);
6023 /* The visibility of static data members is determined
6024 at their point of declaration, not their point of
6026 determine_visibility (field
);
6031 type
= TREE_TYPE (field
);
6032 if (type
== error_mark_node
)
6035 padding
= NULL_TREE
;
6037 /* If this field is a bit-field whose width is greater than its
6038 type, then there are some special rules for allocating
6040 if (DECL_C_BIT_FIELD (field
)
6041 && tree_int_cst_lt (TYPE_SIZE (type
), DECL_SIZE (field
)))
6045 bool was_unnamed_p
= false;
6046 /* We must allocate the bits as if suitably aligned for the
6047 longest integer type that fits in this many bits. type
6048 of the field. Then, we are supposed to use the left over
6049 bits as additional padding. */
6050 for (itk
= itk_char
; itk
!= itk_none
; ++itk
)
6051 if (integer_types
[itk
] != NULL_TREE
6052 && (tree_int_cst_lt (size_int (MAX_FIXED_MODE_SIZE
),
6053 TYPE_SIZE (integer_types
[itk
]))
6054 || tree_int_cst_lt (DECL_SIZE (field
),
6055 TYPE_SIZE (integer_types
[itk
]))))
6058 /* ITK now indicates a type that is too large for the
6059 field. We have to back up by one to find the largest
6064 integer_type
= integer_types
[itk
];
6065 } while (itk
> 0 && integer_type
== NULL_TREE
);
6067 /* Figure out how much additional padding is required. */
6068 if (tree_int_cst_lt (TYPE_SIZE (integer_type
), DECL_SIZE (field
)))
6070 if (TREE_CODE (t
) == UNION_TYPE
)
6071 /* In a union, the padding field must have the full width
6072 of the bit-field; all fields start at offset zero. */
6073 padding
= DECL_SIZE (field
);
6075 padding
= size_binop (MINUS_EXPR
, DECL_SIZE (field
),
6076 TYPE_SIZE (integer_type
));
6078 #ifdef PCC_BITFIELD_TYPE_MATTERS
6079 /* An unnamed bitfield does not normally affect the
6080 alignment of the containing class on a target where
6081 PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not
6082 make any exceptions for unnamed bitfields when the
6083 bitfields are longer than their types. Therefore, we
6084 temporarily give the field a name. */
6085 if (PCC_BITFIELD_TYPE_MATTERS
&& !DECL_NAME (field
))
6087 was_unnamed_p
= true;
6088 DECL_NAME (field
) = make_anon_name ();
6091 DECL_SIZE (field
) = TYPE_SIZE (integer_type
);
6092 DECL_ALIGN (field
) = TYPE_ALIGN (integer_type
);
6093 DECL_USER_ALIGN (field
) = TYPE_USER_ALIGN (integer_type
);
6094 layout_nonempty_base_or_field (rli
, field
, NULL_TREE
,
6095 empty_base_offsets
);
6097 DECL_NAME (field
) = NULL_TREE
;
6098 /* Now that layout has been performed, set the size of the
6099 field to the size of its declared type; the rest of the
6100 field is effectively invisible. */
6101 DECL_SIZE (field
) = TYPE_SIZE (type
);
6102 /* We must also reset the DECL_MODE of the field. */
6103 DECL_MODE (field
) = TYPE_MODE (type
);
6106 layout_nonempty_base_or_field (rli
, field
, NULL_TREE
,
6107 empty_base_offsets
);
6109 /* Remember the location of any empty classes in FIELD. */
6110 record_subobject_offsets (TREE_TYPE (field
),
6111 byte_position(field
),
6113 /*is_data_member=*/true);
6115 /* If a bit-field does not immediately follow another bit-field,
6116 and yet it starts in the middle of a byte, we have failed to
6117 comply with the ABI. */
6119 && DECL_C_BIT_FIELD (field
)
6120 /* The TREE_NO_WARNING flag gets set by Objective-C when
6121 laying out an Objective-C class. The ObjC ABI differs
6122 from the C++ ABI, and so we do not want a warning
6124 && !TREE_NO_WARNING (field
)
6125 && !last_field_was_bitfield
6126 && !integer_zerop (size_binop (TRUNC_MOD_EXPR
,
6127 DECL_FIELD_BIT_OFFSET (field
),
6128 bitsize_unit_node
)))
6129 warning (OPT_Wabi
, "offset of %q+D is not ABI-compliant and may "
6130 "change in a future version of GCC", field
);
6132 /* The middle end uses the type of expressions to determine the
6133 possible range of expression values. In order to optimize
6134 "x.i > 7" to "false" for a 2-bit bitfield "i", the middle end
6135 must be made aware of the width of "i", via its type.
6137 Because C++ does not have integer types of arbitrary width,
6138 we must (for the purposes of the front end) convert from the
6139 type assigned here to the declared type of the bitfield
6140 whenever a bitfield expression is used as an rvalue.
6141 Similarly, when assigning a value to a bitfield, the value
6142 must be converted to the type given the bitfield here. */
6143 if (DECL_C_BIT_FIELD (field
))
6145 unsigned HOST_WIDE_INT width
;
6146 tree ftype
= TREE_TYPE (field
);
6147 width
= tree_to_uhwi (DECL_SIZE (field
));
6148 if (width
!= TYPE_PRECISION (ftype
))
6151 = c_build_bitfield_integer_type (width
,
6152 TYPE_UNSIGNED (ftype
));
6154 = cp_build_qualified_type (TREE_TYPE (field
),
6155 cp_type_quals (ftype
));
6159 /* If we needed additional padding after this field, add it
6165 padding_field
= build_decl (input_location
,
6169 DECL_BIT_FIELD (padding_field
) = 1;
6170 DECL_SIZE (padding_field
) = padding
;
6171 DECL_CONTEXT (padding_field
) = t
;
6172 DECL_ARTIFICIAL (padding_field
) = 1;
6173 DECL_IGNORED_P (padding_field
) = 1;
6174 layout_nonempty_base_or_field (rli
, padding_field
,
6176 empty_base_offsets
);
6179 last_field_was_bitfield
= DECL_C_BIT_FIELD (field
);
6182 if (!integer_zerop (rli
->bitpos
))
6184 /* Make sure that we are on a byte boundary so that the size of
6185 the class without virtual bases will always be a round number
6187 rli
->bitpos
= round_up_loc (input_location
, rli
->bitpos
, BITS_PER_UNIT
);
6188 normalize_rli (rli
);
6191 /* Delete all zero-width bit-fields from the list of fields. Now
6192 that the type is laid out they are no longer important. */
6193 remove_zero_width_bit_fields (t
);
6195 /* Create the version of T used for virtual bases. We do not use
6196 make_class_type for this version; this is an artificial type. For
6197 a POD type, we just reuse T. */
6198 if (CLASSTYPE_NON_LAYOUT_POD_P (t
) || CLASSTYPE_EMPTY_P (t
))
6200 base_t
= make_node (TREE_CODE (t
));
6202 /* Set the size and alignment for the new type. */
6205 /* If the ABI version is not at least two, and the last
6206 field was a bit-field, RLI may not be on a byte
6207 boundary. In particular, rli_size_unit_so_far might
6208 indicate the last complete byte, while rli_size_so_far
6209 indicates the total number of bits used. Therefore,
6210 rli_size_so_far, rather than rli_size_unit_so_far, is
6211 used to compute TYPE_SIZE_UNIT. */
6212 eoc
= end_of_class (t
, /*include_virtuals_p=*/0);
6213 TYPE_SIZE_UNIT (base_t
)
6214 = size_binop (MAX_EXPR
,
6216 size_binop (CEIL_DIV_EXPR
,
6217 rli_size_so_far (rli
),
6218 bitsize_int (BITS_PER_UNIT
))),
6221 = size_binop (MAX_EXPR
,
6222 rli_size_so_far (rli
),
6223 size_binop (MULT_EXPR
,
6224 convert (bitsizetype
, eoc
),
6225 bitsize_int (BITS_PER_UNIT
)));
6226 TYPE_ALIGN (base_t
) = rli
->record_align
;
6227 TYPE_USER_ALIGN (base_t
) = TYPE_USER_ALIGN (t
);
6229 /* Copy the fields from T. */
6230 next_field
= &TYPE_FIELDS (base_t
);
6231 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
6232 if (TREE_CODE (field
) == FIELD_DECL
)
6234 *next_field
= build_decl (input_location
,
6238 DECL_CONTEXT (*next_field
) = base_t
;
6239 DECL_FIELD_OFFSET (*next_field
) = DECL_FIELD_OFFSET (field
);
6240 DECL_FIELD_BIT_OFFSET (*next_field
)
6241 = DECL_FIELD_BIT_OFFSET (field
);
6242 DECL_SIZE (*next_field
) = DECL_SIZE (field
);
6243 DECL_MODE (*next_field
) = DECL_MODE (field
);
6244 next_field
= &DECL_CHAIN (*next_field
);
6247 /* Record the base version of the type. */
6248 CLASSTYPE_AS_BASE (t
) = base_t
;
6249 TYPE_CONTEXT (base_t
) = t
;
6252 CLASSTYPE_AS_BASE (t
) = t
;
6254 /* Every empty class contains an empty class. */
6255 if (CLASSTYPE_EMPTY_P (t
))
6256 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 1;
6258 /* Set the TYPE_DECL for this type to contain the right
6259 value for DECL_OFFSET, so that we can use it as part
6260 of a COMPONENT_REF for multiple inheritance. */
6261 layout_decl (TYPE_MAIN_DECL (t
), 0);
6263 /* Now fix up any virtual base class types that we left lying
6264 around. We must get these done before we try to lay out the
6265 virtual function table. As a side-effect, this will remove the
6266 base subobject fields. */
6267 layout_virtual_bases (rli
, empty_base_offsets
);
6269 /* Make sure that empty classes are reflected in RLI at this
6271 include_empty_classes(rli
);
6273 /* Make sure not to create any structures with zero size. */
6274 if (integer_zerop (rli_size_unit_so_far (rli
)) && CLASSTYPE_EMPTY_P (t
))
6276 build_decl (input_location
,
6277 FIELD_DECL
, NULL_TREE
, char_type_node
));
6279 /* If this is a non-POD, declaring it packed makes a difference to how it
6280 can be used as a field; don't let finalize_record_size undo it. */
6281 if (TYPE_PACKED (t
) && !layout_pod_type_p (t
))
6282 rli
->packed_maybe_necessary
= true;
6284 /* Let the back end lay out the type. */
6285 finish_record_layout (rli
, /*free_p=*/true);
6287 if (TYPE_SIZE_UNIT (t
)
6288 && TREE_CODE (TYPE_SIZE_UNIT (t
)) == INTEGER_CST
6289 && !TREE_OVERFLOW (TYPE_SIZE_UNIT (t
))
6290 && !valid_constant_size_p (TYPE_SIZE_UNIT (t
)))
6291 error ("type %qT is too large", t
);
6293 /* Warn about bases that can't be talked about due to ambiguity. */
6294 warn_about_ambiguous_bases (t
);
6296 /* Now that we're done with layout, give the base fields the real types. */
6297 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
6298 if (DECL_ARTIFICIAL (field
) && IS_FAKE_BASE_TYPE (TREE_TYPE (field
)))
6299 TREE_TYPE (field
) = TYPE_CONTEXT (TREE_TYPE (field
));
6302 splay_tree_delete (empty_base_offsets
);
6304 if (CLASSTYPE_EMPTY_P (t
)
6305 && tree_int_cst_lt (sizeof_biggest_empty_class
,
6306 TYPE_SIZE_UNIT (t
)))
6307 sizeof_biggest_empty_class
= TYPE_SIZE_UNIT (t
);
6310 /* Determine the "key method" for the class type indicated by TYPE,
6311 and set CLASSTYPE_KEY_METHOD accordingly. */
6314 determine_key_method (tree type
)
6318 if (TYPE_FOR_JAVA (type
)
6319 || processing_template_decl
6320 || CLASSTYPE_TEMPLATE_INSTANTIATION (type
)
6321 || CLASSTYPE_INTERFACE_KNOWN (type
))
6324 /* The key method is the first non-pure virtual function that is not
6325 inline at the point of class definition. On some targets the
6326 key function may not be inline; those targets should not call
6327 this function until the end of the translation unit. */
6328 for (method
= TYPE_METHODS (type
); method
!= NULL_TREE
;
6329 method
= DECL_CHAIN (method
))
6330 if (TREE_CODE (method
) == FUNCTION_DECL
6331 && DECL_VINDEX (method
) != NULL_TREE
6332 && ! DECL_DECLARED_INLINE_P (method
)
6333 && ! DECL_PURE_VIRTUAL_P (method
))
6335 CLASSTYPE_KEY_METHOD (type
) = method
;
6343 /* Allocate and return an instance of struct sorted_fields_type with
6346 static struct sorted_fields_type
*
6347 sorted_fields_type_new (int n
)
6349 struct sorted_fields_type
*sft
;
6350 sft
= (sorted_fields_type
*) ggc_internal_alloc (sizeof (sorted_fields_type
)
6351 + n
* sizeof (tree
));
6358 /* Perform processing required when the definition of T (a class type)
6362 finish_struct_1 (tree t
)
6365 /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */
6366 tree virtuals
= NULL_TREE
;
6368 if (COMPLETE_TYPE_P (t
))
6370 gcc_assert (MAYBE_CLASS_TYPE_P (t
));
6371 error ("redefinition of %q#T", t
);
6376 /* If this type was previously laid out as a forward reference,
6377 make sure we lay it out again. */
6378 TYPE_SIZE (t
) = NULL_TREE
;
6379 CLASSTYPE_PRIMARY_BINFO (t
) = NULL_TREE
;
6381 /* Make assumptions about the class; we'll reset the flags if
6383 CLASSTYPE_EMPTY_P (t
) = 1;
6384 CLASSTYPE_NEARLY_EMPTY_P (t
) = 1;
6385 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 0;
6386 CLASSTYPE_LITERAL_P (t
) = true;
6388 /* Do end-of-class semantic processing: checking the validity of the
6389 bases and members and add implicitly generated methods. */
6390 check_bases_and_members (t
);
6392 /* Find the key method. */
6393 if (TYPE_CONTAINS_VPTR_P (t
))
6395 /* The Itanium C++ ABI permits the key method to be chosen when
6396 the class is defined -- even though the key method so
6397 selected may later turn out to be an inline function. On
6398 some systems (such as ARM Symbian OS) the key method cannot
6399 be determined until the end of the translation unit. On such
6400 systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which
6401 will cause the class to be added to KEYED_CLASSES. Then, in
6402 finish_file we will determine the key method. */
6403 if (targetm
.cxx
.key_method_may_be_inline ())
6404 determine_key_method (t
);
6406 /* If a polymorphic class has no key method, we may emit the vtable
6407 in every translation unit where the class definition appears. If
6408 we're devirtualizing, we can look into the vtable even if we
6409 aren't emitting it. */
6410 if (CLASSTYPE_KEY_METHOD (t
) == NULL_TREE
)
6411 keyed_classes
= tree_cons (NULL_TREE
, t
, keyed_classes
);
6414 /* Layout the class itself. */
6415 layout_class_type (t
, &virtuals
);
6416 if (CLASSTYPE_AS_BASE (t
) != t
)
6417 /* We use the base type for trivial assignments, and hence it
6419 compute_record_mode (CLASSTYPE_AS_BASE (t
));
6421 virtuals
= modify_all_vtables (t
, nreverse (virtuals
));
6423 /* If necessary, create the primary vtable for this class. */
6424 if (virtuals
|| TYPE_CONTAINS_VPTR_P (t
))
6426 /* We must enter these virtuals into the table. */
6427 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
6428 build_primary_vtable (NULL_TREE
, t
);
6429 else if (! BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (t
)))
6430 /* Here we know enough to change the type of our virtual
6431 function table, but we will wait until later this function. */
6432 build_primary_vtable (CLASSTYPE_PRIMARY_BINFO (t
), t
);
6434 /* If we're warning about ABI tags, check the types of the new
6435 virtual functions. */
6437 for (tree v
= virtuals
; v
; v
= TREE_CHAIN (v
))
6438 check_abi_tags (t
, TREE_VALUE (v
));
6441 if (TYPE_CONTAINS_VPTR_P (t
))
6446 if (BINFO_VTABLE (TYPE_BINFO (t
)))
6447 gcc_assert (DECL_VIRTUAL_P (BINFO_VTABLE (TYPE_BINFO (t
))));
6448 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
6449 gcc_assert (BINFO_VIRTUALS (TYPE_BINFO (t
)) == NULL_TREE
);
6451 /* Add entries for virtual functions introduced by this class. */
6452 BINFO_VIRTUALS (TYPE_BINFO (t
))
6453 = chainon (BINFO_VIRTUALS (TYPE_BINFO (t
)), virtuals
);
6455 /* Set DECL_VINDEX for all functions declared in this class. */
6456 for (vindex
= 0, fn
= BINFO_VIRTUALS (TYPE_BINFO (t
));
6458 fn
= TREE_CHAIN (fn
),
6459 vindex
+= (TARGET_VTABLE_USES_DESCRIPTORS
6460 ? TARGET_VTABLE_USES_DESCRIPTORS
: 1))
6462 tree fndecl
= BV_FN (fn
);
6464 if (DECL_THUNK_P (fndecl
))
6465 /* A thunk. We should never be calling this entry directly
6466 from this vtable -- we'd use the entry for the non
6467 thunk base function. */
6468 DECL_VINDEX (fndecl
) = NULL_TREE
;
6469 else if (TREE_CODE (DECL_VINDEX (fndecl
)) != INTEGER_CST
)
6470 DECL_VINDEX (fndecl
) = build_int_cst (NULL_TREE
, vindex
);
6474 finish_struct_bits (t
);
6475 set_method_tm_attributes (t
);
6477 /* Complete the rtl for any static member objects of the type we're
6479 for (x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
6480 if (VAR_P (x
) && TREE_STATIC (x
)
6481 && TREE_TYPE (x
) != error_mark_node
6482 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (x
)), t
))
6483 DECL_MODE (x
) = TYPE_MODE (t
);
6485 /* Done with FIELDS...now decide whether to sort these for
6486 faster lookups later.
6488 We use a small number because most searches fail (succeeding
6489 ultimately as the search bores through the inheritance
6490 hierarchy), and we want this failure to occur quickly. */
6492 insert_into_classtype_sorted_fields (TYPE_FIELDS (t
), t
, 8);
6494 /* Complain if one of the field types requires lower visibility. */
6495 constrain_class_visibility (t
);
6497 /* Make the rtl for any new vtables we have created, and unmark
6498 the base types we marked. */
6501 /* Build the VTT for T. */
6504 /* This warning does not make sense for Java classes, since they
6505 cannot have destructors. */
6506 if (!TYPE_FOR_JAVA (t
) && warn_nonvdtor
6507 && TYPE_POLYMORPHIC_P (t
) && accessible_nvdtor_p (t
))
6508 warning (OPT_Wnon_virtual_dtor
,
6509 "%q#T has virtual functions and accessible"
6510 " non-virtual destructor", t
);
6514 if (warn_overloaded_virtual
)
6517 /* Class layout, assignment of virtual table slots, etc., is now
6518 complete. Give the back end a chance to tweak the visibility of
6519 the class or perform any other required target modifications. */
6520 targetm
.cxx
.adjust_class_at_definition (t
);
6522 maybe_suppress_debug_info (t
);
6524 if (flag_vtable_verify
)
6525 vtv_save_class_info (t
);
6527 dump_class_hierarchy (t
);
6529 /* Finish debugging output for this type. */
6530 rest_of_type_compilation (t
, ! LOCAL_CLASS_P (t
));
6532 if (TYPE_TRANSPARENT_AGGR (t
))
6534 tree field
= first_field (t
);
6535 if (field
== NULL_TREE
|| error_operand_p (field
))
6537 error ("type transparent %q#T does not have any fields", t
);
6538 TYPE_TRANSPARENT_AGGR (t
) = 0;
6540 else if (DECL_ARTIFICIAL (field
))
6542 if (DECL_FIELD_IS_BASE (field
))
6543 error ("type transparent class %qT has base classes", t
);
6546 gcc_checking_assert (DECL_VIRTUAL_P (field
));
6547 error ("type transparent class %qT has virtual functions", t
);
6549 TYPE_TRANSPARENT_AGGR (t
) = 0;
6551 else if (TYPE_MODE (t
) != DECL_MODE (field
))
6553 error ("type transparent %q#T cannot be made transparent because "
6554 "the type of the first field has a different ABI from the "
6555 "class overall", t
);
6556 TYPE_TRANSPARENT_AGGR (t
) = 0;
6561 /* Insert FIELDS into T for the sorted case if the FIELDS count is
6562 equal to THRESHOLD or greater than THRESHOLD. */
6565 insert_into_classtype_sorted_fields (tree fields
, tree t
, int threshold
)
6567 int n_fields
= count_fields (fields
);
6568 if (n_fields
>= threshold
)
6570 struct sorted_fields_type
*field_vec
= sorted_fields_type_new (n_fields
);
6571 add_fields_to_record_type (fields
, field_vec
, 0);
6572 qsort (field_vec
->elts
, n_fields
, sizeof (tree
), field_decl_cmp
);
6573 CLASSTYPE_SORTED_FIELDS (t
) = field_vec
;
6577 /* Insert lately defined enum ENUMTYPE into T for the sorted case. */
6580 insert_late_enum_def_into_classtype_sorted_fields (tree enumtype
, tree t
)
6582 struct sorted_fields_type
*sorted_fields
= CLASSTYPE_SORTED_FIELDS (t
);
6587 = list_length (TYPE_VALUES (enumtype
)) + sorted_fields
->len
;
6588 struct sorted_fields_type
*field_vec
= sorted_fields_type_new (n_fields
);
6590 for (i
= 0; i
< sorted_fields
->len
; ++i
)
6591 field_vec
->elts
[i
] = sorted_fields
->elts
[i
];
6593 add_enum_fields_to_record_type (enumtype
, field_vec
,
6594 sorted_fields
->len
);
6595 qsort (field_vec
->elts
, n_fields
, sizeof (tree
), field_decl_cmp
);
6596 CLASSTYPE_SORTED_FIELDS (t
) = field_vec
;
6600 /* When T was built up, the member declarations were added in reverse
6601 order. Rearrange them to declaration order. */
6604 unreverse_member_declarations (tree t
)
6610 /* The following lists are all in reverse order. Put them in
6611 declaration order now. */
6612 TYPE_METHODS (t
) = nreverse (TYPE_METHODS (t
));
6613 CLASSTYPE_DECL_LIST (t
) = nreverse (CLASSTYPE_DECL_LIST (t
));
6615 /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in
6616 reverse order, so we can't just use nreverse. */
6618 for (x
= TYPE_FIELDS (t
);
6619 x
&& TREE_CODE (x
) != TYPE_DECL
;
6622 next
= DECL_CHAIN (x
);
6623 DECL_CHAIN (x
) = prev
;
6628 DECL_CHAIN (TYPE_FIELDS (t
)) = x
;
6630 TYPE_FIELDS (t
) = prev
;
6635 finish_struct (tree t
, tree attributes
)
6637 location_t saved_loc
= input_location
;
6639 /* Now that we've got all the field declarations, reverse everything
6641 unreverse_member_declarations (t
);
6643 cplus_decl_attributes (&t
, attributes
, (int) ATTR_FLAG_TYPE_IN_PLACE
);
6645 /* Nadger the current location so that diagnostics point to the start of
6646 the struct, not the end. */
6647 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (t
));
6649 if (processing_template_decl
)
6653 finish_struct_methods (t
);
6654 TYPE_SIZE (t
) = bitsize_zero_node
;
6655 TYPE_SIZE_UNIT (t
) = size_zero_node
;
6657 /* We need to emit an error message if this type was used as a parameter
6658 and it is an abstract type, even if it is a template. We construct
6659 a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into
6660 account and we call complete_vars with this type, which will check
6661 the PARM_DECLS. Note that while the type is being defined,
6662 CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends
6663 (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */
6664 CLASSTYPE_PURE_VIRTUALS (t
) = NULL
;
6665 for (x
= TYPE_METHODS (t
); x
; x
= DECL_CHAIN (x
))
6666 if (DECL_PURE_VIRTUAL_P (x
))
6667 vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t
), x
);
6669 /* We need to add the target functions to the CLASSTYPE_METHOD_VEC if
6670 an enclosing scope is a template class, so that this function be
6671 found by lookup_fnfields_1 when the using declaration is not
6672 instantiated yet. */
6673 for (x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
6674 if (TREE_CODE (x
) == USING_DECL
)
6676 tree fn
= strip_using_decl (x
);
6677 if (is_overloaded_fn (fn
))
6678 for (; fn
; fn
= OVL_NEXT (fn
))
6679 add_method (t
, OVL_CURRENT (fn
), x
);
6682 /* Remember current #pragma pack value. */
6683 TYPE_PRECISION (t
) = maximum_field_alignment
;
6685 /* Fix up any variants we've already built. */
6686 for (x
= TYPE_NEXT_VARIANT (t
); x
; x
= TYPE_NEXT_VARIANT (x
))
6688 TYPE_SIZE (x
) = TYPE_SIZE (t
);
6689 TYPE_SIZE_UNIT (x
) = TYPE_SIZE_UNIT (t
);
6690 TYPE_FIELDS (x
) = TYPE_FIELDS (t
);
6691 TYPE_METHODS (x
) = TYPE_METHODS (t
);
6695 finish_struct_1 (t
);
6697 if (is_std_init_list (t
))
6699 /* People keep complaining that the compiler crashes on an invalid
6700 definition of initializer_list, so I guess we should explicitly
6701 reject it. What the compiler internals care about is that it's a
6702 template and has a pointer field followed by an integer field. */
6704 if (processing_template_decl
)
6706 tree f
= next_initializable_field (TYPE_FIELDS (t
));
6707 if (f
&& TREE_CODE (TREE_TYPE (f
)) == POINTER_TYPE
)
6709 f
= next_initializable_field (DECL_CHAIN (f
));
6710 if (f
&& TREE_CODE (TREE_TYPE (f
)) == INTEGER_TYPE
)
6715 fatal_error ("definition of std::initializer_list does not match "
6716 "#include <initializer_list>");
6719 input_location
= saved_loc
;
6721 TYPE_BEING_DEFINED (t
) = 0;
6723 if (current_class_type
)
6726 error ("trying to finish struct, but kicked out due to previous parse errors");
6728 if (processing_template_decl
&& at_function_scope_p ()
6729 /* Lambdas are defined by the LAMBDA_EXPR. */
6730 && !LAMBDA_TYPE_P (t
))
6731 add_stmt (build_min (TAG_DEFN
, t
));
6736 /* Hash table to avoid endless recursion when handling references. */
6737 static hash_table
<pointer_hash
<tree_node
> > *fixed_type_or_null_ref_ht
;
6739 /* Return the dynamic type of INSTANCE, if known.
6740 Used to determine whether the virtual function table is needed
6743 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
6744 of our knowledge of its type. *NONNULL should be initialized
6745 before this function is called. */
6748 fixed_type_or_null (tree instance
, int *nonnull
, int *cdtorp
)
6750 #define RECUR(T) fixed_type_or_null((T), nonnull, cdtorp)
6752 switch (TREE_CODE (instance
))
6755 if (POINTER_TYPE_P (TREE_TYPE (instance
)))
6758 return RECUR (TREE_OPERAND (instance
, 0));
6761 /* This is a call to a constructor, hence it's never zero. */
6762 if (TREE_HAS_CONSTRUCTOR (instance
))
6766 return TREE_TYPE (instance
);
6771 /* This is a call to a constructor, hence it's never zero. */
6772 if (TREE_HAS_CONSTRUCTOR (instance
))
6776 return TREE_TYPE (instance
);
6778 return RECUR (TREE_OPERAND (instance
, 0));
6780 case POINTER_PLUS_EXPR
:
6783 if (TREE_CODE (TREE_OPERAND (instance
, 0)) == ADDR_EXPR
)
6784 return RECUR (TREE_OPERAND (instance
, 0));
6785 if (TREE_CODE (TREE_OPERAND (instance
, 1)) == INTEGER_CST
)
6786 /* Propagate nonnull. */
6787 return RECUR (TREE_OPERAND (instance
, 0));
6792 return RECUR (TREE_OPERAND (instance
, 0));
6795 instance
= TREE_OPERAND (instance
, 0);
6798 /* Just because we see an ADDR_EXPR doesn't mean we're dealing
6799 with a real object -- given &p->f, p can still be null. */
6800 tree t
= get_base_address (instance
);
6801 /* ??? Probably should check DECL_WEAK here. */
6802 if (t
&& DECL_P (t
))
6805 return RECUR (instance
);
6808 /* If this component is really a base class reference, then the field
6809 itself isn't definitive. */
6810 if (DECL_FIELD_IS_BASE (TREE_OPERAND (instance
, 1)))
6811 return RECUR (TREE_OPERAND (instance
, 0));
6812 return RECUR (TREE_OPERAND (instance
, 1));
6816 if (TREE_CODE (TREE_TYPE (instance
)) == ARRAY_TYPE
6817 && MAYBE_CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (instance
))))
6821 return TREE_TYPE (TREE_TYPE (instance
));
6823 /* fall through... */
6827 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (instance
)))
6831 return TREE_TYPE (instance
);
6833 else if (instance
== current_class_ptr
)
6838 /* if we're in a ctor or dtor, we know our type. If
6839 current_class_ptr is set but we aren't in a function, we're in
6840 an NSDMI (and therefore a constructor). */
6841 if (current_scope () != current_function_decl
6842 || (DECL_LANG_SPECIFIC (current_function_decl
)
6843 && (DECL_CONSTRUCTOR_P (current_function_decl
)
6844 || DECL_DESTRUCTOR_P (current_function_decl
))))
6848 return TREE_TYPE (TREE_TYPE (instance
));
6851 else if (TREE_CODE (TREE_TYPE (instance
)) == REFERENCE_TYPE
)
6853 /* We only need one hash table because it is always left empty. */
6854 if (!fixed_type_or_null_ref_ht
)
6855 fixed_type_or_null_ref_ht
6856 = new hash_table
<pointer_hash
<tree_node
> > (37);
6858 /* Reference variables should be references to objects. */
6862 /* Enter the INSTANCE in a table to prevent recursion; a
6863 variable's initializer may refer to the variable
6865 if (VAR_P (instance
)
6866 && DECL_INITIAL (instance
)
6867 && !type_dependent_expression_p_push (DECL_INITIAL (instance
))
6868 && !fixed_type_or_null_ref_ht
->find (instance
))
6873 slot
= fixed_type_or_null_ref_ht
->find_slot (instance
, INSERT
);
6875 type
= RECUR (DECL_INITIAL (instance
));
6876 fixed_type_or_null_ref_ht
->remove_elt (instance
);
6889 /* Return nonzero if the dynamic type of INSTANCE is known, and
6890 equivalent to the static type. We also handle the case where
6891 INSTANCE is really a pointer. Return negative if this is a
6892 ctor/dtor. There the dynamic type is known, but this might not be
6893 the most derived base of the original object, and hence virtual
6894 bases may not be laid out according to this type.
6896 Used to determine whether the virtual function table is needed
6899 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
6900 of our knowledge of its type. *NONNULL should be initialized
6901 before this function is called. */
6904 resolves_to_fixed_type_p (tree instance
, int* nonnull
)
6906 tree t
= TREE_TYPE (instance
);
6910 /* processing_template_decl can be false in a template if we're in
6911 fold_non_dependent_expr, but we still want to suppress this check. */
6912 if (in_template_function ())
6914 /* In a template we only care about the type of the result. */
6920 fixed
= fixed_type_or_null (instance
, nonnull
, &cdtorp
);
6921 if (fixed
== NULL_TREE
)
6923 if (POINTER_TYPE_P (t
))
6925 if (!same_type_ignoring_top_level_qualifiers_p (t
, fixed
))
6927 return cdtorp
? -1 : 1;
6932 init_class_processing (void)
6934 current_class_depth
= 0;
6935 current_class_stack_size
= 10;
6937 = XNEWVEC (struct class_stack_node
, current_class_stack_size
);
6938 vec_alloc (local_classes
, 8);
6939 sizeof_biggest_empty_class
= size_zero_node
;
6941 ridpointers
[(int) RID_PUBLIC
] = access_public_node
;
6942 ridpointers
[(int) RID_PRIVATE
] = access_private_node
;
6943 ridpointers
[(int) RID_PROTECTED
] = access_protected_node
;
6946 /* Restore the cached PREVIOUS_CLASS_LEVEL. */
6949 restore_class_cache (void)
6953 /* We are re-entering the same class we just left, so we don't
6954 have to search the whole inheritance matrix to find all the
6955 decls to bind again. Instead, we install the cached
6956 class_shadowed list and walk through it binding names. */
6957 push_binding_level (previous_class_level
);
6958 class_binding_level
= previous_class_level
;
6959 /* Restore IDENTIFIER_TYPE_VALUE. */
6960 for (type
= class_binding_level
->type_shadowed
;
6962 type
= TREE_CHAIN (type
))
6963 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (type
), TREE_TYPE (type
));
6966 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as
6967 appropriate for TYPE.
6969 So that we may avoid calls to lookup_name, we cache the _TYPE
6970 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
6972 For multiple inheritance, we perform a two-pass depth-first search
6973 of the type lattice. */
6976 pushclass (tree type
)
6978 class_stack_node_t csn
;
6980 type
= TYPE_MAIN_VARIANT (type
);
6982 /* Make sure there is enough room for the new entry on the stack. */
6983 if (current_class_depth
+ 1 >= current_class_stack_size
)
6985 current_class_stack_size
*= 2;
6987 = XRESIZEVEC (struct class_stack_node
, current_class_stack
,
6988 current_class_stack_size
);
6991 /* Insert a new entry on the class stack. */
6992 csn
= current_class_stack
+ current_class_depth
;
6993 csn
->name
= current_class_name
;
6994 csn
->type
= current_class_type
;
6995 csn
->access
= current_access_specifier
;
6996 csn
->names_used
= 0;
6998 current_class_depth
++;
7000 /* Now set up the new type. */
7001 current_class_name
= TYPE_NAME (type
);
7002 if (TREE_CODE (current_class_name
) == TYPE_DECL
)
7003 current_class_name
= DECL_NAME (current_class_name
);
7004 current_class_type
= type
;
7006 /* By default, things in classes are private, while things in
7007 structures or unions are public. */
7008 current_access_specifier
= (CLASSTYPE_DECLARED_CLASS (type
)
7009 ? access_private_node
7010 : access_public_node
);
7012 if (previous_class_level
7013 && type
!= previous_class_level
->this_entity
7014 && current_class_depth
== 1)
7016 /* Forcibly remove any old class remnants. */
7017 invalidate_class_lookup_cache ();
7020 if (!previous_class_level
7021 || type
!= previous_class_level
->this_entity
7022 || current_class_depth
> 1)
7025 restore_class_cache ();
7028 /* When we exit a toplevel class scope, we save its binding level so
7029 that we can restore it quickly. Here, we've entered some other
7030 class, so we must invalidate our cache. */
7033 invalidate_class_lookup_cache (void)
7035 previous_class_level
= NULL
;
7038 /* Get out of the current class scope. If we were in a class scope
7039 previously, that is the one popped to. */
7046 current_class_depth
--;
7047 current_class_name
= current_class_stack
[current_class_depth
].name
;
7048 current_class_type
= current_class_stack
[current_class_depth
].type
;
7049 current_access_specifier
= current_class_stack
[current_class_depth
].access
;
7050 if (current_class_stack
[current_class_depth
].names_used
)
7051 splay_tree_delete (current_class_stack
[current_class_depth
].names_used
);
7054 /* Mark the top of the class stack as hidden. */
7057 push_class_stack (void)
7059 if (current_class_depth
)
7060 ++current_class_stack
[current_class_depth
- 1].hidden
;
7063 /* Mark the top of the class stack as un-hidden. */
7066 pop_class_stack (void)
7068 if (current_class_depth
)
7069 --current_class_stack
[current_class_depth
- 1].hidden
;
7072 /* Returns 1 if the class type currently being defined is either T or
7073 a nested type of T. */
7076 currently_open_class (tree t
)
7080 if (!CLASS_TYPE_P (t
))
7083 t
= TYPE_MAIN_VARIANT (t
);
7085 /* We start looking from 1 because entry 0 is from global scope,
7087 for (i
= current_class_depth
; i
> 0; --i
)
7090 if (i
== current_class_depth
)
7091 c
= current_class_type
;
7094 if (current_class_stack
[i
].hidden
)
7096 c
= current_class_stack
[i
].type
;
7100 if (same_type_p (c
, t
))
7106 /* If either current_class_type or one of its enclosing classes are derived
7107 from T, return the appropriate type. Used to determine how we found
7108 something via unqualified lookup. */
7111 currently_open_derived_class (tree t
)
7115 /* The bases of a dependent type are unknown. */
7116 if (dependent_type_p (t
))
7119 if (!current_class_type
)
7122 if (DERIVED_FROM_P (t
, current_class_type
))
7123 return current_class_type
;
7125 for (i
= current_class_depth
- 1; i
> 0; --i
)
7127 if (current_class_stack
[i
].hidden
)
7129 if (DERIVED_FROM_P (t
, current_class_stack
[i
].type
))
7130 return current_class_stack
[i
].type
;
7136 /* Returns the innermost class type which is not a lambda closure type. */
7139 current_nonlambda_class_type (void)
7143 /* We start looking from 1 because entry 0 is from global scope,
7145 for (i
= current_class_depth
; i
> 0; --i
)
7148 if (i
== current_class_depth
)
7149 c
= current_class_type
;
7152 if (current_class_stack
[i
].hidden
)
7154 c
= current_class_stack
[i
].type
;
7158 if (!LAMBDA_TYPE_P (c
))
7164 /* When entering a class scope, all enclosing class scopes' names with
7165 static meaning (static variables, static functions, types and
7166 enumerators) have to be visible. This recursive function calls
7167 pushclass for all enclosing class contexts until global or a local
7168 scope is reached. TYPE is the enclosed class. */
7171 push_nested_class (tree type
)
7173 /* A namespace might be passed in error cases, like A::B:C. */
7174 if (type
== NULL_TREE
7175 || !CLASS_TYPE_P (type
))
7178 push_nested_class (DECL_CONTEXT (TYPE_MAIN_DECL (type
)));
7183 /* Undoes a push_nested_class call. */
7186 pop_nested_class (void)
7188 tree context
= DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type
));
7191 if (context
&& CLASS_TYPE_P (context
))
7192 pop_nested_class ();
7195 /* Returns the number of extern "LANG" blocks we are nested within. */
7198 current_lang_depth (void)
7200 return vec_safe_length (current_lang_base
);
7203 /* Set global variables CURRENT_LANG_NAME to appropriate value
7204 so that behavior of name-mangling machinery is correct. */
7207 push_lang_context (tree name
)
7209 vec_safe_push (current_lang_base
, current_lang_name
);
7211 if (name
== lang_name_cplusplus
)
7213 current_lang_name
= name
;
7215 else if (name
== lang_name_java
)
7217 current_lang_name
= name
;
7218 /* DECL_IGNORED_P is initially set for these types, to avoid clutter.
7219 (See record_builtin_java_type in decl.c.) However, that causes
7220 incorrect debug entries if these types are actually used.
7221 So we re-enable debug output after extern "Java". */
7222 DECL_IGNORED_P (TYPE_NAME (java_byte_type_node
)) = 0;
7223 DECL_IGNORED_P (TYPE_NAME (java_short_type_node
)) = 0;
7224 DECL_IGNORED_P (TYPE_NAME (java_int_type_node
)) = 0;
7225 DECL_IGNORED_P (TYPE_NAME (java_long_type_node
)) = 0;
7226 DECL_IGNORED_P (TYPE_NAME (java_float_type_node
)) = 0;
7227 DECL_IGNORED_P (TYPE_NAME (java_double_type_node
)) = 0;
7228 DECL_IGNORED_P (TYPE_NAME (java_char_type_node
)) = 0;
7229 DECL_IGNORED_P (TYPE_NAME (java_boolean_type_node
)) = 0;
7231 else if (name
== lang_name_c
)
7233 current_lang_name
= name
;
7236 error ("language string %<\"%E\"%> not recognized", name
);
7239 /* Get out of the current language scope. */
7242 pop_lang_context (void)
7244 current_lang_name
= current_lang_base
->pop ();
7247 /* Type instantiation routines. */
7249 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
7250 matches the TARGET_TYPE. If there is no satisfactory match, return
7251 error_mark_node, and issue an error & warning messages under
7252 control of FLAGS. Permit pointers to member function if FLAGS
7253 permits. If TEMPLATE_ONLY, the name of the overloaded function was
7254 a template-id, and EXPLICIT_TARGS are the explicitly provided
7257 If OVERLOAD is for one or more member functions, then ACCESS_PATH
7258 is the base path used to reference those member functions. If
7259 the address is resolved to a member function, access checks will be
7260 performed and errors issued if appropriate. */
7263 resolve_address_of_overloaded_function (tree target_type
,
7265 tsubst_flags_t flags
,
7267 tree explicit_targs
,
7270 /* Here's what the standard says:
7274 If the name is a function template, template argument deduction
7275 is done, and if the argument deduction succeeds, the deduced
7276 arguments are used to generate a single template function, which
7277 is added to the set of overloaded functions considered.
7279 Non-member functions and static member functions match targets of
7280 type "pointer-to-function" or "reference-to-function." Nonstatic
7281 member functions match targets of type "pointer-to-member
7282 function;" the function type of the pointer to member is used to
7283 select the member function from the set of overloaded member
7284 functions. If a nonstatic member function is selected, the
7285 reference to the overloaded function name is required to have the
7286 form of a pointer to member as described in 5.3.1.
7288 If more than one function is selected, any template functions in
7289 the set are eliminated if the set also contains a non-template
7290 function, and any given template function is eliminated if the
7291 set contains a second template function that is more specialized
7292 than the first according to the partial ordering rules 14.5.5.2.
7293 After such eliminations, if any, there shall remain exactly one
7294 selected function. */
7297 /* We store the matches in a TREE_LIST rooted here. The functions
7298 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
7299 interoperability with most_specialized_instantiation. */
7300 tree matches
= NULL_TREE
;
7302 tree target_fn_type
;
7304 /* By the time we get here, we should be seeing only real
7305 pointer-to-member types, not the internal POINTER_TYPE to
7306 METHOD_TYPE representation. */
7307 gcc_assert (!TYPE_PTR_P (target_type
)
7308 || TREE_CODE (TREE_TYPE (target_type
)) != METHOD_TYPE
);
7310 gcc_assert (is_overloaded_fn (overload
));
7312 /* Check that the TARGET_TYPE is reasonable. */
7313 if (TYPE_PTRFN_P (target_type
)
7314 || TYPE_REFFN_P (target_type
))
7316 else if (TYPE_PTRMEMFUNC_P (target_type
))
7317 /* This is OK, too. */
7319 else if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
7320 /* This is OK, too. This comes from a conversion to reference
7322 target_type
= build_reference_type (target_type
);
7325 if (flags
& tf_error
)
7326 error ("cannot resolve overloaded function %qD based on"
7327 " conversion to type %qT",
7328 DECL_NAME (OVL_FUNCTION (overload
)), target_type
);
7329 return error_mark_node
;
7332 /* Non-member functions and static member functions match targets of type
7333 "pointer-to-function" or "reference-to-function." Nonstatic member
7334 functions match targets of type "pointer-to-member-function;" the
7335 function type of the pointer to member is used to select the member
7336 function from the set of overloaded member functions.
7338 So figure out the FUNCTION_TYPE that we want to match against. */
7339 target_fn_type
= static_fn_type (target_type
);
7341 /* If we can find a non-template function that matches, we can just
7342 use it. There's no point in generating template instantiations
7343 if we're just going to throw them out anyhow. But, of course, we
7344 can only do this when we don't *need* a template function. */
7349 for (fns
= overload
; fns
; fns
= OVL_NEXT (fns
))
7351 tree fn
= OVL_CURRENT (fns
);
7353 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
7354 /* We're not looking for templates just yet. */
7357 if ((TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7359 /* We're looking for a non-static member, and this isn't
7360 one, or vice versa. */
7363 /* Ignore functions which haven't been explicitly
7365 if (DECL_ANTICIPATED (fn
))
7368 /* See if there's a match. */
7369 if (same_type_p (target_fn_type
, static_fn_type (fn
)))
7370 matches
= tree_cons (fn
, NULL_TREE
, matches
);
7374 /* Now, if we've already got a match (or matches), there's no need
7375 to proceed to the template functions. But, if we don't have a
7376 match we need to look at them, too. */
7379 tree target_arg_types
;
7380 tree target_ret_type
;
7383 unsigned int nargs
, ia
;
7386 target_arg_types
= TYPE_ARG_TYPES (target_fn_type
);
7387 target_ret_type
= TREE_TYPE (target_fn_type
);
7389 nargs
= list_length (target_arg_types
);
7390 args
= XALLOCAVEC (tree
, nargs
);
7391 for (arg
= target_arg_types
, ia
= 0;
7392 arg
!= NULL_TREE
&& arg
!= void_list_node
;
7393 arg
= TREE_CHAIN (arg
), ++ia
)
7394 args
[ia
] = TREE_VALUE (arg
);
7397 for (fns
= overload
; fns
; fns
= OVL_NEXT (fns
))
7399 tree fn
= OVL_CURRENT (fns
);
7403 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7404 /* We're only looking for templates. */
7407 if ((TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7409 /* We're not looking for a non-static member, and this is
7410 one, or vice versa. */
7413 tree ret
= target_ret_type
;
7415 /* If the template has a deduced return type, don't expose it to
7416 template argument deduction. */
7417 if (undeduced_auto_decl (fn
))
7420 /* Try to do argument deduction. */
7421 targs
= make_tree_vec (DECL_NTPARMS (fn
));
7422 instantiation
= fn_type_unification (fn
, explicit_targs
, targs
, args
,
7424 DEDUCE_EXACT
, LOOKUP_NORMAL
,
7426 if (instantiation
== error_mark_node
)
7427 /* Instantiation failed. */
7430 /* And now force instantiation to do return type deduction. */
7431 if (undeduced_auto_decl (instantiation
))
7434 instantiate_decl (instantiation
, /*defer*/false, /*class*/false);
7437 require_deduced_type (instantiation
);
7440 /* See if there's a match. */
7441 if (same_type_p (target_fn_type
, static_fn_type (instantiation
)))
7442 matches
= tree_cons (instantiation
, fn
, matches
);
7445 /* Now, remove all but the most specialized of the matches. */
7448 tree match
= most_specialized_instantiation (matches
);
7450 if (match
!= error_mark_node
)
7451 matches
= tree_cons (TREE_PURPOSE (match
),
7457 /* Now we should have exactly one function in MATCHES. */
7458 if (matches
== NULL_TREE
)
7460 /* There were *no* matches. */
7461 if (flags
& tf_error
)
7463 error ("no matches converting function %qD to type %q#T",
7464 DECL_NAME (OVL_CURRENT (overload
)),
7467 print_candidates (overload
);
7469 return error_mark_node
;
7471 else if (TREE_CHAIN (matches
))
7473 /* There were too many matches. First check if they're all
7474 the same function. */
7475 tree match
= NULL_TREE
;
7477 fn
= TREE_PURPOSE (matches
);
7479 /* For multi-versioned functions, more than one match is just fine and
7480 decls_match will return false as they are different. */
7481 for (match
= TREE_CHAIN (matches
); match
; match
= TREE_CHAIN (match
))
7482 if (!decls_match (fn
, TREE_PURPOSE (match
))
7483 && !targetm
.target_option
.function_versions
7484 (fn
, TREE_PURPOSE (match
)))
7489 if (flags
& tf_error
)
7491 error ("converting overloaded function %qD to type %q#T is ambiguous",
7492 DECL_NAME (OVL_FUNCTION (overload
)),
7495 /* Since print_candidates expects the functions in the
7496 TREE_VALUE slot, we flip them here. */
7497 for (match
= matches
; match
; match
= TREE_CHAIN (match
))
7498 TREE_VALUE (match
) = TREE_PURPOSE (match
);
7500 print_candidates (matches
);
7503 return error_mark_node
;
7507 /* Good, exactly one match. Now, convert it to the correct type. */
7508 fn
= TREE_PURPOSE (matches
);
7510 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
7511 && !(flags
& tf_ptrmem_ok
) && !flag_ms_extensions
)
7513 static int explained
;
7515 if (!(flags
& tf_error
))
7516 return error_mark_node
;
7518 permerror (input_location
, "assuming pointer to member %qD", fn
);
7521 inform (input_location
, "(a pointer to member can only be formed with %<&%E%>)", fn
);
7526 /* If a pointer to a function that is multi-versioned is requested, the
7527 pointer to the dispatcher function is returned instead. This works
7528 well because indirectly calling the function will dispatch the right
7529 function version at run-time. */
7530 if (DECL_FUNCTION_VERSIONED (fn
))
7532 fn
= get_function_version_dispatcher (fn
);
7534 return error_mark_node
;
7535 /* Mark all the versions corresponding to the dispatcher as used. */
7536 if (!(flags
& tf_conv
))
7537 mark_versions_used (fn
);
7540 /* If we're doing overload resolution purely for the purpose of
7541 determining conversion sequences, we should not consider the
7542 function used. If this conversion sequence is selected, the
7543 function will be marked as used at this point. */
7544 if (!(flags
& tf_conv
))
7546 /* Make =delete work with SFINAE. */
7547 if (DECL_DELETED_FN (fn
) && !(flags
& tf_error
))
7548 return error_mark_node
;
7553 /* We could not check access to member functions when this
7554 expression was originally created since we did not know at that
7555 time to which function the expression referred. */
7556 if (DECL_FUNCTION_MEMBER_P (fn
))
7558 gcc_assert (access_path
);
7559 perform_or_defer_access_check (access_path
, fn
, fn
, flags
);
7562 if (TYPE_PTRFN_P (target_type
) || TYPE_PTRMEMFUNC_P (target_type
))
7563 return cp_build_addr_expr (fn
, flags
);
7566 /* The target must be a REFERENCE_TYPE. Above, cp_build_unary_op
7567 will mark the function as addressed, but here we must do it
7569 cxx_mark_addressable (fn
);
7575 /* This function will instantiate the type of the expression given in
7576 RHS to match the type of LHSTYPE. If errors exist, then return
7577 error_mark_node. FLAGS is a bit mask. If TF_ERROR is set, then
7578 we complain on errors. If we are not complaining, never modify rhs,
7579 as overload resolution wants to try many possible instantiations, in
7580 the hope that at least one will work.
7582 For non-recursive calls, LHSTYPE should be a function, pointer to
7583 function, or a pointer to member function. */
7586 instantiate_type (tree lhstype
, tree rhs
, tsubst_flags_t flags
)
7588 tsubst_flags_t flags_in
= flags
;
7589 tree access_path
= NULL_TREE
;
7591 flags
&= ~tf_ptrmem_ok
;
7593 if (lhstype
== unknown_type_node
)
7595 if (flags
& tf_error
)
7596 error ("not enough type information");
7597 return error_mark_node
;
7600 if (TREE_TYPE (rhs
) != NULL_TREE
&& ! (type_unknown_p (rhs
)))
7602 tree fntype
= non_reference (lhstype
);
7603 if (same_type_p (fntype
, TREE_TYPE (rhs
)))
7605 if (flag_ms_extensions
7606 && TYPE_PTRMEMFUNC_P (fntype
)
7607 && !TYPE_PTRMEMFUNC_P (TREE_TYPE (rhs
)))
7608 /* Microsoft allows `A::f' to be resolved to a
7609 pointer-to-member. */
7613 if (flags
& tf_error
)
7614 error ("cannot convert %qE from type %qT to type %qT",
7615 rhs
, TREE_TYPE (rhs
), fntype
);
7616 return error_mark_node
;
7620 if (BASELINK_P (rhs
))
7622 access_path
= BASELINK_ACCESS_BINFO (rhs
);
7623 rhs
= BASELINK_FUNCTIONS (rhs
);
7626 /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot
7627 deduce any type information. */
7628 if (TREE_CODE (rhs
) == NON_DEPENDENT_EXPR
)
7630 if (flags
& tf_error
)
7631 error ("not enough type information");
7632 return error_mark_node
;
7635 /* There only a few kinds of expressions that may have a type
7636 dependent on overload resolution. */
7637 gcc_assert (TREE_CODE (rhs
) == ADDR_EXPR
7638 || TREE_CODE (rhs
) == COMPONENT_REF
7639 || is_overloaded_fn (rhs
)
7640 || (flag_ms_extensions
&& TREE_CODE (rhs
) == FUNCTION_DECL
));
7642 /* This should really only be used when attempting to distinguish
7643 what sort of a pointer to function we have. For now, any
7644 arithmetic operation which is not supported on pointers
7645 is rejected as an error. */
7647 switch (TREE_CODE (rhs
))
7651 tree member
= TREE_OPERAND (rhs
, 1);
7653 member
= instantiate_type (lhstype
, member
, flags
);
7654 if (member
!= error_mark_node
7655 && TREE_SIDE_EFFECTS (TREE_OPERAND (rhs
, 0)))
7656 /* Do not lose object's side effects. */
7657 return build2 (COMPOUND_EXPR
, TREE_TYPE (member
),
7658 TREE_OPERAND (rhs
, 0), member
);
7663 rhs
= TREE_OPERAND (rhs
, 1);
7664 if (BASELINK_P (rhs
))
7665 return instantiate_type (lhstype
, rhs
, flags_in
);
7667 /* This can happen if we are forming a pointer-to-member for a
7669 gcc_assert (TREE_CODE (rhs
) == TEMPLATE_ID_EXPR
);
7673 case TEMPLATE_ID_EXPR
:
7675 tree fns
= TREE_OPERAND (rhs
, 0);
7676 tree args
= TREE_OPERAND (rhs
, 1);
7679 resolve_address_of_overloaded_function (lhstype
, fns
, flags_in
,
7680 /*template_only=*/true,
7687 resolve_address_of_overloaded_function (lhstype
, rhs
, flags_in
,
7688 /*template_only=*/false,
7689 /*explicit_targs=*/NULL_TREE
,
7694 if (PTRMEM_OK_P (rhs
))
7695 flags
|= tf_ptrmem_ok
;
7697 return instantiate_type (lhstype
, TREE_OPERAND (rhs
, 0), flags
);
7701 return error_mark_node
;
7706 return error_mark_node
;
7709 /* Return the name of the virtual function pointer field
7710 (as an IDENTIFIER_NODE) for the given TYPE. Note that
7711 this may have to look back through base types to find the
7712 ultimate field name. (For single inheritance, these could
7713 all be the same name. Who knows for multiple inheritance). */
7716 get_vfield_name (tree type
)
7718 tree binfo
, base_binfo
;
7721 for (binfo
= TYPE_BINFO (type
);
7722 BINFO_N_BASE_BINFOS (binfo
);
7725 base_binfo
= BINFO_BASE_BINFO (binfo
, 0);
7727 if (BINFO_VIRTUAL_P (base_binfo
)
7728 || !TYPE_CONTAINS_VPTR_P (BINFO_TYPE (base_binfo
)))
7732 type
= BINFO_TYPE (binfo
);
7733 buf
= (char *) alloca (sizeof (VFIELD_NAME_FORMAT
)
7734 + TYPE_NAME_LENGTH (type
) + 2);
7735 sprintf (buf
, VFIELD_NAME_FORMAT
,
7736 IDENTIFIER_POINTER (constructor_name (type
)));
7737 return get_identifier (buf
);
7741 print_class_statistics (void)
7743 if (! GATHER_STATISTICS
)
7746 fprintf (stderr
, "convert_harshness = %d\n", n_convert_harshness
);
7747 fprintf (stderr
, "compute_conversion_costs = %d\n", n_compute_conversion_costs
);
7750 fprintf (stderr
, "vtables = %d; vtable searches = %d\n",
7751 n_vtables
, n_vtable_searches
);
7752 fprintf (stderr
, "vtable entries = %d; vtable elems = %d\n",
7753 n_vtable_entries
, n_vtable_elems
);
7757 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
7758 according to [class]:
7759 The class-name is also inserted
7760 into the scope of the class itself. For purposes of access checking,
7761 the inserted class name is treated as if it were a public member name. */
7764 build_self_reference (void)
7766 tree name
= constructor_name (current_class_type
);
7767 tree value
= build_lang_decl (TYPE_DECL
, name
, current_class_type
);
7770 DECL_NONLOCAL (value
) = 1;
7771 DECL_CONTEXT (value
) = current_class_type
;
7772 DECL_ARTIFICIAL (value
) = 1;
7773 SET_DECL_SELF_REFERENCE_P (value
);
7774 set_underlying_type (value
);
7776 if (processing_template_decl
)
7777 value
= push_template_decl (value
);
7779 saved_cas
= current_access_specifier
;
7780 current_access_specifier
= access_public_node
;
7781 finish_member_declaration (value
);
7782 current_access_specifier
= saved_cas
;
7785 /* Returns 1 if TYPE contains only padding bytes. */
7788 is_empty_class (tree type
)
7790 if (type
== error_mark_node
)
7793 if (! CLASS_TYPE_P (type
))
7796 return CLASSTYPE_EMPTY_P (type
);
7799 /* Returns true if TYPE contains an empty class. */
7802 contains_empty_class_p (tree type
)
7804 if (is_empty_class (type
))
7806 if (CLASS_TYPE_P (type
))
7813 for (binfo
= TYPE_BINFO (type
), i
= 0;
7814 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
7815 if (contains_empty_class_p (BINFO_TYPE (base_binfo
)))
7817 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
7818 if (TREE_CODE (field
) == FIELD_DECL
7819 && !DECL_ARTIFICIAL (field
)
7820 && is_empty_class (TREE_TYPE (field
)))
7823 else if (TREE_CODE (type
) == ARRAY_TYPE
)
7824 return contains_empty_class_p (TREE_TYPE (type
));
7828 /* Returns true if TYPE contains no actual data, just various
7829 possible combinations of empty classes and possibly a vptr. */
7832 is_really_empty_class (tree type
)
7834 if (CLASS_TYPE_P (type
))
7841 /* CLASSTYPE_EMPTY_P isn't set properly until the class is actually laid
7842 out, but we'd like to be able to check this before then. */
7843 if (COMPLETE_TYPE_P (type
) && is_empty_class (type
))
7846 for (binfo
= TYPE_BINFO (type
), i
= 0;
7847 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
7848 if (!is_really_empty_class (BINFO_TYPE (base_binfo
)))
7850 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
7851 if (TREE_CODE (field
) == FIELD_DECL
7852 && !DECL_ARTIFICIAL (field
)
7853 && !is_really_empty_class (TREE_TYPE (field
)))
7857 else if (TREE_CODE (type
) == ARRAY_TYPE
)
7858 return is_really_empty_class (TREE_TYPE (type
));
7862 /* Note that NAME was looked up while the current class was being
7863 defined and that the result of that lookup was DECL. */
7866 maybe_note_name_used_in_class (tree name
, tree decl
)
7868 splay_tree names_used
;
7870 /* If we're not defining a class, there's nothing to do. */
7871 if (!(innermost_scope_kind() == sk_class
7872 && TYPE_BEING_DEFINED (current_class_type
)
7873 && !LAMBDA_TYPE_P (current_class_type
)))
7876 /* If there's already a binding for this NAME, then we don't have
7877 anything to worry about. */
7878 if (lookup_member (current_class_type
, name
,
7879 /*protect=*/0, /*want_type=*/false, tf_warning_or_error
))
7882 if (!current_class_stack
[current_class_depth
- 1].names_used
)
7883 current_class_stack
[current_class_depth
- 1].names_used
7884 = splay_tree_new (splay_tree_compare_pointers
, 0, 0);
7885 names_used
= current_class_stack
[current_class_depth
- 1].names_used
;
7887 splay_tree_insert (names_used
,
7888 (splay_tree_key
) name
,
7889 (splay_tree_value
) decl
);
7892 /* Note that NAME was declared (as DECL) in the current class. Check
7893 to see that the declaration is valid. */
7896 note_name_declared_in_class (tree name
, tree decl
)
7898 splay_tree names_used
;
7901 /* Look to see if we ever used this name. */
7903 = current_class_stack
[current_class_depth
- 1].names_used
;
7906 /* The C language allows members to be declared with a type of the same
7907 name, and the C++ standard says this diagnostic is not required. So
7908 allow it in extern "C" blocks unless predantic is specified.
7909 Allow it in all cases if -ms-extensions is specified. */
7910 if ((!pedantic
&& current_lang_name
== lang_name_c
)
7911 || flag_ms_extensions
)
7913 n
= splay_tree_lookup (names_used
, (splay_tree_key
) name
);
7916 /* [basic.scope.class]
7918 A name N used in a class S shall refer to the same declaration
7919 in its context and when re-evaluated in the completed scope of
7921 permerror (input_location
, "declaration of %q#D", decl
);
7922 permerror (input_location
, "changes meaning of %qD from %q+#D",
7923 DECL_NAME (OVL_CURRENT (decl
)), (tree
) n
->value
);
7927 /* Returns the VAR_DECL for the complete vtable associated with BINFO.
7928 Secondary vtables are merged with primary vtables; this function
7929 will return the VAR_DECL for the primary vtable. */
7932 get_vtbl_decl_for_binfo (tree binfo
)
7936 decl
= BINFO_VTABLE (binfo
);
7937 if (decl
&& TREE_CODE (decl
) == POINTER_PLUS_EXPR
)
7939 gcc_assert (TREE_CODE (TREE_OPERAND (decl
, 0)) == ADDR_EXPR
);
7940 decl
= TREE_OPERAND (TREE_OPERAND (decl
, 0), 0);
7943 gcc_assert (VAR_P (decl
));
7948 /* Returns the binfo for the primary base of BINFO. If the resulting
7949 BINFO is a virtual base, and it is inherited elsewhere in the
7950 hierarchy, then the returned binfo might not be the primary base of
7951 BINFO in the complete object. Check BINFO_PRIMARY_P or
7952 BINFO_LOST_PRIMARY_P to be sure. */
7955 get_primary_binfo (tree binfo
)
7959 primary_base
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (binfo
));
7963 return copied_binfo (primary_base
, binfo
);
7966 /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */
7969 maybe_indent_hierarchy (FILE * stream
, int indent
, int indented_p
)
7972 fprintf (stream
, "%*s", indent
, "");
7976 /* Dump the offsets of all the bases rooted at BINFO to STREAM.
7977 INDENT should be zero when called from the top level; it is
7978 incremented recursively. IGO indicates the next expected BINFO in
7979 inheritance graph ordering. */
7982 dump_class_hierarchy_r (FILE *stream
,
7992 indented
= maybe_indent_hierarchy (stream
, indent
, 0);
7993 fprintf (stream
, "%s (0x" HOST_WIDE_INT_PRINT_HEX
") ",
7994 type_as_string (BINFO_TYPE (binfo
), TFF_PLAIN_IDENTIFIER
),
7995 (HOST_WIDE_INT
) (uintptr_t) binfo
);
7998 fprintf (stream
, "alternative-path\n");
8001 igo
= TREE_CHAIN (binfo
);
8003 fprintf (stream
, HOST_WIDE_INT_PRINT_DEC
,
8004 tree_to_shwi (BINFO_OFFSET (binfo
)));
8005 if (is_empty_class (BINFO_TYPE (binfo
)))
8006 fprintf (stream
, " empty");
8007 else if (CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (binfo
)))
8008 fprintf (stream
, " nearly-empty");
8009 if (BINFO_VIRTUAL_P (binfo
))
8010 fprintf (stream
, " virtual");
8011 fprintf (stream
, "\n");
8014 if (BINFO_PRIMARY_P (binfo
))
8016 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8017 fprintf (stream
, " primary-for %s (0x" HOST_WIDE_INT_PRINT_HEX
")",
8018 type_as_string (BINFO_TYPE (BINFO_INHERITANCE_CHAIN (binfo
)),
8019 TFF_PLAIN_IDENTIFIER
),
8020 (HOST_WIDE_INT
) (uintptr_t) BINFO_INHERITANCE_CHAIN (binfo
));
8022 if (BINFO_LOST_PRIMARY_P (binfo
))
8024 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8025 fprintf (stream
, " lost-primary");
8028 fprintf (stream
, "\n");
8030 if (!(flags
& TDF_SLIM
))
8034 if (BINFO_SUBVTT_INDEX (binfo
))
8036 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8037 fprintf (stream
, " subvttidx=%s",
8038 expr_as_string (BINFO_SUBVTT_INDEX (binfo
),
8039 TFF_PLAIN_IDENTIFIER
));
8041 if (BINFO_VPTR_INDEX (binfo
))
8043 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8044 fprintf (stream
, " vptridx=%s",
8045 expr_as_string (BINFO_VPTR_INDEX (binfo
),
8046 TFF_PLAIN_IDENTIFIER
));
8048 if (BINFO_VPTR_FIELD (binfo
))
8050 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8051 fprintf (stream
, " vbaseoffset=%s",
8052 expr_as_string (BINFO_VPTR_FIELD (binfo
),
8053 TFF_PLAIN_IDENTIFIER
));
8055 if (BINFO_VTABLE (binfo
))
8057 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8058 fprintf (stream
, " vptr=%s",
8059 expr_as_string (BINFO_VTABLE (binfo
),
8060 TFF_PLAIN_IDENTIFIER
));
8064 fprintf (stream
, "\n");
8067 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
8068 igo
= dump_class_hierarchy_r (stream
, flags
, base_binfo
, igo
, indent
+ 2);
8073 /* Dump the BINFO hierarchy for T. */
8076 dump_class_hierarchy_1 (FILE *stream
, int flags
, tree t
)
8078 fprintf (stream
, "Class %s\n", type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8079 fprintf (stream
, " size=%lu align=%lu\n",
8080 (unsigned long)(tree_to_shwi (TYPE_SIZE (t
)) / BITS_PER_UNIT
),
8081 (unsigned long)(TYPE_ALIGN (t
) / BITS_PER_UNIT
));
8082 fprintf (stream
, " base size=%lu base align=%lu\n",
8083 (unsigned long)(tree_to_shwi (TYPE_SIZE (CLASSTYPE_AS_BASE (t
)))
8085 (unsigned long)(TYPE_ALIGN (CLASSTYPE_AS_BASE (t
))
8087 dump_class_hierarchy_r (stream
, flags
, TYPE_BINFO (t
), TYPE_BINFO (t
), 0);
8088 fprintf (stream
, "\n");
8091 /* Debug interface to hierarchy dumping. */
8094 debug_class (tree t
)
8096 dump_class_hierarchy_1 (stderr
, TDF_SLIM
, t
);
8100 dump_class_hierarchy (tree t
)
8103 FILE *stream
= get_dump_info (TDI_class
, &flags
);
8107 dump_class_hierarchy_1 (stream
, flags
, t
);
8112 dump_array (FILE * stream
, tree decl
)
8115 unsigned HOST_WIDE_INT ix
;
8117 tree size
= TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (decl
)));
8119 elt
= (tree_to_shwi (TYPE_SIZE (TREE_TYPE (TREE_TYPE (decl
))))
8121 fprintf (stream
, "%s:", decl_as_string (decl
, TFF_PLAIN_IDENTIFIER
));
8122 fprintf (stream
, " %s entries",
8123 expr_as_string (size_binop (PLUS_EXPR
, size
, size_one_node
),
8124 TFF_PLAIN_IDENTIFIER
));
8125 fprintf (stream
, "\n");
8127 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (DECL_INITIAL (decl
)),
8129 fprintf (stream
, "%-4ld %s\n", (long)(ix
* elt
),
8130 expr_as_string (value
, TFF_PLAIN_IDENTIFIER
));
8134 dump_vtable (tree t
, tree binfo
, tree vtable
)
8137 FILE *stream
= get_dump_info (TDI_class
, &flags
);
8142 if (!(flags
& TDF_SLIM
))
8144 int ctor_vtbl_p
= TYPE_BINFO (t
) != binfo
;
8146 fprintf (stream
, "%s for %s",
8147 ctor_vtbl_p
? "Construction vtable" : "Vtable",
8148 type_as_string (BINFO_TYPE (binfo
), TFF_PLAIN_IDENTIFIER
));
8151 if (!BINFO_VIRTUAL_P (binfo
))
8152 fprintf (stream
, " (0x" HOST_WIDE_INT_PRINT_HEX
" instance)",
8153 (HOST_WIDE_INT
) (uintptr_t) binfo
);
8154 fprintf (stream
, " in %s", type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8156 fprintf (stream
, "\n");
8157 dump_array (stream
, vtable
);
8158 fprintf (stream
, "\n");
8163 dump_vtt (tree t
, tree vtt
)
8166 FILE *stream
= get_dump_info (TDI_class
, &flags
);
8171 if (!(flags
& TDF_SLIM
))
8173 fprintf (stream
, "VTT for %s\n",
8174 type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8175 dump_array (stream
, vtt
);
8176 fprintf (stream
, "\n");
8180 /* Dump a function or thunk and its thunkees. */
8183 dump_thunk (FILE *stream
, int indent
, tree thunk
)
8185 static const char spaces
[] = " ";
8186 tree name
= DECL_NAME (thunk
);
8189 fprintf (stream
, "%.*s%p %s %s", indent
, spaces
,
8191 !DECL_THUNK_P (thunk
) ? "function"
8192 : DECL_THIS_THUNK_P (thunk
) ? "this-thunk" : "covariant-thunk",
8193 name
? IDENTIFIER_POINTER (name
) : "<unset>");
8194 if (DECL_THUNK_P (thunk
))
8196 HOST_WIDE_INT fixed_adjust
= THUNK_FIXED_OFFSET (thunk
);
8197 tree virtual_adjust
= THUNK_VIRTUAL_OFFSET (thunk
);
8199 fprintf (stream
, " fixed=" HOST_WIDE_INT_PRINT_DEC
, fixed_adjust
);
8200 if (!virtual_adjust
)
8202 else if (DECL_THIS_THUNK_P (thunk
))
8203 fprintf (stream
, " vcall=" HOST_WIDE_INT_PRINT_DEC
,
8204 tree_to_shwi (virtual_adjust
));
8206 fprintf (stream
, " vbase=" HOST_WIDE_INT_PRINT_DEC
"(%s)",
8207 tree_to_shwi (BINFO_VPTR_FIELD (virtual_adjust
)),
8208 type_as_string (BINFO_TYPE (virtual_adjust
), TFF_SCOPE
));
8209 if (THUNK_ALIAS (thunk
))
8210 fprintf (stream
, " alias to %p", (void *)THUNK_ALIAS (thunk
));
8212 fprintf (stream
, "\n");
8213 for (thunks
= DECL_THUNKS (thunk
); thunks
; thunks
= TREE_CHAIN (thunks
))
8214 dump_thunk (stream
, indent
+ 2, thunks
);
8217 /* Dump the thunks for FN. */
8220 debug_thunks (tree fn
)
8222 dump_thunk (stderr
, 0, fn
);
8225 /* Virtual function table initialization. */
8227 /* Create all the necessary vtables for T and its base classes. */
8230 finish_vtbls (tree t
)
8233 vec
<constructor_elt
, va_gc
> *v
= NULL
;
8234 tree vtable
= BINFO_VTABLE (TYPE_BINFO (t
));
8236 /* We lay out the primary and secondary vtables in one contiguous
8237 vtable. The primary vtable is first, followed by the non-virtual
8238 secondary vtables in inheritance graph order. */
8239 accumulate_vtbl_inits (TYPE_BINFO (t
), TYPE_BINFO (t
), TYPE_BINFO (t
),
8242 /* Then come the virtual bases, also in inheritance graph order. */
8243 for (vbase
= TYPE_BINFO (t
); vbase
; vbase
= TREE_CHAIN (vbase
))
8245 if (!BINFO_VIRTUAL_P (vbase
))
8247 accumulate_vtbl_inits (vbase
, vbase
, TYPE_BINFO (t
), vtable
, t
, &v
);
8250 if (BINFO_VTABLE (TYPE_BINFO (t
)))
8251 initialize_vtable (TYPE_BINFO (t
), v
);
8254 /* Initialize the vtable for BINFO with the INITS. */
8257 initialize_vtable (tree binfo
, vec
<constructor_elt
, va_gc
> *inits
)
8261 layout_vtable_decl (binfo
, vec_safe_length (inits
));
8262 decl
= get_vtbl_decl_for_binfo (binfo
);
8263 initialize_artificial_var (decl
, inits
);
8264 dump_vtable (BINFO_TYPE (binfo
), binfo
, decl
);
8267 /* Build the VTT (virtual table table) for T.
8268 A class requires a VTT if it has virtual bases.
8271 1 - primary virtual pointer for complete object T
8272 2 - secondary VTTs for each direct non-virtual base of T which requires a
8274 3 - secondary virtual pointers for each direct or indirect base of T which
8275 has virtual bases or is reachable via a virtual path from T.
8276 4 - secondary VTTs for each direct or indirect virtual base of T.
8278 Secondary VTTs look like complete object VTTs without part 4. */
8286 vec
<constructor_elt
, va_gc
> *inits
;
8288 /* Build up the initializers for the VTT. */
8290 index
= size_zero_node
;
8291 build_vtt_inits (TYPE_BINFO (t
), t
, &inits
, &index
);
8293 /* If we didn't need a VTT, we're done. */
8297 /* Figure out the type of the VTT. */
8298 type
= build_array_of_n_type (const_ptr_type_node
,
8301 /* Now, build the VTT object itself. */
8302 vtt
= build_vtable (t
, mangle_vtt_for_type (t
), type
);
8303 initialize_artificial_var (vtt
, inits
);
8304 /* Add the VTT to the vtables list. */
8305 DECL_CHAIN (vtt
) = DECL_CHAIN (CLASSTYPE_VTABLES (t
));
8306 DECL_CHAIN (CLASSTYPE_VTABLES (t
)) = vtt
;
8311 /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with
8312 PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo,
8313 and CHAIN the vtable pointer for this binfo after construction is
8314 complete. VALUE can also be another BINFO, in which case we recurse. */
8317 binfo_ctor_vtable (tree binfo
)
8323 vt
= BINFO_VTABLE (binfo
);
8324 if (TREE_CODE (vt
) == TREE_LIST
)
8325 vt
= TREE_VALUE (vt
);
8326 if (TREE_CODE (vt
) == TREE_BINFO
)
8335 /* Data for secondary VTT initialization. */
8336 typedef struct secondary_vptr_vtt_init_data_s
8338 /* Is this the primary VTT? */
8341 /* Current index into the VTT. */
8344 /* Vector of initializers built up. */
8345 vec
<constructor_elt
, va_gc
> *inits
;
8347 /* The type being constructed by this secondary VTT. */
8348 tree type_being_constructed
;
8349 } secondary_vptr_vtt_init_data
;
8351 /* Recursively build the VTT-initializer for BINFO (which is in the
8352 hierarchy dominated by T). INITS points to the end of the initializer
8353 list to date. INDEX is the VTT index where the next element will be
8354 replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e.
8355 not a subvtt for some base of T). When that is so, we emit the sub-VTTs
8356 for virtual bases of T. When it is not so, we build the constructor
8357 vtables for the BINFO-in-T variant. */
8360 build_vtt_inits (tree binfo
, tree t
, vec
<constructor_elt
, va_gc
> **inits
,
8366 secondary_vptr_vtt_init_data data
;
8367 int top_level_p
= SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
);
8369 /* We only need VTTs for subobjects with virtual bases. */
8370 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
)))
8373 /* We need to use a construction vtable if this is not the primary
8377 build_ctor_vtbl_group (binfo
, t
);
8379 /* Record the offset in the VTT where this sub-VTT can be found. */
8380 BINFO_SUBVTT_INDEX (binfo
) = *index
;
8383 /* Add the address of the primary vtable for the complete object. */
8384 init
= binfo_ctor_vtable (binfo
);
8385 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
8388 gcc_assert (!BINFO_VPTR_INDEX (binfo
));
8389 BINFO_VPTR_INDEX (binfo
) = *index
;
8391 *index
= size_binop (PLUS_EXPR
, *index
, TYPE_SIZE_UNIT (ptr_type_node
));
8393 /* Recursively add the secondary VTTs for non-virtual bases. */
8394 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, b
); ++i
)
8395 if (!BINFO_VIRTUAL_P (b
))
8396 build_vtt_inits (b
, t
, inits
, index
);
8398 /* Add secondary virtual pointers for all subobjects of BINFO with
8399 either virtual bases or reachable along a virtual path, except
8400 subobjects that are non-virtual primary bases. */
8401 data
.top_level_p
= top_level_p
;
8402 data
.index
= *index
;
8403 data
.inits
= *inits
;
8404 data
.type_being_constructed
= BINFO_TYPE (binfo
);
8406 dfs_walk_once (binfo
, dfs_build_secondary_vptr_vtt_inits
, NULL
, &data
);
8408 *index
= data
.index
;
8410 /* data.inits might have grown as we added secondary virtual pointers.
8411 Make sure our caller knows about the new vector. */
8412 *inits
= data
.inits
;
8415 /* Add the secondary VTTs for virtual bases in inheritance graph
8417 for (b
= TYPE_BINFO (BINFO_TYPE (binfo
)); b
; b
= TREE_CHAIN (b
))
8419 if (!BINFO_VIRTUAL_P (b
))
8422 build_vtt_inits (b
, t
, inits
, index
);
8425 /* Remove the ctor vtables we created. */
8426 dfs_walk_all (binfo
, dfs_fixup_binfo_vtbls
, NULL
, binfo
);
8429 /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base
8430 in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */
8433 dfs_build_secondary_vptr_vtt_inits (tree binfo
, void *data_
)
8435 secondary_vptr_vtt_init_data
*data
= (secondary_vptr_vtt_init_data
*)data_
;
8437 /* We don't care about bases that don't have vtables. */
8438 if (!TYPE_VFIELD (BINFO_TYPE (binfo
)))
8439 return dfs_skip_bases
;
8441 /* We're only interested in proper subobjects of the type being
8443 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), data
->type_being_constructed
))
8446 /* We're only interested in bases with virtual bases or reachable
8447 via a virtual path from the type being constructed. */
8448 if (!(CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
))
8449 || binfo_via_virtual (binfo
, data
->type_being_constructed
)))
8450 return dfs_skip_bases
;
8452 /* We're not interested in non-virtual primary bases. */
8453 if (!BINFO_VIRTUAL_P (binfo
) && BINFO_PRIMARY_P (binfo
))
8456 /* Record the index where this secondary vptr can be found. */
8457 if (data
->top_level_p
)
8459 gcc_assert (!BINFO_VPTR_INDEX (binfo
));
8460 BINFO_VPTR_INDEX (binfo
) = data
->index
;
8462 if (BINFO_VIRTUAL_P (binfo
))
8464 /* It's a primary virtual base, and this is not a
8465 construction vtable. Find the base this is primary of in
8466 the inheritance graph, and use that base's vtable
8468 while (BINFO_PRIMARY_P (binfo
))
8469 binfo
= BINFO_INHERITANCE_CHAIN (binfo
);
8473 /* Add the initializer for the secondary vptr itself. */
8474 CONSTRUCTOR_APPEND_ELT (data
->inits
, NULL_TREE
, binfo_ctor_vtable (binfo
));
8476 /* Advance the vtt index. */
8477 data
->index
= size_binop (PLUS_EXPR
, data
->index
,
8478 TYPE_SIZE_UNIT (ptr_type_node
));
8483 /* Called from build_vtt_inits via dfs_walk. After building
8484 constructor vtables and generating the sub-vtt from them, we need
8485 to restore the BINFO_VTABLES that were scribbled on. DATA is the
8486 binfo of the base whose sub vtt was generated. */
8489 dfs_fixup_binfo_vtbls (tree binfo
, void* data
)
8491 tree vtable
= BINFO_VTABLE (binfo
);
8493 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
8494 /* If this class has no vtable, none of its bases do. */
8495 return dfs_skip_bases
;
8498 /* This might be a primary base, so have no vtable in this
8502 /* If we scribbled the construction vtable vptr into BINFO, clear it
8504 if (TREE_CODE (vtable
) == TREE_LIST
8505 && (TREE_PURPOSE (vtable
) == (tree
) data
))
8506 BINFO_VTABLE (binfo
) = TREE_CHAIN (vtable
);
8511 /* Build the construction vtable group for BINFO which is in the
8512 hierarchy dominated by T. */
8515 build_ctor_vtbl_group (tree binfo
, tree t
)
8521 vec
<constructor_elt
, va_gc
> *v
;
8523 /* See if we've already created this construction vtable group. */
8524 id
= mangle_ctor_vtbl_for_type (t
, binfo
);
8525 if (IDENTIFIER_GLOBAL_VALUE (id
))
8528 gcc_assert (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
));
8529 /* Build a version of VTBL (with the wrong type) for use in
8530 constructing the addresses of secondary vtables in the
8531 construction vtable group. */
8532 vtbl
= build_vtable (t
, id
, ptr_type_node
);
8533 DECL_CONSTRUCTION_VTABLE_P (vtbl
) = 1;
8534 /* Don't export construction vtables from shared libraries. Even on
8535 targets that don't support hidden visibility, this tells
8536 can_refer_decl_in_current_unit_p not to assume that it's safe to
8537 access from a different compilation unit (bz 54314). */
8538 DECL_VISIBILITY (vtbl
) = VISIBILITY_HIDDEN
;
8539 DECL_VISIBILITY_SPECIFIED (vtbl
) = true;
8542 accumulate_vtbl_inits (binfo
, TYPE_BINFO (TREE_TYPE (binfo
)),
8543 binfo
, vtbl
, t
, &v
);
8545 /* Add the vtables for each of our virtual bases using the vbase in T
8547 for (vbase
= TYPE_BINFO (BINFO_TYPE (binfo
));
8549 vbase
= TREE_CHAIN (vbase
))
8553 if (!BINFO_VIRTUAL_P (vbase
))
8555 b
= copied_binfo (vbase
, binfo
);
8557 accumulate_vtbl_inits (b
, vbase
, binfo
, vtbl
, t
, &v
);
8560 /* Figure out the type of the construction vtable. */
8561 type
= build_array_of_n_type (vtable_entry_type
, v
->length ());
8563 TREE_TYPE (vtbl
) = type
;
8564 DECL_SIZE (vtbl
) = DECL_SIZE_UNIT (vtbl
) = NULL_TREE
;
8565 layout_decl (vtbl
, 0);
8567 /* Initialize the construction vtable. */
8568 CLASSTYPE_VTABLES (t
) = chainon (CLASSTYPE_VTABLES (t
), vtbl
);
8569 initialize_artificial_var (vtbl
, v
);
8570 dump_vtable (t
, binfo
, vtbl
);
8573 /* Add the vtbl initializers for BINFO (and its bases other than
8574 non-virtual primaries) to the list of INITS. BINFO is in the
8575 hierarchy dominated by T. RTTI_BINFO is the binfo within T of
8576 the constructor the vtbl inits should be accumulated for. (If this
8577 is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).)
8578 ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO).
8579 BINFO is the active base equivalent of ORIG_BINFO in the inheritance
8580 graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE,
8581 but are not necessarily the same in terms of layout. */
8584 accumulate_vtbl_inits (tree binfo
,
8589 vec
<constructor_elt
, va_gc
> **inits
)
8593 int ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8595 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), BINFO_TYPE (orig_binfo
)));
8597 /* If it doesn't have a vptr, we don't do anything. */
8598 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
8601 /* If we're building a construction vtable, we're not interested in
8602 subobjects that don't require construction vtables. */
8604 && !CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
))
8605 && !binfo_via_virtual (orig_binfo
, BINFO_TYPE (rtti_binfo
)))
8608 /* Build the initializers for the BINFO-in-T vtable. */
8609 dfs_accumulate_vtbl_inits (binfo
, orig_binfo
, rtti_binfo
, vtbl
, t
, inits
);
8611 /* Walk the BINFO and its bases. We walk in preorder so that as we
8612 initialize each vtable we can figure out at what offset the
8613 secondary vtable lies from the primary vtable. We can't use
8614 dfs_walk here because we need to iterate through bases of BINFO
8615 and RTTI_BINFO simultaneously. */
8616 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
8618 /* Skip virtual bases. */
8619 if (BINFO_VIRTUAL_P (base_binfo
))
8621 accumulate_vtbl_inits (base_binfo
,
8622 BINFO_BASE_BINFO (orig_binfo
, i
),
8623 rtti_binfo
, vtbl
, t
,
8628 /* Called from accumulate_vtbl_inits. Adds the initializers for the
8629 BINFO vtable to L. */
8632 dfs_accumulate_vtbl_inits (tree binfo
,
8637 vec
<constructor_elt
, va_gc
> **l
)
8639 tree vtbl
= NULL_TREE
;
8640 int ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8644 && BINFO_VIRTUAL_P (orig_binfo
) && BINFO_PRIMARY_P (orig_binfo
))
8646 /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a
8647 primary virtual base. If it is not the same primary in
8648 the hierarchy of T, we'll need to generate a ctor vtable
8649 for it, to place at its location in T. If it is the same
8650 primary, we still need a VTT entry for the vtable, but it
8651 should point to the ctor vtable for the base it is a
8652 primary for within the sub-hierarchy of RTTI_BINFO.
8654 There are three possible cases:
8656 1) We are in the same place.
8657 2) We are a primary base within a lost primary virtual base of
8659 3) We are primary to something not a base of RTTI_BINFO. */
8662 tree last
= NULL_TREE
;
8664 /* First, look through the bases we are primary to for RTTI_BINFO
8665 or a virtual base. */
8667 while (BINFO_PRIMARY_P (b
))
8669 b
= BINFO_INHERITANCE_CHAIN (b
);
8671 if (BINFO_VIRTUAL_P (b
) || b
== rtti_binfo
)
8674 /* If we run out of primary links, keep looking down our
8675 inheritance chain; we might be an indirect primary. */
8676 for (b
= last
; b
; b
= BINFO_INHERITANCE_CHAIN (b
))
8677 if (BINFO_VIRTUAL_P (b
) || b
== rtti_binfo
)
8681 /* If we found RTTI_BINFO, this is case 1. If we found a virtual
8682 base B and it is a base of RTTI_BINFO, this is case 2. In
8683 either case, we share our vtable with LAST, i.e. the
8684 derived-most base within B of which we are a primary. */
8686 || (b
&& binfo_for_vbase (BINFO_TYPE (b
), BINFO_TYPE (rtti_binfo
))))
8687 /* Just set our BINFO_VTABLE to point to LAST, as we may not have
8688 set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in
8689 binfo_ctor_vtable after everything's been set up. */
8692 /* Otherwise, this is case 3 and we get our own. */
8694 else if (!BINFO_NEW_VTABLE_MARKED (orig_binfo
))
8697 n_inits
= vec_safe_length (*l
);
8704 /* Add the initializer for this vtable. */
8705 build_vtbl_initializer (binfo
, orig_binfo
, t
, rtti_binfo
,
8706 &non_fn_entries
, l
);
8708 /* Figure out the position to which the VPTR should point. */
8709 vtbl
= build1 (ADDR_EXPR
, vtbl_ptr_type_node
, orig_vtbl
);
8710 index
= size_binop (MULT_EXPR
,
8711 TYPE_SIZE_UNIT (vtable_entry_type
),
8712 size_int (non_fn_entries
+ n_inits
));
8713 vtbl
= fold_build_pointer_plus (vtbl
, index
);
8717 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
8718 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
8719 straighten this out. */
8720 BINFO_VTABLE (binfo
) = tree_cons (rtti_binfo
, vtbl
, BINFO_VTABLE (binfo
));
8721 else if (BINFO_PRIMARY_P (binfo
) && BINFO_VIRTUAL_P (binfo
))
8722 /* Throw away any unneeded intializers. */
8723 (*l
)->truncate (n_inits
);
8725 /* For an ordinary vtable, set BINFO_VTABLE. */
8726 BINFO_VTABLE (binfo
) = vtbl
;
8729 static GTY(()) tree abort_fndecl_addr
;
8731 /* Construct the initializer for BINFO's virtual function table. BINFO
8732 is part of the hierarchy dominated by T. If we're building a
8733 construction vtable, the ORIG_BINFO is the binfo we should use to
8734 find the actual function pointers to put in the vtable - but they
8735 can be overridden on the path to most-derived in the graph that
8736 ORIG_BINFO belongs. Otherwise,
8737 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
8738 BINFO that should be indicated by the RTTI information in the
8739 vtable; it will be a base class of T, rather than T itself, if we
8740 are building a construction vtable.
8742 The value returned is a TREE_LIST suitable for wrapping in a
8743 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
8744 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
8745 number of non-function entries in the vtable.
8747 It might seem that this function should never be called with a
8748 BINFO for which BINFO_PRIMARY_P holds, the vtable for such a
8749 base is always subsumed by a derived class vtable. However, when
8750 we are building construction vtables, we do build vtables for
8751 primary bases; we need these while the primary base is being
8755 build_vtbl_initializer (tree binfo
,
8759 int* non_fn_entries_p
,
8760 vec
<constructor_elt
, va_gc
> **inits
)
8766 vec
<tree
, va_gc
> *vbases
;
8769 /* Initialize VID. */
8770 memset (&vid
, 0, sizeof (vid
));
8773 vid
.rtti_binfo
= rtti_binfo
;
8774 vid
.primary_vtbl_p
= SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
);
8775 vid
.ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8776 vid
.generate_vcall_entries
= true;
8777 /* The first vbase or vcall offset is at index -3 in the vtable. */
8778 vid
.index
= ssize_int(-3 * TARGET_VTABLE_DATA_ENTRY_DISTANCE
);
8780 /* Add entries to the vtable for RTTI. */
8781 build_rtti_vtbl_entries (binfo
, &vid
);
8783 /* Create an array for keeping track of the functions we've
8784 processed. When we see multiple functions with the same
8785 signature, we share the vcall offsets. */
8786 vec_alloc (vid
.fns
, 32);
8787 /* Add the vcall and vbase offset entries. */
8788 build_vcall_and_vbase_vtbl_entries (binfo
, &vid
);
8790 /* Clear BINFO_VTABLE_PATH_MARKED; it's set by
8791 build_vbase_offset_vtbl_entries. */
8792 for (vbases
= CLASSTYPE_VBASECLASSES (t
), ix
= 0;
8793 vec_safe_iterate (vbases
, ix
, &vbinfo
); ix
++)
8794 BINFO_VTABLE_PATH_MARKED (vbinfo
) = 0;
8796 /* If the target requires padding between data entries, add that now. */
8797 if (TARGET_VTABLE_DATA_ENTRY_DISTANCE
> 1)
8799 int n_entries
= vec_safe_length (vid
.inits
);
8801 vec_safe_grow (vid
.inits
, TARGET_VTABLE_DATA_ENTRY_DISTANCE
* n_entries
);
8803 /* Move data entries into their new positions and add padding
8804 after the new positions. Iterate backwards so we don't
8805 overwrite entries that we would need to process later. */
8806 for (ix
= n_entries
- 1;
8807 vid
.inits
->iterate (ix
, &e
);
8811 int new_position
= (TARGET_VTABLE_DATA_ENTRY_DISTANCE
* ix
8812 + (TARGET_VTABLE_DATA_ENTRY_DISTANCE
- 1));
8814 (*vid
.inits
)[new_position
] = *e
;
8816 for (j
= 1; j
< TARGET_VTABLE_DATA_ENTRY_DISTANCE
; ++j
)
8818 constructor_elt
*f
= &(*vid
.inits
)[new_position
- j
];
8819 f
->index
= NULL_TREE
;
8820 f
->value
= build1 (NOP_EXPR
, vtable_entry_type
,
8826 if (non_fn_entries_p
)
8827 *non_fn_entries_p
= vec_safe_length (vid
.inits
);
8829 /* The initializers for virtual functions were built up in reverse
8830 order. Straighten them out and add them to the running list in one
8832 jx
= vec_safe_length (*inits
);
8833 vec_safe_grow (*inits
, jx
+ vid
.inits
->length ());
8835 for (ix
= vid
.inits
->length () - 1;
8836 vid
.inits
->iterate (ix
, &e
);
8840 /* Go through all the ordinary virtual functions, building up
8842 for (v
= BINFO_VIRTUALS (orig_binfo
); v
; v
= TREE_CHAIN (v
))
8846 tree fn
, fn_original
;
8847 tree init
= NULL_TREE
;
8851 if (DECL_THUNK_P (fn
))
8853 if (!DECL_NAME (fn
))
8855 if (THUNK_ALIAS (fn
))
8857 fn
= THUNK_ALIAS (fn
);
8860 fn_original
= THUNK_TARGET (fn
);
8863 /* If the only definition of this function signature along our
8864 primary base chain is from a lost primary, this vtable slot will
8865 never be used, so just zero it out. This is important to avoid
8866 requiring extra thunks which cannot be generated with the function.
8868 We first check this in update_vtable_entry_for_fn, so we handle
8869 restored primary bases properly; we also need to do it here so we
8870 zero out unused slots in ctor vtables, rather than filling them
8871 with erroneous values (though harmless, apart from relocation
8873 if (BV_LOST_PRIMARY (v
))
8874 init
= size_zero_node
;
8878 /* Pull the offset for `this', and the function to call, out of
8880 delta
= BV_DELTA (v
);
8881 vcall_index
= BV_VCALL_INDEX (v
);
8883 gcc_assert (TREE_CODE (delta
) == INTEGER_CST
);
8884 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
8886 /* You can't call an abstract virtual function; it's abstract.
8887 So, we replace these functions with __pure_virtual. */
8888 if (DECL_PURE_VIRTUAL_P (fn_original
))
8891 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
8893 if (abort_fndecl_addr
== NULL
)
8895 = fold_convert (vfunc_ptr_type_node
,
8896 build_fold_addr_expr (fn
));
8897 init
= abort_fndecl_addr
;
8900 /* Likewise for deleted virtuals. */
8901 else if (DECL_DELETED_FN (fn_original
))
8903 fn
= get_identifier ("__cxa_deleted_virtual");
8904 if (!get_global_value_if_present (fn
, &fn
))
8905 fn
= push_library_fn (fn
, (build_function_type_list
8906 (void_type_node
, NULL_TREE
)),
8907 NULL_TREE
, ECF_NORETURN
);
8908 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
8909 init
= fold_convert (vfunc_ptr_type_node
,
8910 build_fold_addr_expr (fn
));
8914 if (!integer_zerop (delta
) || vcall_index
)
8916 fn
= make_thunk (fn
, /*this_adjusting=*/1, delta
, vcall_index
);
8917 if (!DECL_NAME (fn
))
8920 /* Take the address of the function, considering it to be of an
8921 appropriate generic type. */
8922 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
8923 init
= fold_convert (vfunc_ptr_type_node
,
8924 build_fold_addr_expr (fn
));
8925 /* Don't refer to a virtual destructor from a constructor
8926 vtable or a vtable for an abstract class, since destroying
8927 an object under construction is undefined behavior and we
8928 don't want it to be considered a candidate for speculative
8929 devirtualization. But do create the thunk for ABI
8931 if (DECL_DESTRUCTOR_P (fn_original
)
8932 && (CLASSTYPE_PURE_VIRTUALS (DECL_CONTEXT (fn_original
))
8933 || orig_binfo
!= binfo
))
8934 init
= size_zero_node
;
8938 /* And add it to the chain of initializers. */
8939 if (TARGET_VTABLE_USES_DESCRIPTORS
)
8942 if (init
== size_zero_node
)
8943 for (i
= 0; i
< TARGET_VTABLE_USES_DESCRIPTORS
; ++i
)
8944 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
8946 for (i
= 0; i
< TARGET_VTABLE_USES_DESCRIPTORS
; ++i
)
8948 tree fdesc
= build2 (FDESC_EXPR
, vfunc_ptr_type_node
,
8949 fn
, build_int_cst (NULL_TREE
, i
));
8950 TREE_CONSTANT (fdesc
) = 1;
8952 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, fdesc
);
8956 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
8960 /* Adds to vid->inits the initializers for the vbase and vcall
8961 offsets in BINFO, which is in the hierarchy dominated by T. */
8964 build_vcall_and_vbase_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
8968 /* If this is a derived class, we must first create entries
8969 corresponding to the primary base class. */
8970 b
= get_primary_binfo (binfo
);
8972 build_vcall_and_vbase_vtbl_entries (b
, vid
);
8974 /* Add the vbase entries for this base. */
8975 build_vbase_offset_vtbl_entries (binfo
, vid
);
8976 /* Add the vcall entries for this base. */
8977 build_vcall_offset_vtbl_entries (binfo
, vid
);
8980 /* Returns the initializers for the vbase offset entries in the vtable
8981 for BINFO (which is part of the class hierarchy dominated by T), in
8982 reverse order. VBASE_OFFSET_INDEX gives the vtable index
8983 where the next vbase offset will go. */
8986 build_vbase_offset_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
8990 tree non_primary_binfo
;
8992 /* If there are no virtual baseclasses, then there is nothing to
8994 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
)))
8999 /* We might be a primary base class. Go up the inheritance hierarchy
9000 until we find the most derived class of which we are a primary base:
9001 it is the offset of that which we need to use. */
9002 non_primary_binfo
= binfo
;
9003 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo
))
9007 /* If we have reached a virtual base, then it must be a primary
9008 base (possibly multi-level) of vid->binfo, or we wouldn't
9009 have called build_vcall_and_vbase_vtbl_entries for it. But it
9010 might be a lost primary, so just skip down to vid->binfo. */
9011 if (BINFO_VIRTUAL_P (non_primary_binfo
))
9013 non_primary_binfo
= vid
->binfo
;
9017 b
= BINFO_INHERITANCE_CHAIN (non_primary_binfo
);
9018 if (get_primary_binfo (b
) != non_primary_binfo
)
9020 non_primary_binfo
= b
;
9023 /* Go through the virtual bases, adding the offsets. */
9024 for (vbase
= TYPE_BINFO (BINFO_TYPE (binfo
));
9026 vbase
= TREE_CHAIN (vbase
))
9031 if (!BINFO_VIRTUAL_P (vbase
))
9034 /* Find the instance of this virtual base in the complete
9036 b
= copied_binfo (vbase
, binfo
);
9038 /* If we've already got an offset for this virtual base, we
9039 don't need another one. */
9040 if (BINFO_VTABLE_PATH_MARKED (b
))
9042 BINFO_VTABLE_PATH_MARKED (b
) = 1;
9044 /* Figure out where we can find this vbase offset. */
9045 delta
= size_binop (MULT_EXPR
,
9048 TYPE_SIZE_UNIT (vtable_entry_type
)));
9049 if (vid
->primary_vtbl_p
)
9050 BINFO_VPTR_FIELD (b
) = delta
;
9052 if (binfo
!= TYPE_BINFO (t
))
9053 /* The vbase offset had better be the same. */
9054 gcc_assert (tree_int_cst_equal (delta
, BINFO_VPTR_FIELD (vbase
)));
9056 /* The next vbase will come at a more negative offset. */
9057 vid
->index
= size_binop (MINUS_EXPR
, vid
->index
,
9058 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE
));
9060 /* The initializer is the delta from BINFO to this virtual base.
9061 The vbase offsets go in reverse inheritance-graph order, and
9062 we are walking in inheritance graph order so these end up in
9064 delta
= size_diffop_loc (input_location
,
9065 BINFO_OFFSET (b
), BINFO_OFFSET (non_primary_binfo
));
9067 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
,
9068 fold_build1_loc (input_location
, NOP_EXPR
,
9069 vtable_entry_type
, delta
));
9073 /* Adds the initializers for the vcall offset entries in the vtable
9074 for BINFO (which is part of the class hierarchy dominated by VID->DERIVED)
9078 build_vcall_offset_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9080 /* We only need these entries if this base is a virtual base. We
9081 compute the indices -- but do not add to the vtable -- when
9082 building the main vtable for a class. */
9083 if (binfo
== TYPE_BINFO (vid
->derived
)
9084 || (BINFO_VIRTUAL_P (binfo
)
9085 /* If BINFO is RTTI_BINFO, then (since BINFO does not
9086 correspond to VID->DERIVED), we are building a primary
9087 construction virtual table. Since this is a primary
9088 virtual table, we do not need the vcall offsets for
9090 && binfo
!= vid
->rtti_binfo
))
9092 /* We need a vcall offset for each of the virtual functions in this
9093 vtable. For example:
9095 class A { virtual void f (); };
9096 class B1 : virtual public A { virtual void f (); };
9097 class B2 : virtual public A { virtual void f (); };
9098 class C: public B1, public B2 { virtual void f (); };
9100 A C object has a primary base of B1, which has a primary base of A. A
9101 C also has a secondary base of B2, which no longer has a primary base
9102 of A. So the B2-in-C construction vtable needs a secondary vtable for
9103 A, which will adjust the A* to a B2* to call f. We have no way of
9104 knowing what (or even whether) this offset will be when we define B2,
9105 so we store this "vcall offset" in the A sub-vtable and look it up in
9106 a "virtual thunk" for B2::f.
9108 We need entries for all the functions in our primary vtable and
9109 in our non-virtual bases' secondary vtables. */
9111 /* If we are just computing the vcall indices -- but do not need
9112 the actual entries -- not that. */
9113 if (!BINFO_VIRTUAL_P (binfo
))
9114 vid
->generate_vcall_entries
= false;
9115 /* Now, walk through the non-virtual bases, adding vcall offsets. */
9116 add_vcall_offset_vtbl_entries_r (binfo
, vid
);
9120 /* Build vcall offsets, starting with those for BINFO. */
9123 add_vcall_offset_vtbl_entries_r (tree binfo
, vtbl_init_data
* vid
)
9129 /* Don't walk into virtual bases -- except, of course, for the
9130 virtual base for which we are building vcall offsets. Any
9131 primary virtual base will have already had its offsets generated
9132 through the recursion in build_vcall_and_vbase_vtbl_entries. */
9133 if (BINFO_VIRTUAL_P (binfo
) && vid
->vbase
!= binfo
)
9136 /* If BINFO has a primary base, process it first. */
9137 primary_binfo
= get_primary_binfo (binfo
);
9139 add_vcall_offset_vtbl_entries_r (primary_binfo
, vid
);
9141 /* Add BINFO itself to the list. */
9142 add_vcall_offset_vtbl_entries_1 (binfo
, vid
);
9144 /* Scan the non-primary bases of BINFO. */
9145 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
9146 if (base_binfo
!= primary_binfo
)
9147 add_vcall_offset_vtbl_entries_r (base_binfo
, vid
);
9150 /* Called from build_vcall_offset_vtbl_entries_r. */
9153 add_vcall_offset_vtbl_entries_1 (tree binfo
, vtbl_init_data
* vid
)
9155 /* Make entries for the rest of the virtuals. */
9158 /* The ABI requires that the methods be processed in declaration
9160 for (orig_fn
= TYPE_METHODS (BINFO_TYPE (binfo
));
9162 orig_fn
= DECL_CHAIN (orig_fn
))
9163 if (TREE_CODE (orig_fn
) == FUNCTION_DECL
&& DECL_VINDEX (orig_fn
))
9164 add_vcall_offset (orig_fn
, binfo
, vid
);
9167 /* Add a vcall offset entry for ORIG_FN to the vtable. */
9170 add_vcall_offset (tree orig_fn
, tree binfo
, vtbl_init_data
*vid
)
9176 /* If there is already an entry for a function with the same
9177 signature as FN, then we do not need a second vcall offset.
9178 Check the list of functions already present in the derived
9180 FOR_EACH_VEC_SAFE_ELT (vid
->fns
, i
, derived_entry
)
9182 if (same_signature_p (derived_entry
, orig_fn
)
9183 /* We only use one vcall offset for virtual destructors,
9184 even though there are two virtual table entries. */
9185 || (DECL_DESTRUCTOR_P (derived_entry
)
9186 && DECL_DESTRUCTOR_P (orig_fn
)))
9190 /* If we are building these vcall offsets as part of building
9191 the vtable for the most derived class, remember the vcall
9193 if (vid
->binfo
== TYPE_BINFO (vid
->derived
))
9195 tree_pair_s elt
= {orig_fn
, vid
->index
};
9196 vec_safe_push (CLASSTYPE_VCALL_INDICES (vid
->derived
), elt
);
9199 /* The next vcall offset will be found at a more negative
9201 vid
->index
= size_binop (MINUS_EXPR
, vid
->index
,
9202 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE
));
9204 /* Keep track of this function. */
9205 vec_safe_push (vid
->fns
, orig_fn
);
9207 if (vid
->generate_vcall_entries
)
9212 /* Find the overriding function. */
9213 fn
= find_final_overrider (vid
->rtti_binfo
, binfo
, orig_fn
);
9214 if (fn
== error_mark_node
)
9215 vcall_offset
= build_zero_cst (vtable_entry_type
);
9218 base
= TREE_VALUE (fn
);
9220 /* The vbase we're working on is a primary base of
9221 vid->binfo. But it might be a lost primary, so its
9222 BINFO_OFFSET might be wrong, so we just use the
9223 BINFO_OFFSET from vid->binfo. */
9224 vcall_offset
= size_diffop_loc (input_location
,
9225 BINFO_OFFSET (base
),
9226 BINFO_OFFSET (vid
->binfo
));
9227 vcall_offset
= fold_build1_loc (input_location
,
9228 NOP_EXPR
, vtable_entry_type
,
9231 /* Add the initializer to the vtable. */
9232 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, vcall_offset
);
9236 /* Return vtbl initializers for the RTTI entries corresponding to the
9237 BINFO's vtable. The RTTI entries should indicate the object given
9238 by VID->rtti_binfo. */
9241 build_rtti_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9249 t
= BINFO_TYPE (vid
->rtti_binfo
);
9251 /* To find the complete object, we will first convert to our most
9252 primary base, and then add the offset in the vtbl to that value. */
9254 while (CLASSTYPE_HAS_PRIMARY_BASE_P (BINFO_TYPE (b
))
9255 && !BINFO_LOST_PRIMARY_P (b
))
9259 primary_base
= get_primary_binfo (b
);
9260 gcc_assert (BINFO_PRIMARY_P (primary_base
)
9261 && BINFO_INHERITANCE_CHAIN (primary_base
) == b
);
9264 offset
= size_diffop_loc (input_location
,
9265 BINFO_OFFSET (vid
->rtti_binfo
), BINFO_OFFSET (b
));
9267 /* The second entry is the address of the typeinfo object. */
9269 decl
= build_address (get_tinfo_decl (t
));
9271 decl
= integer_zero_node
;
9273 /* Convert the declaration to a type that can be stored in the
9275 init
= build_nop (vfunc_ptr_type_node
, decl
);
9276 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, init
);
9278 /* Add the offset-to-top entry. It comes earlier in the vtable than
9279 the typeinfo entry. Convert the offset to look like a
9280 function pointer, so that we can put it in the vtable. */
9281 init
= build_nop (vfunc_ptr_type_node
, offset
);
9282 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, init
);
9285 /* TRUE iff TYPE is uniquely derived from PARENT. Ignores
9289 uniquely_derived_from_p (tree parent
, tree type
)
9291 tree base
= lookup_base (type
, parent
, ba_unique
, NULL
, tf_none
);
9292 return base
&& base
!= error_mark_node
;
9295 /* TRUE iff TYPE is publicly & uniquely derived from PARENT. */
9298 publicly_uniquely_derived_p (tree parent
, tree type
)
9300 tree base
= lookup_base (type
, parent
, ba_ignore_scope
| ba_check
,
9302 return base
&& base
!= error_mark_node
;
9305 /* CTX1 and CTX2 are declaration contexts. Return the innermost common
9306 class between them, if any. */
9309 common_enclosing_class (tree ctx1
, tree ctx2
)
9311 if (!TYPE_P (ctx1
) || !TYPE_P (ctx2
))
9313 gcc_assert (ctx1
== TYPE_MAIN_VARIANT (ctx1
)
9314 && ctx2
== TYPE_MAIN_VARIANT (ctx2
));
9317 for (tree t
= ctx1
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9318 TYPE_MARKED_P (t
) = true;
9319 tree found
= NULL_TREE
;
9320 for (tree t
= ctx2
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9321 if (TYPE_MARKED_P (t
))
9326 for (tree t
= ctx1
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9327 TYPE_MARKED_P (t
) = false;
9331 #include "gt-cp-class.h"