1 /* Functions related to building classes and their related objects.
2 Copyright (C) 1987-2014 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
22 /* High-level class interface. */
26 #include "coretypes.h"
29 #include "stringpool.h"
30 #include "stor-layout.h"
32 #include "pointer-set.h"
33 #include "hash-table.h"
41 #include "splay-tree.h"
44 /* The number of nested classes being processed. If we are not in the
45 scope of any class, this is zero. */
47 int current_class_depth
;
49 /* In order to deal with nested classes, we keep a stack of classes.
50 The topmost entry is the innermost class, and is the entry at index
51 CURRENT_CLASS_DEPTH */
53 typedef struct class_stack_node
{
54 /* The name of the class. */
57 /* The _TYPE node for the class. */
60 /* The access specifier pending for new declarations in the scope of
64 /* If were defining TYPE, the names used in this class. */
65 splay_tree names_used
;
67 /* Nonzero if this class is no longer open, because of a call to
70 }* class_stack_node_t
;
72 typedef struct vtbl_init_data_s
74 /* The base for which we're building initializers. */
76 /* The type of the most-derived type. */
78 /* The binfo for the dynamic type. This will be TYPE_BINFO (derived),
79 unless ctor_vtbl_p is true. */
81 /* The negative-index vtable initializers built up so far. These
82 are in order from least negative index to most negative index. */
83 vec
<constructor_elt
, va_gc
> *inits
;
84 /* The binfo for the virtual base for which we're building
85 vcall offset initializers. */
87 /* The functions in vbase for which we have already provided vcall
89 vec
<tree
, va_gc
> *fns
;
90 /* The vtable index of the next vcall or vbase offset. */
92 /* Nonzero if we are building the initializer for the primary
95 /* Nonzero if we are building the initializer for a construction
98 /* True when adding vcall offset entries to the vtable. False when
99 merely computing the indices. */
100 bool generate_vcall_entries
;
103 /* The type of a function passed to walk_subobject_offsets. */
104 typedef int (*subobject_offset_fn
) (tree
, tree
, splay_tree
);
106 /* The stack itself. This is a dynamically resized array. The
107 number of elements allocated is CURRENT_CLASS_STACK_SIZE. */
108 static int current_class_stack_size
;
109 static class_stack_node_t current_class_stack
;
111 /* The size of the largest empty class seen in this translation unit. */
112 static GTY (()) tree sizeof_biggest_empty_class
;
114 /* An array of all local classes present in this translation unit, in
115 declaration order. */
116 vec
<tree
, va_gc
> *local_classes
;
118 static tree
get_vfield_name (tree
);
119 static void finish_struct_anon (tree
);
120 static tree
get_vtable_name (tree
);
121 static tree
get_basefndecls (tree
, tree
);
122 static int build_primary_vtable (tree
, tree
);
123 static int build_secondary_vtable (tree
);
124 static void finish_vtbls (tree
);
125 static void modify_vtable_entry (tree
, tree
, tree
, tree
, tree
*);
126 static void finish_struct_bits (tree
);
127 static int alter_access (tree
, tree
, tree
);
128 static void handle_using_decl (tree
, tree
);
129 static tree
dfs_modify_vtables (tree
, void *);
130 static tree
modify_all_vtables (tree
, tree
);
131 static void determine_primary_bases (tree
);
132 static void finish_struct_methods (tree
);
133 static void maybe_warn_about_overly_private_class (tree
);
134 static int method_name_cmp (const void *, const void *);
135 static int resort_method_name_cmp (const void *, const void *);
136 static void add_implicitly_declared_members (tree
, tree
*, int, int);
137 static tree
fixed_type_or_null (tree
, int *, int *);
138 static tree
build_simple_base_path (tree expr
, tree binfo
);
139 static tree
build_vtbl_ref_1 (tree
, tree
);
140 static void build_vtbl_initializer (tree
, tree
, tree
, tree
, int *,
141 vec
<constructor_elt
, va_gc
> **);
142 static int count_fields (tree
);
143 static int add_fields_to_record_type (tree
, struct sorted_fields_type
*, int);
144 static void insert_into_classtype_sorted_fields (tree
, tree
, int);
145 static bool check_bitfield_decl (tree
);
146 static void check_field_decl (tree
, tree
, int *, int *, int *);
147 static void check_field_decls (tree
, tree
*, int *, int *);
148 static tree
*build_base_field (record_layout_info
, tree
, splay_tree
, tree
*);
149 static void build_base_fields (record_layout_info
, splay_tree
, tree
*);
150 static void check_methods (tree
);
151 static void remove_zero_width_bit_fields (tree
);
152 static bool accessible_nvdtor_p (tree
);
153 static void check_bases (tree
, int *, int *);
154 static void check_bases_and_members (tree
);
155 static tree
create_vtable_ptr (tree
, tree
*);
156 static void include_empty_classes (record_layout_info
);
157 static void layout_class_type (tree
, tree
*);
158 static void propagate_binfo_offsets (tree
, tree
);
159 static void layout_virtual_bases (record_layout_info
, splay_tree
);
160 static void build_vbase_offset_vtbl_entries (tree
, vtbl_init_data
*);
161 static void add_vcall_offset_vtbl_entries_r (tree
, vtbl_init_data
*);
162 static void add_vcall_offset_vtbl_entries_1 (tree
, vtbl_init_data
*);
163 static void build_vcall_offset_vtbl_entries (tree
, vtbl_init_data
*);
164 static void add_vcall_offset (tree
, tree
, vtbl_init_data
*);
165 static void layout_vtable_decl (tree
, int);
166 static tree
dfs_find_final_overrider_pre (tree
, void *);
167 static tree
dfs_find_final_overrider_post (tree
, void *);
168 static tree
find_final_overrider (tree
, tree
, tree
);
169 static int make_new_vtable (tree
, tree
);
170 static tree
get_primary_binfo (tree
);
171 static int maybe_indent_hierarchy (FILE *, int, int);
172 static tree
dump_class_hierarchy_r (FILE *, int, tree
, tree
, int);
173 static void dump_class_hierarchy (tree
);
174 static void dump_class_hierarchy_1 (FILE *, int, tree
);
175 static void dump_array (FILE *, tree
);
176 static void dump_vtable (tree
, tree
, tree
);
177 static void dump_vtt (tree
, tree
);
178 static void dump_thunk (FILE *, int, tree
);
179 static tree
build_vtable (tree
, tree
, tree
);
180 static void initialize_vtable (tree
, vec
<constructor_elt
, va_gc
> *);
181 static void layout_nonempty_base_or_field (record_layout_info
,
182 tree
, tree
, splay_tree
);
183 static tree
end_of_class (tree
, int);
184 static bool layout_empty_base (record_layout_info
, tree
, tree
, splay_tree
);
185 static void accumulate_vtbl_inits (tree
, tree
, tree
, tree
, tree
,
186 vec
<constructor_elt
, va_gc
> **);
187 static void dfs_accumulate_vtbl_inits (tree
, tree
, tree
, tree
, tree
,
188 vec
<constructor_elt
, va_gc
> **);
189 static void build_rtti_vtbl_entries (tree
, vtbl_init_data
*);
190 static void build_vcall_and_vbase_vtbl_entries (tree
, vtbl_init_data
*);
191 static void clone_constructors_and_destructors (tree
);
192 static tree
build_clone (tree
, tree
);
193 static void update_vtable_entry_for_fn (tree
, tree
, tree
, tree
*, unsigned);
194 static void build_ctor_vtbl_group (tree
, tree
);
195 static void build_vtt (tree
);
196 static tree
binfo_ctor_vtable (tree
);
197 static void build_vtt_inits (tree
, tree
, vec
<constructor_elt
, va_gc
> **,
199 static tree
dfs_build_secondary_vptr_vtt_inits (tree
, void *);
200 static tree
dfs_fixup_binfo_vtbls (tree
, void *);
201 static int record_subobject_offset (tree
, tree
, splay_tree
);
202 static int check_subobject_offset (tree
, tree
, splay_tree
);
203 static int walk_subobject_offsets (tree
, subobject_offset_fn
,
204 tree
, splay_tree
, tree
, int);
205 static void record_subobject_offsets (tree
, tree
, splay_tree
, bool);
206 static int layout_conflict_p (tree
, tree
, splay_tree
, int);
207 static int splay_tree_compare_integer_csts (splay_tree_key k1
,
209 static void warn_about_ambiguous_bases (tree
);
210 static bool type_requires_array_cookie (tree
);
211 static bool contains_empty_class_p (tree
);
212 static bool base_derived_from (tree
, tree
);
213 static int empty_base_at_nonzero_offset_p (tree
, tree
, splay_tree
);
214 static tree
end_of_base (tree
);
215 static tree
get_vcall_index (tree
, tree
);
217 /* Variables shared between class.c and call.c. */
220 int n_vtable_entries
= 0;
221 int n_vtable_searches
= 0;
222 int n_vtable_elems
= 0;
223 int n_convert_harshness
= 0;
224 int n_compute_conversion_costs
= 0;
225 int n_inner_fields_searched
= 0;
227 /* Convert to or from a base subobject. EXPR is an expression of type
228 `A' or `A*', an expression of type `B' or `B*' is returned. To
229 convert A to a base B, CODE is PLUS_EXPR and BINFO is the binfo for
230 the B base instance within A. To convert base A to derived B, CODE
231 is MINUS_EXPR and BINFO is the binfo for the A instance within B.
232 In this latter case, A must not be a morally virtual base of B.
233 NONNULL is true if EXPR is known to be non-NULL (this is only
234 needed when EXPR is of pointer type). CV qualifiers are preserved
238 build_base_path (enum tree_code code
,
242 tsubst_flags_t complain
)
244 tree v_binfo
= NULL_TREE
;
245 tree d_binfo
= NULL_TREE
;
249 tree null_test
= NULL
;
250 tree ptr_target_type
;
252 int want_pointer
= TYPE_PTR_P (TREE_TYPE (expr
));
253 bool has_empty
= false;
256 if (expr
== error_mark_node
|| binfo
== error_mark_node
|| !binfo
)
257 return error_mark_node
;
259 for (probe
= binfo
; probe
; probe
= BINFO_INHERITANCE_CHAIN (probe
))
262 if (is_empty_class (BINFO_TYPE (probe
)))
264 if (!v_binfo
&& BINFO_VIRTUAL_P (probe
))
268 probe
= TYPE_MAIN_VARIANT (TREE_TYPE (expr
));
270 probe
= TYPE_MAIN_VARIANT (TREE_TYPE (probe
));
272 if (code
== PLUS_EXPR
273 && !SAME_BINFO_TYPE_P (BINFO_TYPE (d_binfo
), probe
))
275 /* This can happen when adjust_result_of_qualified_name_lookup can't
276 find a unique base binfo in a call to a member function. We
277 couldn't give the diagnostic then since we might have been calling
278 a static member function, so we do it now. */
279 if (complain
& tf_error
)
281 tree base
= lookup_base (probe
, BINFO_TYPE (d_binfo
),
282 ba_unique
, NULL
, complain
);
283 gcc_assert (base
== error_mark_node
);
285 return error_mark_node
;
288 gcc_assert ((code
== MINUS_EXPR
289 && SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), probe
))
290 || code
== PLUS_EXPR
);
292 if (binfo
== d_binfo
)
296 if (code
== MINUS_EXPR
&& v_binfo
)
298 if (complain
& tf_error
)
300 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), BINFO_TYPE (v_binfo
)))
303 error ("cannot convert from pointer to base class %qT to "
304 "pointer to derived class %qT because the base is "
305 "virtual", BINFO_TYPE (binfo
), BINFO_TYPE (d_binfo
));
307 error ("cannot convert from base class %qT to derived "
308 "class %qT because the base is virtual",
309 BINFO_TYPE (binfo
), BINFO_TYPE (d_binfo
));
314 error ("cannot convert from pointer to base class %qT to "
315 "pointer to derived class %qT via virtual base %qT",
316 BINFO_TYPE (binfo
), BINFO_TYPE (d_binfo
),
317 BINFO_TYPE (v_binfo
));
319 error ("cannot convert from base class %qT to derived "
320 "class %qT via virtual base %qT", BINFO_TYPE (binfo
),
321 BINFO_TYPE (d_binfo
), BINFO_TYPE (v_binfo
));
324 return error_mark_node
;
328 /* This must happen before the call to save_expr. */
329 expr
= cp_build_addr_expr (expr
, complain
);
331 expr
= mark_rvalue_use (expr
);
333 offset
= BINFO_OFFSET (binfo
);
334 fixed_type_p
= resolves_to_fixed_type_p (expr
, &nonnull
);
335 target_type
= code
== PLUS_EXPR
? BINFO_TYPE (binfo
) : BINFO_TYPE (d_binfo
);
336 /* TARGET_TYPE has been extracted from BINFO, and, is therefore always
337 cv-unqualified. Extract the cv-qualifiers from EXPR so that the
338 expression returned matches the input. */
339 target_type
= cp_build_qualified_type
340 (target_type
, cp_type_quals (TREE_TYPE (TREE_TYPE (expr
))));
341 ptr_target_type
= build_pointer_type (target_type
);
343 /* Do we need to look in the vtable for the real offset? */
344 virtual_access
= (v_binfo
&& fixed_type_p
<= 0);
346 /* Don't bother with the calculations inside sizeof; they'll ICE if the
347 source type is incomplete and the pointer value doesn't matter. In a
348 template (even in fold_non_dependent_expr), we don't have vtables set
349 up properly yet, and the value doesn't matter there either; we're just
350 interested in the result of overload resolution. */
351 if (cp_unevaluated_operand
!= 0
352 || in_template_function ())
354 expr
= build_nop (ptr_target_type
, expr
);
356 expr
= build_indirect_ref (EXPR_LOCATION (expr
), expr
, RO_NULL
);
360 /* If we're in an NSDMI, we don't have the full constructor context yet
361 that we need for converting to a virtual base, so just build a stub
362 CONVERT_EXPR and expand it later in bot_replace. */
363 if (virtual_access
&& fixed_type_p
< 0
364 && current_scope () != current_function_decl
)
366 expr
= build1 (CONVERT_EXPR
, ptr_target_type
, expr
);
367 CONVERT_EXPR_VBASE_PATH (expr
) = true;
369 expr
= build_indirect_ref (EXPR_LOCATION (expr
), expr
, RO_NULL
);
373 /* Do we need to check for a null pointer? */
374 if (want_pointer
&& !nonnull
)
376 /* If we know the conversion will not actually change the value
377 of EXPR, then we can avoid testing the expression for NULL.
378 We have to avoid generating a COMPONENT_REF for a base class
379 field, because other parts of the compiler know that such
380 expressions are always non-NULL. */
381 if (!virtual_access
&& integer_zerop (offset
))
382 return build_nop (ptr_target_type
, expr
);
383 null_test
= error_mark_node
;
386 /* Protect against multiple evaluation if necessary. */
387 if (TREE_SIDE_EFFECTS (expr
) && (null_test
|| virtual_access
))
388 expr
= save_expr (expr
);
390 /* Now that we've saved expr, build the real null test. */
393 tree zero
= cp_convert (TREE_TYPE (expr
), nullptr_node
, complain
);
394 null_test
= fold_build2_loc (input_location
, NE_EXPR
, boolean_type_node
,
398 /* If this is a simple base reference, express it as a COMPONENT_REF. */
399 if (code
== PLUS_EXPR
&& !virtual_access
400 /* We don't build base fields for empty bases, and they aren't very
401 interesting to the optimizers anyway. */
404 expr
= cp_build_indirect_ref (expr
, RO_NULL
, complain
);
405 expr
= build_simple_base_path (expr
, binfo
);
407 expr
= build_address (expr
);
408 target_type
= TREE_TYPE (expr
);
414 /* Going via virtual base V_BINFO. We need the static offset
415 from V_BINFO to BINFO, and the dynamic offset from D_BINFO to
416 V_BINFO. That offset is an entry in D_BINFO's vtable. */
419 if (fixed_type_p
< 0 && in_base_initializer
)
421 /* In a base member initializer, we cannot rely on the
422 vtable being set up. We have to indirect via the
426 t
= TREE_TYPE (TYPE_VFIELD (current_class_type
));
427 t
= build_pointer_type (t
);
428 v_offset
= convert (t
, current_vtt_parm
);
429 v_offset
= cp_build_indirect_ref (v_offset
, RO_NULL
, complain
);
432 v_offset
= build_vfield_ref (cp_build_indirect_ref (expr
, RO_NULL
,
434 TREE_TYPE (TREE_TYPE (expr
)));
436 if (v_offset
== error_mark_node
)
437 return error_mark_node
;
439 v_offset
= fold_build_pointer_plus (v_offset
, BINFO_VPTR_FIELD (v_binfo
));
440 v_offset
= build1 (NOP_EXPR
,
441 build_pointer_type (ptrdiff_type_node
),
443 v_offset
= cp_build_indirect_ref (v_offset
, RO_NULL
, complain
);
444 TREE_CONSTANT (v_offset
) = 1;
446 offset
= convert_to_integer (ptrdiff_type_node
,
447 size_diffop_loc (input_location
, offset
,
448 BINFO_OFFSET (v_binfo
)));
450 if (!integer_zerop (offset
))
451 v_offset
= build2 (code
, ptrdiff_type_node
, v_offset
, offset
);
453 if (fixed_type_p
< 0)
454 /* Negative fixed_type_p means this is a constructor or destructor;
455 virtual base layout is fixed in in-charge [cd]tors, but not in
457 offset
= build3 (COND_EXPR
, ptrdiff_type_node
,
458 build2 (EQ_EXPR
, boolean_type_node
,
459 current_in_charge_parm
, integer_zero_node
),
461 convert_to_integer (ptrdiff_type_node
,
462 BINFO_OFFSET (binfo
)));
468 target_type
= ptr_target_type
;
470 expr
= build1 (NOP_EXPR
, ptr_target_type
, expr
);
472 if (!integer_zerop (offset
))
474 offset
= fold_convert (sizetype
, offset
);
475 if (code
== MINUS_EXPR
)
476 offset
= fold_build1_loc (input_location
, NEGATE_EXPR
, sizetype
, offset
);
477 expr
= fold_build_pointer_plus (expr
, offset
);
483 expr
= cp_build_indirect_ref (expr
, RO_NULL
, complain
);
487 expr
= fold_build3_loc (input_location
, COND_EXPR
, target_type
, null_test
, expr
,
488 build_zero_cst (target_type
));
493 /* Subroutine of build_base_path; EXPR and BINFO are as in that function.
494 Perform a derived-to-base conversion by recursively building up a
495 sequence of COMPONENT_REFs to the appropriate base fields. */
498 build_simple_base_path (tree expr
, tree binfo
)
500 tree type
= BINFO_TYPE (binfo
);
501 tree d_binfo
= BINFO_INHERITANCE_CHAIN (binfo
);
504 if (d_binfo
== NULL_TREE
)
508 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (expr
)) == type
);
510 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x'
511 into `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only
512 an lvalue in the front end; only _DECLs and _REFs are lvalues
514 temp
= unary_complex_lvalue (ADDR_EXPR
, expr
);
516 expr
= cp_build_indirect_ref (temp
, RO_NULL
, tf_warning_or_error
);
522 expr
= build_simple_base_path (expr
, d_binfo
);
524 for (field
= TYPE_FIELDS (BINFO_TYPE (d_binfo
));
525 field
; field
= DECL_CHAIN (field
))
526 /* Is this the base field created by build_base_field? */
527 if (TREE_CODE (field
) == FIELD_DECL
528 && DECL_FIELD_IS_BASE (field
)
529 && TREE_TYPE (field
) == type
530 /* If we're looking for a field in the most-derived class,
531 also check the field offset; we can have two base fields
532 of the same type if one is an indirect virtual base and one
533 is a direct non-virtual base. */
534 && (BINFO_INHERITANCE_CHAIN (d_binfo
)
535 || tree_int_cst_equal (byte_position (field
),
536 BINFO_OFFSET (binfo
))))
538 /* We don't use build_class_member_access_expr here, as that
539 has unnecessary checks, and more importantly results in
540 recursive calls to dfs_walk_once. */
541 int type_quals
= cp_type_quals (TREE_TYPE (expr
));
543 expr
= build3 (COMPONENT_REF
,
544 cp_build_qualified_type (type
, type_quals
),
545 expr
, field
, NULL_TREE
);
546 expr
= fold_if_not_in_template (expr
);
548 /* Mark the expression const or volatile, as appropriate.
549 Even though we've dealt with the type above, we still have
550 to mark the expression itself. */
551 if (type_quals
& TYPE_QUAL_CONST
)
552 TREE_READONLY (expr
) = 1;
553 if (type_quals
& TYPE_QUAL_VOLATILE
)
554 TREE_THIS_VOLATILE (expr
) = 1;
559 /* Didn't find the base field?!? */
563 /* Convert OBJECT to the base TYPE. OBJECT is an expression whose
564 type is a class type or a pointer to a class type. In the former
565 case, TYPE is also a class type; in the latter it is another
566 pointer type. If CHECK_ACCESS is true, an error message is emitted
567 if TYPE is inaccessible. If OBJECT has pointer type, the value is
568 assumed to be non-NULL. */
571 convert_to_base (tree object
, tree type
, bool check_access
, bool nonnull
,
572 tsubst_flags_t complain
)
577 if (TYPE_PTR_P (TREE_TYPE (object
)))
579 object_type
= TREE_TYPE (TREE_TYPE (object
));
580 type
= TREE_TYPE (type
);
583 object_type
= TREE_TYPE (object
);
585 binfo
= lookup_base (object_type
, type
, check_access
? ba_check
: ba_unique
,
587 if (!binfo
|| binfo
== error_mark_node
)
588 return error_mark_node
;
590 return build_base_path (PLUS_EXPR
, object
, binfo
, nonnull
, complain
);
593 /* EXPR is an expression with unqualified class type. BASE is a base
594 binfo of that class type. Returns EXPR, converted to the BASE
595 type. This function assumes that EXPR is the most derived class;
596 therefore virtual bases can be found at their static offsets. */
599 convert_to_base_statically (tree expr
, tree base
)
603 expr_type
= TREE_TYPE (expr
);
604 if (!SAME_BINFO_TYPE_P (BINFO_TYPE (base
), expr_type
))
606 /* If this is a non-empty base, use a COMPONENT_REF. */
607 if (!is_empty_class (BINFO_TYPE (base
)))
608 return build_simple_base_path (expr
, base
);
610 /* We use fold_build2 and fold_convert below to simplify the trees
611 provided to the optimizers. It is not safe to call these functions
612 when processing a template because they do not handle C++-specific
614 gcc_assert (!processing_template_decl
);
615 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
616 if (!integer_zerop (BINFO_OFFSET (base
)))
617 expr
= fold_build_pointer_plus_loc (input_location
,
618 expr
, BINFO_OFFSET (base
));
619 expr
= fold_convert (build_pointer_type (BINFO_TYPE (base
)), expr
);
620 expr
= build_fold_indirect_ref_loc (input_location
, expr
);
628 build_vfield_ref (tree datum
, tree type
)
630 tree vfield
, vcontext
;
632 if (datum
== error_mark_node
633 /* Can happen in case of duplicate base types (c++/59082). */
634 || !TYPE_VFIELD (type
))
635 return error_mark_node
;
637 /* First, convert to the requested type. */
638 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (datum
), type
))
639 datum
= convert_to_base (datum
, type
, /*check_access=*/false,
640 /*nonnull=*/true, tf_warning_or_error
);
642 /* Second, the requested type may not be the owner of its own vptr.
643 If not, convert to the base class that owns it. We cannot use
644 convert_to_base here, because VCONTEXT may appear more than once
645 in the inheritance hierarchy of TYPE, and thus direct conversion
646 between the types may be ambiguous. Following the path back up
647 one step at a time via primary bases avoids the problem. */
648 vfield
= TYPE_VFIELD (type
);
649 vcontext
= DECL_CONTEXT (vfield
);
650 while (!same_type_ignoring_top_level_qualifiers_p (vcontext
, type
))
652 datum
= build_simple_base_path (datum
, CLASSTYPE_PRIMARY_BINFO (type
));
653 type
= TREE_TYPE (datum
);
656 return build3 (COMPONENT_REF
, TREE_TYPE (vfield
), datum
, vfield
, NULL_TREE
);
659 /* Given an object INSTANCE, return an expression which yields the
660 vtable element corresponding to INDEX. There are many special
661 cases for INSTANCE which we take care of here, mainly to avoid
662 creating extra tree nodes when we don't have to. */
665 build_vtbl_ref_1 (tree instance
, tree idx
)
668 tree vtbl
= NULL_TREE
;
670 /* Try to figure out what a reference refers to, and
671 access its virtual function table directly. */
674 tree fixed_type
= fixed_type_or_null (instance
, NULL
, &cdtorp
);
676 tree basetype
= non_reference (TREE_TYPE (instance
));
678 if (fixed_type
&& !cdtorp
)
680 tree binfo
= lookup_base (fixed_type
, basetype
,
681 ba_unique
, NULL
, tf_none
);
682 if (binfo
&& binfo
!= error_mark_node
)
683 vtbl
= unshare_expr (BINFO_VTABLE (binfo
));
687 vtbl
= build_vfield_ref (instance
, basetype
);
689 aref
= build_array_ref (input_location
, vtbl
, idx
);
690 TREE_CONSTANT (aref
) |= TREE_CONSTANT (vtbl
) && TREE_CONSTANT (idx
);
696 build_vtbl_ref (tree instance
, tree idx
)
698 tree aref
= build_vtbl_ref_1 (instance
, idx
);
703 /* Given a stable object pointer INSTANCE_PTR, return an expression which
704 yields a function pointer corresponding to vtable element INDEX. */
707 build_vfn_ref (tree instance_ptr
, tree idx
)
711 aref
= build_vtbl_ref_1 (cp_build_indirect_ref (instance_ptr
, RO_NULL
,
712 tf_warning_or_error
),
715 /* When using function descriptors, the address of the
716 vtable entry is treated as a function pointer. */
717 if (TARGET_VTABLE_USES_DESCRIPTORS
)
718 aref
= build1 (NOP_EXPR
, TREE_TYPE (aref
),
719 cp_build_addr_expr (aref
, tf_warning_or_error
));
721 /* Remember this as a method reference, for later devirtualization. */
722 aref
= build3 (OBJ_TYPE_REF
, TREE_TYPE (aref
), aref
, instance_ptr
, idx
);
727 /* Return the name of the virtual function table (as an IDENTIFIER_NODE)
728 for the given TYPE. */
731 get_vtable_name (tree type
)
733 return mangle_vtbl_for_type (type
);
736 /* DECL is an entity associated with TYPE, like a virtual table or an
737 implicitly generated constructor. Determine whether or not DECL
738 should have external or internal linkage at the object file
739 level. This routine does not deal with COMDAT linkage and other
740 similar complexities; it simply sets TREE_PUBLIC if it possible for
741 entities in other translation units to contain copies of DECL, in
745 set_linkage_according_to_type (tree
/*type*/, tree decl
)
747 TREE_PUBLIC (decl
) = 1;
748 determine_visibility (decl
);
751 /* Create a VAR_DECL for a primary or secondary vtable for CLASS_TYPE.
752 (For a secondary vtable for B-in-D, CLASS_TYPE should be D, not B.)
753 Use NAME for the name of the vtable, and VTABLE_TYPE for its type. */
756 build_vtable (tree class_type
, tree name
, tree vtable_type
)
760 decl
= build_lang_decl (VAR_DECL
, name
, vtable_type
);
761 /* vtable names are already mangled; give them their DECL_ASSEMBLER_NAME
762 now to avoid confusion in mangle_decl. */
763 SET_DECL_ASSEMBLER_NAME (decl
, name
);
764 DECL_CONTEXT (decl
) = class_type
;
765 DECL_ARTIFICIAL (decl
) = 1;
766 TREE_STATIC (decl
) = 1;
767 TREE_READONLY (decl
) = 1;
768 DECL_VIRTUAL_P (decl
) = 1;
769 DECL_ALIGN (decl
) = TARGET_VTABLE_ENTRY_ALIGN
;
770 DECL_VTABLE_OR_VTT_P (decl
) = 1;
771 /* At one time the vtable info was grabbed 2 words at a time. This
772 fails on sparc unless you have 8-byte alignment. (tiemann) */
773 DECL_ALIGN (decl
) = MAX (TYPE_ALIGN (double_type_node
),
775 set_linkage_according_to_type (class_type
, decl
);
776 /* The vtable has not been defined -- yet. */
777 DECL_EXTERNAL (decl
) = 1;
778 DECL_NOT_REALLY_EXTERN (decl
) = 1;
780 /* Mark the VAR_DECL node representing the vtable itself as a
781 "gratuitous" one, thereby forcing dwarfout.c to ignore it. It
782 is rather important that such things be ignored because any
783 effort to actually generate DWARF for them will run into
784 trouble when/if we encounter code like:
787 struct S { virtual void member (); };
789 because the artificial declaration of the vtable itself (as
790 manufactured by the g++ front end) will say that the vtable is
791 a static member of `S' but only *after* the debug output for
792 the definition of `S' has already been output. This causes
793 grief because the DWARF entry for the definition of the vtable
794 will try to refer back to an earlier *declaration* of the
795 vtable as a static member of `S' and there won't be one. We
796 might be able to arrange to have the "vtable static member"
797 attached to the member list for `S' before the debug info for
798 `S' get written (which would solve the problem) but that would
799 require more intrusive changes to the g++ front end. */
800 DECL_IGNORED_P (decl
) = 1;
805 /* Get the VAR_DECL of the vtable for TYPE. TYPE need not be polymorphic,
806 or even complete. If this does not exist, create it. If COMPLETE is
807 nonzero, then complete the definition of it -- that will render it
808 impossible to actually build the vtable, but is useful to get at those
809 which are known to exist in the runtime. */
812 get_vtable_decl (tree type
, int complete
)
816 if (CLASSTYPE_VTABLES (type
))
817 return CLASSTYPE_VTABLES (type
);
819 decl
= build_vtable (type
, get_vtable_name (type
), vtbl_type_node
);
820 CLASSTYPE_VTABLES (type
) = decl
;
824 DECL_EXTERNAL (decl
) = 1;
825 cp_finish_decl (decl
, NULL_TREE
, false, NULL_TREE
, 0);
831 /* Build the primary virtual function table for TYPE. If BINFO is
832 non-NULL, build the vtable starting with the initial approximation
833 that it is the same as the one which is the head of the association
834 list. Returns a nonzero value if a new vtable is actually
838 build_primary_vtable (tree binfo
, tree type
)
843 decl
= get_vtable_decl (type
, /*complete=*/0);
847 if (BINFO_NEW_VTABLE_MARKED (binfo
))
848 /* We have already created a vtable for this base, so there's
849 no need to do it again. */
852 virtuals
= copy_list (BINFO_VIRTUALS (binfo
));
853 TREE_TYPE (decl
) = TREE_TYPE (get_vtbl_decl_for_binfo (binfo
));
854 DECL_SIZE (decl
) = TYPE_SIZE (TREE_TYPE (decl
));
855 DECL_SIZE_UNIT (decl
) = TYPE_SIZE_UNIT (TREE_TYPE (decl
));
859 gcc_assert (TREE_TYPE (decl
) == vtbl_type_node
);
860 virtuals
= NULL_TREE
;
863 if (GATHER_STATISTICS
)
866 n_vtable_elems
+= list_length (virtuals
);
869 /* Initialize the association list for this type, based
870 on our first approximation. */
871 BINFO_VTABLE (TYPE_BINFO (type
)) = decl
;
872 BINFO_VIRTUALS (TYPE_BINFO (type
)) = virtuals
;
873 SET_BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (type
));
877 /* Give BINFO a new virtual function table which is initialized
878 with a skeleton-copy of its original initialization. The only
879 entry that changes is the `delta' entry, so we can really
880 share a lot of structure.
882 FOR_TYPE is the most derived type which caused this table to
885 Returns nonzero if we haven't met BINFO before.
887 The order in which vtables are built (by calling this function) for
888 an object must remain the same, otherwise a binary incompatibility
892 build_secondary_vtable (tree binfo
)
894 if (BINFO_NEW_VTABLE_MARKED (binfo
))
895 /* We already created a vtable for this base. There's no need to
899 /* Remember that we've created a vtable for this BINFO, so that we
900 don't try to do so again. */
901 SET_BINFO_NEW_VTABLE_MARKED (binfo
);
903 /* Make fresh virtual list, so we can smash it later. */
904 BINFO_VIRTUALS (binfo
) = copy_list (BINFO_VIRTUALS (binfo
));
906 /* Secondary vtables are laid out as part of the same structure as
907 the primary vtable. */
908 BINFO_VTABLE (binfo
) = NULL_TREE
;
912 /* Create a new vtable for BINFO which is the hierarchy dominated by
913 T. Return nonzero if we actually created a new vtable. */
916 make_new_vtable (tree t
, tree binfo
)
918 if (binfo
== TYPE_BINFO (t
))
919 /* In this case, it is *type*'s vtable we are modifying. We start
920 with the approximation that its vtable is that of the
921 immediate base class. */
922 return build_primary_vtable (binfo
, t
);
924 /* This is our very own copy of `basetype' to play with. Later,
925 we will fill in all the virtual functions that override the
926 virtual functions in these base classes which are not defined
927 by the current type. */
928 return build_secondary_vtable (binfo
);
931 /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO
932 (which is in the hierarchy dominated by T) list FNDECL as its
933 BV_FN. DELTA is the required constant adjustment from the `this'
934 pointer where the vtable entry appears to the `this' required when
935 the function is actually called. */
938 modify_vtable_entry (tree t
,
948 if (fndecl
!= BV_FN (v
)
949 || !tree_int_cst_equal (delta
, BV_DELTA (v
)))
951 /* We need a new vtable for BINFO. */
952 if (make_new_vtable (t
, binfo
))
954 /* If we really did make a new vtable, we also made a copy
955 of the BINFO_VIRTUALS list. Now, we have to find the
956 corresponding entry in that list. */
957 *virtuals
= BINFO_VIRTUALS (binfo
);
958 while (BV_FN (*virtuals
) != BV_FN (v
))
959 *virtuals
= TREE_CHAIN (*virtuals
);
963 BV_DELTA (v
) = delta
;
964 BV_VCALL_INDEX (v
) = NULL_TREE
;
970 /* Add method METHOD to class TYPE. If USING_DECL is non-null, it is
971 the USING_DECL naming METHOD. Returns true if the method could be
972 added to the method vec. */
975 add_method (tree type
, tree method
, tree using_decl
)
979 bool template_conv_p
= false;
981 vec
<tree
, va_gc
> *method_vec
;
983 bool insert_p
= false;
987 if (method
== error_mark_node
)
990 complete_p
= COMPLETE_TYPE_P (type
);
991 conv_p
= DECL_CONV_FN_P (method
);
993 template_conv_p
= (TREE_CODE (method
) == TEMPLATE_DECL
994 && DECL_TEMPLATE_CONV_FN_P (method
));
996 method_vec
= CLASSTYPE_METHOD_VEC (type
);
999 /* Make a new method vector. We start with 8 entries. We must
1000 allocate at least two (for constructors and destructors), and
1001 we're going to end up with an assignment operator at some
1003 vec_alloc (method_vec
, 8);
1004 /* Create slots for constructors and destructors. */
1005 method_vec
->quick_push (NULL_TREE
);
1006 method_vec
->quick_push (NULL_TREE
);
1007 CLASSTYPE_METHOD_VEC (type
) = method_vec
;
1010 /* Maintain TYPE_HAS_USER_CONSTRUCTOR, etc. */
1011 grok_special_member_properties (method
);
1013 /* Constructors and destructors go in special slots. */
1014 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (method
))
1015 slot
= CLASSTYPE_CONSTRUCTOR_SLOT
;
1016 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method
))
1018 slot
= CLASSTYPE_DESTRUCTOR_SLOT
;
1020 if (TYPE_FOR_JAVA (type
))
1022 if (!DECL_ARTIFICIAL (method
))
1023 error ("Java class %qT cannot have a destructor", type
);
1024 else if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
1025 error ("Java class %qT cannot have an implicit non-trivial "
1035 /* See if we already have an entry with this name. */
1036 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
1037 vec_safe_iterate (method_vec
, slot
, &m
);
1040 m
= OVL_CURRENT (m
);
1041 if (template_conv_p
)
1043 if (TREE_CODE (m
) == TEMPLATE_DECL
1044 && DECL_TEMPLATE_CONV_FN_P (m
))
1048 if (conv_p
&& !DECL_CONV_FN_P (m
))
1050 if (DECL_NAME (m
) == DECL_NAME (method
))
1056 && !DECL_CONV_FN_P (m
)
1057 && DECL_NAME (m
) > DECL_NAME (method
))
1061 current_fns
= insert_p
? NULL_TREE
: (*method_vec
)[slot
];
1063 /* Check to see if we've already got this method. */
1064 for (fns
= current_fns
; fns
; fns
= OVL_NEXT (fns
))
1066 tree fn
= OVL_CURRENT (fns
);
1072 if (TREE_CODE (fn
) != TREE_CODE (method
))
1075 /* [over.load] Member function declarations with the
1076 same name and the same parameter types cannot be
1077 overloaded if any of them is a static member
1078 function declaration.
1080 [over.load] Member function declarations with the same name and
1081 the same parameter-type-list as well as member function template
1082 declarations with the same name, the same parameter-type-list, and
1083 the same template parameter lists cannot be overloaded if any of
1084 them, but not all, have a ref-qualifier.
1086 [namespace.udecl] When a using-declaration brings names
1087 from a base class into a derived class scope, member
1088 functions in the derived class override and/or hide member
1089 functions with the same name and parameter types in a base
1090 class (rather than conflicting). */
1091 fn_type
= TREE_TYPE (fn
);
1092 method_type
= TREE_TYPE (method
);
1093 parms1
= TYPE_ARG_TYPES (fn_type
);
1094 parms2
= TYPE_ARG_TYPES (method_type
);
1096 /* Compare the quals on the 'this' parm. Don't compare
1097 the whole types, as used functions are treated as
1098 coming from the using class in overload resolution. */
1099 if (! DECL_STATIC_FUNCTION_P (fn
)
1100 && ! DECL_STATIC_FUNCTION_P (method
)
1101 /* Either both or neither need to be ref-qualified for
1102 differing quals to allow overloading. */
1103 && (FUNCTION_REF_QUALIFIED (fn_type
)
1104 == FUNCTION_REF_QUALIFIED (method_type
))
1105 && (type_memfn_quals (fn_type
) != type_memfn_quals (method_type
)
1106 || type_memfn_rqual (fn_type
) != type_memfn_rqual (method_type
)))
1109 /* For templates, the return type and template parameters
1110 must be identical. */
1111 if (TREE_CODE (fn
) == TEMPLATE_DECL
1112 && (!same_type_p (TREE_TYPE (fn_type
),
1113 TREE_TYPE (method_type
))
1114 || !comp_template_parms (DECL_TEMPLATE_PARMS (fn
),
1115 DECL_TEMPLATE_PARMS (method
))))
1118 if (! DECL_STATIC_FUNCTION_P (fn
))
1119 parms1
= TREE_CHAIN (parms1
);
1120 if (! DECL_STATIC_FUNCTION_P (method
))
1121 parms2
= TREE_CHAIN (parms2
);
1123 if (compparms (parms1
, parms2
)
1124 && (!DECL_CONV_FN_P (fn
)
1125 || same_type_p (TREE_TYPE (fn_type
),
1126 TREE_TYPE (method_type
))))
1128 /* For function versions, their parms and types match
1129 but they are not duplicates. Record function versions
1130 as and when they are found. extern "C" functions are
1131 not treated as versions. */
1132 if (TREE_CODE (fn
) == FUNCTION_DECL
1133 && TREE_CODE (method
) == FUNCTION_DECL
1134 && !DECL_EXTERN_C_P (fn
)
1135 && !DECL_EXTERN_C_P (method
)
1136 && targetm
.target_option
.function_versions (fn
, method
))
1138 /* Mark functions as versions if necessary. Modify the mangled
1139 decl name if necessary. */
1140 if (!DECL_FUNCTION_VERSIONED (fn
))
1142 DECL_FUNCTION_VERSIONED (fn
) = 1;
1143 if (DECL_ASSEMBLER_NAME_SET_P (fn
))
1146 if (!DECL_FUNCTION_VERSIONED (method
))
1148 DECL_FUNCTION_VERSIONED (method
) = 1;
1149 if (DECL_ASSEMBLER_NAME_SET_P (method
))
1150 mangle_decl (method
);
1152 record_function_versions (fn
, method
);
1155 if (DECL_INHERITED_CTOR_BASE (method
))
1157 if (DECL_INHERITED_CTOR_BASE (fn
))
1159 error_at (DECL_SOURCE_LOCATION (method
),
1160 "%q#D inherited from %qT", method
,
1161 DECL_INHERITED_CTOR_BASE (method
));
1162 error_at (DECL_SOURCE_LOCATION (fn
),
1163 "conflicts with version inherited from %qT",
1164 DECL_INHERITED_CTOR_BASE (fn
));
1166 /* Otherwise defer to the other function. */
1171 if (DECL_CONTEXT (fn
) == type
)
1172 /* Defer to the local function. */
1177 error ("%q+#D cannot be overloaded", method
);
1178 error ("with %q+#D", fn
);
1181 /* We don't call duplicate_decls here to merge the
1182 declarations because that will confuse things if the
1183 methods have inline definitions. In particular, we
1184 will crash while processing the definitions. */
1189 /* A class should never have more than one destructor. */
1190 if (current_fns
&& DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method
))
1193 /* Add the new binding. */
1196 overload
= ovl_cons (method
, current_fns
);
1197 OVL_USED (overload
) = true;
1200 overload
= build_overload (method
, current_fns
);
1203 TYPE_HAS_CONVERSION (type
) = 1;
1204 else if (slot
>= CLASSTYPE_FIRST_CONVERSION_SLOT
&& !complete_p
)
1205 push_class_level_binding (DECL_NAME (method
), overload
);
1211 /* We only expect to add few methods in the COMPLETE_P case, so
1212 just make room for one more method in that case. */
1214 reallocated
= vec_safe_reserve_exact (method_vec
, 1);
1216 reallocated
= vec_safe_reserve (method_vec
, 1);
1218 CLASSTYPE_METHOD_VEC (type
) = method_vec
;
1219 if (slot
== method_vec
->length ())
1220 method_vec
->quick_push (overload
);
1222 method_vec
->quick_insert (slot
, overload
);
1225 /* Replace the current slot. */
1226 (*method_vec
)[slot
] = overload
;
1230 /* Subroutines of finish_struct. */
1232 /* Change the access of FDECL to ACCESS in T. Return 1 if change was
1233 legit, otherwise return 0. */
1236 alter_access (tree t
, tree fdecl
, tree access
)
1240 if (!DECL_LANG_SPECIFIC (fdecl
))
1241 retrofit_lang_decl (fdecl
);
1243 gcc_assert (!DECL_DISCRIMINATOR_P (fdecl
));
1245 elem
= purpose_member (t
, DECL_ACCESS (fdecl
));
1248 if (TREE_VALUE (elem
) != access
)
1250 if (TREE_CODE (TREE_TYPE (fdecl
)) == FUNCTION_DECL
)
1251 error ("conflicting access specifications for method"
1252 " %q+D, ignored", TREE_TYPE (fdecl
));
1254 error ("conflicting access specifications for field %qE, ignored",
1259 /* They're changing the access to the same thing they changed
1260 it to before. That's OK. */
1266 perform_or_defer_access_check (TYPE_BINFO (t
), fdecl
, fdecl
,
1267 tf_warning_or_error
);
1268 DECL_ACCESS (fdecl
) = tree_cons (t
, access
, DECL_ACCESS (fdecl
));
1274 /* Process the USING_DECL, which is a member of T. */
1277 handle_using_decl (tree using_decl
, tree t
)
1279 tree decl
= USING_DECL_DECLS (using_decl
);
1280 tree name
= DECL_NAME (using_decl
);
1282 = TREE_PRIVATE (using_decl
) ? access_private_node
1283 : TREE_PROTECTED (using_decl
) ? access_protected_node
1284 : access_public_node
;
1285 tree flist
= NULL_TREE
;
1288 gcc_assert (!processing_template_decl
&& decl
);
1290 old_value
= lookup_member (t
, name
, /*protect=*/0, /*want_type=*/false,
1291 tf_warning_or_error
);
1294 if (is_overloaded_fn (old_value
))
1295 old_value
= OVL_CURRENT (old_value
);
1297 if (DECL_P (old_value
) && DECL_CONTEXT (old_value
) == t
)
1300 old_value
= NULL_TREE
;
1303 cp_emit_debug_info_for_using (decl
, USING_DECL_SCOPE (using_decl
));
1305 if (is_overloaded_fn (decl
))
1310 else if (is_overloaded_fn (old_value
))
1313 /* It's OK to use functions from a base when there are functions with
1314 the same name already present in the current class. */;
1317 error ("%q+D invalid in %q#T", using_decl
, t
);
1318 error (" because of local method %q+#D with same name",
1319 OVL_CURRENT (old_value
));
1323 else if (!DECL_ARTIFICIAL (old_value
))
1325 error ("%q+D invalid in %q#T", using_decl
, t
);
1326 error (" because of local member %q+#D with same name", old_value
);
1330 /* Make type T see field decl FDECL with access ACCESS. */
1332 for (; flist
; flist
= OVL_NEXT (flist
))
1334 add_method (t
, OVL_CURRENT (flist
), using_decl
);
1335 alter_access (t
, OVL_CURRENT (flist
), access
);
1338 alter_access (t
, decl
, access
);
1341 /* walk_tree callback for check_abi_tags: if the type at *TP involves any
1342 types with abi tags, add the corresponding identifiers to the VEC in
1343 *DATA and set IDENTIFIER_MARKED. */
1349 // error_mark_node to get diagnostics; otherwise collect missing tags here
1354 find_abi_tags_r (tree
*tp
, int *walk_subtrees
, void *data
)
1356 if (!OVERLOAD_TYPE_P (*tp
))
1359 /* walk_tree shouldn't be walking into any subtrees of a RECORD_TYPE
1360 anyway, but let's make sure of it. */
1361 *walk_subtrees
= false;
1363 if (tree attributes
= lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (*tp
)))
1365 struct abi_tag_data
*p
= static_cast<struct abi_tag_data
*>(data
);
1366 for (tree list
= TREE_VALUE (attributes
); list
;
1367 list
= TREE_CHAIN (list
))
1369 tree tag
= TREE_VALUE (list
);
1370 tree id
= get_identifier (TREE_STRING_POINTER (tag
));
1371 if (!IDENTIFIER_MARKED (id
))
1373 if (p
->tags
!= error_mark_node
)
1375 /* We're collecting tags from template arguments. */
1376 tree str
= build_string (IDENTIFIER_LENGTH (id
),
1377 IDENTIFIER_POINTER (id
));
1378 p
->tags
= tree_cons (NULL_TREE
, str
, p
->tags
);
1379 ABI_TAG_IMPLICIT (p
->tags
) = true;
1381 /* Don't inherit this tag multiple times. */
1382 IDENTIFIER_MARKED (id
) = true;
1385 /* Otherwise we're diagnosing missing tags. */
1386 else if (TYPE_P (p
->subob
))
1388 if (warning (OPT_Wabi_tag
, "%qT does not have the %E abi tag "
1389 "that base %qT has", p
->t
, tag
, p
->subob
))
1390 inform (location_of (p
->subob
), "%qT declared here",
1395 if (warning (OPT_Wabi_tag
, "%qT does not have the %E abi tag "
1396 "that %qT (used in the type of %qD) has",
1397 p
->t
, tag
, *tp
, p
->subob
))
1399 inform (location_of (p
->subob
), "%qD declared here",
1401 inform (location_of (*tp
), "%qT declared here", *tp
);
1410 /* Set IDENTIFIER_MARKED on all the ABI tags on T and its (transitively
1411 complete) template arguments. */
1414 mark_type_abi_tags (tree t
, bool val
)
1416 tree attributes
= lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (t
));
1419 for (tree list
= TREE_VALUE (attributes
); list
;
1420 list
= TREE_CHAIN (list
))
1422 tree tag
= TREE_VALUE (list
);
1423 tree id
= get_identifier (TREE_STRING_POINTER (tag
));
1424 IDENTIFIER_MARKED (id
) = val
;
1429 /* Check that class T has all the abi tags that subobject SUBOB has, or
1433 check_abi_tags (tree t
, tree subob
)
1435 mark_type_abi_tags (t
, true);
1437 tree subtype
= TYPE_P (subob
) ? subob
: TREE_TYPE (subob
);
1438 struct abi_tag_data data
= { t
, subob
, error_mark_node
};
1440 cp_walk_tree_without_duplicates (&subtype
, find_abi_tags_r
, &data
);
1442 mark_type_abi_tags (t
, false);
1446 inherit_targ_abi_tags (tree t
)
1448 if (CLASSTYPE_TEMPLATE_INFO (t
) == NULL_TREE
)
1451 mark_type_abi_tags (t
, true);
1453 tree args
= CLASSTYPE_TI_ARGS (t
);
1454 struct abi_tag_data data
= { t
, NULL_TREE
, NULL_TREE
};
1455 for (int i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
1457 tree level
= TMPL_ARGS_LEVEL (args
, i
+1);
1458 for (int j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
1460 tree arg
= TREE_VEC_ELT (level
, j
);
1462 cp_walk_tree_without_duplicates (&arg
, find_abi_tags_r
, &data
);
1466 // If we found some tags on our template arguments, add them to our
1467 // abi_tag attribute.
1470 tree attr
= lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (t
));
1472 TREE_VALUE (attr
) = chainon (data
.tags
, TREE_VALUE (attr
));
1475 = tree_cons (get_identifier ("abi_tag"), data
.tags
,
1476 TYPE_ATTRIBUTES (t
));
1479 mark_type_abi_tags (t
, false);
1482 /* Return true, iff class T has a non-virtual destructor that is
1483 accessible from outside the class heirarchy (i.e. is public, or
1484 there's a suitable friend. */
1487 accessible_nvdtor_p (tree t
)
1489 tree dtor
= CLASSTYPE_DESTRUCTORS (t
);
1491 /* An implicitly declared destructor is always public. And,
1492 if it were virtual, we would have created it by now. */
1496 if (DECL_VINDEX (dtor
))
1497 return false; /* Virtual */
1499 if (!TREE_PRIVATE (dtor
) && !TREE_PROTECTED (dtor
))
1500 return true; /* Public */
1502 if (CLASSTYPE_FRIEND_CLASSES (t
)
1503 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t
)))
1504 return true; /* Has friends */
1509 /* Run through the base classes of T, updating CANT_HAVE_CONST_CTOR_P,
1510 and NO_CONST_ASN_REF_P. Also set flag bits in T based on
1511 properties of the bases. */
1514 check_bases (tree t
,
1515 int* cant_have_const_ctor_p
,
1516 int* no_const_asn_ref_p
)
1519 bool seen_non_virtual_nearly_empty_base_p
= 0;
1520 int seen_tm_mask
= 0;
1523 tree field
= NULL_TREE
;
1525 if (!CLASSTYPE_NON_STD_LAYOUT (t
))
1526 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
1527 if (TREE_CODE (field
) == FIELD_DECL
)
1530 for (binfo
= TYPE_BINFO (t
), i
= 0;
1531 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
1533 tree basetype
= TREE_TYPE (base_binfo
);
1535 gcc_assert (COMPLETE_TYPE_P (basetype
));
1537 if (CLASSTYPE_FINAL (basetype
))
1538 error ("cannot derive from %<final%> base %qT in derived type %qT",
1541 /* If any base class is non-literal, so is the derived class. */
1542 if (!CLASSTYPE_LITERAL_P (basetype
))
1543 CLASSTYPE_LITERAL_P (t
) = false;
1545 /* If the base class doesn't have copy constructors or
1546 assignment operators that take const references, then the
1547 derived class cannot have such a member automatically
1549 if (TYPE_HAS_COPY_CTOR (basetype
)
1550 && ! TYPE_HAS_CONST_COPY_CTOR (basetype
))
1551 *cant_have_const_ctor_p
= 1;
1552 if (TYPE_HAS_COPY_ASSIGN (basetype
)
1553 && !TYPE_HAS_CONST_COPY_ASSIGN (basetype
))
1554 *no_const_asn_ref_p
= 1;
1556 if (BINFO_VIRTUAL_P (base_binfo
))
1557 /* A virtual base does not effect nearly emptiness. */
1559 else if (CLASSTYPE_NEARLY_EMPTY_P (basetype
))
1561 if (seen_non_virtual_nearly_empty_base_p
)
1562 /* And if there is more than one nearly empty base, then the
1563 derived class is not nearly empty either. */
1564 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
1566 /* Remember we've seen one. */
1567 seen_non_virtual_nearly_empty_base_p
= 1;
1569 else if (!is_empty_class (basetype
))
1570 /* If the base class is not empty or nearly empty, then this
1571 class cannot be nearly empty. */
1572 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
1574 /* A lot of properties from the bases also apply to the derived
1576 TYPE_NEEDS_CONSTRUCTING (t
) |= TYPE_NEEDS_CONSTRUCTING (basetype
);
1577 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
1578 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (basetype
);
1579 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
)
1580 |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (basetype
)
1581 || !TYPE_HAS_COPY_ASSIGN (basetype
));
1582 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= (TYPE_HAS_COMPLEX_COPY_CTOR (basetype
)
1583 || !TYPE_HAS_COPY_CTOR (basetype
));
1584 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
)
1585 |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (basetype
);
1586 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_HAS_COMPLEX_MOVE_CTOR (basetype
);
1587 TYPE_POLYMORPHIC_P (t
) |= TYPE_POLYMORPHIC_P (basetype
);
1588 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
)
1589 |= CLASSTYPE_CONTAINS_EMPTY_CLASS_P (basetype
);
1590 TYPE_HAS_COMPLEX_DFLT (t
) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
1591 || TYPE_HAS_COMPLEX_DFLT (basetype
));
1592 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT
1593 (t
, CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
)
1594 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (basetype
));
1595 SET_CLASSTYPE_REF_FIELDS_NEED_INIT
1596 (t
, CLASSTYPE_REF_FIELDS_NEED_INIT (t
)
1597 | CLASSTYPE_REF_FIELDS_NEED_INIT (basetype
));
1599 /* A standard-layout class is a class that:
1601 * has no non-standard-layout base classes, */
1602 CLASSTYPE_NON_STD_LAYOUT (t
) |= CLASSTYPE_NON_STD_LAYOUT (basetype
);
1603 if (!CLASSTYPE_NON_STD_LAYOUT (t
))
1606 /* ...has no base classes of the same type as the first non-static
1608 if (field
&& DECL_CONTEXT (field
) == t
1609 && (same_type_ignoring_top_level_qualifiers_p
1610 (TREE_TYPE (field
), basetype
)))
1611 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
1613 /* ...either has no non-static data members in the most-derived
1614 class and at most one base class with non-static data
1615 members, or has no base classes with non-static data
1617 for (basefield
= TYPE_FIELDS (basetype
); basefield
;
1618 basefield
= DECL_CHAIN (basefield
))
1619 if (TREE_CODE (basefield
) == FIELD_DECL
)
1622 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
1629 /* Don't bother collecting tm attributes if transactional memory
1630 support is not enabled. */
1633 tree tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (basetype
));
1635 seen_tm_mask
|= tm_attr_to_mask (tm_attr
);
1638 check_abi_tags (t
, basetype
);
1641 /* If one of the base classes had TM attributes, and the current class
1642 doesn't define its own, then the current class inherits one. */
1643 if (seen_tm_mask
&& !find_tm_attribute (TYPE_ATTRIBUTES (t
)))
1645 tree tm_attr
= tm_mask_to_attr (seen_tm_mask
& -seen_tm_mask
);
1646 TYPE_ATTRIBUTES (t
) = tree_cons (tm_attr
, NULL
, TYPE_ATTRIBUTES (t
));
1650 /* Determine all the primary bases within T. Sets BINFO_PRIMARY_BASE_P for
1651 those that are primaries. Sets BINFO_LOST_PRIMARY_P for those
1652 that have had a nearly-empty virtual primary base stolen by some
1653 other base in the hierarchy. Determines CLASSTYPE_PRIMARY_BASE for
1657 determine_primary_bases (tree t
)
1660 tree primary
= NULL_TREE
;
1661 tree type_binfo
= TYPE_BINFO (t
);
1664 /* Determine the primary bases of our bases. */
1665 for (base_binfo
= TREE_CHAIN (type_binfo
); base_binfo
;
1666 base_binfo
= TREE_CHAIN (base_binfo
))
1668 tree primary
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (base_binfo
));
1670 /* See if we're the non-virtual primary of our inheritance
1672 if (!BINFO_VIRTUAL_P (base_binfo
))
1674 tree parent
= BINFO_INHERITANCE_CHAIN (base_binfo
);
1675 tree parent_primary
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (parent
));
1678 && SAME_BINFO_TYPE_P (BINFO_TYPE (base_binfo
),
1679 BINFO_TYPE (parent_primary
)))
1680 /* We are the primary binfo. */
1681 BINFO_PRIMARY_P (base_binfo
) = 1;
1683 /* Determine if we have a virtual primary base, and mark it so.
1685 if (primary
&& BINFO_VIRTUAL_P (primary
))
1687 tree this_primary
= copied_binfo (primary
, base_binfo
);
1689 if (BINFO_PRIMARY_P (this_primary
))
1690 /* Someone already claimed this base. */
1691 BINFO_LOST_PRIMARY_P (base_binfo
) = 1;
1696 BINFO_PRIMARY_P (this_primary
) = 1;
1697 BINFO_INHERITANCE_CHAIN (this_primary
) = base_binfo
;
1699 /* A virtual binfo might have been copied from within
1700 another hierarchy. As we're about to use it as a
1701 primary base, make sure the offsets match. */
1702 delta
= size_diffop_loc (input_location
,
1704 BINFO_OFFSET (base_binfo
)),
1706 BINFO_OFFSET (this_primary
)));
1708 propagate_binfo_offsets (this_primary
, delta
);
1713 /* First look for a dynamic direct non-virtual base. */
1714 for (i
= 0; BINFO_BASE_ITERATE (type_binfo
, i
, base_binfo
); i
++)
1716 tree basetype
= BINFO_TYPE (base_binfo
);
1718 if (TYPE_CONTAINS_VPTR_P (basetype
) && !BINFO_VIRTUAL_P (base_binfo
))
1720 primary
= base_binfo
;
1725 /* A "nearly-empty" virtual base class can be the primary base
1726 class, if no non-virtual polymorphic base can be found. Look for
1727 a nearly-empty virtual dynamic base that is not already a primary
1728 base of something in the hierarchy. If there is no such base,
1729 just pick the first nearly-empty virtual base. */
1731 for (base_binfo
= TREE_CHAIN (type_binfo
); base_binfo
;
1732 base_binfo
= TREE_CHAIN (base_binfo
))
1733 if (BINFO_VIRTUAL_P (base_binfo
)
1734 && CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (base_binfo
)))
1736 if (!BINFO_PRIMARY_P (base_binfo
))
1738 /* Found one that is not primary. */
1739 primary
= base_binfo
;
1743 /* Remember the first candidate. */
1744 primary
= base_binfo
;
1748 /* If we've got a primary base, use it. */
1751 tree basetype
= BINFO_TYPE (primary
);
1753 CLASSTYPE_PRIMARY_BINFO (t
) = primary
;
1754 if (BINFO_PRIMARY_P (primary
))
1755 /* We are stealing a primary base. */
1756 BINFO_LOST_PRIMARY_P (BINFO_INHERITANCE_CHAIN (primary
)) = 1;
1757 BINFO_PRIMARY_P (primary
) = 1;
1758 if (BINFO_VIRTUAL_P (primary
))
1762 BINFO_INHERITANCE_CHAIN (primary
) = type_binfo
;
1763 /* A virtual binfo might have been copied from within
1764 another hierarchy. As we're about to use it as a primary
1765 base, make sure the offsets match. */
1766 delta
= size_diffop_loc (input_location
, ssize_int (0),
1767 convert (ssizetype
, BINFO_OFFSET (primary
)));
1769 propagate_binfo_offsets (primary
, delta
);
1772 primary
= TYPE_BINFO (basetype
);
1774 TYPE_VFIELD (t
) = TYPE_VFIELD (basetype
);
1775 BINFO_VTABLE (type_binfo
) = BINFO_VTABLE (primary
);
1776 BINFO_VIRTUALS (type_binfo
) = BINFO_VIRTUALS (primary
);
1780 /* Update the variant types of T. */
1783 fixup_type_variants (tree t
)
1790 for (variants
= TYPE_NEXT_VARIANT (t
);
1792 variants
= TYPE_NEXT_VARIANT (variants
))
1794 /* These fields are in the _TYPE part of the node, not in
1795 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1796 TYPE_HAS_USER_CONSTRUCTOR (variants
) = TYPE_HAS_USER_CONSTRUCTOR (t
);
1797 TYPE_NEEDS_CONSTRUCTING (variants
) = TYPE_NEEDS_CONSTRUCTING (t
);
1798 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (variants
)
1799 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
);
1801 TYPE_POLYMORPHIC_P (variants
) = TYPE_POLYMORPHIC_P (t
);
1803 TYPE_BINFO (variants
) = TYPE_BINFO (t
);
1805 /* Copy whatever these are holding today. */
1806 TYPE_VFIELD (variants
) = TYPE_VFIELD (t
);
1807 TYPE_METHODS (variants
) = TYPE_METHODS (t
);
1808 TYPE_FIELDS (variants
) = TYPE_FIELDS (t
);
1812 /* Early variant fixups: we apply attributes at the beginning of the class
1813 definition, and we need to fix up any variants that have already been
1814 made via elaborated-type-specifier so that check_qualified_type works. */
1817 fixup_attribute_variants (tree t
)
1824 for (variants
= TYPE_NEXT_VARIANT (t
);
1826 variants
= TYPE_NEXT_VARIANT (variants
))
1828 /* These are the two fields that check_qualified_type looks at and
1829 are affected by attributes. */
1830 TYPE_ATTRIBUTES (variants
) = TYPE_ATTRIBUTES (t
);
1831 TYPE_ALIGN (variants
) = TYPE_ALIGN (t
);
1835 /* Set memoizing fields and bits of T (and its variants) for later
1839 finish_struct_bits (tree t
)
1841 /* Fix up variants (if any). */
1842 fixup_type_variants (t
);
1844 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t
)) && TYPE_POLYMORPHIC_P (t
))
1845 /* For a class w/o baseclasses, 'finish_struct' has set
1846 CLASSTYPE_PURE_VIRTUALS correctly (by definition).
1847 Similarly for a class whose base classes do not have vtables.
1848 When neither of these is true, we might have removed abstract
1849 virtuals (by providing a definition), added some (by declaring
1850 new ones), or redeclared ones from a base class. We need to
1851 recalculate what's really an abstract virtual at this point (by
1852 looking in the vtables). */
1853 get_pure_virtuals (t
);
1855 /* If this type has a copy constructor or a destructor, force its
1856 mode to be BLKmode, and force its TREE_ADDRESSABLE bit to be
1857 nonzero. This will cause it to be passed by invisible reference
1858 and prevent it from being returned in a register. */
1859 if (type_has_nontrivial_copy_init (t
)
1860 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
1863 DECL_MODE (TYPE_MAIN_DECL (t
)) = BLKmode
;
1864 for (variants
= t
; variants
; variants
= TYPE_NEXT_VARIANT (variants
))
1866 SET_TYPE_MODE (variants
, BLKmode
);
1867 TREE_ADDRESSABLE (variants
) = 1;
1872 /* Issue warnings about T having private constructors, but no friends,
1875 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
1876 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
1877 non-private static member functions. */
1880 maybe_warn_about_overly_private_class (tree t
)
1882 int has_member_fn
= 0;
1883 int has_nonprivate_method
= 0;
1886 if (!warn_ctor_dtor_privacy
1887 /* If the class has friends, those entities might create and
1888 access instances, so we should not warn. */
1889 || (CLASSTYPE_FRIEND_CLASSES (t
)
1890 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t
)))
1891 /* We will have warned when the template was declared; there's
1892 no need to warn on every instantiation. */
1893 || CLASSTYPE_TEMPLATE_INSTANTIATION (t
))
1894 /* There's no reason to even consider warning about this
1898 /* We only issue one warning, if more than one applies, because
1899 otherwise, on code like:
1902 // Oops - forgot `public:'
1908 we warn several times about essentially the same problem. */
1910 /* Check to see if all (non-constructor, non-destructor) member
1911 functions are private. (Since there are no friends or
1912 non-private statics, we can't ever call any of the private member
1914 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
1915 /* We're not interested in compiler-generated methods; they don't
1916 provide any way to call private members. */
1917 if (!DECL_ARTIFICIAL (fn
))
1919 if (!TREE_PRIVATE (fn
))
1921 if (DECL_STATIC_FUNCTION_P (fn
))
1922 /* A non-private static member function is just like a
1923 friend; it can create and invoke private member
1924 functions, and be accessed without a class
1928 has_nonprivate_method
= 1;
1929 /* Keep searching for a static member function. */
1931 else if (!DECL_CONSTRUCTOR_P (fn
) && !DECL_DESTRUCTOR_P (fn
))
1935 if (!has_nonprivate_method
&& has_member_fn
)
1937 /* There are no non-private methods, and there's at least one
1938 private member function that isn't a constructor or
1939 destructor. (If all the private members are
1940 constructors/destructors we want to use the code below that
1941 issues error messages specifically referring to
1942 constructors/destructors.) */
1944 tree binfo
= TYPE_BINFO (t
);
1946 for (i
= 0; i
!= BINFO_N_BASE_BINFOS (binfo
); i
++)
1947 if (BINFO_BASE_ACCESS (binfo
, i
) != access_private_node
)
1949 has_nonprivate_method
= 1;
1952 if (!has_nonprivate_method
)
1954 warning (OPT_Wctor_dtor_privacy
,
1955 "all member functions in class %qT are private", t
);
1960 /* Even if some of the member functions are non-private, the class
1961 won't be useful for much if all the constructors or destructors
1962 are private: such an object can never be created or destroyed. */
1963 fn
= CLASSTYPE_DESTRUCTORS (t
);
1964 if (fn
&& TREE_PRIVATE (fn
))
1966 warning (OPT_Wctor_dtor_privacy
,
1967 "%q#T only defines a private destructor and has no friends",
1972 /* Warn about classes that have private constructors and no friends. */
1973 if (TYPE_HAS_USER_CONSTRUCTOR (t
)
1974 /* Implicitly generated constructors are always public. */
1975 && (!CLASSTYPE_LAZY_DEFAULT_CTOR (t
)
1976 || !CLASSTYPE_LAZY_COPY_CTOR (t
)))
1978 int nonprivate_ctor
= 0;
1980 /* If a non-template class does not define a copy
1981 constructor, one is defined for it, enabling it to avoid
1982 this warning. For a template class, this does not
1983 happen, and so we would normally get a warning on:
1985 template <class T> class C { private: C(); };
1987 To avoid this asymmetry, we check TYPE_HAS_COPY_CTOR. All
1988 complete non-template or fully instantiated classes have this
1990 if (!TYPE_HAS_COPY_CTOR (t
))
1991 nonprivate_ctor
= 1;
1993 for (fn
= CLASSTYPE_CONSTRUCTORS (t
); fn
; fn
= OVL_NEXT (fn
))
1995 tree ctor
= OVL_CURRENT (fn
);
1996 /* Ideally, we wouldn't count copy constructors (or, in
1997 fact, any constructor that takes an argument of the
1998 class type as a parameter) because such things cannot
1999 be used to construct an instance of the class unless
2000 you already have one. But, for now at least, we're
2002 if (! TREE_PRIVATE (ctor
))
2004 nonprivate_ctor
= 1;
2009 if (nonprivate_ctor
== 0)
2011 warning (OPT_Wctor_dtor_privacy
,
2012 "%q#T only defines private constructors and has no friends",
2020 gt_pointer_operator new_value
;
2024 /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */
2027 method_name_cmp (const void* m1_p
, const void* m2_p
)
2029 const tree
*const m1
= (const tree
*) m1_p
;
2030 const tree
*const m2
= (const tree
*) m2_p
;
2032 if (*m1
== NULL_TREE
&& *m2
== NULL_TREE
)
2034 if (*m1
== NULL_TREE
)
2036 if (*m2
== NULL_TREE
)
2038 if (DECL_NAME (OVL_CURRENT (*m1
)) < DECL_NAME (OVL_CURRENT (*m2
)))
2043 /* This routine compares two fields like method_name_cmp but using the
2044 pointer operator in resort_field_decl_data. */
2047 resort_method_name_cmp (const void* m1_p
, const void* m2_p
)
2049 const tree
*const m1
= (const tree
*) m1_p
;
2050 const tree
*const m2
= (const tree
*) m2_p
;
2051 if (*m1
== NULL_TREE
&& *m2
== NULL_TREE
)
2053 if (*m1
== NULL_TREE
)
2055 if (*m2
== NULL_TREE
)
2058 tree d1
= DECL_NAME (OVL_CURRENT (*m1
));
2059 tree d2
= DECL_NAME (OVL_CURRENT (*m2
));
2060 resort_data
.new_value (&d1
, resort_data
.cookie
);
2061 resort_data
.new_value (&d2
, resort_data
.cookie
);
2068 /* Resort TYPE_METHOD_VEC because pointers have been reordered. */
2071 resort_type_method_vec (void* obj
,
2073 gt_pointer_operator new_value
,
2076 vec
<tree
, va_gc
> *method_vec
= (vec
<tree
, va_gc
> *) obj
;
2077 int len
= vec_safe_length (method_vec
);
2081 /* The type conversion ops have to live at the front of the vec, so we
2083 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2084 vec_safe_iterate (method_vec
, slot
, &fn
);
2086 if (!DECL_CONV_FN_P (OVL_CURRENT (fn
)))
2091 resort_data
.new_value
= new_value
;
2092 resort_data
.cookie
= cookie
;
2093 qsort (method_vec
->address () + slot
, len
- slot
, sizeof (tree
),
2094 resort_method_name_cmp
);
2098 /* Warn about duplicate methods in fn_fields.
2100 Sort methods that are not special (i.e., constructors, destructors,
2101 and type conversion operators) so that we can find them faster in
2105 finish_struct_methods (tree t
)
2108 vec
<tree
, va_gc
> *method_vec
;
2111 method_vec
= CLASSTYPE_METHOD_VEC (t
);
2115 len
= method_vec
->length ();
2117 /* Clear DECL_IN_AGGR_P for all functions. */
2118 for (fn_fields
= TYPE_METHODS (t
); fn_fields
;
2119 fn_fields
= DECL_CHAIN (fn_fields
))
2120 DECL_IN_AGGR_P (fn_fields
) = 0;
2122 /* Issue warnings about private constructors and such. If there are
2123 no methods, then some public defaults are generated. */
2124 maybe_warn_about_overly_private_class (t
);
2126 /* The type conversion ops have to live at the front of the vec, so we
2128 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2129 method_vec
->iterate (slot
, &fn_fields
);
2131 if (!DECL_CONV_FN_P (OVL_CURRENT (fn_fields
)))
2134 qsort (method_vec
->address () + slot
,
2135 len
-slot
, sizeof (tree
), method_name_cmp
);
2138 /* Make BINFO's vtable have N entries, including RTTI entries,
2139 vbase and vcall offsets, etc. Set its type and call the back end
2143 layout_vtable_decl (tree binfo
, int n
)
2148 atype
= build_array_of_n_type (vtable_entry_type
, n
);
2149 layout_type (atype
);
2151 /* We may have to grow the vtable. */
2152 vtable
= get_vtbl_decl_for_binfo (binfo
);
2153 if (!same_type_p (TREE_TYPE (vtable
), atype
))
2155 TREE_TYPE (vtable
) = atype
;
2156 DECL_SIZE (vtable
) = DECL_SIZE_UNIT (vtable
) = NULL_TREE
;
2157 layout_decl (vtable
, 0);
2161 /* True iff FNDECL and BASE_FNDECL (both non-static member functions)
2162 have the same signature. */
2165 same_signature_p (const_tree fndecl
, const_tree base_fndecl
)
2167 /* One destructor overrides another if they are the same kind of
2169 if (DECL_DESTRUCTOR_P (base_fndecl
) && DECL_DESTRUCTOR_P (fndecl
)
2170 && special_function_p (base_fndecl
) == special_function_p (fndecl
))
2172 /* But a non-destructor never overrides a destructor, nor vice
2173 versa, nor do different kinds of destructors override
2174 one-another. For example, a complete object destructor does not
2175 override a deleting destructor. */
2176 if (DECL_DESTRUCTOR_P (base_fndecl
) || DECL_DESTRUCTOR_P (fndecl
))
2179 if (DECL_NAME (fndecl
) == DECL_NAME (base_fndecl
)
2180 || (DECL_CONV_FN_P (fndecl
)
2181 && DECL_CONV_FN_P (base_fndecl
)
2182 && same_type_p (DECL_CONV_FN_TYPE (fndecl
),
2183 DECL_CONV_FN_TYPE (base_fndecl
))))
2185 tree fntype
= TREE_TYPE (fndecl
);
2186 tree base_fntype
= TREE_TYPE (base_fndecl
);
2187 if (type_memfn_quals (fntype
) == type_memfn_quals (base_fntype
)
2188 && type_memfn_rqual (fntype
) == type_memfn_rqual (base_fntype
)
2189 && compparms (FUNCTION_FIRST_USER_PARMTYPE (fndecl
),
2190 FUNCTION_FIRST_USER_PARMTYPE (base_fndecl
)))
2196 /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a
2200 base_derived_from (tree derived
, tree base
)
2204 for (probe
= base
; probe
; probe
= BINFO_INHERITANCE_CHAIN (probe
))
2206 if (probe
== derived
)
2208 else if (BINFO_VIRTUAL_P (probe
))
2209 /* If we meet a virtual base, we can't follow the inheritance
2210 any more. See if the complete type of DERIVED contains
2211 such a virtual base. */
2212 return (binfo_for_vbase (BINFO_TYPE (probe
), BINFO_TYPE (derived
))
2218 typedef struct find_final_overrider_data_s
{
2219 /* The function for which we are trying to find a final overrider. */
2221 /* The base class in which the function was declared. */
2222 tree declaring_base
;
2223 /* The candidate overriders. */
2225 /* Path to most derived. */
2227 } find_final_overrider_data
;
2229 /* Add the overrider along the current path to FFOD->CANDIDATES.
2230 Returns true if an overrider was found; false otherwise. */
2233 dfs_find_final_overrider_1 (tree binfo
,
2234 find_final_overrider_data
*ffod
,
2239 /* If BINFO is not the most derived type, try a more derived class.
2240 A definition there will overrider a definition here. */
2244 if (dfs_find_final_overrider_1
2245 (ffod
->path
[depth
], ffod
, depth
))
2249 method
= look_for_overrides_here (BINFO_TYPE (binfo
), ffod
->fn
);
2252 tree
*candidate
= &ffod
->candidates
;
2254 /* Remove any candidates overridden by this new function. */
2257 /* If *CANDIDATE overrides METHOD, then METHOD
2258 cannot override anything else on the list. */
2259 if (base_derived_from (TREE_VALUE (*candidate
), binfo
))
2261 /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */
2262 if (base_derived_from (binfo
, TREE_VALUE (*candidate
)))
2263 *candidate
= TREE_CHAIN (*candidate
);
2265 candidate
= &TREE_CHAIN (*candidate
);
2268 /* Add the new function. */
2269 ffod
->candidates
= tree_cons (method
, binfo
, ffod
->candidates
);
2276 /* Called from find_final_overrider via dfs_walk. */
2279 dfs_find_final_overrider_pre (tree binfo
, void *data
)
2281 find_final_overrider_data
*ffod
= (find_final_overrider_data
*) data
;
2283 if (binfo
== ffod
->declaring_base
)
2284 dfs_find_final_overrider_1 (binfo
, ffod
, ffod
->path
.length ());
2285 ffod
->path
.safe_push (binfo
);
2291 dfs_find_final_overrider_post (tree
/*binfo*/, void *data
)
2293 find_final_overrider_data
*ffod
= (find_final_overrider_data
*) data
;
2299 /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for
2300 FN and whose TREE_VALUE is the binfo for the base where the
2301 overriding occurs. BINFO (in the hierarchy dominated by the binfo
2302 DERIVED) is the base object in which FN is declared. */
2305 find_final_overrider (tree derived
, tree binfo
, tree fn
)
2307 find_final_overrider_data ffod
;
2309 /* Getting this right is a little tricky. This is valid:
2311 struct S { virtual void f (); };
2312 struct T { virtual void f (); };
2313 struct U : public S, public T { };
2315 even though calling `f' in `U' is ambiguous. But,
2317 struct R { virtual void f(); };
2318 struct S : virtual public R { virtual void f (); };
2319 struct T : virtual public R { virtual void f (); };
2320 struct U : public S, public T { };
2322 is not -- there's no way to decide whether to put `S::f' or
2323 `T::f' in the vtable for `R'.
2325 The solution is to look at all paths to BINFO. If we find
2326 different overriders along any two, then there is a problem. */
2327 if (DECL_THUNK_P (fn
))
2328 fn
= THUNK_TARGET (fn
);
2330 /* Determine the depth of the hierarchy. */
2332 ffod
.declaring_base
= binfo
;
2333 ffod
.candidates
= NULL_TREE
;
2334 ffod
.path
.create (30);
2336 dfs_walk_all (derived
, dfs_find_final_overrider_pre
,
2337 dfs_find_final_overrider_post
, &ffod
);
2339 ffod
.path
.release ();
2341 /* If there was no winner, issue an error message. */
2342 if (!ffod
.candidates
|| TREE_CHAIN (ffod
.candidates
))
2343 return error_mark_node
;
2345 return ffod
.candidates
;
2348 /* Return the index of the vcall offset for FN when TYPE is used as a
2352 get_vcall_index (tree fn
, tree type
)
2354 vec
<tree_pair_s
, va_gc
> *indices
= CLASSTYPE_VCALL_INDICES (type
);
2358 FOR_EACH_VEC_SAFE_ELT (indices
, ix
, p
)
2359 if ((DECL_DESTRUCTOR_P (fn
) && DECL_DESTRUCTOR_P (p
->purpose
))
2360 || same_signature_p (fn
, p
->purpose
))
2363 /* There should always be an appropriate index. */
2367 /* Update an entry in the vtable for BINFO, which is in the hierarchy
2368 dominated by T. FN is the old function; VIRTUALS points to the
2369 corresponding position in the new BINFO_VIRTUALS list. IX is the index
2370 of that entry in the list. */
2373 update_vtable_entry_for_fn (tree t
, tree binfo
, tree fn
, tree
* virtuals
,
2381 tree overrider_fn
, overrider_target
;
2382 tree target_fn
= DECL_THUNK_P (fn
) ? THUNK_TARGET (fn
) : fn
;
2383 tree over_return
, base_return
;
2386 /* Find the nearest primary base (possibly binfo itself) which defines
2387 this function; this is the class the caller will convert to when
2388 calling FN through BINFO. */
2389 for (b
= binfo
; ; b
= get_primary_binfo (b
))
2392 if (look_for_overrides_here (BINFO_TYPE (b
), target_fn
))
2395 /* The nearest definition is from a lost primary. */
2396 if (BINFO_LOST_PRIMARY_P (b
))
2401 /* Find the final overrider. */
2402 overrider
= find_final_overrider (TYPE_BINFO (t
), b
, target_fn
);
2403 if (overrider
== error_mark_node
)
2405 error ("no unique final overrider for %qD in %qT", target_fn
, t
);
2408 overrider_target
= overrider_fn
= TREE_PURPOSE (overrider
);
2410 /* Check for adjusting covariant return types. */
2411 over_return
= TREE_TYPE (TREE_TYPE (overrider_target
));
2412 base_return
= TREE_TYPE (TREE_TYPE (target_fn
));
2414 if (POINTER_TYPE_P (over_return
)
2415 && TREE_CODE (over_return
) == TREE_CODE (base_return
)
2416 && CLASS_TYPE_P (TREE_TYPE (over_return
))
2417 && CLASS_TYPE_P (TREE_TYPE (base_return
))
2418 /* If the overrider is invalid, don't even try. */
2419 && !DECL_INVALID_OVERRIDER_P (overrider_target
))
2421 /* If FN is a covariant thunk, we must figure out the adjustment
2422 to the final base FN was converting to. As OVERRIDER_TARGET might
2423 also be converting to the return type of FN, we have to
2424 combine the two conversions here. */
2425 tree fixed_offset
, virtual_offset
;
2427 over_return
= TREE_TYPE (over_return
);
2428 base_return
= TREE_TYPE (base_return
);
2430 if (DECL_THUNK_P (fn
))
2432 gcc_assert (DECL_RESULT_THUNK_P (fn
));
2433 fixed_offset
= ssize_int (THUNK_FIXED_OFFSET (fn
));
2434 virtual_offset
= THUNK_VIRTUAL_OFFSET (fn
);
2437 fixed_offset
= virtual_offset
= NULL_TREE
;
2440 /* Find the equivalent binfo within the return type of the
2441 overriding function. We will want the vbase offset from
2443 virtual_offset
= binfo_for_vbase (BINFO_TYPE (virtual_offset
),
2445 else if (!same_type_ignoring_top_level_qualifiers_p
2446 (over_return
, base_return
))
2448 /* There was no existing virtual thunk (which takes
2449 precedence). So find the binfo of the base function's
2450 return type within the overriding function's return type.
2451 We cannot call lookup base here, because we're inside a
2452 dfs_walk, and will therefore clobber the BINFO_MARKED
2453 flags. Fortunately we know the covariancy is valid (it
2454 has already been checked), so we can just iterate along
2455 the binfos, which have been chained in inheritance graph
2456 order. Of course it is lame that we have to repeat the
2457 search here anyway -- we should really be caching pieces
2458 of the vtable and avoiding this repeated work. */
2459 tree thunk_binfo
, base_binfo
;
2461 /* Find the base binfo within the overriding function's
2462 return type. We will always find a thunk_binfo, except
2463 when the covariancy is invalid (which we will have
2464 already diagnosed). */
2465 for (base_binfo
= TYPE_BINFO (base_return
),
2466 thunk_binfo
= TYPE_BINFO (over_return
);
2468 thunk_binfo
= TREE_CHAIN (thunk_binfo
))
2469 if (SAME_BINFO_TYPE_P (BINFO_TYPE (thunk_binfo
),
2470 BINFO_TYPE (base_binfo
)))
2473 /* See if virtual inheritance is involved. */
2474 for (virtual_offset
= thunk_binfo
;
2476 virtual_offset
= BINFO_INHERITANCE_CHAIN (virtual_offset
))
2477 if (BINFO_VIRTUAL_P (virtual_offset
))
2481 || (thunk_binfo
&& !BINFO_OFFSET_ZEROP (thunk_binfo
)))
2483 tree offset
= convert (ssizetype
, BINFO_OFFSET (thunk_binfo
));
2487 /* We convert via virtual base. Adjust the fixed
2488 offset to be from there. */
2490 size_diffop (offset
,
2492 BINFO_OFFSET (virtual_offset
)));
2495 /* There was an existing fixed offset, this must be
2496 from the base just converted to, and the base the
2497 FN was thunking to. */
2498 fixed_offset
= size_binop (PLUS_EXPR
, fixed_offset
, offset
);
2500 fixed_offset
= offset
;
2504 if (fixed_offset
|| virtual_offset
)
2505 /* Replace the overriding function with a covariant thunk. We
2506 will emit the overriding function in its own slot as
2508 overrider_fn
= make_thunk (overrider_target
, /*this_adjusting=*/0,
2509 fixed_offset
, virtual_offset
);
2512 gcc_assert (DECL_INVALID_OVERRIDER_P (overrider_target
) ||
2513 !DECL_THUNK_P (fn
));
2515 /* If we need a covariant thunk, then we may need to adjust first_defn.
2516 The ABI specifies that the thunks emitted with a function are
2517 determined by which bases the function overrides, so we need to be
2518 sure that we're using a thunk for some overridden base; even if we
2519 know that the necessary this adjustment is zero, there may not be an
2520 appropriate zero-this-adjusment thunk for us to use since thunks for
2521 overriding virtual bases always use the vcall offset.
2523 Furthermore, just choosing any base that overrides this function isn't
2524 quite right, as this slot won't be used for calls through a type that
2525 puts a covariant thunk here. Calling the function through such a type
2526 will use a different slot, and that slot is the one that determines
2527 the thunk emitted for that base.
2529 So, keep looking until we find the base that we're really overriding
2530 in this slot: the nearest primary base that doesn't use a covariant
2531 thunk in this slot. */
2532 if (overrider_target
!= overrider_fn
)
2534 if (BINFO_TYPE (b
) == DECL_CONTEXT (overrider_target
))
2535 /* We already know that the overrider needs a covariant thunk. */
2536 b
= get_primary_binfo (b
);
2537 for (; ; b
= get_primary_binfo (b
))
2539 tree main_binfo
= TYPE_BINFO (BINFO_TYPE (b
));
2540 tree bv
= chain_index (ix
, BINFO_VIRTUALS (main_binfo
));
2541 if (!DECL_THUNK_P (TREE_VALUE (bv
)))
2543 if (BINFO_LOST_PRIMARY_P (b
))
2549 /* Assume that we will produce a thunk that convert all the way to
2550 the final overrider, and not to an intermediate virtual base. */
2551 virtual_base
= NULL_TREE
;
2553 /* See if we can convert to an intermediate virtual base first, and then
2554 use the vcall offset located there to finish the conversion. */
2555 for (; b
; b
= BINFO_INHERITANCE_CHAIN (b
))
2557 /* If we find the final overrider, then we can stop
2559 if (SAME_BINFO_TYPE_P (BINFO_TYPE (b
),
2560 BINFO_TYPE (TREE_VALUE (overrider
))))
2563 /* If we find a virtual base, and we haven't yet found the
2564 overrider, then there is a virtual base between the
2565 declaring base (first_defn) and the final overrider. */
2566 if (BINFO_VIRTUAL_P (b
))
2573 /* Compute the constant adjustment to the `this' pointer. The
2574 `this' pointer, when this function is called, will point at BINFO
2575 (or one of its primary bases, which are at the same offset). */
2577 /* The `this' pointer needs to be adjusted from the declaration to
2578 the nearest virtual base. */
2579 delta
= size_diffop_loc (input_location
,
2580 convert (ssizetype
, BINFO_OFFSET (virtual_base
)),
2581 convert (ssizetype
, BINFO_OFFSET (first_defn
)));
2583 /* If the nearest definition is in a lost primary, we don't need an
2584 entry in our vtable. Except possibly in a constructor vtable,
2585 if we happen to get our primary back. In that case, the offset
2586 will be zero, as it will be a primary base. */
2587 delta
= size_zero_node
;
2589 /* The `this' pointer needs to be adjusted from pointing to
2590 BINFO to pointing at the base where the final overrider
2592 delta
= size_diffop_loc (input_location
,
2594 BINFO_OFFSET (TREE_VALUE (overrider
))),
2595 convert (ssizetype
, BINFO_OFFSET (binfo
)));
2597 modify_vtable_entry (t
, binfo
, overrider_fn
, delta
, virtuals
);
2600 BV_VCALL_INDEX (*virtuals
)
2601 = get_vcall_index (overrider_target
, BINFO_TYPE (virtual_base
));
2603 BV_VCALL_INDEX (*virtuals
) = NULL_TREE
;
2605 BV_LOST_PRIMARY (*virtuals
) = lost
;
2608 /* Called from modify_all_vtables via dfs_walk. */
2611 dfs_modify_vtables (tree binfo
, void* data
)
2613 tree t
= (tree
) data
;
2618 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
2619 /* A base without a vtable needs no modification, and its bases
2620 are uninteresting. */
2621 return dfs_skip_bases
;
2623 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
)
2624 && !CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
2625 /* Don't do the primary vtable, if it's new. */
2628 if (BINFO_PRIMARY_P (binfo
) && !BINFO_VIRTUAL_P (binfo
))
2629 /* There's no need to modify the vtable for a non-virtual primary
2630 base; we're not going to use that vtable anyhow. We do still
2631 need to do this for virtual primary bases, as they could become
2632 non-primary in a construction vtable. */
2635 make_new_vtable (t
, binfo
);
2637 /* Now, go through each of the virtual functions in the virtual
2638 function table for BINFO. Find the final overrider, and update
2639 the BINFO_VIRTUALS list appropriately. */
2640 for (ix
= 0, virtuals
= BINFO_VIRTUALS (binfo
),
2641 old_virtuals
= BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo
)));
2643 ix
++, virtuals
= TREE_CHAIN (virtuals
),
2644 old_virtuals
= TREE_CHAIN (old_virtuals
))
2645 update_vtable_entry_for_fn (t
,
2647 BV_FN (old_virtuals
),
2653 /* Update all of the primary and secondary vtables for T. Create new
2654 vtables as required, and initialize their RTTI information. Each
2655 of the functions in VIRTUALS is declared in T and may override a
2656 virtual function from a base class; find and modify the appropriate
2657 entries to point to the overriding functions. Returns a list, in
2658 declaration order, of the virtual functions that are declared in T,
2659 but do not appear in the primary base class vtable, and which
2660 should therefore be appended to the end of the vtable for T. */
2663 modify_all_vtables (tree t
, tree virtuals
)
2665 tree binfo
= TYPE_BINFO (t
);
2668 /* Mangle the vtable name before entering dfs_walk (c++/51884). */
2669 if (TYPE_CONTAINS_VPTR_P (t
))
2670 get_vtable_decl (t
, false);
2672 /* Update all of the vtables. */
2673 dfs_walk_once (binfo
, dfs_modify_vtables
, NULL
, t
);
2675 /* Add virtual functions not already in our primary vtable. These
2676 will be both those introduced by this class, and those overridden
2677 from secondary bases. It does not include virtuals merely
2678 inherited from secondary bases. */
2679 for (fnsp
= &virtuals
; *fnsp
; )
2681 tree fn
= TREE_VALUE (*fnsp
);
2683 if (!value_member (fn
, BINFO_VIRTUALS (binfo
))
2684 || DECL_VINDEX (fn
) == error_mark_node
)
2686 /* We don't need to adjust the `this' pointer when
2687 calling this function. */
2688 BV_DELTA (*fnsp
) = integer_zero_node
;
2689 BV_VCALL_INDEX (*fnsp
) = NULL_TREE
;
2691 /* This is a function not already in our vtable. Keep it. */
2692 fnsp
= &TREE_CHAIN (*fnsp
);
2695 /* We've already got an entry for this function. Skip it. */
2696 *fnsp
= TREE_CHAIN (*fnsp
);
2702 /* Get the base virtual function declarations in T that have the
2706 get_basefndecls (tree name
, tree t
)
2709 tree base_fndecls
= NULL_TREE
;
2710 int n_baseclasses
= BINFO_N_BASE_BINFOS (TYPE_BINFO (t
));
2713 /* Find virtual functions in T with the indicated NAME. */
2714 i
= lookup_fnfields_1 (t
, name
);
2716 for (methods
= (*CLASSTYPE_METHOD_VEC (t
))[i
];
2718 methods
= OVL_NEXT (methods
))
2720 tree method
= OVL_CURRENT (methods
);
2722 if (TREE_CODE (method
) == FUNCTION_DECL
2723 && DECL_VINDEX (method
))
2724 base_fndecls
= tree_cons (NULL_TREE
, method
, base_fndecls
);
2728 return base_fndecls
;
2730 for (i
= 0; i
< n_baseclasses
; i
++)
2732 tree basetype
= BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (t
), i
));
2733 base_fndecls
= chainon (get_basefndecls (name
, basetype
),
2737 return base_fndecls
;
2740 /* If this declaration supersedes the declaration of
2741 a method declared virtual in the base class, then
2742 mark this field as being virtual as well. */
2745 check_for_override (tree decl
, tree ctype
)
2747 bool overrides_found
= false;
2748 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2749 /* In [temp.mem] we have:
2751 A specialization of a member function template does not
2752 override a virtual function from a base class. */
2754 if ((DECL_DESTRUCTOR_P (decl
)
2755 || IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
))
2756 || DECL_CONV_FN_P (decl
))
2757 && look_for_overrides (ctype
, decl
)
2758 && !DECL_STATIC_FUNCTION_P (decl
))
2759 /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor
2760 the error_mark_node so that we know it is an overriding
2763 DECL_VINDEX (decl
) = decl
;
2764 overrides_found
= true;
2767 if (DECL_VIRTUAL_P (decl
))
2769 if (!DECL_VINDEX (decl
))
2770 DECL_VINDEX (decl
) = error_mark_node
;
2771 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
2772 if (DECL_DESTRUCTOR_P (decl
))
2773 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (ctype
) = true;
2775 else if (DECL_FINAL_P (decl
))
2776 error ("%q+#D marked final, but is not virtual", decl
);
2777 if (DECL_OVERRIDE_P (decl
) && !overrides_found
)
2778 error ("%q+#D marked override, but does not override", decl
);
2781 /* Warn about hidden virtual functions that are not overridden in t.
2782 We know that constructors and destructors don't apply. */
2785 warn_hidden (tree t
)
2787 vec
<tree
, va_gc
> *method_vec
= CLASSTYPE_METHOD_VEC (t
);
2791 /* We go through each separately named virtual function. */
2792 for (i
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2793 vec_safe_iterate (method_vec
, i
, &fns
);
2804 /* All functions in this slot in the CLASSTYPE_METHOD_VEC will
2805 have the same name. Figure out what name that is. */
2806 name
= DECL_NAME (OVL_CURRENT (fns
));
2807 /* There are no possibly hidden functions yet. */
2808 base_fndecls
= NULL_TREE
;
2809 /* Iterate through all of the base classes looking for possibly
2810 hidden functions. */
2811 for (binfo
= TYPE_BINFO (t
), j
= 0;
2812 BINFO_BASE_ITERATE (binfo
, j
, base_binfo
); j
++)
2814 tree basetype
= BINFO_TYPE (base_binfo
);
2815 base_fndecls
= chainon (get_basefndecls (name
, basetype
),
2819 /* If there are no functions to hide, continue. */
2823 /* Remove any overridden functions. */
2824 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
2826 fndecl
= OVL_CURRENT (fn
);
2827 if (DECL_VINDEX (fndecl
))
2829 tree
*prev
= &base_fndecls
;
2832 /* If the method from the base class has the same
2833 signature as the method from the derived class, it
2834 has been overridden. */
2835 if (same_signature_p (fndecl
, TREE_VALUE (*prev
)))
2836 *prev
= TREE_CHAIN (*prev
);
2838 prev
= &TREE_CHAIN (*prev
);
2842 /* Now give a warning for all base functions without overriders,
2843 as they are hidden. */
2844 while (base_fndecls
)
2846 /* Here we know it is a hider, and no overrider exists. */
2847 warning (OPT_Woverloaded_virtual
, "%q+D was hidden", TREE_VALUE (base_fndecls
));
2848 warning (OPT_Woverloaded_virtual
, " by %q+D", fns
);
2849 base_fndecls
= TREE_CHAIN (base_fndecls
);
2854 /* Recursive helper for finish_struct_anon. */
2857 finish_struct_anon_r (tree field
, bool complain
)
2859 bool is_union
= TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
;
2860 tree elt
= TYPE_FIELDS (TREE_TYPE (field
));
2861 for (; elt
; elt
= DECL_CHAIN (elt
))
2863 /* We're generally only interested in entities the user
2864 declared, but we also find nested classes by noticing
2865 the TYPE_DECL that we create implicitly. You're
2866 allowed to put one anonymous union inside another,
2867 though, so we explicitly tolerate that. We use
2868 TYPE_ANONYMOUS_P rather than ANON_AGGR_TYPE_P so that
2869 we also allow unnamed types used for defining fields. */
2870 if (DECL_ARTIFICIAL (elt
)
2871 && (!DECL_IMPLICIT_TYPEDEF_P (elt
)
2872 || TYPE_ANONYMOUS_P (TREE_TYPE (elt
))))
2875 if (TREE_CODE (elt
) != FIELD_DECL
)
2877 /* We already complained about static data members in
2878 finish_static_data_member_decl. */
2879 if (complain
&& TREE_CODE (elt
) != VAR_DECL
)
2882 permerror (input_location
,
2883 "%q+#D invalid; an anonymous union can "
2884 "only have non-static data members", elt
);
2886 permerror (input_location
,
2887 "%q+#D invalid; an anonymous struct can "
2888 "only have non-static data members", elt
);
2895 if (TREE_PRIVATE (elt
))
2898 permerror (input_location
,
2899 "private member %q+#D in anonymous union", elt
);
2901 permerror (input_location
,
2902 "private member %q+#D in anonymous struct", elt
);
2904 else if (TREE_PROTECTED (elt
))
2907 permerror (input_location
,
2908 "protected member %q+#D in anonymous union", elt
);
2910 permerror (input_location
,
2911 "protected member %q+#D in anonymous struct", elt
);
2915 TREE_PRIVATE (elt
) = TREE_PRIVATE (field
);
2916 TREE_PROTECTED (elt
) = TREE_PROTECTED (field
);
2918 /* Recurse into the anonymous aggregates to handle correctly
2919 access control (c++/24926):
2930 if (DECL_NAME (elt
) == NULL_TREE
2931 && ANON_AGGR_TYPE_P (TREE_TYPE (elt
)))
2932 finish_struct_anon_r (elt
, /*complain=*/false);
2936 /* Check for things that are invalid. There are probably plenty of other
2937 things we should check for also. */
2940 finish_struct_anon (tree t
)
2942 for (tree field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
2944 if (TREE_STATIC (field
))
2946 if (TREE_CODE (field
) != FIELD_DECL
)
2949 if (DECL_NAME (field
) == NULL_TREE
2950 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2951 finish_struct_anon_r (field
, /*complain=*/true);
2955 /* Add T to CLASSTYPE_DECL_LIST of current_class_type which
2956 will be used later during class template instantiation.
2957 When FRIEND_P is zero, T can be a static member data (VAR_DECL),
2958 a non-static member data (FIELD_DECL), a member function
2959 (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE),
2960 a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL)
2961 When FRIEND_P is nonzero, T is either a friend class
2962 (RECORD_TYPE, TEMPLATE_DECL) or a friend function
2963 (FUNCTION_DECL, TEMPLATE_DECL). */
2966 maybe_add_class_template_decl_list (tree type
, tree t
, int friend_p
)
2968 /* Save some memory by not creating TREE_LIST if TYPE is not template. */
2969 if (CLASSTYPE_TEMPLATE_INFO (type
))
2970 CLASSTYPE_DECL_LIST (type
)
2971 = tree_cons (friend_p
? NULL_TREE
: type
,
2972 t
, CLASSTYPE_DECL_LIST (type
));
2975 /* This function is called from declare_virt_assop_and_dtor via
2978 DATA is a type that direcly or indirectly inherits the base
2979 represented by BINFO. If BINFO contains a virtual assignment [copy
2980 assignment or move assigment] operator or a virtual constructor,
2981 declare that function in DATA if it hasn't been already declared. */
2984 dfs_declare_virt_assop_and_dtor (tree binfo
, void *data
)
2986 tree bv
, fn
, t
= (tree
)data
;
2987 tree opname
= ansi_assopname (NOP_EXPR
);
2989 gcc_assert (t
&& CLASS_TYPE_P (t
));
2990 gcc_assert (binfo
&& TREE_CODE (binfo
) == TREE_BINFO
);
2992 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
2993 /* A base without a vtable needs no modification, and its bases
2994 are uninteresting. */
2995 return dfs_skip_bases
;
2997 if (BINFO_PRIMARY_P (binfo
))
2998 /* If this is a primary base, then we have already looked at the
2999 virtual functions of its vtable. */
3002 for (bv
= BINFO_VIRTUALS (binfo
); bv
; bv
= TREE_CHAIN (bv
))
3006 if (DECL_NAME (fn
) == opname
)
3008 if (CLASSTYPE_LAZY_COPY_ASSIGN (t
))
3009 lazily_declare_fn (sfk_copy_assignment
, t
);
3010 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
3011 lazily_declare_fn (sfk_move_assignment
, t
);
3013 else if (DECL_DESTRUCTOR_P (fn
)
3014 && CLASSTYPE_LAZY_DESTRUCTOR (t
))
3015 lazily_declare_fn (sfk_destructor
, t
);
3021 /* If the class type T has a direct or indirect base that contains a
3022 virtual assignment operator or a virtual destructor, declare that
3023 function in T if it hasn't been already declared. */
3026 declare_virt_assop_and_dtor (tree t
)
3028 if (!(TYPE_POLYMORPHIC_P (t
)
3029 && (CLASSTYPE_LAZY_COPY_ASSIGN (t
)
3030 || CLASSTYPE_LAZY_MOVE_ASSIGN (t
)
3031 || CLASSTYPE_LAZY_DESTRUCTOR (t
))))
3034 dfs_walk_all (TYPE_BINFO (t
),
3035 dfs_declare_virt_assop_and_dtor
,
3039 /* Declare the inheriting constructor for class T inherited from base
3040 constructor CTOR with the parameter array PARMS of size NPARMS. */
3043 one_inheriting_sig (tree t
, tree ctor
, tree
*parms
, int nparms
)
3045 /* We don't declare an inheriting ctor that would be a default,
3046 copy or move ctor for derived or base. */
3050 && TREE_CODE (parms
[0]) == REFERENCE_TYPE
)
3052 tree parm
= TYPE_MAIN_VARIANT (TREE_TYPE (parms
[0]));
3053 if (parm
== t
|| parm
== DECL_CONTEXT (ctor
))
3057 tree parmlist
= void_list_node
;
3058 for (int i
= nparms
- 1; i
>= 0; i
--)
3059 parmlist
= tree_cons (NULL_TREE
, parms
[i
], parmlist
);
3060 tree fn
= implicitly_declare_fn (sfk_inheriting_constructor
,
3061 t
, false, ctor
, parmlist
);
3062 if (add_method (t
, fn
, NULL_TREE
))
3064 DECL_CHAIN (fn
) = TYPE_METHODS (t
);
3065 TYPE_METHODS (t
) = fn
;
3069 /* Declare all the inheriting constructors for class T inherited from base
3070 constructor CTOR. */
3073 one_inherited_ctor (tree ctor
, tree t
)
3075 tree parms
= FUNCTION_FIRST_USER_PARMTYPE (ctor
);
3077 tree
*new_parms
= XALLOCAVEC (tree
, list_length (parms
));
3079 for (; parms
&& parms
!= void_list_node
; parms
= TREE_CHAIN (parms
))
3081 if (TREE_PURPOSE (parms
))
3082 one_inheriting_sig (t
, ctor
, new_parms
, i
);
3083 new_parms
[i
++] = TREE_VALUE (parms
);
3085 one_inheriting_sig (t
, ctor
, new_parms
, i
);
3086 if (parms
== NULL_TREE
)
3088 if (warning (OPT_Winherited_variadic_ctor
,
3089 "the ellipsis in %qD is not inherited", ctor
))
3090 inform (DECL_SOURCE_LOCATION (ctor
), "%qD declared here", ctor
);
3094 /* Create default constructors, assignment operators, and so forth for
3095 the type indicated by T, if they are needed. CANT_HAVE_CONST_CTOR,
3096 and CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason,
3097 the class cannot have a default constructor, copy constructor
3098 taking a const reference argument, or an assignment operator taking
3099 a const reference, respectively. */
3102 add_implicitly_declared_members (tree t
, tree
* access_decls
,
3103 int cant_have_const_cctor
,
3104 int cant_have_const_assignment
)
3106 bool move_ok
= false;
3108 if (cxx_dialect
>= cxx11
&& !CLASSTYPE_DESTRUCTORS (t
)
3109 && !TYPE_HAS_COPY_CTOR (t
) && !TYPE_HAS_COPY_ASSIGN (t
)
3110 && !type_has_move_constructor (t
) && !type_has_move_assign (t
))
3114 if (!CLASSTYPE_DESTRUCTORS (t
))
3116 /* In general, we create destructors lazily. */
3117 CLASSTYPE_LAZY_DESTRUCTOR (t
) = 1;
3119 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3120 && TYPE_FOR_JAVA (t
))
3121 /* But if this is a Java class, any non-trivial destructor is
3122 invalid, even if compiler-generated. Therefore, if the
3123 destructor is non-trivial we create it now. */
3124 lazily_declare_fn (sfk_destructor
, t
);
3129 If there is no user-declared constructor for a class, a default
3130 constructor is implicitly declared. */
3131 if (! TYPE_HAS_USER_CONSTRUCTOR (t
))
3133 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 1;
3134 CLASSTYPE_LAZY_DEFAULT_CTOR (t
) = 1;
3135 if (cxx_dialect
>= cxx11
)
3136 TYPE_HAS_CONSTEXPR_CTOR (t
)
3137 /* This might force the declaration. */
3138 = type_has_constexpr_default_constructor (t
);
3143 If a class definition does not explicitly declare a copy
3144 constructor, one is declared implicitly. */
3145 if (! TYPE_HAS_COPY_CTOR (t
) && ! TYPE_FOR_JAVA (t
))
3147 TYPE_HAS_COPY_CTOR (t
) = 1;
3148 TYPE_HAS_CONST_COPY_CTOR (t
) = !cant_have_const_cctor
;
3149 CLASSTYPE_LAZY_COPY_CTOR (t
) = 1;
3151 CLASSTYPE_LAZY_MOVE_CTOR (t
) = 1;
3154 /* If there is no assignment operator, one will be created if and
3155 when it is needed. For now, just record whether or not the type
3156 of the parameter to the assignment operator will be a const or
3157 non-const reference. */
3158 if (!TYPE_HAS_COPY_ASSIGN (t
) && !TYPE_FOR_JAVA (t
))
3160 TYPE_HAS_COPY_ASSIGN (t
) = 1;
3161 TYPE_HAS_CONST_COPY_ASSIGN (t
) = !cant_have_const_assignment
;
3162 CLASSTYPE_LAZY_COPY_ASSIGN (t
) = 1;
3164 CLASSTYPE_LAZY_MOVE_ASSIGN (t
) = 1;
3167 /* We can't be lazy about declaring functions that might override
3168 a virtual function from a base class. */
3169 declare_virt_assop_and_dtor (t
);
3171 while (*access_decls
)
3173 tree using_decl
= TREE_VALUE (*access_decls
);
3174 tree decl
= USING_DECL_DECLS (using_decl
);
3175 if (DECL_NAME (using_decl
) == ctor_identifier
)
3177 /* declare, then remove the decl */
3178 tree ctor_list
= decl
;
3179 location_t loc
= input_location
;
3180 input_location
= DECL_SOURCE_LOCATION (using_decl
);
3182 for (; ctor_list
; ctor_list
= OVL_NEXT (ctor_list
))
3183 one_inherited_ctor (OVL_CURRENT (ctor_list
), t
);
3184 *access_decls
= TREE_CHAIN (*access_decls
);
3185 input_location
= loc
;
3188 access_decls
= &TREE_CHAIN (*access_decls
);
3192 /* Subroutine of insert_into_classtype_sorted_fields. Recursively
3193 count the number of fields in TYPE, including anonymous union
3197 count_fields (tree fields
)
3201 for (x
= fields
; x
; x
= DECL_CHAIN (x
))
3203 if (TREE_CODE (x
) == FIELD_DECL
&& ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
3204 n_fields
+= count_fields (TYPE_FIELDS (TREE_TYPE (x
)));
3211 /* Subroutine of insert_into_classtype_sorted_fields. Recursively add
3212 all the fields in the TREE_LIST FIELDS to the SORTED_FIELDS_TYPE
3213 elts, starting at offset IDX. */
3216 add_fields_to_record_type (tree fields
, struct sorted_fields_type
*field_vec
, int idx
)
3219 for (x
= fields
; x
; x
= DECL_CHAIN (x
))
3221 if (TREE_CODE (x
) == FIELD_DECL
&& ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
3222 idx
= add_fields_to_record_type (TYPE_FIELDS (TREE_TYPE (x
)), field_vec
, idx
);
3224 field_vec
->elts
[idx
++] = x
;
3229 /* Add all of the enum values of ENUMTYPE, to the FIELD_VEC elts,
3230 starting at offset IDX. */
3233 add_enum_fields_to_record_type (tree enumtype
,
3234 struct sorted_fields_type
*field_vec
,
3238 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
3239 field_vec
->elts
[idx
++] = TREE_VALUE (values
);
3243 /* FIELD is a bit-field. We are finishing the processing for its
3244 enclosing type. Issue any appropriate messages and set appropriate
3245 flags. Returns false if an error has been diagnosed. */
3248 check_bitfield_decl (tree field
)
3250 tree type
= TREE_TYPE (field
);
3253 /* Extract the declared width of the bitfield, which has been
3254 temporarily stashed in DECL_INITIAL. */
3255 w
= DECL_INITIAL (field
);
3256 gcc_assert (w
!= NULL_TREE
);
3257 /* Remove the bit-field width indicator so that the rest of the
3258 compiler does not treat that value as an initializer. */
3259 DECL_INITIAL (field
) = NULL_TREE
;
3261 /* Detect invalid bit-field type. */
3262 if (!INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
3264 error ("bit-field %q+#D with non-integral type", field
);
3265 w
= error_mark_node
;
3269 location_t loc
= input_location
;
3270 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
3273 /* detect invalid field size. */
3274 input_location
= DECL_SOURCE_LOCATION (field
);
3275 w
= cxx_constant_value (w
);
3276 input_location
= loc
;
3278 if (TREE_CODE (w
) != INTEGER_CST
)
3280 error ("bit-field %q+D width not an integer constant", field
);
3281 w
= error_mark_node
;
3283 else if (tree_int_cst_sgn (w
) < 0)
3285 error ("negative width in bit-field %q+D", field
);
3286 w
= error_mark_node
;
3288 else if (integer_zerop (w
) && DECL_NAME (field
) != 0)
3290 error ("zero width for bit-field %q+D", field
);
3291 w
= error_mark_node
;
3293 else if ((TREE_CODE (type
) != ENUMERAL_TYPE
3294 && TREE_CODE (type
) != BOOLEAN_TYPE
3295 && compare_tree_int (w
, TYPE_PRECISION (type
)) > 0)
3296 || ((TREE_CODE (type
) == ENUMERAL_TYPE
3297 || TREE_CODE (type
) == BOOLEAN_TYPE
)
3298 && tree_int_cst_lt (TYPE_SIZE (type
), w
)))
3299 warning (0, "width of %q+D exceeds its type", field
);
3300 else if (TREE_CODE (type
) == ENUMERAL_TYPE
3301 && (0 > (compare_tree_int
3302 (w
, TYPE_PRECISION (ENUM_UNDERLYING_TYPE (type
))))))
3303 warning (0, "%q+D is too small to hold all values of %q#T", field
, type
);
3306 if (w
!= error_mark_node
)
3308 DECL_SIZE (field
) = convert (bitsizetype
, w
);
3309 DECL_BIT_FIELD (field
) = 1;
3314 /* Non-bit-fields are aligned for their type. */
3315 DECL_BIT_FIELD (field
) = 0;
3316 CLEAR_DECL_C_BIT_FIELD (field
);
3321 /* FIELD is a non bit-field. We are finishing the processing for its
3322 enclosing type T. Issue any appropriate messages and set appropriate
3326 check_field_decl (tree field
,
3328 int* cant_have_const_ctor
,
3329 int* no_const_asn_ref
,
3330 int* any_default_members
)
3332 tree type
= strip_array_types (TREE_TYPE (field
));
3334 /* In C++98 an anonymous union cannot contain any fields which would change
3335 the settings of CANT_HAVE_CONST_CTOR and friends. */
3336 if (ANON_UNION_TYPE_P (type
) && cxx_dialect
< cxx11
)
3338 /* And, we don't set TYPE_HAS_CONST_COPY_CTOR, etc., for anonymous
3339 structs. So, we recurse through their fields here. */
3340 else if (ANON_AGGR_TYPE_P (type
))
3344 for (fields
= TYPE_FIELDS (type
); fields
; fields
= DECL_CHAIN (fields
))
3345 if (TREE_CODE (fields
) == FIELD_DECL
&& !DECL_C_BIT_FIELD (field
))
3346 check_field_decl (fields
, t
, cant_have_const_ctor
,
3347 no_const_asn_ref
, any_default_members
);
3349 /* Check members with class type for constructors, destructors,
3351 else if (CLASS_TYPE_P (type
))
3353 /* Never let anything with uninheritable virtuals
3354 make it through without complaint. */
3355 abstract_virtuals_error (field
, type
);
3357 if (TREE_CODE (t
) == UNION_TYPE
&& cxx_dialect
< cxx11
)
3360 int oldcount
= errorcount
;
3361 if (TYPE_NEEDS_CONSTRUCTING (type
))
3362 error ("member %q+#D with constructor not allowed in union",
3364 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
3365 error ("member %q+#D with destructor not allowed in union", field
);
3366 if (TYPE_HAS_COMPLEX_COPY_ASSIGN (type
))
3367 error ("member %q+#D with copy assignment operator not allowed in union",
3369 if (!warned
&& errorcount
> oldcount
)
3371 inform (DECL_SOURCE_LOCATION (field
), "unrestricted unions "
3372 "only available with -std=c++11 or -std=gnu++11");
3378 TYPE_NEEDS_CONSTRUCTING (t
) |= TYPE_NEEDS_CONSTRUCTING (type
);
3379 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3380 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
);
3381 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
)
3382 |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (type
)
3383 || !TYPE_HAS_COPY_ASSIGN (type
));
3384 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= (TYPE_HAS_COMPLEX_COPY_CTOR (type
)
3385 || !TYPE_HAS_COPY_CTOR (type
));
3386 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (type
);
3387 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_HAS_COMPLEX_MOVE_CTOR (type
);
3388 TYPE_HAS_COMPLEX_DFLT (t
) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (type
)
3389 || TYPE_HAS_COMPLEX_DFLT (type
));
3392 if (TYPE_HAS_COPY_CTOR (type
)
3393 && !TYPE_HAS_CONST_COPY_CTOR (type
))
3394 *cant_have_const_ctor
= 1;
3396 if (TYPE_HAS_COPY_ASSIGN (type
)
3397 && !TYPE_HAS_CONST_COPY_ASSIGN (type
))
3398 *no_const_asn_ref
= 1;
3401 check_abi_tags (t
, field
);
3403 if (DECL_INITIAL (field
) != NULL_TREE
)
3405 /* `build_class_init_list' does not recognize
3407 if (TREE_CODE (t
) == UNION_TYPE
&& *any_default_members
!= 0)
3408 error ("multiple fields in union %qT initialized", t
);
3409 *any_default_members
= 1;
3413 /* Check the data members (both static and non-static), class-scoped
3414 typedefs, etc., appearing in the declaration of T. Issue
3415 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
3416 declaration order) of access declarations; each TREE_VALUE in this
3417 list is a USING_DECL.
3419 In addition, set the following flags:
3422 The class is empty, i.e., contains no non-static data members.
3424 CANT_HAVE_CONST_CTOR_P
3425 This class cannot have an implicitly generated copy constructor
3426 taking a const reference.
3428 CANT_HAVE_CONST_ASN_REF
3429 This class cannot have an implicitly generated assignment
3430 operator taking a const reference.
3432 All of these flags should be initialized before calling this
3435 Returns a pointer to the end of the TYPE_FIELDs chain; additional
3436 fields can be added by adding to this chain. */
3439 check_field_decls (tree t
, tree
*access_decls
,
3440 int *cant_have_const_ctor_p
,
3441 int *no_const_asn_ref_p
)
3446 int any_default_members
;
3448 int field_access
= -1;
3450 /* Assume there are no access declarations. */
3451 *access_decls
= NULL_TREE
;
3452 /* Assume this class has no pointer members. */
3453 has_pointers
= false;
3454 /* Assume none of the members of this class have default
3456 any_default_members
= 0;
3458 for (field
= &TYPE_FIELDS (t
); *field
; field
= next
)
3461 tree type
= TREE_TYPE (x
);
3462 int this_field_access
;
3464 next
= &DECL_CHAIN (x
);
3466 if (TREE_CODE (x
) == USING_DECL
)
3468 /* Save the access declarations for our caller. */
3469 *access_decls
= tree_cons (NULL_TREE
, x
, *access_decls
);
3473 if (TREE_CODE (x
) == TYPE_DECL
3474 || TREE_CODE (x
) == TEMPLATE_DECL
)
3477 /* If we've gotten this far, it's a data member, possibly static,
3478 or an enumerator. */
3479 if (TREE_CODE (x
) != CONST_DECL
)
3480 DECL_CONTEXT (x
) = t
;
3482 /* When this goes into scope, it will be a non-local reference. */
3483 DECL_NONLOCAL (x
) = 1;
3485 if (TREE_CODE (t
) == UNION_TYPE
)
3489 If a union contains a static data member, or a member of
3490 reference type, the program is ill-formed. */
3493 error ("%q+D may not be static because it is a member of a union", x
);
3496 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3498 error ("%q+D may not have reference type %qT because"
3499 " it is a member of a union",
3505 /* Perform error checking that did not get done in
3507 if (TREE_CODE (type
) == FUNCTION_TYPE
)
3509 error ("field %q+D invalidly declared function type", x
);
3510 type
= build_pointer_type (type
);
3511 TREE_TYPE (x
) = type
;
3513 else if (TREE_CODE (type
) == METHOD_TYPE
)
3515 error ("field %q+D invalidly declared method type", x
);
3516 type
= build_pointer_type (type
);
3517 TREE_TYPE (x
) = type
;
3520 if (type
== error_mark_node
)
3523 if (TREE_CODE (x
) == CONST_DECL
|| VAR_P (x
))
3526 /* Now it can only be a FIELD_DECL. */
3528 if (TREE_PRIVATE (x
) || TREE_PROTECTED (x
))
3529 CLASSTYPE_NON_AGGREGATE (t
) = 1;
3531 /* If at least one non-static data member is non-literal, the whole
3532 class becomes non-literal. Note: if the type is incomplete we
3533 will complain later on. */
3534 if (COMPLETE_TYPE_P (type
) && !literal_type_p (type
))
3535 CLASSTYPE_LITERAL_P (t
) = false;
3537 /* A standard-layout class is a class that:
3539 has the same access control (Clause 11) for all non-static data members,
3541 this_field_access
= TREE_PROTECTED (x
) ? 1 : TREE_PRIVATE (x
) ? 2 : 0;
3542 if (field_access
== -1)
3543 field_access
= this_field_access
;
3544 else if (this_field_access
!= field_access
)
3545 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3547 /* If this is of reference type, check if it needs an init. */
3548 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3550 CLASSTYPE_NON_LAYOUT_POD_P (t
) = 1;
3551 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3552 if (DECL_INITIAL (x
) == NULL_TREE
)
3553 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t
, 1);
3555 /* ARM $12.6.2: [A member initializer list] (or, for an
3556 aggregate, initialization by a brace-enclosed list) is the
3557 only way to initialize nonstatic const and reference
3559 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
3560 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) = 1;
3563 type
= strip_array_types (type
);
3565 if (TYPE_PACKED (t
))
3567 if (!layout_pod_type_p (type
) && !TYPE_PACKED (type
))
3571 "ignoring packed attribute because of unpacked non-POD field %q+#D",
3575 else if (DECL_C_BIT_FIELD (x
)
3576 || TYPE_ALIGN (TREE_TYPE (x
)) > BITS_PER_UNIT
)
3577 DECL_PACKED (x
) = 1;
3580 if (DECL_C_BIT_FIELD (x
) && integer_zerop (DECL_INITIAL (x
)))
3581 /* We don't treat zero-width bitfields as making a class
3586 /* The class is non-empty. */
3587 CLASSTYPE_EMPTY_P (t
) = 0;
3588 /* The class is not even nearly empty. */
3589 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
3590 /* If one of the data members contains an empty class,
3592 if (CLASS_TYPE_P (type
)
3593 && CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type
))
3594 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 1;
3597 /* This is used by -Weffc++ (see below). Warn only for pointers
3598 to members which might hold dynamic memory. So do not warn
3599 for pointers to functions or pointers to members. */
3600 if (TYPE_PTR_P (type
)
3601 && !TYPE_PTRFN_P (type
))
3602 has_pointers
= true;
3604 if (CLASS_TYPE_P (type
))
3606 if (CLASSTYPE_REF_FIELDS_NEED_INIT (type
))
3607 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t
, 1);
3608 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (type
))
3609 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
, 1);
3612 if (DECL_MUTABLE_P (x
) || TYPE_HAS_MUTABLE_P (type
))
3613 CLASSTYPE_HAS_MUTABLE (t
) = 1;
3615 if (DECL_MUTABLE_P (x
))
3617 if (CP_TYPE_CONST_P (type
))
3619 error ("member %q+D cannot be declared both %<const%> "
3620 "and %<mutable%>", x
);
3623 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3625 error ("member %q+D cannot be declared as a %<mutable%> "
3631 if (! layout_pod_type_p (type
))
3632 /* DR 148 now allows pointers to members (which are POD themselves),
3633 to be allowed in POD structs. */
3634 CLASSTYPE_NON_LAYOUT_POD_P (t
) = 1;
3636 if (!std_layout_type_p (type
))
3637 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3639 if (! zero_init_p (type
))
3640 CLASSTYPE_NON_ZERO_INIT_P (t
) = 1;
3642 /* We set DECL_C_BIT_FIELD in grokbitfield.
3643 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
3644 if (! DECL_C_BIT_FIELD (x
) || ! check_bitfield_decl (x
))
3645 check_field_decl (x
, t
,
3646 cant_have_const_ctor_p
,
3648 &any_default_members
);
3650 /* Now that we've removed bit-field widths from DECL_INITIAL,
3651 anything left in DECL_INITIAL is an NSDMI that makes the class
3653 if (DECL_INITIAL (x
))
3654 CLASSTYPE_NON_AGGREGATE (t
) = true;
3656 /* If any field is const, the structure type is pseudo-const. */
3657 if (CP_TYPE_CONST_P (type
))
3659 C_TYPE_FIELDS_READONLY (t
) = 1;
3660 if (DECL_INITIAL (x
) == NULL_TREE
)
3661 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
, 1);
3663 /* ARM $12.6.2: [A member initializer list] (or, for an
3664 aggregate, initialization by a brace-enclosed list) is the
3665 only way to initialize nonstatic const and reference
3667 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
3668 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) = 1;
3670 /* A field that is pseudo-const makes the structure likewise. */
3671 else if (CLASS_TYPE_P (type
))
3673 C_TYPE_FIELDS_READONLY (t
) |= C_TYPE_FIELDS_READONLY (type
);
3674 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
,
3675 CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
)
3676 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (type
));
3679 /* Core issue 80: A nonstatic data member is required to have a
3680 different name from the class iff the class has a
3681 user-declared constructor. */
3682 if (constructor_name_p (DECL_NAME (x
), t
)
3683 && TYPE_HAS_USER_CONSTRUCTOR (t
))
3684 permerror (input_location
, "field %q+#D with same name as class", x
);
3687 /* Effective C++ rule 11: if a class has dynamic memory held by pointers,
3688 it should also define a copy constructor and an assignment operator to
3689 implement the correct copy semantic (deep vs shallow, etc.). As it is
3690 not feasible to check whether the constructors do allocate dynamic memory
3691 and store it within members, we approximate the warning like this:
3693 -- Warn only if there are members which are pointers
3694 -- Warn only if there is a non-trivial constructor (otherwise,
3695 there cannot be memory allocated).
3696 -- Warn only if there is a non-trivial destructor. We assume that the
3697 user at least implemented the cleanup correctly, and a destructor
3698 is needed to free dynamic memory.
3700 This seems enough for practical purposes. */
3703 && TYPE_HAS_USER_CONSTRUCTOR (t
)
3704 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3705 && !(TYPE_HAS_COPY_CTOR (t
) && TYPE_HAS_COPY_ASSIGN (t
)))
3707 warning (OPT_Weffc__
, "%q#T has pointer data members", t
);
3709 if (! TYPE_HAS_COPY_CTOR (t
))
3711 warning (OPT_Weffc__
,
3712 " but does not override %<%T(const %T&)%>", t
, t
);
3713 if (!TYPE_HAS_COPY_ASSIGN (t
))
3714 warning (OPT_Weffc__
, " or %<operator=(const %T&)%>", t
);
3716 else if (! TYPE_HAS_COPY_ASSIGN (t
))
3717 warning (OPT_Weffc__
,
3718 " but does not override %<operator=(const %T&)%>", t
);
3721 /* Non-static data member initializers make the default constructor
3723 if (any_default_members
)
3725 TYPE_NEEDS_CONSTRUCTING (t
) = true;
3726 TYPE_HAS_COMPLEX_DFLT (t
) = true;
3729 /* If any of the fields couldn't be packed, unset TYPE_PACKED. */
3731 TYPE_PACKED (t
) = 0;
3733 /* Check anonymous struct/anonymous union fields. */
3734 finish_struct_anon (t
);
3736 /* We've built up the list of access declarations in reverse order.
3738 *access_decls
= nreverse (*access_decls
);
3741 /* If TYPE is an empty class type, records its OFFSET in the table of
3745 record_subobject_offset (tree type
, tree offset
, splay_tree offsets
)
3749 if (!is_empty_class (type
))
3752 /* Record the location of this empty object in OFFSETS. */
3753 n
= splay_tree_lookup (offsets
, (splay_tree_key
) offset
);
3755 n
= splay_tree_insert (offsets
,
3756 (splay_tree_key
) offset
,
3757 (splay_tree_value
) NULL_TREE
);
3758 n
->value
= ((splay_tree_value
)
3759 tree_cons (NULL_TREE
,
3766 /* Returns nonzero if TYPE is an empty class type and there is
3767 already an entry in OFFSETS for the same TYPE as the same OFFSET. */
3770 check_subobject_offset (tree type
, tree offset
, splay_tree offsets
)
3775 if (!is_empty_class (type
))
3778 /* Record the location of this empty object in OFFSETS. */
3779 n
= splay_tree_lookup (offsets
, (splay_tree_key
) offset
);
3783 for (t
= (tree
) n
->value
; t
; t
= TREE_CHAIN (t
))
3784 if (same_type_p (TREE_VALUE (t
), type
))
3790 /* Walk through all the subobjects of TYPE (located at OFFSET). Call
3791 F for every subobject, passing it the type, offset, and table of
3792 OFFSETS. If VBASES_P is one, then virtual non-primary bases should
3795 If MAX_OFFSET is non-NULL, then subobjects with an offset greater
3796 than MAX_OFFSET will not be walked.
3798 If F returns a nonzero value, the traversal ceases, and that value
3799 is returned. Otherwise, returns zero. */
3802 walk_subobject_offsets (tree type
,
3803 subobject_offset_fn f
,
3810 tree type_binfo
= NULL_TREE
;
3812 /* If this OFFSET is bigger than the MAX_OFFSET, then we should
3814 if (max_offset
&& INT_CST_LT (max_offset
, offset
))
3817 if (type
== error_mark_node
)
3822 if (abi_version_at_least (2))
3824 type
= BINFO_TYPE (type
);
3827 if (CLASS_TYPE_P (type
))
3833 /* Avoid recursing into objects that are not interesting. */
3834 if (!CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type
))
3837 /* Record the location of TYPE. */
3838 r
= (*f
) (type
, offset
, offsets
);
3842 /* Iterate through the direct base classes of TYPE. */
3844 type_binfo
= TYPE_BINFO (type
);
3845 for (i
= 0; BINFO_BASE_ITERATE (type_binfo
, i
, binfo
); i
++)
3849 if (abi_version_at_least (2)
3850 && BINFO_VIRTUAL_P (binfo
))
3854 && BINFO_VIRTUAL_P (binfo
)
3855 && !BINFO_PRIMARY_P (binfo
))
3858 if (!abi_version_at_least (2))
3859 binfo_offset
= size_binop (PLUS_EXPR
,
3861 BINFO_OFFSET (binfo
));
3865 /* We cannot rely on BINFO_OFFSET being set for the base
3866 class yet, but the offsets for direct non-virtual
3867 bases can be calculated by going back to the TYPE. */
3868 orig_binfo
= BINFO_BASE_BINFO (TYPE_BINFO (type
), i
);
3869 binfo_offset
= size_binop (PLUS_EXPR
,
3871 BINFO_OFFSET (orig_binfo
));
3874 r
= walk_subobject_offsets (binfo
,
3879 (abi_version_at_least (2)
3880 ? /*vbases_p=*/0 : vbases_p
));
3885 if (abi_version_at_least (2) && CLASSTYPE_VBASECLASSES (type
))
3888 vec
<tree
, va_gc
> *vbases
;
3890 /* Iterate through the virtual base classes of TYPE. In G++
3891 3.2, we included virtual bases in the direct base class
3892 loop above, which results in incorrect results; the
3893 correct offsets for virtual bases are only known when
3894 working with the most derived type. */
3896 for (vbases
= CLASSTYPE_VBASECLASSES (type
), ix
= 0;
3897 vec_safe_iterate (vbases
, ix
, &binfo
); ix
++)
3899 r
= walk_subobject_offsets (binfo
,
3901 size_binop (PLUS_EXPR
,
3903 BINFO_OFFSET (binfo
)),
3912 /* We still have to walk the primary base, if it is
3913 virtual. (If it is non-virtual, then it was walked
3915 tree vbase
= get_primary_binfo (type_binfo
);
3917 if (vbase
&& BINFO_VIRTUAL_P (vbase
)
3918 && BINFO_PRIMARY_P (vbase
)
3919 && BINFO_INHERITANCE_CHAIN (vbase
) == type_binfo
)
3921 r
= (walk_subobject_offsets
3923 offsets
, max_offset
, /*vbases_p=*/0));
3930 /* Iterate through the fields of TYPE. */
3931 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3932 if (TREE_CODE (field
) == FIELD_DECL
3933 && TREE_TYPE (field
) != error_mark_node
3934 && !DECL_ARTIFICIAL (field
))
3938 if (abi_version_at_least (2))
3939 field_offset
= byte_position (field
);
3941 /* In G++ 3.2, DECL_FIELD_OFFSET was used. */
3942 field_offset
= DECL_FIELD_OFFSET (field
);
3944 r
= walk_subobject_offsets (TREE_TYPE (field
),
3946 size_binop (PLUS_EXPR
,
3956 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3958 tree element_type
= strip_array_types (type
);
3959 tree domain
= TYPE_DOMAIN (type
);
3962 /* Avoid recursing into objects that are not interesting. */
3963 if (!CLASS_TYPE_P (element_type
)
3964 || !CLASSTYPE_CONTAINS_EMPTY_CLASS_P (element_type
))
3967 /* Step through each of the elements in the array. */
3968 for (index
= size_zero_node
;
3969 /* G++ 3.2 had an off-by-one error here. */
3970 (abi_version_at_least (2)
3971 ? !INT_CST_LT (TYPE_MAX_VALUE (domain
), index
)
3972 : INT_CST_LT (index
, TYPE_MAX_VALUE (domain
)));
3973 index
= size_binop (PLUS_EXPR
, index
, size_one_node
))
3975 r
= walk_subobject_offsets (TREE_TYPE (type
),
3983 offset
= size_binop (PLUS_EXPR
, offset
,
3984 TYPE_SIZE_UNIT (TREE_TYPE (type
)));
3985 /* If this new OFFSET is bigger than the MAX_OFFSET, then
3986 there's no point in iterating through the remaining
3987 elements of the array. */
3988 if (max_offset
&& INT_CST_LT (max_offset
, offset
))
3996 /* Record all of the empty subobjects of TYPE (either a type or a
3997 binfo). If IS_DATA_MEMBER is true, then a non-static data member
3998 is being placed at OFFSET; otherwise, it is a base class that is
3999 being placed at OFFSET. */
4002 record_subobject_offsets (tree type
,
4005 bool is_data_member
)
4008 /* If recording subobjects for a non-static data member or a
4009 non-empty base class , we do not need to record offsets beyond
4010 the size of the biggest empty class. Additional data members
4011 will go at the end of the class. Additional base classes will go
4012 either at offset zero (if empty, in which case they cannot
4013 overlap with offsets past the size of the biggest empty class) or
4014 at the end of the class.
4016 However, if we are placing an empty base class, then we must record
4017 all offsets, as either the empty class is at offset zero (where
4018 other empty classes might later be placed) or at the end of the
4019 class (where other objects might then be placed, so other empty
4020 subobjects might later overlap). */
4022 || !is_empty_class (BINFO_TYPE (type
)))
4023 max_offset
= sizeof_biggest_empty_class
;
4025 max_offset
= NULL_TREE
;
4026 walk_subobject_offsets (type
, record_subobject_offset
, offset
,
4027 offsets
, max_offset
, is_data_member
);
4030 /* Returns nonzero if any of the empty subobjects of TYPE (located at
4031 OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero,
4032 virtual bases of TYPE are examined. */
4035 layout_conflict_p (tree type
,
4040 splay_tree_node max_node
;
4042 /* Get the node in OFFSETS that indicates the maximum offset where
4043 an empty subobject is located. */
4044 max_node
= splay_tree_max (offsets
);
4045 /* If there aren't any empty subobjects, then there's no point in
4046 performing this check. */
4050 return walk_subobject_offsets (type
, check_subobject_offset
, offset
,
4051 offsets
, (tree
) (max_node
->key
),
4055 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
4056 non-static data member of the type indicated by RLI. BINFO is the
4057 binfo corresponding to the base subobject, OFFSETS maps offsets to
4058 types already located at those offsets. This function determines
4059 the position of the DECL. */
4062 layout_nonempty_base_or_field (record_layout_info rli
,
4067 tree offset
= NULL_TREE
;
4073 /* For the purposes of determining layout conflicts, we want to
4074 use the class type of BINFO; TREE_TYPE (DECL) will be the
4075 CLASSTYPE_AS_BASE version, which does not contain entries for
4076 zero-sized bases. */
4077 type
= TREE_TYPE (binfo
);
4082 type
= TREE_TYPE (decl
);
4086 /* Try to place the field. It may take more than one try if we have
4087 a hard time placing the field without putting two objects of the
4088 same type at the same address. */
4091 struct record_layout_info_s old_rli
= *rli
;
4093 /* Place this field. */
4094 place_field (rli
, decl
);
4095 offset
= byte_position (decl
);
4097 /* We have to check to see whether or not there is already
4098 something of the same type at the offset we're about to use.
4099 For example, consider:
4102 struct T : public S { int i; };
4103 struct U : public S, public T {};
4105 Here, we put S at offset zero in U. Then, we can't put T at
4106 offset zero -- its S component would be at the same address
4107 as the S we already allocated. So, we have to skip ahead.
4108 Since all data members, including those whose type is an
4109 empty class, have nonzero size, any overlap can happen only
4110 with a direct or indirect base-class -- it can't happen with
4112 /* In a union, overlap is permitted; all members are placed at
4114 if (TREE_CODE (rli
->t
) == UNION_TYPE
)
4116 /* G++ 3.2 did not check for overlaps when placing a non-empty
4118 if (!abi_version_at_least (2) && binfo
&& BINFO_VIRTUAL_P (binfo
))
4120 if (layout_conflict_p (field_p
? type
: binfo
, offset
,
4123 /* Strip off the size allocated to this field. That puts us
4124 at the first place we could have put the field with
4125 proper alignment. */
4128 /* Bump up by the alignment required for the type. */
4130 = size_binop (PLUS_EXPR
, rli
->bitpos
,
4132 ? CLASSTYPE_ALIGN (type
)
4133 : TYPE_ALIGN (type
)));
4134 normalize_rli (rli
);
4137 /* There was no conflict. We're done laying out this field. */
4141 /* Now that we know where it will be placed, update its
4143 if (binfo
&& CLASS_TYPE_P (BINFO_TYPE (binfo
)))
4144 /* Indirect virtual bases may have a nonzero BINFO_OFFSET at
4145 this point because their BINFO_OFFSET is copied from another
4146 hierarchy. Therefore, we may not need to add the entire
4148 propagate_binfo_offsets (binfo
,
4149 size_diffop_loc (input_location
,
4150 convert (ssizetype
, offset
),
4152 BINFO_OFFSET (binfo
))));
4155 /* Returns true if TYPE is empty and OFFSET is nonzero. */
4158 empty_base_at_nonzero_offset_p (tree type
,
4160 splay_tree
/*offsets*/)
4162 return is_empty_class (type
) && !integer_zerop (offset
);
4165 /* Layout the empty base BINFO. EOC indicates the byte currently just
4166 past the end of the class, and should be correctly aligned for a
4167 class of the type indicated by BINFO; OFFSETS gives the offsets of
4168 the empty bases allocated so far. T is the most derived
4169 type. Return nonzero iff we added it at the end. */
4172 layout_empty_base (record_layout_info rli
, tree binfo
,
4173 tree eoc
, splay_tree offsets
)
4176 tree basetype
= BINFO_TYPE (binfo
);
4179 /* This routine should only be used for empty classes. */
4180 gcc_assert (is_empty_class (basetype
));
4181 alignment
= ssize_int (CLASSTYPE_ALIGN_UNIT (basetype
));
4183 if (!integer_zerop (BINFO_OFFSET (binfo
)))
4185 if (abi_version_at_least (2))
4186 propagate_binfo_offsets
4187 (binfo
, size_diffop_loc (input_location
,
4188 size_zero_node
, BINFO_OFFSET (binfo
)));
4191 "offset of empty base %qT may not be ABI-compliant and may"
4192 "change in a future version of GCC",
4193 BINFO_TYPE (binfo
));
4196 /* This is an empty base class. We first try to put it at offset
4198 if (layout_conflict_p (binfo
,
4199 BINFO_OFFSET (binfo
),
4203 /* That didn't work. Now, we move forward from the next
4204 available spot in the class. */
4206 propagate_binfo_offsets (binfo
, convert (ssizetype
, eoc
));
4209 if (!layout_conflict_p (binfo
,
4210 BINFO_OFFSET (binfo
),
4213 /* We finally found a spot where there's no overlap. */
4216 /* There's overlap here, too. Bump along to the next spot. */
4217 propagate_binfo_offsets (binfo
, alignment
);
4221 if (CLASSTYPE_USER_ALIGN (basetype
))
4223 rli
->record_align
= MAX (rli
->record_align
, CLASSTYPE_ALIGN (basetype
));
4225 rli
->unpacked_align
= MAX (rli
->unpacked_align
, CLASSTYPE_ALIGN (basetype
));
4226 TYPE_USER_ALIGN (rli
->t
) = 1;
4232 /* Layout the base given by BINFO in the class indicated by RLI.
4233 *BASE_ALIGN is a running maximum of the alignments of
4234 any base class. OFFSETS gives the location of empty base
4235 subobjects. T is the most derived type. Return nonzero if the new
4236 object cannot be nearly-empty. A new FIELD_DECL is inserted at
4237 *NEXT_FIELD, unless BINFO is for an empty base class.
4239 Returns the location at which the next field should be inserted. */
4242 build_base_field (record_layout_info rli
, tree binfo
,
4243 splay_tree offsets
, tree
*next_field
)
4246 tree basetype
= BINFO_TYPE (binfo
);
4248 if (!COMPLETE_TYPE_P (basetype
))
4249 /* This error is now reported in xref_tag, thus giving better
4250 location information. */
4253 /* Place the base class. */
4254 if (!is_empty_class (basetype
))
4258 /* The containing class is non-empty because it has a non-empty
4260 CLASSTYPE_EMPTY_P (t
) = 0;
4262 /* Create the FIELD_DECL. */
4263 decl
= build_decl (input_location
,
4264 FIELD_DECL
, NULL_TREE
, CLASSTYPE_AS_BASE (basetype
));
4265 DECL_ARTIFICIAL (decl
) = 1;
4266 DECL_IGNORED_P (decl
) = 1;
4267 DECL_FIELD_CONTEXT (decl
) = t
;
4268 if (CLASSTYPE_AS_BASE (basetype
))
4270 DECL_SIZE (decl
) = CLASSTYPE_SIZE (basetype
);
4271 DECL_SIZE_UNIT (decl
) = CLASSTYPE_SIZE_UNIT (basetype
);
4272 DECL_ALIGN (decl
) = CLASSTYPE_ALIGN (basetype
);
4273 DECL_USER_ALIGN (decl
) = CLASSTYPE_USER_ALIGN (basetype
);
4274 DECL_MODE (decl
) = TYPE_MODE (basetype
);
4275 DECL_FIELD_IS_BASE (decl
) = 1;
4277 /* Try to place the field. It may take more than one try if we
4278 have a hard time placing the field without putting two
4279 objects of the same type at the same address. */
4280 layout_nonempty_base_or_field (rli
, decl
, binfo
, offsets
);
4281 /* Add the new FIELD_DECL to the list of fields for T. */
4282 DECL_CHAIN (decl
) = *next_field
;
4284 next_field
= &DECL_CHAIN (decl
);
4292 /* On some platforms (ARM), even empty classes will not be
4294 eoc
= round_up_loc (input_location
,
4295 rli_size_unit_so_far (rli
),
4296 CLASSTYPE_ALIGN_UNIT (basetype
));
4297 atend
= layout_empty_base (rli
, binfo
, eoc
, offsets
);
4298 /* A nearly-empty class "has no proper base class that is empty,
4299 not morally virtual, and at an offset other than zero." */
4300 if (!BINFO_VIRTUAL_P (binfo
) && CLASSTYPE_NEARLY_EMPTY_P (t
))
4303 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
4304 /* The check above (used in G++ 3.2) is insufficient because
4305 an empty class placed at offset zero might itself have an
4306 empty base at a nonzero offset. */
4307 else if (walk_subobject_offsets (basetype
,
4308 empty_base_at_nonzero_offset_p
,
4311 /*max_offset=*/NULL_TREE
,
4314 if (abi_version_at_least (2))
4315 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
4318 "class %qT will be considered nearly empty in a "
4319 "future version of GCC", t
);
4323 /* We do not create a FIELD_DECL for empty base classes because
4324 it might overlap some other field. We want to be able to
4325 create CONSTRUCTORs for the class by iterating over the
4326 FIELD_DECLs, and the back end does not handle overlapping
4329 /* An empty virtual base causes a class to be non-empty
4330 -- but in that case we do not need to clear CLASSTYPE_EMPTY_P
4331 here because that was already done when the virtual table
4332 pointer was created. */
4335 /* Record the offsets of BINFO and its base subobjects. */
4336 record_subobject_offsets (binfo
,
4337 BINFO_OFFSET (binfo
),
4339 /*is_data_member=*/false);
4344 /* Layout all of the non-virtual base classes. Record empty
4345 subobjects in OFFSETS. T is the most derived type. Return nonzero
4346 if the type cannot be nearly empty. The fields created
4347 corresponding to the base classes will be inserted at
4351 build_base_fields (record_layout_info rli
,
4352 splay_tree offsets
, tree
*next_field
)
4354 /* Chain to hold all the new FIELD_DECLs which stand in for base class
4357 int n_baseclasses
= BINFO_N_BASE_BINFOS (TYPE_BINFO (t
));
4360 /* The primary base class is always allocated first. */
4361 if (CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
4362 next_field
= build_base_field (rli
, CLASSTYPE_PRIMARY_BINFO (t
),
4363 offsets
, next_field
);
4365 /* Now allocate the rest of the bases. */
4366 for (i
= 0; i
< n_baseclasses
; ++i
)
4370 base_binfo
= BINFO_BASE_BINFO (TYPE_BINFO (t
), i
);
4372 /* The primary base was already allocated above, so we don't
4373 need to allocate it again here. */
4374 if (base_binfo
== CLASSTYPE_PRIMARY_BINFO (t
))
4377 /* Virtual bases are added at the end (a primary virtual base
4378 will have already been added). */
4379 if (BINFO_VIRTUAL_P (base_binfo
))
4382 next_field
= build_base_field (rli
, base_binfo
,
4383 offsets
, next_field
);
4387 /* Go through the TYPE_METHODS of T issuing any appropriate
4388 diagnostics, figuring out which methods override which other
4389 methods, and so forth. */
4392 check_methods (tree t
)
4396 for (x
= TYPE_METHODS (t
); x
; x
= DECL_CHAIN (x
))
4398 check_for_override (x
, t
);
4399 if (DECL_PURE_VIRTUAL_P (x
) && ! DECL_VINDEX (x
))
4400 error ("initializer specified for non-virtual method %q+D", x
);
4401 /* The name of the field is the original field name
4402 Save this in auxiliary field for later overloading. */
4403 if (DECL_VINDEX (x
))
4405 TYPE_POLYMORPHIC_P (t
) = 1;
4406 if (DECL_PURE_VIRTUAL_P (x
))
4407 vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t
), x
);
4409 /* All user-provided destructors are non-trivial.
4410 Constructors and assignment ops are handled in
4411 grok_special_member_properties. */
4412 if (DECL_DESTRUCTOR_P (x
) && user_provided_p (x
))
4413 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = 1;
4417 /* FN is a constructor or destructor. Clone the declaration to create
4418 a specialized in-charge or not-in-charge version, as indicated by
4422 build_clone (tree fn
, tree name
)
4427 /* Copy the function. */
4428 clone
= copy_decl (fn
);
4429 /* Reset the function name. */
4430 DECL_NAME (clone
) = name
;
4431 SET_DECL_ASSEMBLER_NAME (clone
, NULL_TREE
);
4432 /* Remember where this function came from. */
4433 DECL_ABSTRACT_ORIGIN (clone
) = fn
;
4434 /* Make it easy to find the CLONE given the FN. */
4435 DECL_CHAIN (clone
) = DECL_CHAIN (fn
);
4436 DECL_CHAIN (fn
) = clone
;
4438 /* If this is a template, do the rest on the DECL_TEMPLATE_RESULT. */
4439 if (TREE_CODE (clone
) == TEMPLATE_DECL
)
4441 tree result
= build_clone (DECL_TEMPLATE_RESULT (clone
), name
);
4442 DECL_TEMPLATE_RESULT (clone
) = result
;
4443 DECL_TEMPLATE_INFO (result
) = copy_node (DECL_TEMPLATE_INFO (result
));
4444 DECL_TI_TEMPLATE (result
) = clone
;
4445 TREE_TYPE (clone
) = TREE_TYPE (result
);
4449 DECL_CLONED_FUNCTION (clone
) = fn
;
4450 /* There's no pending inline data for this function. */
4451 DECL_PENDING_INLINE_INFO (clone
) = NULL
;
4452 DECL_PENDING_INLINE_P (clone
) = 0;
4454 /* The base-class destructor is not virtual. */
4455 if (name
== base_dtor_identifier
)
4457 DECL_VIRTUAL_P (clone
) = 0;
4458 if (TREE_CODE (clone
) != TEMPLATE_DECL
)
4459 DECL_VINDEX (clone
) = NULL_TREE
;
4462 /* If there was an in-charge parameter, drop it from the function
4464 if (DECL_HAS_IN_CHARGE_PARM_P (clone
))
4470 exceptions
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone
));
4471 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (clone
));
4472 parmtypes
= TYPE_ARG_TYPES (TREE_TYPE (clone
));
4473 /* Skip the `this' parameter. */
4474 parmtypes
= TREE_CHAIN (parmtypes
);
4475 /* Skip the in-charge parameter. */
4476 parmtypes
= TREE_CHAIN (parmtypes
);
4477 /* And the VTT parm, in a complete [cd]tor. */
4478 if (DECL_HAS_VTT_PARM_P (fn
)
4479 && ! DECL_NEEDS_VTT_PARM_P (clone
))
4480 parmtypes
= TREE_CHAIN (parmtypes
);
4481 /* If this is subobject constructor or destructor, add the vtt
4484 = build_method_type_directly (basetype
,
4485 TREE_TYPE (TREE_TYPE (clone
)),
4488 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
),
4491 = cp_build_type_attribute_variant (TREE_TYPE (clone
),
4492 TYPE_ATTRIBUTES (TREE_TYPE (fn
)));
4495 /* Copy the function parameters. */
4496 DECL_ARGUMENTS (clone
) = copy_list (DECL_ARGUMENTS (clone
));
4497 /* Remove the in-charge parameter. */
4498 if (DECL_HAS_IN_CHARGE_PARM_P (clone
))
4500 DECL_CHAIN (DECL_ARGUMENTS (clone
))
4501 = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone
)));
4502 DECL_HAS_IN_CHARGE_PARM_P (clone
) = 0;
4504 /* And the VTT parm, in a complete [cd]tor. */
4505 if (DECL_HAS_VTT_PARM_P (fn
))
4507 if (DECL_NEEDS_VTT_PARM_P (clone
))
4508 DECL_HAS_VTT_PARM_P (clone
) = 1;
4511 DECL_CHAIN (DECL_ARGUMENTS (clone
))
4512 = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone
)));
4513 DECL_HAS_VTT_PARM_P (clone
) = 0;
4517 for (parms
= DECL_ARGUMENTS (clone
); parms
; parms
= DECL_CHAIN (parms
))
4519 DECL_CONTEXT (parms
) = clone
;
4520 cxx_dup_lang_specific_decl (parms
);
4523 /* Create the RTL for this function. */
4524 SET_DECL_RTL (clone
, NULL
);
4525 rest_of_decl_compilation (clone
, /*top_level=*/1, at_eof
);
4528 note_decl_for_pch (clone
);
4533 /* Implementation of DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P, do
4534 not invoke this function directly.
4536 For a non-thunk function, returns the address of the slot for storing
4537 the function it is a clone of. Otherwise returns NULL_TREE.
4539 If JUST_TESTING, looks through TEMPLATE_DECL and returns NULL if
4540 cloned_function is unset. This is to support the separate
4541 DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P modes; using the latter
4542 on a template makes sense, but not the former. */
4545 decl_cloned_function_p (const_tree decl
, bool just_testing
)
4549 decl
= STRIP_TEMPLATE (decl
);
4551 if (TREE_CODE (decl
) != FUNCTION_DECL
4552 || !DECL_LANG_SPECIFIC (decl
)
4553 || DECL_LANG_SPECIFIC (decl
)->u
.fn
.thunk_p
)
4555 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4557 lang_check_failed (__FILE__
, __LINE__
, __FUNCTION__
);
4563 ptr
= &DECL_LANG_SPECIFIC (decl
)->u
.fn
.u5
.cloned_function
;
4564 if (just_testing
&& *ptr
== NULL_TREE
)
4570 /* Produce declarations for all appropriate clones of FN. If
4571 UPDATE_METHOD_VEC_P is nonzero, the clones are added to the
4572 CLASTYPE_METHOD_VEC as well. */
4575 clone_function_decl (tree fn
, int update_method_vec_p
)
4579 /* Avoid inappropriate cloning. */
4581 && DECL_CLONED_FUNCTION_P (DECL_CHAIN (fn
)))
4584 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
4586 /* For each constructor, we need two variants: an in-charge version
4587 and a not-in-charge version. */
4588 clone
= build_clone (fn
, complete_ctor_identifier
);
4589 if (update_method_vec_p
)
4590 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4591 clone
= build_clone (fn
, base_ctor_identifier
);
4592 if (update_method_vec_p
)
4593 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4597 gcc_assert (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn
));
4599 /* For each destructor, we need three variants: an in-charge
4600 version, a not-in-charge version, and an in-charge deleting
4601 version. We clone the deleting version first because that
4602 means it will go second on the TYPE_METHODS list -- and that
4603 corresponds to the correct layout order in the virtual
4606 For a non-virtual destructor, we do not build a deleting
4608 if (DECL_VIRTUAL_P (fn
))
4610 clone
= build_clone (fn
, deleting_dtor_identifier
);
4611 if (update_method_vec_p
)
4612 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4614 clone
= build_clone (fn
, complete_dtor_identifier
);
4615 if (update_method_vec_p
)
4616 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4617 clone
= build_clone (fn
, base_dtor_identifier
);
4618 if (update_method_vec_p
)
4619 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4622 /* Note that this is an abstract function that is never emitted. */
4623 DECL_ABSTRACT (fn
) = 1;
4626 /* DECL is an in charge constructor, which is being defined. This will
4627 have had an in class declaration, from whence clones were
4628 declared. An out-of-class definition can specify additional default
4629 arguments. As it is the clones that are involved in overload
4630 resolution, we must propagate the information from the DECL to its
4634 adjust_clone_args (tree decl
)
4638 for (clone
= DECL_CHAIN (decl
); clone
&& DECL_CLONED_FUNCTION_P (clone
);
4639 clone
= DECL_CHAIN (clone
))
4641 tree orig_clone_parms
= TYPE_ARG_TYPES (TREE_TYPE (clone
));
4642 tree orig_decl_parms
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
4643 tree decl_parms
, clone_parms
;
4645 clone_parms
= orig_clone_parms
;
4647 /* Skip the 'this' parameter. */
4648 orig_clone_parms
= TREE_CHAIN (orig_clone_parms
);
4649 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4651 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
4652 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4653 if (DECL_HAS_VTT_PARM_P (decl
))
4654 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4656 clone_parms
= orig_clone_parms
;
4657 if (DECL_HAS_VTT_PARM_P (clone
))
4658 clone_parms
= TREE_CHAIN (clone_parms
);
4660 for (decl_parms
= orig_decl_parms
; decl_parms
;
4661 decl_parms
= TREE_CHAIN (decl_parms
),
4662 clone_parms
= TREE_CHAIN (clone_parms
))
4664 gcc_assert (same_type_p (TREE_TYPE (decl_parms
),
4665 TREE_TYPE (clone_parms
)));
4667 if (TREE_PURPOSE (decl_parms
) && !TREE_PURPOSE (clone_parms
))
4669 /* A default parameter has been added. Adjust the
4670 clone's parameters. */
4671 tree exceptions
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone
));
4672 tree attrs
= TYPE_ATTRIBUTES (TREE_TYPE (clone
));
4673 tree basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (clone
));
4676 clone_parms
= orig_decl_parms
;
4678 if (DECL_HAS_VTT_PARM_P (clone
))
4680 clone_parms
= tree_cons (TREE_PURPOSE (orig_clone_parms
),
4681 TREE_VALUE (orig_clone_parms
),
4683 TREE_TYPE (clone_parms
) = TREE_TYPE (orig_clone_parms
);
4685 type
= build_method_type_directly (basetype
,
4686 TREE_TYPE (TREE_TYPE (clone
)),
4689 type
= build_exception_variant (type
, exceptions
);
4691 type
= cp_build_type_attribute_variant (type
, attrs
);
4692 TREE_TYPE (clone
) = type
;
4694 clone_parms
= NULL_TREE
;
4698 gcc_assert (!clone_parms
);
4702 /* For each of the constructors and destructors in T, create an
4703 in-charge and not-in-charge variant. */
4706 clone_constructors_and_destructors (tree t
)
4710 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4712 if (!CLASSTYPE_METHOD_VEC (t
))
4715 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4716 clone_function_decl (OVL_CURRENT (fns
), /*update_method_vec_p=*/1);
4717 for (fns
= CLASSTYPE_DESTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4718 clone_function_decl (OVL_CURRENT (fns
), /*update_method_vec_p=*/1);
4721 /* Deduce noexcept for a destructor DTOR. */
4724 deduce_noexcept_on_destructor (tree dtor
)
4726 if (!TYPE_RAISES_EXCEPTIONS (TREE_TYPE (dtor
)))
4728 tree ctx
= DECL_CONTEXT (dtor
);
4729 tree implicit_fn
= implicitly_declare_fn (sfk_destructor
, ctx
,
4732 tree eh_spec
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (implicit_fn
));
4733 TREE_TYPE (dtor
) = build_exception_variant (TREE_TYPE (dtor
), eh_spec
);
4737 /* For each destructor in T, deduce noexcept:
4739 12.4/3: A declaration of a destructor that does not have an
4740 exception-specification is implicitly considered to have the
4741 same exception-specification as an implicit declaration (15.4). */
4744 deduce_noexcept_on_destructors (tree t
)
4746 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4748 if (!CLASSTYPE_METHOD_VEC (t
))
4751 for (tree fns
= CLASSTYPE_DESTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4752 deduce_noexcept_on_destructor (OVL_CURRENT (fns
));
4755 /* Subroutine of set_one_vmethod_tm_attributes. Search base classes
4756 of TYPE for virtual functions which FNDECL overrides. Return a
4757 mask of the tm attributes found therein. */
4760 look_for_tm_attr_overrides (tree type
, tree fndecl
)
4762 tree binfo
= TYPE_BINFO (type
);
4766 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ++ix
)
4768 tree o
, basetype
= BINFO_TYPE (base_binfo
);
4770 if (!TYPE_POLYMORPHIC_P (basetype
))
4773 o
= look_for_overrides_here (basetype
, fndecl
);
4775 found
|= tm_attr_to_mask (find_tm_attribute
4776 (TYPE_ATTRIBUTES (TREE_TYPE (o
))));
4778 found
|= look_for_tm_attr_overrides (basetype
, fndecl
);
4784 /* Subroutine of set_method_tm_attributes. Handle the checks and
4785 inheritance for one virtual method FNDECL. */
4788 set_one_vmethod_tm_attributes (tree type
, tree fndecl
)
4793 found
= look_for_tm_attr_overrides (type
, fndecl
);
4795 /* If FNDECL doesn't actually override anything (i.e. T is the
4796 class that first declares FNDECL virtual), then we're done. */
4800 tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl
)));
4801 have
= tm_attr_to_mask (tm_attr
);
4803 /* Intel STM Language Extension 3.0, Section 4.2 table 4:
4804 tm_pure must match exactly, otherwise no weakening of
4805 tm_safe > tm_callable > nothing. */
4806 /* ??? The tm_pure attribute didn't make the transition to the
4807 multivendor language spec. */
4808 if (have
== TM_ATTR_PURE
)
4810 if (found
!= TM_ATTR_PURE
)
4816 /* If the overridden function is tm_pure, then FNDECL must be. */
4817 else if (found
== TM_ATTR_PURE
&& tm_attr
)
4819 /* Look for base class combinations that cannot be satisfied. */
4820 else if (found
!= TM_ATTR_PURE
&& (found
& TM_ATTR_PURE
))
4822 found
&= ~TM_ATTR_PURE
;
4824 error_at (DECL_SOURCE_LOCATION (fndecl
),
4825 "method overrides both %<transaction_pure%> and %qE methods",
4826 tm_mask_to_attr (found
));
4828 /* If FNDECL did not declare an attribute, then inherit the most
4830 else if (tm_attr
== NULL
)
4832 apply_tm_attr (fndecl
, tm_mask_to_attr (found
& -found
));
4834 /* Otherwise validate that we're not weaker than a function
4835 that is being overridden. */
4839 if (found
<= TM_ATTR_CALLABLE
&& have
> found
)
4845 error_at (DECL_SOURCE_LOCATION (fndecl
),
4846 "method declared %qE overriding %qE method",
4847 tm_attr
, tm_mask_to_attr (found
));
4850 /* For each of the methods in T, propagate a class-level tm attribute. */
4853 set_method_tm_attributes (tree t
)
4855 tree class_tm_attr
, fndecl
;
4857 /* Don't bother collecting tm attributes if transactional memory
4858 support is not enabled. */
4862 /* Process virtual methods first, as they inherit directly from the
4863 base virtual function and also require validation of new attributes. */
4864 if (TYPE_CONTAINS_VPTR_P (t
))
4867 for (vchain
= BINFO_VIRTUALS (TYPE_BINFO (t
)); vchain
;
4868 vchain
= TREE_CHAIN (vchain
))
4870 fndecl
= BV_FN (vchain
);
4871 if (DECL_THUNK_P (fndecl
))
4872 fndecl
= THUNK_TARGET (fndecl
);
4873 set_one_vmethod_tm_attributes (t
, fndecl
);
4877 /* If the class doesn't have an attribute, nothing more to do. */
4878 class_tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (t
));
4879 if (class_tm_attr
== NULL
)
4882 /* Any method that does not yet have a tm attribute inherits
4883 the one from the class. */
4884 for (fndecl
= TYPE_METHODS (t
); fndecl
; fndecl
= TREE_CHAIN (fndecl
))
4886 if (!find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl
))))
4887 apply_tm_attr (fndecl
, class_tm_attr
);
4891 /* Returns true iff class T has a user-defined constructor other than
4892 the default constructor. */
4895 type_has_user_nondefault_constructor (tree t
)
4899 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4902 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4904 tree fn
= OVL_CURRENT (fns
);
4905 if (!DECL_ARTIFICIAL (fn
)
4906 && (TREE_CODE (fn
) == TEMPLATE_DECL
4907 || (skip_artificial_parms_for (fn
, DECL_ARGUMENTS (fn
))
4915 /* Returns the defaulted constructor if T has one. Otherwise, returns
4919 in_class_defaulted_default_constructor (tree t
)
4923 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4926 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4928 tree fn
= OVL_CURRENT (fns
);
4930 if (DECL_DEFAULTED_IN_CLASS_P (fn
))
4932 args
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
4933 while (args
&& TREE_PURPOSE (args
))
4934 args
= TREE_CHAIN (args
);
4935 if (!args
|| args
== void_list_node
)
4943 /* Returns true iff FN is a user-provided function, i.e. user-declared
4944 and not defaulted at its first declaration; or explicit, private,
4945 protected, or non-const. */
4948 user_provided_p (tree fn
)
4950 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4953 return (!DECL_ARTIFICIAL (fn
)
4954 && !(DECL_INITIALIZED_IN_CLASS_P (fn
)
4955 && (DECL_DEFAULTED_FN (fn
) || DECL_DELETED_FN (fn
))));
4958 /* Returns true iff class T has a user-provided constructor. */
4961 type_has_user_provided_constructor (tree t
)
4965 if (!CLASS_TYPE_P (t
))
4968 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4971 /* This can happen in error cases; avoid crashing. */
4972 if (!CLASSTYPE_METHOD_VEC (t
))
4975 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4976 if (user_provided_p (OVL_CURRENT (fns
)))
4982 /* Returns true iff class T has a user-provided default constructor. */
4985 type_has_user_provided_default_constructor (tree t
)
4989 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4992 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4994 tree fn
= OVL_CURRENT (fns
);
4995 if (TREE_CODE (fn
) == FUNCTION_DECL
4996 && user_provided_p (fn
)
4997 && sufficient_parms_p (FUNCTION_FIRST_USER_PARMTYPE (fn
)))
5004 /* TYPE is being used as a virtual base, and has a non-trivial move
5005 assignment. Return true if this is due to there being a user-provided
5006 move assignment in TYPE or one of its subobjects; if there isn't, then
5007 multiple move assignment can't cause any harm. */
5010 vbase_has_user_provided_move_assign (tree type
)
5012 /* Does the type itself have a user-provided move assignment operator? */
5014 = lookup_fnfields_slot_nolazy (type
, ansi_assopname (NOP_EXPR
));
5015 fns
; fns
= OVL_NEXT (fns
))
5017 tree fn
= OVL_CURRENT (fns
);
5018 if (move_fn_p (fn
) && user_provided_p (fn
))
5022 /* Do any of its bases? */
5023 tree binfo
= TYPE_BINFO (type
);
5025 for (int i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5026 if (vbase_has_user_provided_move_assign (BINFO_TYPE (base_binfo
)))
5029 /* Or non-static data members? */
5030 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
5032 if (TREE_CODE (field
) == FIELD_DECL
5033 && CLASS_TYPE_P (TREE_TYPE (field
))
5034 && vbase_has_user_provided_move_assign (TREE_TYPE (field
)))
5042 /* If default-initialization leaves part of TYPE uninitialized, returns
5043 a DECL for the field or TYPE itself (DR 253). */
5046 default_init_uninitialized_part (tree type
)
5051 type
= strip_array_types (type
);
5052 if (!CLASS_TYPE_P (type
))
5054 if (type_has_user_provided_default_constructor (type
))
5056 for (binfo
= TYPE_BINFO (type
), i
= 0;
5057 BINFO_BASE_ITERATE (binfo
, i
, t
); ++i
)
5059 r
= default_init_uninitialized_part (BINFO_TYPE (t
));
5063 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
5064 if (TREE_CODE (t
) == FIELD_DECL
5065 && !DECL_ARTIFICIAL (t
)
5066 && !DECL_INITIAL (t
))
5068 r
= default_init_uninitialized_part (TREE_TYPE (t
));
5070 return DECL_P (r
) ? r
: t
;
5076 /* Returns true iff for class T, a trivial synthesized default constructor
5077 would be constexpr. */
5080 trivial_default_constructor_is_constexpr (tree t
)
5082 /* A defaulted trivial default constructor is constexpr
5083 if there is nothing to initialize. */
5084 gcc_assert (!TYPE_HAS_COMPLEX_DFLT (t
));
5085 return is_really_empty_class (t
);
5088 /* Returns true iff class T has a constexpr default constructor. */
5091 type_has_constexpr_default_constructor (tree t
)
5095 if (!CLASS_TYPE_P (t
))
5097 /* The caller should have stripped an enclosing array. */
5098 gcc_assert (TREE_CODE (t
) != ARRAY_TYPE
);
5101 if (CLASSTYPE_LAZY_DEFAULT_CTOR (t
))
5103 if (!TYPE_HAS_COMPLEX_DFLT (t
))
5104 return trivial_default_constructor_is_constexpr (t
);
5105 /* Non-trivial, we need to check subobject constructors. */
5106 lazily_declare_fn (sfk_constructor
, t
);
5108 fns
= locate_ctor (t
);
5109 return (fns
&& DECL_DECLARED_CONSTEXPR_P (fns
));
5112 /* Returns true iff class TYPE has a virtual destructor. */
5115 type_has_virtual_destructor (tree type
)
5119 if (!CLASS_TYPE_P (type
))
5122 gcc_assert (COMPLETE_TYPE_P (type
));
5123 dtor
= CLASSTYPE_DESTRUCTORS (type
);
5124 return (dtor
&& DECL_VIRTUAL_P (dtor
));
5127 /* Returns true iff class T has a move constructor. */
5130 type_has_move_constructor (tree t
)
5134 if (CLASSTYPE_LAZY_MOVE_CTOR (t
))
5136 gcc_assert (COMPLETE_TYPE_P (t
));
5137 lazily_declare_fn (sfk_move_constructor
, t
);
5140 if (!CLASSTYPE_METHOD_VEC (t
))
5143 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5144 if (move_fn_p (OVL_CURRENT (fns
)))
5150 /* Returns true iff class T has a move assignment operator. */
5153 type_has_move_assign (tree t
)
5157 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
5159 gcc_assert (COMPLETE_TYPE_P (t
));
5160 lazily_declare_fn (sfk_move_assignment
, t
);
5163 for (fns
= lookup_fnfields_slot_nolazy (t
, ansi_assopname (NOP_EXPR
));
5164 fns
; fns
= OVL_NEXT (fns
))
5165 if (move_fn_p (OVL_CURRENT (fns
)))
5171 /* Returns true iff class T has a move constructor that was explicitly
5172 declared in the class body. Note that this is different from
5173 "user-provided", which doesn't include functions that are defaulted in
5177 type_has_user_declared_move_constructor (tree t
)
5181 if (CLASSTYPE_LAZY_MOVE_CTOR (t
))
5184 if (!CLASSTYPE_METHOD_VEC (t
))
5187 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5189 tree fn
= OVL_CURRENT (fns
);
5190 if (move_fn_p (fn
) && !DECL_ARTIFICIAL (fn
))
5197 /* Returns true iff class T has a move assignment operator that was
5198 explicitly declared in the class body. */
5201 type_has_user_declared_move_assign (tree t
)
5205 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
5208 for (fns
= lookup_fnfields_slot_nolazy (t
, ansi_assopname (NOP_EXPR
));
5209 fns
; fns
= OVL_NEXT (fns
))
5211 tree fn
= OVL_CURRENT (fns
);
5212 if (move_fn_p (fn
) && !DECL_ARTIFICIAL (fn
))
5219 /* Nonzero if we need to build up a constructor call when initializing an
5220 object of this class, either because it has a user-declared constructor
5221 or because it doesn't have a default constructor (so we need to give an
5222 error if no initializer is provided). Use TYPE_NEEDS_CONSTRUCTING when
5223 what you care about is whether or not an object can be produced by a
5224 constructor (e.g. so we don't set TREE_READONLY on const variables of
5225 such type); use this function when what you care about is whether or not
5226 to try to call a constructor to create an object. The latter case is
5227 the former plus some cases of constructors that cannot be called. */
5230 type_build_ctor_call (tree t
)
5233 if (TYPE_NEEDS_CONSTRUCTING (t
))
5235 inner
= strip_array_types (t
);
5236 if (!CLASS_TYPE_P (inner
) || ANON_AGGR_TYPE_P (inner
))
5238 if (!TYPE_HAS_DEFAULT_CONSTRUCTOR (inner
))
5240 if (cxx_dialect
< cxx11
)
5242 /* A user-declared constructor might be private, and a constructor might
5243 be trivial but deleted. */
5244 for (tree fns
= lookup_fnfields_slot (inner
, complete_ctor_identifier
);
5245 fns
; fns
= OVL_NEXT (fns
))
5247 tree fn
= OVL_CURRENT (fns
);
5248 if (!DECL_ARTIFICIAL (fn
)
5249 || DECL_DELETED_FN (fn
))
5255 /* Like type_build_ctor_call, but for destructors. */
5258 type_build_dtor_call (tree t
)
5261 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5263 inner
= strip_array_types (t
);
5264 if (!CLASS_TYPE_P (inner
) || ANON_AGGR_TYPE_P (inner
)
5265 || !COMPLETE_TYPE_P (inner
))
5267 if (cxx_dialect
< cxx11
)
5269 /* A user-declared destructor might be private, and a destructor might
5270 be trivial but deleted. */
5271 for (tree fns
= lookup_fnfields_slot (inner
, complete_dtor_identifier
);
5272 fns
; fns
= OVL_NEXT (fns
))
5274 tree fn
= OVL_CURRENT (fns
);
5275 if (!DECL_ARTIFICIAL (fn
)
5276 || DECL_DELETED_FN (fn
))
5282 /* Remove all zero-width bit-fields from T. */
5285 remove_zero_width_bit_fields (tree t
)
5289 fieldsp
= &TYPE_FIELDS (t
);
5292 if (TREE_CODE (*fieldsp
) == FIELD_DECL
5293 && DECL_C_BIT_FIELD (*fieldsp
)
5294 /* We should not be confused by the fact that grokbitfield
5295 temporarily sets the width of the bit field into
5296 DECL_INITIAL (*fieldsp).
5297 check_bitfield_decl eventually sets DECL_SIZE (*fieldsp)
5299 && integer_zerop (DECL_SIZE (*fieldsp
)))
5300 *fieldsp
= DECL_CHAIN (*fieldsp
);
5302 fieldsp
= &DECL_CHAIN (*fieldsp
);
5306 /* Returns TRUE iff we need a cookie when dynamically allocating an
5307 array whose elements have the indicated class TYPE. */
5310 type_requires_array_cookie (tree type
)
5313 bool has_two_argument_delete_p
= false;
5315 gcc_assert (CLASS_TYPE_P (type
));
5317 /* If there's a non-trivial destructor, we need a cookie. In order
5318 to iterate through the array calling the destructor for each
5319 element, we'll have to know how many elements there are. */
5320 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
5323 /* If the usual deallocation function is a two-argument whose second
5324 argument is of type `size_t', then we have to pass the size of
5325 the array to the deallocation function, so we will need to store
5327 fns
= lookup_fnfields (TYPE_BINFO (type
),
5328 ansi_opname (VEC_DELETE_EXPR
),
5330 /* If there are no `operator []' members, or the lookup is
5331 ambiguous, then we don't need a cookie. */
5332 if (!fns
|| fns
== error_mark_node
)
5334 /* Loop through all of the functions. */
5335 for (fns
= BASELINK_FUNCTIONS (fns
); fns
; fns
= OVL_NEXT (fns
))
5340 /* Select the current function. */
5341 fn
= OVL_CURRENT (fns
);
5342 /* See if this function is a one-argument delete function. If
5343 it is, then it will be the usual deallocation function. */
5344 second_parm
= TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (fn
)));
5345 if (second_parm
== void_list_node
)
5347 /* Do not consider this function if its second argument is an
5351 /* Otherwise, if we have a two-argument function and the second
5352 argument is `size_t', it will be the usual deallocation
5353 function -- unless there is one-argument function, too. */
5354 if (TREE_CHAIN (second_parm
) == void_list_node
5355 && same_type_p (TREE_VALUE (second_parm
), size_type_node
))
5356 has_two_argument_delete_p
= true;
5359 return has_two_argument_delete_p
;
5362 /* Finish computing the `literal type' property of class type T.
5364 At this point, we have already processed base classes and
5365 non-static data members. We need to check whether the copy
5366 constructor is trivial, the destructor is trivial, and there
5367 is a trivial default constructor or at least one constexpr
5368 constructor other than the copy constructor. */
5371 finalize_literal_type_property (tree t
)
5375 if (cxx_dialect
< cxx11
5376 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5377 CLASSTYPE_LITERAL_P (t
) = false;
5378 else if (CLASSTYPE_LITERAL_P (t
) && !TYPE_HAS_TRIVIAL_DFLT (t
)
5379 && CLASSTYPE_NON_AGGREGATE (t
)
5380 && !TYPE_HAS_CONSTEXPR_CTOR (t
))
5381 CLASSTYPE_LITERAL_P (t
) = false;
5383 if (!CLASSTYPE_LITERAL_P (t
))
5384 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5385 if (DECL_DECLARED_CONSTEXPR_P (fn
)
5386 && TREE_CODE (fn
) != TEMPLATE_DECL
5387 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
5388 && !DECL_CONSTRUCTOR_P (fn
))
5390 DECL_DECLARED_CONSTEXPR_P (fn
) = false;
5391 if (!DECL_GENERATED_P (fn
))
5393 error ("enclosing class of constexpr non-static member "
5394 "function %q+#D is not a literal type", fn
);
5395 explain_non_literal_class (t
);
5400 /* T is a non-literal type used in a context which requires a constant
5401 expression. Explain why it isn't literal. */
5404 explain_non_literal_class (tree t
)
5406 static struct pointer_set_t
*diagnosed
;
5408 if (!CLASS_TYPE_P (t
))
5410 t
= TYPE_MAIN_VARIANT (t
);
5412 if (diagnosed
== NULL
)
5413 diagnosed
= pointer_set_create ();
5414 if (pointer_set_insert (diagnosed
, t
) != 0)
5415 /* Already explained. */
5418 inform (0, "%q+T is not literal because:", t
);
5419 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5420 inform (0, " %q+T has a non-trivial destructor", t
);
5421 else if (CLASSTYPE_NON_AGGREGATE (t
)
5422 && !TYPE_HAS_TRIVIAL_DFLT (t
)
5423 && !TYPE_HAS_CONSTEXPR_CTOR (t
))
5425 inform (0, " %q+T is not an aggregate, does not have a trivial "
5426 "default constructor, and has no constexpr constructor that "
5427 "is not a copy or move constructor", t
);
5428 if (TYPE_HAS_DEFAULT_CONSTRUCTOR (t
)
5429 && !type_has_user_provided_default_constructor (t
))
5431 /* Note that we can't simply call locate_ctor because when the
5432 constructor is deleted it just returns NULL_TREE. */
5434 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5436 tree fn
= OVL_CURRENT (fns
);
5437 tree parms
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5439 parms
= skip_artificial_parms_for (fn
, parms
);
5441 if (sufficient_parms_p (parms
))
5443 if (DECL_DELETED_FN (fn
))
5444 maybe_explain_implicit_delete (fn
);
5446 explain_invalid_constexpr_fn (fn
);
5454 tree binfo
, base_binfo
, field
; int i
;
5455 for (binfo
= TYPE_BINFO (t
), i
= 0;
5456 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
5458 tree basetype
= TREE_TYPE (base_binfo
);
5459 if (!CLASSTYPE_LITERAL_P (basetype
))
5461 inform (0, " base class %qT of %q+T is non-literal",
5463 explain_non_literal_class (basetype
);
5467 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
5470 if (TREE_CODE (field
) != FIELD_DECL
)
5472 ftype
= TREE_TYPE (field
);
5473 if (!literal_type_p (ftype
))
5475 inform (0, " non-static data member %q+D has "
5476 "non-literal type", field
);
5477 if (CLASS_TYPE_P (ftype
))
5478 explain_non_literal_class (ftype
);
5484 /* Check the validity of the bases and members declared in T. Add any
5485 implicitly-generated functions (like copy-constructors and
5486 assignment operators). Compute various flag bits (like
5487 CLASSTYPE_NON_LAYOUT_POD_T) for T. This routine works purely at the C++
5488 level: i.e., independently of the ABI in use. */
5491 check_bases_and_members (tree t
)
5493 /* Nonzero if the implicitly generated copy constructor should take
5494 a non-const reference argument. */
5495 int cant_have_const_ctor
;
5496 /* Nonzero if the implicitly generated assignment operator
5497 should take a non-const reference argument. */
5498 int no_const_asn_ref
;
5500 bool saved_complex_asn_ref
;
5501 bool saved_nontrivial_dtor
;
5504 /* Pick up any abi_tags from our template arguments before checking. */
5505 inherit_targ_abi_tags (t
);
5507 /* By default, we use const reference arguments and generate default
5509 cant_have_const_ctor
= 0;
5510 no_const_asn_ref
= 0;
5512 /* Check all the base-classes. */
5513 check_bases (t
, &cant_have_const_ctor
,
5516 /* Deduce noexcept on destructors. This needs to happen after we've set
5517 triviality flags appropriately for our bases. */
5518 if (cxx_dialect
>= cxx11
)
5519 deduce_noexcept_on_destructors (t
);
5521 /* Check all the method declarations. */
5524 /* Save the initial values of these flags which only indicate whether
5525 or not the class has user-provided functions. As we analyze the
5526 bases and members we can set these flags for other reasons. */
5527 saved_complex_asn_ref
= TYPE_HAS_COMPLEX_COPY_ASSIGN (t
);
5528 saved_nontrivial_dtor
= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
);
5530 /* Check all the data member declarations. We cannot call
5531 check_field_decls until we have called check_bases check_methods,
5532 as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR
5533 being set appropriately. */
5534 check_field_decls (t
, &access_decls
,
5535 &cant_have_const_ctor
,
5538 /* A nearly-empty class has to be vptr-containing; a nearly empty
5539 class contains just a vptr. */
5540 if (!TYPE_CONTAINS_VPTR_P (t
))
5541 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
5543 /* Do some bookkeeping that will guide the generation of implicitly
5544 declared member functions. */
5545 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5546 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5547 /* We need to call a constructor for this class if it has a
5548 user-provided constructor, or if the default constructor is going
5549 to initialize the vptr. (This is not an if-and-only-if;
5550 TYPE_NEEDS_CONSTRUCTING is set elsewhere if bases or members
5551 themselves need constructing.) */
5552 TYPE_NEEDS_CONSTRUCTING (t
)
5553 |= (type_has_user_provided_constructor (t
) || TYPE_CONTAINS_VPTR_P (t
));
5556 An aggregate is an array or a class with no user-provided
5557 constructors ... and no virtual functions.
5559 Again, other conditions for being an aggregate are checked
5561 CLASSTYPE_NON_AGGREGATE (t
)
5562 |= (type_has_user_provided_constructor (t
) || TYPE_POLYMORPHIC_P (t
));
5563 /* This is the C++98/03 definition of POD; it changed in C++0x, but we
5564 retain the old definition internally for ABI reasons. */
5565 CLASSTYPE_NON_LAYOUT_POD_P (t
)
5566 |= (CLASSTYPE_NON_AGGREGATE (t
)
5567 || saved_nontrivial_dtor
|| saved_complex_asn_ref
);
5568 CLASSTYPE_NON_STD_LAYOUT (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5569 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5570 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5571 TYPE_HAS_COMPLEX_DFLT (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5573 /* Warn if a public base of a polymorphic type has an accessible
5574 non-virtual destructor. It is only now that we know the class is
5575 polymorphic. Although a polymorphic base will have a already
5576 been diagnosed during its definition, we warn on use too. */
5577 if (TYPE_POLYMORPHIC_P (t
) && warn_nonvdtor
)
5579 tree binfo
= TYPE_BINFO (t
);
5580 vec
<tree
, va_gc
> *accesses
= BINFO_BASE_ACCESSES (binfo
);
5584 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
5586 tree basetype
= TREE_TYPE (base_binfo
);
5588 if ((*accesses
)[i
] == access_public_node
5589 && (TYPE_POLYMORPHIC_P (basetype
) || warn_ecpp
)
5590 && accessible_nvdtor_p (basetype
))
5591 warning (OPT_Wnon_virtual_dtor
,
5592 "base class %q#T has accessible non-virtual destructor",
5597 /* If the class has no user-declared constructor, but does have
5598 non-static const or reference data members that can never be
5599 initialized, issue a warning. */
5600 if (warn_uninitialized
5601 /* Classes with user-declared constructors are presumed to
5602 initialize these members. */
5603 && !TYPE_HAS_USER_CONSTRUCTOR (t
)
5604 /* Aggregates can be initialized with brace-enclosed
5606 && CLASSTYPE_NON_AGGREGATE (t
))
5610 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
5614 if (TREE_CODE (field
) != FIELD_DECL
5615 || DECL_INITIAL (field
) != NULL_TREE
)
5618 type
= TREE_TYPE (field
);
5619 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5620 warning (OPT_Wuninitialized
, "non-static reference %q+#D "
5621 "in class without a constructor", field
);
5622 else if (CP_TYPE_CONST_P (type
)
5623 && (!CLASS_TYPE_P (type
)
5624 || !TYPE_HAS_DEFAULT_CONSTRUCTOR (type
)))
5625 warning (OPT_Wuninitialized
, "non-static const member %q+#D "
5626 "in class without a constructor", field
);
5630 /* Synthesize any needed methods. */
5631 add_implicitly_declared_members (t
, &access_decls
,
5632 cant_have_const_ctor
,
5635 /* Check defaulted declarations here so we have cant_have_const_ctor
5636 and don't need to worry about clones. */
5637 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5638 if (!DECL_ARTIFICIAL (fn
) && DECL_DEFAULTED_IN_CLASS_P (fn
))
5640 int copy
= copy_fn_p (fn
);
5644 = (DECL_CONSTRUCTOR_P (fn
) ? !cant_have_const_ctor
5645 : !no_const_asn_ref
);
5646 bool fn_const_p
= (copy
== 2);
5648 if (fn_const_p
&& !imp_const_p
)
5649 /* If the function is defaulted outside the class, we just
5650 give the synthesis error. */
5651 error ("%q+D declared to take const reference, but implicit "
5652 "declaration would take non-const", fn
);
5654 defaulted_late_check (fn
);
5657 if (LAMBDA_TYPE_P (t
))
5659 /* "The closure type associated with a lambda-expression has a deleted
5660 default constructor and a deleted copy assignment operator." */
5661 TYPE_NEEDS_CONSTRUCTING (t
) = 1;
5662 TYPE_HAS_COMPLEX_DFLT (t
) = 1;
5663 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
5664 CLASSTYPE_LAZY_MOVE_ASSIGN (t
) = 0;
5666 /* "This class type is not an aggregate." */
5667 CLASSTYPE_NON_AGGREGATE (t
) = 1;
5670 /* Compute the 'literal type' property before we
5671 do anything with non-static member functions. */
5672 finalize_literal_type_property (t
);
5674 /* Create the in-charge and not-in-charge variants of constructors
5676 clone_constructors_and_destructors (t
);
5678 /* Process the using-declarations. */
5679 for (; access_decls
; access_decls
= TREE_CHAIN (access_decls
))
5680 handle_using_decl (TREE_VALUE (access_decls
), t
);
5682 /* Build and sort the CLASSTYPE_METHOD_VEC. */
5683 finish_struct_methods (t
);
5685 /* Figure out whether or not we will need a cookie when dynamically
5686 allocating an array of this type. */
5687 TYPE_LANG_SPECIFIC (t
)->u
.c
.vec_new_uses_cookie
5688 = type_requires_array_cookie (t
);
5691 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
5692 accordingly. If a new vfield was created (because T doesn't have a
5693 primary base class), then the newly created field is returned. It
5694 is not added to the TYPE_FIELDS list; it is the caller's
5695 responsibility to do that. Accumulate declared virtual functions
5699 create_vtable_ptr (tree t
, tree
* virtuals_p
)
5703 /* Collect the virtual functions declared in T. */
5704 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5705 if (DECL_VINDEX (fn
) && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn
)
5706 && TREE_CODE (DECL_VINDEX (fn
)) != INTEGER_CST
)
5708 tree new_virtual
= make_node (TREE_LIST
);
5710 BV_FN (new_virtual
) = fn
;
5711 BV_DELTA (new_virtual
) = integer_zero_node
;
5712 BV_VCALL_INDEX (new_virtual
) = NULL_TREE
;
5714 TREE_CHAIN (new_virtual
) = *virtuals_p
;
5715 *virtuals_p
= new_virtual
;
5718 /* If we couldn't find an appropriate base class, create a new field
5719 here. Even if there weren't any new virtual functions, we might need a
5720 new virtual function table if we're supposed to include vptrs in
5721 all classes that need them. */
5722 if (!TYPE_VFIELD (t
) && (*virtuals_p
|| TYPE_CONTAINS_VPTR_P (t
)))
5724 /* We build this decl with vtbl_ptr_type_node, which is a
5725 `vtable_entry_type*'. It might seem more precise to use
5726 `vtable_entry_type (*)[N]' where N is the number of virtual
5727 functions. However, that would require the vtable pointer in
5728 base classes to have a different type than the vtable pointer
5729 in derived classes. We could make that happen, but that
5730 still wouldn't solve all the problems. In particular, the
5731 type-based alias analysis code would decide that assignments
5732 to the base class vtable pointer can't alias assignments to
5733 the derived class vtable pointer, since they have different
5734 types. Thus, in a derived class destructor, where the base
5735 class constructor was inlined, we could generate bad code for
5736 setting up the vtable pointer.
5738 Therefore, we use one type for all vtable pointers. We still
5739 use a type-correct type; it's just doesn't indicate the array
5740 bounds. That's better than using `void*' or some such; it's
5741 cleaner, and it let's the alias analysis code know that these
5742 stores cannot alias stores to void*! */
5745 field
= build_decl (input_location
,
5746 FIELD_DECL
, get_vfield_name (t
), vtbl_ptr_type_node
);
5747 DECL_VIRTUAL_P (field
) = 1;
5748 DECL_ARTIFICIAL (field
) = 1;
5749 DECL_FIELD_CONTEXT (field
) = t
;
5750 DECL_FCONTEXT (field
) = t
;
5751 if (TYPE_PACKED (t
))
5752 DECL_PACKED (field
) = 1;
5754 TYPE_VFIELD (t
) = field
;
5756 /* This class is non-empty. */
5757 CLASSTYPE_EMPTY_P (t
) = 0;
5765 /* Add OFFSET to all base types of BINFO which is a base in the
5766 hierarchy dominated by T.
5768 OFFSET, which is a type offset, is number of bytes. */
5771 propagate_binfo_offsets (tree binfo
, tree offset
)
5777 /* Update BINFO's offset. */
5778 BINFO_OFFSET (binfo
)
5779 = convert (sizetype
,
5780 size_binop (PLUS_EXPR
,
5781 convert (ssizetype
, BINFO_OFFSET (binfo
)),
5784 /* Find the primary base class. */
5785 primary_binfo
= get_primary_binfo (binfo
);
5787 if (primary_binfo
&& BINFO_INHERITANCE_CHAIN (primary_binfo
) == binfo
)
5788 propagate_binfo_offsets (primary_binfo
, offset
);
5790 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
5792 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5794 /* Don't do the primary base twice. */
5795 if (base_binfo
== primary_binfo
)
5798 if (BINFO_VIRTUAL_P (base_binfo
))
5801 propagate_binfo_offsets (base_binfo
, offset
);
5805 /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update
5806 TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of
5807 empty subobjects of T. */
5810 layout_virtual_bases (record_layout_info rli
, splay_tree offsets
)
5814 bool first_vbase
= true;
5817 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t
)) == 0)
5820 if (!abi_version_at_least(2))
5822 /* In G++ 3.2, we incorrectly rounded the size before laying out
5823 the virtual bases. */
5824 finish_record_layout (rli
, /*free_p=*/false);
5825 #ifdef STRUCTURE_SIZE_BOUNDARY
5826 /* Packed structures don't need to have minimum size. */
5827 if (! TYPE_PACKED (t
))
5828 TYPE_ALIGN (t
) = MAX (TYPE_ALIGN (t
), (unsigned) STRUCTURE_SIZE_BOUNDARY
);
5830 rli
->offset
= TYPE_SIZE_UNIT (t
);
5831 rli
->bitpos
= bitsize_zero_node
;
5832 rli
->record_align
= TYPE_ALIGN (t
);
5835 /* Find the last field. The artificial fields created for virtual
5836 bases will go after the last extant field to date. */
5837 next_field
= &TYPE_FIELDS (t
);
5839 next_field
= &DECL_CHAIN (*next_field
);
5841 /* Go through the virtual bases, allocating space for each virtual
5842 base that is not already a primary base class. These are
5843 allocated in inheritance graph order. */
5844 for (vbase
= TYPE_BINFO (t
); vbase
; vbase
= TREE_CHAIN (vbase
))
5846 if (!BINFO_VIRTUAL_P (vbase
))
5849 if (!BINFO_PRIMARY_P (vbase
))
5851 tree basetype
= TREE_TYPE (vbase
);
5853 /* This virtual base is not a primary base of any class in the
5854 hierarchy, so we have to add space for it. */
5855 next_field
= build_base_field (rli
, vbase
,
5856 offsets
, next_field
);
5858 /* If the first virtual base might have been placed at a
5859 lower address, had we started from CLASSTYPE_SIZE, rather
5860 than TYPE_SIZE, issue a warning. There can be both false
5861 positives and false negatives from this warning in rare
5862 cases; to deal with all the possibilities would probably
5863 require performing both layout algorithms and comparing
5864 the results which is not particularly tractable. */
5868 (size_binop (CEIL_DIV_EXPR
,
5869 round_up_loc (input_location
,
5871 CLASSTYPE_ALIGN (basetype
)),
5873 BINFO_OFFSET (vbase
))))
5875 "offset of virtual base %qT is not ABI-compliant and "
5876 "may change in a future version of GCC",
5879 first_vbase
= false;
5884 /* Returns the offset of the byte just past the end of the base class
5888 end_of_base (tree binfo
)
5892 if (!CLASSTYPE_AS_BASE (BINFO_TYPE (binfo
)))
5893 size
= TYPE_SIZE_UNIT (char_type_node
);
5894 else if (is_empty_class (BINFO_TYPE (binfo
)))
5895 /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to
5896 allocate some space for it. It cannot have virtual bases, so
5897 TYPE_SIZE_UNIT is fine. */
5898 size
= TYPE_SIZE_UNIT (BINFO_TYPE (binfo
));
5900 size
= CLASSTYPE_SIZE_UNIT (BINFO_TYPE (binfo
));
5902 return size_binop (PLUS_EXPR
, BINFO_OFFSET (binfo
), size
);
5905 /* Returns the offset of the byte just past the end of the base class
5906 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
5907 only non-virtual bases are included. */
5910 end_of_class (tree t
, int include_virtuals_p
)
5912 tree result
= size_zero_node
;
5913 vec
<tree
, va_gc
> *vbases
;
5919 for (binfo
= TYPE_BINFO (t
), i
= 0;
5920 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5922 if (!include_virtuals_p
5923 && BINFO_VIRTUAL_P (base_binfo
)
5924 && (!BINFO_PRIMARY_P (base_binfo
)
5925 || BINFO_INHERITANCE_CHAIN (base_binfo
) != TYPE_BINFO (t
)))
5928 offset
= end_of_base (base_binfo
);
5929 if (INT_CST_LT_UNSIGNED (result
, offset
))
5933 /* G++ 3.2 did not check indirect virtual bases. */
5934 if (abi_version_at_least (2) && include_virtuals_p
)
5935 for (vbases
= CLASSTYPE_VBASECLASSES (t
), i
= 0;
5936 vec_safe_iterate (vbases
, i
, &base_binfo
); i
++)
5938 offset
= end_of_base (base_binfo
);
5939 if (INT_CST_LT_UNSIGNED (result
, offset
))
5946 /* Warn about bases of T that are inaccessible because they are
5947 ambiguous. For example:
5950 struct T : public S {};
5951 struct U : public S, public T {};
5953 Here, `(S*) new U' is not allowed because there are two `S'
5957 warn_about_ambiguous_bases (tree t
)
5960 vec
<tree
, va_gc
> *vbases
;
5965 /* If there are no repeated bases, nothing can be ambiguous. */
5966 if (!CLASSTYPE_REPEATED_BASE_P (t
))
5969 /* Check direct bases. */
5970 for (binfo
= TYPE_BINFO (t
), i
= 0;
5971 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5973 basetype
= BINFO_TYPE (base_binfo
);
5975 if (!uniquely_derived_from_p (basetype
, t
))
5976 warning (0, "direct base %qT inaccessible in %qT due to ambiguity",
5980 /* Check for ambiguous virtual bases. */
5982 for (vbases
= CLASSTYPE_VBASECLASSES (t
), i
= 0;
5983 vec_safe_iterate (vbases
, i
, &binfo
); i
++)
5985 basetype
= BINFO_TYPE (binfo
);
5987 if (!uniquely_derived_from_p (basetype
, t
))
5988 warning (OPT_Wextra
, "virtual base %qT inaccessible in %qT due "
5989 "to ambiguity", basetype
, t
);
5993 /* Compare two INTEGER_CSTs K1 and K2. */
5996 splay_tree_compare_integer_csts (splay_tree_key k1
, splay_tree_key k2
)
5998 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
6001 /* Increase the size indicated in RLI to account for empty classes
6002 that are "off the end" of the class. */
6005 include_empty_classes (record_layout_info rli
)
6010 /* It might be the case that we grew the class to allocate a
6011 zero-sized base class. That won't be reflected in RLI, yet,
6012 because we are willing to overlay multiple bases at the same
6013 offset. However, now we need to make sure that RLI is big enough
6014 to reflect the entire class. */
6015 eoc
= end_of_class (rli
->t
,
6016 CLASSTYPE_AS_BASE (rli
->t
) != NULL_TREE
);
6017 rli_size
= rli_size_unit_so_far (rli
);
6018 if (TREE_CODE (rli_size
) == INTEGER_CST
6019 && INT_CST_LT_UNSIGNED (rli_size
, eoc
))
6021 if (!abi_version_at_least (2))
6022 /* In version 1 of the ABI, the size of a class that ends with
6023 a bitfield was not rounded up to a whole multiple of a
6024 byte. Because rli_size_unit_so_far returns only the number
6025 of fully allocated bytes, any extra bits were not included
6027 rli
->bitpos
= round_down (rli
->bitpos
, BITS_PER_UNIT
);
6029 /* The size should have been rounded to a whole byte. */
6030 gcc_assert (tree_int_cst_equal
6031 (rli
->bitpos
, round_down (rli
->bitpos
, BITS_PER_UNIT
)));
6033 = size_binop (PLUS_EXPR
,
6035 size_binop (MULT_EXPR
,
6036 convert (bitsizetype
,
6037 size_binop (MINUS_EXPR
,
6039 bitsize_int (BITS_PER_UNIT
)));
6040 normalize_rli (rli
);
6044 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
6045 BINFO_OFFSETs for all of the base-classes. Position the vtable
6046 pointer. Accumulate declared virtual functions on VIRTUALS_P. */
6049 layout_class_type (tree t
, tree
*virtuals_p
)
6051 tree non_static_data_members
;
6054 record_layout_info rli
;
6055 /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of
6056 types that appear at that offset. */
6057 splay_tree empty_base_offsets
;
6058 /* True if the last field laid out was a bit-field. */
6059 bool last_field_was_bitfield
= false;
6060 /* The location at which the next field should be inserted. */
6062 /* T, as a base class. */
6065 /* Keep track of the first non-static data member. */
6066 non_static_data_members
= TYPE_FIELDS (t
);
6068 /* Start laying out the record. */
6069 rli
= start_record_layout (t
);
6071 /* Mark all the primary bases in the hierarchy. */
6072 determine_primary_bases (t
);
6074 /* Create a pointer to our virtual function table. */
6075 vptr
= create_vtable_ptr (t
, virtuals_p
);
6077 /* The vptr is always the first thing in the class. */
6080 DECL_CHAIN (vptr
) = TYPE_FIELDS (t
);
6081 TYPE_FIELDS (t
) = vptr
;
6082 next_field
= &DECL_CHAIN (vptr
);
6083 place_field (rli
, vptr
);
6086 next_field
= &TYPE_FIELDS (t
);
6088 /* Build FIELD_DECLs for all of the non-virtual base-types. */
6089 empty_base_offsets
= splay_tree_new (splay_tree_compare_integer_csts
,
6091 build_base_fields (rli
, empty_base_offsets
, next_field
);
6093 /* Layout the non-static data members. */
6094 for (field
= non_static_data_members
; field
; field
= DECL_CHAIN (field
))
6099 /* We still pass things that aren't non-static data members to
6100 the back end, in case it wants to do something with them. */
6101 if (TREE_CODE (field
) != FIELD_DECL
)
6103 place_field (rli
, field
);
6104 /* If the static data member has incomplete type, keep track
6105 of it so that it can be completed later. (The handling
6106 of pending statics in finish_record_layout is
6107 insufficient; consider:
6110 struct S2 { static S1 s1; };
6112 At this point, finish_record_layout will be called, but
6113 S1 is still incomplete.) */
6116 maybe_register_incomplete_var (field
);
6117 /* The visibility of static data members is determined
6118 at their point of declaration, not their point of
6120 determine_visibility (field
);
6125 type
= TREE_TYPE (field
);
6126 if (type
== error_mark_node
)
6129 padding
= NULL_TREE
;
6131 /* If this field is a bit-field whose width is greater than its
6132 type, then there are some special rules for allocating
6134 if (DECL_C_BIT_FIELD (field
)
6135 && INT_CST_LT (TYPE_SIZE (type
), DECL_SIZE (field
)))
6139 bool was_unnamed_p
= false;
6140 /* We must allocate the bits as if suitably aligned for the
6141 longest integer type that fits in this many bits. type
6142 of the field. Then, we are supposed to use the left over
6143 bits as additional padding. */
6144 for (itk
= itk_char
; itk
!= itk_none
; ++itk
)
6145 if (integer_types
[itk
] != NULL_TREE
6146 && (INT_CST_LT (size_int (MAX_FIXED_MODE_SIZE
),
6147 TYPE_SIZE (integer_types
[itk
]))
6148 || INT_CST_LT (DECL_SIZE (field
),
6149 TYPE_SIZE (integer_types
[itk
]))))
6152 /* ITK now indicates a type that is too large for the
6153 field. We have to back up by one to find the largest
6158 integer_type
= integer_types
[itk
];
6159 } while (itk
> 0 && integer_type
== NULL_TREE
);
6161 /* Figure out how much additional padding is required. GCC
6162 3.2 always created a padding field, even if it had zero
6164 if (!abi_version_at_least (2)
6165 || INT_CST_LT (TYPE_SIZE (integer_type
), DECL_SIZE (field
)))
6167 if (abi_version_at_least (2) && TREE_CODE (t
) == UNION_TYPE
)
6168 /* In a union, the padding field must have the full width
6169 of the bit-field; all fields start at offset zero. */
6170 padding
= DECL_SIZE (field
);
6173 if (TREE_CODE (t
) == UNION_TYPE
)
6174 warning (OPT_Wabi
, "size assigned to %qT may not be "
6175 "ABI-compliant and may change in a future "
6178 padding
= size_binop (MINUS_EXPR
, DECL_SIZE (field
),
6179 TYPE_SIZE (integer_type
));
6182 #ifdef PCC_BITFIELD_TYPE_MATTERS
6183 /* An unnamed bitfield does not normally affect the
6184 alignment of the containing class on a target where
6185 PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not
6186 make any exceptions for unnamed bitfields when the
6187 bitfields are longer than their types. Therefore, we
6188 temporarily give the field a name. */
6189 if (PCC_BITFIELD_TYPE_MATTERS
&& !DECL_NAME (field
))
6191 was_unnamed_p
= true;
6192 DECL_NAME (field
) = make_anon_name ();
6195 DECL_SIZE (field
) = TYPE_SIZE (integer_type
);
6196 DECL_ALIGN (field
) = TYPE_ALIGN (integer_type
);
6197 DECL_USER_ALIGN (field
) = TYPE_USER_ALIGN (integer_type
);
6198 layout_nonempty_base_or_field (rli
, field
, NULL_TREE
,
6199 empty_base_offsets
);
6201 DECL_NAME (field
) = NULL_TREE
;
6202 /* Now that layout has been performed, set the size of the
6203 field to the size of its declared type; the rest of the
6204 field is effectively invisible. */
6205 DECL_SIZE (field
) = TYPE_SIZE (type
);
6206 /* We must also reset the DECL_MODE of the field. */
6207 if (abi_version_at_least (2))
6208 DECL_MODE (field
) = TYPE_MODE (type
);
6210 && DECL_MODE (field
) != TYPE_MODE (type
))
6211 /* Versions of G++ before G++ 3.4 did not reset the
6214 "the offset of %qD may not be ABI-compliant and may "
6215 "change in a future version of GCC", field
);
6218 layout_nonempty_base_or_field (rli
, field
, NULL_TREE
,
6219 empty_base_offsets
);
6221 /* Remember the location of any empty classes in FIELD. */
6222 if (abi_version_at_least (2))
6223 record_subobject_offsets (TREE_TYPE (field
),
6224 byte_position(field
),
6226 /*is_data_member=*/true);
6228 /* If a bit-field does not immediately follow another bit-field,
6229 and yet it starts in the middle of a byte, we have failed to
6230 comply with the ABI. */
6232 && DECL_C_BIT_FIELD (field
)
6233 /* The TREE_NO_WARNING flag gets set by Objective-C when
6234 laying out an Objective-C class. The ObjC ABI differs
6235 from the C++ ABI, and so we do not want a warning
6237 && !TREE_NO_WARNING (field
)
6238 && !last_field_was_bitfield
6239 && !integer_zerop (size_binop (TRUNC_MOD_EXPR
,
6240 DECL_FIELD_BIT_OFFSET (field
),
6241 bitsize_unit_node
)))
6242 warning (OPT_Wabi
, "offset of %q+D is not ABI-compliant and may "
6243 "change in a future version of GCC", field
);
6245 /* G++ used to use DECL_FIELD_OFFSET as if it were the byte
6246 offset of the field. */
6248 && !abi_version_at_least (2)
6249 && !tree_int_cst_equal (DECL_FIELD_OFFSET (field
),
6250 byte_position (field
))
6251 && contains_empty_class_p (TREE_TYPE (field
)))
6252 warning (OPT_Wabi
, "%q+D contains empty classes which may cause base "
6253 "classes to be placed at different locations in a "
6254 "future version of GCC", field
);
6256 /* The middle end uses the type of expressions to determine the
6257 possible range of expression values. In order to optimize
6258 "x.i > 7" to "false" for a 2-bit bitfield "i", the middle end
6259 must be made aware of the width of "i", via its type.
6261 Because C++ does not have integer types of arbitrary width,
6262 we must (for the purposes of the front end) convert from the
6263 type assigned here to the declared type of the bitfield
6264 whenever a bitfield expression is used as an rvalue.
6265 Similarly, when assigning a value to a bitfield, the value
6266 must be converted to the type given the bitfield here. */
6267 if (DECL_C_BIT_FIELD (field
))
6269 unsigned HOST_WIDE_INT width
;
6270 tree ftype
= TREE_TYPE (field
);
6271 width
= tree_to_uhwi (DECL_SIZE (field
));
6272 if (width
!= TYPE_PRECISION (ftype
))
6275 = c_build_bitfield_integer_type (width
,
6276 TYPE_UNSIGNED (ftype
));
6278 = cp_build_qualified_type (TREE_TYPE (field
),
6279 cp_type_quals (ftype
));
6283 /* If we needed additional padding after this field, add it
6289 padding_field
= build_decl (input_location
,
6293 DECL_BIT_FIELD (padding_field
) = 1;
6294 DECL_SIZE (padding_field
) = padding
;
6295 DECL_CONTEXT (padding_field
) = t
;
6296 DECL_ARTIFICIAL (padding_field
) = 1;
6297 DECL_IGNORED_P (padding_field
) = 1;
6298 layout_nonempty_base_or_field (rli
, padding_field
,
6300 empty_base_offsets
);
6303 last_field_was_bitfield
= DECL_C_BIT_FIELD (field
);
6306 if (abi_version_at_least (2) && !integer_zerop (rli
->bitpos
))
6308 /* Make sure that we are on a byte boundary so that the size of
6309 the class without virtual bases will always be a round number
6311 rli
->bitpos
= round_up_loc (input_location
, rli
->bitpos
, BITS_PER_UNIT
);
6312 normalize_rli (rli
);
6315 /* G++ 3.2 does not allow virtual bases to be overlaid with tail
6317 if (!abi_version_at_least (2))
6318 include_empty_classes(rli
);
6320 /* Delete all zero-width bit-fields from the list of fields. Now
6321 that the type is laid out they are no longer important. */
6322 remove_zero_width_bit_fields (t
);
6324 /* Create the version of T used for virtual bases. We do not use
6325 make_class_type for this version; this is an artificial type. For
6326 a POD type, we just reuse T. */
6327 if (CLASSTYPE_NON_LAYOUT_POD_P (t
) || CLASSTYPE_EMPTY_P (t
))
6329 base_t
= make_node (TREE_CODE (t
));
6331 /* Set the size and alignment for the new type. In G++ 3.2, all
6332 empty classes were considered to have size zero when used as
6334 if (!abi_version_at_least (2) && CLASSTYPE_EMPTY_P (t
))
6336 TYPE_SIZE (base_t
) = bitsize_zero_node
;
6337 TYPE_SIZE_UNIT (base_t
) = size_zero_node
;
6338 if (warn_abi
&& !integer_zerop (rli_size_unit_so_far (rli
)))
6340 "layout of classes derived from empty class %qT "
6341 "may change in a future version of GCC",
6348 /* If the ABI version is not at least two, and the last
6349 field was a bit-field, RLI may not be on a byte
6350 boundary. In particular, rli_size_unit_so_far might
6351 indicate the last complete byte, while rli_size_so_far
6352 indicates the total number of bits used. Therefore,
6353 rli_size_so_far, rather than rli_size_unit_so_far, is
6354 used to compute TYPE_SIZE_UNIT. */
6355 eoc
= end_of_class (t
, /*include_virtuals_p=*/0);
6356 TYPE_SIZE_UNIT (base_t
)
6357 = size_binop (MAX_EXPR
,
6359 size_binop (CEIL_DIV_EXPR
,
6360 rli_size_so_far (rli
),
6361 bitsize_int (BITS_PER_UNIT
))),
6364 = size_binop (MAX_EXPR
,
6365 rli_size_so_far (rli
),
6366 size_binop (MULT_EXPR
,
6367 convert (bitsizetype
, eoc
),
6368 bitsize_int (BITS_PER_UNIT
)));
6370 TYPE_ALIGN (base_t
) = rli
->record_align
;
6371 TYPE_USER_ALIGN (base_t
) = TYPE_USER_ALIGN (t
);
6373 /* Copy the fields from T. */
6374 next_field
= &TYPE_FIELDS (base_t
);
6375 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
6376 if (TREE_CODE (field
) == FIELD_DECL
)
6378 *next_field
= build_decl (input_location
,
6382 DECL_CONTEXT (*next_field
) = base_t
;
6383 DECL_FIELD_OFFSET (*next_field
) = DECL_FIELD_OFFSET (field
);
6384 DECL_FIELD_BIT_OFFSET (*next_field
)
6385 = DECL_FIELD_BIT_OFFSET (field
);
6386 DECL_SIZE (*next_field
) = DECL_SIZE (field
);
6387 DECL_MODE (*next_field
) = DECL_MODE (field
);
6388 next_field
= &DECL_CHAIN (*next_field
);
6391 /* Record the base version of the type. */
6392 CLASSTYPE_AS_BASE (t
) = base_t
;
6393 TYPE_CONTEXT (base_t
) = t
;
6396 CLASSTYPE_AS_BASE (t
) = t
;
6398 /* Every empty class contains an empty class. */
6399 if (CLASSTYPE_EMPTY_P (t
))
6400 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 1;
6402 /* Set the TYPE_DECL for this type to contain the right
6403 value for DECL_OFFSET, so that we can use it as part
6404 of a COMPONENT_REF for multiple inheritance. */
6405 layout_decl (TYPE_MAIN_DECL (t
), 0);
6407 /* Now fix up any virtual base class types that we left lying
6408 around. We must get these done before we try to lay out the
6409 virtual function table. As a side-effect, this will remove the
6410 base subobject fields. */
6411 layout_virtual_bases (rli
, empty_base_offsets
);
6413 /* Make sure that empty classes are reflected in RLI at this
6415 include_empty_classes(rli
);
6417 /* Make sure not to create any structures with zero size. */
6418 if (integer_zerop (rli_size_unit_so_far (rli
)) && CLASSTYPE_EMPTY_P (t
))
6420 build_decl (input_location
,
6421 FIELD_DECL
, NULL_TREE
, char_type_node
));
6423 /* If this is a non-POD, declaring it packed makes a difference to how it
6424 can be used as a field; don't let finalize_record_size undo it. */
6425 if (TYPE_PACKED (t
) && !layout_pod_type_p (t
))
6426 rli
->packed_maybe_necessary
= true;
6428 /* Let the back end lay out the type. */
6429 finish_record_layout (rli
, /*free_p=*/true);
6431 if (TYPE_SIZE_UNIT (t
)
6432 && TREE_CODE (TYPE_SIZE_UNIT (t
)) == INTEGER_CST
6433 && !TREE_OVERFLOW (TYPE_SIZE_UNIT (t
))
6434 && !valid_constant_size_p (TYPE_SIZE_UNIT (t
)))
6435 error ("type %qT is too large", t
);
6437 /* Warn about bases that can't be talked about due to ambiguity. */
6438 warn_about_ambiguous_bases (t
);
6440 /* Now that we're done with layout, give the base fields the real types. */
6441 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
6442 if (DECL_ARTIFICIAL (field
) && IS_FAKE_BASE_TYPE (TREE_TYPE (field
)))
6443 TREE_TYPE (field
) = TYPE_CONTEXT (TREE_TYPE (field
));
6446 splay_tree_delete (empty_base_offsets
);
6448 if (CLASSTYPE_EMPTY_P (t
)
6449 && tree_int_cst_lt (sizeof_biggest_empty_class
,
6450 TYPE_SIZE_UNIT (t
)))
6451 sizeof_biggest_empty_class
= TYPE_SIZE_UNIT (t
);
6454 /* Determine the "key method" for the class type indicated by TYPE,
6455 and set CLASSTYPE_KEY_METHOD accordingly. */
6458 determine_key_method (tree type
)
6462 if (TYPE_FOR_JAVA (type
)
6463 || processing_template_decl
6464 || CLASSTYPE_TEMPLATE_INSTANTIATION (type
)
6465 || CLASSTYPE_INTERFACE_KNOWN (type
))
6468 /* The key method is the first non-pure virtual function that is not
6469 inline at the point of class definition. On some targets the
6470 key function may not be inline; those targets should not call
6471 this function until the end of the translation unit. */
6472 for (method
= TYPE_METHODS (type
); method
!= NULL_TREE
;
6473 method
= DECL_CHAIN (method
))
6474 if (DECL_VINDEX (method
) != NULL_TREE
6475 && ! DECL_DECLARED_INLINE_P (method
)
6476 && ! DECL_PURE_VIRTUAL_P (method
))
6478 CLASSTYPE_KEY_METHOD (type
) = method
;
6486 /* Allocate and return an instance of struct sorted_fields_type with
6489 static struct sorted_fields_type
*
6490 sorted_fields_type_new (int n
)
6492 struct sorted_fields_type
*sft
;
6493 sft
= ggc_alloc_sorted_fields_type (sizeof (struct sorted_fields_type
)
6494 + n
* sizeof (tree
));
6501 /* Perform processing required when the definition of T (a class type)
6505 finish_struct_1 (tree t
)
6508 /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */
6509 tree virtuals
= NULL_TREE
;
6511 if (COMPLETE_TYPE_P (t
))
6513 gcc_assert (MAYBE_CLASS_TYPE_P (t
));
6514 error ("redefinition of %q#T", t
);
6519 /* If this type was previously laid out as a forward reference,
6520 make sure we lay it out again. */
6521 TYPE_SIZE (t
) = NULL_TREE
;
6522 CLASSTYPE_PRIMARY_BINFO (t
) = NULL_TREE
;
6524 /* Make assumptions about the class; we'll reset the flags if
6526 CLASSTYPE_EMPTY_P (t
) = 1;
6527 CLASSTYPE_NEARLY_EMPTY_P (t
) = 1;
6528 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 0;
6529 CLASSTYPE_LITERAL_P (t
) = true;
6531 /* Do end-of-class semantic processing: checking the validity of the
6532 bases and members and add implicitly generated methods. */
6533 check_bases_and_members (t
);
6535 /* Find the key method. */
6536 if (TYPE_CONTAINS_VPTR_P (t
))
6538 /* The Itanium C++ ABI permits the key method to be chosen when
6539 the class is defined -- even though the key method so
6540 selected may later turn out to be an inline function. On
6541 some systems (such as ARM Symbian OS) the key method cannot
6542 be determined until the end of the translation unit. On such
6543 systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which
6544 will cause the class to be added to KEYED_CLASSES. Then, in
6545 finish_file we will determine the key method. */
6546 if (targetm
.cxx
.key_method_may_be_inline ())
6547 determine_key_method (t
);
6549 /* If a polymorphic class has no key method, we may emit the vtable
6550 in every translation unit where the class definition appears. */
6551 if (CLASSTYPE_KEY_METHOD (t
) == NULL_TREE
)
6552 keyed_classes
= tree_cons (NULL_TREE
, t
, keyed_classes
);
6555 /* Layout the class itself. */
6556 layout_class_type (t
, &virtuals
);
6557 if (CLASSTYPE_AS_BASE (t
) != t
)
6558 /* We use the base type for trivial assignments, and hence it
6560 compute_record_mode (CLASSTYPE_AS_BASE (t
));
6562 virtuals
= modify_all_vtables (t
, nreverse (virtuals
));
6564 /* If necessary, create the primary vtable for this class. */
6565 if (virtuals
|| TYPE_CONTAINS_VPTR_P (t
))
6567 /* We must enter these virtuals into the table. */
6568 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
6569 build_primary_vtable (NULL_TREE
, t
);
6570 else if (! BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (t
)))
6571 /* Here we know enough to change the type of our virtual
6572 function table, but we will wait until later this function. */
6573 build_primary_vtable (CLASSTYPE_PRIMARY_BINFO (t
), t
);
6575 /* If we're warning about ABI tags, check the types of the new
6576 virtual functions. */
6578 for (tree v
= virtuals
; v
; v
= TREE_CHAIN (v
))
6579 check_abi_tags (t
, TREE_VALUE (v
));
6582 if (TYPE_CONTAINS_VPTR_P (t
))
6587 if (BINFO_VTABLE (TYPE_BINFO (t
)))
6588 gcc_assert (DECL_VIRTUAL_P (BINFO_VTABLE (TYPE_BINFO (t
))));
6589 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
6590 gcc_assert (BINFO_VIRTUALS (TYPE_BINFO (t
)) == NULL_TREE
);
6592 /* Add entries for virtual functions introduced by this class. */
6593 BINFO_VIRTUALS (TYPE_BINFO (t
))
6594 = chainon (BINFO_VIRTUALS (TYPE_BINFO (t
)), virtuals
);
6596 /* Set DECL_VINDEX for all functions declared in this class. */
6597 for (vindex
= 0, fn
= BINFO_VIRTUALS (TYPE_BINFO (t
));
6599 fn
= TREE_CHAIN (fn
),
6600 vindex
+= (TARGET_VTABLE_USES_DESCRIPTORS
6601 ? TARGET_VTABLE_USES_DESCRIPTORS
: 1))
6603 tree fndecl
= BV_FN (fn
);
6605 if (DECL_THUNK_P (fndecl
))
6606 /* A thunk. We should never be calling this entry directly
6607 from this vtable -- we'd use the entry for the non
6608 thunk base function. */
6609 DECL_VINDEX (fndecl
) = NULL_TREE
;
6610 else if (TREE_CODE (DECL_VINDEX (fndecl
)) != INTEGER_CST
)
6611 DECL_VINDEX (fndecl
) = build_int_cst (NULL_TREE
, vindex
);
6615 finish_struct_bits (t
);
6616 set_method_tm_attributes (t
);
6618 /* Complete the rtl for any static member objects of the type we're
6620 for (x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
6621 if (VAR_P (x
) && TREE_STATIC (x
)
6622 && TREE_TYPE (x
) != error_mark_node
6623 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (x
)), t
))
6624 DECL_MODE (x
) = TYPE_MODE (t
);
6626 /* Done with FIELDS...now decide whether to sort these for
6627 faster lookups later.
6629 We use a small number because most searches fail (succeeding
6630 ultimately as the search bores through the inheritance
6631 hierarchy), and we want this failure to occur quickly. */
6633 insert_into_classtype_sorted_fields (TYPE_FIELDS (t
), t
, 8);
6635 /* Complain if one of the field types requires lower visibility. */
6636 constrain_class_visibility (t
);
6638 /* Make the rtl for any new vtables we have created, and unmark
6639 the base types we marked. */
6642 /* Build the VTT for T. */
6645 /* This warning does not make sense for Java classes, since they
6646 cannot have destructors. */
6647 if (!TYPE_FOR_JAVA (t
) && warn_nonvdtor
6648 && TYPE_POLYMORPHIC_P (t
) && accessible_nvdtor_p (t
))
6649 warning (OPT_Wnon_virtual_dtor
,
6650 "%q#T has virtual functions and accessible"
6651 " non-virtual destructor", t
);
6655 if (warn_overloaded_virtual
)
6658 /* Class layout, assignment of virtual table slots, etc., is now
6659 complete. Give the back end a chance to tweak the visibility of
6660 the class or perform any other required target modifications. */
6661 targetm
.cxx
.adjust_class_at_definition (t
);
6663 maybe_suppress_debug_info (t
);
6665 if (flag_vtable_verify
)
6666 vtv_save_class_info (t
);
6668 dump_class_hierarchy (t
);
6670 /* Finish debugging output for this type. */
6671 rest_of_type_compilation (t
, ! LOCAL_CLASS_P (t
));
6673 if (TYPE_TRANSPARENT_AGGR (t
))
6675 tree field
= first_field (t
);
6676 if (field
== NULL_TREE
|| error_operand_p (field
))
6678 error ("type transparent %q#T does not have any fields", t
);
6679 TYPE_TRANSPARENT_AGGR (t
) = 0;
6681 else if (DECL_ARTIFICIAL (field
))
6683 if (DECL_FIELD_IS_BASE (field
))
6684 error ("type transparent class %qT has base classes", t
);
6687 gcc_checking_assert (DECL_VIRTUAL_P (field
));
6688 error ("type transparent class %qT has virtual functions", t
);
6690 TYPE_TRANSPARENT_AGGR (t
) = 0;
6692 else if (TYPE_MODE (t
) != DECL_MODE (field
))
6694 error ("type transparent %q#T cannot be made transparent because "
6695 "the type of the first field has a different ABI from the "
6696 "class overall", t
);
6697 TYPE_TRANSPARENT_AGGR (t
) = 0;
6702 /* Insert FIELDS into T for the sorted case if the FIELDS count is
6703 equal to THRESHOLD or greater than THRESHOLD. */
6706 insert_into_classtype_sorted_fields (tree fields
, tree t
, int threshold
)
6708 int n_fields
= count_fields (fields
);
6709 if (n_fields
>= threshold
)
6711 struct sorted_fields_type
*field_vec
= sorted_fields_type_new (n_fields
);
6712 add_fields_to_record_type (fields
, field_vec
, 0);
6713 qsort (field_vec
->elts
, n_fields
, sizeof (tree
), field_decl_cmp
);
6714 CLASSTYPE_SORTED_FIELDS (t
) = field_vec
;
6718 /* Insert lately defined enum ENUMTYPE into T for the sorted case. */
6721 insert_late_enum_def_into_classtype_sorted_fields (tree enumtype
, tree t
)
6723 struct sorted_fields_type
*sorted_fields
= CLASSTYPE_SORTED_FIELDS (t
);
6728 = list_length (TYPE_VALUES (enumtype
)) + sorted_fields
->len
;
6729 struct sorted_fields_type
*field_vec
= sorted_fields_type_new (n_fields
);
6731 for (i
= 0; i
< sorted_fields
->len
; ++i
)
6732 field_vec
->elts
[i
] = sorted_fields
->elts
[i
];
6734 add_enum_fields_to_record_type (enumtype
, field_vec
,
6735 sorted_fields
->len
);
6736 qsort (field_vec
->elts
, n_fields
, sizeof (tree
), field_decl_cmp
);
6737 CLASSTYPE_SORTED_FIELDS (t
) = field_vec
;
6741 /* When T was built up, the member declarations were added in reverse
6742 order. Rearrange them to declaration order. */
6745 unreverse_member_declarations (tree t
)
6751 /* The following lists are all in reverse order. Put them in
6752 declaration order now. */
6753 TYPE_METHODS (t
) = nreverse (TYPE_METHODS (t
));
6754 CLASSTYPE_DECL_LIST (t
) = nreverse (CLASSTYPE_DECL_LIST (t
));
6756 /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in
6757 reverse order, so we can't just use nreverse. */
6759 for (x
= TYPE_FIELDS (t
);
6760 x
&& TREE_CODE (x
) != TYPE_DECL
;
6763 next
= DECL_CHAIN (x
);
6764 DECL_CHAIN (x
) = prev
;
6769 DECL_CHAIN (TYPE_FIELDS (t
)) = x
;
6771 TYPE_FIELDS (t
) = prev
;
6776 finish_struct (tree t
, tree attributes
)
6778 location_t saved_loc
= input_location
;
6780 /* Now that we've got all the field declarations, reverse everything
6782 unreverse_member_declarations (t
);
6784 cplus_decl_attributes (&t
, attributes
, (int) ATTR_FLAG_TYPE_IN_PLACE
);
6786 /* Nadger the current location so that diagnostics point to the start of
6787 the struct, not the end. */
6788 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (t
));
6790 if (processing_template_decl
)
6794 finish_struct_methods (t
);
6795 TYPE_SIZE (t
) = bitsize_zero_node
;
6796 TYPE_SIZE_UNIT (t
) = size_zero_node
;
6798 /* We need to emit an error message if this type was used as a parameter
6799 and it is an abstract type, even if it is a template. We construct
6800 a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into
6801 account and we call complete_vars with this type, which will check
6802 the PARM_DECLS. Note that while the type is being defined,
6803 CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends
6804 (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */
6805 CLASSTYPE_PURE_VIRTUALS (t
) = NULL
;
6806 for (x
= TYPE_METHODS (t
); x
; x
= DECL_CHAIN (x
))
6807 if (DECL_PURE_VIRTUAL_P (x
))
6808 vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t
), x
);
6810 /* We need to add the target functions to the CLASSTYPE_METHOD_VEC if
6811 an enclosing scope is a template class, so that this function be
6812 found by lookup_fnfields_1 when the using declaration is not
6813 instantiated yet. */
6814 for (x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
6815 if (TREE_CODE (x
) == USING_DECL
)
6817 tree fn
= strip_using_decl (x
);
6818 if (is_overloaded_fn (fn
))
6819 for (; fn
; fn
= OVL_NEXT (fn
))
6820 add_method (t
, OVL_CURRENT (fn
), x
);
6823 /* Remember current #pragma pack value. */
6824 TYPE_PRECISION (t
) = maximum_field_alignment
;
6826 /* Fix up any variants we've already built. */
6827 for (x
= TYPE_NEXT_VARIANT (t
); x
; x
= TYPE_NEXT_VARIANT (x
))
6829 TYPE_SIZE (x
) = TYPE_SIZE (t
);
6830 TYPE_SIZE_UNIT (x
) = TYPE_SIZE_UNIT (t
);
6831 TYPE_FIELDS (x
) = TYPE_FIELDS (t
);
6832 TYPE_METHODS (x
) = TYPE_METHODS (t
);
6836 finish_struct_1 (t
);
6838 input_location
= saved_loc
;
6840 TYPE_BEING_DEFINED (t
) = 0;
6842 if (current_class_type
)
6845 error ("trying to finish struct, but kicked out due to previous parse errors");
6847 if (processing_template_decl
&& at_function_scope_p ()
6848 /* Lambdas are defined by the LAMBDA_EXPR. */
6849 && !LAMBDA_TYPE_P (t
))
6850 add_stmt (build_min (TAG_DEFN
, t
));
6855 /* Hash table to avoid endless recursion when handling references. */
6856 static hash_table
<pointer_hash
<tree_node
> > fixed_type_or_null_ref_ht
;
6858 /* Return the dynamic type of INSTANCE, if known.
6859 Used to determine whether the virtual function table is needed
6862 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
6863 of our knowledge of its type. *NONNULL should be initialized
6864 before this function is called. */
6867 fixed_type_or_null (tree instance
, int *nonnull
, int *cdtorp
)
6869 #define RECUR(T) fixed_type_or_null((T), nonnull, cdtorp)
6871 switch (TREE_CODE (instance
))
6874 if (POINTER_TYPE_P (TREE_TYPE (instance
)))
6877 return RECUR (TREE_OPERAND (instance
, 0));
6880 /* This is a call to a constructor, hence it's never zero. */
6881 if (TREE_HAS_CONSTRUCTOR (instance
))
6885 return TREE_TYPE (instance
);
6890 /* This is a call to a constructor, hence it's never zero. */
6891 if (TREE_HAS_CONSTRUCTOR (instance
))
6895 return TREE_TYPE (instance
);
6897 return RECUR (TREE_OPERAND (instance
, 0));
6899 case POINTER_PLUS_EXPR
:
6902 if (TREE_CODE (TREE_OPERAND (instance
, 0)) == ADDR_EXPR
)
6903 return RECUR (TREE_OPERAND (instance
, 0));
6904 if (TREE_CODE (TREE_OPERAND (instance
, 1)) == INTEGER_CST
)
6905 /* Propagate nonnull. */
6906 return RECUR (TREE_OPERAND (instance
, 0));
6911 return RECUR (TREE_OPERAND (instance
, 0));
6914 instance
= TREE_OPERAND (instance
, 0);
6917 /* Just because we see an ADDR_EXPR doesn't mean we're dealing
6918 with a real object -- given &p->f, p can still be null. */
6919 tree t
= get_base_address (instance
);
6920 /* ??? Probably should check DECL_WEAK here. */
6921 if (t
&& DECL_P (t
))
6924 return RECUR (instance
);
6927 /* If this component is really a base class reference, then the field
6928 itself isn't definitive. */
6929 if (DECL_FIELD_IS_BASE (TREE_OPERAND (instance
, 1)))
6930 return RECUR (TREE_OPERAND (instance
, 0));
6931 return RECUR (TREE_OPERAND (instance
, 1));
6935 if (TREE_CODE (TREE_TYPE (instance
)) == ARRAY_TYPE
6936 && MAYBE_CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (instance
))))
6940 return TREE_TYPE (TREE_TYPE (instance
));
6942 /* fall through... */
6946 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (instance
)))
6950 return TREE_TYPE (instance
);
6952 else if (instance
== current_class_ptr
)
6957 /* if we're in a ctor or dtor, we know our type. If
6958 current_class_ptr is set but we aren't in a function, we're in
6959 an NSDMI (and therefore a constructor). */
6960 if (current_scope () != current_function_decl
6961 || (DECL_LANG_SPECIFIC (current_function_decl
)
6962 && (DECL_CONSTRUCTOR_P (current_function_decl
)
6963 || DECL_DESTRUCTOR_P (current_function_decl
))))
6967 return TREE_TYPE (TREE_TYPE (instance
));
6970 else if (TREE_CODE (TREE_TYPE (instance
)) == REFERENCE_TYPE
)
6972 /* We only need one hash table because it is always left empty. */
6973 if (!fixed_type_or_null_ref_ht
.is_created ())
6974 fixed_type_or_null_ref_ht
.create (37);
6976 /* Reference variables should be references to objects. */
6980 /* Enter the INSTANCE in a table to prevent recursion; a
6981 variable's initializer may refer to the variable
6983 if (VAR_P (instance
)
6984 && DECL_INITIAL (instance
)
6985 && !type_dependent_expression_p_push (DECL_INITIAL (instance
))
6986 && !fixed_type_or_null_ref_ht
.find (instance
))
6991 slot
= fixed_type_or_null_ref_ht
.find_slot (instance
, INSERT
);
6993 type
= RECUR (DECL_INITIAL (instance
));
6994 fixed_type_or_null_ref_ht
.remove_elt (instance
);
7007 /* Return nonzero if the dynamic type of INSTANCE is known, and
7008 equivalent to the static type. We also handle the case where
7009 INSTANCE is really a pointer. Return negative if this is a
7010 ctor/dtor. There the dynamic type is known, but this might not be
7011 the most derived base of the original object, and hence virtual
7012 bases may not be laid out according to this type.
7014 Used to determine whether the virtual function table is needed
7017 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
7018 of our knowledge of its type. *NONNULL should be initialized
7019 before this function is called. */
7022 resolves_to_fixed_type_p (tree instance
, int* nonnull
)
7024 tree t
= TREE_TYPE (instance
);
7028 /* processing_template_decl can be false in a template if we're in
7029 fold_non_dependent_expr, but we still want to suppress this check. */
7030 if (in_template_function ())
7032 /* In a template we only care about the type of the result. */
7038 fixed
= fixed_type_or_null (instance
, nonnull
, &cdtorp
);
7039 if (fixed
== NULL_TREE
)
7041 if (POINTER_TYPE_P (t
))
7043 if (!same_type_ignoring_top_level_qualifiers_p (t
, fixed
))
7045 return cdtorp
? -1 : 1;
7050 init_class_processing (void)
7052 current_class_depth
= 0;
7053 current_class_stack_size
= 10;
7055 = XNEWVEC (struct class_stack_node
, current_class_stack_size
);
7056 vec_alloc (local_classes
, 8);
7057 sizeof_biggest_empty_class
= size_zero_node
;
7059 ridpointers
[(int) RID_PUBLIC
] = access_public_node
;
7060 ridpointers
[(int) RID_PRIVATE
] = access_private_node
;
7061 ridpointers
[(int) RID_PROTECTED
] = access_protected_node
;
7064 /* Restore the cached PREVIOUS_CLASS_LEVEL. */
7067 restore_class_cache (void)
7071 /* We are re-entering the same class we just left, so we don't
7072 have to search the whole inheritance matrix to find all the
7073 decls to bind again. Instead, we install the cached
7074 class_shadowed list and walk through it binding names. */
7075 push_binding_level (previous_class_level
);
7076 class_binding_level
= previous_class_level
;
7077 /* Restore IDENTIFIER_TYPE_VALUE. */
7078 for (type
= class_binding_level
->type_shadowed
;
7080 type
= TREE_CHAIN (type
))
7081 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (type
), TREE_TYPE (type
));
7084 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as
7085 appropriate for TYPE.
7087 So that we may avoid calls to lookup_name, we cache the _TYPE
7088 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
7090 For multiple inheritance, we perform a two-pass depth-first search
7091 of the type lattice. */
7094 pushclass (tree type
)
7096 class_stack_node_t csn
;
7098 type
= TYPE_MAIN_VARIANT (type
);
7100 /* Make sure there is enough room for the new entry on the stack. */
7101 if (current_class_depth
+ 1 >= current_class_stack_size
)
7103 current_class_stack_size
*= 2;
7105 = XRESIZEVEC (struct class_stack_node
, current_class_stack
,
7106 current_class_stack_size
);
7109 /* Insert a new entry on the class stack. */
7110 csn
= current_class_stack
+ current_class_depth
;
7111 csn
->name
= current_class_name
;
7112 csn
->type
= current_class_type
;
7113 csn
->access
= current_access_specifier
;
7114 csn
->names_used
= 0;
7116 current_class_depth
++;
7118 /* Now set up the new type. */
7119 current_class_name
= TYPE_NAME (type
);
7120 if (TREE_CODE (current_class_name
) == TYPE_DECL
)
7121 current_class_name
= DECL_NAME (current_class_name
);
7122 current_class_type
= type
;
7124 /* By default, things in classes are private, while things in
7125 structures or unions are public. */
7126 current_access_specifier
= (CLASSTYPE_DECLARED_CLASS (type
)
7127 ? access_private_node
7128 : access_public_node
);
7130 if (previous_class_level
7131 && type
!= previous_class_level
->this_entity
7132 && current_class_depth
== 1)
7134 /* Forcibly remove any old class remnants. */
7135 invalidate_class_lookup_cache ();
7138 if (!previous_class_level
7139 || type
!= previous_class_level
->this_entity
7140 || current_class_depth
> 1)
7143 restore_class_cache ();
7146 /* When we exit a toplevel class scope, we save its binding level so
7147 that we can restore it quickly. Here, we've entered some other
7148 class, so we must invalidate our cache. */
7151 invalidate_class_lookup_cache (void)
7153 previous_class_level
= NULL
;
7156 /* Get out of the current class scope. If we were in a class scope
7157 previously, that is the one popped to. */
7164 current_class_depth
--;
7165 current_class_name
= current_class_stack
[current_class_depth
].name
;
7166 current_class_type
= current_class_stack
[current_class_depth
].type
;
7167 current_access_specifier
= current_class_stack
[current_class_depth
].access
;
7168 if (current_class_stack
[current_class_depth
].names_used
)
7169 splay_tree_delete (current_class_stack
[current_class_depth
].names_used
);
7172 /* Mark the top of the class stack as hidden. */
7175 push_class_stack (void)
7177 if (current_class_depth
)
7178 ++current_class_stack
[current_class_depth
- 1].hidden
;
7181 /* Mark the top of the class stack as un-hidden. */
7184 pop_class_stack (void)
7186 if (current_class_depth
)
7187 --current_class_stack
[current_class_depth
- 1].hidden
;
7190 /* Returns 1 if the class type currently being defined is either T or
7191 a nested type of T. */
7194 currently_open_class (tree t
)
7198 if (!CLASS_TYPE_P (t
))
7201 t
= TYPE_MAIN_VARIANT (t
);
7203 /* We start looking from 1 because entry 0 is from global scope,
7205 for (i
= current_class_depth
; i
> 0; --i
)
7208 if (i
== current_class_depth
)
7209 c
= current_class_type
;
7212 if (current_class_stack
[i
].hidden
)
7214 c
= current_class_stack
[i
].type
;
7218 if (same_type_p (c
, t
))
7224 /* If either current_class_type or one of its enclosing classes are derived
7225 from T, return the appropriate type. Used to determine how we found
7226 something via unqualified lookup. */
7229 currently_open_derived_class (tree t
)
7233 /* The bases of a dependent type are unknown. */
7234 if (dependent_type_p (t
))
7237 if (!current_class_type
)
7240 if (DERIVED_FROM_P (t
, current_class_type
))
7241 return current_class_type
;
7243 for (i
= current_class_depth
- 1; i
> 0; --i
)
7245 if (current_class_stack
[i
].hidden
)
7247 if (DERIVED_FROM_P (t
, current_class_stack
[i
].type
))
7248 return current_class_stack
[i
].type
;
7254 /* Returns the innermost class type which is not a lambda closure type. */
7257 current_nonlambda_class_type (void)
7261 /* We start looking from 1 because entry 0 is from global scope,
7263 for (i
= current_class_depth
; i
> 0; --i
)
7266 if (i
== current_class_depth
)
7267 c
= current_class_type
;
7270 if (current_class_stack
[i
].hidden
)
7272 c
= current_class_stack
[i
].type
;
7276 if (!LAMBDA_TYPE_P (c
))
7282 /* When entering a class scope, all enclosing class scopes' names with
7283 static meaning (static variables, static functions, types and
7284 enumerators) have to be visible. This recursive function calls
7285 pushclass for all enclosing class contexts until global or a local
7286 scope is reached. TYPE is the enclosed class. */
7289 push_nested_class (tree type
)
7291 /* A namespace might be passed in error cases, like A::B:C. */
7292 if (type
== NULL_TREE
7293 || !CLASS_TYPE_P (type
))
7296 push_nested_class (DECL_CONTEXT (TYPE_MAIN_DECL (type
)));
7301 /* Undoes a push_nested_class call. */
7304 pop_nested_class (void)
7306 tree context
= DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type
));
7309 if (context
&& CLASS_TYPE_P (context
))
7310 pop_nested_class ();
7313 /* Returns the number of extern "LANG" blocks we are nested within. */
7316 current_lang_depth (void)
7318 return vec_safe_length (current_lang_base
);
7321 /* Set global variables CURRENT_LANG_NAME to appropriate value
7322 so that behavior of name-mangling machinery is correct. */
7325 push_lang_context (tree name
)
7327 vec_safe_push (current_lang_base
, current_lang_name
);
7329 if (name
== lang_name_cplusplus
)
7331 current_lang_name
= name
;
7333 else if (name
== lang_name_java
)
7335 current_lang_name
= name
;
7336 /* DECL_IGNORED_P is initially set for these types, to avoid clutter.
7337 (See record_builtin_java_type in decl.c.) However, that causes
7338 incorrect debug entries if these types are actually used.
7339 So we re-enable debug output after extern "Java". */
7340 DECL_IGNORED_P (TYPE_NAME (java_byte_type_node
)) = 0;
7341 DECL_IGNORED_P (TYPE_NAME (java_short_type_node
)) = 0;
7342 DECL_IGNORED_P (TYPE_NAME (java_int_type_node
)) = 0;
7343 DECL_IGNORED_P (TYPE_NAME (java_long_type_node
)) = 0;
7344 DECL_IGNORED_P (TYPE_NAME (java_float_type_node
)) = 0;
7345 DECL_IGNORED_P (TYPE_NAME (java_double_type_node
)) = 0;
7346 DECL_IGNORED_P (TYPE_NAME (java_char_type_node
)) = 0;
7347 DECL_IGNORED_P (TYPE_NAME (java_boolean_type_node
)) = 0;
7349 else if (name
== lang_name_c
)
7351 current_lang_name
= name
;
7354 error ("language string %<\"%E\"%> not recognized", name
);
7357 /* Get out of the current language scope. */
7360 pop_lang_context (void)
7362 current_lang_name
= current_lang_base
->pop ();
7365 /* Type instantiation routines. */
7367 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
7368 matches the TARGET_TYPE. If there is no satisfactory match, return
7369 error_mark_node, and issue an error & warning messages under
7370 control of FLAGS. Permit pointers to member function if FLAGS
7371 permits. If TEMPLATE_ONLY, the name of the overloaded function was
7372 a template-id, and EXPLICIT_TARGS are the explicitly provided
7375 If OVERLOAD is for one or more member functions, then ACCESS_PATH
7376 is the base path used to reference those member functions. If
7377 the address is resolved to a member function, access checks will be
7378 performed and errors issued if appropriate. */
7381 resolve_address_of_overloaded_function (tree target_type
,
7383 tsubst_flags_t flags
,
7385 tree explicit_targs
,
7388 /* Here's what the standard says:
7392 If the name is a function template, template argument deduction
7393 is done, and if the argument deduction succeeds, the deduced
7394 arguments are used to generate a single template function, which
7395 is added to the set of overloaded functions considered.
7397 Non-member functions and static member functions match targets of
7398 type "pointer-to-function" or "reference-to-function." Nonstatic
7399 member functions match targets of type "pointer-to-member
7400 function;" the function type of the pointer to member is used to
7401 select the member function from the set of overloaded member
7402 functions. If a nonstatic member function is selected, the
7403 reference to the overloaded function name is required to have the
7404 form of a pointer to member as described in 5.3.1.
7406 If more than one function is selected, any template functions in
7407 the set are eliminated if the set also contains a non-template
7408 function, and any given template function is eliminated if the
7409 set contains a second template function that is more specialized
7410 than the first according to the partial ordering rules 14.5.5.2.
7411 After such eliminations, if any, there shall remain exactly one
7412 selected function. */
7415 /* We store the matches in a TREE_LIST rooted here. The functions
7416 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
7417 interoperability with most_specialized_instantiation. */
7418 tree matches
= NULL_TREE
;
7420 tree target_fn_type
;
7422 /* By the time we get here, we should be seeing only real
7423 pointer-to-member types, not the internal POINTER_TYPE to
7424 METHOD_TYPE representation. */
7425 gcc_assert (!TYPE_PTR_P (target_type
)
7426 || TREE_CODE (TREE_TYPE (target_type
)) != METHOD_TYPE
);
7428 gcc_assert (is_overloaded_fn (overload
));
7430 /* Check that the TARGET_TYPE is reasonable. */
7431 if (TYPE_PTRFN_P (target_type
)
7432 || TYPE_REFFN_P (target_type
))
7434 else if (TYPE_PTRMEMFUNC_P (target_type
))
7435 /* This is OK, too. */
7437 else if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
7438 /* This is OK, too. This comes from a conversion to reference
7440 target_type
= build_reference_type (target_type
);
7443 if (flags
& tf_error
)
7444 error ("cannot resolve overloaded function %qD based on"
7445 " conversion to type %qT",
7446 DECL_NAME (OVL_FUNCTION (overload
)), target_type
);
7447 return error_mark_node
;
7450 /* Non-member functions and static member functions match targets of type
7451 "pointer-to-function" or "reference-to-function." Nonstatic member
7452 functions match targets of type "pointer-to-member-function;" the
7453 function type of the pointer to member is used to select the member
7454 function from the set of overloaded member functions.
7456 So figure out the FUNCTION_TYPE that we want to match against. */
7457 target_fn_type
= static_fn_type (target_type
);
7459 /* If we can find a non-template function that matches, we can just
7460 use it. There's no point in generating template instantiations
7461 if we're just going to throw them out anyhow. But, of course, we
7462 can only do this when we don't *need* a template function. */
7467 for (fns
= overload
; fns
; fns
= OVL_NEXT (fns
))
7469 tree fn
= OVL_CURRENT (fns
);
7471 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
7472 /* We're not looking for templates just yet. */
7475 if ((TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7477 /* We're looking for a non-static member, and this isn't
7478 one, or vice versa. */
7481 /* Ignore functions which haven't been explicitly
7483 if (DECL_ANTICIPATED (fn
))
7486 /* See if there's a match. */
7487 if (same_type_p (target_fn_type
, static_fn_type (fn
)))
7488 matches
= tree_cons (fn
, NULL_TREE
, matches
);
7492 /* Now, if we've already got a match (or matches), there's no need
7493 to proceed to the template functions. But, if we don't have a
7494 match we need to look at them, too. */
7497 tree target_arg_types
;
7498 tree target_ret_type
;
7501 unsigned int nargs
, ia
;
7504 target_arg_types
= TYPE_ARG_TYPES (target_fn_type
);
7505 target_ret_type
= TREE_TYPE (target_fn_type
);
7507 nargs
= list_length (target_arg_types
);
7508 args
= XALLOCAVEC (tree
, nargs
);
7509 for (arg
= target_arg_types
, ia
= 0;
7510 arg
!= NULL_TREE
&& arg
!= void_list_node
;
7511 arg
= TREE_CHAIN (arg
), ++ia
)
7512 args
[ia
] = TREE_VALUE (arg
);
7515 for (fns
= overload
; fns
; fns
= OVL_NEXT (fns
))
7517 tree fn
= OVL_CURRENT (fns
);
7521 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7522 /* We're only looking for templates. */
7525 if ((TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7527 /* We're not looking for a non-static member, and this is
7528 one, or vice versa. */
7531 tree ret
= target_ret_type
;
7533 /* If the template has a deduced return type, don't expose it to
7534 template argument deduction. */
7535 if (undeduced_auto_decl (fn
))
7538 /* Try to do argument deduction. */
7539 targs
= make_tree_vec (DECL_NTPARMS (fn
));
7540 instantiation
= fn_type_unification (fn
, explicit_targs
, targs
, args
,
7542 DEDUCE_EXACT
, LOOKUP_NORMAL
,
7544 if (instantiation
== error_mark_node
)
7545 /* Instantiation failed. */
7548 /* And now force instantiation to do return type deduction. */
7549 if (undeduced_auto_decl (instantiation
))
7552 instantiate_decl (instantiation
, /*defer*/false, /*class*/false);
7555 require_deduced_type (instantiation
);
7558 /* See if there's a match. */
7559 if (same_type_p (target_fn_type
, static_fn_type (instantiation
)))
7560 matches
= tree_cons (instantiation
, fn
, matches
);
7563 /* Now, remove all but the most specialized of the matches. */
7566 tree match
= most_specialized_instantiation (matches
);
7568 if (match
!= error_mark_node
)
7569 matches
= tree_cons (TREE_PURPOSE (match
),
7575 /* Now we should have exactly one function in MATCHES. */
7576 if (matches
== NULL_TREE
)
7578 /* There were *no* matches. */
7579 if (flags
& tf_error
)
7581 error ("no matches converting function %qD to type %q#T",
7582 DECL_NAME (OVL_CURRENT (overload
)),
7585 print_candidates (overload
);
7587 return error_mark_node
;
7589 else if (TREE_CHAIN (matches
))
7591 /* There were too many matches. First check if they're all
7592 the same function. */
7593 tree match
= NULL_TREE
;
7595 fn
= TREE_PURPOSE (matches
);
7597 /* For multi-versioned functions, more than one match is just fine and
7598 decls_match will return false as they are different. */
7599 for (match
= TREE_CHAIN (matches
); match
; match
= TREE_CHAIN (match
))
7600 if (!decls_match (fn
, TREE_PURPOSE (match
))
7601 && !targetm
.target_option
.function_versions
7602 (fn
, TREE_PURPOSE (match
)))
7607 if (flags
& tf_error
)
7609 error ("converting overloaded function %qD to type %q#T is ambiguous",
7610 DECL_NAME (OVL_FUNCTION (overload
)),
7613 /* Since print_candidates expects the functions in the
7614 TREE_VALUE slot, we flip them here. */
7615 for (match
= matches
; match
; match
= TREE_CHAIN (match
))
7616 TREE_VALUE (match
) = TREE_PURPOSE (match
);
7618 print_candidates (matches
);
7621 return error_mark_node
;
7625 /* Good, exactly one match. Now, convert it to the correct type. */
7626 fn
= TREE_PURPOSE (matches
);
7628 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
7629 && !(flags
& tf_ptrmem_ok
) && !flag_ms_extensions
)
7631 static int explained
;
7633 if (!(flags
& tf_error
))
7634 return error_mark_node
;
7636 permerror (input_location
, "assuming pointer to member %qD", fn
);
7639 inform (input_location
, "(a pointer to member can only be formed with %<&%E%>)", fn
);
7644 /* If a pointer to a function that is multi-versioned is requested, the
7645 pointer to the dispatcher function is returned instead. This works
7646 well because indirectly calling the function will dispatch the right
7647 function version at run-time. */
7648 if (DECL_FUNCTION_VERSIONED (fn
))
7650 fn
= get_function_version_dispatcher (fn
);
7652 return error_mark_node
;
7653 /* Mark all the versions corresponding to the dispatcher as used. */
7654 if (!(flags
& tf_conv
))
7655 mark_versions_used (fn
);
7658 /* If we're doing overload resolution purely for the purpose of
7659 determining conversion sequences, we should not consider the
7660 function used. If this conversion sequence is selected, the
7661 function will be marked as used at this point. */
7662 if (!(flags
& tf_conv
))
7664 /* Make =delete work with SFINAE. */
7665 if (DECL_DELETED_FN (fn
) && !(flags
& tf_error
))
7666 return error_mark_node
;
7671 /* We could not check access to member functions when this
7672 expression was originally created since we did not know at that
7673 time to which function the expression referred. */
7674 if (DECL_FUNCTION_MEMBER_P (fn
))
7676 gcc_assert (access_path
);
7677 perform_or_defer_access_check (access_path
, fn
, fn
, flags
);
7680 if (TYPE_PTRFN_P (target_type
) || TYPE_PTRMEMFUNC_P (target_type
))
7681 return cp_build_addr_expr (fn
, flags
);
7684 /* The target must be a REFERENCE_TYPE. Above, cp_build_unary_op
7685 will mark the function as addressed, but here we must do it
7687 cxx_mark_addressable (fn
);
7693 /* This function will instantiate the type of the expression given in
7694 RHS to match the type of LHSTYPE. If errors exist, then return
7695 error_mark_node. FLAGS is a bit mask. If TF_ERROR is set, then
7696 we complain on errors. If we are not complaining, never modify rhs,
7697 as overload resolution wants to try many possible instantiations, in
7698 the hope that at least one will work.
7700 For non-recursive calls, LHSTYPE should be a function, pointer to
7701 function, or a pointer to member function. */
7704 instantiate_type (tree lhstype
, tree rhs
, tsubst_flags_t flags
)
7706 tsubst_flags_t flags_in
= flags
;
7707 tree access_path
= NULL_TREE
;
7709 flags
&= ~tf_ptrmem_ok
;
7711 if (lhstype
== unknown_type_node
)
7713 if (flags
& tf_error
)
7714 error ("not enough type information");
7715 return error_mark_node
;
7718 if (TREE_TYPE (rhs
) != NULL_TREE
&& ! (type_unknown_p (rhs
)))
7720 tree fntype
= non_reference (lhstype
);
7721 if (same_type_p (fntype
, TREE_TYPE (rhs
)))
7723 if (flag_ms_extensions
7724 && TYPE_PTRMEMFUNC_P (fntype
)
7725 && !TYPE_PTRMEMFUNC_P (TREE_TYPE (rhs
)))
7726 /* Microsoft allows `A::f' to be resolved to a
7727 pointer-to-member. */
7731 if (flags
& tf_error
)
7732 error ("cannot convert %qE from type %qT to type %qT",
7733 rhs
, TREE_TYPE (rhs
), fntype
);
7734 return error_mark_node
;
7738 if (BASELINK_P (rhs
))
7740 access_path
= BASELINK_ACCESS_BINFO (rhs
);
7741 rhs
= BASELINK_FUNCTIONS (rhs
);
7744 /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot
7745 deduce any type information. */
7746 if (TREE_CODE (rhs
) == NON_DEPENDENT_EXPR
)
7748 if (flags
& tf_error
)
7749 error ("not enough type information");
7750 return error_mark_node
;
7753 /* There only a few kinds of expressions that may have a type
7754 dependent on overload resolution. */
7755 gcc_assert (TREE_CODE (rhs
) == ADDR_EXPR
7756 || TREE_CODE (rhs
) == COMPONENT_REF
7757 || is_overloaded_fn (rhs
)
7758 || (flag_ms_extensions
&& TREE_CODE (rhs
) == FUNCTION_DECL
));
7760 /* This should really only be used when attempting to distinguish
7761 what sort of a pointer to function we have. For now, any
7762 arithmetic operation which is not supported on pointers
7763 is rejected as an error. */
7765 switch (TREE_CODE (rhs
))
7769 tree member
= TREE_OPERAND (rhs
, 1);
7771 member
= instantiate_type (lhstype
, member
, flags
);
7772 if (member
!= error_mark_node
7773 && TREE_SIDE_EFFECTS (TREE_OPERAND (rhs
, 0)))
7774 /* Do not lose object's side effects. */
7775 return build2 (COMPOUND_EXPR
, TREE_TYPE (member
),
7776 TREE_OPERAND (rhs
, 0), member
);
7781 rhs
= TREE_OPERAND (rhs
, 1);
7782 if (BASELINK_P (rhs
))
7783 return instantiate_type (lhstype
, rhs
, flags_in
);
7785 /* This can happen if we are forming a pointer-to-member for a
7787 gcc_assert (TREE_CODE (rhs
) == TEMPLATE_ID_EXPR
);
7791 case TEMPLATE_ID_EXPR
:
7793 tree fns
= TREE_OPERAND (rhs
, 0);
7794 tree args
= TREE_OPERAND (rhs
, 1);
7797 resolve_address_of_overloaded_function (lhstype
, fns
, flags_in
,
7798 /*template_only=*/true,
7805 resolve_address_of_overloaded_function (lhstype
, rhs
, flags_in
,
7806 /*template_only=*/false,
7807 /*explicit_targs=*/NULL_TREE
,
7812 if (PTRMEM_OK_P (rhs
))
7813 flags
|= tf_ptrmem_ok
;
7815 return instantiate_type (lhstype
, TREE_OPERAND (rhs
, 0), flags
);
7819 return error_mark_node
;
7824 return error_mark_node
;
7827 /* Return the name of the virtual function pointer field
7828 (as an IDENTIFIER_NODE) for the given TYPE. Note that
7829 this may have to look back through base types to find the
7830 ultimate field name. (For single inheritance, these could
7831 all be the same name. Who knows for multiple inheritance). */
7834 get_vfield_name (tree type
)
7836 tree binfo
, base_binfo
;
7839 for (binfo
= TYPE_BINFO (type
);
7840 BINFO_N_BASE_BINFOS (binfo
);
7843 base_binfo
= BINFO_BASE_BINFO (binfo
, 0);
7845 if (BINFO_VIRTUAL_P (base_binfo
)
7846 || !TYPE_CONTAINS_VPTR_P (BINFO_TYPE (base_binfo
)))
7850 type
= BINFO_TYPE (binfo
);
7851 buf
= (char *) alloca (sizeof (VFIELD_NAME_FORMAT
)
7852 + TYPE_NAME_LENGTH (type
) + 2);
7853 sprintf (buf
, VFIELD_NAME_FORMAT
,
7854 IDENTIFIER_POINTER (constructor_name (type
)));
7855 return get_identifier (buf
);
7859 print_class_statistics (void)
7861 if (! GATHER_STATISTICS
)
7864 fprintf (stderr
, "convert_harshness = %d\n", n_convert_harshness
);
7865 fprintf (stderr
, "compute_conversion_costs = %d\n", n_compute_conversion_costs
);
7868 fprintf (stderr
, "vtables = %d; vtable searches = %d\n",
7869 n_vtables
, n_vtable_searches
);
7870 fprintf (stderr
, "vtable entries = %d; vtable elems = %d\n",
7871 n_vtable_entries
, n_vtable_elems
);
7875 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
7876 according to [class]:
7877 The class-name is also inserted
7878 into the scope of the class itself. For purposes of access checking,
7879 the inserted class name is treated as if it were a public member name. */
7882 build_self_reference (void)
7884 tree name
= constructor_name (current_class_type
);
7885 tree value
= build_lang_decl (TYPE_DECL
, name
, current_class_type
);
7888 DECL_NONLOCAL (value
) = 1;
7889 DECL_CONTEXT (value
) = current_class_type
;
7890 DECL_ARTIFICIAL (value
) = 1;
7891 SET_DECL_SELF_REFERENCE_P (value
);
7892 set_underlying_type (value
);
7894 if (processing_template_decl
)
7895 value
= push_template_decl (value
);
7897 saved_cas
= current_access_specifier
;
7898 current_access_specifier
= access_public_node
;
7899 finish_member_declaration (value
);
7900 current_access_specifier
= saved_cas
;
7903 /* Returns 1 if TYPE contains only padding bytes. */
7906 is_empty_class (tree type
)
7908 if (type
== error_mark_node
)
7911 if (! CLASS_TYPE_P (type
))
7914 /* In G++ 3.2, whether or not a class was empty was determined by
7915 looking at its size. */
7916 if (abi_version_at_least (2))
7917 return CLASSTYPE_EMPTY_P (type
);
7919 return integer_zerop (CLASSTYPE_SIZE (type
));
7922 /* Returns true if TYPE contains an empty class. */
7925 contains_empty_class_p (tree type
)
7927 if (is_empty_class (type
))
7929 if (CLASS_TYPE_P (type
))
7936 for (binfo
= TYPE_BINFO (type
), i
= 0;
7937 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
7938 if (contains_empty_class_p (BINFO_TYPE (base_binfo
)))
7940 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
7941 if (TREE_CODE (field
) == FIELD_DECL
7942 && !DECL_ARTIFICIAL (field
)
7943 && is_empty_class (TREE_TYPE (field
)))
7946 else if (TREE_CODE (type
) == ARRAY_TYPE
)
7947 return contains_empty_class_p (TREE_TYPE (type
));
7951 /* Returns true if TYPE contains no actual data, just various
7952 possible combinations of empty classes and possibly a vptr. */
7955 is_really_empty_class (tree type
)
7957 if (CLASS_TYPE_P (type
))
7964 /* CLASSTYPE_EMPTY_P isn't set properly until the class is actually laid
7965 out, but we'd like to be able to check this before then. */
7966 if (COMPLETE_TYPE_P (type
) && is_empty_class (type
))
7969 for (binfo
= TYPE_BINFO (type
), i
= 0;
7970 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
7971 if (!is_really_empty_class (BINFO_TYPE (base_binfo
)))
7973 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
7974 if (TREE_CODE (field
) == FIELD_DECL
7975 && !DECL_ARTIFICIAL (field
)
7976 && !is_really_empty_class (TREE_TYPE (field
)))
7980 else if (TREE_CODE (type
) == ARRAY_TYPE
)
7981 return is_really_empty_class (TREE_TYPE (type
));
7985 /* Note that NAME was looked up while the current class was being
7986 defined and that the result of that lookup was DECL. */
7989 maybe_note_name_used_in_class (tree name
, tree decl
)
7991 splay_tree names_used
;
7993 /* If we're not defining a class, there's nothing to do. */
7994 if (!(innermost_scope_kind() == sk_class
7995 && TYPE_BEING_DEFINED (current_class_type
)
7996 && !LAMBDA_TYPE_P (current_class_type
)))
7999 /* If there's already a binding for this NAME, then we don't have
8000 anything to worry about. */
8001 if (lookup_member (current_class_type
, name
,
8002 /*protect=*/0, /*want_type=*/false, tf_warning_or_error
))
8005 if (!current_class_stack
[current_class_depth
- 1].names_used
)
8006 current_class_stack
[current_class_depth
- 1].names_used
8007 = splay_tree_new (splay_tree_compare_pointers
, 0, 0);
8008 names_used
= current_class_stack
[current_class_depth
- 1].names_used
;
8010 splay_tree_insert (names_used
,
8011 (splay_tree_key
) name
,
8012 (splay_tree_value
) decl
);
8015 /* Note that NAME was declared (as DECL) in the current class. Check
8016 to see that the declaration is valid. */
8019 note_name_declared_in_class (tree name
, tree decl
)
8021 splay_tree names_used
;
8024 /* Look to see if we ever used this name. */
8026 = current_class_stack
[current_class_depth
- 1].names_used
;
8029 /* The C language allows members to be declared with a type of the same
8030 name, and the C++ standard says this diagnostic is not required. So
8031 allow it in extern "C" blocks unless predantic is specified.
8032 Allow it in all cases if -ms-extensions is specified. */
8033 if ((!pedantic
&& current_lang_name
== lang_name_c
)
8034 || flag_ms_extensions
)
8036 n
= splay_tree_lookup (names_used
, (splay_tree_key
) name
);
8039 /* [basic.scope.class]
8041 A name N used in a class S shall refer to the same declaration
8042 in its context and when re-evaluated in the completed scope of
8044 permerror (input_location
, "declaration of %q#D", decl
);
8045 permerror (input_location
, "changes meaning of %qD from %q+#D",
8046 DECL_NAME (OVL_CURRENT (decl
)), (tree
) n
->value
);
8050 /* Returns the VAR_DECL for the complete vtable associated with BINFO.
8051 Secondary vtables are merged with primary vtables; this function
8052 will return the VAR_DECL for the primary vtable. */
8055 get_vtbl_decl_for_binfo (tree binfo
)
8059 decl
= BINFO_VTABLE (binfo
);
8060 if (decl
&& TREE_CODE (decl
) == POINTER_PLUS_EXPR
)
8062 gcc_assert (TREE_CODE (TREE_OPERAND (decl
, 0)) == ADDR_EXPR
);
8063 decl
= TREE_OPERAND (TREE_OPERAND (decl
, 0), 0);
8066 gcc_assert (VAR_P (decl
));
8071 /* Returns the binfo for the primary base of BINFO. If the resulting
8072 BINFO is a virtual base, and it is inherited elsewhere in the
8073 hierarchy, then the returned binfo might not be the primary base of
8074 BINFO in the complete object. Check BINFO_PRIMARY_P or
8075 BINFO_LOST_PRIMARY_P to be sure. */
8078 get_primary_binfo (tree binfo
)
8082 primary_base
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (binfo
));
8086 return copied_binfo (primary_base
, binfo
);
8089 /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */
8092 maybe_indent_hierarchy (FILE * stream
, int indent
, int indented_p
)
8095 fprintf (stream
, "%*s", indent
, "");
8099 /* Dump the offsets of all the bases rooted at BINFO to STREAM.
8100 INDENT should be zero when called from the top level; it is
8101 incremented recursively. IGO indicates the next expected BINFO in
8102 inheritance graph ordering. */
8105 dump_class_hierarchy_r (FILE *stream
,
8115 indented
= maybe_indent_hierarchy (stream
, indent
, 0);
8116 fprintf (stream
, "%s (0x" HOST_WIDE_INT_PRINT_HEX
") ",
8117 type_as_string (BINFO_TYPE (binfo
), TFF_PLAIN_IDENTIFIER
),
8118 (HOST_WIDE_INT
) (uintptr_t) binfo
);
8121 fprintf (stream
, "alternative-path\n");
8124 igo
= TREE_CHAIN (binfo
);
8126 fprintf (stream
, HOST_WIDE_INT_PRINT_DEC
,
8127 tree_to_shwi (BINFO_OFFSET (binfo
)));
8128 if (is_empty_class (BINFO_TYPE (binfo
)))
8129 fprintf (stream
, " empty");
8130 else if (CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (binfo
)))
8131 fprintf (stream
, " nearly-empty");
8132 if (BINFO_VIRTUAL_P (binfo
))
8133 fprintf (stream
, " virtual");
8134 fprintf (stream
, "\n");
8137 if (BINFO_PRIMARY_P (binfo
))
8139 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8140 fprintf (stream
, " primary-for %s (0x" HOST_WIDE_INT_PRINT_HEX
")",
8141 type_as_string (BINFO_TYPE (BINFO_INHERITANCE_CHAIN (binfo
)),
8142 TFF_PLAIN_IDENTIFIER
),
8143 (HOST_WIDE_INT
) (uintptr_t) BINFO_INHERITANCE_CHAIN (binfo
));
8145 if (BINFO_LOST_PRIMARY_P (binfo
))
8147 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8148 fprintf (stream
, " lost-primary");
8151 fprintf (stream
, "\n");
8153 if (!(flags
& TDF_SLIM
))
8157 if (BINFO_SUBVTT_INDEX (binfo
))
8159 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8160 fprintf (stream
, " subvttidx=%s",
8161 expr_as_string (BINFO_SUBVTT_INDEX (binfo
),
8162 TFF_PLAIN_IDENTIFIER
));
8164 if (BINFO_VPTR_INDEX (binfo
))
8166 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8167 fprintf (stream
, " vptridx=%s",
8168 expr_as_string (BINFO_VPTR_INDEX (binfo
),
8169 TFF_PLAIN_IDENTIFIER
));
8171 if (BINFO_VPTR_FIELD (binfo
))
8173 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8174 fprintf (stream
, " vbaseoffset=%s",
8175 expr_as_string (BINFO_VPTR_FIELD (binfo
),
8176 TFF_PLAIN_IDENTIFIER
));
8178 if (BINFO_VTABLE (binfo
))
8180 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8181 fprintf (stream
, " vptr=%s",
8182 expr_as_string (BINFO_VTABLE (binfo
),
8183 TFF_PLAIN_IDENTIFIER
));
8187 fprintf (stream
, "\n");
8190 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
8191 igo
= dump_class_hierarchy_r (stream
, flags
, base_binfo
, igo
, indent
+ 2);
8196 /* Dump the BINFO hierarchy for T. */
8199 dump_class_hierarchy_1 (FILE *stream
, int flags
, tree t
)
8201 fprintf (stream
, "Class %s\n", type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8202 fprintf (stream
, " size=%lu align=%lu\n",
8203 (unsigned long)(tree_to_shwi (TYPE_SIZE (t
)) / BITS_PER_UNIT
),
8204 (unsigned long)(TYPE_ALIGN (t
) / BITS_PER_UNIT
));
8205 fprintf (stream
, " base size=%lu base align=%lu\n",
8206 (unsigned long)(tree_to_shwi (TYPE_SIZE (CLASSTYPE_AS_BASE (t
)))
8208 (unsigned long)(TYPE_ALIGN (CLASSTYPE_AS_BASE (t
))
8210 dump_class_hierarchy_r (stream
, flags
, TYPE_BINFO (t
), TYPE_BINFO (t
), 0);
8211 fprintf (stream
, "\n");
8214 /* Debug interface to hierarchy dumping. */
8217 debug_class (tree t
)
8219 dump_class_hierarchy_1 (stderr
, TDF_SLIM
, t
);
8223 dump_class_hierarchy (tree t
)
8226 FILE *stream
= dump_begin (TDI_class
, &flags
);
8230 dump_class_hierarchy_1 (stream
, flags
, t
);
8231 dump_end (TDI_class
, stream
);
8236 dump_array (FILE * stream
, tree decl
)
8239 unsigned HOST_WIDE_INT ix
;
8241 tree size
= TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (decl
)));
8243 elt
= (tree_to_shwi (TYPE_SIZE (TREE_TYPE (TREE_TYPE (decl
))))
8245 fprintf (stream
, "%s:", decl_as_string (decl
, TFF_PLAIN_IDENTIFIER
));
8246 fprintf (stream
, " %s entries",
8247 expr_as_string (size_binop (PLUS_EXPR
, size
, size_one_node
),
8248 TFF_PLAIN_IDENTIFIER
));
8249 fprintf (stream
, "\n");
8251 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (DECL_INITIAL (decl
)),
8253 fprintf (stream
, "%-4ld %s\n", (long)(ix
* elt
),
8254 expr_as_string (value
, TFF_PLAIN_IDENTIFIER
));
8258 dump_vtable (tree t
, tree binfo
, tree vtable
)
8261 FILE *stream
= dump_begin (TDI_class
, &flags
);
8266 if (!(flags
& TDF_SLIM
))
8268 int ctor_vtbl_p
= TYPE_BINFO (t
) != binfo
;
8270 fprintf (stream
, "%s for %s",
8271 ctor_vtbl_p
? "Construction vtable" : "Vtable",
8272 type_as_string (BINFO_TYPE (binfo
), TFF_PLAIN_IDENTIFIER
));
8275 if (!BINFO_VIRTUAL_P (binfo
))
8276 fprintf (stream
, " (0x" HOST_WIDE_INT_PRINT_HEX
" instance)",
8277 (HOST_WIDE_INT
) (uintptr_t) binfo
);
8278 fprintf (stream
, " in %s", type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8280 fprintf (stream
, "\n");
8281 dump_array (stream
, vtable
);
8282 fprintf (stream
, "\n");
8285 dump_end (TDI_class
, stream
);
8289 dump_vtt (tree t
, tree vtt
)
8292 FILE *stream
= dump_begin (TDI_class
, &flags
);
8297 if (!(flags
& TDF_SLIM
))
8299 fprintf (stream
, "VTT for %s\n",
8300 type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8301 dump_array (stream
, vtt
);
8302 fprintf (stream
, "\n");
8305 dump_end (TDI_class
, stream
);
8308 /* Dump a function or thunk and its thunkees. */
8311 dump_thunk (FILE *stream
, int indent
, tree thunk
)
8313 static const char spaces
[] = " ";
8314 tree name
= DECL_NAME (thunk
);
8317 fprintf (stream
, "%.*s%p %s %s", indent
, spaces
,
8319 !DECL_THUNK_P (thunk
) ? "function"
8320 : DECL_THIS_THUNK_P (thunk
) ? "this-thunk" : "covariant-thunk",
8321 name
? IDENTIFIER_POINTER (name
) : "<unset>");
8322 if (DECL_THUNK_P (thunk
))
8324 HOST_WIDE_INT fixed_adjust
= THUNK_FIXED_OFFSET (thunk
);
8325 tree virtual_adjust
= THUNK_VIRTUAL_OFFSET (thunk
);
8327 fprintf (stream
, " fixed=" HOST_WIDE_INT_PRINT_DEC
, fixed_adjust
);
8328 if (!virtual_adjust
)
8330 else if (DECL_THIS_THUNK_P (thunk
))
8331 fprintf (stream
, " vcall=" HOST_WIDE_INT_PRINT_DEC
,
8332 tree_to_shwi (virtual_adjust
));
8334 fprintf (stream
, " vbase=" HOST_WIDE_INT_PRINT_DEC
"(%s)",
8335 tree_to_shwi (BINFO_VPTR_FIELD (virtual_adjust
)),
8336 type_as_string (BINFO_TYPE (virtual_adjust
), TFF_SCOPE
));
8337 if (THUNK_ALIAS (thunk
))
8338 fprintf (stream
, " alias to %p", (void *)THUNK_ALIAS (thunk
));
8340 fprintf (stream
, "\n");
8341 for (thunks
= DECL_THUNKS (thunk
); thunks
; thunks
= TREE_CHAIN (thunks
))
8342 dump_thunk (stream
, indent
+ 2, thunks
);
8345 /* Dump the thunks for FN. */
8348 debug_thunks (tree fn
)
8350 dump_thunk (stderr
, 0, fn
);
8353 /* Virtual function table initialization. */
8355 /* Create all the necessary vtables for T and its base classes. */
8358 finish_vtbls (tree t
)
8361 vec
<constructor_elt
, va_gc
> *v
= NULL
;
8362 tree vtable
= BINFO_VTABLE (TYPE_BINFO (t
));
8364 /* We lay out the primary and secondary vtables in one contiguous
8365 vtable. The primary vtable is first, followed by the non-virtual
8366 secondary vtables in inheritance graph order. */
8367 accumulate_vtbl_inits (TYPE_BINFO (t
), TYPE_BINFO (t
), TYPE_BINFO (t
),
8370 /* Then come the virtual bases, also in inheritance graph order. */
8371 for (vbase
= TYPE_BINFO (t
); vbase
; vbase
= TREE_CHAIN (vbase
))
8373 if (!BINFO_VIRTUAL_P (vbase
))
8375 accumulate_vtbl_inits (vbase
, vbase
, TYPE_BINFO (t
), vtable
, t
, &v
);
8378 if (BINFO_VTABLE (TYPE_BINFO (t
)))
8379 initialize_vtable (TYPE_BINFO (t
), v
);
8382 /* Initialize the vtable for BINFO with the INITS. */
8385 initialize_vtable (tree binfo
, vec
<constructor_elt
, va_gc
> *inits
)
8389 layout_vtable_decl (binfo
, vec_safe_length (inits
));
8390 decl
= get_vtbl_decl_for_binfo (binfo
);
8391 initialize_artificial_var (decl
, inits
);
8392 dump_vtable (BINFO_TYPE (binfo
), binfo
, decl
);
8395 /* Build the VTT (virtual table table) for T.
8396 A class requires a VTT if it has virtual bases.
8399 1 - primary virtual pointer for complete object T
8400 2 - secondary VTTs for each direct non-virtual base of T which requires a
8402 3 - secondary virtual pointers for each direct or indirect base of T which
8403 has virtual bases or is reachable via a virtual path from T.
8404 4 - secondary VTTs for each direct or indirect virtual base of T.
8406 Secondary VTTs look like complete object VTTs without part 4. */
8414 vec
<constructor_elt
, va_gc
> *inits
;
8416 /* Build up the initializers for the VTT. */
8418 index
= size_zero_node
;
8419 build_vtt_inits (TYPE_BINFO (t
), t
, &inits
, &index
);
8421 /* If we didn't need a VTT, we're done. */
8425 /* Figure out the type of the VTT. */
8426 type
= build_array_of_n_type (const_ptr_type_node
,
8429 /* Now, build the VTT object itself. */
8430 vtt
= build_vtable (t
, mangle_vtt_for_type (t
), type
);
8431 initialize_artificial_var (vtt
, inits
);
8432 /* Add the VTT to the vtables list. */
8433 DECL_CHAIN (vtt
) = DECL_CHAIN (CLASSTYPE_VTABLES (t
));
8434 DECL_CHAIN (CLASSTYPE_VTABLES (t
)) = vtt
;
8439 /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with
8440 PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo,
8441 and CHAIN the vtable pointer for this binfo after construction is
8442 complete. VALUE can also be another BINFO, in which case we recurse. */
8445 binfo_ctor_vtable (tree binfo
)
8451 vt
= BINFO_VTABLE (binfo
);
8452 if (TREE_CODE (vt
) == TREE_LIST
)
8453 vt
= TREE_VALUE (vt
);
8454 if (TREE_CODE (vt
) == TREE_BINFO
)
8463 /* Data for secondary VTT initialization. */
8464 typedef struct secondary_vptr_vtt_init_data_s
8466 /* Is this the primary VTT? */
8469 /* Current index into the VTT. */
8472 /* Vector of initializers built up. */
8473 vec
<constructor_elt
, va_gc
> *inits
;
8475 /* The type being constructed by this secondary VTT. */
8476 tree type_being_constructed
;
8477 } secondary_vptr_vtt_init_data
;
8479 /* Recursively build the VTT-initializer for BINFO (which is in the
8480 hierarchy dominated by T). INITS points to the end of the initializer
8481 list to date. INDEX is the VTT index where the next element will be
8482 replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e.
8483 not a subvtt for some base of T). When that is so, we emit the sub-VTTs
8484 for virtual bases of T. When it is not so, we build the constructor
8485 vtables for the BINFO-in-T variant. */
8488 build_vtt_inits (tree binfo
, tree t
, vec
<constructor_elt
, va_gc
> **inits
,
8494 secondary_vptr_vtt_init_data data
;
8495 int top_level_p
= SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
);
8497 /* We only need VTTs for subobjects with virtual bases. */
8498 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
)))
8501 /* We need to use a construction vtable if this is not the primary
8505 build_ctor_vtbl_group (binfo
, t
);
8507 /* Record the offset in the VTT where this sub-VTT can be found. */
8508 BINFO_SUBVTT_INDEX (binfo
) = *index
;
8511 /* Add the address of the primary vtable for the complete object. */
8512 init
= binfo_ctor_vtable (binfo
);
8513 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
8516 gcc_assert (!BINFO_VPTR_INDEX (binfo
));
8517 BINFO_VPTR_INDEX (binfo
) = *index
;
8519 *index
= size_binop (PLUS_EXPR
, *index
, TYPE_SIZE_UNIT (ptr_type_node
));
8521 /* Recursively add the secondary VTTs for non-virtual bases. */
8522 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, b
); ++i
)
8523 if (!BINFO_VIRTUAL_P (b
))
8524 build_vtt_inits (b
, t
, inits
, index
);
8526 /* Add secondary virtual pointers for all subobjects of BINFO with
8527 either virtual bases or reachable along a virtual path, except
8528 subobjects that are non-virtual primary bases. */
8529 data
.top_level_p
= top_level_p
;
8530 data
.index
= *index
;
8531 data
.inits
= *inits
;
8532 data
.type_being_constructed
= BINFO_TYPE (binfo
);
8534 dfs_walk_once (binfo
, dfs_build_secondary_vptr_vtt_inits
, NULL
, &data
);
8536 *index
= data
.index
;
8538 /* data.inits might have grown as we added secondary virtual pointers.
8539 Make sure our caller knows about the new vector. */
8540 *inits
= data
.inits
;
8543 /* Add the secondary VTTs for virtual bases in inheritance graph
8545 for (b
= TYPE_BINFO (BINFO_TYPE (binfo
)); b
; b
= TREE_CHAIN (b
))
8547 if (!BINFO_VIRTUAL_P (b
))
8550 build_vtt_inits (b
, t
, inits
, index
);
8553 /* Remove the ctor vtables we created. */
8554 dfs_walk_all (binfo
, dfs_fixup_binfo_vtbls
, NULL
, binfo
);
8557 /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base
8558 in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */
8561 dfs_build_secondary_vptr_vtt_inits (tree binfo
, void *data_
)
8563 secondary_vptr_vtt_init_data
*data
= (secondary_vptr_vtt_init_data
*)data_
;
8565 /* We don't care about bases that don't have vtables. */
8566 if (!TYPE_VFIELD (BINFO_TYPE (binfo
)))
8567 return dfs_skip_bases
;
8569 /* We're only interested in proper subobjects of the type being
8571 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), data
->type_being_constructed
))
8574 /* We're only interested in bases with virtual bases or reachable
8575 via a virtual path from the type being constructed. */
8576 if (!(CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
))
8577 || binfo_via_virtual (binfo
, data
->type_being_constructed
)))
8578 return dfs_skip_bases
;
8580 /* We're not interested in non-virtual primary bases. */
8581 if (!BINFO_VIRTUAL_P (binfo
) && BINFO_PRIMARY_P (binfo
))
8584 /* Record the index where this secondary vptr can be found. */
8585 if (data
->top_level_p
)
8587 gcc_assert (!BINFO_VPTR_INDEX (binfo
));
8588 BINFO_VPTR_INDEX (binfo
) = data
->index
;
8590 if (BINFO_VIRTUAL_P (binfo
))
8592 /* It's a primary virtual base, and this is not a
8593 construction vtable. Find the base this is primary of in
8594 the inheritance graph, and use that base's vtable
8596 while (BINFO_PRIMARY_P (binfo
))
8597 binfo
= BINFO_INHERITANCE_CHAIN (binfo
);
8601 /* Add the initializer for the secondary vptr itself. */
8602 CONSTRUCTOR_APPEND_ELT (data
->inits
, NULL_TREE
, binfo_ctor_vtable (binfo
));
8604 /* Advance the vtt index. */
8605 data
->index
= size_binop (PLUS_EXPR
, data
->index
,
8606 TYPE_SIZE_UNIT (ptr_type_node
));
8611 /* Called from build_vtt_inits via dfs_walk. After building
8612 constructor vtables and generating the sub-vtt from them, we need
8613 to restore the BINFO_VTABLES that were scribbled on. DATA is the
8614 binfo of the base whose sub vtt was generated. */
8617 dfs_fixup_binfo_vtbls (tree binfo
, void* data
)
8619 tree vtable
= BINFO_VTABLE (binfo
);
8621 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
8622 /* If this class has no vtable, none of its bases do. */
8623 return dfs_skip_bases
;
8626 /* This might be a primary base, so have no vtable in this
8630 /* If we scribbled the construction vtable vptr into BINFO, clear it
8632 if (TREE_CODE (vtable
) == TREE_LIST
8633 && (TREE_PURPOSE (vtable
) == (tree
) data
))
8634 BINFO_VTABLE (binfo
) = TREE_CHAIN (vtable
);
8639 /* Build the construction vtable group for BINFO which is in the
8640 hierarchy dominated by T. */
8643 build_ctor_vtbl_group (tree binfo
, tree t
)
8649 vec
<constructor_elt
, va_gc
> *v
;
8651 /* See if we've already created this construction vtable group. */
8652 id
= mangle_ctor_vtbl_for_type (t
, binfo
);
8653 if (IDENTIFIER_GLOBAL_VALUE (id
))
8656 gcc_assert (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
));
8657 /* Build a version of VTBL (with the wrong type) for use in
8658 constructing the addresses of secondary vtables in the
8659 construction vtable group. */
8660 vtbl
= build_vtable (t
, id
, ptr_type_node
);
8661 DECL_CONSTRUCTION_VTABLE_P (vtbl
) = 1;
8662 /* Don't export construction vtables from shared libraries. Even on
8663 targets that don't support hidden visibility, this tells
8664 can_refer_decl_in_current_unit_p not to assume that it's safe to
8665 access from a different compilation unit (bz 54314). */
8666 DECL_VISIBILITY (vtbl
) = VISIBILITY_HIDDEN
;
8667 DECL_VISIBILITY_SPECIFIED (vtbl
) = true;
8670 accumulate_vtbl_inits (binfo
, TYPE_BINFO (TREE_TYPE (binfo
)),
8671 binfo
, vtbl
, t
, &v
);
8673 /* Add the vtables for each of our virtual bases using the vbase in T
8675 for (vbase
= TYPE_BINFO (BINFO_TYPE (binfo
));
8677 vbase
= TREE_CHAIN (vbase
))
8681 if (!BINFO_VIRTUAL_P (vbase
))
8683 b
= copied_binfo (vbase
, binfo
);
8685 accumulate_vtbl_inits (b
, vbase
, binfo
, vtbl
, t
, &v
);
8688 /* Figure out the type of the construction vtable. */
8689 type
= build_array_of_n_type (vtable_entry_type
, v
->length ());
8691 TREE_TYPE (vtbl
) = type
;
8692 DECL_SIZE (vtbl
) = DECL_SIZE_UNIT (vtbl
) = NULL_TREE
;
8693 layout_decl (vtbl
, 0);
8695 /* Initialize the construction vtable. */
8696 CLASSTYPE_VTABLES (t
) = chainon (CLASSTYPE_VTABLES (t
), vtbl
);
8697 initialize_artificial_var (vtbl
, v
);
8698 dump_vtable (t
, binfo
, vtbl
);
8701 /* Add the vtbl initializers for BINFO (and its bases other than
8702 non-virtual primaries) to the list of INITS. BINFO is in the
8703 hierarchy dominated by T. RTTI_BINFO is the binfo within T of
8704 the constructor the vtbl inits should be accumulated for. (If this
8705 is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).)
8706 ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO).
8707 BINFO is the active base equivalent of ORIG_BINFO in the inheritance
8708 graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE,
8709 but are not necessarily the same in terms of layout. */
8712 accumulate_vtbl_inits (tree binfo
,
8717 vec
<constructor_elt
, va_gc
> **inits
)
8721 int ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8723 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), BINFO_TYPE (orig_binfo
)));
8725 /* If it doesn't have a vptr, we don't do anything. */
8726 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
8729 /* If we're building a construction vtable, we're not interested in
8730 subobjects that don't require construction vtables. */
8732 && !CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
))
8733 && !binfo_via_virtual (orig_binfo
, BINFO_TYPE (rtti_binfo
)))
8736 /* Build the initializers for the BINFO-in-T vtable. */
8737 dfs_accumulate_vtbl_inits (binfo
, orig_binfo
, rtti_binfo
, vtbl
, t
, inits
);
8739 /* Walk the BINFO and its bases. We walk in preorder so that as we
8740 initialize each vtable we can figure out at what offset the
8741 secondary vtable lies from the primary vtable. We can't use
8742 dfs_walk here because we need to iterate through bases of BINFO
8743 and RTTI_BINFO simultaneously. */
8744 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
8746 /* Skip virtual bases. */
8747 if (BINFO_VIRTUAL_P (base_binfo
))
8749 accumulate_vtbl_inits (base_binfo
,
8750 BINFO_BASE_BINFO (orig_binfo
, i
),
8751 rtti_binfo
, vtbl
, t
,
8756 /* Called from accumulate_vtbl_inits. Adds the initializers for the
8757 BINFO vtable to L. */
8760 dfs_accumulate_vtbl_inits (tree binfo
,
8765 vec
<constructor_elt
, va_gc
> **l
)
8767 tree vtbl
= NULL_TREE
;
8768 int ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8772 && BINFO_VIRTUAL_P (orig_binfo
) && BINFO_PRIMARY_P (orig_binfo
))
8774 /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a
8775 primary virtual base. If it is not the same primary in
8776 the hierarchy of T, we'll need to generate a ctor vtable
8777 for it, to place at its location in T. If it is the same
8778 primary, we still need a VTT entry for the vtable, but it
8779 should point to the ctor vtable for the base it is a
8780 primary for within the sub-hierarchy of RTTI_BINFO.
8782 There are three possible cases:
8784 1) We are in the same place.
8785 2) We are a primary base within a lost primary virtual base of
8787 3) We are primary to something not a base of RTTI_BINFO. */
8790 tree last
= NULL_TREE
;
8792 /* First, look through the bases we are primary to for RTTI_BINFO
8793 or a virtual base. */
8795 while (BINFO_PRIMARY_P (b
))
8797 b
= BINFO_INHERITANCE_CHAIN (b
);
8799 if (BINFO_VIRTUAL_P (b
) || b
== rtti_binfo
)
8802 /* If we run out of primary links, keep looking down our
8803 inheritance chain; we might be an indirect primary. */
8804 for (b
= last
; b
; b
= BINFO_INHERITANCE_CHAIN (b
))
8805 if (BINFO_VIRTUAL_P (b
) || b
== rtti_binfo
)
8809 /* If we found RTTI_BINFO, this is case 1. If we found a virtual
8810 base B and it is a base of RTTI_BINFO, this is case 2. In
8811 either case, we share our vtable with LAST, i.e. the
8812 derived-most base within B of which we are a primary. */
8814 || (b
&& binfo_for_vbase (BINFO_TYPE (b
), BINFO_TYPE (rtti_binfo
))))
8815 /* Just set our BINFO_VTABLE to point to LAST, as we may not have
8816 set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in
8817 binfo_ctor_vtable after everything's been set up. */
8820 /* Otherwise, this is case 3 and we get our own. */
8822 else if (!BINFO_NEW_VTABLE_MARKED (orig_binfo
))
8825 n_inits
= vec_safe_length (*l
);
8832 /* Add the initializer for this vtable. */
8833 build_vtbl_initializer (binfo
, orig_binfo
, t
, rtti_binfo
,
8834 &non_fn_entries
, l
);
8836 /* Figure out the position to which the VPTR should point. */
8837 vtbl
= build1 (ADDR_EXPR
, vtbl_ptr_type_node
, orig_vtbl
);
8838 index
= size_binop (MULT_EXPR
,
8839 TYPE_SIZE_UNIT (vtable_entry_type
),
8840 size_int (non_fn_entries
+ n_inits
));
8841 vtbl
= fold_build_pointer_plus (vtbl
, index
);
8845 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
8846 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
8847 straighten this out. */
8848 BINFO_VTABLE (binfo
) = tree_cons (rtti_binfo
, vtbl
, BINFO_VTABLE (binfo
));
8849 else if (BINFO_PRIMARY_P (binfo
) && BINFO_VIRTUAL_P (binfo
))
8850 /* Throw away any unneeded intializers. */
8851 (*l
)->truncate (n_inits
);
8853 /* For an ordinary vtable, set BINFO_VTABLE. */
8854 BINFO_VTABLE (binfo
) = vtbl
;
8857 static GTY(()) tree abort_fndecl_addr
;
8859 /* Construct the initializer for BINFO's virtual function table. BINFO
8860 is part of the hierarchy dominated by T. If we're building a
8861 construction vtable, the ORIG_BINFO is the binfo we should use to
8862 find the actual function pointers to put in the vtable - but they
8863 can be overridden on the path to most-derived in the graph that
8864 ORIG_BINFO belongs. Otherwise,
8865 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
8866 BINFO that should be indicated by the RTTI information in the
8867 vtable; it will be a base class of T, rather than T itself, if we
8868 are building a construction vtable.
8870 The value returned is a TREE_LIST suitable for wrapping in a
8871 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
8872 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
8873 number of non-function entries in the vtable.
8875 It might seem that this function should never be called with a
8876 BINFO for which BINFO_PRIMARY_P holds, the vtable for such a
8877 base is always subsumed by a derived class vtable. However, when
8878 we are building construction vtables, we do build vtables for
8879 primary bases; we need these while the primary base is being
8883 build_vtbl_initializer (tree binfo
,
8887 int* non_fn_entries_p
,
8888 vec
<constructor_elt
, va_gc
> **inits
)
8894 vec
<tree
, va_gc
> *vbases
;
8897 /* Initialize VID. */
8898 memset (&vid
, 0, sizeof (vid
));
8901 vid
.rtti_binfo
= rtti_binfo
;
8902 vid
.primary_vtbl_p
= SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
);
8903 vid
.ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8904 vid
.generate_vcall_entries
= true;
8905 /* The first vbase or vcall offset is at index -3 in the vtable. */
8906 vid
.index
= ssize_int(-3 * TARGET_VTABLE_DATA_ENTRY_DISTANCE
);
8908 /* Add entries to the vtable for RTTI. */
8909 build_rtti_vtbl_entries (binfo
, &vid
);
8911 /* Create an array for keeping track of the functions we've
8912 processed. When we see multiple functions with the same
8913 signature, we share the vcall offsets. */
8914 vec_alloc (vid
.fns
, 32);
8915 /* Add the vcall and vbase offset entries. */
8916 build_vcall_and_vbase_vtbl_entries (binfo
, &vid
);
8918 /* Clear BINFO_VTABLE_PATH_MARKED; it's set by
8919 build_vbase_offset_vtbl_entries. */
8920 for (vbases
= CLASSTYPE_VBASECLASSES (t
), ix
= 0;
8921 vec_safe_iterate (vbases
, ix
, &vbinfo
); ix
++)
8922 BINFO_VTABLE_PATH_MARKED (vbinfo
) = 0;
8924 /* If the target requires padding between data entries, add that now. */
8925 if (TARGET_VTABLE_DATA_ENTRY_DISTANCE
> 1)
8927 int n_entries
= vec_safe_length (vid
.inits
);
8929 vec_safe_grow (vid
.inits
, TARGET_VTABLE_DATA_ENTRY_DISTANCE
* n_entries
);
8931 /* Move data entries into their new positions and add padding
8932 after the new positions. Iterate backwards so we don't
8933 overwrite entries that we would need to process later. */
8934 for (ix
= n_entries
- 1;
8935 vid
.inits
->iterate (ix
, &e
);
8939 int new_position
= (TARGET_VTABLE_DATA_ENTRY_DISTANCE
* ix
8940 + (TARGET_VTABLE_DATA_ENTRY_DISTANCE
- 1));
8942 (*vid
.inits
)[new_position
] = *e
;
8944 for (j
= 1; j
< TARGET_VTABLE_DATA_ENTRY_DISTANCE
; ++j
)
8946 constructor_elt
*f
= &(*vid
.inits
)[new_position
- j
];
8947 f
->index
= NULL_TREE
;
8948 f
->value
= build1 (NOP_EXPR
, vtable_entry_type
,
8954 if (non_fn_entries_p
)
8955 *non_fn_entries_p
= vec_safe_length (vid
.inits
);
8957 /* The initializers for virtual functions were built up in reverse
8958 order. Straighten them out and add them to the running list in one
8960 jx
= vec_safe_length (*inits
);
8961 vec_safe_grow (*inits
, jx
+ vid
.inits
->length ());
8963 for (ix
= vid
.inits
->length () - 1;
8964 vid
.inits
->iterate (ix
, &e
);
8968 /* Go through all the ordinary virtual functions, building up
8970 for (v
= BINFO_VIRTUALS (orig_binfo
); v
; v
= TREE_CHAIN (v
))
8974 tree fn
, fn_original
;
8975 tree init
= NULL_TREE
;
8979 if (DECL_THUNK_P (fn
))
8981 if (!DECL_NAME (fn
))
8983 if (THUNK_ALIAS (fn
))
8985 fn
= THUNK_ALIAS (fn
);
8988 fn_original
= THUNK_TARGET (fn
);
8991 /* If the only definition of this function signature along our
8992 primary base chain is from a lost primary, this vtable slot will
8993 never be used, so just zero it out. This is important to avoid
8994 requiring extra thunks which cannot be generated with the function.
8996 We first check this in update_vtable_entry_for_fn, so we handle
8997 restored primary bases properly; we also need to do it here so we
8998 zero out unused slots in ctor vtables, rather than filling them
8999 with erroneous values (though harmless, apart from relocation
9001 if (BV_LOST_PRIMARY (v
))
9002 init
= size_zero_node
;
9006 /* Pull the offset for `this', and the function to call, out of
9008 delta
= BV_DELTA (v
);
9009 vcall_index
= BV_VCALL_INDEX (v
);
9011 gcc_assert (TREE_CODE (delta
) == INTEGER_CST
);
9012 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
9014 /* You can't call an abstract virtual function; it's abstract.
9015 So, we replace these functions with __pure_virtual. */
9016 if (DECL_PURE_VIRTUAL_P (fn_original
))
9019 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
9021 if (abort_fndecl_addr
== NULL
)
9023 = fold_convert (vfunc_ptr_type_node
,
9024 build_fold_addr_expr (fn
));
9025 init
= abort_fndecl_addr
;
9028 /* Likewise for deleted virtuals. */
9029 else if (DECL_DELETED_FN (fn_original
))
9031 fn
= get_identifier ("__cxa_deleted_virtual");
9032 if (!get_global_value_if_present (fn
, &fn
))
9033 fn
= push_library_fn (fn
, (build_function_type_list
9034 (void_type_node
, NULL_TREE
)),
9035 NULL_TREE
, ECF_NORETURN
);
9036 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
9037 init
= fold_convert (vfunc_ptr_type_node
,
9038 build_fold_addr_expr (fn
));
9042 if (!integer_zerop (delta
) || vcall_index
)
9044 fn
= make_thunk (fn
, /*this_adjusting=*/1, delta
, vcall_index
);
9045 if (!DECL_NAME (fn
))
9048 /* Take the address of the function, considering it to be of an
9049 appropriate generic type. */
9050 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
9051 init
= fold_convert (vfunc_ptr_type_node
,
9052 build_fold_addr_expr (fn
));
9053 /* Don't refer to a virtual destructor from a constructor
9054 vtable or a vtable for an abstract class, since destroying
9055 an object under construction is undefined behavior and we
9056 don't want it to be considered a candidate for speculative
9057 devirtualization. But do create the thunk for ABI
9059 if (DECL_DESTRUCTOR_P (fn_original
)
9060 && (CLASSTYPE_PURE_VIRTUALS (DECL_CONTEXT (fn_original
))
9061 || orig_binfo
!= binfo
))
9062 init
= size_zero_node
;
9066 /* And add it to the chain of initializers. */
9067 if (TARGET_VTABLE_USES_DESCRIPTORS
)
9070 if (init
== size_zero_node
)
9071 for (i
= 0; i
< TARGET_VTABLE_USES_DESCRIPTORS
; ++i
)
9072 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
9074 for (i
= 0; i
< TARGET_VTABLE_USES_DESCRIPTORS
; ++i
)
9076 tree fdesc
= build2 (FDESC_EXPR
, vfunc_ptr_type_node
,
9077 fn
, build_int_cst (NULL_TREE
, i
));
9078 TREE_CONSTANT (fdesc
) = 1;
9080 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, fdesc
);
9084 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
9088 /* Adds to vid->inits the initializers for the vbase and vcall
9089 offsets in BINFO, which is in the hierarchy dominated by T. */
9092 build_vcall_and_vbase_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9096 /* If this is a derived class, we must first create entries
9097 corresponding to the primary base class. */
9098 b
= get_primary_binfo (binfo
);
9100 build_vcall_and_vbase_vtbl_entries (b
, vid
);
9102 /* Add the vbase entries for this base. */
9103 build_vbase_offset_vtbl_entries (binfo
, vid
);
9104 /* Add the vcall entries for this base. */
9105 build_vcall_offset_vtbl_entries (binfo
, vid
);
9108 /* Returns the initializers for the vbase offset entries in the vtable
9109 for BINFO (which is part of the class hierarchy dominated by T), in
9110 reverse order. VBASE_OFFSET_INDEX gives the vtable index
9111 where the next vbase offset will go. */
9114 build_vbase_offset_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9118 tree non_primary_binfo
;
9120 /* If there are no virtual baseclasses, then there is nothing to
9122 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
)))
9127 /* We might be a primary base class. Go up the inheritance hierarchy
9128 until we find the most derived class of which we are a primary base:
9129 it is the offset of that which we need to use. */
9130 non_primary_binfo
= binfo
;
9131 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo
))
9135 /* If we have reached a virtual base, then it must be a primary
9136 base (possibly multi-level) of vid->binfo, or we wouldn't
9137 have called build_vcall_and_vbase_vtbl_entries for it. But it
9138 might be a lost primary, so just skip down to vid->binfo. */
9139 if (BINFO_VIRTUAL_P (non_primary_binfo
))
9141 non_primary_binfo
= vid
->binfo
;
9145 b
= BINFO_INHERITANCE_CHAIN (non_primary_binfo
);
9146 if (get_primary_binfo (b
) != non_primary_binfo
)
9148 non_primary_binfo
= b
;
9151 /* Go through the virtual bases, adding the offsets. */
9152 for (vbase
= TYPE_BINFO (BINFO_TYPE (binfo
));
9154 vbase
= TREE_CHAIN (vbase
))
9159 if (!BINFO_VIRTUAL_P (vbase
))
9162 /* Find the instance of this virtual base in the complete
9164 b
= copied_binfo (vbase
, binfo
);
9166 /* If we've already got an offset for this virtual base, we
9167 don't need another one. */
9168 if (BINFO_VTABLE_PATH_MARKED (b
))
9170 BINFO_VTABLE_PATH_MARKED (b
) = 1;
9172 /* Figure out where we can find this vbase offset. */
9173 delta
= size_binop (MULT_EXPR
,
9176 TYPE_SIZE_UNIT (vtable_entry_type
)));
9177 if (vid
->primary_vtbl_p
)
9178 BINFO_VPTR_FIELD (b
) = delta
;
9180 if (binfo
!= TYPE_BINFO (t
))
9181 /* The vbase offset had better be the same. */
9182 gcc_assert (tree_int_cst_equal (delta
, BINFO_VPTR_FIELD (vbase
)));
9184 /* The next vbase will come at a more negative offset. */
9185 vid
->index
= size_binop (MINUS_EXPR
, vid
->index
,
9186 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE
));
9188 /* The initializer is the delta from BINFO to this virtual base.
9189 The vbase offsets go in reverse inheritance-graph order, and
9190 we are walking in inheritance graph order so these end up in
9192 delta
= size_diffop_loc (input_location
,
9193 BINFO_OFFSET (b
), BINFO_OFFSET (non_primary_binfo
));
9195 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
,
9196 fold_build1_loc (input_location
, NOP_EXPR
,
9197 vtable_entry_type
, delta
));
9201 /* Adds the initializers for the vcall offset entries in the vtable
9202 for BINFO (which is part of the class hierarchy dominated by VID->DERIVED)
9206 build_vcall_offset_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9208 /* We only need these entries if this base is a virtual base. We
9209 compute the indices -- but do not add to the vtable -- when
9210 building the main vtable for a class. */
9211 if (binfo
== TYPE_BINFO (vid
->derived
)
9212 || (BINFO_VIRTUAL_P (binfo
)
9213 /* If BINFO is RTTI_BINFO, then (since BINFO does not
9214 correspond to VID->DERIVED), we are building a primary
9215 construction virtual table. Since this is a primary
9216 virtual table, we do not need the vcall offsets for
9218 && binfo
!= vid
->rtti_binfo
))
9220 /* We need a vcall offset for each of the virtual functions in this
9221 vtable. For example:
9223 class A { virtual void f (); };
9224 class B1 : virtual public A { virtual void f (); };
9225 class B2 : virtual public A { virtual void f (); };
9226 class C: public B1, public B2 { virtual void f (); };
9228 A C object has a primary base of B1, which has a primary base of A. A
9229 C also has a secondary base of B2, which no longer has a primary base
9230 of A. So the B2-in-C construction vtable needs a secondary vtable for
9231 A, which will adjust the A* to a B2* to call f. We have no way of
9232 knowing what (or even whether) this offset will be when we define B2,
9233 so we store this "vcall offset" in the A sub-vtable and look it up in
9234 a "virtual thunk" for B2::f.
9236 We need entries for all the functions in our primary vtable and
9237 in our non-virtual bases' secondary vtables. */
9239 /* If we are just computing the vcall indices -- but do not need
9240 the actual entries -- not that. */
9241 if (!BINFO_VIRTUAL_P (binfo
))
9242 vid
->generate_vcall_entries
= false;
9243 /* Now, walk through the non-virtual bases, adding vcall offsets. */
9244 add_vcall_offset_vtbl_entries_r (binfo
, vid
);
9248 /* Build vcall offsets, starting with those for BINFO. */
9251 add_vcall_offset_vtbl_entries_r (tree binfo
, vtbl_init_data
* vid
)
9257 /* Don't walk into virtual bases -- except, of course, for the
9258 virtual base for which we are building vcall offsets. Any
9259 primary virtual base will have already had its offsets generated
9260 through the recursion in build_vcall_and_vbase_vtbl_entries. */
9261 if (BINFO_VIRTUAL_P (binfo
) && vid
->vbase
!= binfo
)
9264 /* If BINFO has a primary base, process it first. */
9265 primary_binfo
= get_primary_binfo (binfo
);
9267 add_vcall_offset_vtbl_entries_r (primary_binfo
, vid
);
9269 /* Add BINFO itself to the list. */
9270 add_vcall_offset_vtbl_entries_1 (binfo
, vid
);
9272 /* Scan the non-primary bases of BINFO. */
9273 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
9274 if (base_binfo
!= primary_binfo
)
9275 add_vcall_offset_vtbl_entries_r (base_binfo
, vid
);
9278 /* Called from build_vcall_offset_vtbl_entries_r. */
9281 add_vcall_offset_vtbl_entries_1 (tree binfo
, vtbl_init_data
* vid
)
9283 /* Make entries for the rest of the virtuals. */
9284 if (abi_version_at_least (2))
9288 /* The ABI requires that the methods be processed in declaration
9289 order. G++ 3.2 used the order in the vtable. */
9290 for (orig_fn
= TYPE_METHODS (BINFO_TYPE (binfo
));
9292 orig_fn
= DECL_CHAIN (orig_fn
))
9293 if (DECL_VINDEX (orig_fn
))
9294 add_vcall_offset (orig_fn
, binfo
, vid
);
9298 tree derived_virtuals
;
9301 /* If BINFO is a primary base, the most derived class which has
9302 BINFO as a primary base; otherwise, just BINFO. */
9303 tree non_primary_binfo
;
9305 /* We might be a primary base class. Go up the inheritance hierarchy
9306 until we find the most derived class of which we are a primary base:
9307 it is the BINFO_VIRTUALS there that we need to consider. */
9308 non_primary_binfo
= binfo
;
9309 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo
))
9313 /* If we have reached a virtual base, then it must be vid->vbase,
9314 because we ignore other virtual bases in
9315 add_vcall_offset_vtbl_entries_r. In turn, it must be a primary
9316 base (possibly multi-level) of vid->binfo, or we wouldn't
9317 have called build_vcall_and_vbase_vtbl_entries for it. But it
9318 might be a lost primary, so just skip down to vid->binfo. */
9319 if (BINFO_VIRTUAL_P (non_primary_binfo
))
9321 gcc_assert (non_primary_binfo
== vid
->vbase
);
9322 non_primary_binfo
= vid
->binfo
;
9326 b
= BINFO_INHERITANCE_CHAIN (non_primary_binfo
);
9327 if (get_primary_binfo (b
) != non_primary_binfo
)
9329 non_primary_binfo
= b
;
9332 if (vid
->ctor_vtbl_p
)
9333 /* For a ctor vtable we need the equivalent binfo within the hierarchy
9334 where rtti_binfo is the most derived type. */
9336 = original_binfo (non_primary_binfo
, vid
->rtti_binfo
);
9338 for (base_virtuals
= BINFO_VIRTUALS (binfo
),
9339 derived_virtuals
= BINFO_VIRTUALS (non_primary_binfo
),
9340 orig_virtuals
= BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo
)));
9342 base_virtuals
= TREE_CHAIN (base_virtuals
),
9343 derived_virtuals
= TREE_CHAIN (derived_virtuals
),
9344 orig_virtuals
= TREE_CHAIN (orig_virtuals
))
9348 /* Find the declaration that originally caused this function to
9349 be present in BINFO_TYPE (binfo). */
9350 orig_fn
= BV_FN (orig_virtuals
);
9352 /* When processing BINFO, we only want to generate vcall slots for
9353 function slots introduced in BINFO. So don't try to generate
9354 one if the function isn't even defined in BINFO. */
9355 if (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), DECL_CONTEXT (orig_fn
)))
9358 add_vcall_offset (orig_fn
, binfo
, vid
);
9363 /* Add a vcall offset entry for ORIG_FN to the vtable. */
9366 add_vcall_offset (tree orig_fn
, tree binfo
, vtbl_init_data
*vid
)
9372 /* If there is already an entry for a function with the same
9373 signature as FN, then we do not need a second vcall offset.
9374 Check the list of functions already present in the derived
9376 FOR_EACH_VEC_SAFE_ELT (vid
->fns
, i
, derived_entry
)
9378 if (same_signature_p (derived_entry
, orig_fn
)
9379 /* We only use one vcall offset for virtual destructors,
9380 even though there are two virtual table entries. */
9381 || (DECL_DESTRUCTOR_P (derived_entry
)
9382 && DECL_DESTRUCTOR_P (orig_fn
)))
9386 /* If we are building these vcall offsets as part of building
9387 the vtable for the most derived class, remember the vcall
9389 if (vid
->binfo
== TYPE_BINFO (vid
->derived
))
9391 tree_pair_s elt
= {orig_fn
, vid
->index
};
9392 vec_safe_push (CLASSTYPE_VCALL_INDICES (vid
->derived
), elt
);
9395 /* The next vcall offset will be found at a more negative
9397 vid
->index
= size_binop (MINUS_EXPR
, vid
->index
,
9398 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE
));
9400 /* Keep track of this function. */
9401 vec_safe_push (vid
->fns
, orig_fn
);
9403 if (vid
->generate_vcall_entries
)
9408 /* Find the overriding function. */
9409 fn
= find_final_overrider (vid
->rtti_binfo
, binfo
, orig_fn
);
9410 if (fn
== error_mark_node
)
9411 vcall_offset
= build_zero_cst (vtable_entry_type
);
9414 base
= TREE_VALUE (fn
);
9416 /* The vbase we're working on is a primary base of
9417 vid->binfo. But it might be a lost primary, so its
9418 BINFO_OFFSET might be wrong, so we just use the
9419 BINFO_OFFSET from vid->binfo. */
9420 vcall_offset
= size_diffop_loc (input_location
,
9421 BINFO_OFFSET (base
),
9422 BINFO_OFFSET (vid
->binfo
));
9423 vcall_offset
= fold_build1_loc (input_location
,
9424 NOP_EXPR
, vtable_entry_type
,
9427 /* Add the initializer to the vtable. */
9428 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, vcall_offset
);
9432 /* Return vtbl initializers for the RTTI entries corresponding to the
9433 BINFO's vtable. The RTTI entries should indicate the object given
9434 by VID->rtti_binfo. */
9437 build_rtti_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9445 t
= BINFO_TYPE (vid
->rtti_binfo
);
9447 /* To find the complete object, we will first convert to our most
9448 primary base, and then add the offset in the vtbl to that value. */
9450 while (CLASSTYPE_HAS_PRIMARY_BASE_P (BINFO_TYPE (b
))
9451 && !BINFO_LOST_PRIMARY_P (b
))
9455 primary_base
= get_primary_binfo (b
);
9456 gcc_assert (BINFO_PRIMARY_P (primary_base
)
9457 && BINFO_INHERITANCE_CHAIN (primary_base
) == b
);
9460 offset
= size_diffop_loc (input_location
,
9461 BINFO_OFFSET (vid
->rtti_binfo
), BINFO_OFFSET (b
));
9463 /* The second entry is the address of the typeinfo object. */
9465 decl
= build_address (get_tinfo_decl (t
));
9467 decl
= integer_zero_node
;
9469 /* Convert the declaration to a type that can be stored in the
9471 init
= build_nop (vfunc_ptr_type_node
, decl
);
9472 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, init
);
9474 /* Add the offset-to-top entry. It comes earlier in the vtable than
9475 the typeinfo entry. Convert the offset to look like a
9476 function pointer, so that we can put it in the vtable. */
9477 init
= build_nop (vfunc_ptr_type_node
, offset
);
9478 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, init
);
9481 /* TRUE iff TYPE is uniquely derived from PARENT. Ignores
9485 uniquely_derived_from_p (tree parent
, tree type
)
9487 tree base
= lookup_base (type
, parent
, ba_unique
, NULL
, tf_none
);
9488 return base
&& base
!= error_mark_node
;
9491 /* TRUE iff TYPE is publicly & uniquely derived from PARENT. */
9494 publicly_uniquely_derived_p (tree parent
, tree type
)
9496 tree base
= lookup_base (type
, parent
, ba_ignore_scope
| ba_check
,
9498 return base
&& base
!= error_mark_node
;
9501 /* CTX1 and CTX2 are declaration contexts. Return the innermost common
9502 class between them, if any. */
9505 common_enclosing_class (tree ctx1
, tree ctx2
)
9507 if (!TYPE_P (ctx1
) || !TYPE_P (ctx2
))
9509 gcc_assert (ctx1
== TYPE_MAIN_VARIANT (ctx1
)
9510 && ctx2
== TYPE_MAIN_VARIANT (ctx2
));
9513 for (tree t
= ctx1
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9514 TYPE_MARKED_P (t
) = true;
9515 tree found
= NULL_TREE
;
9516 for (tree t
= ctx2
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9517 if (TYPE_MARKED_P (t
))
9522 for (tree t
= ctx1
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9523 TYPE_MARKED_P (t
) = false;
9527 #include "gt-cp-class.h"