1 /* Functions related to building classes and their related objects.
2 Copyright (C) 1987-2015 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"
30 #include "double-int.h"
39 #include "stringpool.h"
40 #include "stor-layout.h"
42 #include "hash-table.h"
50 #include "plugin-api.h"
51 #include "hard-reg-set.h"
57 #include "splay-tree.h"
61 /* The number of nested classes being processed. If we are not in the
62 scope of any class, this is zero. */
64 int current_class_depth
;
66 /* In order to deal with nested classes, we keep a stack of classes.
67 The topmost entry is the innermost class, and is the entry at index
68 CURRENT_CLASS_DEPTH */
70 typedef struct class_stack_node
{
71 /* The name of the class. */
74 /* The _TYPE node for the class. */
77 /* The access specifier pending for new declarations in the scope of
81 /* If were defining TYPE, the names used in this class. */
82 splay_tree names_used
;
84 /* Nonzero if this class is no longer open, because of a call to
87 }* class_stack_node_t
;
89 typedef struct vtbl_init_data_s
91 /* The base for which we're building initializers. */
93 /* The type of the most-derived type. */
95 /* The binfo for the dynamic type. This will be TYPE_BINFO (derived),
96 unless ctor_vtbl_p is true. */
98 /* The negative-index vtable initializers built up so far. These
99 are in order from least negative index to most negative index. */
100 vec
<constructor_elt
, va_gc
> *inits
;
101 /* The binfo for the virtual base for which we're building
102 vcall offset initializers. */
104 /* The functions in vbase for which we have already provided vcall
106 vec
<tree
, va_gc
> *fns
;
107 /* The vtable index of the next vcall or vbase offset. */
109 /* Nonzero if we are building the initializer for the primary
112 /* Nonzero if we are building the initializer for a construction
115 /* True when adding vcall offset entries to the vtable. False when
116 merely computing the indices. */
117 bool generate_vcall_entries
;
120 /* The type of a function passed to walk_subobject_offsets. */
121 typedef int (*subobject_offset_fn
) (tree
, tree
, splay_tree
);
123 /* The stack itself. This is a dynamically resized array. The
124 number of elements allocated is CURRENT_CLASS_STACK_SIZE. */
125 static int current_class_stack_size
;
126 static class_stack_node_t current_class_stack
;
128 /* The size of the largest empty class seen in this translation unit. */
129 static GTY (()) tree sizeof_biggest_empty_class
;
131 /* An array of all local classes present in this translation unit, in
132 declaration order. */
133 vec
<tree
, va_gc
> *local_classes
;
135 static tree
get_vfield_name (tree
);
136 static void finish_struct_anon (tree
);
137 static tree
get_vtable_name (tree
);
138 static void get_basefndecls (tree
, tree
, vec
<tree
> *);
139 static int build_primary_vtable (tree
, tree
);
140 static int build_secondary_vtable (tree
);
141 static void finish_vtbls (tree
);
142 static void modify_vtable_entry (tree
, tree
, tree
, tree
, tree
*);
143 static void finish_struct_bits (tree
);
144 static int alter_access (tree
, tree
, tree
);
145 static void handle_using_decl (tree
, tree
);
146 static tree
dfs_modify_vtables (tree
, void *);
147 static tree
modify_all_vtables (tree
, tree
);
148 static void determine_primary_bases (tree
);
149 static void finish_struct_methods (tree
);
150 static void maybe_warn_about_overly_private_class (tree
);
151 static int method_name_cmp (const void *, const void *);
152 static int resort_method_name_cmp (const void *, const void *);
153 static void add_implicitly_declared_members (tree
, tree
*, int, int);
154 static tree
fixed_type_or_null (tree
, int *, int *);
155 static tree
build_simple_base_path (tree expr
, tree binfo
);
156 static tree
build_vtbl_ref_1 (tree
, tree
);
157 static void build_vtbl_initializer (tree
, tree
, tree
, tree
, int *,
158 vec
<constructor_elt
, va_gc
> **);
159 static int count_fields (tree
);
160 static int add_fields_to_record_type (tree
, struct sorted_fields_type
*, int);
161 static void insert_into_classtype_sorted_fields (tree
, tree
, int);
162 static bool check_bitfield_decl (tree
);
163 static void check_field_decl (tree
, tree
, int *, int *, int *);
164 static void check_field_decls (tree
, tree
*, int *, int *);
165 static tree
*build_base_field (record_layout_info
, tree
, splay_tree
, tree
*);
166 static void build_base_fields (record_layout_info
, splay_tree
, tree
*);
167 static void check_methods (tree
);
168 static void remove_zero_width_bit_fields (tree
);
169 static bool accessible_nvdtor_p (tree
);
170 static void check_bases (tree
, int *, int *);
171 static void check_bases_and_members (tree
);
172 static tree
create_vtable_ptr (tree
, tree
*);
173 static void include_empty_classes (record_layout_info
);
174 static void layout_class_type (tree
, tree
*);
175 static void propagate_binfo_offsets (tree
, tree
);
176 static void layout_virtual_bases (record_layout_info
, splay_tree
);
177 static void build_vbase_offset_vtbl_entries (tree
, vtbl_init_data
*);
178 static void add_vcall_offset_vtbl_entries_r (tree
, vtbl_init_data
*);
179 static void add_vcall_offset_vtbl_entries_1 (tree
, vtbl_init_data
*);
180 static void build_vcall_offset_vtbl_entries (tree
, vtbl_init_data
*);
181 static void add_vcall_offset (tree
, tree
, vtbl_init_data
*);
182 static void layout_vtable_decl (tree
, int);
183 static tree
dfs_find_final_overrider_pre (tree
, void *);
184 static tree
dfs_find_final_overrider_post (tree
, void *);
185 static tree
find_final_overrider (tree
, tree
, tree
);
186 static int make_new_vtable (tree
, tree
);
187 static tree
get_primary_binfo (tree
);
188 static int maybe_indent_hierarchy (FILE *, int, int);
189 static tree
dump_class_hierarchy_r (FILE *, int, tree
, tree
, int);
190 static void dump_class_hierarchy (tree
);
191 static void dump_class_hierarchy_1 (FILE *, int, tree
);
192 static void dump_array (FILE *, tree
);
193 static void dump_vtable (tree
, tree
, tree
);
194 static void dump_vtt (tree
, tree
);
195 static void dump_thunk (FILE *, int, tree
);
196 static tree
build_vtable (tree
, tree
, tree
);
197 static void initialize_vtable (tree
, vec
<constructor_elt
, va_gc
> *);
198 static void layout_nonempty_base_or_field (record_layout_info
,
199 tree
, tree
, splay_tree
);
200 static tree
end_of_class (tree
, int);
201 static bool layout_empty_base (record_layout_info
, tree
, tree
, splay_tree
);
202 static void accumulate_vtbl_inits (tree
, tree
, tree
, tree
, tree
,
203 vec
<constructor_elt
, va_gc
> **);
204 static void dfs_accumulate_vtbl_inits (tree
, tree
, tree
, tree
, tree
,
205 vec
<constructor_elt
, va_gc
> **);
206 static void build_rtti_vtbl_entries (tree
, vtbl_init_data
*);
207 static void build_vcall_and_vbase_vtbl_entries (tree
, vtbl_init_data
*);
208 static void clone_constructors_and_destructors (tree
);
209 static tree
build_clone (tree
, tree
);
210 static void update_vtable_entry_for_fn (tree
, tree
, tree
, tree
*, unsigned);
211 static void build_ctor_vtbl_group (tree
, tree
);
212 static void build_vtt (tree
);
213 static tree
binfo_ctor_vtable (tree
);
214 static void build_vtt_inits (tree
, tree
, vec
<constructor_elt
, va_gc
> **,
216 static tree
dfs_build_secondary_vptr_vtt_inits (tree
, void *);
217 static tree
dfs_fixup_binfo_vtbls (tree
, void *);
218 static int record_subobject_offset (tree
, tree
, splay_tree
);
219 static int check_subobject_offset (tree
, tree
, splay_tree
);
220 static int walk_subobject_offsets (tree
, subobject_offset_fn
,
221 tree
, splay_tree
, tree
, int);
222 static void record_subobject_offsets (tree
, tree
, splay_tree
, bool);
223 static int layout_conflict_p (tree
, tree
, splay_tree
, int);
224 static int splay_tree_compare_integer_csts (splay_tree_key k1
,
226 static void warn_about_ambiguous_bases (tree
);
227 static bool type_requires_array_cookie (tree
);
228 static bool base_derived_from (tree
, tree
);
229 static int empty_base_at_nonzero_offset_p (tree
, tree
, splay_tree
);
230 static tree
end_of_base (tree
);
231 static tree
get_vcall_index (tree
, tree
);
233 /* Variables shared between class.c and call.c. */
236 int n_vtable_entries
= 0;
237 int n_vtable_searches
= 0;
238 int n_vtable_elems
= 0;
239 int n_convert_harshness
= 0;
240 int n_compute_conversion_costs
= 0;
241 int n_inner_fields_searched
= 0;
243 /* Convert to or from a base subobject. EXPR is an expression of type
244 `A' or `A*', an expression of type `B' or `B*' is returned. To
245 convert A to a base B, CODE is PLUS_EXPR and BINFO is the binfo for
246 the B base instance within A. To convert base A to derived B, CODE
247 is MINUS_EXPR and BINFO is the binfo for the A instance within B.
248 In this latter case, A must not be a morally virtual base of B.
249 NONNULL is true if EXPR is known to be non-NULL (this is only
250 needed when EXPR is of pointer type). CV qualifiers are preserved
254 build_base_path (enum tree_code code
,
258 tsubst_flags_t complain
)
260 tree v_binfo
= NULL_TREE
;
261 tree d_binfo
= NULL_TREE
;
265 tree null_test
= NULL
;
266 tree ptr_target_type
;
268 int want_pointer
= TYPE_PTR_P (TREE_TYPE (expr
));
269 bool has_empty
= false;
273 if (expr
== error_mark_node
|| binfo
== error_mark_node
|| !binfo
)
274 return error_mark_node
;
276 for (probe
= binfo
; probe
; probe
= BINFO_INHERITANCE_CHAIN (probe
))
279 if (is_empty_class (BINFO_TYPE (probe
)))
281 if (!v_binfo
&& BINFO_VIRTUAL_P (probe
))
285 probe
= TYPE_MAIN_VARIANT (TREE_TYPE (expr
));
287 probe
= TYPE_MAIN_VARIANT (TREE_TYPE (probe
));
289 if (code
== PLUS_EXPR
290 && !SAME_BINFO_TYPE_P (BINFO_TYPE (d_binfo
), probe
))
292 /* This can happen when adjust_result_of_qualified_name_lookup can't
293 find a unique base binfo in a call to a member function. We
294 couldn't give the diagnostic then since we might have been calling
295 a static member function, so we do it now. */
296 if (complain
& tf_error
)
298 tree base
= lookup_base (probe
, BINFO_TYPE (d_binfo
),
299 ba_unique
, NULL
, complain
);
300 gcc_assert (base
== error_mark_node
);
302 return error_mark_node
;
305 gcc_assert ((code
== MINUS_EXPR
306 && SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), probe
))
307 || code
== PLUS_EXPR
);
309 if (binfo
== d_binfo
)
313 if (code
== MINUS_EXPR
&& v_binfo
)
315 if (complain
& tf_error
)
317 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), BINFO_TYPE (v_binfo
)))
320 error ("cannot convert from pointer to base class %qT to "
321 "pointer to derived class %qT because the base is "
322 "virtual", BINFO_TYPE (binfo
), BINFO_TYPE (d_binfo
));
324 error ("cannot convert from base class %qT to derived "
325 "class %qT because the base is virtual",
326 BINFO_TYPE (binfo
), BINFO_TYPE (d_binfo
));
331 error ("cannot convert from pointer to base class %qT to "
332 "pointer to derived class %qT via virtual base %qT",
333 BINFO_TYPE (binfo
), BINFO_TYPE (d_binfo
),
334 BINFO_TYPE (v_binfo
));
336 error ("cannot convert from base class %qT to derived "
337 "class %qT via virtual base %qT", BINFO_TYPE (binfo
),
338 BINFO_TYPE (d_binfo
), BINFO_TYPE (v_binfo
));
341 return error_mark_node
;
346 rvalue
= !real_lvalue_p (expr
);
347 /* This must happen before the call to save_expr. */
348 expr
= cp_build_addr_expr (expr
, complain
);
351 expr
= mark_rvalue_use (expr
);
353 offset
= BINFO_OFFSET (binfo
);
354 fixed_type_p
= resolves_to_fixed_type_p (expr
, &nonnull
);
355 target_type
= code
== PLUS_EXPR
? BINFO_TYPE (binfo
) : BINFO_TYPE (d_binfo
);
356 /* TARGET_TYPE has been extracted from BINFO, and, is therefore always
357 cv-unqualified. Extract the cv-qualifiers from EXPR so that the
358 expression returned matches the input. */
359 target_type
= cp_build_qualified_type
360 (target_type
, cp_type_quals (TREE_TYPE (TREE_TYPE (expr
))));
361 ptr_target_type
= build_pointer_type (target_type
);
363 /* Do we need to look in the vtable for the real offset? */
364 virtual_access
= (v_binfo
&& fixed_type_p
<= 0);
366 /* Don't bother with the calculations inside sizeof; they'll ICE if the
367 source type is incomplete and the pointer value doesn't matter. In a
368 template (even in instantiate_non_dependent_expr), we don't have vtables
369 set up properly yet, and the value doesn't matter there either; we're
370 just interested in the result of overload resolution. */
371 if (cp_unevaluated_operand
!= 0
372 || in_template_function ())
374 expr
= build_nop (ptr_target_type
, expr
);
378 /* If we're in an NSDMI, we don't have the full constructor context yet
379 that we need for converting to a virtual base, so just build a stub
380 CONVERT_EXPR and expand it later in bot_replace. */
381 if (virtual_access
&& fixed_type_p
< 0
382 && current_scope () != current_function_decl
)
384 expr
= build1 (CONVERT_EXPR
, ptr_target_type
, expr
);
385 CONVERT_EXPR_VBASE_PATH (expr
) = true;
389 /* Do we need to check for a null pointer? */
390 if (want_pointer
&& !nonnull
)
392 /* If we know the conversion will not actually change the value
393 of EXPR, then we can avoid testing the expression for NULL.
394 We have to avoid generating a COMPONENT_REF for a base class
395 field, because other parts of the compiler know that such
396 expressions are always non-NULL. */
397 if (!virtual_access
&& integer_zerop (offset
))
398 return build_nop (ptr_target_type
, expr
);
399 null_test
= error_mark_node
;
402 /* Protect against multiple evaluation if necessary. */
403 if (TREE_SIDE_EFFECTS (expr
) && (null_test
|| virtual_access
))
404 expr
= save_expr (expr
);
406 /* Now that we've saved expr, build the real null test. */
409 tree zero
= cp_convert (TREE_TYPE (expr
), nullptr_node
, complain
);
410 null_test
= fold_build2_loc (input_location
, NE_EXPR
, boolean_type_node
,
414 /* If this is a simple base reference, express it as a COMPONENT_REF. */
415 if (code
== PLUS_EXPR
&& !virtual_access
416 /* We don't build base fields for empty bases, and they aren't very
417 interesting to the optimizers anyway. */
420 expr
= cp_build_indirect_ref (expr
, RO_NULL
, complain
);
421 expr
= build_simple_base_path (expr
, binfo
);
425 expr
= build_address (expr
);
426 target_type
= TREE_TYPE (expr
);
432 /* Going via virtual base V_BINFO. We need the static offset
433 from V_BINFO to BINFO, and the dynamic offset from D_BINFO to
434 V_BINFO. That offset is an entry in D_BINFO's vtable. */
437 if (fixed_type_p
< 0 && in_base_initializer
)
439 /* In a base member initializer, we cannot rely on the
440 vtable being set up. We have to indirect via the
444 t
= TREE_TYPE (TYPE_VFIELD (current_class_type
));
445 t
= build_pointer_type (t
);
446 v_offset
= convert (t
, current_vtt_parm
);
447 v_offset
= cp_build_indirect_ref (v_offset
, RO_NULL
, complain
);
452 if ((flag_sanitize
& SANITIZE_VPTR
) && fixed_type_p
== 0)
454 t
= cp_ubsan_maybe_instrument_cast_to_vbase (input_location
,
459 v_offset
= build_vfield_ref (cp_build_indirect_ref (t
, RO_NULL
,
461 TREE_TYPE (TREE_TYPE (expr
)));
464 if (v_offset
== error_mark_node
)
465 return error_mark_node
;
467 v_offset
= fold_build_pointer_plus (v_offset
, BINFO_VPTR_FIELD (v_binfo
));
468 v_offset
= build1 (NOP_EXPR
,
469 build_pointer_type (ptrdiff_type_node
),
471 v_offset
= cp_build_indirect_ref (v_offset
, RO_NULL
, complain
);
472 TREE_CONSTANT (v_offset
) = 1;
474 offset
= convert_to_integer (ptrdiff_type_node
,
475 size_diffop_loc (input_location
, offset
,
476 BINFO_OFFSET (v_binfo
)));
478 if (!integer_zerop (offset
))
479 v_offset
= build2 (code
, ptrdiff_type_node
, v_offset
, offset
);
481 if (fixed_type_p
< 0)
482 /* Negative fixed_type_p means this is a constructor or destructor;
483 virtual base layout is fixed in in-charge [cd]tors, but not in
485 offset
= build3 (COND_EXPR
, ptrdiff_type_node
,
486 build2 (EQ_EXPR
, boolean_type_node
,
487 current_in_charge_parm
, integer_zero_node
),
489 convert_to_integer (ptrdiff_type_node
,
490 BINFO_OFFSET (binfo
)));
496 target_type
= ptr_target_type
;
498 expr
= build1 (NOP_EXPR
, ptr_target_type
, expr
);
500 if (!integer_zerop (offset
))
502 offset
= fold_convert (sizetype
, offset
);
503 if (code
== MINUS_EXPR
)
504 offset
= fold_build1_loc (input_location
, NEGATE_EXPR
, sizetype
, offset
);
505 expr
= fold_build_pointer_plus (expr
, offset
);
513 expr
= cp_build_indirect_ref (expr
, RO_NULL
, complain
);
520 expr
= fold_build3_loc (input_location
, COND_EXPR
, target_type
, null_test
, expr
,
521 build_zero_cst (target_type
));
526 /* Subroutine of build_base_path; EXPR and BINFO are as in that function.
527 Perform a derived-to-base conversion by recursively building up a
528 sequence of COMPONENT_REFs to the appropriate base fields. */
531 build_simple_base_path (tree expr
, tree binfo
)
533 tree type
= BINFO_TYPE (binfo
);
534 tree d_binfo
= BINFO_INHERITANCE_CHAIN (binfo
);
537 if (d_binfo
== NULL_TREE
)
541 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (expr
)) == type
);
543 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x'
544 into `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only
545 an lvalue in the front end; only _DECLs and _REFs are lvalues
547 temp
= unary_complex_lvalue (ADDR_EXPR
, expr
);
549 expr
= cp_build_indirect_ref (temp
, RO_NULL
, tf_warning_or_error
);
555 expr
= build_simple_base_path (expr
, d_binfo
);
557 for (field
= TYPE_FIELDS (BINFO_TYPE (d_binfo
));
558 field
; field
= DECL_CHAIN (field
))
559 /* Is this the base field created by build_base_field? */
560 if (TREE_CODE (field
) == FIELD_DECL
561 && DECL_FIELD_IS_BASE (field
)
562 && TREE_TYPE (field
) == type
563 /* If we're looking for a field in the most-derived class,
564 also check the field offset; we can have two base fields
565 of the same type if one is an indirect virtual base and one
566 is a direct non-virtual base. */
567 && (BINFO_INHERITANCE_CHAIN (d_binfo
)
568 || tree_int_cst_equal (byte_position (field
),
569 BINFO_OFFSET (binfo
))))
571 /* We don't use build_class_member_access_expr here, as that
572 has unnecessary checks, and more importantly results in
573 recursive calls to dfs_walk_once. */
574 int type_quals
= cp_type_quals (TREE_TYPE (expr
));
576 expr
= build3 (COMPONENT_REF
,
577 cp_build_qualified_type (type
, type_quals
),
578 expr
, field
, NULL_TREE
);
579 expr
= fold_if_not_in_template (expr
);
581 /* Mark the expression const or volatile, as appropriate.
582 Even though we've dealt with the type above, we still have
583 to mark the expression itself. */
584 if (type_quals
& TYPE_QUAL_CONST
)
585 TREE_READONLY (expr
) = 1;
586 if (type_quals
& TYPE_QUAL_VOLATILE
)
587 TREE_THIS_VOLATILE (expr
) = 1;
592 /* Didn't find the base field?!? */
596 /* Convert OBJECT to the base TYPE. OBJECT is an expression whose
597 type is a class type or a pointer to a class type. In the former
598 case, TYPE is also a class type; in the latter it is another
599 pointer type. If CHECK_ACCESS is true, an error message is emitted
600 if TYPE is inaccessible. If OBJECT has pointer type, the value is
601 assumed to be non-NULL. */
604 convert_to_base (tree object
, tree type
, bool check_access
, bool nonnull
,
605 tsubst_flags_t complain
)
610 if (TYPE_PTR_P (TREE_TYPE (object
)))
612 object_type
= TREE_TYPE (TREE_TYPE (object
));
613 type
= TREE_TYPE (type
);
616 object_type
= TREE_TYPE (object
);
618 binfo
= lookup_base (object_type
, type
, check_access
? ba_check
: ba_unique
,
620 if (!binfo
|| binfo
== error_mark_node
)
621 return error_mark_node
;
623 return build_base_path (PLUS_EXPR
, object
, binfo
, nonnull
, complain
);
626 /* EXPR is an expression with unqualified class type. BASE is a base
627 binfo of that class type. Returns EXPR, converted to the BASE
628 type. This function assumes that EXPR is the most derived class;
629 therefore virtual bases can be found at their static offsets. */
632 convert_to_base_statically (tree expr
, tree base
)
636 expr_type
= TREE_TYPE (expr
);
637 if (!SAME_BINFO_TYPE_P (BINFO_TYPE (base
), expr_type
))
639 /* If this is a non-empty base, use a COMPONENT_REF. */
640 if (!is_empty_class (BINFO_TYPE (base
)))
641 return build_simple_base_path (expr
, base
);
643 /* We use fold_build2 and fold_convert below to simplify the trees
644 provided to the optimizers. It is not safe to call these functions
645 when processing a template because they do not handle C++-specific
647 gcc_assert (!processing_template_decl
);
648 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
649 if (!integer_zerop (BINFO_OFFSET (base
)))
650 expr
= fold_build_pointer_plus_loc (input_location
,
651 expr
, BINFO_OFFSET (base
));
652 expr
= fold_convert (build_pointer_type (BINFO_TYPE (base
)), expr
);
653 expr
= build_fold_indirect_ref_loc (input_location
, expr
);
661 build_vfield_ref (tree datum
, tree type
)
663 tree vfield
, vcontext
;
665 if (datum
== error_mark_node
666 /* Can happen in case of duplicate base types (c++/59082). */
667 || !TYPE_VFIELD (type
))
668 return error_mark_node
;
670 /* First, convert to the requested type. */
671 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (datum
), type
))
672 datum
= convert_to_base (datum
, type
, /*check_access=*/false,
673 /*nonnull=*/true, tf_warning_or_error
);
675 /* Second, the requested type may not be the owner of its own vptr.
676 If not, convert to the base class that owns it. We cannot use
677 convert_to_base here, because VCONTEXT may appear more than once
678 in the inheritance hierarchy of TYPE, and thus direct conversion
679 between the types may be ambiguous. Following the path back up
680 one step at a time via primary bases avoids the problem. */
681 vfield
= TYPE_VFIELD (type
);
682 vcontext
= DECL_CONTEXT (vfield
);
683 while (!same_type_ignoring_top_level_qualifiers_p (vcontext
, type
))
685 datum
= build_simple_base_path (datum
, CLASSTYPE_PRIMARY_BINFO (type
));
686 type
= TREE_TYPE (datum
);
689 return build3 (COMPONENT_REF
, TREE_TYPE (vfield
), datum
, vfield
, NULL_TREE
);
692 /* Given an object INSTANCE, return an expression which yields the
693 vtable element corresponding to INDEX. There are many special
694 cases for INSTANCE which we take care of here, mainly to avoid
695 creating extra tree nodes when we don't have to. */
698 build_vtbl_ref_1 (tree instance
, tree idx
)
701 tree vtbl
= NULL_TREE
;
703 /* Try to figure out what a reference refers to, and
704 access its virtual function table directly. */
707 tree fixed_type
= fixed_type_or_null (instance
, NULL
, &cdtorp
);
709 tree basetype
= non_reference (TREE_TYPE (instance
));
711 if (fixed_type
&& !cdtorp
)
713 tree binfo
= lookup_base (fixed_type
, basetype
,
714 ba_unique
, NULL
, tf_none
);
715 if (binfo
&& binfo
!= error_mark_node
)
716 vtbl
= unshare_expr (BINFO_VTABLE (binfo
));
720 vtbl
= build_vfield_ref (instance
, basetype
);
722 aref
= build_array_ref (input_location
, vtbl
, idx
);
723 TREE_CONSTANT (aref
) |= TREE_CONSTANT (vtbl
) && TREE_CONSTANT (idx
);
729 build_vtbl_ref (tree instance
, tree idx
)
731 tree aref
= build_vtbl_ref_1 (instance
, idx
);
736 /* Given a stable object pointer INSTANCE_PTR, return an expression which
737 yields a function pointer corresponding to vtable element INDEX. */
740 build_vfn_ref (tree instance_ptr
, tree idx
)
744 aref
= build_vtbl_ref_1 (cp_build_indirect_ref (instance_ptr
, RO_NULL
,
745 tf_warning_or_error
),
748 /* When using function descriptors, the address of the
749 vtable entry is treated as a function pointer. */
750 if (TARGET_VTABLE_USES_DESCRIPTORS
)
751 aref
= build1 (NOP_EXPR
, TREE_TYPE (aref
),
752 cp_build_addr_expr (aref
, tf_warning_or_error
));
754 /* Remember this as a method reference, for later devirtualization. */
755 aref
= build3 (OBJ_TYPE_REF
, TREE_TYPE (aref
), aref
, instance_ptr
, idx
);
760 /* Return the name of the virtual function table (as an IDENTIFIER_NODE)
761 for the given TYPE. */
764 get_vtable_name (tree type
)
766 return mangle_vtbl_for_type (type
);
769 /* DECL is an entity associated with TYPE, like a virtual table or an
770 implicitly generated constructor. Determine whether or not DECL
771 should have external or internal linkage at the object file
772 level. This routine does not deal with COMDAT linkage and other
773 similar complexities; it simply sets TREE_PUBLIC if it possible for
774 entities in other translation units to contain copies of DECL, in
778 set_linkage_according_to_type (tree
/*type*/, tree decl
)
780 TREE_PUBLIC (decl
) = 1;
781 determine_visibility (decl
);
784 /* Create a VAR_DECL for a primary or secondary vtable for CLASS_TYPE.
785 (For a secondary vtable for B-in-D, CLASS_TYPE should be D, not B.)
786 Use NAME for the name of the vtable, and VTABLE_TYPE for its type. */
789 build_vtable (tree class_type
, tree name
, tree vtable_type
)
793 decl
= build_lang_decl (VAR_DECL
, name
, vtable_type
);
794 /* vtable names are already mangled; give them their DECL_ASSEMBLER_NAME
795 now to avoid confusion in mangle_decl. */
796 SET_DECL_ASSEMBLER_NAME (decl
, name
);
797 DECL_CONTEXT (decl
) = class_type
;
798 DECL_ARTIFICIAL (decl
) = 1;
799 TREE_STATIC (decl
) = 1;
800 TREE_READONLY (decl
) = 1;
801 DECL_VIRTUAL_P (decl
) = 1;
802 DECL_ALIGN (decl
) = TARGET_VTABLE_ENTRY_ALIGN
;
803 DECL_USER_ALIGN (decl
) = true;
804 DECL_VTABLE_OR_VTT_P (decl
) = 1;
805 set_linkage_according_to_type (class_type
, decl
);
806 /* The vtable has not been defined -- yet. */
807 DECL_EXTERNAL (decl
) = 1;
808 DECL_NOT_REALLY_EXTERN (decl
) = 1;
810 /* Mark the VAR_DECL node representing the vtable itself as a
811 "gratuitous" one, thereby forcing dwarfout.c to ignore it. It
812 is rather important that such things be ignored because any
813 effort to actually generate DWARF for them will run into
814 trouble when/if we encounter code like:
817 struct S { virtual void member (); };
819 because the artificial declaration of the vtable itself (as
820 manufactured by the g++ front end) will say that the vtable is
821 a static member of `S' but only *after* the debug output for
822 the definition of `S' has already been output. This causes
823 grief because the DWARF entry for the definition of the vtable
824 will try to refer back to an earlier *declaration* of the
825 vtable as a static member of `S' and there won't be one. We
826 might be able to arrange to have the "vtable static member"
827 attached to the member list for `S' before the debug info for
828 `S' get written (which would solve the problem) but that would
829 require more intrusive changes to the g++ front end. */
830 DECL_IGNORED_P (decl
) = 1;
835 /* Get the VAR_DECL of the vtable for TYPE. TYPE need not be polymorphic,
836 or even complete. If this does not exist, create it. If COMPLETE is
837 nonzero, then complete the definition of it -- that will render it
838 impossible to actually build the vtable, but is useful to get at those
839 which are known to exist in the runtime. */
842 get_vtable_decl (tree type
, int complete
)
846 if (CLASSTYPE_VTABLES (type
))
847 return CLASSTYPE_VTABLES (type
);
849 decl
= build_vtable (type
, get_vtable_name (type
), vtbl_type_node
);
850 CLASSTYPE_VTABLES (type
) = decl
;
854 DECL_EXTERNAL (decl
) = 1;
855 cp_finish_decl (decl
, NULL_TREE
, false, NULL_TREE
, 0);
861 /* Build the primary virtual function table for TYPE. If BINFO is
862 non-NULL, build the vtable starting with the initial approximation
863 that it is the same as the one which is the head of the association
864 list. Returns a nonzero value if a new vtable is actually
868 build_primary_vtable (tree binfo
, tree type
)
873 decl
= get_vtable_decl (type
, /*complete=*/0);
877 if (BINFO_NEW_VTABLE_MARKED (binfo
))
878 /* We have already created a vtable for this base, so there's
879 no need to do it again. */
882 virtuals
= copy_list (BINFO_VIRTUALS (binfo
));
883 TREE_TYPE (decl
) = TREE_TYPE (get_vtbl_decl_for_binfo (binfo
));
884 DECL_SIZE (decl
) = TYPE_SIZE (TREE_TYPE (decl
));
885 DECL_SIZE_UNIT (decl
) = TYPE_SIZE_UNIT (TREE_TYPE (decl
));
889 gcc_assert (TREE_TYPE (decl
) == vtbl_type_node
);
890 virtuals
= NULL_TREE
;
893 if (GATHER_STATISTICS
)
896 n_vtable_elems
+= list_length (virtuals
);
899 /* Initialize the association list for this type, based
900 on our first approximation. */
901 BINFO_VTABLE (TYPE_BINFO (type
)) = decl
;
902 BINFO_VIRTUALS (TYPE_BINFO (type
)) = virtuals
;
903 SET_BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (type
));
907 /* Give BINFO a new virtual function table which is initialized
908 with a skeleton-copy of its original initialization. The only
909 entry that changes is the `delta' entry, so we can really
910 share a lot of structure.
912 FOR_TYPE is the most derived type which caused this table to
915 Returns nonzero if we haven't met BINFO before.
917 The order in which vtables are built (by calling this function) for
918 an object must remain the same, otherwise a binary incompatibility
922 build_secondary_vtable (tree binfo
)
924 if (BINFO_NEW_VTABLE_MARKED (binfo
))
925 /* We already created a vtable for this base. There's no need to
929 /* Remember that we've created a vtable for this BINFO, so that we
930 don't try to do so again. */
931 SET_BINFO_NEW_VTABLE_MARKED (binfo
);
933 /* Make fresh virtual list, so we can smash it later. */
934 BINFO_VIRTUALS (binfo
) = copy_list (BINFO_VIRTUALS (binfo
));
936 /* Secondary vtables are laid out as part of the same structure as
937 the primary vtable. */
938 BINFO_VTABLE (binfo
) = NULL_TREE
;
942 /* Create a new vtable for BINFO which is the hierarchy dominated by
943 T. Return nonzero if we actually created a new vtable. */
946 make_new_vtable (tree t
, tree binfo
)
948 if (binfo
== TYPE_BINFO (t
))
949 /* In this case, it is *type*'s vtable we are modifying. We start
950 with the approximation that its vtable is that of the
951 immediate base class. */
952 return build_primary_vtable (binfo
, t
);
954 /* This is our very own copy of `basetype' to play with. Later,
955 we will fill in all the virtual functions that override the
956 virtual functions in these base classes which are not defined
957 by the current type. */
958 return build_secondary_vtable (binfo
);
961 /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO
962 (which is in the hierarchy dominated by T) list FNDECL as its
963 BV_FN. DELTA is the required constant adjustment from the `this'
964 pointer where the vtable entry appears to the `this' required when
965 the function is actually called. */
968 modify_vtable_entry (tree t
,
978 if (fndecl
!= BV_FN (v
)
979 || !tree_int_cst_equal (delta
, BV_DELTA (v
)))
981 /* We need a new vtable for BINFO. */
982 if (make_new_vtable (t
, binfo
))
984 /* If we really did make a new vtable, we also made a copy
985 of the BINFO_VIRTUALS list. Now, we have to find the
986 corresponding entry in that list. */
987 *virtuals
= BINFO_VIRTUALS (binfo
);
988 while (BV_FN (*virtuals
) != BV_FN (v
))
989 *virtuals
= TREE_CHAIN (*virtuals
);
993 BV_DELTA (v
) = delta
;
994 BV_VCALL_INDEX (v
) = NULL_TREE
;
1000 /* Add method METHOD to class TYPE. If USING_DECL is non-null, it is
1001 the USING_DECL naming METHOD. Returns true if the method could be
1002 added to the method vec. */
1005 add_method (tree type
, tree method
, tree using_decl
)
1009 bool template_conv_p
= false;
1011 vec
<tree
, va_gc
> *method_vec
;
1013 bool insert_p
= false;
1017 if (method
== error_mark_node
)
1020 complete_p
= COMPLETE_TYPE_P (type
);
1021 conv_p
= DECL_CONV_FN_P (method
);
1023 template_conv_p
= (TREE_CODE (method
) == TEMPLATE_DECL
1024 && DECL_TEMPLATE_CONV_FN_P (method
));
1026 method_vec
= CLASSTYPE_METHOD_VEC (type
);
1029 /* Make a new method vector. We start with 8 entries. We must
1030 allocate at least two (for constructors and destructors), and
1031 we're going to end up with an assignment operator at some
1033 vec_alloc (method_vec
, 8);
1034 /* Create slots for constructors and destructors. */
1035 method_vec
->quick_push (NULL_TREE
);
1036 method_vec
->quick_push (NULL_TREE
);
1037 CLASSTYPE_METHOD_VEC (type
) = method_vec
;
1040 /* Maintain TYPE_HAS_USER_CONSTRUCTOR, etc. */
1041 grok_special_member_properties (method
);
1043 /* Constructors and destructors go in special slots. */
1044 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (method
))
1045 slot
= CLASSTYPE_CONSTRUCTOR_SLOT
;
1046 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method
))
1048 slot
= CLASSTYPE_DESTRUCTOR_SLOT
;
1050 if (TYPE_FOR_JAVA (type
))
1052 if (!DECL_ARTIFICIAL (method
))
1053 error ("Java class %qT cannot have a destructor", type
);
1054 else if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
1055 error ("Java class %qT cannot have an implicit non-trivial "
1065 /* See if we already have an entry with this name. */
1066 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
1067 vec_safe_iterate (method_vec
, slot
, &m
);
1070 m
= OVL_CURRENT (m
);
1071 if (template_conv_p
)
1073 if (TREE_CODE (m
) == TEMPLATE_DECL
1074 && DECL_TEMPLATE_CONV_FN_P (m
))
1078 if (conv_p
&& !DECL_CONV_FN_P (m
))
1080 if (DECL_NAME (m
) == DECL_NAME (method
))
1086 && !DECL_CONV_FN_P (m
)
1087 && DECL_NAME (m
) > DECL_NAME (method
))
1091 current_fns
= insert_p
? NULL_TREE
: (*method_vec
)[slot
];
1093 /* Check to see if we've already got this method. */
1094 for (fns
= current_fns
; fns
; fns
= OVL_NEXT (fns
))
1096 tree fn
= OVL_CURRENT (fns
);
1102 if (TREE_CODE (fn
) != TREE_CODE (method
))
1105 /* [over.load] Member function declarations with the
1106 same name and the same parameter types cannot be
1107 overloaded if any of them is a static member
1108 function declaration.
1110 [over.load] Member function declarations with the same name and
1111 the same parameter-type-list as well as member function template
1112 declarations with the same name, the same parameter-type-list, and
1113 the same template parameter lists cannot be overloaded if any of
1114 them, but not all, have a ref-qualifier.
1116 [namespace.udecl] When a using-declaration brings names
1117 from a base class into a derived class scope, member
1118 functions in the derived class override and/or hide member
1119 functions with the same name and parameter types in a base
1120 class (rather than conflicting). */
1121 fn_type
= TREE_TYPE (fn
);
1122 method_type
= TREE_TYPE (method
);
1123 parms1
= TYPE_ARG_TYPES (fn_type
);
1124 parms2
= TYPE_ARG_TYPES (method_type
);
1126 /* Compare the quals on the 'this' parm. Don't compare
1127 the whole types, as used functions are treated as
1128 coming from the using class in overload resolution. */
1129 if (! DECL_STATIC_FUNCTION_P (fn
)
1130 && ! DECL_STATIC_FUNCTION_P (method
)
1131 /* Either both or neither need to be ref-qualified for
1132 differing quals to allow overloading. */
1133 && (FUNCTION_REF_QUALIFIED (fn_type
)
1134 == FUNCTION_REF_QUALIFIED (method_type
))
1135 && (type_memfn_quals (fn_type
) != type_memfn_quals (method_type
)
1136 || type_memfn_rqual (fn_type
) != type_memfn_rqual (method_type
)))
1139 /* For templates, the return type and template parameters
1140 must be identical. */
1141 if (TREE_CODE (fn
) == TEMPLATE_DECL
1142 && (!same_type_p (TREE_TYPE (fn_type
),
1143 TREE_TYPE (method_type
))
1144 || !comp_template_parms (DECL_TEMPLATE_PARMS (fn
),
1145 DECL_TEMPLATE_PARMS (method
))))
1148 if (! DECL_STATIC_FUNCTION_P (fn
))
1149 parms1
= TREE_CHAIN (parms1
);
1150 if (! DECL_STATIC_FUNCTION_P (method
))
1151 parms2
= TREE_CHAIN (parms2
);
1153 if (compparms (parms1
, parms2
)
1154 && (!DECL_CONV_FN_P (fn
)
1155 || same_type_p (TREE_TYPE (fn_type
),
1156 TREE_TYPE (method_type
))))
1158 /* For function versions, their parms and types match
1159 but they are not duplicates. Record function versions
1160 as and when they are found. extern "C" functions are
1161 not treated as versions. */
1162 if (TREE_CODE (fn
) == FUNCTION_DECL
1163 && TREE_CODE (method
) == FUNCTION_DECL
1164 && !DECL_EXTERN_C_P (fn
)
1165 && !DECL_EXTERN_C_P (method
)
1166 && targetm
.target_option
.function_versions (fn
, method
))
1168 /* Mark functions as versions if necessary. Modify the mangled
1169 decl name if necessary. */
1170 if (!DECL_FUNCTION_VERSIONED (fn
))
1172 DECL_FUNCTION_VERSIONED (fn
) = 1;
1173 if (DECL_ASSEMBLER_NAME_SET_P (fn
))
1176 if (!DECL_FUNCTION_VERSIONED (method
))
1178 DECL_FUNCTION_VERSIONED (method
) = 1;
1179 if (DECL_ASSEMBLER_NAME_SET_P (method
))
1180 mangle_decl (method
);
1182 cgraph_node::record_function_versions (fn
, method
);
1185 if (DECL_INHERITED_CTOR_BASE (method
))
1187 if (DECL_INHERITED_CTOR_BASE (fn
))
1189 error_at (DECL_SOURCE_LOCATION (method
),
1190 "%q#D inherited from %qT", method
,
1191 DECL_INHERITED_CTOR_BASE (method
));
1192 error_at (DECL_SOURCE_LOCATION (fn
),
1193 "conflicts with version inherited from %qT",
1194 DECL_INHERITED_CTOR_BASE (fn
));
1196 /* Otherwise defer to the other function. */
1201 if (DECL_CONTEXT (fn
) == type
)
1202 /* Defer to the local function. */
1207 error ("%q+#D cannot be overloaded", method
);
1208 error ("with %q+#D", fn
);
1211 /* We don't call duplicate_decls here to merge the
1212 declarations because that will confuse things if the
1213 methods have inline definitions. In particular, we
1214 will crash while processing the definitions. */
1219 /* A class should never have more than one destructor. */
1220 if (current_fns
&& DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method
))
1223 /* Add the new binding. */
1226 overload
= ovl_cons (method
, current_fns
);
1227 OVL_USED (overload
) = true;
1230 overload
= build_overload (method
, current_fns
);
1233 TYPE_HAS_CONVERSION (type
) = 1;
1234 else if (slot
>= CLASSTYPE_FIRST_CONVERSION_SLOT
&& !complete_p
)
1235 push_class_level_binding (DECL_NAME (method
), overload
);
1241 /* We only expect to add few methods in the COMPLETE_P case, so
1242 just make room for one more method in that case. */
1244 reallocated
= vec_safe_reserve_exact (method_vec
, 1);
1246 reallocated
= vec_safe_reserve (method_vec
, 1);
1248 CLASSTYPE_METHOD_VEC (type
) = method_vec
;
1249 if (slot
== method_vec
->length ())
1250 method_vec
->quick_push (overload
);
1252 method_vec
->quick_insert (slot
, overload
);
1255 /* Replace the current slot. */
1256 (*method_vec
)[slot
] = overload
;
1260 /* Subroutines of finish_struct. */
1262 /* Change the access of FDECL to ACCESS in T. Return 1 if change was
1263 legit, otherwise return 0. */
1266 alter_access (tree t
, tree fdecl
, tree access
)
1270 if (!DECL_LANG_SPECIFIC (fdecl
))
1271 retrofit_lang_decl (fdecl
);
1273 gcc_assert (!DECL_DISCRIMINATOR_P (fdecl
));
1275 elem
= purpose_member (t
, DECL_ACCESS (fdecl
));
1278 if (TREE_VALUE (elem
) != access
)
1280 if (TREE_CODE (TREE_TYPE (fdecl
)) == FUNCTION_DECL
)
1281 error ("conflicting access specifications for method"
1282 " %q+D, ignored", TREE_TYPE (fdecl
));
1284 error ("conflicting access specifications for field %qE, ignored",
1289 /* They're changing the access to the same thing they changed
1290 it to before. That's OK. */
1296 perform_or_defer_access_check (TYPE_BINFO (t
), fdecl
, fdecl
,
1297 tf_warning_or_error
);
1298 DECL_ACCESS (fdecl
) = tree_cons (t
, access
, DECL_ACCESS (fdecl
));
1304 /* Process the USING_DECL, which is a member of T. */
1307 handle_using_decl (tree using_decl
, tree t
)
1309 tree decl
= USING_DECL_DECLS (using_decl
);
1310 tree name
= DECL_NAME (using_decl
);
1312 = TREE_PRIVATE (using_decl
) ? access_private_node
1313 : TREE_PROTECTED (using_decl
) ? access_protected_node
1314 : access_public_node
;
1315 tree flist
= NULL_TREE
;
1318 gcc_assert (!processing_template_decl
&& decl
);
1320 old_value
= lookup_member (t
, name
, /*protect=*/0, /*want_type=*/false,
1321 tf_warning_or_error
);
1324 if (is_overloaded_fn (old_value
))
1325 old_value
= OVL_CURRENT (old_value
);
1327 if (DECL_P (old_value
) && DECL_CONTEXT (old_value
) == t
)
1330 old_value
= NULL_TREE
;
1333 cp_emit_debug_info_for_using (decl
, t
);
1335 if (is_overloaded_fn (decl
))
1340 else if (is_overloaded_fn (old_value
))
1343 /* It's OK to use functions from a base when there are functions with
1344 the same name already present in the current class. */;
1347 error ("%q+D invalid in %q#T", using_decl
, t
);
1348 error (" because of local method %q+#D with same name",
1349 OVL_CURRENT (old_value
));
1353 else if (!DECL_ARTIFICIAL (old_value
))
1355 error ("%q+D invalid in %q#T", using_decl
, t
);
1356 error (" because of local member %q+#D with same name", old_value
);
1360 /* Make type T see field decl FDECL with access ACCESS. */
1362 for (; flist
; flist
= OVL_NEXT (flist
))
1364 add_method (t
, OVL_CURRENT (flist
), using_decl
);
1365 alter_access (t
, OVL_CURRENT (flist
), access
);
1368 alter_access (t
, decl
, access
);
1371 /* Data structure for find_abi_tags_r, below. */
1375 tree t
; // The type that we're checking for missing tags.
1376 tree subob
; // The subobject of T that we're getting tags from.
1377 tree tags
; // error_mark_node for diagnostics, or a list of missing tags.
1380 /* Subroutine of find_abi_tags_r. Handle a single TAG found on the class TP
1381 in the context of P. TAG can be either an identifier (the DECL_NAME of
1382 a tag NAMESPACE_DECL) or a STRING_CST (a tag attribute). */
1385 check_tag (tree tag
, tree
*tp
, abi_tag_data
*p
)
1389 if (TREE_CODE (tag
) == STRING_CST
)
1390 id
= get_identifier (TREE_STRING_POINTER (tag
));
1397 if (!IDENTIFIER_MARKED (id
))
1400 tag
= build_string (IDENTIFIER_LENGTH (id
) + 1,
1401 IDENTIFIER_POINTER (id
));
1402 if (p
->tags
!= error_mark_node
)
1404 /* We're collecting tags from template arguments. */
1405 p
->tags
= tree_cons (NULL_TREE
, tag
, p
->tags
);
1406 ABI_TAG_IMPLICIT (p
->tags
) = true;
1408 /* Don't inherit this tag multiple times. */
1409 IDENTIFIER_MARKED (id
) = true;
1412 /* Otherwise we're diagnosing missing tags. */
1413 else if (TYPE_P (p
->subob
))
1415 if (warning (OPT_Wabi_tag
, "%qT does not have the %E abi tag "
1416 "that base %qT has", p
->t
, tag
, p
->subob
))
1417 inform (location_of (p
->subob
), "%qT declared here",
1422 if (warning (OPT_Wabi_tag
, "%qT does not have the %E abi tag "
1423 "that %qT (used in the type of %qD) has",
1424 p
->t
, tag
, *tp
, p
->subob
))
1426 inform (location_of (p
->subob
), "%qD declared here",
1428 inform (location_of (*tp
), "%qT declared here", *tp
);
1434 /* walk_tree callback for check_abi_tags: if the type at *TP involves any
1435 types with abi tags, add the corresponding identifiers to the VEC in
1436 *DATA and set IDENTIFIER_MARKED. */
1439 find_abi_tags_r (tree
*tp
, int *walk_subtrees
, void *data
)
1441 if (!OVERLOAD_TYPE_P (*tp
))
1444 /* walk_tree shouldn't be walking into any subtrees of a RECORD_TYPE
1445 anyway, but let's make sure of it. */
1446 *walk_subtrees
= false;
1448 abi_tag_data
*p
= static_cast<struct abi_tag_data
*>(data
);
1450 for (tree ns
= decl_namespace_context (*tp
);
1451 ns
!= global_namespace
;
1452 ns
= CP_DECL_CONTEXT (ns
))
1453 if (NAMESPACE_ABI_TAG (ns
))
1454 check_tag (DECL_NAME (ns
), tp
, p
);
1456 if (tree attributes
= lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (*tp
)))
1458 for (tree list
= TREE_VALUE (attributes
); list
;
1459 list
= TREE_CHAIN (list
))
1461 tree tag
= TREE_VALUE (list
);
1462 check_tag (tag
, tp
, p
);
1468 /* Set IDENTIFIER_MARKED on all the ABI tags on T and its (transitively
1469 complete) template arguments. */
1472 mark_type_abi_tags (tree t
, bool val
)
1474 for (tree ns
= decl_namespace_context (t
);
1475 ns
!= global_namespace
;
1476 ns
= CP_DECL_CONTEXT (ns
))
1477 if (NAMESPACE_ABI_TAG (ns
))
1478 IDENTIFIER_MARKED (DECL_NAME (ns
)) = val
;
1480 tree attributes
= lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (t
));
1483 for (tree list
= TREE_VALUE (attributes
); list
;
1484 list
= TREE_CHAIN (list
))
1486 tree tag
= TREE_VALUE (list
);
1487 tree id
= get_identifier (TREE_STRING_POINTER (tag
));
1488 IDENTIFIER_MARKED (id
) = val
;
1493 /* Check that class T has all the abi tags that subobject SUBOB has, or
1497 check_abi_tags (tree t
, tree subob
)
1499 mark_type_abi_tags (t
, true);
1501 tree subtype
= TYPE_P (subob
) ? subob
: TREE_TYPE (subob
);
1502 struct abi_tag_data data
= { t
, subob
, error_mark_node
};
1504 cp_walk_tree_without_duplicates (&subtype
, find_abi_tags_r
, &data
);
1506 mark_type_abi_tags (t
, false);
1510 inherit_targ_abi_tags (tree t
)
1512 if (!CLASS_TYPE_P (t
)
1513 || CLASSTYPE_TEMPLATE_INFO (t
) == NULL_TREE
)
1516 mark_type_abi_tags (t
, true);
1518 tree args
= CLASSTYPE_TI_ARGS (t
);
1519 struct abi_tag_data data
= { t
, NULL_TREE
, NULL_TREE
};
1520 for (int i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
1522 tree level
= TMPL_ARGS_LEVEL (args
, i
+1);
1523 for (int j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
1525 tree arg
= TREE_VEC_ELT (level
, j
);
1527 cp_walk_tree_without_duplicates (&arg
, find_abi_tags_r
, &data
);
1531 // If we found some tags on our template arguments, add them to our
1532 // abi_tag attribute.
1535 tree attr
= lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (t
));
1537 TREE_VALUE (attr
) = chainon (data
.tags
, TREE_VALUE (attr
));
1540 = tree_cons (get_identifier ("abi_tag"), data
.tags
,
1541 TYPE_ATTRIBUTES (t
));
1544 mark_type_abi_tags (t
, false);
1547 /* Return true, iff class T has a non-virtual destructor that is
1548 accessible from outside the class heirarchy (i.e. is public, or
1549 there's a suitable friend. */
1552 accessible_nvdtor_p (tree t
)
1554 tree dtor
= CLASSTYPE_DESTRUCTORS (t
);
1556 /* An implicitly declared destructor is always public. And,
1557 if it were virtual, we would have created it by now. */
1561 if (DECL_VINDEX (dtor
))
1562 return false; /* Virtual */
1564 if (!TREE_PRIVATE (dtor
) && !TREE_PROTECTED (dtor
))
1565 return true; /* Public */
1567 if (CLASSTYPE_FRIEND_CLASSES (t
)
1568 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t
)))
1569 return true; /* Has friends */
1574 /* Run through the base classes of T, updating CANT_HAVE_CONST_CTOR_P,
1575 and NO_CONST_ASN_REF_P. Also set flag bits in T based on
1576 properties of the bases. */
1579 check_bases (tree t
,
1580 int* cant_have_const_ctor_p
,
1581 int* no_const_asn_ref_p
)
1584 bool seen_non_virtual_nearly_empty_base_p
= 0;
1585 int seen_tm_mask
= 0;
1588 tree field
= NULL_TREE
;
1590 if (!CLASSTYPE_NON_STD_LAYOUT (t
))
1591 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
1592 if (TREE_CODE (field
) == FIELD_DECL
)
1595 for (binfo
= TYPE_BINFO (t
), i
= 0;
1596 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
1598 tree basetype
= TREE_TYPE (base_binfo
);
1600 gcc_assert (COMPLETE_TYPE_P (basetype
));
1602 if (CLASSTYPE_FINAL (basetype
))
1603 error ("cannot derive from %<final%> base %qT in derived type %qT",
1606 /* If any base class is non-literal, so is the derived class. */
1607 if (!CLASSTYPE_LITERAL_P (basetype
))
1608 CLASSTYPE_LITERAL_P (t
) = false;
1610 /* If the base class doesn't have copy constructors or
1611 assignment operators that take const references, then the
1612 derived class cannot have such a member automatically
1614 if (TYPE_HAS_COPY_CTOR (basetype
)
1615 && ! TYPE_HAS_CONST_COPY_CTOR (basetype
))
1616 *cant_have_const_ctor_p
= 1;
1617 if (TYPE_HAS_COPY_ASSIGN (basetype
)
1618 && !TYPE_HAS_CONST_COPY_ASSIGN (basetype
))
1619 *no_const_asn_ref_p
= 1;
1621 if (BINFO_VIRTUAL_P (base_binfo
))
1622 /* A virtual base does not effect nearly emptiness. */
1624 else if (CLASSTYPE_NEARLY_EMPTY_P (basetype
))
1626 if (seen_non_virtual_nearly_empty_base_p
)
1627 /* And if there is more than one nearly empty base, then the
1628 derived class is not nearly empty either. */
1629 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
1631 /* Remember we've seen one. */
1632 seen_non_virtual_nearly_empty_base_p
= 1;
1634 else if (!is_empty_class (basetype
))
1635 /* If the base class is not empty or nearly empty, then this
1636 class cannot be nearly empty. */
1637 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
1639 /* A lot of properties from the bases also apply to the derived
1641 TYPE_NEEDS_CONSTRUCTING (t
) |= TYPE_NEEDS_CONSTRUCTING (basetype
);
1642 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
1643 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (basetype
);
1644 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
)
1645 |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (basetype
)
1646 || !TYPE_HAS_COPY_ASSIGN (basetype
));
1647 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= (TYPE_HAS_COMPLEX_COPY_CTOR (basetype
)
1648 || !TYPE_HAS_COPY_CTOR (basetype
));
1649 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
)
1650 |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (basetype
);
1651 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_HAS_COMPLEX_MOVE_CTOR (basetype
);
1652 TYPE_POLYMORPHIC_P (t
) |= TYPE_POLYMORPHIC_P (basetype
);
1653 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
)
1654 |= CLASSTYPE_CONTAINS_EMPTY_CLASS_P (basetype
);
1655 TYPE_HAS_COMPLEX_DFLT (t
) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
1656 || TYPE_HAS_COMPLEX_DFLT (basetype
));
1657 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT
1658 (t
, CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
)
1659 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (basetype
));
1660 SET_CLASSTYPE_REF_FIELDS_NEED_INIT
1661 (t
, CLASSTYPE_REF_FIELDS_NEED_INIT (t
)
1662 | CLASSTYPE_REF_FIELDS_NEED_INIT (basetype
));
1664 /* A standard-layout class is a class that:
1666 * has no non-standard-layout base classes, */
1667 CLASSTYPE_NON_STD_LAYOUT (t
) |= CLASSTYPE_NON_STD_LAYOUT (basetype
);
1668 if (!CLASSTYPE_NON_STD_LAYOUT (t
))
1671 /* ...has no base classes of the same type as the first non-static
1673 if (field
&& DECL_CONTEXT (field
) == t
1674 && (same_type_ignoring_top_level_qualifiers_p
1675 (TREE_TYPE (field
), basetype
)))
1676 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
1678 /* ...either has no non-static data members in the most-derived
1679 class and at most one base class with non-static data
1680 members, or has no base classes with non-static data
1682 for (basefield
= TYPE_FIELDS (basetype
); basefield
;
1683 basefield
= DECL_CHAIN (basefield
))
1684 if (TREE_CODE (basefield
) == FIELD_DECL
)
1687 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
1694 /* Don't bother collecting tm attributes if transactional memory
1695 support is not enabled. */
1698 tree tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (basetype
));
1700 seen_tm_mask
|= tm_attr_to_mask (tm_attr
);
1703 check_abi_tags (t
, basetype
);
1706 /* If one of the base classes had TM attributes, and the current class
1707 doesn't define its own, then the current class inherits one. */
1708 if (seen_tm_mask
&& !find_tm_attribute (TYPE_ATTRIBUTES (t
)))
1710 tree tm_attr
= tm_mask_to_attr (seen_tm_mask
& -seen_tm_mask
);
1711 TYPE_ATTRIBUTES (t
) = tree_cons (tm_attr
, NULL
, TYPE_ATTRIBUTES (t
));
1715 /* Determine all the primary bases within T. Sets BINFO_PRIMARY_BASE_P for
1716 those that are primaries. Sets BINFO_LOST_PRIMARY_P for those
1717 that have had a nearly-empty virtual primary base stolen by some
1718 other base in the hierarchy. Determines CLASSTYPE_PRIMARY_BASE for
1722 determine_primary_bases (tree t
)
1725 tree primary
= NULL_TREE
;
1726 tree type_binfo
= TYPE_BINFO (t
);
1729 /* Determine the primary bases of our bases. */
1730 for (base_binfo
= TREE_CHAIN (type_binfo
); base_binfo
;
1731 base_binfo
= TREE_CHAIN (base_binfo
))
1733 tree primary
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (base_binfo
));
1735 /* See if we're the non-virtual primary of our inheritance
1737 if (!BINFO_VIRTUAL_P (base_binfo
))
1739 tree parent
= BINFO_INHERITANCE_CHAIN (base_binfo
);
1740 tree parent_primary
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (parent
));
1743 && SAME_BINFO_TYPE_P (BINFO_TYPE (base_binfo
),
1744 BINFO_TYPE (parent_primary
)))
1745 /* We are the primary binfo. */
1746 BINFO_PRIMARY_P (base_binfo
) = 1;
1748 /* Determine if we have a virtual primary base, and mark it so.
1750 if (primary
&& BINFO_VIRTUAL_P (primary
))
1752 tree this_primary
= copied_binfo (primary
, base_binfo
);
1754 if (BINFO_PRIMARY_P (this_primary
))
1755 /* Someone already claimed this base. */
1756 BINFO_LOST_PRIMARY_P (base_binfo
) = 1;
1761 BINFO_PRIMARY_P (this_primary
) = 1;
1762 BINFO_INHERITANCE_CHAIN (this_primary
) = base_binfo
;
1764 /* A virtual binfo might have been copied from within
1765 another hierarchy. As we're about to use it as a
1766 primary base, make sure the offsets match. */
1767 delta
= size_diffop_loc (input_location
,
1769 BINFO_OFFSET (base_binfo
)),
1771 BINFO_OFFSET (this_primary
)));
1773 propagate_binfo_offsets (this_primary
, delta
);
1778 /* First look for a dynamic direct non-virtual base. */
1779 for (i
= 0; BINFO_BASE_ITERATE (type_binfo
, i
, base_binfo
); i
++)
1781 tree basetype
= BINFO_TYPE (base_binfo
);
1783 if (TYPE_CONTAINS_VPTR_P (basetype
) && !BINFO_VIRTUAL_P (base_binfo
))
1785 primary
= base_binfo
;
1790 /* A "nearly-empty" virtual base class can be the primary base
1791 class, if no non-virtual polymorphic base can be found. Look for
1792 a nearly-empty virtual dynamic base that is not already a primary
1793 base of something in the hierarchy. If there is no such base,
1794 just pick the first nearly-empty virtual base. */
1796 for (base_binfo
= TREE_CHAIN (type_binfo
); base_binfo
;
1797 base_binfo
= TREE_CHAIN (base_binfo
))
1798 if (BINFO_VIRTUAL_P (base_binfo
)
1799 && CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (base_binfo
)))
1801 if (!BINFO_PRIMARY_P (base_binfo
))
1803 /* Found one that is not primary. */
1804 primary
= base_binfo
;
1808 /* Remember the first candidate. */
1809 primary
= base_binfo
;
1813 /* If we've got a primary base, use it. */
1816 tree basetype
= BINFO_TYPE (primary
);
1818 CLASSTYPE_PRIMARY_BINFO (t
) = primary
;
1819 if (BINFO_PRIMARY_P (primary
))
1820 /* We are stealing a primary base. */
1821 BINFO_LOST_PRIMARY_P (BINFO_INHERITANCE_CHAIN (primary
)) = 1;
1822 BINFO_PRIMARY_P (primary
) = 1;
1823 if (BINFO_VIRTUAL_P (primary
))
1827 BINFO_INHERITANCE_CHAIN (primary
) = type_binfo
;
1828 /* A virtual binfo might have been copied from within
1829 another hierarchy. As we're about to use it as a primary
1830 base, make sure the offsets match. */
1831 delta
= size_diffop_loc (input_location
, ssize_int (0),
1832 convert (ssizetype
, BINFO_OFFSET (primary
)));
1834 propagate_binfo_offsets (primary
, delta
);
1837 primary
= TYPE_BINFO (basetype
);
1839 TYPE_VFIELD (t
) = TYPE_VFIELD (basetype
);
1840 BINFO_VTABLE (type_binfo
) = BINFO_VTABLE (primary
);
1841 BINFO_VIRTUALS (type_binfo
) = BINFO_VIRTUALS (primary
);
1845 /* Update the variant types of T. */
1848 fixup_type_variants (tree t
)
1855 for (variants
= TYPE_NEXT_VARIANT (t
);
1857 variants
= TYPE_NEXT_VARIANT (variants
))
1859 /* These fields are in the _TYPE part of the node, not in
1860 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1861 TYPE_HAS_USER_CONSTRUCTOR (variants
) = TYPE_HAS_USER_CONSTRUCTOR (t
);
1862 TYPE_NEEDS_CONSTRUCTING (variants
) = TYPE_NEEDS_CONSTRUCTING (t
);
1863 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (variants
)
1864 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
);
1866 TYPE_POLYMORPHIC_P (variants
) = TYPE_POLYMORPHIC_P (t
);
1868 TYPE_BINFO (variants
) = TYPE_BINFO (t
);
1870 /* Copy whatever these are holding today. */
1871 TYPE_VFIELD (variants
) = TYPE_VFIELD (t
);
1872 TYPE_METHODS (variants
) = TYPE_METHODS (t
);
1873 TYPE_FIELDS (variants
) = TYPE_FIELDS (t
);
1877 /* Early variant fixups: we apply attributes at the beginning of the class
1878 definition, and we need to fix up any variants that have already been
1879 made via elaborated-type-specifier so that check_qualified_type works. */
1882 fixup_attribute_variants (tree t
)
1889 for (variants
= TYPE_NEXT_VARIANT (t
);
1891 variants
= TYPE_NEXT_VARIANT (variants
))
1893 /* These are the two fields that check_qualified_type looks at and
1894 are affected by attributes. */
1895 TYPE_ATTRIBUTES (variants
) = TYPE_ATTRIBUTES (t
);
1896 TYPE_ALIGN (variants
) = TYPE_ALIGN (t
);
1900 /* Set memoizing fields and bits of T (and its variants) for later
1904 finish_struct_bits (tree t
)
1906 /* Fix up variants (if any). */
1907 fixup_type_variants (t
);
1909 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t
)) && TYPE_POLYMORPHIC_P (t
))
1910 /* For a class w/o baseclasses, 'finish_struct' has set
1911 CLASSTYPE_PURE_VIRTUALS correctly (by definition).
1912 Similarly for a class whose base classes do not have vtables.
1913 When neither of these is true, we might have removed abstract
1914 virtuals (by providing a definition), added some (by declaring
1915 new ones), or redeclared ones from a base class. We need to
1916 recalculate what's really an abstract virtual at this point (by
1917 looking in the vtables). */
1918 get_pure_virtuals (t
);
1920 /* If this type has a copy constructor or a destructor, force its
1921 mode to be BLKmode, and force its TREE_ADDRESSABLE bit to be
1922 nonzero. This will cause it to be passed by invisible reference
1923 and prevent it from being returned in a register. */
1924 if (type_has_nontrivial_copy_init (t
)
1925 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
1928 DECL_MODE (TYPE_MAIN_DECL (t
)) = BLKmode
;
1929 for (variants
= t
; variants
; variants
= TYPE_NEXT_VARIANT (variants
))
1931 SET_TYPE_MODE (variants
, BLKmode
);
1932 TREE_ADDRESSABLE (variants
) = 1;
1937 /* Issue warnings about T having private constructors, but no friends,
1940 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
1941 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
1942 non-private static member functions. */
1945 maybe_warn_about_overly_private_class (tree t
)
1947 int has_member_fn
= 0;
1948 int has_nonprivate_method
= 0;
1951 if (!warn_ctor_dtor_privacy
1952 /* If the class has friends, those entities might create and
1953 access instances, so we should not warn. */
1954 || (CLASSTYPE_FRIEND_CLASSES (t
)
1955 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t
)))
1956 /* We will have warned when the template was declared; there's
1957 no need to warn on every instantiation. */
1958 || CLASSTYPE_TEMPLATE_INSTANTIATION (t
))
1959 /* There's no reason to even consider warning about this
1963 /* We only issue one warning, if more than one applies, because
1964 otherwise, on code like:
1967 // Oops - forgot `public:'
1973 we warn several times about essentially the same problem. */
1975 /* Check to see if all (non-constructor, non-destructor) member
1976 functions are private. (Since there are no friends or
1977 non-private statics, we can't ever call any of the private member
1979 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
1980 /* We're not interested in compiler-generated methods; they don't
1981 provide any way to call private members. */
1982 if (!DECL_ARTIFICIAL (fn
))
1984 if (!TREE_PRIVATE (fn
))
1986 if (DECL_STATIC_FUNCTION_P (fn
))
1987 /* A non-private static member function is just like a
1988 friend; it can create and invoke private member
1989 functions, and be accessed without a class
1993 has_nonprivate_method
= 1;
1994 /* Keep searching for a static member function. */
1996 else if (!DECL_CONSTRUCTOR_P (fn
) && !DECL_DESTRUCTOR_P (fn
))
2000 if (!has_nonprivate_method
&& has_member_fn
)
2002 /* There are no non-private methods, and there's at least one
2003 private member function that isn't a constructor or
2004 destructor. (If all the private members are
2005 constructors/destructors we want to use the code below that
2006 issues error messages specifically referring to
2007 constructors/destructors.) */
2009 tree binfo
= TYPE_BINFO (t
);
2011 for (i
= 0; i
!= BINFO_N_BASE_BINFOS (binfo
); i
++)
2012 if (BINFO_BASE_ACCESS (binfo
, i
) != access_private_node
)
2014 has_nonprivate_method
= 1;
2017 if (!has_nonprivate_method
)
2019 warning (OPT_Wctor_dtor_privacy
,
2020 "all member functions in class %qT are private", t
);
2025 /* Even if some of the member functions are non-private, the class
2026 won't be useful for much if all the constructors or destructors
2027 are private: such an object can never be created or destroyed. */
2028 fn
= CLASSTYPE_DESTRUCTORS (t
);
2029 if (fn
&& TREE_PRIVATE (fn
))
2031 warning (OPT_Wctor_dtor_privacy
,
2032 "%q#T only defines a private destructor and has no friends",
2037 /* Warn about classes that have private constructors and no friends. */
2038 if (TYPE_HAS_USER_CONSTRUCTOR (t
)
2039 /* Implicitly generated constructors are always public. */
2040 && (!CLASSTYPE_LAZY_DEFAULT_CTOR (t
)
2041 || !CLASSTYPE_LAZY_COPY_CTOR (t
)))
2043 int nonprivate_ctor
= 0;
2045 /* If a non-template class does not define a copy
2046 constructor, one is defined for it, enabling it to avoid
2047 this warning. For a template class, this does not
2048 happen, and so we would normally get a warning on:
2050 template <class T> class C { private: C(); };
2052 To avoid this asymmetry, we check TYPE_HAS_COPY_CTOR. All
2053 complete non-template or fully instantiated classes have this
2055 if (!TYPE_HAS_COPY_CTOR (t
))
2056 nonprivate_ctor
= 1;
2058 for (fn
= CLASSTYPE_CONSTRUCTORS (t
); fn
; fn
= OVL_NEXT (fn
))
2060 tree ctor
= OVL_CURRENT (fn
);
2061 /* Ideally, we wouldn't count copy constructors (or, in
2062 fact, any constructor that takes an argument of the
2063 class type as a parameter) because such things cannot
2064 be used to construct an instance of the class unless
2065 you already have one. But, for now at least, we're
2067 if (! TREE_PRIVATE (ctor
))
2069 nonprivate_ctor
= 1;
2074 if (nonprivate_ctor
== 0)
2076 warning (OPT_Wctor_dtor_privacy
,
2077 "%q#T only defines private constructors and has no friends",
2085 gt_pointer_operator new_value
;
2089 /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */
2092 method_name_cmp (const void* m1_p
, const void* m2_p
)
2094 const tree
*const m1
= (const tree
*) m1_p
;
2095 const tree
*const m2
= (const tree
*) m2_p
;
2097 if (*m1
== NULL_TREE
&& *m2
== NULL_TREE
)
2099 if (*m1
== NULL_TREE
)
2101 if (*m2
== NULL_TREE
)
2103 if (DECL_NAME (OVL_CURRENT (*m1
)) < DECL_NAME (OVL_CURRENT (*m2
)))
2108 /* This routine compares two fields like method_name_cmp but using the
2109 pointer operator in resort_field_decl_data. */
2112 resort_method_name_cmp (const void* m1_p
, const void* m2_p
)
2114 const tree
*const m1
= (const tree
*) m1_p
;
2115 const tree
*const m2
= (const tree
*) m2_p
;
2116 if (*m1
== NULL_TREE
&& *m2
== NULL_TREE
)
2118 if (*m1
== NULL_TREE
)
2120 if (*m2
== NULL_TREE
)
2123 tree d1
= DECL_NAME (OVL_CURRENT (*m1
));
2124 tree d2
= DECL_NAME (OVL_CURRENT (*m2
));
2125 resort_data
.new_value (&d1
, resort_data
.cookie
);
2126 resort_data
.new_value (&d2
, resort_data
.cookie
);
2133 /* Resort TYPE_METHOD_VEC because pointers have been reordered. */
2136 resort_type_method_vec (void* obj
,
2138 gt_pointer_operator new_value
,
2141 vec
<tree
, va_gc
> *method_vec
= (vec
<tree
, va_gc
> *) obj
;
2142 int len
= vec_safe_length (method_vec
);
2146 /* The type conversion ops have to live at the front of the vec, so we
2148 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2149 vec_safe_iterate (method_vec
, slot
, &fn
);
2151 if (!DECL_CONV_FN_P (OVL_CURRENT (fn
)))
2156 resort_data
.new_value
= new_value
;
2157 resort_data
.cookie
= cookie
;
2158 qsort (method_vec
->address () + slot
, len
- slot
, sizeof (tree
),
2159 resort_method_name_cmp
);
2163 /* Warn about duplicate methods in fn_fields.
2165 Sort methods that are not special (i.e., constructors, destructors,
2166 and type conversion operators) so that we can find them faster in
2170 finish_struct_methods (tree t
)
2173 vec
<tree
, va_gc
> *method_vec
;
2176 method_vec
= CLASSTYPE_METHOD_VEC (t
);
2180 len
= method_vec
->length ();
2182 /* Clear DECL_IN_AGGR_P for all functions. */
2183 for (fn_fields
= TYPE_METHODS (t
); fn_fields
;
2184 fn_fields
= DECL_CHAIN (fn_fields
))
2185 DECL_IN_AGGR_P (fn_fields
) = 0;
2187 /* Issue warnings about private constructors and such. If there are
2188 no methods, then some public defaults are generated. */
2189 maybe_warn_about_overly_private_class (t
);
2191 /* The type conversion ops have to live at the front of the vec, so we
2193 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2194 method_vec
->iterate (slot
, &fn_fields
);
2196 if (!DECL_CONV_FN_P (OVL_CURRENT (fn_fields
)))
2199 qsort (method_vec
->address () + slot
,
2200 len
-slot
, sizeof (tree
), method_name_cmp
);
2203 /* Make BINFO's vtable have N entries, including RTTI entries,
2204 vbase and vcall offsets, etc. Set its type and call the back end
2208 layout_vtable_decl (tree binfo
, int n
)
2213 atype
= build_array_of_n_type (vtable_entry_type
, n
);
2214 layout_type (atype
);
2216 /* We may have to grow the vtable. */
2217 vtable
= get_vtbl_decl_for_binfo (binfo
);
2218 if (!same_type_p (TREE_TYPE (vtable
), atype
))
2220 TREE_TYPE (vtable
) = atype
;
2221 DECL_SIZE (vtable
) = DECL_SIZE_UNIT (vtable
) = NULL_TREE
;
2222 layout_decl (vtable
, 0);
2226 /* True iff FNDECL and BASE_FNDECL (both non-static member functions)
2227 have the same signature. */
2230 same_signature_p (const_tree fndecl
, const_tree base_fndecl
)
2232 /* One destructor overrides another if they are the same kind of
2234 if (DECL_DESTRUCTOR_P (base_fndecl
) && DECL_DESTRUCTOR_P (fndecl
)
2235 && special_function_p (base_fndecl
) == special_function_p (fndecl
))
2237 /* But a non-destructor never overrides a destructor, nor vice
2238 versa, nor do different kinds of destructors override
2239 one-another. For example, a complete object destructor does not
2240 override a deleting destructor. */
2241 if (DECL_DESTRUCTOR_P (base_fndecl
) || DECL_DESTRUCTOR_P (fndecl
))
2244 if (DECL_NAME (fndecl
) == DECL_NAME (base_fndecl
)
2245 || (DECL_CONV_FN_P (fndecl
)
2246 && DECL_CONV_FN_P (base_fndecl
)
2247 && same_type_p (DECL_CONV_FN_TYPE (fndecl
),
2248 DECL_CONV_FN_TYPE (base_fndecl
))))
2250 tree fntype
= TREE_TYPE (fndecl
);
2251 tree base_fntype
= TREE_TYPE (base_fndecl
);
2252 if (type_memfn_quals (fntype
) == type_memfn_quals (base_fntype
)
2253 && type_memfn_rqual (fntype
) == type_memfn_rqual (base_fntype
)
2254 && compparms (FUNCTION_FIRST_USER_PARMTYPE (fndecl
),
2255 FUNCTION_FIRST_USER_PARMTYPE (base_fndecl
)))
2261 /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a
2265 base_derived_from (tree derived
, tree base
)
2269 for (probe
= base
; probe
; probe
= BINFO_INHERITANCE_CHAIN (probe
))
2271 if (probe
== derived
)
2273 else if (BINFO_VIRTUAL_P (probe
))
2274 /* If we meet a virtual base, we can't follow the inheritance
2275 any more. See if the complete type of DERIVED contains
2276 such a virtual base. */
2277 return (binfo_for_vbase (BINFO_TYPE (probe
), BINFO_TYPE (derived
))
2283 typedef struct find_final_overrider_data_s
{
2284 /* The function for which we are trying to find a final overrider. */
2286 /* The base class in which the function was declared. */
2287 tree declaring_base
;
2288 /* The candidate overriders. */
2290 /* Path to most derived. */
2292 } find_final_overrider_data
;
2294 /* Add the overrider along the current path to FFOD->CANDIDATES.
2295 Returns true if an overrider was found; false otherwise. */
2298 dfs_find_final_overrider_1 (tree binfo
,
2299 find_final_overrider_data
*ffod
,
2304 /* If BINFO is not the most derived type, try a more derived class.
2305 A definition there will overrider a definition here. */
2309 if (dfs_find_final_overrider_1
2310 (ffod
->path
[depth
], ffod
, depth
))
2314 method
= look_for_overrides_here (BINFO_TYPE (binfo
), ffod
->fn
);
2317 tree
*candidate
= &ffod
->candidates
;
2319 /* Remove any candidates overridden by this new function. */
2322 /* If *CANDIDATE overrides METHOD, then METHOD
2323 cannot override anything else on the list. */
2324 if (base_derived_from (TREE_VALUE (*candidate
), binfo
))
2326 /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */
2327 if (base_derived_from (binfo
, TREE_VALUE (*candidate
)))
2328 *candidate
= TREE_CHAIN (*candidate
);
2330 candidate
= &TREE_CHAIN (*candidate
);
2333 /* Add the new function. */
2334 ffod
->candidates
= tree_cons (method
, binfo
, ffod
->candidates
);
2341 /* Called from find_final_overrider via dfs_walk. */
2344 dfs_find_final_overrider_pre (tree binfo
, void *data
)
2346 find_final_overrider_data
*ffod
= (find_final_overrider_data
*) data
;
2348 if (binfo
== ffod
->declaring_base
)
2349 dfs_find_final_overrider_1 (binfo
, ffod
, ffod
->path
.length ());
2350 ffod
->path
.safe_push (binfo
);
2356 dfs_find_final_overrider_post (tree
/*binfo*/, void *data
)
2358 find_final_overrider_data
*ffod
= (find_final_overrider_data
*) data
;
2364 /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for
2365 FN and whose TREE_VALUE is the binfo for the base where the
2366 overriding occurs. BINFO (in the hierarchy dominated by the binfo
2367 DERIVED) is the base object in which FN is declared. */
2370 find_final_overrider (tree derived
, tree binfo
, tree fn
)
2372 find_final_overrider_data ffod
;
2374 /* Getting this right is a little tricky. This is valid:
2376 struct S { virtual void f (); };
2377 struct T { virtual void f (); };
2378 struct U : public S, public T { };
2380 even though calling `f' in `U' is ambiguous. But,
2382 struct R { virtual void f(); };
2383 struct S : virtual public R { virtual void f (); };
2384 struct T : virtual public R { virtual void f (); };
2385 struct U : public S, public T { };
2387 is not -- there's no way to decide whether to put `S::f' or
2388 `T::f' in the vtable for `R'.
2390 The solution is to look at all paths to BINFO. If we find
2391 different overriders along any two, then there is a problem. */
2392 if (DECL_THUNK_P (fn
))
2393 fn
= THUNK_TARGET (fn
);
2395 /* Determine the depth of the hierarchy. */
2397 ffod
.declaring_base
= binfo
;
2398 ffod
.candidates
= NULL_TREE
;
2399 ffod
.path
.create (30);
2401 dfs_walk_all (derived
, dfs_find_final_overrider_pre
,
2402 dfs_find_final_overrider_post
, &ffod
);
2404 ffod
.path
.release ();
2406 /* If there was no winner, issue an error message. */
2407 if (!ffod
.candidates
|| TREE_CHAIN (ffod
.candidates
))
2408 return error_mark_node
;
2410 return ffod
.candidates
;
2413 /* Return the index of the vcall offset for FN when TYPE is used as a
2417 get_vcall_index (tree fn
, tree type
)
2419 vec
<tree_pair_s
, va_gc
> *indices
= CLASSTYPE_VCALL_INDICES (type
);
2423 FOR_EACH_VEC_SAFE_ELT (indices
, ix
, p
)
2424 if ((DECL_DESTRUCTOR_P (fn
) && DECL_DESTRUCTOR_P (p
->purpose
))
2425 || same_signature_p (fn
, p
->purpose
))
2428 /* There should always be an appropriate index. */
2432 /* Update an entry in the vtable for BINFO, which is in the hierarchy
2433 dominated by T. FN is the old function; VIRTUALS points to the
2434 corresponding position in the new BINFO_VIRTUALS list. IX is the index
2435 of that entry in the list. */
2438 update_vtable_entry_for_fn (tree t
, tree binfo
, tree fn
, tree
* virtuals
,
2446 tree overrider_fn
, overrider_target
;
2447 tree target_fn
= DECL_THUNK_P (fn
) ? THUNK_TARGET (fn
) : fn
;
2448 tree over_return
, base_return
;
2451 /* Find the nearest primary base (possibly binfo itself) which defines
2452 this function; this is the class the caller will convert to when
2453 calling FN through BINFO. */
2454 for (b
= binfo
; ; b
= get_primary_binfo (b
))
2457 if (look_for_overrides_here (BINFO_TYPE (b
), target_fn
))
2460 /* The nearest definition is from a lost primary. */
2461 if (BINFO_LOST_PRIMARY_P (b
))
2466 /* Find the final overrider. */
2467 overrider
= find_final_overrider (TYPE_BINFO (t
), b
, target_fn
);
2468 if (overrider
== error_mark_node
)
2470 error ("no unique final overrider for %qD in %qT", target_fn
, t
);
2473 overrider_target
= overrider_fn
= TREE_PURPOSE (overrider
);
2475 /* Check for adjusting covariant return types. */
2476 over_return
= TREE_TYPE (TREE_TYPE (overrider_target
));
2477 base_return
= TREE_TYPE (TREE_TYPE (target_fn
));
2479 if (POINTER_TYPE_P (over_return
)
2480 && TREE_CODE (over_return
) == TREE_CODE (base_return
)
2481 && CLASS_TYPE_P (TREE_TYPE (over_return
))
2482 && CLASS_TYPE_P (TREE_TYPE (base_return
))
2483 /* If the overrider is invalid, don't even try. */
2484 && !DECL_INVALID_OVERRIDER_P (overrider_target
))
2486 /* If FN is a covariant thunk, we must figure out the adjustment
2487 to the final base FN was converting to. As OVERRIDER_TARGET might
2488 also be converting to the return type of FN, we have to
2489 combine the two conversions here. */
2490 tree fixed_offset
, virtual_offset
;
2492 over_return
= TREE_TYPE (over_return
);
2493 base_return
= TREE_TYPE (base_return
);
2495 if (DECL_THUNK_P (fn
))
2497 gcc_assert (DECL_RESULT_THUNK_P (fn
));
2498 fixed_offset
= ssize_int (THUNK_FIXED_OFFSET (fn
));
2499 virtual_offset
= THUNK_VIRTUAL_OFFSET (fn
);
2502 fixed_offset
= virtual_offset
= NULL_TREE
;
2505 /* Find the equivalent binfo within the return type of the
2506 overriding function. We will want the vbase offset from
2508 virtual_offset
= binfo_for_vbase (BINFO_TYPE (virtual_offset
),
2510 else if (!same_type_ignoring_top_level_qualifiers_p
2511 (over_return
, base_return
))
2513 /* There was no existing virtual thunk (which takes
2514 precedence). So find the binfo of the base function's
2515 return type within the overriding function's return type.
2516 We cannot call lookup base here, because we're inside a
2517 dfs_walk, and will therefore clobber the BINFO_MARKED
2518 flags. Fortunately we know the covariancy is valid (it
2519 has already been checked), so we can just iterate along
2520 the binfos, which have been chained in inheritance graph
2521 order. Of course it is lame that we have to repeat the
2522 search here anyway -- we should really be caching pieces
2523 of the vtable and avoiding this repeated work. */
2524 tree thunk_binfo
, base_binfo
;
2526 /* Find the base binfo within the overriding function's
2527 return type. We will always find a thunk_binfo, except
2528 when the covariancy is invalid (which we will have
2529 already diagnosed). */
2530 for (base_binfo
= TYPE_BINFO (base_return
),
2531 thunk_binfo
= TYPE_BINFO (over_return
);
2533 thunk_binfo
= TREE_CHAIN (thunk_binfo
))
2534 if (SAME_BINFO_TYPE_P (BINFO_TYPE (thunk_binfo
),
2535 BINFO_TYPE (base_binfo
)))
2538 /* See if virtual inheritance is involved. */
2539 for (virtual_offset
= thunk_binfo
;
2541 virtual_offset
= BINFO_INHERITANCE_CHAIN (virtual_offset
))
2542 if (BINFO_VIRTUAL_P (virtual_offset
))
2546 || (thunk_binfo
&& !BINFO_OFFSET_ZEROP (thunk_binfo
)))
2548 tree offset
= convert (ssizetype
, BINFO_OFFSET (thunk_binfo
));
2552 /* We convert via virtual base. Adjust the fixed
2553 offset to be from there. */
2555 size_diffop (offset
,
2557 BINFO_OFFSET (virtual_offset
)));
2560 /* There was an existing fixed offset, this must be
2561 from the base just converted to, and the base the
2562 FN was thunking to. */
2563 fixed_offset
= size_binop (PLUS_EXPR
, fixed_offset
, offset
);
2565 fixed_offset
= offset
;
2569 if (fixed_offset
|| virtual_offset
)
2570 /* Replace the overriding function with a covariant thunk. We
2571 will emit the overriding function in its own slot as
2573 overrider_fn
= make_thunk (overrider_target
, /*this_adjusting=*/0,
2574 fixed_offset
, virtual_offset
);
2577 gcc_assert (DECL_INVALID_OVERRIDER_P (overrider_target
) ||
2578 !DECL_THUNK_P (fn
));
2580 /* If we need a covariant thunk, then we may need to adjust first_defn.
2581 The ABI specifies that the thunks emitted with a function are
2582 determined by which bases the function overrides, so we need to be
2583 sure that we're using a thunk for some overridden base; even if we
2584 know that the necessary this adjustment is zero, there may not be an
2585 appropriate zero-this-adjusment thunk for us to use since thunks for
2586 overriding virtual bases always use the vcall offset.
2588 Furthermore, just choosing any base that overrides this function isn't
2589 quite right, as this slot won't be used for calls through a type that
2590 puts a covariant thunk here. Calling the function through such a type
2591 will use a different slot, and that slot is the one that determines
2592 the thunk emitted for that base.
2594 So, keep looking until we find the base that we're really overriding
2595 in this slot: the nearest primary base that doesn't use a covariant
2596 thunk in this slot. */
2597 if (overrider_target
!= overrider_fn
)
2599 if (BINFO_TYPE (b
) == DECL_CONTEXT (overrider_target
))
2600 /* We already know that the overrider needs a covariant thunk. */
2601 b
= get_primary_binfo (b
);
2602 for (; ; b
= get_primary_binfo (b
))
2604 tree main_binfo
= TYPE_BINFO (BINFO_TYPE (b
));
2605 tree bv
= chain_index (ix
, BINFO_VIRTUALS (main_binfo
));
2606 if (!DECL_THUNK_P (TREE_VALUE (bv
)))
2608 if (BINFO_LOST_PRIMARY_P (b
))
2614 /* Assume that we will produce a thunk that convert all the way to
2615 the final overrider, and not to an intermediate virtual base. */
2616 virtual_base
= NULL_TREE
;
2618 /* See if we can convert to an intermediate virtual base first, and then
2619 use the vcall offset located there to finish the conversion. */
2620 for (; b
; b
= BINFO_INHERITANCE_CHAIN (b
))
2622 /* If we find the final overrider, then we can stop
2624 if (SAME_BINFO_TYPE_P (BINFO_TYPE (b
),
2625 BINFO_TYPE (TREE_VALUE (overrider
))))
2628 /* If we find a virtual base, and we haven't yet found the
2629 overrider, then there is a virtual base between the
2630 declaring base (first_defn) and the final overrider. */
2631 if (BINFO_VIRTUAL_P (b
))
2638 /* Compute the constant adjustment to the `this' pointer. The
2639 `this' pointer, when this function is called, will point at BINFO
2640 (or one of its primary bases, which are at the same offset). */
2642 /* The `this' pointer needs to be adjusted from the declaration to
2643 the nearest virtual base. */
2644 delta
= size_diffop_loc (input_location
,
2645 convert (ssizetype
, BINFO_OFFSET (virtual_base
)),
2646 convert (ssizetype
, BINFO_OFFSET (first_defn
)));
2648 /* If the nearest definition is in a lost primary, we don't need an
2649 entry in our vtable. Except possibly in a constructor vtable,
2650 if we happen to get our primary back. In that case, the offset
2651 will be zero, as it will be a primary base. */
2652 delta
= size_zero_node
;
2654 /* The `this' pointer needs to be adjusted from pointing to
2655 BINFO to pointing at the base where the final overrider
2657 delta
= size_diffop_loc (input_location
,
2659 BINFO_OFFSET (TREE_VALUE (overrider
))),
2660 convert (ssizetype
, BINFO_OFFSET (binfo
)));
2662 modify_vtable_entry (t
, binfo
, overrider_fn
, delta
, virtuals
);
2665 BV_VCALL_INDEX (*virtuals
)
2666 = get_vcall_index (overrider_target
, BINFO_TYPE (virtual_base
));
2668 BV_VCALL_INDEX (*virtuals
) = NULL_TREE
;
2670 BV_LOST_PRIMARY (*virtuals
) = lost
;
2673 /* Called from modify_all_vtables via dfs_walk. */
2676 dfs_modify_vtables (tree binfo
, void* data
)
2678 tree t
= (tree
) data
;
2683 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
2684 /* A base without a vtable needs no modification, and its bases
2685 are uninteresting. */
2686 return dfs_skip_bases
;
2688 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
)
2689 && !CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
2690 /* Don't do the primary vtable, if it's new. */
2693 if (BINFO_PRIMARY_P (binfo
) && !BINFO_VIRTUAL_P (binfo
))
2694 /* There's no need to modify the vtable for a non-virtual primary
2695 base; we're not going to use that vtable anyhow. We do still
2696 need to do this for virtual primary bases, as they could become
2697 non-primary in a construction vtable. */
2700 make_new_vtable (t
, binfo
);
2702 /* Now, go through each of the virtual functions in the virtual
2703 function table for BINFO. Find the final overrider, and update
2704 the BINFO_VIRTUALS list appropriately. */
2705 for (ix
= 0, virtuals
= BINFO_VIRTUALS (binfo
),
2706 old_virtuals
= BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo
)));
2708 ix
++, virtuals
= TREE_CHAIN (virtuals
),
2709 old_virtuals
= TREE_CHAIN (old_virtuals
))
2710 update_vtable_entry_for_fn (t
,
2712 BV_FN (old_virtuals
),
2718 /* Update all of the primary and secondary vtables for T. Create new
2719 vtables as required, and initialize their RTTI information. Each
2720 of the functions in VIRTUALS is declared in T and may override a
2721 virtual function from a base class; find and modify the appropriate
2722 entries to point to the overriding functions. Returns a list, in
2723 declaration order, of the virtual functions that are declared in T,
2724 but do not appear in the primary base class vtable, and which
2725 should therefore be appended to the end of the vtable for T. */
2728 modify_all_vtables (tree t
, tree virtuals
)
2730 tree binfo
= TYPE_BINFO (t
);
2733 /* Mangle the vtable name before entering dfs_walk (c++/51884). */
2734 if (TYPE_CONTAINS_VPTR_P (t
))
2735 get_vtable_decl (t
, false);
2737 /* Update all of the vtables. */
2738 dfs_walk_once (binfo
, dfs_modify_vtables
, NULL
, t
);
2740 /* Add virtual functions not already in our primary vtable. These
2741 will be both those introduced by this class, and those overridden
2742 from secondary bases. It does not include virtuals merely
2743 inherited from secondary bases. */
2744 for (fnsp
= &virtuals
; *fnsp
; )
2746 tree fn
= TREE_VALUE (*fnsp
);
2748 if (!value_member (fn
, BINFO_VIRTUALS (binfo
))
2749 || DECL_VINDEX (fn
) == error_mark_node
)
2751 /* We don't need to adjust the `this' pointer when
2752 calling this function. */
2753 BV_DELTA (*fnsp
) = integer_zero_node
;
2754 BV_VCALL_INDEX (*fnsp
) = NULL_TREE
;
2756 /* This is a function not already in our vtable. Keep it. */
2757 fnsp
= &TREE_CHAIN (*fnsp
);
2760 /* We've already got an entry for this function. Skip it. */
2761 *fnsp
= TREE_CHAIN (*fnsp
);
2767 /* Get the base virtual function declarations in T that have the
2771 get_basefndecls (tree name
, tree t
, vec
<tree
> *base_fndecls
)
2774 int n_baseclasses
= BINFO_N_BASE_BINFOS (TYPE_BINFO (t
));
2777 /* Find virtual functions in T with the indicated NAME. */
2778 i
= lookup_fnfields_1 (t
, name
);
2779 bool found_decls
= false;
2781 for (methods
= (*CLASSTYPE_METHOD_VEC (t
))[i
];
2783 methods
= OVL_NEXT (methods
))
2785 tree method
= OVL_CURRENT (methods
);
2787 if (TREE_CODE (method
) == FUNCTION_DECL
2788 && DECL_VINDEX (method
))
2790 base_fndecls
->safe_push (method
);
2798 for (i
= 0; i
< n_baseclasses
; i
++)
2800 tree basetype
= BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (t
), i
));
2801 get_basefndecls (name
, basetype
, base_fndecls
);
2805 /* If this declaration supersedes the declaration of
2806 a method declared virtual in the base class, then
2807 mark this field as being virtual as well. */
2810 check_for_override (tree decl
, tree ctype
)
2812 bool overrides_found
= false;
2813 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2814 /* In [temp.mem] we have:
2816 A specialization of a member function template does not
2817 override a virtual function from a base class. */
2819 if ((DECL_DESTRUCTOR_P (decl
)
2820 || IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
))
2821 || DECL_CONV_FN_P (decl
))
2822 && look_for_overrides (ctype
, decl
)
2823 && !DECL_STATIC_FUNCTION_P (decl
))
2824 /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor
2825 the error_mark_node so that we know it is an overriding
2828 DECL_VINDEX (decl
) = decl
;
2829 overrides_found
= true;
2830 if (warn_override
&& !DECL_OVERRIDE_P (decl
)
2831 && !DECL_DESTRUCTOR_P (decl
))
2832 warning_at (DECL_SOURCE_LOCATION (decl
), OPT_Wsuggest_override
,
2833 "%q+D can be marked override", decl
);
2836 if (DECL_VIRTUAL_P (decl
))
2838 if (!DECL_VINDEX (decl
))
2839 DECL_VINDEX (decl
) = error_mark_node
;
2840 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
2841 if (DECL_DESTRUCTOR_P (decl
))
2842 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (ctype
) = true;
2844 else if (DECL_FINAL_P (decl
))
2845 error ("%q+#D marked %<final%>, but is not virtual", decl
);
2846 if (DECL_OVERRIDE_P (decl
) && !overrides_found
)
2847 error ("%q+#D marked %<override%>, but does not override", decl
);
2850 /* Warn about hidden virtual functions that are not overridden in t.
2851 We know that constructors and destructors don't apply. */
2854 warn_hidden (tree t
)
2856 vec
<tree
, va_gc
> *method_vec
= CLASSTYPE_METHOD_VEC (t
);
2860 /* We go through each separately named virtual function. */
2861 for (i
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2862 vec_safe_iterate (method_vec
, i
, &fns
);
2872 /* All functions in this slot in the CLASSTYPE_METHOD_VEC will
2873 have the same name. Figure out what name that is. */
2874 name
= DECL_NAME (OVL_CURRENT (fns
));
2875 /* There are no possibly hidden functions yet. */
2876 auto_vec
<tree
, 20> base_fndecls
;
2877 /* Iterate through all of the base classes looking for possibly
2878 hidden functions. */
2879 for (binfo
= TYPE_BINFO (t
), j
= 0;
2880 BINFO_BASE_ITERATE (binfo
, j
, base_binfo
); j
++)
2882 tree basetype
= BINFO_TYPE (base_binfo
);
2883 get_basefndecls (name
, basetype
, &base_fndecls
);
2886 /* If there are no functions to hide, continue. */
2887 if (base_fndecls
.is_empty ())
2890 /* Remove any overridden functions. */
2891 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
2893 fndecl
= OVL_CURRENT (fn
);
2894 if (TREE_CODE (fndecl
) == FUNCTION_DECL
2895 && DECL_VINDEX (fndecl
))
2897 /* If the method from the base class has the same
2898 signature as the method from the derived class, it
2899 has been overridden. */
2900 for (size_t k
= 0; k
< base_fndecls
.length (); k
++)
2902 && same_signature_p (fndecl
, base_fndecls
[k
]))
2903 base_fndecls
[k
] = NULL_TREE
;
2907 /* Now give a warning for all base functions without overriders,
2908 as they are hidden. */
2911 FOR_EACH_VEC_ELT (base_fndecls
, k
, base_fndecl
)
2914 /* Here we know it is a hider, and no overrider exists. */
2915 warning (OPT_Woverloaded_virtual
, "%q+D was hidden", base_fndecl
);
2916 warning (OPT_Woverloaded_virtual
, " by %q+D", fns
);
2921 /* Recursive helper for finish_struct_anon. */
2924 finish_struct_anon_r (tree field
, bool complain
)
2926 bool is_union
= TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
;
2927 tree elt
= TYPE_FIELDS (TREE_TYPE (field
));
2928 for (; elt
; elt
= DECL_CHAIN (elt
))
2930 /* We're generally only interested in entities the user
2931 declared, but we also find nested classes by noticing
2932 the TYPE_DECL that we create implicitly. You're
2933 allowed to put one anonymous union inside another,
2934 though, so we explicitly tolerate that. We use
2935 TYPE_ANONYMOUS_P rather than ANON_AGGR_TYPE_P so that
2936 we also allow unnamed types used for defining fields. */
2937 if (DECL_ARTIFICIAL (elt
)
2938 && (!DECL_IMPLICIT_TYPEDEF_P (elt
)
2939 || TYPE_ANONYMOUS_P (TREE_TYPE (elt
))))
2942 if (TREE_CODE (elt
) != FIELD_DECL
)
2944 /* We already complained about static data members in
2945 finish_static_data_member_decl. */
2946 if (complain
&& TREE_CODE (elt
) != VAR_DECL
)
2949 permerror (input_location
,
2950 "%q+#D invalid; an anonymous union can "
2951 "only have non-static data members", elt
);
2953 permerror (input_location
,
2954 "%q+#D invalid; an anonymous struct can "
2955 "only have non-static data members", elt
);
2962 if (TREE_PRIVATE (elt
))
2965 permerror (input_location
,
2966 "private member %q+#D in anonymous union", elt
);
2968 permerror (input_location
,
2969 "private member %q+#D in anonymous struct", elt
);
2971 else if (TREE_PROTECTED (elt
))
2974 permerror (input_location
,
2975 "protected member %q+#D in anonymous union", elt
);
2977 permerror (input_location
,
2978 "protected member %q+#D in anonymous struct", elt
);
2982 TREE_PRIVATE (elt
) = TREE_PRIVATE (field
);
2983 TREE_PROTECTED (elt
) = TREE_PROTECTED (field
);
2985 /* Recurse into the anonymous aggregates to handle correctly
2986 access control (c++/24926):
2997 if (DECL_NAME (elt
) == NULL_TREE
2998 && ANON_AGGR_TYPE_P (TREE_TYPE (elt
)))
2999 finish_struct_anon_r (elt
, /*complain=*/false);
3003 /* Check for things that are invalid. There are probably plenty of other
3004 things we should check for also. */
3007 finish_struct_anon (tree t
)
3009 for (tree field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
3011 if (TREE_STATIC (field
))
3013 if (TREE_CODE (field
) != FIELD_DECL
)
3016 if (DECL_NAME (field
) == NULL_TREE
3017 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
3018 finish_struct_anon_r (field
, /*complain=*/true);
3022 /* Add T to CLASSTYPE_DECL_LIST of current_class_type which
3023 will be used later during class template instantiation.
3024 When FRIEND_P is zero, T can be a static member data (VAR_DECL),
3025 a non-static member data (FIELD_DECL), a member function
3026 (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE),
3027 a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL)
3028 When FRIEND_P is nonzero, T is either a friend class
3029 (RECORD_TYPE, TEMPLATE_DECL) or a friend function
3030 (FUNCTION_DECL, TEMPLATE_DECL). */
3033 maybe_add_class_template_decl_list (tree type
, tree t
, int friend_p
)
3035 /* Save some memory by not creating TREE_LIST if TYPE is not template. */
3036 if (CLASSTYPE_TEMPLATE_INFO (type
))
3037 CLASSTYPE_DECL_LIST (type
)
3038 = tree_cons (friend_p
? NULL_TREE
: type
,
3039 t
, CLASSTYPE_DECL_LIST (type
));
3042 /* This function is called from declare_virt_assop_and_dtor via
3045 DATA is a type that direcly or indirectly inherits the base
3046 represented by BINFO. If BINFO contains a virtual assignment [copy
3047 assignment or move assigment] operator or a virtual constructor,
3048 declare that function in DATA if it hasn't been already declared. */
3051 dfs_declare_virt_assop_and_dtor (tree binfo
, void *data
)
3053 tree bv
, fn
, t
= (tree
)data
;
3054 tree opname
= ansi_assopname (NOP_EXPR
);
3056 gcc_assert (t
&& CLASS_TYPE_P (t
));
3057 gcc_assert (binfo
&& TREE_CODE (binfo
) == TREE_BINFO
);
3059 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
3060 /* A base without a vtable needs no modification, and its bases
3061 are uninteresting. */
3062 return dfs_skip_bases
;
3064 if (BINFO_PRIMARY_P (binfo
))
3065 /* If this is a primary base, then we have already looked at the
3066 virtual functions of its vtable. */
3069 for (bv
= BINFO_VIRTUALS (binfo
); bv
; bv
= TREE_CHAIN (bv
))
3073 if (DECL_NAME (fn
) == opname
)
3075 if (CLASSTYPE_LAZY_COPY_ASSIGN (t
))
3076 lazily_declare_fn (sfk_copy_assignment
, t
);
3077 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
3078 lazily_declare_fn (sfk_move_assignment
, t
);
3080 else if (DECL_DESTRUCTOR_P (fn
)
3081 && CLASSTYPE_LAZY_DESTRUCTOR (t
))
3082 lazily_declare_fn (sfk_destructor
, t
);
3088 /* If the class type T has a direct or indirect base that contains a
3089 virtual assignment operator or a virtual destructor, declare that
3090 function in T if it hasn't been already declared. */
3093 declare_virt_assop_and_dtor (tree t
)
3095 if (!(TYPE_POLYMORPHIC_P (t
)
3096 && (CLASSTYPE_LAZY_COPY_ASSIGN (t
)
3097 || CLASSTYPE_LAZY_MOVE_ASSIGN (t
)
3098 || CLASSTYPE_LAZY_DESTRUCTOR (t
))))
3101 dfs_walk_all (TYPE_BINFO (t
),
3102 dfs_declare_virt_assop_and_dtor
,
3106 /* Declare the inheriting constructor for class T inherited from base
3107 constructor CTOR with the parameter array PARMS of size NPARMS. */
3110 one_inheriting_sig (tree t
, tree ctor
, tree
*parms
, int nparms
)
3112 /* We don't declare an inheriting ctor that would be a default,
3113 copy or move ctor for derived or base. */
3117 && TREE_CODE (parms
[0]) == REFERENCE_TYPE
)
3119 tree parm
= TYPE_MAIN_VARIANT (TREE_TYPE (parms
[0]));
3120 if (parm
== t
|| parm
== DECL_CONTEXT (ctor
))
3124 tree parmlist
= void_list_node
;
3125 for (int i
= nparms
- 1; i
>= 0; i
--)
3126 parmlist
= tree_cons (NULL_TREE
, parms
[i
], parmlist
);
3127 tree fn
= implicitly_declare_fn (sfk_inheriting_constructor
,
3128 t
, false, ctor
, parmlist
);
3129 if (add_method (t
, fn
, NULL_TREE
))
3131 DECL_CHAIN (fn
) = TYPE_METHODS (t
);
3132 TYPE_METHODS (t
) = fn
;
3136 /* Declare all the inheriting constructors for class T inherited from base
3137 constructor CTOR. */
3140 one_inherited_ctor (tree ctor
, tree t
)
3142 tree parms
= FUNCTION_FIRST_USER_PARMTYPE (ctor
);
3144 tree
*new_parms
= XALLOCAVEC (tree
, list_length (parms
));
3146 for (; parms
&& parms
!= void_list_node
; parms
= TREE_CHAIN (parms
))
3148 if (TREE_PURPOSE (parms
))
3149 one_inheriting_sig (t
, ctor
, new_parms
, i
);
3150 new_parms
[i
++] = TREE_VALUE (parms
);
3152 one_inheriting_sig (t
, ctor
, new_parms
, i
);
3153 if (parms
== NULL_TREE
)
3155 if (warning (OPT_Winherited_variadic_ctor
,
3156 "the ellipsis in %qD is not inherited", ctor
))
3157 inform (DECL_SOURCE_LOCATION (ctor
), "%qD declared here", ctor
);
3161 /* Create default constructors, assignment operators, and so forth for
3162 the type indicated by T, if they are needed. CANT_HAVE_CONST_CTOR,
3163 and CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason,
3164 the class cannot have a default constructor, copy constructor
3165 taking a const reference argument, or an assignment operator taking
3166 a const reference, respectively. */
3169 add_implicitly_declared_members (tree t
, tree
* access_decls
,
3170 int cant_have_const_cctor
,
3171 int cant_have_const_assignment
)
3173 bool move_ok
= false;
3175 if (cxx_dialect
>= cxx11
&& !CLASSTYPE_DESTRUCTORS (t
)
3176 && !TYPE_HAS_COPY_CTOR (t
) && !TYPE_HAS_COPY_ASSIGN (t
)
3177 && !type_has_move_constructor (t
) && !type_has_move_assign (t
))
3181 if (!CLASSTYPE_DESTRUCTORS (t
))
3183 /* In general, we create destructors lazily. */
3184 CLASSTYPE_LAZY_DESTRUCTOR (t
) = 1;
3186 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3187 && TYPE_FOR_JAVA (t
))
3188 /* But if this is a Java class, any non-trivial destructor is
3189 invalid, even if compiler-generated. Therefore, if the
3190 destructor is non-trivial we create it now. */
3191 lazily_declare_fn (sfk_destructor
, t
);
3196 If there is no user-declared constructor for a class, a default
3197 constructor is implicitly declared. */
3198 if (! TYPE_HAS_USER_CONSTRUCTOR (t
))
3200 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 1;
3201 CLASSTYPE_LAZY_DEFAULT_CTOR (t
) = 1;
3202 if (cxx_dialect
>= cxx11
)
3203 TYPE_HAS_CONSTEXPR_CTOR (t
)
3204 /* This might force the declaration. */
3205 = type_has_constexpr_default_constructor (t
);
3210 If a class definition does not explicitly declare a copy
3211 constructor, one is declared implicitly. */
3212 if (! TYPE_HAS_COPY_CTOR (t
) && ! TYPE_FOR_JAVA (t
))
3214 TYPE_HAS_COPY_CTOR (t
) = 1;
3215 TYPE_HAS_CONST_COPY_CTOR (t
) = !cant_have_const_cctor
;
3216 CLASSTYPE_LAZY_COPY_CTOR (t
) = 1;
3218 CLASSTYPE_LAZY_MOVE_CTOR (t
) = 1;
3221 /* If there is no assignment operator, one will be created if and
3222 when it is needed. For now, just record whether or not the type
3223 of the parameter to the assignment operator will be a const or
3224 non-const reference. */
3225 if (!TYPE_HAS_COPY_ASSIGN (t
) && !TYPE_FOR_JAVA (t
))
3227 TYPE_HAS_COPY_ASSIGN (t
) = 1;
3228 TYPE_HAS_CONST_COPY_ASSIGN (t
) = !cant_have_const_assignment
;
3229 CLASSTYPE_LAZY_COPY_ASSIGN (t
) = 1;
3230 if (move_ok
&& !LAMBDA_TYPE_P (t
))
3231 CLASSTYPE_LAZY_MOVE_ASSIGN (t
) = 1;
3234 /* We can't be lazy about declaring functions that might override
3235 a virtual function from a base class. */
3236 declare_virt_assop_and_dtor (t
);
3238 while (*access_decls
)
3240 tree using_decl
= TREE_VALUE (*access_decls
);
3241 tree decl
= USING_DECL_DECLS (using_decl
);
3242 if (DECL_NAME (using_decl
) == ctor_identifier
)
3244 /* declare, then remove the decl */
3245 tree ctor_list
= decl
;
3246 location_t loc
= input_location
;
3247 input_location
= DECL_SOURCE_LOCATION (using_decl
);
3249 for (; ctor_list
; ctor_list
= OVL_NEXT (ctor_list
))
3250 one_inherited_ctor (OVL_CURRENT (ctor_list
), t
);
3251 *access_decls
= TREE_CHAIN (*access_decls
);
3252 input_location
= loc
;
3255 access_decls
= &TREE_CHAIN (*access_decls
);
3259 /* Subroutine of insert_into_classtype_sorted_fields. Recursively
3260 count the number of fields in TYPE, including anonymous union
3264 count_fields (tree fields
)
3268 for (x
= fields
; x
; x
= DECL_CHAIN (x
))
3270 if (TREE_CODE (x
) == FIELD_DECL
&& ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
3271 n_fields
+= count_fields (TYPE_FIELDS (TREE_TYPE (x
)));
3278 /* Subroutine of insert_into_classtype_sorted_fields. Recursively add
3279 all the fields in the TREE_LIST FIELDS to the SORTED_FIELDS_TYPE
3280 elts, starting at offset IDX. */
3283 add_fields_to_record_type (tree fields
, struct sorted_fields_type
*field_vec
, int idx
)
3286 for (x
= fields
; x
; x
= DECL_CHAIN (x
))
3288 if (TREE_CODE (x
) == FIELD_DECL
&& ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
3289 idx
= add_fields_to_record_type (TYPE_FIELDS (TREE_TYPE (x
)), field_vec
, idx
);
3291 field_vec
->elts
[idx
++] = x
;
3296 /* Add all of the enum values of ENUMTYPE, to the FIELD_VEC elts,
3297 starting at offset IDX. */
3300 add_enum_fields_to_record_type (tree enumtype
,
3301 struct sorted_fields_type
*field_vec
,
3305 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
3306 field_vec
->elts
[idx
++] = TREE_VALUE (values
);
3310 /* FIELD is a bit-field. We are finishing the processing for its
3311 enclosing type. Issue any appropriate messages and set appropriate
3312 flags. Returns false if an error has been diagnosed. */
3315 check_bitfield_decl (tree field
)
3317 tree type
= TREE_TYPE (field
);
3320 /* Extract the declared width of the bitfield, which has been
3321 temporarily stashed in DECL_INITIAL. */
3322 w
= DECL_INITIAL (field
);
3323 gcc_assert (w
!= NULL_TREE
);
3324 /* Remove the bit-field width indicator so that the rest of the
3325 compiler does not treat that value as an initializer. */
3326 DECL_INITIAL (field
) = NULL_TREE
;
3328 /* Detect invalid bit-field type. */
3329 if (!INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
3331 error ("bit-field %q+#D with non-integral type", field
);
3332 w
= error_mark_node
;
3336 location_t loc
= input_location
;
3337 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
3340 /* detect invalid field size. */
3341 input_location
= DECL_SOURCE_LOCATION (field
);
3342 w
= cxx_constant_value (w
);
3343 input_location
= loc
;
3345 if (TREE_CODE (w
) != INTEGER_CST
)
3347 error ("bit-field %q+D width not an integer constant", field
);
3348 w
= error_mark_node
;
3350 else if (tree_int_cst_sgn (w
) < 0)
3352 error ("negative width in bit-field %q+D", field
);
3353 w
= error_mark_node
;
3355 else if (integer_zerop (w
) && DECL_NAME (field
) != 0)
3357 error ("zero width for bit-field %q+D", field
);
3358 w
= error_mark_node
;
3360 else if ((TREE_CODE (type
) != ENUMERAL_TYPE
3361 && TREE_CODE (type
) != BOOLEAN_TYPE
3362 && compare_tree_int (w
, TYPE_PRECISION (type
)) > 0)
3363 || ((TREE_CODE (type
) == ENUMERAL_TYPE
3364 || TREE_CODE (type
) == BOOLEAN_TYPE
)
3365 && tree_int_cst_lt (TYPE_SIZE (type
), w
)))
3366 warning (0, "width of %q+D exceeds its type", field
);
3367 else if (TREE_CODE (type
) == ENUMERAL_TYPE
3368 && (0 > (compare_tree_int
3369 (w
, TYPE_PRECISION (ENUM_UNDERLYING_TYPE (type
))))))
3370 warning (0, "%q+D is too small to hold all values of %q#T", field
, type
);
3373 if (w
!= error_mark_node
)
3375 DECL_SIZE (field
) = convert (bitsizetype
, w
);
3376 DECL_BIT_FIELD (field
) = 1;
3381 /* Non-bit-fields are aligned for their type. */
3382 DECL_BIT_FIELD (field
) = 0;
3383 CLEAR_DECL_C_BIT_FIELD (field
);
3388 /* FIELD is a non bit-field. We are finishing the processing for its
3389 enclosing type T. Issue any appropriate messages and set appropriate
3393 check_field_decl (tree field
,
3395 int* cant_have_const_ctor
,
3396 int* no_const_asn_ref
,
3397 int* any_default_members
)
3399 tree type
= strip_array_types (TREE_TYPE (field
));
3401 /* In C++98 an anonymous union cannot contain any fields which would change
3402 the settings of CANT_HAVE_CONST_CTOR and friends. */
3403 if (ANON_UNION_TYPE_P (type
) && cxx_dialect
< cxx11
)
3405 /* And, we don't set TYPE_HAS_CONST_COPY_CTOR, etc., for anonymous
3406 structs. So, we recurse through their fields here. */
3407 else if (ANON_AGGR_TYPE_P (type
))
3411 for (fields
= TYPE_FIELDS (type
); fields
; fields
= DECL_CHAIN (fields
))
3412 if (TREE_CODE (fields
) == FIELD_DECL
&& !DECL_C_BIT_FIELD (field
))
3413 check_field_decl (fields
, t
, cant_have_const_ctor
,
3414 no_const_asn_ref
, any_default_members
);
3416 /* Check members with class type for constructors, destructors,
3418 else if (CLASS_TYPE_P (type
))
3420 /* Never let anything with uninheritable virtuals
3421 make it through without complaint. */
3422 abstract_virtuals_error (field
, type
);
3424 if (TREE_CODE (t
) == UNION_TYPE
&& cxx_dialect
< cxx11
)
3427 int oldcount
= errorcount
;
3428 if (TYPE_NEEDS_CONSTRUCTING (type
))
3429 error ("member %q+#D with constructor not allowed in union",
3431 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
3432 error ("member %q+#D with destructor not allowed in union", field
);
3433 if (TYPE_HAS_COMPLEX_COPY_ASSIGN (type
))
3434 error ("member %q+#D with copy assignment operator not allowed in union",
3436 if (!warned
&& errorcount
> oldcount
)
3438 inform (DECL_SOURCE_LOCATION (field
), "unrestricted unions "
3439 "only available with -std=c++11 or -std=gnu++11");
3445 TYPE_NEEDS_CONSTRUCTING (t
) |= TYPE_NEEDS_CONSTRUCTING (type
);
3446 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3447 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
);
3448 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
)
3449 |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (type
)
3450 || !TYPE_HAS_COPY_ASSIGN (type
));
3451 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= (TYPE_HAS_COMPLEX_COPY_CTOR (type
)
3452 || !TYPE_HAS_COPY_CTOR (type
));
3453 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (type
);
3454 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_HAS_COMPLEX_MOVE_CTOR (type
);
3455 TYPE_HAS_COMPLEX_DFLT (t
) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (type
)
3456 || TYPE_HAS_COMPLEX_DFLT (type
));
3459 if (TYPE_HAS_COPY_CTOR (type
)
3460 && !TYPE_HAS_CONST_COPY_CTOR (type
))
3461 *cant_have_const_ctor
= 1;
3463 if (TYPE_HAS_COPY_ASSIGN (type
)
3464 && !TYPE_HAS_CONST_COPY_ASSIGN (type
))
3465 *no_const_asn_ref
= 1;
3468 check_abi_tags (t
, field
);
3470 if (DECL_INITIAL (field
) != NULL_TREE
)
3472 /* `build_class_init_list' does not recognize
3474 if (TREE_CODE (t
) == UNION_TYPE
&& *any_default_members
!= 0)
3475 error ("multiple fields in union %qT initialized", t
);
3476 *any_default_members
= 1;
3480 /* Check the data members (both static and non-static), class-scoped
3481 typedefs, etc., appearing in the declaration of T. Issue
3482 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
3483 declaration order) of access declarations; each TREE_VALUE in this
3484 list is a USING_DECL.
3486 In addition, set the following flags:
3489 The class is empty, i.e., contains no non-static data members.
3491 CANT_HAVE_CONST_CTOR_P
3492 This class cannot have an implicitly generated copy constructor
3493 taking a const reference.
3495 CANT_HAVE_CONST_ASN_REF
3496 This class cannot have an implicitly generated assignment
3497 operator taking a const reference.
3499 All of these flags should be initialized before calling this
3502 Returns a pointer to the end of the TYPE_FIELDs chain; additional
3503 fields can be added by adding to this chain. */
3506 check_field_decls (tree t
, tree
*access_decls
,
3507 int *cant_have_const_ctor_p
,
3508 int *no_const_asn_ref_p
)
3513 int any_default_members
;
3515 int field_access
= -1;
3517 /* Assume there are no access declarations. */
3518 *access_decls
= NULL_TREE
;
3519 /* Assume this class has no pointer members. */
3520 has_pointers
= false;
3521 /* Assume none of the members of this class have default
3523 any_default_members
= 0;
3525 for (field
= &TYPE_FIELDS (t
); *field
; field
= next
)
3528 tree type
= TREE_TYPE (x
);
3529 int this_field_access
;
3531 next
= &DECL_CHAIN (x
);
3533 if (TREE_CODE (x
) == USING_DECL
)
3535 /* Save the access declarations for our caller. */
3536 *access_decls
= tree_cons (NULL_TREE
, x
, *access_decls
);
3540 if (TREE_CODE (x
) == TYPE_DECL
3541 || TREE_CODE (x
) == TEMPLATE_DECL
)
3544 /* If we've gotten this far, it's a data member, possibly static,
3545 or an enumerator. */
3546 if (TREE_CODE (x
) != CONST_DECL
)
3547 DECL_CONTEXT (x
) = t
;
3549 /* When this goes into scope, it will be a non-local reference. */
3550 DECL_NONLOCAL (x
) = 1;
3552 if (TREE_CODE (t
) == UNION_TYPE
3553 && cxx_dialect
< cxx11
)
3555 /* [class.union] (C++98)
3557 If a union contains a static data member, or a member of
3558 reference type, the program is ill-formed.
3560 In C++11 this limitation doesn't exist anymore. */
3563 error ("in C++98 %q+D may not be static because it is "
3564 "a member of a union", x
);
3567 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3569 error ("in C++98 %q+D may not have reference type %qT "
3570 "because it is a member of a union", x
, type
);
3575 /* Perform error checking that did not get done in
3577 if (TREE_CODE (type
) == FUNCTION_TYPE
)
3579 error ("field %q+D invalidly declared function type", x
);
3580 type
= build_pointer_type (type
);
3581 TREE_TYPE (x
) = type
;
3583 else if (TREE_CODE (type
) == METHOD_TYPE
)
3585 error ("field %q+D invalidly declared method type", x
);
3586 type
= build_pointer_type (type
);
3587 TREE_TYPE (x
) = type
;
3590 if (type
== error_mark_node
)
3593 if (TREE_CODE (x
) == CONST_DECL
|| VAR_P (x
))
3596 /* Now it can only be a FIELD_DECL. */
3598 if (TREE_PRIVATE (x
) || TREE_PROTECTED (x
))
3599 CLASSTYPE_NON_AGGREGATE (t
) = 1;
3601 /* If at least one non-static data member is non-literal, the whole
3602 class becomes non-literal. Per Core/1453, volatile non-static
3603 data members and base classes are also not allowed.
3604 Note: if the type is incomplete we will complain later on. */
3605 if (COMPLETE_TYPE_P (type
)
3606 && (!literal_type_p (type
) || CP_TYPE_VOLATILE_P (type
)))
3607 CLASSTYPE_LITERAL_P (t
) = false;
3609 /* A standard-layout class is a class that:
3611 has the same access control (Clause 11) for all non-static data members,
3613 this_field_access
= TREE_PROTECTED (x
) ? 1 : TREE_PRIVATE (x
) ? 2 : 0;
3614 if (field_access
== -1)
3615 field_access
= this_field_access
;
3616 else if (this_field_access
!= field_access
)
3617 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3619 /* If this is of reference type, check if it needs an init. */
3620 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3622 CLASSTYPE_NON_LAYOUT_POD_P (t
) = 1;
3623 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3624 if (DECL_INITIAL (x
) == NULL_TREE
)
3625 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t
, 1);
3626 if (cxx_dialect
< cxx11
)
3628 /* ARM $12.6.2: [A member initializer list] (or, for an
3629 aggregate, initialization by a brace-enclosed list) is the
3630 only way to initialize nonstatic const and reference
3632 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
3633 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) = 1;
3637 type
= strip_array_types (type
);
3639 if (TYPE_PACKED (t
))
3641 if (!layout_pod_type_p (type
) && !TYPE_PACKED (type
))
3645 "ignoring packed attribute because of unpacked non-POD field %q+#D",
3649 else if (DECL_C_BIT_FIELD (x
)
3650 || TYPE_ALIGN (TREE_TYPE (x
)) > BITS_PER_UNIT
)
3651 DECL_PACKED (x
) = 1;
3654 if (DECL_C_BIT_FIELD (x
) && integer_zerop (DECL_INITIAL (x
)))
3655 /* We don't treat zero-width bitfields as making a class
3660 /* The class is non-empty. */
3661 CLASSTYPE_EMPTY_P (t
) = 0;
3662 /* The class is not even nearly empty. */
3663 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
3664 /* If one of the data members contains an empty class,
3666 if (CLASS_TYPE_P (type
)
3667 && CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type
))
3668 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 1;
3671 /* This is used by -Weffc++ (see below). Warn only for pointers
3672 to members which might hold dynamic memory. So do not warn
3673 for pointers to functions or pointers to members. */
3674 if (TYPE_PTR_P (type
)
3675 && !TYPE_PTRFN_P (type
))
3676 has_pointers
= true;
3678 if (CLASS_TYPE_P (type
))
3680 if (CLASSTYPE_REF_FIELDS_NEED_INIT (type
))
3681 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t
, 1);
3682 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (type
))
3683 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
, 1);
3686 if (DECL_MUTABLE_P (x
) || TYPE_HAS_MUTABLE_P (type
))
3687 CLASSTYPE_HAS_MUTABLE (t
) = 1;
3689 if (DECL_MUTABLE_P (x
))
3691 if (CP_TYPE_CONST_P (type
))
3693 error ("member %q+D cannot be declared both %<const%> "
3694 "and %<mutable%>", x
);
3697 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3699 error ("member %q+D cannot be declared as a %<mutable%> "
3705 if (! layout_pod_type_p (type
))
3706 /* DR 148 now allows pointers to members (which are POD themselves),
3707 to be allowed in POD structs. */
3708 CLASSTYPE_NON_LAYOUT_POD_P (t
) = 1;
3710 if (!std_layout_type_p (type
))
3711 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3713 if (! zero_init_p (type
))
3714 CLASSTYPE_NON_ZERO_INIT_P (t
) = 1;
3716 /* We set DECL_C_BIT_FIELD in grokbitfield.
3717 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
3718 if (! DECL_C_BIT_FIELD (x
) || ! check_bitfield_decl (x
))
3719 check_field_decl (x
, t
,
3720 cant_have_const_ctor_p
,
3722 &any_default_members
);
3724 /* Now that we've removed bit-field widths from DECL_INITIAL,
3725 anything left in DECL_INITIAL is an NSDMI that makes the class
3726 non-aggregate in C++11. */
3727 if (DECL_INITIAL (x
) && cxx_dialect
< cxx14
)
3728 CLASSTYPE_NON_AGGREGATE (t
) = true;
3730 /* If any field is const, the structure type is pseudo-const. */
3731 if (CP_TYPE_CONST_P (type
))
3733 C_TYPE_FIELDS_READONLY (t
) = 1;
3734 if (DECL_INITIAL (x
) == NULL_TREE
)
3735 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
, 1);
3736 if (cxx_dialect
< cxx11
)
3738 /* ARM $12.6.2: [A member initializer list] (or, for an
3739 aggregate, initialization by a brace-enclosed list) is the
3740 only way to initialize nonstatic const and reference
3742 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
3743 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) = 1;
3746 /* A field that is pseudo-const makes the structure likewise. */
3747 else if (CLASS_TYPE_P (type
))
3749 C_TYPE_FIELDS_READONLY (t
) |= C_TYPE_FIELDS_READONLY (type
);
3750 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
,
3751 CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
)
3752 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (type
));
3755 /* Core issue 80: A nonstatic data member is required to have a
3756 different name from the class iff the class has a
3757 user-declared constructor. */
3758 if (constructor_name_p (DECL_NAME (x
), t
)
3759 && TYPE_HAS_USER_CONSTRUCTOR (t
))
3760 permerror (input_location
, "field %q+#D with same name as class", x
);
3763 /* Effective C++ rule 11: if a class has dynamic memory held by pointers,
3764 it should also define a copy constructor and an assignment operator to
3765 implement the correct copy semantic (deep vs shallow, etc.). As it is
3766 not feasible to check whether the constructors do allocate dynamic memory
3767 and store it within members, we approximate the warning like this:
3769 -- Warn only if there are members which are pointers
3770 -- Warn only if there is a non-trivial constructor (otherwise,
3771 there cannot be memory allocated).
3772 -- Warn only if there is a non-trivial destructor. We assume that the
3773 user at least implemented the cleanup correctly, and a destructor
3774 is needed to free dynamic memory.
3776 This seems enough for practical purposes. */
3779 && TYPE_HAS_USER_CONSTRUCTOR (t
)
3780 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3781 && !(TYPE_HAS_COPY_CTOR (t
) && TYPE_HAS_COPY_ASSIGN (t
)))
3783 warning (OPT_Weffc__
, "%q#T has pointer data members", t
);
3785 if (! TYPE_HAS_COPY_CTOR (t
))
3787 warning (OPT_Weffc__
,
3788 " but does not override %<%T(const %T&)%>", t
, t
);
3789 if (!TYPE_HAS_COPY_ASSIGN (t
))
3790 warning (OPT_Weffc__
, " or %<operator=(const %T&)%>", t
);
3792 else if (! TYPE_HAS_COPY_ASSIGN (t
))
3793 warning (OPT_Weffc__
,
3794 " but does not override %<operator=(const %T&)%>", t
);
3797 /* Non-static data member initializers make the default constructor
3799 if (any_default_members
)
3801 TYPE_NEEDS_CONSTRUCTING (t
) = true;
3802 TYPE_HAS_COMPLEX_DFLT (t
) = true;
3805 /* If any of the fields couldn't be packed, unset TYPE_PACKED. */
3807 TYPE_PACKED (t
) = 0;
3809 /* Check anonymous struct/anonymous union fields. */
3810 finish_struct_anon (t
);
3812 /* We've built up the list of access declarations in reverse order.
3814 *access_decls
= nreverse (*access_decls
);
3817 /* If TYPE is an empty class type, records its OFFSET in the table of
3821 record_subobject_offset (tree type
, tree offset
, splay_tree offsets
)
3825 if (!is_empty_class (type
))
3828 /* Record the location of this empty object in OFFSETS. */
3829 n
= splay_tree_lookup (offsets
, (splay_tree_key
) offset
);
3831 n
= splay_tree_insert (offsets
,
3832 (splay_tree_key
) offset
,
3833 (splay_tree_value
) NULL_TREE
);
3834 n
->value
= ((splay_tree_value
)
3835 tree_cons (NULL_TREE
,
3842 /* Returns nonzero if TYPE is an empty class type and there is
3843 already an entry in OFFSETS for the same TYPE as the same OFFSET. */
3846 check_subobject_offset (tree type
, tree offset
, splay_tree offsets
)
3851 if (!is_empty_class (type
))
3854 /* Record the location of this empty object in OFFSETS. */
3855 n
= splay_tree_lookup (offsets
, (splay_tree_key
) offset
);
3859 for (t
= (tree
) n
->value
; t
; t
= TREE_CHAIN (t
))
3860 if (same_type_p (TREE_VALUE (t
), type
))
3866 /* Walk through all the subobjects of TYPE (located at OFFSET). Call
3867 F for every subobject, passing it the type, offset, and table of
3868 OFFSETS. If VBASES_P is one, then virtual non-primary bases should
3871 If MAX_OFFSET is non-NULL, then subobjects with an offset greater
3872 than MAX_OFFSET will not be walked.
3874 If F returns a nonzero value, the traversal ceases, and that value
3875 is returned. Otherwise, returns zero. */
3878 walk_subobject_offsets (tree type
,
3879 subobject_offset_fn f
,
3886 tree type_binfo
= NULL_TREE
;
3888 /* If this OFFSET is bigger than the MAX_OFFSET, then we should
3890 if (max_offset
&& tree_int_cst_lt (max_offset
, offset
))
3893 if (type
== error_mark_node
)
3899 type
= BINFO_TYPE (type
);
3902 if (CLASS_TYPE_P (type
))
3908 /* Avoid recursing into objects that are not interesting. */
3909 if (!CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type
))
3912 /* Record the location of TYPE. */
3913 r
= (*f
) (type
, offset
, offsets
);
3917 /* Iterate through the direct base classes of TYPE. */
3919 type_binfo
= TYPE_BINFO (type
);
3920 for (i
= 0; BINFO_BASE_ITERATE (type_binfo
, i
, binfo
); i
++)
3924 if (BINFO_VIRTUAL_P (binfo
))
3928 /* We cannot rely on BINFO_OFFSET being set for the base
3929 class yet, but the offsets for direct non-virtual
3930 bases can be calculated by going back to the TYPE. */
3931 orig_binfo
= BINFO_BASE_BINFO (TYPE_BINFO (type
), i
);
3932 binfo_offset
= size_binop (PLUS_EXPR
,
3934 BINFO_OFFSET (orig_binfo
));
3936 r
= walk_subobject_offsets (binfo
,
3946 if (CLASSTYPE_VBASECLASSES (type
))
3949 vec
<tree
, va_gc
> *vbases
;
3951 /* Iterate through the virtual base classes of TYPE. In G++
3952 3.2, we included virtual bases in the direct base class
3953 loop above, which results in incorrect results; the
3954 correct offsets for virtual bases are only known when
3955 working with the most derived type. */
3957 for (vbases
= CLASSTYPE_VBASECLASSES (type
), ix
= 0;
3958 vec_safe_iterate (vbases
, ix
, &binfo
); ix
++)
3960 r
= walk_subobject_offsets (binfo
,
3962 size_binop (PLUS_EXPR
,
3964 BINFO_OFFSET (binfo
)),
3973 /* We still have to walk the primary base, if it is
3974 virtual. (If it is non-virtual, then it was walked
3976 tree vbase
= get_primary_binfo (type_binfo
);
3978 if (vbase
&& BINFO_VIRTUAL_P (vbase
)
3979 && BINFO_PRIMARY_P (vbase
)
3980 && BINFO_INHERITANCE_CHAIN (vbase
) == type_binfo
)
3982 r
= (walk_subobject_offsets
3984 offsets
, max_offset
, /*vbases_p=*/0));
3991 /* Iterate through the fields of TYPE. */
3992 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3993 if (TREE_CODE (field
) == FIELD_DECL
3994 && TREE_TYPE (field
) != error_mark_node
3995 && !DECL_ARTIFICIAL (field
))
3999 field_offset
= byte_position (field
);
4001 r
= walk_subobject_offsets (TREE_TYPE (field
),
4003 size_binop (PLUS_EXPR
,
4013 else if (TREE_CODE (type
) == ARRAY_TYPE
)
4015 tree element_type
= strip_array_types (type
);
4016 tree domain
= TYPE_DOMAIN (type
);
4019 /* Avoid recursing into objects that are not interesting. */
4020 if (!CLASS_TYPE_P (element_type
)
4021 || !CLASSTYPE_CONTAINS_EMPTY_CLASS_P (element_type
))
4024 /* Step through each of the elements in the array. */
4025 for (index
= size_zero_node
;
4026 !tree_int_cst_lt (TYPE_MAX_VALUE (domain
), index
);
4027 index
= size_binop (PLUS_EXPR
, index
, size_one_node
))
4029 r
= walk_subobject_offsets (TREE_TYPE (type
),
4037 offset
= size_binop (PLUS_EXPR
, offset
,
4038 TYPE_SIZE_UNIT (TREE_TYPE (type
)));
4039 /* If this new OFFSET is bigger than the MAX_OFFSET, then
4040 there's no point in iterating through the remaining
4041 elements of the array. */
4042 if (max_offset
&& tree_int_cst_lt (max_offset
, offset
))
4050 /* Record all of the empty subobjects of TYPE (either a type or a
4051 binfo). If IS_DATA_MEMBER is true, then a non-static data member
4052 is being placed at OFFSET; otherwise, it is a base class that is
4053 being placed at OFFSET. */
4056 record_subobject_offsets (tree type
,
4059 bool is_data_member
)
4062 /* If recording subobjects for a non-static data member or a
4063 non-empty base class , we do not need to record offsets beyond
4064 the size of the biggest empty class. Additional data members
4065 will go at the end of the class. Additional base classes will go
4066 either at offset zero (if empty, in which case they cannot
4067 overlap with offsets past the size of the biggest empty class) or
4068 at the end of the class.
4070 However, if we are placing an empty base class, then we must record
4071 all offsets, as either the empty class is at offset zero (where
4072 other empty classes might later be placed) or at the end of the
4073 class (where other objects might then be placed, so other empty
4074 subobjects might later overlap). */
4076 || !is_empty_class (BINFO_TYPE (type
)))
4077 max_offset
= sizeof_biggest_empty_class
;
4079 max_offset
= NULL_TREE
;
4080 walk_subobject_offsets (type
, record_subobject_offset
, offset
,
4081 offsets
, max_offset
, is_data_member
);
4084 /* Returns nonzero if any of the empty subobjects of TYPE (located at
4085 OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero,
4086 virtual bases of TYPE are examined. */
4089 layout_conflict_p (tree type
,
4094 splay_tree_node max_node
;
4096 /* Get the node in OFFSETS that indicates the maximum offset where
4097 an empty subobject is located. */
4098 max_node
= splay_tree_max (offsets
);
4099 /* If there aren't any empty subobjects, then there's no point in
4100 performing this check. */
4104 return walk_subobject_offsets (type
, check_subobject_offset
, offset
,
4105 offsets
, (tree
) (max_node
->key
),
4109 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
4110 non-static data member of the type indicated by RLI. BINFO is the
4111 binfo corresponding to the base subobject, OFFSETS maps offsets to
4112 types already located at those offsets. This function determines
4113 the position of the DECL. */
4116 layout_nonempty_base_or_field (record_layout_info rli
,
4121 tree offset
= NULL_TREE
;
4127 /* For the purposes of determining layout conflicts, we want to
4128 use the class type of BINFO; TREE_TYPE (DECL) will be the
4129 CLASSTYPE_AS_BASE version, which does not contain entries for
4130 zero-sized bases. */
4131 type
= TREE_TYPE (binfo
);
4136 type
= TREE_TYPE (decl
);
4140 /* Try to place the field. It may take more than one try if we have
4141 a hard time placing the field without putting two objects of the
4142 same type at the same address. */
4145 struct record_layout_info_s old_rli
= *rli
;
4147 /* Place this field. */
4148 place_field (rli
, decl
);
4149 offset
= byte_position (decl
);
4151 /* We have to check to see whether or not there is already
4152 something of the same type at the offset we're about to use.
4153 For example, consider:
4156 struct T : public S { int i; };
4157 struct U : public S, public T {};
4159 Here, we put S at offset zero in U. Then, we can't put T at
4160 offset zero -- its S component would be at the same address
4161 as the S we already allocated. So, we have to skip ahead.
4162 Since all data members, including those whose type is an
4163 empty class, have nonzero size, any overlap can happen only
4164 with a direct or indirect base-class -- it can't happen with
4166 /* In a union, overlap is permitted; all members are placed at
4168 if (TREE_CODE (rli
->t
) == UNION_TYPE
)
4170 if (layout_conflict_p (field_p
? type
: binfo
, offset
,
4173 /* Strip off the size allocated to this field. That puts us
4174 at the first place we could have put the field with
4175 proper alignment. */
4178 /* Bump up by the alignment required for the type. */
4180 = size_binop (PLUS_EXPR
, rli
->bitpos
,
4182 ? CLASSTYPE_ALIGN (type
)
4183 : TYPE_ALIGN (type
)));
4184 normalize_rli (rli
);
4187 /* There was no conflict. We're done laying out this field. */
4191 /* Now that we know where it will be placed, update its
4193 if (binfo
&& CLASS_TYPE_P (BINFO_TYPE (binfo
)))
4194 /* Indirect virtual bases may have a nonzero BINFO_OFFSET at
4195 this point because their BINFO_OFFSET is copied from another
4196 hierarchy. Therefore, we may not need to add the entire
4198 propagate_binfo_offsets (binfo
,
4199 size_diffop_loc (input_location
,
4200 convert (ssizetype
, offset
),
4202 BINFO_OFFSET (binfo
))));
4205 /* Returns true if TYPE is empty and OFFSET is nonzero. */
4208 empty_base_at_nonzero_offset_p (tree type
,
4210 splay_tree
/*offsets*/)
4212 return is_empty_class (type
) && !integer_zerop (offset
);
4215 /* Layout the empty base BINFO. EOC indicates the byte currently just
4216 past the end of the class, and should be correctly aligned for a
4217 class of the type indicated by BINFO; OFFSETS gives the offsets of
4218 the empty bases allocated so far. T is the most derived
4219 type. Return nonzero iff we added it at the end. */
4222 layout_empty_base (record_layout_info rli
, tree binfo
,
4223 tree eoc
, splay_tree offsets
)
4226 tree basetype
= BINFO_TYPE (binfo
);
4229 /* This routine should only be used for empty classes. */
4230 gcc_assert (is_empty_class (basetype
));
4231 alignment
= ssize_int (CLASSTYPE_ALIGN_UNIT (basetype
));
4233 if (!integer_zerop (BINFO_OFFSET (binfo
)))
4234 propagate_binfo_offsets
4235 (binfo
, size_diffop_loc (input_location
,
4236 size_zero_node
, BINFO_OFFSET (binfo
)));
4238 /* This is an empty base class. We first try to put it at offset
4240 if (layout_conflict_p (binfo
,
4241 BINFO_OFFSET (binfo
),
4245 /* That didn't work. Now, we move forward from the next
4246 available spot in the class. */
4248 propagate_binfo_offsets (binfo
, convert (ssizetype
, eoc
));
4251 if (!layout_conflict_p (binfo
,
4252 BINFO_OFFSET (binfo
),
4255 /* We finally found a spot where there's no overlap. */
4258 /* There's overlap here, too. Bump along to the next spot. */
4259 propagate_binfo_offsets (binfo
, alignment
);
4263 if (CLASSTYPE_USER_ALIGN (basetype
))
4265 rli
->record_align
= MAX (rli
->record_align
, CLASSTYPE_ALIGN (basetype
));
4267 rli
->unpacked_align
= MAX (rli
->unpacked_align
, CLASSTYPE_ALIGN (basetype
));
4268 TYPE_USER_ALIGN (rli
->t
) = 1;
4274 /* Layout the base given by BINFO in the class indicated by RLI.
4275 *BASE_ALIGN is a running maximum of the alignments of
4276 any base class. OFFSETS gives the location of empty base
4277 subobjects. T is the most derived type. Return nonzero if the new
4278 object cannot be nearly-empty. A new FIELD_DECL is inserted at
4279 *NEXT_FIELD, unless BINFO is for an empty base class.
4281 Returns the location at which the next field should be inserted. */
4284 build_base_field (record_layout_info rli
, tree binfo
,
4285 splay_tree offsets
, tree
*next_field
)
4288 tree basetype
= BINFO_TYPE (binfo
);
4290 if (!COMPLETE_TYPE_P (basetype
))
4291 /* This error is now reported in xref_tag, thus giving better
4292 location information. */
4295 /* Place the base class. */
4296 if (!is_empty_class (basetype
))
4300 /* The containing class is non-empty because it has a non-empty
4302 CLASSTYPE_EMPTY_P (t
) = 0;
4304 /* Create the FIELD_DECL. */
4305 decl
= build_decl (input_location
,
4306 FIELD_DECL
, NULL_TREE
, CLASSTYPE_AS_BASE (basetype
));
4307 DECL_ARTIFICIAL (decl
) = 1;
4308 DECL_IGNORED_P (decl
) = 1;
4309 DECL_FIELD_CONTEXT (decl
) = t
;
4310 if (CLASSTYPE_AS_BASE (basetype
))
4312 DECL_SIZE (decl
) = CLASSTYPE_SIZE (basetype
);
4313 DECL_SIZE_UNIT (decl
) = CLASSTYPE_SIZE_UNIT (basetype
);
4314 DECL_ALIGN (decl
) = CLASSTYPE_ALIGN (basetype
);
4315 DECL_USER_ALIGN (decl
) = CLASSTYPE_USER_ALIGN (basetype
);
4316 DECL_MODE (decl
) = TYPE_MODE (basetype
);
4317 DECL_FIELD_IS_BASE (decl
) = 1;
4319 /* Try to place the field. It may take more than one try if we
4320 have a hard time placing the field without putting two
4321 objects of the same type at the same address. */
4322 layout_nonempty_base_or_field (rli
, decl
, binfo
, offsets
);
4323 /* Add the new FIELD_DECL to the list of fields for T. */
4324 DECL_CHAIN (decl
) = *next_field
;
4326 next_field
= &DECL_CHAIN (decl
);
4334 /* On some platforms (ARM), even empty classes will not be
4336 eoc
= round_up_loc (input_location
,
4337 rli_size_unit_so_far (rli
),
4338 CLASSTYPE_ALIGN_UNIT (basetype
));
4339 atend
= layout_empty_base (rli
, binfo
, eoc
, offsets
);
4340 /* A nearly-empty class "has no proper base class that is empty,
4341 not morally virtual, and at an offset other than zero." */
4342 if (!BINFO_VIRTUAL_P (binfo
) && CLASSTYPE_NEARLY_EMPTY_P (t
))
4345 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
4346 /* The check above (used in G++ 3.2) is insufficient because
4347 an empty class placed at offset zero might itself have an
4348 empty base at a nonzero offset. */
4349 else if (walk_subobject_offsets (basetype
,
4350 empty_base_at_nonzero_offset_p
,
4353 /*max_offset=*/NULL_TREE
,
4355 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
4358 /* We do not create a FIELD_DECL for empty base classes because
4359 it might overlap some other field. We want to be able to
4360 create CONSTRUCTORs for the class by iterating over the
4361 FIELD_DECLs, and the back end does not handle overlapping
4364 /* An empty virtual base causes a class to be non-empty
4365 -- but in that case we do not need to clear CLASSTYPE_EMPTY_P
4366 here because that was already done when the virtual table
4367 pointer was created. */
4370 /* Record the offsets of BINFO and its base subobjects. */
4371 record_subobject_offsets (binfo
,
4372 BINFO_OFFSET (binfo
),
4374 /*is_data_member=*/false);
4379 /* Layout all of the non-virtual base classes. Record empty
4380 subobjects in OFFSETS. T is the most derived type. Return nonzero
4381 if the type cannot be nearly empty. The fields created
4382 corresponding to the base classes will be inserted at
4386 build_base_fields (record_layout_info rli
,
4387 splay_tree offsets
, tree
*next_field
)
4389 /* Chain to hold all the new FIELD_DECLs which stand in for base class
4392 int n_baseclasses
= BINFO_N_BASE_BINFOS (TYPE_BINFO (t
));
4395 /* The primary base class is always allocated first. */
4396 if (CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
4397 next_field
= build_base_field (rli
, CLASSTYPE_PRIMARY_BINFO (t
),
4398 offsets
, next_field
);
4400 /* Now allocate the rest of the bases. */
4401 for (i
= 0; i
< n_baseclasses
; ++i
)
4405 base_binfo
= BINFO_BASE_BINFO (TYPE_BINFO (t
), i
);
4407 /* The primary base was already allocated above, so we don't
4408 need to allocate it again here. */
4409 if (base_binfo
== CLASSTYPE_PRIMARY_BINFO (t
))
4412 /* Virtual bases are added at the end (a primary virtual base
4413 will have already been added). */
4414 if (BINFO_VIRTUAL_P (base_binfo
))
4417 next_field
= build_base_field (rli
, base_binfo
,
4418 offsets
, next_field
);
4422 /* Go through the TYPE_METHODS of T issuing any appropriate
4423 diagnostics, figuring out which methods override which other
4424 methods, and so forth. */
4427 check_methods (tree t
)
4431 for (x
= TYPE_METHODS (t
); x
; x
= DECL_CHAIN (x
))
4433 check_for_override (x
, t
);
4434 if (DECL_PURE_VIRTUAL_P (x
) && (TREE_CODE (x
) != FUNCTION_DECL
|| ! DECL_VINDEX (x
)))
4435 error ("initializer specified for non-virtual method %q+D", x
);
4436 /* The name of the field is the original field name
4437 Save this in auxiliary field for later overloading. */
4438 if (TREE_CODE (x
) == FUNCTION_DECL
&& DECL_VINDEX (x
))
4440 TYPE_POLYMORPHIC_P (t
) = 1;
4441 if (DECL_PURE_VIRTUAL_P (x
))
4442 vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t
), x
);
4444 /* All user-provided destructors are non-trivial.
4445 Constructors and assignment ops are handled in
4446 grok_special_member_properties. */
4447 if (DECL_DESTRUCTOR_P (x
) && user_provided_p (x
))
4448 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = 1;
4452 /* FN is a constructor or destructor. Clone the declaration to create
4453 a specialized in-charge or not-in-charge version, as indicated by
4457 build_clone (tree fn
, tree name
)
4462 /* Copy the function. */
4463 clone
= copy_decl (fn
);
4464 /* Reset the function name. */
4465 DECL_NAME (clone
) = name
;
4466 /* Remember where this function came from. */
4467 DECL_ABSTRACT_ORIGIN (clone
) = fn
;
4468 /* Make it easy to find the CLONE given the FN. */
4469 DECL_CHAIN (clone
) = DECL_CHAIN (fn
);
4470 DECL_CHAIN (fn
) = clone
;
4472 /* If this is a template, do the rest on the DECL_TEMPLATE_RESULT. */
4473 if (TREE_CODE (clone
) == TEMPLATE_DECL
)
4475 tree result
= build_clone (DECL_TEMPLATE_RESULT (clone
), name
);
4476 DECL_TEMPLATE_RESULT (clone
) = result
;
4477 DECL_TEMPLATE_INFO (result
) = copy_node (DECL_TEMPLATE_INFO (result
));
4478 DECL_TI_TEMPLATE (result
) = clone
;
4479 TREE_TYPE (clone
) = TREE_TYPE (result
);
4483 SET_DECL_ASSEMBLER_NAME (clone
, NULL_TREE
);
4484 DECL_CLONED_FUNCTION (clone
) = fn
;
4485 /* There's no pending inline data for this function. */
4486 DECL_PENDING_INLINE_INFO (clone
) = NULL
;
4487 DECL_PENDING_INLINE_P (clone
) = 0;
4489 /* The base-class destructor is not virtual. */
4490 if (name
== base_dtor_identifier
)
4492 DECL_VIRTUAL_P (clone
) = 0;
4493 if (TREE_CODE (clone
) != TEMPLATE_DECL
)
4494 DECL_VINDEX (clone
) = NULL_TREE
;
4497 /* If there was an in-charge parameter, drop it from the function
4499 if (DECL_HAS_IN_CHARGE_PARM_P (clone
))
4505 exceptions
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone
));
4506 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (clone
));
4507 parmtypes
= TYPE_ARG_TYPES (TREE_TYPE (clone
));
4508 /* Skip the `this' parameter. */
4509 parmtypes
= TREE_CHAIN (parmtypes
);
4510 /* Skip the in-charge parameter. */
4511 parmtypes
= TREE_CHAIN (parmtypes
);
4512 /* And the VTT parm, in a complete [cd]tor. */
4513 if (DECL_HAS_VTT_PARM_P (fn
)
4514 && ! DECL_NEEDS_VTT_PARM_P (clone
))
4515 parmtypes
= TREE_CHAIN (parmtypes
);
4516 /* If this is subobject constructor or destructor, add the vtt
4519 = build_method_type_directly (basetype
,
4520 TREE_TYPE (TREE_TYPE (clone
)),
4523 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
),
4526 = cp_build_type_attribute_variant (TREE_TYPE (clone
),
4527 TYPE_ATTRIBUTES (TREE_TYPE (fn
)));
4530 /* Copy the function parameters. */
4531 DECL_ARGUMENTS (clone
) = copy_list (DECL_ARGUMENTS (clone
));
4532 /* Remove the in-charge parameter. */
4533 if (DECL_HAS_IN_CHARGE_PARM_P (clone
))
4535 DECL_CHAIN (DECL_ARGUMENTS (clone
))
4536 = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone
)));
4537 DECL_HAS_IN_CHARGE_PARM_P (clone
) = 0;
4539 /* And the VTT parm, in a complete [cd]tor. */
4540 if (DECL_HAS_VTT_PARM_P (fn
))
4542 if (DECL_NEEDS_VTT_PARM_P (clone
))
4543 DECL_HAS_VTT_PARM_P (clone
) = 1;
4546 DECL_CHAIN (DECL_ARGUMENTS (clone
))
4547 = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone
)));
4548 DECL_HAS_VTT_PARM_P (clone
) = 0;
4552 for (parms
= DECL_ARGUMENTS (clone
); parms
; parms
= DECL_CHAIN (parms
))
4554 DECL_CONTEXT (parms
) = clone
;
4555 cxx_dup_lang_specific_decl (parms
);
4558 /* Create the RTL for this function. */
4559 SET_DECL_RTL (clone
, NULL
);
4560 rest_of_decl_compilation (clone
, /*top_level=*/1, at_eof
);
4563 note_decl_for_pch (clone
);
4568 /* Implementation of DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P, do
4569 not invoke this function directly.
4571 For a non-thunk function, returns the address of the slot for storing
4572 the function it is a clone of. Otherwise returns NULL_TREE.
4574 If JUST_TESTING, looks through TEMPLATE_DECL and returns NULL if
4575 cloned_function is unset. This is to support the separate
4576 DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P modes; using the latter
4577 on a template makes sense, but not the former. */
4580 decl_cloned_function_p (const_tree decl
, bool just_testing
)
4584 decl
= STRIP_TEMPLATE (decl
);
4586 if (TREE_CODE (decl
) != FUNCTION_DECL
4587 || !DECL_LANG_SPECIFIC (decl
)
4588 || DECL_LANG_SPECIFIC (decl
)->u
.fn
.thunk_p
)
4590 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4592 lang_check_failed (__FILE__
, __LINE__
, __FUNCTION__
);
4598 ptr
= &DECL_LANG_SPECIFIC (decl
)->u
.fn
.u5
.cloned_function
;
4599 if (just_testing
&& *ptr
== NULL_TREE
)
4605 /* Produce declarations for all appropriate clones of FN. If
4606 UPDATE_METHOD_VEC_P is nonzero, the clones are added to the
4607 CLASTYPE_METHOD_VEC as well. */
4610 clone_function_decl (tree fn
, int update_method_vec_p
)
4614 /* Avoid inappropriate cloning. */
4616 && DECL_CLONED_FUNCTION_P (DECL_CHAIN (fn
)))
4619 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
4621 /* For each constructor, we need two variants: an in-charge version
4622 and a not-in-charge version. */
4623 clone
= build_clone (fn
, complete_ctor_identifier
);
4624 if (update_method_vec_p
)
4625 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4626 clone
= build_clone (fn
, base_ctor_identifier
);
4627 if (update_method_vec_p
)
4628 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4632 gcc_assert (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn
));
4634 /* For each destructor, we need three variants: an in-charge
4635 version, a not-in-charge version, and an in-charge deleting
4636 version. We clone the deleting version first because that
4637 means it will go second on the TYPE_METHODS list -- and that
4638 corresponds to the correct layout order in the virtual
4641 For a non-virtual destructor, we do not build a deleting
4643 if (DECL_VIRTUAL_P (fn
))
4645 clone
= build_clone (fn
, deleting_dtor_identifier
);
4646 if (update_method_vec_p
)
4647 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4649 clone
= build_clone (fn
, complete_dtor_identifier
);
4650 if (update_method_vec_p
)
4651 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4652 clone
= build_clone (fn
, base_dtor_identifier
);
4653 if (update_method_vec_p
)
4654 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4657 /* Note that this is an abstract function that is never emitted. */
4658 DECL_ABSTRACT_P (fn
) = true;
4661 /* DECL is an in charge constructor, which is being defined. This will
4662 have had an in class declaration, from whence clones were
4663 declared. An out-of-class definition can specify additional default
4664 arguments. As it is the clones that are involved in overload
4665 resolution, we must propagate the information from the DECL to its
4669 adjust_clone_args (tree decl
)
4673 for (clone
= DECL_CHAIN (decl
); clone
&& DECL_CLONED_FUNCTION_P (clone
);
4674 clone
= DECL_CHAIN (clone
))
4676 tree orig_clone_parms
= TYPE_ARG_TYPES (TREE_TYPE (clone
));
4677 tree orig_decl_parms
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
4678 tree decl_parms
, clone_parms
;
4680 clone_parms
= orig_clone_parms
;
4682 /* Skip the 'this' parameter. */
4683 orig_clone_parms
= TREE_CHAIN (orig_clone_parms
);
4684 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4686 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
4687 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4688 if (DECL_HAS_VTT_PARM_P (decl
))
4689 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4691 clone_parms
= orig_clone_parms
;
4692 if (DECL_HAS_VTT_PARM_P (clone
))
4693 clone_parms
= TREE_CHAIN (clone_parms
);
4695 for (decl_parms
= orig_decl_parms
; decl_parms
;
4696 decl_parms
= TREE_CHAIN (decl_parms
),
4697 clone_parms
= TREE_CHAIN (clone_parms
))
4699 gcc_assert (same_type_p (TREE_TYPE (decl_parms
),
4700 TREE_TYPE (clone_parms
)));
4702 if (TREE_PURPOSE (decl_parms
) && !TREE_PURPOSE (clone_parms
))
4704 /* A default parameter has been added. Adjust the
4705 clone's parameters. */
4706 tree exceptions
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone
));
4707 tree attrs
= TYPE_ATTRIBUTES (TREE_TYPE (clone
));
4708 tree basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (clone
));
4711 clone_parms
= orig_decl_parms
;
4713 if (DECL_HAS_VTT_PARM_P (clone
))
4715 clone_parms
= tree_cons (TREE_PURPOSE (orig_clone_parms
),
4716 TREE_VALUE (orig_clone_parms
),
4718 TREE_TYPE (clone_parms
) = TREE_TYPE (orig_clone_parms
);
4720 type
= build_method_type_directly (basetype
,
4721 TREE_TYPE (TREE_TYPE (clone
)),
4724 type
= build_exception_variant (type
, exceptions
);
4726 type
= cp_build_type_attribute_variant (type
, attrs
);
4727 TREE_TYPE (clone
) = type
;
4729 clone_parms
= NULL_TREE
;
4733 gcc_assert (!clone_parms
);
4737 /* For each of the constructors and destructors in T, create an
4738 in-charge and not-in-charge variant. */
4741 clone_constructors_and_destructors (tree t
)
4745 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4747 if (!CLASSTYPE_METHOD_VEC (t
))
4750 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4751 clone_function_decl (OVL_CURRENT (fns
), /*update_method_vec_p=*/1);
4752 for (fns
= CLASSTYPE_DESTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4753 clone_function_decl (OVL_CURRENT (fns
), /*update_method_vec_p=*/1);
4756 /* Deduce noexcept for a destructor DTOR. */
4759 deduce_noexcept_on_destructor (tree dtor
)
4761 if (!TYPE_RAISES_EXCEPTIONS (TREE_TYPE (dtor
)))
4763 tree eh_spec
= unevaluated_noexcept_spec ();
4764 TREE_TYPE (dtor
) = build_exception_variant (TREE_TYPE (dtor
), eh_spec
);
4768 /* For each destructor in T, deduce noexcept:
4770 12.4/3: A declaration of a destructor that does not have an
4771 exception-specification is implicitly considered to have the
4772 same exception-specification as an implicit declaration (15.4). */
4775 deduce_noexcept_on_destructors (tree t
)
4777 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4779 if (!CLASSTYPE_METHOD_VEC (t
))
4782 for (tree fns
= CLASSTYPE_DESTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4783 deduce_noexcept_on_destructor (OVL_CURRENT (fns
));
4786 /* Subroutine of set_one_vmethod_tm_attributes. Search base classes
4787 of TYPE for virtual functions which FNDECL overrides. Return a
4788 mask of the tm attributes found therein. */
4791 look_for_tm_attr_overrides (tree type
, tree fndecl
)
4793 tree binfo
= TYPE_BINFO (type
);
4797 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ++ix
)
4799 tree o
, basetype
= BINFO_TYPE (base_binfo
);
4801 if (!TYPE_POLYMORPHIC_P (basetype
))
4804 o
= look_for_overrides_here (basetype
, fndecl
);
4806 found
|= tm_attr_to_mask (find_tm_attribute
4807 (TYPE_ATTRIBUTES (TREE_TYPE (o
))));
4809 found
|= look_for_tm_attr_overrides (basetype
, fndecl
);
4815 /* Subroutine of set_method_tm_attributes. Handle the checks and
4816 inheritance for one virtual method FNDECL. */
4819 set_one_vmethod_tm_attributes (tree type
, tree fndecl
)
4824 found
= look_for_tm_attr_overrides (type
, fndecl
);
4826 /* If FNDECL doesn't actually override anything (i.e. T is the
4827 class that first declares FNDECL virtual), then we're done. */
4831 tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl
)));
4832 have
= tm_attr_to_mask (tm_attr
);
4834 /* Intel STM Language Extension 3.0, Section 4.2 table 4:
4835 tm_pure must match exactly, otherwise no weakening of
4836 tm_safe > tm_callable > nothing. */
4837 /* ??? The tm_pure attribute didn't make the transition to the
4838 multivendor language spec. */
4839 if (have
== TM_ATTR_PURE
)
4841 if (found
!= TM_ATTR_PURE
)
4847 /* If the overridden function is tm_pure, then FNDECL must be. */
4848 else if (found
== TM_ATTR_PURE
&& tm_attr
)
4850 /* Look for base class combinations that cannot be satisfied. */
4851 else if (found
!= TM_ATTR_PURE
&& (found
& TM_ATTR_PURE
))
4853 found
&= ~TM_ATTR_PURE
;
4855 error_at (DECL_SOURCE_LOCATION (fndecl
),
4856 "method overrides both %<transaction_pure%> and %qE methods",
4857 tm_mask_to_attr (found
));
4859 /* If FNDECL did not declare an attribute, then inherit the most
4861 else if (tm_attr
== NULL
)
4863 apply_tm_attr (fndecl
, tm_mask_to_attr (found
& -found
));
4865 /* Otherwise validate that we're not weaker than a function
4866 that is being overridden. */
4870 if (found
<= TM_ATTR_CALLABLE
&& have
> found
)
4876 error_at (DECL_SOURCE_LOCATION (fndecl
),
4877 "method declared %qE overriding %qE method",
4878 tm_attr
, tm_mask_to_attr (found
));
4881 /* For each of the methods in T, propagate a class-level tm attribute. */
4884 set_method_tm_attributes (tree t
)
4886 tree class_tm_attr
, fndecl
;
4888 /* Don't bother collecting tm attributes if transactional memory
4889 support is not enabled. */
4893 /* Process virtual methods first, as they inherit directly from the
4894 base virtual function and also require validation of new attributes. */
4895 if (TYPE_CONTAINS_VPTR_P (t
))
4898 for (vchain
= BINFO_VIRTUALS (TYPE_BINFO (t
)); vchain
;
4899 vchain
= TREE_CHAIN (vchain
))
4901 fndecl
= BV_FN (vchain
);
4902 if (DECL_THUNK_P (fndecl
))
4903 fndecl
= THUNK_TARGET (fndecl
);
4904 set_one_vmethod_tm_attributes (t
, fndecl
);
4908 /* If the class doesn't have an attribute, nothing more to do. */
4909 class_tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (t
));
4910 if (class_tm_attr
== NULL
)
4913 /* Any method that does not yet have a tm attribute inherits
4914 the one from the class. */
4915 for (fndecl
= TYPE_METHODS (t
); fndecl
; fndecl
= TREE_CHAIN (fndecl
))
4917 if (!find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl
))))
4918 apply_tm_attr (fndecl
, class_tm_attr
);
4922 /* Returns true iff class T has a user-defined constructor other than
4923 the default constructor. */
4926 type_has_user_nondefault_constructor (tree t
)
4930 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4933 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4935 tree fn
= OVL_CURRENT (fns
);
4936 if (!DECL_ARTIFICIAL (fn
)
4937 && (TREE_CODE (fn
) == TEMPLATE_DECL
4938 || (skip_artificial_parms_for (fn
, DECL_ARGUMENTS (fn
))
4946 /* Returns the defaulted constructor if T has one. Otherwise, returns
4950 in_class_defaulted_default_constructor (tree t
)
4954 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4957 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4959 tree fn
= OVL_CURRENT (fns
);
4961 if (DECL_DEFAULTED_IN_CLASS_P (fn
))
4963 args
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
4964 while (args
&& TREE_PURPOSE (args
))
4965 args
= TREE_CHAIN (args
);
4966 if (!args
|| args
== void_list_node
)
4974 /* Returns true iff FN is a user-provided function, i.e. user-declared
4975 and not defaulted at its first declaration; or explicit, private,
4976 protected, or non-const. */
4979 user_provided_p (tree fn
)
4981 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4984 return (!DECL_ARTIFICIAL (fn
)
4985 && !(DECL_INITIALIZED_IN_CLASS_P (fn
)
4986 && (DECL_DEFAULTED_FN (fn
) || DECL_DELETED_FN (fn
))));
4989 /* Returns true iff class T has a user-provided constructor. */
4992 type_has_user_provided_constructor (tree t
)
4996 if (!CLASS_TYPE_P (t
))
4999 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
5002 /* This can happen in error cases; avoid crashing. */
5003 if (!CLASSTYPE_METHOD_VEC (t
))
5006 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5007 if (user_provided_p (OVL_CURRENT (fns
)))
5013 /* Returns true iff class T has a non-user-provided (i.e. implicitly
5014 declared or explicitly defaulted in the class body) default
5018 type_has_non_user_provided_default_constructor (tree t
)
5022 if (!TYPE_HAS_DEFAULT_CONSTRUCTOR (t
))
5024 if (CLASSTYPE_LAZY_DEFAULT_CTOR (t
))
5027 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5029 tree fn
= OVL_CURRENT (fns
);
5030 if (TREE_CODE (fn
) == FUNCTION_DECL
5031 && !user_provided_p (fn
)
5032 && sufficient_parms_p (FUNCTION_FIRST_USER_PARMTYPE (fn
)))
5039 /* TYPE is being used as a virtual base, and has a non-trivial move
5040 assignment. Return true if this is due to there being a user-provided
5041 move assignment in TYPE or one of its subobjects; if there isn't, then
5042 multiple move assignment can't cause any harm. */
5045 vbase_has_user_provided_move_assign (tree type
)
5047 /* Does the type itself have a user-provided move assignment operator? */
5049 = lookup_fnfields_slot_nolazy (type
, ansi_assopname (NOP_EXPR
));
5050 fns
; fns
= OVL_NEXT (fns
))
5052 tree fn
= OVL_CURRENT (fns
);
5053 if (move_fn_p (fn
) && user_provided_p (fn
))
5057 /* Do any of its bases? */
5058 tree binfo
= TYPE_BINFO (type
);
5060 for (int i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5061 if (vbase_has_user_provided_move_assign (BINFO_TYPE (base_binfo
)))
5064 /* Or non-static data members? */
5065 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
5067 if (TREE_CODE (field
) == FIELD_DECL
5068 && CLASS_TYPE_P (TREE_TYPE (field
))
5069 && vbase_has_user_provided_move_assign (TREE_TYPE (field
)))
5077 /* If default-initialization leaves part of TYPE uninitialized, returns
5078 a DECL for the field or TYPE itself (DR 253). */
5081 default_init_uninitialized_part (tree type
)
5086 type
= strip_array_types (type
);
5087 if (!CLASS_TYPE_P (type
))
5089 if (!type_has_non_user_provided_default_constructor (type
))
5091 for (binfo
= TYPE_BINFO (type
), i
= 0;
5092 BINFO_BASE_ITERATE (binfo
, i
, t
); ++i
)
5094 r
= default_init_uninitialized_part (BINFO_TYPE (t
));
5098 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
5099 if (TREE_CODE (t
) == FIELD_DECL
5100 && !DECL_ARTIFICIAL (t
)
5101 && !DECL_INITIAL (t
))
5103 r
= default_init_uninitialized_part (TREE_TYPE (t
));
5105 return DECL_P (r
) ? r
: t
;
5111 /* Returns true iff for class T, a trivial synthesized default constructor
5112 would be constexpr. */
5115 trivial_default_constructor_is_constexpr (tree t
)
5117 /* A defaulted trivial default constructor is constexpr
5118 if there is nothing to initialize. */
5119 gcc_assert (!TYPE_HAS_COMPLEX_DFLT (t
));
5120 return is_really_empty_class (t
);
5123 /* Returns true iff class T has a constexpr default constructor. */
5126 type_has_constexpr_default_constructor (tree t
)
5130 if (!CLASS_TYPE_P (t
))
5132 /* The caller should have stripped an enclosing array. */
5133 gcc_assert (TREE_CODE (t
) != ARRAY_TYPE
);
5136 if (CLASSTYPE_LAZY_DEFAULT_CTOR (t
))
5138 if (!TYPE_HAS_COMPLEX_DFLT (t
))
5139 return trivial_default_constructor_is_constexpr (t
);
5140 /* Non-trivial, we need to check subobject constructors. */
5141 lazily_declare_fn (sfk_constructor
, t
);
5143 fns
= locate_ctor (t
);
5144 return (fns
&& DECL_DECLARED_CONSTEXPR_P (fns
));
5147 /* Returns true iff class TYPE has a virtual destructor. */
5150 type_has_virtual_destructor (tree type
)
5154 if (!CLASS_TYPE_P (type
))
5157 gcc_assert (COMPLETE_TYPE_P (type
));
5158 dtor
= CLASSTYPE_DESTRUCTORS (type
);
5159 return (dtor
&& DECL_VIRTUAL_P (dtor
));
5162 /* Returns true iff class T has a move constructor. */
5165 type_has_move_constructor (tree t
)
5169 if (CLASSTYPE_LAZY_MOVE_CTOR (t
))
5171 gcc_assert (COMPLETE_TYPE_P (t
));
5172 lazily_declare_fn (sfk_move_constructor
, t
);
5175 if (!CLASSTYPE_METHOD_VEC (t
))
5178 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5179 if (move_fn_p (OVL_CURRENT (fns
)))
5185 /* Returns true iff class T has a move assignment operator. */
5188 type_has_move_assign (tree t
)
5192 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
5194 gcc_assert (COMPLETE_TYPE_P (t
));
5195 lazily_declare_fn (sfk_move_assignment
, t
);
5198 for (fns
= lookup_fnfields_slot_nolazy (t
, ansi_assopname (NOP_EXPR
));
5199 fns
; fns
= OVL_NEXT (fns
))
5200 if (move_fn_p (OVL_CURRENT (fns
)))
5206 /* Returns true iff class T has a move constructor that was explicitly
5207 declared in the class body. Note that this is different from
5208 "user-provided", which doesn't include functions that are defaulted in
5212 type_has_user_declared_move_constructor (tree t
)
5216 if (CLASSTYPE_LAZY_MOVE_CTOR (t
))
5219 if (!CLASSTYPE_METHOD_VEC (t
))
5222 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5224 tree fn
= OVL_CURRENT (fns
);
5225 if (move_fn_p (fn
) && !DECL_ARTIFICIAL (fn
))
5232 /* Returns true iff class T has a move assignment operator that was
5233 explicitly declared in the class body. */
5236 type_has_user_declared_move_assign (tree t
)
5240 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
5243 for (fns
= lookup_fnfields_slot_nolazy (t
, ansi_assopname (NOP_EXPR
));
5244 fns
; fns
= OVL_NEXT (fns
))
5246 tree fn
= OVL_CURRENT (fns
);
5247 if (move_fn_p (fn
) && !DECL_ARTIFICIAL (fn
))
5254 /* Nonzero if we need to build up a constructor call when initializing an
5255 object of this class, either because it has a user-declared constructor
5256 or because it doesn't have a default constructor (so we need to give an
5257 error if no initializer is provided). Use TYPE_NEEDS_CONSTRUCTING when
5258 what you care about is whether or not an object can be produced by a
5259 constructor (e.g. so we don't set TREE_READONLY on const variables of
5260 such type); use this function when what you care about is whether or not
5261 to try to call a constructor to create an object. The latter case is
5262 the former plus some cases of constructors that cannot be called. */
5265 type_build_ctor_call (tree t
)
5268 if (TYPE_NEEDS_CONSTRUCTING (t
))
5270 inner
= strip_array_types (t
);
5271 if (!CLASS_TYPE_P (inner
) || ANON_AGGR_TYPE_P (inner
))
5273 if (!TYPE_HAS_DEFAULT_CONSTRUCTOR (inner
))
5275 if (cxx_dialect
< cxx11
)
5277 /* A user-declared constructor might be private, and a constructor might
5278 be trivial but deleted. */
5279 for (tree fns
= lookup_fnfields_slot (inner
, complete_ctor_identifier
);
5280 fns
; fns
= OVL_NEXT (fns
))
5282 tree fn
= OVL_CURRENT (fns
);
5283 if (!DECL_ARTIFICIAL (fn
)
5284 || DECL_DELETED_FN (fn
))
5290 /* Like type_build_ctor_call, but for destructors. */
5293 type_build_dtor_call (tree t
)
5296 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5298 inner
= strip_array_types (t
);
5299 if (!CLASS_TYPE_P (inner
) || ANON_AGGR_TYPE_P (inner
)
5300 || !COMPLETE_TYPE_P (inner
))
5302 if (cxx_dialect
< cxx11
)
5304 /* A user-declared destructor might be private, and a destructor might
5305 be trivial but deleted. */
5306 for (tree fns
= lookup_fnfields_slot (inner
, complete_dtor_identifier
);
5307 fns
; fns
= OVL_NEXT (fns
))
5309 tree fn
= OVL_CURRENT (fns
);
5310 if (!DECL_ARTIFICIAL (fn
)
5311 || DECL_DELETED_FN (fn
))
5317 /* Remove all zero-width bit-fields from T. */
5320 remove_zero_width_bit_fields (tree t
)
5324 fieldsp
= &TYPE_FIELDS (t
);
5327 if (TREE_CODE (*fieldsp
) == FIELD_DECL
5328 && DECL_C_BIT_FIELD (*fieldsp
)
5329 /* We should not be confused by the fact that grokbitfield
5330 temporarily sets the width of the bit field into
5331 DECL_INITIAL (*fieldsp).
5332 check_bitfield_decl eventually sets DECL_SIZE (*fieldsp)
5334 && integer_zerop (DECL_SIZE (*fieldsp
)))
5335 *fieldsp
= DECL_CHAIN (*fieldsp
);
5337 fieldsp
= &DECL_CHAIN (*fieldsp
);
5341 /* Returns TRUE iff we need a cookie when dynamically allocating an
5342 array whose elements have the indicated class TYPE. */
5345 type_requires_array_cookie (tree type
)
5348 bool has_two_argument_delete_p
= false;
5350 gcc_assert (CLASS_TYPE_P (type
));
5352 /* If there's a non-trivial destructor, we need a cookie. In order
5353 to iterate through the array calling the destructor for each
5354 element, we'll have to know how many elements there are. */
5355 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
5358 /* If the usual deallocation function is a two-argument whose second
5359 argument is of type `size_t', then we have to pass the size of
5360 the array to the deallocation function, so we will need to store
5362 fns
= lookup_fnfields (TYPE_BINFO (type
),
5363 ansi_opname (VEC_DELETE_EXPR
),
5365 /* If there are no `operator []' members, or the lookup is
5366 ambiguous, then we don't need a cookie. */
5367 if (!fns
|| fns
== error_mark_node
)
5369 /* Loop through all of the functions. */
5370 for (fns
= BASELINK_FUNCTIONS (fns
); fns
; fns
= OVL_NEXT (fns
))
5375 /* Select the current function. */
5376 fn
= OVL_CURRENT (fns
);
5377 /* See if this function is a one-argument delete function. If
5378 it is, then it will be the usual deallocation function. */
5379 second_parm
= TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (fn
)));
5380 if (second_parm
== void_list_node
)
5382 /* Do not consider this function if its second argument is an
5386 /* Otherwise, if we have a two-argument function and the second
5387 argument is `size_t', it will be the usual deallocation
5388 function -- unless there is one-argument function, too. */
5389 if (TREE_CHAIN (second_parm
) == void_list_node
5390 && same_type_p (TREE_VALUE (second_parm
), size_type_node
))
5391 has_two_argument_delete_p
= true;
5394 return has_two_argument_delete_p
;
5397 /* Finish computing the `literal type' property of class type T.
5399 At this point, we have already processed base classes and
5400 non-static data members. We need to check whether the copy
5401 constructor is trivial, the destructor is trivial, and there
5402 is a trivial default constructor or at least one constexpr
5403 constructor other than the copy constructor. */
5406 finalize_literal_type_property (tree t
)
5410 if (cxx_dialect
< cxx11
5411 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5412 CLASSTYPE_LITERAL_P (t
) = false;
5413 else if (CLASSTYPE_LITERAL_P (t
) && !TYPE_HAS_TRIVIAL_DFLT (t
)
5414 && CLASSTYPE_NON_AGGREGATE (t
)
5415 && !TYPE_HAS_CONSTEXPR_CTOR (t
))
5416 CLASSTYPE_LITERAL_P (t
) = false;
5418 if (!CLASSTYPE_LITERAL_P (t
))
5419 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5420 if (DECL_DECLARED_CONSTEXPR_P (fn
)
5421 && TREE_CODE (fn
) != TEMPLATE_DECL
5422 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
5423 && !DECL_CONSTRUCTOR_P (fn
))
5425 DECL_DECLARED_CONSTEXPR_P (fn
) = false;
5426 if (!DECL_GENERATED_P (fn
))
5428 error ("enclosing class of constexpr non-static member "
5429 "function %q+#D is not a literal type", fn
);
5430 explain_non_literal_class (t
);
5435 /* T is a non-literal type used in a context which requires a constant
5436 expression. Explain why it isn't literal. */
5439 explain_non_literal_class (tree t
)
5441 static hash_set
<tree
> *diagnosed
;
5443 if (!CLASS_TYPE_P (t
))
5445 t
= TYPE_MAIN_VARIANT (t
);
5447 if (diagnosed
== NULL
)
5448 diagnosed
= new hash_set
<tree
>;
5449 if (diagnosed
->add (t
))
5450 /* Already explained. */
5453 inform (0, "%q+T is not literal because:", t
);
5454 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5455 inform (0, " %q+T has a non-trivial destructor", t
);
5456 else if (CLASSTYPE_NON_AGGREGATE (t
)
5457 && !TYPE_HAS_TRIVIAL_DFLT (t
)
5458 && !TYPE_HAS_CONSTEXPR_CTOR (t
))
5460 inform (0, " %q+T is not an aggregate, does not have a trivial "
5461 "default constructor, and has no constexpr constructor that "
5462 "is not a copy or move constructor", t
);
5463 if (type_has_non_user_provided_default_constructor (t
))
5465 /* Note that we can't simply call locate_ctor because when the
5466 constructor is deleted it just returns NULL_TREE. */
5468 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5470 tree fn
= OVL_CURRENT (fns
);
5471 tree parms
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5473 parms
= skip_artificial_parms_for (fn
, parms
);
5475 if (sufficient_parms_p (parms
))
5477 if (DECL_DELETED_FN (fn
))
5478 maybe_explain_implicit_delete (fn
);
5480 explain_invalid_constexpr_fn (fn
);
5488 tree binfo
, base_binfo
, field
; int i
;
5489 for (binfo
= TYPE_BINFO (t
), i
= 0;
5490 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
5492 tree basetype
= TREE_TYPE (base_binfo
);
5493 if (!CLASSTYPE_LITERAL_P (basetype
))
5495 inform (0, " base class %qT of %q+T is non-literal",
5497 explain_non_literal_class (basetype
);
5501 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
5504 if (TREE_CODE (field
) != FIELD_DECL
)
5506 ftype
= TREE_TYPE (field
);
5507 if (!literal_type_p (ftype
))
5509 inform (0, " non-static data member %q+D has "
5510 "non-literal type", field
);
5511 if (CLASS_TYPE_P (ftype
))
5512 explain_non_literal_class (ftype
);
5514 if (CP_TYPE_VOLATILE_P (ftype
))
5515 inform (0, " non-static data member %q+D has "
5516 "volatile type", field
);
5521 /* Check the validity of the bases and members declared in T. Add any
5522 implicitly-generated functions (like copy-constructors and
5523 assignment operators). Compute various flag bits (like
5524 CLASSTYPE_NON_LAYOUT_POD_T) for T. This routine works purely at the C++
5525 level: i.e., independently of the ABI in use. */
5528 check_bases_and_members (tree t
)
5530 /* Nonzero if the implicitly generated copy constructor should take
5531 a non-const reference argument. */
5532 int cant_have_const_ctor
;
5533 /* Nonzero if the implicitly generated assignment operator
5534 should take a non-const reference argument. */
5535 int no_const_asn_ref
;
5537 bool saved_complex_asn_ref
;
5538 bool saved_nontrivial_dtor
;
5541 /* By default, we use const reference arguments and generate default
5543 cant_have_const_ctor
= 0;
5544 no_const_asn_ref
= 0;
5546 /* Check all the base-classes. */
5547 check_bases (t
, &cant_have_const_ctor
,
5550 /* Deduce noexcept on destructors. This needs to happen after we've set
5551 triviality flags appropriately for our bases. */
5552 if (cxx_dialect
>= cxx11
)
5553 deduce_noexcept_on_destructors (t
);
5555 /* Check all the method declarations. */
5558 /* Save the initial values of these flags which only indicate whether
5559 or not the class has user-provided functions. As we analyze the
5560 bases and members we can set these flags for other reasons. */
5561 saved_complex_asn_ref
= TYPE_HAS_COMPLEX_COPY_ASSIGN (t
);
5562 saved_nontrivial_dtor
= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
);
5564 /* Check all the data member declarations. We cannot call
5565 check_field_decls until we have called check_bases check_methods,
5566 as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR
5567 being set appropriately. */
5568 check_field_decls (t
, &access_decls
,
5569 &cant_have_const_ctor
,
5572 /* A nearly-empty class has to be vptr-containing; a nearly empty
5573 class contains just a vptr. */
5574 if (!TYPE_CONTAINS_VPTR_P (t
))
5575 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
5577 /* Do some bookkeeping that will guide the generation of implicitly
5578 declared member functions. */
5579 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5580 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5581 /* We need to call a constructor for this class if it has a
5582 user-provided constructor, or if the default constructor is going
5583 to initialize the vptr. (This is not an if-and-only-if;
5584 TYPE_NEEDS_CONSTRUCTING is set elsewhere if bases or members
5585 themselves need constructing.) */
5586 TYPE_NEEDS_CONSTRUCTING (t
)
5587 |= (type_has_user_provided_constructor (t
) || TYPE_CONTAINS_VPTR_P (t
));
5590 An aggregate is an array or a class with no user-provided
5591 constructors ... and no virtual functions.
5593 Again, other conditions for being an aggregate are checked
5595 CLASSTYPE_NON_AGGREGATE (t
)
5596 |= (type_has_user_provided_constructor (t
) || TYPE_POLYMORPHIC_P (t
));
5597 /* This is the C++98/03 definition of POD; it changed in C++0x, but we
5598 retain the old definition internally for ABI reasons. */
5599 CLASSTYPE_NON_LAYOUT_POD_P (t
)
5600 |= (CLASSTYPE_NON_AGGREGATE (t
)
5601 || saved_nontrivial_dtor
|| saved_complex_asn_ref
);
5602 CLASSTYPE_NON_STD_LAYOUT (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5603 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5604 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5605 TYPE_HAS_COMPLEX_DFLT (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5607 /* If the only explicitly declared default constructor is user-provided,
5608 set TYPE_HAS_COMPLEX_DFLT. */
5609 if (!TYPE_HAS_COMPLEX_DFLT (t
)
5610 && TYPE_HAS_DEFAULT_CONSTRUCTOR (t
)
5611 && !type_has_non_user_provided_default_constructor (t
))
5612 TYPE_HAS_COMPLEX_DFLT (t
) = true;
5614 /* Warn if a public base of a polymorphic type has an accessible
5615 non-virtual destructor. It is only now that we know the class is
5616 polymorphic. Although a polymorphic base will have a already
5617 been diagnosed during its definition, we warn on use too. */
5618 if (TYPE_POLYMORPHIC_P (t
) && warn_nonvdtor
)
5620 tree binfo
= TYPE_BINFO (t
);
5621 vec
<tree
, va_gc
> *accesses
= BINFO_BASE_ACCESSES (binfo
);
5625 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
5627 tree basetype
= TREE_TYPE (base_binfo
);
5629 if ((*accesses
)[i
] == access_public_node
5630 && (TYPE_POLYMORPHIC_P (basetype
) || warn_ecpp
)
5631 && accessible_nvdtor_p (basetype
))
5632 warning (OPT_Wnon_virtual_dtor
,
5633 "base class %q#T has accessible non-virtual destructor",
5638 /* If the class has no user-declared constructor, but does have
5639 non-static const or reference data members that can never be
5640 initialized, issue a warning. */
5641 if (warn_uninitialized
5642 /* Classes with user-declared constructors are presumed to
5643 initialize these members. */
5644 && !TYPE_HAS_USER_CONSTRUCTOR (t
)
5645 /* Aggregates can be initialized with brace-enclosed
5647 && CLASSTYPE_NON_AGGREGATE (t
))
5651 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
5655 if (TREE_CODE (field
) != FIELD_DECL
5656 || DECL_INITIAL (field
) != NULL_TREE
)
5659 type
= TREE_TYPE (field
);
5660 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5661 warning (OPT_Wuninitialized
, "non-static reference %q+#D "
5662 "in class without a constructor", field
);
5663 else if (CP_TYPE_CONST_P (type
)
5664 && (!CLASS_TYPE_P (type
)
5665 || !TYPE_HAS_DEFAULT_CONSTRUCTOR (type
)))
5666 warning (OPT_Wuninitialized
, "non-static const member %q+#D "
5667 "in class without a constructor", field
);
5671 /* Synthesize any needed methods. */
5672 add_implicitly_declared_members (t
, &access_decls
,
5673 cant_have_const_ctor
,
5676 /* Check defaulted declarations here so we have cant_have_const_ctor
5677 and don't need to worry about clones. */
5678 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5679 if (!DECL_ARTIFICIAL (fn
) && DECL_DEFAULTED_IN_CLASS_P (fn
))
5681 int copy
= copy_fn_p (fn
);
5685 = (DECL_CONSTRUCTOR_P (fn
) ? !cant_have_const_ctor
5686 : !no_const_asn_ref
);
5687 bool fn_const_p
= (copy
== 2);
5689 if (fn_const_p
&& !imp_const_p
)
5690 /* If the function is defaulted outside the class, we just
5691 give the synthesis error. */
5692 error ("%q+D declared to take const reference, but implicit "
5693 "declaration would take non-const", fn
);
5695 defaulted_late_check (fn
);
5698 if (LAMBDA_TYPE_P (t
))
5700 /* "This class type is not an aggregate." */
5701 CLASSTYPE_NON_AGGREGATE (t
) = 1;
5704 /* Compute the 'literal type' property before we
5705 do anything with non-static member functions. */
5706 finalize_literal_type_property (t
);
5708 /* Create the in-charge and not-in-charge variants of constructors
5710 clone_constructors_and_destructors (t
);
5712 /* Process the using-declarations. */
5713 for (; access_decls
; access_decls
= TREE_CHAIN (access_decls
))
5714 handle_using_decl (TREE_VALUE (access_decls
), t
);
5716 /* Build and sort the CLASSTYPE_METHOD_VEC. */
5717 finish_struct_methods (t
);
5719 /* Figure out whether or not we will need a cookie when dynamically
5720 allocating an array of this type. */
5721 TYPE_LANG_SPECIFIC (t
)->u
.c
.vec_new_uses_cookie
5722 = type_requires_array_cookie (t
);
5725 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
5726 accordingly. If a new vfield was created (because T doesn't have a
5727 primary base class), then the newly created field is returned. It
5728 is not added to the TYPE_FIELDS list; it is the caller's
5729 responsibility to do that. Accumulate declared virtual functions
5733 create_vtable_ptr (tree t
, tree
* virtuals_p
)
5737 /* Collect the virtual functions declared in T. */
5738 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5739 if (TREE_CODE (fn
) == FUNCTION_DECL
5740 && DECL_VINDEX (fn
) && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn
)
5741 && TREE_CODE (DECL_VINDEX (fn
)) != INTEGER_CST
)
5743 tree new_virtual
= make_node (TREE_LIST
);
5745 BV_FN (new_virtual
) = fn
;
5746 BV_DELTA (new_virtual
) = integer_zero_node
;
5747 BV_VCALL_INDEX (new_virtual
) = NULL_TREE
;
5749 TREE_CHAIN (new_virtual
) = *virtuals_p
;
5750 *virtuals_p
= new_virtual
;
5753 /* If we couldn't find an appropriate base class, create a new field
5754 here. Even if there weren't any new virtual functions, we might need a
5755 new virtual function table if we're supposed to include vptrs in
5756 all classes that need them. */
5757 if (!TYPE_VFIELD (t
) && (*virtuals_p
|| TYPE_CONTAINS_VPTR_P (t
)))
5759 /* We build this decl with vtbl_ptr_type_node, which is a
5760 `vtable_entry_type*'. It might seem more precise to use
5761 `vtable_entry_type (*)[N]' where N is the number of virtual
5762 functions. However, that would require the vtable pointer in
5763 base classes to have a different type than the vtable pointer
5764 in derived classes. We could make that happen, but that
5765 still wouldn't solve all the problems. In particular, the
5766 type-based alias analysis code would decide that assignments
5767 to the base class vtable pointer can't alias assignments to
5768 the derived class vtable pointer, since they have different
5769 types. Thus, in a derived class destructor, where the base
5770 class constructor was inlined, we could generate bad code for
5771 setting up the vtable pointer.
5773 Therefore, we use one type for all vtable pointers. We still
5774 use a type-correct type; it's just doesn't indicate the array
5775 bounds. That's better than using `void*' or some such; it's
5776 cleaner, and it let's the alias analysis code know that these
5777 stores cannot alias stores to void*! */
5780 field
= build_decl (input_location
,
5781 FIELD_DECL
, get_vfield_name (t
), vtbl_ptr_type_node
);
5782 DECL_VIRTUAL_P (field
) = 1;
5783 DECL_ARTIFICIAL (field
) = 1;
5784 DECL_FIELD_CONTEXT (field
) = t
;
5785 DECL_FCONTEXT (field
) = t
;
5786 if (TYPE_PACKED (t
))
5787 DECL_PACKED (field
) = 1;
5789 TYPE_VFIELD (t
) = field
;
5791 /* This class is non-empty. */
5792 CLASSTYPE_EMPTY_P (t
) = 0;
5800 /* Add OFFSET to all base types of BINFO which is a base in the
5801 hierarchy dominated by T.
5803 OFFSET, which is a type offset, is number of bytes. */
5806 propagate_binfo_offsets (tree binfo
, tree offset
)
5812 /* Update BINFO's offset. */
5813 BINFO_OFFSET (binfo
)
5814 = convert (sizetype
,
5815 size_binop (PLUS_EXPR
,
5816 convert (ssizetype
, BINFO_OFFSET (binfo
)),
5819 /* Find the primary base class. */
5820 primary_binfo
= get_primary_binfo (binfo
);
5822 if (primary_binfo
&& BINFO_INHERITANCE_CHAIN (primary_binfo
) == binfo
)
5823 propagate_binfo_offsets (primary_binfo
, offset
);
5825 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
5827 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5829 /* Don't do the primary base twice. */
5830 if (base_binfo
== primary_binfo
)
5833 if (BINFO_VIRTUAL_P (base_binfo
))
5836 propagate_binfo_offsets (base_binfo
, offset
);
5840 /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update
5841 TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of
5842 empty subobjects of T. */
5845 layout_virtual_bases (record_layout_info rli
, splay_tree offsets
)
5851 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t
)) == 0)
5854 /* Find the last field. The artificial fields created for virtual
5855 bases will go after the last extant field to date. */
5856 next_field
= &TYPE_FIELDS (t
);
5858 next_field
= &DECL_CHAIN (*next_field
);
5860 /* Go through the virtual bases, allocating space for each virtual
5861 base that is not already a primary base class. These are
5862 allocated in inheritance graph order. */
5863 for (vbase
= TYPE_BINFO (t
); vbase
; vbase
= TREE_CHAIN (vbase
))
5865 if (!BINFO_VIRTUAL_P (vbase
))
5868 if (!BINFO_PRIMARY_P (vbase
))
5870 /* This virtual base is not a primary base of any class in the
5871 hierarchy, so we have to add space for it. */
5872 next_field
= build_base_field (rli
, vbase
,
5873 offsets
, next_field
);
5878 /* Returns the offset of the byte just past the end of the base class
5882 end_of_base (tree binfo
)
5886 if (!CLASSTYPE_AS_BASE (BINFO_TYPE (binfo
)))
5887 size
= TYPE_SIZE_UNIT (char_type_node
);
5888 else if (is_empty_class (BINFO_TYPE (binfo
)))
5889 /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to
5890 allocate some space for it. It cannot have virtual bases, so
5891 TYPE_SIZE_UNIT is fine. */
5892 size
= TYPE_SIZE_UNIT (BINFO_TYPE (binfo
));
5894 size
= CLASSTYPE_SIZE_UNIT (BINFO_TYPE (binfo
));
5896 return size_binop (PLUS_EXPR
, BINFO_OFFSET (binfo
), size
);
5899 /* Returns the offset of the byte just past the end of the base class
5900 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
5901 only non-virtual bases are included. */
5904 end_of_class (tree t
, int include_virtuals_p
)
5906 tree result
= size_zero_node
;
5907 vec
<tree
, va_gc
> *vbases
;
5913 for (binfo
= TYPE_BINFO (t
), i
= 0;
5914 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5916 if (!include_virtuals_p
5917 && BINFO_VIRTUAL_P (base_binfo
)
5918 && (!BINFO_PRIMARY_P (base_binfo
)
5919 || BINFO_INHERITANCE_CHAIN (base_binfo
) != TYPE_BINFO (t
)))
5922 offset
= end_of_base (base_binfo
);
5923 if (tree_int_cst_lt (result
, offset
))
5927 if (include_virtuals_p
)
5928 for (vbases
= CLASSTYPE_VBASECLASSES (t
), i
= 0;
5929 vec_safe_iterate (vbases
, i
, &base_binfo
); i
++)
5931 offset
= end_of_base (base_binfo
);
5932 if (tree_int_cst_lt (result
, offset
))
5939 /* Warn about bases of T that are inaccessible because they are
5940 ambiguous. For example:
5943 struct T : public S {};
5944 struct U : public S, public T {};
5946 Here, `(S*) new U' is not allowed because there are two `S'
5950 warn_about_ambiguous_bases (tree t
)
5953 vec
<tree
, va_gc
> *vbases
;
5958 /* If there are no repeated bases, nothing can be ambiguous. */
5959 if (!CLASSTYPE_REPEATED_BASE_P (t
))
5962 /* Check direct bases. */
5963 for (binfo
= TYPE_BINFO (t
), i
= 0;
5964 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5966 basetype
= BINFO_TYPE (base_binfo
);
5968 if (!uniquely_derived_from_p (basetype
, t
))
5969 warning (0, "direct base %qT inaccessible in %qT due to ambiguity",
5973 /* Check for ambiguous virtual bases. */
5975 for (vbases
= CLASSTYPE_VBASECLASSES (t
), i
= 0;
5976 vec_safe_iterate (vbases
, i
, &binfo
); i
++)
5978 basetype
= BINFO_TYPE (binfo
);
5980 if (!uniquely_derived_from_p (basetype
, t
))
5981 warning (OPT_Wextra
, "virtual base %qT inaccessible in %qT due "
5982 "to ambiguity", basetype
, t
);
5986 /* Compare two INTEGER_CSTs K1 and K2. */
5989 splay_tree_compare_integer_csts (splay_tree_key k1
, splay_tree_key k2
)
5991 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
5994 /* Increase the size indicated in RLI to account for empty classes
5995 that are "off the end" of the class. */
5998 include_empty_classes (record_layout_info rli
)
6003 /* It might be the case that we grew the class to allocate a
6004 zero-sized base class. That won't be reflected in RLI, yet,
6005 because we are willing to overlay multiple bases at the same
6006 offset. However, now we need to make sure that RLI is big enough
6007 to reflect the entire class. */
6008 eoc
= end_of_class (rli
->t
,
6009 CLASSTYPE_AS_BASE (rli
->t
) != NULL_TREE
);
6010 rli_size
= rli_size_unit_so_far (rli
);
6011 if (TREE_CODE (rli_size
) == INTEGER_CST
6012 && tree_int_cst_lt (rli_size
, eoc
))
6014 /* The size should have been rounded to a whole byte. */
6015 gcc_assert (tree_int_cst_equal
6016 (rli
->bitpos
, round_down (rli
->bitpos
, BITS_PER_UNIT
)));
6018 = size_binop (PLUS_EXPR
,
6020 size_binop (MULT_EXPR
,
6021 convert (bitsizetype
,
6022 size_binop (MINUS_EXPR
,
6024 bitsize_int (BITS_PER_UNIT
)));
6025 normalize_rli (rli
);
6029 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
6030 BINFO_OFFSETs for all of the base-classes. Position the vtable
6031 pointer. Accumulate declared virtual functions on VIRTUALS_P. */
6034 layout_class_type (tree t
, tree
*virtuals_p
)
6036 tree non_static_data_members
;
6039 record_layout_info rli
;
6040 /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of
6041 types that appear at that offset. */
6042 splay_tree empty_base_offsets
;
6043 /* True if the last field laid out was a bit-field. */
6044 bool last_field_was_bitfield
= false;
6045 /* The location at which the next field should be inserted. */
6047 /* T, as a base class. */
6050 /* Keep track of the first non-static data member. */
6051 non_static_data_members
= TYPE_FIELDS (t
);
6053 /* Start laying out the record. */
6054 rli
= start_record_layout (t
);
6056 /* Mark all the primary bases in the hierarchy. */
6057 determine_primary_bases (t
);
6059 /* Create a pointer to our virtual function table. */
6060 vptr
= create_vtable_ptr (t
, virtuals_p
);
6062 /* The vptr is always the first thing in the class. */
6065 DECL_CHAIN (vptr
) = TYPE_FIELDS (t
);
6066 TYPE_FIELDS (t
) = vptr
;
6067 next_field
= &DECL_CHAIN (vptr
);
6068 place_field (rli
, vptr
);
6071 next_field
= &TYPE_FIELDS (t
);
6073 /* Build FIELD_DECLs for all of the non-virtual base-types. */
6074 empty_base_offsets
= splay_tree_new (splay_tree_compare_integer_csts
,
6076 build_base_fields (rli
, empty_base_offsets
, next_field
);
6078 /* Layout the non-static data members. */
6079 for (field
= non_static_data_members
; field
; field
= DECL_CHAIN (field
))
6084 /* We still pass things that aren't non-static data members to
6085 the back end, in case it wants to do something with them. */
6086 if (TREE_CODE (field
) != FIELD_DECL
)
6088 place_field (rli
, field
);
6089 /* If the static data member has incomplete type, keep track
6090 of it so that it can be completed later. (The handling
6091 of pending statics in finish_record_layout is
6092 insufficient; consider:
6095 struct S2 { static S1 s1; };
6097 At this point, finish_record_layout will be called, but
6098 S1 is still incomplete.) */
6101 maybe_register_incomplete_var (field
);
6102 /* The visibility of static data members is determined
6103 at their point of declaration, not their point of
6105 determine_visibility (field
);
6110 type
= TREE_TYPE (field
);
6111 if (type
== error_mark_node
)
6114 padding
= NULL_TREE
;
6116 /* If this field is a bit-field whose width is greater than its
6117 type, then there are some special rules for allocating
6119 if (DECL_C_BIT_FIELD (field
)
6120 && tree_int_cst_lt (TYPE_SIZE (type
), DECL_SIZE (field
)))
6124 bool was_unnamed_p
= false;
6125 /* We must allocate the bits as if suitably aligned for the
6126 longest integer type that fits in this many bits. type
6127 of the field. Then, we are supposed to use the left over
6128 bits as additional padding. */
6129 for (itk
= itk_char
; itk
!= itk_none
; ++itk
)
6130 if (integer_types
[itk
] != NULL_TREE
6131 && (tree_int_cst_lt (size_int (MAX_FIXED_MODE_SIZE
),
6132 TYPE_SIZE (integer_types
[itk
]))
6133 || tree_int_cst_lt (DECL_SIZE (field
),
6134 TYPE_SIZE (integer_types
[itk
]))))
6137 /* ITK now indicates a type that is too large for the
6138 field. We have to back up by one to find the largest
6143 integer_type
= integer_types
[itk
];
6144 } while (itk
> 0 && integer_type
== NULL_TREE
);
6146 /* Figure out how much additional padding is required. */
6147 if (tree_int_cst_lt (TYPE_SIZE (integer_type
), DECL_SIZE (field
)))
6149 if (TREE_CODE (t
) == UNION_TYPE
)
6150 /* In a union, the padding field must have the full width
6151 of the bit-field; all fields start at offset zero. */
6152 padding
= DECL_SIZE (field
);
6154 padding
= size_binop (MINUS_EXPR
, DECL_SIZE (field
),
6155 TYPE_SIZE (integer_type
));
6157 #ifdef PCC_BITFIELD_TYPE_MATTERS
6158 /* An unnamed bitfield does not normally affect the
6159 alignment of the containing class on a target where
6160 PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not
6161 make any exceptions for unnamed bitfields when the
6162 bitfields are longer than their types. Therefore, we
6163 temporarily give the field a name. */
6164 if (PCC_BITFIELD_TYPE_MATTERS
&& !DECL_NAME (field
))
6166 was_unnamed_p
= true;
6167 DECL_NAME (field
) = make_anon_name ();
6170 DECL_SIZE (field
) = TYPE_SIZE (integer_type
);
6171 DECL_ALIGN (field
) = TYPE_ALIGN (integer_type
);
6172 DECL_USER_ALIGN (field
) = TYPE_USER_ALIGN (integer_type
);
6173 layout_nonempty_base_or_field (rli
, field
, NULL_TREE
,
6174 empty_base_offsets
);
6176 DECL_NAME (field
) = NULL_TREE
;
6177 /* Now that layout has been performed, set the size of the
6178 field to the size of its declared type; the rest of the
6179 field is effectively invisible. */
6180 DECL_SIZE (field
) = TYPE_SIZE (type
);
6181 /* We must also reset the DECL_MODE of the field. */
6182 DECL_MODE (field
) = TYPE_MODE (type
);
6185 layout_nonempty_base_or_field (rli
, field
, NULL_TREE
,
6186 empty_base_offsets
);
6188 /* Remember the location of any empty classes in FIELD. */
6189 record_subobject_offsets (TREE_TYPE (field
),
6190 byte_position(field
),
6192 /*is_data_member=*/true);
6194 /* If a bit-field does not immediately follow another bit-field,
6195 and yet it starts in the middle of a byte, we have failed to
6196 comply with the ABI. */
6198 && DECL_C_BIT_FIELD (field
)
6199 /* The TREE_NO_WARNING flag gets set by Objective-C when
6200 laying out an Objective-C class. The ObjC ABI differs
6201 from the C++ ABI, and so we do not want a warning
6203 && !TREE_NO_WARNING (field
)
6204 && !last_field_was_bitfield
6205 && !integer_zerop (size_binop (TRUNC_MOD_EXPR
,
6206 DECL_FIELD_BIT_OFFSET (field
),
6207 bitsize_unit_node
)))
6208 warning (OPT_Wabi
, "offset of %q+D is not ABI-compliant and may "
6209 "change in a future version of GCC", field
);
6211 /* The middle end uses the type of expressions to determine the
6212 possible range of expression values. In order to optimize
6213 "x.i > 7" to "false" for a 2-bit bitfield "i", the middle end
6214 must be made aware of the width of "i", via its type.
6216 Because C++ does not have integer types of arbitrary width,
6217 we must (for the purposes of the front end) convert from the
6218 type assigned here to the declared type of the bitfield
6219 whenever a bitfield expression is used as an rvalue.
6220 Similarly, when assigning a value to a bitfield, the value
6221 must be converted to the type given the bitfield here. */
6222 if (DECL_C_BIT_FIELD (field
))
6224 unsigned HOST_WIDE_INT width
;
6225 tree ftype
= TREE_TYPE (field
);
6226 width
= tree_to_uhwi (DECL_SIZE (field
));
6227 if (width
!= TYPE_PRECISION (ftype
))
6230 = c_build_bitfield_integer_type (width
,
6231 TYPE_UNSIGNED (ftype
));
6233 = cp_build_qualified_type (TREE_TYPE (field
),
6234 cp_type_quals (ftype
));
6238 /* If we needed additional padding after this field, add it
6244 padding_field
= build_decl (input_location
,
6248 DECL_BIT_FIELD (padding_field
) = 1;
6249 DECL_SIZE (padding_field
) = padding
;
6250 DECL_CONTEXT (padding_field
) = t
;
6251 DECL_ARTIFICIAL (padding_field
) = 1;
6252 DECL_IGNORED_P (padding_field
) = 1;
6253 layout_nonempty_base_or_field (rli
, padding_field
,
6255 empty_base_offsets
);
6258 last_field_was_bitfield
= DECL_C_BIT_FIELD (field
);
6261 if (!integer_zerop (rli
->bitpos
))
6263 /* Make sure that we are on a byte boundary so that the size of
6264 the class without virtual bases will always be a round number
6266 rli
->bitpos
= round_up_loc (input_location
, rli
->bitpos
, BITS_PER_UNIT
);
6267 normalize_rli (rli
);
6270 /* Delete all zero-width bit-fields from the list of fields. Now
6271 that the type is laid out they are no longer important. */
6272 remove_zero_width_bit_fields (t
);
6274 /* Create the version of T used for virtual bases. We do not use
6275 make_class_type for this version; this is an artificial type. For
6276 a POD type, we just reuse T. */
6277 if (CLASSTYPE_NON_LAYOUT_POD_P (t
) || CLASSTYPE_EMPTY_P (t
))
6279 base_t
= make_node (TREE_CODE (t
));
6281 /* Set the size and alignment for the new type. */
6284 /* If the ABI version is not at least two, and the last
6285 field was a bit-field, RLI may not be on a byte
6286 boundary. In particular, rli_size_unit_so_far might
6287 indicate the last complete byte, while rli_size_so_far
6288 indicates the total number of bits used. Therefore,
6289 rli_size_so_far, rather than rli_size_unit_so_far, is
6290 used to compute TYPE_SIZE_UNIT. */
6291 eoc
= end_of_class (t
, /*include_virtuals_p=*/0);
6292 TYPE_SIZE_UNIT (base_t
)
6293 = size_binop (MAX_EXPR
,
6295 size_binop (CEIL_DIV_EXPR
,
6296 rli_size_so_far (rli
),
6297 bitsize_int (BITS_PER_UNIT
))),
6300 = size_binop (MAX_EXPR
,
6301 rli_size_so_far (rli
),
6302 size_binop (MULT_EXPR
,
6303 convert (bitsizetype
, eoc
),
6304 bitsize_int (BITS_PER_UNIT
)));
6305 TYPE_ALIGN (base_t
) = rli
->record_align
;
6306 TYPE_USER_ALIGN (base_t
) = TYPE_USER_ALIGN (t
);
6308 /* Copy the fields from T. */
6309 next_field
= &TYPE_FIELDS (base_t
);
6310 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
6311 if (TREE_CODE (field
) == FIELD_DECL
)
6313 *next_field
= build_decl (input_location
,
6317 DECL_CONTEXT (*next_field
) = base_t
;
6318 DECL_FIELD_OFFSET (*next_field
) = DECL_FIELD_OFFSET (field
);
6319 DECL_FIELD_BIT_OFFSET (*next_field
)
6320 = DECL_FIELD_BIT_OFFSET (field
);
6321 DECL_SIZE (*next_field
) = DECL_SIZE (field
);
6322 DECL_MODE (*next_field
) = DECL_MODE (field
);
6323 next_field
= &DECL_CHAIN (*next_field
);
6326 /* Record the base version of the type. */
6327 CLASSTYPE_AS_BASE (t
) = base_t
;
6328 TYPE_CONTEXT (base_t
) = t
;
6331 CLASSTYPE_AS_BASE (t
) = t
;
6333 /* Every empty class contains an empty class. */
6334 if (CLASSTYPE_EMPTY_P (t
))
6335 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 1;
6337 /* Set the TYPE_DECL for this type to contain the right
6338 value for DECL_OFFSET, so that we can use it as part
6339 of a COMPONENT_REF for multiple inheritance. */
6340 layout_decl (TYPE_MAIN_DECL (t
), 0);
6342 /* Now fix up any virtual base class types that we left lying
6343 around. We must get these done before we try to lay out the
6344 virtual function table. As a side-effect, this will remove the
6345 base subobject fields. */
6346 layout_virtual_bases (rli
, empty_base_offsets
);
6348 /* Make sure that empty classes are reflected in RLI at this
6350 include_empty_classes(rli
);
6352 /* Make sure not to create any structures with zero size. */
6353 if (integer_zerop (rli_size_unit_so_far (rli
)) && CLASSTYPE_EMPTY_P (t
))
6355 build_decl (input_location
,
6356 FIELD_DECL
, NULL_TREE
, char_type_node
));
6358 /* If this is a non-POD, declaring it packed makes a difference to how it
6359 can be used as a field; don't let finalize_record_size undo it. */
6360 if (TYPE_PACKED (t
) && !layout_pod_type_p (t
))
6361 rli
->packed_maybe_necessary
= true;
6363 /* Let the back end lay out the type. */
6364 finish_record_layout (rli
, /*free_p=*/true);
6366 if (TYPE_SIZE_UNIT (t
)
6367 && TREE_CODE (TYPE_SIZE_UNIT (t
)) == INTEGER_CST
6368 && !TREE_OVERFLOW (TYPE_SIZE_UNIT (t
))
6369 && !valid_constant_size_p (TYPE_SIZE_UNIT (t
)))
6370 error ("type %qT is too large", t
);
6372 /* Warn about bases that can't be talked about due to ambiguity. */
6373 warn_about_ambiguous_bases (t
);
6375 /* Now that we're done with layout, give the base fields the real types. */
6376 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
6377 if (DECL_ARTIFICIAL (field
) && IS_FAKE_BASE_TYPE (TREE_TYPE (field
)))
6378 TREE_TYPE (field
) = TYPE_CONTEXT (TREE_TYPE (field
));
6381 splay_tree_delete (empty_base_offsets
);
6383 if (CLASSTYPE_EMPTY_P (t
)
6384 && tree_int_cst_lt (sizeof_biggest_empty_class
,
6385 TYPE_SIZE_UNIT (t
)))
6386 sizeof_biggest_empty_class
= TYPE_SIZE_UNIT (t
);
6389 /* Determine the "key method" for the class type indicated by TYPE,
6390 and set CLASSTYPE_KEY_METHOD accordingly. */
6393 determine_key_method (tree type
)
6397 if (TYPE_FOR_JAVA (type
)
6398 || processing_template_decl
6399 || CLASSTYPE_TEMPLATE_INSTANTIATION (type
)
6400 || CLASSTYPE_INTERFACE_KNOWN (type
))
6403 /* The key method is the first non-pure virtual function that is not
6404 inline at the point of class definition. On some targets the
6405 key function may not be inline; those targets should not call
6406 this function until the end of the translation unit. */
6407 for (method
= TYPE_METHODS (type
); method
!= NULL_TREE
;
6408 method
= DECL_CHAIN (method
))
6409 if (TREE_CODE (method
) == FUNCTION_DECL
6410 && DECL_VINDEX (method
) != NULL_TREE
6411 && ! DECL_DECLARED_INLINE_P (method
)
6412 && ! DECL_PURE_VIRTUAL_P (method
))
6414 CLASSTYPE_KEY_METHOD (type
) = method
;
6422 /* Allocate and return an instance of struct sorted_fields_type with
6425 static struct sorted_fields_type
*
6426 sorted_fields_type_new (int n
)
6428 struct sorted_fields_type
*sft
;
6429 sft
= (sorted_fields_type
*) ggc_internal_alloc (sizeof (sorted_fields_type
)
6430 + n
* sizeof (tree
));
6437 /* Perform processing required when the definition of T (a class type)
6441 finish_struct_1 (tree t
)
6444 /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */
6445 tree virtuals
= NULL_TREE
;
6447 if (COMPLETE_TYPE_P (t
))
6449 gcc_assert (MAYBE_CLASS_TYPE_P (t
));
6450 error ("redefinition of %q#T", t
);
6455 /* If this type was previously laid out as a forward reference,
6456 make sure we lay it out again. */
6457 TYPE_SIZE (t
) = NULL_TREE
;
6458 CLASSTYPE_PRIMARY_BINFO (t
) = NULL_TREE
;
6460 /* Make assumptions about the class; we'll reset the flags if
6462 CLASSTYPE_EMPTY_P (t
) = 1;
6463 CLASSTYPE_NEARLY_EMPTY_P (t
) = 1;
6464 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 0;
6465 CLASSTYPE_LITERAL_P (t
) = true;
6467 /* Do end-of-class semantic processing: checking the validity of the
6468 bases and members and add implicitly generated methods. */
6469 check_bases_and_members (t
);
6471 /* Find the key method. */
6472 if (TYPE_CONTAINS_VPTR_P (t
))
6474 /* The Itanium C++ ABI permits the key method to be chosen when
6475 the class is defined -- even though the key method so
6476 selected may later turn out to be an inline function. On
6477 some systems (such as ARM Symbian OS) the key method cannot
6478 be determined until the end of the translation unit. On such
6479 systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which
6480 will cause the class to be added to KEYED_CLASSES. Then, in
6481 finish_file we will determine the key method. */
6482 if (targetm
.cxx
.key_method_may_be_inline ())
6483 determine_key_method (t
);
6485 /* If a polymorphic class has no key method, we may emit the vtable
6486 in every translation unit where the class definition appears. If
6487 we're devirtualizing, we can look into the vtable even if we
6488 aren't emitting it. */
6489 if (CLASSTYPE_KEY_METHOD (t
) == NULL_TREE
)
6490 keyed_classes
= tree_cons (NULL_TREE
, t
, keyed_classes
);
6493 /* Layout the class itself. */
6494 layout_class_type (t
, &virtuals
);
6495 if (CLASSTYPE_AS_BASE (t
) != t
)
6496 /* We use the base type for trivial assignments, and hence it
6498 compute_record_mode (CLASSTYPE_AS_BASE (t
));
6500 virtuals
= modify_all_vtables (t
, nreverse (virtuals
));
6502 /* If necessary, create the primary vtable for this class. */
6503 if (virtuals
|| TYPE_CONTAINS_VPTR_P (t
))
6505 /* We must enter these virtuals into the table. */
6506 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
6507 build_primary_vtable (NULL_TREE
, t
);
6508 else if (! BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (t
)))
6509 /* Here we know enough to change the type of our virtual
6510 function table, but we will wait until later this function. */
6511 build_primary_vtable (CLASSTYPE_PRIMARY_BINFO (t
), t
);
6513 /* If we're warning about ABI tags, check the types of the new
6514 virtual functions. */
6516 for (tree v
= virtuals
; v
; v
= TREE_CHAIN (v
))
6517 check_abi_tags (t
, TREE_VALUE (v
));
6520 if (TYPE_CONTAINS_VPTR_P (t
))
6525 if (BINFO_VTABLE (TYPE_BINFO (t
)))
6526 gcc_assert (DECL_VIRTUAL_P (BINFO_VTABLE (TYPE_BINFO (t
))));
6527 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
6528 gcc_assert (BINFO_VIRTUALS (TYPE_BINFO (t
)) == NULL_TREE
);
6530 /* Add entries for virtual functions introduced by this class. */
6531 BINFO_VIRTUALS (TYPE_BINFO (t
))
6532 = chainon (BINFO_VIRTUALS (TYPE_BINFO (t
)), virtuals
);
6534 /* Set DECL_VINDEX for all functions declared in this class. */
6535 for (vindex
= 0, fn
= BINFO_VIRTUALS (TYPE_BINFO (t
));
6537 fn
= TREE_CHAIN (fn
),
6538 vindex
+= (TARGET_VTABLE_USES_DESCRIPTORS
6539 ? TARGET_VTABLE_USES_DESCRIPTORS
: 1))
6541 tree fndecl
= BV_FN (fn
);
6543 if (DECL_THUNK_P (fndecl
))
6544 /* A thunk. We should never be calling this entry directly
6545 from this vtable -- we'd use the entry for the non
6546 thunk base function. */
6547 DECL_VINDEX (fndecl
) = NULL_TREE
;
6548 else if (TREE_CODE (DECL_VINDEX (fndecl
)) != INTEGER_CST
)
6549 DECL_VINDEX (fndecl
) = build_int_cst (NULL_TREE
, vindex
);
6553 finish_struct_bits (t
);
6554 set_method_tm_attributes (t
);
6556 /* Complete the rtl for any static member objects of the type we're
6558 for (x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
6559 if (VAR_P (x
) && TREE_STATIC (x
)
6560 && TREE_TYPE (x
) != error_mark_node
6561 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (x
)), t
))
6562 DECL_MODE (x
) = TYPE_MODE (t
);
6564 /* Done with FIELDS...now decide whether to sort these for
6565 faster lookups later.
6567 We use a small number because most searches fail (succeeding
6568 ultimately as the search bores through the inheritance
6569 hierarchy), and we want this failure to occur quickly. */
6571 insert_into_classtype_sorted_fields (TYPE_FIELDS (t
), t
, 8);
6573 /* Complain if one of the field types requires lower visibility. */
6574 constrain_class_visibility (t
);
6576 /* Make the rtl for any new vtables we have created, and unmark
6577 the base types we marked. */
6580 /* Build the VTT for T. */
6583 /* This warning does not make sense for Java classes, since they
6584 cannot have destructors. */
6585 if (!TYPE_FOR_JAVA (t
) && warn_nonvdtor
6586 && TYPE_POLYMORPHIC_P (t
) && accessible_nvdtor_p (t
)
6587 && !CLASSTYPE_FINAL (t
))
6588 warning (OPT_Wnon_virtual_dtor
,
6589 "%q#T has virtual functions and accessible"
6590 " non-virtual destructor", t
);
6594 if (warn_overloaded_virtual
)
6597 /* Class layout, assignment of virtual table slots, etc., is now
6598 complete. Give the back end a chance to tweak the visibility of
6599 the class or perform any other required target modifications. */
6600 targetm
.cxx
.adjust_class_at_definition (t
);
6602 maybe_suppress_debug_info (t
);
6604 if (flag_vtable_verify
)
6605 vtv_save_class_info (t
);
6607 dump_class_hierarchy (t
);
6609 /* Finish debugging output for this type. */
6610 rest_of_type_compilation (t
, ! LOCAL_CLASS_P (t
));
6612 if (TYPE_TRANSPARENT_AGGR (t
))
6614 tree field
= first_field (t
);
6615 if (field
== NULL_TREE
|| error_operand_p (field
))
6617 error ("type transparent %q#T does not have any fields", t
);
6618 TYPE_TRANSPARENT_AGGR (t
) = 0;
6620 else if (DECL_ARTIFICIAL (field
))
6622 if (DECL_FIELD_IS_BASE (field
))
6623 error ("type transparent class %qT has base classes", t
);
6626 gcc_checking_assert (DECL_VIRTUAL_P (field
));
6627 error ("type transparent class %qT has virtual functions", t
);
6629 TYPE_TRANSPARENT_AGGR (t
) = 0;
6631 else if (TYPE_MODE (t
) != DECL_MODE (field
))
6633 error ("type transparent %q#T cannot be made transparent because "
6634 "the type of the first field has a different ABI from the "
6635 "class overall", t
);
6636 TYPE_TRANSPARENT_AGGR (t
) = 0;
6641 /* Insert FIELDS into T for the sorted case if the FIELDS count is
6642 equal to THRESHOLD or greater than THRESHOLD. */
6645 insert_into_classtype_sorted_fields (tree fields
, tree t
, int threshold
)
6647 int n_fields
= count_fields (fields
);
6648 if (n_fields
>= threshold
)
6650 struct sorted_fields_type
*field_vec
= sorted_fields_type_new (n_fields
);
6651 add_fields_to_record_type (fields
, field_vec
, 0);
6652 qsort (field_vec
->elts
, n_fields
, sizeof (tree
), field_decl_cmp
);
6653 CLASSTYPE_SORTED_FIELDS (t
) = field_vec
;
6657 /* Insert lately defined enum ENUMTYPE into T for the sorted case. */
6660 insert_late_enum_def_into_classtype_sorted_fields (tree enumtype
, tree t
)
6662 struct sorted_fields_type
*sorted_fields
= CLASSTYPE_SORTED_FIELDS (t
);
6667 = list_length (TYPE_VALUES (enumtype
)) + sorted_fields
->len
;
6668 struct sorted_fields_type
*field_vec
= sorted_fields_type_new (n_fields
);
6670 for (i
= 0; i
< sorted_fields
->len
; ++i
)
6671 field_vec
->elts
[i
] = sorted_fields
->elts
[i
];
6673 add_enum_fields_to_record_type (enumtype
, field_vec
,
6674 sorted_fields
->len
);
6675 qsort (field_vec
->elts
, n_fields
, sizeof (tree
), field_decl_cmp
);
6676 CLASSTYPE_SORTED_FIELDS (t
) = field_vec
;
6680 /* When T was built up, the member declarations were added in reverse
6681 order. Rearrange them to declaration order. */
6684 unreverse_member_declarations (tree t
)
6690 /* The following lists are all in reverse order. Put them in
6691 declaration order now. */
6692 TYPE_METHODS (t
) = nreverse (TYPE_METHODS (t
));
6693 CLASSTYPE_DECL_LIST (t
) = nreverse (CLASSTYPE_DECL_LIST (t
));
6695 /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in
6696 reverse order, so we can't just use nreverse. */
6698 for (x
= TYPE_FIELDS (t
);
6699 x
&& TREE_CODE (x
) != TYPE_DECL
;
6702 next
= DECL_CHAIN (x
);
6703 DECL_CHAIN (x
) = prev
;
6708 DECL_CHAIN (TYPE_FIELDS (t
)) = x
;
6710 TYPE_FIELDS (t
) = prev
;
6715 finish_struct (tree t
, tree attributes
)
6717 location_t saved_loc
= input_location
;
6719 /* Now that we've got all the field declarations, reverse everything
6721 unreverse_member_declarations (t
);
6723 cplus_decl_attributes (&t
, attributes
, (int) ATTR_FLAG_TYPE_IN_PLACE
);
6725 /* Nadger the current location so that diagnostics point to the start of
6726 the struct, not the end. */
6727 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (t
));
6729 if (processing_template_decl
)
6733 finish_struct_methods (t
);
6734 TYPE_SIZE (t
) = bitsize_zero_node
;
6735 TYPE_SIZE_UNIT (t
) = size_zero_node
;
6737 /* We need to emit an error message if this type was used as a parameter
6738 and it is an abstract type, even if it is a template. We construct
6739 a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into
6740 account and we call complete_vars with this type, which will check
6741 the PARM_DECLS. Note that while the type is being defined,
6742 CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends
6743 (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */
6744 CLASSTYPE_PURE_VIRTUALS (t
) = NULL
;
6745 for (x
= TYPE_METHODS (t
); x
; x
= DECL_CHAIN (x
))
6746 if (DECL_PURE_VIRTUAL_P (x
))
6747 vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t
), x
);
6749 /* We need to add the target functions to the CLASSTYPE_METHOD_VEC if
6750 an enclosing scope is a template class, so that this function be
6751 found by lookup_fnfields_1 when the using declaration is not
6752 instantiated yet. */
6753 for (x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
6754 if (TREE_CODE (x
) == USING_DECL
)
6756 tree fn
= strip_using_decl (x
);
6757 if (is_overloaded_fn (fn
))
6758 for (; fn
; fn
= OVL_NEXT (fn
))
6759 add_method (t
, OVL_CURRENT (fn
), x
);
6762 /* Remember current #pragma pack value. */
6763 TYPE_PRECISION (t
) = maximum_field_alignment
;
6765 /* Fix up any variants we've already built. */
6766 for (x
= TYPE_NEXT_VARIANT (t
); x
; x
= TYPE_NEXT_VARIANT (x
))
6768 TYPE_SIZE (x
) = TYPE_SIZE (t
);
6769 TYPE_SIZE_UNIT (x
) = TYPE_SIZE_UNIT (t
);
6770 TYPE_FIELDS (x
) = TYPE_FIELDS (t
);
6771 TYPE_METHODS (x
) = TYPE_METHODS (t
);
6775 finish_struct_1 (t
);
6777 if (is_std_init_list (t
))
6779 /* People keep complaining that the compiler crashes on an invalid
6780 definition of initializer_list, so I guess we should explicitly
6781 reject it. What the compiler internals care about is that it's a
6782 template and has a pointer field followed by an integer field. */
6784 if (processing_template_decl
)
6786 tree f
= next_initializable_field (TYPE_FIELDS (t
));
6787 if (f
&& TREE_CODE (TREE_TYPE (f
)) == POINTER_TYPE
)
6789 f
= next_initializable_field (DECL_CHAIN (f
));
6790 if (f
&& TREE_CODE (TREE_TYPE (f
)) == INTEGER_TYPE
)
6795 fatal_error ("definition of std::initializer_list does not match "
6796 "#include <initializer_list>");
6799 input_location
= saved_loc
;
6801 TYPE_BEING_DEFINED (t
) = 0;
6803 if (current_class_type
)
6806 error ("trying to finish struct, but kicked out due to previous parse errors");
6808 if (processing_template_decl
&& at_function_scope_p ()
6809 /* Lambdas are defined by the LAMBDA_EXPR. */
6810 && !LAMBDA_TYPE_P (t
))
6811 add_stmt (build_min (TAG_DEFN
, t
));
6816 /* Hash table to avoid endless recursion when handling references. */
6817 static hash_table
<pointer_hash
<tree_node
> > *fixed_type_or_null_ref_ht
;
6819 /* Return the dynamic type of INSTANCE, if known.
6820 Used to determine whether the virtual function table is needed
6823 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
6824 of our knowledge of its type. *NONNULL should be initialized
6825 before this function is called. */
6828 fixed_type_or_null (tree instance
, int *nonnull
, int *cdtorp
)
6830 #define RECUR(T) fixed_type_or_null((T), nonnull, cdtorp)
6832 switch (TREE_CODE (instance
))
6835 if (POINTER_TYPE_P (TREE_TYPE (instance
)))
6838 return RECUR (TREE_OPERAND (instance
, 0));
6841 /* This is a call to a constructor, hence it's never zero. */
6842 if (TREE_HAS_CONSTRUCTOR (instance
))
6846 return TREE_TYPE (instance
);
6851 /* This is a call to a constructor, hence it's never zero. */
6852 if (TREE_HAS_CONSTRUCTOR (instance
))
6856 return TREE_TYPE (instance
);
6858 return RECUR (TREE_OPERAND (instance
, 0));
6860 case POINTER_PLUS_EXPR
:
6863 if (TREE_CODE (TREE_OPERAND (instance
, 0)) == ADDR_EXPR
)
6864 return RECUR (TREE_OPERAND (instance
, 0));
6865 if (TREE_CODE (TREE_OPERAND (instance
, 1)) == INTEGER_CST
)
6866 /* Propagate nonnull. */
6867 return RECUR (TREE_OPERAND (instance
, 0));
6872 return RECUR (TREE_OPERAND (instance
, 0));
6875 instance
= TREE_OPERAND (instance
, 0);
6878 /* Just because we see an ADDR_EXPR doesn't mean we're dealing
6879 with a real object -- given &p->f, p can still be null. */
6880 tree t
= get_base_address (instance
);
6881 /* ??? Probably should check DECL_WEAK here. */
6882 if (t
&& DECL_P (t
))
6885 return RECUR (instance
);
6888 /* If this component is really a base class reference, then the field
6889 itself isn't definitive. */
6890 if (DECL_FIELD_IS_BASE (TREE_OPERAND (instance
, 1)))
6891 return RECUR (TREE_OPERAND (instance
, 0));
6892 return RECUR (TREE_OPERAND (instance
, 1));
6896 if (TREE_CODE (TREE_TYPE (instance
)) == ARRAY_TYPE
6897 && MAYBE_CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (instance
))))
6901 return TREE_TYPE (TREE_TYPE (instance
));
6903 /* fall through... */
6907 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (instance
)))
6911 return TREE_TYPE (instance
);
6913 else if (instance
== current_class_ptr
)
6918 /* if we're in a ctor or dtor, we know our type. If
6919 current_class_ptr is set but we aren't in a function, we're in
6920 an NSDMI (and therefore a constructor). */
6921 if (current_scope () != current_function_decl
6922 || (DECL_LANG_SPECIFIC (current_function_decl
)
6923 && (DECL_CONSTRUCTOR_P (current_function_decl
)
6924 || DECL_DESTRUCTOR_P (current_function_decl
))))
6928 return TREE_TYPE (TREE_TYPE (instance
));
6931 else if (TREE_CODE (TREE_TYPE (instance
)) == REFERENCE_TYPE
)
6933 /* We only need one hash table because it is always left empty. */
6934 if (!fixed_type_or_null_ref_ht
)
6935 fixed_type_or_null_ref_ht
6936 = new hash_table
<pointer_hash
<tree_node
> > (37);
6938 /* Reference variables should be references to objects. */
6942 /* Enter the INSTANCE in a table to prevent recursion; a
6943 variable's initializer may refer to the variable
6945 if (VAR_P (instance
)
6946 && DECL_INITIAL (instance
)
6947 && !type_dependent_expression_p_push (DECL_INITIAL (instance
))
6948 && !fixed_type_or_null_ref_ht
->find (instance
))
6953 slot
= fixed_type_or_null_ref_ht
->find_slot (instance
, INSERT
);
6955 type
= RECUR (DECL_INITIAL (instance
));
6956 fixed_type_or_null_ref_ht
->remove_elt (instance
);
6969 /* Return nonzero if the dynamic type of INSTANCE is known, and
6970 equivalent to the static type. We also handle the case where
6971 INSTANCE is really a pointer. Return negative if this is a
6972 ctor/dtor. There the dynamic type is known, but this might not be
6973 the most derived base of the original object, and hence virtual
6974 bases may not be laid out according to this type.
6976 Used to determine whether the virtual function table is needed
6979 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
6980 of our knowledge of its type. *NONNULL should be initialized
6981 before this function is called. */
6984 resolves_to_fixed_type_p (tree instance
, int* nonnull
)
6986 tree t
= TREE_TYPE (instance
);
6990 /* processing_template_decl can be false in a template if we're in
6991 instantiate_non_dependent_expr, but we still want to suppress
6993 if (in_template_function ())
6995 /* In a template we only care about the type of the result. */
7001 fixed
= fixed_type_or_null (instance
, nonnull
, &cdtorp
);
7002 if (fixed
== NULL_TREE
)
7004 if (POINTER_TYPE_P (t
))
7006 if (!same_type_ignoring_top_level_qualifiers_p (t
, fixed
))
7008 return cdtorp
? -1 : 1;
7013 init_class_processing (void)
7015 current_class_depth
= 0;
7016 current_class_stack_size
= 10;
7018 = XNEWVEC (struct class_stack_node
, current_class_stack_size
);
7019 vec_alloc (local_classes
, 8);
7020 sizeof_biggest_empty_class
= size_zero_node
;
7022 ridpointers
[(int) RID_PUBLIC
] = access_public_node
;
7023 ridpointers
[(int) RID_PRIVATE
] = access_private_node
;
7024 ridpointers
[(int) RID_PROTECTED
] = access_protected_node
;
7027 /* Restore the cached PREVIOUS_CLASS_LEVEL. */
7030 restore_class_cache (void)
7034 /* We are re-entering the same class we just left, so we don't
7035 have to search the whole inheritance matrix to find all the
7036 decls to bind again. Instead, we install the cached
7037 class_shadowed list and walk through it binding names. */
7038 push_binding_level (previous_class_level
);
7039 class_binding_level
= previous_class_level
;
7040 /* Restore IDENTIFIER_TYPE_VALUE. */
7041 for (type
= class_binding_level
->type_shadowed
;
7043 type
= TREE_CHAIN (type
))
7044 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (type
), TREE_TYPE (type
));
7047 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as
7048 appropriate for TYPE.
7050 So that we may avoid calls to lookup_name, we cache the _TYPE
7051 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
7053 For multiple inheritance, we perform a two-pass depth-first search
7054 of the type lattice. */
7057 pushclass (tree type
)
7059 class_stack_node_t csn
;
7061 type
= TYPE_MAIN_VARIANT (type
);
7063 /* Make sure there is enough room for the new entry on the stack. */
7064 if (current_class_depth
+ 1 >= current_class_stack_size
)
7066 current_class_stack_size
*= 2;
7068 = XRESIZEVEC (struct class_stack_node
, current_class_stack
,
7069 current_class_stack_size
);
7072 /* Insert a new entry on the class stack. */
7073 csn
= current_class_stack
+ current_class_depth
;
7074 csn
->name
= current_class_name
;
7075 csn
->type
= current_class_type
;
7076 csn
->access
= current_access_specifier
;
7077 csn
->names_used
= 0;
7079 current_class_depth
++;
7081 /* Now set up the new type. */
7082 current_class_name
= TYPE_NAME (type
);
7083 if (TREE_CODE (current_class_name
) == TYPE_DECL
)
7084 current_class_name
= DECL_NAME (current_class_name
);
7085 current_class_type
= type
;
7087 /* By default, things in classes are private, while things in
7088 structures or unions are public. */
7089 current_access_specifier
= (CLASSTYPE_DECLARED_CLASS (type
)
7090 ? access_private_node
7091 : access_public_node
);
7093 if (previous_class_level
7094 && type
!= previous_class_level
->this_entity
7095 && current_class_depth
== 1)
7097 /* Forcibly remove any old class remnants. */
7098 invalidate_class_lookup_cache ();
7101 if (!previous_class_level
7102 || type
!= previous_class_level
->this_entity
7103 || current_class_depth
> 1)
7106 restore_class_cache ();
7109 /* When we exit a toplevel class scope, we save its binding level so
7110 that we can restore it quickly. Here, we've entered some other
7111 class, so we must invalidate our cache. */
7114 invalidate_class_lookup_cache (void)
7116 previous_class_level
= NULL
;
7119 /* Get out of the current class scope. If we were in a class scope
7120 previously, that is the one popped to. */
7127 current_class_depth
--;
7128 current_class_name
= current_class_stack
[current_class_depth
].name
;
7129 current_class_type
= current_class_stack
[current_class_depth
].type
;
7130 current_access_specifier
= current_class_stack
[current_class_depth
].access
;
7131 if (current_class_stack
[current_class_depth
].names_used
)
7132 splay_tree_delete (current_class_stack
[current_class_depth
].names_used
);
7135 /* Mark the top of the class stack as hidden. */
7138 push_class_stack (void)
7140 if (current_class_depth
)
7141 ++current_class_stack
[current_class_depth
- 1].hidden
;
7144 /* Mark the top of the class stack as un-hidden. */
7147 pop_class_stack (void)
7149 if (current_class_depth
)
7150 --current_class_stack
[current_class_depth
- 1].hidden
;
7153 /* Returns 1 if the class type currently being defined is either T or
7154 a nested type of T. */
7157 currently_open_class (tree t
)
7161 if (!CLASS_TYPE_P (t
))
7164 t
= TYPE_MAIN_VARIANT (t
);
7166 /* We start looking from 1 because entry 0 is from global scope,
7168 for (i
= current_class_depth
; i
> 0; --i
)
7171 if (i
== current_class_depth
)
7172 c
= current_class_type
;
7175 if (current_class_stack
[i
].hidden
)
7177 c
= current_class_stack
[i
].type
;
7181 if (same_type_p (c
, t
))
7187 /* If either current_class_type or one of its enclosing classes are derived
7188 from T, return the appropriate type. Used to determine how we found
7189 something via unqualified lookup. */
7192 currently_open_derived_class (tree t
)
7196 /* The bases of a dependent type are unknown. */
7197 if (dependent_type_p (t
))
7200 if (!current_class_type
)
7203 if (DERIVED_FROM_P (t
, current_class_type
))
7204 return current_class_type
;
7206 for (i
= current_class_depth
- 1; i
> 0; --i
)
7208 if (current_class_stack
[i
].hidden
)
7210 if (DERIVED_FROM_P (t
, current_class_stack
[i
].type
))
7211 return current_class_stack
[i
].type
;
7217 /* Return the outermost enclosing class type that is still open, or
7221 outermost_open_class (void)
7223 if (!current_class_type
)
7226 if (TYPE_BEING_DEFINED (current_class_type
))
7227 r
= current_class_type
;
7228 for (int i
= current_class_depth
- 1; i
> 0; --i
)
7230 if (current_class_stack
[i
].hidden
)
7232 tree t
= current_class_stack
[i
].type
;
7233 if (!TYPE_BEING_DEFINED (t
))
7240 /* Returns the innermost class type which is not a lambda closure type. */
7243 current_nonlambda_class_type (void)
7247 /* We start looking from 1 because entry 0 is from global scope,
7249 for (i
= current_class_depth
; i
> 0; --i
)
7252 if (i
== current_class_depth
)
7253 c
= current_class_type
;
7256 if (current_class_stack
[i
].hidden
)
7258 c
= current_class_stack
[i
].type
;
7262 if (!LAMBDA_TYPE_P (c
))
7268 /* When entering a class scope, all enclosing class scopes' names with
7269 static meaning (static variables, static functions, types and
7270 enumerators) have to be visible. This recursive function calls
7271 pushclass for all enclosing class contexts until global or a local
7272 scope is reached. TYPE is the enclosed class. */
7275 push_nested_class (tree type
)
7277 /* A namespace might be passed in error cases, like A::B:C. */
7278 if (type
== NULL_TREE
7279 || !CLASS_TYPE_P (type
))
7282 push_nested_class (DECL_CONTEXT (TYPE_MAIN_DECL (type
)));
7287 /* Undoes a push_nested_class call. */
7290 pop_nested_class (void)
7292 tree context
= DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type
));
7295 if (context
&& CLASS_TYPE_P (context
))
7296 pop_nested_class ();
7299 /* Returns the number of extern "LANG" blocks we are nested within. */
7302 current_lang_depth (void)
7304 return vec_safe_length (current_lang_base
);
7307 /* Set global variables CURRENT_LANG_NAME to appropriate value
7308 so that behavior of name-mangling machinery is correct. */
7311 push_lang_context (tree name
)
7313 vec_safe_push (current_lang_base
, current_lang_name
);
7315 if (name
== lang_name_cplusplus
)
7317 current_lang_name
= name
;
7319 else if (name
== lang_name_java
)
7321 current_lang_name
= name
;
7322 /* DECL_IGNORED_P is initially set for these types, to avoid clutter.
7323 (See record_builtin_java_type in decl.c.) However, that causes
7324 incorrect debug entries if these types are actually used.
7325 So we re-enable debug output after extern "Java". */
7326 DECL_IGNORED_P (TYPE_NAME (java_byte_type_node
)) = 0;
7327 DECL_IGNORED_P (TYPE_NAME (java_short_type_node
)) = 0;
7328 DECL_IGNORED_P (TYPE_NAME (java_int_type_node
)) = 0;
7329 DECL_IGNORED_P (TYPE_NAME (java_long_type_node
)) = 0;
7330 DECL_IGNORED_P (TYPE_NAME (java_float_type_node
)) = 0;
7331 DECL_IGNORED_P (TYPE_NAME (java_double_type_node
)) = 0;
7332 DECL_IGNORED_P (TYPE_NAME (java_char_type_node
)) = 0;
7333 DECL_IGNORED_P (TYPE_NAME (java_boolean_type_node
)) = 0;
7335 else if (name
== lang_name_c
)
7337 current_lang_name
= name
;
7340 error ("language string %<\"%E\"%> not recognized", name
);
7343 /* Get out of the current language scope. */
7346 pop_lang_context (void)
7348 current_lang_name
= current_lang_base
->pop ();
7351 /* Type instantiation routines. */
7353 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
7354 matches the TARGET_TYPE. If there is no satisfactory match, return
7355 error_mark_node, and issue an error & warning messages under
7356 control of FLAGS. Permit pointers to member function if FLAGS
7357 permits. If TEMPLATE_ONLY, the name of the overloaded function was
7358 a template-id, and EXPLICIT_TARGS are the explicitly provided
7361 If OVERLOAD is for one or more member functions, then ACCESS_PATH
7362 is the base path used to reference those member functions. If
7363 the address is resolved to a member function, access checks will be
7364 performed and errors issued if appropriate. */
7367 resolve_address_of_overloaded_function (tree target_type
,
7369 tsubst_flags_t flags
,
7371 tree explicit_targs
,
7374 /* Here's what the standard says:
7378 If the name is a function template, template argument deduction
7379 is done, and if the argument deduction succeeds, the deduced
7380 arguments are used to generate a single template function, which
7381 is added to the set of overloaded functions considered.
7383 Non-member functions and static member functions match targets of
7384 type "pointer-to-function" or "reference-to-function." Nonstatic
7385 member functions match targets of type "pointer-to-member
7386 function;" the function type of the pointer to member is used to
7387 select the member function from the set of overloaded member
7388 functions. If a nonstatic member function is selected, the
7389 reference to the overloaded function name is required to have the
7390 form of a pointer to member as described in 5.3.1.
7392 If more than one function is selected, any template functions in
7393 the set are eliminated if the set also contains a non-template
7394 function, and any given template function is eliminated if the
7395 set contains a second template function that is more specialized
7396 than the first according to the partial ordering rules 14.5.5.2.
7397 After such eliminations, if any, there shall remain exactly one
7398 selected function. */
7401 /* We store the matches in a TREE_LIST rooted here. The functions
7402 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
7403 interoperability with most_specialized_instantiation. */
7404 tree matches
= NULL_TREE
;
7406 tree target_fn_type
;
7408 /* By the time we get here, we should be seeing only real
7409 pointer-to-member types, not the internal POINTER_TYPE to
7410 METHOD_TYPE representation. */
7411 gcc_assert (!TYPE_PTR_P (target_type
)
7412 || TREE_CODE (TREE_TYPE (target_type
)) != METHOD_TYPE
);
7414 gcc_assert (is_overloaded_fn (overload
));
7416 /* Check that the TARGET_TYPE is reasonable. */
7417 if (TYPE_PTRFN_P (target_type
)
7418 || TYPE_REFFN_P (target_type
))
7420 else if (TYPE_PTRMEMFUNC_P (target_type
))
7421 /* This is OK, too. */
7423 else if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
7424 /* This is OK, too. This comes from a conversion to reference
7426 target_type
= build_reference_type (target_type
);
7429 if (flags
& tf_error
)
7430 error ("cannot resolve overloaded function %qD based on"
7431 " conversion to type %qT",
7432 DECL_NAME (OVL_FUNCTION (overload
)), target_type
);
7433 return error_mark_node
;
7436 /* Non-member functions and static member functions match targets of type
7437 "pointer-to-function" or "reference-to-function." Nonstatic member
7438 functions match targets of type "pointer-to-member-function;" the
7439 function type of the pointer to member is used to select the member
7440 function from the set of overloaded member functions.
7442 So figure out the FUNCTION_TYPE that we want to match against. */
7443 target_fn_type
= static_fn_type (target_type
);
7445 /* If we can find a non-template function that matches, we can just
7446 use it. There's no point in generating template instantiations
7447 if we're just going to throw them out anyhow. But, of course, we
7448 can only do this when we don't *need* a template function. */
7453 for (fns
= overload
; fns
; fns
= OVL_NEXT (fns
))
7455 tree fn
= OVL_CURRENT (fns
);
7457 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
7458 /* We're not looking for templates just yet. */
7461 if ((TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7463 /* We're looking for a non-static member, and this isn't
7464 one, or vice versa. */
7467 /* Ignore functions which haven't been explicitly
7469 if (DECL_ANTICIPATED (fn
))
7472 /* See if there's a match. */
7473 if (same_type_p (target_fn_type
, static_fn_type (fn
)))
7474 matches
= tree_cons (fn
, NULL_TREE
, matches
);
7478 /* Now, if we've already got a match (or matches), there's no need
7479 to proceed to the template functions. But, if we don't have a
7480 match we need to look at them, too. */
7483 tree target_arg_types
;
7484 tree target_ret_type
;
7487 unsigned int nargs
, ia
;
7490 target_arg_types
= TYPE_ARG_TYPES (target_fn_type
);
7491 target_ret_type
= TREE_TYPE (target_fn_type
);
7493 nargs
= list_length (target_arg_types
);
7494 args
= XALLOCAVEC (tree
, nargs
);
7495 for (arg
= target_arg_types
, ia
= 0;
7496 arg
!= NULL_TREE
&& arg
!= void_list_node
;
7497 arg
= TREE_CHAIN (arg
), ++ia
)
7498 args
[ia
] = TREE_VALUE (arg
);
7501 for (fns
= overload
; fns
; fns
= OVL_NEXT (fns
))
7503 tree fn
= OVL_CURRENT (fns
);
7507 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7508 /* We're only looking for templates. */
7511 if ((TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7513 /* We're not looking for a non-static member, and this is
7514 one, or vice versa. */
7517 tree ret
= target_ret_type
;
7519 /* If the template has a deduced return type, don't expose it to
7520 template argument deduction. */
7521 if (undeduced_auto_decl (fn
))
7524 /* Try to do argument deduction. */
7525 targs
= make_tree_vec (DECL_NTPARMS (fn
));
7526 instantiation
= fn_type_unification (fn
, explicit_targs
, targs
, args
,
7528 DEDUCE_EXACT
, LOOKUP_NORMAL
,
7530 if (instantiation
== error_mark_node
)
7531 /* Instantiation failed. */
7534 /* And now force instantiation to do return type deduction. */
7535 if (undeduced_auto_decl (instantiation
))
7538 instantiate_decl (instantiation
, /*defer*/false, /*class*/false);
7541 require_deduced_type (instantiation
);
7544 /* See if there's a match. */
7545 if (same_type_p (target_fn_type
, static_fn_type (instantiation
)))
7546 matches
= tree_cons (instantiation
, fn
, matches
);
7549 /* Now, remove all but the most specialized of the matches. */
7552 tree match
= most_specialized_instantiation (matches
);
7554 if (match
!= error_mark_node
)
7555 matches
= tree_cons (TREE_PURPOSE (match
),
7561 /* Now we should have exactly one function in MATCHES. */
7562 if (matches
== NULL_TREE
)
7564 /* There were *no* matches. */
7565 if (flags
& tf_error
)
7567 error ("no matches converting function %qD to type %q#T",
7568 DECL_NAME (OVL_CURRENT (overload
)),
7571 print_candidates (overload
);
7573 return error_mark_node
;
7575 else if (TREE_CHAIN (matches
))
7577 /* There were too many matches. First check if they're all
7578 the same function. */
7579 tree match
= NULL_TREE
;
7581 fn
= TREE_PURPOSE (matches
);
7583 /* For multi-versioned functions, more than one match is just fine and
7584 decls_match will return false as they are different. */
7585 for (match
= TREE_CHAIN (matches
); match
; match
= TREE_CHAIN (match
))
7586 if (!decls_match (fn
, TREE_PURPOSE (match
))
7587 && !targetm
.target_option
.function_versions
7588 (fn
, TREE_PURPOSE (match
)))
7593 if (flags
& tf_error
)
7595 error ("converting overloaded function %qD to type %q#T is ambiguous",
7596 DECL_NAME (OVL_FUNCTION (overload
)),
7599 /* Since print_candidates expects the functions in the
7600 TREE_VALUE slot, we flip them here. */
7601 for (match
= matches
; match
; match
= TREE_CHAIN (match
))
7602 TREE_VALUE (match
) = TREE_PURPOSE (match
);
7604 print_candidates (matches
);
7607 return error_mark_node
;
7611 /* Good, exactly one match. Now, convert it to the correct type. */
7612 fn
= TREE_PURPOSE (matches
);
7614 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
7615 && !(flags
& tf_ptrmem_ok
) && !flag_ms_extensions
)
7617 static int explained
;
7619 if (!(flags
& tf_error
))
7620 return error_mark_node
;
7622 permerror (input_location
, "assuming pointer to member %qD", fn
);
7625 inform (input_location
, "(a pointer to member can only be formed with %<&%E%>)", fn
);
7630 /* If a pointer to a function that is multi-versioned is requested, the
7631 pointer to the dispatcher function is returned instead. This works
7632 well because indirectly calling the function will dispatch the right
7633 function version at run-time. */
7634 if (DECL_FUNCTION_VERSIONED (fn
))
7636 fn
= get_function_version_dispatcher (fn
);
7638 return error_mark_node
;
7639 /* Mark all the versions corresponding to the dispatcher as used. */
7640 if (!(flags
& tf_conv
))
7641 mark_versions_used (fn
);
7644 /* If we're doing overload resolution purely for the purpose of
7645 determining conversion sequences, we should not consider the
7646 function used. If this conversion sequence is selected, the
7647 function will be marked as used at this point. */
7648 if (!(flags
& tf_conv
))
7650 /* Make =delete work with SFINAE. */
7651 if (DECL_DELETED_FN (fn
) && !(flags
& tf_error
))
7652 return error_mark_node
;
7657 /* We could not check access to member functions when this
7658 expression was originally created since we did not know at that
7659 time to which function the expression referred. */
7660 if (DECL_FUNCTION_MEMBER_P (fn
))
7662 gcc_assert (access_path
);
7663 perform_or_defer_access_check (access_path
, fn
, fn
, flags
);
7666 if (TYPE_PTRFN_P (target_type
) || TYPE_PTRMEMFUNC_P (target_type
))
7667 return cp_build_addr_expr (fn
, flags
);
7670 /* The target must be a REFERENCE_TYPE. Above, cp_build_unary_op
7671 will mark the function as addressed, but here we must do it
7673 cxx_mark_addressable (fn
);
7679 /* This function will instantiate the type of the expression given in
7680 RHS to match the type of LHSTYPE. If errors exist, then return
7681 error_mark_node. FLAGS is a bit mask. If TF_ERROR is set, then
7682 we complain on errors. If we are not complaining, never modify rhs,
7683 as overload resolution wants to try many possible instantiations, in
7684 the hope that at least one will work.
7686 For non-recursive calls, LHSTYPE should be a function, pointer to
7687 function, or a pointer to member function. */
7690 instantiate_type (tree lhstype
, tree rhs
, tsubst_flags_t flags
)
7692 tsubst_flags_t flags_in
= flags
;
7693 tree access_path
= NULL_TREE
;
7695 flags
&= ~tf_ptrmem_ok
;
7697 if (lhstype
== unknown_type_node
)
7699 if (flags
& tf_error
)
7700 error ("not enough type information");
7701 return error_mark_node
;
7704 if (TREE_TYPE (rhs
) != NULL_TREE
&& ! (type_unknown_p (rhs
)))
7706 tree fntype
= non_reference (lhstype
);
7707 if (same_type_p (fntype
, TREE_TYPE (rhs
)))
7709 if (flag_ms_extensions
7710 && TYPE_PTRMEMFUNC_P (fntype
)
7711 && !TYPE_PTRMEMFUNC_P (TREE_TYPE (rhs
)))
7712 /* Microsoft allows `A::f' to be resolved to a
7713 pointer-to-member. */
7717 if (flags
& tf_error
)
7718 error ("cannot convert %qE from type %qT to type %qT",
7719 rhs
, TREE_TYPE (rhs
), fntype
);
7720 return error_mark_node
;
7724 if (BASELINK_P (rhs
))
7726 access_path
= BASELINK_ACCESS_BINFO (rhs
);
7727 rhs
= BASELINK_FUNCTIONS (rhs
);
7730 /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot
7731 deduce any type information. */
7732 if (TREE_CODE (rhs
) == NON_DEPENDENT_EXPR
)
7734 if (flags
& tf_error
)
7735 error ("not enough type information");
7736 return error_mark_node
;
7739 /* There only a few kinds of expressions that may have a type
7740 dependent on overload resolution. */
7741 gcc_assert (TREE_CODE (rhs
) == ADDR_EXPR
7742 || TREE_CODE (rhs
) == COMPONENT_REF
7743 || is_overloaded_fn (rhs
)
7744 || (flag_ms_extensions
&& TREE_CODE (rhs
) == FUNCTION_DECL
));
7746 /* This should really only be used when attempting to distinguish
7747 what sort of a pointer to function we have. For now, any
7748 arithmetic operation which is not supported on pointers
7749 is rejected as an error. */
7751 switch (TREE_CODE (rhs
))
7755 tree member
= TREE_OPERAND (rhs
, 1);
7757 member
= instantiate_type (lhstype
, member
, flags
);
7758 if (member
!= error_mark_node
7759 && TREE_SIDE_EFFECTS (TREE_OPERAND (rhs
, 0)))
7760 /* Do not lose object's side effects. */
7761 return build2 (COMPOUND_EXPR
, TREE_TYPE (member
),
7762 TREE_OPERAND (rhs
, 0), member
);
7767 rhs
= TREE_OPERAND (rhs
, 1);
7768 if (BASELINK_P (rhs
))
7769 return instantiate_type (lhstype
, rhs
, flags_in
);
7771 /* This can happen if we are forming a pointer-to-member for a
7773 gcc_assert (TREE_CODE (rhs
) == TEMPLATE_ID_EXPR
);
7777 case TEMPLATE_ID_EXPR
:
7779 tree fns
= TREE_OPERAND (rhs
, 0);
7780 tree args
= TREE_OPERAND (rhs
, 1);
7783 resolve_address_of_overloaded_function (lhstype
, fns
, flags_in
,
7784 /*template_only=*/true,
7791 resolve_address_of_overloaded_function (lhstype
, rhs
, flags_in
,
7792 /*template_only=*/false,
7793 /*explicit_targs=*/NULL_TREE
,
7798 if (PTRMEM_OK_P (rhs
))
7799 flags
|= tf_ptrmem_ok
;
7801 return instantiate_type (lhstype
, TREE_OPERAND (rhs
, 0), flags
);
7805 return error_mark_node
;
7810 return error_mark_node
;
7813 /* Return the name of the virtual function pointer field
7814 (as an IDENTIFIER_NODE) for the given TYPE. Note that
7815 this may have to look back through base types to find the
7816 ultimate field name. (For single inheritance, these could
7817 all be the same name. Who knows for multiple inheritance). */
7820 get_vfield_name (tree type
)
7822 tree binfo
, base_binfo
;
7825 for (binfo
= TYPE_BINFO (type
);
7826 BINFO_N_BASE_BINFOS (binfo
);
7829 base_binfo
= BINFO_BASE_BINFO (binfo
, 0);
7831 if (BINFO_VIRTUAL_P (base_binfo
)
7832 || !TYPE_CONTAINS_VPTR_P (BINFO_TYPE (base_binfo
)))
7836 type
= BINFO_TYPE (binfo
);
7837 buf
= (char *) alloca (sizeof (VFIELD_NAME_FORMAT
)
7838 + TYPE_NAME_LENGTH (type
) + 2);
7839 sprintf (buf
, VFIELD_NAME_FORMAT
,
7840 IDENTIFIER_POINTER (constructor_name (type
)));
7841 return get_identifier (buf
);
7845 print_class_statistics (void)
7847 if (! GATHER_STATISTICS
)
7850 fprintf (stderr
, "convert_harshness = %d\n", n_convert_harshness
);
7851 fprintf (stderr
, "compute_conversion_costs = %d\n", n_compute_conversion_costs
);
7854 fprintf (stderr
, "vtables = %d; vtable searches = %d\n",
7855 n_vtables
, n_vtable_searches
);
7856 fprintf (stderr
, "vtable entries = %d; vtable elems = %d\n",
7857 n_vtable_entries
, n_vtable_elems
);
7861 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
7862 according to [class]:
7863 The class-name is also inserted
7864 into the scope of the class itself. For purposes of access checking,
7865 the inserted class name is treated as if it were a public member name. */
7868 build_self_reference (void)
7870 tree name
= constructor_name (current_class_type
);
7871 tree value
= build_lang_decl (TYPE_DECL
, name
, current_class_type
);
7874 DECL_NONLOCAL (value
) = 1;
7875 DECL_CONTEXT (value
) = current_class_type
;
7876 DECL_ARTIFICIAL (value
) = 1;
7877 SET_DECL_SELF_REFERENCE_P (value
);
7878 set_underlying_type (value
);
7880 if (processing_template_decl
)
7881 value
= push_template_decl (value
);
7883 saved_cas
= current_access_specifier
;
7884 current_access_specifier
= access_public_node
;
7885 finish_member_declaration (value
);
7886 current_access_specifier
= saved_cas
;
7889 /* Returns 1 if TYPE contains only padding bytes. */
7892 is_empty_class (tree type
)
7894 if (type
== error_mark_node
)
7897 if (! CLASS_TYPE_P (type
))
7900 return CLASSTYPE_EMPTY_P (type
);
7903 /* Returns true if TYPE contains no actual data, just various
7904 possible combinations of empty classes and possibly a vptr. */
7907 is_really_empty_class (tree type
)
7909 if (CLASS_TYPE_P (type
))
7916 /* CLASSTYPE_EMPTY_P isn't set properly until the class is actually laid
7917 out, but we'd like to be able to check this before then. */
7918 if (COMPLETE_TYPE_P (type
) && is_empty_class (type
))
7921 for (binfo
= TYPE_BINFO (type
), i
= 0;
7922 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
7923 if (!is_really_empty_class (BINFO_TYPE (base_binfo
)))
7925 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
7926 if (TREE_CODE (field
) == FIELD_DECL
7927 && !DECL_ARTIFICIAL (field
)
7928 && !is_really_empty_class (TREE_TYPE (field
)))
7932 else if (TREE_CODE (type
) == ARRAY_TYPE
)
7933 return is_really_empty_class (TREE_TYPE (type
));
7937 /* Note that NAME was looked up while the current class was being
7938 defined and that the result of that lookup was DECL. */
7941 maybe_note_name_used_in_class (tree name
, tree decl
)
7943 splay_tree names_used
;
7945 /* If we're not defining a class, there's nothing to do. */
7946 if (!(innermost_scope_kind() == sk_class
7947 && TYPE_BEING_DEFINED (current_class_type
)
7948 && !LAMBDA_TYPE_P (current_class_type
)))
7951 /* If there's already a binding for this NAME, then we don't have
7952 anything to worry about. */
7953 if (lookup_member (current_class_type
, name
,
7954 /*protect=*/0, /*want_type=*/false, tf_warning_or_error
))
7957 if (!current_class_stack
[current_class_depth
- 1].names_used
)
7958 current_class_stack
[current_class_depth
- 1].names_used
7959 = splay_tree_new (splay_tree_compare_pointers
, 0, 0);
7960 names_used
= current_class_stack
[current_class_depth
- 1].names_used
;
7962 splay_tree_insert (names_used
,
7963 (splay_tree_key
) name
,
7964 (splay_tree_value
) decl
);
7967 /* Note that NAME was declared (as DECL) in the current class. Check
7968 to see that the declaration is valid. */
7971 note_name_declared_in_class (tree name
, tree decl
)
7973 splay_tree names_used
;
7976 /* Look to see if we ever used this name. */
7978 = current_class_stack
[current_class_depth
- 1].names_used
;
7981 /* The C language allows members to be declared with a type of the same
7982 name, and the C++ standard says this diagnostic is not required. So
7983 allow it in extern "C" blocks unless predantic is specified.
7984 Allow it in all cases if -ms-extensions is specified. */
7985 if ((!pedantic
&& current_lang_name
== lang_name_c
)
7986 || flag_ms_extensions
)
7988 n
= splay_tree_lookup (names_used
, (splay_tree_key
) name
);
7991 /* [basic.scope.class]
7993 A name N used in a class S shall refer to the same declaration
7994 in its context and when re-evaluated in the completed scope of
7996 permerror (input_location
, "declaration of %q#D", decl
);
7997 permerror (input_location
, "changes meaning of %qD from %q+#D",
7998 DECL_NAME (OVL_CURRENT (decl
)), (tree
) n
->value
);
8002 /* Returns the VAR_DECL for the complete vtable associated with BINFO.
8003 Secondary vtables are merged with primary vtables; this function
8004 will return the VAR_DECL for the primary vtable. */
8007 get_vtbl_decl_for_binfo (tree binfo
)
8011 decl
= BINFO_VTABLE (binfo
);
8012 if (decl
&& TREE_CODE (decl
) == POINTER_PLUS_EXPR
)
8014 gcc_assert (TREE_CODE (TREE_OPERAND (decl
, 0)) == ADDR_EXPR
);
8015 decl
= TREE_OPERAND (TREE_OPERAND (decl
, 0), 0);
8018 gcc_assert (VAR_P (decl
));
8023 /* Returns the binfo for the primary base of BINFO. If the resulting
8024 BINFO is a virtual base, and it is inherited elsewhere in the
8025 hierarchy, then the returned binfo might not be the primary base of
8026 BINFO in the complete object. Check BINFO_PRIMARY_P or
8027 BINFO_LOST_PRIMARY_P to be sure. */
8030 get_primary_binfo (tree binfo
)
8034 primary_base
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (binfo
));
8038 return copied_binfo (primary_base
, binfo
);
8041 /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */
8044 maybe_indent_hierarchy (FILE * stream
, int indent
, int indented_p
)
8047 fprintf (stream
, "%*s", indent
, "");
8051 /* Dump the offsets of all the bases rooted at BINFO to STREAM.
8052 INDENT should be zero when called from the top level; it is
8053 incremented recursively. IGO indicates the next expected BINFO in
8054 inheritance graph ordering. */
8057 dump_class_hierarchy_r (FILE *stream
,
8067 indented
= maybe_indent_hierarchy (stream
, indent
, 0);
8068 fprintf (stream
, "%s (0x" HOST_WIDE_INT_PRINT_HEX
") ",
8069 type_as_string (BINFO_TYPE (binfo
), TFF_PLAIN_IDENTIFIER
),
8070 (HOST_WIDE_INT
) (uintptr_t) binfo
);
8073 fprintf (stream
, "alternative-path\n");
8076 igo
= TREE_CHAIN (binfo
);
8078 fprintf (stream
, HOST_WIDE_INT_PRINT_DEC
,
8079 tree_to_shwi (BINFO_OFFSET (binfo
)));
8080 if (is_empty_class (BINFO_TYPE (binfo
)))
8081 fprintf (stream
, " empty");
8082 else if (CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (binfo
)))
8083 fprintf (stream
, " nearly-empty");
8084 if (BINFO_VIRTUAL_P (binfo
))
8085 fprintf (stream
, " virtual");
8086 fprintf (stream
, "\n");
8089 if (BINFO_PRIMARY_P (binfo
))
8091 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8092 fprintf (stream
, " primary-for %s (0x" HOST_WIDE_INT_PRINT_HEX
")",
8093 type_as_string (BINFO_TYPE (BINFO_INHERITANCE_CHAIN (binfo
)),
8094 TFF_PLAIN_IDENTIFIER
),
8095 (HOST_WIDE_INT
) (uintptr_t) BINFO_INHERITANCE_CHAIN (binfo
));
8097 if (BINFO_LOST_PRIMARY_P (binfo
))
8099 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8100 fprintf (stream
, " lost-primary");
8103 fprintf (stream
, "\n");
8105 if (!(flags
& TDF_SLIM
))
8109 if (BINFO_SUBVTT_INDEX (binfo
))
8111 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8112 fprintf (stream
, " subvttidx=%s",
8113 expr_as_string (BINFO_SUBVTT_INDEX (binfo
),
8114 TFF_PLAIN_IDENTIFIER
));
8116 if (BINFO_VPTR_INDEX (binfo
))
8118 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8119 fprintf (stream
, " vptridx=%s",
8120 expr_as_string (BINFO_VPTR_INDEX (binfo
),
8121 TFF_PLAIN_IDENTIFIER
));
8123 if (BINFO_VPTR_FIELD (binfo
))
8125 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8126 fprintf (stream
, " vbaseoffset=%s",
8127 expr_as_string (BINFO_VPTR_FIELD (binfo
),
8128 TFF_PLAIN_IDENTIFIER
));
8130 if (BINFO_VTABLE (binfo
))
8132 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8133 fprintf (stream
, " vptr=%s",
8134 expr_as_string (BINFO_VTABLE (binfo
),
8135 TFF_PLAIN_IDENTIFIER
));
8139 fprintf (stream
, "\n");
8142 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
8143 igo
= dump_class_hierarchy_r (stream
, flags
, base_binfo
, igo
, indent
+ 2);
8148 /* Dump the BINFO hierarchy for T. */
8151 dump_class_hierarchy_1 (FILE *stream
, int flags
, tree t
)
8153 fprintf (stream
, "Class %s\n", type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8154 fprintf (stream
, " size=%lu align=%lu\n",
8155 (unsigned long)(tree_to_shwi (TYPE_SIZE (t
)) / BITS_PER_UNIT
),
8156 (unsigned long)(TYPE_ALIGN (t
) / BITS_PER_UNIT
));
8157 fprintf (stream
, " base size=%lu base align=%lu\n",
8158 (unsigned long)(tree_to_shwi (TYPE_SIZE (CLASSTYPE_AS_BASE (t
)))
8160 (unsigned long)(TYPE_ALIGN (CLASSTYPE_AS_BASE (t
))
8162 dump_class_hierarchy_r (stream
, flags
, TYPE_BINFO (t
), TYPE_BINFO (t
), 0);
8163 fprintf (stream
, "\n");
8166 /* Debug interface to hierarchy dumping. */
8169 debug_class (tree t
)
8171 dump_class_hierarchy_1 (stderr
, TDF_SLIM
, t
);
8175 dump_class_hierarchy (tree t
)
8178 FILE *stream
= get_dump_info (TDI_class
, &flags
);
8182 dump_class_hierarchy_1 (stream
, flags
, t
);
8187 dump_array (FILE * stream
, tree decl
)
8190 unsigned HOST_WIDE_INT ix
;
8192 tree size
= TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (decl
)));
8194 elt
= (tree_to_shwi (TYPE_SIZE (TREE_TYPE (TREE_TYPE (decl
))))
8196 fprintf (stream
, "%s:", decl_as_string (decl
, TFF_PLAIN_IDENTIFIER
));
8197 fprintf (stream
, " %s entries",
8198 expr_as_string (size_binop (PLUS_EXPR
, size
, size_one_node
),
8199 TFF_PLAIN_IDENTIFIER
));
8200 fprintf (stream
, "\n");
8202 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (DECL_INITIAL (decl
)),
8204 fprintf (stream
, "%-4ld %s\n", (long)(ix
* elt
),
8205 expr_as_string (value
, TFF_PLAIN_IDENTIFIER
));
8209 dump_vtable (tree t
, tree binfo
, tree vtable
)
8212 FILE *stream
= get_dump_info (TDI_class
, &flags
);
8217 if (!(flags
& TDF_SLIM
))
8219 int ctor_vtbl_p
= TYPE_BINFO (t
) != binfo
;
8221 fprintf (stream
, "%s for %s",
8222 ctor_vtbl_p
? "Construction vtable" : "Vtable",
8223 type_as_string (BINFO_TYPE (binfo
), TFF_PLAIN_IDENTIFIER
));
8226 if (!BINFO_VIRTUAL_P (binfo
))
8227 fprintf (stream
, " (0x" HOST_WIDE_INT_PRINT_HEX
" instance)",
8228 (HOST_WIDE_INT
) (uintptr_t) binfo
);
8229 fprintf (stream
, " in %s", type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8231 fprintf (stream
, "\n");
8232 dump_array (stream
, vtable
);
8233 fprintf (stream
, "\n");
8238 dump_vtt (tree t
, tree vtt
)
8241 FILE *stream
= get_dump_info (TDI_class
, &flags
);
8246 if (!(flags
& TDF_SLIM
))
8248 fprintf (stream
, "VTT for %s\n",
8249 type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8250 dump_array (stream
, vtt
);
8251 fprintf (stream
, "\n");
8255 /* Dump a function or thunk and its thunkees. */
8258 dump_thunk (FILE *stream
, int indent
, tree thunk
)
8260 static const char spaces
[] = " ";
8261 tree name
= DECL_NAME (thunk
);
8264 fprintf (stream
, "%.*s%p %s %s", indent
, spaces
,
8266 !DECL_THUNK_P (thunk
) ? "function"
8267 : DECL_THIS_THUNK_P (thunk
) ? "this-thunk" : "covariant-thunk",
8268 name
? IDENTIFIER_POINTER (name
) : "<unset>");
8269 if (DECL_THUNK_P (thunk
))
8271 HOST_WIDE_INT fixed_adjust
= THUNK_FIXED_OFFSET (thunk
);
8272 tree virtual_adjust
= THUNK_VIRTUAL_OFFSET (thunk
);
8274 fprintf (stream
, " fixed=" HOST_WIDE_INT_PRINT_DEC
, fixed_adjust
);
8275 if (!virtual_adjust
)
8277 else if (DECL_THIS_THUNK_P (thunk
))
8278 fprintf (stream
, " vcall=" HOST_WIDE_INT_PRINT_DEC
,
8279 tree_to_shwi (virtual_adjust
));
8281 fprintf (stream
, " vbase=" HOST_WIDE_INT_PRINT_DEC
"(%s)",
8282 tree_to_shwi (BINFO_VPTR_FIELD (virtual_adjust
)),
8283 type_as_string (BINFO_TYPE (virtual_adjust
), TFF_SCOPE
));
8284 if (THUNK_ALIAS (thunk
))
8285 fprintf (stream
, " alias to %p", (void *)THUNK_ALIAS (thunk
));
8287 fprintf (stream
, "\n");
8288 for (thunks
= DECL_THUNKS (thunk
); thunks
; thunks
= TREE_CHAIN (thunks
))
8289 dump_thunk (stream
, indent
+ 2, thunks
);
8292 /* Dump the thunks for FN. */
8295 debug_thunks (tree fn
)
8297 dump_thunk (stderr
, 0, fn
);
8300 /* Virtual function table initialization. */
8302 /* Create all the necessary vtables for T and its base classes. */
8305 finish_vtbls (tree t
)
8308 vec
<constructor_elt
, va_gc
> *v
= NULL
;
8309 tree vtable
= BINFO_VTABLE (TYPE_BINFO (t
));
8311 /* We lay out the primary and secondary vtables in one contiguous
8312 vtable. The primary vtable is first, followed by the non-virtual
8313 secondary vtables in inheritance graph order. */
8314 accumulate_vtbl_inits (TYPE_BINFO (t
), TYPE_BINFO (t
), TYPE_BINFO (t
),
8317 /* Then come the virtual bases, also in inheritance graph order. */
8318 for (vbase
= TYPE_BINFO (t
); vbase
; vbase
= TREE_CHAIN (vbase
))
8320 if (!BINFO_VIRTUAL_P (vbase
))
8322 accumulate_vtbl_inits (vbase
, vbase
, TYPE_BINFO (t
), vtable
, t
, &v
);
8325 if (BINFO_VTABLE (TYPE_BINFO (t
)))
8326 initialize_vtable (TYPE_BINFO (t
), v
);
8329 /* Initialize the vtable for BINFO with the INITS. */
8332 initialize_vtable (tree binfo
, vec
<constructor_elt
, va_gc
> *inits
)
8336 layout_vtable_decl (binfo
, vec_safe_length (inits
));
8337 decl
= get_vtbl_decl_for_binfo (binfo
);
8338 initialize_artificial_var (decl
, inits
);
8339 dump_vtable (BINFO_TYPE (binfo
), binfo
, decl
);
8342 /* Build the VTT (virtual table table) for T.
8343 A class requires a VTT if it has virtual bases.
8346 1 - primary virtual pointer for complete object T
8347 2 - secondary VTTs for each direct non-virtual base of T which requires a
8349 3 - secondary virtual pointers for each direct or indirect base of T which
8350 has virtual bases or is reachable via a virtual path from T.
8351 4 - secondary VTTs for each direct or indirect virtual base of T.
8353 Secondary VTTs look like complete object VTTs without part 4. */
8361 vec
<constructor_elt
, va_gc
> *inits
;
8363 /* Build up the initializers for the VTT. */
8365 index
= size_zero_node
;
8366 build_vtt_inits (TYPE_BINFO (t
), t
, &inits
, &index
);
8368 /* If we didn't need a VTT, we're done. */
8372 /* Figure out the type of the VTT. */
8373 type
= build_array_of_n_type (const_ptr_type_node
,
8376 /* Now, build the VTT object itself. */
8377 vtt
= build_vtable (t
, mangle_vtt_for_type (t
), type
);
8378 initialize_artificial_var (vtt
, inits
);
8379 /* Add the VTT to the vtables list. */
8380 DECL_CHAIN (vtt
) = DECL_CHAIN (CLASSTYPE_VTABLES (t
));
8381 DECL_CHAIN (CLASSTYPE_VTABLES (t
)) = vtt
;
8386 /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with
8387 PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo,
8388 and CHAIN the vtable pointer for this binfo after construction is
8389 complete. VALUE can also be another BINFO, in which case we recurse. */
8392 binfo_ctor_vtable (tree binfo
)
8398 vt
= BINFO_VTABLE (binfo
);
8399 if (TREE_CODE (vt
) == TREE_LIST
)
8400 vt
= TREE_VALUE (vt
);
8401 if (TREE_CODE (vt
) == TREE_BINFO
)
8410 /* Data for secondary VTT initialization. */
8411 typedef struct secondary_vptr_vtt_init_data_s
8413 /* Is this the primary VTT? */
8416 /* Current index into the VTT. */
8419 /* Vector of initializers built up. */
8420 vec
<constructor_elt
, va_gc
> *inits
;
8422 /* The type being constructed by this secondary VTT. */
8423 tree type_being_constructed
;
8424 } secondary_vptr_vtt_init_data
;
8426 /* Recursively build the VTT-initializer for BINFO (which is in the
8427 hierarchy dominated by T). INITS points to the end of the initializer
8428 list to date. INDEX is the VTT index where the next element will be
8429 replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e.
8430 not a subvtt for some base of T). When that is so, we emit the sub-VTTs
8431 for virtual bases of T. When it is not so, we build the constructor
8432 vtables for the BINFO-in-T variant. */
8435 build_vtt_inits (tree binfo
, tree t
, vec
<constructor_elt
, va_gc
> **inits
,
8441 secondary_vptr_vtt_init_data data
;
8442 int top_level_p
= SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
);
8444 /* We only need VTTs for subobjects with virtual bases. */
8445 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
)))
8448 /* We need to use a construction vtable if this is not the primary
8452 build_ctor_vtbl_group (binfo
, t
);
8454 /* Record the offset in the VTT where this sub-VTT can be found. */
8455 BINFO_SUBVTT_INDEX (binfo
) = *index
;
8458 /* Add the address of the primary vtable for the complete object. */
8459 init
= binfo_ctor_vtable (binfo
);
8460 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
8463 gcc_assert (!BINFO_VPTR_INDEX (binfo
));
8464 BINFO_VPTR_INDEX (binfo
) = *index
;
8466 *index
= size_binop (PLUS_EXPR
, *index
, TYPE_SIZE_UNIT (ptr_type_node
));
8468 /* Recursively add the secondary VTTs for non-virtual bases. */
8469 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, b
); ++i
)
8470 if (!BINFO_VIRTUAL_P (b
))
8471 build_vtt_inits (b
, t
, inits
, index
);
8473 /* Add secondary virtual pointers for all subobjects of BINFO with
8474 either virtual bases or reachable along a virtual path, except
8475 subobjects that are non-virtual primary bases. */
8476 data
.top_level_p
= top_level_p
;
8477 data
.index
= *index
;
8478 data
.inits
= *inits
;
8479 data
.type_being_constructed
= BINFO_TYPE (binfo
);
8481 dfs_walk_once (binfo
, dfs_build_secondary_vptr_vtt_inits
, NULL
, &data
);
8483 *index
= data
.index
;
8485 /* data.inits might have grown as we added secondary virtual pointers.
8486 Make sure our caller knows about the new vector. */
8487 *inits
= data
.inits
;
8490 /* Add the secondary VTTs for virtual bases in inheritance graph
8492 for (b
= TYPE_BINFO (BINFO_TYPE (binfo
)); b
; b
= TREE_CHAIN (b
))
8494 if (!BINFO_VIRTUAL_P (b
))
8497 build_vtt_inits (b
, t
, inits
, index
);
8500 /* Remove the ctor vtables we created. */
8501 dfs_walk_all (binfo
, dfs_fixup_binfo_vtbls
, NULL
, binfo
);
8504 /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base
8505 in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */
8508 dfs_build_secondary_vptr_vtt_inits (tree binfo
, void *data_
)
8510 secondary_vptr_vtt_init_data
*data
= (secondary_vptr_vtt_init_data
*)data_
;
8512 /* We don't care about bases that don't have vtables. */
8513 if (!TYPE_VFIELD (BINFO_TYPE (binfo
)))
8514 return dfs_skip_bases
;
8516 /* We're only interested in proper subobjects of the type being
8518 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), data
->type_being_constructed
))
8521 /* We're only interested in bases with virtual bases or reachable
8522 via a virtual path from the type being constructed. */
8523 if (!(CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
))
8524 || binfo_via_virtual (binfo
, data
->type_being_constructed
)))
8525 return dfs_skip_bases
;
8527 /* We're not interested in non-virtual primary bases. */
8528 if (!BINFO_VIRTUAL_P (binfo
) && BINFO_PRIMARY_P (binfo
))
8531 /* Record the index where this secondary vptr can be found. */
8532 if (data
->top_level_p
)
8534 gcc_assert (!BINFO_VPTR_INDEX (binfo
));
8535 BINFO_VPTR_INDEX (binfo
) = data
->index
;
8537 if (BINFO_VIRTUAL_P (binfo
))
8539 /* It's a primary virtual base, and this is not a
8540 construction vtable. Find the base this is primary of in
8541 the inheritance graph, and use that base's vtable
8543 while (BINFO_PRIMARY_P (binfo
))
8544 binfo
= BINFO_INHERITANCE_CHAIN (binfo
);
8548 /* Add the initializer for the secondary vptr itself. */
8549 CONSTRUCTOR_APPEND_ELT (data
->inits
, NULL_TREE
, binfo_ctor_vtable (binfo
));
8551 /* Advance the vtt index. */
8552 data
->index
= size_binop (PLUS_EXPR
, data
->index
,
8553 TYPE_SIZE_UNIT (ptr_type_node
));
8558 /* Called from build_vtt_inits via dfs_walk. After building
8559 constructor vtables and generating the sub-vtt from them, we need
8560 to restore the BINFO_VTABLES that were scribbled on. DATA is the
8561 binfo of the base whose sub vtt was generated. */
8564 dfs_fixup_binfo_vtbls (tree binfo
, void* data
)
8566 tree vtable
= BINFO_VTABLE (binfo
);
8568 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
8569 /* If this class has no vtable, none of its bases do. */
8570 return dfs_skip_bases
;
8573 /* This might be a primary base, so have no vtable in this
8577 /* If we scribbled the construction vtable vptr into BINFO, clear it
8579 if (TREE_CODE (vtable
) == TREE_LIST
8580 && (TREE_PURPOSE (vtable
) == (tree
) data
))
8581 BINFO_VTABLE (binfo
) = TREE_CHAIN (vtable
);
8586 /* Build the construction vtable group for BINFO which is in the
8587 hierarchy dominated by T. */
8590 build_ctor_vtbl_group (tree binfo
, tree t
)
8596 vec
<constructor_elt
, va_gc
> *v
;
8598 /* See if we've already created this construction vtable group. */
8599 id
= mangle_ctor_vtbl_for_type (t
, binfo
);
8600 if (IDENTIFIER_GLOBAL_VALUE (id
))
8603 gcc_assert (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
));
8604 /* Build a version of VTBL (with the wrong type) for use in
8605 constructing the addresses of secondary vtables in the
8606 construction vtable group. */
8607 vtbl
= build_vtable (t
, id
, ptr_type_node
);
8608 DECL_CONSTRUCTION_VTABLE_P (vtbl
) = 1;
8609 /* Don't export construction vtables from shared libraries. Even on
8610 targets that don't support hidden visibility, this tells
8611 can_refer_decl_in_current_unit_p not to assume that it's safe to
8612 access from a different compilation unit (bz 54314). */
8613 DECL_VISIBILITY (vtbl
) = VISIBILITY_HIDDEN
;
8614 DECL_VISIBILITY_SPECIFIED (vtbl
) = true;
8617 accumulate_vtbl_inits (binfo
, TYPE_BINFO (TREE_TYPE (binfo
)),
8618 binfo
, vtbl
, t
, &v
);
8620 /* Add the vtables for each of our virtual bases using the vbase in T
8622 for (vbase
= TYPE_BINFO (BINFO_TYPE (binfo
));
8624 vbase
= TREE_CHAIN (vbase
))
8628 if (!BINFO_VIRTUAL_P (vbase
))
8630 b
= copied_binfo (vbase
, binfo
);
8632 accumulate_vtbl_inits (b
, vbase
, binfo
, vtbl
, t
, &v
);
8635 /* Figure out the type of the construction vtable. */
8636 type
= build_array_of_n_type (vtable_entry_type
, v
->length ());
8638 TREE_TYPE (vtbl
) = type
;
8639 DECL_SIZE (vtbl
) = DECL_SIZE_UNIT (vtbl
) = NULL_TREE
;
8640 layout_decl (vtbl
, 0);
8642 /* Initialize the construction vtable. */
8643 CLASSTYPE_VTABLES (t
) = chainon (CLASSTYPE_VTABLES (t
), vtbl
);
8644 initialize_artificial_var (vtbl
, v
);
8645 dump_vtable (t
, binfo
, vtbl
);
8648 /* Add the vtbl initializers for BINFO (and its bases other than
8649 non-virtual primaries) to the list of INITS. BINFO is in the
8650 hierarchy dominated by T. RTTI_BINFO is the binfo within T of
8651 the constructor the vtbl inits should be accumulated for. (If this
8652 is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).)
8653 ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO).
8654 BINFO is the active base equivalent of ORIG_BINFO in the inheritance
8655 graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE,
8656 but are not necessarily the same in terms of layout. */
8659 accumulate_vtbl_inits (tree binfo
,
8664 vec
<constructor_elt
, va_gc
> **inits
)
8668 int ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8670 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), BINFO_TYPE (orig_binfo
)));
8672 /* If it doesn't have a vptr, we don't do anything. */
8673 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
8676 /* If we're building a construction vtable, we're not interested in
8677 subobjects that don't require construction vtables. */
8679 && !CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
))
8680 && !binfo_via_virtual (orig_binfo
, BINFO_TYPE (rtti_binfo
)))
8683 /* Build the initializers for the BINFO-in-T vtable. */
8684 dfs_accumulate_vtbl_inits (binfo
, orig_binfo
, rtti_binfo
, vtbl
, t
, inits
);
8686 /* Walk the BINFO and its bases. We walk in preorder so that as we
8687 initialize each vtable we can figure out at what offset the
8688 secondary vtable lies from the primary vtable. We can't use
8689 dfs_walk here because we need to iterate through bases of BINFO
8690 and RTTI_BINFO simultaneously. */
8691 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
8693 /* Skip virtual bases. */
8694 if (BINFO_VIRTUAL_P (base_binfo
))
8696 accumulate_vtbl_inits (base_binfo
,
8697 BINFO_BASE_BINFO (orig_binfo
, i
),
8698 rtti_binfo
, vtbl
, t
,
8703 /* Called from accumulate_vtbl_inits. Adds the initializers for the
8704 BINFO vtable to L. */
8707 dfs_accumulate_vtbl_inits (tree binfo
,
8712 vec
<constructor_elt
, va_gc
> **l
)
8714 tree vtbl
= NULL_TREE
;
8715 int ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8719 && BINFO_VIRTUAL_P (orig_binfo
) && BINFO_PRIMARY_P (orig_binfo
))
8721 /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a
8722 primary virtual base. If it is not the same primary in
8723 the hierarchy of T, we'll need to generate a ctor vtable
8724 for it, to place at its location in T. If it is the same
8725 primary, we still need a VTT entry for the vtable, but it
8726 should point to the ctor vtable for the base it is a
8727 primary for within the sub-hierarchy of RTTI_BINFO.
8729 There are three possible cases:
8731 1) We are in the same place.
8732 2) We are a primary base within a lost primary virtual base of
8734 3) We are primary to something not a base of RTTI_BINFO. */
8737 tree last
= NULL_TREE
;
8739 /* First, look through the bases we are primary to for RTTI_BINFO
8740 or a virtual base. */
8742 while (BINFO_PRIMARY_P (b
))
8744 b
= BINFO_INHERITANCE_CHAIN (b
);
8746 if (BINFO_VIRTUAL_P (b
) || b
== rtti_binfo
)
8749 /* If we run out of primary links, keep looking down our
8750 inheritance chain; we might be an indirect primary. */
8751 for (b
= last
; b
; b
= BINFO_INHERITANCE_CHAIN (b
))
8752 if (BINFO_VIRTUAL_P (b
) || b
== rtti_binfo
)
8756 /* If we found RTTI_BINFO, this is case 1. If we found a virtual
8757 base B and it is a base of RTTI_BINFO, this is case 2. In
8758 either case, we share our vtable with LAST, i.e. the
8759 derived-most base within B of which we are a primary. */
8761 || (b
&& binfo_for_vbase (BINFO_TYPE (b
), BINFO_TYPE (rtti_binfo
))))
8762 /* Just set our BINFO_VTABLE to point to LAST, as we may not have
8763 set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in
8764 binfo_ctor_vtable after everything's been set up. */
8767 /* Otherwise, this is case 3 and we get our own. */
8769 else if (!BINFO_NEW_VTABLE_MARKED (orig_binfo
))
8772 n_inits
= vec_safe_length (*l
);
8779 /* Add the initializer for this vtable. */
8780 build_vtbl_initializer (binfo
, orig_binfo
, t
, rtti_binfo
,
8781 &non_fn_entries
, l
);
8783 /* Figure out the position to which the VPTR should point. */
8784 vtbl
= build1 (ADDR_EXPR
, vtbl_ptr_type_node
, orig_vtbl
);
8785 index
= size_binop (MULT_EXPR
,
8786 TYPE_SIZE_UNIT (vtable_entry_type
),
8787 size_int (non_fn_entries
+ n_inits
));
8788 vtbl
= fold_build_pointer_plus (vtbl
, index
);
8792 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
8793 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
8794 straighten this out. */
8795 BINFO_VTABLE (binfo
) = tree_cons (rtti_binfo
, vtbl
, BINFO_VTABLE (binfo
));
8796 else if (BINFO_PRIMARY_P (binfo
) && BINFO_VIRTUAL_P (binfo
))
8797 /* Throw away any unneeded intializers. */
8798 (*l
)->truncate (n_inits
);
8800 /* For an ordinary vtable, set BINFO_VTABLE. */
8801 BINFO_VTABLE (binfo
) = vtbl
;
8804 static GTY(()) tree abort_fndecl_addr
;
8806 /* Construct the initializer for BINFO's virtual function table. BINFO
8807 is part of the hierarchy dominated by T. If we're building a
8808 construction vtable, the ORIG_BINFO is the binfo we should use to
8809 find the actual function pointers to put in the vtable - but they
8810 can be overridden on the path to most-derived in the graph that
8811 ORIG_BINFO belongs. Otherwise,
8812 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
8813 BINFO that should be indicated by the RTTI information in the
8814 vtable; it will be a base class of T, rather than T itself, if we
8815 are building a construction vtable.
8817 The value returned is a TREE_LIST suitable for wrapping in a
8818 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
8819 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
8820 number of non-function entries in the vtable.
8822 It might seem that this function should never be called with a
8823 BINFO for which BINFO_PRIMARY_P holds, the vtable for such a
8824 base is always subsumed by a derived class vtable. However, when
8825 we are building construction vtables, we do build vtables for
8826 primary bases; we need these while the primary base is being
8830 build_vtbl_initializer (tree binfo
,
8834 int* non_fn_entries_p
,
8835 vec
<constructor_elt
, va_gc
> **inits
)
8841 vec
<tree
, va_gc
> *vbases
;
8844 /* Initialize VID. */
8845 memset (&vid
, 0, sizeof (vid
));
8848 vid
.rtti_binfo
= rtti_binfo
;
8849 vid
.primary_vtbl_p
= SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
);
8850 vid
.ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8851 vid
.generate_vcall_entries
= true;
8852 /* The first vbase or vcall offset is at index -3 in the vtable. */
8853 vid
.index
= ssize_int(-3 * TARGET_VTABLE_DATA_ENTRY_DISTANCE
);
8855 /* Add entries to the vtable for RTTI. */
8856 build_rtti_vtbl_entries (binfo
, &vid
);
8858 /* Create an array for keeping track of the functions we've
8859 processed. When we see multiple functions with the same
8860 signature, we share the vcall offsets. */
8861 vec_alloc (vid
.fns
, 32);
8862 /* Add the vcall and vbase offset entries. */
8863 build_vcall_and_vbase_vtbl_entries (binfo
, &vid
);
8865 /* Clear BINFO_VTABLE_PATH_MARKED; it's set by
8866 build_vbase_offset_vtbl_entries. */
8867 for (vbases
= CLASSTYPE_VBASECLASSES (t
), ix
= 0;
8868 vec_safe_iterate (vbases
, ix
, &vbinfo
); ix
++)
8869 BINFO_VTABLE_PATH_MARKED (vbinfo
) = 0;
8871 /* If the target requires padding between data entries, add that now. */
8872 if (TARGET_VTABLE_DATA_ENTRY_DISTANCE
> 1)
8874 int n_entries
= vec_safe_length (vid
.inits
);
8876 vec_safe_grow (vid
.inits
, TARGET_VTABLE_DATA_ENTRY_DISTANCE
* n_entries
);
8878 /* Move data entries into their new positions and add padding
8879 after the new positions. Iterate backwards so we don't
8880 overwrite entries that we would need to process later. */
8881 for (ix
= n_entries
- 1;
8882 vid
.inits
->iterate (ix
, &e
);
8886 int new_position
= (TARGET_VTABLE_DATA_ENTRY_DISTANCE
* ix
8887 + (TARGET_VTABLE_DATA_ENTRY_DISTANCE
- 1));
8889 (*vid
.inits
)[new_position
] = *e
;
8891 for (j
= 1; j
< TARGET_VTABLE_DATA_ENTRY_DISTANCE
; ++j
)
8893 constructor_elt
*f
= &(*vid
.inits
)[new_position
- j
];
8894 f
->index
= NULL_TREE
;
8895 f
->value
= build1 (NOP_EXPR
, vtable_entry_type
,
8901 if (non_fn_entries_p
)
8902 *non_fn_entries_p
= vec_safe_length (vid
.inits
);
8904 /* The initializers for virtual functions were built up in reverse
8905 order. Straighten them out and add them to the running list in one
8907 jx
= vec_safe_length (*inits
);
8908 vec_safe_grow (*inits
, jx
+ vid
.inits
->length ());
8910 for (ix
= vid
.inits
->length () - 1;
8911 vid
.inits
->iterate (ix
, &e
);
8915 /* Go through all the ordinary virtual functions, building up
8917 for (v
= BINFO_VIRTUALS (orig_binfo
); v
; v
= TREE_CHAIN (v
))
8921 tree fn
, fn_original
;
8922 tree init
= NULL_TREE
;
8926 if (DECL_THUNK_P (fn
))
8928 if (!DECL_NAME (fn
))
8930 if (THUNK_ALIAS (fn
))
8932 fn
= THUNK_ALIAS (fn
);
8935 fn_original
= THUNK_TARGET (fn
);
8938 /* If the only definition of this function signature along our
8939 primary base chain is from a lost primary, this vtable slot will
8940 never be used, so just zero it out. This is important to avoid
8941 requiring extra thunks which cannot be generated with the function.
8943 We first check this in update_vtable_entry_for_fn, so we handle
8944 restored primary bases properly; we also need to do it here so we
8945 zero out unused slots in ctor vtables, rather than filling them
8946 with erroneous values (though harmless, apart from relocation
8948 if (BV_LOST_PRIMARY (v
))
8949 init
= size_zero_node
;
8953 /* Pull the offset for `this', and the function to call, out of
8955 delta
= BV_DELTA (v
);
8956 vcall_index
= BV_VCALL_INDEX (v
);
8958 gcc_assert (TREE_CODE (delta
) == INTEGER_CST
);
8959 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
8961 /* You can't call an abstract virtual function; it's abstract.
8962 So, we replace these functions with __pure_virtual. */
8963 if (DECL_PURE_VIRTUAL_P (fn_original
))
8966 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
8968 if (abort_fndecl_addr
== NULL
)
8970 = fold_convert (vfunc_ptr_type_node
,
8971 build_fold_addr_expr (fn
));
8972 init
= abort_fndecl_addr
;
8975 /* Likewise for deleted virtuals. */
8976 else if (DECL_DELETED_FN (fn_original
))
8978 fn
= get_identifier ("__cxa_deleted_virtual");
8979 if (!get_global_value_if_present (fn
, &fn
))
8980 fn
= push_library_fn (fn
, (build_function_type_list
8981 (void_type_node
, NULL_TREE
)),
8982 NULL_TREE
, ECF_NORETURN
);
8983 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
8984 init
= fold_convert (vfunc_ptr_type_node
,
8985 build_fold_addr_expr (fn
));
8989 if (!integer_zerop (delta
) || vcall_index
)
8991 fn
= make_thunk (fn
, /*this_adjusting=*/1, delta
, vcall_index
);
8992 if (!DECL_NAME (fn
))
8995 /* Take the address of the function, considering it to be of an
8996 appropriate generic type. */
8997 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
8998 init
= fold_convert (vfunc_ptr_type_node
,
8999 build_fold_addr_expr (fn
));
9000 /* Don't refer to a virtual destructor from a constructor
9001 vtable or a vtable for an abstract class, since destroying
9002 an object under construction is undefined behavior and we
9003 don't want it to be considered a candidate for speculative
9004 devirtualization. But do create the thunk for ABI
9006 if (DECL_DESTRUCTOR_P (fn_original
)
9007 && (CLASSTYPE_PURE_VIRTUALS (DECL_CONTEXT (fn_original
))
9008 || orig_binfo
!= binfo
))
9009 init
= size_zero_node
;
9013 /* And add it to the chain of initializers. */
9014 if (TARGET_VTABLE_USES_DESCRIPTORS
)
9017 if (init
== size_zero_node
)
9018 for (i
= 0; i
< TARGET_VTABLE_USES_DESCRIPTORS
; ++i
)
9019 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
9021 for (i
= 0; i
< TARGET_VTABLE_USES_DESCRIPTORS
; ++i
)
9023 tree fdesc
= build2 (FDESC_EXPR
, vfunc_ptr_type_node
,
9024 fn
, build_int_cst (NULL_TREE
, i
));
9025 TREE_CONSTANT (fdesc
) = 1;
9027 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, fdesc
);
9031 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
9035 /* Adds to vid->inits the initializers for the vbase and vcall
9036 offsets in BINFO, which is in the hierarchy dominated by T. */
9039 build_vcall_and_vbase_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9043 /* If this is a derived class, we must first create entries
9044 corresponding to the primary base class. */
9045 b
= get_primary_binfo (binfo
);
9047 build_vcall_and_vbase_vtbl_entries (b
, vid
);
9049 /* Add the vbase entries for this base. */
9050 build_vbase_offset_vtbl_entries (binfo
, vid
);
9051 /* Add the vcall entries for this base. */
9052 build_vcall_offset_vtbl_entries (binfo
, vid
);
9055 /* Returns the initializers for the vbase offset entries in the vtable
9056 for BINFO (which is part of the class hierarchy dominated by T), in
9057 reverse order. VBASE_OFFSET_INDEX gives the vtable index
9058 where the next vbase offset will go. */
9061 build_vbase_offset_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9065 tree non_primary_binfo
;
9067 /* If there are no virtual baseclasses, then there is nothing to
9069 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
)))
9074 /* We might be a primary base class. Go up the inheritance hierarchy
9075 until we find the most derived class of which we are a primary base:
9076 it is the offset of that which we need to use. */
9077 non_primary_binfo
= binfo
;
9078 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo
))
9082 /* If we have reached a virtual base, then it must be a primary
9083 base (possibly multi-level) of vid->binfo, or we wouldn't
9084 have called build_vcall_and_vbase_vtbl_entries for it. But it
9085 might be a lost primary, so just skip down to vid->binfo. */
9086 if (BINFO_VIRTUAL_P (non_primary_binfo
))
9088 non_primary_binfo
= vid
->binfo
;
9092 b
= BINFO_INHERITANCE_CHAIN (non_primary_binfo
);
9093 if (get_primary_binfo (b
) != non_primary_binfo
)
9095 non_primary_binfo
= b
;
9098 /* Go through the virtual bases, adding the offsets. */
9099 for (vbase
= TYPE_BINFO (BINFO_TYPE (binfo
));
9101 vbase
= TREE_CHAIN (vbase
))
9106 if (!BINFO_VIRTUAL_P (vbase
))
9109 /* Find the instance of this virtual base in the complete
9111 b
= copied_binfo (vbase
, binfo
);
9113 /* If we've already got an offset for this virtual base, we
9114 don't need another one. */
9115 if (BINFO_VTABLE_PATH_MARKED (b
))
9117 BINFO_VTABLE_PATH_MARKED (b
) = 1;
9119 /* Figure out where we can find this vbase offset. */
9120 delta
= size_binop (MULT_EXPR
,
9123 TYPE_SIZE_UNIT (vtable_entry_type
)));
9124 if (vid
->primary_vtbl_p
)
9125 BINFO_VPTR_FIELD (b
) = delta
;
9127 if (binfo
!= TYPE_BINFO (t
))
9128 /* The vbase offset had better be the same. */
9129 gcc_assert (tree_int_cst_equal (delta
, BINFO_VPTR_FIELD (vbase
)));
9131 /* The next vbase will come at a more negative offset. */
9132 vid
->index
= size_binop (MINUS_EXPR
, vid
->index
,
9133 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE
));
9135 /* The initializer is the delta from BINFO to this virtual base.
9136 The vbase offsets go in reverse inheritance-graph order, and
9137 we are walking in inheritance graph order so these end up in
9139 delta
= size_diffop_loc (input_location
,
9140 BINFO_OFFSET (b
), BINFO_OFFSET (non_primary_binfo
));
9142 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
,
9143 fold_build1_loc (input_location
, NOP_EXPR
,
9144 vtable_entry_type
, delta
));
9148 /* Adds the initializers for the vcall offset entries in the vtable
9149 for BINFO (which is part of the class hierarchy dominated by VID->DERIVED)
9153 build_vcall_offset_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9155 /* We only need these entries if this base is a virtual base. We
9156 compute the indices -- but do not add to the vtable -- when
9157 building the main vtable for a class. */
9158 if (binfo
== TYPE_BINFO (vid
->derived
)
9159 || (BINFO_VIRTUAL_P (binfo
)
9160 /* If BINFO is RTTI_BINFO, then (since BINFO does not
9161 correspond to VID->DERIVED), we are building a primary
9162 construction virtual table. Since this is a primary
9163 virtual table, we do not need the vcall offsets for
9165 && binfo
!= vid
->rtti_binfo
))
9167 /* We need a vcall offset for each of the virtual functions in this
9168 vtable. For example:
9170 class A { virtual void f (); };
9171 class B1 : virtual public A { virtual void f (); };
9172 class B2 : virtual public A { virtual void f (); };
9173 class C: public B1, public B2 { virtual void f (); };
9175 A C object has a primary base of B1, which has a primary base of A. A
9176 C also has a secondary base of B2, which no longer has a primary base
9177 of A. So the B2-in-C construction vtable needs a secondary vtable for
9178 A, which will adjust the A* to a B2* to call f. We have no way of
9179 knowing what (or even whether) this offset will be when we define B2,
9180 so we store this "vcall offset" in the A sub-vtable and look it up in
9181 a "virtual thunk" for B2::f.
9183 We need entries for all the functions in our primary vtable and
9184 in our non-virtual bases' secondary vtables. */
9186 /* If we are just computing the vcall indices -- but do not need
9187 the actual entries -- not that. */
9188 if (!BINFO_VIRTUAL_P (binfo
))
9189 vid
->generate_vcall_entries
= false;
9190 /* Now, walk through the non-virtual bases, adding vcall offsets. */
9191 add_vcall_offset_vtbl_entries_r (binfo
, vid
);
9195 /* Build vcall offsets, starting with those for BINFO. */
9198 add_vcall_offset_vtbl_entries_r (tree binfo
, vtbl_init_data
* vid
)
9204 /* Don't walk into virtual bases -- except, of course, for the
9205 virtual base for which we are building vcall offsets. Any
9206 primary virtual base will have already had its offsets generated
9207 through the recursion in build_vcall_and_vbase_vtbl_entries. */
9208 if (BINFO_VIRTUAL_P (binfo
) && vid
->vbase
!= binfo
)
9211 /* If BINFO has a primary base, process it first. */
9212 primary_binfo
= get_primary_binfo (binfo
);
9214 add_vcall_offset_vtbl_entries_r (primary_binfo
, vid
);
9216 /* Add BINFO itself to the list. */
9217 add_vcall_offset_vtbl_entries_1 (binfo
, vid
);
9219 /* Scan the non-primary bases of BINFO. */
9220 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
9221 if (base_binfo
!= primary_binfo
)
9222 add_vcall_offset_vtbl_entries_r (base_binfo
, vid
);
9225 /* Called from build_vcall_offset_vtbl_entries_r. */
9228 add_vcall_offset_vtbl_entries_1 (tree binfo
, vtbl_init_data
* vid
)
9230 /* Make entries for the rest of the virtuals. */
9233 /* The ABI requires that the methods be processed in declaration
9235 for (orig_fn
= TYPE_METHODS (BINFO_TYPE (binfo
));
9237 orig_fn
= DECL_CHAIN (orig_fn
))
9238 if (TREE_CODE (orig_fn
) == FUNCTION_DECL
&& DECL_VINDEX (orig_fn
))
9239 add_vcall_offset (orig_fn
, binfo
, vid
);
9242 /* Add a vcall offset entry for ORIG_FN to the vtable. */
9245 add_vcall_offset (tree orig_fn
, tree binfo
, vtbl_init_data
*vid
)
9251 /* If there is already an entry for a function with the same
9252 signature as FN, then we do not need a second vcall offset.
9253 Check the list of functions already present in the derived
9255 FOR_EACH_VEC_SAFE_ELT (vid
->fns
, i
, derived_entry
)
9257 if (same_signature_p (derived_entry
, orig_fn
)
9258 /* We only use one vcall offset for virtual destructors,
9259 even though there are two virtual table entries. */
9260 || (DECL_DESTRUCTOR_P (derived_entry
)
9261 && DECL_DESTRUCTOR_P (orig_fn
)))
9265 /* If we are building these vcall offsets as part of building
9266 the vtable for the most derived class, remember the vcall
9268 if (vid
->binfo
== TYPE_BINFO (vid
->derived
))
9270 tree_pair_s elt
= {orig_fn
, vid
->index
};
9271 vec_safe_push (CLASSTYPE_VCALL_INDICES (vid
->derived
), elt
);
9274 /* The next vcall offset will be found at a more negative
9276 vid
->index
= size_binop (MINUS_EXPR
, vid
->index
,
9277 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE
));
9279 /* Keep track of this function. */
9280 vec_safe_push (vid
->fns
, orig_fn
);
9282 if (vid
->generate_vcall_entries
)
9287 /* Find the overriding function. */
9288 fn
= find_final_overrider (vid
->rtti_binfo
, binfo
, orig_fn
);
9289 if (fn
== error_mark_node
)
9290 vcall_offset
= build_zero_cst (vtable_entry_type
);
9293 base
= TREE_VALUE (fn
);
9295 /* The vbase we're working on is a primary base of
9296 vid->binfo. But it might be a lost primary, so its
9297 BINFO_OFFSET might be wrong, so we just use the
9298 BINFO_OFFSET from vid->binfo. */
9299 vcall_offset
= size_diffop_loc (input_location
,
9300 BINFO_OFFSET (base
),
9301 BINFO_OFFSET (vid
->binfo
));
9302 vcall_offset
= fold_build1_loc (input_location
,
9303 NOP_EXPR
, vtable_entry_type
,
9306 /* Add the initializer to the vtable. */
9307 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, vcall_offset
);
9311 /* Return vtbl initializers for the RTTI entries corresponding to the
9312 BINFO's vtable. The RTTI entries should indicate the object given
9313 by VID->rtti_binfo. */
9316 build_rtti_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9324 t
= BINFO_TYPE (vid
->rtti_binfo
);
9326 /* To find the complete object, we will first convert to our most
9327 primary base, and then add the offset in the vtbl to that value. */
9329 while (CLASSTYPE_HAS_PRIMARY_BASE_P (BINFO_TYPE (b
))
9330 && !BINFO_LOST_PRIMARY_P (b
))
9334 primary_base
= get_primary_binfo (b
);
9335 gcc_assert (BINFO_PRIMARY_P (primary_base
)
9336 && BINFO_INHERITANCE_CHAIN (primary_base
) == b
);
9339 offset
= size_diffop_loc (input_location
,
9340 BINFO_OFFSET (vid
->rtti_binfo
), BINFO_OFFSET (b
));
9342 /* The second entry is the address of the typeinfo object. */
9344 decl
= build_address (get_tinfo_decl (t
));
9346 decl
= integer_zero_node
;
9348 /* Convert the declaration to a type that can be stored in the
9350 init
= build_nop (vfunc_ptr_type_node
, decl
);
9351 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, init
);
9353 /* Add the offset-to-top entry. It comes earlier in the vtable than
9354 the typeinfo entry. Convert the offset to look like a
9355 function pointer, so that we can put it in the vtable. */
9356 init
= build_nop (vfunc_ptr_type_node
, offset
);
9357 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, init
);
9360 /* TRUE iff TYPE is uniquely derived from PARENT. Ignores
9364 uniquely_derived_from_p (tree parent
, tree type
)
9366 tree base
= lookup_base (type
, parent
, ba_unique
, NULL
, tf_none
);
9367 return base
&& base
!= error_mark_node
;
9370 /* TRUE iff TYPE is publicly & uniquely derived from PARENT. */
9373 publicly_uniquely_derived_p (tree parent
, tree type
)
9375 tree base
= lookup_base (type
, parent
, ba_ignore_scope
| ba_check
,
9377 return base
&& base
!= error_mark_node
;
9380 /* CTX1 and CTX2 are declaration contexts. Return the innermost common
9381 class between them, if any. */
9384 common_enclosing_class (tree ctx1
, tree ctx2
)
9386 if (!TYPE_P (ctx1
) || !TYPE_P (ctx2
))
9388 gcc_assert (ctx1
== TYPE_MAIN_VARIANT (ctx1
)
9389 && ctx2
== TYPE_MAIN_VARIANT (ctx2
));
9392 for (tree t
= ctx1
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9393 TYPE_MARKED_P (t
) = true;
9394 tree found
= NULL_TREE
;
9395 for (tree t
= ctx2
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9396 if (TYPE_MARKED_P (t
))
9401 for (tree t
= ctx1
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9402 TYPE_MARKED_P (t
) = false;
9406 #include "gt-cp-class.h"