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 id
, tree
*tp
, abi_tag_data
*p
)
1387 if (!IDENTIFIER_MARKED (id
))
1389 if (p
->tags
!= error_mark_node
)
1391 /* We're collecting tags from template arguments or from
1392 the type of a variable or function return type. */
1393 p
->tags
= tree_cons (NULL_TREE
, tag
, p
->tags
);
1395 /* Don't inherit this tag multiple times. */
1396 IDENTIFIER_MARKED (id
) = true;
1400 /* Tags inherited from type template arguments are only used
1401 to avoid warnings. */
1402 ABI_TAG_IMPLICIT (p
->tags
) = true;
1405 /* For functions and variables we want to warn, too. */
1408 /* Otherwise we're diagnosing missing tags. */
1409 if (TREE_CODE (p
->t
) == FUNCTION_DECL
)
1411 if (warning (OPT_Wabi_tag
, "%qD inherits the %E ABI tag "
1412 "that %qT (used in its return type) has",
1414 inform (location_of (*tp
), "%qT declared here", *tp
);
1416 else if (TREE_CODE (p
->t
) == VAR_DECL
)
1418 if (warning (OPT_Wabi_tag
, "%qD inherits the %E ABI tag "
1419 "that %qT (used in its type) has", p
->t
, tag
, *tp
))
1420 inform (location_of (*tp
), "%qT declared here", *tp
);
1422 else if (TYPE_P (p
->subob
))
1424 if (warning (OPT_Wabi_tag
, "%qT does not have the %E ABI tag "
1425 "that base %qT has", p
->t
, tag
, p
->subob
))
1426 inform (location_of (p
->subob
), "%qT declared here",
1431 if (warning (OPT_Wabi_tag
, "%qT does not have the %E ABI tag "
1432 "that %qT (used in the type of %qD) has",
1433 p
->t
, tag
, *tp
, p
->subob
))
1435 inform (location_of (p
->subob
), "%qD declared here",
1437 inform (location_of (*tp
), "%qT declared here", *tp
);
1443 /* Find all the ABI tags in the attribute list ATTR and either call
1444 check_tag (if TP is non-null) or set IDENTIFIER_MARKED to val. */
1447 mark_or_check_attr_tags (tree attr
, tree
*tp
, abi_tag_data
*p
, bool val
)
1451 for (; (attr
= lookup_attribute ("abi_tag", attr
));
1452 attr
= TREE_CHAIN (attr
))
1453 for (tree list
= TREE_VALUE (attr
); list
;
1454 list
= TREE_CHAIN (list
))
1456 tree tag
= TREE_VALUE (list
);
1457 tree id
= get_identifier (TREE_STRING_POINTER (tag
));
1459 check_tag (tag
, id
, tp
, p
);
1461 IDENTIFIER_MARKED (id
) = val
;
1465 /* Find all the ABI tags on T and its enclosing scopes and either call
1466 check_tag (if TP is non-null) or set IDENTIFIER_MARKED to val. */
1469 mark_or_check_tags (tree t
, tree
*tp
, abi_tag_data
*p
, bool val
)
1471 while (t
!= global_namespace
)
1476 attr
= TYPE_ATTRIBUTES (t
);
1477 t
= CP_TYPE_CONTEXT (t
);
1481 attr
= DECL_ATTRIBUTES (t
);
1482 t
= CP_DECL_CONTEXT (t
);
1484 mark_or_check_attr_tags (attr
, tp
, p
, val
);
1488 /* walk_tree callback for check_abi_tags: if the type at *TP involves any
1489 types with ABI tags, add the corresponding identifiers to the VEC in
1490 *DATA and set IDENTIFIER_MARKED. */
1493 find_abi_tags_r (tree
*tp
, int *walk_subtrees
, void *data
)
1495 if (!OVERLOAD_TYPE_P (*tp
))
1498 /* walk_tree shouldn't be walking into any subtrees of a RECORD_TYPE
1499 anyway, but let's make sure of it. */
1500 *walk_subtrees
= false;
1502 abi_tag_data
*p
= static_cast<struct abi_tag_data
*>(data
);
1504 mark_or_check_tags (*tp
, tp
, p
, false);
1509 /* walk_tree callback for mark_abi_tags: if *TP is a class, set
1510 IDENTIFIER_MARKED on its ABI tags. */
1513 mark_abi_tags_r (tree
*tp
, int *walk_subtrees
, void *data
)
1515 if (!OVERLOAD_TYPE_P (*tp
))
1518 /* walk_tree shouldn't be walking into any subtrees of a RECORD_TYPE
1519 anyway, but let's make sure of it. */
1520 *walk_subtrees
= false;
1522 bool *valp
= static_cast<bool*>(data
);
1524 mark_or_check_tags (*tp
, NULL
, NULL
, *valp
);
1529 /* Set IDENTIFIER_MARKED on all the ABI tags on T and its enclosing
1533 mark_abi_tags (tree t
, bool val
)
1535 mark_or_check_tags (t
, NULL
, NULL
, val
);
1538 if (DECL_LANG_SPECIFIC (t
) && DECL_USE_TEMPLATE (t
)
1539 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (t
)))
1541 /* Template arguments are part of the signature. */
1542 tree level
= INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (t
));
1543 for (int j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
1545 tree arg
= TREE_VEC_ELT (level
, j
);
1546 cp_walk_tree_without_duplicates (&arg
, mark_abi_tags_r
, &val
);
1549 if (TREE_CODE (t
) == FUNCTION_DECL
)
1550 /* A function's parameter types are part of the signature, so
1551 we don't need to inherit any tags that are also in them. */
1552 for (tree arg
= FUNCTION_FIRST_USER_PARMTYPE (t
); arg
;
1553 arg
= TREE_CHAIN (arg
))
1554 cp_walk_tree_without_duplicates (&TREE_VALUE (arg
),
1555 mark_abi_tags_r
, &val
);
1559 /* Check that T has all the ABI tags that subobject SUBOB has, or
1560 warn if not. If T is a (variable or function) declaration, also
1561 add any missing tags. */
1564 check_abi_tags (tree t
, tree subob
)
1566 bool inherit
= DECL_P (t
);
1568 if (!inherit
&& !warn_abi_tag
)
1571 tree decl
= TYPE_P (t
) ? TYPE_NAME (t
) : t
;
1572 if (!TREE_PUBLIC (decl
))
1573 /* No need to worry about things local to this TU. */
1576 mark_abi_tags (t
, true);
1578 tree subtype
= TYPE_P (subob
) ? subob
: TREE_TYPE (subob
);
1579 struct abi_tag_data data
= { t
, subob
, error_mark_node
};
1581 data
.tags
= NULL_TREE
;
1583 cp_walk_tree_without_duplicates (&subtype
, find_abi_tags_r
, &data
);
1585 if (inherit
&& data
.tags
)
1587 tree attr
= lookup_attribute ("abi_tag", DECL_ATTRIBUTES (t
));
1589 TREE_VALUE (attr
) = chainon (data
.tags
, TREE_VALUE (attr
));
1592 = tree_cons (get_identifier ("abi_tag"), data
.tags
,
1593 DECL_ATTRIBUTES (t
));
1596 mark_abi_tags (t
, false);
1599 /* Check that DECL has all the ABI tags that are used in parts of its type
1600 that are not reflected in its mangled name. */
1603 check_abi_tags (tree decl
)
1605 if (TREE_CODE (decl
) == VAR_DECL
)
1606 check_abi_tags (decl
, TREE_TYPE (decl
));
1607 else if (TREE_CODE (decl
) == FUNCTION_DECL
1608 && !mangle_return_type_p (decl
))
1609 check_abi_tags (decl
, TREE_TYPE (TREE_TYPE (decl
)));
1613 inherit_targ_abi_tags (tree t
)
1615 if (!CLASS_TYPE_P (t
)
1616 || CLASSTYPE_TEMPLATE_INFO (t
) == NULL_TREE
)
1619 mark_abi_tags (t
, true);
1621 tree args
= CLASSTYPE_TI_ARGS (t
);
1622 struct abi_tag_data data
= { t
, NULL_TREE
, NULL_TREE
};
1623 for (int i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
1625 tree level
= TMPL_ARGS_LEVEL (args
, i
+1);
1626 for (int j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
1628 tree arg
= TREE_VEC_ELT (level
, j
);
1630 cp_walk_tree_without_duplicates (&arg
, find_abi_tags_r
, &data
);
1634 // If we found some tags on our template arguments, add them to our
1635 // abi_tag attribute.
1638 tree attr
= lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (t
));
1640 TREE_VALUE (attr
) = chainon (data
.tags
, TREE_VALUE (attr
));
1643 = tree_cons (get_identifier ("abi_tag"), data
.tags
,
1644 TYPE_ATTRIBUTES (t
));
1647 mark_abi_tags (t
, false);
1650 /* Return true, iff class T has a non-virtual destructor that is
1651 accessible from outside the class heirarchy (i.e. is public, or
1652 there's a suitable friend. */
1655 accessible_nvdtor_p (tree t
)
1657 tree dtor
= CLASSTYPE_DESTRUCTORS (t
);
1659 /* An implicitly declared destructor is always public. And,
1660 if it were virtual, we would have created it by now. */
1664 if (DECL_VINDEX (dtor
))
1665 return false; /* Virtual */
1667 if (!TREE_PRIVATE (dtor
) && !TREE_PROTECTED (dtor
))
1668 return true; /* Public */
1670 if (CLASSTYPE_FRIEND_CLASSES (t
)
1671 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t
)))
1672 return true; /* Has friends */
1677 /* Run through the base classes of T, updating CANT_HAVE_CONST_CTOR_P,
1678 and NO_CONST_ASN_REF_P. Also set flag bits in T based on
1679 properties of the bases. */
1682 check_bases (tree t
,
1683 int* cant_have_const_ctor_p
,
1684 int* no_const_asn_ref_p
)
1687 bool seen_non_virtual_nearly_empty_base_p
= 0;
1688 int seen_tm_mask
= 0;
1691 tree field
= NULL_TREE
;
1693 if (!CLASSTYPE_NON_STD_LAYOUT (t
))
1694 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
1695 if (TREE_CODE (field
) == FIELD_DECL
)
1698 for (binfo
= TYPE_BINFO (t
), i
= 0;
1699 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
1701 tree basetype
= TREE_TYPE (base_binfo
);
1703 gcc_assert (COMPLETE_TYPE_P (basetype
));
1705 if (CLASSTYPE_FINAL (basetype
))
1706 error ("cannot derive from %<final%> base %qT in derived type %qT",
1709 /* If any base class is non-literal, so is the derived class. */
1710 if (!CLASSTYPE_LITERAL_P (basetype
))
1711 CLASSTYPE_LITERAL_P (t
) = false;
1713 /* If the base class doesn't have copy constructors or
1714 assignment operators that take const references, then the
1715 derived class cannot have such a member automatically
1717 if (TYPE_HAS_COPY_CTOR (basetype
)
1718 && ! TYPE_HAS_CONST_COPY_CTOR (basetype
))
1719 *cant_have_const_ctor_p
= 1;
1720 if (TYPE_HAS_COPY_ASSIGN (basetype
)
1721 && !TYPE_HAS_CONST_COPY_ASSIGN (basetype
))
1722 *no_const_asn_ref_p
= 1;
1724 if (BINFO_VIRTUAL_P (base_binfo
))
1725 /* A virtual base does not effect nearly emptiness. */
1727 else if (CLASSTYPE_NEARLY_EMPTY_P (basetype
))
1729 if (seen_non_virtual_nearly_empty_base_p
)
1730 /* And if there is more than one nearly empty base, then the
1731 derived class is not nearly empty either. */
1732 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
1734 /* Remember we've seen one. */
1735 seen_non_virtual_nearly_empty_base_p
= 1;
1737 else if (!is_empty_class (basetype
))
1738 /* If the base class is not empty or nearly empty, then this
1739 class cannot be nearly empty. */
1740 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
1742 /* A lot of properties from the bases also apply to the derived
1744 TYPE_NEEDS_CONSTRUCTING (t
) |= TYPE_NEEDS_CONSTRUCTING (basetype
);
1745 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
1746 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (basetype
);
1747 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
)
1748 |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (basetype
)
1749 || !TYPE_HAS_COPY_ASSIGN (basetype
));
1750 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= (TYPE_HAS_COMPLEX_COPY_CTOR (basetype
)
1751 || !TYPE_HAS_COPY_CTOR (basetype
));
1752 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
)
1753 |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (basetype
);
1754 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_HAS_COMPLEX_MOVE_CTOR (basetype
);
1755 TYPE_POLYMORPHIC_P (t
) |= TYPE_POLYMORPHIC_P (basetype
);
1756 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
)
1757 |= CLASSTYPE_CONTAINS_EMPTY_CLASS_P (basetype
);
1758 TYPE_HAS_COMPLEX_DFLT (t
) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
1759 || TYPE_HAS_COMPLEX_DFLT (basetype
));
1760 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT
1761 (t
, CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
)
1762 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (basetype
));
1763 SET_CLASSTYPE_REF_FIELDS_NEED_INIT
1764 (t
, CLASSTYPE_REF_FIELDS_NEED_INIT (t
)
1765 | CLASSTYPE_REF_FIELDS_NEED_INIT (basetype
));
1767 /* A standard-layout class is a class that:
1769 * has no non-standard-layout base classes, */
1770 CLASSTYPE_NON_STD_LAYOUT (t
) |= CLASSTYPE_NON_STD_LAYOUT (basetype
);
1771 if (!CLASSTYPE_NON_STD_LAYOUT (t
))
1774 /* ...has no base classes of the same type as the first non-static
1776 if (field
&& DECL_CONTEXT (field
) == t
1777 && (same_type_ignoring_top_level_qualifiers_p
1778 (TREE_TYPE (field
), basetype
)))
1779 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
1781 /* ...either has no non-static data members in the most-derived
1782 class and at most one base class with non-static data
1783 members, or has no base classes with non-static data
1785 for (basefield
= TYPE_FIELDS (basetype
); basefield
;
1786 basefield
= DECL_CHAIN (basefield
))
1787 if (TREE_CODE (basefield
) == FIELD_DECL
)
1790 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
1797 /* Don't bother collecting tm attributes if transactional memory
1798 support is not enabled. */
1801 tree tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (basetype
));
1803 seen_tm_mask
|= tm_attr_to_mask (tm_attr
);
1806 check_abi_tags (t
, basetype
);
1809 /* If one of the base classes had TM attributes, and the current class
1810 doesn't define its own, then the current class inherits one. */
1811 if (seen_tm_mask
&& !find_tm_attribute (TYPE_ATTRIBUTES (t
)))
1813 tree tm_attr
= tm_mask_to_attr (seen_tm_mask
& -seen_tm_mask
);
1814 TYPE_ATTRIBUTES (t
) = tree_cons (tm_attr
, NULL
, TYPE_ATTRIBUTES (t
));
1818 /* Determine all the primary bases within T. Sets BINFO_PRIMARY_BASE_P for
1819 those that are primaries. Sets BINFO_LOST_PRIMARY_P for those
1820 that have had a nearly-empty virtual primary base stolen by some
1821 other base in the hierarchy. Determines CLASSTYPE_PRIMARY_BASE for
1825 determine_primary_bases (tree t
)
1828 tree primary
= NULL_TREE
;
1829 tree type_binfo
= TYPE_BINFO (t
);
1832 /* Determine the primary bases of our bases. */
1833 for (base_binfo
= TREE_CHAIN (type_binfo
); base_binfo
;
1834 base_binfo
= TREE_CHAIN (base_binfo
))
1836 tree primary
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (base_binfo
));
1838 /* See if we're the non-virtual primary of our inheritance
1840 if (!BINFO_VIRTUAL_P (base_binfo
))
1842 tree parent
= BINFO_INHERITANCE_CHAIN (base_binfo
);
1843 tree parent_primary
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (parent
));
1846 && SAME_BINFO_TYPE_P (BINFO_TYPE (base_binfo
),
1847 BINFO_TYPE (parent_primary
)))
1848 /* We are the primary binfo. */
1849 BINFO_PRIMARY_P (base_binfo
) = 1;
1851 /* Determine if we have a virtual primary base, and mark it so.
1853 if (primary
&& BINFO_VIRTUAL_P (primary
))
1855 tree this_primary
= copied_binfo (primary
, base_binfo
);
1857 if (BINFO_PRIMARY_P (this_primary
))
1858 /* Someone already claimed this base. */
1859 BINFO_LOST_PRIMARY_P (base_binfo
) = 1;
1864 BINFO_PRIMARY_P (this_primary
) = 1;
1865 BINFO_INHERITANCE_CHAIN (this_primary
) = base_binfo
;
1867 /* A virtual binfo might have been copied from within
1868 another hierarchy. As we're about to use it as a
1869 primary base, make sure the offsets match. */
1870 delta
= size_diffop_loc (input_location
,
1872 BINFO_OFFSET (base_binfo
)),
1874 BINFO_OFFSET (this_primary
)));
1876 propagate_binfo_offsets (this_primary
, delta
);
1881 /* First look for a dynamic direct non-virtual base. */
1882 for (i
= 0; BINFO_BASE_ITERATE (type_binfo
, i
, base_binfo
); i
++)
1884 tree basetype
= BINFO_TYPE (base_binfo
);
1886 if (TYPE_CONTAINS_VPTR_P (basetype
) && !BINFO_VIRTUAL_P (base_binfo
))
1888 primary
= base_binfo
;
1893 /* A "nearly-empty" virtual base class can be the primary base
1894 class, if no non-virtual polymorphic base can be found. Look for
1895 a nearly-empty virtual dynamic base that is not already a primary
1896 base of something in the hierarchy. If there is no such base,
1897 just pick the first nearly-empty virtual base. */
1899 for (base_binfo
= TREE_CHAIN (type_binfo
); base_binfo
;
1900 base_binfo
= TREE_CHAIN (base_binfo
))
1901 if (BINFO_VIRTUAL_P (base_binfo
)
1902 && CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (base_binfo
)))
1904 if (!BINFO_PRIMARY_P (base_binfo
))
1906 /* Found one that is not primary. */
1907 primary
= base_binfo
;
1911 /* Remember the first candidate. */
1912 primary
= base_binfo
;
1916 /* If we've got a primary base, use it. */
1919 tree basetype
= BINFO_TYPE (primary
);
1921 CLASSTYPE_PRIMARY_BINFO (t
) = primary
;
1922 if (BINFO_PRIMARY_P (primary
))
1923 /* We are stealing a primary base. */
1924 BINFO_LOST_PRIMARY_P (BINFO_INHERITANCE_CHAIN (primary
)) = 1;
1925 BINFO_PRIMARY_P (primary
) = 1;
1926 if (BINFO_VIRTUAL_P (primary
))
1930 BINFO_INHERITANCE_CHAIN (primary
) = type_binfo
;
1931 /* A virtual binfo might have been copied from within
1932 another hierarchy. As we're about to use it as a primary
1933 base, make sure the offsets match. */
1934 delta
= size_diffop_loc (input_location
, ssize_int (0),
1935 convert (ssizetype
, BINFO_OFFSET (primary
)));
1937 propagate_binfo_offsets (primary
, delta
);
1940 primary
= TYPE_BINFO (basetype
);
1942 TYPE_VFIELD (t
) = TYPE_VFIELD (basetype
);
1943 BINFO_VTABLE (type_binfo
) = BINFO_VTABLE (primary
);
1944 BINFO_VIRTUALS (type_binfo
) = BINFO_VIRTUALS (primary
);
1948 /* Update the variant types of T. */
1951 fixup_type_variants (tree t
)
1958 for (variants
= TYPE_NEXT_VARIANT (t
);
1960 variants
= TYPE_NEXT_VARIANT (variants
))
1962 /* These fields are in the _TYPE part of the node, not in
1963 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1964 TYPE_HAS_USER_CONSTRUCTOR (variants
) = TYPE_HAS_USER_CONSTRUCTOR (t
);
1965 TYPE_NEEDS_CONSTRUCTING (variants
) = TYPE_NEEDS_CONSTRUCTING (t
);
1966 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (variants
)
1967 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
);
1969 TYPE_POLYMORPHIC_P (variants
) = TYPE_POLYMORPHIC_P (t
);
1971 TYPE_BINFO (variants
) = TYPE_BINFO (t
);
1973 /* Copy whatever these are holding today. */
1974 TYPE_VFIELD (variants
) = TYPE_VFIELD (t
);
1975 TYPE_FIELDS (variants
) = TYPE_FIELDS (t
);
1979 /* Early variant fixups: we apply attributes at the beginning of the class
1980 definition, and we need to fix up any variants that have already been
1981 made via elaborated-type-specifier so that check_qualified_type works. */
1984 fixup_attribute_variants (tree t
)
1991 tree attrs
= TYPE_ATTRIBUTES (t
);
1992 unsigned align
= TYPE_ALIGN (t
);
1993 bool user_align
= TYPE_USER_ALIGN (t
);
1995 for (variants
= TYPE_NEXT_VARIANT (t
);
1997 variants
= TYPE_NEXT_VARIANT (variants
))
1999 /* These are the two fields that check_qualified_type looks at and
2000 are affected by attributes. */
2001 TYPE_ATTRIBUTES (variants
) = attrs
;
2002 unsigned valign
= align
;
2003 if (TYPE_USER_ALIGN (variants
))
2004 valign
= MAX (valign
, TYPE_ALIGN (variants
));
2006 TYPE_USER_ALIGN (variants
) = user_align
;
2007 TYPE_ALIGN (variants
) = valign
;
2011 /* Set memoizing fields and bits of T (and its variants) for later
2015 finish_struct_bits (tree t
)
2017 /* Fix up variants (if any). */
2018 fixup_type_variants (t
);
2020 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t
)) && TYPE_POLYMORPHIC_P (t
))
2021 /* For a class w/o baseclasses, 'finish_struct' has set
2022 CLASSTYPE_PURE_VIRTUALS correctly (by definition).
2023 Similarly for a class whose base classes do not have vtables.
2024 When neither of these is true, we might have removed abstract
2025 virtuals (by providing a definition), added some (by declaring
2026 new ones), or redeclared ones from a base class. We need to
2027 recalculate what's really an abstract virtual at this point (by
2028 looking in the vtables). */
2029 get_pure_virtuals (t
);
2031 /* If this type has a copy constructor or a destructor, force its
2032 mode to be BLKmode, and force its TREE_ADDRESSABLE bit to be
2033 nonzero. This will cause it to be passed by invisible reference
2034 and prevent it from being returned in a register. */
2035 if (type_has_nontrivial_copy_init (t
)
2036 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
2039 DECL_MODE (TYPE_MAIN_DECL (t
)) = BLKmode
;
2040 for (variants
= t
; variants
; variants
= TYPE_NEXT_VARIANT (variants
))
2042 SET_TYPE_MODE (variants
, BLKmode
);
2043 TREE_ADDRESSABLE (variants
) = 1;
2048 /* Issue warnings about T having private constructors, but no friends,
2051 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
2052 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
2053 non-private static member functions. */
2056 maybe_warn_about_overly_private_class (tree t
)
2058 int has_member_fn
= 0;
2059 int has_nonprivate_method
= 0;
2062 if (!warn_ctor_dtor_privacy
2063 /* If the class has friends, those entities might create and
2064 access instances, so we should not warn. */
2065 || (CLASSTYPE_FRIEND_CLASSES (t
)
2066 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t
)))
2067 /* We will have warned when the template was declared; there's
2068 no need to warn on every instantiation. */
2069 || CLASSTYPE_TEMPLATE_INSTANTIATION (t
))
2070 /* There's no reason to even consider warning about this
2074 /* We only issue one warning, if more than one applies, because
2075 otherwise, on code like:
2078 // Oops - forgot `public:'
2084 we warn several times about essentially the same problem. */
2086 /* Check to see if all (non-constructor, non-destructor) member
2087 functions are private. (Since there are no friends or
2088 non-private statics, we can't ever call any of the private member
2090 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
2091 /* We're not interested in compiler-generated methods; they don't
2092 provide any way to call private members. */
2093 if (!DECL_ARTIFICIAL (fn
))
2095 if (!TREE_PRIVATE (fn
))
2097 if (DECL_STATIC_FUNCTION_P (fn
))
2098 /* A non-private static member function is just like a
2099 friend; it can create and invoke private member
2100 functions, and be accessed without a class
2104 has_nonprivate_method
= 1;
2105 /* Keep searching for a static member function. */
2107 else if (!DECL_CONSTRUCTOR_P (fn
) && !DECL_DESTRUCTOR_P (fn
))
2111 if (!has_nonprivate_method
&& has_member_fn
)
2113 /* There are no non-private methods, and there's at least one
2114 private member function that isn't a constructor or
2115 destructor. (If all the private members are
2116 constructors/destructors we want to use the code below that
2117 issues error messages specifically referring to
2118 constructors/destructors.) */
2120 tree binfo
= TYPE_BINFO (t
);
2122 for (i
= 0; i
!= BINFO_N_BASE_BINFOS (binfo
); i
++)
2123 if (BINFO_BASE_ACCESS (binfo
, i
) != access_private_node
)
2125 has_nonprivate_method
= 1;
2128 if (!has_nonprivate_method
)
2130 warning (OPT_Wctor_dtor_privacy
,
2131 "all member functions in class %qT are private", t
);
2136 /* Even if some of the member functions are non-private, the class
2137 won't be useful for much if all the constructors or destructors
2138 are private: such an object can never be created or destroyed. */
2139 fn
= CLASSTYPE_DESTRUCTORS (t
);
2140 if (fn
&& TREE_PRIVATE (fn
))
2142 warning (OPT_Wctor_dtor_privacy
,
2143 "%q#T only defines a private destructor and has no friends",
2148 /* Warn about classes that have private constructors and no friends. */
2149 if (TYPE_HAS_USER_CONSTRUCTOR (t
)
2150 /* Implicitly generated constructors are always public. */
2151 && (!CLASSTYPE_LAZY_DEFAULT_CTOR (t
)
2152 || !CLASSTYPE_LAZY_COPY_CTOR (t
)))
2154 int nonprivate_ctor
= 0;
2156 /* If a non-template class does not define a copy
2157 constructor, one is defined for it, enabling it to avoid
2158 this warning. For a template class, this does not
2159 happen, and so we would normally get a warning on:
2161 template <class T> class C { private: C(); };
2163 To avoid this asymmetry, we check TYPE_HAS_COPY_CTOR. All
2164 complete non-template or fully instantiated classes have this
2166 if (!TYPE_HAS_COPY_CTOR (t
))
2167 nonprivate_ctor
= 1;
2169 for (fn
= CLASSTYPE_CONSTRUCTORS (t
); fn
; fn
= OVL_NEXT (fn
))
2171 tree ctor
= OVL_CURRENT (fn
);
2172 /* Ideally, we wouldn't count copy constructors (or, in
2173 fact, any constructor that takes an argument of the
2174 class type as a parameter) because such things cannot
2175 be used to construct an instance of the class unless
2176 you already have one. But, for now at least, we're
2178 if (! TREE_PRIVATE (ctor
))
2180 nonprivate_ctor
= 1;
2185 if (nonprivate_ctor
== 0)
2187 warning (OPT_Wctor_dtor_privacy
,
2188 "%q#T only defines private constructors and has no friends",
2196 gt_pointer_operator new_value
;
2200 /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */
2203 method_name_cmp (const void* m1_p
, const void* m2_p
)
2205 const tree
*const m1
= (const tree
*) m1_p
;
2206 const tree
*const m2
= (const tree
*) m2_p
;
2208 if (*m1
== NULL_TREE
&& *m2
== NULL_TREE
)
2210 if (*m1
== NULL_TREE
)
2212 if (*m2
== NULL_TREE
)
2214 if (DECL_NAME (OVL_CURRENT (*m1
)) < DECL_NAME (OVL_CURRENT (*m2
)))
2219 /* This routine compares two fields like method_name_cmp but using the
2220 pointer operator in resort_field_decl_data. */
2223 resort_method_name_cmp (const void* m1_p
, const void* m2_p
)
2225 const tree
*const m1
= (const tree
*) m1_p
;
2226 const tree
*const m2
= (const tree
*) m2_p
;
2227 if (*m1
== NULL_TREE
&& *m2
== NULL_TREE
)
2229 if (*m1
== NULL_TREE
)
2231 if (*m2
== NULL_TREE
)
2234 tree d1
= DECL_NAME (OVL_CURRENT (*m1
));
2235 tree d2
= DECL_NAME (OVL_CURRENT (*m2
));
2236 resort_data
.new_value (&d1
, resort_data
.cookie
);
2237 resort_data
.new_value (&d2
, resort_data
.cookie
);
2244 /* Resort TYPE_METHOD_VEC because pointers have been reordered. */
2247 resort_type_method_vec (void* obj
,
2249 gt_pointer_operator new_value
,
2252 vec
<tree
, va_gc
> *method_vec
= (vec
<tree
, va_gc
> *) obj
;
2253 int len
= vec_safe_length (method_vec
);
2257 /* The type conversion ops have to live at the front of the vec, so we
2259 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2260 vec_safe_iterate (method_vec
, slot
, &fn
);
2262 if (!DECL_CONV_FN_P (OVL_CURRENT (fn
)))
2267 resort_data
.new_value
= new_value
;
2268 resort_data
.cookie
= cookie
;
2269 qsort (method_vec
->address () + slot
, len
- slot
, sizeof (tree
),
2270 resort_method_name_cmp
);
2274 /* Warn about duplicate methods in fn_fields.
2276 Sort methods that are not special (i.e., constructors, destructors,
2277 and type conversion operators) so that we can find them faster in
2281 finish_struct_methods (tree t
)
2284 vec
<tree
, va_gc
> *method_vec
;
2287 method_vec
= CLASSTYPE_METHOD_VEC (t
);
2291 len
= method_vec
->length ();
2293 /* Clear DECL_IN_AGGR_P for all functions. */
2294 for (fn_fields
= TYPE_METHODS (t
); fn_fields
;
2295 fn_fields
= DECL_CHAIN (fn_fields
))
2296 DECL_IN_AGGR_P (fn_fields
) = 0;
2298 /* Issue warnings about private constructors and such. If there are
2299 no methods, then some public defaults are generated. */
2300 maybe_warn_about_overly_private_class (t
);
2302 /* The type conversion ops have to live at the front of the vec, so we
2304 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2305 method_vec
->iterate (slot
, &fn_fields
);
2307 if (!DECL_CONV_FN_P (OVL_CURRENT (fn_fields
)))
2310 qsort (method_vec
->address () + slot
,
2311 len
-slot
, sizeof (tree
), method_name_cmp
);
2314 /* Make BINFO's vtable have N entries, including RTTI entries,
2315 vbase and vcall offsets, etc. Set its type and call the back end
2319 layout_vtable_decl (tree binfo
, int n
)
2324 atype
= build_array_of_n_type (vtable_entry_type
, n
);
2325 layout_type (atype
);
2327 /* We may have to grow the vtable. */
2328 vtable
= get_vtbl_decl_for_binfo (binfo
);
2329 if (!same_type_p (TREE_TYPE (vtable
), atype
))
2331 TREE_TYPE (vtable
) = atype
;
2332 DECL_SIZE (vtable
) = DECL_SIZE_UNIT (vtable
) = NULL_TREE
;
2333 layout_decl (vtable
, 0);
2337 /* True iff FNDECL and BASE_FNDECL (both non-static member functions)
2338 have the same signature. */
2341 same_signature_p (const_tree fndecl
, const_tree base_fndecl
)
2343 /* One destructor overrides another if they are the same kind of
2345 if (DECL_DESTRUCTOR_P (base_fndecl
) && DECL_DESTRUCTOR_P (fndecl
)
2346 && special_function_p (base_fndecl
) == special_function_p (fndecl
))
2348 /* But a non-destructor never overrides a destructor, nor vice
2349 versa, nor do different kinds of destructors override
2350 one-another. For example, a complete object destructor does not
2351 override a deleting destructor. */
2352 if (DECL_DESTRUCTOR_P (base_fndecl
) || DECL_DESTRUCTOR_P (fndecl
))
2355 if (DECL_NAME (fndecl
) == DECL_NAME (base_fndecl
)
2356 || (DECL_CONV_FN_P (fndecl
)
2357 && DECL_CONV_FN_P (base_fndecl
)
2358 && same_type_p (DECL_CONV_FN_TYPE (fndecl
),
2359 DECL_CONV_FN_TYPE (base_fndecl
))))
2361 tree fntype
= TREE_TYPE (fndecl
);
2362 tree base_fntype
= TREE_TYPE (base_fndecl
);
2363 if (type_memfn_quals (fntype
) == type_memfn_quals (base_fntype
)
2364 && type_memfn_rqual (fntype
) == type_memfn_rqual (base_fntype
)
2365 && compparms (FUNCTION_FIRST_USER_PARMTYPE (fndecl
),
2366 FUNCTION_FIRST_USER_PARMTYPE (base_fndecl
)))
2372 /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a
2376 base_derived_from (tree derived
, tree base
)
2380 for (probe
= base
; probe
; probe
= BINFO_INHERITANCE_CHAIN (probe
))
2382 if (probe
== derived
)
2384 else if (BINFO_VIRTUAL_P (probe
))
2385 /* If we meet a virtual base, we can't follow the inheritance
2386 any more. See if the complete type of DERIVED contains
2387 such a virtual base. */
2388 return (binfo_for_vbase (BINFO_TYPE (probe
), BINFO_TYPE (derived
))
2394 typedef struct find_final_overrider_data_s
{
2395 /* The function for which we are trying to find a final overrider. */
2397 /* The base class in which the function was declared. */
2398 tree declaring_base
;
2399 /* The candidate overriders. */
2401 /* Path to most derived. */
2403 } find_final_overrider_data
;
2405 /* Add the overrider along the current path to FFOD->CANDIDATES.
2406 Returns true if an overrider was found; false otherwise. */
2409 dfs_find_final_overrider_1 (tree binfo
,
2410 find_final_overrider_data
*ffod
,
2415 /* If BINFO is not the most derived type, try a more derived class.
2416 A definition there will overrider a definition here. */
2420 if (dfs_find_final_overrider_1
2421 (ffod
->path
[depth
], ffod
, depth
))
2425 method
= look_for_overrides_here (BINFO_TYPE (binfo
), ffod
->fn
);
2428 tree
*candidate
= &ffod
->candidates
;
2430 /* Remove any candidates overridden by this new function. */
2433 /* If *CANDIDATE overrides METHOD, then METHOD
2434 cannot override anything else on the list. */
2435 if (base_derived_from (TREE_VALUE (*candidate
), binfo
))
2437 /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */
2438 if (base_derived_from (binfo
, TREE_VALUE (*candidate
)))
2439 *candidate
= TREE_CHAIN (*candidate
);
2441 candidate
= &TREE_CHAIN (*candidate
);
2444 /* Add the new function. */
2445 ffod
->candidates
= tree_cons (method
, binfo
, ffod
->candidates
);
2452 /* Called from find_final_overrider via dfs_walk. */
2455 dfs_find_final_overrider_pre (tree binfo
, void *data
)
2457 find_final_overrider_data
*ffod
= (find_final_overrider_data
*) data
;
2459 if (binfo
== ffod
->declaring_base
)
2460 dfs_find_final_overrider_1 (binfo
, ffod
, ffod
->path
.length ());
2461 ffod
->path
.safe_push (binfo
);
2467 dfs_find_final_overrider_post (tree
/*binfo*/, void *data
)
2469 find_final_overrider_data
*ffod
= (find_final_overrider_data
*) data
;
2475 /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for
2476 FN and whose TREE_VALUE is the binfo for the base where the
2477 overriding occurs. BINFO (in the hierarchy dominated by the binfo
2478 DERIVED) is the base object in which FN is declared. */
2481 find_final_overrider (tree derived
, tree binfo
, tree fn
)
2483 find_final_overrider_data ffod
;
2485 /* Getting this right is a little tricky. This is valid:
2487 struct S { virtual void f (); };
2488 struct T { virtual void f (); };
2489 struct U : public S, public T { };
2491 even though calling `f' in `U' is ambiguous. But,
2493 struct R { virtual void f(); };
2494 struct S : virtual public R { virtual void f (); };
2495 struct T : virtual public R { virtual void f (); };
2496 struct U : public S, public T { };
2498 is not -- there's no way to decide whether to put `S::f' or
2499 `T::f' in the vtable for `R'.
2501 The solution is to look at all paths to BINFO. If we find
2502 different overriders along any two, then there is a problem. */
2503 if (DECL_THUNK_P (fn
))
2504 fn
= THUNK_TARGET (fn
);
2506 /* Determine the depth of the hierarchy. */
2508 ffod
.declaring_base
= binfo
;
2509 ffod
.candidates
= NULL_TREE
;
2510 ffod
.path
.create (30);
2512 dfs_walk_all (derived
, dfs_find_final_overrider_pre
,
2513 dfs_find_final_overrider_post
, &ffod
);
2515 ffod
.path
.release ();
2517 /* If there was no winner, issue an error message. */
2518 if (!ffod
.candidates
|| TREE_CHAIN (ffod
.candidates
))
2519 return error_mark_node
;
2521 return ffod
.candidates
;
2524 /* Return the index of the vcall offset for FN when TYPE is used as a
2528 get_vcall_index (tree fn
, tree type
)
2530 vec
<tree_pair_s
, va_gc
> *indices
= CLASSTYPE_VCALL_INDICES (type
);
2534 FOR_EACH_VEC_SAFE_ELT (indices
, ix
, p
)
2535 if ((DECL_DESTRUCTOR_P (fn
) && DECL_DESTRUCTOR_P (p
->purpose
))
2536 || same_signature_p (fn
, p
->purpose
))
2539 /* There should always be an appropriate index. */
2543 /* Update an entry in the vtable for BINFO, which is in the hierarchy
2544 dominated by T. FN is the old function; VIRTUALS points to the
2545 corresponding position in the new BINFO_VIRTUALS list. IX is the index
2546 of that entry in the list. */
2549 update_vtable_entry_for_fn (tree t
, tree binfo
, tree fn
, tree
* virtuals
,
2557 tree overrider_fn
, overrider_target
;
2558 tree target_fn
= DECL_THUNK_P (fn
) ? THUNK_TARGET (fn
) : fn
;
2559 tree over_return
, base_return
;
2562 /* Find the nearest primary base (possibly binfo itself) which defines
2563 this function; this is the class the caller will convert to when
2564 calling FN through BINFO. */
2565 for (b
= binfo
; ; b
= get_primary_binfo (b
))
2568 if (look_for_overrides_here (BINFO_TYPE (b
), target_fn
))
2571 /* The nearest definition is from a lost primary. */
2572 if (BINFO_LOST_PRIMARY_P (b
))
2577 /* Find the final overrider. */
2578 overrider
= find_final_overrider (TYPE_BINFO (t
), b
, target_fn
);
2579 if (overrider
== error_mark_node
)
2581 error ("no unique final overrider for %qD in %qT", target_fn
, t
);
2584 overrider_target
= overrider_fn
= TREE_PURPOSE (overrider
);
2586 /* Check for adjusting covariant return types. */
2587 over_return
= TREE_TYPE (TREE_TYPE (overrider_target
));
2588 base_return
= TREE_TYPE (TREE_TYPE (target_fn
));
2590 if (POINTER_TYPE_P (over_return
)
2591 && TREE_CODE (over_return
) == TREE_CODE (base_return
)
2592 && CLASS_TYPE_P (TREE_TYPE (over_return
))
2593 && CLASS_TYPE_P (TREE_TYPE (base_return
))
2594 /* If the overrider is invalid, don't even try. */
2595 && !DECL_INVALID_OVERRIDER_P (overrider_target
))
2597 /* If FN is a covariant thunk, we must figure out the adjustment
2598 to the final base FN was converting to. As OVERRIDER_TARGET might
2599 also be converting to the return type of FN, we have to
2600 combine the two conversions here. */
2601 tree fixed_offset
, virtual_offset
;
2603 over_return
= TREE_TYPE (over_return
);
2604 base_return
= TREE_TYPE (base_return
);
2606 if (DECL_THUNK_P (fn
))
2608 gcc_assert (DECL_RESULT_THUNK_P (fn
));
2609 fixed_offset
= ssize_int (THUNK_FIXED_OFFSET (fn
));
2610 virtual_offset
= THUNK_VIRTUAL_OFFSET (fn
);
2613 fixed_offset
= virtual_offset
= NULL_TREE
;
2616 /* Find the equivalent binfo within the return type of the
2617 overriding function. We will want the vbase offset from
2619 virtual_offset
= binfo_for_vbase (BINFO_TYPE (virtual_offset
),
2621 else if (!same_type_ignoring_top_level_qualifiers_p
2622 (over_return
, base_return
))
2624 /* There was no existing virtual thunk (which takes
2625 precedence). So find the binfo of the base function's
2626 return type within the overriding function's return type.
2627 We cannot call lookup base here, because we're inside a
2628 dfs_walk, and will therefore clobber the BINFO_MARKED
2629 flags. Fortunately we know the covariancy is valid (it
2630 has already been checked), so we can just iterate along
2631 the binfos, which have been chained in inheritance graph
2632 order. Of course it is lame that we have to repeat the
2633 search here anyway -- we should really be caching pieces
2634 of the vtable and avoiding this repeated work. */
2635 tree thunk_binfo
, base_binfo
;
2637 /* Find the base binfo within the overriding function's
2638 return type. We will always find a thunk_binfo, except
2639 when the covariancy is invalid (which we will have
2640 already diagnosed). */
2641 for (base_binfo
= TYPE_BINFO (base_return
),
2642 thunk_binfo
= TYPE_BINFO (over_return
);
2644 thunk_binfo
= TREE_CHAIN (thunk_binfo
))
2645 if (SAME_BINFO_TYPE_P (BINFO_TYPE (thunk_binfo
),
2646 BINFO_TYPE (base_binfo
)))
2649 /* See if virtual inheritance is involved. */
2650 for (virtual_offset
= thunk_binfo
;
2652 virtual_offset
= BINFO_INHERITANCE_CHAIN (virtual_offset
))
2653 if (BINFO_VIRTUAL_P (virtual_offset
))
2657 || (thunk_binfo
&& !BINFO_OFFSET_ZEROP (thunk_binfo
)))
2659 tree offset
= convert (ssizetype
, BINFO_OFFSET (thunk_binfo
));
2663 /* We convert via virtual base. Adjust the fixed
2664 offset to be from there. */
2666 size_diffop (offset
,
2668 BINFO_OFFSET (virtual_offset
)));
2671 /* There was an existing fixed offset, this must be
2672 from the base just converted to, and the base the
2673 FN was thunking to. */
2674 fixed_offset
= size_binop (PLUS_EXPR
, fixed_offset
, offset
);
2676 fixed_offset
= offset
;
2680 if (fixed_offset
|| virtual_offset
)
2681 /* Replace the overriding function with a covariant thunk. We
2682 will emit the overriding function in its own slot as
2684 overrider_fn
= make_thunk (overrider_target
, /*this_adjusting=*/0,
2685 fixed_offset
, virtual_offset
);
2688 gcc_assert (DECL_INVALID_OVERRIDER_P (overrider_target
) ||
2689 !DECL_THUNK_P (fn
));
2691 /* If we need a covariant thunk, then we may need to adjust first_defn.
2692 The ABI specifies that the thunks emitted with a function are
2693 determined by which bases the function overrides, so we need to be
2694 sure that we're using a thunk for some overridden base; even if we
2695 know that the necessary this adjustment is zero, there may not be an
2696 appropriate zero-this-adjusment thunk for us to use since thunks for
2697 overriding virtual bases always use the vcall offset.
2699 Furthermore, just choosing any base that overrides this function isn't
2700 quite right, as this slot won't be used for calls through a type that
2701 puts a covariant thunk here. Calling the function through such a type
2702 will use a different slot, and that slot is the one that determines
2703 the thunk emitted for that base.
2705 So, keep looking until we find the base that we're really overriding
2706 in this slot: the nearest primary base that doesn't use a covariant
2707 thunk in this slot. */
2708 if (overrider_target
!= overrider_fn
)
2710 if (BINFO_TYPE (b
) == DECL_CONTEXT (overrider_target
))
2711 /* We already know that the overrider needs a covariant thunk. */
2712 b
= get_primary_binfo (b
);
2713 for (; ; b
= get_primary_binfo (b
))
2715 tree main_binfo
= TYPE_BINFO (BINFO_TYPE (b
));
2716 tree bv
= chain_index (ix
, BINFO_VIRTUALS (main_binfo
));
2717 if (!DECL_THUNK_P (TREE_VALUE (bv
)))
2719 if (BINFO_LOST_PRIMARY_P (b
))
2725 /* Assume that we will produce a thunk that convert all the way to
2726 the final overrider, and not to an intermediate virtual base. */
2727 virtual_base
= NULL_TREE
;
2729 /* See if we can convert to an intermediate virtual base first, and then
2730 use the vcall offset located there to finish the conversion. */
2731 for (; b
; b
= BINFO_INHERITANCE_CHAIN (b
))
2733 /* If we find the final overrider, then we can stop
2735 if (SAME_BINFO_TYPE_P (BINFO_TYPE (b
),
2736 BINFO_TYPE (TREE_VALUE (overrider
))))
2739 /* If we find a virtual base, and we haven't yet found the
2740 overrider, then there is a virtual base between the
2741 declaring base (first_defn) and the final overrider. */
2742 if (BINFO_VIRTUAL_P (b
))
2749 /* Compute the constant adjustment to the `this' pointer. The
2750 `this' pointer, when this function is called, will point at BINFO
2751 (or one of its primary bases, which are at the same offset). */
2753 /* The `this' pointer needs to be adjusted from the declaration to
2754 the nearest virtual base. */
2755 delta
= size_diffop_loc (input_location
,
2756 convert (ssizetype
, BINFO_OFFSET (virtual_base
)),
2757 convert (ssizetype
, BINFO_OFFSET (first_defn
)));
2759 /* If the nearest definition is in a lost primary, we don't need an
2760 entry in our vtable. Except possibly in a constructor vtable,
2761 if we happen to get our primary back. In that case, the offset
2762 will be zero, as it will be a primary base. */
2763 delta
= size_zero_node
;
2765 /* The `this' pointer needs to be adjusted from pointing to
2766 BINFO to pointing at the base where the final overrider
2768 delta
= size_diffop_loc (input_location
,
2770 BINFO_OFFSET (TREE_VALUE (overrider
))),
2771 convert (ssizetype
, BINFO_OFFSET (binfo
)));
2773 modify_vtable_entry (t
, binfo
, overrider_fn
, delta
, virtuals
);
2776 BV_VCALL_INDEX (*virtuals
)
2777 = get_vcall_index (overrider_target
, BINFO_TYPE (virtual_base
));
2779 BV_VCALL_INDEX (*virtuals
) = NULL_TREE
;
2781 BV_LOST_PRIMARY (*virtuals
) = lost
;
2784 /* Called from modify_all_vtables via dfs_walk. */
2787 dfs_modify_vtables (tree binfo
, void* data
)
2789 tree t
= (tree
) data
;
2794 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
2795 /* A base without a vtable needs no modification, and its bases
2796 are uninteresting. */
2797 return dfs_skip_bases
;
2799 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
)
2800 && !CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
2801 /* Don't do the primary vtable, if it's new. */
2804 if (BINFO_PRIMARY_P (binfo
) && !BINFO_VIRTUAL_P (binfo
))
2805 /* There's no need to modify the vtable for a non-virtual primary
2806 base; we're not going to use that vtable anyhow. We do still
2807 need to do this for virtual primary bases, as they could become
2808 non-primary in a construction vtable. */
2811 make_new_vtable (t
, binfo
);
2813 /* Now, go through each of the virtual functions in the virtual
2814 function table for BINFO. Find the final overrider, and update
2815 the BINFO_VIRTUALS list appropriately. */
2816 for (ix
= 0, virtuals
= BINFO_VIRTUALS (binfo
),
2817 old_virtuals
= BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo
)));
2819 ix
++, virtuals
= TREE_CHAIN (virtuals
),
2820 old_virtuals
= TREE_CHAIN (old_virtuals
))
2821 update_vtable_entry_for_fn (t
,
2823 BV_FN (old_virtuals
),
2829 /* Update all of the primary and secondary vtables for T. Create new
2830 vtables as required, and initialize their RTTI information. Each
2831 of the functions in VIRTUALS is declared in T and may override a
2832 virtual function from a base class; find and modify the appropriate
2833 entries to point to the overriding functions. Returns a list, in
2834 declaration order, of the virtual functions that are declared in T,
2835 but do not appear in the primary base class vtable, and which
2836 should therefore be appended to the end of the vtable for T. */
2839 modify_all_vtables (tree t
, tree virtuals
)
2841 tree binfo
= TYPE_BINFO (t
);
2844 /* Mangle the vtable name before entering dfs_walk (c++/51884). */
2845 if (TYPE_CONTAINS_VPTR_P (t
))
2846 get_vtable_decl (t
, false);
2848 /* Update all of the vtables. */
2849 dfs_walk_once (binfo
, dfs_modify_vtables
, NULL
, t
);
2851 /* Add virtual functions not already in our primary vtable. These
2852 will be both those introduced by this class, and those overridden
2853 from secondary bases. It does not include virtuals merely
2854 inherited from secondary bases. */
2855 for (fnsp
= &virtuals
; *fnsp
; )
2857 tree fn
= TREE_VALUE (*fnsp
);
2859 if (!value_member (fn
, BINFO_VIRTUALS (binfo
))
2860 || DECL_VINDEX (fn
) == error_mark_node
)
2862 /* We don't need to adjust the `this' pointer when
2863 calling this function. */
2864 BV_DELTA (*fnsp
) = integer_zero_node
;
2865 BV_VCALL_INDEX (*fnsp
) = NULL_TREE
;
2867 /* This is a function not already in our vtable. Keep it. */
2868 fnsp
= &TREE_CHAIN (*fnsp
);
2871 /* We've already got an entry for this function. Skip it. */
2872 *fnsp
= TREE_CHAIN (*fnsp
);
2878 /* Get the base virtual function declarations in T that have the
2882 get_basefndecls (tree name
, tree t
, vec
<tree
> *base_fndecls
)
2885 int n_baseclasses
= BINFO_N_BASE_BINFOS (TYPE_BINFO (t
));
2888 /* Find virtual functions in T with the indicated NAME. */
2889 i
= lookup_fnfields_1 (t
, name
);
2890 bool found_decls
= false;
2892 for (methods
= (*CLASSTYPE_METHOD_VEC (t
))[i
];
2894 methods
= OVL_NEXT (methods
))
2896 tree method
= OVL_CURRENT (methods
);
2898 if (TREE_CODE (method
) == FUNCTION_DECL
2899 && DECL_VINDEX (method
))
2901 base_fndecls
->safe_push (method
);
2909 for (i
= 0; i
< n_baseclasses
; i
++)
2911 tree basetype
= BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (t
), i
));
2912 get_basefndecls (name
, basetype
, base_fndecls
);
2916 /* If this declaration supersedes the declaration of
2917 a method declared virtual in the base class, then
2918 mark this field as being virtual as well. */
2921 check_for_override (tree decl
, tree ctype
)
2923 bool overrides_found
= false;
2924 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2925 /* In [temp.mem] we have:
2927 A specialization of a member function template does not
2928 override a virtual function from a base class. */
2930 if ((DECL_DESTRUCTOR_P (decl
)
2931 || IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
))
2932 || DECL_CONV_FN_P (decl
))
2933 && look_for_overrides (ctype
, decl
)
2934 && !DECL_STATIC_FUNCTION_P (decl
))
2935 /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor
2936 the error_mark_node so that we know it is an overriding
2939 DECL_VINDEX (decl
) = decl
;
2940 overrides_found
= true;
2941 if (warn_override
&& !DECL_OVERRIDE_P (decl
)
2942 && !DECL_DESTRUCTOR_P (decl
))
2943 warning_at (DECL_SOURCE_LOCATION (decl
), OPT_Wsuggest_override
,
2944 "%q+D can be marked override", decl
);
2947 if (DECL_VIRTUAL_P (decl
))
2949 if (!DECL_VINDEX (decl
))
2950 DECL_VINDEX (decl
) = error_mark_node
;
2951 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
2952 if (DECL_DESTRUCTOR_P (decl
))
2953 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (ctype
) = true;
2955 else if (DECL_FINAL_P (decl
))
2956 error ("%q+#D marked %<final%>, but is not virtual", decl
);
2957 if (DECL_OVERRIDE_P (decl
) && !overrides_found
)
2958 error ("%q+#D marked %<override%>, but does not override", decl
);
2961 /* Warn about hidden virtual functions that are not overridden in t.
2962 We know that constructors and destructors don't apply. */
2965 warn_hidden (tree t
)
2967 vec
<tree
, va_gc
> *method_vec
= CLASSTYPE_METHOD_VEC (t
);
2971 /* We go through each separately named virtual function. */
2972 for (i
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2973 vec_safe_iterate (method_vec
, i
, &fns
);
2983 /* All functions in this slot in the CLASSTYPE_METHOD_VEC will
2984 have the same name. Figure out what name that is. */
2985 name
= DECL_NAME (OVL_CURRENT (fns
));
2986 /* There are no possibly hidden functions yet. */
2987 auto_vec
<tree
, 20> base_fndecls
;
2988 /* Iterate through all of the base classes looking for possibly
2989 hidden functions. */
2990 for (binfo
= TYPE_BINFO (t
), j
= 0;
2991 BINFO_BASE_ITERATE (binfo
, j
, base_binfo
); j
++)
2993 tree basetype
= BINFO_TYPE (base_binfo
);
2994 get_basefndecls (name
, basetype
, &base_fndecls
);
2997 /* If there are no functions to hide, continue. */
2998 if (base_fndecls
.is_empty ())
3001 /* Remove any overridden functions. */
3002 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
3004 fndecl
= OVL_CURRENT (fn
);
3005 if (TREE_CODE (fndecl
) == FUNCTION_DECL
3006 && DECL_VINDEX (fndecl
))
3008 /* If the method from the base class has the same
3009 signature as the method from the derived class, it
3010 has been overridden. */
3011 for (size_t k
= 0; k
< base_fndecls
.length (); k
++)
3013 && same_signature_p (fndecl
, base_fndecls
[k
]))
3014 base_fndecls
[k
] = NULL_TREE
;
3018 /* Now give a warning for all base functions without overriders,
3019 as they are hidden. */
3022 FOR_EACH_VEC_ELT (base_fndecls
, k
, base_fndecl
)
3025 /* Here we know it is a hider, and no overrider exists. */
3026 warning (OPT_Woverloaded_virtual
, "%q+D was hidden", base_fndecl
);
3027 warning (OPT_Woverloaded_virtual
, " by %q+D", fns
);
3032 /* Recursive helper for finish_struct_anon. */
3035 finish_struct_anon_r (tree field
, bool complain
)
3037 bool is_union
= TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
;
3038 tree elt
= TYPE_FIELDS (TREE_TYPE (field
));
3039 for (; elt
; elt
= DECL_CHAIN (elt
))
3041 /* We're generally only interested in entities the user
3042 declared, but we also find nested classes by noticing
3043 the TYPE_DECL that we create implicitly. You're
3044 allowed to put one anonymous union inside another,
3045 though, so we explicitly tolerate that. We use
3046 TYPE_ANONYMOUS_P rather than ANON_AGGR_TYPE_P so that
3047 we also allow unnamed types used for defining fields. */
3048 if (DECL_ARTIFICIAL (elt
)
3049 && (!DECL_IMPLICIT_TYPEDEF_P (elt
)
3050 || TYPE_ANONYMOUS_P (TREE_TYPE (elt
))))
3053 if (TREE_CODE (elt
) != FIELD_DECL
)
3055 /* We already complained about static data members in
3056 finish_static_data_member_decl. */
3057 if (complain
&& TREE_CODE (elt
) != VAR_DECL
)
3060 permerror (input_location
,
3061 "%q+#D invalid; an anonymous union can "
3062 "only have non-static data members", elt
);
3064 permerror (input_location
,
3065 "%q+#D invalid; an anonymous struct can "
3066 "only have non-static data members", elt
);
3073 if (TREE_PRIVATE (elt
))
3076 permerror (input_location
,
3077 "private member %q+#D in anonymous union", elt
);
3079 permerror (input_location
,
3080 "private member %q+#D in anonymous struct", elt
);
3082 else if (TREE_PROTECTED (elt
))
3085 permerror (input_location
,
3086 "protected member %q+#D in anonymous union", elt
);
3088 permerror (input_location
,
3089 "protected member %q+#D in anonymous struct", elt
);
3093 TREE_PRIVATE (elt
) = TREE_PRIVATE (field
);
3094 TREE_PROTECTED (elt
) = TREE_PROTECTED (field
);
3096 /* Recurse into the anonymous aggregates to handle correctly
3097 access control (c++/24926):
3108 if (DECL_NAME (elt
) == NULL_TREE
3109 && ANON_AGGR_TYPE_P (TREE_TYPE (elt
)))
3110 finish_struct_anon_r (elt
, /*complain=*/false);
3114 /* Check for things that are invalid. There are probably plenty of other
3115 things we should check for also. */
3118 finish_struct_anon (tree t
)
3120 for (tree field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
3122 if (TREE_STATIC (field
))
3124 if (TREE_CODE (field
) != FIELD_DECL
)
3127 if (DECL_NAME (field
) == NULL_TREE
3128 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
3129 finish_struct_anon_r (field
, /*complain=*/true);
3133 /* Add T to CLASSTYPE_DECL_LIST of current_class_type which
3134 will be used later during class template instantiation.
3135 When FRIEND_P is zero, T can be a static member data (VAR_DECL),
3136 a non-static member data (FIELD_DECL), a member function
3137 (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE),
3138 a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL)
3139 When FRIEND_P is nonzero, T is either a friend class
3140 (RECORD_TYPE, TEMPLATE_DECL) or a friend function
3141 (FUNCTION_DECL, TEMPLATE_DECL). */
3144 maybe_add_class_template_decl_list (tree type
, tree t
, int friend_p
)
3146 /* Save some memory by not creating TREE_LIST if TYPE is not template. */
3147 if (CLASSTYPE_TEMPLATE_INFO (type
))
3148 CLASSTYPE_DECL_LIST (type
)
3149 = tree_cons (friend_p
? NULL_TREE
: type
,
3150 t
, CLASSTYPE_DECL_LIST (type
));
3153 /* This function is called from declare_virt_assop_and_dtor via
3156 DATA is a type that direcly or indirectly inherits the base
3157 represented by BINFO. If BINFO contains a virtual assignment [copy
3158 assignment or move assigment] operator or a virtual constructor,
3159 declare that function in DATA if it hasn't been already declared. */
3162 dfs_declare_virt_assop_and_dtor (tree binfo
, void *data
)
3164 tree bv
, fn
, t
= (tree
)data
;
3165 tree opname
= ansi_assopname (NOP_EXPR
);
3167 gcc_assert (t
&& CLASS_TYPE_P (t
));
3168 gcc_assert (binfo
&& TREE_CODE (binfo
) == TREE_BINFO
);
3170 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
3171 /* A base without a vtable needs no modification, and its bases
3172 are uninteresting. */
3173 return dfs_skip_bases
;
3175 if (BINFO_PRIMARY_P (binfo
))
3176 /* If this is a primary base, then we have already looked at the
3177 virtual functions of its vtable. */
3180 for (bv
= BINFO_VIRTUALS (binfo
); bv
; bv
= TREE_CHAIN (bv
))
3184 if (DECL_NAME (fn
) == opname
)
3186 if (CLASSTYPE_LAZY_COPY_ASSIGN (t
))
3187 lazily_declare_fn (sfk_copy_assignment
, t
);
3188 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
3189 lazily_declare_fn (sfk_move_assignment
, t
);
3191 else if (DECL_DESTRUCTOR_P (fn
)
3192 && CLASSTYPE_LAZY_DESTRUCTOR (t
))
3193 lazily_declare_fn (sfk_destructor
, t
);
3199 /* If the class type T has a direct or indirect base that contains a
3200 virtual assignment operator or a virtual destructor, declare that
3201 function in T if it hasn't been already declared. */
3204 declare_virt_assop_and_dtor (tree t
)
3206 if (!(TYPE_POLYMORPHIC_P (t
)
3207 && (CLASSTYPE_LAZY_COPY_ASSIGN (t
)
3208 || CLASSTYPE_LAZY_MOVE_ASSIGN (t
)
3209 || CLASSTYPE_LAZY_DESTRUCTOR (t
))))
3212 dfs_walk_all (TYPE_BINFO (t
),
3213 dfs_declare_virt_assop_and_dtor
,
3217 /* Declare the inheriting constructor for class T inherited from base
3218 constructor CTOR with the parameter array PARMS of size NPARMS. */
3221 one_inheriting_sig (tree t
, tree ctor
, tree
*parms
, int nparms
)
3223 /* We don't declare an inheriting ctor that would be a default,
3224 copy or move ctor for derived or base. */
3228 && TREE_CODE (parms
[0]) == REFERENCE_TYPE
)
3230 tree parm
= TYPE_MAIN_VARIANT (TREE_TYPE (parms
[0]));
3231 if (parm
== t
|| parm
== DECL_CONTEXT (ctor
))
3235 tree parmlist
= void_list_node
;
3236 for (int i
= nparms
- 1; i
>= 0; i
--)
3237 parmlist
= tree_cons (NULL_TREE
, parms
[i
], parmlist
);
3238 tree fn
= implicitly_declare_fn (sfk_inheriting_constructor
,
3239 t
, false, ctor
, parmlist
);
3240 gcc_assert (TYPE_MAIN_VARIANT (t
) == t
);
3241 if (add_method (t
, fn
, NULL_TREE
))
3243 DECL_CHAIN (fn
) = TYPE_METHODS (t
);
3244 TYPE_METHODS (t
) = fn
;
3248 /* Declare all the inheriting constructors for class T inherited from base
3249 constructor CTOR. */
3252 one_inherited_ctor (tree ctor
, tree t
)
3254 tree parms
= FUNCTION_FIRST_USER_PARMTYPE (ctor
);
3256 tree
*new_parms
= XALLOCAVEC (tree
, list_length (parms
));
3258 for (; parms
&& parms
!= void_list_node
; parms
= TREE_CHAIN (parms
))
3260 if (TREE_PURPOSE (parms
))
3261 one_inheriting_sig (t
, ctor
, new_parms
, i
);
3262 new_parms
[i
++] = TREE_VALUE (parms
);
3264 one_inheriting_sig (t
, ctor
, new_parms
, i
);
3265 if (parms
== NULL_TREE
)
3267 if (warning (OPT_Winherited_variadic_ctor
,
3268 "the ellipsis in %qD is not inherited", ctor
))
3269 inform (DECL_SOURCE_LOCATION (ctor
), "%qD declared here", ctor
);
3273 /* Create default constructors, assignment operators, and so forth for
3274 the type indicated by T, if they are needed. CANT_HAVE_CONST_CTOR,
3275 and CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason,
3276 the class cannot have a default constructor, copy constructor
3277 taking a const reference argument, or an assignment operator taking
3278 a const reference, respectively. */
3281 add_implicitly_declared_members (tree t
, tree
* access_decls
,
3282 int cant_have_const_cctor
,
3283 int cant_have_const_assignment
)
3285 bool move_ok
= false;
3287 if (cxx_dialect
>= cxx11
&& !CLASSTYPE_DESTRUCTORS (t
)
3288 && !TYPE_HAS_COPY_CTOR (t
) && !TYPE_HAS_COPY_ASSIGN (t
)
3289 && !type_has_move_constructor (t
) && !type_has_move_assign (t
))
3293 if (!CLASSTYPE_DESTRUCTORS (t
))
3295 /* In general, we create destructors lazily. */
3296 CLASSTYPE_LAZY_DESTRUCTOR (t
) = 1;
3298 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3299 && TYPE_FOR_JAVA (t
))
3300 /* But if this is a Java class, any non-trivial destructor is
3301 invalid, even if compiler-generated. Therefore, if the
3302 destructor is non-trivial we create it now. */
3303 lazily_declare_fn (sfk_destructor
, t
);
3308 If there is no user-declared constructor for a class, a default
3309 constructor is implicitly declared. */
3310 if (! TYPE_HAS_USER_CONSTRUCTOR (t
))
3312 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 1;
3313 CLASSTYPE_LAZY_DEFAULT_CTOR (t
) = 1;
3314 if (cxx_dialect
>= cxx11
)
3315 TYPE_HAS_CONSTEXPR_CTOR (t
)
3316 /* This might force the declaration. */
3317 = type_has_constexpr_default_constructor (t
);
3322 If a class definition does not explicitly declare a copy
3323 constructor, one is declared implicitly. */
3324 if (! TYPE_HAS_COPY_CTOR (t
) && ! TYPE_FOR_JAVA (t
))
3326 TYPE_HAS_COPY_CTOR (t
) = 1;
3327 TYPE_HAS_CONST_COPY_CTOR (t
) = !cant_have_const_cctor
;
3328 CLASSTYPE_LAZY_COPY_CTOR (t
) = 1;
3330 CLASSTYPE_LAZY_MOVE_CTOR (t
) = 1;
3333 /* If there is no assignment operator, one will be created if and
3334 when it is needed. For now, just record whether or not the type
3335 of the parameter to the assignment operator will be a const or
3336 non-const reference. */
3337 if (!TYPE_HAS_COPY_ASSIGN (t
) && !TYPE_FOR_JAVA (t
))
3339 TYPE_HAS_COPY_ASSIGN (t
) = 1;
3340 TYPE_HAS_CONST_COPY_ASSIGN (t
) = !cant_have_const_assignment
;
3341 CLASSTYPE_LAZY_COPY_ASSIGN (t
) = 1;
3342 if (move_ok
&& !LAMBDA_TYPE_P (t
))
3343 CLASSTYPE_LAZY_MOVE_ASSIGN (t
) = 1;
3346 /* We can't be lazy about declaring functions that might override
3347 a virtual function from a base class. */
3348 declare_virt_assop_and_dtor (t
);
3350 while (*access_decls
)
3352 tree using_decl
= TREE_VALUE (*access_decls
);
3353 tree decl
= USING_DECL_DECLS (using_decl
);
3354 if (DECL_NAME (using_decl
) == ctor_identifier
)
3356 /* declare, then remove the decl */
3357 tree ctor_list
= decl
;
3358 location_t loc
= input_location
;
3359 input_location
= DECL_SOURCE_LOCATION (using_decl
);
3361 for (; ctor_list
; ctor_list
= OVL_NEXT (ctor_list
))
3362 one_inherited_ctor (OVL_CURRENT (ctor_list
), t
);
3363 *access_decls
= TREE_CHAIN (*access_decls
);
3364 input_location
= loc
;
3367 access_decls
= &TREE_CHAIN (*access_decls
);
3371 /* Subroutine of insert_into_classtype_sorted_fields. Recursively
3372 count the number of fields in TYPE, including anonymous union
3376 count_fields (tree fields
)
3380 for (x
= fields
; x
; x
= DECL_CHAIN (x
))
3382 if (TREE_CODE (x
) == FIELD_DECL
&& ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
3383 n_fields
+= count_fields (TYPE_FIELDS (TREE_TYPE (x
)));
3390 /* Subroutine of insert_into_classtype_sorted_fields. Recursively add
3391 all the fields in the TREE_LIST FIELDS to the SORTED_FIELDS_TYPE
3392 elts, starting at offset IDX. */
3395 add_fields_to_record_type (tree fields
, struct sorted_fields_type
*field_vec
, int idx
)
3398 for (x
= fields
; x
; x
= DECL_CHAIN (x
))
3400 if (TREE_CODE (x
) == FIELD_DECL
&& ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
3401 idx
= add_fields_to_record_type (TYPE_FIELDS (TREE_TYPE (x
)), field_vec
, idx
);
3403 field_vec
->elts
[idx
++] = x
;
3408 /* Add all of the enum values of ENUMTYPE, to the FIELD_VEC elts,
3409 starting at offset IDX. */
3412 add_enum_fields_to_record_type (tree enumtype
,
3413 struct sorted_fields_type
*field_vec
,
3417 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
3418 field_vec
->elts
[idx
++] = TREE_VALUE (values
);
3422 /* FIELD is a bit-field. We are finishing the processing for its
3423 enclosing type. Issue any appropriate messages and set appropriate
3424 flags. Returns false if an error has been diagnosed. */
3427 check_bitfield_decl (tree field
)
3429 tree type
= TREE_TYPE (field
);
3432 /* Extract the declared width of the bitfield, which has been
3433 temporarily stashed in DECL_INITIAL. */
3434 w
= DECL_INITIAL (field
);
3435 gcc_assert (w
!= NULL_TREE
);
3436 /* Remove the bit-field width indicator so that the rest of the
3437 compiler does not treat that value as an initializer. */
3438 DECL_INITIAL (field
) = NULL_TREE
;
3440 /* Detect invalid bit-field type. */
3441 if (!INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
3443 error ("bit-field %q+#D with non-integral type", field
);
3444 w
= error_mark_node
;
3448 location_t loc
= input_location
;
3449 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
3452 /* detect invalid field size. */
3453 input_location
= DECL_SOURCE_LOCATION (field
);
3454 w
= cxx_constant_value (w
);
3455 input_location
= loc
;
3457 if (TREE_CODE (w
) != INTEGER_CST
)
3459 error ("bit-field %q+D width not an integer constant", field
);
3460 w
= error_mark_node
;
3462 else if (tree_int_cst_sgn (w
) < 0)
3464 error ("negative width in bit-field %q+D", field
);
3465 w
= error_mark_node
;
3467 else if (integer_zerop (w
) && DECL_NAME (field
) != 0)
3469 error ("zero width for bit-field %q+D", field
);
3470 w
= error_mark_node
;
3472 else if ((TREE_CODE (type
) != ENUMERAL_TYPE
3473 && TREE_CODE (type
) != BOOLEAN_TYPE
3474 && compare_tree_int (w
, TYPE_PRECISION (type
)) > 0)
3475 || ((TREE_CODE (type
) == ENUMERAL_TYPE
3476 || TREE_CODE (type
) == BOOLEAN_TYPE
)
3477 && tree_int_cst_lt (TYPE_SIZE (type
), w
)))
3478 warning (0, "width of %q+D exceeds its type", field
);
3479 else if (TREE_CODE (type
) == ENUMERAL_TYPE
3480 && (0 > (compare_tree_int
3481 (w
, TYPE_PRECISION (ENUM_UNDERLYING_TYPE (type
))))))
3482 warning (0, "%q+D is too small to hold all values of %q#T", field
, type
);
3485 if (w
!= error_mark_node
)
3487 DECL_SIZE (field
) = convert (bitsizetype
, w
);
3488 DECL_BIT_FIELD (field
) = 1;
3493 /* Non-bit-fields are aligned for their type. */
3494 DECL_BIT_FIELD (field
) = 0;
3495 CLEAR_DECL_C_BIT_FIELD (field
);
3500 /* FIELD is a non bit-field. We are finishing the processing for its
3501 enclosing type T. Issue any appropriate messages and set appropriate
3505 check_field_decl (tree field
,
3507 int* cant_have_const_ctor
,
3508 int* no_const_asn_ref
,
3509 int* any_default_members
)
3511 tree type
= strip_array_types (TREE_TYPE (field
));
3513 /* In C++98 an anonymous union cannot contain any fields which would change
3514 the settings of CANT_HAVE_CONST_CTOR and friends. */
3515 if (ANON_UNION_TYPE_P (type
) && cxx_dialect
< cxx11
)
3517 /* And, we don't set TYPE_HAS_CONST_COPY_CTOR, etc., for anonymous
3518 structs. So, we recurse through their fields here. */
3519 else if (ANON_AGGR_TYPE_P (type
))
3523 for (fields
= TYPE_FIELDS (type
); fields
; fields
= DECL_CHAIN (fields
))
3524 if (TREE_CODE (fields
) == FIELD_DECL
&& !DECL_C_BIT_FIELD (field
))
3525 check_field_decl (fields
, t
, cant_have_const_ctor
,
3526 no_const_asn_ref
, any_default_members
);
3528 /* Check members with class type for constructors, destructors,
3530 else if (CLASS_TYPE_P (type
))
3532 /* Never let anything with uninheritable virtuals
3533 make it through without complaint. */
3534 abstract_virtuals_error (field
, type
);
3536 if (TREE_CODE (t
) == UNION_TYPE
&& cxx_dialect
< cxx11
)
3539 int oldcount
= errorcount
;
3540 if (TYPE_NEEDS_CONSTRUCTING (type
))
3541 error ("member %q+#D with constructor not allowed in union",
3543 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
3544 error ("member %q+#D with destructor not allowed in union", field
);
3545 if (TYPE_HAS_COMPLEX_COPY_ASSIGN (type
))
3546 error ("member %q+#D with copy assignment operator not allowed in union",
3548 if (!warned
&& errorcount
> oldcount
)
3550 inform (DECL_SOURCE_LOCATION (field
), "unrestricted unions "
3551 "only available with -std=c++11 or -std=gnu++11");
3557 TYPE_NEEDS_CONSTRUCTING (t
) |= TYPE_NEEDS_CONSTRUCTING (type
);
3558 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3559 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
);
3560 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
)
3561 |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (type
)
3562 || !TYPE_HAS_COPY_ASSIGN (type
));
3563 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= (TYPE_HAS_COMPLEX_COPY_CTOR (type
)
3564 || !TYPE_HAS_COPY_CTOR (type
));
3565 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (type
);
3566 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_HAS_COMPLEX_MOVE_CTOR (type
);
3567 TYPE_HAS_COMPLEX_DFLT (t
) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (type
)
3568 || TYPE_HAS_COMPLEX_DFLT (type
));
3571 if (TYPE_HAS_COPY_CTOR (type
)
3572 && !TYPE_HAS_CONST_COPY_CTOR (type
))
3573 *cant_have_const_ctor
= 1;
3575 if (TYPE_HAS_COPY_ASSIGN (type
)
3576 && !TYPE_HAS_CONST_COPY_ASSIGN (type
))
3577 *no_const_asn_ref
= 1;
3580 check_abi_tags (t
, field
);
3582 if (DECL_INITIAL (field
) != NULL_TREE
)
3584 /* `build_class_init_list' does not recognize
3586 if (TREE_CODE (t
) == UNION_TYPE
&& *any_default_members
!= 0)
3587 error ("multiple fields in union %qT initialized", t
);
3588 *any_default_members
= 1;
3592 /* Check the data members (both static and non-static), class-scoped
3593 typedefs, etc., appearing in the declaration of T. Issue
3594 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
3595 declaration order) of access declarations; each TREE_VALUE in this
3596 list is a USING_DECL.
3598 In addition, set the following flags:
3601 The class is empty, i.e., contains no non-static data members.
3603 CANT_HAVE_CONST_CTOR_P
3604 This class cannot have an implicitly generated copy constructor
3605 taking a const reference.
3607 CANT_HAVE_CONST_ASN_REF
3608 This class cannot have an implicitly generated assignment
3609 operator taking a const reference.
3611 All of these flags should be initialized before calling this
3614 Returns a pointer to the end of the TYPE_FIELDs chain; additional
3615 fields can be added by adding to this chain. */
3618 check_field_decls (tree t
, tree
*access_decls
,
3619 int *cant_have_const_ctor_p
,
3620 int *no_const_asn_ref_p
)
3625 int any_default_members
;
3627 int field_access
= -1;
3629 /* Assume there are no access declarations. */
3630 *access_decls
= NULL_TREE
;
3631 /* Assume this class has no pointer members. */
3632 has_pointers
= false;
3633 /* Assume none of the members of this class have default
3635 any_default_members
= 0;
3637 for (field
= &TYPE_FIELDS (t
); *field
; field
= next
)
3640 tree type
= TREE_TYPE (x
);
3641 int this_field_access
;
3643 next
= &DECL_CHAIN (x
);
3645 if (TREE_CODE (x
) == USING_DECL
)
3647 /* Save the access declarations for our caller. */
3648 *access_decls
= tree_cons (NULL_TREE
, x
, *access_decls
);
3652 if (TREE_CODE (x
) == TYPE_DECL
3653 || TREE_CODE (x
) == TEMPLATE_DECL
)
3656 /* If we've gotten this far, it's a data member, possibly static,
3657 or an enumerator. */
3658 if (TREE_CODE (x
) != CONST_DECL
)
3659 DECL_CONTEXT (x
) = t
;
3661 /* When this goes into scope, it will be a non-local reference. */
3662 DECL_NONLOCAL (x
) = 1;
3664 if (TREE_CODE (t
) == UNION_TYPE
3665 && cxx_dialect
< cxx11
)
3667 /* [class.union] (C++98)
3669 If a union contains a static data member, or a member of
3670 reference type, the program is ill-formed.
3672 In C++11 this limitation doesn't exist anymore. */
3675 error ("in C++98 %q+D may not be static because it is "
3676 "a member of a union", x
);
3679 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3681 error ("in C++98 %q+D may not have reference type %qT "
3682 "because it is a member of a union", x
, type
);
3687 /* Perform error checking that did not get done in
3689 if (TREE_CODE (type
) == FUNCTION_TYPE
)
3691 error ("field %q+D invalidly declared function type", x
);
3692 type
= build_pointer_type (type
);
3693 TREE_TYPE (x
) = type
;
3695 else if (TREE_CODE (type
) == METHOD_TYPE
)
3697 error ("field %q+D invalidly declared method type", x
);
3698 type
= build_pointer_type (type
);
3699 TREE_TYPE (x
) = type
;
3702 if (type
== error_mark_node
)
3705 if (TREE_CODE (x
) == CONST_DECL
|| VAR_P (x
))
3708 /* Now it can only be a FIELD_DECL. */
3710 if (TREE_PRIVATE (x
) || TREE_PROTECTED (x
))
3711 CLASSTYPE_NON_AGGREGATE (t
) = 1;
3713 /* If at least one non-static data member is non-literal, the whole
3714 class becomes non-literal. Per Core/1453, volatile non-static
3715 data members and base classes are also not allowed.
3716 Note: if the type is incomplete we will complain later on. */
3717 if (COMPLETE_TYPE_P (type
)
3718 && (!literal_type_p (type
) || CP_TYPE_VOLATILE_P (type
)))
3719 CLASSTYPE_LITERAL_P (t
) = false;
3721 /* A standard-layout class is a class that:
3723 has the same access control (Clause 11) for all non-static data members,
3725 this_field_access
= TREE_PROTECTED (x
) ? 1 : TREE_PRIVATE (x
) ? 2 : 0;
3726 if (field_access
== -1)
3727 field_access
= this_field_access
;
3728 else if (this_field_access
!= field_access
)
3729 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3731 /* If this is of reference type, check if it needs an init. */
3732 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3734 CLASSTYPE_NON_LAYOUT_POD_P (t
) = 1;
3735 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3736 if (DECL_INITIAL (x
) == NULL_TREE
)
3737 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t
, 1);
3738 if (cxx_dialect
< cxx11
)
3740 /* ARM $12.6.2: [A member initializer list] (or, for an
3741 aggregate, initialization by a brace-enclosed list) is the
3742 only way to initialize nonstatic const and reference
3744 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
3745 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) = 1;
3749 type
= strip_array_types (type
);
3751 if (TYPE_PACKED (t
))
3753 if (!layout_pod_type_p (type
) && !TYPE_PACKED (type
))
3757 "ignoring packed attribute because of unpacked non-POD field %q+#D",
3761 else if (DECL_C_BIT_FIELD (x
)
3762 || TYPE_ALIGN (TREE_TYPE (x
)) > BITS_PER_UNIT
)
3763 DECL_PACKED (x
) = 1;
3766 if (DECL_C_BIT_FIELD (x
) && integer_zerop (DECL_INITIAL (x
)))
3767 /* We don't treat zero-width bitfields as making a class
3772 /* The class is non-empty. */
3773 CLASSTYPE_EMPTY_P (t
) = 0;
3774 /* The class is not even nearly empty. */
3775 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
3776 /* If one of the data members contains an empty class,
3778 if (CLASS_TYPE_P (type
)
3779 && CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type
))
3780 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 1;
3783 /* This is used by -Weffc++ (see below). Warn only for pointers
3784 to members which might hold dynamic memory. So do not warn
3785 for pointers to functions or pointers to members. */
3786 if (TYPE_PTR_P (type
)
3787 && !TYPE_PTRFN_P (type
))
3788 has_pointers
= true;
3790 if (CLASS_TYPE_P (type
))
3792 if (CLASSTYPE_REF_FIELDS_NEED_INIT (type
))
3793 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t
, 1);
3794 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (type
))
3795 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
, 1);
3798 if (DECL_MUTABLE_P (x
) || TYPE_HAS_MUTABLE_P (type
))
3799 CLASSTYPE_HAS_MUTABLE (t
) = 1;
3801 if (DECL_MUTABLE_P (x
))
3803 if (CP_TYPE_CONST_P (type
))
3805 error ("member %q+D cannot be declared both %<const%> "
3806 "and %<mutable%>", x
);
3809 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3811 error ("member %q+D cannot be declared as a %<mutable%> "
3817 if (! layout_pod_type_p (type
))
3818 /* DR 148 now allows pointers to members (which are POD themselves),
3819 to be allowed in POD structs. */
3820 CLASSTYPE_NON_LAYOUT_POD_P (t
) = 1;
3822 if (!std_layout_type_p (type
))
3823 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3825 if (! zero_init_p (type
))
3826 CLASSTYPE_NON_ZERO_INIT_P (t
) = 1;
3828 /* We set DECL_C_BIT_FIELD in grokbitfield.
3829 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
3830 if (! DECL_C_BIT_FIELD (x
) || ! check_bitfield_decl (x
))
3831 check_field_decl (x
, t
,
3832 cant_have_const_ctor_p
,
3834 &any_default_members
);
3836 /* Now that we've removed bit-field widths from DECL_INITIAL,
3837 anything left in DECL_INITIAL is an NSDMI that makes the class
3838 non-aggregate in C++11. */
3839 if (DECL_INITIAL (x
) && cxx_dialect
< cxx14
)
3840 CLASSTYPE_NON_AGGREGATE (t
) = true;
3842 /* If any field is const, the structure type is pseudo-const. */
3843 if (CP_TYPE_CONST_P (type
))
3845 C_TYPE_FIELDS_READONLY (t
) = 1;
3846 if (DECL_INITIAL (x
) == NULL_TREE
)
3847 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
, 1);
3848 if (cxx_dialect
< cxx11
)
3850 /* ARM $12.6.2: [A member initializer list] (or, for an
3851 aggregate, initialization by a brace-enclosed list) is the
3852 only way to initialize nonstatic const and reference
3854 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
3855 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) = 1;
3858 /* A field that is pseudo-const makes the structure likewise. */
3859 else if (CLASS_TYPE_P (type
))
3861 C_TYPE_FIELDS_READONLY (t
) |= C_TYPE_FIELDS_READONLY (type
);
3862 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
,
3863 CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
)
3864 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (type
));
3867 /* Core issue 80: A nonstatic data member is required to have a
3868 different name from the class iff the class has a
3869 user-declared constructor. */
3870 if (constructor_name_p (DECL_NAME (x
), t
)
3871 && TYPE_HAS_USER_CONSTRUCTOR (t
))
3872 permerror (input_location
, "field %q+#D with same name as class", x
);
3875 /* Effective C++ rule 11: if a class has dynamic memory held by pointers,
3876 it should also define a copy constructor and an assignment operator to
3877 implement the correct copy semantic (deep vs shallow, etc.). As it is
3878 not feasible to check whether the constructors do allocate dynamic memory
3879 and store it within members, we approximate the warning like this:
3881 -- Warn only if there are members which are pointers
3882 -- Warn only if there is a non-trivial constructor (otherwise,
3883 there cannot be memory allocated).
3884 -- Warn only if there is a non-trivial destructor. We assume that the
3885 user at least implemented the cleanup correctly, and a destructor
3886 is needed to free dynamic memory.
3888 This seems enough for practical purposes. */
3891 && TYPE_HAS_USER_CONSTRUCTOR (t
)
3892 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3893 && !(TYPE_HAS_COPY_CTOR (t
) && TYPE_HAS_COPY_ASSIGN (t
)))
3895 warning (OPT_Weffc__
, "%q#T has pointer data members", t
);
3897 if (! TYPE_HAS_COPY_CTOR (t
))
3899 warning (OPT_Weffc__
,
3900 " but does not override %<%T(const %T&)%>", t
, t
);
3901 if (!TYPE_HAS_COPY_ASSIGN (t
))
3902 warning (OPT_Weffc__
, " or %<operator=(const %T&)%>", t
);
3904 else if (! TYPE_HAS_COPY_ASSIGN (t
))
3905 warning (OPT_Weffc__
,
3906 " but does not override %<operator=(const %T&)%>", t
);
3909 /* Non-static data member initializers make the default constructor
3911 if (any_default_members
)
3913 TYPE_NEEDS_CONSTRUCTING (t
) = true;
3914 TYPE_HAS_COMPLEX_DFLT (t
) = true;
3917 /* If any of the fields couldn't be packed, unset TYPE_PACKED. */
3919 TYPE_PACKED (t
) = 0;
3921 /* Check anonymous struct/anonymous union fields. */
3922 finish_struct_anon (t
);
3924 /* We've built up the list of access declarations in reverse order.
3926 *access_decls
= nreverse (*access_decls
);
3929 /* If TYPE is an empty class type, records its OFFSET in the table of
3933 record_subobject_offset (tree type
, tree offset
, splay_tree offsets
)
3937 if (!is_empty_class (type
))
3940 /* Record the location of this empty object in OFFSETS. */
3941 n
= splay_tree_lookup (offsets
, (splay_tree_key
) offset
);
3943 n
= splay_tree_insert (offsets
,
3944 (splay_tree_key
) offset
,
3945 (splay_tree_value
) NULL_TREE
);
3946 n
->value
= ((splay_tree_value
)
3947 tree_cons (NULL_TREE
,
3954 /* Returns nonzero if TYPE is an empty class type and there is
3955 already an entry in OFFSETS for the same TYPE as the same OFFSET. */
3958 check_subobject_offset (tree type
, tree offset
, splay_tree offsets
)
3963 if (!is_empty_class (type
))
3966 /* Record the location of this empty object in OFFSETS. */
3967 n
= splay_tree_lookup (offsets
, (splay_tree_key
) offset
);
3971 for (t
= (tree
) n
->value
; t
; t
= TREE_CHAIN (t
))
3972 if (same_type_p (TREE_VALUE (t
), type
))
3978 /* Walk through all the subobjects of TYPE (located at OFFSET). Call
3979 F for every subobject, passing it the type, offset, and table of
3980 OFFSETS. If VBASES_P is one, then virtual non-primary bases should
3983 If MAX_OFFSET is non-NULL, then subobjects with an offset greater
3984 than MAX_OFFSET will not be walked.
3986 If F returns a nonzero value, the traversal ceases, and that value
3987 is returned. Otherwise, returns zero. */
3990 walk_subobject_offsets (tree type
,
3991 subobject_offset_fn f
,
3998 tree type_binfo
= NULL_TREE
;
4000 /* If this OFFSET is bigger than the MAX_OFFSET, then we should
4002 if (max_offset
&& tree_int_cst_lt (max_offset
, offset
))
4005 if (type
== error_mark_node
)
4011 type
= BINFO_TYPE (type
);
4014 if (CLASS_TYPE_P (type
))
4020 /* Avoid recursing into objects that are not interesting. */
4021 if (!CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type
))
4024 /* Record the location of TYPE. */
4025 r
= (*f
) (type
, offset
, offsets
);
4029 /* Iterate through the direct base classes of TYPE. */
4031 type_binfo
= TYPE_BINFO (type
);
4032 for (i
= 0; BINFO_BASE_ITERATE (type_binfo
, i
, binfo
); i
++)
4036 if (BINFO_VIRTUAL_P (binfo
))
4040 /* We cannot rely on BINFO_OFFSET being set for the base
4041 class yet, but the offsets for direct non-virtual
4042 bases can be calculated by going back to the TYPE. */
4043 orig_binfo
= BINFO_BASE_BINFO (TYPE_BINFO (type
), i
);
4044 binfo_offset
= size_binop (PLUS_EXPR
,
4046 BINFO_OFFSET (orig_binfo
));
4048 r
= walk_subobject_offsets (binfo
,
4058 if (CLASSTYPE_VBASECLASSES (type
))
4061 vec
<tree
, va_gc
> *vbases
;
4063 /* Iterate through the virtual base classes of TYPE. In G++
4064 3.2, we included virtual bases in the direct base class
4065 loop above, which results in incorrect results; the
4066 correct offsets for virtual bases are only known when
4067 working with the most derived type. */
4069 for (vbases
= CLASSTYPE_VBASECLASSES (type
), ix
= 0;
4070 vec_safe_iterate (vbases
, ix
, &binfo
); ix
++)
4072 r
= walk_subobject_offsets (binfo
,
4074 size_binop (PLUS_EXPR
,
4076 BINFO_OFFSET (binfo
)),
4085 /* We still have to walk the primary base, if it is
4086 virtual. (If it is non-virtual, then it was walked
4088 tree vbase
= get_primary_binfo (type_binfo
);
4090 if (vbase
&& BINFO_VIRTUAL_P (vbase
)
4091 && BINFO_PRIMARY_P (vbase
)
4092 && BINFO_INHERITANCE_CHAIN (vbase
) == type_binfo
)
4094 r
= (walk_subobject_offsets
4096 offsets
, max_offset
, /*vbases_p=*/0));
4103 /* Iterate through the fields of TYPE. */
4104 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
4105 if (TREE_CODE (field
) == FIELD_DECL
4106 && TREE_TYPE (field
) != error_mark_node
4107 && !DECL_ARTIFICIAL (field
))
4111 field_offset
= byte_position (field
);
4113 r
= walk_subobject_offsets (TREE_TYPE (field
),
4115 size_binop (PLUS_EXPR
,
4125 else if (TREE_CODE (type
) == ARRAY_TYPE
)
4127 tree element_type
= strip_array_types (type
);
4128 tree domain
= TYPE_DOMAIN (type
);
4131 /* Avoid recursing into objects that are not interesting. */
4132 if (!CLASS_TYPE_P (element_type
)
4133 || !CLASSTYPE_CONTAINS_EMPTY_CLASS_P (element_type
))
4136 /* Step through each of the elements in the array. */
4137 for (index
= size_zero_node
;
4138 !tree_int_cst_lt (TYPE_MAX_VALUE (domain
), index
);
4139 index
= size_binop (PLUS_EXPR
, index
, size_one_node
))
4141 r
= walk_subobject_offsets (TREE_TYPE (type
),
4149 offset
= size_binop (PLUS_EXPR
, offset
,
4150 TYPE_SIZE_UNIT (TREE_TYPE (type
)));
4151 /* If this new OFFSET is bigger than the MAX_OFFSET, then
4152 there's no point in iterating through the remaining
4153 elements of the array. */
4154 if (max_offset
&& tree_int_cst_lt (max_offset
, offset
))
4162 /* Record all of the empty subobjects of TYPE (either a type or a
4163 binfo). If IS_DATA_MEMBER is true, then a non-static data member
4164 is being placed at OFFSET; otherwise, it is a base class that is
4165 being placed at OFFSET. */
4168 record_subobject_offsets (tree type
,
4171 bool is_data_member
)
4174 /* If recording subobjects for a non-static data member or a
4175 non-empty base class , we do not need to record offsets beyond
4176 the size of the biggest empty class. Additional data members
4177 will go at the end of the class. Additional base classes will go
4178 either at offset zero (if empty, in which case they cannot
4179 overlap with offsets past the size of the biggest empty class) or
4180 at the end of the class.
4182 However, if we are placing an empty base class, then we must record
4183 all offsets, as either the empty class is at offset zero (where
4184 other empty classes might later be placed) or at the end of the
4185 class (where other objects might then be placed, so other empty
4186 subobjects might later overlap). */
4188 || !is_empty_class (BINFO_TYPE (type
)))
4189 max_offset
= sizeof_biggest_empty_class
;
4191 max_offset
= NULL_TREE
;
4192 walk_subobject_offsets (type
, record_subobject_offset
, offset
,
4193 offsets
, max_offset
, is_data_member
);
4196 /* Returns nonzero if any of the empty subobjects of TYPE (located at
4197 OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero,
4198 virtual bases of TYPE are examined. */
4201 layout_conflict_p (tree type
,
4206 splay_tree_node max_node
;
4208 /* Get the node in OFFSETS that indicates the maximum offset where
4209 an empty subobject is located. */
4210 max_node
= splay_tree_max (offsets
);
4211 /* If there aren't any empty subobjects, then there's no point in
4212 performing this check. */
4216 return walk_subobject_offsets (type
, check_subobject_offset
, offset
,
4217 offsets
, (tree
) (max_node
->key
),
4221 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
4222 non-static data member of the type indicated by RLI. BINFO is the
4223 binfo corresponding to the base subobject, OFFSETS maps offsets to
4224 types already located at those offsets. This function determines
4225 the position of the DECL. */
4228 layout_nonempty_base_or_field (record_layout_info rli
,
4233 tree offset
= NULL_TREE
;
4239 /* For the purposes of determining layout conflicts, we want to
4240 use the class type of BINFO; TREE_TYPE (DECL) will be the
4241 CLASSTYPE_AS_BASE version, which does not contain entries for
4242 zero-sized bases. */
4243 type
= TREE_TYPE (binfo
);
4248 type
= TREE_TYPE (decl
);
4252 /* Try to place the field. It may take more than one try if we have
4253 a hard time placing the field without putting two objects of the
4254 same type at the same address. */
4257 struct record_layout_info_s old_rli
= *rli
;
4259 /* Place this field. */
4260 place_field (rli
, decl
);
4261 offset
= byte_position (decl
);
4263 /* We have to check to see whether or not there is already
4264 something of the same type at the offset we're about to use.
4265 For example, consider:
4268 struct T : public S { int i; };
4269 struct U : public S, public T {};
4271 Here, we put S at offset zero in U. Then, we can't put T at
4272 offset zero -- its S component would be at the same address
4273 as the S we already allocated. So, we have to skip ahead.
4274 Since all data members, including those whose type is an
4275 empty class, have nonzero size, any overlap can happen only
4276 with a direct or indirect base-class -- it can't happen with
4278 /* In a union, overlap is permitted; all members are placed at
4280 if (TREE_CODE (rli
->t
) == UNION_TYPE
)
4282 if (layout_conflict_p (field_p
? type
: binfo
, offset
,
4285 /* Strip off the size allocated to this field. That puts us
4286 at the first place we could have put the field with
4287 proper alignment. */
4290 /* Bump up by the alignment required for the type. */
4292 = size_binop (PLUS_EXPR
, rli
->bitpos
,
4294 ? CLASSTYPE_ALIGN (type
)
4295 : TYPE_ALIGN (type
)));
4296 normalize_rli (rli
);
4299 /* There was no conflict. We're done laying out this field. */
4303 /* Now that we know where it will be placed, update its
4305 if (binfo
&& CLASS_TYPE_P (BINFO_TYPE (binfo
)))
4306 /* Indirect virtual bases may have a nonzero BINFO_OFFSET at
4307 this point because their BINFO_OFFSET is copied from another
4308 hierarchy. Therefore, we may not need to add the entire
4310 propagate_binfo_offsets (binfo
,
4311 size_diffop_loc (input_location
,
4312 convert (ssizetype
, offset
),
4314 BINFO_OFFSET (binfo
))));
4317 /* Returns true if TYPE is empty and OFFSET is nonzero. */
4320 empty_base_at_nonzero_offset_p (tree type
,
4322 splay_tree
/*offsets*/)
4324 return is_empty_class (type
) && !integer_zerop (offset
);
4327 /* Layout the empty base BINFO. EOC indicates the byte currently just
4328 past the end of the class, and should be correctly aligned for a
4329 class of the type indicated by BINFO; OFFSETS gives the offsets of
4330 the empty bases allocated so far. T is the most derived
4331 type. Return nonzero iff we added it at the end. */
4334 layout_empty_base (record_layout_info rli
, tree binfo
,
4335 tree eoc
, splay_tree offsets
)
4338 tree basetype
= BINFO_TYPE (binfo
);
4341 /* This routine should only be used for empty classes. */
4342 gcc_assert (is_empty_class (basetype
));
4343 alignment
= ssize_int (CLASSTYPE_ALIGN_UNIT (basetype
));
4345 if (!integer_zerop (BINFO_OFFSET (binfo
)))
4346 propagate_binfo_offsets
4347 (binfo
, size_diffop_loc (input_location
,
4348 size_zero_node
, BINFO_OFFSET (binfo
)));
4350 /* This is an empty base class. We first try to put it at offset
4352 if (layout_conflict_p (binfo
,
4353 BINFO_OFFSET (binfo
),
4357 /* That didn't work. Now, we move forward from the next
4358 available spot in the class. */
4360 propagate_binfo_offsets (binfo
, convert (ssizetype
, eoc
));
4363 if (!layout_conflict_p (binfo
,
4364 BINFO_OFFSET (binfo
),
4367 /* We finally found a spot where there's no overlap. */
4370 /* There's overlap here, too. Bump along to the next spot. */
4371 propagate_binfo_offsets (binfo
, alignment
);
4375 if (CLASSTYPE_USER_ALIGN (basetype
))
4377 rli
->record_align
= MAX (rli
->record_align
, CLASSTYPE_ALIGN (basetype
));
4379 rli
->unpacked_align
= MAX (rli
->unpacked_align
, CLASSTYPE_ALIGN (basetype
));
4380 TYPE_USER_ALIGN (rli
->t
) = 1;
4386 /* Layout the base given by BINFO in the class indicated by RLI.
4387 *BASE_ALIGN is a running maximum of the alignments of
4388 any base class. OFFSETS gives the location of empty base
4389 subobjects. T is the most derived type. Return nonzero if the new
4390 object cannot be nearly-empty. A new FIELD_DECL is inserted at
4391 *NEXT_FIELD, unless BINFO is for an empty base class.
4393 Returns the location at which the next field should be inserted. */
4396 build_base_field (record_layout_info rli
, tree binfo
,
4397 splay_tree offsets
, tree
*next_field
)
4400 tree basetype
= BINFO_TYPE (binfo
);
4402 if (!COMPLETE_TYPE_P (basetype
))
4403 /* This error is now reported in xref_tag, thus giving better
4404 location information. */
4407 /* Place the base class. */
4408 if (!is_empty_class (basetype
))
4412 /* The containing class is non-empty because it has a non-empty
4414 CLASSTYPE_EMPTY_P (t
) = 0;
4416 /* Create the FIELD_DECL. */
4417 decl
= build_decl (input_location
,
4418 FIELD_DECL
, NULL_TREE
, CLASSTYPE_AS_BASE (basetype
));
4419 DECL_ARTIFICIAL (decl
) = 1;
4420 DECL_IGNORED_P (decl
) = 1;
4421 DECL_FIELD_CONTEXT (decl
) = t
;
4422 if (CLASSTYPE_AS_BASE (basetype
))
4424 DECL_SIZE (decl
) = CLASSTYPE_SIZE (basetype
);
4425 DECL_SIZE_UNIT (decl
) = CLASSTYPE_SIZE_UNIT (basetype
);
4426 DECL_ALIGN (decl
) = CLASSTYPE_ALIGN (basetype
);
4427 DECL_USER_ALIGN (decl
) = CLASSTYPE_USER_ALIGN (basetype
);
4428 DECL_MODE (decl
) = TYPE_MODE (basetype
);
4429 DECL_FIELD_IS_BASE (decl
) = 1;
4431 /* Try to place the field. It may take more than one try if we
4432 have a hard time placing the field without putting two
4433 objects of the same type at the same address. */
4434 layout_nonempty_base_or_field (rli
, decl
, binfo
, offsets
);
4435 /* Add the new FIELD_DECL to the list of fields for T. */
4436 DECL_CHAIN (decl
) = *next_field
;
4438 next_field
= &DECL_CHAIN (decl
);
4446 /* On some platforms (ARM), even empty classes will not be
4448 eoc
= round_up_loc (input_location
,
4449 rli_size_unit_so_far (rli
),
4450 CLASSTYPE_ALIGN_UNIT (basetype
));
4451 atend
= layout_empty_base (rli
, binfo
, eoc
, offsets
);
4452 /* A nearly-empty class "has no proper base class that is empty,
4453 not morally virtual, and at an offset other than zero." */
4454 if (!BINFO_VIRTUAL_P (binfo
) && CLASSTYPE_NEARLY_EMPTY_P (t
))
4457 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
4458 /* The check above (used in G++ 3.2) is insufficient because
4459 an empty class placed at offset zero might itself have an
4460 empty base at a nonzero offset. */
4461 else if (walk_subobject_offsets (basetype
,
4462 empty_base_at_nonzero_offset_p
,
4465 /*max_offset=*/NULL_TREE
,
4467 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
4470 /* We do not create a FIELD_DECL for empty base classes because
4471 it might overlap some other field. We want to be able to
4472 create CONSTRUCTORs for the class by iterating over the
4473 FIELD_DECLs, and the back end does not handle overlapping
4476 /* An empty virtual base causes a class to be non-empty
4477 -- but in that case we do not need to clear CLASSTYPE_EMPTY_P
4478 here because that was already done when the virtual table
4479 pointer was created. */
4482 /* Record the offsets of BINFO and its base subobjects. */
4483 record_subobject_offsets (binfo
,
4484 BINFO_OFFSET (binfo
),
4486 /*is_data_member=*/false);
4491 /* Layout all of the non-virtual base classes. Record empty
4492 subobjects in OFFSETS. T is the most derived type. Return nonzero
4493 if the type cannot be nearly empty. The fields created
4494 corresponding to the base classes will be inserted at
4498 build_base_fields (record_layout_info rli
,
4499 splay_tree offsets
, tree
*next_field
)
4501 /* Chain to hold all the new FIELD_DECLs which stand in for base class
4504 int n_baseclasses
= BINFO_N_BASE_BINFOS (TYPE_BINFO (t
));
4507 /* The primary base class is always allocated first. */
4508 if (CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
4509 next_field
= build_base_field (rli
, CLASSTYPE_PRIMARY_BINFO (t
),
4510 offsets
, next_field
);
4512 /* Now allocate the rest of the bases. */
4513 for (i
= 0; i
< n_baseclasses
; ++i
)
4517 base_binfo
= BINFO_BASE_BINFO (TYPE_BINFO (t
), i
);
4519 /* The primary base was already allocated above, so we don't
4520 need to allocate it again here. */
4521 if (base_binfo
== CLASSTYPE_PRIMARY_BINFO (t
))
4524 /* Virtual bases are added at the end (a primary virtual base
4525 will have already been added). */
4526 if (BINFO_VIRTUAL_P (base_binfo
))
4529 next_field
= build_base_field (rli
, base_binfo
,
4530 offsets
, next_field
);
4534 /* Go through the TYPE_METHODS of T issuing any appropriate
4535 diagnostics, figuring out which methods override which other
4536 methods, and so forth. */
4539 check_methods (tree t
)
4543 for (x
= TYPE_METHODS (t
); x
; x
= DECL_CHAIN (x
))
4545 check_for_override (x
, t
);
4546 if (DECL_PURE_VIRTUAL_P (x
) && (TREE_CODE (x
) != FUNCTION_DECL
|| ! DECL_VINDEX (x
)))
4547 error ("initializer specified for non-virtual method %q+D", x
);
4548 /* The name of the field is the original field name
4549 Save this in auxiliary field for later overloading. */
4550 if (TREE_CODE (x
) == FUNCTION_DECL
&& DECL_VINDEX (x
))
4552 TYPE_POLYMORPHIC_P (t
) = 1;
4553 if (DECL_PURE_VIRTUAL_P (x
))
4554 vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t
), x
);
4556 /* All user-provided destructors are non-trivial.
4557 Constructors and assignment ops are handled in
4558 grok_special_member_properties. */
4559 if (DECL_DESTRUCTOR_P (x
) && user_provided_p (x
))
4560 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = 1;
4564 /* FN is a constructor or destructor. Clone the declaration to create
4565 a specialized in-charge or not-in-charge version, as indicated by
4569 build_clone (tree fn
, tree name
)
4574 /* Copy the function. */
4575 clone
= copy_decl (fn
);
4576 /* Reset the function name. */
4577 DECL_NAME (clone
) = name
;
4578 /* Remember where this function came from. */
4579 DECL_ABSTRACT_ORIGIN (clone
) = fn
;
4580 /* Make it easy to find the CLONE given the FN. */
4581 DECL_CHAIN (clone
) = DECL_CHAIN (fn
);
4582 DECL_CHAIN (fn
) = clone
;
4584 /* If this is a template, do the rest on the DECL_TEMPLATE_RESULT. */
4585 if (TREE_CODE (clone
) == TEMPLATE_DECL
)
4587 tree result
= build_clone (DECL_TEMPLATE_RESULT (clone
), name
);
4588 DECL_TEMPLATE_RESULT (clone
) = result
;
4589 DECL_TEMPLATE_INFO (result
) = copy_node (DECL_TEMPLATE_INFO (result
));
4590 DECL_TI_TEMPLATE (result
) = clone
;
4591 TREE_TYPE (clone
) = TREE_TYPE (result
);
4595 SET_DECL_ASSEMBLER_NAME (clone
, NULL_TREE
);
4596 DECL_CLONED_FUNCTION (clone
) = fn
;
4597 /* There's no pending inline data for this function. */
4598 DECL_PENDING_INLINE_INFO (clone
) = NULL
;
4599 DECL_PENDING_INLINE_P (clone
) = 0;
4601 /* The base-class destructor is not virtual. */
4602 if (name
== base_dtor_identifier
)
4604 DECL_VIRTUAL_P (clone
) = 0;
4605 if (TREE_CODE (clone
) != TEMPLATE_DECL
)
4606 DECL_VINDEX (clone
) = NULL_TREE
;
4609 /* If there was an in-charge parameter, drop it from the function
4611 if (DECL_HAS_IN_CHARGE_PARM_P (clone
))
4617 exceptions
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone
));
4618 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (clone
));
4619 parmtypes
= TYPE_ARG_TYPES (TREE_TYPE (clone
));
4620 /* Skip the `this' parameter. */
4621 parmtypes
= TREE_CHAIN (parmtypes
);
4622 /* Skip the in-charge parameter. */
4623 parmtypes
= TREE_CHAIN (parmtypes
);
4624 /* And the VTT parm, in a complete [cd]tor. */
4625 if (DECL_HAS_VTT_PARM_P (fn
)
4626 && ! DECL_NEEDS_VTT_PARM_P (clone
))
4627 parmtypes
= TREE_CHAIN (parmtypes
);
4628 /* If this is subobject constructor or destructor, add the vtt
4631 = build_method_type_directly (basetype
,
4632 TREE_TYPE (TREE_TYPE (clone
)),
4635 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
),
4638 = cp_build_type_attribute_variant (TREE_TYPE (clone
),
4639 TYPE_ATTRIBUTES (TREE_TYPE (fn
)));
4642 /* Copy the function parameters. */
4643 DECL_ARGUMENTS (clone
) = copy_list (DECL_ARGUMENTS (clone
));
4644 /* Remove the in-charge parameter. */
4645 if (DECL_HAS_IN_CHARGE_PARM_P (clone
))
4647 DECL_CHAIN (DECL_ARGUMENTS (clone
))
4648 = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone
)));
4649 DECL_HAS_IN_CHARGE_PARM_P (clone
) = 0;
4651 /* And the VTT parm, in a complete [cd]tor. */
4652 if (DECL_HAS_VTT_PARM_P (fn
))
4654 if (DECL_NEEDS_VTT_PARM_P (clone
))
4655 DECL_HAS_VTT_PARM_P (clone
) = 1;
4658 DECL_CHAIN (DECL_ARGUMENTS (clone
))
4659 = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone
)));
4660 DECL_HAS_VTT_PARM_P (clone
) = 0;
4664 for (parms
= DECL_ARGUMENTS (clone
); parms
; parms
= DECL_CHAIN (parms
))
4666 DECL_CONTEXT (parms
) = clone
;
4667 cxx_dup_lang_specific_decl (parms
);
4670 /* Create the RTL for this function. */
4671 SET_DECL_RTL (clone
, NULL
);
4672 rest_of_decl_compilation (clone
, /*top_level=*/1, at_eof
);
4675 note_decl_for_pch (clone
);
4680 /* Implementation of DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P, do
4681 not invoke this function directly.
4683 For a non-thunk function, returns the address of the slot for storing
4684 the function it is a clone of. Otherwise returns NULL_TREE.
4686 If JUST_TESTING, looks through TEMPLATE_DECL and returns NULL if
4687 cloned_function is unset. This is to support the separate
4688 DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P modes; using the latter
4689 on a template makes sense, but not the former. */
4692 decl_cloned_function_p (const_tree decl
, bool just_testing
)
4696 decl
= STRIP_TEMPLATE (decl
);
4698 if (TREE_CODE (decl
) != FUNCTION_DECL
4699 || !DECL_LANG_SPECIFIC (decl
)
4700 || DECL_LANG_SPECIFIC (decl
)->u
.fn
.thunk_p
)
4702 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4704 lang_check_failed (__FILE__
, __LINE__
, __FUNCTION__
);
4710 ptr
= &DECL_LANG_SPECIFIC (decl
)->u
.fn
.u5
.cloned_function
;
4711 if (just_testing
&& *ptr
== NULL_TREE
)
4717 /* Produce declarations for all appropriate clones of FN. If
4718 UPDATE_METHOD_VEC_P is nonzero, the clones are added to the
4719 CLASTYPE_METHOD_VEC as well. */
4722 clone_function_decl (tree fn
, int update_method_vec_p
)
4726 /* Avoid inappropriate cloning. */
4728 && DECL_CLONED_FUNCTION_P (DECL_CHAIN (fn
)))
4731 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
4733 /* For each constructor, we need two variants: an in-charge version
4734 and a not-in-charge version. */
4735 clone
= build_clone (fn
, complete_ctor_identifier
);
4736 if (update_method_vec_p
)
4737 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4738 clone
= build_clone (fn
, base_ctor_identifier
);
4739 if (update_method_vec_p
)
4740 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4744 gcc_assert (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn
));
4746 /* For each destructor, we need three variants: an in-charge
4747 version, a not-in-charge version, and an in-charge deleting
4748 version. We clone the deleting version first because that
4749 means it will go second on the TYPE_METHODS list -- and that
4750 corresponds to the correct layout order in the virtual
4753 For a non-virtual destructor, we do not build a deleting
4755 if (DECL_VIRTUAL_P (fn
))
4757 clone
= build_clone (fn
, deleting_dtor_identifier
);
4758 if (update_method_vec_p
)
4759 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4761 clone
= build_clone (fn
, complete_dtor_identifier
);
4762 if (update_method_vec_p
)
4763 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4764 clone
= build_clone (fn
, base_dtor_identifier
);
4765 if (update_method_vec_p
)
4766 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4769 /* Note that this is an abstract function that is never emitted. */
4770 DECL_ABSTRACT_P (fn
) = true;
4773 /* DECL is an in charge constructor, which is being defined. This will
4774 have had an in class declaration, from whence clones were
4775 declared. An out-of-class definition can specify additional default
4776 arguments. As it is the clones that are involved in overload
4777 resolution, we must propagate the information from the DECL to its
4781 adjust_clone_args (tree decl
)
4785 for (clone
= DECL_CHAIN (decl
); clone
&& DECL_CLONED_FUNCTION_P (clone
);
4786 clone
= DECL_CHAIN (clone
))
4788 tree orig_clone_parms
= TYPE_ARG_TYPES (TREE_TYPE (clone
));
4789 tree orig_decl_parms
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
4790 tree decl_parms
, clone_parms
;
4792 clone_parms
= orig_clone_parms
;
4794 /* Skip the 'this' parameter. */
4795 orig_clone_parms
= TREE_CHAIN (orig_clone_parms
);
4796 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4798 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
4799 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4800 if (DECL_HAS_VTT_PARM_P (decl
))
4801 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4803 clone_parms
= orig_clone_parms
;
4804 if (DECL_HAS_VTT_PARM_P (clone
))
4805 clone_parms
= TREE_CHAIN (clone_parms
);
4807 for (decl_parms
= orig_decl_parms
; decl_parms
;
4808 decl_parms
= TREE_CHAIN (decl_parms
),
4809 clone_parms
= TREE_CHAIN (clone_parms
))
4811 gcc_assert (same_type_p (TREE_TYPE (decl_parms
),
4812 TREE_TYPE (clone_parms
)));
4814 if (TREE_PURPOSE (decl_parms
) && !TREE_PURPOSE (clone_parms
))
4816 /* A default parameter has been added. Adjust the
4817 clone's parameters. */
4818 tree exceptions
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone
));
4819 tree attrs
= TYPE_ATTRIBUTES (TREE_TYPE (clone
));
4820 tree basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (clone
));
4823 clone_parms
= orig_decl_parms
;
4825 if (DECL_HAS_VTT_PARM_P (clone
))
4827 clone_parms
= tree_cons (TREE_PURPOSE (orig_clone_parms
),
4828 TREE_VALUE (orig_clone_parms
),
4830 TREE_TYPE (clone_parms
) = TREE_TYPE (orig_clone_parms
);
4832 type
= build_method_type_directly (basetype
,
4833 TREE_TYPE (TREE_TYPE (clone
)),
4836 type
= build_exception_variant (type
, exceptions
);
4838 type
= cp_build_type_attribute_variant (type
, attrs
);
4839 TREE_TYPE (clone
) = type
;
4841 clone_parms
= NULL_TREE
;
4845 gcc_assert (!clone_parms
);
4849 /* For each of the constructors and destructors in T, create an
4850 in-charge and not-in-charge variant. */
4853 clone_constructors_and_destructors (tree t
)
4857 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4859 if (!CLASSTYPE_METHOD_VEC (t
))
4862 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4863 clone_function_decl (OVL_CURRENT (fns
), /*update_method_vec_p=*/1);
4864 for (fns
= CLASSTYPE_DESTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4865 clone_function_decl (OVL_CURRENT (fns
), /*update_method_vec_p=*/1);
4868 /* Deduce noexcept for a destructor DTOR. */
4871 deduce_noexcept_on_destructor (tree dtor
)
4873 if (!TYPE_RAISES_EXCEPTIONS (TREE_TYPE (dtor
)))
4875 tree eh_spec
= unevaluated_noexcept_spec ();
4876 TREE_TYPE (dtor
) = build_exception_variant (TREE_TYPE (dtor
), eh_spec
);
4880 /* For each destructor in T, deduce noexcept:
4882 12.4/3: A declaration of a destructor that does not have an
4883 exception-specification is implicitly considered to have the
4884 same exception-specification as an implicit declaration (15.4). */
4887 deduce_noexcept_on_destructors (tree t
)
4889 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4891 if (!CLASSTYPE_METHOD_VEC (t
))
4894 for (tree fns
= CLASSTYPE_DESTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4895 deduce_noexcept_on_destructor (OVL_CURRENT (fns
));
4898 /* Subroutine of set_one_vmethod_tm_attributes. Search base classes
4899 of TYPE for virtual functions which FNDECL overrides. Return a
4900 mask of the tm attributes found therein. */
4903 look_for_tm_attr_overrides (tree type
, tree fndecl
)
4905 tree binfo
= TYPE_BINFO (type
);
4909 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ++ix
)
4911 tree o
, basetype
= BINFO_TYPE (base_binfo
);
4913 if (!TYPE_POLYMORPHIC_P (basetype
))
4916 o
= look_for_overrides_here (basetype
, fndecl
);
4918 found
|= tm_attr_to_mask (find_tm_attribute
4919 (TYPE_ATTRIBUTES (TREE_TYPE (o
))));
4921 found
|= look_for_tm_attr_overrides (basetype
, fndecl
);
4927 /* Subroutine of set_method_tm_attributes. Handle the checks and
4928 inheritance for one virtual method FNDECL. */
4931 set_one_vmethod_tm_attributes (tree type
, tree fndecl
)
4936 found
= look_for_tm_attr_overrides (type
, fndecl
);
4938 /* If FNDECL doesn't actually override anything (i.e. T is the
4939 class that first declares FNDECL virtual), then we're done. */
4943 tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl
)));
4944 have
= tm_attr_to_mask (tm_attr
);
4946 /* Intel STM Language Extension 3.0, Section 4.2 table 4:
4947 tm_pure must match exactly, otherwise no weakening of
4948 tm_safe > tm_callable > nothing. */
4949 /* ??? The tm_pure attribute didn't make the transition to the
4950 multivendor language spec. */
4951 if (have
== TM_ATTR_PURE
)
4953 if (found
!= TM_ATTR_PURE
)
4959 /* If the overridden function is tm_pure, then FNDECL must be. */
4960 else if (found
== TM_ATTR_PURE
&& tm_attr
)
4962 /* Look for base class combinations that cannot be satisfied. */
4963 else if (found
!= TM_ATTR_PURE
&& (found
& TM_ATTR_PURE
))
4965 found
&= ~TM_ATTR_PURE
;
4967 error_at (DECL_SOURCE_LOCATION (fndecl
),
4968 "method overrides both %<transaction_pure%> and %qE methods",
4969 tm_mask_to_attr (found
));
4971 /* If FNDECL did not declare an attribute, then inherit the most
4973 else if (tm_attr
== NULL
)
4975 apply_tm_attr (fndecl
, tm_mask_to_attr (found
& -found
));
4977 /* Otherwise validate that we're not weaker than a function
4978 that is being overridden. */
4982 if (found
<= TM_ATTR_CALLABLE
&& have
> found
)
4988 error_at (DECL_SOURCE_LOCATION (fndecl
),
4989 "method declared %qE overriding %qE method",
4990 tm_attr
, tm_mask_to_attr (found
));
4993 /* For each of the methods in T, propagate a class-level tm attribute. */
4996 set_method_tm_attributes (tree t
)
4998 tree class_tm_attr
, fndecl
;
5000 /* Don't bother collecting tm attributes if transactional memory
5001 support is not enabled. */
5005 /* Process virtual methods first, as they inherit directly from the
5006 base virtual function and also require validation of new attributes. */
5007 if (TYPE_CONTAINS_VPTR_P (t
))
5010 for (vchain
= BINFO_VIRTUALS (TYPE_BINFO (t
)); vchain
;
5011 vchain
= TREE_CHAIN (vchain
))
5013 fndecl
= BV_FN (vchain
);
5014 if (DECL_THUNK_P (fndecl
))
5015 fndecl
= THUNK_TARGET (fndecl
);
5016 set_one_vmethod_tm_attributes (t
, fndecl
);
5020 /* If the class doesn't have an attribute, nothing more to do. */
5021 class_tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (t
));
5022 if (class_tm_attr
== NULL
)
5025 /* Any method that does not yet have a tm attribute inherits
5026 the one from the class. */
5027 for (fndecl
= TYPE_METHODS (t
); fndecl
; fndecl
= TREE_CHAIN (fndecl
))
5029 if (!find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl
))))
5030 apply_tm_attr (fndecl
, class_tm_attr
);
5034 /* Returns true iff class T has a user-defined constructor other than
5035 the default constructor. */
5038 type_has_user_nondefault_constructor (tree t
)
5042 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
5045 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5047 tree fn
= OVL_CURRENT (fns
);
5048 if (!DECL_ARTIFICIAL (fn
)
5049 && (TREE_CODE (fn
) == TEMPLATE_DECL
5050 || (skip_artificial_parms_for (fn
, DECL_ARGUMENTS (fn
))
5058 /* Returns the defaulted constructor if T has one. Otherwise, returns
5062 in_class_defaulted_default_constructor (tree t
)
5066 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
5069 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5071 tree fn
= OVL_CURRENT (fns
);
5073 if (DECL_DEFAULTED_IN_CLASS_P (fn
))
5075 args
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
5076 while (args
&& TREE_PURPOSE (args
))
5077 args
= TREE_CHAIN (args
);
5078 if (!args
|| args
== void_list_node
)
5086 /* Returns true iff FN is a user-provided function, i.e. user-declared
5087 and not defaulted at its first declaration; or explicit, private,
5088 protected, or non-const. */
5091 user_provided_p (tree fn
)
5093 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
5096 return (!DECL_ARTIFICIAL (fn
)
5097 && !(DECL_INITIALIZED_IN_CLASS_P (fn
)
5098 && (DECL_DEFAULTED_FN (fn
) || DECL_DELETED_FN (fn
))));
5101 /* Returns true iff class T has a user-provided constructor. */
5104 type_has_user_provided_constructor (tree t
)
5108 if (!CLASS_TYPE_P (t
))
5111 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
5114 /* This can happen in error cases; avoid crashing. */
5115 if (!CLASSTYPE_METHOD_VEC (t
))
5118 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5119 if (user_provided_p (OVL_CURRENT (fns
)))
5125 /* Returns true iff class T has a non-user-provided (i.e. implicitly
5126 declared or explicitly defaulted in the class body) default
5130 type_has_non_user_provided_default_constructor (tree t
)
5134 if (!TYPE_HAS_DEFAULT_CONSTRUCTOR (t
))
5136 if (CLASSTYPE_LAZY_DEFAULT_CTOR (t
))
5139 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5141 tree fn
= OVL_CURRENT (fns
);
5142 if (TREE_CODE (fn
) == FUNCTION_DECL
5143 && !user_provided_p (fn
)
5144 && sufficient_parms_p (FUNCTION_FIRST_USER_PARMTYPE (fn
)))
5151 /* TYPE is being used as a virtual base, and has a non-trivial move
5152 assignment. Return true if this is due to there being a user-provided
5153 move assignment in TYPE or one of its subobjects; if there isn't, then
5154 multiple move assignment can't cause any harm. */
5157 vbase_has_user_provided_move_assign (tree type
)
5159 /* Does the type itself have a user-provided move assignment operator? */
5161 = lookup_fnfields_slot_nolazy (type
, ansi_assopname (NOP_EXPR
));
5162 fns
; fns
= OVL_NEXT (fns
))
5164 tree fn
= OVL_CURRENT (fns
);
5165 if (move_fn_p (fn
) && user_provided_p (fn
))
5169 /* Do any of its bases? */
5170 tree binfo
= TYPE_BINFO (type
);
5172 for (int i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5173 if (vbase_has_user_provided_move_assign (BINFO_TYPE (base_binfo
)))
5176 /* Or non-static data members? */
5177 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
5179 if (TREE_CODE (field
) == FIELD_DECL
5180 && CLASS_TYPE_P (TREE_TYPE (field
))
5181 && vbase_has_user_provided_move_assign (TREE_TYPE (field
)))
5189 /* If default-initialization leaves part of TYPE uninitialized, returns
5190 a DECL for the field or TYPE itself (DR 253). */
5193 default_init_uninitialized_part (tree type
)
5198 type
= strip_array_types (type
);
5199 if (!CLASS_TYPE_P (type
))
5201 if (!type_has_non_user_provided_default_constructor (type
))
5203 for (binfo
= TYPE_BINFO (type
), i
= 0;
5204 BINFO_BASE_ITERATE (binfo
, i
, t
); ++i
)
5206 r
= default_init_uninitialized_part (BINFO_TYPE (t
));
5210 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
5211 if (TREE_CODE (t
) == FIELD_DECL
5212 && !DECL_ARTIFICIAL (t
)
5213 && !DECL_INITIAL (t
))
5215 r
= default_init_uninitialized_part (TREE_TYPE (t
));
5217 return DECL_P (r
) ? r
: t
;
5223 /* Returns true iff for class T, a trivial synthesized default constructor
5224 would be constexpr. */
5227 trivial_default_constructor_is_constexpr (tree t
)
5229 /* A defaulted trivial default constructor is constexpr
5230 if there is nothing to initialize. */
5231 gcc_assert (!TYPE_HAS_COMPLEX_DFLT (t
));
5232 return is_really_empty_class (t
);
5235 /* Returns true iff class T has a constexpr default constructor. */
5238 type_has_constexpr_default_constructor (tree t
)
5242 if (!CLASS_TYPE_P (t
))
5244 /* The caller should have stripped an enclosing array. */
5245 gcc_assert (TREE_CODE (t
) != ARRAY_TYPE
);
5248 if (CLASSTYPE_LAZY_DEFAULT_CTOR (t
))
5250 if (!TYPE_HAS_COMPLEX_DFLT (t
))
5251 return trivial_default_constructor_is_constexpr (t
);
5252 /* Non-trivial, we need to check subobject constructors. */
5253 lazily_declare_fn (sfk_constructor
, t
);
5255 fns
= locate_ctor (t
);
5256 return (fns
&& DECL_DECLARED_CONSTEXPR_P (fns
));
5259 /* Returns true iff class TYPE has a virtual destructor. */
5262 type_has_virtual_destructor (tree type
)
5266 if (!CLASS_TYPE_P (type
))
5269 gcc_assert (COMPLETE_TYPE_P (type
));
5270 dtor
= CLASSTYPE_DESTRUCTORS (type
);
5271 return (dtor
&& DECL_VIRTUAL_P (dtor
));
5274 /* Returns true iff class T has a move constructor. */
5277 type_has_move_constructor (tree t
)
5281 if (CLASSTYPE_LAZY_MOVE_CTOR (t
))
5283 gcc_assert (COMPLETE_TYPE_P (t
));
5284 lazily_declare_fn (sfk_move_constructor
, t
);
5287 if (!CLASSTYPE_METHOD_VEC (t
))
5290 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5291 if (move_fn_p (OVL_CURRENT (fns
)))
5297 /* Returns true iff class T has a move assignment operator. */
5300 type_has_move_assign (tree t
)
5304 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
5306 gcc_assert (COMPLETE_TYPE_P (t
));
5307 lazily_declare_fn (sfk_move_assignment
, t
);
5310 for (fns
= lookup_fnfields_slot_nolazy (t
, ansi_assopname (NOP_EXPR
));
5311 fns
; fns
= OVL_NEXT (fns
))
5312 if (move_fn_p (OVL_CURRENT (fns
)))
5318 /* Returns true iff class T has a move constructor that was explicitly
5319 declared in the class body. Note that this is different from
5320 "user-provided", which doesn't include functions that are defaulted in
5324 type_has_user_declared_move_constructor (tree t
)
5328 if (CLASSTYPE_LAZY_MOVE_CTOR (t
))
5331 if (!CLASSTYPE_METHOD_VEC (t
))
5334 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5336 tree fn
= OVL_CURRENT (fns
);
5337 if (move_fn_p (fn
) && !DECL_ARTIFICIAL (fn
))
5344 /* Returns true iff class T has a move assignment operator that was
5345 explicitly declared in the class body. */
5348 type_has_user_declared_move_assign (tree t
)
5352 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
5355 for (fns
= lookup_fnfields_slot_nolazy (t
, ansi_assopname (NOP_EXPR
));
5356 fns
; fns
= OVL_NEXT (fns
))
5358 tree fn
= OVL_CURRENT (fns
);
5359 if (move_fn_p (fn
) && !DECL_ARTIFICIAL (fn
))
5366 /* Nonzero if we need to build up a constructor call when initializing an
5367 object of this class, either because it has a user-declared constructor
5368 or because it doesn't have a default constructor (so we need to give an
5369 error if no initializer is provided). Use TYPE_NEEDS_CONSTRUCTING when
5370 what you care about is whether or not an object can be produced by a
5371 constructor (e.g. so we don't set TREE_READONLY on const variables of
5372 such type); use this function when what you care about is whether or not
5373 to try to call a constructor to create an object. The latter case is
5374 the former plus some cases of constructors that cannot be called. */
5377 type_build_ctor_call (tree t
)
5380 if (TYPE_NEEDS_CONSTRUCTING (t
))
5382 inner
= strip_array_types (t
);
5383 if (!CLASS_TYPE_P (inner
) || ANON_AGGR_TYPE_P (inner
))
5385 if (!TYPE_HAS_DEFAULT_CONSTRUCTOR (inner
))
5387 if (cxx_dialect
< cxx11
)
5389 /* A user-declared constructor might be private, and a constructor might
5390 be trivial but deleted. */
5391 for (tree fns
= lookup_fnfields_slot (inner
, complete_ctor_identifier
);
5392 fns
; fns
= OVL_NEXT (fns
))
5394 tree fn
= OVL_CURRENT (fns
);
5395 if (!DECL_ARTIFICIAL (fn
)
5396 || DECL_DELETED_FN (fn
))
5402 /* Like type_build_ctor_call, but for destructors. */
5405 type_build_dtor_call (tree t
)
5408 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5410 inner
= strip_array_types (t
);
5411 if (!CLASS_TYPE_P (inner
) || ANON_AGGR_TYPE_P (inner
)
5412 || !COMPLETE_TYPE_P (inner
))
5414 if (cxx_dialect
< cxx11
)
5416 /* A user-declared destructor might be private, and a destructor might
5417 be trivial but deleted. */
5418 for (tree fns
= lookup_fnfields_slot (inner
, complete_dtor_identifier
);
5419 fns
; fns
= OVL_NEXT (fns
))
5421 tree fn
= OVL_CURRENT (fns
);
5422 if (!DECL_ARTIFICIAL (fn
)
5423 || DECL_DELETED_FN (fn
))
5429 /* Remove all zero-width bit-fields from T. */
5432 remove_zero_width_bit_fields (tree t
)
5436 fieldsp
= &TYPE_FIELDS (t
);
5439 if (TREE_CODE (*fieldsp
) == FIELD_DECL
5440 && DECL_C_BIT_FIELD (*fieldsp
)
5441 /* We should not be confused by the fact that grokbitfield
5442 temporarily sets the width of the bit field into
5443 DECL_INITIAL (*fieldsp).
5444 check_bitfield_decl eventually sets DECL_SIZE (*fieldsp)
5446 && (DECL_SIZE (*fieldsp
) == NULL_TREE
5447 || integer_zerop (DECL_SIZE (*fieldsp
))))
5448 *fieldsp
= DECL_CHAIN (*fieldsp
);
5450 fieldsp
= &DECL_CHAIN (*fieldsp
);
5454 /* Returns TRUE iff we need a cookie when dynamically allocating an
5455 array whose elements have the indicated class TYPE. */
5458 type_requires_array_cookie (tree type
)
5461 bool has_two_argument_delete_p
= false;
5463 gcc_assert (CLASS_TYPE_P (type
));
5465 /* If there's a non-trivial destructor, we need a cookie. In order
5466 to iterate through the array calling the destructor for each
5467 element, we'll have to know how many elements there are. */
5468 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
5471 /* If the usual deallocation function is a two-argument whose second
5472 argument is of type `size_t', then we have to pass the size of
5473 the array to the deallocation function, so we will need to store
5475 fns
= lookup_fnfields (TYPE_BINFO (type
),
5476 ansi_opname (VEC_DELETE_EXPR
),
5478 /* If there are no `operator []' members, or the lookup is
5479 ambiguous, then we don't need a cookie. */
5480 if (!fns
|| fns
== error_mark_node
)
5482 /* Loop through all of the functions. */
5483 for (fns
= BASELINK_FUNCTIONS (fns
); fns
; fns
= OVL_NEXT (fns
))
5488 /* Select the current function. */
5489 fn
= OVL_CURRENT (fns
);
5490 /* See if this function is a one-argument delete function. If
5491 it is, then it will be the usual deallocation function. */
5492 second_parm
= TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (fn
)));
5493 if (second_parm
== void_list_node
)
5495 /* Do not consider this function if its second argument is an
5499 /* Otherwise, if we have a two-argument function and the second
5500 argument is `size_t', it will be the usual deallocation
5501 function -- unless there is one-argument function, too. */
5502 if (TREE_CHAIN (second_parm
) == void_list_node
5503 && same_type_p (TREE_VALUE (second_parm
), size_type_node
))
5504 has_two_argument_delete_p
= true;
5507 return has_two_argument_delete_p
;
5510 /* Finish computing the `literal type' property of class type T.
5512 At this point, we have already processed base classes and
5513 non-static data members. We need to check whether the copy
5514 constructor is trivial, the destructor is trivial, and there
5515 is a trivial default constructor or at least one constexpr
5516 constructor other than the copy constructor. */
5519 finalize_literal_type_property (tree t
)
5523 if (cxx_dialect
< cxx11
5524 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5525 CLASSTYPE_LITERAL_P (t
) = false;
5526 else if (CLASSTYPE_LITERAL_P (t
) && !TYPE_HAS_TRIVIAL_DFLT (t
)
5527 && CLASSTYPE_NON_AGGREGATE (t
)
5528 && !TYPE_HAS_CONSTEXPR_CTOR (t
))
5529 CLASSTYPE_LITERAL_P (t
) = false;
5531 if (!CLASSTYPE_LITERAL_P (t
))
5532 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5533 if (DECL_DECLARED_CONSTEXPR_P (fn
)
5534 && TREE_CODE (fn
) != TEMPLATE_DECL
5535 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
5536 && !DECL_CONSTRUCTOR_P (fn
))
5538 DECL_DECLARED_CONSTEXPR_P (fn
) = false;
5539 if (!DECL_GENERATED_P (fn
))
5541 error ("enclosing class of constexpr non-static member "
5542 "function %q+#D is not a literal type", fn
);
5543 explain_non_literal_class (t
);
5548 /* T is a non-literal type used in a context which requires a constant
5549 expression. Explain why it isn't literal. */
5552 explain_non_literal_class (tree t
)
5554 static hash_set
<tree
> *diagnosed
;
5556 if (!CLASS_TYPE_P (t
))
5558 t
= TYPE_MAIN_VARIANT (t
);
5560 if (diagnosed
== NULL
)
5561 diagnosed
= new hash_set
<tree
>;
5562 if (diagnosed
->add (t
))
5563 /* Already explained. */
5566 inform (0, "%q+T is not literal because:", t
);
5567 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5568 inform (0, " %q+T has a non-trivial destructor", t
);
5569 else if (CLASSTYPE_NON_AGGREGATE (t
)
5570 && !TYPE_HAS_TRIVIAL_DFLT (t
)
5571 && !TYPE_HAS_CONSTEXPR_CTOR (t
))
5573 inform (0, " %q+T is not an aggregate, does not have a trivial "
5574 "default constructor, and has no constexpr constructor that "
5575 "is not a copy or move constructor", t
);
5576 if (type_has_non_user_provided_default_constructor (t
))
5578 /* Note that we can't simply call locate_ctor because when the
5579 constructor is deleted it just returns NULL_TREE. */
5581 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5583 tree fn
= OVL_CURRENT (fns
);
5584 tree parms
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5586 parms
= skip_artificial_parms_for (fn
, parms
);
5588 if (sufficient_parms_p (parms
))
5590 if (DECL_DELETED_FN (fn
))
5591 maybe_explain_implicit_delete (fn
);
5593 explain_invalid_constexpr_fn (fn
);
5601 tree binfo
, base_binfo
, field
; int i
;
5602 for (binfo
= TYPE_BINFO (t
), i
= 0;
5603 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
5605 tree basetype
= TREE_TYPE (base_binfo
);
5606 if (!CLASSTYPE_LITERAL_P (basetype
))
5608 inform (0, " base class %qT of %q+T is non-literal",
5610 explain_non_literal_class (basetype
);
5614 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
5617 if (TREE_CODE (field
) != FIELD_DECL
)
5619 ftype
= TREE_TYPE (field
);
5620 if (!literal_type_p (ftype
))
5622 inform (0, " non-static data member %q+D has "
5623 "non-literal type", field
);
5624 if (CLASS_TYPE_P (ftype
))
5625 explain_non_literal_class (ftype
);
5627 if (CP_TYPE_VOLATILE_P (ftype
))
5628 inform (0, " non-static data member %q+D has "
5629 "volatile type", field
);
5634 /* Check the validity of the bases and members declared in T. Add any
5635 implicitly-generated functions (like copy-constructors and
5636 assignment operators). Compute various flag bits (like
5637 CLASSTYPE_NON_LAYOUT_POD_T) for T. This routine works purely at the C++
5638 level: i.e., independently of the ABI in use. */
5641 check_bases_and_members (tree t
)
5643 /* Nonzero if the implicitly generated copy constructor should take
5644 a non-const reference argument. */
5645 int cant_have_const_ctor
;
5646 /* Nonzero if the implicitly generated assignment operator
5647 should take a non-const reference argument. */
5648 int no_const_asn_ref
;
5650 bool saved_complex_asn_ref
;
5651 bool saved_nontrivial_dtor
;
5654 /* By default, we use const reference arguments and generate default
5656 cant_have_const_ctor
= 0;
5657 no_const_asn_ref
= 0;
5659 /* Check all the base-classes. */
5660 check_bases (t
, &cant_have_const_ctor
,
5663 /* Deduce noexcept on destructors. This needs to happen after we've set
5664 triviality flags appropriately for our bases. */
5665 if (cxx_dialect
>= cxx11
)
5666 deduce_noexcept_on_destructors (t
);
5668 /* Check all the method declarations. */
5671 /* Save the initial values of these flags which only indicate whether
5672 or not the class has user-provided functions. As we analyze the
5673 bases and members we can set these flags for other reasons. */
5674 saved_complex_asn_ref
= TYPE_HAS_COMPLEX_COPY_ASSIGN (t
);
5675 saved_nontrivial_dtor
= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
);
5677 /* Check all the data member declarations. We cannot call
5678 check_field_decls until we have called check_bases check_methods,
5679 as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR
5680 being set appropriately. */
5681 check_field_decls (t
, &access_decls
,
5682 &cant_have_const_ctor
,
5685 /* A nearly-empty class has to be vptr-containing; a nearly empty
5686 class contains just a vptr. */
5687 if (!TYPE_CONTAINS_VPTR_P (t
))
5688 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
5690 /* Do some bookkeeping that will guide the generation of implicitly
5691 declared member functions. */
5692 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5693 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5694 /* We need to call a constructor for this class if it has a
5695 user-provided constructor, or if the default constructor is going
5696 to initialize the vptr. (This is not an if-and-only-if;
5697 TYPE_NEEDS_CONSTRUCTING is set elsewhere if bases or members
5698 themselves need constructing.) */
5699 TYPE_NEEDS_CONSTRUCTING (t
)
5700 |= (type_has_user_provided_constructor (t
) || TYPE_CONTAINS_VPTR_P (t
));
5703 An aggregate is an array or a class with no user-provided
5704 constructors ... and no virtual functions.
5706 Again, other conditions for being an aggregate are checked
5708 CLASSTYPE_NON_AGGREGATE (t
)
5709 |= (type_has_user_provided_constructor (t
) || TYPE_POLYMORPHIC_P (t
));
5710 /* This is the C++98/03 definition of POD; it changed in C++0x, but we
5711 retain the old definition internally for ABI reasons. */
5712 CLASSTYPE_NON_LAYOUT_POD_P (t
)
5713 |= (CLASSTYPE_NON_AGGREGATE (t
)
5714 || saved_nontrivial_dtor
|| saved_complex_asn_ref
);
5715 CLASSTYPE_NON_STD_LAYOUT (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5716 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5717 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5718 TYPE_HAS_COMPLEX_DFLT (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5720 /* If the only explicitly declared default constructor is user-provided,
5721 set TYPE_HAS_COMPLEX_DFLT. */
5722 if (!TYPE_HAS_COMPLEX_DFLT (t
)
5723 && TYPE_HAS_DEFAULT_CONSTRUCTOR (t
)
5724 && !type_has_non_user_provided_default_constructor (t
))
5725 TYPE_HAS_COMPLEX_DFLT (t
) = true;
5727 /* Warn if a public base of a polymorphic type has an accessible
5728 non-virtual destructor. It is only now that we know the class is
5729 polymorphic. Although a polymorphic base will have a already
5730 been diagnosed during its definition, we warn on use too. */
5731 if (TYPE_POLYMORPHIC_P (t
) && warn_nonvdtor
)
5733 tree binfo
= TYPE_BINFO (t
);
5734 vec
<tree
, va_gc
> *accesses
= BINFO_BASE_ACCESSES (binfo
);
5738 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
5740 tree basetype
= TREE_TYPE (base_binfo
);
5742 if ((*accesses
)[i
] == access_public_node
5743 && (TYPE_POLYMORPHIC_P (basetype
) || warn_ecpp
)
5744 && accessible_nvdtor_p (basetype
))
5745 warning (OPT_Wnon_virtual_dtor
,
5746 "base class %q#T has accessible non-virtual destructor",
5751 /* If the class has no user-declared constructor, but does have
5752 non-static const or reference data members that can never be
5753 initialized, issue a warning. */
5754 if (warn_uninitialized
5755 /* Classes with user-declared constructors are presumed to
5756 initialize these members. */
5757 && !TYPE_HAS_USER_CONSTRUCTOR (t
)
5758 /* Aggregates can be initialized with brace-enclosed
5760 && CLASSTYPE_NON_AGGREGATE (t
))
5764 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
5768 if (TREE_CODE (field
) != FIELD_DECL
5769 || DECL_INITIAL (field
) != NULL_TREE
)
5772 type
= TREE_TYPE (field
);
5773 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5774 warning (OPT_Wuninitialized
, "non-static reference %q+#D "
5775 "in class without a constructor", field
);
5776 else if (CP_TYPE_CONST_P (type
)
5777 && (!CLASS_TYPE_P (type
)
5778 || !TYPE_HAS_DEFAULT_CONSTRUCTOR (type
)))
5779 warning (OPT_Wuninitialized
, "non-static const member %q+#D "
5780 "in class without a constructor", field
);
5784 /* Synthesize any needed methods. */
5785 add_implicitly_declared_members (t
, &access_decls
,
5786 cant_have_const_ctor
,
5789 /* Check defaulted declarations here so we have cant_have_const_ctor
5790 and don't need to worry about clones. */
5791 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5792 if (!DECL_ARTIFICIAL (fn
) && DECL_DEFAULTED_IN_CLASS_P (fn
))
5794 int copy
= copy_fn_p (fn
);
5798 = (DECL_CONSTRUCTOR_P (fn
) ? !cant_have_const_ctor
5799 : !no_const_asn_ref
);
5800 bool fn_const_p
= (copy
== 2);
5802 if (fn_const_p
&& !imp_const_p
)
5803 /* If the function is defaulted outside the class, we just
5804 give the synthesis error. */
5805 error ("%q+D declared to take const reference, but implicit "
5806 "declaration would take non-const", fn
);
5808 defaulted_late_check (fn
);
5811 if (LAMBDA_TYPE_P (t
))
5813 /* "This class type is not an aggregate." */
5814 CLASSTYPE_NON_AGGREGATE (t
) = 1;
5817 /* Compute the 'literal type' property before we
5818 do anything with non-static member functions. */
5819 finalize_literal_type_property (t
);
5821 /* Create the in-charge and not-in-charge variants of constructors
5823 clone_constructors_and_destructors (t
);
5825 /* Process the using-declarations. */
5826 for (; access_decls
; access_decls
= TREE_CHAIN (access_decls
))
5827 handle_using_decl (TREE_VALUE (access_decls
), t
);
5829 /* Build and sort the CLASSTYPE_METHOD_VEC. */
5830 finish_struct_methods (t
);
5832 /* Figure out whether or not we will need a cookie when dynamically
5833 allocating an array of this type. */
5834 TYPE_LANG_SPECIFIC (t
)->u
.c
.vec_new_uses_cookie
5835 = type_requires_array_cookie (t
);
5838 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
5839 accordingly. If a new vfield was created (because T doesn't have a
5840 primary base class), then the newly created field is returned. It
5841 is not added to the TYPE_FIELDS list; it is the caller's
5842 responsibility to do that. Accumulate declared virtual functions
5846 create_vtable_ptr (tree t
, tree
* virtuals_p
)
5850 /* Collect the virtual functions declared in T. */
5851 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5852 if (TREE_CODE (fn
) == FUNCTION_DECL
5853 && DECL_VINDEX (fn
) && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn
)
5854 && TREE_CODE (DECL_VINDEX (fn
)) != INTEGER_CST
)
5856 tree new_virtual
= make_node (TREE_LIST
);
5858 BV_FN (new_virtual
) = fn
;
5859 BV_DELTA (new_virtual
) = integer_zero_node
;
5860 BV_VCALL_INDEX (new_virtual
) = NULL_TREE
;
5862 TREE_CHAIN (new_virtual
) = *virtuals_p
;
5863 *virtuals_p
= new_virtual
;
5866 /* If we couldn't find an appropriate base class, create a new field
5867 here. Even if there weren't any new virtual functions, we might need a
5868 new virtual function table if we're supposed to include vptrs in
5869 all classes that need them. */
5870 if (!TYPE_VFIELD (t
) && (*virtuals_p
|| TYPE_CONTAINS_VPTR_P (t
)))
5872 /* We build this decl with vtbl_ptr_type_node, which is a
5873 `vtable_entry_type*'. It might seem more precise to use
5874 `vtable_entry_type (*)[N]' where N is the number of virtual
5875 functions. However, that would require the vtable pointer in
5876 base classes to have a different type than the vtable pointer
5877 in derived classes. We could make that happen, but that
5878 still wouldn't solve all the problems. In particular, the
5879 type-based alias analysis code would decide that assignments
5880 to the base class vtable pointer can't alias assignments to
5881 the derived class vtable pointer, since they have different
5882 types. Thus, in a derived class destructor, where the base
5883 class constructor was inlined, we could generate bad code for
5884 setting up the vtable pointer.
5886 Therefore, we use one type for all vtable pointers. We still
5887 use a type-correct type; it's just doesn't indicate the array
5888 bounds. That's better than using `void*' or some such; it's
5889 cleaner, and it let's the alias analysis code know that these
5890 stores cannot alias stores to void*! */
5893 field
= build_decl (input_location
,
5894 FIELD_DECL
, get_vfield_name (t
), vtbl_ptr_type_node
);
5895 DECL_VIRTUAL_P (field
) = 1;
5896 DECL_ARTIFICIAL (field
) = 1;
5897 DECL_FIELD_CONTEXT (field
) = t
;
5898 DECL_FCONTEXT (field
) = t
;
5899 if (TYPE_PACKED (t
))
5900 DECL_PACKED (field
) = 1;
5902 TYPE_VFIELD (t
) = field
;
5904 /* This class is non-empty. */
5905 CLASSTYPE_EMPTY_P (t
) = 0;
5913 /* Add OFFSET to all base types of BINFO which is a base in the
5914 hierarchy dominated by T.
5916 OFFSET, which is a type offset, is number of bytes. */
5919 propagate_binfo_offsets (tree binfo
, tree offset
)
5925 /* Update BINFO's offset. */
5926 BINFO_OFFSET (binfo
)
5927 = convert (sizetype
,
5928 size_binop (PLUS_EXPR
,
5929 convert (ssizetype
, BINFO_OFFSET (binfo
)),
5932 /* Find the primary base class. */
5933 primary_binfo
= get_primary_binfo (binfo
);
5935 if (primary_binfo
&& BINFO_INHERITANCE_CHAIN (primary_binfo
) == binfo
)
5936 propagate_binfo_offsets (primary_binfo
, offset
);
5938 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
5940 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5942 /* Don't do the primary base twice. */
5943 if (base_binfo
== primary_binfo
)
5946 if (BINFO_VIRTUAL_P (base_binfo
))
5949 propagate_binfo_offsets (base_binfo
, offset
);
5953 /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update
5954 TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of
5955 empty subobjects of T. */
5958 layout_virtual_bases (record_layout_info rli
, splay_tree offsets
)
5964 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t
)) == 0)
5967 /* Find the last field. The artificial fields created for virtual
5968 bases will go after the last extant field to date. */
5969 next_field
= &TYPE_FIELDS (t
);
5971 next_field
= &DECL_CHAIN (*next_field
);
5973 /* Go through the virtual bases, allocating space for each virtual
5974 base that is not already a primary base class. These are
5975 allocated in inheritance graph order. */
5976 for (vbase
= TYPE_BINFO (t
); vbase
; vbase
= TREE_CHAIN (vbase
))
5978 if (!BINFO_VIRTUAL_P (vbase
))
5981 if (!BINFO_PRIMARY_P (vbase
))
5983 /* This virtual base is not a primary base of any class in the
5984 hierarchy, so we have to add space for it. */
5985 next_field
= build_base_field (rli
, vbase
,
5986 offsets
, next_field
);
5991 /* Returns the offset of the byte just past the end of the base class
5995 end_of_base (tree binfo
)
5999 if (!CLASSTYPE_AS_BASE (BINFO_TYPE (binfo
)))
6000 size
= TYPE_SIZE_UNIT (char_type_node
);
6001 else if (is_empty_class (BINFO_TYPE (binfo
)))
6002 /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to
6003 allocate some space for it. It cannot have virtual bases, so
6004 TYPE_SIZE_UNIT is fine. */
6005 size
= TYPE_SIZE_UNIT (BINFO_TYPE (binfo
));
6007 size
= CLASSTYPE_SIZE_UNIT (BINFO_TYPE (binfo
));
6009 return size_binop (PLUS_EXPR
, BINFO_OFFSET (binfo
), size
);
6012 /* Returns the offset of the byte just past the end of the base class
6013 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
6014 only non-virtual bases are included. */
6017 end_of_class (tree t
, int include_virtuals_p
)
6019 tree result
= size_zero_node
;
6020 vec
<tree
, va_gc
> *vbases
;
6026 for (binfo
= TYPE_BINFO (t
), i
= 0;
6027 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
6029 if (!include_virtuals_p
6030 && BINFO_VIRTUAL_P (base_binfo
)
6031 && (!BINFO_PRIMARY_P (base_binfo
)
6032 || BINFO_INHERITANCE_CHAIN (base_binfo
) != TYPE_BINFO (t
)))
6035 offset
= end_of_base (base_binfo
);
6036 if (tree_int_cst_lt (result
, offset
))
6040 if (include_virtuals_p
)
6041 for (vbases
= CLASSTYPE_VBASECLASSES (t
), i
= 0;
6042 vec_safe_iterate (vbases
, i
, &base_binfo
); i
++)
6044 offset
= end_of_base (base_binfo
);
6045 if (tree_int_cst_lt (result
, offset
))
6052 /* Warn about bases of T that are inaccessible because they are
6053 ambiguous. For example:
6056 struct T : public S {};
6057 struct U : public S, public T {};
6059 Here, `(S*) new U' is not allowed because there are two `S'
6063 warn_about_ambiguous_bases (tree t
)
6066 vec
<tree
, va_gc
> *vbases
;
6071 /* If there are no repeated bases, nothing can be ambiguous. */
6072 if (!CLASSTYPE_REPEATED_BASE_P (t
))
6075 /* Check direct bases. */
6076 for (binfo
= TYPE_BINFO (t
), i
= 0;
6077 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
6079 basetype
= BINFO_TYPE (base_binfo
);
6081 if (!uniquely_derived_from_p (basetype
, t
))
6082 warning (0, "direct base %qT inaccessible in %qT due to ambiguity",
6086 /* Check for ambiguous virtual bases. */
6088 for (vbases
= CLASSTYPE_VBASECLASSES (t
), i
= 0;
6089 vec_safe_iterate (vbases
, i
, &binfo
); i
++)
6091 basetype
= BINFO_TYPE (binfo
);
6093 if (!uniquely_derived_from_p (basetype
, t
))
6094 warning (OPT_Wextra
, "virtual base %qT inaccessible in %qT due "
6095 "to ambiguity", basetype
, t
);
6099 /* Compare two INTEGER_CSTs K1 and K2. */
6102 splay_tree_compare_integer_csts (splay_tree_key k1
, splay_tree_key k2
)
6104 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
6107 /* Increase the size indicated in RLI to account for empty classes
6108 that are "off the end" of the class. */
6111 include_empty_classes (record_layout_info rli
)
6116 /* It might be the case that we grew the class to allocate a
6117 zero-sized base class. That won't be reflected in RLI, yet,
6118 because we are willing to overlay multiple bases at the same
6119 offset. However, now we need to make sure that RLI is big enough
6120 to reflect the entire class. */
6121 eoc
= end_of_class (rli
->t
,
6122 CLASSTYPE_AS_BASE (rli
->t
) != NULL_TREE
);
6123 rli_size
= rli_size_unit_so_far (rli
);
6124 if (TREE_CODE (rli_size
) == INTEGER_CST
6125 && tree_int_cst_lt (rli_size
, eoc
))
6127 /* The size should have been rounded to a whole byte. */
6128 gcc_assert (tree_int_cst_equal
6129 (rli
->bitpos
, round_down (rli
->bitpos
, BITS_PER_UNIT
)));
6131 = size_binop (PLUS_EXPR
,
6133 size_binop (MULT_EXPR
,
6134 convert (bitsizetype
,
6135 size_binop (MINUS_EXPR
,
6137 bitsize_int (BITS_PER_UNIT
)));
6138 normalize_rli (rli
);
6142 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
6143 BINFO_OFFSETs for all of the base-classes. Position the vtable
6144 pointer. Accumulate declared virtual functions on VIRTUALS_P. */
6147 layout_class_type (tree t
, tree
*virtuals_p
)
6149 tree non_static_data_members
;
6152 record_layout_info rli
;
6153 /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of
6154 types that appear at that offset. */
6155 splay_tree empty_base_offsets
;
6156 /* True if the last field laid out was a bit-field. */
6157 bool last_field_was_bitfield
= false;
6158 /* The location at which the next field should be inserted. */
6160 /* T, as a base class. */
6163 /* Keep track of the first non-static data member. */
6164 non_static_data_members
= TYPE_FIELDS (t
);
6166 /* Start laying out the record. */
6167 rli
= start_record_layout (t
);
6169 /* Mark all the primary bases in the hierarchy. */
6170 determine_primary_bases (t
);
6172 /* Create a pointer to our virtual function table. */
6173 vptr
= create_vtable_ptr (t
, virtuals_p
);
6175 /* The vptr is always the first thing in the class. */
6178 DECL_CHAIN (vptr
) = TYPE_FIELDS (t
);
6179 TYPE_FIELDS (t
) = vptr
;
6180 next_field
= &DECL_CHAIN (vptr
);
6181 place_field (rli
, vptr
);
6184 next_field
= &TYPE_FIELDS (t
);
6186 /* Build FIELD_DECLs for all of the non-virtual base-types. */
6187 empty_base_offsets
= splay_tree_new (splay_tree_compare_integer_csts
,
6189 build_base_fields (rli
, empty_base_offsets
, next_field
);
6191 /* Layout the non-static data members. */
6192 for (field
= non_static_data_members
; field
; field
= DECL_CHAIN (field
))
6197 /* We still pass things that aren't non-static data members to
6198 the back end, in case it wants to do something with them. */
6199 if (TREE_CODE (field
) != FIELD_DECL
)
6201 place_field (rli
, field
);
6202 /* If the static data member has incomplete type, keep track
6203 of it so that it can be completed later. (The handling
6204 of pending statics in finish_record_layout is
6205 insufficient; consider:
6208 struct S2 { static S1 s1; };
6210 At this point, finish_record_layout will be called, but
6211 S1 is still incomplete.) */
6214 maybe_register_incomplete_var (field
);
6215 /* The visibility of static data members is determined
6216 at their point of declaration, not their point of
6218 determine_visibility (field
);
6223 type
= TREE_TYPE (field
);
6224 if (type
== error_mark_node
)
6227 padding
= NULL_TREE
;
6229 /* If this field is a bit-field whose width is greater than its
6230 type, then there are some special rules for allocating
6232 if (DECL_C_BIT_FIELD (field
)
6233 && tree_int_cst_lt (TYPE_SIZE (type
), DECL_SIZE (field
)))
6237 bool was_unnamed_p
= false;
6238 /* We must allocate the bits as if suitably aligned for the
6239 longest integer type that fits in this many bits. type
6240 of the field. Then, we are supposed to use the left over
6241 bits as additional padding. */
6242 for (itk
= itk_char
; itk
!= itk_none
; ++itk
)
6243 if (integer_types
[itk
] != NULL_TREE
6244 && (tree_int_cst_lt (size_int (MAX_FIXED_MODE_SIZE
),
6245 TYPE_SIZE (integer_types
[itk
]))
6246 || tree_int_cst_lt (DECL_SIZE (field
),
6247 TYPE_SIZE (integer_types
[itk
]))))
6250 /* ITK now indicates a type that is too large for the
6251 field. We have to back up by one to find the largest
6256 integer_type
= integer_types
[itk
];
6257 } while (itk
> 0 && integer_type
== NULL_TREE
);
6259 /* Figure out how much additional padding is required. */
6260 if (tree_int_cst_lt (TYPE_SIZE (integer_type
), DECL_SIZE (field
)))
6262 if (TREE_CODE (t
) == UNION_TYPE
)
6263 /* In a union, the padding field must have the full width
6264 of the bit-field; all fields start at offset zero. */
6265 padding
= DECL_SIZE (field
);
6267 padding
= size_binop (MINUS_EXPR
, DECL_SIZE (field
),
6268 TYPE_SIZE (integer_type
));
6271 /* An unnamed bitfield does not normally affect the
6272 alignment of the containing class on a target where
6273 PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not
6274 make any exceptions for unnamed bitfields when the
6275 bitfields are longer than their types. Therefore, we
6276 temporarily give the field a name. */
6277 if (PCC_BITFIELD_TYPE_MATTERS
&& !DECL_NAME (field
))
6279 was_unnamed_p
= true;
6280 DECL_NAME (field
) = make_anon_name ();
6283 DECL_SIZE (field
) = TYPE_SIZE (integer_type
);
6284 DECL_ALIGN (field
) = TYPE_ALIGN (integer_type
);
6285 DECL_USER_ALIGN (field
) = TYPE_USER_ALIGN (integer_type
);
6286 layout_nonempty_base_or_field (rli
, field
, NULL_TREE
,
6287 empty_base_offsets
);
6289 DECL_NAME (field
) = NULL_TREE
;
6290 /* Now that layout has been performed, set the size of the
6291 field to the size of its declared type; the rest of the
6292 field is effectively invisible. */
6293 DECL_SIZE (field
) = TYPE_SIZE (type
);
6294 /* We must also reset the DECL_MODE of the field. */
6295 DECL_MODE (field
) = TYPE_MODE (type
);
6298 layout_nonempty_base_or_field (rli
, field
, NULL_TREE
,
6299 empty_base_offsets
);
6301 /* Remember the location of any empty classes in FIELD. */
6302 record_subobject_offsets (TREE_TYPE (field
),
6303 byte_position(field
),
6305 /*is_data_member=*/true);
6307 /* If a bit-field does not immediately follow another bit-field,
6308 and yet it starts in the middle of a byte, we have failed to
6309 comply with the ABI. */
6311 && DECL_C_BIT_FIELD (field
)
6312 /* The TREE_NO_WARNING flag gets set by Objective-C when
6313 laying out an Objective-C class. The ObjC ABI differs
6314 from the C++ ABI, and so we do not want a warning
6316 && !TREE_NO_WARNING (field
)
6317 && !last_field_was_bitfield
6318 && !integer_zerop (size_binop (TRUNC_MOD_EXPR
,
6319 DECL_FIELD_BIT_OFFSET (field
),
6320 bitsize_unit_node
)))
6321 warning (OPT_Wabi
, "offset of %q+D is not ABI-compliant and may "
6322 "change in a future version of GCC", field
);
6324 /* The middle end uses the type of expressions to determine the
6325 possible range of expression values. In order to optimize
6326 "x.i > 7" to "false" for a 2-bit bitfield "i", the middle end
6327 must be made aware of the width of "i", via its type.
6329 Because C++ does not have integer types of arbitrary width,
6330 we must (for the purposes of the front end) convert from the
6331 type assigned here to the declared type of the bitfield
6332 whenever a bitfield expression is used as an rvalue.
6333 Similarly, when assigning a value to a bitfield, the value
6334 must be converted to the type given the bitfield here. */
6335 if (DECL_C_BIT_FIELD (field
))
6337 unsigned HOST_WIDE_INT width
;
6338 tree ftype
= TREE_TYPE (field
);
6339 width
= tree_to_uhwi (DECL_SIZE (field
));
6340 if (width
!= TYPE_PRECISION (ftype
))
6343 = c_build_bitfield_integer_type (width
,
6344 TYPE_UNSIGNED (ftype
));
6346 = cp_build_qualified_type (TREE_TYPE (field
),
6347 cp_type_quals (ftype
));
6351 /* If we needed additional padding after this field, add it
6357 padding_field
= build_decl (input_location
,
6361 DECL_BIT_FIELD (padding_field
) = 1;
6362 DECL_SIZE (padding_field
) = padding
;
6363 DECL_CONTEXT (padding_field
) = t
;
6364 DECL_ARTIFICIAL (padding_field
) = 1;
6365 DECL_IGNORED_P (padding_field
) = 1;
6366 layout_nonempty_base_or_field (rli
, padding_field
,
6368 empty_base_offsets
);
6371 last_field_was_bitfield
= DECL_C_BIT_FIELD (field
);
6374 if (!integer_zerop (rli
->bitpos
))
6376 /* Make sure that we are on a byte boundary so that the size of
6377 the class without virtual bases will always be a round number
6379 rli
->bitpos
= round_up_loc (input_location
, rli
->bitpos
, BITS_PER_UNIT
);
6380 normalize_rli (rli
);
6383 /* Delete all zero-width bit-fields from the list of fields. Now
6384 that the type is laid out they are no longer important. */
6385 remove_zero_width_bit_fields (t
);
6387 /* Create the version of T used for virtual bases. We do not use
6388 make_class_type for this version; this is an artificial type. For
6389 a POD type, we just reuse T. */
6390 if (CLASSTYPE_NON_LAYOUT_POD_P (t
) || CLASSTYPE_EMPTY_P (t
))
6392 base_t
= make_node (TREE_CODE (t
));
6394 /* Set the size and alignment for the new type. */
6397 /* If the ABI version is not at least two, and the last
6398 field was a bit-field, RLI may not be on a byte
6399 boundary. In particular, rli_size_unit_so_far might
6400 indicate the last complete byte, while rli_size_so_far
6401 indicates the total number of bits used. Therefore,
6402 rli_size_so_far, rather than rli_size_unit_so_far, is
6403 used to compute TYPE_SIZE_UNIT. */
6404 eoc
= end_of_class (t
, /*include_virtuals_p=*/0);
6405 TYPE_SIZE_UNIT (base_t
)
6406 = size_binop (MAX_EXPR
,
6408 size_binop (CEIL_DIV_EXPR
,
6409 rli_size_so_far (rli
),
6410 bitsize_int (BITS_PER_UNIT
))),
6413 = size_binop (MAX_EXPR
,
6414 rli_size_so_far (rli
),
6415 size_binop (MULT_EXPR
,
6416 convert (bitsizetype
, eoc
),
6417 bitsize_int (BITS_PER_UNIT
)));
6418 TYPE_ALIGN (base_t
) = rli
->record_align
;
6419 TYPE_USER_ALIGN (base_t
) = TYPE_USER_ALIGN (t
);
6421 /* Copy the fields from T. */
6422 next_field
= &TYPE_FIELDS (base_t
);
6423 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
6424 if (TREE_CODE (field
) == FIELD_DECL
)
6426 *next_field
= build_decl (input_location
,
6430 DECL_CONTEXT (*next_field
) = base_t
;
6431 DECL_FIELD_OFFSET (*next_field
) = DECL_FIELD_OFFSET (field
);
6432 DECL_FIELD_BIT_OFFSET (*next_field
)
6433 = DECL_FIELD_BIT_OFFSET (field
);
6434 DECL_SIZE (*next_field
) = DECL_SIZE (field
);
6435 DECL_MODE (*next_field
) = DECL_MODE (field
);
6436 next_field
= &DECL_CHAIN (*next_field
);
6439 /* Record the base version of the type. */
6440 CLASSTYPE_AS_BASE (t
) = base_t
;
6441 TYPE_CONTEXT (base_t
) = t
;
6444 CLASSTYPE_AS_BASE (t
) = t
;
6446 /* Every empty class contains an empty class. */
6447 if (CLASSTYPE_EMPTY_P (t
))
6448 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 1;
6450 /* Set the TYPE_DECL for this type to contain the right
6451 value for DECL_OFFSET, so that we can use it as part
6452 of a COMPONENT_REF for multiple inheritance. */
6453 layout_decl (TYPE_MAIN_DECL (t
), 0);
6455 /* Now fix up any virtual base class types that we left lying
6456 around. We must get these done before we try to lay out the
6457 virtual function table. As a side-effect, this will remove the
6458 base subobject fields. */
6459 layout_virtual_bases (rli
, empty_base_offsets
);
6461 /* Make sure that empty classes are reflected in RLI at this
6463 include_empty_classes(rli
);
6465 /* Make sure not to create any structures with zero size. */
6466 if (integer_zerop (rli_size_unit_so_far (rli
)) && CLASSTYPE_EMPTY_P (t
))
6468 build_decl (input_location
,
6469 FIELD_DECL
, NULL_TREE
, char_type_node
));
6471 /* If this is a non-POD, declaring it packed makes a difference to how it
6472 can be used as a field; don't let finalize_record_size undo it. */
6473 if (TYPE_PACKED (t
) && !layout_pod_type_p (t
))
6474 rli
->packed_maybe_necessary
= true;
6476 /* Let the back end lay out the type. */
6477 finish_record_layout (rli
, /*free_p=*/true);
6479 if (TYPE_SIZE_UNIT (t
)
6480 && TREE_CODE (TYPE_SIZE_UNIT (t
)) == INTEGER_CST
6481 && !TREE_OVERFLOW (TYPE_SIZE_UNIT (t
))
6482 && !valid_constant_size_p (TYPE_SIZE_UNIT (t
)))
6483 error ("type %qT is too large", t
);
6485 /* Warn about bases that can't be talked about due to ambiguity. */
6486 warn_about_ambiguous_bases (t
);
6488 /* Now that we're done with layout, give the base fields the real types. */
6489 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
6490 if (DECL_ARTIFICIAL (field
) && IS_FAKE_BASE_TYPE (TREE_TYPE (field
)))
6491 TREE_TYPE (field
) = TYPE_CONTEXT (TREE_TYPE (field
));
6494 splay_tree_delete (empty_base_offsets
);
6496 if (CLASSTYPE_EMPTY_P (t
)
6497 && tree_int_cst_lt (sizeof_biggest_empty_class
,
6498 TYPE_SIZE_UNIT (t
)))
6499 sizeof_biggest_empty_class
= TYPE_SIZE_UNIT (t
);
6502 /* Determine the "key method" for the class type indicated by TYPE,
6503 and set CLASSTYPE_KEY_METHOD accordingly. */
6506 determine_key_method (tree type
)
6510 if (TYPE_FOR_JAVA (type
)
6511 || processing_template_decl
6512 || CLASSTYPE_TEMPLATE_INSTANTIATION (type
)
6513 || CLASSTYPE_INTERFACE_KNOWN (type
))
6516 /* The key method is the first non-pure virtual function that is not
6517 inline at the point of class definition. On some targets the
6518 key function may not be inline; those targets should not call
6519 this function until the end of the translation unit. */
6520 for (method
= TYPE_METHODS (type
); method
!= NULL_TREE
;
6521 method
= DECL_CHAIN (method
))
6522 if (TREE_CODE (method
) == FUNCTION_DECL
6523 && DECL_VINDEX (method
) != NULL_TREE
6524 && ! DECL_DECLARED_INLINE_P (method
)
6525 && ! DECL_PURE_VIRTUAL_P (method
))
6527 CLASSTYPE_KEY_METHOD (type
) = method
;
6535 /* Allocate and return an instance of struct sorted_fields_type with
6538 static struct sorted_fields_type
*
6539 sorted_fields_type_new (int n
)
6541 struct sorted_fields_type
*sft
;
6542 sft
= (sorted_fields_type
*) ggc_internal_alloc (sizeof (sorted_fields_type
)
6543 + n
* sizeof (tree
));
6550 /* Perform processing required when the definition of T (a class type)
6554 finish_struct_1 (tree t
)
6557 /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */
6558 tree virtuals
= NULL_TREE
;
6560 if (COMPLETE_TYPE_P (t
))
6562 gcc_assert (MAYBE_CLASS_TYPE_P (t
));
6563 error ("redefinition of %q#T", t
);
6568 /* If this type was previously laid out as a forward reference,
6569 make sure we lay it out again. */
6570 TYPE_SIZE (t
) = NULL_TREE
;
6571 CLASSTYPE_PRIMARY_BINFO (t
) = NULL_TREE
;
6573 /* Make assumptions about the class; we'll reset the flags if
6575 CLASSTYPE_EMPTY_P (t
) = 1;
6576 CLASSTYPE_NEARLY_EMPTY_P (t
) = 1;
6577 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 0;
6578 CLASSTYPE_LITERAL_P (t
) = true;
6580 /* Do end-of-class semantic processing: checking the validity of the
6581 bases and members and add implicitly generated methods. */
6582 check_bases_and_members (t
);
6584 /* Find the key method. */
6585 if (TYPE_CONTAINS_VPTR_P (t
))
6587 /* The Itanium C++ ABI permits the key method to be chosen when
6588 the class is defined -- even though the key method so
6589 selected may later turn out to be an inline function. On
6590 some systems (such as ARM Symbian OS) the key method cannot
6591 be determined until the end of the translation unit. On such
6592 systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which
6593 will cause the class to be added to KEYED_CLASSES. Then, in
6594 finish_file we will determine the key method. */
6595 if (targetm
.cxx
.key_method_may_be_inline ())
6596 determine_key_method (t
);
6598 /* If a polymorphic class has no key method, we may emit the vtable
6599 in every translation unit where the class definition appears. If
6600 we're devirtualizing, we can look into the vtable even if we
6601 aren't emitting it. */
6602 if (CLASSTYPE_KEY_METHOD (t
) == NULL_TREE
)
6603 keyed_classes
= tree_cons (NULL_TREE
, t
, keyed_classes
);
6606 /* Layout the class itself. */
6607 layout_class_type (t
, &virtuals
);
6608 if (CLASSTYPE_AS_BASE (t
) != t
)
6609 /* We use the base type for trivial assignments, and hence it
6611 compute_record_mode (CLASSTYPE_AS_BASE (t
));
6613 virtuals
= modify_all_vtables (t
, nreverse (virtuals
));
6615 /* If necessary, create the primary vtable for this class. */
6616 if (virtuals
|| TYPE_CONTAINS_VPTR_P (t
))
6618 /* We must enter these virtuals into the table. */
6619 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
6620 build_primary_vtable (NULL_TREE
, t
);
6621 else if (! BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (t
)))
6622 /* Here we know enough to change the type of our virtual
6623 function table, but we will wait until later this function. */
6624 build_primary_vtable (CLASSTYPE_PRIMARY_BINFO (t
), t
);
6626 /* If we're warning about ABI tags, check the types of the new
6627 virtual functions. */
6629 for (tree v
= virtuals
; v
; v
= TREE_CHAIN (v
))
6630 check_abi_tags (t
, TREE_VALUE (v
));
6633 if (TYPE_CONTAINS_VPTR_P (t
))
6638 if (BINFO_VTABLE (TYPE_BINFO (t
)))
6639 gcc_assert (DECL_VIRTUAL_P (BINFO_VTABLE (TYPE_BINFO (t
))));
6640 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
6641 gcc_assert (BINFO_VIRTUALS (TYPE_BINFO (t
)) == NULL_TREE
);
6643 /* Add entries for virtual functions introduced by this class. */
6644 BINFO_VIRTUALS (TYPE_BINFO (t
))
6645 = chainon (BINFO_VIRTUALS (TYPE_BINFO (t
)), virtuals
);
6647 /* Set DECL_VINDEX for all functions declared in this class. */
6648 for (vindex
= 0, fn
= BINFO_VIRTUALS (TYPE_BINFO (t
));
6650 fn
= TREE_CHAIN (fn
),
6651 vindex
+= (TARGET_VTABLE_USES_DESCRIPTORS
6652 ? TARGET_VTABLE_USES_DESCRIPTORS
: 1))
6654 tree fndecl
= BV_FN (fn
);
6656 if (DECL_THUNK_P (fndecl
))
6657 /* A thunk. We should never be calling this entry directly
6658 from this vtable -- we'd use the entry for the non
6659 thunk base function. */
6660 DECL_VINDEX (fndecl
) = NULL_TREE
;
6661 else if (TREE_CODE (DECL_VINDEX (fndecl
)) != INTEGER_CST
)
6662 DECL_VINDEX (fndecl
) = build_int_cst (NULL_TREE
, vindex
);
6666 finish_struct_bits (t
);
6667 set_method_tm_attributes (t
);
6669 /* Complete the rtl for any static member objects of the type we're
6671 for (x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
6672 if (VAR_P (x
) && TREE_STATIC (x
)
6673 && TREE_TYPE (x
) != error_mark_node
6674 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (x
)), t
))
6675 DECL_MODE (x
) = TYPE_MODE (t
);
6677 /* Done with FIELDS...now decide whether to sort these for
6678 faster lookups later.
6680 We use a small number because most searches fail (succeeding
6681 ultimately as the search bores through the inheritance
6682 hierarchy), and we want this failure to occur quickly. */
6684 insert_into_classtype_sorted_fields (TYPE_FIELDS (t
), t
, 8);
6686 /* Complain if one of the field types requires lower visibility. */
6687 constrain_class_visibility (t
);
6689 /* Make the rtl for any new vtables we have created, and unmark
6690 the base types we marked. */
6693 /* Build the VTT for T. */
6696 /* This warning does not make sense for Java classes, since they
6697 cannot have destructors. */
6698 if (!TYPE_FOR_JAVA (t
) && warn_nonvdtor
6699 && TYPE_POLYMORPHIC_P (t
) && accessible_nvdtor_p (t
)
6700 && !CLASSTYPE_FINAL (t
))
6701 warning (OPT_Wnon_virtual_dtor
,
6702 "%q#T has virtual functions and accessible"
6703 " non-virtual destructor", t
);
6707 if (warn_overloaded_virtual
)
6710 /* Class layout, assignment of virtual table slots, etc., is now
6711 complete. Give the back end a chance to tweak the visibility of
6712 the class or perform any other required target modifications. */
6713 targetm
.cxx
.adjust_class_at_definition (t
);
6715 maybe_suppress_debug_info (t
);
6717 if (flag_vtable_verify
)
6718 vtv_save_class_info (t
);
6720 dump_class_hierarchy (t
);
6722 /* Finish debugging output for this type. */
6723 rest_of_type_compilation (t
, ! LOCAL_CLASS_P (t
));
6725 if (TYPE_TRANSPARENT_AGGR (t
))
6727 tree field
= first_field (t
);
6728 if (field
== NULL_TREE
|| error_operand_p (field
))
6730 error ("type transparent %q#T does not have any fields", t
);
6731 TYPE_TRANSPARENT_AGGR (t
) = 0;
6733 else if (DECL_ARTIFICIAL (field
))
6735 if (DECL_FIELD_IS_BASE (field
))
6736 error ("type transparent class %qT has base classes", t
);
6739 gcc_checking_assert (DECL_VIRTUAL_P (field
));
6740 error ("type transparent class %qT has virtual functions", t
);
6742 TYPE_TRANSPARENT_AGGR (t
) = 0;
6744 else if (TYPE_MODE (t
) != DECL_MODE (field
))
6746 error ("type transparent %q#T cannot be made transparent because "
6747 "the type of the first field has a different ABI from the "
6748 "class overall", t
);
6749 TYPE_TRANSPARENT_AGGR (t
) = 0;
6754 /* Insert FIELDS into T for the sorted case if the FIELDS count is
6755 equal to THRESHOLD or greater than THRESHOLD. */
6758 insert_into_classtype_sorted_fields (tree fields
, tree t
, int threshold
)
6760 int n_fields
= count_fields (fields
);
6761 if (n_fields
>= threshold
)
6763 struct sorted_fields_type
*field_vec
= sorted_fields_type_new (n_fields
);
6764 add_fields_to_record_type (fields
, field_vec
, 0);
6765 qsort (field_vec
->elts
, n_fields
, sizeof (tree
), field_decl_cmp
);
6766 CLASSTYPE_SORTED_FIELDS (t
) = field_vec
;
6770 /* Insert lately defined enum ENUMTYPE into T for the sorted case. */
6773 insert_late_enum_def_into_classtype_sorted_fields (tree enumtype
, tree t
)
6775 struct sorted_fields_type
*sorted_fields
= CLASSTYPE_SORTED_FIELDS (t
);
6780 = list_length (TYPE_VALUES (enumtype
)) + sorted_fields
->len
;
6781 struct sorted_fields_type
*field_vec
= sorted_fields_type_new (n_fields
);
6783 for (i
= 0; i
< sorted_fields
->len
; ++i
)
6784 field_vec
->elts
[i
] = sorted_fields
->elts
[i
];
6786 add_enum_fields_to_record_type (enumtype
, field_vec
,
6787 sorted_fields
->len
);
6788 qsort (field_vec
->elts
, n_fields
, sizeof (tree
), field_decl_cmp
);
6789 CLASSTYPE_SORTED_FIELDS (t
) = field_vec
;
6793 /* When T was built up, the member declarations were added in reverse
6794 order. Rearrange them to declaration order. */
6797 unreverse_member_declarations (tree t
)
6803 /* The following lists are all in reverse order. Put them in
6804 declaration order now. */
6805 TYPE_METHODS (t
) = nreverse (TYPE_METHODS (t
));
6806 CLASSTYPE_DECL_LIST (t
) = nreverse (CLASSTYPE_DECL_LIST (t
));
6808 /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in
6809 reverse order, so we can't just use nreverse. */
6811 for (x
= TYPE_FIELDS (t
);
6812 x
&& TREE_CODE (x
) != TYPE_DECL
;
6815 next
= DECL_CHAIN (x
);
6816 DECL_CHAIN (x
) = prev
;
6821 DECL_CHAIN (TYPE_FIELDS (t
)) = x
;
6823 TYPE_FIELDS (t
) = prev
;
6828 finish_struct (tree t
, tree attributes
)
6830 location_t saved_loc
= input_location
;
6832 /* Now that we've got all the field declarations, reverse everything
6834 unreverse_member_declarations (t
);
6836 cplus_decl_attributes (&t
, attributes
, (int) ATTR_FLAG_TYPE_IN_PLACE
);
6838 /* Nadger the current location so that diagnostics point to the start of
6839 the struct, not the end. */
6840 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (t
));
6842 if (processing_template_decl
)
6846 finish_struct_methods (t
);
6847 TYPE_SIZE (t
) = bitsize_zero_node
;
6848 TYPE_SIZE_UNIT (t
) = size_zero_node
;
6850 /* We need to emit an error message if this type was used as a parameter
6851 and it is an abstract type, even if it is a template. We construct
6852 a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into
6853 account and we call complete_vars with this type, which will check
6854 the PARM_DECLS. Note that while the type is being defined,
6855 CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends
6856 (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */
6857 CLASSTYPE_PURE_VIRTUALS (t
) = NULL
;
6858 for (x
= TYPE_METHODS (t
); x
; x
= DECL_CHAIN (x
))
6859 if (DECL_PURE_VIRTUAL_P (x
))
6860 vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t
), x
);
6862 /* We need to add the target functions to the CLASSTYPE_METHOD_VEC if
6863 an enclosing scope is a template class, so that this function be
6864 found by lookup_fnfields_1 when the using declaration is not
6865 instantiated yet. */
6866 for (x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
6867 if (TREE_CODE (x
) == USING_DECL
)
6869 tree fn
= strip_using_decl (x
);
6870 if (is_overloaded_fn (fn
))
6871 for (; fn
; fn
= OVL_NEXT (fn
))
6872 add_method (t
, OVL_CURRENT (fn
), x
);
6875 /* Remember current #pragma pack value. */
6876 TYPE_PRECISION (t
) = maximum_field_alignment
;
6878 /* Fix up any variants we've already built. */
6879 for (x
= TYPE_NEXT_VARIANT (t
); x
; x
= TYPE_NEXT_VARIANT (x
))
6881 TYPE_SIZE (x
) = TYPE_SIZE (t
);
6882 TYPE_SIZE_UNIT (x
) = TYPE_SIZE_UNIT (t
);
6883 TYPE_FIELDS (x
) = TYPE_FIELDS (t
);
6884 TYPE_METHODS (x
) = TYPE_METHODS (t
);
6888 finish_struct_1 (t
);
6890 if (is_std_init_list (t
))
6892 /* People keep complaining that the compiler crashes on an invalid
6893 definition of initializer_list, so I guess we should explicitly
6894 reject it. What the compiler internals care about is that it's a
6895 template and has a pointer field followed by an integer field. */
6897 if (processing_template_decl
)
6899 tree f
= next_initializable_field (TYPE_FIELDS (t
));
6900 if (f
&& TREE_CODE (TREE_TYPE (f
)) == POINTER_TYPE
)
6902 f
= next_initializable_field (DECL_CHAIN (f
));
6903 if (f
&& same_type_p (TREE_TYPE (f
), size_type_node
))
6908 fatal_error (input_location
,
6909 "definition of std::initializer_list does not match "
6910 "#include <initializer_list>");
6913 input_location
= saved_loc
;
6915 TYPE_BEING_DEFINED (t
) = 0;
6917 if (current_class_type
)
6920 error ("trying to finish struct, but kicked out due to previous parse errors");
6922 if (processing_template_decl
&& at_function_scope_p ()
6923 /* Lambdas are defined by the LAMBDA_EXPR. */
6924 && !LAMBDA_TYPE_P (t
))
6925 add_stmt (build_min (TAG_DEFN
, t
));
6930 /* Hash table to avoid endless recursion when handling references. */
6931 static hash_table
<pointer_hash
<tree_node
> > *fixed_type_or_null_ref_ht
;
6933 /* Return the dynamic type of INSTANCE, if known.
6934 Used to determine whether the virtual function table is needed
6937 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
6938 of our knowledge of its type. *NONNULL should be initialized
6939 before this function is called. */
6942 fixed_type_or_null (tree instance
, int *nonnull
, int *cdtorp
)
6944 #define RECUR(T) fixed_type_or_null((T), nonnull, cdtorp)
6946 switch (TREE_CODE (instance
))
6949 if (POINTER_TYPE_P (TREE_TYPE (instance
)))
6952 return RECUR (TREE_OPERAND (instance
, 0));
6955 /* This is a call to a constructor, hence it's never zero. */
6956 if (TREE_HAS_CONSTRUCTOR (instance
))
6960 return TREE_TYPE (instance
);
6965 /* This is a call to a constructor, hence it's never zero. */
6966 if (TREE_HAS_CONSTRUCTOR (instance
))
6970 return TREE_TYPE (instance
);
6972 return RECUR (TREE_OPERAND (instance
, 0));
6974 case POINTER_PLUS_EXPR
:
6977 if (TREE_CODE (TREE_OPERAND (instance
, 0)) == ADDR_EXPR
)
6978 return RECUR (TREE_OPERAND (instance
, 0));
6979 if (TREE_CODE (TREE_OPERAND (instance
, 1)) == INTEGER_CST
)
6980 /* Propagate nonnull. */
6981 return RECUR (TREE_OPERAND (instance
, 0));
6986 return RECUR (TREE_OPERAND (instance
, 0));
6989 instance
= TREE_OPERAND (instance
, 0);
6992 /* Just because we see an ADDR_EXPR doesn't mean we're dealing
6993 with a real object -- given &p->f, p can still be null. */
6994 tree t
= get_base_address (instance
);
6995 /* ??? Probably should check DECL_WEAK here. */
6996 if (t
&& DECL_P (t
))
6999 return RECUR (instance
);
7002 /* If this component is really a base class reference, then the field
7003 itself isn't definitive. */
7004 if (DECL_FIELD_IS_BASE (TREE_OPERAND (instance
, 1)))
7005 return RECUR (TREE_OPERAND (instance
, 0));
7006 return RECUR (TREE_OPERAND (instance
, 1));
7010 if (TREE_CODE (TREE_TYPE (instance
)) == ARRAY_TYPE
7011 && MAYBE_CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (instance
))))
7015 return TREE_TYPE (TREE_TYPE (instance
));
7017 /* fall through... */
7021 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (instance
)))
7025 return TREE_TYPE (instance
);
7027 else if (instance
== current_class_ptr
)
7032 /* if we're in a ctor or dtor, we know our type. If
7033 current_class_ptr is set but we aren't in a function, we're in
7034 an NSDMI (and therefore a constructor). */
7035 if (current_scope () != current_function_decl
7036 || (DECL_LANG_SPECIFIC (current_function_decl
)
7037 && (DECL_CONSTRUCTOR_P (current_function_decl
)
7038 || DECL_DESTRUCTOR_P (current_function_decl
))))
7042 return TREE_TYPE (TREE_TYPE (instance
));
7045 else if (TREE_CODE (TREE_TYPE (instance
)) == REFERENCE_TYPE
)
7047 /* We only need one hash table because it is always left empty. */
7048 if (!fixed_type_or_null_ref_ht
)
7049 fixed_type_or_null_ref_ht
7050 = new hash_table
<pointer_hash
<tree_node
> > (37);
7052 /* Reference variables should be references to objects. */
7056 /* Enter the INSTANCE in a table to prevent recursion; a
7057 variable's initializer may refer to the variable
7059 if (VAR_P (instance
)
7060 && DECL_INITIAL (instance
)
7061 && !type_dependent_expression_p_push (DECL_INITIAL (instance
))
7062 && !fixed_type_or_null_ref_ht
->find (instance
))
7067 slot
= fixed_type_or_null_ref_ht
->find_slot (instance
, INSERT
);
7069 type
= RECUR (DECL_INITIAL (instance
));
7070 fixed_type_or_null_ref_ht
->remove_elt (instance
);
7083 /* Return nonzero if the dynamic type of INSTANCE is known, and
7084 equivalent to the static type. We also handle the case where
7085 INSTANCE is really a pointer. Return negative if this is a
7086 ctor/dtor. There the dynamic type is known, but this might not be
7087 the most derived base of the original object, and hence virtual
7088 bases may not be laid out according to this type.
7090 Used to determine whether the virtual function table is needed
7093 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
7094 of our knowledge of its type. *NONNULL should be initialized
7095 before this function is called. */
7098 resolves_to_fixed_type_p (tree instance
, int* nonnull
)
7100 tree t
= TREE_TYPE (instance
);
7104 /* processing_template_decl can be false in a template if we're in
7105 instantiate_non_dependent_expr, but we still want to suppress
7107 if (in_template_function ())
7109 /* In a template we only care about the type of the result. */
7115 fixed
= fixed_type_or_null (instance
, nonnull
, &cdtorp
);
7116 if (fixed
== NULL_TREE
)
7118 if (POINTER_TYPE_P (t
))
7120 if (!same_type_ignoring_top_level_qualifiers_p (t
, fixed
))
7122 return cdtorp
? -1 : 1;
7127 init_class_processing (void)
7129 current_class_depth
= 0;
7130 current_class_stack_size
= 10;
7132 = XNEWVEC (struct class_stack_node
, current_class_stack_size
);
7133 vec_alloc (local_classes
, 8);
7134 sizeof_biggest_empty_class
= size_zero_node
;
7136 ridpointers
[(int) RID_PUBLIC
] = access_public_node
;
7137 ridpointers
[(int) RID_PRIVATE
] = access_private_node
;
7138 ridpointers
[(int) RID_PROTECTED
] = access_protected_node
;
7141 /* Restore the cached PREVIOUS_CLASS_LEVEL. */
7144 restore_class_cache (void)
7148 /* We are re-entering the same class we just left, so we don't
7149 have to search the whole inheritance matrix to find all the
7150 decls to bind again. Instead, we install the cached
7151 class_shadowed list and walk through it binding names. */
7152 push_binding_level (previous_class_level
);
7153 class_binding_level
= previous_class_level
;
7154 /* Restore IDENTIFIER_TYPE_VALUE. */
7155 for (type
= class_binding_level
->type_shadowed
;
7157 type
= TREE_CHAIN (type
))
7158 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (type
), TREE_TYPE (type
));
7161 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as
7162 appropriate for TYPE.
7164 So that we may avoid calls to lookup_name, we cache the _TYPE
7165 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
7167 For multiple inheritance, we perform a two-pass depth-first search
7168 of the type lattice. */
7171 pushclass (tree type
)
7173 class_stack_node_t csn
;
7175 type
= TYPE_MAIN_VARIANT (type
);
7177 /* Make sure there is enough room for the new entry on the stack. */
7178 if (current_class_depth
+ 1 >= current_class_stack_size
)
7180 current_class_stack_size
*= 2;
7182 = XRESIZEVEC (struct class_stack_node
, current_class_stack
,
7183 current_class_stack_size
);
7186 /* Insert a new entry on the class stack. */
7187 csn
= current_class_stack
+ current_class_depth
;
7188 csn
->name
= current_class_name
;
7189 csn
->type
= current_class_type
;
7190 csn
->access
= current_access_specifier
;
7191 csn
->names_used
= 0;
7193 current_class_depth
++;
7195 /* Now set up the new type. */
7196 current_class_name
= TYPE_NAME (type
);
7197 if (TREE_CODE (current_class_name
) == TYPE_DECL
)
7198 current_class_name
= DECL_NAME (current_class_name
);
7199 current_class_type
= type
;
7201 /* By default, things in classes are private, while things in
7202 structures or unions are public. */
7203 current_access_specifier
= (CLASSTYPE_DECLARED_CLASS (type
)
7204 ? access_private_node
7205 : access_public_node
);
7207 if (previous_class_level
7208 && type
!= previous_class_level
->this_entity
7209 && current_class_depth
== 1)
7211 /* Forcibly remove any old class remnants. */
7212 invalidate_class_lookup_cache ();
7215 if (!previous_class_level
7216 || type
!= previous_class_level
->this_entity
7217 || current_class_depth
> 1)
7220 restore_class_cache ();
7223 /* When we exit a toplevel class scope, we save its binding level so
7224 that we can restore it quickly. Here, we've entered some other
7225 class, so we must invalidate our cache. */
7228 invalidate_class_lookup_cache (void)
7230 previous_class_level
= NULL
;
7233 /* Get out of the current class scope. If we were in a class scope
7234 previously, that is the one popped to. */
7241 current_class_depth
--;
7242 current_class_name
= current_class_stack
[current_class_depth
].name
;
7243 current_class_type
= current_class_stack
[current_class_depth
].type
;
7244 current_access_specifier
= current_class_stack
[current_class_depth
].access
;
7245 if (current_class_stack
[current_class_depth
].names_used
)
7246 splay_tree_delete (current_class_stack
[current_class_depth
].names_used
);
7249 /* Mark the top of the class stack as hidden. */
7252 push_class_stack (void)
7254 if (current_class_depth
)
7255 ++current_class_stack
[current_class_depth
- 1].hidden
;
7258 /* Mark the top of the class stack as un-hidden. */
7261 pop_class_stack (void)
7263 if (current_class_depth
)
7264 --current_class_stack
[current_class_depth
- 1].hidden
;
7267 /* Returns 1 if the class type currently being defined is either T or
7268 a nested type of T. */
7271 currently_open_class (tree t
)
7275 if (!CLASS_TYPE_P (t
))
7278 t
= TYPE_MAIN_VARIANT (t
);
7280 /* We start looking from 1 because entry 0 is from global scope,
7282 for (i
= current_class_depth
; i
> 0; --i
)
7285 if (i
== current_class_depth
)
7286 c
= current_class_type
;
7289 if (current_class_stack
[i
].hidden
)
7291 c
= current_class_stack
[i
].type
;
7295 if (same_type_p (c
, t
))
7301 /* If either current_class_type or one of its enclosing classes are derived
7302 from T, return the appropriate type. Used to determine how we found
7303 something via unqualified lookup. */
7306 currently_open_derived_class (tree t
)
7310 /* The bases of a dependent type are unknown. */
7311 if (dependent_type_p (t
))
7314 if (!current_class_type
)
7317 if (DERIVED_FROM_P (t
, current_class_type
))
7318 return current_class_type
;
7320 for (i
= current_class_depth
- 1; i
> 0; --i
)
7322 if (current_class_stack
[i
].hidden
)
7324 if (DERIVED_FROM_P (t
, current_class_stack
[i
].type
))
7325 return current_class_stack
[i
].type
;
7331 /* Return the outermost enclosing class type that is still open, or
7335 outermost_open_class (void)
7337 if (!current_class_type
)
7340 if (TYPE_BEING_DEFINED (current_class_type
))
7341 r
= current_class_type
;
7342 for (int i
= current_class_depth
- 1; i
> 0; --i
)
7344 if (current_class_stack
[i
].hidden
)
7346 tree t
= current_class_stack
[i
].type
;
7347 if (!TYPE_BEING_DEFINED (t
))
7354 /* Returns the innermost class type which is not a lambda closure type. */
7357 current_nonlambda_class_type (void)
7361 /* We start looking from 1 because entry 0 is from global scope,
7363 for (i
= current_class_depth
; i
> 0; --i
)
7366 if (i
== current_class_depth
)
7367 c
= current_class_type
;
7370 if (current_class_stack
[i
].hidden
)
7372 c
= current_class_stack
[i
].type
;
7376 if (!LAMBDA_TYPE_P (c
))
7382 /* When entering a class scope, all enclosing class scopes' names with
7383 static meaning (static variables, static functions, types and
7384 enumerators) have to be visible. This recursive function calls
7385 pushclass for all enclosing class contexts until global or a local
7386 scope is reached. TYPE is the enclosed class. */
7389 push_nested_class (tree type
)
7391 /* A namespace might be passed in error cases, like A::B:C. */
7392 if (type
== NULL_TREE
7393 || !CLASS_TYPE_P (type
))
7396 push_nested_class (DECL_CONTEXT (TYPE_MAIN_DECL (type
)));
7401 /* Undoes a push_nested_class call. */
7404 pop_nested_class (void)
7406 tree context
= DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type
));
7409 if (context
&& CLASS_TYPE_P (context
))
7410 pop_nested_class ();
7413 /* Returns the number of extern "LANG" blocks we are nested within. */
7416 current_lang_depth (void)
7418 return vec_safe_length (current_lang_base
);
7421 /* Set global variables CURRENT_LANG_NAME to appropriate value
7422 so that behavior of name-mangling machinery is correct. */
7425 push_lang_context (tree name
)
7427 vec_safe_push (current_lang_base
, current_lang_name
);
7429 if (name
== lang_name_cplusplus
)
7431 current_lang_name
= name
;
7433 else if (name
== lang_name_java
)
7435 current_lang_name
= name
;
7436 /* DECL_IGNORED_P is initially set for these types, to avoid clutter.
7437 (See record_builtin_java_type in decl.c.) However, that causes
7438 incorrect debug entries if these types are actually used.
7439 So we re-enable debug output after extern "Java". */
7440 DECL_IGNORED_P (TYPE_NAME (java_byte_type_node
)) = 0;
7441 DECL_IGNORED_P (TYPE_NAME (java_short_type_node
)) = 0;
7442 DECL_IGNORED_P (TYPE_NAME (java_int_type_node
)) = 0;
7443 DECL_IGNORED_P (TYPE_NAME (java_long_type_node
)) = 0;
7444 DECL_IGNORED_P (TYPE_NAME (java_float_type_node
)) = 0;
7445 DECL_IGNORED_P (TYPE_NAME (java_double_type_node
)) = 0;
7446 DECL_IGNORED_P (TYPE_NAME (java_char_type_node
)) = 0;
7447 DECL_IGNORED_P (TYPE_NAME (java_boolean_type_node
)) = 0;
7449 else if (name
== lang_name_c
)
7451 current_lang_name
= name
;
7454 error ("language string %<\"%E\"%> not recognized", name
);
7457 /* Get out of the current language scope. */
7460 pop_lang_context (void)
7462 current_lang_name
= current_lang_base
->pop ();
7465 /* Type instantiation routines. */
7467 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
7468 matches the TARGET_TYPE. If there is no satisfactory match, return
7469 error_mark_node, and issue an error & warning messages under
7470 control of FLAGS. Permit pointers to member function if FLAGS
7471 permits. If TEMPLATE_ONLY, the name of the overloaded function was
7472 a template-id, and EXPLICIT_TARGS are the explicitly provided
7475 If OVERLOAD is for one or more member functions, then ACCESS_PATH
7476 is the base path used to reference those member functions. If
7477 the address is resolved to a member function, access checks will be
7478 performed and errors issued if appropriate. */
7481 resolve_address_of_overloaded_function (tree target_type
,
7483 tsubst_flags_t complain
,
7485 tree explicit_targs
,
7488 /* Here's what the standard says:
7492 If the name is a function template, template argument deduction
7493 is done, and if the argument deduction succeeds, the deduced
7494 arguments are used to generate a single template function, which
7495 is added to the set of overloaded functions considered.
7497 Non-member functions and static member functions match targets of
7498 type "pointer-to-function" or "reference-to-function." Nonstatic
7499 member functions match targets of type "pointer-to-member
7500 function;" the function type of the pointer to member is used to
7501 select the member function from the set of overloaded member
7502 functions. If a nonstatic member function is selected, the
7503 reference to the overloaded function name is required to have the
7504 form of a pointer to member as described in 5.3.1.
7506 If more than one function is selected, any template functions in
7507 the set are eliminated if the set also contains a non-template
7508 function, and any given template function is eliminated if the
7509 set contains a second template function that is more specialized
7510 than the first according to the partial ordering rules 14.5.5.2.
7511 After such eliminations, if any, there shall remain exactly one
7512 selected function. */
7515 /* We store the matches in a TREE_LIST rooted here. The functions
7516 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
7517 interoperability with most_specialized_instantiation. */
7518 tree matches
= NULL_TREE
;
7520 tree target_fn_type
;
7522 /* By the time we get here, we should be seeing only real
7523 pointer-to-member types, not the internal POINTER_TYPE to
7524 METHOD_TYPE representation. */
7525 gcc_assert (!TYPE_PTR_P (target_type
)
7526 || TREE_CODE (TREE_TYPE (target_type
)) != METHOD_TYPE
);
7528 gcc_assert (is_overloaded_fn (overload
));
7530 /* Check that the TARGET_TYPE is reasonable. */
7531 if (TYPE_PTRFN_P (target_type
)
7532 || TYPE_REFFN_P (target_type
))
7534 else if (TYPE_PTRMEMFUNC_P (target_type
))
7535 /* This is OK, too. */
7537 else if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
7538 /* This is OK, too. This comes from a conversion to reference
7540 target_type
= build_reference_type (target_type
);
7543 if (complain
& tf_error
)
7544 error ("cannot resolve overloaded function %qD based on"
7545 " conversion to type %qT",
7546 DECL_NAME (OVL_FUNCTION (overload
)), target_type
);
7547 return error_mark_node
;
7550 /* Non-member functions and static member functions match targets of type
7551 "pointer-to-function" or "reference-to-function." Nonstatic member
7552 functions match targets of type "pointer-to-member-function;" the
7553 function type of the pointer to member is used to select the member
7554 function from the set of overloaded member functions.
7556 So figure out the FUNCTION_TYPE that we want to match against. */
7557 target_fn_type
= static_fn_type (target_type
);
7559 /* If we can find a non-template function that matches, we can just
7560 use it. There's no point in generating template instantiations
7561 if we're just going to throw them out anyhow. But, of course, we
7562 can only do this when we don't *need* a template function. */
7567 for (fns
= overload
; fns
; fns
= OVL_NEXT (fns
))
7569 tree fn
= OVL_CURRENT (fns
);
7571 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
7572 /* We're not looking for templates just yet. */
7575 if ((TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7577 /* We're looking for a non-static member, and this isn't
7578 one, or vice versa. */
7581 /* Ignore functions which haven't been explicitly
7583 if (DECL_ANTICIPATED (fn
))
7586 /* See if there's a match. */
7587 if (same_type_p (target_fn_type
, static_fn_type (fn
)))
7588 matches
= tree_cons (fn
, NULL_TREE
, matches
);
7592 /* Now, if we've already got a match (or matches), there's no need
7593 to proceed to the template functions. But, if we don't have a
7594 match we need to look at them, too. */
7597 tree target_arg_types
;
7598 tree target_ret_type
;
7601 unsigned int nargs
, ia
;
7604 target_arg_types
= TYPE_ARG_TYPES (target_fn_type
);
7605 target_ret_type
= TREE_TYPE (target_fn_type
);
7607 nargs
= list_length (target_arg_types
);
7608 args
= XALLOCAVEC (tree
, nargs
);
7609 for (arg
= target_arg_types
, ia
= 0;
7610 arg
!= NULL_TREE
&& arg
!= void_list_node
;
7611 arg
= TREE_CHAIN (arg
), ++ia
)
7612 args
[ia
] = TREE_VALUE (arg
);
7615 for (fns
= overload
; fns
; fns
= OVL_NEXT (fns
))
7617 tree fn
= OVL_CURRENT (fns
);
7621 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7622 /* We're only looking for templates. */
7625 if ((TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7627 /* We're not looking for a non-static member, and this is
7628 one, or vice versa. */
7631 tree ret
= target_ret_type
;
7633 /* If the template has a deduced return type, don't expose it to
7634 template argument deduction. */
7635 if (undeduced_auto_decl (fn
))
7638 /* Try to do argument deduction. */
7639 targs
= make_tree_vec (DECL_NTPARMS (fn
));
7640 instantiation
= fn_type_unification (fn
, explicit_targs
, targs
, args
,
7642 DEDUCE_EXACT
, LOOKUP_NORMAL
,
7644 if (instantiation
== error_mark_node
)
7645 /* Instantiation failed. */
7648 /* And now force instantiation to do return type deduction. */
7649 if (undeduced_auto_decl (instantiation
))
7652 instantiate_decl (instantiation
, /*defer*/false, /*class*/false);
7655 require_deduced_type (instantiation
);
7658 /* See if there's a match. */
7659 if (same_type_p (target_fn_type
, static_fn_type (instantiation
)))
7660 matches
= tree_cons (instantiation
, fn
, matches
);
7663 /* Now, remove all but the most specialized of the matches. */
7666 tree match
= most_specialized_instantiation (matches
);
7668 if (match
!= error_mark_node
)
7669 matches
= tree_cons (TREE_PURPOSE (match
),
7675 /* Now we should have exactly one function in MATCHES. */
7676 if (matches
== NULL_TREE
)
7678 /* There were *no* matches. */
7679 if (complain
& tf_error
)
7681 error ("no matches converting function %qD to type %q#T",
7682 DECL_NAME (OVL_CURRENT (overload
)),
7685 print_candidates (overload
);
7687 return error_mark_node
;
7689 else if (TREE_CHAIN (matches
))
7691 /* There were too many matches. First check if they're all
7692 the same function. */
7693 tree match
= NULL_TREE
;
7695 fn
= TREE_PURPOSE (matches
);
7697 /* For multi-versioned functions, more than one match is just fine and
7698 decls_match will return false as they are different. */
7699 for (match
= TREE_CHAIN (matches
); match
; match
= TREE_CHAIN (match
))
7700 if (!decls_match (fn
, TREE_PURPOSE (match
))
7701 && !targetm
.target_option
.function_versions
7702 (fn
, TREE_PURPOSE (match
)))
7707 if (complain
& tf_error
)
7709 error ("converting overloaded function %qD to type %q#T is ambiguous",
7710 DECL_NAME (OVL_FUNCTION (overload
)),
7713 /* Since print_candidates expects the functions in the
7714 TREE_VALUE slot, we flip them here. */
7715 for (match
= matches
; match
; match
= TREE_CHAIN (match
))
7716 TREE_VALUE (match
) = TREE_PURPOSE (match
);
7718 print_candidates (matches
);
7721 return error_mark_node
;
7725 /* Good, exactly one match. Now, convert it to the correct type. */
7726 fn
= TREE_PURPOSE (matches
);
7728 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
7729 && !(complain
& tf_ptrmem_ok
) && !flag_ms_extensions
)
7731 static int explained
;
7733 if (!(complain
& tf_error
))
7734 return error_mark_node
;
7736 permerror (input_location
, "assuming pointer to member %qD", fn
);
7739 inform (input_location
, "(a pointer to member can only be formed with %<&%E%>)", fn
);
7744 /* If a pointer to a function that is multi-versioned is requested, the
7745 pointer to the dispatcher function is returned instead. This works
7746 well because indirectly calling the function will dispatch the right
7747 function version at run-time. */
7748 if (DECL_FUNCTION_VERSIONED (fn
))
7750 fn
= get_function_version_dispatcher (fn
);
7752 return error_mark_node
;
7753 /* Mark all the versions corresponding to the dispatcher as used. */
7754 if (!(complain
& tf_conv
))
7755 mark_versions_used (fn
);
7758 /* If we're doing overload resolution purely for the purpose of
7759 determining conversion sequences, we should not consider the
7760 function used. If this conversion sequence is selected, the
7761 function will be marked as used at this point. */
7762 if (!(complain
& tf_conv
))
7764 /* Make =delete work with SFINAE. */
7765 if (DECL_DELETED_FN (fn
) && !(complain
& tf_error
))
7766 return error_mark_node
;
7767 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
7768 return error_mark_node
;
7771 /* We could not check access to member functions when this
7772 expression was originally created since we did not know at that
7773 time to which function the expression referred. */
7774 if (DECL_FUNCTION_MEMBER_P (fn
))
7776 gcc_assert (access_path
);
7777 perform_or_defer_access_check (access_path
, fn
, fn
, complain
);
7780 if (TYPE_PTRFN_P (target_type
) || TYPE_PTRMEMFUNC_P (target_type
))
7781 return cp_build_addr_expr (fn
, complain
);
7784 /* The target must be a REFERENCE_TYPE. Above, cp_build_unary_op
7785 will mark the function as addressed, but here we must do it
7787 cxx_mark_addressable (fn
);
7793 /* This function will instantiate the type of the expression given in
7794 RHS to match the type of LHSTYPE. If errors exist, then return
7795 error_mark_node. COMPLAIN is a bit mask. If TF_ERROR is set, then
7796 we complain on errors. If we are not complaining, never modify rhs,
7797 as overload resolution wants to try many possible instantiations, in
7798 the hope that at least one will work.
7800 For non-recursive calls, LHSTYPE should be a function, pointer to
7801 function, or a pointer to member function. */
7804 instantiate_type (tree lhstype
, tree rhs
, tsubst_flags_t complain
)
7806 tsubst_flags_t complain_in
= complain
;
7807 tree access_path
= NULL_TREE
;
7809 complain
&= ~tf_ptrmem_ok
;
7811 if (lhstype
== unknown_type_node
)
7813 if (complain
& tf_error
)
7814 error ("not enough type information");
7815 return error_mark_node
;
7818 if (TREE_TYPE (rhs
) != NULL_TREE
&& ! (type_unknown_p (rhs
)))
7820 tree fntype
= non_reference (lhstype
);
7821 if (same_type_p (fntype
, TREE_TYPE (rhs
)))
7823 if (flag_ms_extensions
7824 && TYPE_PTRMEMFUNC_P (fntype
)
7825 && !TYPE_PTRMEMFUNC_P (TREE_TYPE (rhs
)))
7826 /* Microsoft allows `A::f' to be resolved to a
7827 pointer-to-member. */
7831 if (complain
& tf_error
)
7832 error ("cannot convert %qE from type %qT to type %qT",
7833 rhs
, TREE_TYPE (rhs
), fntype
);
7834 return error_mark_node
;
7838 if (BASELINK_P (rhs
))
7840 access_path
= BASELINK_ACCESS_BINFO (rhs
);
7841 rhs
= BASELINK_FUNCTIONS (rhs
);
7844 /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot
7845 deduce any type information. */
7846 if (TREE_CODE (rhs
) == NON_DEPENDENT_EXPR
)
7848 if (complain
& tf_error
)
7849 error ("not enough type information");
7850 return error_mark_node
;
7853 /* There only a few kinds of expressions that may have a type
7854 dependent on overload resolution. */
7855 gcc_assert (TREE_CODE (rhs
) == ADDR_EXPR
7856 || TREE_CODE (rhs
) == COMPONENT_REF
7857 || is_overloaded_fn (rhs
)
7858 || (flag_ms_extensions
&& TREE_CODE (rhs
) == FUNCTION_DECL
));
7860 /* This should really only be used when attempting to distinguish
7861 what sort of a pointer to function we have. For now, any
7862 arithmetic operation which is not supported on pointers
7863 is rejected as an error. */
7865 switch (TREE_CODE (rhs
))
7869 tree member
= TREE_OPERAND (rhs
, 1);
7871 member
= instantiate_type (lhstype
, member
, complain
);
7872 if (member
!= error_mark_node
7873 && TREE_SIDE_EFFECTS (TREE_OPERAND (rhs
, 0)))
7874 /* Do not lose object's side effects. */
7875 return build2 (COMPOUND_EXPR
, TREE_TYPE (member
),
7876 TREE_OPERAND (rhs
, 0), member
);
7881 rhs
= TREE_OPERAND (rhs
, 1);
7882 if (BASELINK_P (rhs
))
7883 return instantiate_type (lhstype
, rhs
, complain_in
);
7885 /* This can happen if we are forming a pointer-to-member for a
7887 gcc_assert (TREE_CODE (rhs
) == TEMPLATE_ID_EXPR
);
7891 case TEMPLATE_ID_EXPR
:
7893 tree fns
= TREE_OPERAND (rhs
, 0);
7894 tree args
= TREE_OPERAND (rhs
, 1);
7897 resolve_address_of_overloaded_function (lhstype
, fns
, complain_in
,
7898 /*template_only=*/true,
7905 resolve_address_of_overloaded_function (lhstype
, rhs
, complain_in
,
7906 /*template_only=*/false,
7907 /*explicit_targs=*/NULL_TREE
,
7912 if (PTRMEM_OK_P (rhs
))
7913 complain
|= tf_ptrmem_ok
;
7915 return instantiate_type (lhstype
, TREE_OPERAND (rhs
, 0), complain
);
7919 return error_mark_node
;
7924 return error_mark_node
;
7927 /* Return the name of the virtual function pointer field
7928 (as an IDENTIFIER_NODE) for the given TYPE. Note that
7929 this may have to look back through base types to find the
7930 ultimate field name. (For single inheritance, these could
7931 all be the same name. Who knows for multiple inheritance). */
7934 get_vfield_name (tree type
)
7936 tree binfo
, base_binfo
;
7939 for (binfo
= TYPE_BINFO (type
);
7940 BINFO_N_BASE_BINFOS (binfo
);
7943 base_binfo
= BINFO_BASE_BINFO (binfo
, 0);
7945 if (BINFO_VIRTUAL_P (base_binfo
)
7946 || !TYPE_CONTAINS_VPTR_P (BINFO_TYPE (base_binfo
)))
7950 type
= BINFO_TYPE (binfo
);
7951 buf
= (char *) alloca (sizeof (VFIELD_NAME_FORMAT
)
7952 + TYPE_NAME_LENGTH (type
) + 2);
7953 sprintf (buf
, VFIELD_NAME_FORMAT
,
7954 IDENTIFIER_POINTER (constructor_name (type
)));
7955 return get_identifier (buf
);
7959 print_class_statistics (void)
7961 if (! GATHER_STATISTICS
)
7964 fprintf (stderr
, "convert_harshness = %d\n", n_convert_harshness
);
7965 fprintf (stderr
, "compute_conversion_costs = %d\n", n_compute_conversion_costs
);
7968 fprintf (stderr
, "vtables = %d; vtable searches = %d\n",
7969 n_vtables
, n_vtable_searches
);
7970 fprintf (stderr
, "vtable entries = %d; vtable elems = %d\n",
7971 n_vtable_entries
, n_vtable_elems
);
7975 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
7976 according to [class]:
7977 The class-name is also inserted
7978 into the scope of the class itself. For purposes of access checking,
7979 the inserted class name is treated as if it were a public member name. */
7982 build_self_reference (void)
7984 tree name
= constructor_name (current_class_type
);
7985 tree value
= build_lang_decl (TYPE_DECL
, name
, current_class_type
);
7988 DECL_NONLOCAL (value
) = 1;
7989 DECL_CONTEXT (value
) = current_class_type
;
7990 DECL_ARTIFICIAL (value
) = 1;
7991 SET_DECL_SELF_REFERENCE_P (value
);
7992 set_underlying_type (value
);
7994 if (processing_template_decl
)
7995 value
= push_template_decl (value
);
7997 saved_cas
= current_access_specifier
;
7998 current_access_specifier
= access_public_node
;
7999 finish_member_declaration (value
);
8000 current_access_specifier
= saved_cas
;
8003 /* Returns 1 if TYPE contains only padding bytes. */
8006 is_empty_class (tree type
)
8008 if (type
== error_mark_node
)
8011 if (! CLASS_TYPE_P (type
))
8014 return CLASSTYPE_EMPTY_P (type
);
8017 /* Returns true if TYPE contains no actual data, just various
8018 possible combinations of empty classes and possibly a vptr. */
8021 is_really_empty_class (tree type
)
8023 if (CLASS_TYPE_P (type
))
8030 /* CLASSTYPE_EMPTY_P isn't set properly until the class is actually laid
8031 out, but we'd like to be able to check this before then. */
8032 if (COMPLETE_TYPE_P (type
) && is_empty_class (type
))
8035 for (binfo
= TYPE_BINFO (type
), i
= 0;
8036 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
8037 if (!is_really_empty_class (BINFO_TYPE (base_binfo
)))
8039 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
8040 if (TREE_CODE (field
) == FIELD_DECL
8041 && !DECL_ARTIFICIAL (field
)
8042 && !is_really_empty_class (TREE_TYPE (field
)))
8046 else if (TREE_CODE (type
) == ARRAY_TYPE
)
8047 return is_really_empty_class (TREE_TYPE (type
));
8051 /* Note that NAME was looked up while the current class was being
8052 defined and that the result of that lookup was DECL. */
8055 maybe_note_name_used_in_class (tree name
, tree decl
)
8057 splay_tree names_used
;
8059 /* If we're not defining a class, there's nothing to do. */
8060 if (!(innermost_scope_kind() == sk_class
8061 && TYPE_BEING_DEFINED (current_class_type
)
8062 && !LAMBDA_TYPE_P (current_class_type
)))
8065 /* If there's already a binding for this NAME, then we don't have
8066 anything to worry about. */
8067 if (lookup_member (current_class_type
, name
,
8068 /*protect=*/0, /*want_type=*/false, tf_warning_or_error
))
8071 if (!current_class_stack
[current_class_depth
- 1].names_used
)
8072 current_class_stack
[current_class_depth
- 1].names_used
8073 = splay_tree_new (splay_tree_compare_pointers
, 0, 0);
8074 names_used
= current_class_stack
[current_class_depth
- 1].names_used
;
8076 splay_tree_insert (names_used
,
8077 (splay_tree_key
) name
,
8078 (splay_tree_value
) decl
);
8081 /* Note that NAME was declared (as DECL) in the current class. Check
8082 to see that the declaration is valid. */
8085 note_name_declared_in_class (tree name
, tree decl
)
8087 splay_tree names_used
;
8090 /* Look to see if we ever used this name. */
8092 = current_class_stack
[current_class_depth
- 1].names_used
;
8095 /* The C language allows members to be declared with a type of the same
8096 name, and the C++ standard says this diagnostic is not required. So
8097 allow it in extern "C" blocks unless predantic is specified.
8098 Allow it in all cases if -ms-extensions is specified. */
8099 if ((!pedantic
&& current_lang_name
== lang_name_c
)
8100 || flag_ms_extensions
)
8102 n
= splay_tree_lookup (names_used
, (splay_tree_key
) name
);
8105 /* [basic.scope.class]
8107 A name N used in a class S shall refer to the same declaration
8108 in its context and when re-evaluated in the completed scope of
8110 permerror (input_location
, "declaration of %q#D", decl
);
8111 permerror (input_location
, "changes meaning of %qD from %q+#D",
8112 DECL_NAME (OVL_CURRENT (decl
)), (tree
) n
->value
);
8116 /* Returns the VAR_DECL for the complete vtable associated with BINFO.
8117 Secondary vtables are merged with primary vtables; this function
8118 will return the VAR_DECL for the primary vtable. */
8121 get_vtbl_decl_for_binfo (tree binfo
)
8125 decl
= BINFO_VTABLE (binfo
);
8126 if (decl
&& TREE_CODE (decl
) == POINTER_PLUS_EXPR
)
8128 gcc_assert (TREE_CODE (TREE_OPERAND (decl
, 0)) == ADDR_EXPR
);
8129 decl
= TREE_OPERAND (TREE_OPERAND (decl
, 0), 0);
8132 gcc_assert (VAR_P (decl
));
8137 /* Returns the binfo for the primary base of BINFO. If the resulting
8138 BINFO is a virtual base, and it is inherited elsewhere in the
8139 hierarchy, then the returned binfo might not be the primary base of
8140 BINFO in the complete object. Check BINFO_PRIMARY_P or
8141 BINFO_LOST_PRIMARY_P to be sure. */
8144 get_primary_binfo (tree binfo
)
8148 primary_base
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (binfo
));
8152 return copied_binfo (primary_base
, binfo
);
8155 /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */
8158 maybe_indent_hierarchy (FILE * stream
, int indent
, int indented_p
)
8161 fprintf (stream
, "%*s", indent
, "");
8165 /* Dump the offsets of all the bases rooted at BINFO to STREAM.
8166 INDENT should be zero when called from the top level; it is
8167 incremented recursively. IGO indicates the next expected BINFO in
8168 inheritance graph ordering. */
8171 dump_class_hierarchy_r (FILE *stream
,
8181 indented
= maybe_indent_hierarchy (stream
, indent
, 0);
8182 fprintf (stream
, "%s (0x" HOST_WIDE_INT_PRINT_HEX
") ",
8183 type_as_string (BINFO_TYPE (binfo
), TFF_PLAIN_IDENTIFIER
),
8184 (HOST_WIDE_INT
) (uintptr_t) binfo
);
8187 fprintf (stream
, "alternative-path\n");
8190 igo
= TREE_CHAIN (binfo
);
8192 fprintf (stream
, HOST_WIDE_INT_PRINT_DEC
,
8193 tree_to_shwi (BINFO_OFFSET (binfo
)));
8194 if (is_empty_class (BINFO_TYPE (binfo
)))
8195 fprintf (stream
, " empty");
8196 else if (CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (binfo
)))
8197 fprintf (stream
, " nearly-empty");
8198 if (BINFO_VIRTUAL_P (binfo
))
8199 fprintf (stream
, " virtual");
8200 fprintf (stream
, "\n");
8203 if (BINFO_PRIMARY_P (binfo
))
8205 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8206 fprintf (stream
, " primary-for %s (0x" HOST_WIDE_INT_PRINT_HEX
")",
8207 type_as_string (BINFO_TYPE (BINFO_INHERITANCE_CHAIN (binfo
)),
8208 TFF_PLAIN_IDENTIFIER
),
8209 (HOST_WIDE_INT
) (uintptr_t) BINFO_INHERITANCE_CHAIN (binfo
));
8211 if (BINFO_LOST_PRIMARY_P (binfo
))
8213 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8214 fprintf (stream
, " lost-primary");
8217 fprintf (stream
, "\n");
8219 if (!(flags
& TDF_SLIM
))
8223 if (BINFO_SUBVTT_INDEX (binfo
))
8225 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8226 fprintf (stream
, " subvttidx=%s",
8227 expr_as_string (BINFO_SUBVTT_INDEX (binfo
),
8228 TFF_PLAIN_IDENTIFIER
));
8230 if (BINFO_VPTR_INDEX (binfo
))
8232 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8233 fprintf (stream
, " vptridx=%s",
8234 expr_as_string (BINFO_VPTR_INDEX (binfo
),
8235 TFF_PLAIN_IDENTIFIER
));
8237 if (BINFO_VPTR_FIELD (binfo
))
8239 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8240 fprintf (stream
, " vbaseoffset=%s",
8241 expr_as_string (BINFO_VPTR_FIELD (binfo
),
8242 TFF_PLAIN_IDENTIFIER
));
8244 if (BINFO_VTABLE (binfo
))
8246 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8247 fprintf (stream
, " vptr=%s",
8248 expr_as_string (BINFO_VTABLE (binfo
),
8249 TFF_PLAIN_IDENTIFIER
));
8253 fprintf (stream
, "\n");
8256 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
8257 igo
= dump_class_hierarchy_r (stream
, flags
, base_binfo
, igo
, indent
+ 2);
8262 /* Dump the BINFO hierarchy for T. */
8265 dump_class_hierarchy_1 (FILE *stream
, int flags
, tree t
)
8267 fprintf (stream
, "Class %s\n", type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8268 fprintf (stream
, " size=%lu align=%lu\n",
8269 (unsigned long)(tree_to_shwi (TYPE_SIZE (t
)) / BITS_PER_UNIT
),
8270 (unsigned long)(TYPE_ALIGN (t
) / BITS_PER_UNIT
));
8271 fprintf (stream
, " base size=%lu base align=%lu\n",
8272 (unsigned long)(tree_to_shwi (TYPE_SIZE (CLASSTYPE_AS_BASE (t
)))
8274 (unsigned long)(TYPE_ALIGN (CLASSTYPE_AS_BASE (t
))
8276 dump_class_hierarchy_r (stream
, flags
, TYPE_BINFO (t
), TYPE_BINFO (t
), 0);
8277 fprintf (stream
, "\n");
8280 /* Debug interface to hierarchy dumping. */
8283 debug_class (tree t
)
8285 dump_class_hierarchy_1 (stderr
, TDF_SLIM
, t
);
8289 dump_class_hierarchy (tree t
)
8292 FILE *stream
= get_dump_info (TDI_class
, &flags
);
8296 dump_class_hierarchy_1 (stream
, flags
, t
);
8301 dump_array (FILE * stream
, tree decl
)
8304 unsigned HOST_WIDE_INT ix
;
8306 tree size
= TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (decl
)));
8308 elt
= (tree_to_shwi (TYPE_SIZE (TREE_TYPE (TREE_TYPE (decl
))))
8310 fprintf (stream
, "%s:", decl_as_string (decl
, TFF_PLAIN_IDENTIFIER
));
8311 fprintf (stream
, " %s entries",
8312 expr_as_string (size_binop (PLUS_EXPR
, size
, size_one_node
),
8313 TFF_PLAIN_IDENTIFIER
));
8314 fprintf (stream
, "\n");
8316 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (DECL_INITIAL (decl
)),
8318 fprintf (stream
, "%-4ld %s\n", (long)(ix
* elt
),
8319 expr_as_string (value
, TFF_PLAIN_IDENTIFIER
));
8323 dump_vtable (tree t
, tree binfo
, tree vtable
)
8326 FILE *stream
= get_dump_info (TDI_class
, &flags
);
8331 if (!(flags
& TDF_SLIM
))
8333 int ctor_vtbl_p
= TYPE_BINFO (t
) != binfo
;
8335 fprintf (stream
, "%s for %s",
8336 ctor_vtbl_p
? "Construction vtable" : "Vtable",
8337 type_as_string (BINFO_TYPE (binfo
), TFF_PLAIN_IDENTIFIER
));
8340 if (!BINFO_VIRTUAL_P (binfo
))
8341 fprintf (stream
, " (0x" HOST_WIDE_INT_PRINT_HEX
" instance)",
8342 (HOST_WIDE_INT
) (uintptr_t) binfo
);
8343 fprintf (stream
, " in %s", type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8345 fprintf (stream
, "\n");
8346 dump_array (stream
, vtable
);
8347 fprintf (stream
, "\n");
8352 dump_vtt (tree t
, tree vtt
)
8355 FILE *stream
= get_dump_info (TDI_class
, &flags
);
8360 if (!(flags
& TDF_SLIM
))
8362 fprintf (stream
, "VTT for %s\n",
8363 type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8364 dump_array (stream
, vtt
);
8365 fprintf (stream
, "\n");
8369 /* Dump a function or thunk and its thunkees. */
8372 dump_thunk (FILE *stream
, int indent
, tree thunk
)
8374 static const char spaces
[] = " ";
8375 tree name
= DECL_NAME (thunk
);
8378 fprintf (stream
, "%.*s%p %s %s", indent
, spaces
,
8380 !DECL_THUNK_P (thunk
) ? "function"
8381 : DECL_THIS_THUNK_P (thunk
) ? "this-thunk" : "covariant-thunk",
8382 name
? IDENTIFIER_POINTER (name
) : "<unset>");
8383 if (DECL_THUNK_P (thunk
))
8385 HOST_WIDE_INT fixed_adjust
= THUNK_FIXED_OFFSET (thunk
);
8386 tree virtual_adjust
= THUNK_VIRTUAL_OFFSET (thunk
);
8388 fprintf (stream
, " fixed=" HOST_WIDE_INT_PRINT_DEC
, fixed_adjust
);
8389 if (!virtual_adjust
)
8391 else if (DECL_THIS_THUNK_P (thunk
))
8392 fprintf (stream
, " vcall=" HOST_WIDE_INT_PRINT_DEC
,
8393 tree_to_shwi (virtual_adjust
));
8395 fprintf (stream
, " vbase=" HOST_WIDE_INT_PRINT_DEC
"(%s)",
8396 tree_to_shwi (BINFO_VPTR_FIELD (virtual_adjust
)),
8397 type_as_string (BINFO_TYPE (virtual_adjust
), TFF_SCOPE
));
8398 if (THUNK_ALIAS (thunk
))
8399 fprintf (stream
, " alias to %p", (void *)THUNK_ALIAS (thunk
));
8401 fprintf (stream
, "\n");
8402 for (thunks
= DECL_THUNKS (thunk
); thunks
; thunks
= TREE_CHAIN (thunks
))
8403 dump_thunk (stream
, indent
+ 2, thunks
);
8406 /* Dump the thunks for FN. */
8409 debug_thunks (tree fn
)
8411 dump_thunk (stderr
, 0, fn
);
8414 /* Virtual function table initialization. */
8416 /* Create all the necessary vtables for T and its base classes. */
8419 finish_vtbls (tree t
)
8422 vec
<constructor_elt
, va_gc
> *v
= NULL
;
8423 tree vtable
= BINFO_VTABLE (TYPE_BINFO (t
));
8425 /* We lay out the primary and secondary vtables in one contiguous
8426 vtable. The primary vtable is first, followed by the non-virtual
8427 secondary vtables in inheritance graph order. */
8428 accumulate_vtbl_inits (TYPE_BINFO (t
), TYPE_BINFO (t
), TYPE_BINFO (t
),
8431 /* Then come the virtual bases, also in inheritance graph order. */
8432 for (vbase
= TYPE_BINFO (t
); vbase
; vbase
= TREE_CHAIN (vbase
))
8434 if (!BINFO_VIRTUAL_P (vbase
))
8436 accumulate_vtbl_inits (vbase
, vbase
, TYPE_BINFO (t
), vtable
, t
, &v
);
8439 if (BINFO_VTABLE (TYPE_BINFO (t
)))
8440 initialize_vtable (TYPE_BINFO (t
), v
);
8443 /* Initialize the vtable for BINFO with the INITS. */
8446 initialize_vtable (tree binfo
, vec
<constructor_elt
, va_gc
> *inits
)
8450 layout_vtable_decl (binfo
, vec_safe_length (inits
));
8451 decl
= get_vtbl_decl_for_binfo (binfo
);
8452 initialize_artificial_var (decl
, inits
);
8453 dump_vtable (BINFO_TYPE (binfo
), binfo
, decl
);
8456 /* Build the VTT (virtual table table) for T.
8457 A class requires a VTT if it has virtual bases.
8460 1 - primary virtual pointer for complete object T
8461 2 - secondary VTTs for each direct non-virtual base of T which requires a
8463 3 - secondary virtual pointers for each direct or indirect base of T which
8464 has virtual bases or is reachable via a virtual path from T.
8465 4 - secondary VTTs for each direct or indirect virtual base of T.
8467 Secondary VTTs look like complete object VTTs without part 4. */
8475 vec
<constructor_elt
, va_gc
> *inits
;
8477 /* Build up the initializers for the VTT. */
8479 index
= size_zero_node
;
8480 build_vtt_inits (TYPE_BINFO (t
), t
, &inits
, &index
);
8482 /* If we didn't need a VTT, we're done. */
8486 /* Figure out the type of the VTT. */
8487 type
= build_array_of_n_type (const_ptr_type_node
,
8490 /* Now, build the VTT object itself. */
8491 vtt
= build_vtable (t
, mangle_vtt_for_type (t
), type
);
8492 initialize_artificial_var (vtt
, inits
);
8493 /* Add the VTT to the vtables list. */
8494 DECL_CHAIN (vtt
) = DECL_CHAIN (CLASSTYPE_VTABLES (t
));
8495 DECL_CHAIN (CLASSTYPE_VTABLES (t
)) = vtt
;
8500 /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with
8501 PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo,
8502 and CHAIN the vtable pointer for this binfo after construction is
8503 complete. VALUE can also be another BINFO, in which case we recurse. */
8506 binfo_ctor_vtable (tree binfo
)
8512 vt
= BINFO_VTABLE (binfo
);
8513 if (TREE_CODE (vt
) == TREE_LIST
)
8514 vt
= TREE_VALUE (vt
);
8515 if (TREE_CODE (vt
) == TREE_BINFO
)
8524 /* Data for secondary VTT initialization. */
8525 typedef struct secondary_vptr_vtt_init_data_s
8527 /* Is this the primary VTT? */
8530 /* Current index into the VTT. */
8533 /* Vector of initializers built up. */
8534 vec
<constructor_elt
, va_gc
> *inits
;
8536 /* The type being constructed by this secondary VTT. */
8537 tree type_being_constructed
;
8538 } secondary_vptr_vtt_init_data
;
8540 /* Recursively build the VTT-initializer for BINFO (which is in the
8541 hierarchy dominated by T). INITS points to the end of the initializer
8542 list to date. INDEX is the VTT index where the next element will be
8543 replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e.
8544 not a subvtt for some base of T). When that is so, we emit the sub-VTTs
8545 for virtual bases of T. When it is not so, we build the constructor
8546 vtables for the BINFO-in-T variant. */
8549 build_vtt_inits (tree binfo
, tree t
, vec
<constructor_elt
, va_gc
> **inits
,
8555 secondary_vptr_vtt_init_data data
;
8556 int top_level_p
= SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
);
8558 /* We only need VTTs for subobjects with virtual bases. */
8559 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
)))
8562 /* We need to use a construction vtable if this is not the primary
8566 build_ctor_vtbl_group (binfo
, t
);
8568 /* Record the offset in the VTT where this sub-VTT can be found. */
8569 BINFO_SUBVTT_INDEX (binfo
) = *index
;
8572 /* Add the address of the primary vtable for the complete object. */
8573 init
= binfo_ctor_vtable (binfo
);
8574 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
8577 gcc_assert (!BINFO_VPTR_INDEX (binfo
));
8578 BINFO_VPTR_INDEX (binfo
) = *index
;
8580 *index
= size_binop (PLUS_EXPR
, *index
, TYPE_SIZE_UNIT (ptr_type_node
));
8582 /* Recursively add the secondary VTTs for non-virtual bases. */
8583 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, b
); ++i
)
8584 if (!BINFO_VIRTUAL_P (b
))
8585 build_vtt_inits (b
, t
, inits
, index
);
8587 /* Add secondary virtual pointers for all subobjects of BINFO with
8588 either virtual bases or reachable along a virtual path, except
8589 subobjects that are non-virtual primary bases. */
8590 data
.top_level_p
= top_level_p
;
8591 data
.index
= *index
;
8592 data
.inits
= *inits
;
8593 data
.type_being_constructed
= BINFO_TYPE (binfo
);
8595 dfs_walk_once (binfo
, dfs_build_secondary_vptr_vtt_inits
, NULL
, &data
);
8597 *index
= data
.index
;
8599 /* data.inits might have grown as we added secondary virtual pointers.
8600 Make sure our caller knows about the new vector. */
8601 *inits
= data
.inits
;
8604 /* Add the secondary VTTs for virtual bases in inheritance graph
8606 for (b
= TYPE_BINFO (BINFO_TYPE (binfo
)); b
; b
= TREE_CHAIN (b
))
8608 if (!BINFO_VIRTUAL_P (b
))
8611 build_vtt_inits (b
, t
, inits
, index
);
8614 /* Remove the ctor vtables we created. */
8615 dfs_walk_all (binfo
, dfs_fixup_binfo_vtbls
, NULL
, binfo
);
8618 /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base
8619 in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */
8622 dfs_build_secondary_vptr_vtt_inits (tree binfo
, void *data_
)
8624 secondary_vptr_vtt_init_data
*data
= (secondary_vptr_vtt_init_data
*)data_
;
8626 /* We don't care about bases that don't have vtables. */
8627 if (!TYPE_VFIELD (BINFO_TYPE (binfo
)))
8628 return dfs_skip_bases
;
8630 /* We're only interested in proper subobjects of the type being
8632 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), data
->type_being_constructed
))
8635 /* We're only interested in bases with virtual bases or reachable
8636 via a virtual path from the type being constructed. */
8637 if (!(CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
))
8638 || binfo_via_virtual (binfo
, data
->type_being_constructed
)))
8639 return dfs_skip_bases
;
8641 /* We're not interested in non-virtual primary bases. */
8642 if (!BINFO_VIRTUAL_P (binfo
) && BINFO_PRIMARY_P (binfo
))
8645 /* Record the index where this secondary vptr can be found. */
8646 if (data
->top_level_p
)
8648 gcc_assert (!BINFO_VPTR_INDEX (binfo
));
8649 BINFO_VPTR_INDEX (binfo
) = data
->index
;
8651 if (BINFO_VIRTUAL_P (binfo
))
8653 /* It's a primary virtual base, and this is not a
8654 construction vtable. Find the base this is primary of in
8655 the inheritance graph, and use that base's vtable
8657 while (BINFO_PRIMARY_P (binfo
))
8658 binfo
= BINFO_INHERITANCE_CHAIN (binfo
);
8662 /* Add the initializer for the secondary vptr itself. */
8663 CONSTRUCTOR_APPEND_ELT (data
->inits
, NULL_TREE
, binfo_ctor_vtable (binfo
));
8665 /* Advance the vtt index. */
8666 data
->index
= size_binop (PLUS_EXPR
, data
->index
,
8667 TYPE_SIZE_UNIT (ptr_type_node
));
8672 /* Called from build_vtt_inits via dfs_walk. After building
8673 constructor vtables and generating the sub-vtt from them, we need
8674 to restore the BINFO_VTABLES that were scribbled on. DATA is the
8675 binfo of the base whose sub vtt was generated. */
8678 dfs_fixup_binfo_vtbls (tree binfo
, void* data
)
8680 tree vtable
= BINFO_VTABLE (binfo
);
8682 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
8683 /* If this class has no vtable, none of its bases do. */
8684 return dfs_skip_bases
;
8687 /* This might be a primary base, so have no vtable in this
8691 /* If we scribbled the construction vtable vptr into BINFO, clear it
8693 if (TREE_CODE (vtable
) == TREE_LIST
8694 && (TREE_PURPOSE (vtable
) == (tree
) data
))
8695 BINFO_VTABLE (binfo
) = TREE_CHAIN (vtable
);
8700 /* Build the construction vtable group for BINFO which is in the
8701 hierarchy dominated by T. */
8704 build_ctor_vtbl_group (tree binfo
, tree t
)
8710 vec
<constructor_elt
, va_gc
> *v
;
8712 /* See if we've already created this construction vtable group. */
8713 id
= mangle_ctor_vtbl_for_type (t
, binfo
);
8714 if (IDENTIFIER_GLOBAL_VALUE (id
))
8717 gcc_assert (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
));
8718 /* Build a version of VTBL (with the wrong type) for use in
8719 constructing the addresses of secondary vtables in the
8720 construction vtable group. */
8721 vtbl
= build_vtable (t
, id
, ptr_type_node
);
8722 DECL_CONSTRUCTION_VTABLE_P (vtbl
) = 1;
8723 /* Don't export construction vtables from shared libraries. Even on
8724 targets that don't support hidden visibility, this tells
8725 can_refer_decl_in_current_unit_p not to assume that it's safe to
8726 access from a different compilation unit (bz 54314). */
8727 DECL_VISIBILITY (vtbl
) = VISIBILITY_HIDDEN
;
8728 DECL_VISIBILITY_SPECIFIED (vtbl
) = true;
8731 accumulate_vtbl_inits (binfo
, TYPE_BINFO (TREE_TYPE (binfo
)),
8732 binfo
, vtbl
, t
, &v
);
8734 /* Add the vtables for each of our virtual bases using the vbase in T
8736 for (vbase
= TYPE_BINFO (BINFO_TYPE (binfo
));
8738 vbase
= TREE_CHAIN (vbase
))
8742 if (!BINFO_VIRTUAL_P (vbase
))
8744 b
= copied_binfo (vbase
, binfo
);
8746 accumulate_vtbl_inits (b
, vbase
, binfo
, vtbl
, t
, &v
);
8749 /* Figure out the type of the construction vtable. */
8750 type
= build_array_of_n_type (vtable_entry_type
, v
->length ());
8752 TREE_TYPE (vtbl
) = type
;
8753 DECL_SIZE (vtbl
) = DECL_SIZE_UNIT (vtbl
) = NULL_TREE
;
8754 layout_decl (vtbl
, 0);
8756 /* Initialize the construction vtable. */
8757 CLASSTYPE_VTABLES (t
) = chainon (CLASSTYPE_VTABLES (t
), vtbl
);
8758 initialize_artificial_var (vtbl
, v
);
8759 dump_vtable (t
, binfo
, vtbl
);
8762 /* Add the vtbl initializers for BINFO (and its bases other than
8763 non-virtual primaries) to the list of INITS. BINFO is in the
8764 hierarchy dominated by T. RTTI_BINFO is the binfo within T of
8765 the constructor the vtbl inits should be accumulated for. (If this
8766 is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).)
8767 ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO).
8768 BINFO is the active base equivalent of ORIG_BINFO in the inheritance
8769 graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE,
8770 but are not necessarily the same in terms of layout. */
8773 accumulate_vtbl_inits (tree binfo
,
8778 vec
<constructor_elt
, va_gc
> **inits
)
8782 int ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8784 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), BINFO_TYPE (orig_binfo
)));
8786 /* If it doesn't have a vptr, we don't do anything. */
8787 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
8790 /* If we're building a construction vtable, we're not interested in
8791 subobjects that don't require construction vtables. */
8793 && !CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
))
8794 && !binfo_via_virtual (orig_binfo
, BINFO_TYPE (rtti_binfo
)))
8797 /* Build the initializers for the BINFO-in-T vtable. */
8798 dfs_accumulate_vtbl_inits (binfo
, orig_binfo
, rtti_binfo
, vtbl
, t
, inits
);
8800 /* Walk the BINFO and its bases. We walk in preorder so that as we
8801 initialize each vtable we can figure out at what offset the
8802 secondary vtable lies from the primary vtable. We can't use
8803 dfs_walk here because we need to iterate through bases of BINFO
8804 and RTTI_BINFO simultaneously. */
8805 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
8807 /* Skip virtual bases. */
8808 if (BINFO_VIRTUAL_P (base_binfo
))
8810 accumulate_vtbl_inits (base_binfo
,
8811 BINFO_BASE_BINFO (orig_binfo
, i
),
8812 rtti_binfo
, vtbl
, t
,
8817 /* Called from accumulate_vtbl_inits. Adds the initializers for the
8818 BINFO vtable to L. */
8821 dfs_accumulate_vtbl_inits (tree binfo
,
8826 vec
<constructor_elt
, va_gc
> **l
)
8828 tree vtbl
= NULL_TREE
;
8829 int ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8833 && BINFO_VIRTUAL_P (orig_binfo
) && BINFO_PRIMARY_P (orig_binfo
))
8835 /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a
8836 primary virtual base. If it is not the same primary in
8837 the hierarchy of T, we'll need to generate a ctor vtable
8838 for it, to place at its location in T. If it is the same
8839 primary, we still need a VTT entry for the vtable, but it
8840 should point to the ctor vtable for the base it is a
8841 primary for within the sub-hierarchy of RTTI_BINFO.
8843 There are three possible cases:
8845 1) We are in the same place.
8846 2) We are a primary base within a lost primary virtual base of
8848 3) We are primary to something not a base of RTTI_BINFO. */
8851 tree last
= NULL_TREE
;
8853 /* First, look through the bases we are primary to for RTTI_BINFO
8854 or a virtual base. */
8856 while (BINFO_PRIMARY_P (b
))
8858 b
= BINFO_INHERITANCE_CHAIN (b
);
8860 if (BINFO_VIRTUAL_P (b
) || b
== rtti_binfo
)
8863 /* If we run out of primary links, keep looking down our
8864 inheritance chain; we might be an indirect primary. */
8865 for (b
= last
; b
; b
= BINFO_INHERITANCE_CHAIN (b
))
8866 if (BINFO_VIRTUAL_P (b
) || b
== rtti_binfo
)
8870 /* If we found RTTI_BINFO, this is case 1. If we found a virtual
8871 base B and it is a base of RTTI_BINFO, this is case 2. In
8872 either case, we share our vtable with LAST, i.e. the
8873 derived-most base within B of which we are a primary. */
8875 || (b
&& binfo_for_vbase (BINFO_TYPE (b
), BINFO_TYPE (rtti_binfo
))))
8876 /* Just set our BINFO_VTABLE to point to LAST, as we may not have
8877 set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in
8878 binfo_ctor_vtable after everything's been set up. */
8881 /* Otherwise, this is case 3 and we get our own. */
8883 else if (!BINFO_NEW_VTABLE_MARKED (orig_binfo
))
8886 n_inits
= vec_safe_length (*l
);
8893 /* Add the initializer for this vtable. */
8894 build_vtbl_initializer (binfo
, orig_binfo
, t
, rtti_binfo
,
8895 &non_fn_entries
, l
);
8897 /* Figure out the position to which the VPTR should point. */
8898 vtbl
= build1 (ADDR_EXPR
, vtbl_ptr_type_node
, orig_vtbl
);
8899 index
= size_binop (MULT_EXPR
,
8900 TYPE_SIZE_UNIT (vtable_entry_type
),
8901 size_int (non_fn_entries
+ n_inits
));
8902 vtbl
= fold_build_pointer_plus (vtbl
, index
);
8906 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
8907 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
8908 straighten this out. */
8909 BINFO_VTABLE (binfo
) = tree_cons (rtti_binfo
, vtbl
, BINFO_VTABLE (binfo
));
8910 else if (BINFO_PRIMARY_P (binfo
) && BINFO_VIRTUAL_P (binfo
))
8911 /* Throw away any unneeded intializers. */
8912 (*l
)->truncate (n_inits
);
8914 /* For an ordinary vtable, set BINFO_VTABLE. */
8915 BINFO_VTABLE (binfo
) = vtbl
;
8918 static GTY(()) tree abort_fndecl_addr
;
8920 /* Construct the initializer for BINFO's virtual function table. BINFO
8921 is part of the hierarchy dominated by T. If we're building a
8922 construction vtable, the ORIG_BINFO is the binfo we should use to
8923 find the actual function pointers to put in the vtable - but they
8924 can be overridden on the path to most-derived in the graph that
8925 ORIG_BINFO belongs. Otherwise,
8926 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
8927 BINFO that should be indicated by the RTTI information in the
8928 vtable; it will be a base class of T, rather than T itself, if we
8929 are building a construction vtable.
8931 The value returned is a TREE_LIST suitable for wrapping in a
8932 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
8933 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
8934 number of non-function entries in the vtable.
8936 It might seem that this function should never be called with a
8937 BINFO for which BINFO_PRIMARY_P holds, the vtable for such a
8938 base is always subsumed by a derived class vtable. However, when
8939 we are building construction vtables, we do build vtables for
8940 primary bases; we need these while the primary base is being
8944 build_vtbl_initializer (tree binfo
,
8948 int* non_fn_entries_p
,
8949 vec
<constructor_elt
, va_gc
> **inits
)
8955 vec
<tree
, va_gc
> *vbases
;
8958 /* Initialize VID. */
8959 memset (&vid
, 0, sizeof (vid
));
8962 vid
.rtti_binfo
= rtti_binfo
;
8963 vid
.primary_vtbl_p
= SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
);
8964 vid
.ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8965 vid
.generate_vcall_entries
= true;
8966 /* The first vbase or vcall offset is at index -3 in the vtable. */
8967 vid
.index
= ssize_int(-3 * TARGET_VTABLE_DATA_ENTRY_DISTANCE
);
8969 /* Add entries to the vtable for RTTI. */
8970 build_rtti_vtbl_entries (binfo
, &vid
);
8972 /* Create an array for keeping track of the functions we've
8973 processed. When we see multiple functions with the same
8974 signature, we share the vcall offsets. */
8975 vec_alloc (vid
.fns
, 32);
8976 /* Add the vcall and vbase offset entries. */
8977 build_vcall_and_vbase_vtbl_entries (binfo
, &vid
);
8979 /* Clear BINFO_VTABLE_PATH_MARKED; it's set by
8980 build_vbase_offset_vtbl_entries. */
8981 for (vbases
= CLASSTYPE_VBASECLASSES (t
), ix
= 0;
8982 vec_safe_iterate (vbases
, ix
, &vbinfo
); ix
++)
8983 BINFO_VTABLE_PATH_MARKED (vbinfo
) = 0;
8985 /* If the target requires padding between data entries, add that now. */
8986 if (TARGET_VTABLE_DATA_ENTRY_DISTANCE
> 1)
8988 int n_entries
= vec_safe_length (vid
.inits
);
8990 vec_safe_grow (vid
.inits
, TARGET_VTABLE_DATA_ENTRY_DISTANCE
* n_entries
);
8992 /* Move data entries into their new positions and add padding
8993 after the new positions. Iterate backwards so we don't
8994 overwrite entries that we would need to process later. */
8995 for (ix
= n_entries
- 1;
8996 vid
.inits
->iterate (ix
, &e
);
9000 int new_position
= (TARGET_VTABLE_DATA_ENTRY_DISTANCE
* ix
9001 + (TARGET_VTABLE_DATA_ENTRY_DISTANCE
- 1));
9003 (*vid
.inits
)[new_position
] = *e
;
9005 for (j
= 1; j
< TARGET_VTABLE_DATA_ENTRY_DISTANCE
; ++j
)
9007 constructor_elt
*f
= &(*vid
.inits
)[new_position
- j
];
9008 f
->index
= NULL_TREE
;
9009 f
->value
= build1 (NOP_EXPR
, vtable_entry_type
,
9015 if (non_fn_entries_p
)
9016 *non_fn_entries_p
= vec_safe_length (vid
.inits
);
9018 /* The initializers for virtual functions were built up in reverse
9019 order. Straighten them out and add them to the running list in one
9021 jx
= vec_safe_length (*inits
);
9022 vec_safe_grow (*inits
, jx
+ vid
.inits
->length ());
9024 for (ix
= vid
.inits
->length () - 1;
9025 vid
.inits
->iterate (ix
, &e
);
9029 /* Go through all the ordinary virtual functions, building up
9031 for (v
= BINFO_VIRTUALS (orig_binfo
); v
; v
= TREE_CHAIN (v
))
9035 tree fn
, fn_original
;
9036 tree init
= NULL_TREE
;
9040 if (DECL_THUNK_P (fn
))
9042 if (!DECL_NAME (fn
))
9044 if (THUNK_ALIAS (fn
))
9046 fn
= THUNK_ALIAS (fn
);
9049 fn_original
= THUNK_TARGET (fn
);
9052 /* If the only definition of this function signature along our
9053 primary base chain is from a lost primary, this vtable slot will
9054 never be used, so just zero it out. This is important to avoid
9055 requiring extra thunks which cannot be generated with the function.
9057 We first check this in update_vtable_entry_for_fn, so we handle
9058 restored primary bases properly; we also need to do it here so we
9059 zero out unused slots in ctor vtables, rather than filling them
9060 with erroneous values (though harmless, apart from relocation
9062 if (BV_LOST_PRIMARY (v
))
9063 init
= size_zero_node
;
9067 /* Pull the offset for `this', and the function to call, out of
9069 delta
= BV_DELTA (v
);
9070 vcall_index
= BV_VCALL_INDEX (v
);
9072 gcc_assert (TREE_CODE (delta
) == INTEGER_CST
);
9073 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
9075 /* You can't call an abstract virtual function; it's abstract.
9076 So, we replace these functions with __pure_virtual. */
9077 if (DECL_PURE_VIRTUAL_P (fn_original
))
9080 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
9082 if (abort_fndecl_addr
== NULL
)
9084 = fold_convert (vfunc_ptr_type_node
,
9085 build_fold_addr_expr (fn
));
9086 init
= abort_fndecl_addr
;
9089 /* Likewise for deleted virtuals. */
9090 else if (DECL_DELETED_FN (fn_original
))
9092 fn
= get_identifier ("__cxa_deleted_virtual");
9093 if (!get_global_value_if_present (fn
, &fn
))
9094 fn
= push_library_fn (fn
, (build_function_type_list
9095 (void_type_node
, NULL_TREE
)),
9096 NULL_TREE
, ECF_NORETURN
);
9097 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
9098 init
= fold_convert (vfunc_ptr_type_node
,
9099 build_fold_addr_expr (fn
));
9103 if (!integer_zerop (delta
) || vcall_index
)
9105 fn
= make_thunk (fn
, /*this_adjusting=*/1, delta
, vcall_index
);
9106 if (!DECL_NAME (fn
))
9109 /* Take the address of the function, considering it to be of an
9110 appropriate generic type. */
9111 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
9112 init
= fold_convert (vfunc_ptr_type_node
,
9113 build_fold_addr_expr (fn
));
9114 /* Don't refer to a virtual destructor from a constructor
9115 vtable or a vtable for an abstract class, since destroying
9116 an object under construction is undefined behavior and we
9117 don't want it to be considered a candidate for speculative
9118 devirtualization. But do create the thunk for ABI
9120 if (DECL_DESTRUCTOR_P (fn_original
)
9121 && (CLASSTYPE_PURE_VIRTUALS (DECL_CONTEXT (fn_original
))
9122 || orig_binfo
!= binfo
))
9123 init
= size_zero_node
;
9127 /* And add it to the chain of initializers. */
9128 if (TARGET_VTABLE_USES_DESCRIPTORS
)
9131 if (init
== size_zero_node
)
9132 for (i
= 0; i
< TARGET_VTABLE_USES_DESCRIPTORS
; ++i
)
9133 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
9135 for (i
= 0; i
< TARGET_VTABLE_USES_DESCRIPTORS
; ++i
)
9137 tree fdesc
= build2 (FDESC_EXPR
, vfunc_ptr_type_node
,
9138 fn
, build_int_cst (NULL_TREE
, i
));
9139 TREE_CONSTANT (fdesc
) = 1;
9141 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, fdesc
);
9145 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
9149 /* Adds to vid->inits the initializers for the vbase and vcall
9150 offsets in BINFO, which is in the hierarchy dominated by T. */
9153 build_vcall_and_vbase_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9157 /* If this is a derived class, we must first create entries
9158 corresponding to the primary base class. */
9159 b
= get_primary_binfo (binfo
);
9161 build_vcall_and_vbase_vtbl_entries (b
, vid
);
9163 /* Add the vbase entries for this base. */
9164 build_vbase_offset_vtbl_entries (binfo
, vid
);
9165 /* Add the vcall entries for this base. */
9166 build_vcall_offset_vtbl_entries (binfo
, vid
);
9169 /* Returns the initializers for the vbase offset entries in the vtable
9170 for BINFO (which is part of the class hierarchy dominated by T), in
9171 reverse order. VBASE_OFFSET_INDEX gives the vtable index
9172 where the next vbase offset will go. */
9175 build_vbase_offset_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9179 tree non_primary_binfo
;
9181 /* If there are no virtual baseclasses, then there is nothing to
9183 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
)))
9188 /* We might be a primary base class. Go up the inheritance hierarchy
9189 until we find the most derived class of which we are a primary base:
9190 it is the offset of that which we need to use. */
9191 non_primary_binfo
= binfo
;
9192 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo
))
9196 /* If we have reached a virtual base, then it must be a primary
9197 base (possibly multi-level) of vid->binfo, or we wouldn't
9198 have called build_vcall_and_vbase_vtbl_entries for it. But it
9199 might be a lost primary, so just skip down to vid->binfo. */
9200 if (BINFO_VIRTUAL_P (non_primary_binfo
))
9202 non_primary_binfo
= vid
->binfo
;
9206 b
= BINFO_INHERITANCE_CHAIN (non_primary_binfo
);
9207 if (get_primary_binfo (b
) != non_primary_binfo
)
9209 non_primary_binfo
= b
;
9212 /* Go through the virtual bases, adding the offsets. */
9213 for (vbase
= TYPE_BINFO (BINFO_TYPE (binfo
));
9215 vbase
= TREE_CHAIN (vbase
))
9220 if (!BINFO_VIRTUAL_P (vbase
))
9223 /* Find the instance of this virtual base in the complete
9225 b
= copied_binfo (vbase
, binfo
);
9227 /* If we've already got an offset for this virtual base, we
9228 don't need another one. */
9229 if (BINFO_VTABLE_PATH_MARKED (b
))
9231 BINFO_VTABLE_PATH_MARKED (b
) = 1;
9233 /* Figure out where we can find this vbase offset. */
9234 delta
= size_binop (MULT_EXPR
,
9237 TYPE_SIZE_UNIT (vtable_entry_type
)));
9238 if (vid
->primary_vtbl_p
)
9239 BINFO_VPTR_FIELD (b
) = delta
;
9241 if (binfo
!= TYPE_BINFO (t
))
9242 /* The vbase offset had better be the same. */
9243 gcc_assert (tree_int_cst_equal (delta
, BINFO_VPTR_FIELD (vbase
)));
9245 /* The next vbase will come at a more negative offset. */
9246 vid
->index
= size_binop (MINUS_EXPR
, vid
->index
,
9247 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE
));
9249 /* The initializer is the delta from BINFO to this virtual base.
9250 The vbase offsets go in reverse inheritance-graph order, and
9251 we are walking in inheritance graph order so these end up in
9253 delta
= size_diffop_loc (input_location
,
9254 BINFO_OFFSET (b
), BINFO_OFFSET (non_primary_binfo
));
9256 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
,
9257 fold_build1_loc (input_location
, NOP_EXPR
,
9258 vtable_entry_type
, delta
));
9262 /* Adds the initializers for the vcall offset entries in the vtable
9263 for BINFO (which is part of the class hierarchy dominated by VID->DERIVED)
9267 build_vcall_offset_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9269 /* We only need these entries if this base is a virtual base. We
9270 compute the indices -- but do not add to the vtable -- when
9271 building the main vtable for a class. */
9272 if (binfo
== TYPE_BINFO (vid
->derived
)
9273 || (BINFO_VIRTUAL_P (binfo
)
9274 /* If BINFO is RTTI_BINFO, then (since BINFO does not
9275 correspond to VID->DERIVED), we are building a primary
9276 construction virtual table. Since this is a primary
9277 virtual table, we do not need the vcall offsets for
9279 && binfo
!= vid
->rtti_binfo
))
9281 /* We need a vcall offset for each of the virtual functions in this
9282 vtable. For example:
9284 class A { virtual void f (); };
9285 class B1 : virtual public A { virtual void f (); };
9286 class B2 : virtual public A { virtual void f (); };
9287 class C: public B1, public B2 { virtual void f (); };
9289 A C object has a primary base of B1, which has a primary base of A. A
9290 C also has a secondary base of B2, which no longer has a primary base
9291 of A. So the B2-in-C construction vtable needs a secondary vtable for
9292 A, which will adjust the A* to a B2* to call f. We have no way of
9293 knowing what (or even whether) this offset will be when we define B2,
9294 so we store this "vcall offset" in the A sub-vtable and look it up in
9295 a "virtual thunk" for B2::f.
9297 We need entries for all the functions in our primary vtable and
9298 in our non-virtual bases' secondary vtables. */
9300 /* If we are just computing the vcall indices -- but do not need
9301 the actual entries -- not that. */
9302 if (!BINFO_VIRTUAL_P (binfo
))
9303 vid
->generate_vcall_entries
= false;
9304 /* Now, walk through the non-virtual bases, adding vcall offsets. */
9305 add_vcall_offset_vtbl_entries_r (binfo
, vid
);
9309 /* Build vcall offsets, starting with those for BINFO. */
9312 add_vcall_offset_vtbl_entries_r (tree binfo
, vtbl_init_data
* vid
)
9318 /* Don't walk into virtual bases -- except, of course, for the
9319 virtual base for which we are building vcall offsets. Any
9320 primary virtual base will have already had its offsets generated
9321 through the recursion in build_vcall_and_vbase_vtbl_entries. */
9322 if (BINFO_VIRTUAL_P (binfo
) && vid
->vbase
!= binfo
)
9325 /* If BINFO has a primary base, process it first. */
9326 primary_binfo
= get_primary_binfo (binfo
);
9328 add_vcall_offset_vtbl_entries_r (primary_binfo
, vid
);
9330 /* Add BINFO itself to the list. */
9331 add_vcall_offset_vtbl_entries_1 (binfo
, vid
);
9333 /* Scan the non-primary bases of BINFO. */
9334 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
9335 if (base_binfo
!= primary_binfo
)
9336 add_vcall_offset_vtbl_entries_r (base_binfo
, vid
);
9339 /* Called from build_vcall_offset_vtbl_entries_r. */
9342 add_vcall_offset_vtbl_entries_1 (tree binfo
, vtbl_init_data
* vid
)
9344 /* Make entries for the rest of the virtuals. */
9347 /* The ABI requires that the methods be processed in declaration
9349 for (orig_fn
= TYPE_METHODS (BINFO_TYPE (binfo
));
9351 orig_fn
= DECL_CHAIN (orig_fn
))
9352 if (TREE_CODE (orig_fn
) == FUNCTION_DECL
&& DECL_VINDEX (orig_fn
))
9353 add_vcall_offset (orig_fn
, binfo
, vid
);
9356 /* Add a vcall offset entry for ORIG_FN to the vtable. */
9359 add_vcall_offset (tree orig_fn
, tree binfo
, vtbl_init_data
*vid
)
9365 /* If there is already an entry for a function with the same
9366 signature as FN, then we do not need a second vcall offset.
9367 Check the list of functions already present in the derived
9369 FOR_EACH_VEC_SAFE_ELT (vid
->fns
, i
, derived_entry
)
9371 if (same_signature_p (derived_entry
, orig_fn
)
9372 /* We only use one vcall offset for virtual destructors,
9373 even though there are two virtual table entries. */
9374 || (DECL_DESTRUCTOR_P (derived_entry
)
9375 && DECL_DESTRUCTOR_P (orig_fn
)))
9379 /* If we are building these vcall offsets as part of building
9380 the vtable for the most derived class, remember the vcall
9382 if (vid
->binfo
== TYPE_BINFO (vid
->derived
))
9384 tree_pair_s elt
= {orig_fn
, vid
->index
};
9385 vec_safe_push (CLASSTYPE_VCALL_INDICES (vid
->derived
), elt
);
9388 /* The next vcall offset will be found at a more negative
9390 vid
->index
= size_binop (MINUS_EXPR
, vid
->index
,
9391 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE
));
9393 /* Keep track of this function. */
9394 vec_safe_push (vid
->fns
, orig_fn
);
9396 if (vid
->generate_vcall_entries
)
9401 /* Find the overriding function. */
9402 fn
= find_final_overrider (vid
->rtti_binfo
, binfo
, orig_fn
);
9403 if (fn
== error_mark_node
)
9404 vcall_offset
= build_zero_cst (vtable_entry_type
);
9407 base
= TREE_VALUE (fn
);
9409 /* The vbase we're working on is a primary base of
9410 vid->binfo. But it might be a lost primary, so its
9411 BINFO_OFFSET might be wrong, so we just use the
9412 BINFO_OFFSET from vid->binfo. */
9413 vcall_offset
= size_diffop_loc (input_location
,
9414 BINFO_OFFSET (base
),
9415 BINFO_OFFSET (vid
->binfo
));
9416 vcall_offset
= fold_build1_loc (input_location
,
9417 NOP_EXPR
, vtable_entry_type
,
9420 /* Add the initializer to the vtable. */
9421 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, vcall_offset
);
9425 /* Return vtbl initializers for the RTTI entries corresponding to the
9426 BINFO's vtable. The RTTI entries should indicate the object given
9427 by VID->rtti_binfo. */
9430 build_rtti_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9438 t
= BINFO_TYPE (vid
->rtti_binfo
);
9440 /* To find the complete object, we will first convert to our most
9441 primary base, and then add the offset in the vtbl to that value. */
9443 while (CLASSTYPE_HAS_PRIMARY_BASE_P (BINFO_TYPE (b
))
9444 && !BINFO_LOST_PRIMARY_P (b
))
9448 primary_base
= get_primary_binfo (b
);
9449 gcc_assert (BINFO_PRIMARY_P (primary_base
)
9450 && BINFO_INHERITANCE_CHAIN (primary_base
) == b
);
9453 offset
= size_diffop_loc (input_location
,
9454 BINFO_OFFSET (vid
->rtti_binfo
), BINFO_OFFSET (b
));
9456 /* The second entry is the address of the typeinfo object. */
9458 decl
= build_address (get_tinfo_decl (t
));
9460 decl
= integer_zero_node
;
9462 /* Convert the declaration to a type that can be stored in the
9464 init
= build_nop (vfunc_ptr_type_node
, decl
);
9465 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, init
);
9467 /* Add the offset-to-top entry. It comes earlier in the vtable than
9468 the typeinfo entry. Convert the offset to look like a
9469 function pointer, so that we can put it in the vtable. */
9470 init
= build_nop (vfunc_ptr_type_node
, offset
);
9471 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, init
);
9474 /* TRUE iff TYPE is uniquely derived from PARENT. Ignores
9478 uniquely_derived_from_p (tree parent
, tree type
)
9480 tree base
= lookup_base (type
, parent
, ba_unique
, NULL
, tf_none
);
9481 return base
&& base
!= error_mark_node
;
9484 /* TRUE iff TYPE is publicly & uniquely derived from PARENT. */
9487 publicly_uniquely_derived_p (tree parent
, tree type
)
9489 tree base
= lookup_base (type
, parent
, ba_ignore_scope
| ba_check
,
9491 return base
&& base
!= error_mark_node
;
9494 /* CTX1 and CTX2 are declaration contexts. Return the innermost common
9495 class between them, if any. */
9498 common_enclosing_class (tree ctx1
, tree ctx2
)
9500 if (!TYPE_P (ctx1
) || !TYPE_P (ctx2
))
9502 gcc_assert (ctx1
== TYPE_MAIN_VARIANT (ctx1
)
9503 && ctx2
== TYPE_MAIN_VARIANT (ctx2
));
9506 for (tree t
= ctx1
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9507 TYPE_MARKED_P (t
) = true;
9508 tree found
= NULL_TREE
;
9509 for (tree t
= ctx2
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9510 if (TYPE_MARKED_P (t
))
9515 for (tree t
= ctx1
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9516 TYPE_MARKED_P (t
) = false;
9520 #include "gt-cp-class.h"