1 /* Functions related to building classes and their related objects.
2 Copyright (C) 1987-2013 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
22 /* High-level class interface. */
26 #include "coretypes.h"
36 #include "splay-tree.h"
37 #include "pointer-set.h"
38 #include "hash-table.h"
40 /* The number of nested classes being processed. If we are not in the
41 scope of any class, this is zero. */
43 int current_class_depth
;
45 /* In order to deal with nested classes, we keep a stack of classes.
46 The topmost entry is the innermost class, and is the entry at index
47 CURRENT_CLASS_DEPTH */
49 typedef struct class_stack_node
{
50 /* The name of the class. */
53 /* The _TYPE node for the class. */
56 /* The access specifier pending for new declarations in the scope of
60 /* If were defining TYPE, the names used in this class. */
61 splay_tree names_used
;
63 /* Nonzero if this class is no longer open, because of a call to
66 }* class_stack_node_t
;
68 typedef struct vtbl_init_data_s
70 /* The base for which we're building initializers. */
72 /* The type of the most-derived type. */
74 /* The binfo for the dynamic type. This will be TYPE_BINFO (derived),
75 unless ctor_vtbl_p is true. */
77 /* The negative-index vtable initializers built up so far. These
78 are in order from least negative index to most negative index. */
79 vec
<constructor_elt
, va_gc
> *inits
;
80 /* The binfo for the virtual base for which we're building
81 vcall offset initializers. */
83 /* The functions in vbase for which we have already provided vcall
85 vec
<tree
, va_gc
> *fns
;
86 /* The vtable index of the next vcall or vbase offset. */
88 /* Nonzero if we are building the initializer for the primary
91 /* Nonzero if we are building the initializer for a construction
94 /* True when adding vcall offset entries to the vtable. False when
95 merely computing the indices. */
96 bool generate_vcall_entries
;
99 /* The type of a function passed to walk_subobject_offsets. */
100 typedef int (*subobject_offset_fn
) (tree
, tree
, splay_tree
);
102 /* The stack itself. This is a dynamically resized array. The
103 number of elements allocated is CURRENT_CLASS_STACK_SIZE. */
104 static int current_class_stack_size
;
105 static class_stack_node_t current_class_stack
;
107 /* The size of the largest empty class seen in this translation unit. */
108 static GTY (()) tree sizeof_biggest_empty_class
;
110 /* An array of all local classes present in this translation unit, in
111 declaration order. */
112 vec
<tree
, va_gc
> *local_classes
;
114 static tree
get_vfield_name (tree
);
115 static void finish_struct_anon (tree
);
116 static tree
get_vtable_name (tree
);
117 static tree
get_basefndecls (tree
, tree
);
118 static int build_primary_vtable (tree
, tree
);
119 static int build_secondary_vtable (tree
);
120 static void finish_vtbls (tree
);
121 static void modify_vtable_entry (tree
, tree
, tree
, tree
, tree
*);
122 static void finish_struct_bits (tree
);
123 static int alter_access (tree
, tree
, tree
);
124 static void handle_using_decl (tree
, tree
);
125 static tree
dfs_modify_vtables (tree
, void *);
126 static tree
modify_all_vtables (tree
, tree
);
127 static void determine_primary_bases (tree
);
128 static void finish_struct_methods (tree
);
129 static void maybe_warn_about_overly_private_class (tree
);
130 static int method_name_cmp (const void *, const void *);
131 static int resort_method_name_cmp (const void *, const void *);
132 static void add_implicitly_declared_members (tree
, tree
*, int, int);
133 static tree
fixed_type_or_null (tree
, int *, int *);
134 static tree
build_simple_base_path (tree expr
, tree binfo
);
135 static tree
build_vtbl_ref_1 (tree
, tree
);
136 static void build_vtbl_initializer (tree
, tree
, tree
, tree
, int *,
137 vec
<constructor_elt
, va_gc
> **);
138 static int count_fields (tree
);
139 static int add_fields_to_record_type (tree
, struct sorted_fields_type
*, int);
140 static void insert_into_classtype_sorted_fields (tree
, tree
, int);
141 static bool check_bitfield_decl (tree
);
142 static void check_field_decl (tree
, tree
, int *, int *, int *);
143 static void check_field_decls (tree
, tree
*, int *, int *);
144 static tree
*build_base_field (record_layout_info
, tree
, splay_tree
, tree
*);
145 static void build_base_fields (record_layout_info
, splay_tree
, tree
*);
146 static void check_methods (tree
);
147 static void remove_zero_width_bit_fields (tree
);
148 static void check_bases (tree
, int *, int *);
149 static void check_bases_and_members (tree
);
150 static tree
create_vtable_ptr (tree
, tree
*);
151 static void include_empty_classes (record_layout_info
);
152 static void layout_class_type (tree
, tree
*);
153 static void propagate_binfo_offsets (tree
, tree
);
154 static void layout_virtual_bases (record_layout_info
, splay_tree
);
155 static void build_vbase_offset_vtbl_entries (tree
, vtbl_init_data
*);
156 static void add_vcall_offset_vtbl_entries_r (tree
, vtbl_init_data
*);
157 static void add_vcall_offset_vtbl_entries_1 (tree
, vtbl_init_data
*);
158 static void build_vcall_offset_vtbl_entries (tree
, vtbl_init_data
*);
159 static void add_vcall_offset (tree
, tree
, vtbl_init_data
*);
160 static void layout_vtable_decl (tree
, int);
161 static tree
dfs_find_final_overrider_pre (tree
, void *);
162 static tree
dfs_find_final_overrider_post (tree
, void *);
163 static tree
find_final_overrider (tree
, tree
, tree
);
164 static int make_new_vtable (tree
, tree
);
165 static tree
get_primary_binfo (tree
);
166 static int maybe_indent_hierarchy (FILE *, int, int);
167 static tree
dump_class_hierarchy_r (FILE *, int, tree
, tree
, int);
168 static void dump_class_hierarchy (tree
);
169 static void dump_class_hierarchy_1 (FILE *, int, tree
);
170 static void dump_array (FILE *, tree
);
171 static void dump_vtable (tree
, tree
, tree
);
172 static void dump_vtt (tree
, tree
);
173 static void dump_thunk (FILE *, int, tree
);
174 static tree
build_vtable (tree
, tree
, tree
);
175 static void initialize_vtable (tree
, vec
<constructor_elt
, va_gc
> *);
176 static void layout_nonempty_base_or_field (record_layout_info
,
177 tree
, tree
, splay_tree
);
178 static tree
end_of_class (tree
, int);
179 static bool layout_empty_base (record_layout_info
, tree
, tree
, splay_tree
);
180 static void accumulate_vtbl_inits (tree
, tree
, tree
, tree
, tree
,
181 vec
<constructor_elt
, va_gc
> **);
182 static void dfs_accumulate_vtbl_inits (tree
, tree
, tree
, tree
, tree
,
183 vec
<constructor_elt
, va_gc
> **);
184 static void build_rtti_vtbl_entries (tree
, vtbl_init_data
*);
185 static void build_vcall_and_vbase_vtbl_entries (tree
, vtbl_init_data
*);
186 static void clone_constructors_and_destructors (tree
);
187 static tree
build_clone (tree
, tree
);
188 static void update_vtable_entry_for_fn (tree
, tree
, tree
, tree
*, unsigned);
189 static void build_ctor_vtbl_group (tree
, tree
);
190 static void build_vtt (tree
);
191 static tree
binfo_ctor_vtable (tree
);
192 static void build_vtt_inits (tree
, tree
, vec
<constructor_elt
, va_gc
> **,
194 static tree
dfs_build_secondary_vptr_vtt_inits (tree
, void *);
195 static tree
dfs_fixup_binfo_vtbls (tree
, void *);
196 static int record_subobject_offset (tree
, tree
, splay_tree
);
197 static int check_subobject_offset (tree
, tree
, splay_tree
);
198 static int walk_subobject_offsets (tree
, subobject_offset_fn
,
199 tree
, splay_tree
, tree
, int);
200 static void record_subobject_offsets (tree
, tree
, splay_tree
, bool);
201 static int layout_conflict_p (tree
, tree
, splay_tree
, int);
202 static int splay_tree_compare_integer_csts (splay_tree_key k1
,
204 static void warn_about_ambiguous_bases (tree
);
205 static bool type_requires_array_cookie (tree
);
206 static bool contains_empty_class_p (tree
);
207 static bool base_derived_from (tree
, tree
);
208 static int empty_base_at_nonzero_offset_p (tree
, tree
, splay_tree
);
209 static tree
end_of_base (tree
);
210 static tree
get_vcall_index (tree
, tree
);
212 /* Variables shared between class.c and call.c. */
215 int n_vtable_entries
= 0;
216 int n_vtable_searches
= 0;
217 int n_vtable_elems
= 0;
218 int n_convert_harshness
= 0;
219 int n_compute_conversion_costs
= 0;
220 int n_inner_fields_searched
= 0;
222 /* Convert to or from a base subobject. EXPR is an expression of type
223 `A' or `A*', an expression of type `B' or `B*' is returned. To
224 convert A to a base B, CODE is PLUS_EXPR and BINFO is the binfo for
225 the B base instance within A. To convert base A to derived B, CODE
226 is MINUS_EXPR and BINFO is the binfo for the A instance within B.
227 In this latter case, A must not be a morally virtual base of B.
228 NONNULL is true if EXPR is known to be non-NULL (this is only
229 needed when EXPR is of pointer type). CV qualifiers are preserved
233 build_base_path (enum tree_code code
,
237 tsubst_flags_t complain
)
239 tree v_binfo
= NULL_TREE
;
240 tree d_binfo
= NULL_TREE
;
244 tree null_test
= NULL
;
245 tree ptr_target_type
;
247 int want_pointer
= TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
;
248 bool has_empty
= false;
251 if (expr
== error_mark_node
|| binfo
== error_mark_node
|| !binfo
)
252 return error_mark_node
;
254 for (probe
= binfo
; probe
; probe
= BINFO_INHERITANCE_CHAIN (probe
))
257 if (is_empty_class (BINFO_TYPE (probe
)))
259 if (!v_binfo
&& BINFO_VIRTUAL_P (probe
))
263 probe
= TYPE_MAIN_VARIANT (TREE_TYPE (expr
));
265 probe
= TYPE_MAIN_VARIANT (TREE_TYPE (probe
));
267 if (code
== PLUS_EXPR
268 && !SAME_BINFO_TYPE_P (BINFO_TYPE (d_binfo
), probe
))
270 /* This can happen when adjust_result_of_qualified_name_lookup can't
271 find a unique base binfo in a call to a member function. We
272 couldn't give the diagnostic then since we might have been calling
273 a static member function, so we do it now. */
274 if (complain
& tf_error
)
276 tree base
= lookup_base (probe
, BINFO_TYPE (d_binfo
),
277 ba_unique
, NULL
, complain
);
278 gcc_assert (base
== error_mark_node
);
280 return error_mark_node
;
283 gcc_assert ((code
== MINUS_EXPR
284 && SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), probe
))
285 || code
== PLUS_EXPR
);
287 if (binfo
== d_binfo
)
291 if (code
== MINUS_EXPR
&& v_binfo
)
293 if (complain
& tf_error
)
294 error ("cannot convert from base %qT to derived type %qT via "
295 "virtual base %qT", BINFO_TYPE (binfo
), BINFO_TYPE (d_binfo
),
296 BINFO_TYPE (v_binfo
));
297 return error_mark_node
;
301 /* This must happen before the call to save_expr. */
302 expr
= cp_build_addr_expr (expr
, complain
);
304 expr
= mark_rvalue_use (expr
);
306 offset
= BINFO_OFFSET (binfo
);
307 fixed_type_p
= resolves_to_fixed_type_p (expr
, &nonnull
);
308 target_type
= code
== PLUS_EXPR
? BINFO_TYPE (binfo
) : BINFO_TYPE (d_binfo
);
309 /* TARGET_TYPE has been extracted from BINFO, and, is therefore always
310 cv-unqualified. Extract the cv-qualifiers from EXPR so that the
311 expression returned matches the input. */
312 target_type
= cp_build_qualified_type
313 (target_type
, cp_type_quals (TREE_TYPE (TREE_TYPE (expr
))));
314 ptr_target_type
= build_pointer_type (target_type
);
316 /* Do we need to look in the vtable for the real offset? */
317 virtual_access
= (v_binfo
&& fixed_type_p
<= 0);
319 /* Don't bother with the calculations inside sizeof; they'll ICE if the
320 source type is incomplete and the pointer value doesn't matter. In a
321 template (even in fold_non_dependent_expr), we don't have vtables set
322 up properly yet, and the value doesn't matter there either; we're just
323 interested in the result of overload resolution. */
324 if (cp_unevaluated_operand
!= 0
325 || in_template_function ())
327 expr
= build_nop (ptr_target_type
, expr
);
329 expr
= build_indirect_ref (EXPR_LOCATION (expr
), expr
, RO_NULL
);
333 /* If we're in an NSDMI, we don't have the full constructor context yet
334 that we need for converting to a virtual base, so just build a stub
335 CONVERT_EXPR and expand it later in bot_replace. */
336 if (virtual_access
&& fixed_type_p
< 0
337 && current_scope () != current_function_decl
)
339 expr
= build1 (CONVERT_EXPR
, ptr_target_type
, expr
);
340 CONVERT_EXPR_VBASE_PATH (expr
) = true;
342 expr
= build_indirect_ref (EXPR_LOCATION (expr
), expr
, RO_NULL
);
346 /* Do we need to check for a null pointer? */
347 if (want_pointer
&& !nonnull
)
349 /* If we know the conversion will not actually change the value
350 of EXPR, then we can avoid testing the expression for NULL.
351 We have to avoid generating a COMPONENT_REF for a base class
352 field, because other parts of the compiler know that such
353 expressions are always non-NULL. */
354 if (!virtual_access
&& integer_zerop (offset
))
355 return build_nop (ptr_target_type
, expr
);
356 null_test
= error_mark_node
;
359 /* Protect against multiple evaluation if necessary. */
360 if (TREE_SIDE_EFFECTS (expr
) && (null_test
|| virtual_access
))
361 expr
= save_expr (expr
);
363 /* Now that we've saved expr, build the real null test. */
366 tree zero
= cp_convert (TREE_TYPE (expr
), nullptr_node
, complain
);
367 null_test
= fold_build2_loc (input_location
, NE_EXPR
, boolean_type_node
,
371 /* If this is a simple base reference, express it as a COMPONENT_REF. */
372 if (code
== PLUS_EXPR
&& !virtual_access
373 /* We don't build base fields for empty bases, and they aren't very
374 interesting to the optimizers anyway. */
377 expr
= cp_build_indirect_ref (expr
, RO_NULL
, complain
);
378 expr
= build_simple_base_path (expr
, binfo
);
380 expr
= build_address (expr
);
381 target_type
= TREE_TYPE (expr
);
387 /* Going via virtual base V_BINFO. We need the static offset
388 from V_BINFO to BINFO, and the dynamic offset from D_BINFO to
389 V_BINFO. That offset is an entry in D_BINFO's vtable. */
392 if (fixed_type_p
< 0 && in_base_initializer
)
394 /* In a base member initializer, we cannot rely on the
395 vtable being set up. We have to indirect via the
399 t
= TREE_TYPE (TYPE_VFIELD (current_class_type
));
400 t
= build_pointer_type (t
);
401 v_offset
= convert (t
, current_vtt_parm
);
402 v_offset
= cp_build_indirect_ref (v_offset
, RO_NULL
, complain
);
405 v_offset
= build_vfield_ref (cp_build_indirect_ref (expr
, RO_NULL
,
407 TREE_TYPE (TREE_TYPE (expr
)));
409 v_offset
= fold_build_pointer_plus (v_offset
, BINFO_VPTR_FIELD (v_binfo
));
410 v_offset
= build1 (NOP_EXPR
,
411 build_pointer_type (ptrdiff_type_node
),
413 v_offset
= cp_build_indirect_ref (v_offset
, RO_NULL
, complain
);
414 TREE_CONSTANT (v_offset
) = 1;
416 offset
= convert_to_integer (ptrdiff_type_node
,
417 size_diffop_loc (input_location
, offset
,
418 BINFO_OFFSET (v_binfo
)));
420 if (!integer_zerop (offset
))
421 v_offset
= build2 (code
, ptrdiff_type_node
, v_offset
, offset
);
423 if (fixed_type_p
< 0)
424 /* Negative fixed_type_p means this is a constructor or destructor;
425 virtual base layout is fixed in in-charge [cd]tors, but not in
427 offset
= build3 (COND_EXPR
, ptrdiff_type_node
,
428 build2 (EQ_EXPR
, boolean_type_node
,
429 current_in_charge_parm
, integer_zero_node
),
431 convert_to_integer (ptrdiff_type_node
,
432 BINFO_OFFSET (binfo
)));
438 target_type
= ptr_target_type
;
440 expr
= build1 (NOP_EXPR
, ptr_target_type
, expr
);
442 if (!integer_zerop (offset
))
444 offset
= fold_convert (sizetype
, offset
);
445 if (code
== MINUS_EXPR
)
446 offset
= fold_build1_loc (input_location
, NEGATE_EXPR
, sizetype
, offset
);
447 expr
= fold_build_pointer_plus (expr
, offset
);
453 expr
= cp_build_indirect_ref (expr
, RO_NULL
, complain
);
457 expr
= fold_build3_loc (input_location
, COND_EXPR
, target_type
, null_test
, expr
,
458 build_zero_cst (target_type
));
463 /* Subroutine of build_base_path; EXPR and BINFO are as in that function.
464 Perform a derived-to-base conversion by recursively building up a
465 sequence of COMPONENT_REFs to the appropriate base fields. */
468 build_simple_base_path (tree expr
, tree binfo
)
470 tree type
= BINFO_TYPE (binfo
);
471 tree d_binfo
= BINFO_INHERITANCE_CHAIN (binfo
);
474 if (d_binfo
== NULL_TREE
)
478 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (expr
)) == type
);
480 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x'
481 into `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only
482 an lvalue in the front end; only _DECLs and _REFs are lvalues
484 temp
= unary_complex_lvalue (ADDR_EXPR
, expr
);
486 expr
= cp_build_indirect_ref (temp
, RO_NULL
, tf_warning_or_error
);
492 expr
= build_simple_base_path (expr
, d_binfo
);
494 for (field
= TYPE_FIELDS (BINFO_TYPE (d_binfo
));
495 field
; field
= DECL_CHAIN (field
))
496 /* Is this the base field created by build_base_field? */
497 if (TREE_CODE (field
) == FIELD_DECL
498 && DECL_FIELD_IS_BASE (field
)
499 && TREE_TYPE (field
) == type
500 /* If we're looking for a field in the most-derived class,
501 also check the field offset; we can have two base fields
502 of the same type if one is an indirect virtual base and one
503 is a direct non-virtual base. */
504 && (BINFO_INHERITANCE_CHAIN (d_binfo
)
505 || tree_int_cst_equal (byte_position (field
),
506 BINFO_OFFSET (binfo
))))
508 /* We don't use build_class_member_access_expr here, as that
509 has unnecessary checks, and more importantly results in
510 recursive calls to dfs_walk_once. */
511 int type_quals
= cp_type_quals (TREE_TYPE (expr
));
513 expr
= build3 (COMPONENT_REF
,
514 cp_build_qualified_type (type
, type_quals
),
515 expr
, field
, NULL_TREE
);
516 expr
= fold_if_not_in_template (expr
);
518 /* Mark the expression const or volatile, as appropriate.
519 Even though we've dealt with the type above, we still have
520 to mark the expression itself. */
521 if (type_quals
& TYPE_QUAL_CONST
)
522 TREE_READONLY (expr
) = 1;
523 if (type_quals
& TYPE_QUAL_VOLATILE
)
524 TREE_THIS_VOLATILE (expr
) = 1;
529 /* Didn't find the base field?!? */
533 /* Convert OBJECT to the base TYPE. OBJECT is an expression whose
534 type is a class type or a pointer to a class type. In the former
535 case, TYPE is also a class type; in the latter it is another
536 pointer type. If CHECK_ACCESS is true, an error message is emitted
537 if TYPE is inaccessible. If OBJECT has pointer type, the value is
538 assumed to be non-NULL. */
541 convert_to_base (tree object
, tree type
, bool check_access
, bool nonnull
,
542 tsubst_flags_t complain
)
547 if (TYPE_PTR_P (TREE_TYPE (object
)))
549 object_type
= TREE_TYPE (TREE_TYPE (object
));
550 type
= TREE_TYPE (type
);
553 object_type
= TREE_TYPE (object
);
555 binfo
= lookup_base (object_type
, type
, check_access
? ba_check
: ba_unique
,
557 if (!binfo
|| binfo
== error_mark_node
)
558 return error_mark_node
;
560 return build_base_path (PLUS_EXPR
, object
, binfo
, nonnull
, complain
);
563 /* EXPR is an expression with unqualified class type. BASE is a base
564 binfo of that class type. Returns EXPR, converted to the BASE
565 type. This function assumes that EXPR is the most derived class;
566 therefore virtual bases can be found at their static offsets. */
569 convert_to_base_statically (tree expr
, tree base
)
573 expr_type
= TREE_TYPE (expr
);
574 if (!SAME_BINFO_TYPE_P (BINFO_TYPE (base
), expr_type
))
576 /* If this is a non-empty base, use a COMPONENT_REF. */
577 if (!is_empty_class (BINFO_TYPE (base
)))
578 return build_simple_base_path (expr
, base
);
580 /* We use fold_build2 and fold_convert below to simplify the trees
581 provided to the optimizers. It is not safe to call these functions
582 when processing a template because they do not handle C++-specific
584 gcc_assert (!processing_template_decl
);
585 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
586 if (!integer_zerop (BINFO_OFFSET (base
)))
587 expr
= fold_build_pointer_plus_loc (input_location
,
588 expr
, BINFO_OFFSET (base
));
589 expr
= fold_convert (build_pointer_type (BINFO_TYPE (base
)), expr
);
590 expr
= build_fold_indirect_ref_loc (input_location
, expr
);
598 build_vfield_ref (tree datum
, tree type
)
600 tree vfield
, vcontext
;
602 if (datum
== error_mark_node
)
603 return error_mark_node
;
605 /* First, convert to the requested type. */
606 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (datum
), type
))
607 datum
= convert_to_base (datum
, type
, /*check_access=*/false,
608 /*nonnull=*/true, tf_warning_or_error
);
610 /* Second, the requested type may not be the owner of its own vptr.
611 If not, convert to the base class that owns it. We cannot use
612 convert_to_base here, because VCONTEXT may appear more than once
613 in the inheritance hierarchy of TYPE, and thus direct conversion
614 between the types may be ambiguous. Following the path back up
615 one step at a time via primary bases avoids the problem. */
616 vfield
= TYPE_VFIELD (type
);
617 vcontext
= DECL_CONTEXT (vfield
);
618 while (!same_type_ignoring_top_level_qualifiers_p (vcontext
, type
))
620 datum
= build_simple_base_path (datum
, CLASSTYPE_PRIMARY_BINFO (type
));
621 type
= TREE_TYPE (datum
);
624 return build3 (COMPONENT_REF
, TREE_TYPE (vfield
), datum
, vfield
, NULL_TREE
);
627 /* Given an object INSTANCE, return an expression which yields the
628 vtable element corresponding to INDEX. There are many special
629 cases for INSTANCE which we take care of here, mainly to avoid
630 creating extra tree nodes when we don't have to. */
633 build_vtbl_ref_1 (tree instance
, tree idx
)
636 tree vtbl
= NULL_TREE
;
638 /* Try to figure out what a reference refers to, and
639 access its virtual function table directly. */
642 tree fixed_type
= fixed_type_or_null (instance
, NULL
, &cdtorp
);
644 tree basetype
= non_reference (TREE_TYPE (instance
));
646 if (fixed_type
&& !cdtorp
)
648 tree binfo
= lookup_base (fixed_type
, basetype
,
649 ba_unique
, NULL
, tf_none
);
650 if (binfo
&& binfo
!= error_mark_node
)
651 vtbl
= unshare_expr (BINFO_VTABLE (binfo
));
655 vtbl
= build_vfield_ref (instance
, basetype
);
657 aref
= build_array_ref (input_location
, vtbl
, idx
);
658 TREE_CONSTANT (aref
) |= TREE_CONSTANT (vtbl
) && TREE_CONSTANT (idx
);
664 build_vtbl_ref (tree instance
, tree idx
)
666 tree aref
= build_vtbl_ref_1 (instance
, idx
);
671 /* Given a stable object pointer INSTANCE_PTR, return an expression which
672 yields a function pointer corresponding to vtable element INDEX. */
675 build_vfn_ref (tree instance_ptr
, tree idx
)
679 aref
= build_vtbl_ref_1 (cp_build_indirect_ref (instance_ptr
, RO_NULL
,
680 tf_warning_or_error
),
683 /* When using function descriptors, the address of the
684 vtable entry is treated as a function pointer. */
685 if (TARGET_VTABLE_USES_DESCRIPTORS
)
686 aref
= build1 (NOP_EXPR
, TREE_TYPE (aref
),
687 cp_build_addr_expr (aref
, tf_warning_or_error
));
689 /* Remember this as a method reference, for later devirtualization. */
690 aref
= build3 (OBJ_TYPE_REF
, TREE_TYPE (aref
), aref
, instance_ptr
, idx
);
695 /* Return the name of the virtual function table (as an IDENTIFIER_NODE)
696 for the given TYPE. */
699 get_vtable_name (tree type
)
701 return mangle_vtbl_for_type (type
);
704 /* DECL is an entity associated with TYPE, like a virtual table or an
705 implicitly generated constructor. Determine whether or not DECL
706 should have external or internal linkage at the object file
707 level. This routine does not deal with COMDAT linkage and other
708 similar complexities; it simply sets TREE_PUBLIC if it possible for
709 entities in other translation units to contain copies of DECL, in
713 set_linkage_according_to_type (tree
/*type*/, tree decl
)
715 TREE_PUBLIC (decl
) = 1;
716 determine_visibility (decl
);
719 /* Create a VAR_DECL for a primary or secondary vtable for CLASS_TYPE.
720 (For a secondary vtable for B-in-D, CLASS_TYPE should be D, not B.)
721 Use NAME for the name of the vtable, and VTABLE_TYPE for its type. */
724 build_vtable (tree class_type
, tree name
, tree vtable_type
)
728 decl
= build_lang_decl (VAR_DECL
, name
, vtable_type
);
729 /* vtable names are already mangled; give them their DECL_ASSEMBLER_NAME
730 now to avoid confusion in mangle_decl. */
731 SET_DECL_ASSEMBLER_NAME (decl
, name
);
732 DECL_CONTEXT (decl
) = class_type
;
733 DECL_ARTIFICIAL (decl
) = 1;
734 TREE_STATIC (decl
) = 1;
735 TREE_READONLY (decl
) = 1;
736 DECL_VIRTUAL_P (decl
) = 1;
737 DECL_ALIGN (decl
) = TARGET_VTABLE_ENTRY_ALIGN
;
738 DECL_VTABLE_OR_VTT_P (decl
) = 1;
739 /* At one time the vtable info was grabbed 2 words at a time. This
740 fails on sparc unless you have 8-byte alignment. (tiemann) */
741 DECL_ALIGN (decl
) = MAX (TYPE_ALIGN (double_type_node
),
743 set_linkage_according_to_type (class_type
, decl
);
744 /* The vtable has not been defined -- yet. */
745 DECL_EXTERNAL (decl
) = 1;
746 DECL_NOT_REALLY_EXTERN (decl
) = 1;
748 /* Mark the VAR_DECL node representing the vtable itself as a
749 "gratuitous" one, thereby forcing dwarfout.c to ignore it. It
750 is rather important that such things be ignored because any
751 effort to actually generate DWARF for them will run into
752 trouble when/if we encounter code like:
755 struct S { virtual void member (); };
757 because the artificial declaration of the vtable itself (as
758 manufactured by the g++ front end) will say that the vtable is
759 a static member of `S' but only *after* the debug output for
760 the definition of `S' has already been output. This causes
761 grief because the DWARF entry for the definition of the vtable
762 will try to refer back to an earlier *declaration* of the
763 vtable as a static member of `S' and there won't be one. We
764 might be able to arrange to have the "vtable static member"
765 attached to the member list for `S' before the debug info for
766 `S' get written (which would solve the problem) but that would
767 require more intrusive changes to the g++ front end. */
768 DECL_IGNORED_P (decl
) = 1;
773 /* Get the VAR_DECL of the vtable for TYPE. TYPE need not be polymorphic,
774 or even complete. If this does not exist, create it. If COMPLETE is
775 nonzero, then complete the definition of it -- that will render it
776 impossible to actually build the vtable, but is useful to get at those
777 which are known to exist in the runtime. */
780 get_vtable_decl (tree type
, int complete
)
784 if (CLASSTYPE_VTABLES (type
))
785 return CLASSTYPE_VTABLES (type
);
787 decl
= build_vtable (type
, get_vtable_name (type
), vtbl_type_node
);
788 CLASSTYPE_VTABLES (type
) = decl
;
792 DECL_EXTERNAL (decl
) = 1;
793 cp_finish_decl (decl
, NULL_TREE
, false, NULL_TREE
, 0);
799 /* Build the primary virtual function table for TYPE. If BINFO is
800 non-NULL, build the vtable starting with the initial approximation
801 that it is the same as the one which is the head of the association
802 list. Returns a nonzero value if a new vtable is actually
806 build_primary_vtable (tree binfo
, tree type
)
811 decl
= get_vtable_decl (type
, /*complete=*/0);
815 if (BINFO_NEW_VTABLE_MARKED (binfo
))
816 /* We have already created a vtable for this base, so there's
817 no need to do it again. */
820 virtuals
= copy_list (BINFO_VIRTUALS (binfo
));
821 TREE_TYPE (decl
) = TREE_TYPE (get_vtbl_decl_for_binfo (binfo
));
822 DECL_SIZE (decl
) = TYPE_SIZE (TREE_TYPE (decl
));
823 DECL_SIZE_UNIT (decl
) = TYPE_SIZE_UNIT (TREE_TYPE (decl
));
827 gcc_assert (TREE_TYPE (decl
) == vtbl_type_node
);
828 virtuals
= NULL_TREE
;
831 if (GATHER_STATISTICS
)
834 n_vtable_elems
+= list_length (virtuals
);
837 /* Initialize the association list for this type, based
838 on our first approximation. */
839 BINFO_VTABLE (TYPE_BINFO (type
)) = decl
;
840 BINFO_VIRTUALS (TYPE_BINFO (type
)) = virtuals
;
841 SET_BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (type
));
845 /* Give BINFO a new virtual function table which is initialized
846 with a skeleton-copy of its original initialization. The only
847 entry that changes is the `delta' entry, so we can really
848 share a lot of structure.
850 FOR_TYPE is the most derived type which caused this table to
853 Returns nonzero if we haven't met BINFO before.
855 The order in which vtables are built (by calling this function) for
856 an object must remain the same, otherwise a binary incompatibility
860 build_secondary_vtable (tree binfo
)
862 if (BINFO_NEW_VTABLE_MARKED (binfo
))
863 /* We already created a vtable for this base. There's no need to
867 /* Remember that we've created a vtable for this BINFO, so that we
868 don't try to do so again. */
869 SET_BINFO_NEW_VTABLE_MARKED (binfo
);
871 /* Make fresh virtual list, so we can smash it later. */
872 BINFO_VIRTUALS (binfo
) = copy_list (BINFO_VIRTUALS (binfo
));
874 /* Secondary vtables are laid out as part of the same structure as
875 the primary vtable. */
876 BINFO_VTABLE (binfo
) = NULL_TREE
;
880 /* Create a new vtable for BINFO which is the hierarchy dominated by
881 T. Return nonzero if we actually created a new vtable. */
884 make_new_vtable (tree t
, tree binfo
)
886 if (binfo
== TYPE_BINFO (t
))
887 /* In this case, it is *type*'s vtable we are modifying. We start
888 with the approximation that its vtable is that of the
889 immediate base class. */
890 return build_primary_vtable (binfo
, t
);
892 /* This is our very own copy of `basetype' to play with. Later,
893 we will fill in all the virtual functions that override the
894 virtual functions in these base classes which are not defined
895 by the current type. */
896 return build_secondary_vtable (binfo
);
899 /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO
900 (which is in the hierarchy dominated by T) list FNDECL as its
901 BV_FN. DELTA is the required constant adjustment from the `this'
902 pointer where the vtable entry appears to the `this' required when
903 the function is actually called. */
906 modify_vtable_entry (tree t
,
916 if (fndecl
!= BV_FN (v
)
917 || !tree_int_cst_equal (delta
, BV_DELTA (v
)))
919 /* We need a new vtable for BINFO. */
920 if (make_new_vtable (t
, binfo
))
922 /* If we really did make a new vtable, we also made a copy
923 of the BINFO_VIRTUALS list. Now, we have to find the
924 corresponding entry in that list. */
925 *virtuals
= BINFO_VIRTUALS (binfo
);
926 while (BV_FN (*virtuals
) != BV_FN (v
))
927 *virtuals
= TREE_CHAIN (*virtuals
);
931 BV_DELTA (v
) = delta
;
932 BV_VCALL_INDEX (v
) = NULL_TREE
;
938 /* Add method METHOD to class TYPE. If USING_DECL is non-null, it is
939 the USING_DECL naming METHOD. Returns true if the method could be
940 added to the method vec. */
943 add_method (tree type
, tree method
, tree using_decl
)
947 bool template_conv_p
= false;
949 vec
<tree
, va_gc
> *method_vec
;
951 bool insert_p
= false;
955 if (method
== error_mark_node
)
958 complete_p
= COMPLETE_TYPE_P (type
);
959 conv_p
= DECL_CONV_FN_P (method
);
961 template_conv_p
= (TREE_CODE (method
) == TEMPLATE_DECL
962 && DECL_TEMPLATE_CONV_FN_P (method
));
964 method_vec
= CLASSTYPE_METHOD_VEC (type
);
967 /* Make a new method vector. We start with 8 entries. We must
968 allocate at least two (for constructors and destructors), and
969 we're going to end up with an assignment operator at some
971 vec_alloc (method_vec
, 8);
972 /* Create slots for constructors and destructors. */
973 method_vec
->quick_push (NULL_TREE
);
974 method_vec
->quick_push (NULL_TREE
);
975 CLASSTYPE_METHOD_VEC (type
) = method_vec
;
978 /* Maintain TYPE_HAS_USER_CONSTRUCTOR, etc. */
979 grok_special_member_properties (method
);
981 /* Constructors and destructors go in special slots. */
982 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (method
))
983 slot
= CLASSTYPE_CONSTRUCTOR_SLOT
;
984 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method
))
986 slot
= CLASSTYPE_DESTRUCTOR_SLOT
;
988 if (TYPE_FOR_JAVA (type
))
990 if (!DECL_ARTIFICIAL (method
))
991 error ("Java class %qT cannot have a destructor", type
);
992 else if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
993 error ("Java class %qT cannot have an implicit non-trivial "
1003 /* See if we already have an entry with this name. */
1004 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
1005 vec_safe_iterate (method_vec
, slot
, &m
);
1008 m
= OVL_CURRENT (m
);
1009 if (template_conv_p
)
1011 if (TREE_CODE (m
) == TEMPLATE_DECL
1012 && DECL_TEMPLATE_CONV_FN_P (m
))
1016 if (conv_p
&& !DECL_CONV_FN_P (m
))
1018 if (DECL_NAME (m
) == DECL_NAME (method
))
1024 && !DECL_CONV_FN_P (m
)
1025 && DECL_NAME (m
) > DECL_NAME (method
))
1029 current_fns
= insert_p
? NULL_TREE
: (*method_vec
)[slot
];
1031 /* Check to see if we've already got this method. */
1032 for (fns
= current_fns
; fns
; fns
= OVL_NEXT (fns
))
1034 tree fn
= OVL_CURRENT (fns
);
1040 if (TREE_CODE (fn
) != TREE_CODE (method
))
1043 /* [over.load] Member function declarations with the
1044 same name and the same parameter types cannot be
1045 overloaded if any of them is a static member
1046 function declaration.
1048 [namespace.udecl] When a using-declaration brings names
1049 from a base class into a derived class scope, member
1050 functions in the derived class override and/or hide member
1051 functions with the same name and parameter types in a base
1052 class (rather than conflicting). */
1053 fn_type
= TREE_TYPE (fn
);
1054 method_type
= TREE_TYPE (method
);
1055 parms1
= TYPE_ARG_TYPES (fn_type
);
1056 parms2
= TYPE_ARG_TYPES (method_type
);
1058 /* Compare the quals on the 'this' parm. Don't compare
1059 the whole types, as used functions are treated as
1060 coming from the using class in overload resolution. */
1061 if (! DECL_STATIC_FUNCTION_P (fn
)
1062 && ! DECL_STATIC_FUNCTION_P (method
)
1063 && TREE_TYPE (TREE_VALUE (parms1
)) != error_mark_node
1064 && TREE_TYPE (TREE_VALUE (parms2
)) != error_mark_node
1065 && (cp_type_quals (TREE_TYPE (TREE_VALUE (parms1
)))
1066 != cp_type_quals (TREE_TYPE (TREE_VALUE (parms2
)))))
1069 /* For templates, the return type and template parameters
1070 must be identical. */
1071 if (TREE_CODE (fn
) == TEMPLATE_DECL
1072 && (!same_type_p (TREE_TYPE (fn_type
),
1073 TREE_TYPE (method_type
))
1074 || !comp_template_parms (DECL_TEMPLATE_PARMS (fn
),
1075 DECL_TEMPLATE_PARMS (method
))))
1078 if (! DECL_STATIC_FUNCTION_P (fn
))
1079 parms1
= TREE_CHAIN (parms1
);
1080 if (! DECL_STATIC_FUNCTION_P (method
))
1081 parms2
= TREE_CHAIN (parms2
);
1083 if (compparms (parms1
, parms2
)
1084 && (!DECL_CONV_FN_P (fn
)
1085 || same_type_p (TREE_TYPE (fn_type
),
1086 TREE_TYPE (method_type
))))
1088 /* For function versions, their parms and types match
1089 but they are not duplicates. Record function versions
1090 as and when they are found. extern "C" functions are
1091 not treated as versions. */
1092 if (TREE_CODE (fn
) == FUNCTION_DECL
1093 && TREE_CODE (method
) == FUNCTION_DECL
1094 && !DECL_EXTERN_C_P (fn
)
1095 && !DECL_EXTERN_C_P (method
)
1096 && targetm
.target_option
.function_versions (fn
, method
))
1098 /* Mark functions as versions if necessary. Modify the mangled
1099 decl name if necessary. */
1100 if (!DECL_FUNCTION_VERSIONED (fn
))
1102 DECL_FUNCTION_VERSIONED (fn
) = 1;
1103 if (DECL_ASSEMBLER_NAME_SET_P (fn
))
1106 if (!DECL_FUNCTION_VERSIONED (method
))
1108 DECL_FUNCTION_VERSIONED (method
) = 1;
1109 if (DECL_ASSEMBLER_NAME_SET_P (method
))
1110 mangle_decl (method
);
1112 record_function_versions (fn
, method
);
1115 if (DECL_INHERITED_CTOR_BASE (method
))
1117 if (DECL_INHERITED_CTOR_BASE (fn
))
1119 error_at (DECL_SOURCE_LOCATION (method
),
1120 "%q#D inherited from %qT", method
,
1121 DECL_INHERITED_CTOR_BASE (method
));
1122 error_at (DECL_SOURCE_LOCATION (fn
),
1123 "conflicts with version inherited from %qT",
1124 DECL_INHERITED_CTOR_BASE (fn
));
1126 /* Otherwise defer to the other function. */
1131 if (DECL_CONTEXT (fn
) == type
)
1132 /* Defer to the local function. */
1137 error ("%q+#D cannot be overloaded", method
);
1138 error ("with %q+#D", fn
);
1141 /* We don't call duplicate_decls here to merge the
1142 declarations because that will confuse things if the
1143 methods have inline definitions. In particular, we
1144 will crash while processing the definitions. */
1149 /* A class should never have more than one destructor. */
1150 if (current_fns
&& DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method
))
1153 /* Add the new binding. */
1156 overload
= ovl_cons (method
, current_fns
);
1157 OVL_USED (overload
) = true;
1160 overload
= build_overload (method
, current_fns
);
1163 TYPE_HAS_CONVERSION (type
) = 1;
1164 else if (slot
>= CLASSTYPE_FIRST_CONVERSION_SLOT
&& !complete_p
)
1165 push_class_level_binding (DECL_NAME (method
), overload
);
1171 /* We only expect to add few methods in the COMPLETE_P case, so
1172 just make room for one more method in that case. */
1174 reallocated
= vec_safe_reserve_exact (method_vec
, 1);
1176 reallocated
= vec_safe_reserve (method_vec
, 1);
1178 CLASSTYPE_METHOD_VEC (type
) = method_vec
;
1179 if (slot
== method_vec
->length ())
1180 method_vec
->quick_push (overload
);
1182 method_vec
->quick_insert (slot
, overload
);
1185 /* Replace the current slot. */
1186 (*method_vec
)[slot
] = overload
;
1190 /* Subroutines of finish_struct. */
1192 /* Change the access of FDECL to ACCESS in T. Return 1 if change was
1193 legit, otherwise return 0. */
1196 alter_access (tree t
, tree fdecl
, tree access
)
1200 if (!DECL_LANG_SPECIFIC (fdecl
))
1201 retrofit_lang_decl (fdecl
);
1203 gcc_assert (!DECL_DISCRIMINATOR_P (fdecl
));
1205 elem
= purpose_member (t
, DECL_ACCESS (fdecl
));
1208 if (TREE_VALUE (elem
) != access
)
1210 if (TREE_CODE (TREE_TYPE (fdecl
)) == FUNCTION_DECL
)
1211 error ("conflicting access specifications for method"
1212 " %q+D, ignored", TREE_TYPE (fdecl
));
1214 error ("conflicting access specifications for field %qE, ignored",
1219 /* They're changing the access to the same thing they changed
1220 it to before. That's OK. */
1226 perform_or_defer_access_check (TYPE_BINFO (t
), fdecl
, fdecl
,
1227 tf_warning_or_error
);
1228 DECL_ACCESS (fdecl
) = tree_cons (t
, access
, DECL_ACCESS (fdecl
));
1234 /* Process the USING_DECL, which is a member of T. */
1237 handle_using_decl (tree using_decl
, tree t
)
1239 tree decl
= USING_DECL_DECLS (using_decl
);
1240 tree name
= DECL_NAME (using_decl
);
1242 = TREE_PRIVATE (using_decl
) ? access_private_node
1243 : TREE_PROTECTED (using_decl
) ? access_protected_node
1244 : access_public_node
;
1245 tree flist
= NULL_TREE
;
1248 gcc_assert (!processing_template_decl
&& decl
);
1250 old_value
= lookup_member (t
, name
, /*protect=*/0, /*want_type=*/false,
1251 tf_warning_or_error
);
1254 if (is_overloaded_fn (old_value
))
1255 old_value
= OVL_CURRENT (old_value
);
1257 if (DECL_P (old_value
) && DECL_CONTEXT (old_value
) == t
)
1260 old_value
= NULL_TREE
;
1263 cp_emit_debug_info_for_using (decl
, USING_DECL_SCOPE (using_decl
));
1265 if (is_overloaded_fn (decl
))
1270 else if (is_overloaded_fn (old_value
))
1273 /* It's OK to use functions from a base when there are functions with
1274 the same name already present in the current class. */;
1277 error ("%q+D invalid in %q#T", using_decl
, t
);
1278 error (" because of local method %q+#D with same name",
1279 OVL_CURRENT (old_value
));
1283 else if (!DECL_ARTIFICIAL (old_value
))
1285 error ("%q+D invalid in %q#T", using_decl
, t
);
1286 error (" because of local member %q+#D with same name", old_value
);
1290 /* Make type T see field decl FDECL with access ACCESS. */
1292 for (; flist
; flist
= OVL_NEXT (flist
))
1294 add_method (t
, OVL_CURRENT (flist
), using_decl
);
1295 alter_access (t
, OVL_CURRENT (flist
), access
);
1298 alter_access (t
, decl
, access
);
1301 /* walk_tree callback for check_abi_tags: if the type at *TP involves any
1302 types with abi tags, add the corresponding identifiers to the VEC in
1303 *DATA and set IDENTIFIER_MARKED. */
1312 find_abi_tags_r (tree
*tp
, int */
*walk_subtrees*/
, void *data
)
1314 if (!TAGGED_TYPE_P (*tp
))
1317 if (tree attributes
= lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (*tp
)))
1319 struct abi_tag_data
*p
= static_cast<struct abi_tag_data
*>(data
);
1320 for (tree list
= TREE_VALUE (attributes
); list
;
1321 list
= TREE_CHAIN (list
))
1323 tree tag
= TREE_VALUE (list
);
1324 tree id
= get_identifier (TREE_STRING_POINTER (tag
));
1325 if (!IDENTIFIER_MARKED (id
))
1327 if (TYPE_P (p
->subob
))
1329 warning (OPT_Wabi_tag
, "%qT does not have the %E abi tag "
1330 "that base %qT has", p
->t
, tag
, p
->subob
);
1331 inform (location_of (p
->subob
), "%qT declared here",
1336 warning (OPT_Wabi_tag
, "%qT does not have the %E abi tag "
1337 "that %qT (used in the type of %qD) has",
1338 p
->t
, tag
, *tp
, p
->subob
);
1339 inform (location_of (p
->subob
), "%qD declared here",
1341 inform (location_of (*tp
), "%qT declared here", *tp
);
1349 /* Check that class T has all the abi tags that subobject SUBOB has, or
1353 check_abi_tags (tree t
, tree subob
)
1355 tree attributes
= lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (t
));
1358 for (tree list
= TREE_VALUE (attributes
); list
;
1359 list
= TREE_CHAIN (list
))
1361 tree tag
= TREE_VALUE (list
);
1362 tree id
= get_identifier (TREE_STRING_POINTER (tag
));
1363 IDENTIFIER_MARKED (id
) = true;
1367 tree subtype
= TYPE_P (subob
) ? subob
: TREE_TYPE (subob
);
1368 struct abi_tag_data data
= { t
, subob
};
1370 cp_walk_tree_without_duplicates (&subtype
, find_abi_tags_r
, &data
);
1374 for (tree list
= TREE_VALUE (attributes
); list
;
1375 list
= TREE_CHAIN (list
))
1377 tree tag
= TREE_VALUE (list
);
1378 tree id
= get_identifier (TREE_STRING_POINTER (tag
));
1379 IDENTIFIER_MARKED (id
) = false;
1384 /* Run through the base classes of T, updating CANT_HAVE_CONST_CTOR_P,
1385 and NO_CONST_ASN_REF_P. Also set flag bits in T based on
1386 properties of the bases. */
1389 check_bases (tree t
,
1390 int* cant_have_const_ctor_p
,
1391 int* no_const_asn_ref_p
)
1394 bool seen_non_virtual_nearly_empty_base_p
= 0;
1395 int seen_tm_mask
= 0;
1398 tree field
= NULL_TREE
;
1400 if (!CLASSTYPE_NON_STD_LAYOUT (t
))
1401 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
1402 if (TREE_CODE (field
) == FIELD_DECL
)
1405 for (binfo
= TYPE_BINFO (t
), i
= 0;
1406 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
1408 tree basetype
= TREE_TYPE (base_binfo
);
1410 gcc_assert (COMPLETE_TYPE_P (basetype
));
1412 if (CLASSTYPE_FINAL (basetype
))
1413 error ("cannot derive from %<final%> base %qT in derived type %qT",
1416 /* If any base class is non-literal, so is the derived class. */
1417 if (!CLASSTYPE_LITERAL_P (basetype
))
1418 CLASSTYPE_LITERAL_P (t
) = false;
1420 /* Effective C++ rule 14. We only need to check TYPE_POLYMORPHIC_P
1421 here because the case of virtual functions but non-virtual
1422 dtor is handled in finish_struct_1. */
1423 if (!TYPE_POLYMORPHIC_P (basetype
))
1424 warning (OPT_Weffc__
,
1425 "base class %q#T has a non-virtual destructor", basetype
);
1427 /* If the base class doesn't have copy constructors or
1428 assignment operators that take const references, then the
1429 derived class cannot have such a member automatically
1431 if (TYPE_HAS_COPY_CTOR (basetype
)
1432 && ! TYPE_HAS_CONST_COPY_CTOR (basetype
))
1433 *cant_have_const_ctor_p
= 1;
1434 if (TYPE_HAS_COPY_ASSIGN (basetype
)
1435 && !TYPE_HAS_CONST_COPY_ASSIGN (basetype
))
1436 *no_const_asn_ref_p
= 1;
1438 if (BINFO_VIRTUAL_P (base_binfo
))
1439 /* A virtual base does not effect nearly emptiness. */
1441 else if (CLASSTYPE_NEARLY_EMPTY_P (basetype
))
1443 if (seen_non_virtual_nearly_empty_base_p
)
1444 /* And if there is more than one nearly empty base, then the
1445 derived class is not nearly empty either. */
1446 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
1448 /* Remember we've seen one. */
1449 seen_non_virtual_nearly_empty_base_p
= 1;
1451 else if (!is_empty_class (basetype
))
1452 /* If the base class is not empty or nearly empty, then this
1453 class cannot be nearly empty. */
1454 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
1456 /* A lot of properties from the bases also apply to the derived
1458 TYPE_NEEDS_CONSTRUCTING (t
) |= TYPE_NEEDS_CONSTRUCTING (basetype
);
1459 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
1460 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (basetype
);
1461 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
)
1462 |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (basetype
)
1463 || !TYPE_HAS_COPY_ASSIGN (basetype
));
1464 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= (TYPE_HAS_COMPLEX_COPY_CTOR (basetype
)
1465 || !TYPE_HAS_COPY_CTOR (basetype
));
1466 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
)
1467 |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (basetype
);
1468 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_HAS_COMPLEX_MOVE_CTOR (basetype
);
1469 TYPE_POLYMORPHIC_P (t
) |= TYPE_POLYMORPHIC_P (basetype
);
1470 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
)
1471 |= CLASSTYPE_CONTAINS_EMPTY_CLASS_P (basetype
);
1472 TYPE_HAS_COMPLEX_DFLT (t
) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
1473 || TYPE_HAS_COMPLEX_DFLT (basetype
));
1475 /* A standard-layout class is a class that:
1477 * has no non-standard-layout base classes, */
1478 CLASSTYPE_NON_STD_LAYOUT (t
) |= CLASSTYPE_NON_STD_LAYOUT (basetype
);
1479 if (!CLASSTYPE_NON_STD_LAYOUT (t
))
1482 /* ...has no base classes of the same type as the first non-static
1484 if (field
&& DECL_CONTEXT (field
) == t
1485 && (same_type_ignoring_top_level_qualifiers_p
1486 (TREE_TYPE (field
), basetype
)))
1487 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
1489 /* ...either has no non-static data members in the most-derived
1490 class and at most one base class with non-static data
1491 members, or has no base classes with non-static data
1493 for (basefield
= TYPE_FIELDS (basetype
); basefield
;
1494 basefield
= DECL_CHAIN (basefield
))
1495 if (TREE_CODE (basefield
) == FIELD_DECL
)
1498 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
1505 /* Don't bother collecting tm attributes if transactional memory
1506 support is not enabled. */
1509 tree tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (basetype
));
1511 seen_tm_mask
|= tm_attr_to_mask (tm_attr
);
1514 check_abi_tags (t
, basetype
);
1517 /* If one of the base classes had TM attributes, and the current class
1518 doesn't define its own, then the current class inherits one. */
1519 if (seen_tm_mask
&& !find_tm_attribute (TYPE_ATTRIBUTES (t
)))
1521 tree tm_attr
= tm_mask_to_attr (seen_tm_mask
& -seen_tm_mask
);
1522 TYPE_ATTRIBUTES (t
) = tree_cons (tm_attr
, NULL
, TYPE_ATTRIBUTES (t
));
1526 /* Determine all the primary bases within T. Sets BINFO_PRIMARY_BASE_P for
1527 those that are primaries. Sets BINFO_LOST_PRIMARY_P for those
1528 that have had a nearly-empty virtual primary base stolen by some
1529 other base in the hierarchy. Determines CLASSTYPE_PRIMARY_BASE for
1533 determine_primary_bases (tree t
)
1536 tree primary
= NULL_TREE
;
1537 tree type_binfo
= TYPE_BINFO (t
);
1540 /* Determine the primary bases of our bases. */
1541 for (base_binfo
= TREE_CHAIN (type_binfo
); base_binfo
;
1542 base_binfo
= TREE_CHAIN (base_binfo
))
1544 tree primary
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (base_binfo
));
1546 /* See if we're the non-virtual primary of our inheritance
1548 if (!BINFO_VIRTUAL_P (base_binfo
))
1550 tree parent
= BINFO_INHERITANCE_CHAIN (base_binfo
);
1551 tree parent_primary
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (parent
));
1554 && SAME_BINFO_TYPE_P (BINFO_TYPE (base_binfo
),
1555 BINFO_TYPE (parent_primary
)))
1556 /* We are the primary binfo. */
1557 BINFO_PRIMARY_P (base_binfo
) = 1;
1559 /* Determine if we have a virtual primary base, and mark it so.
1561 if (primary
&& BINFO_VIRTUAL_P (primary
))
1563 tree this_primary
= copied_binfo (primary
, base_binfo
);
1565 if (BINFO_PRIMARY_P (this_primary
))
1566 /* Someone already claimed this base. */
1567 BINFO_LOST_PRIMARY_P (base_binfo
) = 1;
1572 BINFO_PRIMARY_P (this_primary
) = 1;
1573 BINFO_INHERITANCE_CHAIN (this_primary
) = base_binfo
;
1575 /* A virtual binfo might have been copied from within
1576 another hierarchy. As we're about to use it as a
1577 primary base, make sure the offsets match. */
1578 delta
= size_diffop_loc (input_location
,
1580 BINFO_OFFSET (base_binfo
)),
1582 BINFO_OFFSET (this_primary
)));
1584 propagate_binfo_offsets (this_primary
, delta
);
1589 /* First look for a dynamic direct non-virtual base. */
1590 for (i
= 0; BINFO_BASE_ITERATE (type_binfo
, i
, base_binfo
); i
++)
1592 tree basetype
= BINFO_TYPE (base_binfo
);
1594 if (TYPE_CONTAINS_VPTR_P (basetype
) && !BINFO_VIRTUAL_P (base_binfo
))
1596 primary
= base_binfo
;
1601 /* A "nearly-empty" virtual base class can be the primary base
1602 class, if no non-virtual polymorphic base can be found. Look for
1603 a nearly-empty virtual dynamic base that is not already a primary
1604 base of something in the hierarchy. If there is no such base,
1605 just pick the first nearly-empty virtual base. */
1607 for (base_binfo
= TREE_CHAIN (type_binfo
); base_binfo
;
1608 base_binfo
= TREE_CHAIN (base_binfo
))
1609 if (BINFO_VIRTUAL_P (base_binfo
)
1610 && CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (base_binfo
)))
1612 if (!BINFO_PRIMARY_P (base_binfo
))
1614 /* Found one that is not primary. */
1615 primary
= base_binfo
;
1619 /* Remember the first candidate. */
1620 primary
= base_binfo
;
1624 /* If we've got a primary base, use it. */
1627 tree basetype
= BINFO_TYPE (primary
);
1629 CLASSTYPE_PRIMARY_BINFO (t
) = primary
;
1630 if (BINFO_PRIMARY_P (primary
))
1631 /* We are stealing a primary base. */
1632 BINFO_LOST_PRIMARY_P (BINFO_INHERITANCE_CHAIN (primary
)) = 1;
1633 BINFO_PRIMARY_P (primary
) = 1;
1634 if (BINFO_VIRTUAL_P (primary
))
1638 BINFO_INHERITANCE_CHAIN (primary
) = type_binfo
;
1639 /* A virtual binfo might have been copied from within
1640 another hierarchy. As we're about to use it as a primary
1641 base, make sure the offsets match. */
1642 delta
= size_diffop_loc (input_location
, ssize_int (0),
1643 convert (ssizetype
, BINFO_OFFSET (primary
)));
1645 propagate_binfo_offsets (primary
, delta
);
1648 primary
= TYPE_BINFO (basetype
);
1650 TYPE_VFIELD (t
) = TYPE_VFIELD (basetype
);
1651 BINFO_VTABLE (type_binfo
) = BINFO_VTABLE (primary
);
1652 BINFO_VIRTUALS (type_binfo
) = BINFO_VIRTUALS (primary
);
1656 /* Update the variant types of T. */
1659 fixup_type_variants (tree t
)
1666 for (variants
= TYPE_NEXT_VARIANT (t
);
1668 variants
= TYPE_NEXT_VARIANT (variants
))
1670 /* These fields are in the _TYPE part of the node, not in
1671 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1672 TYPE_HAS_USER_CONSTRUCTOR (variants
) = TYPE_HAS_USER_CONSTRUCTOR (t
);
1673 TYPE_NEEDS_CONSTRUCTING (variants
) = TYPE_NEEDS_CONSTRUCTING (t
);
1674 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (variants
)
1675 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
);
1677 TYPE_POLYMORPHIC_P (variants
) = TYPE_POLYMORPHIC_P (t
);
1679 TYPE_BINFO (variants
) = TYPE_BINFO (t
);
1681 /* Copy whatever these are holding today. */
1682 TYPE_VFIELD (variants
) = TYPE_VFIELD (t
);
1683 TYPE_METHODS (variants
) = TYPE_METHODS (t
);
1684 TYPE_FIELDS (variants
) = TYPE_FIELDS (t
);
1688 /* Early variant fixups: we apply attributes at the beginning of the class
1689 definition, and we need to fix up any variants that have already been
1690 made via elaborated-type-specifier so that check_qualified_type works. */
1693 fixup_attribute_variants (tree t
)
1700 for (variants
= TYPE_NEXT_VARIANT (t
);
1702 variants
= TYPE_NEXT_VARIANT (variants
))
1704 /* These are the two fields that check_qualified_type looks at and
1705 are affected by attributes. */
1706 TYPE_ATTRIBUTES (variants
) = TYPE_ATTRIBUTES (t
);
1707 TYPE_ALIGN (variants
) = TYPE_ALIGN (t
);
1711 /* Set memoizing fields and bits of T (and its variants) for later
1715 finish_struct_bits (tree t
)
1717 /* Fix up variants (if any). */
1718 fixup_type_variants (t
);
1720 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t
)) && TYPE_POLYMORPHIC_P (t
))
1721 /* For a class w/o baseclasses, 'finish_struct' has set
1722 CLASSTYPE_PURE_VIRTUALS correctly (by definition).
1723 Similarly for a class whose base classes do not have vtables.
1724 When neither of these is true, we might have removed abstract
1725 virtuals (by providing a definition), added some (by declaring
1726 new ones), or redeclared ones from a base class. We need to
1727 recalculate what's really an abstract virtual at this point (by
1728 looking in the vtables). */
1729 get_pure_virtuals (t
);
1731 /* If this type has a copy constructor or a destructor, force its
1732 mode to be BLKmode, and force its TREE_ADDRESSABLE bit to be
1733 nonzero. This will cause it to be passed by invisible reference
1734 and prevent it from being returned in a register. */
1735 if (type_has_nontrivial_copy_init (t
)
1736 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
1739 DECL_MODE (TYPE_MAIN_DECL (t
)) = BLKmode
;
1740 for (variants
= t
; variants
; variants
= TYPE_NEXT_VARIANT (variants
))
1742 SET_TYPE_MODE (variants
, BLKmode
);
1743 TREE_ADDRESSABLE (variants
) = 1;
1748 /* Issue warnings about T having private constructors, but no friends,
1751 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
1752 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
1753 non-private static member functions. */
1756 maybe_warn_about_overly_private_class (tree t
)
1758 int has_member_fn
= 0;
1759 int has_nonprivate_method
= 0;
1762 if (!warn_ctor_dtor_privacy
1763 /* If the class has friends, those entities might create and
1764 access instances, so we should not warn. */
1765 || (CLASSTYPE_FRIEND_CLASSES (t
)
1766 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t
)))
1767 /* We will have warned when the template was declared; there's
1768 no need to warn on every instantiation. */
1769 || CLASSTYPE_TEMPLATE_INSTANTIATION (t
))
1770 /* There's no reason to even consider warning about this
1774 /* We only issue one warning, if more than one applies, because
1775 otherwise, on code like:
1778 // Oops - forgot `public:'
1784 we warn several times about essentially the same problem. */
1786 /* Check to see if all (non-constructor, non-destructor) member
1787 functions are private. (Since there are no friends or
1788 non-private statics, we can't ever call any of the private member
1790 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
1791 /* We're not interested in compiler-generated methods; they don't
1792 provide any way to call private members. */
1793 if (!DECL_ARTIFICIAL (fn
))
1795 if (!TREE_PRIVATE (fn
))
1797 if (DECL_STATIC_FUNCTION_P (fn
))
1798 /* A non-private static member function is just like a
1799 friend; it can create and invoke private member
1800 functions, and be accessed without a class
1804 has_nonprivate_method
= 1;
1805 /* Keep searching for a static member function. */
1807 else if (!DECL_CONSTRUCTOR_P (fn
) && !DECL_DESTRUCTOR_P (fn
))
1811 if (!has_nonprivate_method
&& has_member_fn
)
1813 /* There are no non-private methods, and there's at least one
1814 private member function that isn't a constructor or
1815 destructor. (If all the private members are
1816 constructors/destructors we want to use the code below that
1817 issues error messages specifically referring to
1818 constructors/destructors.) */
1820 tree binfo
= TYPE_BINFO (t
);
1822 for (i
= 0; i
!= BINFO_N_BASE_BINFOS (binfo
); i
++)
1823 if (BINFO_BASE_ACCESS (binfo
, i
) != access_private_node
)
1825 has_nonprivate_method
= 1;
1828 if (!has_nonprivate_method
)
1830 warning (OPT_Wctor_dtor_privacy
,
1831 "all member functions in class %qT are private", t
);
1836 /* Even if some of the member functions are non-private, the class
1837 won't be useful for much if all the constructors or destructors
1838 are private: such an object can never be created or destroyed. */
1839 fn
= CLASSTYPE_DESTRUCTORS (t
);
1840 if (fn
&& TREE_PRIVATE (fn
))
1842 warning (OPT_Wctor_dtor_privacy
,
1843 "%q#T only defines a private destructor and has no friends",
1848 /* Warn about classes that have private constructors and no friends. */
1849 if (TYPE_HAS_USER_CONSTRUCTOR (t
)
1850 /* Implicitly generated constructors are always public. */
1851 && (!CLASSTYPE_LAZY_DEFAULT_CTOR (t
)
1852 || !CLASSTYPE_LAZY_COPY_CTOR (t
)))
1854 int nonprivate_ctor
= 0;
1856 /* If a non-template class does not define a copy
1857 constructor, one is defined for it, enabling it to avoid
1858 this warning. For a template class, this does not
1859 happen, and so we would normally get a warning on:
1861 template <class T> class C { private: C(); };
1863 To avoid this asymmetry, we check TYPE_HAS_COPY_CTOR. All
1864 complete non-template or fully instantiated classes have this
1866 if (!TYPE_HAS_COPY_CTOR (t
))
1867 nonprivate_ctor
= 1;
1869 for (fn
= CLASSTYPE_CONSTRUCTORS (t
); fn
; fn
= OVL_NEXT (fn
))
1871 tree ctor
= OVL_CURRENT (fn
);
1872 /* Ideally, we wouldn't count copy constructors (or, in
1873 fact, any constructor that takes an argument of the
1874 class type as a parameter) because such things cannot
1875 be used to construct an instance of the class unless
1876 you already have one. But, for now at least, we're
1878 if (! TREE_PRIVATE (ctor
))
1880 nonprivate_ctor
= 1;
1885 if (nonprivate_ctor
== 0)
1887 warning (OPT_Wctor_dtor_privacy
,
1888 "%q#T only defines private constructors and has no friends",
1896 gt_pointer_operator new_value
;
1900 /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */
1903 method_name_cmp (const void* m1_p
, const void* m2_p
)
1905 const tree
*const m1
= (const tree
*) m1_p
;
1906 const tree
*const m2
= (const tree
*) m2_p
;
1908 if (*m1
== NULL_TREE
&& *m2
== NULL_TREE
)
1910 if (*m1
== NULL_TREE
)
1912 if (*m2
== NULL_TREE
)
1914 if (DECL_NAME (OVL_CURRENT (*m1
)) < DECL_NAME (OVL_CURRENT (*m2
)))
1919 /* This routine compares two fields like method_name_cmp but using the
1920 pointer operator in resort_field_decl_data. */
1923 resort_method_name_cmp (const void* m1_p
, const void* m2_p
)
1925 const tree
*const m1
= (const tree
*) m1_p
;
1926 const tree
*const m2
= (const tree
*) m2_p
;
1927 if (*m1
== NULL_TREE
&& *m2
== NULL_TREE
)
1929 if (*m1
== NULL_TREE
)
1931 if (*m2
== NULL_TREE
)
1934 tree d1
= DECL_NAME (OVL_CURRENT (*m1
));
1935 tree d2
= DECL_NAME (OVL_CURRENT (*m2
));
1936 resort_data
.new_value (&d1
, resort_data
.cookie
);
1937 resort_data
.new_value (&d2
, resort_data
.cookie
);
1944 /* Resort TYPE_METHOD_VEC because pointers have been reordered. */
1947 resort_type_method_vec (void* obj
,
1949 gt_pointer_operator new_value
,
1952 vec
<tree
, va_gc
> *method_vec
= (vec
<tree
, va_gc
> *) obj
;
1953 int len
= vec_safe_length (method_vec
);
1957 /* The type conversion ops have to live at the front of the vec, so we
1959 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
1960 vec_safe_iterate (method_vec
, slot
, &fn
);
1962 if (!DECL_CONV_FN_P (OVL_CURRENT (fn
)))
1967 resort_data
.new_value
= new_value
;
1968 resort_data
.cookie
= cookie
;
1969 qsort (method_vec
->address () + slot
, len
- slot
, sizeof (tree
),
1970 resort_method_name_cmp
);
1974 /* Warn about duplicate methods in fn_fields.
1976 Sort methods that are not special (i.e., constructors, destructors,
1977 and type conversion operators) so that we can find them faster in
1981 finish_struct_methods (tree t
)
1984 vec
<tree
, va_gc
> *method_vec
;
1987 method_vec
= CLASSTYPE_METHOD_VEC (t
);
1991 len
= method_vec
->length ();
1993 /* Clear DECL_IN_AGGR_P for all functions. */
1994 for (fn_fields
= TYPE_METHODS (t
); fn_fields
;
1995 fn_fields
= DECL_CHAIN (fn_fields
))
1996 DECL_IN_AGGR_P (fn_fields
) = 0;
1998 /* Issue warnings about private constructors and such. If there are
1999 no methods, then some public defaults are generated. */
2000 maybe_warn_about_overly_private_class (t
);
2002 /* The type conversion ops have to live at the front of the vec, so we
2004 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2005 method_vec
->iterate (slot
, &fn_fields
);
2007 if (!DECL_CONV_FN_P (OVL_CURRENT (fn_fields
)))
2010 qsort (method_vec
->address () + slot
,
2011 len
-slot
, sizeof (tree
), method_name_cmp
);
2014 /* Make BINFO's vtable have N entries, including RTTI entries,
2015 vbase and vcall offsets, etc. Set its type and call the back end
2019 layout_vtable_decl (tree binfo
, int n
)
2024 atype
= build_array_of_n_type (vtable_entry_type
, n
);
2025 layout_type (atype
);
2027 /* We may have to grow the vtable. */
2028 vtable
= get_vtbl_decl_for_binfo (binfo
);
2029 if (!same_type_p (TREE_TYPE (vtable
), atype
))
2031 TREE_TYPE (vtable
) = atype
;
2032 DECL_SIZE (vtable
) = DECL_SIZE_UNIT (vtable
) = NULL_TREE
;
2033 layout_decl (vtable
, 0);
2037 /* True iff FNDECL and BASE_FNDECL (both non-static member functions)
2038 have the same signature. */
2041 same_signature_p (const_tree fndecl
, const_tree base_fndecl
)
2043 /* One destructor overrides another if they are the same kind of
2045 if (DECL_DESTRUCTOR_P (base_fndecl
) && DECL_DESTRUCTOR_P (fndecl
)
2046 && special_function_p (base_fndecl
) == special_function_p (fndecl
))
2048 /* But a non-destructor never overrides a destructor, nor vice
2049 versa, nor do different kinds of destructors override
2050 one-another. For example, a complete object destructor does not
2051 override a deleting destructor. */
2052 if (DECL_DESTRUCTOR_P (base_fndecl
) || DECL_DESTRUCTOR_P (fndecl
))
2055 if (DECL_NAME (fndecl
) == DECL_NAME (base_fndecl
)
2056 || (DECL_CONV_FN_P (fndecl
)
2057 && DECL_CONV_FN_P (base_fndecl
)
2058 && same_type_p (DECL_CONV_FN_TYPE (fndecl
),
2059 DECL_CONV_FN_TYPE (base_fndecl
))))
2061 tree types
, base_types
;
2062 types
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
2063 base_types
= TYPE_ARG_TYPES (TREE_TYPE (base_fndecl
));
2064 if ((cp_type_quals (TREE_TYPE (TREE_VALUE (base_types
)))
2065 == cp_type_quals (TREE_TYPE (TREE_VALUE (types
))))
2066 && compparms (TREE_CHAIN (base_types
), TREE_CHAIN (types
)))
2072 /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a
2076 base_derived_from (tree derived
, tree base
)
2080 for (probe
= base
; probe
; probe
= BINFO_INHERITANCE_CHAIN (probe
))
2082 if (probe
== derived
)
2084 else if (BINFO_VIRTUAL_P (probe
))
2085 /* If we meet a virtual base, we can't follow the inheritance
2086 any more. See if the complete type of DERIVED contains
2087 such a virtual base. */
2088 return (binfo_for_vbase (BINFO_TYPE (probe
), BINFO_TYPE (derived
))
2094 typedef struct find_final_overrider_data_s
{
2095 /* The function for which we are trying to find a final overrider. */
2097 /* The base class in which the function was declared. */
2098 tree declaring_base
;
2099 /* The candidate overriders. */
2101 /* Path to most derived. */
2103 } find_final_overrider_data
;
2105 /* Add the overrider along the current path to FFOD->CANDIDATES.
2106 Returns true if an overrider was found; false otherwise. */
2109 dfs_find_final_overrider_1 (tree binfo
,
2110 find_final_overrider_data
*ffod
,
2115 /* If BINFO is not the most derived type, try a more derived class.
2116 A definition there will overrider a definition here. */
2120 if (dfs_find_final_overrider_1
2121 (ffod
->path
[depth
], ffod
, depth
))
2125 method
= look_for_overrides_here (BINFO_TYPE (binfo
), ffod
->fn
);
2128 tree
*candidate
= &ffod
->candidates
;
2130 /* Remove any candidates overridden by this new function. */
2133 /* If *CANDIDATE overrides METHOD, then METHOD
2134 cannot override anything else on the list. */
2135 if (base_derived_from (TREE_VALUE (*candidate
), binfo
))
2137 /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */
2138 if (base_derived_from (binfo
, TREE_VALUE (*candidate
)))
2139 *candidate
= TREE_CHAIN (*candidate
);
2141 candidate
= &TREE_CHAIN (*candidate
);
2144 /* Add the new function. */
2145 ffod
->candidates
= tree_cons (method
, binfo
, ffod
->candidates
);
2152 /* Called from find_final_overrider via dfs_walk. */
2155 dfs_find_final_overrider_pre (tree binfo
, void *data
)
2157 find_final_overrider_data
*ffod
= (find_final_overrider_data
*) data
;
2159 if (binfo
== ffod
->declaring_base
)
2160 dfs_find_final_overrider_1 (binfo
, ffod
, ffod
->path
.length ());
2161 ffod
->path
.safe_push (binfo
);
2167 dfs_find_final_overrider_post (tree
/*binfo*/, void *data
)
2169 find_final_overrider_data
*ffod
= (find_final_overrider_data
*) data
;
2175 /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for
2176 FN and whose TREE_VALUE is the binfo for the base where the
2177 overriding occurs. BINFO (in the hierarchy dominated by the binfo
2178 DERIVED) is the base object in which FN is declared. */
2181 find_final_overrider (tree derived
, tree binfo
, tree fn
)
2183 find_final_overrider_data ffod
;
2185 /* Getting this right is a little tricky. This is valid:
2187 struct S { virtual void f (); };
2188 struct T { virtual void f (); };
2189 struct U : public S, public T { };
2191 even though calling `f' in `U' is ambiguous. But,
2193 struct R { virtual void f(); };
2194 struct S : virtual public R { virtual void f (); };
2195 struct T : virtual public R { virtual void f (); };
2196 struct U : public S, public T { };
2198 is not -- there's no way to decide whether to put `S::f' or
2199 `T::f' in the vtable for `R'.
2201 The solution is to look at all paths to BINFO. If we find
2202 different overriders along any two, then there is a problem. */
2203 if (DECL_THUNK_P (fn
))
2204 fn
= THUNK_TARGET (fn
);
2206 /* Determine the depth of the hierarchy. */
2208 ffod
.declaring_base
= binfo
;
2209 ffod
.candidates
= NULL_TREE
;
2210 ffod
.path
.create (30);
2212 dfs_walk_all (derived
, dfs_find_final_overrider_pre
,
2213 dfs_find_final_overrider_post
, &ffod
);
2215 ffod
.path
.release ();
2217 /* If there was no winner, issue an error message. */
2218 if (!ffod
.candidates
|| TREE_CHAIN (ffod
.candidates
))
2219 return error_mark_node
;
2221 return ffod
.candidates
;
2224 /* Return the index of the vcall offset for FN when TYPE is used as a
2228 get_vcall_index (tree fn
, tree type
)
2230 vec
<tree_pair_s
, va_gc
> *indices
= CLASSTYPE_VCALL_INDICES (type
);
2234 FOR_EACH_VEC_SAFE_ELT (indices
, ix
, p
)
2235 if ((DECL_DESTRUCTOR_P (fn
) && DECL_DESTRUCTOR_P (p
->purpose
))
2236 || same_signature_p (fn
, p
->purpose
))
2239 /* There should always be an appropriate index. */
2243 /* Update an entry in the vtable for BINFO, which is in the hierarchy
2244 dominated by T. FN is the old function; VIRTUALS points to the
2245 corresponding position in the new BINFO_VIRTUALS list. IX is the index
2246 of that entry in the list. */
2249 update_vtable_entry_for_fn (tree t
, tree binfo
, tree fn
, tree
* virtuals
,
2257 tree overrider_fn
, overrider_target
;
2258 tree target_fn
= DECL_THUNK_P (fn
) ? THUNK_TARGET (fn
) : fn
;
2259 tree over_return
, base_return
;
2262 /* Find the nearest primary base (possibly binfo itself) which defines
2263 this function; this is the class the caller will convert to when
2264 calling FN through BINFO. */
2265 for (b
= binfo
; ; b
= get_primary_binfo (b
))
2268 if (look_for_overrides_here (BINFO_TYPE (b
), target_fn
))
2271 /* The nearest definition is from a lost primary. */
2272 if (BINFO_LOST_PRIMARY_P (b
))
2277 /* Find the final overrider. */
2278 overrider
= find_final_overrider (TYPE_BINFO (t
), b
, target_fn
);
2279 if (overrider
== error_mark_node
)
2281 error ("no unique final overrider for %qD in %qT", target_fn
, t
);
2284 overrider_target
= overrider_fn
= TREE_PURPOSE (overrider
);
2286 /* Check for adjusting covariant return types. */
2287 over_return
= TREE_TYPE (TREE_TYPE (overrider_target
));
2288 base_return
= TREE_TYPE (TREE_TYPE (target_fn
));
2290 if (POINTER_TYPE_P (over_return
)
2291 && TREE_CODE (over_return
) == TREE_CODE (base_return
)
2292 && CLASS_TYPE_P (TREE_TYPE (over_return
))
2293 && CLASS_TYPE_P (TREE_TYPE (base_return
))
2294 /* If the overrider is invalid, don't even try. */
2295 && !DECL_INVALID_OVERRIDER_P (overrider_target
))
2297 /* If FN is a covariant thunk, we must figure out the adjustment
2298 to the final base FN was converting to. As OVERRIDER_TARGET might
2299 also be converting to the return type of FN, we have to
2300 combine the two conversions here. */
2301 tree fixed_offset
, virtual_offset
;
2303 over_return
= TREE_TYPE (over_return
);
2304 base_return
= TREE_TYPE (base_return
);
2306 if (DECL_THUNK_P (fn
))
2308 gcc_assert (DECL_RESULT_THUNK_P (fn
));
2309 fixed_offset
= ssize_int (THUNK_FIXED_OFFSET (fn
));
2310 virtual_offset
= THUNK_VIRTUAL_OFFSET (fn
);
2313 fixed_offset
= virtual_offset
= NULL_TREE
;
2316 /* Find the equivalent binfo within the return type of the
2317 overriding function. We will want the vbase offset from
2319 virtual_offset
= binfo_for_vbase (BINFO_TYPE (virtual_offset
),
2321 else if (!same_type_ignoring_top_level_qualifiers_p
2322 (over_return
, base_return
))
2324 /* There was no existing virtual thunk (which takes
2325 precedence). So find the binfo of the base function's
2326 return type within the overriding function's return type.
2327 We cannot call lookup base here, because we're inside a
2328 dfs_walk, and will therefore clobber the BINFO_MARKED
2329 flags. Fortunately we know the covariancy is valid (it
2330 has already been checked), so we can just iterate along
2331 the binfos, which have been chained in inheritance graph
2332 order. Of course it is lame that we have to repeat the
2333 search here anyway -- we should really be caching pieces
2334 of the vtable and avoiding this repeated work. */
2335 tree thunk_binfo
, base_binfo
;
2337 /* Find the base binfo within the overriding function's
2338 return type. We will always find a thunk_binfo, except
2339 when the covariancy is invalid (which we will have
2340 already diagnosed). */
2341 for (base_binfo
= TYPE_BINFO (base_return
),
2342 thunk_binfo
= TYPE_BINFO (over_return
);
2344 thunk_binfo
= TREE_CHAIN (thunk_binfo
))
2345 if (SAME_BINFO_TYPE_P (BINFO_TYPE (thunk_binfo
),
2346 BINFO_TYPE (base_binfo
)))
2349 /* See if virtual inheritance is involved. */
2350 for (virtual_offset
= thunk_binfo
;
2352 virtual_offset
= BINFO_INHERITANCE_CHAIN (virtual_offset
))
2353 if (BINFO_VIRTUAL_P (virtual_offset
))
2357 || (thunk_binfo
&& !BINFO_OFFSET_ZEROP (thunk_binfo
)))
2359 tree offset
= convert (ssizetype
, BINFO_OFFSET (thunk_binfo
));
2363 /* We convert via virtual base. Adjust the fixed
2364 offset to be from there. */
2366 size_diffop (offset
,
2368 BINFO_OFFSET (virtual_offset
)));
2371 /* There was an existing fixed offset, this must be
2372 from the base just converted to, and the base the
2373 FN was thunking to. */
2374 fixed_offset
= size_binop (PLUS_EXPR
, fixed_offset
, offset
);
2376 fixed_offset
= offset
;
2380 if (fixed_offset
|| virtual_offset
)
2381 /* Replace the overriding function with a covariant thunk. We
2382 will emit the overriding function in its own slot as
2384 overrider_fn
= make_thunk (overrider_target
, /*this_adjusting=*/0,
2385 fixed_offset
, virtual_offset
);
2388 gcc_assert (DECL_INVALID_OVERRIDER_P (overrider_target
) ||
2389 !DECL_THUNK_P (fn
));
2391 /* If we need a covariant thunk, then we may need to adjust first_defn.
2392 The ABI specifies that the thunks emitted with a function are
2393 determined by which bases the function overrides, so we need to be
2394 sure that we're using a thunk for some overridden base; even if we
2395 know that the necessary this adjustment is zero, there may not be an
2396 appropriate zero-this-adjusment thunk for us to use since thunks for
2397 overriding virtual bases always use the vcall offset.
2399 Furthermore, just choosing any base that overrides this function isn't
2400 quite right, as this slot won't be used for calls through a type that
2401 puts a covariant thunk here. Calling the function through such a type
2402 will use a different slot, and that slot is the one that determines
2403 the thunk emitted for that base.
2405 So, keep looking until we find the base that we're really overriding
2406 in this slot: the nearest primary base that doesn't use a covariant
2407 thunk in this slot. */
2408 if (overrider_target
!= overrider_fn
)
2410 if (BINFO_TYPE (b
) == DECL_CONTEXT (overrider_target
))
2411 /* We already know that the overrider needs a covariant thunk. */
2412 b
= get_primary_binfo (b
);
2413 for (; ; b
= get_primary_binfo (b
))
2415 tree main_binfo
= TYPE_BINFO (BINFO_TYPE (b
));
2416 tree bv
= chain_index (ix
, BINFO_VIRTUALS (main_binfo
));
2417 if (!DECL_THUNK_P (TREE_VALUE (bv
)))
2419 if (BINFO_LOST_PRIMARY_P (b
))
2425 /* Assume that we will produce a thunk that convert all the way to
2426 the final overrider, and not to an intermediate virtual base. */
2427 virtual_base
= NULL_TREE
;
2429 /* See if we can convert to an intermediate virtual base first, and then
2430 use the vcall offset located there to finish the conversion. */
2431 for (; b
; b
= BINFO_INHERITANCE_CHAIN (b
))
2433 /* If we find the final overrider, then we can stop
2435 if (SAME_BINFO_TYPE_P (BINFO_TYPE (b
),
2436 BINFO_TYPE (TREE_VALUE (overrider
))))
2439 /* If we find a virtual base, and we haven't yet found the
2440 overrider, then there is a virtual base between the
2441 declaring base (first_defn) and the final overrider. */
2442 if (BINFO_VIRTUAL_P (b
))
2449 /* Compute the constant adjustment to the `this' pointer. The
2450 `this' pointer, when this function is called, will point at BINFO
2451 (or one of its primary bases, which are at the same offset). */
2453 /* The `this' pointer needs to be adjusted from the declaration to
2454 the nearest virtual base. */
2455 delta
= size_diffop_loc (input_location
,
2456 convert (ssizetype
, BINFO_OFFSET (virtual_base
)),
2457 convert (ssizetype
, BINFO_OFFSET (first_defn
)));
2459 /* If the nearest definition is in a lost primary, we don't need an
2460 entry in our vtable. Except possibly in a constructor vtable,
2461 if we happen to get our primary back. In that case, the offset
2462 will be zero, as it will be a primary base. */
2463 delta
= size_zero_node
;
2465 /* The `this' pointer needs to be adjusted from pointing to
2466 BINFO to pointing at the base where the final overrider
2468 delta
= size_diffop_loc (input_location
,
2470 BINFO_OFFSET (TREE_VALUE (overrider
))),
2471 convert (ssizetype
, BINFO_OFFSET (binfo
)));
2473 modify_vtable_entry (t
, binfo
, overrider_fn
, delta
, virtuals
);
2476 BV_VCALL_INDEX (*virtuals
)
2477 = get_vcall_index (overrider_target
, BINFO_TYPE (virtual_base
));
2479 BV_VCALL_INDEX (*virtuals
) = NULL_TREE
;
2481 BV_LOST_PRIMARY (*virtuals
) = lost
;
2484 /* Called from modify_all_vtables via dfs_walk. */
2487 dfs_modify_vtables (tree binfo
, void* data
)
2489 tree t
= (tree
) data
;
2494 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
2495 /* A base without a vtable needs no modification, and its bases
2496 are uninteresting. */
2497 return dfs_skip_bases
;
2499 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
)
2500 && !CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
2501 /* Don't do the primary vtable, if it's new. */
2504 if (BINFO_PRIMARY_P (binfo
) && !BINFO_VIRTUAL_P (binfo
))
2505 /* There's no need to modify the vtable for a non-virtual primary
2506 base; we're not going to use that vtable anyhow. We do still
2507 need to do this for virtual primary bases, as they could become
2508 non-primary in a construction vtable. */
2511 make_new_vtable (t
, binfo
);
2513 /* Now, go through each of the virtual functions in the virtual
2514 function table for BINFO. Find the final overrider, and update
2515 the BINFO_VIRTUALS list appropriately. */
2516 for (ix
= 0, virtuals
= BINFO_VIRTUALS (binfo
),
2517 old_virtuals
= BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo
)));
2519 ix
++, virtuals
= TREE_CHAIN (virtuals
),
2520 old_virtuals
= TREE_CHAIN (old_virtuals
))
2521 update_vtable_entry_for_fn (t
,
2523 BV_FN (old_virtuals
),
2529 /* Update all of the primary and secondary vtables for T. Create new
2530 vtables as required, and initialize their RTTI information. Each
2531 of the functions in VIRTUALS is declared in T and may override a
2532 virtual function from a base class; find and modify the appropriate
2533 entries to point to the overriding functions. Returns a list, in
2534 declaration order, of the virtual functions that are declared in T,
2535 but do not appear in the primary base class vtable, and which
2536 should therefore be appended to the end of the vtable for T. */
2539 modify_all_vtables (tree t
, tree virtuals
)
2541 tree binfo
= TYPE_BINFO (t
);
2544 /* Mangle the vtable name before entering dfs_walk (c++/51884). */
2545 if (TYPE_CONTAINS_VPTR_P (t
))
2546 get_vtable_decl (t
, false);
2548 /* Update all of the vtables. */
2549 dfs_walk_once (binfo
, dfs_modify_vtables
, NULL
, t
);
2551 /* Add virtual functions not already in our primary vtable. These
2552 will be both those introduced by this class, and those overridden
2553 from secondary bases. It does not include virtuals merely
2554 inherited from secondary bases. */
2555 for (fnsp
= &virtuals
; *fnsp
; )
2557 tree fn
= TREE_VALUE (*fnsp
);
2559 if (!value_member (fn
, BINFO_VIRTUALS (binfo
))
2560 || DECL_VINDEX (fn
) == error_mark_node
)
2562 /* We don't need to adjust the `this' pointer when
2563 calling this function. */
2564 BV_DELTA (*fnsp
) = integer_zero_node
;
2565 BV_VCALL_INDEX (*fnsp
) = NULL_TREE
;
2567 /* This is a function not already in our vtable. Keep it. */
2568 fnsp
= &TREE_CHAIN (*fnsp
);
2571 /* We've already got an entry for this function. Skip it. */
2572 *fnsp
= TREE_CHAIN (*fnsp
);
2578 /* Get the base virtual function declarations in T that have the
2582 get_basefndecls (tree name
, tree t
)
2585 tree base_fndecls
= NULL_TREE
;
2586 int n_baseclasses
= BINFO_N_BASE_BINFOS (TYPE_BINFO (t
));
2589 /* Find virtual functions in T with the indicated NAME. */
2590 i
= lookup_fnfields_1 (t
, name
);
2592 for (methods
= (*CLASSTYPE_METHOD_VEC (t
))[i
];
2594 methods
= OVL_NEXT (methods
))
2596 tree method
= OVL_CURRENT (methods
);
2598 if (TREE_CODE (method
) == FUNCTION_DECL
2599 && DECL_VINDEX (method
))
2600 base_fndecls
= tree_cons (NULL_TREE
, method
, base_fndecls
);
2604 return base_fndecls
;
2606 for (i
= 0; i
< n_baseclasses
; i
++)
2608 tree basetype
= BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (t
), i
));
2609 base_fndecls
= chainon (get_basefndecls (name
, basetype
),
2613 return base_fndecls
;
2616 /* If this declaration supersedes the declaration of
2617 a method declared virtual in the base class, then
2618 mark this field as being virtual as well. */
2621 check_for_override (tree decl
, tree ctype
)
2623 bool overrides_found
= false;
2624 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2625 /* In [temp.mem] we have:
2627 A specialization of a member function template does not
2628 override a virtual function from a base class. */
2630 if ((DECL_DESTRUCTOR_P (decl
)
2631 || IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
))
2632 || DECL_CONV_FN_P (decl
))
2633 && look_for_overrides (ctype
, decl
)
2634 && !DECL_STATIC_FUNCTION_P (decl
))
2635 /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor
2636 the error_mark_node so that we know it is an overriding
2639 DECL_VINDEX (decl
) = decl
;
2640 overrides_found
= true;
2643 if (DECL_VIRTUAL_P (decl
))
2645 if (!DECL_VINDEX (decl
))
2646 DECL_VINDEX (decl
) = error_mark_node
;
2647 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
2648 if (DECL_DESTRUCTOR_P (decl
))
2649 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (ctype
) = true;
2651 else if (DECL_FINAL_P (decl
))
2652 error ("%q+#D marked final, but is not virtual", decl
);
2653 if (DECL_OVERRIDE_P (decl
) && !overrides_found
)
2654 error ("%q+#D marked override, but does not override", decl
);
2657 /* Warn about hidden virtual functions that are not overridden in t.
2658 We know that constructors and destructors don't apply. */
2661 warn_hidden (tree t
)
2663 vec
<tree
, va_gc
> *method_vec
= CLASSTYPE_METHOD_VEC (t
);
2667 /* We go through each separately named virtual function. */
2668 for (i
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2669 vec_safe_iterate (method_vec
, i
, &fns
);
2680 /* All functions in this slot in the CLASSTYPE_METHOD_VEC will
2681 have the same name. Figure out what name that is. */
2682 name
= DECL_NAME (OVL_CURRENT (fns
));
2683 /* There are no possibly hidden functions yet. */
2684 base_fndecls
= NULL_TREE
;
2685 /* Iterate through all of the base classes looking for possibly
2686 hidden functions. */
2687 for (binfo
= TYPE_BINFO (t
), j
= 0;
2688 BINFO_BASE_ITERATE (binfo
, j
, base_binfo
); j
++)
2690 tree basetype
= BINFO_TYPE (base_binfo
);
2691 base_fndecls
= chainon (get_basefndecls (name
, basetype
),
2695 /* If there are no functions to hide, continue. */
2699 /* Remove any overridden functions. */
2700 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
2702 fndecl
= OVL_CURRENT (fn
);
2703 if (DECL_VINDEX (fndecl
))
2705 tree
*prev
= &base_fndecls
;
2708 /* If the method from the base class has the same
2709 signature as the method from the derived class, it
2710 has been overridden. */
2711 if (same_signature_p (fndecl
, TREE_VALUE (*prev
)))
2712 *prev
= TREE_CHAIN (*prev
);
2714 prev
= &TREE_CHAIN (*prev
);
2718 /* Now give a warning for all base functions without overriders,
2719 as they are hidden. */
2720 while (base_fndecls
)
2722 /* Here we know it is a hider, and no overrider exists. */
2723 warning (OPT_Woverloaded_virtual
, "%q+D was hidden", TREE_VALUE (base_fndecls
));
2724 warning (OPT_Woverloaded_virtual
, " by %q+D", fns
);
2725 base_fndecls
= TREE_CHAIN (base_fndecls
);
2730 /* Check for things that are invalid. There are probably plenty of other
2731 things we should check for also. */
2734 finish_struct_anon (tree t
)
2738 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
2740 if (TREE_STATIC (field
))
2742 if (TREE_CODE (field
) != FIELD_DECL
)
2745 if (DECL_NAME (field
) == NULL_TREE
2746 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2748 bool is_union
= TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
;
2749 tree elt
= TYPE_FIELDS (TREE_TYPE (field
));
2750 for (; elt
; elt
= DECL_CHAIN (elt
))
2752 /* We're generally only interested in entities the user
2753 declared, but we also find nested classes by noticing
2754 the TYPE_DECL that we create implicitly. You're
2755 allowed to put one anonymous union inside another,
2756 though, so we explicitly tolerate that. We use
2757 TYPE_ANONYMOUS_P rather than ANON_AGGR_TYPE_P so that
2758 we also allow unnamed types used for defining fields. */
2759 if (DECL_ARTIFICIAL (elt
)
2760 && (!DECL_IMPLICIT_TYPEDEF_P (elt
)
2761 || TYPE_ANONYMOUS_P (TREE_TYPE (elt
))))
2764 if (TREE_CODE (elt
) != FIELD_DECL
)
2767 permerror (input_location
, "%q+#D invalid; an anonymous union can "
2768 "only have non-static data members", elt
);
2770 permerror (input_location
, "%q+#D invalid; an anonymous struct can "
2771 "only have non-static data members", elt
);
2775 if (TREE_PRIVATE (elt
))
2778 permerror (input_location
, "private member %q+#D in anonymous union", elt
);
2780 permerror (input_location
, "private member %q+#D in anonymous struct", elt
);
2782 else if (TREE_PROTECTED (elt
))
2785 permerror (input_location
, "protected member %q+#D in anonymous union", elt
);
2787 permerror (input_location
, "protected member %q+#D in anonymous struct", elt
);
2790 TREE_PRIVATE (elt
) = TREE_PRIVATE (field
);
2791 TREE_PROTECTED (elt
) = TREE_PROTECTED (field
);
2797 /* Add T to CLASSTYPE_DECL_LIST of current_class_type which
2798 will be used later during class template instantiation.
2799 When FRIEND_P is zero, T can be a static member data (VAR_DECL),
2800 a non-static member data (FIELD_DECL), a member function
2801 (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE),
2802 a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL)
2803 When FRIEND_P is nonzero, T is either a friend class
2804 (RECORD_TYPE, TEMPLATE_DECL) or a friend function
2805 (FUNCTION_DECL, TEMPLATE_DECL). */
2808 maybe_add_class_template_decl_list (tree type
, tree t
, int friend_p
)
2810 /* Save some memory by not creating TREE_LIST if TYPE is not template. */
2811 if (CLASSTYPE_TEMPLATE_INFO (type
))
2812 CLASSTYPE_DECL_LIST (type
)
2813 = tree_cons (friend_p
? NULL_TREE
: type
,
2814 t
, CLASSTYPE_DECL_LIST (type
));
2817 /* This function is called from declare_virt_assop_and_dtor via
2820 DATA is a type that direcly or indirectly inherits the base
2821 represented by BINFO. If BINFO contains a virtual assignment [copy
2822 assignment or move assigment] operator or a virtual constructor,
2823 declare that function in DATA if it hasn't been already declared. */
2826 dfs_declare_virt_assop_and_dtor (tree binfo
, void *data
)
2828 tree bv
, fn
, t
= (tree
)data
;
2829 tree opname
= ansi_assopname (NOP_EXPR
);
2831 gcc_assert (t
&& CLASS_TYPE_P (t
));
2832 gcc_assert (binfo
&& TREE_CODE (binfo
) == TREE_BINFO
);
2834 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
2835 /* A base without a vtable needs no modification, and its bases
2836 are uninteresting. */
2837 return dfs_skip_bases
;
2839 if (BINFO_PRIMARY_P (binfo
))
2840 /* If this is a primary base, then we have already looked at the
2841 virtual functions of its vtable. */
2844 for (bv
= BINFO_VIRTUALS (binfo
); bv
; bv
= TREE_CHAIN (bv
))
2848 if (DECL_NAME (fn
) == opname
)
2850 if (CLASSTYPE_LAZY_COPY_ASSIGN (t
))
2851 lazily_declare_fn (sfk_copy_assignment
, t
);
2852 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
2853 lazily_declare_fn (sfk_move_assignment
, t
);
2855 else if (DECL_DESTRUCTOR_P (fn
)
2856 && CLASSTYPE_LAZY_DESTRUCTOR (t
))
2857 lazily_declare_fn (sfk_destructor
, t
);
2863 /* If the class type T has a direct or indirect base that contains a
2864 virtual assignment operator or a virtual destructor, declare that
2865 function in T if it hasn't been already declared. */
2868 declare_virt_assop_and_dtor (tree t
)
2870 if (!(TYPE_POLYMORPHIC_P (t
)
2871 && (CLASSTYPE_LAZY_COPY_ASSIGN (t
)
2872 || CLASSTYPE_LAZY_MOVE_ASSIGN (t
)
2873 || CLASSTYPE_LAZY_DESTRUCTOR (t
))))
2876 dfs_walk_all (TYPE_BINFO (t
),
2877 dfs_declare_virt_assop_and_dtor
,
2881 /* Declare the inheriting constructor for class T inherited from base
2882 constructor CTOR with the parameter array PARMS of size NPARMS. */
2885 one_inheriting_sig (tree t
, tree ctor
, tree
*parms
, int nparms
)
2887 /* We don't declare an inheriting ctor that would be a default,
2888 copy or move ctor for derived or base. */
2892 && TREE_CODE (parms
[0]) == REFERENCE_TYPE
)
2894 tree parm
= TYPE_MAIN_VARIANT (TREE_TYPE (parms
[0]));
2895 if (parm
== t
|| parm
== DECL_CONTEXT (ctor
))
2899 tree parmlist
= void_list_node
;
2900 for (int i
= nparms
- 1; i
>= 0; i
--)
2901 parmlist
= tree_cons (NULL_TREE
, parms
[i
], parmlist
);
2902 tree fn
= implicitly_declare_fn (sfk_inheriting_constructor
,
2903 t
, false, ctor
, parmlist
);
2904 if (add_method (t
, fn
, NULL_TREE
))
2906 DECL_CHAIN (fn
) = TYPE_METHODS (t
);
2907 TYPE_METHODS (t
) = fn
;
2911 /* Declare all the inheriting constructors for class T inherited from base
2912 constructor CTOR. */
2915 one_inherited_ctor (tree ctor
, tree t
)
2917 tree parms
= FUNCTION_FIRST_USER_PARMTYPE (ctor
);
2919 tree
*new_parms
= XALLOCAVEC (tree
, list_length (parms
));
2921 for (; parms
&& parms
!= void_list_node
; parms
= TREE_CHAIN (parms
))
2923 if (TREE_PURPOSE (parms
))
2924 one_inheriting_sig (t
, ctor
, new_parms
, i
);
2925 new_parms
[i
++] = TREE_VALUE (parms
);
2927 one_inheriting_sig (t
, ctor
, new_parms
, i
);
2928 if (parms
== NULL_TREE
)
2930 warning (OPT_Winherited_variadic_ctor
,
2931 "the ellipsis in %qD is not inherited", ctor
);
2932 inform (DECL_SOURCE_LOCATION (ctor
), "%qD declared here", ctor
);
2936 /* Create default constructors, assignment operators, and so forth for
2937 the type indicated by T, if they are needed. CANT_HAVE_CONST_CTOR,
2938 and CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason,
2939 the class cannot have a default constructor, copy constructor
2940 taking a const reference argument, or an assignment operator taking
2941 a const reference, respectively. */
2944 add_implicitly_declared_members (tree t
, tree
* access_decls
,
2945 int cant_have_const_cctor
,
2946 int cant_have_const_assignment
)
2948 bool move_ok
= false;
2950 if (cxx_dialect
>= cxx0x
&& !CLASSTYPE_DESTRUCTORS (t
)
2951 && !TYPE_HAS_COPY_CTOR (t
) && !TYPE_HAS_COPY_ASSIGN (t
)
2952 && !type_has_move_constructor (t
) && !type_has_move_assign (t
))
2956 if (!CLASSTYPE_DESTRUCTORS (t
))
2958 /* In general, we create destructors lazily. */
2959 CLASSTYPE_LAZY_DESTRUCTOR (t
) = 1;
2961 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
2962 && TYPE_FOR_JAVA (t
))
2963 /* But if this is a Java class, any non-trivial destructor is
2964 invalid, even if compiler-generated. Therefore, if the
2965 destructor is non-trivial we create it now. */
2966 lazily_declare_fn (sfk_destructor
, t
);
2971 If there is no user-declared constructor for a class, a default
2972 constructor is implicitly declared. */
2973 if (! TYPE_HAS_USER_CONSTRUCTOR (t
))
2975 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 1;
2976 CLASSTYPE_LAZY_DEFAULT_CTOR (t
) = 1;
2977 if (cxx_dialect
>= cxx0x
)
2978 TYPE_HAS_CONSTEXPR_CTOR (t
)
2979 /* This might force the declaration. */
2980 = type_has_constexpr_default_constructor (t
);
2985 If a class definition does not explicitly declare a copy
2986 constructor, one is declared implicitly. */
2987 if (! TYPE_HAS_COPY_CTOR (t
) && ! TYPE_FOR_JAVA (t
))
2989 TYPE_HAS_COPY_CTOR (t
) = 1;
2990 TYPE_HAS_CONST_COPY_CTOR (t
) = !cant_have_const_cctor
;
2991 CLASSTYPE_LAZY_COPY_CTOR (t
) = 1;
2993 CLASSTYPE_LAZY_MOVE_CTOR (t
) = 1;
2996 /* If there is no assignment operator, one will be created if and
2997 when it is needed. For now, just record whether or not the type
2998 of the parameter to the assignment operator will be a const or
2999 non-const reference. */
3000 if (!TYPE_HAS_COPY_ASSIGN (t
) && !TYPE_FOR_JAVA (t
))
3002 TYPE_HAS_COPY_ASSIGN (t
) = 1;
3003 TYPE_HAS_CONST_COPY_ASSIGN (t
) = !cant_have_const_assignment
;
3004 CLASSTYPE_LAZY_COPY_ASSIGN (t
) = 1;
3006 CLASSTYPE_LAZY_MOVE_ASSIGN (t
) = 1;
3009 /* We can't be lazy about declaring functions that might override
3010 a virtual function from a base class. */
3011 declare_virt_assop_and_dtor (t
);
3013 while (*access_decls
)
3015 tree using_decl
= TREE_VALUE (*access_decls
);
3016 tree decl
= USING_DECL_DECLS (using_decl
);
3017 if (DECL_NAME (using_decl
) == ctor_identifier
)
3019 /* declare, then remove the decl */
3020 tree ctor_list
= decl
;
3021 location_t loc
= input_location
;
3022 input_location
= DECL_SOURCE_LOCATION (using_decl
);
3024 for (; ctor_list
; ctor_list
= OVL_NEXT (ctor_list
))
3025 one_inherited_ctor (OVL_CURRENT (ctor_list
), t
);
3026 *access_decls
= TREE_CHAIN (*access_decls
);
3027 input_location
= loc
;
3030 access_decls
= &TREE_CHAIN (*access_decls
);
3034 /* Subroutine of insert_into_classtype_sorted_fields. Recursively
3035 count the number of fields in TYPE, including anonymous union
3039 count_fields (tree fields
)
3043 for (x
= fields
; x
; x
= DECL_CHAIN (x
))
3045 if (TREE_CODE (x
) == FIELD_DECL
&& ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
3046 n_fields
+= count_fields (TYPE_FIELDS (TREE_TYPE (x
)));
3053 /* Subroutine of insert_into_classtype_sorted_fields. Recursively add
3054 all the fields in the TREE_LIST FIELDS to the SORTED_FIELDS_TYPE
3055 elts, starting at offset IDX. */
3058 add_fields_to_record_type (tree fields
, struct sorted_fields_type
*field_vec
, int idx
)
3061 for (x
= fields
; x
; x
= DECL_CHAIN (x
))
3063 if (TREE_CODE (x
) == FIELD_DECL
&& ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
3064 idx
= add_fields_to_record_type (TYPE_FIELDS (TREE_TYPE (x
)), field_vec
, idx
);
3066 field_vec
->elts
[idx
++] = x
;
3071 /* Add all of the enum values of ENUMTYPE, to the FIELD_VEC elts,
3072 starting at offset IDX. */
3075 add_enum_fields_to_record_type (tree enumtype
,
3076 struct sorted_fields_type
*field_vec
,
3080 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
3081 field_vec
->elts
[idx
++] = TREE_VALUE (values
);
3085 /* FIELD is a bit-field. We are finishing the processing for its
3086 enclosing type. Issue any appropriate messages and set appropriate
3087 flags. Returns false if an error has been diagnosed. */
3090 check_bitfield_decl (tree field
)
3092 tree type
= TREE_TYPE (field
);
3095 /* Extract the declared width of the bitfield, which has been
3096 temporarily stashed in DECL_INITIAL. */
3097 w
= DECL_INITIAL (field
);
3098 gcc_assert (w
!= NULL_TREE
);
3099 /* Remove the bit-field width indicator so that the rest of the
3100 compiler does not treat that value as an initializer. */
3101 DECL_INITIAL (field
) = NULL_TREE
;
3103 /* Detect invalid bit-field type. */
3104 if (!INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
3106 error ("bit-field %q+#D with non-integral type", field
);
3107 w
= error_mark_node
;
3111 location_t loc
= input_location
;
3112 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
3115 /* detect invalid field size. */
3116 input_location
= DECL_SOURCE_LOCATION (field
);
3117 w
= cxx_constant_value (w
);
3118 input_location
= loc
;
3120 if (TREE_CODE (w
) != INTEGER_CST
)
3122 error ("bit-field %q+D width not an integer constant", field
);
3123 w
= error_mark_node
;
3125 else if (tree_int_cst_sgn (w
) < 0)
3127 error ("negative width in bit-field %q+D", field
);
3128 w
= error_mark_node
;
3130 else if (integer_zerop (w
) && DECL_NAME (field
) != 0)
3132 error ("zero width for bit-field %q+D", field
);
3133 w
= error_mark_node
;
3135 else if (compare_tree_int (w
, TYPE_PRECISION (type
)) > 0
3136 && TREE_CODE (type
) != ENUMERAL_TYPE
3137 && TREE_CODE (type
) != BOOLEAN_TYPE
)
3138 warning (0, "width of %q+D exceeds its type", field
);
3139 else if (TREE_CODE (type
) == ENUMERAL_TYPE
3140 && (0 > (compare_tree_int
3141 (w
, TYPE_PRECISION (ENUM_UNDERLYING_TYPE (type
))))))
3142 warning (0, "%q+D is too small to hold all values of %q#T", field
, type
);
3145 if (w
!= error_mark_node
)
3147 DECL_SIZE (field
) = convert (bitsizetype
, w
);
3148 DECL_BIT_FIELD (field
) = 1;
3153 /* Non-bit-fields are aligned for their type. */
3154 DECL_BIT_FIELD (field
) = 0;
3155 CLEAR_DECL_C_BIT_FIELD (field
);
3160 /* FIELD is a non bit-field. We are finishing the processing for its
3161 enclosing type T. Issue any appropriate messages and set appropriate
3165 check_field_decl (tree field
,
3167 int* cant_have_const_ctor
,
3168 int* no_const_asn_ref
,
3169 int* any_default_members
)
3171 tree type
= strip_array_types (TREE_TYPE (field
));
3173 /* In C++98 an anonymous union cannot contain any fields which would change
3174 the settings of CANT_HAVE_CONST_CTOR and friends. */
3175 if (ANON_UNION_TYPE_P (type
) && cxx_dialect
< cxx0x
)
3177 /* And, we don't set TYPE_HAS_CONST_COPY_CTOR, etc., for anonymous
3178 structs. So, we recurse through their fields here. */
3179 else if (ANON_AGGR_TYPE_P (type
))
3183 for (fields
= TYPE_FIELDS (type
); fields
; fields
= DECL_CHAIN (fields
))
3184 if (TREE_CODE (fields
) == FIELD_DECL
&& !DECL_C_BIT_FIELD (field
))
3185 check_field_decl (fields
, t
, cant_have_const_ctor
,
3186 no_const_asn_ref
, any_default_members
);
3188 /* Check members with class type for constructors, destructors,
3190 else if (CLASS_TYPE_P (type
))
3192 /* Never let anything with uninheritable virtuals
3193 make it through without complaint. */
3194 abstract_virtuals_error (field
, type
);
3196 if (TREE_CODE (t
) == UNION_TYPE
&& cxx_dialect
< cxx0x
)
3199 int oldcount
= errorcount
;
3200 if (TYPE_NEEDS_CONSTRUCTING (type
))
3201 error ("member %q+#D with constructor not allowed in union",
3203 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
3204 error ("member %q+#D with destructor not allowed in union", field
);
3205 if (TYPE_HAS_COMPLEX_COPY_ASSIGN (type
))
3206 error ("member %q+#D with copy assignment operator not allowed in union",
3208 if (!warned
&& errorcount
> oldcount
)
3210 inform (DECL_SOURCE_LOCATION (field
), "unrestricted unions "
3211 "only available with -std=c++11 or -std=gnu++11");
3217 TYPE_NEEDS_CONSTRUCTING (t
) |= TYPE_NEEDS_CONSTRUCTING (type
);
3218 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3219 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
);
3220 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
)
3221 |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (type
)
3222 || !TYPE_HAS_COPY_ASSIGN (type
));
3223 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= (TYPE_HAS_COMPLEX_COPY_CTOR (type
)
3224 || !TYPE_HAS_COPY_CTOR (type
));
3225 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (type
);
3226 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_HAS_COMPLEX_MOVE_CTOR (type
);
3227 TYPE_HAS_COMPLEX_DFLT (t
) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (type
)
3228 || TYPE_HAS_COMPLEX_DFLT (type
));
3231 if (TYPE_HAS_COPY_CTOR (type
)
3232 && !TYPE_HAS_CONST_COPY_CTOR (type
))
3233 *cant_have_const_ctor
= 1;
3235 if (TYPE_HAS_COPY_ASSIGN (type
)
3236 && !TYPE_HAS_CONST_COPY_ASSIGN (type
))
3237 *no_const_asn_ref
= 1;
3240 check_abi_tags (t
, field
);
3242 if (DECL_INITIAL (field
) != NULL_TREE
)
3244 /* `build_class_init_list' does not recognize
3246 if (TREE_CODE (t
) == UNION_TYPE
&& *any_default_members
!= 0)
3247 error ("multiple fields in union %qT initialized", t
);
3248 *any_default_members
= 1;
3252 /* Check the data members (both static and non-static), class-scoped
3253 typedefs, etc., appearing in the declaration of T. Issue
3254 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
3255 declaration order) of access declarations; each TREE_VALUE in this
3256 list is a USING_DECL.
3258 In addition, set the following flags:
3261 The class is empty, i.e., contains no non-static data members.
3263 CANT_HAVE_CONST_CTOR_P
3264 This class cannot have an implicitly generated copy constructor
3265 taking a const reference.
3267 CANT_HAVE_CONST_ASN_REF
3268 This class cannot have an implicitly generated assignment
3269 operator taking a const reference.
3271 All of these flags should be initialized before calling this
3274 Returns a pointer to the end of the TYPE_FIELDs chain; additional
3275 fields can be added by adding to this chain. */
3278 check_field_decls (tree t
, tree
*access_decls
,
3279 int *cant_have_const_ctor_p
,
3280 int *no_const_asn_ref_p
)
3285 int any_default_members
;
3287 int field_access
= -1;
3289 /* Assume there are no access declarations. */
3290 *access_decls
= NULL_TREE
;
3291 /* Assume this class has no pointer members. */
3292 has_pointers
= false;
3293 /* Assume none of the members of this class have default
3295 any_default_members
= 0;
3297 for (field
= &TYPE_FIELDS (t
); *field
; field
= next
)
3300 tree type
= TREE_TYPE (x
);
3301 int this_field_access
;
3303 next
= &DECL_CHAIN (x
);
3305 if (TREE_CODE (x
) == USING_DECL
)
3307 /* Save the access declarations for our caller. */
3308 *access_decls
= tree_cons (NULL_TREE
, x
, *access_decls
);
3312 if (TREE_CODE (x
) == TYPE_DECL
3313 || TREE_CODE (x
) == TEMPLATE_DECL
)
3316 /* If we've gotten this far, it's a data member, possibly static,
3317 or an enumerator. */
3318 if (TREE_CODE (x
) != CONST_DECL
)
3319 DECL_CONTEXT (x
) = t
;
3321 /* When this goes into scope, it will be a non-local reference. */
3322 DECL_NONLOCAL (x
) = 1;
3324 if (TREE_CODE (t
) == UNION_TYPE
)
3328 If a union contains a static data member, or a member of
3329 reference type, the program is ill-formed. */
3330 if (TREE_CODE (x
) == VAR_DECL
)
3332 error ("%q+D may not be static because it is a member of a union", x
);
3335 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3337 error ("%q+D may not have reference type %qT because"
3338 " it is a member of a union",
3344 /* Perform error checking that did not get done in
3346 if (TREE_CODE (type
) == FUNCTION_TYPE
)
3348 error ("field %q+D invalidly declared function type", x
);
3349 type
= build_pointer_type (type
);
3350 TREE_TYPE (x
) = type
;
3352 else if (TREE_CODE (type
) == METHOD_TYPE
)
3354 error ("field %q+D invalidly declared method type", x
);
3355 type
= build_pointer_type (type
);
3356 TREE_TYPE (x
) = type
;
3359 if (type
== error_mark_node
)
3362 if (TREE_CODE (x
) == CONST_DECL
|| TREE_CODE (x
) == VAR_DECL
)
3365 /* Now it can only be a FIELD_DECL. */
3367 if (TREE_PRIVATE (x
) || TREE_PROTECTED (x
))
3368 CLASSTYPE_NON_AGGREGATE (t
) = 1;
3370 /* If at least one non-static data member is non-literal, the whole
3371 class becomes non-literal. Note: if the type is incomplete we
3372 will complain later on. */
3373 if (COMPLETE_TYPE_P (type
) && !literal_type_p (type
))
3374 CLASSTYPE_LITERAL_P (t
) = false;
3376 /* A standard-layout class is a class that:
3378 has the same access control (Clause 11) for all non-static data members,
3380 this_field_access
= TREE_PROTECTED (x
) ? 1 : TREE_PRIVATE (x
) ? 2 : 0;
3381 if (field_access
== -1)
3382 field_access
= this_field_access
;
3383 else if (this_field_access
!= field_access
)
3384 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3386 /* If this is of reference type, check if it needs an init. */
3387 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3389 CLASSTYPE_NON_LAYOUT_POD_P (t
) = 1;
3390 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3391 if (DECL_INITIAL (x
) == NULL_TREE
)
3392 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t
, 1);
3394 /* ARM $12.6.2: [A member initializer list] (or, for an
3395 aggregate, initialization by a brace-enclosed list) is the
3396 only way to initialize nonstatic const and reference
3398 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
3399 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) = 1;
3402 type
= strip_array_types (type
);
3404 if (TYPE_PACKED (t
))
3406 if (!layout_pod_type_p (type
) && !TYPE_PACKED (type
))
3410 "ignoring packed attribute because of unpacked non-POD field %q+#D",
3414 else if (DECL_C_BIT_FIELD (x
)
3415 || TYPE_ALIGN (TREE_TYPE (x
)) > BITS_PER_UNIT
)
3416 DECL_PACKED (x
) = 1;
3419 if (DECL_C_BIT_FIELD (x
) && integer_zerop (DECL_INITIAL (x
)))
3420 /* We don't treat zero-width bitfields as making a class
3425 /* The class is non-empty. */
3426 CLASSTYPE_EMPTY_P (t
) = 0;
3427 /* The class is not even nearly empty. */
3428 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
3429 /* If one of the data members contains an empty class,
3431 if (CLASS_TYPE_P (type
)
3432 && CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type
))
3433 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 1;
3436 /* This is used by -Weffc++ (see below). Warn only for pointers
3437 to members which might hold dynamic memory. So do not warn
3438 for pointers to functions or pointers to members. */
3439 if (TYPE_PTR_P (type
)
3440 && !TYPE_PTRFN_P (type
))
3441 has_pointers
= true;
3443 if (CLASS_TYPE_P (type
))
3445 if (CLASSTYPE_REF_FIELDS_NEED_INIT (type
))
3446 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t
, 1);
3447 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (type
))
3448 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
, 1);
3451 if (DECL_MUTABLE_P (x
) || TYPE_HAS_MUTABLE_P (type
))
3452 CLASSTYPE_HAS_MUTABLE (t
) = 1;
3454 if (! layout_pod_type_p (type
))
3455 /* DR 148 now allows pointers to members (which are POD themselves),
3456 to be allowed in POD structs. */
3457 CLASSTYPE_NON_LAYOUT_POD_P (t
) = 1;
3459 if (!std_layout_type_p (type
))
3460 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3462 if (! zero_init_p (type
))
3463 CLASSTYPE_NON_ZERO_INIT_P (t
) = 1;
3465 /* We set DECL_C_BIT_FIELD in grokbitfield.
3466 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
3467 if (! DECL_C_BIT_FIELD (x
) || ! check_bitfield_decl (x
))
3468 check_field_decl (x
, t
,
3469 cant_have_const_ctor_p
,
3471 &any_default_members
);
3473 /* Now that we've removed bit-field widths from DECL_INITIAL,
3474 anything left in DECL_INITIAL is an NSDMI that makes the class
3476 if (DECL_INITIAL (x
))
3477 CLASSTYPE_NON_AGGREGATE (t
) = true;
3479 /* If any field is const, the structure type is pseudo-const. */
3480 if (CP_TYPE_CONST_P (type
))
3482 C_TYPE_FIELDS_READONLY (t
) = 1;
3483 if (DECL_INITIAL (x
) == NULL_TREE
)
3484 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
, 1);
3486 /* ARM $12.6.2: [A member initializer list] (or, for an
3487 aggregate, initialization by a brace-enclosed list) is the
3488 only way to initialize nonstatic const and reference
3490 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
3491 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) = 1;
3493 /* A field that is pseudo-const makes the structure likewise. */
3494 else if (CLASS_TYPE_P (type
))
3496 C_TYPE_FIELDS_READONLY (t
) |= C_TYPE_FIELDS_READONLY (type
);
3497 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
,
3498 CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
)
3499 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (type
));
3502 /* Core issue 80: A nonstatic data member is required to have a
3503 different name from the class iff the class has a
3504 user-declared constructor. */
3505 if (constructor_name_p (DECL_NAME (x
), t
)
3506 && TYPE_HAS_USER_CONSTRUCTOR (t
))
3507 permerror (input_location
, "field %q+#D with same name as class", x
);
3510 /* Effective C++ rule 11: if a class has dynamic memory held by pointers,
3511 it should also define a copy constructor and an assignment operator to
3512 implement the correct copy semantic (deep vs shallow, etc.). As it is
3513 not feasible to check whether the constructors do allocate dynamic memory
3514 and store it within members, we approximate the warning like this:
3516 -- Warn only if there are members which are pointers
3517 -- Warn only if there is a non-trivial constructor (otherwise,
3518 there cannot be memory allocated).
3519 -- Warn only if there is a non-trivial destructor. We assume that the
3520 user at least implemented the cleanup correctly, and a destructor
3521 is needed to free dynamic memory.
3523 This seems enough for practical purposes. */
3526 && TYPE_HAS_USER_CONSTRUCTOR (t
)
3527 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3528 && !(TYPE_HAS_COPY_CTOR (t
) && TYPE_HAS_COPY_ASSIGN (t
)))
3530 warning (OPT_Weffc__
, "%q#T has pointer data members", t
);
3532 if (! TYPE_HAS_COPY_CTOR (t
))
3534 warning (OPT_Weffc__
,
3535 " but does not override %<%T(const %T&)%>", t
, t
);
3536 if (!TYPE_HAS_COPY_ASSIGN (t
))
3537 warning (OPT_Weffc__
, " or %<operator=(const %T&)%>", t
);
3539 else if (! TYPE_HAS_COPY_ASSIGN (t
))
3540 warning (OPT_Weffc__
,
3541 " but does not override %<operator=(const %T&)%>", t
);
3544 /* Non-static data member initializers make the default constructor
3546 if (any_default_members
)
3548 TYPE_NEEDS_CONSTRUCTING (t
) = true;
3549 TYPE_HAS_COMPLEX_DFLT (t
) = true;
3552 /* If any of the fields couldn't be packed, unset TYPE_PACKED. */
3554 TYPE_PACKED (t
) = 0;
3556 /* Check anonymous struct/anonymous union fields. */
3557 finish_struct_anon (t
);
3559 /* We've built up the list of access declarations in reverse order.
3561 *access_decls
= nreverse (*access_decls
);
3564 /* If TYPE is an empty class type, records its OFFSET in the table of
3568 record_subobject_offset (tree type
, tree offset
, splay_tree offsets
)
3572 if (!is_empty_class (type
))
3575 /* Record the location of this empty object in OFFSETS. */
3576 n
= splay_tree_lookup (offsets
, (splay_tree_key
) offset
);
3578 n
= splay_tree_insert (offsets
,
3579 (splay_tree_key
) offset
,
3580 (splay_tree_value
) NULL_TREE
);
3581 n
->value
= ((splay_tree_value
)
3582 tree_cons (NULL_TREE
,
3589 /* Returns nonzero if TYPE is an empty class type and there is
3590 already an entry in OFFSETS for the same TYPE as the same OFFSET. */
3593 check_subobject_offset (tree type
, tree offset
, splay_tree offsets
)
3598 if (!is_empty_class (type
))
3601 /* Record the location of this empty object in OFFSETS. */
3602 n
= splay_tree_lookup (offsets
, (splay_tree_key
) offset
);
3606 for (t
= (tree
) n
->value
; t
; t
= TREE_CHAIN (t
))
3607 if (same_type_p (TREE_VALUE (t
), type
))
3613 /* Walk through all the subobjects of TYPE (located at OFFSET). Call
3614 F for every subobject, passing it the type, offset, and table of
3615 OFFSETS. If VBASES_P is one, then virtual non-primary bases should
3618 If MAX_OFFSET is non-NULL, then subobjects with an offset greater
3619 than MAX_OFFSET will not be walked.
3621 If F returns a nonzero value, the traversal ceases, and that value
3622 is returned. Otherwise, returns zero. */
3625 walk_subobject_offsets (tree type
,
3626 subobject_offset_fn f
,
3633 tree type_binfo
= NULL_TREE
;
3635 /* If this OFFSET is bigger than the MAX_OFFSET, then we should
3637 if (max_offset
&& INT_CST_LT (max_offset
, offset
))
3640 if (type
== error_mark_node
)
3645 if (abi_version_at_least (2))
3647 type
= BINFO_TYPE (type
);
3650 if (CLASS_TYPE_P (type
))
3656 /* Avoid recursing into objects that are not interesting. */
3657 if (!CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type
))
3660 /* Record the location of TYPE. */
3661 r
= (*f
) (type
, offset
, offsets
);
3665 /* Iterate through the direct base classes of TYPE. */
3667 type_binfo
= TYPE_BINFO (type
);
3668 for (i
= 0; BINFO_BASE_ITERATE (type_binfo
, i
, binfo
); i
++)
3672 if (abi_version_at_least (2)
3673 && BINFO_VIRTUAL_P (binfo
))
3677 && BINFO_VIRTUAL_P (binfo
)
3678 && !BINFO_PRIMARY_P (binfo
))
3681 if (!abi_version_at_least (2))
3682 binfo_offset
= size_binop (PLUS_EXPR
,
3684 BINFO_OFFSET (binfo
));
3688 /* We cannot rely on BINFO_OFFSET being set for the base
3689 class yet, but the offsets for direct non-virtual
3690 bases can be calculated by going back to the TYPE. */
3691 orig_binfo
= BINFO_BASE_BINFO (TYPE_BINFO (type
), i
);
3692 binfo_offset
= size_binop (PLUS_EXPR
,
3694 BINFO_OFFSET (orig_binfo
));
3697 r
= walk_subobject_offsets (binfo
,
3702 (abi_version_at_least (2)
3703 ? /*vbases_p=*/0 : vbases_p
));
3708 if (abi_version_at_least (2) && CLASSTYPE_VBASECLASSES (type
))
3711 vec
<tree
, va_gc
> *vbases
;
3713 /* Iterate through the virtual base classes of TYPE. In G++
3714 3.2, we included virtual bases in the direct base class
3715 loop above, which results in incorrect results; the
3716 correct offsets for virtual bases are only known when
3717 working with the most derived type. */
3719 for (vbases
= CLASSTYPE_VBASECLASSES (type
), ix
= 0;
3720 vec_safe_iterate (vbases
, ix
, &binfo
); ix
++)
3722 r
= walk_subobject_offsets (binfo
,
3724 size_binop (PLUS_EXPR
,
3726 BINFO_OFFSET (binfo
)),
3735 /* We still have to walk the primary base, if it is
3736 virtual. (If it is non-virtual, then it was walked
3738 tree vbase
= get_primary_binfo (type_binfo
);
3740 if (vbase
&& BINFO_VIRTUAL_P (vbase
)
3741 && BINFO_PRIMARY_P (vbase
)
3742 && BINFO_INHERITANCE_CHAIN (vbase
) == type_binfo
)
3744 r
= (walk_subobject_offsets
3746 offsets
, max_offset
, /*vbases_p=*/0));
3753 /* Iterate through the fields of TYPE. */
3754 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3755 if (TREE_CODE (field
) == FIELD_DECL
&& !DECL_ARTIFICIAL (field
))
3759 if (abi_version_at_least (2))
3760 field_offset
= byte_position (field
);
3762 /* In G++ 3.2, DECL_FIELD_OFFSET was used. */
3763 field_offset
= DECL_FIELD_OFFSET (field
);
3765 r
= walk_subobject_offsets (TREE_TYPE (field
),
3767 size_binop (PLUS_EXPR
,
3777 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3779 tree element_type
= strip_array_types (type
);
3780 tree domain
= TYPE_DOMAIN (type
);
3783 /* Avoid recursing into objects that are not interesting. */
3784 if (!CLASS_TYPE_P (element_type
)
3785 || !CLASSTYPE_CONTAINS_EMPTY_CLASS_P (element_type
))
3788 /* Step through each of the elements in the array. */
3789 for (index
= size_zero_node
;
3790 /* G++ 3.2 had an off-by-one error here. */
3791 (abi_version_at_least (2)
3792 ? !INT_CST_LT (TYPE_MAX_VALUE (domain
), index
)
3793 : INT_CST_LT (index
, TYPE_MAX_VALUE (domain
)));
3794 index
= size_binop (PLUS_EXPR
, index
, size_one_node
))
3796 r
= walk_subobject_offsets (TREE_TYPE (type
),
3804 offset
= size_binop (PLUS_EXPR
, offset
,
3805 TYPE_SIZE_UNIT (TREE_TYPE (type
)));
3806 /* If this new OFFSET is bigger than the MAX_OFFSET, then
3807 there's no point in iterating through the remaining
3808 elements of the array. */
3809 if (max_offset
&& INT_CST_LT (max_offset
, offset
))
3817 /* Record all of the empty subobjects of TYPE (either a type or a
3818 binfo). If IS_DATA_MEMBER is true, then a non-static data member
3819 is being placed at OFFSET; otherwise, it is a base class that is
3820 being placed at OFFSET. */
3823 record_subobject_offsets (tree type
,
3826 bool is_data_member
)
3829 /* If recording subobjects for a non-static data member or a
3830 non-empty base class , we do not need to record offsets beyond
3831 the size of the biggest empty class. Additional data members
3832 will go at the end of the class. Additional base classes will go
3833 either at offset zero (if empty, in which case they cannot
3834 overlap with offsets past the size of the biggest empty class) or
3835 at the end of the class.
3837 However, if we are placing an empty base class, then we must record
3838 all offsets, as either the empty class is at offset zero (where
3839 other empty classes might later be placed) or at the end of the
3840 class (where other objects might then be placed, so other empty
3841 subobjects might later overlap). */
3843 || !is_empty_class (BINFO_TYPE (type
)))
3844 max_offset
= sizeof_biggest_empty_class
;
3846 max_offset
= NULL_TREE
;
3847 walk_subobject_offsets (type
, record_subobject_offset
, offset
,
3848 offsets
, max_offset
, is_data_member
);
3851 /* Returns nonzero if any of the empty subobjects of TYPE (located at
3852 OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero,
3853 virtual bases of TYPE are examined. */
3856 layout_conflict_p (tree type
,
3861 splay_tree_node max_node
;
3863 /* Get the node in OFFSETS that indicates the maximum offset where
3864 an empty subobject is located. */
3865 max_node
= splay_tree_max (offsets
);
3866 /* If there aren't any empty subobjects, then there's no point in
3867 performing this check. */
3871 return walk_subobject_offsets (type
, check_subobject_offset
, offset
,
3872 offsets
, (tree
) (max_node
->key
),
3876 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
3877 non-static data member of the type indicated by RLI. BINFO is the
3878 binfo corresponding to the base subobject, OFFSETS maps offsets to
3879 types already located at those offsets. This function determines
3880 the position of the DECL. */
3883 layout_nonempty_base_or_field (record_layout_info rli
,
3888 tree offset
= NULL_TREE
;
3894 /* For the purposes of determining layout conflicts, we want to
3895 use the class type of BINFO; TREE_TYPE (DECL) will be the
3896 CLASSTYPE_AS_BASE version, which does not contain entries for
3897 zero-sized bases. */
3898 type
= TREE_TYPE (binfo
);
3903 type
= TREE_TYPE (decl
);
3907 /* Try to place the field. It may take more than one try if we have
3908 a hard time placing the field without putting two objects of the
3909 same type at the same address. */
3912 struct record_layout_info_s old_rli
= *rli
;
3914 /* Place this field. */
3915 place_field (rli
, decl
);
3916 offset
= byte_position (decl
);
3918 /* We have to check to see whether or not there is already
3919 something of the same type at the offset we're about to use.
3920 For example, consider:
3923 struct T : public S { int i; };
3924 struct U : public S, public T {};
3926 Here, we put S at offset zero in U. Then, we can't put T at
3927 offset zero -- its S component would be at the same address
3928 as the S we already allocated. So, we have to skip ahead.
3929 Since all data members, including those whose type is an
3930 empty class, have nonzero size, any overlap can happen only
3931 with a direct or indirect base-class -- it can't happen with
3933 /* In a union, overlap is permitted; all members are placed at
3935 if (TREE_CODE (rli
->t
) == UNION_TYPE
)
3937 /* G++ 3.2 did not check for overlaps when placing a non-empty
3939 if (!abi_version_at_least (2) && binfo
&& BINFO_VIRTUAL_P (binfo
))
3941 if (layout_conflict_p (field_p
? type
: binfo
, offset
,
3944 /* Strip off the size allocated to this field. That puts us
3945 at the first place we could have put the field with
3946 proper alignment. */
3949 /* Bump up by the alignment required for the type. */
3951 = size_binop (PLUS_EXPR
, rli
->bitpos
,
3953 ? CLASSTYPE_ALIGN (type
)
3954 : TYPE_ALIGN (type
)));
3955 normalize_rli (rli
);
3958 /* There was no conflict. We're done laying out this field. */
3962 /* Now that we know where it will be placed, update its
3964 if (binfo
&& CLASS_TYPE_P (BINFO_TYPE (binfo
)))
3965 /* Indirect virtual bases may have a nonzero BINFO_OFFSET at
3966 this point because their BINFO_OFFSET is copied from another
3967 hierarchy. Therefore, we may not need to add the entire
3969 propagate_binfo_offsets (binfo
,
3970 size_diffop_loc (input_location
,
3971 convert (ssizetype
, offset
),
3973 BINFO_OFFSET (binfo
))));
3976 /* Returns true if TYPE is empty and OFFSET is nonzero. */
3979 empty_base_at_nonzero_offset_p (tree type
,
3981 splay_tree
/*offsets*/)
3983 return is_empty_class (type
) && !integer_zerop (offset
);
3986 /* Layout the empty base BINFO. EOC indicates the byte currently just
3987 past the end of the class, and should be correctly aligned for a
3988 class of the type indicated by BINFO; OFFSETS gives the offsets of
3989 the empty bases allocated so far. T is the most derived
3990 type. Return nonzero iff we added it at the end. */
3993 layout_empty_base (record_layout_info rli
, tree binfo
,
3994 tree eoc
, splay_tree offsets
)
3997 tree basetype
= BINFO_TYPE (binfo
);
4000 /* This routine should only be used for empty classes. */
4001 gcc_assert (is_empty_class (basetype
));
4002 alignment
= ssize_int (CLASSTYPE_ALIGN_UNIT (basetype
));
4004 if (!integer_zerop (BINFO_OFFSET (binfo
)))
4006 if (abi_version_at_least (2))
4007 propagate_binfo_offsets
4008 (binfo
, size_diffop_loc (input_location
,
4009 size_zero_node
, BINFO_OFFSET (binfo
)));
4012 "offset of empty base %qT may not be ABI-compliant and may"
4013 "change in a future version of GCC",
4014 BINFO_TYPE (binfo
));
4017 /* This is an empty base class. We first try to put it at offset
4019 if (layout_conflict_p (binfo
,
4020 BINFO_OFFSET (binfo
),
4024 /* That didn't work. Now, we move forward from the next
4025 available spot in the class. */
4027 propagate_binfo_offsets (binfo
, convert (ssizetype
, eoc
));
4030 if (!layout_conflict_p (binfo
,
4031 BINFO_OFFSET (binfo
),
4034 /* We finally found a spot where there's no overlap. */
4037 /* There's overlap here, too. Bump along to the next spot. */
4038 propagate_binfo_offsets (binfo
, alignment
);
4042 if (CLASSTYPE_USER_ALIGN (basetype
))
4044 rli
->record_align
= MAX (rli
->record_align
, CLASSTYPE_ALIGN (basetype
));
4046 rli
->unpacked_align
= MAX (rli
->unpacked_align
, CLASSTYPE_ALIGN (basetype
));
4047 TYPE_USER_ALIGN (rli
->t
) = 1;
4053 /* Layout the base given by BINFO in the class indicated by RLI.
4054 *BASE_ALIGN is a running maximum of the alignments of
4055 any base class. OFFSETS gives the location of empty base
4056 subobjects. T is the most derived type. Return nonzero if the new
4057 object cannot be nearly-empty. A new FIELD_DECL is inserted at
4058 *NEXT_FIELD, unless BINFO is for an empty base class.
4060 Returns the location at which the next field should be inserted. */
4063 build_base_field (record_layout_info rli
, tree binfo
,
4064 splay_tree offsets
, tree
*next_field
)
4067 tree basetype
= BINFO_TYPE (binfo
);
4069 if (!COMPLETE_TYPE_P (basetype
))
4070 /* This error is now reported in xref_tag, thus giving better
4071 location information. */
4074 /* Place the base class. */
4075 if (!is_empty_class (basetype
))
4079 /* The containing class is non-empty because it has a non-empty
4081 CLASSTYPE_EMPTY_P (t
) = 0;
4083 /* Create the FIELD_DECL. */
4084 decl
= build_decl (input_location
,
4085 FIELD_DECL
, NULL_TREE
, CLASSTYPE_AS_BASE (basetype
));
4086 DECL_ARTIFICIAL (decl
) = 1;
4087 DECL_IGNORED_P (decl
) = 1;
4088 DECL_FIELD_CONTEXT (decl
) = t
;
4089 if (CLASSTYPE_AS_BASE (basetype
))
4091 DECL_SIZE (decl
) = CLASSTYPE_SIZE (basetype
);
4092 DECL_SIZE_UNIT (decl
) = CLASSTYPE_SIZE_UNIT (basetype
);
4093 DECL_ALIGN (decl
) = CLASSTYPE_ALIGN (basetype
);
4094 DECL_USER_ALIGN (decl
) = CLASSTYPE_USER_ALIGN (basetype
);
4095 DECL_MODE (decl
) = TYPE_MODE (basetype
);
4096 DECL_FIELD_IS_BASE (decl
) = 1;
4098 /* Try to place the field. It may take more than one try if we
4099 have a hard time placing the field without putting two
4100 objects of the same type at the same address. */
4101 layout_nonempty_base_or_field (rli
, decl
, binfo
, offsets
);
4102 /* Add the new FIELD_DECL to the list of fields for T. */
4103 DECL_CHAIN (decl
) = *next_field
;
4105 next_field
= &DECL_CHAIN (decl
);
4113 /* On some platforms (ARM), even empty classes will not be
4115 eoc
= round_up_loc (input_location
,
4116 rli_size_unit_so_far (rli
),
4117 CLASSTYPE_ALIGN_UNIT (basetype
));
4118 atend
= layout_empty_base (rli
, binfo
, eoc
, offsets
);
4119 /* A nearly-empty class "has no proper base class that is empty,
4120 not morally virtual, and at an offset other than zero." */
4121 if (!BINFO_VIRTUAL_P (binfo
) && CLASSTYPE_NEARLY_EMPTY_P (t
))
4124 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
4125 /* The check above (used in G++ 3.2) is insufficient because
4126 an empty class placed at offset zero might itself have an
4127 empty base at a nonzero offset. */
4128 else if (walk_subobject_offsets (basetype
,
4129 empty_base_at_nonzero_offset_p
,
4132 /*max_offset=*/NULL_TREE
,
4135 if (abi_version_at_least (2))
4136 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
4139 "class %qT will be considered nearly empty in a "
4140 "future version of GCC", t
);
4144 /* We do not create a FIELD_DECL for empty base classes because
4145 it might overlap some other field. We want to be able to
4146 create CONSTRUCTORs for the class by iterating over the
4147 FIELD_DECLs, and the back end does not handle overlapping
4150 /* An empty virtual base causes a class to be non-empty
4151 -- but in that case we do not need to clear CLASSTYPE_EMPTY_P
4152 here because that was already done when the virtual table
4153 pointer was created. */
4156 /* Record the offsets of BINFO and its base subobjects. */
4157 record_subobject_offsets (binfo
,
4158 BINFO_OFFSET (binfo
),
4160 /*is_data_member=*/false);
4165 /* Layout all of the non-virtual base classes. Record empty
4166 subobjects in OFFSETS. T is the most derived type. Return nonzero
4167 if the type cannot be nearly empty. The fields created
4168 corresponding to the base classes will be inserted at
4172 build_base_fields (record_layout_info rli
,
4173 splay_tree offsets
, tree
*next_field
)
4175 /* Chain to hold all the new FIELD_DECLs which stand in for base class
4178 int n_baseclasses
= BINFO_N_BASE_BINFOS (TYPE_BINFO (t
));
4181 /* The primary base class is always allocated first. */
4182 if (CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
4183 next_field
= build_base_field (rli
, CLASSTYPE_PRIMARY_BINFO (t
),
4184 offsets
, next_field
);
4186 /* Now allocate the rest of the bases. */
4187 for (i
= 0; i
< n_baseclasses
; ++i
)
4191 base_binfo
= BINFO_BASE_BINFO (TYPE_BINFO (t
), i
);
4193 /* The primary base was already allocated above, so we don't
4194 need to allocate it again here. */
4195 if (base_binfo
== CLASSTYPE_PRIMARY_BINFO (t
))
4198 /* Virtual bases are added at the end (a primary virtual base
4199 will have already been added). */
4200 if (BINFO_VIRTUAL_P (base_binfo
))
4203 next_field
= build_base_field (rli
, base_binfo
,
4204 offsets
, next_field
);
4208 /* Go through the TYPE_METHODS of T issuing any appropriate
4209 diagnostics, figuring out which methods override which other
4210 methods, and so forth. */
4213 check_methods (tree t
)
4217 for (x
= TYPE_METHODS (t
); x
; x
= DECL_CHAIN (x
))
4219 check_for_override (x
, t
);
4220 if (DECL_PURE_VIRTUAL_P (x
) && ! DECL_VINDEX (x
))
4221 error ("initializer specified for non-virtual method %q+D", x
);
4222 /* The name of the field is the original field name
4223 Save this in auxiliary field for later overloading. */
4224 if (DECL_VINDEX (x
))
4226 TYPE_POLYMORPHIC_P (t
) = 1;
4227 if (DECL_PURE_VIRTUAL_P (x
))
4228 vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t
), x
);
4230 /* All user-provided destructors are non-trivial.
4231 Constructors and assignment ops are handled in
4232 grok_special_member_properties. */
4233 if (DECL_DESTRUCTOR_P (x
) && user_provided_p (x
))
4234 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = 1;
4238 /* FN is a constructor or destructor. Clone the declaration to create
4239 a specialized in-charge or not-in-charge version, as indicated by
4243 build_clone (tree fn
, tree name
)
4248 /* Copy the function. */
4249 clone
= copy_decl (fn
);
4250 /* Reset the function name. */
4251 DECL_NAME (clone
) = name
;
4252 SET_DECL_ASSEMBLER_NAME (clone
, NULL_TREE
);
4253 /* Remember where this function came from. */
4254 DECL_ABSTRACT_ORIGIN (clone
) = fn
;
4255 /* Make it easy to find the CLONE given the FN. */
4256 DECL_CHAIN (clone
) = DECL_CHAIN (fn
);
4257 DECL_CHAIN (fn
) = clone
;
4259 /* If this is a template, do the rest on the DECL_TEMPLATE_RESULT. */
4260 if (TREE_CODE (clone
) == TEMPLATE_DECL
)
4262 tree result
= build_clone (DECL_TEMPLATE_RESULT (clone
), name
);
4263 DECL_TEMPLATE_RESULT (clone
) = result
;
4264 DECL_TEMPLATE_INFO (result
) = copy_node (DECL_TEMPLATE_INFO (result
));
4265 DECL_TI_TEMPLATE (result
) = clone
;
4266 TREE_TYPE (clone
) = TREE_TYPE (result
);
4270 DECL_CLONED_FUNCTION (clone
) = fn
;
4271 /* There's no pending inline data for this function. */
4272 DECL_PENDING_INLINE_INFO (clone
) = NULL
;
4273 DECL_PENDING_INLINE_P (clone
) = 0;
4275 /* The base-class destructor is not virtual. */
4276 if (name
== base_dtor_identifier
)
4278 DECL_VIRTUAL_P (clone
) = 0;
4279 if (TREE_CODE (clone
) != TEMPLATE_DECL
)
4280 DECL_VINDEX (clone
) = NULL_TREE
;
4283 /* If there was an in-charge parameter, drop it from the function
4285 if (DECL_HAS_IN_CHARGE_PARM_P (clone
))
4291 exceptions
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone
));
4292 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (clone
));
4293 parmtypes
= TYPE_ARG_TYPES (TREE_TYPE (clone
));
4294 /* Skip the `this' parameter. */
4295 parmtypes
= TREE_CHAIN (parmtypes
);
4296 /* Skip the in-charge parameter. */
4297 parmtypes
= TREE_CHAIN (parmtypes
);
4298 /* And the VTT parm, in a complete [cd]tor. */
4299 if (DECL_HAS_VTT_PARM_P (fn
)
4300 && ! DECL_NEEDS_VTT_PARM_P (clone
))
4301 parmtypes
= TREE_CHAIN (parmtypes
);
4302 /* If this is subobject constructor or destructor, add the vtt
4305 = build_method_type_directly (basetype
,
4306 TREE_TYPE (TREE_TYPE (clone
)),
4309 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
),
4312 = cp_build_type_attribute_variant (TREE_TYPE (clone
),
4313 TYPE_ATTRIBUTES (TREE_TYPE (fn
)));
4316 /* Copy the function parameters. */
4317 DECL_ARGUMENTS (clone
) = copy_list (DECL_ARGUMENTS (clone
));
4318 /* Remove the in-charge parameter. */
4319 if (DECL_HAS_IN_CHARGE_PARM_P (clone
))
4321 DECL_CHAIN (DECL_ARGUMENTS (clone
))
4322 = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone
)));
4323 DECL_HAS_IN_CHARGE_PARM_P (clone
) = 0;
4325 /* And the VTT parm, in a complete [cd]tor. */
4326 if (DECL_HAS_VTT_PARM_P (fn
))
4328 if (DECL_NEEDS_VTT_PARM_P (clone
))
4329 DECL_HAS_VTT_PARM_P (clone
) = 1;
4332 DECL_CHAIN (DECL_ARGUMENTS (clone
))
4333 = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone
)));
4334 DECL_HAS_VTT_PARM_P (clone
) = 0;
4338 for (parms
= DECL_ARGUMENTS (clone
); parms
; parms
= DECL_CHAIN (parms
))
4340 DECL_CONTEXT (parms
) = clone
;
4341 cxx_dup_lang_specific_decl (parms
);
4344 /* Create the RTL for this function. */
4345 SET_DECL_RTL (clone
, NULL
);
4346 rest_of_decl_compilation (clone
, /*top_level=*/1, at_eof
);
4349 note_decl_for_pch (clone
);
4354 /* Implementation of DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P, do
4355 not invoke this function directly.
4357 For a non-thunk function, returns the address of the slot for storing
4358 the function it is a clone of. Otherwise returns NULL_TREE.
4360 If JUST_TESTING, looks through TEMPLATE_DECL and returns NULL if
4361 cloned_function is unset. This is to support the separate
4362 DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P modes; using the latter
4363 on a template makes sense, but not the former. */
4366 decl_cloned_function_p (const_tree decl
, bool just_testing
)
4370 decl
= STRIP_TEMPLATE (decl
);
4372 if (TREE_CODE (decl
) != FUNCTION_DECL
4373 || !DECL_LANG_SPECIFIC (decl
)
4374 || DECL_LANG_SPECIFIC (decl
)->u
.fn
.thunk_p
)
4376 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4378 lang_check_failed (__FILE__
, __LINE__
, __FUNCTION__
);
4384 ptr
= &DECL_LANG_SPECIFIC (decl
)->u
.fn
.u5
.cloned_function
;
4385 if (just_testing
&& *ptr
== NULL_TREE
)
4391 /* Produce declarations for all appropriate clones of FN. If
4392 UPDATE_METHOD_VEC_P is nonzero, the clones are added to the
4393 CLASTYPE_METHOD_VEC as well. */
4396 clone_function_decl (tree fn
, int update_method_vec_p
)
4400 /* Avoid inappropriate cloning. */
4402 && DECL_CLONED_FUNCTION_P (DECL_CHAIN (fn
)))
4405 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
4407 /* For each constructor, we need two variants: an in-charge version
4408 and a not-in-charge version. */
4409 clone
= build_clone (fn
, complete_ctor_identifier
);
4410 if (update_method_vec_p
)
4411 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4412 clone
= build_clone (fn
, base_ctor_identifier
);
4413 if (update_method_vec_p
)
4414 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4418 gcc_assert (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn
));
4420 /* For each destructor, we need three variants: an in-charge
4421 version, a not-in-charge version, and an in-charge deleting
4422 version. We clone the deleting version first because that
4423 means it will go second on the TYPE_METHODS list -- and that
4424 corresponds to the correct layout order in the virtual
4427 For a non-virtual destructor, we do not build a deleting
4429 if (DECL_VIRTUAL_P (fn
))
4431 clone
= build_clone (fn
, deleting_dtor_identifier
);
4432 if (update_method_vec_p
)
4433 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4435 clone
= build_clone (fn
, complete_dtor_identifier
);
4436 if (update_method_vec_p
)
4437 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4438 clone
= build_clone (fn
, base_dtor_identifier
);
4439 if (update_method_vec_p
)
4440 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4443 /* Note that this is an abstract function that is never emitted. */
4444 DECL_ABSTRACT (fn
) = 1;
4447 /* DECL is an in charge constructor, which is being defined. This will
4448 have had an in class declaration, from whence clones were
4449 declared. An out-of-class definition can specify additional default
4450 arguments. As it is the clones that are involved in overload
4451 resolution, we must propagate the information from the DECL to its
4455 adjust_clone_args (tree decl
)
4459 for (clone
= DECL_CHAIN (decl
); clone
&& DECL_CLONED_FUNCTION_P (clone
);
4460 clone
= DECL_CHAIN (clone
))
4462 tree orig_clone_parms
= TYPE_ARG_TYPES (TREE_TYPE (clone
));
4463 tree orig_decl_parms
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
4464 tree decl_parms
, clone_parms
;
4466 clone_parms
= orig_clone_parms
;
4468 /* Skip the 'this' parameter. */
4469 orig_clone_parms
= TREE_CHAIN (orig_clone_parms
);
4470 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4472 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
4473 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4474 if (DECL_HAS_VTT_PARM_P (decl
))
4475 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4477 clone_parms
= orig_clone_parms
;
4478 if (DECL_HAS_VTT_PARM_P (clone
))
4479 clone_parms
= TREE_CHAIN (clone_parms
);
4481 for (decl_parms
= orig_decl_parms
; decl_parms
;
4482 decl_parms
= TREE_CHAIN (decl_parms
),
4483 clone_parms
= TREE_CHAIN (clone_parms
))
4485 gcc_assert (same_type_p (TREE_TYPE (decl_parms
),
4486 TREE_TYPE (clone_parms
)));
4488 if (TREE_PURPOSE (decl_parms
) && !TREE_PURPOSE (clone_parms
))
4490 /* A default parameter has been added. Adjust the
4491 clone's parameters. */
4492 tree exceptions
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone
));
4493 tree attrs
= TYPE_ATTRIBUTES (TREE_TYPE (clone
));
4494 tree basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (clone
));
4497 clone_parms
= orig_decl_parms
;
4499 if (DECL_HAS_VTT_PARM_P (clone
))
4501 clone_parms
= tree_cons (TREE_PURPOSE (orig_clone_parms
),
4502 TREE_VALUE (orig_clone_parms
),
4504 TREE_TYPE (clone_parms
) = TREE_TYPE (orig_clone_parms
);
4506 type
= build_method_type_directly (basetype
,
4507 TREE_TYPE (TREE_TYPE (clone
)),
4510 type
= build_exception_variant (type
, exceptions
);
4512 type
= cp_build_type_attribute_variant (type
, attrs
);
4513 TREE_TYPE (clone
) = type
;
4515 clone_parms
= NULL_TREE
;
4519 gcc_assert (!clone_parms
);
4523 /* For each of the constructors and destructors in T, create an
4524 in-charge and not-in-charge variant. */
4527 clone_constructors_and_destructors (tree t
)
4531 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4533 if (!CLASSTYPE_METHOD_VEC (t
))
4536 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4537 clone_function_decl (OVL_CURRENT (fns
), /*update_method_vec_p=*/1);
4538 for (fns
= CLASSTYPE_DESTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4539 clone_function_decl (OVL_CURRENT (fns
), /*update_method_vec_p=*/1);
4542 /* Deduce noexcept for a destructor DTOR. */
4545 deduce_noexcept_on_destructor (tree dtor
)
4547 if (!TYPE_RAISES_EXCEPTIONS (TREE_TYPE (dtor
)))
4549 tree ctx
= DECL_CONTEXT (dtor
);
4550 tree implicit_fn
= implicitly_declare_fn (sfk_destructor
, ctx
,
4553 tree eh_spec
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (implicit_fn
));
4554 TREE_TYPE (dtor
) = build_exception_variant (TREE_TYPE (dtor
), eh_spec
);
4558 /* For each destructor in T, deduce noexcept:
4560 12.4/3: A declaration of a destructor that does not have an
4561 exception-specification is implicitly considered to have the
4562 same exception-specification as an implicit declaration (15.4). */
4565 deduce_noexcept_on_destructors (tree t
)
4569 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4571 if (!CLASSTYPE_METHOD_VEC (t
))
4574 for (fns
= CLASSTYPE_DESTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4575 deduce_noexcept_on_destructor (OVL_CURRENT (fns
));
4578 /* Subroutine of set_one_vmethod_tm_attributes. Search base classes
4579 of TYPE for virtual functions which FNDECL overrides. Return a
4580 mask of the tm attributes found therein. */
4583 look_for_tm_attr_overrides (tree type
, tree fndecl
)
4585 tree binfo
= TYPE_BINFO (type
);
4589 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ++ix
)
4591 tree o
, basetype
= BINFO_TYPE (base_binfo
);
4593 if (!TYPE_POLYMORPHIC_P (basetype
))
4596 o
= look_for_overrides_here (basetype
, fndecl
);
4598 found
|= tm_attr_to_mask (find_tm_attribute
4599 (TYPE_ATTRIBUTES (TREE_TYPE (o
))));
4601 found
|= look_for_tm_attr_overrides (basetype
, fndecl
);
4607 /* Subroutine of set_method_tm_attributes. Handle the checks and
4608 inheritance for one virtual method FNDECL. */
4611 set_one_vmethod_tm_attributes (tree type
, tree fndecl
)
4616 found
= look_for_tm_attr_overrides (type
, fndecl
);
4618 /* If FNDECL doesn't actually override anything (i.e. T is the
4619 class that first declares FNDECL virtual), then we're done. */
4623 tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl
)));
4624 have
= tm_attr_to_mask (tm_attr
);
4626 /* Intel STM Language Extension 3.0, Section 4.2 table 4:
4627 tm_pure must match exactly, otherwise no weakening of
4628 tm_safe > tm_callable > nothing. */
4629 /* ??? The tm_pure attribute didn't make the transition to the
4630 multivendor language spec. */
4631 if (have
== TM_ATTR_PURE
)
4633 if (found
!= TM_ATTR_PURE
)
4639 /* If the overridden function is tm_pure, then FNDECL must be. */
4640 else if (found
== TM_ATTR_PURE
&& tm_attr
)
4642 /* Look for base class combinations that cannot be satisfied. */
4643 else if (found
!= TM_ATTR_PURE
&& (found
& TM_ATTR_PURE
))
4645 found
&= ~TM_ATTR_PURE
;
4647 error_at (DECL_SOURCE_LOCATION (fndecl
),
4648 "method overrides both %<transaction_pure%> and %qE methods",
4649 tm_mask_to_attr (found
));
4651 /* If FNDECL did not declare an attribute, then inherit the most
4653 else if (tm_attr
== NULL
)
4655 apply_tm_attr (fndecl
, tm_mask_to_attr (found
& -found
));
4657 /* Otherwise validate that we're not weaker than a function
4658 that is being overridden. */
4662 if (found
<= TM_ATTR_CALLABLE
&& have
> found
)
4668 error_at (DECL_SOURCE_LOCATION (fndecl
),
4669 "method declared %qE overriding %qE method",
4670 tm_attr
, tm_mask_to_attr (found
));
4673 /* For each of the methods in T, propagate a class-level tm attribute. */
4676 set_method_tm_attributes (tree t
)
4678 tree class_tm_attr
, fndecl
;
4680 /* Don't bother collecting tm attributes if transactional memory
4681 support is not enabled. */
4685 /* Process virtual methods first, as they inherit directly from the
4686 base virtual function and also require validation of new attributes. */
4687 if (TYPE_CONTAINS_VPTR_P (t
))
4690 for (vchain
= BINFO_VIRTUALS (TYPE_BINFO (t
)); vchain
;
4691 vchain
= TREE_CHAIN (vchain
))
4693 fndecl
= BV_FN (vchain
);
4694 if (DECL_THUNK_P (fndecl
))
4695 fndecl
= THUNK_TARGET (fndecl
);
4696 set_one_vmethod_tm_attributes (t
, fndecl
);
4700 /* If the class doesn't have an attribute, nothing more to do. */
4701 class_tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (t
));
4702 if (class_tm_attr
== NULL
)
4705 /* Any method that does not yet have a tm attribute inherits
4706 the one from the class. */
4707 for (fndecl
= TYPE_METHODS (t
); fndecl
; fndecl
= TREE_CHAIN (fndecl
))
4709 if (!find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl
))))
4710 apply_tm_attr (fndecl
, class_tm_attr
);
4714 /* Returns true iff class T has a user-defined constructor other than
4715 the default constructor. */
4718 type_has_user_nondefault_constructor (tree t
)
4722 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4725 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4727 tree fn
= OVL_CURRENT (fns
);
4728 if (!DECL_ARTIFICIAL (fn
)
4729 && (TREE_CODE (fn
) == TEMPLATE_DECL
4730 || (skip_artificial_parms_for (fn
, DECL_ARGUMENTS (fn
))
4738 /* Returns the defaulted constructor if T has one. Otherwise, returns
4742 in_class_defaulted_default_constructor (tree t
)
4746 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4749 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4751 tree fn
= OVL_CURRENT (fns
);
4753 if (DECL_DEFAULTED_IN_CLASS_P (fn
))
4755 args
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
4756 while (args
&& TREE_PURPOSE (args
))
4757 args
= TREE_CHAIN (args
);
4758 if (!args
|| args
== void_list_node
)
4766 /* Returns true iff FN is a user-provided function, i.e. user-declared
4767 and not defaulted at its first declaration; or explicit, private,
4768 protected, or non-const. */
4771 user_provided_p (tree fn
)
4773 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4776 return (!DECL_ARTIFICIAL (fn
)
4777 && !DECL_DEFAULTED_IN_CLASS_P (fn
));
4780 /* Returns true iff class T has a user-provided constructor. */
4783 type_has_user_provided_constructor (tree t
)
4787 if (!CLASS_TYPE_P (t
))
4790 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4793 /* This can happen in error cases; avoid crashing. */
4794 if (!CLASSTYPE_METHOD_VEC (t
))
4797 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4798 if (user_provided_p (OVL_CURRENT (fns
)))
4804 /* Returns true iff class T has a user-provided default constructor. */
4807 type_has_user_provided_default_constructor (tree t
)
4811 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4814 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4816 tree fn
= OVL_CURRENT (fns
);
4817 if (TREE_CODE (fn
) == FUNCTION_DECL
4818 && user_provided_p (fn
)
4819 && sufficient_parms_p (FUNCTION_FIRST_USER_PARMTYPE (fn
)))
4826 /* If default-initialization leaves part of TYPE uninitialized, returns
4827 a DECL for the field or TYPE itself (DR 253). */
4830 default_init_uninitialized_part (tree type
)
4835 type
= strip_array_types (type
);
4836 if (!CLASS_TYPE_P (type
))
4838 if (type_has_user_provided_default_constructor (type
))
4840 for (binfo
= TYPE_BINFO (type
), i
= 0;
4841 BINFO_BASE_ITERATE (binfo
, i
, t
); ++i
)
4843 r
= default_init_uninitialized_part (BINFO_TYPE (t
));
4847 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
4848 if (TREE_CODE (t
) == FIELD_DECL
4849 && !DECL_ARTIFICIAL (t
)
4850 && !DECL_INITIAL (t
))
4852 r
= default_init_uninitialized_part (TREE_TYPE (t
));
4854 return DECL_P (r
) ? r
: t
;
4860 /* Returns true iff for class T, a trivial synthesized default constructor
4861 would be constexpr. */
4864 trivial_default_constructor_is_constexpr (tree t
)
4866 /* A defaulted trivial default constructor is constexpr
4867 if there is nothing to initialize. */
4868 gcc_assert (!TYPE_HAS_COMPLEX_DFLT (t
));
4869 return is_really_empty_class (t
);
4872 /* Returns true iff class T has a constexpr default constructor. */
4875 type_has_constexpr_default_constructor (tree t
)
4879 if (!CLASS_TYPE_P (t
))
4881 /* The caller should have stripped an enclosing array. */
4882 gcc_assert (TREE_CODE (t
) != ARRAY_TYPE
);
4885 if (CLASSTYPE_LAZY_DEFAULT_CTOR (t
))
4887 if (!TYPE_HAS_COMPLEX_DFLT (t
))
4888 return trivial_default_constructor_is_constexpr (t
);
4889 /* Non-trivial, we need to check subobject constructors. */
4890 lazily_declare_fn (sfk_constructor
, t
);
4892 fns
= locate_ctor (t
);
4893 return (fns
&& DECL_DECLARED_CONSTEXPR_P (fns
));
4896 /* Returns true iff class TYPE has a virtual destructor. */
4899 type_has_virtual_destructor (tree type
)
4903 if (!CLASS_TYPE_P (type
))
4906 gcc_assert (COMPLETE_TYPE_P (type
));
4907 dtor
= CLASSTYPE_DESTRUCTORS (type
);
4908 return (dtor
&& DECL_VIRTUAL_P (dtor
));
4911 /* Returns true iff class T has a move constructor. */
4914 type_has_move_constructor (tree t
)
4918 if (CLASSTYPE_LAZY_MOVE_CTOR (t
))
4920 gcc_assert (COMPLETE_TYPE_P (t
));
4921 lazily_declare_fn (sfk_move_constructor
, t
);
4924 if (!CLASSTYPE_METHOD_VEC (t
))
4927 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4928 if (move_fn_p (OVL_CURRENT (fns
)))
4934 /* Returns true iff class T has a move assignment operator. */
4937 type_has_move_assign (tree t
)
4941 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
4943 gcc_assert (COMPLETE_TYPE_P (t
));
4944 lazily_declare_fn (sfk_move_assignment
, t
);
4947 for (fns
= lookup_fnfields_slot_nolazy (t
, ansi_assopname (NOP_EXPR
));
4948 fns
; fns
= OVL_NEXT (fns
))
4949 if (move_fn_p (OVL_CURRENT (fns
)))
4955 /* Returns true iff class T has a move constructor that was explicitly
4956 declared in the class body. Note that this is different from
4957 "user-provided", which doesn't include functions that are defaulted in
4961 type_has_user_declared_move_constructor (tree t
)
4965 if (CLASSTYPE_LAZY_MOVE_CTOR (t
))
4968 if (!CLASSTYPE_METHOD_VEC (t
))
4971 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4973 tree fn
= OVL_CURRENT (fns
);
4974 if (move_fn_p (fn
) && !DECL_ARTIFICIAL (fn
))
4981 /* Returns true iff class T has a move assignment operator that was
4982 explicitly declared in the class body. */
4985 type_has_user_declared_move_assign (tree t
)
4989 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
4992 for (fns
= lookup_fnfields_slot_nolazy (t
, ansi_assopname (NOP_EXPR
));
4993 fns
; fns
= OVL_NEXT (fns
))
4995 tree fn
= OVL_CURRENT (fns
);
4996 if (move_fn_p (fn
) && !DECL_ARTIFICIAL (fn
))
5003 /* Nonzero if we need to build up a constructor call when initializing an
5004 object of this class, either because it has a user-provided constructor
5005 or because it doesn't have a default constructor (so we need to give an
5006 error if no initializer is provided). Use TYPE_NEEDS_CONSTRUCTING when
5007 what you care about is whether or not an object can be produced by a
5008 constructor (e.g. so we don't set TREE_READONLY on const variables of
5009 such type); use this function when what you care about is whether or not
5010 to try to call a constructor to create an object. The latter case is
5011 the former plus some cases of constructors that cannot be called. */
5014 type_build_ctor_call (tree t
)
5017 if (TYPE_NEEDS_CONSTRUCTING (t
))
5019 inner
= strip_array_types (t
);
5020 return (CLASS_TYPE_P (inner
) && !TYPE_HAS_DEFAULT_CONSTRUCTOR (inner
)
5021 && !ANON_AGGR_TYPE_P (inner
));
5024 /* Remove all zero-width bit-fields from T. */
5027 remove_zero_width_bit_fields (tree t
)
5031 fieldsp
= &TYPE_FIELDS (t
);
5034 if (TREE_CODE (*fieldsp
) == FIELD_DECL
5035 && DECL_C_BIT_FIELD (*fieldsp
)
5036 /* We should not be confused by the fact that grokbitfield
5037 temporarily sets the width of the bit field into
5038 DECL_INITIAL (*fieldsp).
5039 check_bitfield_decl eventually sets DECL_SIZE (*fieldsp)
5041 && integer_zerop (DECL_SIZE (*fieldsp
)))
5042 *fieldsp
= DECL_CHAIN (*fieldsp
);
5044 fieldsp
= &DECL_CHAIN (*fieldsp
);
5048 /* Returns TRUE iff we need a cookie when dynamically allocating an
5049 array whose elements have the indicated class TYPE. */
5052 type_requires_array_cookie (tree type
)
5055 bool has_two_argument_delete_p
= false;
5057 gcc_assert (CLASS_TYPE_P (type
));
5059 /* If there's a non-trivial destructor, we need a cookie. In order
5060 to iterate through the array calling the destructor for each
5061 element, we'll have to know how many elements there are. */
5062 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
5065 /* If the usual deallocation function is a two-argument whose second
5066 argument is of type `size_t', then we have to pass the size of
5067 the array to the deallocation function, so we will need to store
5069 fns
= lookup_fnfields (TYPE_BINFO (type
),
5070 ansi_opname (VEC_DELETE_EXPR
),
5072 /* If there are no `operator []' members, or the lookup is
5073 ambiguous, then we don't need a cookie. */
5074 if (!fns
|| fns
== error_mark_node
)
5076 /* Loop through all of the functions. */
5077 for (fns
= BASELINK_FUNCTIONS (fns
); fns
; fns
= OVL_NEXT (fns
))
5082 /* Select the current function. */
5083 fn
= OVL_CURRENT (fns
);
5084 /* See if this function is a one-argument delete function. If
5085 it is, then it will be the usual deallocation function. */
5086 second_parm
= TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (fn
)));
5087 if (second_parm
== void_list_node
)
5089 /* Do not consider this function if its second argument is an
5093 /* Otherwise, if we have a two-argument function and the second
5094 argument is `size_t', it will be the usual deallocation
5095 function -- unless there is one-argument function, too. */
5096 if (TREE_CHAIN (second_parm
) == void_list_node
5097 && same_type_p (TREE_VALUE (second_parm
), size_type_node
))
5098 has_two_argument_delete_p
= true;
5101 return has_two_argument_delete_p
;
5104 /* Finish computing the `literal type' property of class type T.
5106 At this point, we have already processed base classes and
5107 non-static data members. We need to check whether the copy
5108 constructor is trivial, the destructor is trivial, and there
5109 is a trivial default constructor or at least one constexpr
5110 constructor other than the copy constructor. */
5113 finalize_literal_type_property (tree t
)
5117 if (cxx_dialect
< cxx0x
5118 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5119 CLASSTYPE_LITERAL_P (t
) = false;
5120 else if (CLASSTYPE_LITERAL_P (t
) && !TYPE_HAS_TRIVIAL_DFLT (t
)
5121 && CLASSTYPE_NON_AGGREGATE (t
)
5122 && !TYPE_HAS_CONSTEXPR_CTOR (t
))
5123 CLASSTYPE_LITERAL_P (t
) = false;
5125 if (!CLASSTYPE_LITERAL_P (t
))
5126 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5127 if (DECL_DECLARED_CONSTEXPR_P (fn
)
5128 && TREE_CODE (fn
) != TEMPLATE_DECL
5129 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
5130 && !DECL_CONSTRUCTOR_P (fn
))
5132 DECL_DECLARED_CONSTEXPR_P (fn
) = false;
5133 if (!DECL_GENERATED_P (fn
))
5135 error ("enclosing class of constexpr non-static member "
5136 "function %q+#D is not a literal type", fn
);
5137 explain_non_literal_class (t
);
5142 /* T is a non-literal type used in a context which requires a constant
5143 expression. Explain why it isn't literal. */
5146 explain_non_literal_class (tree t
)
5148 static struct pointer_set_t
*diagnosed
;
5150 if (!CLASS_TYPE_P (t
))
5152 t
= TYPE_MAIN_VARIANT (t
);
5154 if (diagnosed
== NULL
)
5155 diagnosed
= pointer_set_create ();
5156 if (pointer_set_insert (diagnosed
, t
) != 0)
5157 /* Already explained. */
5160 inform (0, "%q+T is not literal because:", t
);
5161 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5162 inform (0, " %q+T has a non-trivial destructor", t
);
5163 else if (CLASSTYPE_NON_AGGREGATE (t
)
5164 && !TYPE_HAS_TRIVIAL_DFLT (t
)
5165 && !TYPE_HAS_CONSTEXPR_CTOR (t
))
5167 inform (0, " %q+T is not an aggregate, does not have a trivial "
5168 "default constructor, and has no constexpr constructor that "
5169 "is not a copy or move constructor", t
);
5170 if (TYPE_HAS_DEFAULT_CONSTRUCTOR (t
)
5171 && !type_has_user_provided_default_constructor (t
))
5173 /* Note that we can't simply call locate_ctor because when the
5174 constructor is deleted it just returns NULL_TREE. */
5176 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5178 tree fn
= OVL_CURRENT (fns
);
5179 tree parms
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5181 parms
= skip_artificial_parms_for (fn
, parms
);
5183 if (sufficient_parms_p (parms
))
5185 if (DECL_DELETED_FN (fn
))
5186 maybe_explain_implicit_delete (fn
);
5188 explain_invalid_constexpr_fn (fn
);
5196 tree binfo
, base_binfo
, field
; int i
;
5197 for (binfo
= TYPE_BINFO (t
), i
= 0;
5198 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
5200 tree basetype
= TREE_TYPE (base_binfo
);
5201 if (!CLASSTYPE_LITERAL_P (basetype
))
5203 inform (0, " base class %qT of %q+T is non-literal",
5205 explain_non_literal_class (basetype
);
5209 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
5212 if (TREE_CODE (field
) != FIELD_DECL
)
5214 ftype
= TREE_TYPE (field
);
5215 if (!literal_type_p (ftype
))
5217 inform (0, " non-static data member %q+D has "
5218 "non-literal type", field
);
5219 if (CLASS_TYPE_P (ftype
))
5220 explain_non_literal_class (ftype
);
5226 /* Check the validity of the bases and members declared in T. Add any
5227 implicitly-generated functions (like copy-constructors and
5228 assignment operators). Compute various flag bits (like
5229 CLASSTYPE_NON_LAYOUT_POD_T) for T. This routine works purely at the C++
5230 level: i.e., independently of the ABI in use. */
5233 check_bases_and_members (tree t
)
5235 /* Nonzero if the implicitly generated copy constructor should take
5236 a non-const reference argument. */
5237 int cant_have_const_ctor
;
5238 /* Nonzero if the implicitly generated assignment operator
5239 should take a non-const reference argument. */
5240 int no_const_asn_ref
;
5242 bool saved_complex_asn_ref
;
5243 bool saved_nontrivial_dtor
;
5246 /* By default, we use const reference arguments and generate default
5248 cant_have_const_ctor
= 0;
5249 no_const_asn_ref
= 0;
5251 /* Check all the base-classes. */
5252 check_bases (t
, &cant_have_const_ctor
,
5255 /* Deduce noexcept on destructors. This needs to happen after we've set
5256 triviality flags appropriately for our bases. */
5257 if (cxx_dialect
>= cxx0x
)
5258 deduce_noexcept_on_destructors (t
);
5260 /* Check all the method declarations. */
5263 /* Save the initial values of these flags which only indicate whether
5264 or not the class has user-provided functions. As we analyze the
5265 bases and members we can set these flags for other reasons. */
5266 saved_complex_asn_ref
= TYPE_HAS_COMPLEX_COPY_ASSIGN (t
);
5267 saved_nontrivial_dtor
= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
);
5269 /* Check all the data member declarations. We cannot call
5270 check_field_decls until we have called check_bases check_methods,
5271 as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR
5272 being set appropriately. */
5273 check_field_decls (t
, &access_decls
,
5274 &cant_have_const_ctor
,
5277 /* A nearly-empty class has to be vptr-containing; a nearly empty
5278 class contains just a vptr. */
5279 if (!TYPE_CONTAINS_VPTR_P (t
))
5280 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
5282 /* Do some bookkeeping that will guide the generation of implicitly
5283 declared member functions. */
5284 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5285 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5286 /* We need to call a constructor for this class if it has a
5287 user-provided constructor, or if the default constructor is going
5288 to initialize the vptr. (This is not an if-and-only-if;
5289 TYPE_NEEDS_CONSTRUCTING is set elsewhere if bases or members
5290 themselves need constructing.) */
5291 TYPE_NEEDS_CONSTRUCTING (t
)
5292 |= (type_has_user_provided_constructor (t
) || TYPE_CONTAINS_VPTR_P (t
));
5295 An aggregate is an array or a class with no user-provided
5296 constructors ... and no virtual functions.
5298 Again, other conditions for being an aggregate are checked
5300 CLASSTYPE_NON_AGGREGATE (t
)
5301 |= (type_has_user_provided_constructor (t
) || TYPE_POLYMORPHIC_P (t
));
5302 /* This is the C++98/03 definition of POD; it changed in C++0x, but we
5303 retain the old definition internally for ABI reasons. */
5304 CLASSTYPE_NON_LAYOUT_POD_P (t
)
5305 |= (CLASSTYPE_NON_AGGREGATE (t
)
5306 || saved_nontrivial_dtor
|| saved_complex_asn_ref
);
5307 CLASSTYPE_NON_STD_LAYOUT (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5308 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5309 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5310 TYPE_HAS_COMPLEX_DFLT (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5312 /* If the class has no user-declared constructor, but does have
5313 non-static const or reference data members that can never be
5314 initialized, issue a warning. */
5315 if (warn_uninitialized
5316 /* Classes with user-declared constructors are presumed to
5317 initialize these members. */
5318 && !TYPE_HAS_USER_CONSTRUCTOR (t
)
5319 /* Aggregates can be initialized with brace-enclosed
5321 && CLASSTYPE_NON_AGGREGATE (t
))
5325 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
5329 if (TREE_CODE (field
) != FIELD_DECL
5330 || DECL_INITIAL (field
) != NULL_TREE
)
5333 type
= TREE_TYPE (field
);
5334 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5335 warning (OPT_Wuninitialized
, "non-static reference %q+#D "
5336 "in class without a constructor", field
);
5337 else if (CP_TYPE_CONST_P (type
)
5338 && (!CLASS_TYPE_P (type
)
5339 || !TYPE_HAS_DEFAULT_CONSTRUCTOR (type
)))
5340 warning (OPT_Wuninitialized
, "non-static const member %q+#D "
5341 "in class without a constructor", field
);
5345 /* Synthesize any needed methods. */
5346 add_implicitly_declared_members (t
, &access_decls
,
5347 cant_have_const_ctor
,
5350 /* Check defaulted declarations here so we have cant_have_const_ctor
5351 and don't need to worry about clones. */
5352 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5353 if (!DECL_ARTIFICIAL (fn
) && DECL_DEFAULTED_IN_CLASS_P (fn
))
5355 int copy
= copy_fn_p (fn
);
5359 = (DECL_CONSTRUCTOR_P (fn
) ? !cant_have_const_ctor
5360 : !no_const_asn_ref
);
5361 bool fn_const_p
= (copy
== 2);
5363 if (fn_const_p
&& !imp_const_p
)
5364 /* If the function is defaulted outside the class, we just
5365 give the synthesis error. */
5366 error ("%q+D declared to take const reference, but implicit "
5367 "declaration would take non-const", fn
);
5369 defaulted_late_check (fn
);
5372 if (LAMBDA_TYPE_P (t
))
5374 /* "The closure type associated with a lambda-expression has a deleted
5375 default constructor and a deleted copy assignment operator." */
5376 TYPE_NEEDS_CONSTRUCTING (t
) = 1;
5377 TYPE_HAS_COMPLEX_DFLT (t
) = 1;
5378 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
5379 CLASSTYPE_LAZY_MOVE_ASSIGN (t
) = 0;
5381 /* "This class type is not an aggregate." */
5382 CLASSTYPE_NON_AGGREGATE (t
) = 1;
5385 /* Compute the 'literal type' property before we
5386 do anything with non-static member functions. */
5387 finalize_literal_type_property (t
);
5389 /* Create the in-charge and not-in-charge variants of constructors
5391 clone_constructors_and_destructors (t
);
5393 /* Process the using-declarations. */
5394 for (; access_decls
; access_decls
= TREE_CHAIN (access_decls
))
5395 handle_using_decl (TREE_VALUE (access_decls
), t
);
5397 /* Build and sort the CLASSTYPE_METHOD_VEC. */
5398 finish_struct_methods (t
);
5400 /* Figure out whether or not we will need a cookie when dynamically
5401 allocating an array of this type. */
5402 TYPE_LANG_SPECIFIC (t
)->u
.c
.vec_new_uses_cookie
5403 = type_requires_array_cookie (t
);
5406 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
5407 accordingly. If a new vfield was created (because T doesn't have a
5408 primary base class), then the newly created field is returned. It
5409 is not added to the TYPE_FIELDS list; it is the caller's
5410 responsibility to do that. Accumulate declared virtual functions
5414 create_vtable_ptr (tree t
, tree
* virtuals_p
)
5418 /* Collect the virtual functions declared in T. */
5419 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5420 if (DECL_VINDEX (fn
) && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn
)
5421 && TREE_CODE (DECL_VINDEX (fn
)) != INTEGER_CST
)
5423 tree new_virtual
= make_node (TREE_LIST
);
5425 BV_FN (new_virtual
) = fn
;
5426 BV_DELTA (new_virtual
) = integer_zero_node
;
5427 BV_VCALL_INDEX (new_virtual
) = NULL_TREE
;
5429 TREE_CHAIN (new_virtual
) = *virtuals_p
;
5430 *virtuals_p
= new_virtual
;
5433 /* If we couldn't find an appropriate base class, create a new field
5434 here. Even if there weren't any new virtual functions, we might need a
5435 new virtual function table if we're supposed to include vptrs in
5436 all classes that need them. */
5437 if (!TYPE_VFIELD (t
) && (*virtuals_p
|| TYPE_CONTAINS_VPTR_P (t
)))
5439 /* We build this decl with vtbl_ptr_type_node, which is a
5440 `vtable_entry_type*'. It might seem more precise to use
5441 `vtable_entry_type (*)[N]' where N is the number of virtual
5442 functions. However, that would require the vtable pointer in
5443 base classes to have a different type than the vtable pointer
5444 in derived classes. We could make that happen, but that
5445 still wouldn't solve all the problems. In particular, the
5446 type-based alias analysis code would decide that assignments
5447 to the base class vtable pointer can't alias assignments to
5448 the derived class vtable pointer, since they have different
5449 types. Thus, in a derived class destructor, where the base
5450 class constructor was inlined, we could generate bad code for
5451 setting up the vtable pointer.
5453 Therefore, we use one type for all vtable pointers. We still
5454 use a type-correct type; it's just doesn't indicate the array
5455 bounds. That's better than using `void*' or some such; it's
5456 cleaner, and it let's the alias analysis code know that these
5457 stores cannot alias stores to void*! */
5460 field
= build_decl (input_location
,
5461 FIELD_DECL
, get_vfield_name (t
), vtbl_ptr_type_node
);
5462 DECL_VIRTUAL_P (field
) = 1;
5463 DECL_ARTIFICIAL (field
) = 1;
5464 DECL_FIELD_CONTEXT (field
) = t
;
5465 DECL_FCONTEXT (field
) = t
;
5466 if (TYPE_PACKED (t
))
5467 DECL_PACKED (field
) = 1;
5469 TYPE_VFIELD (t
) = field
;
5471 /* This class is non-empty. */
5472 CLASSTYPE_EMPTY_P (t
) = 0;
5480 /* Add OFFSET to all base types of BINFO which is a base in the
5481 hierarchy dominated by T.
5483 OFFSET, which is a type offset, is number of bytes. */
5486 propagate_binfo_offsets (tree binfo
, tree offset
)
5492 /* Update BINFO's offset. */
5493 BINFO_OFFSET (binfo
)
5494 = convert (sizetype
,
5495 size_binop (PLUS_EXPR
,
5496 convert (ssizetype
, BINFO_OFFSET (binfo
)),
5499 /* Find the primary base class. */
5500 primary_binfo
= get_primary_binfo (binfo
);
5502 if (primary_binfo
&& BINFO_INHERITANCE_CHAIN (primary_binfo
) == binfo
)
5503 propagate_binfo_offsets (primary_binfo
, offset
);
5505 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
5507 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5509 /* Don't do the primary base twice. */
5510 if (base_binfo
== primary_binfo
)
5513 if (BINFO_VIRTUAL_P (base_binfo
))
5516 propagate_binfo_offsets (base_binfo
, offset
);
5520 /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update
5521 TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of
5522 empty subobjects of T. */
5525 layout_virtual_bases (record_layout_info rli
, splay_tree offsets
)
5529 bool first_vbase
= true;
5532 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t
)) == 0)
5535 if (!abi_version_at_least(2))
5537 /* In G++ 3.2, we incorrectly rounded the size before laying out
5538 the virtual bases. */
5539 finish_record_layout (rli
, /*free_p=*/false);
5540 #ifdef STRUCTURE_SIZE_BOUNDARY
5541 /* Packed structures don't need to have minimum size. */
5542 if (! TYPE_PACKED (t
))
5543 TYPE_ALIGN (t
) = MAX (TYPE_ALIGN (t
), (unsigned) STRUCTURE_SIZE_BOUNDARY
);
5545 rli
->offset
= TYPE_SIZE_UNIT (t
);
5546 rli
->bitpos
= bitsize_zero_node
;
5547 rli
->record_align
= TYPE_ALIGN (t
);
5550 /* Find the last field. The artificial fields created for virtual
5551 bases will go after the last extant field to date. */
5552 next_field
= &TYPE_FIELDS (t
);
5554 next_field
= &DECL_CHAIN (*next_field
);
5556 /* Go through the virtual bases, allocating space for each virtual
5557 base that is not already a primary base class. These are
5558 allocated in inheritance graph order. */
5559 for (vbase
= TYPE_BINFO (t
); vbase
; vbase
= TREE_CHAIN (vbase
))
5561 if (!BINFO_VIRTUAL_P (vbase
))
5564 if (!BINFO_PRIMARY_P (vbase
))
5566 tree basetype
= TREE_TYPE (vbase
);
5568 /* This virtual base is not a primary base of any class in the
5569 hierarchy, so we have to add space for it. */
5570 next_field
= build_base_field (rli
, vbase
,
5571 offsets
, next_field
);
5573 /* If the first virtual base might have been placed at a
5574 lower address, had we started from CLASSTYPE_SIZE, rather
5575 than TYPE_SIZE, issue a warning. There can be both false
5576 positives and false negatives from this warning in rare
5577 cases; to deal with all the possibilities would probably
5578 require performing both layout algorithms and comparing
5579 the results which is not particularly tractable. */
5583 (size_binop (CEIL_DIV_EXPR
,
5584 round_up_loc (input_location
,
5586 CLASSTYPE_ALIGN (basetype
)),
5588 BINFO_OFFSET (vbase
))))
5590 "offset of virtual base %qT is not ABI-compliant and "
5591 "may change in a future version of GCC",
5594 first_vbase
= false;
5599 /* Returns the offset of the byte just past the end of the base class
5603 end_of_base (tree binfo
)
5607 if (!CLASSTYPE_AS_BASE (BINFO_TYPE (binfo
)))
5608 size
= TYPE_SIZE_UNIT (char_type_node
);
5609 else if (is_empty_class (BINFO_TYPE (binfo
)))
5610 /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to
5611 allocate some space for it. It cannot have virtual bases, so
5612 TYPE_SIZE_UNIT is fine. */
5613 size
= TYPE_SIZE_UNIT (BINFO_TYPE (binfo
));
5615 size
= CLASSTYPE_SIZE_UNIT (BINFO_TYPE (binfo
));
5617 return size_binop (PLUS_EXPR
, BINFO_OFFSET (binfo
), size
);
5620 /* Returns the offset of the byte just past the end of the base class
5621 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
5622 only non-virtual bases are included. */
5625 end_of_class (tree t
, int include_virtuals_p
)
5627 tree result
= size_zero_node
;
5628 vec
<tree
, va_gc
> *vbases
;
5634 for (binfo
= TYPE_BINFO (t
), i
= 0;
5635 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5637 if (!include_virtuals_p
5638 && BINFO_VIRTUAL_P (base_binfo
)
5639 && (!BINFO_PRIMARY_P (base_binfo
)
5640 || BINFO_INHERITANCE_CHAIN (base_binfo
) != TYPE_BINFO (t
)))
5643 offset
= end_of_base (base_binfo
);
5644 if (INT_CST_LT_UNSIGNED (result
, offset
))
5648 /* G++ 3.2 did not check indirect virtual bases. */
5649 if (abi_version_at_least (2) && include_virtuals_p
)
5650 for (vbases
= CLASSTYPE_VBASECLASSES (t
), i
= 0;
5651 vec_safe_iterate (vbases
, i
, &base_binfo
); i
++)
5653 offset
= end_of_base (base_binfo
);
5654 if (INT_CST_LT_UNSIGNED (result
, offset
))
5661 /* Warn about bases of T that are inaccessible because they are
5662 ambiguous. For example:
5665 struct T : public S {};
5666 struct U : public S, public T {};
5668 Here, `(S*) new U' is not allowed because there are two `S'
5672 warn_about_ambiguous_bases (tree t
)
5675 vec
<tree
, va_gc
> *vbases
;
5680 /* If there are no repeated bases, nothing can be ambiguous. */
5681 if (!CLASSTYPE_REPEATED_BASE_P (t
))
5684 /* Check direct bases. */
5685 for (binfo
= TYPE_BINFO (t
), i
= 0;
5686 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5688 basetype
= BINFO_TYPE (base_binfo
);
5690 if (!uniquely_derived_from_p (basetype
, t
))
5691 warning (0, "direct base %qT inaccessible in %qT due to ambiguity",
5695 /* Check for ambiguous virtual bases. */
5697 for (vbases
= CLASSTYPE_VBASECLASSES (t
), i
= 0;
5698 vec_safe_iterate (vbases
, i
, &binfo
); i
++)
5700 basetype
= BINFO_TYPE (binfo
);
5702 if (!uniquely_derived_from_p (basetype
, t
))
5703 warning (OPT_Wextra
, "virtual base %qT inaccessible in %qT due "
5704 "to ambiguity", basetype
, t
);
5708 /* Compare two INTEGER_CSTs K1 and K2. */
5711 splay_tree_compare_integer_csts (splay_tree_key k1
, splay_tree_key k2
)
5713 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
5716 /* Increase the size indicated in RLI to account for empty classes
5717 that are "off the end" of the class. */
5720 include_empty_classes (record_layout_info rli
)
5725 /* It might be the case that we grew the class to allocate a
5726 zero-sized base class. That won't be reflected in RLI, yet,
5727 because we are willing to overlay multiple bases at the same
5728 offset. However, now we need to make sure that RLI is big enough
5729 to reflect the entire class. */
5730 eoc
= end_of_class (rli
->t
,
5731 CLASSTYPE_AS_BASE (rli
->t
) != NULL_TREE
);
5732 rli_size
= rli_size_unit_so_far (rli
);
5733 if (TREE_CODE (rli_size
) == INTEGER_CST
5734 && INT_CST_LT_UNSIGNED (rli_size
, eoc
))
5736 if (!abi_version_at_least (2))
5737 /* In version 1 of the ABI, the size of a class that ends with
5738 a bitfield was not rounded up to a whole multiple of a
5739 byte. Because rli_size_unit_so_far returns only the number
5740 of fully allocated bytes, any extra bits were not included
5742 rli
->bitpos
= round_down (rli
->bitpos
, BITS_PER_UNIT
);
5744 /* The size should have been rounded to a whole byte. */
5745 gcc_assert (tree_int_cst_equal
5746 (rli
->bitpos
, round_down (rli
->bitpos
, BITS_PER_UNIT
)));
5748 = size_binop (PLUS_EXPR
,
5750 size_binop (MULT_EXPR
,
5751 convert (bitsizetype
,
5752 size_binop (MINUS_EXPR
,
5754 bitsize_int (BITS_PER_UNIT
)));
5755 normalize_rli (rli
);
5759 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
5760 BINFO_OFFSETs for all of the base-classes. Position the vtable
5761 pointer. Accumulate declared virtual functions on VIRTUALS_P. */
5764 layout_class_type (tree t
, tree
*virtuals_p
)
5766 tree non_static_data_members
;
5769 record_layout_info rli
;
5770 /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of
5771 types that appear at that offset. */
5772 splay_tree empty_base_offsets
;
5773 /* True if the last field layed out was a bit-field. */
5774 bool last_field_was_bitfield
= false;
5775 /* The location at which the next field should be inserted. */
5777 /* T, as a base class. */
5780 /* Keep track of the first non-static data member. */
5781 non_static_data_members
= TYPE_FIELDS (t
);
5783 /* Start laying out the record. */
5784 rli
= start_record_layout (t
);
5786 /* Mark all the primary bases in the hierarchy. */
5787 determine_primary_bases (t
);
5789 /* Create a pointer to our virtual function table. */
5790 vptr
= create_vtable_ptr (t
, virtuals_p
);
5792 /* The vptr is always the first thing in the class. */
5795 DECL_CHAIN (vptr
) = TYPE_FIELDS (t
);
5796 TYPE_FIELDS (t
) = vptr
;
5797 next_field
= &DECL_CHAIN (vptr
);
5798 place_field (rli
, vptr
);
5801 next_field
= &TYPE_FIELDS (t
);
5803 /* Build FIELD_DECLs for all of the non-virtual base-types. */
5804 empty_base_offsets
= splay_tree_new (splay_tree_compare_integer_csts
,
5806 build_base_fields (rli
, empty_base_offsets
, next_field
);
5808 /* Layout the non-static data members. */
5809 for (field
= non_static_data_members
; field
; field
= DECL_CHAIN (field
))
5814 /* We still pass things that aren't non-static data members to
5815 the back end, in case it wants to do something with them. */
5816 if (TREE_CODE (field
) != FIELD_DECL
)
5818 place_field (rli
, field
);
5819 /* If the static data member has incomplete type, keep track
5820 of it so that it can be completed later. (The handling
5821 of pending statics in finish_record_layout is
5822 insufficient; consider:
5825 struct S2 { static S1 s1; };
5827 At this point, finish_record_layout will be called, but
5828 S1 is still incomplete.) */
5829 if (TREE_CODE (field
) == VAR_DECL
)
5831 maybe_register_incomplete_var (field
);
5832 /* The visibility of static data members is determined
5833 at their point of declaration, not their point of
5835 determine_visibility (field
);
5840 type
= TREE_TYPE (field
);
5841 if (type
== error_mark_node
)
5844 padding
= NULL_TREE
;
5846 /* If this field is a bit-field whose width is greater than its
5847 type, then there are some special rules for allocating
5849 if (DECL_C_BIT_FIELD (field
)
5850 && INT_CST_LT (TYPE_SIZE (type
), DECL_SIZE (field
)))
5854 bool was_unnamed_p
= false;
5855 /* We must allocate the bits as if suitably aligned for the
5856 longest integer type that fits in this many bits. type
5857 of the field. Then, we are supposed to use the left over
5858 bits as additional padding. */
5859 for (itk
= itk_char
; itk
!= itk_none
; ++itk
)
5860 if (integer_types
[itk
] != NULL_TREE
5861 && (INT_CST_LT (size_int (MAX_FIXED_MODE_SIZE
),
5862 TYPE_SIZE (integer_types
[itk
]))
5863 || INT_CST_LT (DECL_SIZE (field
),
5864 TYPE_SIZE (integer_types
[itk
]))))
5867 /* ITK now indicates a type that is too large for the
5868 field. We have to back up by one to find the largest
5873 integer_type
= integer_types
[itk
];
5874 } while (itk
> 0 && integer_type
== NULL_TREE
);
5876 /* Figure out how much additional padding is required. GCC
5877 3.2 always created a padding field, even if it had zero
5879 if (!abi_version_at_least (2)
5880 || INT_CST_LT (TYPE_SIZE (integer_type
), DECL_SIZE (field
)))
5882 if (abi_version_at_least (2) && TREE_CODE (t
) == UNION_TYPE
)
5883 /* In a union, the padding field must have the full width
5884 of the bit-field; all fields start at offset zero. */
5885 padding
= DECL_SIZE (field
);
5888 if (TREE_CODE (t
) == UNION_TYPE
)
5889 warning (OPT_Wabi
, "size assigned to %qT may not be "
5890 "ABI-compliant and may change in a future "
5893 padding
= size_binop (MINUS_EXPR
, DECL_SIZE (field
),
5894 TYPE_SIZE (integer_type
));
5897 #ifdef PCC_BITFIELD_TYPE_MATTERS
5898 /* An unnamed bitfield does not normally affect the
5899 alignment of the containing class on a target where
5900 PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not
5901 make any exceptions for unnamed bitfields when the
5902 bitfields are longer than their types. Therefore, we
5903 temporarily give the field a name. */
5904 if (PCC_BITFIELD_TYPE_MATTERS
&& !DECL_NAME (field
))
5906 was_unnamed_p
= true;
5907 DECL_NAME (field
) = make_anon_name ();
5910 DECL_SIZE (field
) = TYPE_SIZE (integer_type
);
5911 DECL_ALIGN (field
) = TYPE_ALIGN (integer_type
);
5912 DECL_USER_ALIGN (field
) = TYPE_USER_ALIGN (integer_type
);
5913 layout_nonempty_base_or_field (rli
, field
, NULL_TREE
,
5914 empty_base_offsets
);
5916 DECL_NAME (field
) = NULL_TREE
;
5917 /* Now that layout has been performed, set the size of the
5918 field to the size of its declared type; the rest of the
5919 field is effectively invisible. */
5920 DECL_SIZE (field
) = TYPE_SIZE (type
);
5921 /* We must also reset the DECL_MODE of the field. */
5922 if (abi_version_at_least (2))
5923 DECL_MODE (field
) = TYPE_MODE (type
);
5925 && DECL_MODE (field
) != TYPE_MODE (type
))
5926 /* Versions of G++ before G++ 3.4 did not reset the
5929 "the offset of %qD may not be ABI-compliant and may "
5930 "change in a future version of GCC", field
);
5933 layout_nonempty_base_or_field (rli
, field
, NULL_TREE
,
5934 empty_base_offsets
);
5936 /* Remember the location of any empty classes in FIELD. */
5937 if (abi_version_at_least (2))
5938 record_subobject_offsets (TREE_TYPE (field
),
5939 byte_position(field
),
5941 /*is_data_member=*/true);
5943 /* If a bit-field does not immediately follow another bit-field,
5944 and yet it starts in the middle of a byte, we have failed to
5945 comply with the ABI. */
5947 && DECL_C_BIT_FIELD (field
)
5948 /* The TREE_NO_WARNING flag gets set by Objective-C when
5949 laying out an Objective-C class. The ObjC ABI differs
5950 from the C++ ABI, and so we do not want a warning
5952 && !TREE_NO_WARNING (field
)
5953 && !last_field_was_bitfield
5954 && !integer_zerop (size_binop (TRUNC_MOD_EXPR
,
5955 DECL_FIELD_BIT_OFFSET (field
),
5956 bitsize_unit_node
)))
5957 warning (OPT_Wabi
, "offset of %q+D is not ABI-compliant and may "
5958 "change in a future version of GCC", field
);
5960 /* G++ used to use DECL_FIELD_OFFSET as if it were the byte
5961 offset of the field. */
5963 && !abi_version_at_least (2)
5964 && !tree_int_cst_equal (DECL_FIELD_OFFSET (field
),
5965 byte_position (field
))
5966 && contains_empty_class_p (TREE_TYPE (field
)))
5967 warning (OPT_Wabi
, "%q+D contains empty classes which may cause base "
5968 "classes to be placed at different locations in a "
5969 "future version of GCC", field
);
5971 /* The middle end uses the type of expressions to determine the
5972 possible range of expression values. In order to optimize
5973 "x.i > 7" to "false" for a 2-bit bitfield "i", the middle end
5974 must be made aware of the width of "i", via its type.
5976 Because C++ does not have integer types of arbitrary width,
5977 we must (for the purposes of the front end) convert from the
5978 type assigned here to the declared type of the bitfield
5979 whenever a bitfield expression is used as an rvalue.
5980 Similarly, when assigning a value to a bitfield, the value
5981 must be converted to the type given the bitfield here. */
5982 if (DECL_C_BIT_FIELD (field
))
5984 unsigned HOST_WIDE_INT width
;
5985 tree ftype
= TREE_TYPE (field
);
5986 width
= tree_low_cst (DECL_SIZE (field
), /*unsignedp=*/1);
5987 if (width
!= TYPE_PRECISION (ftype
))
5990 = c_build_bitfield_integer_type (width
,
5991 TYPE_UNSIGNED (ftype
));
5993 = cp_build_qualified_type (TREE_TYPE (field
),
5994 cp_type_quals (ftype
));
5998 /* If we needed additional padding after this field, add it
6004 padding_field
= build_decl (input_location
,
6008 DECL_BIT_FIELD (padding_field
) = 1;
6009 DECL_SIZE (padding_field
) = padding
;
6010 DECL_CONTEXT (padding_field
) = t
;
6011 DECL_ARTIFICIAL (padding_field
) = 1;
6012 DECL_IGNORED_P (padding_field
) = 1;
6013 layout_nonempty_base_or_field (rli
, padding_field
,
6015 empty_base_offsets
);
6018 last_field_was_bitfield
= DECL_C_BIT_FIELD (field
);
6021 if (abi_version_at_least (2) && !integer_zerop (rli
->bitpos
))
6023 /* Make sure that we are on a byte boundary so that the size of
6024 the class without virtual bases will always be a round number
6026 rli
->bitpos
= round_up_loc (input_location
, rli
->bitpos
, BITS_PER_UNIT
);
6027 normalize_rli (rli
);
6030 /* G++ 3.2 does not allow virtual bases to be overlaid with tail
6032 if (!abi_version_at_least (2))
6033 include_empty_classes(rli
);
6035 /* Delete all zero-width bit-fields from the list of fields. Now
6036 that the type is laid out they are no longer important. */
6037 remove_zero_width_bit_fields (t
);
6039 /* Create the version of T used for virtual bases. We do not use
6040 make_class_type for this version; this is an artificial type. For
6041 a POD type, we just reuse T. */
6042 if (CLASSTYPE_NON_LAYOUT_POD_P (t
) || CLASSTYPE_EMPTY_P (t
))
6044 base_t
= make_node (TREE_CODE (t
));
6046 /* Set the size and alignment for the new type. In G++ 3.2, all
6047 empty classes were considered to have size zero when used as
6049 if (!abi_version_at_least (2) && CLASSTYPE_EMPTY_P (t
))
6051 TYPE_SIZE (base_t
) = bitsize_zero_node
;
6052 TYPE_SIZE_UNIT (base_t
) = size_zero_node
;
6053 if (warn_abi
&& !integer_zerop (rli_size_unit_so_far (rli
)))
6055 "layout of classes derived from empty class %qT "
6056 "may change in a future version of GCC",
6063 /* If the ABI version is not at least two, and the last
6064 field was a bit-field, RLI may not be on a byte
6065 boundary. In particular, rli_size_unit_so_far might
6066 indicate the last complete byte, while rli_size_so_far
6067 indicates the total number of bits used. Therefore,
6068 rli_size_so_far, rather than rli_size_unit_so_far, is
6069 used to compute TYPE_SIZE_UNIT. */
6070 eoc
= end_of_class (t
, /*include_virtuals_p=*/0);
6071 TYPE_SIZE_UNIT (base_t
)
6072 = size_binop (MAX_EXPR
,
6074 size_binop (CEIL_DIV_EXPR
,
6075 rli_size_so_far (rli
),
6076 bitsize_int (BITS_PER_UNIT
))),
6079 = size_binop (MAX_EXPR
,
6080 rli_size_so_far (rli
),
6081 size_binop (MULT_EXPR
,
6082 convert (bitsizetype
, eoc
),
6083 bitsize_int (BITS_PER_UNIT
)));
6085 TYPE_ALIGN (base_t
) = rli
->record_align
;
6086 TYPE_USER_ALIGN (base_t
) = TYPE_USER_ALIGN (t
);
6088 /* Copy the fields from T. */
6089 next_field
= &TYPE_FIELDS (base_t
);
6090 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
6091 if (TREE_CODE (field
) == FIELD_DECL
)
6093 *next_field
= build_decl (input_location
,
6097 DECL_CONTEXT (*next_field
) = base_t
;
6098 DECL_FIELD_OFFSET (*next_field
) = DECL_FIELD_OFFSET (field
);
6099 DECL_FIELD_BIT_OFFSET (*next_field
)
6100 = DECL_FIELD_BIT_OFFSET (field
);
6101 DECL_SIZE (*next_field
) = DECL_SIZE (field
);
6102 DECL_MODE (*next_field
) = DECL_MODE (field
);
6103 next_field
= &DECL_CHAIN (*next_field
);
6106 /* Record the base version of the type. */
6107 CLASSTYPE_AS_BASE (t
) = base_t
;
6108 TYPE_CONTEXT (base_t
) = t
;
6111 CLASSTYPE_AS_BASE (t
) = t
;
6113 /* Every empty class contains an empty class. */
6114 if (CLASSTYPE_EMPTY_P (t
))
6115 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 1;
6117 /* Set the TYPE_DECL for this type to contain the right
6118 value for DECL_OFFSET, so that we can use it as part
6119 of a COMPONENT_REF for multiple inheritance. */
6120 layout_decl (TYPE_MAIN_DECL (t
), 0);
6122 /* Now fix up any virtual base class types that we left lying
6123 around. We must get these done before we try to lay out the
6124 virtual function table. As a side-effect, this will remove the
6125 base subobject fields. */
6126 layout_virtual_bases (rli
, empty_base_offsets
);
6128 /* Make sure that empty classes are reflected in RLI at this
6130 include_empty_classes(rli
);
6132 /* Make sure not to create any structures with zero size. */
6133 if (integer_zerop (rli_size_unit_so_far (rli
)) && CLASSTYPE_EMPTY_P (t
))
6135 build_decl (input_location
,
6136 FIELD_DECL
, NULL_TREE
, char_type_node
));
6138 /* If this is a non-POD, declaring it packed makes a difference to how it
6139 can be used as a field; don't let finalize_record_size undo it. */
6140 if (TYPE_PACKED (t
) && !layout_pod_type_p (t
))
6141 rli
->packed_maybe_necessary
= true;
6143 /* Let the back end lay out the type. */
6144 finish_record_layout (rli
, /*free_p=*/true);
6146 /* Warn about bases that can't be talked about due to ambiguity. */
6147 warn_about_ambiguous_bases (t
);
6149 /* Now that we're done with layout, give the base fields the real types. */
6150 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
6151 if (DECL_ARTIFICIAL (field
) && IS_FAKE_BASE_TYPE (TREE_TYPE (field
)))
6152 TREE_TYPE (field
) = TYPE_CONTEXT (TREE_TYPE (field
));
6155 splay_tree_delete (empty_base_offsets
);
6157 if (CLASSTYPE_EMPTY_P (t
)
6158 && tree_int_cst_lt (sizeof_biggest_empty_class
,
6159 TYPE_SIZE_UNIT (t
)))
6160 sizeof_biggest_empty_class
= TYPE_SIZE_UNIT (t
);
6163 /* Determine the "key method" for the class type indicated by TYPE,
6164 and set CLASSTYPE_KEY_METHOD accordingly. */
6167 determine_key_method (tree type
)
6171 if (TYPE_FOR_JAVA (type
)
6172 || processing_template_decl
6173 || CLASSTYPE_TEMPLATE_INSTANTIATION (type
)
6174 || CLASSTYPE_INTERFACE_KNOWN (type
))
6177 /* The key method is the first non-pure virtual function that is not
6178 inline at the point of class definition. On some targets the
6179 key function may not be inline; those targets should not call
6180 this function until the end of the translation unit. */
6181 for (method
= TYPE_METHODS (type
); method
!= NULL_TREE
;
6182 method
= DECL_CHAIN (method
))
6183 if (DECL_VINDEX (method
) != NULL_TREE
6184 && ! DECL_DECLARED_INLINE_P (method
)
6185 && ! DECL_PURE_VIRTUAL_P (method
))
6187 CLASSTYPE_KEY_METHOD (type
) = method
;
6195 /* Allocate and return an instance of struct sorted_fields_type with
6198 static struct sorted_fields_type
*
6199 sorted_fields_type_new (int n
)
6201 struct sorted_fields_type
*sft
;
6202 sft
= ggc_alloc_sorted_fields_type (sizeof (struct sorted_fields_type
)
6203 + n
* sizeof (tree
));
6210 /* Perform processing required when the definition of T (a class type)
6214 finish_struct_1 (tree t
)
6217 /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */
6218 tree virtuals
= NULL_TREE
;
6220 if (COMPLETE_TYPE_P (t
))
6222 gcc_assert (MAYBE_CLASS_TYPE_P (t
));
6223 error ("redefinition of %q#T", t
);
6228 /* If this type was previously laid out as a forward reference,
6229 make sure we lay it out again. */
6230 TYPE_SIZE (t
) = NULL_TREE
;
6231 CLASSTYPE_PRIMARY_BINFO (t
) = NULL_TREE
;
6233 /* Make assumptions about the class; we'll reset the flags if
6235 CLASSTYPE_EMPTY_P (t
) = 1;
6236 CLASSTYPE_NEARLY_EMPTY_P (t
) = 1;
6237 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 0;
6238 CLASSTYPE_LITERAL_P (t
) = true;
6240 /* Do end-of-class semantic processing: checking the validity of the
6241 bases and members and add implicitly generated methods. */
6242 check_bases_and_members (t
);
6244 /* Find the key method. */
6245 if (TYPE_CONTAINS_VPTR_P (t
))
6247 /* The Itanium C++ ABI permits the key method to be chosen when
6248 the class is defined -- even though the key method so
6249 selected may later turn out to be an inline function. On
6250 some systems (such as ARM Symbian OS) the key method cannot
6251 be determined until the end of the translation unit. On such
6252 systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which
6253 will cause the class to be added to KEYED_CLASSES. Then, in
6254 finish_file we will determine the key method. */
6255 if (targetm
.cxx
.key_method_may_be_inline ())
6256 determine_key_method (t
);
6258 /* If a polymorphic class has no key method, we may emit the vtable
6259 in every translation unit where the class definition appears. */
6260 if (CLASSTYPE_KEY_METHOD (t
) == NULL_TREE
)
6261 keyed_classes
= tree_cons (NULL_TREE
, t
, keyed_classes
);
6264 /* Layout the class itself. */
6265 layout_class_type (t
, &virtuals
);
6266 if (CLASSTYPE_AS_BASE (t
) != t
)
6267 /* We use the base type for trivial assignments, and hence it
6269 compute_record_mode (CLASSTYPE_AS_BASE (t
));
6271 virtuals
= modify_all_vtables (t
, nreverse (virtuals
));
6273 /* If necessary, create the primary vtable for this class. */
6274 if (virtuals
|| TYPE_CONTAINS_VPTR_P (t
))
6276 /* We must enter these virtuals into the table. */
6277 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
6278 build_primary_vtable (NULL_TREE
, t
);
6279 else if (! BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (t
)))
6280 /* Here we know enough to change the type of our virtual
6281 function table, but we will wait until later this function. */
6282 build_primary_vtable (CLASSTYPE_PRIMARY_BINFO (t
), t
);
6284 /* If we're warning about ABI tags, check the types of the new
6285 virtual functions. */
6287 for (tree v
= virtuals
; v
; v
= TREE_CHAIN (v
))
6288 check_abi_tags (t
, TREE_VALUE (v
));
6291 if (TYPE_CONTAINS_VPTR_P (t
))
6296 if (BINFO_VTABLE (TYPE_BINFO (t
)))
6297 gcc_assert (DECL_VIRTUAL_P (BINFO_VTABLE (TYPE_BINFO (t
))));
6298 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
6299 gcc_assert (BINFO_VIRTUALS (TYPE_BINFO (t
)) == NULL_TREE
);
6301 /* Add entries for virtual functions introduced by this class. */
6302 BINFO_VIRTUALS (TYPE_BINFO (t
))
6303 = chainon (BINFO_VIRTUALS (TYPE_BINFO (t
)), virtuals
);
6305 /* Set DECL_VINDEX for all functions declared in this class. */
6306 for (vindex
= 0, fn
= BINFO_VIRTUALS (TYPE_BINFO (t
));
6308 fn
= TREE_CHAIN (fn
),
6309 vindex
+= (TARGET_VTABLE_USES_DESCRIPTORS
6310 ? TARGET_VTABLE_USES_DESCRIPTORS
: 1))
6312 tree fndecl
= BV_FN (fn
);
6314 if (DECL_THUNK_P (fndecl
))
6315 /* A thunk. We should never be calling this entry directly
6316 from this vtable -- we'd use the entry for the non
6317 thunk base function. */
6318 DECL_VINDEX (fndecl
) = NULL_TREE
;
6319 else if (TREE_CODE (DECL_VINDEX (fndecl
)) != INTEGER_CST
)
6320 DECL_VINDEX (fndecl
) = build_int_cst (NULL_TREE
, vindex
);
6324 finish_struct_bits (t
);
6325 set_method_tm_attributes (t
);
6327 /* Complete the rtl for any static member objects of the type we're
6329 for (x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
6330 if (TREE_CODE (x
) == VAR_DECL
&& TREE_STATIC (x
)
6331 && TREE_TYPE (x
) != error_mark_node
6332 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (x
)), t
))
6333 DECL_MODE (x
) = TYPE_MODE (t
);
6335 /* Done with FIELDS...now decide whether to sort these for
6336 faster lookups later.
6338 We use a small number because most searches fail (succeeding
6339 ultimately as the search bores through the inheritance
6340 hierarchy), and we want this failure to occur quickly. */
6342 insert_into_classtype_sorted_fields (TYPE_FIELDS (t
), t
, 8);
6344 /* Complain if one of the field types requires lower visibility. */
6345 constrain_class_visibility (t
);
6347 /* Make the rtl for any new vtables we have created, and unmark
6348 the base types we marked. */
6351 /* Build the VTT for T. */
6354 /* This warning does not make sense for Java classes, since they
6355 cannot have destructors. */
6356 if (!TYPE_FOR_JAVA (t
) && warn_nonvdtor
&& TYPE_POLYMORPHIC_P (t
))
6360 dtor
= CLASSTYPE_DESTRUCTORS (t
);
6361 if (/* An implicitly declared destructor is always public. And,
6362 if it were virtual, we would have created it by now. */
6364 || (!DECL_VINDEX (dtor
)
6365 && (/* public non-virtual */
6366 (!TREE_PRIVATE (dtor
) && !TREE_PROTECTED (dtor
))
6367 || (/* non-public non-virtual with friends */
6368 (TREE_PRIVATE (dtor
) || TREE_PROTECTED (dtor
))
6369 && (CLASSTYPE_FRIEND_CLASSES (t
)
6370 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t
)))))))
6371 warning (OPT_Wnon_virtual_dtor
,
6372 "%q#T has virtual functions and accessible"
6373 " non-virtual destructor", t
);
6378 if (warn_overloaded_virtual
)
6381 /* Class layout, assignment of virtual table slots, etc., is now
6382 complete. Give the back end a chance to tweak the visibility of
6383 the class or perform any other required target modifications. */
6384 targetm
.cxx
.adjust_class_at_definition (t
);
6386 maybe_suppress_debug_info (t
);
6388 dump_class_hierarchy (t
);
6390 /* Finish debugging output for this type. */
6391 rest_of_type_compilation (t
, ! LOCAL_CLASS_P (t
));
6393 if (TYPE_TRANSPARENT_AGGR (t
))
6395 tree field
= first_field (t
);
6396 if (field
== NULL_TREE
|| error_operand_p (field
))
6398 error ("type transparent %q#T does not have any fields", t
);
6399 TYPE_TRANSPARENT_AGGR (t
) = 0;
6401 else if (DECL_ARTIFICIAL (field
))
6403 if (DECL_FIELD_IS_BASE (field
))
6404 error ("type transparent class %qT has base classes", t
);
6407 gcc_checking_assert (DECL_VIRTUAL_P (field
));
6408 error ("type transparent class %qT has virtual functions", t
);
6410 TYPE_TRANSPARENT_AGGR (t
) = 0;
6412 else if (TYPE_MODE (t
) != DECL_MODE (field
))
6414 error ("type transparent %q#T cannot be made transparent because "
6415 "the type of the first field has a different ABI from the "
6416 "class overall", t
);
6417 TYPE_TRANSPARENT_AGGR (t
) = 0;
6422 /* Insert FIELDS into T for the sorted case if the FIELDS count is
6423 equal to THRESHOLD or greater than THRESHOLD. */
6426 insert_into_classtype_sorted_fields (tree fields
, tree t
, int threshold
)
6428 int n_fields
= count_fields (fields
);
6429 if (n_fields
>= threshold
)
6431 struct sorted_fields_type
*field_vec
= sorted_fields_type_new (n_fields
);
6432 add_fields_to_record_type (fields
, field_vec
, 0);
6433 qsort (field_vec
->elts
, n_fields
, sizeof (tree
), field_decl_cmp
);
6434 CLASSTYPE_SORTED_FIELDS (t
) = field_vec
;
6438 /* Insert lately defined enum ENUMTYPE into T for the sorted case. */
6441 insert_late_enum_def_into_classtype_sorted_fields (tree enumtype
, tree t
)
6443 struct sorted_fields_type
*sorted_fields
= CLASSTYPE_SORTED_FIELDS (t
);
6448 = list_length (TYPE_VALUES (enumtype
)) + sorted_fields
->len
;
6449 struct sorted_fields_type
*field_vec
= sorted_fields_type_new (n_fields
);
6451 for (i
= 0; i
< sorted_fields
->len
; ++i
)
6452 field_vec
->elts
[i
] = sorted_fields
->elts
[i
];
6454 add_enum_fields_to_record_type (enumtype
, field_vec
,
6455 sorted_fields
->len
);
6456 qsort (field_vec
->elts
, n_fields
, sizeof (tree
), field_decl_cmp
);
6457 CLASSTYPE_SORTED_FIELDS (t
) = field_vec
;
6461 /* When T was built up, the member declarations were added in reverse
6462 order. Rearrange them to declaration order. */
6465 unreverse_member_declarations (tree t
)
6471 /* The following lists are all in reverse order. Put them in
6472 declaration order now. */
6473 TYPE_METHODS (t
) = nreverse (TYPE_METHODS (t
));
6474 CLASSTYPE_DECL_LIST (t
) = nreverse (CLASSTYPE_DECL_LIST (t
));
6476 /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in
6477 reverse order, so we can't just use nreverse. */
6479 for (x
= TYPE_FIELDS (t
);
6480 x
&& TREE_CODE (x
) != TYPE_DECL
;
6483 next
= DECL_CHAIN (x
);
6484 DECL_CHAIN (x
) = prev
;
6489 DECL_CHAIN (TYPE_FIELDS (t
)) = x
;
6491 TYPE_FIELDS (t
) = prev
;
6496 finish_struct (tree t
, tree attributes
)
6498 location_t saved_loc
= input_location
;
6500 /* Now that we've got all the field declarations, reverse everything
6502 unreverse_member_declarations (t
);
6504 cplus_decl_attributes (&t
, attributes
, (int) ATTR_FLAG_TYPE_IN_PLACE
);
6506 /* Nadger the current location so that diagnostics point to the start of
6507 the struct, not the end. */
6508 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (t
));
6510 if (processing_template_decl
)
6514 finish_struct_methods (t
);
6515 TYPE_SIZE (t
) = bitsize_zero_node
;
6516 TYPE_SIZE_UNIT (t
) = size_zero_node
;
6518 /* We need to emit an error message if this type was used as a parameter
6519 and it is an abstract type, even if it is a template. We construct
6520 a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into
6521 account and we call complete_vars with this type, which will check
6522 the PARM_DECLS. Note that while the type is being defined,
6523 CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends
6524 (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */
6525 CLASSTYPE_PURE_VIRTUALS (t
) = NULL
;
6526 for (x
= TYPE_METHODS (t
); x
; x
= DECL_CHAIN (x
))
6527 if (DECL_PURE_VIRTUAL_P (x
))
6528 vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t
), x
);
6530 /* We need to add the target functions to the CLASSTYPE_METHOD_VEC if
6531 an enclosing scope is a template class, so that this function be
6532 found by lookup_fnfields_1 when the using declaration is not
6533 instantiated yet. */
6534 for (x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
6535 if (TREE_CODE (x
) == USING_DECL
)
6537 tree fn
= strip_using_decl (x
);
6538 if (is_overloaded_fn (fn
))
6539 for (; fn
; fn
= OVL_NEXT (fn
))
6540 add_method (t
, OVL_CURRENT (fn
), x
);
6543 /* Remember current #pragma pack value. */
6544 TYPE_PRECISION (t
) = maximum_field_alignment
;
6546 /* Fix up any variants we've already built. */
6547 for (x
= TYPE_NEXT_VARIANT (t
); x
; x
= TYPE_NEXT_VARIANT (x
))
6549 TYPE_SIZE (x
) = TYPE_SIZE (t
);
6550 TYPE_SIZE_UNIT (x
) = TYPE_SIZE_UNIT (t
);
6551 TYPE_FIELDS (x
) = TYPE_FIELDS (t
);
6552 TYPE_METHODS (x
) = TYPE_METHODS (t
);
6556 finish_struct_1 (t
);
6558 input_location
= saved_loc
;
6560 TYPE_BEING_DEFINED (t
) = 0;
6562 if (current_class_type
)
6565 error ("trying to finish struct, but kicked out due to previous parse errors");
6567 if (processing_template_decl
&& at_function_scope_p ()
6568 /* Lambdas are defined by the LAMBDA_EXPR. */
6569 && !LAMBDA_TYPE_P (t
))
6570 add_stmt (build_min (TAG_DEFN
, t
));
6575 /* Hash table to avoid endless recursion when handling references. */
6576 static hash_table
<pointer_hash
<tree_node
> > fixed_type_or_null_ref_ht
;
6578 /* Return the dynamic type of INSTANCE, if known.
6579 Used to determine whether the virtual function table is needed
6582 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
6583 of our knowledge of its type. *NONNULL should be initialized
6584 before this function is called. */
6587 fixed_type_or_null (tree instance
, int *nonnull
, int *cdtorp
)
6589 #define RECUR(T) fixed_type_or_null((T), nonnull, cdtorp)
6591 switch (TREE_CODE (instance
))
6594 if (POINTER_TYPE_P (TREE_TYPE (instance
)))
6597 return RECUR (TREE_OPERAND (instance
, 0));
6600 /* This is a call to a constructor, hence it's never zero. */
6601 if (TREE_HAS_CONSTRUCTOR (instance
))
6605 return TREE_TYPE (instance
);
6610 /* This is a call to a constructor, hence it's never zero. */
6611 if (TREE_HAS_CONSTRUCTOR (instance
))
6615 return TREE_TYPE (instance
);
6617 return RECUR (TREE_OPERAND (instance
, 0));
6619 case POINTER_PLUS_EXPR
:
6622 if (TREE_CODE (TREE_OPERAND (instance
, 0)) == ADDR_EXPR
)
6623 return RECUR (TREE_OPERAND (instance
, 0));
6624 if (TREE_CODE (TREE_OPERAND (instance
, 1)) == INTEGER_CST
)
6625 /* Propagate nonnull. */
6626 return RECUR (TREE_OPERAND (instance
, 0));
6631 return RECUR (TREE_OPERAND (instance
, 0));
6634 instance
= TREE_OPERAND (instance
, 0);
6637 /* Just because we see an ADDR_EXPR doesn't mean we're dealing
6638 with a real object -- given &p->f, p can still be null. */
6639 tree t
= get_base_address (instance
);
6640 /* ??? Probably should check DECL_WEAK here. */
6641 if (t
&& DECL_P (t
))
6644 return RECUR (instance
);
6647 /* If this component is really a base class reference, then the field
6648 itself isn't definitive. */
6649 if (DECL_FIELD_IS_BASE (TREE_OPERAND (instance
, 1)))
6650 return RECUR (TREE_OPERAND (instance
, 0));
6651 return RECUR (TREE_OPERAND (instance
, 1));
6655 if (TREE_CODE (TREE_TYPE (instance
)) == ARRAY_TYPE
6656 && MAYBE_CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (instance
))))
6660 return TREE_TYPE (TREE_TYPE (instance
));
6662 /* fall through... */
6666 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (instance
)))
6670 return TREE_TYPE (instance
);
6672 else if (instance
== current_class_ptr
)
6677 /* if we're in a ctor or dtor, we know our type. If
6678 current_class_ptr is set but we aren't in a function, we're in
6679 an NSDMI (and therefore a constructor). */
6680 if (current_scope () != current_function_decl
6681 || (DECL_LANG_SPECIFIC (current_function_decl
)
6682 && (DECL_CONSTRUCTOR_P (current_function_decl
)
6683 || DECL_DESTRUCTOR_P (current_function_decl
))))
6687 return TREE_TYPE (TREE_TYPE (instance
));
6690 else if (TREE_CODE (TREE_TYPE (instance
)) == REFERENCE_TYPE
)
6692 /* We only need one hash table because it is always left empty. */
6693 if (!fixed_type_or_null_ref_ht
.is_created ())
6694 fixed_type_or_null_ref_ht
.create (37);
6696 /* Reference variables should be references to objects. */
6700 /* Enter the INSTANCE in a table to prevent recursion; a
6701 variable's initializer may refer to the variable
6703 if (TREE_CODE (instance
) == VAR_DECL
6704 && DECL_INITIAL (instance
)
6705 && !type_dependent_expression_p_push (DECL_INITIAL (instance
))
6706 && !fixed_type_or_null_ref_ht
.find (instance
))
6711 slot
= fixed_type_or_null_ref_ht
.find_slot (instance
, INSERT
);
6713 type
= RECUR (DECL_INITIAL (instance
));
6714 fixed_type_or_null_ref_ht
.remove_elt (instance
);
6727 /* Return nonzero if the dynamic type of INSTANCE is known, and
6728 equivalent to the static type. We also handle the case where
6729 INSTANCE is really a pointer. Return negative if this is a
6730 ctor/dtor. There the dynamic type is known, but this might not be
6731 the most derived base of the original object, and hence virtual
6732 bases may not be layed out according to this type.
6734 Used to determine whether the virtual function table is needed
6737 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
6738 of our knowledge of its type. *NONNULL should be initialized
6739 before this function is called. */
6742 resolves_to_fixed_type_p (tree instance
, int* nonnull
)
6744 tree t
= TREE_TYPE (instance
);
6748 /* processing_template_decl can be false in a template if we're in
6749 fold_non_dependent_expr, but we still want to suppress this check. */
6750 if (in_template_function ())
6752 /* In a template we only care about the type of the result. */
6758 fixed
= fixed_type_or_null (instance
, nonnull
, &cdtorp
);
6759 if (fixed
== NULL_TREE
)
6761 if (POINTER_TYPE_P (t
))
6763 if (!same_type_ignoring_top_level_qualifiers_p (t
, fixed
))
6765 return cdtorp
? -1 : 1;
6770 init_class_processing (void)
6772 current_class_depth
= 0;
6773 current_class_stack_size
= 10;
6775 = XNEWVEC (struct class_stack_node
, current_class_stack_size
);
6776 vec_alloc (local_classes
, 8);
6777 sizeof_biggest_empty_class
= size_zero_node
;
6779 ridpointers
[(int) RID_PUBLIC
] = access_public_node
;
6780 ridpointers
[(int) RID_PRIVATE
] = access_private_node
;
6781 ridpointers
[(int) RID_PROTECTED
] = access_protected_node
;
6784 /* Restore the cached PREVIOUS_CLASS_LEVEL. */
6787 restore_class_cache (void)
6791 /* We are re-entering the same class we just left, so we don't
6792 have to search the whole inheritance matrix to find all the
6793 decls to bind again. Instead, we install the cached
6794 class_shadowed list and walk through it binding names. */
6795 push_binding_level (previous_class_level
);
6796 class_binding_level
= previous_class_level
;
6797 /* Restore IDENTIFIER_TYPE_VALUE. */
6798 for (type
= class_binding_level
->type_shadowed
;
6800 type
= TREE_CHAIN (type
))
6801 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (type
), TREE_TYPE (type
));
6804 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as
6805 appropriate for TYPE.
6807 So that we may avoid calls to lookup_name, we cache the _TYPE
6808 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
6810 For multiple inheritance, we perform a two-pass depth-first search
6811 of the type lattice. */
6814 pushclass (tree type
)
6816 class_stack_node_t csn
;
6818 type
= TYPE_MAIN_VARIANT (type
);
6820 /* Make sure there is enough room for the new entry on the stack. */
6821 if (current_class_depth
+ 1 >= current_class_stack_size
)
6823 current_class_stack_size
*= 2;
6825 = XRESIZEVEC (struct class_stack_node
, current_class_stack
,
6826 current_class_stack_size
);
6829 /* Insert a new entry on the class stack. */
6830 csn
= current_class_stack
+ current_class_depth
;
6831 csn
->name
= current_class_name
;
6832 csn
->type
= current_class_type
;
6833 csn
->access
= current_access_specifier
;
6834 csn
->names_used
= 0;
6836 current_class_depth
++;
6838 /* Now set up the new type. */
6839 current_class_name
= TYPE_NAME (type
);
6840 if (TREE_CODE (current_class_name
) == TYPE_DECL
)
6841 current_class_name
= DECL_NAME (current_class_name
);
6842 current_class_type
= type
;
6844 /* By default, things in classes are private, while things in
6845 structures or unions are public. */
6846 current_access_specifier
= (CLASSTYPE_DECLARED_CLASS (type
)
6847 ? access_private_node
6848 : access_public_node
);
6850 if (previous_class_level
6851 && type
!= previous_class_level
->this_entity
6852 && current_class_depth
== 1)
6854 /* Forcibly remove any old class remnants. */
6855 invalidate_class_lookup_cache ();
6858 if (!previous_class_level
6859 || type
!= previous_class_level
->this_entity
6860 || current_class_depth
> 1)
6863 restore_class_cache ();
6866 /* When we exit a toplevel class scope, we save its binding level so
6867 that we can restore it quickly. Here, we've entered some other
6868 class, so we must invalidate our cache. */
6871 invalidate_class_lookup_cache (void)
6873 previous_class_level
= NULL
;
6876 /* Get out of the current class scope. If we were in a class scope
6877 previously, that is the one popped to. */
6884 current_class_depth
--;
6885 current_class_name
= current_class_stack
[current_class_depth
].name
;
6886 current_class_type
= current_class_stack
[current_class_depth
].type
;
6887 current_access_specifier
= current_class_stack
[current_class_depth
].access
;
6888 if (current_class_stack
[current_class_depth
].names_used
)
6889 splay_tree_delete (current_class_stack
[current_class_depth
].names_used
);
6892 /* Mark the top of the class stack as hidden. */
6895 push_class_stack (void)
6897 if (current_class_depth
)
6898 ++current_class_stack
[current_class_depth
- 1].hidden
;
6901 /* Mark the top of the class stack as un-hidden. */
6904 pop_class_stack (void)
6906 if (current_class_depth
)
6907 --current_class_stack
[current_class_depth
- 1].hidden
;
6910 /* Returns 1 if the class type currently being defined is either T or
6911 a nested type of T. */
6914 currently_open_class (tree t
)
6918 if (!CLASS_TYPE_P (t
))
6921 t
= TYPE_MAIN_VARIANT (t
);
6923 /* We start looking from 1 because entry 0 is from global scope,
6925 for (i
= current_class_depth
; i
> 0; --i
)
6928 if (i
== current_class_depth
)
6929 c
= current_class_type
;
6932 if (current_class_stack
[i
].hidden
)
6934 c
= current_class_stack
[i
].type
;
6938 if (same_type_p (c
, t
))
6944 /* If either current_class_type or one of its enclosing classes are derived
6945 from T, return the appropriate type. Used to determine how we found
6946 something via unqualified lookup. */
6949 currently_open_derived_class (tree t
)
6953 /* The bases of a dependent type are unknown. */
6954 if (dependent_type_p (t
))
6957 if (!current_class_type
)
6960 if (DERIVED_FROM_P (t
, current_class_type
))
6961 return current_class_type
;
6963 for (i
= current_class_depth
- 1; i
> 0; --i
)
6965 if (current_class_stack
[i
].hidden
)
6967 if (DERIVED_FROM_P (t
, current_class_stack
[i
].type
))
6968 return current_class_stack
[i
].type
;
6974 /* Returns the innermost class type which is not a lambda closure type. */
6977 current_nonlambda_class_type (void)
6981 /* We start looking from 1 because entry 0 is from global scope,
6983 for (i
= current_class_depth
; i
> 0; --i
)
6986 if (i
== current_class_depth
)
6987 c
= current_class_type
;
6990 if (current_class_stack
[i
].hidden
)
6992 c
= current_class_stack
[i
].type
;
6996 if (!LAMBDA_TYPE_P (c
))
7002 /* When entering a class scope, all enclosing class scopes' names with
7003 static meaning (static variables, static functions, types and
7004 enumerators) have to be visible. This recursive function calls
7005 pushclass for all enclosing class contexts until global or a local
7006 scope is reached. TYPE is the enclosed class. */
7009 push_nested_class (tree type
)
7011 /* A namespace might be passed in error cases, like A::B:C. */
7012 if (type
== NULL_TREE
7013 || !CLASS_TYPE_P (type
))
7016 push_nested_class (DECL_CONTEXT (TYPE_MAIN_DECL (type
)));
7021 /* Undoes a push_nested_class call. */
7024 pop_nested_class (void)
7026 tree context
= DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type
));
7029 if (context
&& CLASS_TYPE_P (context
))
7030 pop_nested_class ();
7033 /* Returns the number of extern "LANG" blocks we are nested within. */
7036 current_lang_depth (void)
7038 return vec_safe_length (current_lang_base
);
7041 /* Set global variables CURRENT_LANG_NAME to appropriate value
7042 so that behavior of name-mangling machinery is correct. */
7045 push_lang_context (tree name
)
7047 vec_safe_push (current_lang_base
, current_lang_name
);
7049 if (name
== lang_name_cplusplus
)
7051 current_lang_name
= name
;
7053 else if (name
== lang_name_java
)
7055 current_lang_name
= name
;
7056 /* DECL_IGNORED_P is initially set for these types, to avoid clutter.
7057 (See record_builtin_java_type in decl.c.) However, that causes
7058 incorrect debug entries if these types are actually used.
7059 So we re-enable debug output after extern "Java". */
7060 DECL_IGNORED_P (TYPE_NAME (java_byte_type_node
)) = 0;
7061 DECL_IGNORED_P (TYPE_NAME (java_short_type_node
)) = 0;
7062 DECL_IGNORED_P (TYPE_NAME (java_int_type_node
)) = 0;
7063 DECL_IGNORED_P (TYPE_NAME (java_long_type_node
)) = 0;
7064 DECL_IGNORED_P (TYPE_NAME (java_float_type_node
)) = 0;
7065 DECL_IGNORED_P (TYPE_NAME (java_double_type_node
)) = 0;
7066 DECL_IGNORED_P (TYPE_NAME (java_char_type_node
)) = 0;
7067 DECL_IGNORED_P (TYPE_NAME (java_boolean_type_node
)) = 0;
7069 else if (name
== lang_name_c
)
7071 current_lang_name
= name
;
7074 error ("language string %<\"%E\"%> not recognized", name
);
7077 /* Get out of the current language scope. */
7080 pop_lang_context (void)
7082 current_lang_name
= current_lang_base
->pop ();
7085 /* Type instantiation routines. */
7087 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
7088 matches the TARGET_TYPE. If there is no satisfactory match, return
7089 error_mark_node, and issue an error & warning messages under
7090 control of FLAGS. Permit pointers to member function if FLAGS
7091 permits. If TEMPLATE_ONLY, the name of the overloaded function was
7092 a template-id, and EXPLICIT_TARGS are the explicitly provided
7095 If OVERLOAD is for one or more member functions, then ACCESS_PATH
7096 is the base path used to reference those member functions. If
7097 the address is resolved to a member function, access checks will be
7098 performed and errors issued if appropriate. */
7101 resolve_address_of_overloaded_function (tree target_type
,
7103 tsubst_flags_t flags
,
7105 tree explicit_targs
,
7108 /* Here's what the standard says:
7112 If the name is a function template, template argument deduction
7113 is done, and if the argument deduction succeeds, the deduced
7114 arguments are used to generate a single template function, which
7115 is added to the set of overloaded functions considered.
7117 Non-member functions and static member functions match targets of
7118 type "pointer-to-function" or "reference-to-function." Nonstatic
7119 member functions match targets of type "pointer-to-member
7120 function;" the function type of the pointer to member is used to
7121 select the member function from the set of overloaded member
7122 functions. If a nonstatic member function is selected, the
7123 reference to the overloaded function name is required to have the
7124 form of a pointer to member as described in 5.3.1.
7126 If more than one function is selected, any template functions in
7127 the set are eliminated if the set also contains a non-template
7128 function, and any given template function is eliminated if the
7129 set contains a second template function that is more specialized
7130 than the first according to the partial ordering rules 14.5.5.2.
7131 After such eliminations, if any, there shall remain exactly one
7132 selected function. */
7135 /* We store the matches in a TREE_LIST rooted here. The functions
7136 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
7137 interoperability with most_specialized_instantiation. */
7138 tree matches
= NULL_TREE
;
7140 tree target_fn_type
;
7142 /* By the time we get here, we should be seeing only real
7143 pointer-to-member types, not the internal POINTER_TYPE to
7144 METHOD_TYPE representation. */
7145 gcc_assert (TREE_CODE (target_type
) != POINTER_TYPE
7146 || TREE_CODE (TREE_TYPE (target_type
)) != METHOD_TYPE
);
7148 gcc_assert (is_overloaded_fn (overload
));
7150 /* Check that the TARGET_TYPE is reasonable. */
7151 if (TYPE_PTRFN_P (target_type
)
7152 || TYPE_REFFN_P (target_type
))
7154 else if (TYPE_PTRMEMFUNC_P (target_type
))
7155 /* This is OK, too. */
7157 else if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
7158 /* This is OK, too. This comes from a conversion to reference
7160 target_type
= build_reference_type (target_type
);
7163 if (flags
& tf_error
)
7164 error ("cannot resolve overloaded function %qD based on"
7165 " conversion to type %qT",
7166 DECL_NAME (OVL_FUNCTION (overload
)), target_type
);
7167 return error_mark_node
;
7170 /* Non-member functions and static member functions match targets of type
7171 "pointer-to-function" or "reference-to-function." Nonstatic member
7172 functions match targets of type "pointer-to-member-function;" the
7173 function type of the pointer to member is used to select the member
7174 function from the set of overloaded member functions.
7176 So figure out the FUNCTION_TYPE that we want to match against. */
7177 target_fn_type
= static_fn_type (target_type
);
7179 /* If we can find a non-template function that matches, we can just
7180 use it. There's no point in generating template instantiations
7181 if we're just going to throw them out anyhow. But, of course, we
7182 can only do this when we don't *need* a template function. */
7187 for (fns
= overload
; fns
; fns
= OVL_NEXT (fns
))
7189 tree fn
= OVL_CURRENT (fns
);
7191 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
7192 /* We're not looking for templates just yet. */
7195 if ((TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7197 /* We're looking for a non-static member, and this isn't
7198 one, or vice versa. */
7201 /* Ignore functions which haven't been explicitly
7203 if (DECL_ANTICIPATED (fn
))
7206 /* See if there's a match. */
7207 if (same_type_p (target_fn_type
, static_fn_type (fn
)))
7208 matches
= tree_cons (fn
, NULL_TREE
, matches
);
7212 /* Now, if we've already got a match (or matches), there's no need
7213 to proceed to the template functions. But, if we don't have a
7214 match we need to look at them, too. */
7217 tree target_arg_types
;
7218 tree target_ret_type
;
7221 unsigned int nargs
, ia
;
7224 target_arg_types
= TYPE_ARG_TYPES (target_fn_type
);
7225 target_ret_type
= TREE_TYPE (target_fn_type
);
7227 nargs
= list_length (target_arg_types
);
7228 args
= XALLOCAVEC (tree
, nargs
);
7229 for (arg
= target_arg_types
, ia
= 0;
7230 arg
!= NULL_TREE
&& arg
!= void_list_node
;
7231 arg
= TREE_CHAIN (arg
), ++ia
)
7232 args
[ia
] = TREE_VALUE (arg
);
7235 for (fns
= overload
; fns
; fns
= OVL_NEXT (fns
))
7237 tree fn
= OVL_CURRENT (fns
);
7241 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7242 /* We're only looking for templates. */
7245 if ((TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7247 /* We're not looking for a non-static member, and this is
7248 one, or vice versa. */
7251 /* Try to do argument deduction. */
7252 targs
= make_tree_vec (DECL_NTPARMS (fn
));
7253 instantiation
= fn_type_unification (fn
, explicit_targs
, targs
, args
,
7254 nargs
, target_ret_type
,
7255 DEDUCE_EXACT
, LOOKUP_NORMAL
,
7257 if (instantiation
== error_mark_node
)
7258 /* Instantiation failed. */
7261 /* See if there's a match. */
7262 if (same_type_p (target_fn_type
, static_fn_type (instantiation
)))
7263 matches
= tree_cons (instantiation
, fn
, matches
);
7266 /* Now, remove all but the most specialized of the matches. */
7269 tree match
= most_specialized_instantiation (matches
);
7271 if (match
!= error_mark_node
)
7272 matches
= tree_cons (TREE_PURPOSE (match
),
7278 /* Now we should have exactly one function in MATCHES. */
7279 if (matches
== NULL_TREE
)
7281 /* There were *no* matches. */
7282 if (flags
& tf_error
)
7284 error ("no matches converting function %qD to type %q#T",
7285 DECL_NAME (OVL_CURRENT (overload
)),
7288 print_candidates (overload
);
7290 return error_mark_node
;
7292 else if (TREE_CHAIN (matches
))
7294 /* There were too many matches. First check if they're all
7295 the same function. */
7296 tree match
= NULL_TREE
;
7298 fn
= TREE_PURPOSE (matches
);
7300 /* For multi-versioned functions, more than one match is just fine and
7301 decls_match will return false as they are different. */
7302 for (match
= TREE_CHAIN (matches
); match
; match
= TREE_CHAIN (match
))
7303 if (!decls_match (fn
, TREE_PURPOSE (match
))
7304 && !targetm
.target_option
.function_versions
7305 (fn
, TREE_PURPOSE (match
)))
7310 if (flags
& tf_error
)
7312 error ("converting overloaded function %qD to type %q#T is ambiguous",
7313 DECL_NAME (OVL_FUNCTION (overload
)),
7316 /* Since print_candidates expects the functions in the
7317 TREE_VALUE slot, we flip them here. */
7318 for (match
= matches
; match
; match
= TREE_CHAIN (match
))
7319 TREE_VALUE (match
) = TREE_PURPOSE (match
);
7321 print_candidates (matches
);
7324 return error_mark_node
;
7328 /* Good, exactly one match. Now, convert it to the correct type. */
7329 fn
= TREE_PURPOSE (matches
);
7331 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
7332 && !(flags
& tf_ptrmem_ok
) && !flag_ms_extensions
)
7334 static int explained
;
7336 if (!(flags
& tf_error
))
7337 return error_mark_node
;
7339 permerror (input_location
, "assuming pointer to member %qD", fn
);
7342 inform (input_location
, "(a pointer to member can only be formed with %<&%E%>)", fn
);
7347 /* If a pointer to a function that is multi-versioned is requested, the
7348 pointer to the dispatcher function is returned instead. This works
7349 well because indirectly calling the function will dispatch the right
7350 function version at run-time. */
7351 if (DECL_FUNCTION_VERSIONED (fn
))
7353 fn
= get_function_version_dispatcher (fn
);
7355 return error_mark_node
;
7356 /* Mark all the versions corresponding to the dispatcher as used. */
7357 if (!(flags
& tf_conv
))
7358 mark_versions_used (fn
);
7361 /* If we're doing overload resolution purely for the purpose of
7362 determining conversion sequences, we should not consider the
7363 function used. If this conversion sequence is selected, the
7364 function will be marked as used at this point. */
7365 if (!(flags
& tf_conv
))
7367 /* Make =delete work with SFINAE. */
7368 if (DECL_DELETED_FN (fn
) && !(flags
& tf_error
))
7369 return error_mark_node
;
7374 /* We could not check access to member functions when this
7375 expression was originally created since we did not know at that
7376 time to which function the expression referred. */
7377 if (DECL_FUNCTION_MEMBER_P (fn
))
7379 gcc_assert (access_path
);
7380 perform_or_defer_access_check (access_path
, fn
, fn
, flags
);
7383 if (TYPE_PTRFN_P (target_type
) || TYPE_PTRMEMFUNC_P (target_type
))
7384 return cp_build_addr_expr (fn
, flags
);
7387 /* The target must be a REFERENCE_TYPE. Above, cp_build_unary_op
7388 will mark the function as addressed, but here we must do it
7390 cxx_mark_addressable (fn
);
7396 /* This function will instantiate the type of the expression given in
7397 RHS to match the type of LHSTYPE. If errors exist, then return
7398 error_mark_node. FLAGS is a bit mask. If TF_ERROR is set, then
7399 we complain on errors. If we are not complaining, never modify rhs,
7400 as overload resolution wants to try many possible instantiations, in
7401 the hope that at least one will work.
7403 For non-recursive calls, LHSTYPE should be a function, pointer to
7404 function, or a pointer to member function. */
7407 instantiate_type (tree lhstype
, tree rhs
, tsubst_flags_t flags
)
7409 tsubst_flags_t flags_in
= flags
;
7410 tree access_path
= NULL_TREE
;
7412 flags
&= ~tf_ptrmem_ok
;
7414 if (lhstype
== unknown_type_node
)
7416 if (flags
& tf_error
)
7417 error ("not enough type information");
7418 return error_mark_node
;
7421 if (TREE_TYPE (rhs
) != NULL_TREE
&& ! (type_unknown_p (rhs
)))
7423 tree fntype
= non_reference (lhstype
);
7424 if (same_type_p (fntype
, TREE_TYPE (rhs
)))
7426 if (flag_ms_extensions
7427 && TYPE_PTRMEMFUNC_P (fntype
)
7428 && !TYPE_PTRMEMFUNC_P (TREE_TYPE (rhs
)))
7429 /* Microsoft allows `A::f' to be resolved to a
7430 pointer-to-member. */
7434 if (flags
& tf_error
)
7435 error ("cannot convert %qE from type %qT to type %qT",
7436 rhs
, TREE_TYPE (rhs
), fntype
);
7437 return error_mark_node
;
7441 if (BASELINK_P (rhs
))
7443 access_path
= BASELINK_ACCESS_BINFO (rhs
);
7444 rhs
= BASELINK_FUNCTIONS (rhs
);
7447 /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot
7448 deduce any type information. */
7449 if (TREE_CODE (rhs
) == NON_DEPENDENT_EXPR
)
7451 if (flags
& tf_error
)
7452 error ("not enough type information");
7453 return error_mark_node
;
7456 /* There only a few kinds of expressions that may have a type
7457 dependent on overload resolution. */
7458 gcc_assert (TREE_CODE (rhs
) == ADDR_EXPR
7459 || TREE_CODE (rhs
) == COMPONENT_REF
7460 || really_overloaded_fn (rhs
)
7461 || (flag_ms_extensions
&& TREE_CODE (rhs
) == FUNCTION_DECL
));
7463 /* This should really only be used when attempting to distinguish
7464 what sort of a pointer to function we have. For now, any
7465 arithmetic operation which is not supported on pointers
7466 is rejected as an error. */
7468 switch (TREE_CODE (rhs
))
7472 tree member
= TREE_OPERAND (rhs
, 1);
7474 member
= instantiate_type (lhstype
, member
, flags
);
7475 if (member
!= error_mark_node
7476 && TREE_SIDE_EFFECTS (TREE_OPERAND (rhs
, 0)))
7477 /* Do not lose object's side effects. */
7478 return build2 (COMPOUND_EXPR
, TREE_TYPE (member
),
7479 TREE_OPERAND (rhs
, 0), member
);
7484 rhs
= TREE_OPERAND (rhs
, 1);
7485 if (BASELINK_P (rhs
))
7486 return instantiate_type (lhstype
, rhs
, flags_in
);
7488 /* This can happen if we are forming a pointer-to-member for a
7490 gcc_assert (TREE_CODE (rhs
) == TEMPLATE_ID_EXPR
);
7494 case TEMPLATE_ID_EXPR
:
7496 tree fns
= TREE_OPERAND (rhs
, 0);
7497 tree args
= TREE_OPERAND (rhs
, 1);
7500 resolve_address_of_overloaded_function (lhstype
, fns
, flags_in
,
7501 /*template_only=*/true,
7508 resolve_address_of_overloaded_function (lhstype
, rhs
, flags_in
,
7509 /*template_only=*/false,
7510 /*explicit_targs=*/NULL_TREE
,
7515 if (PTRMEM_OK_P (rhs
))
7516 flags
|= tf_ptrmem_ok
;
7518 return instantiate_type (lhstype
, TREE_OPERAND (rhs
, 0), flags
);
7522 return error_mark_node
;
7527 return error_mark_node
;
7530 /* Return the name of the virtual function pointer field
7531 (as an IDENTIFIER_NODE) for the given TYPE. Note that
7532 this may have to look back through base types to find the
7533 ultimate field name. (For single inheritance, these could
7534 all be the same name. Who knows for multiple inheritance). */
7537 get_vfield_name (tree type
)
7539 tree binfo
, base_binfo
;
7542 for (binfo
= TYPE_BINFO (type
);
7543 BINFO_N_BASE_BINFOS (binfo
);
7546 base_binfo
= BINFO_BASE_BINFO (binfo
, 0);
7548 if (BINFO_VIRTUAL_P (base_binfo
)
7549 || !TYPE_CONTAINS_VPTR_P (BINFO_TYPE (base_binfo
)))
7553 type
= BINFO_TYPE (binfo
);
7554 buf
= (char *) alloca (sizeof (VFIELD_NAME_FORMAT
)
7555 + TYPE_NAME_LENGTH (type
) + 2);
7556 sprintf (buf
, VFIELD_NAME_FORMAT
,
7557 IDENTIFIER_POINTER (constructor_name (type
)));
7558 return get_identifier (buf
);
7562 print_class_statistics (void)
7564 if (! GATHER_STATISTICS
)
7567 fprintf (stderr
, "convert_harshness = %d\n", n_convert_harshness
);
7568 fprintf (stderr
, "compute_conversion_costs = %d\n", n_compute_conversion_costs
);
7571 fprintf (stderr
, "vtables = %d; vtable searches = %d\n",
7572 n_vtables
, n_vtable_searches
);
7573 fprintf (stderr
, "vtable entries = %d; vtable elems = %d\n",
7574 n_vtable_entries
, n_vtable_elems
);
7578 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
7579 according to [class]:
7580 The class-name is also inserted
7581 into the scope of the class itself. For purposes of access checking,
7582 the inserted class name is treated as if it were a public member name. */
7585 build_self_reference (void)
7587 tree name
= constructor_name (current_class_type
);
7588 tree value
= build_lang_decl (TYPE_DECL
, name
, current_class_type
);
7591 DECL_NONLOCAL (value
) = 1;
7592 DECL_CONTEXT (value
) = current_class_type
;
7593 DECL_ARTIFICIAL (value
) = 1;
7594 SET_DECL_SELF_REFERENCE_P (value
);
7595 set_underlying_type (value
);
7597 if (processing_template_decl
)
7598 value
= push_template_decl (value
);
7600 saved_cas
= current_access_specifier
;
7601 current_access_specifier
= access_public_node
;
7602 finish_member_declaration (value
);
7603 current_access_specifier
= saved_cas
;
7606 /* Returns 1 if TYPE contains only padding bytes. */
7609 is_empty_class (tree type
)
7611 if (type
== error_mark_node
)
7614 if (! CLASS_TYPE_P (type
))
7617 /* In G++ 3.2, whether or not a class was empty was determined by
7618 looking at its size. */
7619 if (abi_version_at_least (2))
7620 return CLASSTYPE_EMPTY_P (type
);
7622 return integer_zerop (CLASSTYPE_SIZE (type
));
7625 /* Returns true if TYPE contains an empty class. */
7628 contains_empty_class_p (tree type
)
7630 if (is_empty_class (type
))
7632 if (CLASS_TYPE_P (type
))
7639 for (binfo
= TYPE_BINFO (type
), i
= 0;
7640 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
7641 if (contains_empty_class_p (BINFO_TYPE (base_binfo
)))
7643 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
7644 if (TREE_CODE (field
) == FIELD_DECL
7645 && !DECL_ARTIFICIAL (field
)
7646 && is_empty_class (TREE_TYPE (field
)))
7649 else if (TREE_CODE (type
) == ARRAY_TYPE
)
7650 return contains_empty_class_p (TREE_TYPE (type
));
7654 /* Returns true if TYPE contains no actual data, just various
7655 possible combinations of empty classes and possibly a vptr. */
7658 is_really_empty_class (tree type
)
7660 if (CLASS_TYPE_P (type
))
7667 /* CLASSTYPE_EMPTY_P isn't set properly until the class is actually laid
7668 out, but we'd like to be able to check this before then. */
7669 if (COMPLETE_TYPE_P (type
) && is_empty_class (type
))
7672 for (binfo
= TYPE_BINFO (type
), i
= 0;
7673 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
7674 if (!is_really_empty_class (BINFO_TYPE (base_binfo
)))
7676 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
7677 if (TREE_CODE (field
) == FIELD_DECL
7678 && !DECL_ARTIFICIAL (field
)
7679 && !is_really_empty_class (TREE_TYPE (field
)))
7683 else if (TREE_CODE (type
) == ARRAY_TYPE
)
7684 return is_really_empty_class (TREE_TYPE (type
));
7688 /* Note that NAME was looked up while the current class was being
7689 defined and that the result of that lookup was DECL. */
7692 maybe_note_name_used_in_class (tree name
, tree decl
)
7694 splay_tree names_used
;
7696 /* If we're not defining a class, there's nothing to do. */
7697 if (!(innermost_scope_kind() == sk_class
7698 && TYPE_BEING_DEFINED (current_class_type
)
7699 && !LAMBDA_TYPE_P (current_class_type
)))
7702 /* If there's already a binding for this NAME, then we don't have
7703 anything to worry about. */
7704 if (lookup_member (current_class_type
, name
,
7705 /*protect=*/0, /*want_type=*/false, tf_warning_or_error
))
7708 if (!current_class_stack
[current_class_depth
- 1].names_used
)
7709 current_class_stack
[current_class_depth
- 1].names_used
7710 = splay_tree_new (splay_tree_compare_pointers
, 0, 0);
7711 names_used
= current_class_stack
[current_class_depth
- 1].names_used
;
7713 splay_tree_insert (names_used
,
7714 (splay_tree_key
) name
,
7715 (splay_tree_value
) decl
);
7718 /* Note that NAME was declared (as DECL) in the current class. Check
7719 to see that the declaration is valid. */
7722 note_name_declared_in_class (tree name
, tree decl
)
7724 splay_tree names_used
;
7727 /* Look to see if we ever used this name. */
7729 = current_class_stack
[current_class_depth
- 1].names_used
;
7732 /* The C language allows members to be declared with a type of the same
7733 name, and the C++ standard says this diagnostic is not required. So
7734 allow it in extern "C" blocks unless predantic is specified.
7735 Allow it in all cases if -ms-extensions is specified. */
7736 if ((!pedantic
&& current_lang_name
== lang_name_c
)
7737 || flag_ms_extensions
)
7739 n
= splay_tree_lookup (names_used
, (splay_tree_key
) name
);
7742 /* [basic.scope.class]
7744 A name N used in a class S shall refer to the same declaration
7745 in its context and when re-evaluated in the completed scope of
7747 permerror (input_location
, "declaration of %q#D", decl
);
7748 permerror (input_location
, "changes meaning of %qD from %q+#D",
7749 DECL_NAME (OVL_CURRENT (decl
)), (tree
) n
->value
);
7753 /* Returns the VAR_DECL for the complete vtable associated with BINFO.
7754 Secondary vtables are merged with primary vtables; this function
7755 will return the VAR_DECL for the primary vtable. */
7758 get_vtbl_decl_for_binfo (tree binfo
)
7762 decl
= BINFO_VTABLE (binfo
);
7763 if (decl
&& TREE_CODE (decl
) == POINTER_PLUS_EXPR
)
7765 gcc_assert (TREE_CODE (TREE_OPERAND (decl
, 0)) == ADDR_EXPR
);
7766 decl
= TREE_OPERAND (TREE_OPERAND (decl
, 0), 0);
7769 gcc_assert (TREE_CODE (decl
) == VAR_DECL
);
7774 /* Returns the binfo for the primary base of BINFO. If the resulting
7775 BINFO is a virtual base, and it is inherited elsewhere in the
7776 hierarchy, then the returned binfo might not be the primary base of
7777 BINFO in the complete object. Check BINFO_PRIMARY_P or
7778 BINFO_LOST_PRIMARY_P to be sure. */
7781 get_primary_binfo (tree binfo
)
7785 primary_base
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (binfo
));
7789 return copied_binfo (primary_base
, binfo
);
7792 /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */
7795 maybe_indent_hierarchy (FILE * stream
, int indent
, int indented_p
)
7798 fprintf (stream
, "%*s", indent
, "");
7802 /* Dump the offsets of all the bases rooted at BINFO to STREAM.
7803 INDENT should be zero when called from the top level; it is
7804 incremented recursively. IGO indicates the next expected BINFO in
7805 inheritance graph ordering. */
7808 dump_class_hierarchy_r (FILE *stream
,
7818 indented
= maybe_indent_hierarchy (stream
, indent
, 0);
7819 fprintf (stream
, "%s (0x" HOST_WIDE_INT_PRINT_HEX
") ",
7820 type_as_string (BINFO_TYPE (binfo
), TFF_PLAIN_IDENTIFIER
),
7821 (HOST_WIDE_INT
) (uintptr_t) binfo
);
7824 fprintf (stream
, "alternative-path\n");
7827 igo
= TREE_CHAIN (binfo
);
7829 fprintf (stream
, HOST_WIDE_INT_PRINT_DEC
,
7830 tree_low_cst (BINFO_OFFSET (binfo
), 0));
7831 if (is_empty_class (BINFO_TYPE (binfo
)))
7832 fprintf (stream
, " empty");
7833 else if (CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (binfo
)))
7834 fprintf (stream
, " nearly-empty");
7835 if (BINFO_VIRTUAL_P (binfo
))
7836 fprintf (stream
, " virtual");
7837 fprintf (stream
, "\n");
7840 if (BINFO_PRIMARY_P (binfo
))
7842 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
7843 fprintf (stream
, " primary-for %s (0x" HOST_WIDE_INT_PRINT_HEX
")",
7844 type_as_string (BINFO_TYPE (BINFO_INHERITANCE_CHAIN (binfo
)),
7845 TFF_PLAIN_IDENTIFIER
),
7846 (HOST_WIDE_INT
) (uintptr_t) BINFO_INHERITANCE_CHAIN (binfo
));
7848 if (BINFO_LOST_PRIMARY_P (binfo
))
7850 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
7851 fprintf (stream
, " lost-primary");
7854 fprintf (stream
, "\n");
7856 if (!(flags
& TDF_SLIM
))
7860 if (BINFO_SUBVTT_INDEX (binfo
))
7862 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
7863 fprintf (stream
, " subvttidx=%s",
7864 expr_as_string (BINFO_SUBVTT_INDEX (binfo
),
7865 TFF_PLAIN_IDENTIFIER
));
7867 if (BINFO_VPTR_INDEX (binfo
))
7869 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
7870 fprintf (stream
, " vptridx=%s",
7871 expr_as_string (BINFO_VPTR_INDEX (binfo
),
7872 TFF_PLAIN_IDENTIFIER
));
7874 if (BINFO_VPTR_FIELD (binfo
))
7876 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
7877 fprintf (stream
, " vbaseoffset=%s",
7878 expr_as_string (BINFO_VPTR_FIELD (binfo
),
7879 TFF_PLAIN_IDENTIFIER
));
7881 if (BINFO_VTABLE (binfo
))
7883 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
7884 fprintf (stream
, " vptr=%s",
7885 expr_as_string (BINFO_VTABLE (binfo
),
7886 TFF_PLAIN_IDENTIFIER
));
7890 fprintf (stream
, "\n");
7893 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
7894 igo
= dump_class_hierarchy_r (stream
, flags
, base_binfo
, igo
, indent
+ 2);
7899 /* Dump the BINFO hierarchy for T. */
7902 dump_class_hierarchy_1 (FILE *stream
, int flags
, tree t
)
7904 fprintf (stream
, "Class %s\n", type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
7905 fprintf (stream
, " size=%lu align=%lu\n",
7906 (unsigned long)(tree_low_cst (TYPE_SIZE (t
), 0) / BITS_PER_UNIT
),
7907 (unsigned long)(TYPE_ALIGN (t
) / BITS_PER_UNIT
));
7908 fprintf (stream
, " base size=%lu base align=%lu\n",
7909 (unsigned long)(tree_low_cst (TYPE_SIZE (CLASSTYPE_AS_BASE (t
)), 0)
7911 (unsigned long)(TYPE_ALIGN (CLASSTYPE_AS_BASE (t
))
7913 dump_class_hierarchy_r (stream
, flags
, TYPE_BINFO (t
), TYPE_BINFO (t
), 0);
7914 fprintf (stream
, "\n");
7917 /* Debug interface to hierarchy dumping. */
7920 debug_class (tree t
)
7922 dump_class_hierarchy_1 (stderr
, TDF_SLIM
, t
);
7926 dump_class_hierarchy (tree t
)
7929 FILE *stream
= dump_begin (TDI_class
, &flags
);
7933 dump_class_hierarchy_1 (stream
, flags
, t
);
7934 dump_end (TDI_class
, stream
);
7939 dump_array (FILE * stream
, tree decl
)
7942 unsigned HOST_WIDE_INT ix
;
7944 tree size
= TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (decl
)));
7946 elt
= (tree_low_cst (TYPE_SIZE (TREE_TYPE (TREE_TYPE (decl
))), 0)
7948 fprintf (stream
, "%s:", decl_as_string (decl
, TFF_PLAIN_IDENTIFIER
));
7949 fprintf (stream
, " %s entries",
7950 expr_as_string (size_binop (PLUS_EXPR
, size
, size_one_node
),
7951 TFF_PLAIN_IDENTIFIER
));
7952 fprintf (stream
, "\n");
7954 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (DECL_INITIAL (decl
)),
7956 fprintf (stream
, "%-4ld %s\n", (long)(ix
* elt
),
7957 expr_as_string (value
, TFF_PLAIN_IDENTIFIER
));
7961 dump_vtable (tree t
, tree binfo
, tree vtable
)
7964 FILE *stream
= dump_begin (TDI_class
, &flags
);
7969 if (!(flags
& TDF_SLIM
))
7971 int ctor_vtbl_p
= TYPE_BINFO (t
) != binfo
;
7973 fprintf (stream
, "%s for %s",
7974 ctor_vtbl_p
? "Construction vtable" : "Vtable",
7975 type_as_string (BINFO_TYPE (binfo
), TFF_PLAIN_IDENTIFIER
));
7978 if (!BINFO_VIRTUAL_P (binfo
))
7979 fprintf (stream
, " (0x" HOST_WIDE_INT_PRINT_HEX
" instance)",
7980 (HOST_WIDE_INT
) (uintptr_t) binfo
);
7981 fprintf (stream
, " in %s", type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
7983 fprintf (stream
, "\n");
7984 dump_array (stream
, vtable
);
7985 fprintf (stream
, "\n");
7988 dump_end (TDI_class
, stream
);
7992 dump_vtt (tree t
, tree vtt
)
7995 FILE *stream
= dump_begin (TDI_class
, &flags
);
8000 if (!(flags
& TDF_SLIM
))
8002 fprintf (stream
, "VTT for %s\n",
8003 type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8004 dump_array (stream
, vtt
);
8005 fprintf (stream
, "\n");
8008 dump_end (TDI_class
, stream
);
8011 /* Dump a function or thunk and its thunkees. */
8014 dump_thunk (FILE *stream
, int indent
, tree thunk
)
8016 static const char spaces
[] = " ";
8017 tree name
= DECL_NAME (thunk
);
8020 fprintf (stream
, "%.*s%p %s %s", indent
, spaces
,
8022 !DECL_THUNK_P (thunk
) ? "function"
8023 : DECL_THIS_THUNK_P (thunk
) ? "this-thunk" : "covariant-thunk",
8024 name
? IDENTIFIER_POINTER (name
) : "<unset>");
8025 if (DECL_THUNK_P (thunk
))
8027 HOST_WIDE_INT fixed_adjust
= THUNK_FIXED_OFFSET (thunk
);
8028 tree virtual_adjust
= THUNK_VIRTUAL_OFFSET (thunk
);
8030 fprintf (stream
, " fixed=" HOST_WIDE_INT_PRINT_DEC
, fixed_adjust
);
8031 if (!virtual_adjust
)
8033 else if (DECL_THIS_THUNK_P (thunk
))
8034 fprintf (stream
, " vcall=" HOST_WIDE_INT_PRINT_DEC
,
8035 tree_low_cst (virtual_adjust
, 0));
8037 fprintf (stream
, " vbase=" HOST_WIDE_INT_PRINT_DEC
"(%s)",
8038 tree_low_cst (BINFO_VPTR_FIELD (virtual_adjust
), 0),
8039 type_as_string (BINFO_TYPE (virtual_adjust
), TFF_SCOPE
));
8040 if (THUNK_ALIAS (thunk
))
8041 fprintf (stream
, " alias to %p", (void *)THUNK_ALIAS (thunk
));
8043 fprintf (stream
, "\n");
8044 for (thunks
= DECL_THUNKS (thunk
); thunks
; thunks
= TREE_CHAIN (thunks
))
8045 dump_thunk (stream
, indent
+ 2, thunks
);
8048 /* Dump the thunks for FN. */
8051 debug_thunks (tree fn
)
8053 dump_thunk (stderr
, 0, fn
);
8056 /* Virtual function table initialization. */
8058 /* Create all the necessary vtables for T and its base classes. */
8061 finish_vtbls (tree t
)
8064 vec
<constructor_elt
, va_gc
> *v
= NULL
;
8065 tree vtable
= BINFO_VTABLE (TYPE_BINFO (t
));
8067 /* We lay out the primary and secondary vtables in one contiguous
8068 vtable. The primary vtable is first, followed by the non-virtual
8069 secondary vtables in inheritance graph order. */
8070 accumulate_vtbl_inits (TYPE_BINFO (t
), TYPE_BINFO (t
), TYPE_BINFO (t
),
8073 /* Then come the virtual bases, also in inheritance graph order. */
8074 for (vbase
= TYPE_BINFO (t
); vbase
; vbase
= TREE_CHAIN (vbase
))
8076 if (!BINFO_VIRTUAL_P (vbase
))
8078 accumulate_vtbl_inits (vbase
, vbase
, TYPE_BINFO (t
), vtable
, t
, &v
);
8081 if (BINFO_VTABLE (TYPE_BINFO (t
)))
8082 initialize_vtable (TYPE_BINFO (t
), v
);
8085 /* Initialize the vtable for BINFO with the INITS. */
8088 initialize_vtable (tree binfo
, vec
<constructor_elt
, va_gc
> *inits
)
8092 layout_vtable_decl (binfo
, vec_safe_length (inits
));
8093 decl
= get_vtbl_decl_for_binfo (binfo
);
8094 initialize_artificial_var (decl
, inits
);
8095 dump_vtable (BINFO_TYPE (binfo
), binfo
, decl
);
8098 /* Build the VTT (virtual table table) for T.
8099 A class requires a VTT if it has virtual bases.
8102 1 - primary virtual pointer for complete object T
8103 2 - secondary VTTs for each direct non-virtual base of T which requires a
8105 3 - secondary virtual pointers for each direct or indirect base of T which
8106 has virtual bases or is reachable via a virtual path from T.
8107 4 - secondary VTTs for each direct or indirect virtual base of T.
8109 Secondary VTTs look like complete object VTTs without part 4. */
8117 vec
<constructor_elt
, va_gc
> *inits
;
8119 /* Build up the initializers for the VTT. */
8121 index
= size_zero_node
;
8122 build_vtt_inits (TYPE_BINFO (t
), t
, &inits
, &index
);
8124 /* If we didn't need a VTT, we're done. */
8128 /* Figure out the type of the VTT. */
8129 type
= build_array_of_n_type (const_ptr_type_node
,
8132 /* Now, build the VTT object itself. */
8133 vtt
= build_vtable (t
, mangle_vtt_for_type (t
), type
);
8134 initialize_artificial_var (vtt
, inits
);
8135 /* Add the VTT to the vtables list. */
8136 DECL_CHAIN (vtt
) = DECL_CHAIN (CLASSTYPE_VTABLES (t
));
8137 DECL_CHAIN (CLASSTYPE_VTABLES (t
)) = vtt
;
8142 /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with
8143 PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo,
8144 and CHAIN the vtable pointer for this binfo after construction is
8145 complete. VALUE can also be another BINFO, in which case we recurse. */
8148 binfo_ctor_vtable (tree binfo
)
8154 vt
= BINFO_VTABLE (binfo
);
8155 if (TREE_CODE (vt
) == TREE_LIST
)
8156 vt
= TREE_VALUE (vt
);
8157 if (TREE_CODE (vt
) == TREE_BINFO
)
8166 /* Data for secondary VTT initialization. */
8167 typedef struct secondary_vptr_vtt_init_data_s
8169 /* Is this the primary VTT? */
8172 /* Current index into the VTT. */
8175 /* Vector of initializers built up. */
8176 vec
<constructor_elt
, va_gc
> *inits
;
8178 /* The type being constructed by this secondary VTT. */
8179 tree type_being_constructed
;
8180 } secondary_vptr_vtt_init_data
;
8182 /* Recursively build the VTT-initializer for BINFO (which is in the
8183 hierarchy dominated by T). INITS points to the end of the initializer
8184 list to date. INDEX is the VTT index where the next element will be
8185 replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e.
8186 not a subvtt for some base of T). When that is so, we emit the sub-VTTs
8187 for virtual bases of T. When it is not so, we build the constructor
8188 vtables for the BINFO-in-T variant. */
8191 build_vtt_inits (tree binfo
, tree t
, vec
<constructor_elt
, va_gc
> **inits
,
8197 secondary_vptr_vtt_init_data data
;
8198 int top_level_p
= SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
);
8200 /* We only need VTTs for subobjects with virtual bases. */
8201 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
)))
8204 /* We need to use a construction vtable if this is not the primary
8208 build_ctor_vtbl_group (binfo
, t
);
8210 /* Record the offset in the VTT where this sub-VTT can be found. */
8211 BINFO_SUBVTT_INDEX (binfo
) = *index
;
8214 /* Add the address of the primary vtable for the complete object. */
8215 init
= binfo_ctor_vtable (binfo
);
8216 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
8219 gcc_assert (!BINFO_VPTR_INDEX (binfo
));
8220 BINFO_VPTR_INDEX (binfo
) = *index
;
8222 *index
= size_binop (PLUS_EXPR
, *index
, TYPE_SIZE_UNIT (ptr_type_node
));
8224 /* Recursively add the secondary VTTs for non-virtual bases. */
8225 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, b
); ++i
)
8226 if (!BINFO_VIRTUAL_P (b
))
8227 build_vtt_inits (b
, t
, inits
, index
);
8229 /* Add secondary virtual pointers for all subobjects of BINFO with
8230 either virtual bases or reachable along a virtual path, except
8231 subobjects that are non-virtual primary bases. */
8232 data
.top_level_p
= top_level_p
;
8233 data
.index
= *index
;
8234 data
.inits
= *inits
;
8235 data
.type_being_constructed
= BINFO_TYPE (binfo
);
8237 dfs_walk_once (binfo
, dfs_build_secondary_vptr_vtt_inits
, NULL
, &data
);
8239 *index
= data
.index
;
8241 /* data.inits might have grown as we added secondary virtual pointers.
8242 Make sure our caller knows about the new vector. */
8243 *inits
= data
.inits
;
8246 /* Add the secondary VTTs for virtual bases in inheritance graph
8248 for (b
= TYPE_BINFO (BINFO_TYPE (binfo
)); b
; b
= TREE_CHAIN (b
))
8250 if (!BINFO_VIRTUAL_P (b
))
8253 build_vtt_inits (b
, t
, inits
, index
);
8256 /* Remove the ctor vtables we created. */
8257 dfs_walk_all (binfo
, dfs_fixup_binfo_vtbls
, NULL
, binfo
);
8260 /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base
8261 in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */
8264 dfs_build_secondary_vptr_vtt_inits (tree binfo
, void *data_
)
8266 secondary_vptr_vtt_init_data
*data
= (secondary_vptr_vtt_init_data
*)data_
;
8268 /* We don't care about bases that don't have vtables. */
8269 if (!TYPE_VFIELD (BINFO_TYPE (binfo
)))
8270 return dfs_skip_bases
;
8272 /* We're only interested in proper subobjects of the type being
8274 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), data
->type_being_constructed
))
8277 /* We're only interested in bases with virtual bases or reachable
8278 via a virtual path from the type being constructed. */
8279 if (!(CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
))
8280 || binfo_via_virtual (binfo
, data
->type_being_constructed
)))
8281 return dfs_skip_bases
;
8283 /* We're not interested in non-virtual primary bases. */
8284 if (!BINFO_VIRTUAL_P (binfo
) && BINFO_PRIMARY_P (binfo
))
8287 /* Record the index where this secondary vptr can be found. */
8288 if (data
->top_level_p
)
8290 gcc_assert (!BINFO_VPTR_INDEX (binfo
));
8291 BINFO_VPTR_INDEX (binfo
) = data
->index
;
8293 if (BINFO_VIRTUAL_P (binfo
))
8295 /* It's a primary virtual base, and this is not a
8296 construction vtable. Find the base this is primary of in
8297 the inheritance graph, and use that base's vtable
8299 while (BINFO_PRIMARY_P (binfo
))
8300 binfo
= BINFO_INHERITANCE_CHAIN (binfo
);
8304 /* Add the initializer for the secondary vptr itself. */
8305 CONSTRUCTOR_APPEND_ELT (data
->inits
, NULL_TREE
, binfo_ctor_vtable (binfo
));
8307 /* Advance the vtt index. */
8308 data
->index
= size_binop (PLUS_EXPR
, data
->index
,
8309 TYPE_SIZE_UNIT (ptr_type_node
));
8314 /* Called from build_vtt_inits via dfs_walk. After building
8315 constructor vtables and generating the sub-vtt from them, we need
8316 to restore the BINFO_VTABLES that were scribbled on. DATA is the
8317 binfo of the base whose sub vtt was generated. */
8320 dfs_fixup_binfo_vtbls (tree binfo
, void* data
)
8322 tree vtable
= BINFO_VTABLE (binfo
);
8324 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
8325 /* If this class has no vtable, none of its bases do. */
8326 return dfs_skip_bases
;
8329 /* This might be a primary base, so have no vtable in this
8333 /* If we scribbled the construction vtable vptr into BINFO, clear it
8335 if (TREE_CODE (vtable
) == TREE_LIST
8336 && (TREE_PURPOSE (vtable
) == (tree
) data
))
8337 BINFO_VTABLE (binfo
) = TREE_CHAIN (vtable
);
8342 /* Build the construction vtable group for BINFO which is in the
8343 hierarchy dominated by T. */
8346 build_ctor_vtbl_group (tree binfo
, tree t
)
8352 vec
<constructor_elt
, va_gc
> *v
;
8354 /* See if we've already created this construction vtable group. */
8355 id
= mangle_ctor_vtbl_for_type (t
, binfo
);
8356 if (IDENTIFIER_GLOBAL_VALUE (id
))
8359 gcc_assert (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
));
8360 /* Build a version of VTBL (with the wrong type) for use in
8361 constructing the addresses of secondary vtables in the
8362 construction vtable group. */
8363 vtbl
= build_vtable (t
, id
, ptr_type_node
);
8364 DECL_CONSTRUCTION_VTABLE_P (vtbl
) = 1;
8365 /* Don't export construction vtables from shared libraries. Even on
8366 targets that don't support hidden visibility, this tells
8367 can_refer_decl_in_current_unit_p not to assume that it's safe to
8368 access from a different compilation unit (bz 54314). */
8369 DECL_VISIBILITY (vtbl
) = VISIBILITY_HIDDEN
;
8370 DECL_VISIBILITY_SPECIFIED (vtbl
) = true;
8373 accumulate_vtbl_inits (binfo
, TYPE_BINFO (TREE_TYPE (binfo
)),
8374 binfo
, vtbl
, t
, &v
);
8376 /* Add the vtables for each of our virtual bases using the vbase in T
8378 for (vbase
= TYPE_BINFO (BINFO_TYPE (binfo
));
8380 vbase
= TREE_CHAIN (vbase
))
8384 if (!BINFO_VIRTUAL_P (vbase
))
8386 b
= copied_binfo (vbase
, binfo
);
8388 accumulate_vtbl_inits (b
, vbase
, binfo
, vtbl
, t
, &v
);
8391 /* Figure out the type of the construction vtable. */
8392 type
= build_array_of_n_type (vtable_entry_type
, v
->length ());
8394 TREE_TYPE (vtbl
) = type
;
8395 DECL_SIZE (vtbl
) = DECL_SIZE_UNIT (vtbl
) = NULL_TREE
;
8396 layout_decl (vtbl
, 0);
8398 /* Initialize the construction vtable. */
8399 CLASSTYPE_VTABLES (t
) = chainon (CLASSTYPE_VTABLES (t
), vtbl
);
8400 initialize_artificial_var (vtbl
, v
);
8401 dump_vtable (t
, binfo
, vtbl
);
8404 /* Add the vtbl initializers for BINFO (and its bases other than
8405 non-virtual primaries) to the list of INITS. BINFO is in the
8406 hierarchy dominated by T. RTTI_BINFO is the binfo within T of
8407 the constructor the vtbl inits should be accumulated for. (If this
8408 is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).)
8409 ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO).
8410 BINFO is the active base equivalent of ORIG_BINFO in the inheritance
8411 graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE,
8412 but are not necessarily the same in terms of layout. */
8415 accumulate_vtbl_inits (tree binfo
,
8420 vec
<constructor_elt
, va_gc
> **inits
)
8424 int ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8426 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), BINFO_TYPE (orig_binfo
)));
8428 /* If it doesn't have a vptr, we don't do anything. */
8429 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
8432 /* If we're building a construction vtable, we're not interested in
8433 subobjects that don't require construction vtables. */
8435 && !CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
))
8436 && !binfo_via_virtual (orig_binfo
, BINFO_TYPE (rtti_binfo
)))
8439 /* Build the initializers for the BINFO-in-T vtable. */
8440 dfs_accumulate_vtbl_inits (binfo
, orig_binfo
, rtti_binfo
, vtbl
, t
, inits
);
8442 /* Walk the BINFO and its bases. We walk in preorder so that as we
8443 initialize each vtable we can figure out at what offset the
8444 secondary vtable lies from the primary vtable. We can't use
8445 dfs_walk here because we need to iterate through bases of BINFO
8446 and RTTI_BINFO simultaneously. */
8447 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
8449 /* Skip virtual bases. */
8450 if (BINFO_VIRTUAL_P (base_binfo
))
8452 accumulate_vtbl_inits (base_binfo
,
8453 BINFO_BASE_BINFO (orig_binfo
, i
),
8454 rtti_binfo
, vtbl
, t
,
8459 /* Called from accumulate_vtbl_inits. Adds the initializers for the
8460 BINFO vtable to L. */
8463 dfs_accumulate_vtbl_inits (tree binfo
,
8468 vec
<constructor_elt
, va_gc
> **l
)
8470 tree vtbl
= NULL_TREE
;
8471 int ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8475 && BINFO_VIRTUAL_P (orig_binfo
) && BINFO_PRIMARY_P (orig_binfo
))
8477 /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a
8478 primary virtual base. If it is not the same primary in
8479 the hierarchy of T, we'll need to generate a ctor vtable
8480 for it, to place at its location in T. If it is the same
8481 primary, we still need a VTT entry for the vtable, but it
8482 should point to the ctor vtable for the base it is a
8483 primary for within the sub-hierarchy of RTTI_BINFO.
8485 There are three possible cases:
8487 1) We are in the same place.
8488 2) We are a primary base within a lost primary virtual base of
8490 3) We are primary to something not a base of RTTI_BINFO. */
8493 tree last
= NULL_TREE
;
8495 /* First, look through the bases we are primary to for RTTI_BINFO
8496 or a virtual base. */
8498 while (BINFO_PRIMARY_P (b
))
8500 b
= BINFO_INHERITANCE_CHAIN (b
);
8502 if (BINFO_VIRTUAL_P (b
) || b
== rtti_binfo
)
8505 /* If we run out of primary links, keep looking down our
8506 inheritance chain; we might be an indirect primary. */
8507 for (b
= last
; b
; b
= BINFO_INHERITANCE_CHAIN (b
))
8508 if (BINFO_VIRTUAL_P (b
) || b
== rtti_binfo
)
8512 /* If we found RTTI_BINFO, this is case 1. If we found a virtual
8513 base B and it is a base of RTTI_BINFO, this is case 2. In
8514 either case, we share our vtable with LAST, i.e. the
8515 derived-most base within B of which we are a primary. */
8517 || (b
&& binfo_for_vbase (BINFO_TYPE (b
), BINFO_TYPE (rtti_binfo
))))
8518 /* Just set our BINFO_VTABLE to point to LAST, as we may not have
8519 set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in
8520 binfo_ctor_vtable after everything's been set up. */
8523 /* Otherwise, this is case 3 and we get our own. */
8525 else if (!BINFO_NEW_VTABLE_MARKED (orig_binfo
))
8528 n_inits
= vec_safe_length (*l
);
8535 /* Add the initializer for this vtable. */
8536 build_vtbl_initializer (binfo
, orig_binfo
, t
, rtti_binfo
,
8537 &non_fn_entries
, l
);
8539 /* Figure out the position to which the VPTR should point. */
8540 vtbl
= build1 (ADDR_EXPR
, vtbl_ptr_type_node
, orig_vtbl
);
8541 index
= size_binop (MULT_EXPR
,
8542 TYPE_SIZE_UNIT (vtable_entry_type
),
8543 size_int (non_fn_entries
+ n_inits
));
8544 vtbl
= fold_build_pointer_plus (vtbl
, index
);
8548 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
8549 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
8550 straighten this out. */
8551 BINFO_VTABLE (binfo
) = tree_cons (rtti_binfo
, vtbl
, BINFO_VTABLE (binfo
));
8552 else if (BINFO_PRIMARY_P (binfo
) && BINFO_VIRTUAL_P (binfo
))
8553 /* Throw away any unneeded intializers. */
8554 (*l
)->truncate (n_inits
);
8556 /* For an ordinary vtable, set BINFO_VTABLE. */
8557 BINFO_VTABLE (binfo
) = vtbl
;
8560 static GTY(()) tree abort_fndecl_addr
;
8562 /* Construct the initializer for BINFO's virtual function table. BINFO
8563 is part of the hierarchy dominated by T. If we're building a
8564 construction vtable, the ORIG_BINFO is the binfo we should use to
8565 find the actual function pointers to put in the vtable - but they
8566 can be overridden on the path to most-derived in the graph that
8567 ORIG_BINFO belongs. Otherwise,
8568 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
8569 BINFO that should be indicated by the RTTI information in the
8570 vtable; it will be a base class of T, rather than T itself, if we
8571 are building a construction vtable.
8573 The value returned is a TREE_LIST suitable for wrapping in a
8574 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
8575 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
8576 number of non-function entries in the vtable.
8578 It might seem that this function should never be called with a
8579 BINFO for which BINFO_PRIMARY_P holds, the vtable for such a
8580 base is always subsumed by a derived class vtable. However, when
8581 we are building construction vtables, we do build vtables for
8582 primary bases; we need these while the primary base is being
8586 build_vtbl_initializer (tree binfo
,
8590 int* non_fn_entries_p
,
8591 vec
<constructor_elt
, va_gc
> **inits
)
8597 vec
<tree
, va_gc
> *vbases
;
8600 /* Initialize VID. */
8601 memset (&vid
, 0, sizeof (vid
));
8604 vid
.rtti_binfo
= rtti_binfo
;
8605 vid
.primary_vtbl_p
= SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
);
8606 vid
.ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8607 vid
.generate_vcall_entries
= true;
8608 /* The first vbase or vcall offset is at index -3 in the vtable. */
8609 vid
.index
= ssize_int(-3 * TARGET_VTABLE_DATA_ENTRY_DISTANCE
);
8611 /* Add entries to the vtable for RTTI. */
8612 build_rtti_vtbl_entries (binfo
, &vid
);
8614 /* Create an array for keeping track of the functions we've
8615 processed. When we see multiple functions with the same
8616 signature, we share the vcall offsets. */
8617 vec_alloc (vid
.fns
, 32);
8618 /* Add the vcall and vbase offset entries. */
8619 build_vcall_and_vbase_vtbl_entries (binfo
, &vid
);
8621 /* Clear BINFO_VTABLE_PATH_MARKED; it's set by
8622 build_vbase_offset_vtbl_entries. */
8623 for (vbases
= CLASSTYPE_VBASECLASSES (t
), ix
= 0;
8624 vec_safe_iterate (vbases
, ix
, &vbinfo
); ix
++)
8625 BINFO_VTABLE_PATH_MARKED (vbinfo
) = 0;
8627 /* If the target requires padding between data entries, add that now. */
8628 if (TARGET_VTABLE_DATA_ENTRY_DISTANCE
> 1)
8630 int n_entries
= vec_safe_length (vid
.inits
);
8632 vec_safe_grow (vid
.inits
, TARGET_VTABLE_DATA_ENTRY_DISTANCE
* n_entries
);
8634 /* Move data entries into their new positions and add padding
8635 after the new positions. Iterate backwards so we don't
8636 overwrite entries that we would need to process later. */
8637 for (ix
= n_entries
- 1;
8638 vid
.inits
->iterate (ix
, &e
);
8642 int new_position
= (TARGET_VTABLE_DATA_ENTRY_DISTANCE
* ix
8643 + (TARGET_VTABLE_DATA_ENTRY_DISTANCE
- 1));
8645 (*vid
.inits
)[new_position
] = *e
;
8647 for (j
= 1; j
< TARGET_VTABLE_DATA_ENTRY_DISTANCE
; ++j
)
8649 constructor_elt
*f
= &(*vid
.inits
)[new_position
- j
];
8650 f
->index
= NULL_TREE
;
8651 f
->value
= build1 (NOP_EXPR
, vtable_entry_type
,
8657 if (non_fn_entries_p
)
8658 *non_fn_entries_p
= vec_safe_length (vid
.inits
);
8660 /* The initializers for virtual functions were built up in reverse
8661 order. Straighten them out and add them to the running list in one
8663 jx
= vec_safe_length (*inits
);
8664 vec_safe_grow (*inits
, jx
+ vid
.inits
->length ());
8666 for (ix
= vid
.inits
->length () - 1;
8667 vid
.inits
->iterate (ix
, &e
);
8671 /* Go through all the ordinary virtual functions, building up
8673 for (v
= BINFO_VIRTUALS (orig_binfo
); v
; v
= TREE_CHAIN (v
))
8677 tree fn
, fn_original
;
8678 tree init
= NULL_TREE
;
8682 if (DECL_THUNK_P (fn
))
8684 if (!DECL_NAME (fn
))
8686 if (THUNK_ALIAS (fn
))
8688 fn
= THUNK_ALIAS (fn
);
8691 fn_original
= THUNK_TARGET (fn
);
8694 /* If the only definition of this function signature along our
8695 primary base chain is from a lost primary, this vtable slot will
8696 never be used, so just zero it out. This is important to avoid
8697 requiring extra thunks which cannot be generated with the function.
8699 We first check this in update_vtable_entry_for_fn, so we handle
8700 restored primary bases properly; we also need to do it here so we
8701 zero out unused slots in ctor vtables, rather than filling them
8702 with erroneous values (though harmless, apart from relocation
8704 if (BV_LOST_PRIMARY (v
))
8705 init
= size_zero_node
;
8709 /* Pull the offset for `this', and the function to call, out of
8711 delta
= BV_DELTA (v
);
8712 vcall_index
= BV_VCALL_INDEX (v
);
8714 gcc_assert (TREE_CODE (delta
) == INTEGER_CST
);
8715 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
8717 /* You can't call an abstract virtual function; it's abstract.
8718 So, we replace these functions with __pure_virtual. */
8719 if (DECL_PURE_VIRTUAL_P (fn_original
))
8722 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
8724 if (abort_fndecl_addr
== NULL
)
8726 = fold_convert (vfunc_ptr_type_node
,
8727 build_fold_addr_expr (fn
));
8728 init
= abort_fndecl_addr
;
8731 /* Likewise for deleted virtuals. */
8732 else if (DECL_DELETED_FN (fn_original
))
8734 fn
= get_identifier ("__cxa_deleted_virtual");
8735 if (!get_global_value_if_present (fn
, &fn
))
8736 fn
= push_library_fn (fn
, (build_function_type_list
8737 (void_type_node
, NULL_TREE
)),
8739 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
8740 init
= fold_convert (vfunc_ptr_type_node
,
8741 build_fold_addr_expr (fn
));
8745 if (!integer_zerop (delta
) || vcall_index
)
8747 fn
= make_thunk (fn
, /*this_adjusting=*/1, delta
, vcall_index
);
8748 if (!DECL_NAME (fn
))
8751 /* Take the address of the function, considering it to be of an
8752 appropriate generic type. */
8753 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
8754 init
= fold_convert (vfunc_ptr_type_node
,
8755 build_fold_addr_expr (fn
));
8759 /* And add it to the chain of initializers. */
8760 if (TARGET_VTABLE_USES_DESCRIPTORS
)
8763 if (init
== size_zero_node
)
8764 for (i
= 0; i
< TARGET_VTABLE_USES_DESCRIPTORS
; ++i
)
8765 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
8767 for (i
= 0; i
< TARGET_VTABLE_USES_DESCRIPTORS
; ++i
)
8769 tree fdesc
= build2 (FDESC_EXPR
, vfunc_ptr_type_node
,
8770 fn
, build_int_cst (NULL_TREE
, i
));
8771 TREE_CONSTANT (fdesc
) = 1;
8773 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, fdesc
);
8777 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
8781 /* Adds to vid->inits the initializers for the vbase and vcall
8782 offsets in BINFO, which is in the hierarchy dominated by T. */
8785 build_vcall_and_vbase_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
8789 /* If this is a derived class, we must first create entries
8790 corresponding to the primary base class. */
8791 b
= get_primary_binfo (binfo
);
8793 build_vcall_and_vbase_vtbl_entries (b
, vid
);
8795 /* Add the vbase entries for this base. */
8796 build_vbase_offset_vtbl_entries (binfo
, vid
);
8797 /* Add the vcall entries for this base. */
8798 build_vcall_offset_vtbl_entries (binfo
, vid
);
8801 /* Returns the initializers for the vbase offset entries in the vtable
8802 for BINFO (which is part of the class hierarchy dominated by T), in
8803 reverse order. VBASE_OFFSET_INDEX gives the vtable index
8804 where the next vbase offset will go. */
8807 build_vbase_offset_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
8811 tree non_primary_binfo
;
8813 /* If there are no virtual baseclasses, then there is nothing to
8815 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
)))
8820 /* We might be a primary base class. Go up the inheritance hierarchy
8821 until we find the most derived class of which we are a primary base:
8822 it is the offset of that which we need to use. */
8823 non_primary_binfo
= binfo
;
8824 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo
))
8828 /* If we have reached a virtual base, then it must be a primary
8829 base (possibly multi-level) of vid->binfo, or we wouldn't
8830 have called build_vcall_and_vbase_vtbl_entries for it. But it
8831 might be a lost primary, so just skip down to vid->binfo. */
8832 if (BINFO_VIRTUAL_P (non_primary_binfo
))
8834 non_primary_binfo
= vid
->binfo
;
8838 b
= BINFO_INHERITANCE_CHAIN (non_primary_binfo
);
8839 if (get_primary_binfo (b
) != non_primary_binfo
)
8841 non_primary_binfo
= b
;
8844 /* Go through the virtual bases, adding the offsets. */
8845 for (vbase
= TYPE_BINFO (BINFO_TYPE (binfo
));
8847 vbase
= TREE_CHAIN (vbase
))
8852 if (!BINFO_VIRTUAL_P (vbase
))
8855 /* Find the instance of this virtual base in the complete
8857 b
= copied_binfo (vbase
, binfo
);
8859 /* If we've already got an offset for this virtual base, we
8860 don't need another one. */
8861 if (BINFO_VTABLE_PATH_MARKED (b
))
8863 BINFO_VTABLE_PATH_MARKED (b
) = 1;
8865 /* Figure out where we can find this vbase offset. */
8866 delta
= size_binop (MULT_EXPR
,
8869 TYPE_SIZE_UNIT (vtable_entry_type
)));
8870 if (vid
->primary_vtbl_p
)
8871 BINFO_VPTR_FIELD (b
) = delta
;
8873 if (binfo
!= TYPE_BINFO (t
))
8874 /* The vbase offset had better be the same. */
8875 gcc_assert (tree_int_cst_equal (delta
, BINFO_VPTR_FIELD (vbase
)));
8877 /* The next vbase will come at a more negative offset. */
8878 vid
->index
= size_binop (MINUS_EXPR
, vid
->index
,
8879 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE
));
8881 /* The initializer is the delta from BINFO to this virtual base.
8882 The vbase offsets go in reverse inheritance-graph order, and
8883 we are walking in inheritance graph order so these end up in
8885 delta
= size_diffop_loc (input_location
,
8886 BINFO_OFFSET (b
), BINFO_OFFSET (non_primary_binfo
));
8888 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
,
8889 fold_build1_loc (input_location
, NOP_EXPR
,
8890 vtable_entry_type
, delta
));
8894 /* Adds the initializers for the vcall offset entries in the vtable
8895 for BINFO (which is part of the class hierarchy dominated by VID->DERIVED)
8899 build_vcall_offset_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
8901 /* We only need these entries if this base is a virtual base. We
8902 compute the indices -- but do not add to the vtable -- when
8903 building the main vtable for a class. */
8904 if (binfo
== TYPE_BINFO (vid
->derived
)
8905 || (BINFO_VIRTUAL_P (binfo
)
8906 /* If BINFO is RTTI_BINFO, then (since BINFO does not
8907 correspond to VID->DERIVED), we are building a primary
8908 construction virtual table. Since this is a primary
8909 virtual table, we do not need the vcall offsets for
8911 && binfo
!= vid
->rtti_binfo
))
8913 /* We need a vcall offset for each of the virtual functions in this
8914 vtable. For example:
8916 class A { virtual void f (); };
8917 class B1 : virtual public A { virtual void f (); };
8918 class B2 : virtual public A { virtual void f (); };
8919 class C: public B1, public B2 { virtual void f (); };
8921 A C object has a primary base of B1, which has a primary base of A. A
8922 C also has a secondary base of B2, which no longer has a primary base
8923 of A. So the B2-in-C construction vtable needs a secondary vtable for
8924 A, which will adjust the A* to a B2* to call f. We have no way of
8925 knowing what (or even whether) this offset will be when we define B2,
8926 so we store this "vcall offset" in the A sub-vtable and look it up in
8927 a "virtual thunk" for B2::f.
8929 We need entries for all the functions in our primary vtable and
8930 in our non-virtual bases' secondary vtables. */
8932 /* If we are just computing the vcall indices -- but do not need
8933 the actual entries -- not that. */
8934 if (!BINFO_VIRTUAL_P (binfo
))
8935 vid
->generate_vcall_entries
= false;
8936 /* Now, walk through the non-virtual bases, adding vcall offsets. */
8937 add_vcall_offset_vtbl_entries_r (binfo
, vid
);
8941 /* Build vcall offsets, starting with those for BINFO. */
8944 add_vcall_offset_vtbl_entries_r (tree binfo
, vtbl_init_data
* vid
)
8950 /* Don't walk into virtual bases -- except, of course, for the
8951 virtual base for which we are building vcall offsets. Any
8952 primary virtual base will have already had its offsets generated
8953 through the recursion in build_vcall_and_vbase_vtbl_entries. */
8954 if (BINFO_VIRTUAL_P (binfo
) && vid
->vbase
!= binfo
)
8957 /* If BINFO has a primary base, process it first. */
8958 primary_binfo
= get_primary_binfo (binfo
);
8960 add_vcall_offset_vtbl_entries_r (primary_binfo
, vid
);
8962 /* Add BINFO itself to the list. */
8963 add_vcall_offset_vtbl_entries_1 (binfo
, vid
);
8965 /* Scan the non-primary bases of BINFO. */
8966 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
8967 if (base_binfo
!= primary_binfo
)
8968 add_vcall_offset_vtbl_entries_r (base_binfo
, vid
);
8971 /* Called from build_vcall_offset_vtbl_entries_r. */
8974 add_vcall_offset_vtbl_entries_1 (tree binfo
, vtbl_init_data
* vid
)
8976 /* Make entries for the rest of the virtuals. */
8977 if (abi_version_at_least (2))
8981 /* The ABI requires that the methods be processed in declaration
8982 order. G++ 3.2 used the order in the vtable. */
8983 for (orig_fn
= TYPE_METHODS (BINFO_TYPE (binfo
));
8985 orig_fn
= DECL_CHAIN (orig_fn
))
8986 if (DECL_VINDEX (orig_fn
))
8987 add_vcall_offset (orig_fn
, binfo
, vid
);
8991 tree derived_virtuals
;
8994 /* If BINFO is a primary base, the most derived class which has
8995 BINFO as a primary base; otherwise, just BINFO. */
8996 tree non_primary_binfo
;
8998 /* We might be a primary base class. Go up the inheritance hierarchy
8999 until we find the most derived class of which we are a primary base:
9000 it is the BINFO_VIRTUALS there that we need to consider. */
9001 non_primary_binfo
= binfo
;
9002 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo
))
9006 /* If we have reached a virtual base, then it must be vid->vbase,
9007 because we ignore other virtual bases in
9008 add_vcall_offset_vtbl_entries_r. In turn, it must be a primary
9009 base (possibly multi-level) of vid->binfo, or we wouldn't
9010 have called build_vcall_and_vbase_vtbl_entries for it. But it
9011 might be a lost primary, so just skip down to vid->binfo. */
9012 if (BINFO_VIRTUAL_P (non_primary_binfo
))
9014 gcc_assert (non_primary_binfo
== vid
->vbase
);
9015 non_primary_binfo
= vid
->binfo
;
9019 b
= BINFO_INHERITANCE_CHAIN (non_primary_binfo
);
9020 if (get_primary_binfo (b
) != non_primary_binfo
)
9022 non_primary_binfo
= b
;
9025 if (vid
->ctor_vtbl_p
)
9026 /* For a ctor vtable we need the equivalent binfo within the hierarchy
9027 where rtti_binfo is the most derived type. */
9029 = original_binfo (non_primary_binfo
, vid
->rtti_binfo
);
9031 for (base_virtuals
= BINFO_VIRTUALS (binfo
),
9032 derived_virtuals
= BINFO_VIRTUALS (non_primary_binfo
),
9033 orig_virtuals
= BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo
)));
9035 base_virtuals
= TREE_CHAIN (base_virtuals
),
9036 derived_virtuals
= TREE_CHAIN (derived_virtuals
),
9037 orig_virtuals
= TREE_CHAIN (orig_virtuals
))
9041 /* Find the declaration that originally caused this function to
9042 be present in BINFO_TYPE (binfo). */
9043 orig_fn
= BV_FN (orig_virtuals
);
9045 /* When processing BINFO, we only want to generate vcall slots for
9046 function slots introduced in BINFO. So don't try to generate
9047 one if the function isn't even defined in BINFO. */
9048 if (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), DECL_CONTEXT (orig_fn
)))
9051 add_vcall_offset (orig_fn
, binfo
, vid
);
9056 /* Add a vcall offset entry for ORIG_FN to the vtable. */
9059 add_vcall_offset (tree orig_fn
, tree binfo
, vtbl_init_data
*vid
)
9065 /* If there is already an entry for a function with the same
9066 signature as FN, then we do not need a second vcall offset.
9067 Check the list of functions already present in the derived
9069 FOR_EACH_VEC_SAFE_ELT (vid
->fns
, i
, derived_entry
)
9071 if (same_signature_p (derived_entry
, orig_fn
)
9072 /* We only use one vcall offset for virtual destructors,
9073 even though there are two virtual table entries. */
9074 || (DECL_DESTRUCTOR_P (derived_entry
)
9075 && DECL_DESTRUCTOR_P (orig_fn
)))
9079 /* If we are building these vcall offsets as part of building
9080 the vtable for the most derived class, remember the vcall
9082 if (vid
->binfo
== TYPE_BINFO (vid
->derived
))
9084 tree_pair_s elt
= {orig_fn
, vid
->index
};
9085 vec_safe_push (CLASSTYPE_VCALL_INDICES (vid
->derived
), elt
);
9088 /* The next vcall offset will be found at a more negative
9090 vid
->index
= size_binop (MINUS_EXPR
, vid
->index
,
9091 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE
));
9093 /* Keep track of this function. */
9094 vec_safe_push (vid
->fns
, orig_fn
);
9096 if (vid
->generate_vcall_entries
)
9101 /* Find the overriding function. */
9102 fn
= find_final_overrider (vid
->rtti_binfo
, binfo
, orig_fn
);
9103 if (fn
== error_mark_node
)
9104 vcall_offset
= build_zero_cst (vtable_entry_type
);
9107 base
= TREE_VALUE (fn
);
9109 /* The vbase we're working on is a primary base of
9110 vid->binfo. But it might be a lost primary, so its
9111 BINFO_OFFSET might be wrong, so we just use the
9112 BINFO_OFFSET from vid->binfo. */
9113 vcall_offset
= size_diffop_loc (input_location
,
9114 BINFO_OFFSET (base
),
9115 BINFO_OFFSET (vid
->binfo
));
9116 vcall_offset
= fold_build1_loc (input_location
,
9117 NOP_EXPR
, vtable_entry_type
,
9120 /* Add the initializer to the vtable. */
9121 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, vcall_offset
);
9125 /* Return vtbl initializers for the RTTI entries corresponding to the
9126 BINFO's vtable. The RTTI entries should indicate the object given
9127 by VID->rtti_binfo. */
9130 build_rtti_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9138 t
= BINFO_TYPE (vid
->rtti_binfo
);
9140 /* To find the complete object, we will first convert to our most
9141 primary base, and then add the offset in the vtbl to that value. */
9143 while (CLASSTYPE_HAS_PRIMARY_BASE_P (BINFO_TYPE (b
))
9144 && !BINFO_LOST_PRIMARY_P (b
))
9148 primary_base
= get_primary_binfo (b
);
9149 gcc_assert (BINFO_PRIMARY_P (primary_base
)
9150 && BINFO_INHERITANCE_CHAIN (primary_base
) == b
);
9153 offset
= size_diffop_loc (input_location
,
9154 BINFO_OFFSET (vid
->rtti_binfo
), BINFO_OFFSET (b
));
9156 /* The second entry is the address of the typeinfo object. */
9158 decl
= build_address (get_tinfo_decl (t
));
9160 decl
= integer_zero_node
;
9162 /* Convert the declaration to a type that can be stored in the
9164 init
= build_nop (vfunc_ptr_type_node
, decl
);
9165 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, init
);
9167 /* Add the offset-to-top entry. It comes earlier in the vtable than
9168 the typeinfo entry. Convert the offset to look like a
9169 function pointer, so that we can put it in the vtable. */
9170 init
= build_nop (vfunc_ptr_type_node
, offset
);
9171 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, init
);
9174 /* TRUE iff TYPE is uniquely derived from PARENT. Ignores
9178 uniquely_derived_from_p (tree parent
, tree type
)
9180 tree base
= lookup_base (type
, parent
, ba_unique
, NULL
, tf_none
);
9181 return base
&& base
!= error_mark_node
;
9184 /* TRUE iff TYPE is publicly & uniquely derived from PARENT. */
9187 publicly_uniquely_derived_p (tree parent
, tree type
)
9189 tree base
= lookup_base (type
, parent
, ba_ignore_scope
| ba_check
,
9191 return base
&& base
!= error_mark_node
;
9194 #include "gt-cp-class.h"