1 /* Functions related to building classes and their related objects.
2 Copyright (C) 1987, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2007, 2008, 2009, 2010
4 Free Software Foundation, Inc.
5 Contributed by Michael Tiemann (tiemann@cygnus.com)
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 3, or (at your option)
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
24 /* High-level class interface. */
28 #include "coretypes.h"
38 #include "tree-dump.h"
39 #include "splay-tree.h"
41 /* The number of nested classes being processed. If we are not in the
42 scope of any class, this is zero. */
44 int current_class_depth
;
46 /* In order to deal with nested classes, we keep a stack of classes.
47 The topmost entry is the innermost class, and is the entry at index
48 CURRENT_CLASS_DEPTH */
50 typedef struct class_stack_node
{
51 /* The name of the class. */
54 /* The _TYPE node for the class. */
57 /* The access specifier pending for new declarations in the scope of
61 /* If were defining TYPE, the names used in this class. */
62 splay_tree names_used
;
64 /* Nonzero if this class is no longer open, because of a call to
67 }* class_stack_node_t
;
69 typedef struct vtbl_init_data_s
71 /* The base for which we're building initializers. */
73 /* The type of the most-derived type. */
75 /* The binfo for the dynamic type. This will be TYPE_BINFO (derived),
76 unless ctor_vtbl_p is true. */
78 /* The negative-index vtable initializers built up so far. These
79 are in order from least negative index to most negative index. */
80 VEC(constructor_elt
,gc
) *inits
;
81 /* The binfo for the virtual base for which we're building
82 vcall offset initializers. */
84 /* The functions in vbase for which we have already provided vcall
87 /* The vtable index of the next vcall or vbase offset. */
89 /* Nonzero if we are building the initializer for the primary
92 /* Nonzero if we are building the initializer for a construction
95 /* True when adding vcall offset entries to the vtable. False when
96 merely computing the indices. */
97 bool generate_vcall_entries
;
100 /* The type of a function passed to walk_subobject_offsets. */
101 typedef int (*subobject_offset_fn
) (tree
, tree
, splay_tree
);
103 /* The stack itself. This is a dynamically resized array. The
104 number of elements allocated is CURRENT_CLASS_STACK_SIZE. */
105 static int current_class_stack_size
;
106 static class_stack_node_t current_class_stack
;
108 /* The size of the largest empty class seen in this translation unit. */
109 static GTY (()) tree sizeof_biggest_empty_class
;
111 /* An array of all local classes present in this translation unit, in
112 declaration order. */
113 VEC(tree
,gc
) *local_classes
;
115 static tree
get_vfield_name (tree
);
116 static void finish_struct_anon (tree
);
117 static tree
get_vtable_name (tree
);
118 static tree
get_basefndecls (tree
, tree
);
119 static int build_primary_vtable (tree
, tree
);
120 static int build_secondary_vtable (tree
);
121 static void finish_vtbls (tree
);
122 static void modify_vtable_entry (tree
, tree
, tree
, tree
, tree
*);
123 static void finish_struct_bits (tree
);
124 static int alter_access (tree
, tree
, tree
);
125 static void handle_using_decl (tree
, tree
);
126 static tree
dfs_modify_vtables (tree
, void *);
127 static tree
modify_all_vtables (tree
, tree
);
128 static void determine_primary_bases (tree
);
129 static void finish_struct_methods (tree
);
130 static void maybe_warn_about_overly_private_class (tree
);
131 static int method_name_cmp (const void *, const void *);
132 static int resort_method_name_cmp (const void *, const void *);
133 static void add_implicitly_declared_members (tree
, int, int);
134 static tree
fixed_type_or_null (tree
, int *, int *);
135 static tree
build_simple_base_path (tree expr
, tree binfo
);
136 static tree
build_vtbl_ref_1 (tree
, tree
);
137 static void build_vtbl_initializer (tree
, tree
, tree
, tree
, int *,
138 VEC(constructor_elt
,gc
) **);
139 static int count_fields (tree
);
140 static int add_fields_to_record_type (tree
, struct sorted_fields_type
*, int);
141 static bool check_bitfield_decl (tree
);
142 static void check_field_decl (tree
, tree
, int *, int *, int *);
143 static void check_field_decls (tree
, tree
*, int *, int *);
144 static tree
*build_base_field (record_layout_info
, tree
, splay_tree
, tree
*);
145 static void build_base_fields (record_layout_info
, splay_tree
, tree
*);
146 static void check_methods (tree
);
147 static void remove_zero_width_bit_fields (tree
);
148 static void check_bases (tree
, int *, int *);
149 static void check_bases_and_members (tree
);
150 static tree
create_vtable_ptr (tree
, tree
*);
151 static void include_empty_classes (record_layout_info
);
152 static void layout_class_type (tree
, tree
*);
153 static void propagate_binfo_offsets (tree
, tree
);
154 static void layout_virtual_bases (record_layout_info
, splay_tree
);
155 static void build_vbase_offset_vtbl_entries (tree
, vtbl_init_data
*);
156 static void add_vcall_offset_vtbl_entries_r (tree
, vtbl_init_data
*);
157 static void add_vcall_offset_vtbl_entries_1 (tree
, vtbl_init_data
*);
158 static void build_vcall_offset_vtbl_entries (tree
, vtbl_init_data
*);
159 static void add_vcall_offset (tree
, tree
, vtbl_init_data
*);
160 static void layout_vtable_decl (tree
, int);
161 static tree
dfs_find_final_overrider_pre (tree
, void *);
162 static tree
dfs_find_final_overrider_post (tree
, void *);
163 static tree
find_final_overrider (tree
, tree
, tree
);
164 static int make_new_vtable (tree
, tree
);
165 static tree
get_primary_binfo (tree
);
166 static int maybe_indent_hierarchy (FILE *, int, int);
167 static tree
dump_class_hierarchy_r (FILE *, int, tree
, tree
, int);
168 static void dump_class_hierarchy (tree
);
169 static void dump_class_hierarchy_1 (FILE *, int, tree
);
170 static void dump_array (FILE *, tree
);
171 static void dump_vtable (tree
, tree
, tree
);
172 static void dump_vtt (tree
, tree
);
173 static void dump_thunk (FILE *, int, tree
);
174 static tree
build_vtable (tree
, tree
, tree
);
175 static void initialize_vtable (tree
, VEC(constructor_elt
,gc
) *);
176 static void layout_nonempty_base_or_field (record_layout_info
,
177 tree
, tree
, splay_tree
);
178 static tree
end_of_class (tree
, int);
179 static bool layout_empty_base (record_layout_info
, tree
, tree
, splay_tree
);
180 static void accumulate_vtbl_inits (tree
, tree
, tree
, tree
, tree
,
181 VEC(constructor_elt
,gc
) **);
182 static void dfs_accumulate_vtbl_inits (tree
, tree
, tree
, tree
, tree
,
183 VEC(constructor_elt
,gc
) **);
184 static void build_rtti_vtbl_entries (tree
, vtbl_init_data
*);
185 static void build_vcall_and_vbase_vtbl_entries (tree
, vtbl_init_data
*);
186 static void clone_constructors_and_destructors (tree
);
187 static tree
build_clone (tree
, tree
);
188 static void update_vtable_entry_for_fn (tree
, tree
, tree
, tree
*, unsigned);
189 static void build_ctor_vtbl_group (tree
, tree
);
190 static void build_vtt (tree
);
191 static tree
binfo_ctor_vtable (tree
);
192 static void build_vtt_inits (tree
, tree
, VEC(constructor_elt
,gc
) **, tree
*);
193 static tree
dfs_build_secondary_vptr_vtt_inits (tree
, void *);
194 static tree
dfs_fixup_binfo_vtbls (tree
, void *);
195 static int record_subobject_offset (tree
, tree
, splay_tree
);
196 static int check_subobject_offset (tree
, tree
, splay_tree
);
197 static int walk_subobject_offsets (tree
, subobject_offset_fn
,
198 tree
, splay_tree
, tree
, int);
199 static void record_subobject_offsets (tree
, tree
, splay_tree
, bool);
200 static int layout_conflict_p (tree
, tree
, splay_tree
, int);
201 static int splay_tree_compare_integer_csts (splay_tree_key k1
,
203 static void warn_about_ambiguous_bases (tree
);
204 static bool type_requires_array_cookie (tree
);
205 static bool contains_empty_class_p (tree
);
206 static bool base_derived_from (tree
, tree
);
207 static int empty_base_at_nonzero_offset_p (tree
, tree
, splay_tree
);
208 static tree
end_of_base (tree
);
209 static tree
get_vcall_index (tree
, tree
);
211 /* Variables shared between class.c and call.c. */
213 #ifdef GATHER_STATISTICS
215 int n_vtable_entries
= 0;
216 int n_vtable_searches
= 0;
217 int n_vtable_elems
= 0;
218 int n_convert_harshness
= 0;
219 int n_compute_conversion_costs
= 0;
220 int n_inner_fields_searched
= 0;
223 /* Convert to or from a base subobject. EXPR is an expression of type
224 `A' or `A*', an expression of type `B' or `B*' is returned. To
225 convert A to a base B, CODE is PLUS_EXPR and BINFO is the binfo for
226 the B base instance within A. To convert base A to derived B, CODE
227 is MINUS_EXPR and BINFO is the binfo for the A instance within B.
228 In this latter case, A must not be a morally virtual base of B.
229 NONNULL is true if EXPR is known to be non-NULL (this is only
230 needed when EXPR is of pointer type). CV qualifiers are preserved
234 build_base_path (enum tree_code code
,
239 tree v_binfo
= NULL_TREE
;
240 tree d_binfo
= NULL_TREE
;
244 tree null_test
= NULL
;
245 tree ptr_target_type
;
247 int want_pointer
= TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
;
248 bool has_empty
= false;
251 if (expr
== error_mark_node
|| binfo
== error_mark_node
|| !binfo
)
252 return error_mark_node
;
254 for (probe
= binfo
; probe
; probe
= BINFO_INHERITANCE_CHAIN (probe
))
257 if (is_empty_class (BINFO_TYPE (probe
)))
259 if (!v_binfo
&& BINFO_VIRTUAL_P (probe
))
263 probe
= TYPE_MAIN_VARIANT (TREE_TYPE (expr
));
265 probe
= TYPE_MAIN_VARIANT (TREE_TYPE (probe
));
267 gcc_assert ((code
== MINUS_EXPR
268 && SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), probe
))
269 || (code
== PLUS_EXPR
270 && SAME_BINFO_TYPE_P (BINFO_TYPE (d_binfo
), probe
)));
272 if (binfo
== d_binfo
)
276 if (code
== MINUS_EXPR
&& v_binfo
)
278 error ("cannot convert from base %qT to derived type %qT via virtual base %qT",
279 BINFO_TYPE (binfo
), BINFO_TYPE (d_binfo
), BINFO_TYPE (v_binfo
));
280 return error_mark_node
;
284 /* This must happen before the call to save_expr. */
285 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 0, tf_warning_or_error
);
287 expr
= mark_rvalue_use (expr
);
289 offset
= BINFO_OFFSET (binfo
);
290 fixed_type_p
= resolves_to_fixed_type_p (expr
, &nonnull
);
291 target_type
= code
== PLUS_EXPR
? BINFO_TYPE (binfo
) : BINFO_TYPE (d_binfo
);
293 /* Do we need to look in the vtable for the real offset? */
294 virtual_access
= (v_binfo
&& fixed_type_p
<= 0);
296 /* Don't bother with the calculations inside sizeof; they'll ICE if the
297 source type is incomplete and the pointer value doesn't matter. */
298 if (cp_unevaluated_operand
!= 0)
300 expr
= build_nop (build_pointer_type (target_type
), expr
);
302 expr
= build_indirect_ref (EXPR_LOCATION (expr
), expr
, RO_NULL
);
306 /* Do we need to check for a null pointer? */
307 if (want_pointer
&& !nonnull
)
309 /* If we know the conversion will not actually change the value
310 of EXPR, then we can avoid testing the expression for NULL.
311 We have to avoid generating a COMPONENT_REF for a base class
312 field, because other parts of the compiler know that such
313 expressions are always non-NULL. */
314 if (!virtual_access
&& integer_zerop (offset
))
317 /* TARGET_TYPE has been extracted from BINFO, and, is
318 therefore always cv-unqualified. Extract the
319 cv-qualifiers from EXPR so that the expression returned
320 matches the input. */
321 class_type
= TREE_TYPE (TREE_TYPE (expr
));
323 = cp_build_qualified_type (target_type
,
324 cp_type_quals (class_type
));
325 return build_nop (build_pointer_type (target_type
), expr
);
327 null_test
= error_mark_node
;
330 /* Protect against multiple evaluation if necessary. */
331 if (TREE_SIDE_EFFECTS (expr
) && (null_test
|| virtual_access
))
332 expr
= save_expr (expr
);
334 /* Now that we've saved expr, build the real null test. */
337 tree zero
= cp_convert (TREE_TYPE (expr
), integer_zero_node
);
338 null_test
= fold_build2_loc (input_location
, NE_EXPR
, boolean_type_node
,
342 /* If this is a simple base reference, express it as a COMPONENT_REF. */
343 if (code
== PLUS_EXPR
&& !virtual_access
344 /* We don't build base fields for empty bases, and they aren't very
345 interesting to the optimizers anyway. */
348 expr
= cp_build_indirect_ref (expr
, RO_NULL
, tf_warning_or_error
);
349 expr
= build_simple_base_path (expr
, binfo
);
351 expr
= build_address (expr
);
352 target_type
= TREE_TYPE (expr
);
358 /* Going via virtual base V_BINFO. We need the static offset
359 from V_BINFO to BINFO, and the dynamic offset from D_BINFO to
360 V_BINFO. That offset is an entry in D_BINFO's vtable. */
363 if (fixed_type_p
< 0 && in_base_initializer
)
365 /* In a base member initializer, we cannot rely on the
366 vtable being set up. We have to indirect via the
370 t
= TREE_TYPE (TYPE_VFIELD (current_class_type
));
371 t
= build_pointer_type (t
);
372 v_offset
= convert (t
, current_vtt_parm
);
373 v_offset
= cp_build_indirect_ref (v_offset
, RO_NULL
,
374 tf_warning_or_error
);
377 v_offset
= build_vfield_ref (cp_build_indirect_ref (expr
, RO_NULL
,
378 tf_warning_or_error
),
379 TREE_TYPE (TREE_TYPE (expr
)));
381 v_offset
= build2 (POINTER_PLUS_EXPR
, TREE_TYPE (v_offset
),
382 v_offset
, fold_convert (sizetype
, BINFO_VPTR_FIELD (v_binfo
)));
383 v_offset
= build1 (NOP_EXPR
,
384 build_pointer_type (ptrdiff_type_node
),
386 v_offset
= cp_build_indirect_ref (v_offset
, RO_NULL
, tf_warning_or_error
);
387 TREE_CONSTANT (v_offset
) = 1;
389 offset
= convert_to_integer (ptrdiff_type_node
,
390 size_diffop_loc (input_location
, offset
,
391 BINFO_OFFSET (v_binfo
)));
393 if (!integer_zerop (offset
))
394 v_offset
= build2 (code
, ptrdiff_type_node
, v_offset
, offset
);
396 if (fixed_type_p
< 0)
397 /* Negative fixed_type_p means this is a constructor or destructor;
398 virtual base layout is fixed in in-charge [cd]tors, but not in
400 offset
= build3 (COND_EXPR
, ptrdiff_type_node
,
401 build2 (EQ_EXPR
, boolean_type_node
,
402 current_in_charge_parm
, integer_zero_node
),
404 convert_to_integer (ptrdiff_type_node
,
405 BINFO_OFFSET (binfo
)));
410 target_type
= cp_build_qualified_type
411 (target_type
, cp_type_quals (TREE_TYPE (TREE_TYPE (expr
))));
412 ptr_target_type
= build_pointer_type (target_type
);
414 target_type
= ptr_target_type
;
416 expr
= build1 (NOP_EXPR
, ptr_target_type
, expr
);
418 if (!integer_zerop (offset
))
420 offset
= fold_convert (sizetype
, offset
);
421 if (code
== MINUS_EXPR
)
422 offset
= fold_build1_loc (input_location
, NEGATE_EXPR
, sizetype
, offset
);
423 expr
= build2 (POINTER_PLUS_EXPR
, ptr_target_type
, expr
, offset
);
429 expr
= cp_build_indirect_ref (expr
, RO_NULL
, tf_warning_or_error
);
433 expr
= fold_build3_loc (input_location
, COND_EXPR
, target_type
, null_test
, expr
,
434 fold_build1_loc (input_location
, NOP_EXPR
, target_type
,
440 /* Subroutine of build_base_path; EXPR and BINFO are as in that function.
441 Perform a derived-to-base conversion by recursively building up a
442 sequence of COMPONENT_REFs to the appropriate base fields. */
445 build_simple_base_path (tree expr
, tree binfo
)
447 tree type
= BINFO_TYPE (binfo
);
448 tree d_binfo
= BINFO_INHERITANCE_CHAIN (binfo
);
451 if (d_binfo
== NULL_TREE
)
455 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (expr
)) == type
);
457 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x'
458 into `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only
459 an lvalue in the front end; only _DECLs and _REFs are lvalues
461 temp
= unary_complex_lvalue (ADDR_EXPR
, expr
);
463 expr
= cp_build_indirect_ref (temp
, RO_NULL
, tf_warning_or_error
);
469 expr
= build_simple_base_path (expr
, d_binfo
);
471 for (field
= TYPE_FIELDS (BINFO_TYPE (d_binfo
));
472 field
; field
= TREE_CHAIN (field
))
473 /* Is this the base field created by build_base_field? */
474 if (TREE_CODE (field
) == FIELD_DECL
475 && DECL_FIELD_IS_BASE (field
)
476 && TREE_TYPE (field
) == type
)
478 /* We don't use build_class_member_access_expr here, as that
479 has unnecessary checks, and more importantly results in
480 recursive calls to dfs_walk_once. */
481 int type_quals
= cp_type_quals (TREE_TYPE (expr
));
483 expr
= build3 (COMPONENT_REF
,
484 cp_build_qualified_type (type
, type_quals
),
485 expr
, field
, NULL_TREE
);
486 expr
= fold_if_not_in_template (expr
);
488 /* Mark the expression const or volatile, as appropriate.
489 Even though we've dealt with the type above, we still have
490 to mark the expression itself. */
491 if (type_quals
& TYPE_QUAL_CONST
)
492 TREE_READONLY (expr
) = 1;
493 if (type_quals
& TYPE_QUAL_VOLATILE
)
494 TREE_THIS_VOLATILE (expr
) = 1;
499 /* Didn't find the base field?!? */
503 /* Convert OBJECT to the base TYPE. OBJECT is an expression whose
504 type is a class type or a pointer to a class type. In the former
505 case, TYPE is also a class type; in the latter it is another
506 pointer type. If CHECK_ACCESS is true, an error message is emitted
507 if TYPE is inaccessible. If OBJECT has pointer type, the value is
508 assumed to be non-NULL. */
511 convert_to_base (tree object
, tree type
, bool check_access
, bool nonnull
,
512 tsubst_flags_t complain
)
518 if (TYPE_PTR_P (TREE_TYPE (object
)))
520 object_type
= TREE_TYPE (TREE_TYPE (object
));
521 type
= TREE_TYPE (type
);
524 object_type
= TREE_TYPE (object
);
526 access
= check_access
? ba_check
: ba_unique
;
527 if (!(complain
& tf_error
))
529 binfo
= lookup_base (object_type
, type
,
532 if (!binfo
|| binfo
== error_mark_node
)
533 return error_mark_node
;
535 return build_base_path (PLUS_EXPR
, object
, binfo
, nonnull
);
538 /* EXPR is an expression with unqualified class type. BASE is a base
539 binfo of that class type. Returns EXPR, converted to the BASE
540 type. This function assumes that EXPR is the most derived class;
541 therefore virtual bases can be found at their static offsets. */
544 convert_to_base_statically (tree expr
, tree base
)
548 expr_type
= TREE_TYPE (expr
);
549 if (!SAME_BINFO_TYPE_P (BINFO_TYPE (base
), expr_type
))
553 pointer_type
= build_pointer_type (expr_type
);
555 /* We use fold_build2 and fold_convert below to simplify the trees
556 provided to the optimizers. It is not safe to call these functions
557 when processing a template because they do not handle C++-specific
559 gcc_assert (!processing_template_decl
);
560 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, /*noconvert=*/1,
561 tf_warning_or_error
);
562 if (!integer_zerop (BINFO_OFFSET (base
)))
563 expr
= fold_build2_loc (input_location
,
564 POINTER_PLUS_EXPR
, pointer_type
, expr
,
565 fold_convert (sizetype
, BINFO_OFFSET (base
)));
566 expr
= fold_convert (build_pointer_type (BINFO_TYPE (base
)), expr
);
567 expr
= build_fold_indirect_ref_loc (input_location
, expr
);
575 build_vfield_ref (tree datum
, tree type
)
577 tree vfield
, vcontext
;
579 if (datum
== error_mark_node
)
580 return error_mark_node
;
582 /* First, convert to the requested type. */
583 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (datum
), type
))
584 datum
= convert_to_base (datum
, type
, /*check_access=*/false,
585 /*nonnull=*/true, tf_warning_or_error
);
587 /* Second, the requested type may not be the owner of its own vptr.
588 If not, convert to the base class that owns it. We cannot use
589 convert_to_base here, because VCONTEXT may appear more than once
590 in the inheritance hierarchy of TYPE, and thus direct conversion
591 between the types may be ambiguous. Following the path back up
592 one step at a time via primary bases avoids the problem. */
593 vfield
= TYPE_VFIELD (type
);
594 vcontext
= DECL_CONTEXT (vfield
);
595 while (!same_type_ignoring_top_level_qualifiers_p (vcontext
, type
))
597 datum
= build_simple_base_path (datum
, CLASSTYPE_PRIMARY_BINFO (type
));
598 type
= TREE_TYPE (datum
);
601 return build3 (COMPONENT_REF
, TREE_TYPE (vfield
), datum
, vfield
, NULL_TREE
);
604 /* Given an object INSTANCE, return an expression which yields the
605 vtable element corresponding to INDEX. There are many special
606 cases for INSTANCE which we take care of here, mainly to avoid
607 creating extra tree nodes when we don't have to. */
610 build_vtbl_ref_1 (tree instance
, tree idx
)
613 tree vtbl
= NULL_TREE
;
615 /* Try to figure out what a reference refers to, and
616 access its virtual function table directly. */
619 tree fixed_type
= fixed_type_or_null (instance
, NULL
, &cdtorp
);
621 tree basetype
= non_reference (TREE_TYPE (instance
));
623 if (fixed_type
&& !cdtorp
)
625 tree binfo
= lookup_base (fixed_type
, basetype
,
626 ba_unique
| ba_quiet
, NULL
);
628 vtbl
= unshare_expr (BINFO_VTABLE (binfo
));
632 vtbl
= build_vfield_ref (instance
, basetype
);
634 aref
= build_array_ref (input_location
, vtbl
, idx
);
635 TREE_CONSTANT (aref
) |= TREE_CONSTANT (vtbl
) && TREE_CONSTANT (idx
);
641 build_vtbl_ref (tree instance
, tree idx
)
643 tree aref
= build_vtbl_ref_1 (instance
, idx
);
648 /* Given a stable object pointer INSTANCE_PTR, return an expression which
649 yields a function pointer corresponding to vtable element INDEX. */
652 build_vfn_ref (tree instance_ptr
, tree idx
)
656 aref
= build_vtbl_ref_1 (cp_build_indirect_ref (instance_ptr
, RO_NULL
,
657 tf_warning_or_error
),
660 /* When using function descriptors, the address of the
661 vtable entry is treated as a function pointer. */
662 if (TARGET_VTABLE_USES_DESCRIPTORS
)
663 aref
= build1 (NOP_EXPR
, TREE_TYPE (aref
),
664 cp_build_unary_op (ADDR_EXPR
, aref
, /*noconvert=*/1,
665 tf_warning_or_error
));
667 /* Remember this as a method reference, for later devirtualization. */
668 aref
= build3 (OBJ_TYPE_REF
, TREE_TYPE (aref
), aref
, instance_ptr
, idx
);
673 /* Return the name of the virtual function table (as an IDENTIFIER_NODE)
674 for the given TYPE. */
677 get_vtable_name (tree type
)
679 return mangle_vtbl_for_type (type
);
682 /* DECL is an entity associated with TYPE, like a virtual table or an
683 implicitly generated constructor. Determine whether or not DECL
684 should have external or internal linkage at the object file
685 level. This routine does not deal with COMDAT linkage and other
686 similar complexities; it simply sets TREE_PUBLIC if it possible for
687 entities in other translation units to contain copies of DECL, in
691 set_linkage_according_to_type (tree type
, tree decl
)
693 /* If TYPE involves a local class in a function with internal
694 linkage, then DECL should have internal linkage too. Other local
695 classes have no linkage -- but if their containing functions
696 have external linkage, it makes sense for DECL to have external
697 linkage too. That will allow template definitions to be merged,
699 if (no_linkage_check (type
, /*relaxed_p=*/true))
701 TREE_PUBLIC (decl
) = 0;
702 DECL_INTERFACE_KNOWN (decl
) = 1;
705 TREE_PUBLIC (decl
) = 1;
708 /* Create a VAR_DECL for a primary or secondary vtable for CLASS_TYPE.
709 (For a secondary vtable for B-in-D, CLASS_TYPE should be D, not B.)
710 Use NAME for the name of the vtable, and VTABLE_TYPE for its type. */
713 build_vtable (tree class_type
, tree name
, tree vtable_type
)
717 decl
= build_lang_decl (VAR_DECL
, name
, vtable_type
);
718 /* vtable names are already mangled; give them their DECL_ASSEMBLER_NAME
719 now to avoid confusion in mangle_decl. */
720 SET_DECL_ASSEMBLER_NAME (decl
, name
);
721 DECL_CONTEXT (decl
) = class_type
;
722 DECL_ARTIFICIAL (decl
) = 1;
723 TREE_STATIC (decl
) = 1;
724 TREE_READONLY (decl
) = 1;
725 DECL_VIRTUAL_P (decl
) = 1;
726 DECL_ALIGN (decl
) = TARGET_VTABLE_ENTRY_ALIGN
;
727 DECL_VTABLE_OR_VTT_P (decl
) = 1;
728 /* At one time the vtable info was grabbed 2 words at a time. This
729 fails on sparc unless you have 8-byte alignment. (tiemann) */
730 DECL_ALIGN (decl
) = MAX (TYPE_ALIGN (double_type_node
),
732 set_linkage_according_to_type (class_type
, decl
);
733 /* The vtable has not been defined -- yet. */
734 DECL_EXTERNAL (decl
) = 1;
735 DECL_NOT_REALLY_EXTERN (decl
) = 1;
737 /* Mark the VAR_DECL node representing the vtable itself as a
738 "gratuitous" one, thereby forcing dwarfout.c to ignore it. It
739 is rather important that such things be ignored because any
740 effort to actually generate DWARF for them will run into
741 trouble when/if we encounter code like:
744 struct S { virtual void member (); };
746 because the artificial declaration of the vtable itself (as
747 manufactured by the g++ front end) will say that the vtable is
748 a static member of `S' but only *after* the debug output for
749 the definition of `S' has already been output. This causes
750 grief because the DWARF entry for the definition of the vtable
751 will try to refer back to an earlier *declaration* of the
752 vtable as a static member of `S' and there won't be one. We
753 might be able to arrange to have the "vtable static member"
754 attached to the member list for `S' before the debug info for
755 `S' get written (which would solve the problem) but that would
756 require more intrusive changes to the g++ front end. */
757 DECL_IGNORED_P (decl
) = 1;
762 /* Get the VAR_DECL of the vtable for TYPE. TYPE need not be polymorphic,
763 or even complete. If this does not exist, create it. If COMPLETE is
764 nonzero, then complete the definition of it -- that will render it
765 impossible to actually build the vtable, but is useful to get at those
766 which are known to exist in the runtime. */
769 get_vtable_decl (tree type
, int complete
)
773 if (CLASSTYPE_VTABLES (type
))
774 return CLASSTYPE_VTABLES (type
);
776 decl
= build_vtable (type
, get_vtable_name (type
), vtbl_type_node
);
777 CLASSTYPE_VTABLES (type
) = decl
;
781 DECL_EXTERNAL (decl
) = 1;
782 cp_finish_decl (decl
, NULL_TREE
, false, NULL_TREE
, 0);
788 /* Build the primary virtual function table for TYPE. If BINFO is
789 non-NULL, build the vtable starting with the initial approximation
790 that it is the same as the one which is the head of the association
791 list. Returns a nonzero value if a new vtable is actually
795 build_primary_vtable (tree binfo
, tree type
)
800 decl
= get_vtable_decl (type
, /*complete=*/0);
804 if (BINFO_NEW_VTABLE_MARKED (binfo
))
805 /* We have already created a vtable for this base, so there's
806 no need to do it again. */
809 virtuals
= copy_list (BINFO_VIRTUALS (binfo
));
810 TREE_TYPE (decl
) = TREE_TYPE (get_vtbl_decl_for_binfo (binfo
));
811 DECL_SIZE (decl
) = TYPE_SIZE (TREE_TYPE (decl
));
812 DECL_SIZE_UNIT (decl
) = TYPE_SIZE_UNIT (TREE_TYPE (decl
));
816 gcc_assert (TREE_TYPE (decl
) == vtbl_type_node
);
817 virtuals
= NULL_TREE
;
820 #ifdef GATHER_STATISTICS
822 n_vtable_elems
+= list_length (virtuals
);
825 /* Initialize the association list for this type, based
826 on our first approximation. */
827 BINFO_VTABLE (TYPE_BINFO (type
)) = decl
;
828 BINFO_VIRTUALS (TYPE_BINFO (type
)) = virtuals
;
829 SET_BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (type
));
833 /* Give BINFO a new virtual function table which is initialized
834 with a skeleton-copy of its original initialization. The only
835 entry that changes is the `delta' entry, so we can really
836 share a lot of structure.
838 FOR_TYPE is the most derived type which caused this table to
841 Returns nonzero if we haven't met BINFO before.
843 The order in which vtables are built (by calling this function) for
844 an object must remain the same, otherwise a binary incompatibility
848 build_secondary_vtable (tree binfo
)
850 if (BINFO_NEW_VTABLE_MARKED (binfo
))
851 /* We already created a vtable for this base. There's no need to
855 /* Remember that we've created a vtable for this BINFO, so that we
856 don't try to do so again. */
857 SET_BINFO_NEW_VTABLE_MARKED (binfo
);
859 /* Make fresh virtual list, so we can smash it later. */
860 BINFO_VIRTUALS (binfo
) = copy_list (BINFO_VIRTUALS (binfo
));
862 /* Secondary vtables are laid out as part of the same structure as
863 the primary vtable. */
864 BINFO_VTABLE (binfo
) = NULL_TREE
;
868 /* Create a new vtable for BINFO which is the hierarchy dominated by
869 T. Return nonzero if we actually created a new vtable. */
872 make_new_vtable (tree t
, tree binfo
)
874 if (binfo
== TYPE_BINFO (t
))
875 /* In this case, it is *type*'s vtable we are modifying. We start
876 with the approximation that its vtable is that of the
877 immediate base class. */
878 return build_primary_vtable (binfo
, t
);
880 /* This is our very own copy of `basetype' to play with. Later,
881 we will fill in all the virtual functions that override the
882 virtual functions in these base classes which are not defined
883 by the current type. */
884 return build_secondary_vtable (binfo
);
887 /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO
888 (which is in the hierarchy dominated by T) list FNDECL as its
889 BV_FN. DELTA is the required constant adjustment from the `this'
890 pointer where the vtable entry appears to the `this' required when
891 the function is actually called. */
894 modify_vtable_entry (tree t
,
904 if (fndecl
!= BV_FN (v
)
905 || !tree_int_cst_equal (delta
, BV_DELTA (v
)))
907 /* We need a new vtable for BINFO. */
908 if (make_new_vtable (t
, binfo
))
910 /* If we really did make a new vtable, we also made a copy
911 of the BINFO_VIRTUALS list. Now, we have to find the
912 corresponding entry in that list. */
913 *virtuals
= BINFO_VIRTUALS (binfo
);
914 while (BV_FN (*virtuals
) != BV_FN (v
))
915 *virtuals
= TREE_CHAIN (*virtuals
);
919 BV_DELTA (v
) = delta
;
920 BV_VCALL_INDEX (v
) = NULL_TREE
;
926 /* Add method METHOD to class TYPE. If USING_DECL is non-null, it is
927 the USING_DECL naming METHOD. Returns true if the method could be
928 added to the method vec. */
931 add_method (tree type
, tree method
, tree using_decl
)
935 bool template_conv_p
= false;
937 VEC(tree
,gc
) *method_vec
;
939 bool insert_p
= false;
943 if (method
== error_mark_node
)
946 complete_p
= COMPLETE_TYPE_P (type
);
947 conv_p
= DECL_CONV_FN_P (method
);
949 template_conv_p
= (TREE_CODE (method
) == TEMPLATE_DECL
950 && DECL_TEMPLATE_CONV_FN_P (method
));
952 method_vec
= CLASSTYPE_METHOD_VEC (type
);
955 /* Make a new method vector. We start with 8 entries. We must
956 allocate at least two (for constructors and destructors), and
957 we're going to end up with an assignment operator at some
959 method_vec
= VEC_alloc (tree
, gc
, 8);
960 /* Create slots for constructors and destructors. */
961 VEC_quick_push (tree
, method_vec
, NULL_TREE
);
962 VEC_quick_push (tree
, method_vec
, NULL_TREE
);
963 CLASSTYPE_METHOD_VEC (type
) = method_vec
;
966 /* Maintain TYPE_HAS_USER_CONSTRUCTOR, etc. */
967 grok_special_member_properties (method
);
969 /* Constructors and destructors go in special slots. */
970 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (method
))
971 slot
= CLASSTYPE_CONSTRUCTOR_SLOT
;
972 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method
))
974 slot
= CLASSTYPE_DESTRUCTOR_SLOT
;
976 if (TYPE_FOR_JAVA (type
))
978 if (!DECL_ARTIFICIAL (method
))
979 error ("Java class %qT cannot have a destructor", type
);
980 else if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
981 error ("Java class %qT cannot have an implicit non-trivial "
991 /* See if we already have an entry with this name. */
992 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
993 VEC_iterate (tree
, method_vec
, slot
, m
);
999 if (TREE_CODE (m
) == TEMPLATE_DECL
1000 && DECL_TEMPLATE_CONV_FN_P (m
))
1004 if (conv_p
&& !DECL_CONV_FN_P (m
))
1006 if (DECL_NAME (m
) == DECL_NAME (method
))
1012 && !DECL_CONV_FN_P (m
)
1013 && DECL_NAME (m
) > DECL_NAME (method
))
1017 current_fns
= insert_p
? NULL_TREE
: VEC_index (tree
, method_vec
, slot
);
1019 /* Check to see if we've already got this method. */
1020 for (fns
= current_fns
; fns
; fns
= OVL_NEXT (fns
))
1022 tree fn
= OVL_CURRENT (fns
);
1028 if (TREE_CODE (fn
) != TREE_CODE (method
))
1031 /* [over.load] Member function declarations with the
1032 same name and the same parameter types cannot be
1033 overloaded if any of them is a static member
1034 function declaration.
1036 [namespace.udecl] When a using-declaration brings names
1037 from a base class into a derived class scope, member
1038 functions in the derived class override and/or hide member
1039 functions with the same name and parameter types in a base
1040 class (rather than conflicting). */
1041 fn_type
= TREE_TYPE (fn
);
1042 method_type
= TREE_TYPE (method
);
1043 parms1
= TYPE_ARG_TYPES (fn_type
);
1044 parms2
= TYPE_ARG_TYPES (method_type
);
1046 /* Compare the quals on the 'this' parm. Don't compare
1047 the whole types, as used functions are treated as
1048 coming from the using class in overload resolution. */
1049 if (! DECL_STATIC_FUNCTION_P (fn
)
1050 && ! DECL_STATIC_FUNCTION_P (method
)
1051 && TREE_TYPE (TREE_VALUE (parms1
)) != error_mark_node
1052 && TREE_TYPE (TREE_VALUE (parms2
)) != error_mark_node
1053 && (cp_type_quals (TREE_TYPE (TREE_VALUE (parms1
)))
1054 != cp_type_quals (TREE_TYPE (TREE_VALUE (parms2
)))))
1057 /* For templates, the return type and template parameters
1058 must be identical. */
1059 if (TREE_CODE (fn
) == TEMPLATE_DECL
1060 && (!same_type_p (TREE_TYPE (fn_type
),
1061 TREE_TYPE (method_type
))
1062 || !comp_template_parms (DECL_TEMPLATE_PARMS (fn
),
1063 DECL_TEMPLATE_PARMS (method
))))
1066 if (! DECL_STATIC_FUNCTION_P (fn
))
1067 parms1
= TREE_CHAIN (parms1
);
1068 if (! DECL_STATIC_FUNCTION_P (method
))
1069 parms2
= TREE_CHAIN (parms2
);
1071 if (compparms (parms1
, parms2
)
1072 && (!DECL_CONV_FN_P (fn
)
1073 || same_type_p (TREE_TYPE (fn_type
),
1074 TREE_TYPE (method_type
))))
1078 if (DECL_CONTEXT (fn
) == type
)
1079 /* Defer to the local function. */
1081 if (DECL_CONTEXT (fn
) == DECL_CONTEXT (method
))
1082 error ("repeated using declaration %q+D", using_decl
);
1084 error ("using declaration %q+D conflicts with a previous using declaration",
1089 error ("%q+#D cannot be overloaded", method
);
1090 error ("with %q+#D", fn
);
1093 /* We don't call duplicate_decls here to merge the
1094 declarations because that will confuse things if the
1095 methods have inline definitions. In particular, we
1096 will crash while processing the definitions. */
1101 /* A class should never have more than one destructor. */
1102 if (current_fns
&& DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method
))
1105 /* Add the new binding. */
1106 overload
= build_overload (method
, current_fns
);
1109 TYPE_HAS_CONVERSION (type
) = 1;
1110 else if (slot
>= CLASSTYPE_FIRST_CONVERSION_SLOT
&& !complete_p
)
1111 push_class_level_binding (DECL_NAME (method
), overload
);
1117 /* We only expect to add few methods in the COMPLETE_P case, so
1118 just make room for one more method in that case. */
1120 reallocated
= VEC_reserve_exact (tree
, gc
, method_vec
, 1);
1122 reallocated
= VEC_reserve (tree
, gc
, method_vec
, 1);
1124 CLASSTYPE_METHOD_VEC (type
) = method_vec
;
1125 if (slot
== VEC_length (tree
, method_vec
))
1126 VEC_quick_push (tree
, method_vec
, overload
);
1128 VEC_quick_insert (tree
, method_vec
, slot
, overload
);
1131 /* Replace the current slot. */
1132 VEC_replace (tree
, method_vec
, slot
, overload
);
1136 /* Subroutines of finish_struct. */
1138 /* Change the access of FDECL to ACCESS in T. Return 1 if change was
1139 legit, otherwise return 0. */
1142 alter_access (tree t
, tree fdecl
, tree access
)
1146 if (!DECL_LANG_SPECIFIC (fdecl
))
1147 retrofit_lang_decl (fdecl
);
1149 gcc_assert (!DECL_DISCRIMINATOR_P (fdecl
));
1151 elem
= purpose_member (t
, DECL_ACCESS (fdecl
));
1154 if (TREE_VALUE (elem
) != access
)
1156 if (TREE_CODE (TREE_TYPE (fdecl
)) == FUNCTION_DECL
)
1157 error ("conflicting access specifications for method"
1158 " %q+D, ignored", TREE_TYPE (fdecl
));
1160 error ("conflicting access specifications for field %qE, ignored",
1165 /* They're changing the access to the same thing they changed
1166 it to before. That's OK. */
1172 perform_or_defer_access_check (TYPE_BINFO (t
), fdecl
, fdecl
);
1173 DECL_ACCESS (fdecl
) = tree_cons (t
, access
, DECL_ACCESS (fdecl
));
1179 /* Process the USING_DECL, which is a member of T. */
1182 handle_using_decl (tree using_decl
, tree t
)
1184 tree decl
= USING_DECL_DECLS (using_decl
);
1185 tree name
= DECL_NAME (using_decl
);
1187 = TREE_PRIVATE (using_decl
) ? access_private_node
1188 : TREE_PROTECTED (using_decl
) ? access_protected_node
1189 : access_public_node
;
1190 tree flist
= NULL_TREE
;
1193 gcc_assert (!processing_template_decl
&& decl
);
1195 old_value
= lookup_member (t
, name
, /*protect=*/0, /*want_type=*/false);
1198 if (is_overloaded_fn (old_value
))
1199 old_value
= OVL_CURRENT (old_value
);
1201 if (DECL_P (old_value
) && DECL_CONTEXT (old_value
) == t
)
1204 old_value
= NULL_TREE
;
1207 cp_emit_debug_info_for_using (decl
, USING_DECL_SCOPE (using_decl
));
1209 if (is_overloaded_fn (decl
))
1214 else if (is_overloaded_fn (old_value
))
1217 /* It's OK to use functions from a base when there are functions with
1218 the same name already present in the current class. */;
1221 error ("%q+D invalid in %q#T", using_decl
, t
);
1222 error (" because of local method %q+#D with same name",
1223 OVL_CURRENT (old_value
));
1227 else if (!DECL_ARTIFICIAL (old_value
))
1229 error ("%q+D invalid in %q#T", using_decl
, t
);
1230 error (" because of local member %q+#D with same name", old_value
);
1234 /* Make type T see field decl FDECL with access ACCESS. */
1236 for (; flist
; flist
= OVL_NEXT (flist
))
1238 add_method (t
, OVL_CURRENT (flist
), using_decl
);
1239 alter_access (t
, OVL_CURRENT (flist
), access
);
1242 alter_access (t
, decl
, access
);
1245 /* Run through the base classes of T, updating CANT_HAVE_CONST_CTOR_P,
1246 and NO_CONST_ASN_REF_P. Also set flag bits in T based on
1247 properties of the bases. */
1250 check_bases (tree t
,
1251 int* cant_have_const_ctor_p
,
1252 int* no_const_asn_ref_p
)
1255 int seen_non_virtual_nearly_empty_base_p
;
1258 tree field
= NULL_TREE
;
1260 seen_non_virtual_nearly_empty_base_p
= 0;
1262 if (!CLASSTYPE_NON_STD_LAYOUT (t
))
1263 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
1264 if (TREE_CODE (field
) == FIELD_DECL
)
1267 for (binfo
= TYPE_BINFO (t
), i
= 0;
1268 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
1270 tree basetype
= TREE_TYPE (base_binfo
);
1272 gcc_assert (COMPLETE_TYPE_P (basetype
));
1274 /* Effective C++ rule 14. We only need to check TYPE_POLYMORPHIC_P
1275 here because the case of virtual functions but non-virtual
1276 dtor is handled in finish_struct_1. */
1277 if (!TYPE_POLYMORPHIC_P (basetype
))
1278 warning (OPT_Weffc__
,
1279 "base class %q#T has a non-virtual destructor", basetype
);
1281 /* If the base class doesn't have copy constructors or
1282 assignment operators that take const references, then the
1283 derived class cannot have such a member automatically
1285 if (TYPE_HAS_COPY_CTOR (basetype
)
1286 && ! TYPE_HAS_CONST_COPY_CTOR (basetype
))
1287 *cant_have_const_ctor_p
= 1;
1288 if (TYPE_HAS_COPY_ASSIGN (basetype
)
1289 && !TYPE_HAS_CONST_COPY_ASSIGN (basetype
))
1290 *no_const_asn_ref_p
= 1;
1292 if (BINFO_VIRTUAL_P (base_binfo
))
1293 /* A virtual base does not effect nearly emptiness. */
1295 else if (CLASSTYPE_NEARLY_EMPTY_P (basetype
))
1297 if (seen_non_virtual_nearly_empty_base_p
)
1298 /* And if there is more than one nearly empty base, then the
1299 derived class is not nearly empty either. */
1300 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
1302 /* Remember we've seen one. */
1303 seen_non_virtual_nearly_empty_base_p
= 1;
1305 else if (!is_empty_class (basetype
))
1306 /* If the base class is not empty or nearly empty, then this
1307 class cannot be nearly empty. */
1308 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
1310 /* A lot of properties from the bases also apply to the derived
1312 TYPE_NEEDS_CONSTRUCTING (t
) |= TYPE_NEEDS_CONSTRUCTING (basetype
);
1313 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
1314 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (basetype
);
1315 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
)
1316 |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (basetype
)
1317 || !TYPE_HAS_COPY_ASSIGN (basetype
));
1318 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= (TYPE_HAS_COMPLEX_COPY_CTOR (basetype
)
1319 || !TYPE_HAS_COPY_CTOR (basetype
));
1320 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
)
1321 |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (basetype
);
1322 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_HAS_COMPLEX_MOVE_CTOR (basetype
);
1323 TYPE_POLYMORPHIC_P (t
) |= TYPE_POLYMORPHIC_P (basetype
);
1324 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
)
1325 |= CLASSTYPE_CONTAINS_EMPTY_CLASS_P (basetype
);
1326 TYPE_HAS_COMPLEX_DFLT (t
) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
1327 || TYPE_HAS_COMPLEX_DFLT (basetype
));
1329 /* A standard-layout class is a class that:
1331 * has no non-standard-layout base classes, */
1332 CLASSTYPE_NON_STD_LAYOUT (t
) |= CLASSTYPE_NON_STD_LAYOUT (basetype
);
1333 if (!CLASSTYPE_NON_STD_LAYOUT (t
))
1336 /* ...has no base classes of the same type as the first non-static
1338 if (field
&& DECL_CONTEXT (field
) == t
1339 && (same_type_ignoring_top_level_qualifiers_p
1340 (TREE_TYPE (field
), basetype
)))
1341 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
1343 /* ...either has no non-static data members in the most-derived
1344 class and at most one base class with non-static data
1345 members, or has no base classes with non-static data
1347 for (basefield
= TYPE_FIELDS (basetype
); basefield
;
1348 basefield
= TREE_CHAIN (basefield
))
1349 if (TREE_CODE (basefield
) == FIELD_DECL
)
1352 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
1361 /* Determine all the primary bases within T. Sets BINFO_PRIMARY_BASE_P for
1362 those that are primaries. Sets BINFO_LOST_PRIMARY_P for those
1363 that have had a nearly-empty virtual primary base stolen by some
1364 other base in the hierarchy. Determines CLASSTYPE_PRIMARY_BASE for
1368 determine_primary_bases (tree t
)
1371 tree primary
= NULL_TREE
;
1372 tree type_binfo
= TYPE_BINFO (t
);
1375 /* Determine the primary bases of our bases. */
1376 for (base_binfo
= TREE_CHAIN (type_binfo
); base_binfo
;
1377 base_binfo
= TREE_CHAIN (base_binfo
))
1379 tree primary
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (base_binfo
));
1381 /* See if we're the non-virtual primary of our inheritance
1383 if (!BINFO_VIRTUAL_P (base_binfo
))
1385 tree parent
= BINFO_INHERITANCE_CHAIN (base_binfo
);
1386 tree parent_primary
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (parent
));
1389 && SAME_BINFO_TYPE_P (BINFO_TYPE (base_binfo
),
1390 BINFO_TYPE (parent_primary
)))
1391 /* We are the primary binfo. */
1392 BINFO_PRIMARY_P (base_binfo
) = 1;
1394 /* Determine if we have a virtual primary base, and mark it so.
1396 if (primary
&& BINFO_VIRTUAL_P (primary
))
1398 tree this_primary
= copied_binfo (primary
, base_binfo
);
1400 if (BINFO_PRIMARY_P (this_primary
))
1401 /* Someone already claimed this base. */
1402 BINFO_LOST_PRIMARY_P (base_binfo
) = 1;
1407 BINFO_PRIMARY_P (this_primary
) = 1;
1408 BINFO_INHERITANCE_CHAIN (this_primary
) = base_binfo
;
1410 /* A virtual binfo might have been copied from within
1411 another hierarchy. As we're about to use it as a
1412 primary base, make sure the offsets match. */
1413 delta
= size_diffop_loc (input_location
,
1415 BINFO_OFFSET (base_binfo
)),
1417 BINFO_OFFSET (this_primary
)));
1419 propagate_binfo_offsets (this_primary
, delta
);
1424 /* First look for a dynamic direct non-virtual base. */
1425 for (i
= 0; BINFO_BASE_ITERATE (type_binfo
, i
, base_binfo
); i
++)
1427 tree basetype
= BINFO_TYPE (base_binfo
);
1429 if (TYPE_CONTAINS_VPTR_P (basetype
) && !BINFO_VIRTUAL_P (base_binfo
))
1431 primary
= base_binfo
;
1436 /* A "nearly-empty" virtual base class can be the primary base
1437 class, if no non-virtual polymorphic base can be found. Look for
1438 a nearly-empty virtual dynamic base that is not already a primary
1439 base of something in the hierarchy. If there is no such base,
1440 just pick the first nearly-empty virtual base. */
1442 for (base_binfo
= TREE_CHAIN (type_binfo
); base_binfo
;
1443 base_binfo
= TREE_CHAIN (base_binfo
))
1444 if (BINFO_VIRTUAL_P (base_binfo
)
1445 && CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (base_binfo
)))
1447 if (!BINFO_PRIMARY_P (base_binfo
))
1449 /* Found one that is not primary. */
1450 primary
= base_binfo
;
1454 /* Remember the first candidate. */
1455 primary
= base_binfo
;
1459 /* If we've got a primary base, use it. */
1462 tree basetype
= BINFO_TYPE (primary
);
1464 CLASSTYPE_PRIMARY_BINFO (t
) = primary
;
1465 if (BINFO_PRIMARY_P (primary
))
1466 /* We are stealing a primary base. */
1467 BINFO_LOST_PRIMARY_P (BINFO_INHERITANCE_CHAIN (primary
)) = 1;
1468 BINFO_PRIMARY_P (primary
) = 1;
1469 if (BINFO_VIRTUAL_P (primary
))
1473 BINFO_INHERITANCE_CHAIN (primary
) = type_binfo
;
1474 /* A virtual binfo might have been copied from within
1475 another hierarchy. As we're about to use it as a primary
1476 base, make sure the offsets match. */
1477 delta
= size_diffop_loc (input_location
, ssize_int (0),
1478 convert (ssizetype
, BINFO_OFFSET (primary
)));
1480 propagate_binfo_offsets (primary
, delta
);
1483 primary
= TYPE_BINFO (basetype
);
1485 TYPE_VFIELD (t
) = TYPE_VFIELD (basetype
);
1486 BINFO_VTABLE (type_binfo
) = BINFO_VTABLE (primary
);
1487 BINFO_VIRTUALS (type_binfo
) = BINFO_VIRTUALS (primary
);
1491 /* Update the variant types of T. */
1494 fixup_type_variants (tree t
)
1501 for (variants
= TYPE_NEXT_VARIANT (t
);
1503 variants
= TYPE_NEXT_VARIANT (variants
))
1505 /* These fields are in the _TYPE part of the node, not in
1506 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1507 TYPE_HAS_USER_CONSTRUCTOR (variants
) = TYPE_HAS_USER_CONSTRUCTOR (t
);
1508 TYPE_NEEDS_CONSTRUCTING (variants
) = TYPE_NEEDS_CONSTRUCTING (t
);
1509 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (variants
)
1510 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
);
1512 TYPE_POLYMORPHIC_P (variants
) = TYPE_POLYMORPHIC_P (t
);
1514 TYPE_BINFO (variants
) = TYPE_BINFO (t
);
1516 /* Copy whatever these are holding today. */
1517 TYPE_VFIELD (variants
) = TYPE_VFIELD (t
);
1518 TYPE_METHODS (variants
) = TYPE_METHODS (t
);
1519 TYPE_FIELDS (variants
) = TYPE_FIELDS (t
);
1521 /* All variants of a class have the same attributes. */
1522 TYPE_ATTRIBUTES (variants
) = TYPE_ATTRIBUTES (t
);
1527 /* Set memoizing fields and bits of T (and its variants) for later
1531 finish_struct_bits (tree t
)
1533 /* Fix up variants (if any). */
1534 fixup_type_variants (t
);
1536 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t
)) && TYPE_POLYMORPHIC_P (t
))
1537 /* For a class w/o baseclasses, 'finish_struct' has set
1538 CLASSTYPE_PURE_VIRTUALS correctly (by definition).
1539 Similarly for a class whose base classes do not have vtables.
1540 When neither of these is true, we might have removed abstract
1541 virtuals (by providing a definition), added some (by declaring
1542 new ones), or redeclared ones from a base class. We need to
1543 recalculate what's really an abstract virtual at this point (by
1544 looking in the vtables). */
1545 get_pure_virtuals (t
);
1547 /* If this type has a copy constructor or a destructor, force its
1548 mode to be BLKmode, and force its TREE_ADDRESSABLE bit to be
1549 nonzero. This will cause it to be passed by invisible reference
1550 and prevent it from being returned in a register. */
1551 if (type_has_nontrivial_copy_init (t
)
1552 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
1555 DECL_MODE (TYPE_MAIN_DECL (t
)) = BLKmode
;
1556 for (variants
= t
; variants
; variants
= TYPE_NEXT_VARIANT (variants
))
1558 SET_TYPE_MODE (variants
, BLKmode
);
1559 TREE_ADDRESSABLE (variants
) = 1;
1564 /* Issue warnings about T having private constructors, but no friends,
1567 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
1568 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
1569 non-private static member functions. */
1572 maybe_warn_about_overly_private_class (tree t
)
1574 int has_member_fn
= 0;
1575 int has_nonprivate_method
= 0;
1578 if (!warn_ctor_dtor_privacy
1579 /* If the class has friends, those entities might create and
1580 access instances, so we should not warn. */
1581 || (CLASSTYPE_FRIEND_CLASSES (t
)
1582 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t
)))
1583 /* We will have warned when the template was declared; there's
1584 no need to warn on every instantiation. */
1585 || CLASSTYPE_TEMPLATE_INSTANTIATION (t
))
1586 /* There's no reason to even consider warning about this
1590 /* We only issue one warning, if more than one applies, because
1591 otherwise, on code like:
1594 // Oops - forgot `public:'
1600 we warn several times about essentially the same problem. */
1602 /* Check to see if all (non-constructor, non-destructor) member
1603 functions are private. (Since there are no friends or
1604 non-private statics, we can't ever call any of the private member
1606 for (fn
= TYPE_METHODS (t
); fn
; fn
= TREE_CHAIN (fn
))
1607 /* We're not interested in compiler-generated methods; they don't
1608 provide any way to call private members. */
1609 if (!DECL_ARTIFICIAL (fn
))
1611 if (!TREE_PRIVATE (fn
))
1613 if (DECL_STATIC_FUNCTION_P (fn
))
1614 /* A non-private static member function is just like a
1615 friend; it can create and invoke private member
1616 functions, and be accessed without a class
1620 has_nonprivate_method
= 1;
1621 /* Keep searching for a static member function. */
1623 else if (!DECL_CONSTRUCTOR_P (fn
) && !DECL_DESTRUCTOR_P (fn
))
1627 if (!has_nonprivate_method
&& has_member_fn
)
1629 /* There are no non-private methods, and there's at least one
1630 private member function that isn't a constructor or
1631 destructor. (If all the private members are
1632 constructors/destructors we want to use the code below that
1633 issues error messages specifically referring to
1634 constructors/destructors.) */
1636 tree binfo
= TYPE_BINFO (t
);
1638 for (i
= 0; i
!= BINFO_N_BASE_BINFOS (binfo
); i
++)
1639 if (BINFO_BASE_ACCESS (binfo
, i
) != access_private_node
)
1641 has_nonprivate_method
= 1;
1644 if (!has_nonprivate_method
)
1646 warning (OPT_Wctor_dtor_privacy
,
1647 "all member functions in class %qT are private", t
);
1652 /* Even if some of the member functions are non-private, the class
1653 won't be useful for much if all the constructors or destructors
1654 are private: such an object can never be created or destroyed. */
1655 fn
= CLASSTYPE_DESTRUCTORS (t
);
1656 if (fn
&& TREE_PRIVATE (fn
))
1658 warning (OPT_Wctor_dtor_privacy
,
1659 "%q#T only defines a private destructor and has no friends",
1664 /* Warn about classes that have private constructors and no friends. */
1665 if (TYPE_HAS_USER_CONSTRUCTOR (t
)
1666 /* Implicitly generated constructors are always public. */
1667 && (!CLASSTYPE_LAZY_DEFAULT_CTOR (t
)
1668 || !CLASSTYPE_LAZY_COPY_CTOR (t
)))
1670 int nonprivate_ctor
= 0;
1672 /* If a non-template class does not define a copy
1673 constructor, one is defined for it, enabling it to avoid
1674 this warning. For a template class, this does not
1675 happen, and so we would normally get a warning on:
1677 template <class T> class C { private: C(); };
1679 To avoid this asymmetry, we check TYPE_HAS_COPY_CTOR. All
1680 complete non-template or fully instantiated classes have this
1682 if (!TYPE_HAS_COPY_CTOR (t
))
1683 nonprivate_ctor
= 1;
1685 for (fn
= CLASSTYPE_CONSTRUCTORS (t
); fn
; fn
= OVL_NEXT (fn
))
1687 tree ctor
= OVL_CURRENT (fn
);
1688 /* Ideally, we wouldn't count copy constructors (or, in
1689 fact, any constructor that takes an argument of the
1690 class type as a parameter) because such things cannot
1691 be used to construct an instance of the class unless
1692 you already have one. But, for now at least, we're
1694 if (! TREE_PRIVATE (ctor
))
1696 nonprivate_ctor
= 1;
1701 if (nonprivate_ctor
== 0)
1703 warning (OPT_Wctor_dtor_privacy
,
1704 "%q#T only defines private constructors and has no friends",
1712 gt_pointer_operator new_value
;
1716 /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */
1719 method_name_cmp (const void* m1_p
, const void* m2_p
)
1721 const tree
*const m1
= (const tree
*) m1_p
;
1722 const tree
*const m2
= (const tree
*) m2_p
;
1724 if (*m1
== NULL_TREE
&& *m2
== NULL_TREE
)
1726 if (*m1
== NULL_TREE
)
1728 if (*m2
== NULL_TREE
)
1730 if (DECL_NAME (OVL_CURRENT (*m1
)) < DECL_NAME (OVL_CURRENT (*m2
)))
1735 /* This routine compares two fields like method_name_cmp but using the
1736 pointer operator in resort_field_decl_data. */
1739 resort_method_name_cmp (const void* m1_p
, const void* m2_p
)
1741 const tree
*const m1
= (const tree
*) m1_p
;
1742 const tree
*const m2
= (const tree
*) m2_p
;
1743 if (*m1
== NULL_TREE
&& *m2
== NULL_TREE
)
1745 if (*m1
== NULL_TREE
)
1747 if (*m2
== NULL_TREE
)
1750 tree d1
= DECL_NAME (OVL_CURRENT (*m1
));
1751 tree d2
= DECL_NAME (OVL_CURRENT (*m2
));
1752 resort_data
.new_value (&d1
, resort_data
.cookie
);
1753 resort_data
.new_value (&d2
, resort_data
.cookie
);
1760 /* Resort TYPE_METHOD_VEC because pointers have been reordered. */
1763 resort_type_method_vec (void* obj
,
1764 void* orig_obj ATTRIBUTE_UNUSED
,
1765 gt_pointer_operator new_value
,
1768 VEC(tree
,gc
) *method_vec
= (VEC(tree
,gc
) *) obj
;
1769 int len
= VEC_length (tree
, method_vec
);
1773 /* The type conversion ops have to live at the front of the vec, so we
1775 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
1776 VEC_iterate (tree
, method_vec
, slot
, fn
);
1778 if (!DECL_CONV_FN_P (OVL_CURRENT (fn
)))
1783 resort_data
.new_value
= new_value
;
1784 resort_data
.cookie
= cookie
;
1785 qsort (VEC_address (tree
, method_vec
) + slot
, len
- slot
, sizeof (tree
),
1786 resort_method_name_cmp
);
1790 /* Warn about duplicate methods in fn_fields.
1792 Sort methods that are not special (i.e., constructors, destructors,
1793 and type conversion operators) so that we can find them faster in
1797 finish_struct_methods (tree t
)
1800 VEC(tree
,gc
) *method_vec
;
1803 method_vec
= CLASSTYPE_METHOD_VEC (t
);
1807 len
= VEC_length (tree
, method_vec
);
1809 /* Clear DECL_IN_AGGR_P for all functions. */
1810 for (fn_fields
= TYPE_METHODS (t
); fn_fields
;
1811 fn_fields
= TREE_CHAIN (fn_fields
))
1812 DECL_IN_AGGR_P (fn_fields
) = 0;
1814 /* Issue warnings about private constructors and such. If there are
1815 no methods, then some public defaults are generated. */
1816 maybe_warn_about_overly_private_class (t
);
1818 /* The type conversion ops have to live at the front of the vec, so we
1820 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
1821 VEC_iterate (tree
, method_vec
, slot
, fn_fields
);
1823 if (!DECL_CONV_FN_P (OVL_CURRENT (fn_fields
)))
1826 qsort (VEC_address (tree
, method_vec
) + slot
,
1827 len
-slot
, sizeof (tree
), method_name_cmp
);
1830 /* Make BINFO's vtable have N entries, including RTTI entries,
1831 vbase and vcall offsets, etc. Set its type and call the back end
1835 layout_vtable_decl (tree binfo
, int n
)
1840 atype
= build_cplus_array_type (vtable_entry_type
,
1841 build_index_type (size_int (n
- 1)));
1842 layout_type (atype
);
1844 /* We may have to grow the vtable. */
1845 vtable
= get_vtbl_decl_for_binfo (binfo
);
1846 if (!same_type_p (TREE_TYPE (vtable
), atype
))
1848 TREE_TYPE (vtable
) = atype
;
1849 DECL_SIZE (vtable
) = DECL_SIZE_UNIT (vtable
) = NULL_TREE
;
1850 layout_decl (vtable
, 0);
1854 /* True iff FNDECL and BASE_FNDECL (both non-static member functions)
1855 have the same signature. */
1858 same_signature_p (const_tree fndecl
, const_tree base_fndecl
)
1860 /* One destructor overrides another if they are the same kind of
1862 if (DECL_DESTRUCTOR_P (base_fndecl
) && DECL_DESTRUCTOR_P (fndecl
)
1863 && special_function_p (base_fndecl
) == special_function_p (fndecl
))
1865 /* But a non-destructor never overrides a destructor, nor vice
1866 versa, nor do different kinds of destructors override
1867 one-another. For example, a complete object destructor does not
1868 override a deleting destructor. */
1869 if (DECL_DESTRUCTOR_P (base_fndecl
) || DECL_DESTRUCTOR_P (fndecl
))
1872 if (DECL_NAME (fndecl
) == DECL_NAME (base_fndecl
)
1873 || (DECL_CONV_FN_P (fndecl
)
1874 && DECL_CONV_FN_P (base_fndecl
)
1875 && same_type_p (DECL_CONV_FN_TYPE (fndecl
),
1876 DECL_CONV_FN_TYPE (base_fndecl
))))
1878 tree types
, base_types
;
1879 types
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
1880 base_types
= TYPE_ARG_TYPES (TREE_TYPE (base_fndecl
));
1881 if ((cp_type_quals (TREE_TYPE (TREE_VALUE (base_types
)))
1882 == cp_type_quals (TREE_TYPE (TREE_VALUE (types
))))
1883 && compparms (TREE_CHAIN (base_types
), TREE_CHAIN (types
)))
1889 /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a
1893 base_derived_from (tree derived
, tree base
)
1897 for (probe
= base
; probe
; probe
= BINFO_INHERITANCE_CHAIN (probe
))
1899 if (probe
== derived
)
1901 else if (BINFO_VIRTUAL_P (probe
))
1902 /* If we meet a virtual base, we can't follow the inheritance
1903 any more. See if the complete type of DERIVED contains
1904 such a virtual base. */
1905 return (binfo_for_vbase (BINFO_TYPE (probe
), BINFO_TYPE (derived
))
1911 typedef struct find_final_overrider_data_s
{
1912 /* The function for which we are trying to find a final overrider. */
1914 /* The base class in which the function was declared. */
1915 tree declaring_base
;
1916 /* The candidate overriders. */
1918 /* Path to most derived. */
1919 VEC(tree
,heap
) *path
;
1920 } find_final_overrider_data
;
1922 /* Add the overrider along the current path to FFOD->CANDIDATES.
1923 Returns true if an overrider was found; false otherwise. */
1926 dfs_find_final_overrider_1 (tree binfo
,
1927 find_final_overrider_data
*ffod
,
1932 /* If BINFO is not the most derived type, try a more derived class.
1933 A definition there will overrider a definition here. */
1937 if (dfs_find_final_overrider_1
1938 (VEC_index (tree
, ffod
->path
, depth
), ffod
, depth
))
1942 method
= look_for_overrides_here (BINFO_TYPE (binfo
), ffod
->fn
);
1945 tree
*candidate
= &ffod
->candidates
;
1947 /* Remove any candidates overridden by this new function. */
1950 /* If *CANDIDATE overrides METHOD, then METHOD
1951 cannot override anything else on the list. */
1952 if (base_derived_from (TREE_VALUE (*candidate
), binfo
))
1954 /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */
1955 if (base_derived_from (binfo
, TREE_VALUE (*candidate
)))
1956 *candidate
= TREE_CHAIN (*candidate
);
1958 candidate
= &TREE_CHAIN (*candidate
);
1961 /* Add the new function. */
1962 ffod
->candidates
= tree_cons (method
, binfo
, ffod
->candidates
);
1969 /* Called from find_final_overrider via dfs_walk. */
1972 dfs_find_final_overrider_pre (tree binfo
, void *data
)
1974 find_final_overrider_data
*ffod
= (find_final_overrider_data
*) data
;
1976 if (binfo
== ffod
->declaring_base
)
1977 dfs_find_final_overrider_1 (binfo
, ffod
, VEC_length (tree
, ffod
->path
));
1978 VEC_safe_push (tree
, heap
, ffod
->path
, binfo
);
1984 dfs_find_final_overrider_post (tree binfo ATTRIBUTE_UNUSED
, void *data
)
1986 find_final_overrider_data
*ffod
= (find_final_overrider_data
*) data
;
1987 VEC_pop (tree
, ffod
->path
);
1992 /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for
1993 FN and whose TREE_VALUE is the binfo for the base where the
1994 overriding occurs. BINFO (in the hierarchy dominated by the binfo
1995 DERIVED) is the base object in which FN is declared. */
1998 find_final_overrider (tree derived
, tree binfo
, tree fn
)
2000 find_final_overrider_data ffod
;
2002 /* Getting this right is a little tricky. This is valid:
2004 struct S { virtual void f (); };
2005 struct T { virtual void f (); };
2006 struct U : public S, public T { };
2008 even though calling `f' in `U' is ambiguous. But,
2010 struct R { virtual void f(); };
2011 struct S : virtual public R { virtual void f (); };
2012 struct T : virtual public R { virtual void f (); };
2013 struct U : public S, public T { };
2015 is not -- there's no way to decide whether to put `S::f' or
2016 `T::f' in the vtable for `R'.
2018 The solution is to look at all paths to BINFO. If we find
2019 different overriders along any two, then there is a problem. */
2020 if (DECL_THUNK_P (fn
))
2021 fn
= THUNK_TARGET (fn
);
2023 /* Determine the depth of the hierarchy. */
2025 ffod
.declaring_base
= binfo
;
2026 ffod
.candidates
= NULL_TREE
;
2027 ffod
.path
= VEC_alloc (tree
, heap
, 30);
2029 dfs_walk_all (derived
, dfs_find_final_overrider_pre
,
2030 dfs_find_final_overrider_post
, &ffod
);
2032 VEC_free (tree
, heap
, ffod
.path
);
2034 /* If there was no winner, issue an error message. */
2035 if (!ffod
.candidates
|| TREE_CHAIN (ffod
.candidates
))
2036 return error_mark_node
;
2038 return ffod
.candidates
;
2041 /* Return the index of the vcall offset for FN when TYPE is used as a
2045 get_vcall_index (tree fn
, tree type
)
2047 VEC(tree_pair_s
,gc
) *indices
= CLASSTYPE_VCALL_INDICES (type
);
2051 for (ix
= 0; VEC_iterate (tree_pair_s
, indices
, ix
, p
); ix
++)
2052 if ((DECL_DESTRUCTOR_P (fn
) && DECL_DESTRUCTOR_P (p
->purpose
))
2053 || same_signature_p (fn
, p
->purpose
))
2056 /* There should always be an appropriate index. */
2060 /* Update an entry in the vtable for BINFO, which is in the hierarchy
2061 dominated by T. FN is the old function; VIRTUALS points to the
2062 corresponding position in the new BINFO_VIRTUALS list. IX is the index
2063 of that entry in the list. */
2066 update_vtable_entry_for_fn (tree t
, tree binfo
, tree fn
, tree
* virtuals
,
2074 tree overrider_fn
, overrider_target
;
2075 tree target_fn
= DECL_THUNK_P (fn
) ? THUNK_TARGET (fn
) : fn
;
2076 tree over_return
, base_return
;
2079 /* Find the nearest primary base (possibly binfo itself) which defines
2080 this function; this is the class the caller will convert to when
2081 calling FN through BINFO. */
2082 for (b
= binfo
; ; b
= get_primary_binfo (b
))
2085 if (look_for_overrides_here (BINFO_TYPE (b
), target_fn
))
2088 /* The nearest definition is from a lost primary. */
2089 if (BINFO_LOST_PRIMARY_P (b
))
2094 /* Find the final overrider. */
2095 overrider
= find_final_overrider (TYPE_BINFO (t
), b
, target_fn
);
2096 if (overrider
== error_mark_node
)
2098 error ("no unique final overrider for %qD in %qT", target_fn
, t
);
2101 overrider_target
= overrider_fn
= TREE_PURPOSE (overrider
);
2103 /* Check for adjusting covariant return types. */
2104 over_return
= TREE_TYPE (TREE_TYPE (overrider_target
));
2105 base_return
= TREE_TYPE (TREE_TYPE (target_fn
));
2107 if (POINTER_TYPE_P (over_return
)
2108 && TREE_CODE (over_return
) == TREE_CODE (base_return
)
2109 && CLASS_TYPE_P (TREE_TYPE (over_return
))
2110 && CLASS_TYPE_P (TREE_TYPE (base_return
))
2111 /* If the overrider is invalid, don't even try. */
2112 && !DECL_INVALID_OVERRIDER_P (overrider_target
))
2114 /* If FN is a covariant thunk, we must figure out the adjustment
2115 to the final base FN was converting to. As OVERRIDER_TARGET might
2116 also be converting to the return type of FN, we have to
2117 combine the two conversions here. */
2118 tree fixed_offset
, virtual_offset
;
2120 over_return
= TREE_TYPE (over_return
);
2121 base_return
= TREE_TYPE (base_return
);
2123 if (DECL_THUNK_P (fn
))
2125 gcc_assert (DECL_RESULT_THUNK_P (fn
));
2126 fixed_offset
= ssize_int (THUNK_FIXED_OFFSET (fn
));
2127 virtual_offset
= THUNK_VIRTUAL_OFFSET (fn
);
2130 fixed_offset
= virtual_offset
= NULL_TREE
;
2133 /* Find the equivalent binfo within the return type of the
2134 overriding function. We will want the vbase offset from
2136 virtual_offset
= binfo_for_vbase (BINFO_TYPE (virtual_offset
),
2138 else if (!same_type_ignoring_top_level_qualifiers_p
2139 (over_return
, base_return
))
2141 /* There was no existing virtual thunk (which takes
2142 precedence). So find the binfo of the base function's
2143 return type within the overriding function's return type.
2144 We cannot call lookup base here, because we're inside a
2145 dfs_walk, and will therefore clobber the BINFO_MARKED
2146 flags. Fortunately we know the covariancy is valid (it
2147 has already been checked), so we can just iterate along
2148 the binfos, which have been chained in inheritance graph
2149 order. Of course it is lame that we have to repeat the
2150 search here anyway -- we should really be caching pieces
2151 of the vtable and avoiding this repeated work. */
2152 tree thunk_binfo
, base_binfo
;
2154 /* Find the base binfo within the overriding function's
2155 return type. We will always find a thunk_binfo, except
2156 when the covariancy is invalid (which we will have
2157 already diagnosed). */
2158 for (base_binfo
= TYPE_BINFO (base_return
),
2159 thunk_binfo
= TYPE_BINFO (over_return
);
2161 thunk_binfo
= TREE_CHAIN (thunk_binfo
))
2162 if (SAME_BINFO_TYPE_P (BINFO_TYPE (thunk_binfo
),
2163 BINFO_TYPE (base_binfo
)))
2166 /* See if virtual inheritance is involved. */
2167 for (virtual_offset
= thunk_binfo
;
2169 virtual_offset
= BINFO_INHERITANCE_CHAIN (virtual_offset
))
2170 if (BINFO_VIRTUAL_P (virtual_offset
))
2174 || (thunk_binfo
&& !BINFO_OFFSET_ZEROP (thunk_binfo
)))
2176 tree offset
= convert (ssizetype
, BINFO_OFFSET (thunk_binfo
));
2180 /* We convert via virtual base. Adjust the fixed
2181 offset to be from there. */
2183 size_diffop (offset
,
2185 BINFO_OFFSET (virtual_offset
)));
2188 /* There was an existing fixed offset, this must be
2189 from the base just converted to, and the base the
2190 FN was thunking to. */
2191 fixed_offset
= size_binop (PLUS_EXPR
, fixed_offset
, offset
);
2193 fixed_offset
= offset
;
2197 if (fixed_offset
|| virtual_offset
)
2198 /* Replace the overriding function with a covariant thunk. We
2199 will emit the overriding function in its own slot as
2201 overrider_fn
= make_thunk (overrider_target
, /*this_adjusting=*/0,
2202 fixed_offset
, virtual_offset
);
2205 gcc_assert (DECL_INVALID_OVERRIDER_P (overrider_target
) ||
2206 !DECL_THUNK_P (fn
));
2208 /* Assume that we will produce a thunk that convert all the way to
2209 the final overrider, and not to an intermediate virtual base. */
2210 virtual_base
= NULL_TREE
;
2212 /* See if we can convert to an intermediate virtual base first, and then
2213 use the vcall offset located there to finish the conversion. */
2214 for (; b
; b
= BINFO_INHERITANCE_CHAIN (b
))
2216 /* If we find the final overrider, then we can stop
2218 if (SAME_BINFO_TYPE_P (BINFO_TYPE (b
),
2219 BINFO_TYPE (TREE_VALUE (overrider
))))
2222 /* If we find a virtual base, and we haven't yet found the
2223 overrider, then there is a virtual base between the
2224 declaring base (first_defn) and the final overrider. */
2225 if (BINFO_VIRTUAL_P (b
))
2232 if (overrider_fn
!= overrider_target
&& !virtual_base
)
2234 /* The ABI specifies that a covariant thunk includes a mangling
2235 for a this pointer adjustment. This-adjusting thunks that
2236 override a function from a virtual base have a vcall
2237 adjustment. When the virtual base in question is a primary
2238 virtual base, we know the adjustments are zero, (and in the
2239 non-covariant case, we would not use the thunk).
2240 Unfortunately we didn't notice this could happen, when
2241 designing the ABI and so never mandated that such a covariant
2242 thunk should be emitted. Because we must use the ABI mandated
2243 name, we must continue searching from the binfo where we
2244 found the most recent definition of the function, towards the
2245 primary binfo which first introduced the function into the
2246 vtable. If that enters a virtual base, we must use a vcall
2247 this-adjusting thunk. Bleah! */
2248 tree probe
= first_defn
;
2250 while ((probe
= get_primary_binfo (probe
))
2251 && (unsigned) list_length (BINFO_VIRTUALS (probe
)) > ix
)
2252 if (BINFO_VIRTUAL_P (probe
))
2253 virtual_base
= probe
;
2256 /* OK, first_defn got this function from a (possibly lost) primary
2257 virtual base, so we're going to use the vcall offset for that
2258 primary virtual base. But the caller is passing a first_defn*,
2259 not a virtual_base*, so the correct delta is the delta between
2260 first_defn* and itself, i.e. zero. */
2261 goto virtual_covariant
;
2264 /* Compute the constant adjustment to the `this' pointer. The
2265 `this' pointer, when this function is called, will point at BINFO
2266 (or one of its primary bases, which are at the same offset). */
2268 /* The `this' pointer needs to be adjusted from the declaration to
2269 the nearest virtual base. */
2270 delta
= size_diffop_loc (input_location
,
2271 convert (ssizetype
, BINFO_OFFSET (virtual_base
)),
2272 convert (ssizetype
, BINFO_OFFSET (first_defn
)));
2274 /* If the nearest definition is in a lost primary, we don't need an
2275 entry in our vtable. Except possibly in a constructor vtable,
2276 if we happen to get our primary back. In that case, the offset
2277 will be zero, as it will be a primary base. */
2279 delta
= size_zero_node
;
2281 /* The `this' pointer needs to be adjusted from pointing to
2282 BINFO to pointing at the base where the final overrider
2284 delta
= size_diffop_loc (input_location
,
2286 BINFO_OFFSET (TREE_VALUE (overrider
))),
2287 convert (ssizetype
, BINFO_OFFSET (binfo
)));
2289 modify_vtable_entry (t
, binfo
, overrider_fn
, delta
, virtuals
);
2292 BV_VCALL_INDEX (*virtuals
)
2293 = get_vcall_index (overrider_target
, BINFO_TYPE (virtual_base
));
2295 BV_VCALL_INDEX (*virtuals
) = NULL_TREE
;
2298 /* Called from modify_all_vtables via dfs_walk. */
2301 dfs_modify_vtables (tree binfo
, void* data
)
2303 tree t
= (tree
) data
;
2308 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
2309 /* A base without a vtable needs no modification, and its bases
2310 are uninteresting. */
2311 return dfs_skip_bases
;
2313 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
)
2314 && !CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
2315 /* Don't do the primary vtable, if it's new. */
2318 if (BINFO_PRIMARY_P (binfo
) && !BINFO_VIRTUAL_P (binfo
))
2319 /* There's no need to modify the vtable for a non-virtual primary
2320 base; we're not going to use that vtable anyhow. We do still
2321 need to do this for virtual primary bases, as they could become
2322 non-primary in a construction vtable. */
2325 make_new_vtable (t
, binfo
);
2327 /* Now, go through each of the virtual functions in the virtual
2328 function table for BINFO. Find the final overrider, and update
2329 the BINFO_VIRTUALS list appropriately. */
2330 for (ix
= 0, virtuals
= BINFO_VIRTUALS (binfo
),
2331 old_virtuals
= BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo
)));
2333 ix
++, virtuals
= TREE_CHAIN (virtuals
),
2334 old_virtuals
= TREE_CHAIN (old_virtuals
))
2335 update_vtable_entry_for_fn (t
,
2337 BV_FN (old_virtuals
),
2343 /* Update all of the primary and secondary vtables for T. Create new
2344 vtables as required, and initialize their RTTI information. Each
2345 of the functions in VIRTUALS is declared in T and may override a
2346 virtual function from a base class; find and modify the appropriate
2347 entries to point to the overriding functions. Returns a list, in
2348 declaration order, of the virtual functions that are declared in T,
2349 but do not appear in the primary base class vtable, and which
2350 should therefore be appended to the end of the vtable for T. */
2353 modify_all_vtables (tree t
, tree virtuals
)
2355 tree binfo
= TYPE_BINFO (t
);
2358 /* Update all of the vtables. */
2359 dfs_walk_once (binfo
, dfs_modify_vtables
, NULL
, t
);
2361 /* Add virtual functions not already in our primary vtable. These
2362 will be both those introduced by this class, and those overridden
2363 from secondary bases. It does not include virtuals merely
2364 inherited from secondary bases. */
2365 for (fnsp
= &virtuals
; *fnsp
; )
2367 tree fn
= TREE_VALUE (*fnsp
);
2369 if (!value_member (fn
, BINFO_VIRTUALS (binfo
))
2370 || DECL_VINDEX (fn
) == error_mark_node
)
2372 /* We don't need to adjust the `this' pointer when
2373 calling this function. */
2374 BV_DELTA (*fnsp
) = integer_zero_node
;
2375 BV_VCALL_INDEX (*fnsp
) = NULL_TREE
;
2377 /* This is a function not already in our vtable. Keep it. */
2378 fnsp
= &TREE_CHAIN (*fnsp
);
2381 /* We've already got an entry for this function. Skip it. */
2382 *fnsp
= TREE_CHAIN (*fnsp
);
2388 /* Get the base virtual function declarations in T that have the
2392 get_basefndecls (tree name
, tree t
)
2395 tree base_fndecls
= NULL_TREE
;
2396 int n_baseclasses
= BINFO_N_BASE_BINFOS (TYPE_BINFO (t
));
2399 /* Find virtual functions in T with the indicated NAME. */
2400 i
= lookup_fnfields_1 (t
, name
);
2402 for (methods
= VEC_index (tree
, CLASSTYPE_METHOD_VEC (t
), i
);
2404 methods
= OVL_NEXT (methods
))
2406 tree method
= OVL_CURRENT (methods
);
2408 if (TREE_CODE (method
) == FUNCTION_DECL
2409 && DECL_VINDEX (method
))
2410 base_fndecls
= tree_cons (NULL_TREE
, method
, base_fndecls
);
2414 return base_fndecls
;
2416 for (i
= 0; i
< n_baseclasses
; i
++)
2418 tree basetype
= BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (t
), i
));
2419 base_fndecls
= chainon (get_basefndecls (name
, basetype
),
2423 return base_fndecls
;
2426 /* If this declaration supersedes the declaration of
2427 a method declared virtual in the base class, then
2428 mark this field as being virtual as well. */
2431 check_for_override (tree decl
, tree ctype
)
2433 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2434 /* In [temp.mem] we have:
2436 A specialization of a member function template does not
2437 override a virtual function from a base class. */
2439 if ((DECL_DESTRUCTOR_P (decl
)
2440 || IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
))
2441 || DECL_CONV_FN_P (decl
))
2442 && look_for_overrides (ctype
, decl
)
2443 && !DECL_STATIC_FUNCTION_P (decl
))
2444 /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor
2445 the error_mark_node so that we know it is an overriding
2447 DECL_VINDEX (decl
) = decl
;
2449 if (DECL_VIRTUAL_P (decl
))
2451 if (!DECL_VINDEX (decl
))
2452 DECL_VINDEX (decl
) = error_mark_node
;
2453 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
2457 /* Warn about hidden virtual functions that are not overridden in t.
2458 We know that constructors and destructors don't apply. */
2461 warn_hidden (tree t
)
2463 VEC(tree
,gc
) *method_vec
= CLASSTYPE_METHOD_VEC (t
);
2467 /* We go through each separately named virtual function. */
2468 for (i
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2469 VEC_iterate (tree
, method_vec
, i
, fns
);
2480 /* All functions in this slot in the CLASSTYPE_METHOD_VEC will
2481 have the same name. Figure out what name that is. */
2482 name
= DECL_NAME (OVL_CURRENT (fns
));
2483 /* There are no possibly hidden functions yet. */
2484 base_fndecls
= NULL_TREE
;
2485 /* Iterate through all of the base classes looking for possibly
2486 hidden functions. */
2487 for (binfo
= TYPE_BINFO (t
), j
= 0;
2488 BINFO_BASE_ITERATE (binfo
, j
, base_binfo
); j
++)
2490 tree basetype
= BINFO_TYPE (base_binfo
);
2491 base_fndecls
= chainon (get_basefndecls (name
, basetype
),
2495 /* If there are no functions to hide, continue. */
2499 /* Remove any overridden functions. */
2500 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
2502 fndecl
= OVL_CURRENT (fn
);
2503 if (DECL_VINDEX (fndecl
))
2505 tree
*prev
= &base_fndecls
;
2508 /* If the method from the base class has the same
2509 signature as the method from the derived class, it
2510 has been overridden. */
2511 if (same_signature_p (fndecl
, TREE_VALUE (*prev
)))
2512 *prev
= TREE_CHAIN (*prev
);
2514 prev
= &TREE_CHAIN (*prev
);
2518 /* Now give a warning for all base functions without overriders,
2519 as they are hidden. */
2520 while (base_fndecls
)
2522 /* Here we know it is a hider, and no overrider exists. */
2523 warning (OPT_Woverloaded_virtual
, "%q+D was hidden", TREE_VALUE (base_fndecls
));
2524 warning (OPT_Woverloaded_virtual
, " by %q+D", fns
);
2525 base_fndecls
= TREE_CHAIN (base_fndecls
);
2530 /* Check for things that are invalid. There are probably plenty of other
2531 things we should check for also. */
2534 finish_struct_anon (tree t
)
2538 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
2540 if (TREE_STATIC (field
))
2542 if (TREE_CODE (field
) != FIELD_DECL
)
2545 if (DECL_NAME (field
) == NULL_TREE
2546 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2548 bool is_union
= TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
;
2549 tree elt
= TYPE_FIELDS (TREE_TYPE (field
));
2550 for (; elt
; elt
= TREE_CHAIN (elt
))
2552 /* We're generally only interested in entities the user
2553 declared, but we also find nested classes by noticing
2554 the TYPE_DECL that we create implicitly. You're
2555 allowed to put one anonymous union inside another,
2556 though, so we explicitly tolerate that. We use
2557 TYPE_ANONYMOUS_P rather than ANON_AGGR_TYPE_P so that
2558 we also allow unnamed types used for defining fields. */
2559 if (DECL_ARTIFICIAL (elt
)
2560 && (!DECL_IMPLICIT_TYPEDEF_P (elt
)
2561 || TYPE_ANONYMOUS_P (TREE_TYPE (elt
))))
2564 if (TREE_CODE (elt
) != FIELD_DECL
)
2567 permerror (input_location
, "%q+#D invalid; an anonymous union can "
2568 "only have non-static data members", elt
);
2570 permerror (input_location
, "%q+#D invalid; an anonymous struct can "
2571 "only have non-static data members", elt
);
2575 if (TREE_PRIVATE (elt
))
2578 permerror (input_location
, "private member %q+#D in anonymous union", elt
);
2580 permerror (input_location
, "private member %q+#D in anonymous struct", elt
);
2582 else if (TREE_PROTECTED (elt
))
2585 permerror (input_location
, "protected member %q+#D in anonymous union", elt
);
2587 permerror (input_location
, "protected member %q+#D in anonymous struct", elt
);
2590 TREE_PRIVATE (elt
) = TREE_PRIVATE (field
);
2591 TREE_PROTECTED (elt
) = TREE_PROTECTED (field
);
2597 /* Add T to CLASSTYPE_DECL_LIST of current_class_type which
2598 will be used later during class template instantiation.
2599 When FRIEND_P is zero, T can be a static member data (VAR_DECL),
2600 a non-static member data (FIELD_DECL), a member function
2601 (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE),
2602 a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL)
2603 When FRIEND_P is nonzero, T is either a friend class
2604 (RECORD_TYPE, TEMPLATE_DECL) or a friend function
2605 (FUNCTION_DECL, TEMPLATE_DECL). */
2608 maybe_add_class_template_decl_list (tree type
, tree t
, int friend_p
)
2610 /* Save some memory by not creating TREE_LIST if TYPE is not template. */
2611 if (CLASSTYPE_TEMPLATE_INFO (type
))
2612 CLASSTYPE_DECL_LIST (type
)
2613 = tree_cons (friend_p
? NULL_TREE
: type
,
2614 t
, CLASSTYPE_DECL_LIST (type
));
2617 /* Create default constructors, assignment operators, and so forth for
2618 the type indicated by T, if they are needed. CANT_HAVE_CONST_CTOR,
2619 and CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason,
2620 the class cannot have a default constructor, copy constructor
2621 taking a const reference argument, or an assignment operator taking
2622 a const reference, respectively. */
2625 add_implicitly_declared_members (tree t
,
2626 int cant_have_const_cctor
,
2627 int cant_have_const_assignment
)
2630 if (!CLASSTYPE_DESTRUCTORS (t
))
2632 /* In general, we create destructors lazily. */
2633 CLASSTYPE_LAZY_DESTRUCTOR (t
) = 1;
2635 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
2636 && TYPE_FOR_JAVA (t
))
2637 /* But if this is a Java class, any non-trivial destructor is
2638 invalid, even if compiler-generated. Therefore, if the
2639 destructor is non-trivial we create it now. */
2640 lazily_declare_fn (sfk_destructor
, t
);
2645 If there is no user-declared constructor for a class, a default
2646 constructor is implicitly declared. */
2647 if (! TYPE_HAS_USER_CONSTRUCTOR (t
))
2649 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 1;
2650 CLASSTYPE_LAZY_DEFAULT_CTOR (t
) = 1;
2655 If a class definition does not explicitly declare a copy
2656 constructor, one is declared implicitly. */
2657 if (! TYPE_HAS_COPY_CTOR (t
) && ! TYPE_FOR_JAVA (t
)
2658 && !type_has_move_constructor (t
))
2660 TYPE_HAS_COPY_CTOR (t
) = 1;
2661 TYPE_HAS_CONST_COPY_CTOR (t
) = !cant_have_const_cctor
;
2662 CLASSTYPE_LAZY_COPY_CTOR (t
) = 1;
2663 if (cxx_dialect
>= cxx0x
)
2664 CLASSTYPE_LAZY_MOVE_CTOR (t
) = 1;
2667 /* If there is no assignment operator, one will be created if and
2668 when it is needed. For now, just record whether or not the type
2669 of the parameter to the assignment operator will be a const or
2670 non-const reference. */
2671 if (!TYPE_HAS_COPY_ASSIGN (t
) && !TYPE_FOR_JAVA (t
)
2672 && !type_has_move_assign (t
))
2674 TYPE_HAS_COPY_ASSIGN (t
) = 1;
2675 TYPE_HAS_CONST_COPY_ASSIGN (t
) = !cant_have_const_assignment
;
2676 CLASSTYPE_LAZY_COPY_ASSIGN (t
) = 1;
2677 if (cxx_dialect
>= cxx0x
)
2678 CLASSTYPE_LAZY_MOVE_ASSIGN (t
) = 1;
2681 /* We can't be lazy about declaring functions that might override
2682 a virtual function from a base class. */
2683 if (TYPE_POLYMORPHIC_P (t
)
2684 && (CLASSTYPE_LAZY_COPY_ASSIGN (t
)
2685 || CLASSTYPE_LAZY_MOVE_ASSIGN (t
)
2686 || CLASSTYPE_LAZY_DESTRUCTOR (t
)))
2688 tree binfo
= TYPE_BINFO (t
);
2691 tree opname
= ansi_assopname (NOP_EXPR
);
2692 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ++ix
)
2695 for (bv
= BINFO_VIRTUALS (base_binfo
); bv
; bv
= TREE_CHAIN (bv
))
2697 tree fn
= BV_FN (bv
);
2698 if (DECL_NAME (fn
) == opname
)
2700 if (CLASSTYPE_LAZY_COPY_ASSIGN (t
))
2701 lazily_declare_fn (sfk_copy_assignment
, t
);
2702 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
2703 lazily_declare_fn (sfk_move_assignment
, t
);
2705 else if (DECL_DESTRUCTOR_P (fn
)
2706 && CLASSTYPE_LAZY_DESTRUCTOR (t
))
2707 lazily_declare_fn (sfk_destructor
, t
);
2713 /* Subroutine of finish_struct_1. Recursively count the number of fields
2714 in TYPE, including anonymous union members. */
2717 count_fields (tree fields
)
2721 for (x
= fields
; x
; x
= TREE_CHAIN (x
))
2723 if (TREE_CODE (x
) == FIELD_DECL
&& ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
2724 n_fields
+= count_fields (TYPE_FIELDS (TREE_TYPE (x
)));
2731 /* Subroutine of finish_struct_1. Recursively add all the fields in the
2732 TREE_LIST FIELDS to the SORTED_FIELDS_TYPE elts, starting at offset IDX. */
2735 add_fields_to_record_type (tree fields
, struct sorted_fields_type
*field_vec
, int idx
)
2738 for (x
= fields
; x
; x
= TREE_CHAIN (x
))
2740 if (TREE_CODE (x
) == FIELD_DECL
&& ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
2741 idx
= add_fields_to_record_type (TYPE_FIELDS (TREE_TYPE (x
)), field_vec
, idx
);
2743 field_vec
->elts
[idx
++] = x
;
2748 /* FIELD is a bit-field. We are finishing the processing for its
2749 enclosing type. Issue any appropriate messages and set appropriate
2750 flags. Returns false if an error has been diagnosed. */
2753 check_bitfield_decl (tree field
)
2755 tree type
= TREE_TYPE (field
);
2758 /* Extract the declared width of the bitfield, which has been
2759 temporarily stashed in DECL_INITIAL. */
2760 w
= DECL_INITIAL (field
);
2761 gcc_assert (w
!= NULL_TREE
);
2762 /* Remove the bit-field width indicator so that the rest of the
2763 compiler does not treat that value as an initializer. */
2764 DECL_INITIAL (field
) = NULL_TREE
;
2766 /* Detect invalid bit-field type. */
2767 if (!INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
2769 error ("bit-field %q+#D with non-integral type", field
);
2770 w
= error_mark_node
;
2774 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
2777 /* detect invalid field size. */
2778 w
= integral_constant_value (w
);
2780 if (TREE_CODE (w
) != INTEGER_CST
)
2782 error ("bit-field %q+D width not an integer constant", field
);
2783 w
= error_mark_node
;
2785 else if (tree_int_cst_sgn (w
) < 0)
2787 error ("negative width in bit-field %q+D", field
);
2788 w
= error_mark_node
;
2790 else if (integer_zerop (w
) && DECL_NAME (field
) != 0)
2792 error ("zero width for bit-field %q+D", field
);
2793 w
= error_mark_node
;
2795 else if (compare_tree_int (w
, TYPE_PRECISION (type
)) > 0
2796 && TREE_CODE (type
) != ENUMERAL_TYPE
2797 && TREE_CODE (type
) != BOOLEAN_TYPE
)
2798 warning (0, "width of %q+D exceeds its type", field
);
2799 else if (TREE_CODE (type
) == ENUMERAL_TYPE
2800 && (0 > (compare_tree_int
2801 (w
, TYPE_PRECISION (ENUM_UNDERLYING_TYPE (type
))))))
2802 warning (0, "%q+D is too small to hold all values of %q#T", field
, type
);
2805 if (w
!= error_mark_node
)
2807 DECL_SIZE (field
) = convert (bitsizetype
, w
);
2808 DECL_BIT_FIELD (field
) = 1;
2813 /* Non-bit-fields are aligned for their type. */
2814 DECL_BIT_FIELD (field
) = 0;
2815 CLEAR_DECL_C_BIT_FIELD (field
);
2820 /* FIELD is a non bit-field. We are finishing the processing for its
2821 enclosing type T. Issue any appropriate messages and set appropriate
2825 check_field_decl (tree field
,
2827 int* cant_have_const_ctor
,
2828 int* no_const_asn_ref
,
2829 int* any_default_members
)
2831 tree type
= strip_array_types (TREE_TYPE (field
));
2833 /* An anonymous union cannot contain any fields which would change
2834 the settings of CANT_HAVE_CONST_CTOR and friends. */
2835 if (ANON_UNION_TYPE_P (type
))
2837 /* And, we don't set TYPE_HAS_CONST_COPY_CTOR, etc., for anonymous
2838 structs. So, we recurse through their fields here. */
2839 else if (ANON_AGGR_TYPE_P (type
))
2843 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
2844 if (TREE_CODE (fields
) == FIELD_DECL
&& !DECL_C_BIT_FIELD (field
))
2845 check_field_decl (fields
, t
, cant_have_const_ctor
,
2846 no_const_asn_ref
, any_default_members
);
2848 /* Check members with class type for constructors, destructors,
2850 else if (CLASS_TYPE_P (type
))
2852 /* Never let anything with uninheritable virtuals
2853 make it through without complaint. */
2854 abstract_virtuals_error (field
, type
);
2856 if (TREE_CODE (t
) == UNION_TYPE
)
2858 if (TYPE_NEEDS_CONSTRUCTING (type
))
2859 error ("member %q+#D with constructor not allowed in union",
2861 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
2862 error ("member %q+#D with destructor not allowed in union", field
);
2863 if (TYPE_HAS_COMPLEX_COPY_ASSIGN (type
))
2864 error ("member %q+#D with copy assignment operator not allowed in union",
2866 /* Don't bother diagnosing move assop now; C++0x has more
2871 TYPE_NEEDS_CONSTRUCTING (t
) |= TYPE_NEEDS_CONSTRUCTING (type
);
2872 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
2873 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
);
2874 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
)
2875 |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (type
)
2876 || !TYPE_HAS_COPY_ASSIGN (type
));
2877 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= (TYPE_HAS_COMPLEX_COPY_CTOR (type
)
2878 || !TYPE_HAS_COPY_CTOR (type
));
2879 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (type
);
2880 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_HAS_COMPLEX_MOVE_CTOR (type
);
2881 TYPE_HAS_COMPLEX_DFLT (t
) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (type
)
2882 || TYPE_HAS_COMPLEX_DFLT (type
));
2885 if (TYPE_HAS_COPY_CTOR (type
)
2886 && !TYPE_HAS_CONST_COPY_CTOR (type
))
2887 *cant_have_const_ctor
= 1;
2889 if (TYPE_HAS_COPY_ASSIGN (type
)
2890 && !TYPE_HAS_CONST_COPY_ASSIGN (type
))
2891 *no_const_asn_ref
= 1;
2893 if (DECL_INITIAL (field
) != NULL_TREE
)
2895 /* `build_class_init_list' does not recognize
2897 if (TREE_CODE (t
) == UNION_TYPE
&& any_default_members
!= 0)
2898 error ("multiple fields in union %qT initialized", t
);
2899 *any_default_members
= 1;
2903 /* Check the data members (both static and non-static), class-scoped
2904 typedefs, etc., appearing in the declaration of T. Issue
2905 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
2906 declaration order) of access declarations; each TREE_VALUE in this
2907 list is a USING_DECL.
2909 In addition, set the following flags:
2912 The class is empty, i.e., contains no non-static data members.
2914 CANT_HAVE_CONST_CTOR_P
2915 This class cannot have an implicitly generated copy constructor
2916 taking a const reference.
2918 CANT_HAVE_CONST_ASN_REF
2919 This class cannot have an implicitly generated assignment
2920 operator taking a const reference.
2922 All of these flags should be initialized before calling this
2925 Returns a pointer to the end of the TYPE_FIELDs chain; additional
2926 fields can be added by adding to this chain. */
2929 check_field_decls (tree t
, tree
*access_decls
,
2930 int *cant_have_const_ctor_p
,
2931 int *no_const_asn_ref_p
)
2936 int any_default_members
;
2938 int field_access
= -1;
2940 /* Assume there are no access declarations. */
2941 *access_decls
= NULL_TREE
;
2942 /* Assume this class has no pointer members. */
2943 has_pointers
= false;
2944 /* Assume none of the members of this class have default
2946 any_default_members
= 0;
2948 for (field
= &TYPE_FIELDS (t
); *field
; field
= next
)
2951 tree type
= TREE_TYPE (x
);
2952 int this_field_access
;
2954 next
= &TREE_CHAIN (x
);
2956 if (TREE_CODE (x
) == USING_DECL
)
2958 /* Prune the access declaration from the list of fields. */
2959 *field
= TREE_CHAIN (x
);
2961 /* Save the access declarations for our caller. */
2962 *access_decls
= tree_cons (NULL_TREE
, x
, *access_decls
);
2964 /* Since we've reset *FIELD there's no reason to skip to the
2970 if (TREE_CODE (x
) == TYPE_DECL
2971 || TREE_CODE (x
) == TEMPLATE_DECL
)
2974 /* If we've gotten this far, it's a data member, possibly static,
2975 or an enumerator. */
2976 DECL_CONTEXT (x
) = t
;
2978 /* When this goes into scope, it will be a non-local reference. */
2979 DECL_NONLOCAL (x
) = 1;
2981 if (TREE_CODE (t
) == UNION_TYPE
)
2985 If a union contains a static data member, or a member of
2986 reference type, the program is ill-formed. */
2987 if (TREE_CODE (x
) == VAR_DECL
)
2989 error ("%q+D may not be static because it is a member of a union", x
);
2992 if (TREE_CODE (type
) == REFERENCE_TYPE
)
2994 error ("%q+D may not have reference type %qT because"
2995 " it is a member of a union",
3001 /* Perform error checking that did not get done in
3003 if (TREE_CODE (type
) == FUNCTION_TYPE
)
3005 error ("field %q+D invalidly declared function type", x
);
3006 type
= build_pointer_type (type
);
3007 TREE_TYPE (x
) = type
;
3009 else if (TREE_CODE (type
) == METHOD_TYPE
)
3011 error ("field %q+D invalidly declared method type", x
);
3012 type
= build_pointer_type (type
);
3013 TREE_TYPE (x
) = type
;
3016 if (type
== error_mark_node
)
3019 if (TREE_CODE (x
) == CONST_DECL
|| TREE_CODE (x
) == VAR_DECL
)
3022 /* Now it can only be a FIELD_DECL. */
3024 if (TREE_PRIVATE (x
) || TREE_PROTECTED (x
))
3025 CLASSTYPE_NON_AGGREGATE (t
) = 1;
3027 /* A standard-layout class is a class that:
3029 has the same access control (Clause 11) for all non-static data members,
3031 this_field_access
= TREE_PROTECTED (x
) ? 1 : TREE_PRIVATE (x
) ? 2 : 0;
3032 if (field_access
== -1)
3033 field_access
= this_field_access
;
3034 else if (this_field_access
!= field_access
)
3035 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3037 /* If this is of reference type, check if it needs an init. */
3038 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3040 CLASSTYPE_NON_LAYOUT_POD_P (t
) = 1;
3041 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3042 if (DECL_INITIAL (x
) == NULL_TREE
)
3043 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t
, 1);
3045 /* ARM $12.6.2: [A member initializer list] (or, for an
3046 aggregate, initialization by a brace-enclosed list) is the
3047 only way to initialize nonstatic const and reference
3049 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
3050 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) = 1;
3053 type
= strip_array_types (type
);
3055 if (TYPE_PACKED (t
))
3057 if (!layout_pod_type_p (type
) && !TYPE_PACKED (type
))
3061 "ignoring packed attribute because of unpacked non-POD field %q+#D",
3065 else if (DECL_C_BIT_FIELD (x
)
3066 || TYPE_ALIGN (TREE_TYPE (x
)) > BITS_PER_UNIT
)
3067 DECL_PACKED (x
) = 1;
3070 if (DECL_C_BIT_FIELD (x
) && integer_zerop (DECL_INITIAL (x
)))
3071 /* We don't treat zero-width bitfields as making a class
3076 /* The class is non-empty. */
3077 CLASSTYPE_EMPTY_P (t
) = 0;
3078 /* The class is not even nearly empty. */
3079 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
3080 /* If one of the data members contains an empty class,
3082 if (CLASS_TYPE_P (type
)
3083 && CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type
))
3084 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 1;
3087 /* This is used by -Weffc++ (see below). Warn only for pointers
3088 to members which might hold dynamic memory. So do not warn
3089 for pointers to functions or pointers to members. */
3090 if (TYPE_PTR_P (type
)
3091 && !TYPE_PTRFN_P (type
)
3092 && !TYPE_PTR_TO_MEMBER_P (type
))
3093 has_pointers
= true;
3095 if (CLASS_TYPE_P (type
))
3097 if (CLASSTYPE_REF_FIELDS_NEED_INIT (type
))
3098 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t
, 1);
3099 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (type
))
3100 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
, 1);
3103 if (DECL_MUTABLE_P (x
) || TYPE_HAS_MUTABLE_P (type
))
3104 CLASSTYPE_HAS_MUTABLE (t
) = 1;
3106 if (! layout_pod_type_p (type
))
3107 /* DR 148 now allows pointers to members (which are POD themselves),
3108 to be allowed in POD structs. */
3109 CLASSTYPE_NON_LAYOUT_POD_P (t
) = 1;
3111 if (!std_layout_type_p (type
))
3112 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3114 if (! zero_init_p (type
))
3115 CLASSTYPE_NON_ZERO_INIT_P (t
) = 1;
3117 /* We set DECL_C_BIT_FIELD in grokbitfield.
3118 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
3119 if (! DECL_C_BIT_FIELD (x
) || ! check_bitfield_decl (x
))
3120 check_field_decl (x
, t
,
3121 cant_have_const_ctor_p
,
3123 &any_default_members
);
3125 /* If any field is const, the structure type is pseudo-const. */
3126 if (CP_TYPE_CONST_P (type
))
3128 C_TYPE_FIELDS_READONLY (t
) = 1;
3129 if (DECL_INITIAL (x
) == NULL_TREE
)
3130 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
, 1);
3132 /* ARM $12.6.2: [A member initializer list] (or, for an
3133 aggregate, initialization by a brace-enclosed list) is the
3134 only way to initialize nonstatic const and reference
3136 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
3137 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) = 1;
3139 /* A field that is pseudo-const makes the structure likewise. */
3140 else if (CLASS_TYPE_P (type
))
3142 C_TYPE_FIELDS_READONLY (t
) |= C_TYPE_FIELDS_READONLY (type
);
3143 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
,
3144 CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
)
3145 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (type
));
3148 /* Core issue 80: A nonstatic data member is required to have a
3149 different name from the class iff the class has a
3150 user-declared constructor. */
3151 if (constructor_name_p (DECL_NAME (x
), t
)
3152 && TYPE_HAS_USER_CONSTRUCTOR (t
))
3153 permerror (input_location
, "field %q+#D with same name as class", x
);
3156 /* Effective C++ rule 11: if a class has dynamic memory held by pointers,
3157 it should also define a copy constructor and an assignment operator to
3158 implement the correct copy semantic (deep vs shallow, etc.). As it is
3159 not feasible to check whether the constructors do allocate dynamic memory
3160 and store it within members, we approximate the warning like this:
3162 -- Warn only if there are members which are pointers
3163 -- Warn only if there is a non-trivial constructor (otherwise,
3164 there cannot be memory allocated).
3165 -- Warn only if there is a non-trivial destructor. We assume that the
3166 user at least implemented the cleanup correctly, and a destructor
3167 is needed to free dynamic memory.
3169 This seems enough for practical purposes. */
3172 && TYPE_HAS_USER_CONSTRUCTOR (t
)
3173 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3174 && !(TYPE_HAS_COPY_CTOR (t
) && TYPE_HAS_COPY_ASSIGN (t
)))
3176 warning (OPT_Weffc__
, "%q#T has pointer data members", t
);
3178 if (! TYPE_HAS_COPY_CTOR (t
))
3180 warning (OPT_Weffc__
,
3181 " but does not override %<%T(const %T&)%>", t
, t
);
3182 if (!TYPE_HAS_COPY_ASSIGN (t
))
3183 warning (OPT_Weffc__
, " or %<operator=(const %T&)%>", t
);
3185 else if (! TYPE_HAS_COPY_ASSIGN (t
))
3186 warning (OPT_Weffc__
,
3187 " but does not override %<operator=(const %T&)%>", t
);
3190 /* If any of the fields couldn't be packed, unset TYPE_PACKED. */
3192 TYPE_PACKED (t
) = 0;
3194 /* Check anonymous struct/anonymous union fields. */
3195 finish_struct_anon (t
);
3197 /* We've built up the list of access declarations in reverse order.
3199 *access_decls
= nreverse (*access_decls
);
3202 /* If TYPE is an empty class type, records its OFFSET in the table of
3206 record_subobject_offset (tree type
, tree offset
, splay_tree offsets
)
3210 if (!is_empty_class (type
))
3213 /* Record the location of this empty object in OFFSETS. */
3214 n
= splay_tree_lookup (offsets
, (splay_tree_key
) offset
);
3216 n
= splay_tree_insert (offsets
,
3217 (splay_tree_key
) offset
,
3218 (splay_tree_value
) NULL_TREE
);
3219 n
->value
= ((splay_tree_value
)
3220 tree_cons (NULL_TREE
,
3227 /* Returns nonzero if TYPE is an empty class type and there is
3228 already an entry in OFFSETS for the same TYPE as the same OFFSET. */
3231 check_subobject_offset (tree type
, tree offset
, splay_tree offsets
)
3236 if (!is_empty_class (type
))
3239 /* Record the location of this empty object in OFFSETS. */
3240 n
= splay_tree_lookup (offsets
, (splay_tree_key
) offset
);
3244 for (t
= (tree
) n
->value
; t
; t
= TREE_CHAIN (t
))
3245 if (same_type_p (TREE_VALUE (t
), type
))
3251 /* Walk through all the subobjects of TYPE (located at OFFSET). Call
3252 F for every subobject, passing it the type, offset, and table of
3253 OFFSETS. If VBASES_P is one, then virtual non-primary bases should
3256 If MAX_OFFSET is non-NULL, then subobjects with an offset greater
3257 than MAX_OFFSET will not be walked.
3259 If F returns a nonzero value, the traversal ceases, and that value
3260 is returned. Otherwise, returns zero. */
3263 walk_subobject_offsets (tree type
,
3264 subobject_offset_fn f
,
3271 tree type_binfo
= NULL_TREE
;
3273 /* If this OFFSET is bigger than the MAX_OFFSET, then we should
3275 if (max_offset
&& INT_CST_LT (max_offset
, offset
))
3278 if (type
== error_mark_node
)
3283 if (abi_version_at_least (2))
3285 type
= BINFO_TYPE (type
);
3288 if (CLASS_TYPE_P (type
))
3294 /* Avoid recursing into objects that are not interesting. */
3295 if (!CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type
))
3298 /* Record the location of TYPE. */
3299 r
= (*f
) (type
, offset
, offsets
);
3303 /* Iterate through the direct base classes of TYPE. */
3305 type_binfo
= TYPE_BINFO (type
);
3306 for (i
= 0; BINFO_BASE_ITERATE (type_binfo
, i
, binfo
); i
++)
3310 if (abi_version_at_least (2)
3311 && BINFO_VIRTUAL_P (binfo
))
3315 && BINFO_VIRTUAL_P (binfo
)
3316 && !BINFO_PRIMARY_P (binfo
))
3319 if (!abi_version_at_least (2))
3320 binfo_offset
= size_binop (PLUS_EXPR
,
3322 BINFO_OFFSET (binfo
));
3326 /* We cannot rely on BINFO_OFFSET being set for the base
3327 class yet, but the offsets for direct non-virtual
3328 bases can be calculated by going back to the TYPE. */
3329 orig_binfo
= BINFO_BASE_BINFO (TYPE_BINFO (type
), i
);
3330 binfo_offset
= size_binop (PLUS_EXPR
,
3332 BINFO_OFFSET (orig_binfo
));
3335 r
= walk_subobject_offsets (binfo
,
3340 (abi_version_at_least (2)
3341 ? /*vbases_p=*/0 : vbases_p
));
3346 if (abi_version_at_least (2) && CLASSTYPE_VBASECLASSES (type
))
3349 VEC(tree
,gc
) *vbases
;
3351 /* Iterate through the virtual base classes of TYPE. In G++
3352 3.2, we included virtual bases in the direct base class
3353 loop above, which results in incorrect results; the
3354 correct offsets for virtual bases are only known when
3355 working with the most derived type. */
3357 for (vbases
= CLASSTYPE_VBASECLASSES (type
), ix
= 0;
3358 VEC_iterate (tree
, vbases
, ix
, binfo
); ix
++)
3360 r
= walk_subobject_offsets (binfo
,
3362 size_binop (PLUS_EXPR
,
3364 BINFO_OFFSET (binfo
)),
3373 /* We still have to walk the primary base, if it is
3374 virtual. (If it is non-virtual, then it was walked
3376 tree vbase
= get_primary_binfo (type_binfo
);
3378 if (vbase
&& BINFO_VIRTUAL_P (vbase
)
3379 && BINFO_PRIMARY_P (vbase
)
3380 && BINFO_INHERITANCE_CHAIN (vbase
) == type_binfo
)
3382 r
= (walk_subobject_offsets
3384 offsets
, max_offset
, /*vbases_p=*/0));
3391 /* Iterate through the fields of TYPE. */
3392 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
3393 if (TREE_CODE (field
) == FIELD_DECL
&& !DECL_ARTIFICIAL (field
))
3397 if (abi_version_at_least (2))
3398 field_offset
= byte_position (field
);
3400 /* In G++ 3.2, DECL_FIELD_OFFSET was used. */
3401 field_offset
= DECL_FIELD_OFFSET (field
);
3403 r
= walk_subobject_offsets (TREE_TYPE (field
),
3405 size_binop (PLUS_EXPR
,
3415 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3417 tree element_type
= strip_array_types (type
);
3418 tree domain
= TYPE_DOMAIN (type
);
3421 /* Avoid recursing into objects that are not interesting. */
3422 if (!CLASS_TYPE_P (element_type
)
3423 || !CLASSTYPE_CONTAINS_EMPTY_CLASS_P (element_type
))
3426 /* Step through each of the elements in the array. */
3427 for (index
= size_zero_node
;
3428 /* G++ 3.2 had an off-by-one error here. */
3429 (abi_version_at_least (2)
3430 ? !INT_CST_LT (TYPE_MAX_VALUE (domain
), index
)
3431 : INT_CST_LT (index
, TYPE_MAX_VALUE (domain
)));
3432 index
= size_binop (PLUS_EXPR
, index
, size_one_node
))
3434 r
= walk_subobject_offsets (TREE_TYPE (type
),
3442 offset
= size_binop (PLUS_EXPR
, offset
,
3443 TYPE_SIZE_UNIT (TREE_TYPE (type
)));
3444 /* If this new OFFSET is bigger than the MAX_OFFSET, then
3445 there's no point in iterating through the remaining
3446 elements of the array. */
3447 if (max_offset
&& INT_CST_LT (max_offset
, offset
))
3455 /* Record all of the empty subobjects of TYPE (either a type or a
3456 binfo). If IS_DATA_MEMBER is true, then a non-static data member
3457 is being placed at OFFSET; otherwise, it is a base class that is
3458 being placed at OFFSET. */
3461 record_subobject_offsets (tree type
,
3464 bool is_data_member
)
3467 /* If recording subobjects for a non-static data member or a
3468 non-empty base class , we do not need to record offsets beyond
3469 the size of the biggest empty class. Additional data members
3470 will go at the end of the class. Additional base classes will go
3471 either at offset zero (if empty, in which case they cannot
3472 overlap with offsets past the size of the biggest empty class) or
3473 at the end of the class.
3475 However, if we are placing an empty base class, then we must record
3476 all offsets, as either the empty class is at offset zero (where
3477 other empty classes might later be placed) or at the end of the
3478 class (where other objects might then be placed, so other empty
3479 subobjects might later overlap). */
3481 || !is_empty_class (BINFO_TYPE (type
)))
3482 max_offset
= sizeof_biggest_empty_class
;
3484 max_offset
= NULL_TREE
;
3485 walk_subobject_offsets (type
, record_subobject_offset
, offset
,
3486 offsets
, max_offset
, is_data_member
);
3489 /* Returns nonzero if any of the empty subobjects of TYPE (located at
3490 OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero,
3491 virtual bases of TYPE are examined. */
3494 layout_conflict_p (tree type
,
3499 splay_tree_node max_node
;
3501 /* Get the node in OFFSETS that indicates the maximum offset where
3502 an empty subobject is located. */
3503 max_node
= splay_tree_max (offsets
);
3504 /* If there aren't any empty subobjects, then there's no point in
3505 performing this check. */
3509 return walk_subobject_offsets (type
, check_subobject_offset
, offset
,
3510 offsets
, (tree
) (max_node
->key
),
3514 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
3515 non-static data member of the type indicated by RLI. BINFO is the
3516 binfo corresponding to the base subobject, OFFSETS maps offsets to
3517 types already located at those offsets. This function determines
3518 the position of the DECL. */
3521 layout_nonempty_base_or_field (record_layout_info rli
,
3526 tree offset
= NULL_TREE
;
3532 /* For the purposes of determining layout conflicts, we want to
3533 use the class type of BINFO; TREE_TYPE (DECL) will be the
3534 CLASSTYPE_AS_BASE version, which does not contain entries for
3535 zero-sized bases. */
3536 type
= TREE_TYPE (binfo
);
3541 type
= TREE_TYPE (decl
);
3545 /* Try to place the field. It may take more than one try if we have
3546 a hard time placing the field without putting two objects of the
3547 same type at the same address. */
3550 struct record_layout_info_s old_rli
= *rli
;
3552 /* Place this field. */
3553 place_field (rli
, decl
);
3554 offset
= byte_position (decl
);
3556 /* We have to check to see whether or not there is already
3557 something of the same type at the offset we're about to use.
3558 For example, consider:
3561 struct T : public S { int i; };
3562 struct U : public S, public T {};
3564 Here, we put S at offset zero in U. Then, we can't put T at
3565 offset zero -- its S component would be at the same address
3566 as the S we already allocated. So, we have to skip ahead.
3567 Since all data members, including those whose type is an
3568 empty class, have nonzero size, any overlap can happen only
3569 with a direct or indirect base-class -- it can't happen with
3571 /* In a union, overlap is permitted; all members are placed at
3573 if (TREE_CODE (rli
->t
) == UNION_TYPE
)
3575 /* G++ 3.2 did not check for overlaps when placing a non-empty
3577 if (!abi_version_at_least (2) && binfo
&& BINFO_VIRTUAL_P (binfo
))
3579 if (layout_conflict_p (field_p
? type
: binfo
, offset
,
3582 /* Strip off the size allocated to this field. That puts us
3583 at the first place we could have put the field with
3584 proper alignment. */
3587 /* Bump up by the alignment required for the type. */
3589 = size_binop (PLUS_EXPR
, rli
->bitpos
,
3591 ? CLASSTYPE_ALIGN (type
)
3592 : TYPE_ALIGN (type
)));
3593 normalize_rli (rli
);
3596 /* There was no conflict. We're done laying out this field. */
3600 /* Now that we know where it will be placed, update its
3602 if (binfo
&& CLASS_TYPE_P (BINFO_TYPE (binfo
)))
3603 /* Indirect virtual bases may have a nonzero BINFO_OFFSET at
3604 this point because their BINFO_OFFSET is copied from another
3605 hierarchy. Therefore, we may not need to add the entire
3607 propagate_binfo_offsets (binfo
,
3608 size_diffop_loc (input_location
,
3609 convert (ssizetype
, offset
),
3611 BINFO_OFFSET (binfo
))));
3614 /* Returns true if TYPE is empty and OFFSET is nonzero. */
3617 empty_base_at_nonzero_offset_p (tree type
,
3619 splay_tree offsets ATTRIBUTE_UNUSED
)
3621 return is_empty_class (type
) && !integer_zerop (offset
);
3624 /* Layout the empty base BINFO. EOC indicates the byte currently just
3625 past the end of the class, and should be correctly aligned for a
3626 class of the type indicated by BINFO; OFFSETS gives the offsets of
3627 the empty bases allocated so far. T is the most derived
3628 type. Return nonzero iff we added it at the end. */
3631 layout_empty_base (record_layout_info rli
, tree binfo
,
3632 tree eoc
, splay_tree offsets
)
3635 tree basetype
= BINFO_TYPE (binfo
);
3638 /* This routine should only be used for empty classes. */
3639 gcc_assert (is_empty_class (basetype
));
3640 alignment
= ssize_int (CLASSTYPE_ALIGN_UNIT (basetype
));
3642 if (!integer_zerop (BINFO_OFFSET (binfo
)))
3644 if (abi_version_at_least (2))
3645 propagate_binfo_offsets
3646 (binfo
, size_diffop_loc (input_location
,
3647 size_zero_node
, BINFO_OFFSET (binfo
)));
3650 "offset of empty base %qT may not be ABI-compliant and may"
3651 "change in a future version of GCC",
3652 BINFO_TYPE (binfo
));
3655 /* This is an empty base class. We first try to put it at offset
3657 if (layout_conflict_p (binfo
,
3658 BINFO_OFFSET (binfo
),
3662 /* That didn't work. Now, we move forward from the next
3663 available spot in the class. */
3665 propagate_binfo_offsets (binfo
, convert (ssizetype
, eoc
));
3668 if (!layout_conflict_p (binfo
,
3669 BINFO_OFFSET (binfo
),
3672 /* We finally found a spot where there's no overlap. */
3675 /* There's overlap here, too. Bump along to the next spot. */
3676 propagate_binfo_offsets (binfo
, alignment
);
3680 if (CLASSTYPE_USER_ALIGN (basetype
))
3682 rli
->record_align
= MAX (rli
->record_align
, CLASSTYPE_ALIGN (basetype
));
3684 rli
->unpacked_align
= MAX (rli
->unpacked_align
, CLASSTYPE_ALIGN (basetype
));
3685 TYPE_USER_ALIGN (rli
->t
) = 1;
3691 /* Layout the base given by BINFO in the class indicated by RLI.
3692 *BASE_ALIGN is a running maximum of the alignments of
3693 any base class. OFFSETS gives the location of empty base
3694 subobjects. T is the most derived type. Return nonzero if the new
3695 object cannot be nearly-empty. A new FIELD_DECL is inserted at
3696 *NEXT_FIELD, unless BINFO is for an empty base class.
3698 Returns the location at which the next field should be inserted. */
3701 build_base_field (record_layout_info rli
, tree binfo
,
3702 splay_tree offsets
, tree
*next_field
)
3705 tree basetype
= BINFO_TYPE (binfo
);
3707 if (!COMPLETE_TYPE_P (basetype
))
3708 /* This error is now reported in xref_tag, thus giving better
3709 location information. */
3712 /* Place the base class. */
3713 if (!is_empty_class (basetype
))
3717 /* The containing class is non-empty because it has a non-empty
3719 CLASSTYPE_EMPTY_P (t
) = 0;
3721 /* Create the FIELD_DECL. */
3722 decl
= build_decl (input_location
,
3723 FIELD_DECL
, NULL_TREE
, CLASSTYPE_AS_BASE (basetype
));
3724 DECL_ARTIFICIAL (decl
) = 1;
3725 DECL_IGNORED_P (decl
) = 1;
3726 DECL_FIELD_CONTEXT (decl
) = t
;
3727 if (CLASSTYPE_AS_BASE (basetype
))
3729 DECL_SIZE (decl
) = CLASSTYPE_SIZE (basetype
);
3730 DECL_SIZE_UNIT (decl
) = CLASSTYPE_SIZE_UNIT (basetype
);
3731 DECL_ALIGN (decl
) = CLASSTYPE_ALIGN (basetype
);
3732 DECL_USER_ALIGN (decl
) = CLASSTYPE_USER_ALIGN (basetype
);
3733 DECL_MODE (decl
) = TYPE_MODE (basetype
);
3734 DECL_FIELD_IS_BASE (decl
) = 1;
3736 /* Try to place the field. It may take more than one try if we
3737 have a hard time placing the field without putting two
3738 objects of the same type at the same address. */
3739 layout_nonempty_base_or_field (rli
, decl
, binfo
, offsets
);
3740 /* Add the new FIELD_DECL to the list of fields for T. */
3741 TREE_CHAIN (decl
) = *next_field
;
3743 next_field
= &TREE_CHAIN (decl
);
3751 /* On some platforms (ARM), even empty classes will not be
3753 eoc
= round_up_loc (input_location
,
3754 rli_size_unit_so_far (rli
),
3755 CLASSTYPE_ALIGN_UNIT (basetype
));
3756 atend
= layout_empty_base (rli
, binfo
, eoc
, offsets
);
3757 /* A nearly-empty class "has no proper base class that is empty,
3758 not morally virtual, and at an offset other than zero." */
3759 if (!BINFO_VIRTUAL_P (binfo
) && CLASSTYPE_NEARLY_EMPTY_P (t
))
3762 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
3763 /* The check above (used in G++ 3.2) is insufficient because
3764 an empty class placed at offset zero might itself have an
3765 empty base at a nonzero offset. */
3766 else if (walk_subobject_offsets (basetype
,
3767 empty_base_at_nonzero_offset_p
,
3770 /*max_offset=*/NULL_TREE
,
3773 if (abi_version_at_least (2))
3774 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
3777 "class %qT will be considered nearly empty in a "
3778 "future version of GCC", t
);
3782 /* We do not create a FIELD_DECL for empty base classes because
3783 it might overlap some other field. We want to be able to
3784 create CONSTRUCTORs for the class by iterating over the
3785 FIELD_DECLs, and the back end does not handle overlapping
3788 /* An empty virtual base causes a class to be non-empty
3789 -- but in that case we do not need to clear CLASSTYPE_EMPTY_P
3790 here because that was already done when the virtual table
3791 pointer was created. */
3794 /* Record the offsets of BINFO and its base subobjects. */
3795 record_subobject_offsets (binfo
,
3796 BINFO_OFFSET (binfo
),
3798 /*is_data_member=*/false);
3803 /* Layout all of the non-virtual base classes. Record empty
3804 subobjects in OFFSETS. T is the most derived type. Return nonzero
3805 if the type cannot be nearly empty. The fields created
3806 corresponding to the base classes will be inserted at
3810 build_base_fields (record_layout_info rli
,
3811 splay_tree offsets
, tree
*next_field
)
3813 /* Chain to hold all the new FIELD_DECLs which stand in for base class
3816 int n_baseclasses
= BINFO_N_BASE_BINFOS (TYPE_BINFO (t
));
3819 /* The primary base class is always allocated first. */
3820 if (CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
3821 next_field
= build_base_field (rli
, CLASSTYPE_PRIMARY_BINFO (t
),
3822 offsets
, next_field
);
3824 /* Now allocate the rest of the bases. */
3825 for (i
= 0; i
< n_baseclasses
; ++i
)
3829 base_binfo
= BINFO_BASE_BINFO (TYPE_BINFO (t
), i
);
3831 /* The primary base was already allocated above, so we don't
3832 need to allocate it again here. */
3833 if (base_binfo
== CLASSTYPE_PRIMARY_BINFO (t
))
3836 /* Virtual bases are added at the end (a primary virtual base
3837 will have already been added). */
3838 if (BINFO_VIRTUAL_P (base_binfo
))
3841 next_field
= build_base_field (rli
, base_binfo
,
3842 offsets
, next_field
);
3846 /* Go through the TYPE_METHODS of T issuing any appropriate
3847 diagnostics, figuring out which methods override which other
3848 methods, and so forth. */
3851 check_methods (tree t
)
3855 for (x
= TYPE_METHODS (t
); x
; x
= TREE_CHAIN (x
))
3857 check_for_override (x
, t
);
3858 if (DECL_PURE_VIRTUAL_P (x
) && ! DECL_VINDEX (x
))
3859 error ("initializer specified for non-virtual method %q+D", x
);
3860 /* The name of the field is the original field name
3861 Save this in auxiliary field for later overloading. */
3862 if (DECL_VINDEX (x
))
3864 TYPE_POLYMORPHIC_P (t
) = 1;
3865 if (DECL_PURE_VIRTUAL_P (x
))
3866 VEC_safe_push (tree
, gc
, CLASSTYPE_PURE_VIRTUALS (t
), x
);
3868 /* All user-provided destructors are non-trivial.
3869 Constructors and assignment ops are handled in
3870 grok_special_member_properties. */
3871 if (DECL_DESTRUCTOR_P (x
) && user_provided_p (x
))
3872 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = 1;
3876 /* FN is a constructor or destructor. Clone the declaration to create
3877 a specialized in-charge or not-in-charge version, as indicated by
3881 build_clone (tree fn
, tree name
)
3886 /* Copy the function. */
3887 clone
= copy_decl (fn
);
3888 /* Reset the function name. */
3889 DECL_NAME (clone
) = name
;
3890 SET_DECL_ASSEMBLER_NAME (clone
, NULL_TREE
);
3891 /* Remember where this function came from. */
3892 DECL_ABSTRACT_ORIGIN (clone
) = fn
;
3893 /* Make it easy to find the CLONE given the FN. */
3894 TREE_CHAIN (clone
) = TREE_CHAIN (fn
);
3895 TREE_CHAIN (fn
) = clone
;
3897 /* If this is a template, do the rest on the DECL_TEMPLATE_RESULT. */
3898 if (TREE_CODE (clone
) == TEMPLATE_DECL
)
3900 tree result
= build_clone (DECL_TEMPLATE_RESULT (clone
), name
);
3901 DECL_TEMPLATE_RESULT (clone
) = result
;
3902 DECL_TEMPLATE_INFO (result
) = copy_node (DECL_TEMPLATE_INFO (result
));
3903 DECL_TI_TEMPLATE (result
) = clone
;
3904 TREE_TYPE (clone
) = TREE_TYPE (result
);
3908 DECL_CLONED_FUNCTION (clone
) = fn
;
3909 /* There's no pending inline data for this function. */
3910 DECL_PENDING_INLINE_INFO (clone
) = NULL
;
3911 DECL_PENDING_INLINE_P (clone
) = 0;
3913 /* The base-class destructor is not virtual. */
3914 if (name
== base_dtor_identifier
)
3916 DECL_VIRTUAL_P (clone
) = 0;
3917 if (TREE_CODE (clone
) != TEMPLATE_DECL
)
3918 DECL_VINDEX (clone
) = NULL_TREE
;
3921 /* If there was an in-charge parameter, drop it from the function
3923 if (DECL_HAS_IN_CHARGE_PARM_P (clone
))
3929 exceptions
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone
));
3930 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (clone
));
3931 parmtypes
= TYPE_ARG_TYPES (TREE_TYPE (clone
));
3932 /* Skip the `this' parameter. */
3933 parmtypes
= TREE_CHAIN (parmtypes
);
3934 /* Skip the in-charge parameter. */
3935 parmtypes
= TREE_CHAIN (parmtypes
);
3936 /* And the VTT parm, in a complete [cd]tor. */
3937 if (DECL_HAS_VTT_PARM_P (fn
)
3938 && ! DECL_NEEDS_VTT_PARM_P (clone
))
3939 parmtypes
= TREE_CHAIN (parmtypes
);
3940 /* If this is subobject constructor or destructor, add the vtt
3943 = build_method_type_directly (basetype
,
3944 TREE_TYPE (TREE_TYPE (clone
)),
3947 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
),
3950 = cp_build_type_attribute_variant (TREE_TYPE (clone
),
3951 TYPE_ATTRIBUTES (TREE_TYPE (fn
)));
3954 /* Copy the function parameters. */
3955 DECL_ARGUMENTS (clone
) = copy_list (DECL_ARGUMENTS (clone
));
3956 /* Remove the in-charge parameter. */
3957 if (DECL_HAS_IN_CHARGE_PARM_P (clone
))
3959 TREE_CHAIN (DECL_ARGUMENTS (clone
))
3960 = TREE_CHAIN (TREE_CHAIN (DECL_ARGUMENTS (clone
)));
3961 DECL_HAS_IN_CHARGE_PARM_P (clone
) = 0;
3963 /* And the VTT parm, in a complete [cd]tor. */
3964 if (DECL_HAS_VTT_PARM_P (fn
))
3966 if (DECL_NEEDS_VTT_PARM_P (clone
))
3967 DECL_HAS_VTT_PARM_P (clone
) = 1;
3970 TREE_CHAIN (DECL_ARGUMENTS (clone
))
3971 = TREE_CHAIN (TREE_CHAIN (DECL_ARGUMENTS (clone
)));
3972 DECL_HAS_VTT_PARM_P (clone
) = 0;
3976 for (parms
= DECL_ARGUMENTS (clone
); parms
; parms
= TREE_CHAIN (parms
))
3978 DECL_CONTEXT (parms
) = clone
;
3979 cxx_dup_lang_specific_decl (parms
);
3982 /* Create the RTL for this function. */
3983 SET_DECL_RTL (clone
, NULL
);
3984 rest_of_decl_compilation (clone
, /*top_level=*/1, at_eof
);
3987 note_decl_for_pch (clone
);
3992 /* Implementation of DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P, do
3993 not invoke this function directly.
3995 For a non-thunk function, returns the address of the slot for storing
3996 the function it is a clone of. Otherwise returns NULL_TREE.
3998 If JUST_TESTING, looks through TEMPLATE_DECL and returns NULL if
3999 cloned_function is unset. This is to support the separate
4000 DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P modes; using the latter
4001 on a template makes sense, but not the former. */
4004 decl_cloned_function_p (const_tree decl
, bool just_testing
)
4008 decl
= STRIP_TEMPLATE (decl
);
4010 if (TREE_CODE (decl
) != FUNCTION_DECL
4011 || !DECL_LANG_SPECIFIC (decl
)
4012 || DECL_LANG_SPECIFIC (decl
)->u
.fn
.thunk_p
)
4014 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4016 lang_check_failed (__FILE__
, __LINE__
, __FUNCTION__
);
4022 ptr
= &DECL_LANG_SPECIFIC (decl
)->u
.fn
.u5
.cloned_function
;
4023 if (just_testing
&& *ptr
== NULL_TREE
)
4029 /* Produce declarations for all appropriate clones of FN. If
4030 UPDATE_METHOD_VEC_P is nonzero, the clones are added to the
4031 CLASTYPE_METHOD_VEC as well. */
4034 clone_function_decl (tree fn
, int update_method_vec_p
)
4038 /* Avoid inappropriate cloning. */
4040 && DECL_CLONED_FUNCTION_P (TREE_CHAIN (fn
)))
4043 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
4045 /* For each constructor, we need two variants: an in-charge version
4046 and a not-in-charge version. */
4047 clone
= build_clone (fn
, complete_ctor_identifier
);
4048 if (update_method_vec_p
)
4049 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4050 clone
= build_clone (fn
, base_ctor_identifier
);
4051 if (update_method_vec_p
)
4052 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4056 gcc_assert (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn
));
4058 /* For each destructor, we need three variants: an in-charge
4059 version, a not-in-charge version, and an in-charge deleting
4060 version. We clone the deleting version first because that
4061 means it will go second on the TYPE_METHODS list -- and that
4062 corresponds to the correct layout order in the virtual
4065 For a non-virtual destructor, we do not build a deleting
4067 if (DECL_VIRTUAL_P (fn
))
4069 clone
= build_clone (fn
, deleting_dtor_identifier
);
4070 if (update_method_vec_p
)
4071 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4073 clone
= build_clone (fn
, complete_dtor_identifier
);
4074 if (update_method_vec_p
)
4075 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4076 clone
= build_clone (fn
, base_dtor_identifier
);
4077 if (update_method_vec_p
)
4078 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4081 /* Note that this is an abstract function that is never emitted. */
4082 DECL_ABSTRACT (fn
) = 1;
4085 /* DECL is an in charge constructor, which is being defined. This will
4086 have had an in class declaration, from whence clones were
4087 declared. An out-of-class definition can specify additional default
4088 arguments. As it is the clones that are involved in overload
4089 resolution, we must propagate the information from the DECL to its
4093 adjust_clone_args (tree decl
)
4097 for (clone
= TREE_CHAIN (decl
); clone
&& DECL_CLONED_FUNCTION_P (clone
);
4098 clone
= TREE_CHAIN (clone
))
4100 tree orig_clone_parms
= TYPE_ARG_TYPES (TREE_TYPE (clone
));
4101 tree orig_decl_parms
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
4102 tree decl_parms
, clone_parms
;
4104 clone_parms
= orig_clone_parms
;
4106 /* Skip the 'this' parameter. */
4107 orig_clone_parms
= TREE_CHAIN (orig_clone_parms
);
4108 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4110 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
4111 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4112 if (DECL_HAS_VTT_PARM_P (decl
))
4113 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4115 clone_parms
= orig_clone_parms
;
4116 if (DECL_HAS_VTT_PARM_P (clone
))
4117 clone_parms
= TREE_CHAIN (clone_parms
);
4119 for (decl_parms
= orig_decl_parms
; decl_parms
;
4120 decl_parms
= TREE_CHAIN (decl_parms
),
4121 clone_parms
= TREE_CHAIN (clone_parms
))
4123 gcc_assert (same_type_p (TREE_TYPE (decl_parms
),
4124 TREE_TYPE (clone_parms
)));
4126 if (TREE_PURPOSE (decl_parms
) && !TREE_PURPOSE (clone_parms
))
4128 /* A default parameter has been added. Adjust the
4129 clone's parameters. */
4130 tree exceptions
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone
));
4131 tree attrs
= TYPE_ATTRIBUTES (TREE_TYPE (clone
));
4132 tree basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (clone
));
4135 clone_parms
= orig_decl_parms
;
4137 if (DECL_HAS_VTT_PARM_P (clone
))
4139 clone_parms
= tree_cons (TREE_PURPOSE (orig_clone_parms
),
4140 TREE_VALUE (orig_clone_parms
),
4142 TREE_TYPE (clone_parms
) = TREE_TYPE (orig_clone_parms
);
4144 type
= build_method_type_directly (basetype
,
4145 TREE_TYPE (TREE_TYPE (clone
)),
4148 type
= build_exception_variant (type
, exceptions
);
4150 type
= cp_build_type_attribute_variant (type
, attrs
);
4151 TREE_TYPE (clone
) = type
;
4153 clone_parms
= NULL_TREE
;
4157 gcc_assert (!clone_parms
);
4161 /* For each of the constructors and destructors in T, create an
4162 in-charge and not-in-charge variant. */
4165 clone_constructors_and_destructors (tree t
)
4169 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4171 if (!CLASSTYPE_METHOD_VEC (t
))
4174 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4175 clone_function_decl (OVL_CURRENT (fns
), /*update_method_vec_p=*/1);
4176 for (fns
= CLASSTYPE_DESTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4177 clone_function_decl (OVL_CURRENT (fns
), /*update_method_vec_p=*/1);
4180 /* Returns true iff class T has a user-defined constructor other than
4181 the default constructor. */
4184 type_has_user_nondefault_constructor (tree t
)
4188 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4191 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4193 tree fn
= OVL_CURRENT (fns
);
4194 if (!DECL_ARTIFICIAL (fn
)
4195 && (TREE_CODE (fn
) == TEMPLATE_DECL
4196 || (skip_artificial_parms_for (fn
, DECL_ARGUMENTS (fn
))
4204 /* Returns the defaulted constructor if T has one. Otherwise, returns
4208 in_class_defaulted_default_constructor (tree t
)
4212 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4215 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4217 tree fn
= OVL_CURRENT (fns
);
4219 if (DECL_DEFAULTED_IN_CLASS_P (fn
))
4221 args
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
4222 while (args
&& TREE_PURPOSE (args
))
4223 args
= TREE_CHAIN (args
);
4224 if (!args
|| args
== void_list_node
)
4232 /* Returns true iff FN is a user-provided function, i.e. user-declared
4233 and not defaulted at its first declaration; or explicit, private,
4234 protected, or non-const. */
4237 user_provided_p (tree fn
)
4239 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4242 return (!DECL_ARTIFICIAL (fn
)
4243 && !DECL_DEFAULTED_IN_CLASS_P (fn
));
4246 /* Returns true iff class T has a user-provided constructor. */
4249 type_has_user_provided_constructor (tree t
)
4253 if (!CLASS_TYPE_P (t
))
4256 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4259 /* This can happen in error cases; avoid crashing. */
4260 if (!CLASSTYPE_METHOD_VEC (t
))
4263 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4264 if (user_provided_p (OVL_CURRENT (fns
)))
4270 /* Returns true iff class T has a user-provided default constructor. */
4273 type_has_user_provided_default_constructor (tree t
)
4277 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4280 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4282 tree fn
= OVL_CURRENT (fns
);
4283 if (TREE_CODE (fn
) == FUNCTION_DECL
4284 && user_provided_p (fn
)
4285 && sufficient_parms_p (FUNCTION_FIRST_USER_PARMTYPE (fn
)))
4292 /* Returns true iff class TYPE has a virtual destructor. */
4295 type_has_virtual_destructor (tree type
)
4299 if (!CLASS_TYPE_P (type
))
4302 gcc_assert (COMPLETE_TYPE_P (type
));
4303 dtor
= CLASSTYPE_DESTRUCTORS (type
);
4304 return (dtor
&& DECL_VIRTUAL_P (dtor
));
4307 /* Returns true iff class T has a move constructor. */
4310 type_has_move_constructor (tree t
)
4314 if (CLASSTYPE_LAZY_MOVE_CTOR (t
))
4316 gcc_assert (COMPLETE_TYPE_P (t
));
4317 lazily_declare_fn (sfk_move_constructor
, t
);
4320 if (!CLASSTYPE_METHOD_VEC (t
))
4323 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4324 if (move_fn_p (OVL_CURRENT (fns
)))
4330 /* Returns true iff class T has a move assignment operator. */
4333 type_has_move_assign (tree t
)
4337 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
4339 gcc_assert (COMPLETE_TYPE_P (t
));
4340 lazily_declare_fn (sfk_move_assignment
, t
);
4343 for (fns
= lookup_fnfields_slot (t
, ansi_assopname (NOP_EXPR
));
4344 fns
; fns
= OVL_NEXT (fns
))
4345 if (move_fn_p (OVL_CURRENT (fns
)))
4351 /* Remove all zero-width bit-fields from T. */
4354 remove_zero_width_bit_fields (tree t
)
4358 fieldsp
= &TYPE_FIELDS (t
);
4361 if (TREE_CODE (*fieldsp
) == FIELD_DECL
4362 && DECL_C_BIT_FIELD (*fieldsp
)
4363 /* We should not be confused by the fact that grokbitfield
4364 temporarily sets the width of the bit field into
4365 DECL_INITIAL (*fieldsp).
4366 check_bitfield_decl eventually sets DECL_SIZE (*fieldsp)
4368 && integer_zerop (DECL_SIZE (*fieldsp
)))
4369 *fieldsp
= TREE_CHAIN (*fieldsp
);
4371 fieldsp
= &TREE_CHAIN (*fieldsp
);
4375 /* Returns TRUE iff we need a cookie when dynamically allocating an
4376 array whose elements have the indicated class TYPE. */
4379 type_requires_array_cookie (tree type
)
4382 bool has_two_argument_delete_p
= false;
4384 gcc_assert (CLASS_TYPE_P (type
));
4386 /* If there's a non-trivial destructor, we need a cookie. In order
4387 to iterate through the array calling the destructor for each
4388 element, we'll have to know how many elements there are. */
4389 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
4392 /* If the usual deallocation function is a two-argument whose second
4393 argument is of type `size_t', then we have to pass the size of
4394 the array to the deallocation function, so we will need to store
4396 fns
= lookup_fnfields (TYPE_BINFO (type
),
4397 ansi_opname (VEC_DELETE_EXPR
),
4399 /* If there are no `operator []' members, or the lookup is
4400 ambiguous, then we don't need a cookie. */
4401 if (!fns
|| fns
== error_mark_node
)
4403 /* Loop through all of the functions. */
4404 for (fns
= BASELINK_FUNCTIONS (fns
); fns
; fns
= OVL_NEXT (fns
))
4409 /* Select the current function. */
4410 fn
= OVL_CURRENT (fns
);
4411 /* See if this function is a one-argument delete function. If
4412 it is, then it will be the usual deallocation function. */
4413 second_parm
= TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (fn
)));
4414 if (second_parm
== void_list_node
)
4416 /* Do not consider this function if its second argument is an
4420 /* Otherwise, if we have a two-argument function and the second
4421 argument is `size_t', it will be the usual deallocation
4422 function -- unless there is one-argument function, too. */
4423 if (TREE_CHAIN (second_parm
) == void_list_node
4424 && same_type_p (TREE_VALUE (second_parm
), size_type_node
))
4425 has_two_argument_delete_p
= true;
4428 return has_two_argument_delete_p
;
4431 /* Check the validity of the bases and members declared in T. Add any
4432 implicitly-generated functions (like copy-constructors and
4433 assignment operators). Compute various flag bits (like
4434 CLASSTYPE_NON_LAYOUT_POD_T) for T. This routine works purely at the C++
4435 level: i.e., independently of the ABI in use. */
4438 check_bases_and_members (tree t
)
4440 /* Nonzero if the implicitly generated copy constructor should take
4441 a non-const reference argument. */
4442 int cant_have_const_ctor
;
4443 /* Nonzero if the implicitly generated assignment operator
4444 should take a non-const reference argument. */
4445 int no_const_asn_ref
;
4447 bool saved_complex_asn_ref
;
4448 bool saved_nontrivial_dtor
;
4451 /* By default, we use const reference arguments and generate default
4453 cant_have_const_ctor
= 0;
4454 no_const_asn_ref
= 0;
4456 /* Check all the base-classes. */
4457 check_bases (t
, &cant_have_const_ctor
,
4460 /* Check all the method declarations. */
4463 /* Save the initial values of these flags which only indicate whether
4464 or not the class has user-provided functions. As we analyze the
4465 bases and members we can set these flags for other reasons. */
4466 saved_complex_asn_ref
= TYPE_HAS_COMPLEX_COPY_ASSIGN (t
);
4467 saved_nontrivial_dtor
= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
);
4469 /* Check all the data member declarations. We cannot call
4470 check_field_decls until we have called check_bases check_methods,
4471 as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR
4472 being set appropriately. */
4473 check_field_decls (t
, &access_decls
,
4474 &cant_have_const_ctor
,
4477 /* A nearly-empty class has to be vptr-containing; a nearly empty
4478 class contains just a vptr. */
4479 if (!TYPE_CONTAINS_VPTR_P (t
))
4480 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
4482 /* Do some bookkeeping that will guide the generation of implicitly
4483 declared member functions. */
4484 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= TYPE_CONTAINS_VPTR_P (t
);
4485 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_CONTAINS_VPTR_P (t
);
4486 /* We need to call a constructor for this class if it has a
4487 user-provided constructor, or if the default constructor is going
4488 to initialize the vptr. (This is not an if-and-only-if;
4489 TYPE_NEEDS_CONSTRUCTING is set elsewhere if bases or members
4490 themselves need constructing.) */
4491 TYPE_NEEDS_CONSTRUCTING (t
)
4492 |= (type_has_user_provided_constructor (t
) || TYPE_CONTAINS_VPTR_P (t
));
4495 An aggregate is an array or a class with no user-provided
4496 constructors ... and no virtual functions.
4498 Again, other conditions for being an aggregate are checked
4500 CLASSTYPE_NON_AGGREGATE (t
)
4501 |= (type_has_user_provided_constructor (t
) || TYPE_POLYMORPHIC_P (t
));
4502 /* This is the C++98/03 definition of POD; it changed in C++0x, but we
4503 retain the old definition internally for ABI reasons. */
4504 CLASSTYPE_NON_LAYOUT_POD_P (t
)
4505 |= (CLASSTYPE_NON_AGGREGATE (t
)
4506 || saved_nontrivial_dtor
|| saved_complex_asn_ref
);
4507 CLASSTYPE_NON_STD_LAYOUT (t
) |= TYPE_CONTAINS_VPTR_P (t
);
4508 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) |= TYPE_CONTAINS_VPTR_P (t
);
4509 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) |= TYPE_CONTAINS_VPTR_P (t
);
4510 TYPE_HAS_COMPLEX_DFLT (t
) |= TYPE_CONTAINS_VPTR_P (t
);
4512 /* If the class has no user-declared constructor, but does have
4513 non-static const or reference data members that can never be
4514 initialized, issue a warning. */
4515 if (warn_uninitialized
4516 /* Classes with user-declared constructors are presumed to
4517 initialize these members. */
4518 && !TYPE_HAS_USER_CONSTRUCTOR (t
)
4519 /* Aggregates can be initialized with brace-enclosed
4521 && CLASSTYPE_NON_AGGREGATE (t
))
4525 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
4529 if (TREE_CODE (field
) != FIELD_DECL
)
4532 type
= TREE_TYPE (field
);
4533 if (TREE_CODE (type
) == REFERENCE_TYPE
)
4534 warning (OPT_Wuninitialized
, "non-static reference %q+#D "
4535 "in class without a constructor", field
);
4536 else if (CP_TYPE_CONST_P (type
)
4537 && (!CLASS_TYPE_P (type
)
4538 || !TYPE_HAS_DEFAULT_CONSTRUCTOR (type
)))
4539 warning (OPT_Wuninitialized
, "non-static const member %q+#D "
4540 "in class without a constructor", field
);
4544 /* Synthesize any needed methods. */
4545 add_implicitly_declared_members (t
,
4546 cant_have_const_ctor
,
4549 /* Check defaulted declarations here so we have cant_have_const_ctor
4550 and don't need to worry about clones. */
4551 for (fn
= TYPE_METHODS (t
); fn
; fn
= TREE_CHAIN (fn
))
4552 if (DECL_DEFAULTED_IN_CLASS_P (fn
))
4554 int copy
= copy_fn_p (fn
);
4558 = (DECL_CONSTRUCTOR_P (fn
) ? !cant_have_const_ctor
4559 : !no_const_asn_ref
);
4560 bool fn_const_p
= (copy
== 2);
4562 if (fn_const_p
&& !imp_const_p
)
4563 /* If the function is defaulted outside the class, we just
4564 give the synthesis error. */
4565 error ("%q+D declared to take const reference, but implicit "
4566 "declaration would take non-const", fn
);
4567 else if (imp_const_p
&& !fn_const_p
)
4568 error ("%q+D declared to take non-const reference cannot be "
4569 "defaulted in the class body", fn
);
4571 defaulted_late_check (fn
);
4574 if (LAMBDA_TYPE_P (t
))
4576 /* "The closure type associated with a lambda-expression has a deleted
4577 default constructor and a deleted copy assignment operator." */
4578 TYPE_NEEDS_CONSTRUCTING (t
) = 1;
4579 TYPE_HAS_COMPLEX_DFLT (t
) = 1;
4580 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
4581 CLASSTYPE_LAZY_MOVE_ASSIGN (t
) = 0;
4583 /* "This class type is not an aggregate." */
4584 CLASSTYPE_NON_AGGREGATE (t
) = 1;
4587 /* Create the in-charge and not-in-charge variants of constructors
4589 clone_constructors_and_destructors (t
);
4591 /* Process the using-declarations. */
4592 for (; access_decls
; access_decls
= TREE_CHAIN (access_decls
))
4593 handle_using_decl (TREE_VALUE (access_decls
), t
);
4595 /* Build and sort the CLASSTYPE_METHOD_VEC. */
4596 finish_struct_methods (t
);
4598 /* Figure out whether or not we will need a cookie when dynamically
4599 allocating an array of this type. */
4600 TYPE_LANG_SPECIFIC (t
)->u
.c
.vec_new_uses_cookie
4601 = type_requires_array_cookie (t
);
4604 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
4605 accordingly. If a new vfield was created (because T doesn't have a
4606 primary base class), then the newly created field is returned. It
4607 is not added to the TYPE_FIELDS list; it is the caller's
4608 responsibility to do that. Accumulate declared virtual functions
4612 create_vtable_ptr (tree t
, tree
* virtuals_p
)
4616 /* Collect the virtual functions declared in T. */
4617 for (fn
= TYPE_METHODS (t
); fn
; fn
= TREE_CHAIN (fn
))
4618 if (DECL_VINDEX (fn
) && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn
)
4619 && TREE_CODE (DECL_VINDEX (fn
)) != INTEGER_CST
)
4621 tree new_virtual
= make_node (TREE_LIST
);
4623 BV_FN (new_virtual
) = fn
;
4624 BV_DELTA (new_virtual
) = integer_zero_node
;
4625 BV_VCALL_INDEX (new_virtual
) = NULL_TREE
;
4627 TREE_CHAIN (new_virtual
) = *virtuals_p
;
4628 *virtuals_p
= new_virtual
;
4631 /* If we couldn't find an appropriate base class, create a new field
4632 here. Even if there weren't any new virtual functions, we might need a
4633 new virtual function table if we're supposed to include vptrs in
4634 all classes that need them. */
4635 if (!TYPE_VFIELD (t
) && (*virtuals_p
|| TYPE_CONTAINS_VPTR_P (t
)))
4637 /* We build this decl with vtbl_ptr_type_node, which is a
4638 `vtable_entry_type*'. It might seem more precise to use
4639 `vtable_entry_type (*)[N]' where N is the number of virtual
4640 functions. However, that would require the vtable pointer in
4641 base classes to have a different type than the vtable pointer
4642 in derived classes. We could make that happen, but that
4643 still wouldn't solve all the problems. In particular, the
4644 type-based alias analysis code would decide that assignments
4645 to the base class vtable pointer can't alias assignments to
4646 the derived class vtable pointer, since they have different
4647 types. Thus, in a derived class destructor, where the base
4648 class constructor was inlined, we could generate bad code for
4649 setting up the vtable pointer.
4651 Therefore, we use one type for all vtable pointers. We still
4652 use a type-correct type; it's just doesn't indicate the array
4653 bounds. That's better than using `void*' or some such; it's
4654 cleaner, and it let's the alias analysis code know that these
4655 stores cannot alias stores to void*! */
4658 field
= build_decl (input_location
,
4659 FIELD_DECL
, get_vfield_name (t
), vtbl_ptr_type_node
);
4660 DECL_VIRTUAL_P (field
) = 1;
4661 DECL_ARTIFICIAL (field
) = 1;
4662 DECL_FIELD_CONTEXT (field
) = t
;
4663 DECL_FCONTEXT (field
) = t
;
4664 if (TYPE_PACKED (t
))
4665 DECL_PACKED (field
) = 1;
4667 TYPE_VFIELD (t
) = field
;
4669 /* This class is non-empty. */
4670 CLASSTYPE_EMPTY_P (t
) = 0;
4678 /* Add OFFSET to all base types of BINFO which is a base in the
4679 hierarchy dominated by T.
4681 OFFSET, which is a type offset, is number of bytes. */
4684 propagate_binfo_offsets (tree binfo
, tree offset
)
4690 /* Update BINFO's offset. */
4691 BINFO_OFFSET (binfo
)
4692 = convert (sizetype
,
4693 size_binop (PLUS_EXPR
,
4694 convert (ssizetype
, BINFO_OFFSET (binfo
)),
4697 /* Find the primary base class. */
4698 primary_binfo
= get_primary_binfo (binfo
);
4700 if (primary_binfo
&& BINFO_INHERITANCE_CHAIN (primary_binfo
) == binfo
)
4701 propagate_binfo_offsets (primary_binfo
, offset
);
4703 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
4705 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
4707 /* Don't do the primary base twice. */
4708 if (base_binfo
== primary_binfo
)
4711 if (BINFO_VIRTUAL_P (base_binfo
))
4714 propagate_binfo_offsets (base_binfo
, offset
);
4718 /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update
4719 TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of
4720 empty subobjects of T. */
4723 layout_virtual_bases (record_layout_info rli
, splay_tree offsets
)
4727 bool first_vbase
= true;
4730 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t
)) == 0)
4733 if (!abi_version_at_least(2))
4735 /* In G++ 3.2, we incorrectly rounded the size before laying out
4736 the virtual bases. */
4737 finish_record_layout (rli
, /*free_p=*/false);
4738 #ifdef STRUCTURE_SIZE_BOUNDARY
4739 /* Packed structures don't need to have minimum size. */
4740 if (! TYPE_PACKED (t
))
4741 TYPE_ALIGN (t
) = MAX (TYPE_ALIGN (t
), (unsigned) STRUCTURE_SIZE_BOUNDARY
);
4743 rli
->offset
= TYPE_SIZE_UNIT (t
);
4744 rli
->bitpos
= bitsize_zero_node
;
4745 rli
->record_align
= TYPE_ALIGN (t
);
4748 /* Find the last field. The artificial fields created for virtual
4749 bases will go after the last extant field to date. */
4750 next_field
= &TYPE_FIELDS (t
);
4752 next_field
= &TREE_CHAIN (*next_field
);
4754 /* Go through the virtual bases, allocating space for each virtual
4755 base that is not already a primary base class. These are
4756 allocated in inheritance graph order. */
4757 for (vbase
= TYPE_BINFO (t
); vbase
; vbase
= TREE_CHAIN (vbase
))
4759 if (!BINFO_VIRTUAL_P (vbase
))
4762 if (!BINFO_PRIMARY_P (vbase
))
4764 tree basetype
= TREE_TYPE (vbase
);
4766 /* This virtual base is not a primary base of any class in the
4767 hierarchy, so we have to add space for it. */
4768 next_field
= build_base_field (rli
, vbase
,
4769 offsets
, next_field
);
4771 /* If the first virtual base might have been placed at a
4772 lower address, had we started from CLASSTYPE_SIZE, rather
4773 than TYPE_SIZE, issue a warning. There can be both false
4774 positives and false negatives from this warning in rare
4775 cases; to deal with all the possibilities would probably
4776 require performing both layout algorithms and comparing
4777 the results which is not particularly tractable. */
4781 (size_binop (CEIL_DIV_EXPR
,
4782 round_up_loc (input_location
,
4784 CLASSTYPE_ALIGN (basetype
)),
4786 BINFO_OFFSET (vbase
))))
4788 "offset of virtual base %qT is not ABI-compliant and "
4789 "may change in a future version of GCC",
4792 first_vbase
= false;
4797 /* Returns the offset of the byte just past the end of the base class
4801 end_of_base (tree binfo
)
4805 if (!CLASSTYPE_AS_BASE (BINFO_TYPE (binfo
)))
4806 size
= TYPE_SIZE_UNIT (char_type_node
);
4807 else if (is_empty_class (BINFO_TYPE (binfo
)))
4808 /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to
4809 allocate some space for it. It cannot have virtual bases, so
4810 TYPE_SIZE_UNIT is fine. */
4811 size
= TYPE_SIZE_UNIT (BINFO_TYPE (binfo
));
4813 size
= CLASSTYPE_SIZE_UNIT (BINFO_TYPE (binfo
));
4815 return size_binop (PLUS_EXPR
, BINFO_OFFSET (binfo
), size
);
4818 /* Returns the offset of the byte just past the end of the base class
4819 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
4820 only non-virtual bases are included. */
4823 end_of_class (tree t
, int include_virtuals_p
)
4825 tree result
= size_zero_node
;
4826 VEC(tree
,gc
) *vbases
;
4832 for (binfo
= TYPE_BINFO (t
), i
= 0;
4833 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
4835 if (!include_virtuals_p
4836 && BINFO_VIRTUAL_P (base_binfo
)
4837 && (!BINFO_PRIMARY_P (base_binfo
)
4838 || BINFO_INHERITANCE_CHAIN (base_binfo
) != TYPE_BINFO (t
)))
4841 offset
= end_of_base (base_binfo
);
4842 if (INT_CST_LT_UNSIGNED (result
, offset
))
4846 /* G++ 3.2 did not check indirect virtual bases. */
4847 if (abi_version_at_least (2) && include_virtuals_p
)
4848 for (vbases
= CLASSTYPE_VBASECLASSES (t
), i
= 0;
4849 VEC_iterate (tree
, vbases
, i
, base_binfo
); i
++)
4851 offset
= end_of_base (base_binfo
);
4852 if (INT_CST_LT_UNSIGNED (result
, offset
))
4859 /* Warn about bases of T that are inaccessible because they are
4860 ambiguous. For example:
4863 struct T : public S {};
4864 struct U : public S, public T {};
4866 Here, `(S*) new U' is not allowed because there are two `S'
4870 warn_about_ambiguous_bases (tree t
)
4873 VEC(tree
,gc
) *vbases
;
4878 /* If there are no repeated bases, nothing can be ambiguous. */
4879 if (!CLASSTYPE_REPEATED_BASE_P (t
))
4882 /* Check direct bases. */
4883 for (binfo
= TYPE_BINFO (t
), i
= 0;
4884 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
4886 basetype
= BINFO_TYPE (base_binfo
);
4888 if (!lookup_base (t
, basetype
, ba_unique
| ba_quiet
, NULL
))
4889 warning (0, "direct base %qT inaccessible in %qT due to ambiguity",
4893 /* Check for ambiguous virtual bases. */
4895 for (vbases
= CLASSTYPE_VBASECLASSES (t
), i
= 0;
4896 VEC_iterate (tree
, vbases
, i
, binfo
); i
++)
4898 basetype
= BINFO_TYPE (binfo
);
4900 if (!lookup_base (t
, basetype
, ba_unique
| ba_quiet
, NULL
))
4901 warning (OPT_Wextra
, "virtual base %qT inaccessible in %qT due to ambiguity",
4906 /* Compare two INTEGER_CSTs K1 and K2. */
4909 splay_tree_compare_integer_csts (splay_tree_key k1
, splay_tree_key k2
)
4911 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
4914 /* Increase the size indicated in RLI to account for empty classes
4915 that are "off the end" of the class. */
4918 include_empty_classes (record_layout_info rli
)
4923 /* It might be the case that we grew the class to allocate a
4924 zero-sized base class. That won't be reflected in RLI, yet,
4925 because we are willing to overlay multiple bases at the same
4926 offset. However, now we need to make sure that RLI is big enough
4927 to reflect the entire class. */
4928 eoc
= end_of_class (rli
->t
,
4929 CLASSTYPE_AS_BASE (rli
->t
) != NULL_TREE
);
4930 rli_size
= rli_size_unit_so_far (rli
);
4931 if (TREE_CODE (rli_size
) == INTEGER_CST
4932 && INT_CST_LT_UNSIGNED (rli_size
, eoc
))
4934 if (!abi_version_at_least (2))
4935 /* In version 1 of the ABI, the size of a class that ends with
4936 a bitfield was not rounded up to a whole multiple of a
4937 byte. Because rli_size_unit_so_far returns only the number
4938 of fully allocated bytes, any extra bits were not included
4940 rli
->bitpos
= round_down (rli
->bitpos
, BITS_PER_UNIT
);
4942 /* The size should have been rounded to a whole byte. */
4943 gcc_assert (tree_int_cst_equal
4944 (rli
->bitpos
, round_down (rli
->bitpos
, BITS_PER_UNIT
)));
4946 = size_binop (PLUS_EXPR
,
4948 size_binop (MULT_EXPR
,
4949 convert (bitsizetype
,
4950 size_binop (MINUS_EXPR
,
4952 bitsize_int (BITS_PER_UNIT
)));
4953 normalize_rli (rli
);
4957 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
4958 BINFO_OFFSETs for all of the base-classes. Position the vtable
4959 pointer. Accumulate declared virtual functions on VIRTUALS_P. */
4962 layout_class_type (tree t
, tree
*virtuals_p
)
4964 tree non_static_data_members
;
4967 record_layout_info rli
;
4968 /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of
4969 types that appear at that offset. */
4970 splay_tree empty_base_offsets
;
4971 /* True if the last field layed out was a bit-field. */
4972 bool last_field_was_bitfield
= false;
4973 /* The location at which the next field should be inserted. */
4975 /* T, as a base class. */
4978 /* Keep track of the first non-static data member. */
4979 non_static_data_members
= TYPE_FIELDS (t
);
4981 /* Start laying out the record. */
4982 rli
= start_record_layout (t
);
4984 /* Mark all the primary bases in the hierarchy. */
4985 determine_primary_bases (t
);
4987 /* Create a pointer to our virtual function table. */
4988 vptr
= create_vtable_ptr (t
, virtuals_p
);
4990 /* The vptr is always the first thing in the class. */
4993 TREE_CHAIN (vptr
) = TYPE_FIELDS (t
);
4994 TYPE_FIELDS (t
) = vptr
;
4995 next_field
= &TREE_CHAIN (vptr
);
4996 place_field (rli
, vptr
);
4999 next_field
= &TYPE_FIELDS (t
);
5001 /* Build FIELD_DECLs for all of the non-virtual base-types. */
5002 empty_base_offsets
= splay_tree_new (splay_tree_compare_integer_csts
,
5004 build_base_fields (rli
, empty_base_offsets
, next_field
);
5006 /* Layout the non-static data members. */
5007 for (field
= non_static_data_members
; field
; field
= TREE_CHAIN (field
))
5012 /* We still pass things that aren't non-static data members to
5013 the back end, in case it wants to do something with them. */
5014 if (TREE_CODE (field
) != FIELD_DECL
)
5016 place_field (rli
, field
);
5017 /* If the static data member has incomplete type, keep track
5018 of it so that it can be completed later. (The handling
5019 of pending statics in finish_record_layout is
5020 insufficient; consider:
5023 struct S2 { static S1 s1; };
5025 At this point, finish_record_layout will be called, but
5026 S1 is still incomplete.) */
5027 if (TREE_CODE (field
) == VAR_DECL
)
5029 maybe_register_incomplete_var (field
);
5030 /* The visibility of static data members is determined
5031 at their point of declaration, not their point of
5033 determine_visibility (field
);
5038 type
= TREE_TYPE (field
);
5039 if (type
== error_mark_node
)
5042 padding
= NULL_TREE
;
5044 /* If this field is a bit-field whose width is greater than its
5045 type, then there are some special rules for allocating
5047 if (DECL_C_BIT_FIELD (field
)
5048 && INT_CST_LT (TYPE_SIZE (type
), DECL_SIZE (field
)))
5052 bool was_unnamed_p
= false;
5053 /* We must allocate the bits as if suitably aligned for the
5054 longest integer type that fits in this many bits. type
5055 of the field. Then, we are supposed to use the left over
5056 bits as additional padding. */
5057 for (itk
= itk_char
; itk
!= itk_none
; ++itk
)
5058 if (integer_types
[itk
] != NULL_TREE
5059 && (INT_CST_LT (size_int (MAX_FIXED_MODE_SIZE
),
5060 TYPE_SIZE (integer_types
[itk
]))
5061 || INT_CST_LT (DECL_SIZE (field
),
5062 TYPE_SIZE (integer_types
[itk
]))))
5065 /* ITK now indicates a type that is too large for the
5066 field. We have to back up by one to find the largest
5071 integer_type
= integer_types
[itk
];
5072 } while (itk
> 0 && integer_type
== NULL_TREE
);
5074 /* Figure out how much additional padding is required. GCC
5075 3.2 always created a padding field, even if it had zero
5077 if (!abi_version_at_least (2)
5078 || INT_CST_LT (TYPE_SIZE (integer_type
), DECL_SIZE (field
)))
5080 if (abi_version_at_least (2) && TREE_CODE (t
) == UNION_TYPE
)
5081 /* In a union, the padding field must have the full width
5082 of the bit-field; all fields start at offset zero. */
5083 padding
= DECL_SIZE (field
);
5086 if (TREE_CODE (t
) == UNION_TYPE
)
5087 warning (OPT_Wabi
, "size assigned to %qT may not be "
5088 "ABI-compliant and may change in a future "
5091 padding
= size_binop (MINUS_EXPR
, DECL_SIZE (field
),
5092 TYPE_SIZE (integer_type
));
5095 #ifdef PCC_BITFIELD_TYPE_MATTERS
5096 /* An unnamed bitfield does not normally affect the
5097 alignment of the containing class on a target where
5098 PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not
5099 make any exceptions for unnamed bitfields when the
5100 bitfields are longer than their types. Therefore, we
5101 temporarily give the field a name. */
5102 if (PCC_BITFIELD_TYPE_MATTERS
&& !DECL_NAME (field
))
5104 was_unnamed_p
= true;
5105 DECL_NAME (field
) = make_anon_name ();
5108 DECL_SIZE (field
) = TYPE_SIZE (integer_type
);
5109 DECL_ALIGN (field
) = TYPE_ALIGN (integer_type
);
5110 DECL_USER_ALIGN (field
) = TYPE_USER_ALIGN (integer_type
);
5111 layout_nonempty_base_or_field (rli
, field
, NULL_TREE
,
5112 empty_base_offsets
);
5114 DECL_NAME (field
) = NULL_TREE
;
5115 /* Now that layout has been performed, set the size of the
5116 field to the size of its declared type; the rest of the
5117 field is effectively invisible. */
5118 DECL_SIZE (field
) = TYPE_SIZE (type
);
5119 /* We must also reset the DECL_MODE of the field. */
5120 if (abi_version_at_least (2))
5121 DECL_MODE (field
) = TYPE_MODE (type
);
5123 && DECL_MODE (field
) != TYPE_MODE (type
))
5124 /* Versions of G++ before G++ 3.4 did not reset the
5127 "the offset of %qD may not be ABI-compliant and may "
5128 "change in a future version of GCC", field
);
5131 layout_nonempty_base_or_field (rli
, field
, NULL_TREE
,
5132 empty_base_offsets
);
5134 /* Remember the location of any empty classes in FIELD. */
5135 if (abi_version_at_least (2))
5136 record_subobject_offsets (TREE_TYPE (field
),
5137 byte_position(field
),
5139 /*is_data_member=*/true);
5141 /* If a bit-field does not immediately follow another bit-field,
5142 and yet it starts in the middle of a byte, we have failed to
5143 comply with the ABI. */
5145 && DECL_C_BIT_FIELD (field
)
5146 /* The TREE_NO_WARNING flag gets set by Objective-C when
5147 laying out an Objective-C class. The ObjC ABI differs
5148 from the C++ ABI, and so we do not want a warning
5150 && !TREE_NO_WARNING (field
)
5151 && !last_field_was_bitfield
5152 && !integer_zerop (size_binop (TRUNC_MOD_EXPR
,
5153 DECL_FIELD_BIT_OFFSET (field
),
5154 bitsize_unit_node
)))
5155 warning (OPT_Wabi
, "offset of %q+D is not ABI-compliant and may "
5156 "change in a future version of GCC", field
);
5158 /* G++ used to use DECL_FIELD_OFFSET as if it were the byte
5159 offset of the field. */
5161 && !abi_version_at_least (2)
5162 && !tree_int_cst_equal (DECL_FIELD_OFFSET (field
),
5163 byte_position (field
))
5164 && contains_empty_class_p (TREE_TYPE (field
)))
5165 warning (OPT_Wabi
, "%q+D contains empty classes which may cause base "
5166 "classes to be placed at different locations in a "
5167 "future version of GCC", field
);
5169 /* The middle end uses the type of expressions to determine the
5170 possible range of expression values. In order to optimize
5171 "x.i > 7" to "false" for a 2-bit bitfield "i", the middle end
5172 must be made aware of the width of "i", via its type.
5174 Because C++ does not have integer types of arbitrary width,
5175 we must (for the purposes of the front end) convert from the
5176 type assigned here to the declared type of the bitfield
5177 whenever a bitfield expression is used as an rvalue.
5178 Similarly, when assigning a value to a bitfield, the value
5179 must be converted to the type given the bitfield here. */
5180 if (DECL_C_BIT_FIELD (field
))
5182 unsigned HOST_WIDE_INT width
;
5183 tree ftype
= TREE_TYPE (field
);
5184 width
= tree_low_cst (DECL_SIZE (field
), /*unsignedp=*/1);
5185 if (width
!= TYPE_PRECISION (ftype
))
5188 = c_build_bitfield_integer_type (width
,
5189 TYPE_UNSIGNED (ftype
));
5191 = cp_build_qualified_type (TREE_TYPE (field
),
5192 cp_type_quals (ftype
));
5196 /* If we needed additional padding after this field, add it
5202 padding_field
= build_decl (input_location
,
5206 DECL_BIT_FIELD (padding_field
) = 1;
5207 DECL_SIZE (padding_field
) = padding
;
5208 DECL_CONTEXT (padding_field
) = t
;
5209 DECL_ARTIFICIAL (padding_field
) = 1;
5210 DECL_IGNORED_P (padding_field
) = 1;
5211 layout_nonempty_base_or_field (rli
, padding_field
,
5213 empty_base_offsets
);
5216 last_field_was_bitfield
= DECL_C_BIT_FIELD (field
);
5219 if (abi_version_at_least (2) && !integer_zerop (rli
->bitpos
))
5221 /* Make sure that we are on a byte boundary so that the size of
5222 the class without virtual bases will always be a round number
5224 rli
->bitpos
= round_up_loc (input_location
, rli
->bitpos
, BITS_PER_UNIT
);
5225 normalize_rli (rli
);
5228 /* G++ 3.2 does not allow virtual bases to be overlaid with tail
5230 if (!abi_version_at_least (2))
5231 include_empty_classes(rli
);
5233 /* Delete all zero-width bit-fields from the list of fields. Now
5234 that the type is laid out they are no longer important. */
5235 remove_zero_width_bit_fields (t
);
5237 /* Create the version of T used for virtual bases. We do not use
5238 make_class_type for this version; this is an artificial type. For
5239 a POD type, we just reuse T. */
5240 if (CLASSTYPE_NON_LAYOUT_POD_P (t
) || CLASSTYPE_EMPTY_P (t
))
5242 base_t
= make_node (TREE_CODE (t
));
5244 /* Set the size and alignment for the new type. In G++ 3.2, all
5245 empty classes were considered to have size zero when used as
5247 if (!abi_version_at_least (2) && CLASSTYPE_EMPTY_P (t
))
5249 TYPE_SIZE (base_t
) = bitsize_zero_node
;
5250 TYPE_SIZE_UNIT (base_t
) = size_zero_node
;
5251 if (warn_abi
&& !integer_zerop (rli_size_unit_so_far (rli
)))
5253 "layout of classes derived from empty class %qT "
5254 "may change in a future version of GCC",
5261 /* If the ABI version is not at least two, and the last
5262 field was a bit-field, RLI may not be on a byte
5263 boundary. In particular, rli_size_unit_so_far might
5264 indicate the last complete byte, while rli_size_so_far
5265 indicates the total number of bits used. Therefore,
5266 rli_size_so_far, rather than rli_size_unit_so_far, is
5267 used to compute TYPE_SIZE_UNIT. */
5268 eoc
= end_of_class (t
, /*include_virtuals_p=*/0);
5269 TYPE_SIZE_UNIT (base_t
)
5270 = size_binop (MAX_EXPR
,
5272 size_binop (CEIL_DIV_EXPR
,
5273 rli_size_so_far (rli
),
5274 bitsize_int (BITS_PER_UNIT
))),
5277 = size_binop (MAX_EXPR
,
5278 rli_size_so_far (rli
),
5279 size_binop (MULT_EXPR
,
5280 convert (bitsizetype
, eoc
),
5281 bitsize_int (BITS_PER_UNIT
)));
5283 TYPE_ALIGN (base_t
) = rli
->record_align
;
5284 TYPE_USER_ALIGN (base_t
) = TYPE_USER_ALIGN (t
);
5286 /* Copy the fields from T. */
5287 next_field
= &TYPE_FIELDS (base_t
);
5288 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
5289 if (TREE_CODE (field
) == FIELD_DECL
)
5291 *next_field
= build_decl (input_location
,
5295 DECL_CONTEXT (*next_field
) = base_t
;
5296 DECL_FIELD_OFFSET (*next_field
) = DECL_FIELD_OFFSET (field
);
5297 DECL_FIELD_BIT_OFFSET (*next_field
)
5298 = DECL_FIELD_BIT_OFFSET (field
);
5299 DECL_SIZE (*next_field
) = DECL_SIZE (field
);
5300 DECL_MODE (*next_field
) = DECL_MODE (field
);
5301 next_field
= &TREE_CHAIN (*next_field
);
5304 /* Record the base version of the type. */
5305 CLASSTYPE_AS_BASE (t
) = base_t
;
5306 TYPE_CONTEXT (base_t
) = t
;
5309 CLASSTYPE_AS_BASE (t
) = t
;
5311 /* Every empty class contains an empty class. */
5312 if (CLASSTYPE_EMPTY_P (t
))
5313 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 1;
5315 /* Set the TYPE_DECL for this type to contain the right
5316 value for DECL_OFFSET, so that we can use it as part
5317 of a COMPONENT_REF for multiple inheritance. */
5318 layout_decl (TYPE_MAIN_DECL (t
), 0);
5320 /* Now fix up any virtual base class types that we left lying
5321 around. We must get these done before we try to lay out the
5322 virtual function table. As a side-effect, this will remove the
5323 base subobject fields. */
5324 layout_virtual_bases (rli
, empty_base_offsets
);
5326 /* Make sure that empty classes are reflected in RLI at this
5328 include_empty_classes(rli
);
5330 /* Make sure not to create any structures with zero size. */
5331 if (integer_zerop (rli_size_unit_so_far (rli
)) && CLASSTYPE_EMPTY_P (t
))
5333 build_decl (input_location
,
5334 FIELD_DECL
, NULL_TREE
, char_type_node
));
5336 /* If this is a non-POD, declaring it packed makes a difference to how it
5337 can be used as a field; don't let finalize_record_size undo it. */
5338 if (TYPE_PACKED (t
) && !layout_pod_type_p (t
))
5339 rli
->packed_maybe_necessary
= true;
5341 /* Let the back end lay out the type. */
5342 finish_record_layout (rli
, /*free_p=*/true);
5344 /* Warn about bases that can't be talked about due to ambiguity. */
5345 warn_about_ambiguous_bases (t
);
5347 /* Now that we're done with layout, give the base fields the real types. */
5348 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
5349 if (DECL_ARTIFICIAL (field
) && IS_FAKE_BASE_TYPE (TREE_TYPE (field
)))
5350 TREE_TYPE (field
) = TYPE_CONTEXT (TREE_TYPE (field
));
5353 splay_tree_delete (empty_base_offsets
);
5355 if (CLASSTYPE_EMPTY_P (t
)
5356 && tree_int_cst_lt (sizeof_biggest_empty_class
,
5357 TYPE_SIZE_UNIT (t
)))
5358 sizeof_biggest_empty_class
= TYPE_SIZE_UNIT (t
);
5361 /* Determine the "key method" for the class type indicated by TYPE,
5362 and set CLASSTYPE_KEY_METHOD accordingly. */
5365 determine_key_method (tree type
)
5369 if (TYPE_FOR_JAVA (type
)
5370 || processing_template_decl
5371 || CLASSTYPE_TEMPLATE_INSTANTIATION (type
)
5372 || CLASSTYPE_INTERFACE_KNOWN (type
))
5375 /* The key method is the first non-pure virtual function that is not
5376 inline at the point of class definition. On some targets the
5377 key function may not be inline; those targets should not call
5378 this function until the end of the translation unit. */
5379 for (method
= TYPE_METHODS (type
); method
!= NULL_TREE
;
5380 method
= TREE_CHAIN (method
))
5381 if (DECL_VINDEX (method
) != NULL_TREE
5382 && ! DECL_DECLARED_INLINE_P (method
)
5383 && ! DECL_PURE_VIRTUAL_P (method
))
5385 CLASSTYPE_KEY_METHOD (type
) = method
;
5392 /* Perform processing required when the definition of T (a class type)
5396 finish_struct_1 (tree t
)
5399 /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */
5400 tree virtuals
= NULL_TREE
;
5403 if (COMPLETE_TYPE_P (t
))
5405 gcc_assert (MAYBE_CLASS_TYPE_P (t
));
5406 error ("redefinition of %q#T", t
);
5411 /* If this type was previously laid out as a forward reference,
5412 make sure we lay it out again. */
5413 TYPE_SIZE (t
) = NULL_TREE
;
5414 CLASSTYPE_PRIMARY_BINFO (t
) = NULL_TREE
;
5416 /* Make assumptions about the class; we'll reset the flags if
5418 CLASSTYPE_EMPTY_P (t
) = 1;
5419 CLASSTYPE_NEARLY_EMPTY_P (t
) = 1;
5420 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 0;
5422 /* Do end-of-class semantic processing: checking the validity of the
5423 bases and members and add implicitly generated methods. */
5424 check_bases_and_members (t
);
5426 /* Find the key method. */
5427 if (TYPE_CONTAINS_VPTR_P (t
))
5429 /* The Itanium C++ ABI permits the key method to be chosen when
5430 the class is defined -- even though the key method so
5431 selected may later turn out to be an inline function. On
5432 some systems (such as ARM Symbian OS) the key method cannot
5433 be determined until the end of the translation unit. On such
5434 systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which
5435 will cause the class to be added to KEYED_CLASSES. Then, in
5436 finish_file we will determine the key method. */
5437 if (targetm
.cxx
.key_method_may_be_inline ())
5438 determine_key_method (t
);
5440 /* If a polymorphic class has no key method, we may emit the vtable
5441 in every translation unit where the class definition appears. */
5442 if (CLASSTYPE_KEY_METHOD (t
) == NULL_TREE
)
5443 keyed_classes
= tree_cons (NULL_TREE
, t
, keyed_classes
);
5446 /* Layout the class itself. */
5447 layout_class_type (t
, &virtuals
);
5448 if (CLASSTYPE_AS_BASE (t
) != t
)
5449 /* We use the base type for trivial assignments, and hence it
5451 compute_record_mode (CLASSTYPE_AS_BASE (t
));
5453 virtuals
= modify_all_vtables (t
, nreverse (virtuals
));
5455 /* If necessary, create the primary vtable for this class. */
5456 if (virtuals
|| TYPE_CONTAINS_VPTR_P (t
))
5458 /* We must enter these virtuals into the table. */
5459 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
5460 build_primary_vtable (NULL_TREE
, t
);
5461 else if (! BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (t
)))
5462 /* Here we know enough to change the type of our virtual
5463 function table, but we will wait until later this function. */
5464 build_primary_vtable (CLASSTYPE_PRIMARY_BINFO (t
), t
);
5467 if (TYPE_CONTAINS_VPTR_P (t
))
5472 if (BINFO_VTABLE (TYPE_BINFO (t
)))
5473 gcc_assert (DECL_VIRTUAL_P (BINFO_VTABLE (TYPE_BINFO (t
))));
5474 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
5475 gcc_assert (BINFO_VIRTUALS (TYPE_BINFO (t
)) == NULL_TREE
);
5477 /* Add entries for virtual functions introduced by this class. */
5478 BINFO_VIRTUALS (TYPE_BINFO (t
))
5479 = chainon (BINFO_VIRTUALS (TYPE_BINFO (t
)), virtuals
);
5481 /* Set DECL_VINDEX for all functions declared in this class. */
5482 for (vindex
= 0, fn
= BINFO_VIRTUALS (TYPE_BINFO (t
));
5484 fn
= TREE_CHAIN (fn
),
5485 vindex
+= (TARGET_VTABLE_USES_DESCRIPTORS
5486 ? TARGET_VTABLE_USES_DESCRIPTORS
: 1))
5488 tree fndecl
= BV_FN (fn
);
5490 if (DECL_THUNK_P (fndecl
))
5491 /* A thunk. We should never be calling this entry directly
5492 from this vtable -- we'd use the entry for the non
5493 thunk base function. */
5494 DECL_VINDEX (fndecl
) = NULL_TREE
;
5495 else if (TREE_CODE (DECL_VINDEX (fndecl
)) != INTEGER_CST
)
5496 DECL_VINDEX (fndecl
) = build_int_cst (NULL_TREE
, vindex
);
5500 finish_struct_bits (t
);
5502 /* Complete the rtl for any static member objects of the type we're
5504 for (x
= TYPE_FIELDS (t
); x
; x
= TREE_CHAIN (x
))
5505 if (TREE_CODE (x
) == VAR_DECL
&& TREE_STATIC (x
)
5506 && TREE_TYPE (x
) != error_mark_node
5507 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (x
)), t
))
5508 DECL_MODE (x
) = TYPE_MODE (t
);
5510 /* Done with FIELDS...now decide whether to sort these for
5511 faster lookups later.
5513 We use a small number because most searches fail (succeeding
5514 ultimately as the search bores through the inheritance
5515 hierarchy), and we want this failure to occur quickly. */
5517 n_fields
= count_fields (TYPE_FIELDS (t
));
5520 struct sorted_fields_type
*field_vec
= ggc_alloc_sorted_fields_type
5521 (sizeof (struct sorted_fields_type
) + n_fields
* sizeof (tree
));
5522 field_vec
->len
= n_fields
;
5523 add_fields_to_record_type (TYPE_FIELDS (t
), field_vec
, 0);
5524 qsort (field_vec
->elts
, n_fields
, sizeof (tree
),
5526 CLASSTYPE_SORTED_FIELDS (t
) = field_vec
;
5529 /* Complain if one of the field types requires lower visibility. */
5530 constrain_class_visibility (t
);
5532 /* Make the rtl for any new vtables we have created, and unmark
5533 the base types we marked. */
5536 /* Build the VTT for T. */
5539 /* This warning does not make sense for Java classes, since they
5540 cannot have destructors. */
5541 if (!TYPE_FOR_JAVA (t
) && warn_nonvdtor
&& TYPE_POLYMORPHIC_P (t
))
5545 dtor
= CLASSTYPE_DESTRUCTORS (t
);
5546 if (/* An implicitly declared destructor is always public. And,
5547 if it were virtual, we would have created it by now. */
5549 || (!DECL_VINDEX (dtor
)
5550 && (/* public non-virtual */
5551 (!TREE_PRIVATE (dtor
) && !TREE_PROTECTED (dtor
))
5552 || (/* non-public non-virtual with friends */
5553 (TREE_PRIVATE (dtor
) || TREE_PROTECTED (dtor
))
5554 && (CLASSTYPE_FRIEND_CLASSES (t
)
5555 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t
)))))))
5556 warning (OPT_Wnon_virtual_dtor
,
5557 "%q#T has virtual functions and accessible"
5558 " non-virtual destructor", t
);
5563 if (warn_overloaded_virtual
)
5566 /* Class layout, assignment of virtual table slots, etc., is now
5567 complete. Give the back end a chance to tweak the visibility of
5568 the class or perform any other required target modifications. */
5569 targetm
.cxx
.adjust_class_at_definition (t
);
5571 maybe_suppress_debug_info (t
);
5573 dump_class_hierarchy (t
);
5575 /* Finish debugging output for this type. */
5576 rest_of_type_compilation (t
, ! LOCAL_CLASS_P (t
));
5579 /* When T was built up, the member declarations were added in reverse
5580 order. Rearrange them to declaration order. */
5583 unreverse_member_declarations (tree t
)
5589 /* The following lists are all in reverse order. Put them in
5590 declaration order now. */
5591 TYPE_METHODS (t
) = nreverse (TYPE_METHODS (t
));
5592 CLASSTYPE_DECL_LIST (t
) = nreverse (CLASSTYPE_DECL_LIST (t
));
5594 /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in
5595 reverse order, so we can't just use nreverse. */
5597 for (x
= TYPE_FIELDS (t
);
5598 x
&& TREE_CODE (x
) != TYPE_DECL
;
5601 next
= TREE_CHAIN (x
);
5602 TREE_CHAIN (x
) = prev
;
5607 TREE_CHAIN (TYPE_FIELDS (t
)) = x
;
5609 TYPE_FIELDS (t
) = prev
;
5614 finish_struct (tree t
, tree attributes
)
5616 location_t saved_loc
= input_location
;
5618 /* Now that we've got all the field declarations, reverse everything
5620 unreverse_member_declarations (t
);
5622 cplus_decl_attributes (&t
, attributes
, (int) ATTR_FLAG_TYPE_IN_PLACE
);
5624 /* Nadger the current location so that diagnostics point to the start of
5625 the struct, not the end. */
5626 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (t
));
5628 if (processing_template_decl
)
5632 finish_struct_methods (t
);
5633 TYPE_SIZE (t
) = bitsize_zero_node
;
5634 TYPE_SIZE_UNIT (t
) = size_zero_node
;
5636 /* We need to emit an error message if this type was used as a parameter
5637 and it is an abstract type, even if it is a template. We construct
5638 a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into
5639 account and we call complete_vars with this type, which will check
5640 the PARM_DECLS. Note that while the type is being defined,
5641 CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends
5642 (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */
5643 CLASSTYPE_PURE_VIRTUALS (t
) = NULL
;
5644 for (x
= TYPE_METHODS (t
); x
; x
= TREE_CHAIN (x
))
5645 if (DECL_PURE_VIRTUAL_P (x
))
5646 VEC_safe_push (tree
, gc
, CLASSTYPE_PURE_VIRTUALS (t
), x
);
5649 /* Remember current #pragma pack value. */
5650 TYPE_PRECISION (t
) = maximum_field_alignment
;
5653 finish_struct_1 (t
);
5655 input_location
= saved_loc
;
5657 TYPE_BEING_DEFINED (t
) = 0;
5659 if (current_class_type
)
5662 error ("trying to finish struct, but kicked out due to previous parse errors");
5664 if (processing_template_decl
&& at_function_scope_p ())
5665 add_stmt (build_min (TAG_DEFN
, t
));
5670 /* Return the dynamic type of INSTANCE, if known.
5671 Used to determine whether the virtual function table is needed
5674 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
5675 of our knowledge of its type. *NONNULL should be initialized
5676 before this function is called. */
5679 fixed_type_or_null (tree instance
, int *nonnull
, int *cdtorp
)
5681 #define RECUR(T) fixed_type_or_null((T), nonnull, cdtorp)
5683 switch (TREE_CODE (instance
))
5686 if (POINTER_TYPE_P (TREE_TYPE (instance
)))
5689 return RECUR (TREE_OPERAND (instance
, 0));
5692 /* This is a call to a constructor, hence it's never zero. */
5693 if (TREE_HAS_CONSTRUCTOR (instance
))
5697 return TREE_TYPE (instance
);
5702 /* This is a call to a constructor, hence it's never zero. */
5703 if (TREE_HAS_CONSTRUCTOR (instance
))
5707 return TREE_TYPE (instance
);
5709 return RECUR (TREE_OPERAND (instance
, 0));
5711 case POINTER_PLUS_EXPR
:
5714 if (TREE_CODE (TREE_OPERAND (instance
, 0)) == ADDR_EXPR
)
5715 return RECUR (TREE_OPERAND (instance
, 0));
5716 if (TREE_CODE (TREE_OPERAND (instance
, 1)) == INTEGER_CST
)
5717 /* Propagate nonnull. */
5718 return RECUR (TREE_OPERAND (instance
, 0));
5723 return RECUR (TREE_OPERAND (instance
, 0));
5726 instance
= TREE_OPERAND (instance
, 0);
5729 /* Just because we see an ADDR_EXPR doesn't mean we're dealing
5730 with a real object -- given &p->f, p can still be null. */
5731 tree t
= get_base_address (instance
);
5732 /* ??? Probably should check DECL_WEAK here. */
5733 if (t
&& DECL_P (t
))
5736 return RECUR (instance
);
5739 /* If this component is really a base class reference, then the field
5740 itself isn't definitive. */
5741 if (DECL_FIELD_IS_BASE (TREE_OPERAND (instance
, 1)))
5742 return RECUR (TREE_OPERAND (instance
, 0));
5743 return RECUR (TREE_OPERAND (instance
, 1));
5747 if (TREE_CODE (TREE_TYPE (instance
)) == ARRAY_TYPE
5748 && MAYBE_CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (instance
))))
5752 return TREE_TYPE (TREE_TYPE (instance
));
5754 /* fall through... */
5758 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (instance
)))
5762 return TREE_TYPE (instance
);
5764 else if (instance
== current_class_ptr
)
5769 /* if we're in a ctor or dtor, we know our type. */
5770 if (DECL_LANG_SPECIFIC (current_function_decl
)
5771 && (DECL_CONSTRUCTOR_P (current_function_decl
)
5772 || DECL_DESTRUCTOR_P (current_function_decl
)))
5776 return TREE_TYPE (TREE_TYPE (instance
));
5779 else if (TREE_CODE (TREE_TYPE (instance
)) == REFERENCE_TYPE
)
5781 /* We only need one hash table because it is always left empty. */
5784 ht
= htab_create (37,
5789 /* Reference variables should be references to objects. */
5793 /* Enter the INSTANCE in a table to prevent recursion; a
5794 variable's initializer may refer to the variable
5796 if (TREE_CODE (instance
) == VAR_DECL
5797 && DECL_INITIAL (instance
)
5798 && !htab_find (ht
, instance
))
5803 slot
= htab_find_slot (ht
, instance
, INSERT
);
5805 type
= RECUR (DECL_INITIAL (instance
));
5806 htab_remove_elt (ht
, instance
);
5819 /* Return nonzero if the dynamic type of INSTANCE is known, and
5820 equivalent to the static type. We also handle the case where
5821 INSTANCE is really a pointer. Return negative if this is a
5822 ctor/dtor. There the dynamic type is known, but this might not be
5823 the most derived base of the original object, and hence virtual
5824 bases may not be layed out according to this type.
5826 Used to determine whether the virtual function table is needed
5829 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
5830 of our knowledge of its type. *NONNULL should be initialized
5831 before this function is called. */
5834 resolves_to_fixed_type_p (tree instance
, int* nonnull
)
5836 tree t
= TREE_TYPE (instance
);
5838 tree fixed
= fixed_type_or_null (instance
, nonnull
, &cdtorp
);
5839 if (fixed
== NULL_TREE
)
5841 if (POINTER_TYPE_P (t
))
5843 if (!same_type_ignoring_top_level_qualifiers_p (t
, fixed
))
5845 return cdtorp
? -1 : 1;
5850 init_class_processing (void)
5852 current_class_depth
= 0;
5853 current_class_stack_size
= 10;
5855 = XNEWVEC (struct class_stack_node
, current_class_stack_size
);
5856 local_classes
= VEC_alloc (tree
, gc
, 8);
5857 sizeof_biggest_empty_class
= size_zero_node
;
5859 ridpointers
[(int) RID_PUBLIC
] = access_public_node
;
5860 ridpointers
[(int) RID_PRIVATE
] = access_private_node
;
5861 ridpointers
[(int) RID_PROTECTED
] = access_protected_node
;
5864 /* Restore the cached PREVIOUS_CLASS_LEVEL. */
5867 restore_class_cache (void)
5871 /* We are re-entering the same class we just left, so we don't
5872 have to search the whole inheritance matrix to find all the
5873 decls to bind again. Instead, we install the cached
5874 class_shadowed list and walk through it binding names. */
5875 push_binding_level (previous_class_level
);
5876 class_binding_level
= previous_class_level
;
5877 /* Restore IDENTIFIER_TYPE_VALUE. */
5878 for (type
= class_binding_level
->type_shadowed
;
5880 type
= TREE_CHAIN (type
))
5881 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (type
), TREE_TYPE (type
));
5884 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as
5885 appropriate for TYPE.
5887 So that we may avoid calls to lookup_name, we cache the _TYPE
5888 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
5890 For multiple inheritance, we perform a two-pass depth-first search
5891 of the type lattice. */
5894 pushclass (tree type
)
5896 class_stack_node_t csn
;
5898 type
= TYPE_MAIN_VARIANT (type
);
5900 /* Make sure there is enough room for the new entry on the stack. */
5901 if (current_class_depth
+ 1 >= current_class_stack_size
)
5903 current_class_stack_size
*= 2;
5905 = XRESIZEVEC (struct class_stack_node
, current_class_stack
,
5906 current_class_stack_size
);
5909 /* Insert a new entry on the class stack. */
5910 csn
= current_class_stack
+ current_class_depth
;
5911 csn
->name
= current_class_name
;
5912 csn
->type
= current_class_type
;
5913 csn
->access
= current_access_specifier
;
5914 csn
->names_used
= 0;
5916 current_class_depth
++;
5918 /* Now set up the new type. */
5919 current_class_name
= TYPE_NAME (type
);
5920 if (TREE_CODE (current_class_name
) == TYPE_DECL
)
5921 current_class_name
= DECL_NAME (current_class_name
);
5922 current_class_type
= type
;
5924 /* By default, things in classes are private, while things in
5925 structures or unions are public. */
5926 current_access_specifier
= (CLASSTYPE_DECLARED_CLASS (type
)
5927 ? access_private_node
5928 : access_public_node
);
5930 if (previous_class_level
5931 && type
!= previous_class_level
->this_entity
5932 && current_class_depth
== 1)
5934 /* Forcibly remove any old class remnants. */
5935 invalidate_class_lookup_cache ();
5938 if (!previous_class_level
5939 || type
!= previous_class_level
->this_entity
5940 || current_class_depth
> 1)
5943 restore_class_cache ();
5946 /* When we exit a toplevel class scope, we save its binding level so
5947 that we can restore it quickly. Here, we've entered some other
5948 class, so we must invalidate our cache. */
5951 invalidate_class_lookup_cache (void)
5953 previous_class_level
= NULL
;
5956 /* Get out of the current class scope. If we were in a class scope
5957 previously, that is the one popped to. */
5964 current_class_depth
--;
5965 current_class_name
= current_class_stack
[current_class_depth
].name
;
5966 current_class_type
= current_class_stack
[current_class_depth
].type
;
5967 current_access_specifier
= current_class_stack
[current_class_depth
].access
;
5968 if (current_class_stack
[current_class_depth
].names_used
)
5969 splay_tree_delete (current_class_stack
[current_class_depth
].names_used
);
5972 /* Mark the top of the class stack as hidden. */
5975 push_class_stack (void)
5977 if (current_class_depth
)
5978 ++current_class_stack
[current_class_depth
- 1].hidden
;
5981 /* Mark the top of the class stack as un-hidden. */
5984 pop_class_stack (void)
5986 if (current_class_depth
)
5987 --current_class_stack
[current_class_depth
- 1].hidden
;
5990 /* Returns 1 if the class type currently being defined is either T or
5991 a nested type of T. */
5994 currently_open_class (tree t
)
5998 if (!CLASS_TYPE_P (t
))
6001 t
= TYPE_MAIN_VARIANT (t
);
6003 /* We start looking from 1 because entry 0 is from global scope,
6005 for (i
= current_class_depth
; i
> 0; --i
)
6008 if (i
== current_class_depth
)
6009 c
= current_class_type
;
6012 if (current_class_stack
[i
].hidden
)
6014 c
= current_class_stack
[i
].type
;
6018 if (same_type_p (c
, t
))
6024 /* If either current_class_type or one of its enclosing classes are derived
6025 from T, return the appropriate type. Used to determine how we found
6026 something via unqualified lookup. */
6029 currently_open_derived_class (tree t
)
6033 /* The bases of a dependent type are unknown. */
6034 if (dependent_type_p (t
))
6037 if (!current_class_type
)
6040 if (DERIVED_FROM_P (t
, current_class_type
))
6041 return current_class_type
;
6043 for (i
= current_class_depth
- 1; i
> 0; --i
)
6045 if (current_class_stack
[i
].hidden
)
6047 if (DERIVED_FROM_P (t
, current_class_stack
[i
].type
))
6048 return current_class_stack
[i
].type
;
6054 /* Returns the innermost class type which is not a lambda closure type. */
6057 current_nonlambda_class_type (void)
6061 /* We start looking from 1 because entry 0 is from global scope,
6063 for (i
= current_class_depth
; i
> 0; --i
)
6066 if (i
== current_class_depth
)
6067 c
= current_class_type
;
6070 if (current_class_stack
[i
].hidden
)
6072 c
= current_class_stack
[i
].type
;
6076 if (!LAMBDA_TYPE_P (c
))
6082 /* When entering a class scope, all enclosing class scopes' names with
6083 static meaning (static variables, static functions, types and
6084 enumerators) have to be visible. This recursive function calls
6085 pushclass for all enclosing class contexts until global or a local
6086 scope is reached. TYPE is the enclosed class. */
6089 push_nested_class (tree type
)
6091 /* A namespace might be passed in error cases, like A::B:C. */
6092 if (type
== NULL_TREE
6093 || !CLASS_TYPE_P (type
))
6096 push_nested_class (DECL_CONTEXT (TYPE_MAIN_DECL (type
)));
6101 /* Undoes a push_nested_class call. */
6104 pop_nested_class (void)
6106 tree context
= DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type
));
6109 if (context
&& CLASS_TYPE_P (context
))
6110 pop_nested_class ();
6113 /* Returns the number of extern "LANG" blocks we are nested within. */
6116 current_lang_depth (void)
6118 return VEC_length (tree
, current_lang_base
);
6121 /* Set global variables CURRENT_LANG_NAME to appropriate value
6122 so that behavior of name-mangling machinery is correct. */
6125 push_lang_context (tree name
)
6127 VEC_safe_push (tree
, gc
, current_lang_base
, current_lang_name
);
6129 if (name
== lang_name_cplusplus
)
6131 current_lang_name
= name
;
6133 else if (name
== lang_name_java
)
6135 current_lang_name
= name
;
6136 /* DECL_IGNORED_P is initially set for these types, to avoid clutter.
6137 (See record_builtin_java_type in decl.c.) However, that causes
6138 incorrect debug entries if these types are actually used.
6139 So we re-enable debug output after extern "Java". */
6140 DECL_IGNORED_P (TYPE_NAME (java_byte_type_node
)) = 0;
6141 DECL_IGNORED_P (TYPE_NAME (java_short_type_node
)) = 0;
6142 DECL_IGNORED_P (TYPE_NAME (java_int_type_node
)) = 0;
6143 DECL_IGNORED_P (TYPE_NAME (java_long_type_node
)) = 0;
6144 DECL_IGNORED_P (TYPE_NAME (java_float_type_node
)) = 0;
6145 DECL_IGNORED_P (TYPE_NAME (java_double_type_node
)) = 0;
6146 DECL_IGNORED_P (TYPE_NAME (java_char_type_node
)) = 0;
6147 DECL_IGNORED_P (TYPE_NAME (java_boolean_type_node
)) = 0;
6149 else if (name
== lang_name_c
)
6151 current_lang_name
= name
;
6154 error ("language string %<\"%E\"%> not recognized", name
);
6157 /* Get out of the current language scope. */
6160 pop_lang_context (void)
6162 current_lang_name
= VEC_pop (tree
, current_lang_base
);
6165 /* Type instantiation routines. */
6167 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
6168 matches the TARGET_TYPE. If there is no satisfactory match, return
6169 error_mark_node, and issue an error & warning messages under
6170 control of FLAGS. Permit pointers to member function if FLAGS
6171 permits. If TEMPLATE_ONLY, the name of the overloaded function was
6172 a template-id, and EXPLICIT_TARGS are the explicitly provided
6175 If OVERLOAD is for one or more member functions, then ACCESS_PATH
6176 is the base path used to reference those member functions. If
6177 TF_NO_ACCESS_CONTROL is not set in FLAGS, and the address is
6178 resolved to a member function, access checks will be performed and
6179 errors issued if appropriate. */
6182 resolve_address_of_overloaded_function (tree target_type
,
6184 tsubst_flags_t flags
,
6186 tree explicit_targs
,
6189 /* Here's what the standard says:
6193 If the name is a function template, template argument deduction
6194 is done, and if the argument deduction succeeds, the deduced
6195 arguments are used to generate a single template function, which
6196 is added to the set of overloaded functions considered.
6198 Non-member functions and static member functions match targets of
6199 type "pointer-to-function" or "reference-to-function." Nonstatic
6200 member functions match targets of type "pointer-to-member
6201 function;" the function type of the pointer to member is used to
6202 select the member function from the set of overloaded member
6203 functions. If a nonstatic member function is selected, the
6204 reference to the overloaded function name is required to have the
6205 form of a pointer to member as described in 5.3.1.
6207 If more than one function is selected, any template functions in
6208 the set are eliminated if the set also contains a non-template
6209 function, and any given template function is eliminated if the
6210 set contains a second template function that is more specialized
6211 than the first according to the partial ordering rules 14.5.5.2.
6212 After such eliminations, if any, there shall remain exactly one
6213 selected function. */
6216 /* We store the matches in a TREE_LIST rooted here. The functions
6217 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
6218 interoperability with most_specialized_instantiation. */
6219 tree matches
= NULL_TREE
;
6221 tree target_fn_type
;
6223 /* By the time we get here, we should be seeing only real
6224 pointer-to-member types, not the internal POINTER_TYPE to
6225 METHOD_TYPE representation. */
6226 gcc_assert (TREE_CODE (target_type
) != POINTER_TYPE
6227 || TREE_CODE (TREE_TYPE (target_type
)) != METHOD_TYPE
);
6229 gcc_assert (is_overloaded_fn (overload
));
6231 /* Check that the TARGET_TYPE is reasonable. */
6232 if (TYPE_PTRFN_P (target_type
))
6234 else if (TYPE_PTRMEMFUNC_P (target_type
))
6235 /* This is OK, too. */
6237 else if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
6238 /* This is OK, too. This comes from a conversion to reference
6240 target_type
= build_reference_type (target_type
);
6243 if (flags
& tf_error
)
6244 error ("cannot resolve overloaded function %qD based on"
6245 " conversion to type %qT",
6246 DECL_NAME (OVL_FUNCTION (overload
)), target_type
);
6247 return error_mark_node
;
6250 /* Non-member functions and static member functions match targets of type
6251 "pointer-to-function" or "reference-to-function." Nonstatic member
6252 functions match targets of type "pointer-to-member-function;" the
6253 function type of the pointer to member is used to select the member
6254 function from the set of overloaded member functions.
6256 So figure out the FUNCTION_TYPE that we want to match against. */
6257 target_fn_type
= static_fn_type (target_type
);
6259 /* If we can find a non-template function that matches, we can just
6260 use it. There's no point in generating template instantiations
6261 if we're just going to throw them out anyhow. But, of course, we
6262 can only do this when we don't *need* a template function. */
6267 for (fns
= overload
; fns
; fns
= OVL_NEXT (fns
))
6269 tree fn
= OVL_CURRENT (fns
);
6271 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
6272 /* We're not looking for templates just yet. */
6275 if ((TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
6277 /* We're looking for a non-static member, and this isn't
6278 one, or vice versa. */
6281 /* Ignore functions which haven't been explicitly
6283 if (DECL_ANTICIPATED (fn
))
6286 /* See if there's a match. */
6287 if (same_type_p (target_fn_type
, static_fn_type (fn
)))
6288 matches
= tree_cons (fn
, NULL_TREE
, matches
);
6292 /* Now, if we've already got a match (or matches), there's no need
6293 to proceed to the template functions. But, if we don't have a
6294 match we need to look at them, too. */
6297 tree target_arg_types
;
6298 tree target_ret_type
;
6301 unsigned int nargs
, ia
;
6304 target_arg_types
= TYPE_ARG_TYPES (target_fn_type
);
6305 target_ret_type
= TREE_TYPE (target_fn_type
);
6307 nargs
= list_length (target_arg_types
);
6308 args
= XALLOCAVEC (tree
, nargs
);
6309 for (arg
= target_arg_types
, ia
= 0;
6310 arg
!= NULL_TREE
&& arg
!= void_list_node
;
6311 arg
= TREE_CHAIN (arg
), ++ia
)
6312 args
[ia
] = TREE_VALUE (arg
);
6315 for (fns
= overload
; fns
; fns
= OVL_NEXT (fns
))
6317 tree fn
= OVL_CURRENT (fns
);
6321 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
6322 /* We're only looking for templates. */
6325 if ((TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
6327 /* We're not looking for a non-static member, and this is
6328 one, or vice versa. */
6331 /* Try to do argument deduction. */
6332 targs
= make_tree_vec (DECL_NTPARMS (fn
));
6333 if (fn_type_unification (fn
, explicit_targs
, targs
, args
, nargs
,
6334 target_ret_type
, DEDUCE_EXACT
,
6336 /* Argument deduction failed. */
6339 /* Instantiate the template. */
6340 instantiation
= instantiate_template (fn
, targs
, flags
);
6341 if (instantiation
== error_mark_node
)
6342 /* Instantiation failed. */
6345 /* See if there's a match. */
6346 if (same_type_p (target_fn_type
, static_fn_type (instantiation
)))
6347 matches
= tree_cons (instantiation
, fn
, matches
);
6350 /* Now, remove all but the most specialized of the matches. */
6353 tree match
= most_specialized_instantiation (matches
);
6355 if (match
!= error_mark_node
)
6356 matches
= tree_cons (TREE_PURPOSE (match
),
6362 /* Now we should have exactly one function in MATCHES. */
6363 if (matches
== NULL_TREE
)
6365 /* There were *no* matches. */
6366 if (flags
& tf_error
)
6368 error ("no matches converting function %qD to type %q#T",
6369 DECL_NAME (OVL_CURRENT (overload
)),
6372 /* print_candidates expects a chain with the functions in
6373 TREE_VALUE slots, so we cons one up here (we're losing anyway,
6374 so why be clever?). */
6375 for (; overload
; overload
= OVL_NEXT (overload
))
6376 matches
= tree_cons (NULL_TREE
, OVL_CURRENT (overload
),
6379 print_candidates (matches
);
6381 return error_mark_node
;
6383 else if (TREE_CHAIN (matches
))
6385 /* There were too many matches. First check if they're all
6386 the same function. */
6389 fn
= TREE_PURPOSE (matches
);
6390 for (match
= TREE_CHAIN (matches
); match
; match
= TREE_CHAIN (match
))
6391 if (!decls_match (fn
, TREE_PURPOSE (match
)))
6396 if (flags
& tf_error
)
6398 error ("converting overloaded function %qD to type %q#T is ambiguous",
6399 DECL_NAME (OVL_FUNCTION (overload
)),
6402 /* Since print_candidates expects the functions in the
6403 TREE_VALUE slot, we flip them here. */
6404 for (match
= matches
; match
; match
= TREE_CHAIN (match
))
6405 TREE_VALUE (match
) = TREE_PURPOSE (match
);
6407 print_candidates (matches
);
6410 return error_mark_node
;
6414 /* Good, exactly one match. Now, convert it to the correct type. */
6415 fn
= TREE_PURPOSE (matches
);
6417 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
6418 && !(flags
& tf_ptrmem_ok
) && !flag_ms_extensions
)
6420 static int explained
;
6422 if (!(flags
& tf_error
))
6423 return error_mark_node
;
6425 permerror (input_location
, "assuming pointer to member %qD", fn
);
6428 inform (input_location
, "(a pointer to member can only be formed with %<&%E%>)", fn
);
6433 /* If we're doing overload resolution purely for the purpose of
6434 determining conversion sequences, we should not consider the
6435 function used. If this conversion sequence is selected, the
6436 function will be marked as used at this point. */
6437 if (!(flags
& tf_conv
))
6439 /* Make =delete work with SFINAE. */
6440 if (DECL_DELETED_FN (fn
) && !(flags
& tf_error
))
6441 return error_mark_node
;
6446 /* We could not check access to member functions when this
6447 expression was originally created since we did not know at that
6448 time to which function the expression referred. */
6449 if (!(flags
& tf_no_access_control
)
6450 && DECL_FUNCTION_MEMBER_P (fn
))
6452 gcc_assert (access_path
);
6453 perform_or_defer_access_check (access_path
, fn
, fn
);
6456 if (TYPE_PTRFN_P (target_type
) || TYPE_PTRMEMFUNC_P (target_type
))
6457 return cp_build_unary_op (ADDR_EXPR
, fn
, 0, flags
);
6460 /* The target must be a REFERENCE_TYPE. Above, cp_build_unary_op
6461 will mark the function as addressed, but here we must do it
6463 cxx_mark_addressable (fn
);
6469 /* This function will instantiate the type of the expression given in
6470 RHS to match the type of LHSTYPE. If errors exist, then return
6471 error_mark_node. FLAGS is a bit mask. If TF_ERROR is set, then
6472 we complain on errors. If we are not complaining, never modify rhs,
6473 as overload resolution wants to try many possible instantiations, in
6474 the hope that at least one will work.
6476 For non-recursive calls, LHSTYPE should be a function, pointer to
6477 function, or a pointer to member function. */
6480 instantiate_type (tree lhstype
, tree rhs
, tsubst_flags_t flags
)
6482 tsubst_flags_t flags_in
= flags
;
6483 tree access_path
= NULL_TREE
;
6485 flags
&= ~tf_ptrmem_ok
;
6487 if (lhstype
== unknown_type_node
)
6489 if (flags
& tf_error
)
6490 error ("not enough type information");
6491 return error_mark_node
;
6494 if (TREE_TYPE (rhs
) != NULL_TREE
&& ! (type_unknown_p (rhs
)))
6496 if (same_type_p (lhstype
, TREE_TYPE (rhs
)))
6498 if (flag_ms_extensions
6499 && TYPE_PTRMEMFUNC_P (lhstype
)
6500 && !TYPE_PTRMEMFUNC_P (TREE_TYPE (rhs
)))
6501 /* Microsoft allows `A::f' to be resolved to a
6502 pointer-to-member. */
6506 if (flags
& tf_error
)
6507 error ("argument of type %qT does not match %qT",
6508 TREE_TYPE (rhs
), lhstype
);
6509 return error_mark_node
;
6513 if (TREE_CODE (rhs
) == BASELINK
)
6515 access_path
= BASELINK_ACCESS_BINFO (rhs
);
6516 rhs
= BASELINK_FUNCTIONS (rhs
);
6519 /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot
6520 deduce any type information. */
6521 if (TREE_CODE (rhs
) == NON_DEPENDENT_EXPR
)
6523 if (flags
& tf_error
)
6524 error ("not enough type information");
6525 return error_mark_node
;
6528 /* There only a few kinds of expressions that may have a type
6529 dependent on overload resolution. */
6530 gcc_assert (TREE_CODE (rhs
) == ADDR_EXPR
6531 || TREE_CODE (rhs
) == COMPONENT_REF
6532 || really_overloaded_fn (rhs
)
6533 || (flag_ms_extensions
&& TREE_CODE (rhs
) == FUNCTION_DECL
));
6535 /* This should really only be used when attempting to distinguish
6536 what sort of a pointer to function we have. For now, any
6537 arithmetic operation which is not supported on pointers
6538 is rejected as an error. */
6540 switch (TREE_CODE (rhs
))
6544 tree member
= TREE_OPERAND (rhs
, 1);
6546 member
= instantiate_type (lhstype
, member
, flags
);
6547 if (member
!= error_mark_node
6548 && TREE_SIDE_EFFECTS (TREE_OPERAND (rhs
, 0)))
6549 /* Do not lose object's side effects. */
6550 return build2 (COMPOUND_EXPR
, TREE_TYPE (member
),
6551 TREE_OPERAND (rhs
, 0), member
);
6556 rhs
= TREE_OPERAND (rhs
, 1);
6557 if (BASELINK_P (rhs
))
6558 return instantiate_type (lhstype
, rhs
, flags_in
);
6560 /* This can happen if we are forming a pointer-to-member for a
6562 gcc_assert (TREE_CODE (rhs
) == TEMPLATE_ID_EXPR
);
6566 case TEMPLATE_ID_EXPR
:
6568 tree fns
= TREE_OPERAND (rhs
, 0);
6569 tree args
= TREE_OPERAND (rhs
, 1);
6572 resolve_address_of_overloaded_function (lhstype
, fns
, flags_in
,
6573 /*template_only=*/true,
6580 resolve_address_of_overloaded_function (lhstype
, rhs
, flags_in
,
6581 /*template_only=*/false,
6582 /*explicit_targs=*/NULL_TREE
,
6587 if (PTRMEM_OK_P (rhs
))
6588 flags
|= tf_ptrmem_ok
;
6590 return instantiate_type (lhstype
, TREE_OPERAND (rhs
, 0), flags
);
6594 return error_mark_node
;
6599 return error_mark_node
;
6602 /* Return the name of the virtual function pointer field
6603 (as an IDENTIFIER_NODE) for the given TYPE. Note that
6604 this may have to look back through base types to find the
6605 ultimate field name. (For single inheritance, these could
6606 all be the same name. Who knows for multiple inheritance). */
6609 get_vfield_name (tree type
)
6611 tree binfo
, base_binfo
;
6614 for (binfo
= TYPE_BINFO (type
);
6615 BINFO_N_BASE_BINFOS (binfo
);
6618 base_binfo
= BINFO_BASE_BINFO (binfo
, 0);
6620 if (BINFO_VIRTUAL_P (base_binfo
)
6621 || !TYPE_CONTAINS_VPTR_P (BINFO_TYPE (base_binfo
)))
6625 type
= BINFO_TYPE (binfo
);
6626 buf
= (char *) alloca (sizeof (VFIELD_NAME_FORMAT
)
6627 + TYPE_NAME_LENGTH (type
) + 2);
6628 sprintf (buf
, VFIELD_NAME_FORMAT
,
6629 IDENTIFIER_POINTER (constructor_name (type
)));
6630 return get_identifier (buf
);
6634 print_class_statistics (void)
6636 #ifdef GATHER_STATISTICS
6637 fprintf (stderr
, "convert_harshness = %d\n", n_convert_harshness
);
6638 fprintf (stderr
, "compute_conversion_costs = %d\n", n_compute_conversion_costs
);
6641 fprintf (stderr
, "vtables = %d; vtable searches = %d\n",
6642 n_vtables
, n_vtable_searches
);
6643 fprintf (stderr
, "vtable entries = %d; vtable elems = %d\n",
6644 n_vtable_entries
, n_vtable_elems
);
6649 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
6650 according to [class]:
6651 The class-name is also inserted
6652 into the scope of the class itself. For purposes of access checking,
6653 the inserted class name is treated as if it were a public member name. */
6656 build_self_reference (void)
6658 tree name
= constructor_name (current_class_type
);
6659 tree value
= build_lang_decl (TYPE_DECL
, name
, current_class_type
);
6662 DECL_NONLOCAL (value
) = 1;
6663 DECL_CONTEXT (value
) = current_class_type
;
6664 DECL_ARTIFICIAL (value
) = 1;
6665 SET_DECL_SELF_REFERENCE_P (value
);
6666 cp_set_underlying_type (value
);
6668 if (processing_template_decl
)
6669 value
= push_template_decl (value
);
6671 saved_cas
= current_access_specifier
;
6672 current_access_specifier
= access_public_node
;
6673 finish_member_declaration (value
);
6674 current_access_specifier
= saved_cas
;
6677 /* Returns 1 if TYPE contains only padding bytes. */
6680 is_empty_class (tree type
)
6682 if (type
== error_mark_node
)
6685 if (! CLASS_TYPE_P (type
))
6688 /* In G++ 3.2, whether or not a class was empty was determined by
6689 looking at its size. */
6690 if (abi_version_at_least (2))
6691 return CLASSTYPE_EMPTY_P (type
);
6693 return integer_zerop (CLASSTYPE_SIZE (type
));
6696 /* Returns true if TYPE contains an empty class. */
6699 contains_empty_class_p (tree type
)
6701 if (is_empty_class (type
))
6703 if (CLASS_TYPE_P (type
))
6710 for (binfo
= TYPE_BINFO (type
), i
= 0;
6711 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
6712 if (contains_empty_class_p (BINFO_TYPE (base_binfo
)))
6714 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
6715 if (TREE_CODE (field
) == FIELD_DECL
6716 && !DECL_ARTIFICIAL (field
)
6717 && is_empty_class (TREE_TYPE (field
)))
6720 else if (TREE_CODE (type
) == ARRAY_TYPE
)
6721 return contains_empty_class_p (TREE_TYPE (type
));
6725 /* Returns true if TYPE contains no actual data, just various
6726 possible combinations of empty classes. */
6729 is_really_empty_class (tree type
)
6731 if (is_empty_class (type
))
6733 if (CLASS_TYPE_P (type
))
6740 for (binfo
= TYPE_BINFO (type
), i
= 0;
6741 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
6742 if (!is_really_empty_class (BINFO_TYPE (base_binfo
)))
6744 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
6745 if (TREE_CODE (field
) == FIELD_DECL
6746 && !DECL_ARTIFICIAL (field
)
6747 && !is_really_empty_class (TREE_TYPE (field
)))
6751 else if (TREE_CODE (type
) == ARRAY_TYPE
)
6752 return is_really_empty_class (TREE_TYPE (type
));
6756 /* Note that NAME was looked up while the current class was being
6757 defined and that the result of that lookup was DECL. */
6760 maybe_note_name_used_in_class (tree name
, tree decl
)
6762 splay_tree names_used
;
6764 /* If we're not defining a class, there's nothing to do. */
6765 if (!(innermost_scope_kind() == sk_class
6766 && TYPE_BEING_DEFINED (current_class_type
)
6767 && !LAMBDA_TYPE_P (current_class_type
)))
6770 /* If there's already a binding for this NAME, then we don't have
6771 anything to worry about. */
6772 if (lookup_member (current_class_type
, name
,
6773 /*protect=*/0, /*want_type=*/false))
6776 if (!current_class_stack
[current_class_depth
- 1].names_used
)
6777 current_class_stack
[current_class_depth
- 1].names_used
6778 = splay_tree_new (splay_tree_compare_pointers
, 0, 0);
6779 names_used
= current_class_stack
[current_class_depth
- 1].names_used
;
6781 splay_tree_insert (names_used
,
6782 (splay_tree_key
) name
,
6783 (splay_tree_value
) decl
);
6786 /* Note that NAME was declared (as DECL) in the current class. Check
6787 to see that the declaration is valid. */
6790 note_name_declared_in_class (tree name
, tree decl
)
6792 splay_tree names_used
;
6795 /* Look to see if we ever used this name. */
6797 = current_class_stack
[current_class_depth
- 1].names_used
;
6801 n
= splay_tree_lookup (names_used
, (splay_tree_key
) name
);
6804 /* [basic.scope.class]
6806 A name N used in a class S shall refer to the same declaration
6807 in its context and when re-evaluated in the completed scope of
6809 permerror (input_location
, "declaration of %q#D", decl
);
6810 permerror (input_location
, "changes meaning of %qD from %q+#D",
6811 DECL_NAME (OVL_CURRENT (decl
)), (tree
) n
->value
);
6815 /* Returns the VAR_DECL for the complete vtable associated with BINFO.
6816 Secondary vtables are merged with primary vtables; this function
6817 will return the VAR_DECL for the primary vtable. */
6820 get_vtbl_decl_for_binfo (tree binfo
)
6824 decl
= BINFO_VTABLE (binfo
);
6825 if (decl
&& TREE_CODE (decl
) == POINTER_PLUS_EXPR
)
6827 gcc_assert (TREE_CODE (TREE_OPERAND (decl
, 0)) == ADDR_EXPR
);
6828 decl
= TREE_OPERAND (TREE_OPERAND (decl
, 0), 0);
6831 gcc_assert (TREE_CODE (decl
) == VAR_DECL
);
6836 /* Returns the binfo for the primary base of BINFO. If the resulting
6837 BINFO is a virtual base, and it is inherited elsewhere in the
6838 hierarchy, then the returned binfo might not be the primary base of
6839 BINFO in the complete object. Check BINFO_PRIMARY_P or
6840 BINFO_LOST_PRIMARY_P to be sure. */
6843 get_primary_binfo (tree binfo
)
6847 primary_base
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (binfo
));
6851 return copied_binfo (primary_base
, binfo
);
6854 /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */
6857 maybe_indent_hierarchy (FILE * stream
, int indent
, int indented_p
)
6860 fprintf (stream
, "%*s", indent
, "");
6864 /* Dump the offsets of all the bases rooted at BINFO to STREAM.
6865 INDENT should be zero when called from the top level; it is
6866 incremented recursively. IGO indicates the next expected BINFO in
6867 inheritance graph ordering. */
6870 dump_class_hierarchy_r (FILE *stream
,
6880 indented
= maybe_indent_hierarchy (stream
, indent
, 0);
6881 fprintf (stream
, "%s (0x%lx) ",
6882 type_as_string (BINFO_TYPE (binfo
), TFF_PLAIN_IDENTIFIER
),
6883 (unsigned long) binfo
);
6886 fprintf (stream
, "alternative-path\n");
6889 igo
= TREE_CHAIN (binfo
);
6891 fprintf (stream
, HOST_WIDE_INT_PRINT_DEC
,
6892 tree_low_cst (BINFO_OFFSET (binfo
), 0));
6893 if (is_empty_class (BINFO_TYPE (binfo
)))
6894 fprintf (stream
, " empty");
6895 else if (CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (binfo
)))
6896 fprintf (stream
, " nearly-empty");
6897 if (BINFO_VIRTUAL_P (binfo
))
6898 fprintf (stream
, " virtual");
6899 fprintf (stream
, "\n");
6902 if (BINFO_PRIMARY_P (binfo
))
6904 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
6905 fprintf (stream
, " primary-for %s (0x%lx)",
6906 type_as_string (BINFO_TYPE (BINFO_INHERITANCE_CHAIN (binfo
)),
6907 TFF_PLAIN_IDENTIFIER
),
6908 (unsigned long)BINFO_INHERITANCE_CHAIN (binfo
));
6910 if (BINFO_LOST_PRIMARY_P (binfo
))
6912 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
6913 fprintf (stream
, " lost-primary");
6916 fprintf (stream
, "\n");
6918 if (!(flags
& TDF_SLIM
))
6922 if (BINFO_SUBVTT_INDEX (binfo
))
6924 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
6925 fprintf (stream
, " subvttidx=%s",
6926 expr_as_string (BINFO_SUBVTT_INDEX (binfo
),
6927 TFF_PLAIN_IDENTIFIER
));
6929 if (BINFO_VPTR_INDEX (binfo
))
6931 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
6932 fprintf (stream
, " vptridx=%s",
6933 expr_as_string (BINFO_VPTR_INDEX (binfo
),
6934 TFF_PLAIN_IDENTIFIER
));
6936 if (BINFO_VPTR_FIELD (binfo
))
6938 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
6939 fprintf (stream
, " vbaseoffset=%s",
6940 expr_as_string (BINFO_VPTR_FIELD (binfo
),
6941 TFF_PLAIN_IDENTIFIER
));
6943 if (BINFO_VTABLE (binfo
))
6945 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
6946 fprintf (stream
, " vptr=%s",
6947 expr_as_string (BINFO_VTABLE (binfo
),
6948 TFF_PLAIN_IDENTIFIER
));
6952 fprintf (stream
, "\n");
6955 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
6956 igo
= dump_class_hierarchy_r (stream
, flags
, base_binfo
, igo
, indent
+ 2);
6961 /* Dump the BINFO hierarchy for T. */
6964 dump_class_hierarchy_1 (FILE *stream
, int flags
, tree t
)
6966 fprintf (stream
, "Class %s\n", type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
6967 fprintf (stream
, " size=%lu align=%lu\n",
6968 (unsigned long)(tree_low_cst (TYPE_SIZE (t
), 0) / BITS_PER_UNIT
),
6969 (unsigned long)(TYPE_ALIGN (t
) / BITS_PER_UNIT
));
6970 fprintf (stream
, " base size=%lu base align=%lu\n",
6971 (unsigned long)(tree_low_cst (TYPE_SIZE (CLASSTYPE_AS_BASE (t
)), 0)
6973 (unsigned long)(TYPE_ALIGN (CLASSTYPE_AS_BASE (t
))
6975 dump_class_hierarchy_r (stream
, flags
, TYPE_BINFO (t
), TYPE_BINFO (t
), 0);
6976 fprintf (stream
, "\n");
6979 /* Debug interface to hierarchy dumping. */
6982 debug_class (tree t
)
6984 dump_class_hierarchy_1 (stderr
, TDF_SLIM
, t
);
6988 dump_class_hierarchy (tree t
)
6991 FILE *stream
= dump_begin (TDI_class
, &flags
);
6995 dump_class_hierarchy_1 (stream
, flags
, t
);
6996 dump_end (TDI_class
, stream
);
7001 dump_array (FILE * stream
, tree decl
)
7004 unsigned HOST_WIDE_INT ix
;
7006 tree size
= TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (decl
)));
7008 elt
= (tree_low_cst (TYPE_SIZE (TREE_TYPE (TREE_TYPE (decl
))), 0)
7010 fprintf (stream
, "%s:", decl_as_string (decl
, TFF_PLAIN_IDENTIFIER
));
7011 fprintf (stream
, " %s entries",
7012 expr_as_string (size_binop (PLUS_EXPR
, size
, size_one_node
),
7013 TFF_PLAIN_IDENTIFIER
));
7014 fprintf (stream
, "\n");
7016 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (DECL_INITIAL (decl
)),
7018 fprintf (stream
, "%-4ld %s\n", (long)(ix
* elt
),
7019 expr_as_string (value
, TFF_PLAIN_IDENTIFIER
));
7023 dump_vtable (tree t
, tree binfo
, tree vtable
)
7026 FILE *stream
= dump_begin (TDI_class
, &flags
);
7031 if (!(flags
& TDF_SLIM
))
7033 int ctor_vtbl_p
= TYPE_BINFO (t
) != binfo
;
7035 fprintf (stream
, "%s for %s",
7036 ctor_vtbl_p
? "Construction vtable" : "Vtable",
7037 type_as_string (BINFO_TYPE (binfo
), TFF_PLAIN_IDENTIFIER
));
7040 if (!BINFO_VIRTUAL_P (binfo
))
7041 fprintf (stream
, " (0x%lx instance)", (unsigned long)binfo
);
7042 fprintf (stream
, " in %s", type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
7044 fprintf (stream
, "\n");
7045 dump_array (stream
, vtable
);
7046 fprintf (stream
, "\n");
7049 dump_end (TDI_class
, stream
);
7053 dump_vtt (tree t
, tree vtt
)
7056 FILE *stream
= dump_begin (TDI_class
, &flags
);
7061 if (!(flags
& TDF_SLIM
))
7063 fprintf (stream
, "VTT for %s\n",
7064 type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
7065 dump_array (stream
, vtt
);
7066 fprintf (stream
, "\n");
7069 dump_end (TDI_class
, stream
);
7072 /* Dump a function or thunk and its thunkees. */
7075 dump_thunk (FILE *stream
, int indent
, tree thunk
)
7077 static const char spaces
[] = " ";
7078 tree name
= DECL_NAME (thunk
);
7081 fprintf (stream
, "%.*s%p %s %s", indent
, spaces
,
7083 !DECL_THUNK_P (thunk
) ? "function"
7084 : DECL_THIS_THUNK_P (thunk
) ? "this-thunk" : "covariant-thunk",
7085 name
? IDENTIFIER_POINTER (name
) : "<unset>");
7086 if (DECL_THUNK_P (thunk
))
7088 HOST_WIDE_INT fixed_adjust
= THUNK_FIXED_OFFSET (thunk
);
7089 tree virtual_adjust
= THUNK_VIRTUAL_OFFSET (thunk
);
7091 fprintf (stream
, " fixed=" HOST_WIDE_INT_PRINT_DEC
, fixed_adjust
);
7092 if (!virtual_adjust
)
7094 else if (DECL_THIS_THUNK_P (thunk
))
7095 fprintf (stream
, " vcall=" HOST_WIDE_INT_PRINT_DEC
,
7096 tree_low_cst (virtual_adjust
, 0));
7098 fprintf (stream
, " vbase=" HOST_WIDE_INT_PRINT_DEC
"(%s)",
7099 tree_low_cst (BINFO_VPTR_FIELD (virtual_adjust
), 0),
7100 type_as_string (BINFO_TYPE (virtual_adjust
), TFF_SCOPE
));
7101 if (THUNK_ALIAS (thunk
))
7102 fprintf (stream
, " alias to %p", (void *)THUNK_ALIAS (thunk
));
7104 fprintf (stream
, "\n");
7105 for (thunks
= DECL_THUNKS (thunk
); thunks
; thunks
= TREE_CHAIN (thunks
))
7106 dump_thunk (stream
, indent
+ 2, thunks
);
7109 /* Dump the thunks for FN. */
7112 debug_thunks (tree fn
)
7114 dump_thunk (stderr
, 0, fn
);
7117 /* Virtual function table initialization. */
7119 /* Create all the necessary vtables for T and its base classes. */
7122 finish_vtbls (tree t
)
7125 VEC(constructor_elt
,gc
) *v
= NULL
;
7126 tree vtable
= BINFO_VTABLE (TYPE_BINFO (t
));
7128 /* We lay out the primary and secondary vtables in one contiguous
7129 vtable. The primary vtable is first, followed by the non-virtual
7130 secondary vtables in inheritance graph order. */
7131 accumulate_vtbl_inits (TYPE_BINFO (t
), TYPE_BINFO (t
), TYPE_BINFO (t
),
7134 /* Then come the virtual bases, also in inheritance graph order. */
7135 for (vbase
= TYPE_BINFO (t
); vbase
; vbase
= TREE_CHAIN (vbase
))
7137 if (!BINFO_VIRTUAL_P (vbase
))
7139 accumulate_vtbl_inits (vbase
, vbase
, TYPE_BINFO (t
), vtable
, t
, &v
);
7142 if (BINFO_VTABLE (TYPE_BINFO (t
)))
7143 initialize_vtable (TYPE_BINFO (t
), v
);
7146 /* Initialize the vtable for BINFO with the INITS. */
7149 initialize_vtable (tree binfo
, VEC(constructor_elt
,gc
) *inits
)
7153 layout_vtable_decl (binfo
, VEC_length (constructor_elt
, inits
));
7154 decl
= get_vtbl_decl_for_binfo (binfo
);
7155 initialize_artificial_var (decl
, inits
);
7156 dump_vtable (BINFO_TYPE (binfo
), binfo
, decl
);
7159 /* Build the VTT (virtual table table) for T.
7160 A class requires a VTT if it has virtual bases.
7163 1 - primary virtual pointer for complete object T
7164 2 - secondary VTTs for each direct non-virtual base of T which requires a
7166 3 - secondary virtual pointers for each direct or indirect base of T which
7167 has virtual bases or is reachable via a virtual path from T.
7168 4 - secondary VTTs for each direct or indirect virtual base of T.
7170 Secondary VTTs look like complete object VTTs without part 4. */
7178 VEC(constructor_elt
,gc
) *inits
;
7180 /* Build up the initializers for the VTT. */
7182 index
= size_zero_node
;
7183 build_vtt_inits (TYPE_BINFO (t
), t
, &inits
, &index
);
7185 /* If we didn't need a VTT, we're done. */
7189 /* Figure out the type of the VTT. */
7190 type
= build_index_type (size_int (VEC_length (constructor_elt
, inits
) - 1));
7191 type
= build_cplus_array_type (const_ptr_type_node
, type
);
7193 /* Now, build the VTT object itself. */
7194 vtt
= build_vtable (t
, mangle_vtt_for_type (t
), type
);
7195 initialize_artificial_var (vtt
, inits
);
7196 /* Add the VTT to the vtables list. */
7197 TREE_CHAIN (vtt
) = TREE_CHAIN (CLASSTYPE_VTABLES (t
));
7198 TREE_CHAIN (CLASSTYPE_VTABLES (t
)) = vtt
;
7203 /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with
7204 PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo,
7205 and CHAIN the vtable pointer for this binfo after construction is
7206 complete. VALUE can also be another BINFO, in which case we recurse. */
7209 binfo_ctor_vtable (tree binfo
)
7215 vt
= BINFO_VTABLE (binfo
);
7216 if (TREE_CODE (vt
) == TREE_LIST
)
7217 vt
= TREE_VALUE (vt
);
7218 if (TREE_CODE (vt
) == TREE_BINFO
)
7227 /* Data for secondary VTT initialization. */
7228 typedef struct secondary_vptr_vtt_init_data_s
7230 /* Is this the primary VTT? */
7233 /* Current index into the VTT. */
7236 /* Vector of initializers built up. */
7237 VEC(constructor_elt
,gc
) *inits
;
7239 /* The type being constructed by this secondary VTT. */
7240 tree type_being_constructed
;
7241 } secondary_vptr_vtt_init_data
;
7243 /* Recursively build the VTT-initializer for BINFO (which is in the
7244 hierarchy dominated by T). INITS points to the end of the initializer
7245 list to date. INDEX is the VTT index where the next element will be
7246 replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e.
7247 not a subvtt for some base of T). When that is so, we emit the sub-VTTs
7248 for virtual bases of T. When it is not so, we build the constructor
7249 vtables for the BINFO-in-T variant. */
7252 build_vtt_inits (tree binfo
, tree t
, VEC(constructor_elt
,gc
) **inits
, tree
*index
)
7257 secondary_vptr_vtt_init_data data
;
7258 int top_level_p
= SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
);
7260 /* We only need VTTs for subobjects with virtual bases. */
7261 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
)))
7264 /* We need to use a construction vtable if this is not the primary
7268 build_ctor_vtbl_group (binfo
, t
);
7270 /* Record the offset in the VTT where this sub-VTT can be found. */
7271 BINFO_SUBVTT_INDEX (binfo
) = *index
;
7274 /* Add the address of the primary vtable for the complete object. */
7275 init
= binfo_ctor_vtable (binfo
);
7276 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
7279 gcc_assert (!BINFO_VPTR_INDEX (binfo
));
7280 BINFO_VPTR_INDEX (binfo
) = *index
;
7282 *index
= size_binop (PLUS_EXPR
, *index
, TYPE_SIZE_UNIT (ptr_type_node
));
7284 /* Recursively add the secondary VTTs for non-virtual bases. */
7285 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, b
); ++i
)
7286 if (!BINFO_VIRTUAL_P (b
))
7287 build_vtt_inits (b
, t
, inits
, index
);
7289 /* Add secondary virtual pointers for all subobjects of BINFO with
7290 either virtual bases or reachable along a virtual path, except
7291 subobjects that are non-virtual primary bases. */
7292 data
.top_level_p
= top_level_p
;
7293 data
.index
= *index
;
7294 data
.inits
= *inits
;
7295 data
.type_being_constructed
= BINFO_TYPE (binfo
);
7297 dfs_walk_once (binfo
, dfs_build_secondary_vptr_vtt_inits
, NULL
, &data
);
7299 *index
= data
.index
;
7301 /* data.inits might have grown as we added secondary virtual pointers.
7302 Make sure our caller knows about the new vector. */
7303 *inits
= data
.inits
;
7306 /* Add the secondary VTTs for virtual bases in inheritance graph
7308 for (b
= TYPE_BINFO (BINFO_TYPE (binfo
)); b
; b
= TREE_CHAIN (b
))
7310 if (!BINFO_VIRTUAL_P (b
))
7313 build_vtt_inits (b
, t
, inits
, index
);
7316 /* Remove the ctor vtables we created. */
7317 dfs_walk_all (binfo
, dfs_fixup_binfo_vtbls
, NULL
, binfo
);
7320 /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base
7321 in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */
7324 dfs_build_secondary_vptr_vtt_inits (tree binfo
, void *data_
)
7326 secondary_vptr_vtt_init_data
*data
= (secondary_vptr_vtt_init_data
*)data_
;
7328 /* We don't care about bases that don't have vtables. */
7329 if (!TYPE_VFIELD (BINFO_TYPE (binfo
)))
7330 return dfs_skip_bases
;
7332 /* We're only interested in proper subobjects of the type being
7334 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), data
->type_being_constructed
))
7337 /* We're only interested in bases with virtual bases or reachable
7338 via a virtual path from the type being constructed. */
7339 if (!(CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
))
7340 || binfo_via_virtual (binfo
, data
->type_being_constructed
)))
7341 return dfs_skip_bases
;
7343 /* We're not interested in non-virtual primary bases. */
7344 if (!BINFO_VIRTUAL_P (binfo
) && BINFO_PRIMARY_P (binfo
))
7347 /* Record the index where this secondary vptr can be found. */
7348 if (data
->top_level_p
)
7350 gcc_assert (!BINFO_VPTR_INDEX (binfo
));
7351 BINFO_VPTR_INDEX (binfo
) = data
->index
;
7353 if (BINFO_VIRTUAL_P (binfo
))
7355 /* It's a primary virtual base, and this is not a
7356 construction vtable. Find the base this is primary of in
7357 the inheritance graph, and use that base's vtable
7359 while (BINFO_PRIMARY_P (binfo
))
7360 binfo
= BINFO_INHERITANCE_CHAIN (binfo
);
7364 /* Add the initializer for the secondary vptr itself. */
7365 CONSTRUCTOR_APPEND_ELT (data
->inits
, NULL_TREE
, binfo_ctor_vtable (binfo
));
7367 /* Advance the vtt index. */
7368 data
->index
= size_binop (PLUS_EXPR
, data
->index
,
7369 TYPE_SIZE_UNIT (ptr_type_node
));
7374 /* Called from build_vtt_inits via dfs_walk. After building
7375 constructor vtables and generating the sub-vtt from them, we need
7376 to restore the BINFO_VTABLES that were scribbled on. DATA is the
7377 binfo of the base whose sub vtt was generated. */
7380 dfs_fixup_binfo_vtbls (tree binfo
, void* data
)
7382 tree vtable
= BINFO_VTABLE (binfo
);
7384 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
7385 /* If this class has no vtable, none of its bases do. */
7386 return dfs_skip_bases
;
7389 /* This might be a primary base, so have no vtable in this
7393 /* If we scribbled the construction vtable vptr into BINFO, clear it
7395 if (TREE_CODE (vtable
) == TREE_LIST
7396 && (TREE_PURPOSE (vtable
) == (tree
) data
))
7397 BINFO_VTABLE (binfo
) = TREE_CHAIN (vtable
);
7402 /* Build the construction vtable group for BINFO which is in the
7403 hierarchy dominated by T. */
7406 build_ctor_vtbl_group (tree binfo
, tree t
)
7412 VEC(constructor_elt
,gc
) *v
;
7414 /* See if we've already created this construction vtable group. */
7415 id
= mangle_ctor_vtbl_for_type (t
, binfo
);
7416 if (IDENTIFIER_GLOBAL_VALUE (id
))
7419 gcc_assert (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
));
7420 /* Build a version of VTBL (with the wrong type) for use in
7421 constructing the addresses of secondary vtables in the
7422 construction vtable group. */
7423 vtbl
= build_vtable (t
, id
, ptr_type_node
);
7424 DECL_CONSTRUCTION_VTABLE_P (vtbl
) = 1;
7427 accumulate_vtbl_inits (binfo
, TYPE_BINFO (TREE_TYPE (binfo
)),
7428 binfo
, vtbl
, t
, &v
);
7430 /* Add the vtables for each of our virtual bases using the vbase in T
7432 for (vbase
= TYPE_BINFO (BINFO_TYPE (binfo
));
7434 vbase
= TREE_CHAIN (vbase
))
7438 if (!BINFO_VIRTUAL_P (vbase
))
7440 b
= copied_binfo (vbase
, binfo
);
7442 accumulate_vtbl_inits (b
, vbase
, binfo
, vtbl
, t
, &v
);
7445 /* Figure out the type of the construction vtable. */
7446 type
= build_index_type (size_int (VEC_length (constructor_elt
, v
) - 1));
7447 type
= build_cplus_array_type (vtable_entry_type
, type
);
7449 TREE_TYPE (vtbl
) = type
;
7450 DECL_SIZE (vtbl
) = DECL_SIZE_UNIT (vtbl
) = NULL_TREE
;
7451 layout_decl (vtbl
, 0);
7453 /* Initialize the construction vtable. */
7454 CLASSTYPE_VTABLES (t
) = chainon (CLASSTYPE_VTABLES (t
), vtbl
);
7455 initialize_artificial_var (vtbl
, v
);
7456 dump_vtable (t
, binfo
, vtbl
);
7459 /* Add the vtbl initializers for BINFO (and its bases other than
7460 non-virtual primaries) to the list of INITS. BINFO is in the
7461 hierarchy dominated by T. RTTI_BINFO is the binfo within T of
7462 the constructor the vtbl inits should be accumulated for. (If this
7463 is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).)
7464 ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO).
7465 BINFO is the active base equivalent of ORIG_BINFO in the inheritance
7466 graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE,
7467 but are not necessarily the same in terms of layout. */
7470 accumulate_vtbl_inits (tree binfo
,
7475 VEC(constructor_elt
,gc
) **inits
)
7479 int ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
7481 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), BINFO_TYPE (orig_binfo
)));
7483 /* If it doesn't have a vptr, we don't do anything. */
7484 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
7487 /* If we're building a construction vtable, we're not interested in
7488 subobjects that don't require construction vtables. */
7490 && !CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
))
7491 && !binfo_via_virtual (orig_binfo
, BINFO_TYPE (rtti_binfo
)))
7494 /* Build the initializers for the BINFO-in-T vtable. */
7495 dfs_accumulate_vtbl_inits (binfo
, orig_binfo
, rtti_binfo
, vtbl
, t
, inits
);
7497 /* Walk the BINFO and its bases. We walk in preorder so that as we
7498 initialize each vtable we can figure out at what offset the
7499 secondary vtable lies from the primary vtable. We can't use
7500 dfs_walk here because we need to iterate through bases of BINFO
7501 and RTTI_BINFO simultaneously. */
7502 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
7504 /* Skip virtual bases. */
7505 if (BINFO_VIRTUAL_P (base_binfo
))
7507 accumulate_vtbl_inits (base_binfo
,
7508 BINFO_BASE_BINFO (orig_binfo
, i
),
7509 rtti_binfo
, vtbl
, t
,
7514 /* Called from accumulate_vtbl_inits. Adds the initializers for the
7515 BINFO vtable to L. */
7518 dfs_accumulate_vtbl_inits (tree binfo
,
7523 VEC(constructor_elt
,gc
) **l
)
7525 tree vtbl
= NULL_TREE
;
7526 int ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
7530 && BINFO_VIRTUAL_P (orig_binfo
) && BINFO_PRIMARY_P (orig_binfo
))
7532 /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a
7533 primary virtual base. If it is not the same primary in
7534 the hierarchy of T, we'll need to generate a ctor vtable
7535 for it, to place at its location in T. If it is the same
7536 primary, we still need a VTT entry for the vtable, but it
7537 should point to the ctor vtable for the base it is a
7538 primary for within the sub-hierarchy of RTTI_BINFO.
7540 There are three possible cases:
7542 1) We are in the same place.
7543 2) We are a primary base within a lost primary virtual base of
7545 3) We are primary to something not a base of RTTI_BINFO. */
7548 tree last
= NULL_TREE
;
7550 /* First, look through the bases we are primary to for RTTI_BINFO
7551 or a virtual base. */
7553 while (BINFO_PRIMARY_P (b
))
7555 b
= BINFO_INHERITANCE_CHAIN (b
);
7557 if (BINFO_VIRTUAL_P (b
) || b
== rtti_binfo
)
7560 /* If we run out of primary links, keep looking down our
7561 inheritance chain; we might be an indirect primary. */
7562 for (b
= last
; b
; b
= BINFO_INHERITANCE_CHAIN (b
))
7563 if (BINFO_VIRTUAL_P (b
) || b
== rtti_binfo
)
7567 /* If we found RTTI_BINFO, this is case 1. If we found a virtual
7568 base B and it is a base of RTTI_BINFO, this is case 2. In
7569 either case, we share our vtable with LAST, i.e. the
7570 derived-most base within B of which we are a primary. */
7572 || (b
&& binfo_for_vbase (BINFO_TYPE (b
), BINFO_TYPE (rtti_binfo
))))
7573 /* Just set our BINFO_VTABLE to point to LAST, as we may not have
7574 set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in
7575 binfo_ctor_vtable after everything's been set up. */
7578 /* Otherwise, this is case 3 and we get our own. */
7580 else if (!BINFO_NEW_VTABLE_MARKED (orig_binfo
))
7583 n_inits
= VEC_length (constructor_elt
, *l
);
7590 /* Add the initializer for this vtable. */
7591 build_vtbl_initializer (binfo
, orig_binfo
, t
, rtti_binfo
,
7592 &non_fn_entries
, l
);
7594 /* Figure out the position to which the VPTR should point. */
7595 vtbl
= build1 (ADDR_EXPR
, vtbl_ptr_type_node
, orig_vtbl
);
7596 index
= size_binop (PLUS_EXPR
,
7597 size_int (non_fn_entries
),
7598 size_int (n_inits
));
7599 index
= size_binop (MULT_EXPR
,
7600 TYPE_SIZE_UNIT (vtable_entry_type
),
7602 vtbl
= build2 (POINTER_PLUS_EXPR
, TREE_TYPE (vtbl
), vtbl
, index
);
7606 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
7607 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
7608 straighten this out. */
7609 BINFO_VTABLE (binfo
) = tree_cons (rtti_binfo
, vtbl
, BINFO_VTABLE (binfo
));
7610 else if (BINFO_PRIMARY_P (binfo
) && BINFO_VIRTUAL_P (binfo
))
7611 /* Throw away any unneeded intializers. */
7612 VEC_truncate (constructor_elt
, *l
, n_inits
);
7614 /* For an ordinary vtable, set BINFO_VTABLE. */
7615 BINFO_VTABLE (binfo
) = vtbl
;
7618 static GTY(()) tree abort_fndecl_addr
;
7620 /* Construct the initializer for BINFO's virtual function table. BINFO
7621 is part of the hierarchy dominated by T. If we're building a
7622 construction vtable, the ORIG_BINFO is the binfo we should use to
7623 find the actual function pointers to put in the vtable - but they
7624 can be overridden on the path to most-derived in the graph that
7625 ORIG_BINFO belongs. Otherwise,
7626 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
7627 BINFO that should be indicated by the RTTI information in the
7628 vtable; it will be a base class of T, rather than T itself, if we
7629 are building a construction vtable.
7631 The value returned is a TREE_LIST suitable for wrapping in a
7632 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
7633 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
7634 number of non-function entries in the vtable.
7636 It might seem that this function should never be called with a
7637 BINFO for which BINFO_PRIMARY_P holds, the vtable for such a
7638 base is always subsumed by a derived class vtable. However, when
7639 we are building construction vtables, we do build vtables for
7640 primary bases; we need these while the primary base is being
7644 build_vtbl_initializer (tree binfo
,
7648 int* non_fn_entries_p
,
7649 VEC(constructor_elt
,gc
) **inits
)
7655 VEC(tree
,gc
) *vbases
;
7658 /* Initialize VID. */
7659 memset (&vid
, 0, sizeof (vid
));
7662 vid
.rtti_binfo
= rtti_binfo
;
7663 vid
.primary_vtbl_p
= SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
);
7664 vid
.ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
7665 vid
.generate_vcall_entries
= true;
7666 /* The first vbase or vcall offset is at index -3 in the vtable. */
7667 vid
.index
= ssize_int(-3 * TARGET_VTABLE_DATA_ENTRY_DISTANCE
);
7669 /* Add entries to the vtable for RTTI. */
7670 build_rtti_vtbl_entries (binfo
, &vid
);
7672 /* Create an array for keeping track of the functions we've
7673 processed. When we see multiple functions with the same
7674 signature, we share the vcall offsets. */
7675 vid
.fns
= VEC_alloc (tree
, gc
, 32);
7676 /* Add the vcall and vbase offset entries. */
7677 build_vcall_and_vbase_vtbl_entries (binfo
, &vid
);
7679 /* Clear BINFO_VTABLE_PATH_MARKED; it's set by
7680 build_vbase_offset_vtbl_entries. */
7681 for (vbases
= CLASSTYPE_VBASECLASSES (t
), ix
= 0;
7682 VEC_iterate (tree
, vbases
, ix
, vbinfo
); ix
++)
7683 BINFO_VTABLE_PATH_MARKED (vbinfo
) = 0;
7685 /* If the target requires padding between data entries, add that now. */
7686 if (TARGET_VTABLE_DATA_ENTRY_DISTANCE
> 1)
7688 int n_entries
= VEC_length (constructor_elt
, vid
.inits
);
7690 VEC_safe_grow (constructor_elt
, gc
, vid
.inits
,
7691 TARGET_VTABLE_DATA_ENTRY_DISTANCE
* n_entries
);
7693 /* Move data entries into their new positions and add padding
7694 after the new positions. Iterate backwards so we don't
7695 overwrite entries that we would need to process later. */
7696 for (ix
= n_entries
- 1;
7697 VEC_iterate (constructor_elt
, vid
.inits
, ix
, e
);
7701 int new_position
= (TARGET_VTABLE_DATA_ENTRY_DISTANCE
* ix
7702 + (TARGET_VTABLE_DATA_ENTRY_DISTANCE
- 1));
7704 VEC_replace (constructor_elt
, vid
.inits
, new_position
, e
);
7706 for (j
= 1; j
< TARGET_VTABLE_DATA_ENTRY_DISTANCE
; ++j
)
7708 constructor_elt
*f
= VEC_index (constructor_elt
, vid
.inits
,
7710 f
->index
= NULL_TREE
;
7711 f
->value
= build1 (NOP_EXPR
, vtable_entry_type
,
7717 if (non_fn_entries_p
)
7718 *non_fn_entries_p
= VEC_length (constructor_elt
, vid
.inits
);
7720 /* The initializers for virtual functions were built up in reverse
7721 order. Straighten them out and add them to the running list in one
7723 jx
= VEC_length (constructor_elt
, *inits
);
7724 VEC_safe_grow (constructor_elt
, gc
, *inits
,
7725 (jx
+ VEC_length (constructor_elt
, vid
.inits
)));
7727 for (ix
= VEC_length (constructor_elt
, vid
.inits
) - 1;
7728 VEC_iterate (constructor_elt
, vid
.inits
, ix
, e
);
7730 VEC_replace (constructor_elt
, *inits
, jx
, e
);
7732 /* Go through all the ordinary virtual functions, building up
7734 for (v
= BINFO_VIRTUALS (orig_binfo
); v
; v
= TREE_CHAIN (v
))
7738 tree fn
, fn_original
;
7739 tree init
= NULL_TREE
;
7743 if (DECL_THUNK_P (fn
))
7745 if (!DECL_NAME (fn
))
7747 if (THUNK_ALIAS (fn
))
7749 fn
= THUNK_ALIAS (fn
);
7752 fn_original
= THUNK_TARGET (fn
);
7755 /* If the only definition of this function signature along our
7756 primary base chain is from a lost primary, this vtable slot will
7757 never be used, so just zero it out. This is important to avoid
7758 requiring extra thunks which cannot be generated with the function.
7760 We first check this in update_vtable_entry_for_fn, so we handle
7761 restored primary bases properly; we also need to do it here so we
7762 zero out unused slots in ctor vtables, rather than filling them
7763 with erroneous values (though harmless, apart from relocation
7765 for (b
= binfo
; ; b
= get_primary_binfo (b
))
7767 /* We found a defn before a lost primary; go ahead as normal. */
7768 if (look_for_overrides_here (BINFO_TYPE (b
), fn_original
))
7771 /* The nearest definition is from a lost primary; clear the
7773 if (BINFO_LOST_PRIMARY_P (b
))
7775 init
= size_zero_node
;
7782 /* Pull the offset for `this', and the function to call, out of
7784 delta
= BV_DELTA (v
);
7785 vcall_index
= BV_VCALL_INDEX (v
);
7787 gcc_assert (TREE_CODE (delta
) == INTEGER_CST
);
7788 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7790 /* You can't call an abstract virtual function; it's abstract.
7791 So, we replace these functions with __pure_virtual. */
7792 if (DECL_PURE_VIRTUAL_P (fn_original
))
7795 if (abort_fndecl_addr
== NULL
)
7796 abort_fndecl_addr
= build1 (ADDR_EXPR
, vfunc_ptr_type_node
, fn
);
7797 init
= abort_fndecl_addr
;
7801 if (!integer_zerop (delta
) || vcall_index
)
7803 fn
= make_thunk (fn
, /*this_adjusting=*/1, delta
, vcall_index
);
7804 if (!DECL_NAME (fn
))
7807 /* Take the address of the function, considering it to be of an
7808 appropriate generic type. */
7809 init
= build1 (ADDR_EXPR
, vfunc_ptr_type_node
, fn
);
7813 /* And add it to the chain of initializers. */
7814 if (TARGET_VTABLE_USES_DESCRIPTORS
)
7817 if (init
== size_zero_node
)
7818 for (i
= 0; i
< TARGET_VTABLE_USES_DESCRIPTORS
; ++i
)
7819 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
7821 for (i
= 0; i
< TARGET_VTABLE_USES_DESCRIPTORS
; ++i
)
7823 tree fdesc
= build2 (FDESC_EXPR
, vfunc_ptr_type_node
,
7824 TREE_OPERAND (init
, 0),
7825 build_int_cst (NULL_TREE
, i
));
7826 TREE_CONSTANT (fdesc
) = 1;
7828 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, fdesc
);
7832 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
7836 /* Adds to vid->inits the initializers for the vbase and vcall
7837 offsets in BINFO, which is in the hierarchy dominated by T. */
7840 build_vcall_and_vbase_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
7844 /* If this is a derived class, we must first create entries
7845 corresponding to the primary base class. */
7846 b
= get_primary_binfo (binfo
);
7848 build_vcall_and_vbase_vtbl_entries (b
, vid
);
7850 /* Add the vbase entries for this base. */
7851 build_vbase_offset_vtbl_entries (binfo
, vid
);
7852 /* Add the vcall entries for this base. */
7853 build_vcall_offset_vtbl_entries (binfo
, vid
);
7856 /* Returns the initializers for the vbase offset entries in the vtable
7857 for BINFO (which is part of the class hierarchy dominated by T), in
7858 reverse order. VBASE_OFFSET_INDEX gives the vtable index
7859 where the next vbase offset will go. */
7862 build_vbase_offset_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
7866 tree non_primary_binfo
;
7868 /* If there are no virtual baseclasses, then there is nothing to
7870 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
)))
7875 /* We might be a primary base class. Go up the inheritance hierarchy
7876 until we find the most derived class of which we are a primary base:
7877 it is the offset of that which we need to use. */
7878 non_primary_binfo
= binfo
;
7879 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo
))
7883 /* If we have reached a virtual base, then it must be a primary
7884 base (possibly multi-level) of vid->binfo, or we wouldn't
7885 have called build_vcall_and_vbase_vtbl_entries for it. But it
7886 might be a lost primary, so just skip down to vid->binfo. */
7887 if (BINFO_VIRTUAL_P (non_primary_binfo
))
7889 non_primary_binfo
= vid
->binfo
;
7893 b
= BINFO_INHERITANCE_CHAIN (non_primary_binfo
);
7894 if (get_primary_binfo (b
) != non_primary_binfo
)
7896 non_primary_binfo
= b
;
7899 /* Go through the virtual bases, adding the offsets. */
7900 for (vbase
= TYPE_BINFO (BINFO_TYPE (binfo
));
7902 vbase
= TREE_CHAIN (vbase
))
7907 if (!BINFO_VIRTUAL_P (vbase
))
7910 /* Find the instance of this virtual base in the complete
7912 b
= copied_binfo (vbase
, binfo
);
7914 /* If we've already got an offset for this virtual base, we
7915 don't need another one. */
7916 if (BINFO_VTABLE_PATH_MARKED (b
))
7918 BINFO_VTABLE_PATH_MARKED (b
) = 1;
7920 /* Figure out where we can find this vbase offset. */
7921 delta
= size_binop (MULT_EXPR
,
7924 TYPE_SIZE_UNIT (vtable_entry_type
)));
7925 if (vid
->primary_vtbl_p
)
7926 BINFO_VPTR_FIELD (b
) = delta
;
7928 if (binfo
!= TYPE_BINFO (t
))
7929 /* The vbase offset had better be the same. */
7930 gcc_assert (tree_int_cst_equal (delta
, BINFO_VPTR_FIELD (vbase
)));
7932 /* The next vbase will come at a more negative offset. */
7933 vid
->index
= size_binop (MINUS_EXPR
, vid
->index
,
7934 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE
));
7936 /* The initializer is the delta from BINFO to this virtual base.
7937 The vbase offsets go in reverse inheritance-graph order, and
7938 we are walking in inheritance graph order so these end up in
7940 delta
= size_diffop_loc (input_location
,
7941 BINFO_OFFSET (b
), BINFO_OFFSET (non_primary_binfo
));
7943 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
,
7944 fold_build1_loc (input_location
, NOP_EXPR
,
7945 vtable_entry_type
, delta
));
7949 /* Adds the initializers for the vcall offset entries in the vtable
7950 for BINFO (which is part of the class hierarchy dominated by VID->DERIVED)
7954 build_vcall_offset_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
7956 /* We only need these entries if this base is a virtual base. We
7957 compute the indices -- but do not add to the vtable -- when
7958 building the main vtable for a class. */
7959 if (binfo
== TYPE_BINFO (vid
->derived
)
7960 || (BINFO_VIRTUAL_P (binfo
)
7961 /* If BINFO is RTTI_BINFO, then (since BINFO does not
7962 correspond to VID->DERIVED), we are building a primary
7963 construction virtual table. Since this is a primary
7964 virtual table, we do not need the vcall offsets for
7966 && binfo
!= vid
->rtti_binfo
))
7968 /* We need a vcall offset for each of the virtual functions in this
7969 vtable. For example:
7971 class A { virtual void f (); };
7972 class B1 : virtual public A { virtual void f (); };
7973 class B2 : virtual public A { virtual void f (); };
7974 class C: public B1, public B2 { virtual void f (); };
7976 A C object has a primary base of B1, which has a primary base of A. A
7977 C also has a secondary base of B2, which no longer has a primary base
7978 of A. So the B2-in-C construction vtable needs a secondary vtable for
7979 A, which will adjust the A* to a B2* to call f. We have no way of
7980 knowing what (or even whether) this offset will be when we define B2,
7981 so we store this "vcall offset" in the A sub-vtable and look it up in
7982 a "virtual thunk" for B2::f.
7984 We need entries for all the functions in our primary vtable and
7985 in our non-virtual bases' secondary vtables. */
7987 /* If we are just computing the vcall indices -- but do not need
7988 the actual entries -- not that. */
7989 if (!BINFO_VIRTUAL_P (binfo
))
7990 vid
->generate_vcall_entries
= false;
7991 /* Now, walk through the non-virtual bases, adding vcall offsets. */
7992 add_vcall_offset_vtbl_entries_r (binfo
, vid
);
7996 /* Build vcall offsets, starting with those for BINFO. */
7999 add_vcall_offset_vtbl_entries_r (tree binfo
, vtbl_init_data
* vid
)
8005 /* Don't walk into virtual bases -- except, of course, for the
8006 virtual base for which we are building vcall offsets. Any
8007 primary virtual base will have already had its offsets generated
8008 through the recursion in build_vcall_and_vbase_vtbl_entries. */
8009 if (BINFO_VIRTUAL_P (binfo
) && vid
->vbase
!= binfo
)
8012 /* If BINFO has a primary base, process it first. */
8013 primary_binfo
= get_primary_binfo (binfo
);
8015 add_vcall_offset_vtbl_entries_r (primary_binfo
, vid
);
8017 /* Add BINFO itself to the list. */
8018 add_vcall_offset_vtbl_entries_1 (binfo
, vid
);
8020 /* Scan the non-primary bases of BINFO. */
8021 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
8022 if (base_binfo
!= primary_binfo
)
8023 add_vcall_offset_vtbl_entries_r (base_binfo
, vid
);
8026 /* Called from build_vcall_offset_vtbl_entries_r. */
8029 add_vcall_offset_vtbl_entries_1 (tree binfo
, vtbl_init_data
* vid
)
8031 /* Make entries for the rest of the virtuals. */
8032 if (abi_version_at_least (2))
8036 /* The ABI requires that the methods be processed in declaration
8037 order. G++ 3.2 used the order in the vtable. */
8038 for (orig_fn
= TYPE_METHODS (BINFO_TYPE (binfo
));
8040 orig_fn
= TREE_CHAIN (orig_fn
))
8041 if (DECL_VINDEX (orig_fn
))
8042 add_vcall_offset (orig_fn
, binfo
, vid
);
8046 tree derived_virtuals
;
8049 /* If BINFO is a primary base, the most derived class which has
8050 BINFO as a primary base; otherwise, just BINFO. */
8051 tree non_primary_binfo
;
8053 /* We might be a primary base class. Go up the inheritance hierarchy
8054 until we find the most derived class of which we are a primary base:
8055 it is the BINFO_VIRTUALS there that we need to consider. */
8056 non_primary_binfo
= binfo
;
8057 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo
))
8061 /* If we have reached a virtual base, then it must be vid->vbase,
8062 because we ignore other virtual bases in
8063 add_vcall_offset_vtbl_entries_r. In turn, it must be a primary
8064 base (possibly multi-level) of vid->binfo, or we wouldn't
8065 have called build_vcall_and_vbase_vtbl_entries for it. But it
8066 might be a lost primary, so just skip down to vid->binfo. */
8067 if (BINFO_VIRTUAL_P (non_primary_binfo
))
8069 gcc_assert (non_primary_binfo
== vid
->vbase
);
8070 non_primary_binfo
= vid
->binfo
;
8074 b
= BINFO_INHERITANCE_CHAIN (non_primary_binfo
);
8075 if (get_primary_binfo (b
) != non_primary_binfo
)
8077 non_primary_binfo
= b
;
8080 if (vid
->ctor_vtbl_p
)
8081 /* For a ctor vtable we need the equivalent binfo within the hierarchy
8082 where rtti_binfo is the most derived type. */
8084 = original_binfo (non_primary_binfo
, vid
->rtti_binfo
);
8086 for (base_virtuals
= BINFO_VIRTUALS (binfo
),
8087 derived_virtuals
= BINFO_VIRTUALS (non_primary_binfo
),
8088 orig_virtuals
= BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo
)));
8090 base_virtuals
= TREE_CHAIN (base_virtuals
),
8091 derived_virtuals
= TREE_CHAIN (derived_virtuals
),
8092 orig_virtuals
= TREE_CHAIN (orig_virtuals
))
8096 /* Find the declaration that originally caused this function to
8097 be present in BINFO_TYPE (binfo). */
8098 orig_fn
= BV_FN (orig_virtuals
);
8100 /* When processing BINFO, we only want to generate vcall slots for
8101 function slots introduced in BINFO. So don't try to generate
8102 one if the function isn't even defined in BINFO. */
8103 if (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), DECL_CONTEXT (orig_fn
)))
8106 add_vcall_offset (orig_fn
, binfo
, vid
);
8111 /* Add a vcall offset entry for ORIG_FN to the vtable. */
8114 add_vcall_offset (tree orig_fn
, tree binfo
, vtbl_init_data
*vid
)
8120 /* If there is already an entry for a function with the same
8121 signature as FN, then we do not need a second vcall offset.
8122 Check the list of functions already present in the derived
8124 for (i
= 0; VEC_iterate (tree
, vid
->fns
, i
, derived_entry
); ++i
)
8126 if (same_signature_p (derived_entry
, orig_fn
)
8127 /* We only use one vcall offset for virtual destructors,
8128 even though there are two virtual table entries. */
8129 || (DECL_DESTRUCTOR_P (derived_entry
)
8130 && DECL_DESTRUCTOR_P (orig_fn
)))
8134 /* If we are building these vcall offsets as part of building
8135 the vtable for the most derived class, remember the vcall
8137 if (vid
->binfo
== TYPE_BINFO (vid
->derived
))
8139 tree_pair_p elt
= VEC_safe_push (tree_pair_s
, gc
,
8140 CLASSTYPE_VCALL_INDICES (vid
->derived
),
8142 elt
->purpose
= orig_fn
;
8143 elt
->value
= vid
->index
;
8146 /* The next vcall offset will be found at a more negative
8148 vid
->index
= size_binop (MINUS_EXPR
, vid
->index
,
8149 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE
));
8151 /* Keep track of this function. */
8152 VEC_safe_push (tree
, gc
, vid
->fns
, orig_fn
);
8154 if (vid
->generate_vcall_entries
)
8159 /* Find the overriding function. */
8160 fn
= find_final_overrider (vid
->rtti_binfo
, binfo
, orig_fn
);
8161 if (fn
== error_mark_node
)
8162 vcall_offset
= build1 (NOP_EXPR
, vtable_entry_type
,
8166 base
= TREE_VALUE (fn
);
8168 /* The vbase we're working on is a primary base of
8169 vid->binfo. But it might be a lost primary, so its
8170 BINFO_OFFSET might be wrong, so we just use the
8171 BINFO_OFFSET from vid->binfo. */
8172 vcall_offset
= size_diffop_loc (input_location
,
8173 BINFO_OFFSET (base
),
8174 BINFO_OFFSET (vid
->binfo
));
8175 vcall_offset
= fold_build1_loc (input_location
,
8176 NOP_EXPR
, vtable_entry_type
,
8179 /* Add the initializer to the vtable. */
8180 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, vcall_offset
);
8184 /* Return vtbl initializers for the RTTI entries corresponding to the
8185 BINFO's vtable. The RTTI entries should indicate the object given
8186 by VID->rtti_binfo. */
8189 build_rtti_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
8197 t
= BINFO_TYPE (vid
->rtti_binfo
);
8199 /* To find the complete object, we will first convert to our most
8200 primary base, and then add the offset in the vtbl to that value. */
8202 while (CLASSTYPE_HAS_PRIMARY_BASE_P (BINFO_TYPE (b
))
8203 && !BINFO_LOST_PRIMARY_P (b
))
8207 primary_base
= get_primary_binfo (b
);
8208 gcc_assert (BINFO_PRIMARY_P (primary_base
)
8209 && BINFO_INHERITANCE_CHAIN (primary_base
) == b
);
8212 offset
= size_diffop_loc (input_location
,
8213 BINFO_OFFSET (vid
->rtti_binfo
), BINFO_OFFSET (b
));
8215 /* The second entry is the address of the typeinfo object. */
8217 decl
= build_address (get_tinfo_decl (t
));
8219 decl
= integer_zero_node
;
8221 /* Convert the declaration to a type that can be stored in the
8223 init
= build_nop (vfunc_ptr_type_node
, decl
);
8224 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, init
);
8226 /* Add the offset-to-top entry. It comes earlier in the vtable than
8227 the typeinfo entry. Convert the offset to look like a
8228 function pointer, so that we can put it in the vtable. */
8229 init
= build_nop (vfunc_ptr_type_node
, offset
);
8230 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, init
);
8233 /* Fold a OBJ_TYPE_REF expression to the address of a function.
8234 KNOWN_TYPE carries the true type of OBJ_TYPE_REF_OBJECT(REF). */
8237 cp_fold_obj_type_ref (tree ref
, tree known_type
)
8239 HOST_WIDE_INT index
= tree_low_cst (OBJ_TYPE_REF_TOKEN (ref
), 1);
8240 HOST_WIDE_INT i
= 0;
8241 tree v
= BINFO_VIRTUALS (TYPE_BINFO (known_type
));
8246 i
+= (TARGET_VTABLE_USES_DESCRIPTORS
8247 ? TARGET_VTABLE_USES_DESCRIPTORS
: 1);
8253 #ifdef ENABLE_CHECKING
8254 gcc_assert (tree_int_cst_equal (OBJ_TYPE_REF_TOKEN (ref
),
8255 DECL_VINDEX (fndecl
)));
8258 cgraph_node (fndecl
)->local
.vtable_method
= true;
8260 return build_address (fndecl
);
8263 #include "gt-cp-class.h"