1 /* Language-dependent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2017 Free Software Foundation, Inc.
3 Hacked by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
23 #include "coretypes.h"
26 #include "gimple-expr.h"
28 #include "stor-layout.h"
29 #include "print-tree.h"
30 #include "tree-iterator.h"
31 #include "tree-inline.h"
38 static tree
bot_manip (tree
*, int *, void *);
39 static tree
bot_replace (tree
*, int *, void *);
40 static hashval_t
list_hash_pieces (tree
, tree
, tree
);
41 static tree
build_target_expr (tree
, tree
, tsubst_flags_t
);
42 static tree
count_trees_r (tree
*, int *, void *);
43 static tree
verify_stmt_tree_r (tree
*, int *, void *);
44 static tree
build_local_temp (tree
);
46 static tree
handle_init_priority_attribute (tree
*, tree
, tree
, int, bool *);
47 static tree
handle_abi_tag_attribute (tree
*, tree
, tree
, int, bool *);
49 /* If REF is an lvalue, returns the kind of lvalue that REF is.
50 Otherwise, returns clk_none. */
53 lvalue_kind (const_tree ref
)
55 cp_lvalue_kind op1_lvalue_kind
= clk_none
;
56 cp_lvalue_kind op2_lvalue_kind
= clk_none
;
58 /* Expressions of reference type are sometimes wrapped in
59 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
60 representation, not part of the language, so we have to look
62 if (REFERENCE_REF_P (ref
))
63 return lvalue_kind (TREE_OPERAND (ref
, 0));
66 && TREE_CODE (TREE_TYPE (ref
)) == REFERENCE_TYPE
)
68 /* unnamed rvalue references are rvalues */
69 if (TYPE_REF_IS_RVALUE (TREE_TYPE (ref
))
70 && TREE_CODE (ref
) != PARM_DECL
72 && TREE_CODE (ref
) != COMPONENT_REF
73 /* Functions are always lvalues. */
74 && TREE_CODE (TREE_TYPE (TREE_TYPE (ref
))) != FUNCTION_TYPE
)
77 /* lvalue references and named rvalue references are lvalues. */
81 if (ref
== current_class_ptr
)
84 switch (TREE_CODE (ref
))
88 /* preincrements and predecrements are valid lvals, provided
89 what they refer to are valid lvals. */
90 case PREINCREMENT_EXPR
:
91 case PREDECREMENT_EXPR
:
93 case WITH_CLEANUP_EXPR
:
96 return lvalue_kind (TREE_OPERAND (ref
, 0));
100 if (TREE_CODE (ref
) == MEMBER_REF
)
101 op1_lvalue_kind
= clk_ordinary
;
103 op1_lvalue_kind
= lvalue_kind (TREE_OPERAND (ref
, 0));
104 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (ref
, 1))))
105 op1_lvalue_kind
= clk_none
;
106 return op1_lvalue_kind
;
109 if (BASELINK_P (TREE_OPERAND (ref
, 1)))
111 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (ref
, 1));
113 /* For static member function recurse on the BASELINK, we can get
114 here e.g. from reference_binding. If BASELINK_FUNCTIONS is
115 OVERLOAD, the overload is resolved first if possible through
116 resolve_address_of_overloaded_function. */
117 if (TREE_CODE (fn
) == FUNCTION_DECL
&& DECL_STATIC_FUNCTION_P (fn
))
118 return lvalue_kind (TREE_OPERAND (ref
, 1));
120 op1_lvalue_kind
= lvalue_kind (TREE_OPERAND (ref
, 0));
121 /* Look at the member designator. */
122 if (!op1_lvalue_kind
)
124 else if (is_overloaded_fn (TREE_OPERAND (ref
, 1)))
125 /* The "field" can be a FUNCTION_DECL or an OVERLOAD in some
126 situations. If we're seeing a COMPONENT_REF, it's a non-static
127 member, so it isn't an lvalue. */
128 op1_lvalue_kind
= clk_none
;
129 else if (TREE_CODE (TREE_OPERAND (ref
, 1)) != FIELD_DECL
)
130 /* This can be IDENTIFIER_NODE in a template. */;
131 else if (DECL_C_BIT_FIELD (TREE_OPERAND (ref
, 1)))
133 /* Clear the ordinary bit. If this object was a class
134 rvalue we want to preserve that information. */
135 op1_lvalue_kind
&= ~clk_ordinary
;
136 /* The lvalue is for a bitfield. */
137 op1_lvalue_kind
|= clk_bitfield
;
139 else if (DECL_PACKED (TREE_OPERAND (ref
, 1)))
140 op1_lvalue_kind
|= clk_packed
;
142 return op1_lvalue_kind
;
145 case COMPOUND_LITERAL_EXPR
:
149 /* CONST_DECL without TREE_STATIC are enumeration values and
150 thus not lvalues. With TREE_STATIC they are used by ObjC++
151 in objc_build_string_object and need to be considered as
153 if (! TREE_STATIC (ref
))
157 if (VAR_P (ref
) && DECL_HAS_VALUE_EXPR_P (ref
))
158 return lvalue_kind (DECL_VALUE_EXPR (CONST_CAST_TREE (ref
)));
160 if (TREE_READONLY (ref
) && ! TREE_STATIC (ref
)
161 && DECL_LANG_SPECIFIC (ref
)
162 && DECL_IN_AGGR_P (ref
))
168 case ARRAY_NOTATION_REF
:
171 case PLACEHOLDER_EXPR
:
174 /* A scope ref in a template, left as SCOPE_REF to support later
177 gcc_assert (!type_dependent_expression_p (CONST_CAST_TREE (ref
)));
179 tree op
= TREE_OPERAND (ref
, 1);
180 if (TREE_CODE (op
) == FIELD_DECL
)
181 return (DECL_C_BIT_FIELD (op
) ? clk_bitfield
: clk_ordinary
);
183 return lvalue_kind (op
);
188 /* Disallow <? and >? as lvalues if either argument side-effects. */
189 if (TREE_SIDE_EFFECTS (TREE_OPERAND (ref
, 0))
190 || TREE_SIDE_EFFECTS (TREE_OPERAND (ref
, 1)))
192 op1_lvalue_kind
= lvalue_kind (TREE_OPERAND (ref
, 0));
193 op2_lvalue_kind
= lvalue_kind (TREE_OPERAND (ref
, 1));
197 op1_lvalue_kind
= lvalue_kind (TREE_OPERAND (ref
, 1)
198 ? TREE_OPERAND (ref
, 1)
199 : TREE_OPERAND (ref
, 0));
200 op2_lvalue_kind
= lvalue_kind (TREE_OPERAND (ref
, 2));
204 /* We expect to see unlowered MODOP_EXPRs only during
205 template processing. */
206 gcc_assert (processing_template_decl
);
214 return lvalue_kind (TREE_OPERAND (ref
, 1));
220 return (CLASS_TYPE_P (TREE_TYPE (ref
)) ? clk_class
: clk_none
);
223 /* We can see calls outside of TARGET_EXPR in templates. */
224 if (CLASS_TYPE_P (TREE_TYPE (ref
)))
229 /* All functions (except non-static-member functions) are
231 return (DECL_NONSTATIC_MEMBER_FUNCTION_P (ref
)
232 ? clk_none
: clk_ordinary
);
235 /* We now represent a reference to a single static member function
237 /* This CONST_CAST is okay because BASELINK_FUNCTIONS returns
238 its argument unmodified and we assign it to a const_tree. */
239 return lvalue_kind (BASELINK_FUNCTIONS (CONST_CAST_TREE (ref
)));
241 case NON_DEPENDENT_EXPR
:
242 return lvalue_kind (TREE_OPERAND (ref
, 0));
245 if (!TREE_TYPE (ref
))
247 if (CLASS_TYPE_P (TREE_TYPE (ref
))
248 || TREE_CODE (TREE_TYPE (ref
)) == ARRAY_TYPE
)
253 /* If one operand is not an lvalue at all, then this expression is
255 if (!op1_lvalue_kind
|| !op2_lvalue_kind
)
258 /* Otherwise, it's an lvalue, and it has all the odd properties
259 contributed by either operand. */
260 op1_lvalue_kind
= op1_lvalue_kind
| op2_lvalue_kind
;
261 /* It's not an ordinary lvalue if it involves any other kind. */
262 if ((op1_lvalue_kind
& ~clk_ordinary
) != clk_none
)
263 op1_lvalue_kind
&= ~clk_ordinary
;
264 /* It can't be both a pseudo-lvalue and a non-addressable lvalue.
265 A COND_EXPR of those should be wrapped in a TARGET_EXPR. */
266 if ((op1_lvalue_kind
& (clk_rvalueref
|clk_class
))
267 && (op1_lvalue_kind
& (clk_bitfield
|clk_packed
)))
268 op1_lvalue_kind
= clk_none
;
269 return op1_lvalue_kind
;
272 /* Returns the kind of lvalue that REF is, in the sense of [basic.lval]. */
275 real_lvalue_p (const_tree ref
)
277 cp_lvalue_kind kind
= lvalue_kind (ref
);
278 if (kind
& (clk_rvalueref
|clk_class
))
284 /* c-common wants us to return bool. */
287 lvalue_p (const_tree t
)
289 return real_lvalue_p (t
);
292 /* This differs from lvalue_p in that xvalues are included. */
295 glvalue_p (const_tree ref
)
297 cp_lvalue_kind kind
= lvalue_kind (ref
);
298 if (kind
& clk_class
)
301 return (kind
!= clk_none
);
304 /* This differs from glvalue_p in that class prvalues are included. */
307 obvalue_p (const_tree ref
)
309 return (lvalue_kind (ref
) != clk_none
);
312 /* Returns true if REF is an xvalue (the result of dereferencing an rvalue
313 reference), false otherwise. */
316 xvalue_p (const_tree ref
)
318 return (lvalue_kind (ref
) == clk_rvalueref
);
321 /* True if REF is a bit-field. */
324 bitfield_p (const_tree ref
)
326 return (lvalue_kind (ref
) & clk_bitfield
);
329 /* C++-specific version of stabilize_reference. */
332 cp_stabilize_reference (tree ref
)
334 switch (TREE_CODE (ref
))
336 /* We need to treat specially anything stabilize_reference doesn't
337 handle specifically. */
348 case ARRAY_RANGE_REF
:
352 cp_lvalue_kind kind
= lvalue_kind (ref
);
353 if ((kind
& ~clk_class
) != clk_none
)
355 tree type
= unlowered_expr_type (ref
);
356 bool rval
= !!(kind
& clk_rvalueref
);
357 type
= cp_build_reference_type (type
, rval
);
358 /* This inhibits warnings in, eg, cxx_mark_addressable
360 warning_sentinel
s (extra_warnings
);
361 ref
= build_static_cast (type
, ref
, tf_error
);
365 return stabilize_reference (ref
);
368 /* Test whether DECL is a builtin that may appear in a
369 constant-expression. */
372 builtin_valid_in_constant_expr_p (const_tree decl
)
374 if (!(TREE_CODE (decl
) == FUNCTION_DECL
375 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
))
376 /* Not a built-in. */
378 switch (DECL_FUNCTION_CODE (decl
))
380 /* These always have constant results like the corresponding
383 case BUILT_IN_FUNCTION
:
386 /* The following built-ins are valid in constant expressions
387 when their arguments are. */
388 case BUILT_IN_ADD_OVERFLOW_P
:
389 case BUILT_IN_SUB_OVERFLOW_P
:
390 case BUILT_IN_MUL_OVERFLOW_P
:
392 /* These have constant results even if their operands are
394 case BUILT_IN_CONSTANT_P
:
395 case BUILT_IN_ATOMIC_ALWAYS_LOCK_FREE
:
402 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
405 build_target_expr (tree decl
, tree value
, tsubst_flags_t complain
)
408 tree type
= TREE_TYPE (decl
);
410 value
= mark_rvalue_use (value
);
412 gcc_checking_assert (VOID_TYPE_P (TREE_TYPE (value
))
413 || TREE_TYPE (decl
) == TREE_TYPE (value
)
414 /* On ARM ctors return 'this'. */
415 || (TYPE_PTR_P (TREE_TYPE (value
))
416 && TREE_CODE (value
) == CALL_EXPR
)
417 || useless_type_conversion_p (TREE_TYPE (decl
),
420 if (complain
& tf_no_cleanup
)
421 /* The caller is building a new-expr and does not need a cleanup. */
425 t
= cxx_maybe_build_cleanup (decl
, complain
);
426 if (t
== error_mark_node
)
427 return error_mark_node
;
429 t
= build4 (TARGET_EXPR
, type
, decl
, value
, t
, NULL_TREE
);
430 if (EXPR_HAS_LOCATION (value
))
431 SET_EXPR_LOCATION (t
, EXPR_LOCATION (value
));
432 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
433 ignore the TARGET_EXPR. If there really turn out to be no
434 side-effects, then the optimizer should be able to get rid of
435 whatever code is generated anyhow. */
436 TREE_SIDE_EFFECTS (t
) = 1;
441 /* Return an undeclared local temporary of type TYPE for use in building a
445 build_local_temp (tree type
)
447 tree slot
= build_decl (input_location
,
448 VAR_DECL
, NULL_TREE
, type
);
449 DECL_ARTIFICIAL (slot
) = 1;
450 DECL_IGNORED_P (slot
) = 1;
451 DECL_CONTEXT (slot
) = current_function_decl
;
452 layout_decl (slot
, 0);
456 /* Set various status flags when building an AGGR_INIT_EXPR object T. */
459 process_aggr_init_operands (tree t
)
463 side_effects
= TREE_SIDE_EFFECTS (t
);
467 n
= TREE_OPERAND_LENGTH (t
);
468 for (i
= 1; i
< n
; i
++)
470 tree op
= TREE_OPERAND (t
, i
);
471 if (op
&& TREE_SIDE_EFFECTS (op
))
478 TREE_SIDE_EFFECTS (t
) = side_effects
;
481 /* Build an AGGR_INIT_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE,
482 FN, and SLOT. NARGS is the number of call arguments which are specified
483 as a tree array ARGS. */
486 build_aggr_init_array (tree return_type
, tree fn
, tree slot
, int nargs
,
492 t
= build_vl_exp (AGGR_INIT_EXPR
, nargs
+ 3);
493 TREE_TYPE (t
) = return_type
;
494 AGGR_INIT_EXPR_FN (t
) = fn
;
495 AGGR_INIT_EXPR_SLOT (t
) = slot
;
496 for (i
= 0; i
< nargs
; i
++)
497 AGGR_INIT_EXPR_ARG (t
, i
) = args
[i
];
498 process_aggr_init_operands (t
);
502 /* INIT is a CALL_EXPR or AGGR_INIT_EXPR which needs info about its
503 target. TYPE is the type to be initialized.
505 Build an AGGR_INIT_EXPR to represent the initialization. This function
506 differs from build_cplus_new in that an AGGR_INIT_EXPR can only be used
507 to initialize another object, whereas a TARGET_EXPR can either
508 initialize another object or create its own temporary object, and as a
509 result building up a TARGET_EXPR requires that the type's destructor be
513 build_aggr_init_expr (tree type
, tree init
)
520 /* Don't build AGGR_INIT_EXPR in a template. */
521 if (processing_template_decl
)
524 fn
= cp_get_callee (init
);
526 return convert (type
, init
);
528 is_ctor
= (TREE_CODE (fn
) == ADDR_EXPR
529 && TREE_CODE (TREE_OPERAND (fn
, 0)) == FUNCTION_DECL
530 && DECL_CONSTRUCTOR_P (TREE_OPERAND (fn
, 0)));
532 /* We split the CALL_EXPR into its function and its arguments here.
533 Then, in expand_expr, we put them back together. The reason for
534 this is that this expression might be a default argument
535 expression. In that case, we need a new temporary every time the
536 expression is used. That's what break_out_target_exprs does; it
537 replaces every AGGR_INIT_EXPR with a copy that uses a fresh
538 temporary slot. Then, expand_expr builds up a call-expression
539 using the new slot. */
541 /* If we don't need to use a constructor to create an object of this
542 type, don't mess with AGGR_INIT_EXPR. */
543 if (is_ctor
|| TREE_ADDRESSABLE (type
))
545 slot
= build_local_temp (type
);
547 if (TREE_CODE (init
) == CALL_EXPR
)
549 rval
= build_aggr_init_array (void_type_node
, fn
, slot
,
550 call_expr_nargs (init
),
551 CALL_EXPR_ARGP (init
));
552 AGGR_INIT_FROM_THUNK_P (rval
)
553 = CALL_FROM_THUNK_P (init
);
557 rval
= build_aggr_init_array (void_type_node
, fn
, slot
,
558 aggr_init_expr_nargs (init
),
559 AGGR_INIT_EXPR_ARGP (init
));
560 AGGR_INIT_FROM_THUNK_P (rval
)
561 = AGGR_INIT_FROM_THUNK_P (init
);
563 TREE_SIDE_EFFECTS (rval
) = 1;
564 AGGR_INIT_VIA_CTOR_P (rval
) = is_ctor
;
565 TREE_NOTHROW (rval
) = TREE_NOTHROW (init
);
566 CALL_EXPR_OPERATOR_SYNTAX (rval
) = CALL_EXPR_OPERATOR_SYNTAX (init
);
567 CALL_EXPR_ORDERED_ARGS (rval
) = CALL_EXPR_ORDERED_ARGS (init
);
568 CALL_EXPR_REVERSE_ARGS (rval
) = CALL_EXPR_REVERSE_ARGS (init
);
576 /* INIT is a CALL_EXPR or AGGR_INIT_EXPR which needs info about its
577 target. TYPE is the type that this initialization should appear to
580 Build an encapsulation of the initialization to perform
581 and return it so that it can be processed by language-independent
582 and language-specific expression expanders. */
585 build_cplus_new (tree type
, tree init
, tsubst_flags_t complain
)
587 tree rval
= build_aggr_init_expr (type
, init
);
590 if (!complete_type_or_maybe_complain (type
, init
, complain
))
591 return error_mark_node
;
593 /* Make sure that we're not trying to create an instance of an
595 if (abstract_virtuals_error_sfinae (NULL_TREE
, type
, complain
))
596 return error_mark_node
;
598 if (TREE_CODE (rval
) == AGGR_INIT_EXPR
)
599 slot
= AGGR_INIT_EXPR_SLOT (rval
);
600 else if (TREE_CODE (rval
) == CALL_EXPR
601 || TREE_CODE (rval
) == CONSTRUCTOR
)
602 slot
= build_local_temp (type
);
606 rval
= build_target_expr (slot
, rval
, complain
);
608 if (rval
!= error_mark_node
)
609 TARGET_EXPR_IMPLICIT_P (rval
) = 1;
614 /* Subroutine of build_vec_init_expr: Build up a single element
615 intialization as a proxy for the full array initialization to get things
616 marked as used and any appropriate diagnostics.
618 Since we're deferring building the actual constructor calls until
619 gimplification time, we need to build one now and throw it away so
620 that the relevant constructor gets mark_used before cgraph decides
621 what functions are needed. Here we assume that init is either
622 NULL_TREE, void_type_node (indicating value-initialization), or
623 another array to copy. */
626 build_vec_init_elt (tree type
, tree init
, tsubst_flags_t complain
)
628 tree inner_type
= strip_array_types (type
);
629 vec
<tree
, va_gc
> *argvec
;
631 if (integer_zerop (array_type_nelts_total (type
))
632 || !CLASS_TYPE_P (inner_type
))
633 /* No interesting initialization to do. */
634 return integer_zero_node
;
635 else if (init
== void_type_node
)
636 return build_value_init (inner_type
, complain
);
638 gcc_assert (init
== NULL_TREE
639 || (same_type_ignoring_top_level_qualifiers_p
640 (type
, TREE_TYPE (init
))));
642 argvec
= make_tree_vector ();
645 tree init_type
= strip_array_types (TREE_TYPE (init
));
646 tree dummy
= build_dummy_object (init_type
);
647 if (!lvalue_p (init
))
648 dummy
= move (dummy
);
649 argvec
->quick_push (dummy
);
651 init
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
652 &argvec
, inner_type
, LOOKUP_NORMAL
,
654 release_tree_vector (argvec
);
656 /* For a trivial constructor, build_over_call creates a TARGET_EXPR. But
657 we don't want one here because we aren't creating a temporary. */
658 if (TREE_CODE (init
) == TARGET_EXPR
)
659 init
= TARGET_EXPR_INITIAL (init
);
664 /* Return a TARGET_EXPR which expresses the initialization of an array to
665 be named later, either default-initialization or copy-initialization
666 from another array of the same type. */
669 build_vec_init_expr (tree type
, tree init
, tsubst_flags_t complain
)
672 bool value_init
= false;
673 tree elt_init
= build_vec_init_elt (type
, init
, complain
);
675 if (init
== void_type_node
)
681 slot
= build_local_temp (type
);
682 init
= build2 (VEC_INIT_EXPR
, type
, slot
, init
);
683 TREE_SIDE_EFFECTS (init
) = true;
684 SET_EXPR_LOCATION (init
, input_location
);
686 if (cxx_dialect
>= cxx11
687 && potential_constant_expression (elt_init
))
688 VEC_INIT_EXPR_IS_CONSTEXPR (init
) = true;
689 VEC_INIT_EXPR_VALUE_INIT (init
) = value_init
;
694 /* Give a helpful diagnostic for a non-constexpr VEC_INIT_EXPR in a context
695 that requires a constant expression. */
698 diagnose_non_constexpr_vec_init (tree expr
)
700 tree type
= TREE_TYPE (VEC_INIT_EXPR_SLOT (expr
));
702 if (VEC_INIT_EXPR_VALUE_INIT (expr
))
703 init
= void_type_node
;
705 init
= VEC_INIT_EXPR_INIT (expr
);
707 elt_init
= build_vec_init_elt (type
, init
, tf_warning_or_error
);
708 require_potential_constant_expression (elt_init
);
712 build_array_copy (tree init
)
714 return build_vec_init_expr (TREE_TYPE (init
), init
, tf_warning_or_error
);
717 /* Build a TARGET_EXPR using INIT to initialize a new temporary of the
721 build_target_expr_with_type (tree init
, tree type
, tsubst_flags_t complain
)
723 gcc_assert (!VOID_TYPE_P (type
));
725 if (TREE_CODE (init
) == TARGET_EXPR
726 || init
== error_mark_node
)
728 else if (CLASS_TYPE_P (type
) && type_has_nontrivial_copy_init (type
)
729 && !VOID_TYPE_P (TREE_TYPE (init
))
730 && TREE_CODE (init
) != COND_EXPR
731 && TREE_CODE (init
) != CONSTRUCTOR
732 && TREE_CODE (init
) != VA_ARG_EXPR
)
733 /* We need to build up a copy constructor call. A void initializer
734 means we're being called from bot_manip. COND_EXPR is a special
735 case because we already have copies on the arms and we don't want
736 another one here. A CONSTRUCTOR is aggregate initialization, which
737 is handled separately. A VA_ARG_EXPR is magic creation of an
738 aggregate; there's no additional work to be done. */
739 return force_rvalue (init
, complain
);
741 return force_target_expr (type
, init
, complain
);
744 /* Like the above function, but without the checking. This function should
745 only be used by code which is deliberately trying to subvert the type
746 system, such as call_builtin_trap. Or build_over_call, to avoid
747 infinite recursion. */
750 force_target_expr (tree type
, tree init
, tsubst_flags_t complain
)
754 gcc_assert (!VOID_TYPE_P (type
));
756 slot
= build_local_temp (type
);
757 return build_target_expr (slot
, init
, complain
);
760 /* Like build_target_expr_with_type, but use the type of INIT. */
763 get_target_expr_sfinae (tree init
, tsubst_flags_t complain
)
765 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
766 return build_target_expr (AGGR_INIT_EXPR_SLOT (init
), init
, complain
);
767 else if (TREE_CODE (init
) == VEC_INIT_EXPR
)
768 return build_target_expr (VEC_INIT_EXPR_SLOT (init
), init
, complain
);
771 init
= convert_bitfield_to_declared_type (init
);
772 return build_target_expr_with_type (init
, TREE_TYPE (init
), complain
);
777 get_target_expr (tree init
)
779 return get_target_expr_sfinae (init
, tf_warning_or_error
);
782 /* If EXPR is a bitfield reference, convert it to the declared type of
783 the bitfield, and return the resulting expression. Otherwise,
784 return EXPR itself. */
787 convert_bitfield_to_declared_type (tree expr
)
791 bitfield_type
= is_bitfield_expr_with_lowered_type (expr
);
793 expr
= convert_to_integer_nofold (TYPE_MAIN_VARIANT (bitfield_type
),
798 /* EXPR is being used in an rvalue context. Return a version of EXPR
799 that is marked as an rvalue. */
806 if (error_operand_p (expr
))
809 expr
= mark_rvalue_use (expr
);
813 Non-class rvalues always have cv-unqualified types. */
814 type
= TREE_TYPE (expr
);
815 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
816 type
= cv_unqualified (type
);
818 /* We need to do this for rvalue refs as well to get the right answer
819 from decltype; see c++/36628. */
820 if (!processing_template_decl
&& glvalue_p (expr
))
821 expr
= build1 (NON_LVALUE_EXPR
, type
, expr
);
822 else if (type
!= TREE_TYPE (expr
))
823 expr
= build_nop (type
, expr
);
829 struct cplus_array_info
835 struct cplus_array_hasher
: ggc_ptr_hash
<tree_node
>
837 typedef cplus_array_info
*compare_type
;
839 static hashval_t
hash (tree t
);
840 static bool equal (tree
, cplus_array_info
*);
843 /* Hash an ARRAY_TYPE. K is really of type `tree'. */
846 cplus_array_hasher::hash (tree t
)
850 hash
= TYPE_UID (TREE_TYPE (t
));
852 hash
^= TYPE_UID (TYPE_DOMAIN (t
));
856 /* Compare two ARRAY_TYPEs. K1 is really of type `tree', K2 is really
857 of type `cplus_array_info*'. */
860 cplus_array_hasher::equal (tree t1
, cplus_array_info
*t2
)
862 return (TREE_TYPE (t1
) == t2
->type
&& TYPE_DOMAIN (t1
) == t2
->domain
);
865 /* Hash table containing dependent array types, which are unsuitable for
866 the language-independent type hash table. */
867 static GTY (()) hash_table
<cplus_array_hasher
> *cplus_array_htab
;
869 /* Build an ARRAY_TYPE without laying it out. */
872 build_min_array_type (tree elt_type
, tree index_type
)
874 tree t
= cxx_make_type (ARRAY_TYPE
);
875 TREE_TYPE (t
) = elt_type
;
876 TYPE_DOMAIN (t
) = index_type
;
880 /* Set TYPE_CANONICAL like build_array_type_1, but using
881 build_cplus_array_type. */
884 set_array_type_canon (tree t
, tree elt_type
, tree index_type
)
886 /* Set the canonical type for this new node. */
887 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
888 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
889 SET_TYPE_STRUCTURAL_EQUALITY (t
);
890 else if (TYPE_CANONICAL (elt_type
) != elt_type
891 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
893 = build_cplus_array_type (TYPE_CANONICAL (elt_type
),
895 ? TYPE_CANONICAL (index_type
) : index_type
);
897 TYPE_CANONICAL (t
) = t
;
900 /* Like build_array_type, but handle special C++ semantics: an array of a
901 variant element type is a variant of the array of the main variant of
905 build_cplus_array_type (tree elt_type
, tree index_type
)
909 if (elt_type
== error_mark_node
|| index_type
== error_mark_node
)
910 return error_mark_node
;
912 bool dependent
= (uses_template_parms (elt_type
)
913 || (index_type
&& uses_template_parms (index_type
)));
915 if (elt_type
!= TYPE_MAIN_VARIANT (elt_type
))
916 /* Start with an array of the TYPE_MAIN_VARIANT. */
917 t
= build_cplus_array_type (TYPE_MAIN_VARIANT (elt_type
),
921 /* Since type_hash_canon calls layout_type, we need to use our own
923 cplus_array_info cai
;
926 if (cplus_array_htab
== NULL
)
927 cplus_array_htab
= hash_table
<cplus_array_hasher
>::create_ggc (61);
929 hash
= TYPE_UID (elt_type
);
931 hash
^= TYPE_UID (index_type
);
933 cai
.domain
= index_type
;
935 tree
*e
= cplus_array_htab
->find_slot_with_hash (&cai
, hash
, INSERT
);
937 /* We have found the type: we're done. */
941 /* Build a new array type. */
942 t
= build_min_array_type (elt_type
, index_type
);
944 /* Store it in the hash table. */
947 /* Set the canonical type for this new node. */
948 set_array_type_canon (t
, elt_type
, index_type
);
953 bool typeless_storage
954 = (elt_type
== unsigned_char_type_node
955 || elt_type
== signed_char_type_node
956 || elt_type
== char_type_node
957 || (TREE_CODE (elt_type
) == ENUMERAL_TYPE
958 && TYPE_CONTEXT (elt_type
) == std_node
959 && !strcmp ("byte", TYPE_NAME_STRING (elt_type
))));
960 t
= build_array_type (elt_type
, index_type
, typeless_storage
);
963 /* Now check whether we already have this array variant. */
964 if (elt_type
!= TYPE_MAIN_VARIANT (elt_type
))
967 for (t
= m
; t
; t
= TYPE_NEXT_VARIANT (t
))
968 if (TREE_TYPE (t
) == elt_type
969 && TYPE_NAME (t
) == NULL_TREE
970 && TYPE_ATTRIBUTES (t
) == NULL_TREE
)
974 t
= build_min_array_type (elt_type
, index_type
);
975 set_array_type_canon (t
, elt_type
, index_type
);
979 /* Make sure sizes are shared with the main variant.
980 layout_type can't be called after setting TYPE_NEXT_VARIANT,
981 as it will overwrite alignment etc. of all variants. */
982 TYPE_SIZE (t
) = TYPE_SIZE (m
);
983 TYPE_SIZE_UNIT (t
) = TYPE_SIZE_UNIT (m
);
984 TYPE_TYPELESS_STORAGE (t
) = TYPE_TYPELESS_STORAGE (m
);
987 TYPE_MAIN_VARIANT (t
) = m
;
988 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
989 TYPE_NEXT_VARIANT (m
) = t
;
993 /* Avoid spurious warnings with VLAs (c++/54583). */
994 if (TYPE_SIZE (t
) && EXPR_P (TYPE_SIZE (t
)))
995 TREE_NO_WARNING (TYPE_SIZE (t
)) = 1;
997 /* Push these needs up to the ARRAY_TYPE so that initialization takes
998 place more easily. */
999 bool needs_ctor
= (TYPE_NEEDS_CONSTRUCTING (t
)
1000 = TYPE_NEEDS_CONSTRUCTING (elt_type
));
1001 bool needs_dtor
= (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
1002 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (elt_type
));
1004 if (!dependent
&& t
== TYPE_MAIN_VARIANT (t
)
1005 && !COMPLETE_TYPE_P (t
) && COMPLETE_TYPE_P (elt_type
))
1007 /* The element type has been completed since the last time we saw
1008 this array type; update the layout and 'tor flags for any variants
1011 for (tree v
= TYPE_NEXT_VARIANT (t
); v
; v
= TYPE_NEXT_VARIANT (v
))
1013 TYPE_NEEDS_CONSTRUCTING (v
) = needs_ctor
;
1014 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (v
) = needs_dtor
;
1021 /* Return an ARRAY_TYPE with element type ELT and length N. */
1024 build_array_of_n_type (tree elt
, int n
)
1026 return build_cplus_array_type (elt
, build_index_type (size_int (n
- 1)));
1029 /* True iff T is an N3639 array of runtime bound (VLA). These were
1030 approved for C++14 but then removed. */
1033 array_of_runtime_bound_p (tree t
)
1035 if (!t
|| TREE_CODE (t
) != ARRAY_TYPE
)
1037 tree dom
= TYPE_DOMAIN (t
);
1040 tree max
= TYPE_MAX_VALUE (dom
);
1041 return (!potential_rvalue_constant_expression (max
)
1042 || (!value_dependent_expression_p (max
) && !TREE_CONSTANT (max
)));
1045 /* Return a reference type node referring to TO_TYPE. If RVAL is
1046 true, return an rvalue reference type, otherwise return an lvalue
1047 reference type. If a type node exists, reuse it, otherwise create
1050 cp_build_reference_type (tree to_type
, bool rval
)
1054 if (TREE_CODE (to_type
) == REFERENCE_TYPE
)
1056 rval
= rval
&& TYPE_REF_IS_RVALUE (to_type
);
1057 to_type
= TREE_TYPE (to_type
);
1060 lvalue_ref
= build_reference_type (to_type
);
1064 /* This code to create rvalue reference types is based on and tied
1065 to the code creating lvalue reference types in the middle-end
1066 functions build_reference_type_for_mode and build_reference_type.
1068 It works by putting the rvalue reference type nodes after the
1069 lvalue reference nodes in the TYPE_NEXT_REF_TO linked list, so
1070 they will effectively be ignored by the middle end. */
1072 for (t
= lvalue_ref
; (t
= TYPE_NEXT_REF_TO (t
)); )
1073 if (TYPE_REF_IS_RVALUE (t
))
1076 t
= build_distinct_type_copy (lvalue_ref
);
1078 TYPE_REF_IS_RVALUE (t
) = true;
1079 TYPE_NEXT_REF_TO (t
) = TYPE_NEXT_REF_TO (lvalue_ref
);
1080 TYPE_NEXT_REF_TO (lvalue_ref
) = t
;
1082 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
1083 SET_TYPE_STRUCTURAL_EQUALITY (t
);
1084 else if (TYPE_CANONICAL (to_type
) != to_type
)
1086 = cp_build_reference_type (TYPE_CANONICAL (to_type
), rval
);
1088 TYPE_CANONICAL (t
) = t
;
1096 /* Returns EXPR cast to rvalue reference type, like std::move. */
1101 tree type
= TREE_TYPE (expr
);
1102 gcc_assert (TREE_CODE (type
) != REFERENCE_TYPE
);
1103 type
= cp_build_reference_type (type
, /*rval*/true);
1104 return build_static_cast (type
, expr
, tf_warning_or_error
);
1107 /* Used by the C++ front end to build qualified array types. However,
1108 the C version of this function does not properly maintain canonical
1109 types (which are not used in C). */
1111 c_build_qualified_type (tree type
, int type_quals
, tree
/* orig_qual_type */,
1112 size_t /* orig_qual_indirect */)
1114 return cp_build_qualified_type (type
, type_quals
);
1118 /* Make a variant of TYPE, qualified with the TYPE_QUALS. Handles
1119 arrays correctly. In particular, if TYPE is an array of T's, and
1120 TYPE_QUALS is non-empty, returns an array of qualified T's.
1122 FLAGS determines how to deal with ill-formed qualifications. If
1123 tf_ignore_bad_quals is set, then bad qualifications are dropped
1124 (this is permitted if TYPE was introduced via a typedef or template
1125 type parameter). If bad qualifications are dropped and tf_warning
1126 is set, then a warning is issued for non-const qualifications. If
1127 tf_ignore_bad_quals is not set and tf_error is not set, we
1128 return error_mark_node. Otherwise, we issue an error, and ignore
1131 Qualification of a reference type is valid when the reference came
1132 via a typedef or template type argument. [dcl.ref] No such
1133 dispensation is provided for qualifying a function type. [dcl.fct]
1134 DR 295 queries this and the proposed resolution brings it into line
1135 with qualifying a reference. We implement the DR. We also behave
1136 in a similar manner for restricting non-pointer types. */
1139 cp_build_qualified_type_real (tree type
,
1141 tsubst_flags_t complain
)
1144 int bad_quals
= TYPE_UNQUALIFIED
;
1146 if (type
== error_mark_node
)
1149 if (type_quals
== cp_type_quals (type
))
1152 if (TREE_CODE (type
) == ARRAY_TYPE
)
1154 /* In C++, the qualification really applies to the array element
1155 type. Obtain the appropriately qualified element type. */
1158 = cp_build_qualified_type_real (TREE_TYPE (type
),
1162 if (element_type
== error_mark_node
)
1163 return error_mark_node
;
1165 /* See if we already have an identically qualified type. Tests
1166 should be equivalent to those in check_qualified_type. */
1167 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
1168 if (TREE_TYPE (t
) == element_type
1169 && TYPE_NAME (t
) == TYPE_NAME (type
)
1170 && TYPE_CONTEXT (t
) == TYPE_CONTEXT (type
)
1171 && attribute_list_equal (TYPE_ATTRIBUTES (t
),
1172 TYPE_ATTRIBUTES (type
)))
1177 t
= build_cplus_array_type (element_type
, TYPE_DOMAIN (type
));
1179 /* Keep the typedef name. */
1180 if (TYPE_NAME (t
) != TYPE_NAME (type
))
1182 t
= build_variant_type_copy (t
);
1183 TYPE_NAME (t
) = TYPE_NAME (type
);
1184 SET_TYPE_ALIGN (t
, TYPE_ALIGN (type
));
1185 TYPE_USER_ALIGN (t
) = TYPE_USER_ALIGN (type
);
1189 /* Even if we already had this variant, we update
1190 TYPE_NEEDS_CONSTRUCTING and TYPE_HAS_NONTRIVIAL_DESTRUCTOR in case
1191 they changed since the variant was originally created.
1193 This seems hokey; if there is some way to use a previous
1194 variant *without* coming through here,
1195 TYPE_NEEDS_CONSTRUCTING will never be updated. */
1196 TYPE_NEEDS_CONSTRUCTING (t
)
1197 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (element_type
));
1198 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
1199 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (element_type
));
1202 else if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
1204 tree t
= PACK_EXPANSION_PATTERN (type
);
1206 t
= cp_build_qualified_type_real (t
, type_quals
, complain
);
1207 return make_pack_expansion (t
);
1210 /* A reference or method type shall not be cv-qualified.
1211 [dcl.ref], [dcl.fct]. This used to be an error, but as of DR 295
1212 (in CD1) we always ignore extra cv-quals on functions. */
1213 if (type_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)
1214 && (TREE_CODE (type
) == REFERENCE_TYPE
1215 || TREE_CODE (type
) == FUNCTION_TYPE
1216 || TREE_CODE (type
) == METHOD_TYPE
))
1218 if (TREE_CODE (type
) == REFERENCE_TYPE
)
1219 bad_quals
|= type_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
1220 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
1223 /* But preserve any function-cv-quals on a FUNCTION_TYPE. */
1224 if (TREE_CODE (type
) == FUNCTION_TYPE
)
1225 type_quals
|= type_memfn_quals (type
);
1227 /* A restrict-qualified type must be a pointer (or reference)
1228 to object or incomplete type. */
1229 if ((type_quals
& TYPE_QUAL_RESTRICT
)
1230 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
1231 && TREE_CODE (type
) != TYPENAME_TYPE
1232 && !POINTER_TYPE_P (type
))
1234 bad_quals
|= TYPE_QUAL_RESTRICT
;
1235 type_quals
&= ~TYPE_QUAL_RESTRICT
;
1238 if (bad_quals
== TYPE_UNQUALIFIED
1239 || (complain
& tf_ignore_bad_quals
))
1241 else if (!(complain
& tf_error
))
1242 return error_mark_node
;
1245 tree bad_type
= build_qualified_type (ptr_type_node
, bad_quals
);
1246 error ("%qV qualifiers cannot be applied to %qT",
1250 /* Retrieve (or create) the appropriately qualified variant. */
1251 result
= build_qualified_type (type
, type_quals
);
1253 /* Preserve exception specs and ref-qualifier since build_qualified_type
1254 doesn't know about them. */
1255 if (TREE_CODE (result
) == FUNCTION_TYPE
1256 || TREE_CODE (result
) == METHOD_TYPE
)
1258 result
= build_exception_variant (result
, TYPE_RAISES_EXCEPTIONS (type
));
1259 result
= build_ref_qualified_type (result
, type_memfn_rqual (type
));
1265 /* Return TYPE with const and volatile removed. */
1268 cv_unqualified (tree type
)
1272 if (type
== error_mark_node
)
1275 quals
= cp_type_quals (type
);
1276 quals
&= ~(TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
);
1277 return cp_build_qualified_type (type
, quals
);
1280 /* Subroutine of strip_typedefs. We want to apply to RESULT the attributes
1281 from ATTRIBS that affect type identity, and no others. If any are not
1282 applied, set *remove_attributes to true. */
1285 apply_identity_attributes (tree result
, tree attribs
, bool *remove_attributes
)
1287 tree first_ident
= NULL_TREE
;
1288 tree new_attribs
= NULL_TREE
;
1289 tree
*p
= &new_attribs
;
1291 if (OVERLOAD_TYPE_P (result
))
1293 /* On classes and enums all attributes are ingrained. */
1294 gcc_assert (attribs
== TYPE_ATTRIBUTES (result
));
1298 for (tree a
= attribs
; a
; a
= TREE_CHAIN (a
))
1300 const attribute_spec
*as
1301 = lookup_attribute_spec (get_attribute_name (a
));
1302 if (as
&& as
->affects_type_identity
)
1306 else if (first_ident
== error_mark_node
)
1308 *p
= tree_cons (TREE_PURPOSE (a
), TREE_VALUE (a
), NULL_TREE
);
1309 p
= &TREE_CHAIN (*p
);
1312 else if (first_ident
)
1314 for (tree a2
= first_ident
; a2
; a2
= TREE_CHAIN (a2
))
1316 *p
= tree_cons (TREE_PURPOSE (a2
), TREE_VALUE (a2
), NULL_TREE
);
1317 p
= &TREE_CHAIN (*p
);
1319 first_ident
= error_mark_node
;
1322 if (first_ident
!= error_mark_node
)
1323 new_attribs
= first_ident
;
1325 if (first_ident
== attribs
)
1326 /* All attributes affected type identity. */;
1328 *remove_attributes
= true;
1330 return cp_build_type_attribute_variant (result
, new_attribs
);
1333 /* Builds a qualified variant of T that is not a typedef variant.
1334 E.g. consider the following declarations:
1335 typedef const int ConstInt;
1336 typedef ConstInt* PtrConstInt;
1337 If T is PtrConstInt, this function returns a type representing
1339 In other words, if T is a typedef, the function returns the underlying type.
1340 The cv-qualification and attributes of the type returned match the
1342 They will always be compatible types.
1343 The returned type is built so that all of its subtypes
1344 recursively have their typedefs stripped as well.
1346 This is different from just returning TYPE_CANONICAL (T)
1347 Because of several reasons:
1348 * If T is a type that needs structural equality
1349 its TYPE_CANONICAL (T) will be NULL.
1350 * TYPE_CANONICAL (T) desn't carry type attributes
1351 and loses template parameter names.
1353 If REMOVE_ATTRIBUTES is non-null, also strip attributes that don't
1354 affect type identity, and set the referent to true if any were
1358 strip_typedefs (tree t
, bool *remove_attributes
)
1360 tree result
= NULL
, type
= NULL
, t0
= NULL
;
1362 if (!t
|| t
== error_mark_node
)
1365 if (TREE_CODE (t
) == TREE_LIST
)
1367 bool changed
= false;
1368 vec
<tree
,va_gc
> *vec
= make_tree_vector ();
1370 for (; t
; t
= TREE_CHAIN (t
))
1372 gcc_assert (!TREE_PURPOSE (t
));
1373 tree elt
= strip_typedefs (TREE_VALUE (t
), remove_attributes
);
1374 if (elt
!= TREE_VALUE (t
))
1376 vec_safe_push (vec
, elt
);
1379 r
= build_tree_list_vec (vec
);
1380 release_tree_vector (vec
);
1384 gcc_assert (TYPE_P (t
));
1386 if (t
== TYPE_CANONICAL (t
))
1389 if (dependent_alias_template_spec_p (t
))
1390 /* DR 1558: However, if the template-id is dependent, subsequent
1391 template argument substitution still applies to the template-id. */
1394 switch (TREE_CODE (t
))
1397 type
= strip_typedefs (TREE_TYPE (t
), remove_attributes
);
1398 result
= build_pointer_type (type
);
1400 case REFERENCE_TYPE
:
1401 type
= strip_typedefs (TREE_TYPE (t
), remove_attributes
);
1402 result
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
1405 t0
= strip_typedefs (TYPE_OFFSET_BASETYPE (t
), remove_attributes
);
1406 type
= strip_typedefs (TREE_TYPE (t
), remove_attributes
);
1407 result
= build_offset_type (t0
, type
);
1410 if (TYPE_PTRMEMFUNC_P (t
))
1412 t0
= strip_typedefs (TYPE_PTRMEMFUNC_FN_TYPE (t
), remove_attributes
);
1413 result
= build_ptrmemfunc_type (t0
);
1417 type
= strip_typedefs (TREE_TYPE (t
), remove_attributes
);
1418 t0
= strip_typedefs (TYPE_DOMAIN (t
), remove_attributes
);
1419 result
= build_cplus_array_type (type
, t0
);
1424 tree arg_types
= NULL
, arg_node
, arg_node2
, arg_type
;
1427 /* Because we stomp on TREE_PURPOSE of TYPE_ARG_TYPES in many places
1428 around the compiler (e.g. cp_parser_late_parsing_default_args), we
1429 can't expect that re-hashing a function type will find a previous
1430 equivalent type, so try to reuse the input type if nothing has
1431 changed. If the type is itself a variant, that will change. */
1432 bool is_variant
= typedef_variant_p (t
);
1433 if (remove_attributes
1434 && (TYPE_ATTRIBUTES (t
) || TYPE_USER_ALIGN (t
)))
1437 type
= strip_typedefs (TREE_TYPE (t
), remove_attributes
);
1438 changed
= type
!= TREE_TYPE (t
) || is_variant
;
1440 for (arg_node
= TYPE_ARG_TYPES (t
);
1442 arg_node
= TREE_CHAIN (arg_node
))
1444 if (arg_node
== void_list_node
)
1446 arg_type
= strip_typedefs (TREE_VALUE (arg_node
),
1448 gcc_assert (arg_type
);
1449 if (arg_type
== TREE_VALUE (arg_node
) && !changed
)
1455 for (arg_node2
= TYPE_ARG_TYPES (t
);
1456 arg_node2
!= arg_node
;
1457 arg_node2
= TREE_CHAIN (arg_node2
))
1459 = tree_cons (TREE_PURPOSE (arg_node2
),
1460 TREE_VALUE (arg_node2
), arg_types
);
1464 = tree_cons (TREE_PURPOSE (arg_node
), arg_type
, arg_types
);
1471 arg_types
= nreverse (arg_types
);
1473 /* A list of parameters not ending with an ellipsis
1474 must end with void_list_node. */
1476 arg_types
= chainon (arg_types
, void_list_node
);
1478 if (TREE_CODE (t
) == METHOD_TYPE
)
1480 tree class_type
= TREE_TYPE (TREE_VALUE (arg_types
));
1481 gcc_assert (class_type
);
1483 build_method_type_directly (class_type
, type
,
1484 TREE_CHAIN (arg_types
));
1486 = build_ref_qualified_type (result
, type_memfn_rqual (t
));
1490 result
= build_function_type (type
,
1492 result
= apply_memfn_quals (result
,
1493 type_memfn_quals (t
),
1494 type_memfn_rqual (t
));
1497 if (TYPE_RAISES_EXCEPTIONS (t
))
1498 result
= build_exception_variant (result
,
1499 TYPE_RAISES_EXCEPTIONS (t
));
1500 if (TYPE_HAS_LATE_RETURN_TYPE (t
))
1501 TYPE_HAS_LATE_RETURN_TYPE (result
) = 1;
1506 tree fullname
= TYPENAME_TYPE_FULLNAME (t
);
1507 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
1508 && TREE_OPERAND (fullname
, 1))
1510 tree args
= TREE_OPERAND (fullname
, 1);
1511 tree new_args
= copy_node (args
);
1512 bool changed
= false;
1513 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
1515 tree arg
= TREE_VEC_ELT (args
, i
);
1518 strip_arg
= strip_typedefs (arg
, remove_attributes
);
1520 strip_arg
= strip_typedefs_expr (arg
, remove_attributes
);
1521 TREE_VEC_ELT (new_args
, i
) = strip_arg
;
1522 if (strip_arg
!= arg
)
1527 NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_args
)
1528 = NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
1530 = lookup_template_function (TREE_OPERAND (fullname
, 0),
1534 ggc_free (new_args
);
1536 result
= make_typename_type (strip_typedefs (TYPE_CONTEXT (t
),
1538 fullname
, typename_type
, tf_none
);
1539 /* Handle 'typedef typename A::N N;' */
1540 if (typedef_variant_p (result
))
1541 result
= TYPE_MAIN_VARIANT (DECL_ORIGINAL_TYPE (TYPE_NAME (result
)));
1545 result
= strip_typedefs_expr (DECLTYPE_TYPE_EXPR (t
),
1547 if (result
== DECLTYPE_TYPE_EXPR (t
))
1550 result
= (finish_decltype_type
1552 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
),
1555 case UNDERLYING_TYPE
:
1556 type
= strip_typedefs (UNDERLYING_TYPE_TYPE (t
), remove_attributes
);
1557 result
= finish_underlying_type (type
);
1565 if (typedef_variant_p (t
))
1567 /* Explicitly get the underlying type, as TYPE_MAIN_VARIANT doesn't
1568 strip typedefs with attributes. */
1569 result
= TYPE_MAIN_VARIANT (DECL_ORIGINAL_TYPE (TYPE_NAME (t
)));
1570 result
= strip_typedefs (result
);
1573 result
= TYPE_MAIN_VARIANT (t
);
1575 gcc_assert (!typedef_variant_p (result
));
1577 if (COMPLETE_TYPE_P (result
) && !COMPLETE_TYPE_P (t
))
1578 /* If RESULT is complete and T isn't, it's likely the case that T
1579 is a variant of RESULT which hasn't been updated yet. Skip the
1580 attribute handling. */;
1583 if (TYPE_USER_ALIGN (t
) != TYPE_USER_ALIGN (result
)
1584 || TYPE_ALIGN (t
) != TYPE_ALIGN (result
))
1586 gcc_assert (TYPE_USER_ALIGN (t
));
1587 if (remove_attributes
)
1588 *remove_attributes
= true;
1591 if (TYPE_ALIGN (t
) == TYPE_ALIGN (result
))
1592 result
= build_variant_type_copy (result
);
1594 result
= build_aligned_type (result
, TYPE_ALIGN (t
));
1595 TYPE_USER_ALIGN (result
) = true;
1599 if (TYPE_ATTRIBUTES (t
))
1601 if (remove_attributes
)
1602 result
= apply_identity_attributes (result
, TYPE_ATTRIBUTES (t
),
1605 result
= cp_build_type_attribute_variant (result
,
1606 TYPE_ATTRIBUTES (t
));
1610 return cp_build_qualified_type (result
, cp_type_quals (t
));
1613 /* Like strip_typedefs above, but works on expressions, so that in
1615 template<class T> struct A
1621 sizeof(TT) is replaced by sizeof(T). */
1624 strip_typedefs_expr (tree t
, bool *remove_attributes
)
1628 enum tree_code code
;
1630 if (t
== NULL_TREE
|| t
== error_mark_node
)
1633 if (DECL_P (t
) || CONSTANT_CLASS_P (t
))
1636 /* Some expressions have type operands, so let's handle types here rather
1637 than check TYPE_P in multiple places below. */
1639 return strip_typedefs (t
, remove_attributes
);
1641 code
= TREE_CODE (t
);
1644 case IDENTIFIER_NODE
:
1645 case TEMPLATE_PARM_INDEX
:
1648 case ARGUMENT_PACK_SELECT
:
1653 tree type1
= strip_typedefs (TRAIT_EXPR_TYPE1 (t
), remove_attributes
);
1654 tree type2
= strip_typedefs (TRAIT_EXPR_TYPE2 (t
), remove_attributes
);
1655 if (type1
== TRAIT_EXPR_TYPE1 (t
)
1656 && type2
== TRAIT_EXPR_TYPE2 (t
))
1659 TRAIT_EXPR_TYPE1 (r
) = type1
;
1660 TRAIT_EXPR_TYPE2 (r
) = type2
;
1666 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
1667 bool changed
= false;
1669 for (it
= t
; it
; it
= TREE_CHAIN (it
))
1671 tree val
= strip_typedefs_expr (TREE_VALUE (t
), remove_attributes
);
1672 vec_safe_push (vec
, val
);
1673 if (val
!= TREE_VALUE (t
))
1675 gcc_assert (TREE_PURPOSE (it
) == NULL_TREE
);
1680 FOR_EACH_VEC_ELT_REVERSE (*vec
, i
, it
)
1681 r
= tree_cons (NULL_TREE
, it
, r
);
1685 release_tree_vector (vec
);
1691 bool changed
= false;
1692 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
1693 n
= TREE_VEC_LENGTH (t
);
1694 vec_safe_reserve (vec
, n
);
1695 for (i
= 0; i
< n
; ++i
)
1697 tree op
= strip_typedefs_expr (TREE_VEC_ELT (t
, i
),
1699 vec
->quick_push (op
);
1700 if (op
!= TREE_VEC_ELT (t
, i
))
1706 for (i
= 0; i
< n
; ++i
)
1707 TREE_VEC_ELT (r
, i
) = (*vec
)[i
];
1708 NON_DEFAULT_TEMPLATE_ARGS_COUNT (r
)
1709 = NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
);
1713 release_tree_vector (vec
);
1719 bool changed
= false;
1720 vec
<constructor_elt
, va_gc
> *vec
1721 = vec_safe_copy (CONSTRUCTOR_ELTS (t
));
1722 n
= CONSTRUCTOR_NELTS (t
);
1723 type
= strip_typedefs (TREE_TYPE (t
), remove_attributes
);
1724 for (i
= 0; i
< n
; ++i
)
1726 constructor_elt
*e
= &(*vec
)[i
];
1727 tree op
= strip_typedefs_expr (e
->value
, remove_attributes
);
1734 (e
->index
== strip_typedefs_expr (e
->index
, remove_attributes
));
1737 if (!changed
&& type
== TREE_TYPE (t
))
1745 TREE_TYPE (r
) = type
;
1746 CONSTRUCTOR_ELTS (r
) = vec
;
1752 error ("lambda-expression in a constant expression");
1753 return error_mark_node
;
1759 gcc_assert (EXPR_P (t
));
1761 n
= TREE_OPERAND_LENGTH (t
);
1762 ops
= XALLOCAVEC (tree
, n
);
1763 type
= TREE_TYPE (t
);
1768 case IMPLICIT_CONV_EXPR
:
1769 case DYNAMIC_CAST_EXPR
:
1770 case STATIC_CAST_EXPR
:
1771 case CONST_CAST_EXPR
:
1772 case REINTERPRET_CAST_EXPR
:
1775 type
= strip_typedefs (type
, remove_attributes
);
1779 for (i
= 0; i
< n
; ++i
)
1780 ops
[i
] = strip_typedefs_expr (TREE_OPERAND (t
, i
), remove_attributes
);
1784 /* If nothing changed, return t. */
1785 for (i
= 0; i
< n
; ++i
)
1786 if (ops
[i
] != TREE_OPERAND (t
, i
))
1788 if (i
== n
&& type
== TREE_TYPE (t
))
1792 TREE_TYPE (r
) = type
;
1793 for (i
= 0; i
< n
; ++i
)
1794 TREE_OPERAND (r
, i
) = ops
[i
];
1798 /* Makes a copy of BINFO and TYPE, which is to be inherited into a
1799 graph dominated by T. If BINFO is NULL, TYPE is a dependent base,
1800 and we do a shallow copy. If BINFO is non-NULL, we do a deep copy.
1801 VIRT indicates whether TYPE is inherited virtually or not.
1802 IGO_PREV points at the previous binfo of the inheritance graph
1803 order chain. The newly copied binfo's TREE_CHAIN forms this
1806 The CLASSTYPE_VBASECLASSES vector of T is constructed in the
1807 correct order. That is in the order the bases themselves should be
1810 The BINFO_INHERITANCE of a virtual base class points to the binfo
1811 of the most derived type. ??? We could probably change this so that
1812 BINFO_INHERITANCE becomes synonymous with BINFO_PRIMARY, and hence
1813 remove a field. They currently can only differ for primary virtual
1817 copy_binfo (tree binfo
, tree type
, tree t
, tree
*igo_prev
, int virt
)
1823 /* See if we've already made this virtual base. */
1824 new_binfo
= binfo_for_vbase (type
, t
);
1829 new_binfo
= make_tree_binfo (binfo
? BINFO_N_BASE_BINFOS (binfo
) : 0);
1830 BINFO_TYPE (new_binfo
) = type
;
1832 /* Chain it into the inheritance graph. */
1833 TREE_CHAIN (*igo_prev
) = new_binfo
;
1834 *igo_prev
= new_binfo
;
1836 if (binfo
&& !BINFO_DEPENDENT_BASE_P (binfo
))
1841 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), type
));
1843 BINFO_OFFSET (new_binfo
) = BINFO_OFFSET (binfo
);
1844 BINFO_VIRTUALS (new_binfo
) = BINFO_VIRTUALS (binfo
);
1846 /* We do not need to copy the accesses, as they are read only. */
1847 BINFO_BASE_ACCESSES (new_binfo
) = BINFO_BASE_ACCESSES (binfo
);
1849 /* Recursively copy base binfos of BINFO. */
1850 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ix
++)
1852 tree new_base_binfo
;
1853 new_base_binfo
= copy_binfo (base_binfo
, BINFO_TYPE (base_binfo
),
1855 BINFO_VIRTUAL_P (base_binfo
));
1857 if (!BINFO_INHERITANCE_CHAIN (new_base_binfo
))
1858 BINFO_INHERITANCE_CHAIN (new_base_binfo
) = new_binfo
;
1859 BINFO_BASE_APPEND (new_binfo
, new_base_binfo
);
1863 BINFO_DEPENDENT_BASE_P (new_binfo
) = 1;
1867 /* Push it onto the list after any virtual bases it contains
1868 will have been pushed. */
1869 CLASSTYPE_VBASECLASSES (t
)->quick_push (new_binfo
);
1870 BINFO_VIRTUAL_P (new_binfo
) = 1;
1871 BINFO_INHERITANCE_CHAIN (new_binfo
) = TYPE_BINFO (t
);
1877 /* Hashing of lists so that we don't make duplicates.
1878 The entry point is `list_hash_canon'. */
1887 struct list_hasher
: ggc_ptr_hash
<tree_node
>
1889 typedef list_proxy
*compare_type
;
1891 static hashval_t
hash (tree
);
1892 static bool equal (tree
, list_proxy
*);
1895 /* Now here is the hash table. When recording a list, it is added
1896 to the slot whose index is the hash code mod the table size.
1897 Note that the hash table is used for several kinds of lists.
1898 While all these live in the same table, they are completely independent,
1899 and the hash code is computed differently for each of these. */
1901 static GTY (()) hash_table
<list_hasher
> *list_hash_table
;
1903 /* Compare ENTRY (an entry in the hash table) with DATA (a list_proxy
1904 for a node we are thinking about adding). */
1907 list_hasher::equal (tree t
, list_proxy
*proxy
)
1909 return (TREE_VALUE (t
) == proxy
->value
1910 && TREE_PURPOSE (t
) == proxy
->purpose
1911 && TREE_CHAIN (t
) == proxy
->chain
);
1914 /* Compute a hash code for a list (chain of TREE_LIST nodes
1915 with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the
1916 TREE_COMMON slots), by adding the hash codes of the individual entries. */
1919 list_hash_pieces (tree purpose
, tree value
, tree chain
)
1921 hashval_t hashcode
= 0;
1924 hashcode
+= TREE_HASH (chain
);
1927 hashcode
+= TREE_HASH (value
);
1931 hashcode
+= TREE_HASH (purpose
);
1937 /* Hash an already existing TREE_LIST. */
1940 list_hasher::hash (tree t
)
1942 return list_hash_pieces (TREE_PURPOSE (t
),
1947 /* Given list components PURPOSE, VALUE, AND CHAIN, return the canonical
1948 object for an identical list if one already exists. Otherwise, build a
1949 new one, and record it as the canonical object. */
1952 hash_tree_cons (tree purpose
, tree value
, tree chain
)
1956 struct list_proxy proxy
;
1958 /* Hash the list node. */
1959 hashcode
= list_hash_pieces (purpose
, value
, chain
);
1960 /* Create a proxy for the TREE_LIST we would like to create. We
1961 don't actually create it so as to avoid creating garbage. */
1962 proxy
.purpose
= purpose
;
1963 proxy
.value
= value
;
1964 proxy
.chain
= chain
;
1965 /* See if it is already in the table. */
1966 slot
= list_hash_table
->find_slot_with_hash (&proxy
, hashcode
, INSERT
);
1967 /* If not, create a new node. */
1969 *slot
= tree_cons (purpose
, value
, chain
);
1970 return (tree
) *slot
;
1973 /* Constructor for hashed lists. */
1976 hash_tree_chain (tree value
, tree chain
)
1978 return hash_tree_cons (NULL_TREE
, value
, chain
);
1982 debug_binfo (tree elem
)
1987 fprintf (stderr
, "type \"%s\", offset = " HOST_WIDE_INT_PRINT_DEC
1989 TYPE_NAME_STRING (BINFO_TYPE (elem
)),
1990 TREE_INT_CST_LOW (BINFO_OFFSET (elem
)));
1991 debug_tree (BINFO_TYPE (elem
));
1992 if (BINFO_VTABLE (elem
))
1993 fprintf (stderr
, "vtable decl \"%s\"\n",
1994 IDENTIFIER_POINTER (DECL_NAME (get_vtbl_decl_for_binfo (elem
))));
1996 fprintf (stderr
, "no vtable decl yet\n");
1997 fprintf (stderr
, "virtuals:\n");
1998 virtuals
= BINFO_VIRTUALS (elem
);
2003 tree fndecl
= TREE_VALUE (virtuals
);
2004 fprintf (stderr
, "%s [%ld =? %ld]\n",
2005 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl
)),
2006 (long) n
, (long) TREE_INT_CST_LOW (DECL_VINDEX (fndecl
)));
2008 virtuals
= TREE_CHAIN (virtuals
);
2012 /* Build a representation for the qualified name SCOPE::NAME. TYPE is
2013 the type of the result expression, if known, or NULL_TREE if the
2014 resulting expression is type-dependent. If TEMPLATE_P is true,
2015 NAME is known to be a template because the user explicitly used the
2016 "template" keyword after the "::".
2018 All SCOPE_REFs should be built by use of this function. */
2021 build_qualified_name (tree type
, tree scope
, tree name
, bool template_p
)
2024 if (type
== error_mark_node
2025 || scope
== error_mark_node
2026 || name
== error_mark_node
)
2027 return error_mark_node
;
2028 t
= build2 (SCOPE_REF
, type
, scope
, name
);
2029 QUALIFIED_NAME_IS_TEMPLATE (t
) = template_p
;
2030 PTRMEM_OK_P (t
) = true;
2032 t
= convert_from_reference (t
);
2036 /* Like check_qualified_type, but also check ref-qualifier and exception
2040 cp_check_qualified_type (const_tree cand
, const_tree base
, int type_quals
,
2041 cp_ref_qualifier rqual
, tree raises
)
2043 return (TYPE_QUALS (cand
) == type_quals
2044 && check_base_type (cand
, base
)
2045 && comp_except_specs (raises
, TYPE_RAISES_EXCEPTIONS (cand
),
2047 && type_memfn_rqual (cand
) == rqual
);
2050 /* Build the FUNCTION_TYPE or METHOD_TYPE with the ref-qualifier RQUAL. */
2053 build_ref_qualified_type (tree type
, cp_ref_qualifier rqual
)
2057 if (rqual
== type_memfn_rqual (type
))
2060 int type_quals
= TYPE_QUALS (type
);
2061 tree raises
= TYPE_RAISES_EXCEPTIONS (type
);
2062 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
2063 if (cp_check_qualified_type (t
, type
, type_quals
, rqual
, raises
))
2066 t
= build_variant_type_copy (type
);
2069 case REF_QUAL_RVALUE
:
2070 FUNCTION_RVALUE_QUALIFIED (t
) = 1;
2071 FUNCTION_REF_QUALIFIED (t
) = 1;
2073 case REF_QUAL_LVALUE
:
2074 FUNCTION_RVALUE_QUALIFIED (t
) = 0;
2075 FUNCTION_REF_QUALIFIED (t
) = 1;
2078 FUNCTION_REF_QUALIFIED (t
) = 0;
2082 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
2083 /* Propagate structural equality. */
2084 SET_TYPE_STRUCTURAL_EQUALITY (t
);
2085 else if (TYPE_CANONICAL (type
) != type
)
2086 /* Build the underlying canonical type, since it is different
2088 TYPE_CANONICAL (t
) = build_ref_qualified_type (TYPE_CANONICAL (type
),
2091 /* T is its own canonical type. */
2092 TYPE_CANONICAL (t
) = t
;
2097 /* Cache of free ovl nodes. Uses OVL_FUNCTION for chaining. */
2098 static GTY((deletable
)) tree ovl_cache
;
2100 /* Make a raw overload node containing FN. */
2103 ovl_make (tree fn
, tree next
)
2105 tree result
= ovl_cache
;
2109 ovl_cache
= OVL_FUNCTION (result
);
2110 /* Zap the flags. */
2111 memset (result
, 0, sizeof (tree_base
));
2112 TREE_SET_CODE (result
, OVERLOAD
);
2115 result
= make_node (OVERLOAD
);
2117 if (TREE_CODE (fn
) == OVERLOAD
)
2118 OVL_NESTED_P (result
) = true;
2120 TREE_TYPE (result
) = (next
|| TREE_CODE (fn
) == TEMPLATE_DECL
2121 ? unknown_type_node
: TREE_TYPE (fn
));
2122 OVL_FUNCTION (result
) = fn
;
2123 OVL_CHAIN (result
) = next
;
2130 tree result
= ovl_cache
;
2134 ovl_cache
= OVL_FUNCTION (result
);
2135 /* Zap the flags. */
2136 memset (result
, 0, sizeof (tree_base
));
2137 TREE_SET_CODE (result
, OVERLOAD
);
2140 result
= make_node (OVERLOAD
);
2142 gcc_assert (!OVL_NESTED_P (ovl
) && !OVL_LOOKUP_P (ovl
));
2143 TREE_TYPE (result
) = TREE_TYPE (ovl
);
2144 OVL_FUNCTION (result
) = OVL_FUNCTION (ovl
);
2145 OVL_CHAIN (result
) = OVL_CHAIN (ovl
);
2146 OVL_HIDDEN_P (result
) = OVL_HIDDEN_P (ovl
);
2147 OVL_USING_P (result
) = OVL_USING_P (ovl
);
2152 /* Add FN to the (potentially NULL) overload set OVL. USING_P is
2153 true, if FN is via a using declaration. Overloads are ordered as
2157 ovl_insert (tree fn
, tree maybe_ovl
, bool using_p
)
2159 bool copying
= false; /* Checking use only. */
2160 bool hidden_p
= DECL_HIDDEN_P (fn
);
2161 int weight
= (hidden_p
<< 1) | (using_p
<< 0);
2163 tree result
= NULL_TREE
;
2164 tree insert_after
= NULL_TREE
;
2166 /* Find insertion point. */
2167 while (maybe_ovl
&& TREE_CODE (maybe_ovl
) == OVERLOAD
2168 && (weight
< ((OVL_HIDDEN_P (maybe_ovl
) << 1)
2169 | (OVL_USING_P (maybe_ovl
) << 0))))
2171 gcc_checking_assert (!OVL_LOOKUP_P (maybe_ovl
)
2172 && (!OVL_USED_P (maybe_ovl
) || !copying
));
2173 if (OVL_USED_P (maybe_ovl
))
2176 maybe_ovl
= ovl_copy (maybe_ovl
);
2178 OVL_CHAIN (insert_after
) = maybe_ovl
;
2182 insert_after
= maybe_ovl
;
2183 maybe_ovl
= OVL_CHAIN (maybe_ovl
);
2187 if (maybe_ovl
|| using_p
|| hidden_p
|| TREE_CODE (fn
) == TEMPLATE_DECL
)
2189 trail
= ovl_make (fn
, maybe_ovl
);
2191 OVL_HIDDEN_P (trail
) = true;
2193 OVL_USING_P (trail
) = true;
2198 OVL_CHAIN (insert_after
) = trail
;
2199 TREE_TYPE (insert_after
) = unknown_type_node
;
2207 /* Skip any hidden names at the beginning of OVL. */
2210 ovl_skip_hidden (tree ovl
)
2213 ovl
&& TREE_CODE (ovl
) == OVERLOAD
&& OVL_HIDDEN_P (ovl
);
2214 ovl
= OVL_CHAIN (ovl
))
2215 gcc_checking_assert (DECL_HIDDEN_P (OVL_FUNCTION (ovl
)));
2217 if (ovl
&& TREE_CODE (ovl
) != OVERLOAD
&& DECL_HIDDEN_P (ovl
))
2219 /* Any hidden functions should have been wrapped in an
2220 overload, but injected friend classes will not. */
2221 gcc_checking_assert (!DECL_DECLARES_FUNCTION_P (ovl
));
2228 /* NODE is an OVL_HIDDEN_P node which is now revealed. */
2231 ovl_iterator::reveal_node (tree overload
, tree node
)
2233 /* We cannot have returned NODE as part of a lookup overload, so it
2235 gcc_checking_assert (!OVL_USED_P (node
));
2237 OVL_HIDDEN_P (node
) = false;
2238 if (tree chain
= OVL_CHAIN (node
))
2239 if (TREE_CODE (chain
) == OVERLOAD
2240 && (OVL_USING_P (chain
) || OVL_HIDDEN_P (chain
)))
2242 /* The node needs moving, and the simplest way is to remove it
2244 overload
= remove_node (overload
, node
);
2245 overload
= ovl_insert (OVL_FUNCTION (node
), overload
);
2250 /* NODE is on the overloads of OVL. Remove it. If a predecessor is
2251 OVL_USED_P we must copy OVL nodes, because those are immutable.
2252 The removed node is unaltered and may continue to be iterated
2253 from (i.e. it is safe to remove a node from an overload one is
2254 currently iterating over). */
2257 ovl_iterator::remove_node (tree overload
, tree node
)
2259 bool copying
= false; /* Checking use only. */
2261 tree
*slot
= &overload
;
2262 while (*slot
!= node
)
2265 gcc_checking_assert (!OVL_LOOKUP_P (probe
)
2266 && (!OVL_USED_P (probe
) || !copying
));
2267 if (OVL_USED_P (probe
))
2270 probe
= ovl_copy (probe
);
2274 slot
= &OVL_CHAIN (probe
);
2277 /* Stitch out NODE. We don't have to worry about now making a
2278 singleton overload (and consequently maybe setting its type),
2279 because all uses of this function will be followed by inserting a
2280 new node that must follow the place we've cut this out from. */
2281 if (TREE_CODE (node
) != OVERLOAD
)
2282 /* Cloned inherited ctors don't mark themselves as via_using. */
2285 *slot
= OVL_CHAIN (node
);
2290 /* Add a set of new FNS into a lookup. */
2293 lookup_add (tree fns
, tree lookup
)
2295 if (lookup
|| TREE_CODE (fns
) == TEMPLATE_DECL
)
2297 lookup
= ovl_make (fns
, lookup
);
2298 OVL_LOOKUP_P (lookup
) = true;
2306 /* If KEEP is true, preserve the contents of a lookup so that it is
2307 available for a later instantiation. Otherwise release the LOOKUP
2311 lookup_keep (tree lookup
, bool keep
)
2314 lookup
&& TREE_CODE (lookup
) == OVERLOAD
2315 && OVL_LOOKUP_P (lookup
) && !OVL_USED_P (lookup
);
2316 lookup
= OVL_CHAIN (lookup
))
2318 OVL_USED_P (lookup
) = true;
2321 OVL_FUNCTION (lookup
) = ovl_cache
;
2326 /* Returns nonzero if X is an expression for a (possibly overloaded)
2327 function. If "f" is a function or function template, "f", "c->f",
2328 "c.f", "C::f", and "f<int>" will all be considered possibly
2329 overloaded functions. Returns 2 if the function is actually
2330 overloaded, i.e., if it is impossible to know the type of the
2331 function without performing overload resolution. */
2334 is_overloaded_fn (tree x
)
2336 /* A baselink is also considered an overloaded function. */
2337 if (TREE_CODE (x
) == OFFSET_REF
2338 || TREE_CODE (x
) == COMPONENT_REF
)
2339 x
= TREE_OPERAND (x
, 1);
2340 x
= MAYBE_BASELINK_FUNCTIONS (x
);
2341 if (TREE_CODE (x
) == TEMPLATE_ID_EXPR
)
2342 x
= TREE_OPERAND (x
, 0);
2344 if (DECL_FUNCTION_TEMPLATE_P (OVL_FIRST (x
))
2345 || (TREE_CODE (x
) == OVERLOAD
&& !OVL_SINGLE_P (x
)))
2348 return (TREE_CODE (x
) == FUNCTION_DECL
2349 || TREE_CODE (x
) == OVERLOAD
);
2352 /* X is the CALL_EXPR_FN of a CALL_EXPR. If X represents a dependent name
2353 (14.6.2), return the IDENTIFIER_NODE for that name. Otherwise, return
2357 dependent_name (tree x
)
2359 if (identifier_p (x
))
2361 if (TREE_CODE (x
) == TEMPLATE_ID_EXPR
)
2362 x
= TREE_OPERAND (x
, 0);
2363 if (TREE_CODE (x
) == OVERLOAD
|| TREE_CODE (x
) == FUNCTION_DECL
)
2364 return OVL_NAME (x
);
2368 /* Returns true iff X is an expression for an overloaded function
2369 whose type cannot be known without performing overload
2373 really_overloaded_fn (tree x
)
2375 return is_overloaded_fn (x
) == 2;
2378 /* Get the overload set FROM refers to. */
2383 /* A baselink is also considered an overloaded function. */
2384 if (TREE_CODE (from
) == OFFSET_REF
2385 || TREE_CODE (from
) == COMPONENT_REF
)
2386 from
= TREE_OPERAND (from
, 1);
2387 if (BASELINK_P (from
))
2388 from
= BASELINK_FUNCTIONS (from
);
2389 if (TREE_CODE (from
) == TEMPLATE_ID_EXPR
)
2390 from
= TREE_OPERAND (from
, 0);
2391 gcc_assert (TREE_CODE (from
) == OVERLOAD
2392 || TREE_CODE (from
) == FUNCTION_DECL
);
2396 /* Return the first function of the overload set FROM refers to. */
2399 get_first_fn (tree from
)
2401 return OVL_FIRST (get_fns (from
));
2404 /* Return the scope where the overloaded functions OVL were found. */
2407 ovl_scope (tree ovl
)
2409 if (TREE_CODE (ovl
) == OFFSET_REF
2410 || TREE_CODE (ovl
) == COMPONENT_REF
)
2411 ovl
= TREE_OPERAND (ovl
, 1);
2412 if (TREE_CODE (ovl
) == BASELINK
)
2413 return BINFO_TYPE (BASELINK_BINFO (ovl
));
2414 if (TREE_CODE (ovl
) == TEMPLATE_ID_EXPR
)
2415 ovl
= TREE_OPERAND (ovl
, 0);
2416 /* Skip using-declarations. */
2417 lkp_iterator
iter (ovl
);
2420 while (iter
.using_p () && ++iter
);
2422 return CP_DECL_CONTEXT (ovl
);
2425 #define PRINT_RING_SIZE 4
2428 cxx_printable_name_internal (tree decl
, int v
, bool translate
)
2430 static unsigned int uid_ring
[PRINT_RING_SIZE
];
2431 static char *print_ring
[PRINT_RING_SIZE
];
2432 static bool trans_ring
[PRINT_RING_SIZE
];
2433 static int ring_counter
;
2436 /* Only cache functions. */
2438 || TREE_CODE (decl
) != FUNCTION_DECL
2439 || DECL_LANG_SPECIFIC (decl
) == 0)
2440 return lang_decl_name (decl
, v
, translate
);
2442 /* See if this print name is lying around. */
2443 for (i
= 0; i
< PRINT_RING_SIZE
; i
++)
2444 if (uid_ring
[i
] == DECL_UID (decl
) && translate
== trans_ring
[i
])
2445 /* yes, so return it. */
2446 return print_ring
[i
];
2448 if (++ring_counter
== PRINT_RING_SIZE
)
2451 if (current_function_decl
!= NULL_TREE
)
2453 /* There may be both translated and untranslated versions of the
2455 for (i
= 0; i
< 2; i
++)
2457 if (uid_ring
[ring_counter
] == DECL_UID (current_function_decl
))
2459 if (ring_counter
== PRINT_RING_SIZE
)
2462 gcc_assert (uid_ring
[ring_counter
] != DECL_UID (current_function_decl
));
2465 free (print_ring
[ring_counter
]);
2467 print_ring
[ring_counter
] = xstrdup (lang_decl_name (decl
, v
, translate
));
2468 uid_ring
[ring_counter
] = DECL_UID (decl
);
2469 trans_ring
[ring_counter
] = translate
;
2470 return print_ring
[ring_counter
];
2474 cxx_printable_name (tree decl
, int v
)
2476 return cxx_printable_name_internal (decl
, v
, false);
2480 cxx_printable_name_translate (tree decl
, int v
)
2482 return cxx_printable_name_internal (decl
, v
, true);
2485 /* Return the canonical version of exception-specification RAISES for a C++17
2486 function type, for use in type comparison and building TYPE_CANONICAL. */
2489 canonical_eh_spec (tree raises
)
2491 if (raises
== NULL_TREE
)
2493 else if (DEFERRED_NOEXCEPT_SPEC_P (raises
)
2494 || uses_template_parms (raises
)
2495 || uses_template_parms (TREE_PURPOSE (raises
)))
2496 /* Keep a dependent or deferred exception specification. */
2498 else if (nothrow_spec_p (raises
))
2499 /* throw() -> noexcept. */
2500 return noexcept_true_spec
;
2502 /* For C++17 type matching, anything else -> nothing. */
2506 /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions
2507 listed in RAISES. */
2510 build_exception_variant (tree type
, tree raises
)
2515 if (comp_except_specs (raises
, TYPE_RAISES_EXCEPTIONS (type
), ce_exact
))
2518 type_quals
= TYPE_QUALS (type
);
2519 cp_ref_qualifier rqual
= type_memfn_rqual (type
);
2520 for (v
= TYPE_MAIN_VARIANT (type
); v
; v
= TYPE_NEXT_VARIANT (v
))
2521 if (cp_check_qualified_type (v
, type
, type_quals
, rqual
, raises
))
2524 /* Need to build a new variant. */
2525 v
= build_variant_type_copy (type
);
2526 TYPE_RAISES_EXCEPTIONS (v
) = raises
;
2528 if (!flag_noexcept_type
)
2529 /* The exception-specification is not part of the canonical type. */
2532 /* Canonicalize the exception specification. */
2533 tree cr
= canonical_eh_spec (raises
);
2535 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
2536 /* Propagate structural equality. */
2537 SET_TYPE_STRUCTURAL_EQUALITY (v
);
2538 else if (TYPE_CANONICAL (type
) != type
|| cr
!= raises
)
2539 /* Build the underlying canonical type, since it is different
2541 TYPE_CANONICAL (v
) = build_exception_variant (TYPE_CANONICAL (type
), cr
);
2543 /* T is its own canonical type. */
2544 TYPE_CANONICAL (v
) = v
;
2549 /* Given a TEMPLATE_TEMPLATE_PARM node T, create a new
2550 BOUND_TEMPLATE_TEMPLATE_PARM bound with NEWARGS as its template
2554 bind_template_template_parm (tree t
, tree newargs
)
2556 tree decl
= TYPE_NAME (t
);
2559 t2
= cxx_make_type (BOUND_TEMPLATE_TEMPLATE_PARM
);
2560 decl
= build_decl (input_location
,
2561 TYPE_DECL
, DECL_NAME (decl
), NULL_TREE
);
2563 /* These nodes have to be created to reflect new TYPE_DECL and template
2565 TEMPLATE_TYPE_PARM_INDEX (t2
) = copy_node (TEMPLATE_TYPE_PARM_INDEX (t
));
2566 TEMPLATE_PARM_DECL (TEMPLATE_TYPE_PARM_INDEX (t2
)) = decl
;
2567 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2
)
2568 = build_template_info (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t
), newargs
);
2570 TREE_TYPE (decl
) = t2
;
2571 TYPE_NAME (t2
) = decl
;
2572 TYPE_STUB_DECL (t2
) = decl
;
2574 SET_TYPE_STRUCTURAL_EQUALITY (t2
);
2579 /* Called from count_trees via walk_tree. */
2582 count_trees_r (tree
*tp
, int *walk_subtrees
, void *data
)
2592 /* Debugging function for measuring the rough complexity of a tree
2596 count_trees (tree t
)
2599 cp_walk_tree_without_duplicates (&t
, count_trees_r
, &n_trees
);
2603 /* Called from verify_stmt_tree via walk_tree. */
2606 verify_stmt_tree_r (tree
* tp
, int * /*walk_subtrees*/, void* data
)
2609 hash_table
<nofree_ptr_hash
<tree_node
> > *statements
2610 = static_cast <hash_table
<nofree_ptr_hash
<tree_node
> > *> (data
);
2613 if (!STATEMENT_CODE_P (TREE_CODE (t
)))
2616 /* If this statement is already present in the hash table, then
2617 there is a circularity in the statement tree. */
2618 gcc_assert (!statements
->find (t
));
2620 slot
= statements
->find_slot (t
, INSERT
);
2626 /* Debugging function to check that the statement T has not been
2627 corrupted. For now, this function simply checks that T contains no
2631 verify_stmt_tree (tree t
)
2633 hash_table
<nofree_ptr_hash
<tree_node
> > statements (37);
2634 cp_walk_tree (&t
, verify_stmt_tree_r
, &statements
, NULL
);
2637 /* Check if the type T depends on a type with no linkage and if so, return
2638 it. If RELAXED_P then do not consider a class type declared within
2639 a vague-linkage function to have no linkage. */
2642 no_linkage_check (tree t
, bool relaxed_p
)
2646 /* There's no point in checking linkage on template functions; we
2647 can't know their complete types. */
2648 if (processing_template_decl
)
2651 switch (TREE_CODE (t
))
2654 if (TYPE_PTRMEMFUNC_P (t
))
2656 /* Lambda types that don't have mangling scope have no linkage. We
2657 check CLASSTYPE_LAMBDA_EXPR for error_mark_node because
2658 when we get here from pushtag none of the lambda information is
2659 set up yet, so we want to assume that the lambda has linkage and
2660 fix it up later if not. */
2661 if (CLASSTYPE_LAMBDA_EXPR (t
)
2662 && CLASSTYPE_LAMBDA_EXPR (t
) != error_mark_node
2663 && LAMBDA_TYPE_EXTRA_SCOPE (t
) == NULL_TREE
)
2667 if (!CLASS_TYPE_P (t
))
2671 /* Only treat unnamed types as having no linkage if they're at
2672 namespace scope. This is core issue 966. */
2673 if (TYPE_UNNAMED_P (t
) && TYPE_NAMESPACE_SCOPE_P (t
))
2676 for (r
= CP_TYPE_CONTEXT (t
); ; )
2678 /* If we're a nested type of a !TREE_PUBLIC class, we might not
2679 have linkage, or we might just be in an anonymous namespace.
2680 If we're in a TREE_PUBLIC class, we have linkage. */
2681 if (TYPE_P (r
) && !TREE_PUBLIC (TYPE_NAME (r
)))
2682 return no_linkage_check (TYPE_CONTEXT (t
), relaxed_p
);
2683 else if (TREE_CODE (r
) == FUNCTION_DECL
)
2685 if (!relaxed_p
|| !vague_linkage_p (r
))
2688 r
= CP_DECL_CONTEXT (r
);
2698 case REFERENCE_TYPE
:
2700 return no_linkage_check (TREE_TYPE (t
), relaxed_p
);
2704 r
= no_linkage_check (TYPE_PTRMEM_POINTED_TO_TYPE (t
),
2708 return no_linkage_check (TYPE_PTRMEM_CLASS_TYPE (t
), relaxed_p
);
2713 tree parm
= TYPE_ARG_TYPES (t
);
2714 if (TREE_CODE (t
) == METHOD_TYPE
)
2715 /* The 'this' pointer isn't interesting; a method has the same
2716 linkage (or lack thereof) as its enclosing class. */
2717 parm
= TREE_CHAIN (parm
);
2719 parm
&& parm
!= void_list_node
;
2720 parm
= TREE_CHAIN (parm
))
2722 r
= no_linkage_check (TREE_VALUE (parm
), relaxed_p
);
2726 return no_linkage_check (TREE_TYPE (t
), relaxed_p
);
2734 extern int depth_reached
;
2737 cxx_print_statistics (void)
2739 print_search_statistics ();
2740 print_class_statistics ();
2741 print_template_statistics ();
2742 if (GATHER_STATISTICS
)
2743 fprintf (stderr
, "maximum template instantiation depth reached: %d\n",
2747 /* Return, as an INTEGER_CST node, the number of elements for TYPE
2748 (which is an ARRAY_TYPE). This counts only elements of the top
2752 array_type_nelts_top (tree type
)
2754 return fold_build2_loc (input_location
,
2755 PLUS_EXPR
, sizetype
,
2756 array_type_nelts (type
),
2760 /* Return, as an INTEGER_CST node, the number of elements for TYPE
2761 (which is an ARRAY_TYPE). This one is a recursive count of all
2762 ARRAY_TYPEs that are clumped together. */
2765 array_type_nelts_total (tree type
)
2767 tree sz
= array_type_nelts_top (type
);
2768 type
= TREE_TYPE (type
);
2769 while (TREE_CODE (type
) == ARRAY_TYPE
)
2771 tree n
= array_type_nelts_top (type
);
2772 sz
= fold_build2_loc (input_location
,
2773 MULT_EXPR
, sizetype
, sz
, n
);
2774 type
= TREE_TYPE (type
);
2779 /* Called from break_out_target_exprs via mapcar. */
2782 bot_manip (tree
* tp
, int* walk_subtrees
, void* data
)
2784 splay_tree target_remap
= ((splay_tree
) data
);
2787 if (!TYPE_P (t
) && TREE_CONSTANT (t
) && !TREE_SIDE_EFFECTS (t
))
2789 /* There can't be any TARGET_EXPRs or their slot variables below this
2790 point. But we must make a copy, in case subsequent processing
2791 alters any part of it. For example, during gimplification a cast
2792 of the form (T) &X::f (where "f" is a member function) will lead
2793 to replacing the PTRMEM_CST for &X::f with a VAR_DECL. */
2795 *tp
= unshare_expr (t
);
2798 if (TREE_CODE (t
) == TARGET_EXPR
)
2802 if (TREE_CODE (TREE_OPERAND (t
, 1)) == AGGR_INIT_EXPR
)
2804 u
= build_cplus_new (TREE_TYPE (t
), TREE_OPERAND (t
, 1),
2805 tf_warning_or_error
);
2806 if (AGGR_INIT_ZERO_FIRST (TREE_OPERAND (t
, 1)))
2807 AGGR_INIT_ZERO_FIRST (TREE_OPERAND (u
, 1)) = true;
2810 u
= build_target_expr_with_type (TREE_OPERAND (t
, 1), TREE_TYPE (t
),
2811 tf_warning_or_error
);
2813 TARGET_EXPR_IMPLICIT_P (u
) = TARGET_EXPR_IMPLICIT_P (t
);
2814 TARGET_EXPR_LIST_INIT_P (u
) = TARGET_EXPR_LIST_INIT_P (t
);
2815 TARGET_EXPR_DIRECT_INIT_P (u
) = TARGET_EXPR_DIRECT_INIT_P (t
);
2817 /* Map the old variable to the new one. */
2818 splay_tree_insert (target_remap
,
2819 (splay_tree_key
) TREE_OPERAND (t
, 0),
2820 (splay_tree_value
) TREE_OPERAND (u
, 0));
2822 TREE_OPERAND (u
, 1) = break_out_target_exprs (TREE_OPERAND (u
, 1));
2824 /* Replace the old expression with the new version. */
2826 /* We don't have to go below this point; the recursive call to
2827 break_out_target_exprs will have handled anything below this
2832 if (TREE_CODE (*tp
) == SAVE_EXPR
)
2835 splay_tree_node n
= splay_tree_lookup (target_remap
,
2836 (splay_tree_key
) t
);
2839 *tp
= (tree
)n
->value
;
2844 copy_tree_r (tp
, walk_subtrees
, NULL
);
2845 splay_tree_insert (target_remap
,
2847 (splay_tree_value
)*tp
);
2848 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
2849 splay_tree_insert (target_remap
,
2850 (splay_tree_key
)*tp
,
2851 (splay_tree_value
)*tp
);
2856 /* Make a copy of this node. */
2857 t
= copy_tree_r (tp
, walk_subtrees
, NULL
);
2858 if (TREE_CODE (*tp
) == CALL_EXPR
)
2860 set_flags_from_callee (*tp
);
2862 /* builtin_LINE and builtin_FILE get the location where the default
2863 argument is expanded, not where the call was written. */
2864 tree callee
= get_callee_fndecl (*tp
);
2865 if (callee
&& DECL_BUILT_IN_CLASS (callee
) == BUILT_IN_NORMAL
)
2866 switch (DECL_FUNCTION_CODE (callee
))
2870 SET_EXPR_LOCATION (*tp
, input_location
);
2878 /* Replace all remapped VAR_DECLs in T with their new equivalents.
2879 DATA is really a splay-tree mapping old variables to new
2883 bot_replace (tree
* t
, int* /*walk_subtrees*/, void* data
)
2885 splay_tree target_remap
= ((splay_tree
) data
);
2889 splay_tree_node n
= splay_tree_lookup (target_remap
,
2890 (splay_tree_key
) *t
);
2892 *t
= (tree
) n
->value
;
2894 else if (TREE_CODE (*t
) == PARM_DECL
2895 && DECL_NAME (*t
) == this_identifier
2896 && !DECL_CONTEXT (*t
))
2898 /* In an NSDMI we need to replace the 'this' parameter we used for
2899 parsing with the real one for this function. */
2900 *t
= current_class_ptr
;
2902 else if (TREE_CODE (*t
) == CONVERT_EXPR
2903 && CONVERT_EXPR_VBASE_PATH (*t
))
2905 /* In an NSDMI build_base_path defers building conversions to virtual
2906 bases, and we handle it here. */
2907 tree basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (*t
)));
2908 vec
<tree
, va_gc
> *vbases
= CLASSTYPE_VBASECLASSES (current_class_type
);
2910 FOR_EACH_VEC_SAFE_ELT (vbases
, i
, binfo
)
2911 if (BINFO_TYPE (binfo
) == basetype
)
2913 *t
= build_base_path (PLUS_EXPR
, TREE_OPERAND (*t
, 0), binfo
, true,
2914 tf_warning_or_error
);
2920 /* When we parse a default argument expression, we may create
2921 temporary variables via TARGET_EXPRs. When we actually use the
2922 default-argument expression, we make a copy of the expression
2923 and replace the temporaries with appropriate local versions. */
2926 break_out_target_exprs (tree t
)
2928 static int target_remap_count
;
2929 static splay_tree target_remap
;
2931 if (!target_remap_count
++)
2932 target_remap
= splay_tree_new (splay_tree_compare_pointers
,
2933 /*splay_tree_delete_key_fn=*/NULL
,
2934 /*splay_tree_delete_value_fn=*/NULL
);
2935 cp_walk_tree (&t
, bot_manip
, target_remap
, NULL
);
2936 cp_walk_tree (&t
, bot_replace
, target_remap
, NULL
);
2938 if (!--target_remap_count
)
2940 splay_tree_delete (target_remap
);
2941 target_remap
= NULL
;
2947 /* Build an expression for the subobject of OBJ at CONSTRUCTOR index INDEX,
2948 which we expect to have type TYPE. */
2951 build_ctor_subob_ref (tree index
, tree type
, tree obj
)
2953 if (index
== NULL_TREE
)
2954 /* Can't refer to a particular member of a vector. */
2956 else if (TREE_CODE (index
) == INTEGER_CST
)
2957 obj
= cp_build_array_ref (input_location
, obj
, index
, tf_none
);
2959 obj
= build_class_member_access_expr (obj
, index
, NULL_TREE
,
2960 /*reference*/false, tf_none
);
2963 tree objtype
= TREE_TYPE (obj
);
2964 if (TREE_CODE (objtype
) == ARRAY_TYPE
&& !TYPE_DOMAIN (objtype
))
2966 /* When the destination object refers to a flexible array member
2967 verify that it matches the type of the source object except
2968 for its domain and qualifiers. */
2969 gcc_assert (comptypes (TYPE_MAIN_VARIANT (type
),
2970 TYPE_MAIN_VARIANT (objtype
),
2971 COMPARE_REDECLARATION
));
2974 gcc_assert (same_type_ignoring_top_level_qualifiers_p (type
, objtype
));
2980 struct replace_placeholders_t
2982 tree obj
; /* The object to be substituted for a PLACEHOLDER_EXPR. */
2983 bool seen
; /* Whether we've encountered a PLACEHOLDER_EXPR. */
2986 /* Like substitute_placeholder_in_expr, but handle C++ tree codes and
2987 build up subexpressions as we go deeper. */
2990 replace_placeholders_r (tree
* t
, int* walk_subtrees
, void* data_
)
2992 replace_placeholders_t
*d
= static_cast<replace_placeholders_t
*>(data_
);
2995 if (TREE_CONSTANT (*t
))
2997 *walk_subtrees
= false;
3001 switch (TREE_CODE (*t
))
3003 case PLACEHOLDER_EXPR
:
3006 for (; !(same_type_ignoring_top_level_qualifiers_p
3007 (TREE_TYPE (*t
), TREE_TYPE (x
)));
3008 x
= TREE_OPERAND (x
, 0))
3009 gcc_assert (TREE_CODE (x
) == COMPONENT_REF
);
3011 *walk_subtrees
= false;
3018 constructor_elt
*ce
;
3019 vec
<constructor_elt
,va_gc
> *v
= CONSTRUCTOR_ELTS (*t
);
3020 for (unsigned i
= 0; vec_safe_iterate (v
, i
, &ce
); ++i
)
3022 tree
*valp
= &ce
->value
;
3023 tree type
= TREE_TYPE (*valp
);
3026 if (TREE_CODE (*valp
) == CONSTRUCTOR
3027 && AGGREGATE_TYPE_P (type
))
3029 /* If we're looking at the initializer for OBJ, then build
3030 a sub-object reference. If we're looking at an
3031 initializer for another object, just pass OBJ down. */
3032 if (same_type_ignoring_top_level_qualifiers_p
3033 (TREE_TYPE (*t
), TREE_TYPE (obj
)))
3034 subob
= build_ctor_subob_ref (ce
->index
, type
, obj
);
3035 if (TREE_CODE (*valp
) == TARGET_EXPR
)
3036 valp
= &TARGET_EXPR_INITIAL (*valp
);
3039 cp_walk_tree (valp
, replace_placeholders_r
,
3043 *walk_subtrees
= false;
3054 /* Replace PLACEHOLDER_EXPRs in EXP with object OBJ. SEEN_P is set if
3055 a PLACEHOLDER_EXPR has been encountered. */
3058 replace_placeholders (tree exp
, tree obj
, bool *seen_p
)
3060 /* This is only relevant for C++14. */
3061 if (cxx_dialect
< cxx14
)
3064 /* If the object isn't a (member of a) class, do nothing. */
3066 while (TREE_CODE (op0
) == COMPONENT_REF
)
3067 op0
= TREE_OPERAND (op0
, 0);
3068 if (!CLASS_TYPE_P (strip_array_types (TREE_TYPE (op0
))))
3072 replace_placeholders_t data
= { obj
, false };
3073 if (TREE_CODE (exp
) == TARGET_EXPR
)
3074 tp
= &TARGET_EXPR_INITIAL (exp
);
3075 cp_walk_tree (tp
, replace_placeholders_r
, &data
, NULL
);
3077 *seen_p
= data
.seen
;
3081 /* Similar to `build_nt', but for template definitions of dependent
3085 build_min_nt_loc (location_t loc
, enum tree_code code
, ...)
3092 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3096 t
= make_node (code
);
3097 SET_EXPR_LOCATION (t
, loc
);
3098 length
= TREE_CODE_LENGTH (code
);
3100 for (i
= 0; i
< length
; i
++)
3102 tree x
= va_arg (p
, tree
);
3103 TREE_OPERAND (t
, i
) = x
;
3111 /* Similar to `build', but for template definitions. */
3114 build_min (enum tree_code code
, tree tt
, ...)
3121 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3125 t
= make_node (code
);
3126 length
= TREE_CODE_LENGTH (code
);
3129 for (i
= 0; i
< length
; i
++)
3131 tree x
= va_arg (p
, tree
);
3132 TREE_OPERAND (t
, i
) = x
;
3133 if (x
&& !TYPE_P (x
) && TREE_SIDE_EFFECTS (x
))
3134 TREE_SIDE_EFFECTS (t
) = 1;
3141 /* Similar to `build', but for template definitions of non-dependent
3142 expressions. NON_DEP is the non-dependent expression that has been
3146 build_min_non_dep (enum tree_code code
, tree non_dep
, ...)
3153 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3155 va_start (p
, non_dep
);
3157 if (REFERENCE_REF_P (non_dep
))
3158 non_dep
= TREE_OPERAND (non_dep
, 0);
3160 t
= make_node (code
);
3161 length
= TREE_CODE_LENGTH (code
);
3162 TREE_TYPE (t
) = unlowered_expr_type (non_dep
);
3163 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (non_dep
);
3165 for (i
= 0; i
< length
; i
++)
3167 tree x
= va_arg (p
, tree
);
3168 TREE_OPERAND (t
, i
) = x
;
3171 if (code
== COMPOUND_EXPR
&& TREE_CODE (non_dep
) != COMPOUND_EXPR
)
3172 /* This should not be considered a COMPOUND_EXPR, because it
3173 resolves to an overload. */
3174 COMPOUND_EXPR_OVERLOADED (t
) = 1;
3177 return convert_from_reference (t
);
3180 /* Similar to `build_nt_call_vec', but for template definitions of
3181 non-dependent expressions. NON_DEP is the non-dependent expression
3182 that has been built. */
3185 build_min_non_dep_call_vec (tree non_dep
, tree fn
, vec
<tree
, va_gc
> *argvec
)
3187 tree t
= build_nt_call_vec (fn
, argvec
);
3188 if (REFERENCE_REF_P (non_dep
))
3189 non_dep
= TREE_OPERAND (non_dep
, 0);
3190 TREE_TYPE (t
) = TREE_TYPE (non_dep
);
3191 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (non_dep
);
3192 return convert_from_reference (t
);
3195 /* Similar to build_min_non_dep, but for expressions that have been resolved to
3196 a call to an operator overload. OP is the operator that has been
3197 overloaded. NON_DEP is the non-dependent expression that's been built,
3198 which should be a CALL_EXPR or an INDIRECT_REF to a CALL_EXPR. OVERLOAD is
3199 the overload that NON_DEP is calling. */
3202 build_min_non_dep_op_overload (enum tree_code op
,
3207 int nargs
, expected_nargs
;
3209 vec
<tree
, va_gc
> *args
;
3211 non_dep
= extract_call_expr (non_dep
);
3213 nargs
= call_expr_nargs (non_dep
);
3215 expected_nargs
= cp_tree_code_length (op
);
3216 if ((op
== POSTINCREMENT_EXPR
3217 || op
== POSTDECREMENT_EXPR
)
3218 /* With -fpermissive non_dep could be operator++(). */
3219 && (!flag_permissive
|| nargs
!= expected_nargs
))
3220 expected_nargs
+= 1;
3221 gcc_assert (nargs
== expected_nargs
);
3223 args
= make_tree_vector ();
3224 va_start (p
, overload
);
3226 if (TREE_CODE (TREE_TYPE (overload
)) == FUNCTION_TYPE
)
3229 for (int i
= 0; i
< nargs
; i
++)
3231 tree arg
= va_arg (p
, tree
);
3232 vec_safe_push (args
, arg
);
3235 else if (TREE_CODE (TREE_TYPE (overload
)) == METHOD_TYPE
)
3237 tree object
= va_arg (p
, tree
);
3238 tree binfo
= TYPE_BINFO (TREE_TYPE (object
));
3239 tree method
= build_baselink (binfo
, binfo
, overload
, NULL_TREE
);
3240 fn
= build_min (COMPONENT_REF
, TREE_TYPE (overload
),
3241 object
, method
, NULL_TREE
);
3242 for (int i
= 1; i
< nargs
; i
++)
3244 tree arg
= va_arg (p
, tree
);
3245 vec_safe_push (args
, arg
);
3252 call
= build_min_non_dep_call_vec (non_dep
, fn
, args
);
3253 release_tree_vector (args
);
3255 tree call_expr
= extract_call_expr (call
);
3256 KOENIG_LOOKUP_P (call_expr
) = KOENIG_LOOKUP_P (non_dep
);
3257 CALL_EXPR_OPERATOR_SYNTAX (call_expr
) = true;
3258 CALL_EXPR_ORDERED_ARGS (call_expr
) = CALL_EXPR_ORDERED_ARGS (non_dep
);
3259 CALL_EXPR_REVERSE_ARGS (call_expr
) = CALL_EXPR_REVERSE_ARGS (non_dep
);
3264 /* Return a new tree vec copied from VEC, with ELT inserted at index IDX. */
3267 vec_copy_and_insert (vec
<tree
, va_gc
> *old_vec
, tree elt
, unsigned idx
)
3269 unsigned len
= vec_safe_length (old_vec
);
3270 gcc_assert (idx
<= len
);
3272 vec
<tree
, va_gc
> *new_vec
= NULL
;
3273 vec_alloc (new_vec
, len
+ 1);
3276 for (i
= 0; i
< len
; ++i
)
3279 new_vec
->quick_push (elt
);
3280 new_vec
->quick_push ((*old_vec
)[i
]);
3283 new_vec
->quick_push (elt
);
3289 get_type_decl (tree t
)
3291 if (TREE_CODE (t
) == TYPE_DECL
)
3294 return TYPE_STUB_DECL (t
);
3295 gcc_assert (t
== error_mark_node
);
3299 /* Returns the namespace that contains DECL, whether directly or
3303 decl_namespace_context (tree decl
)
3307 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
3309 else if (TYPE_P (decl
))
3310 decl
= CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl
));
3312 decl
= CP_DECL_CONTEXT (decl
);
3316 /* Returns true if decl is within an anonymous namespace, however deeply
3317 nested, or false otherwise. */
3320 decl_anon_ns_mem_p (const_tree decl
)
3322 while (TREE_CODE (decl
) != NAMESPACE_DECL
)
3324 /* Classes inside anonymous namespaces have TREE_PUBLIC == 0. */
3326 return !TREE_PUBLIC (TYPE_MAIN_DECL (decl
));
3328 decl
= CP_DECL_CONTEXT (decl
);
3330 return !TREE_PUBLIC (decl
);
3333 /* Subroutine of cp_tree_equal: t1 and t2 are the CALL_EXPR_FNs of two
3334 CALL_EXPRS. Return whether they are equivalent. */
3337 called_fns_equal (tree t1
, tree t2
)
3339 /* Core 1321: dependent names are equivalent even if the overload sets
3340 are different. But do compare explicit template arguments. */
3341 tree name1
= dependent_name (t1
);
3342 tree name2
= dependent_name (t2
);
3345 tree targs1
= NULL_TREE
, targs2
= NULL_TREE
;
3350 if (TREE_CODE (t1
) == TEMPLATE_ID_EXPR
)
3351 targs1
= TREE_OPERAND (t1
, 1);
3352 if (TREE_CODE (t2
) == TEMPLATE_ID_EXPR
)
3353 targs2
= TREE_OPERAND (t2
, 1);
3354 return cp_tree_equal (targs1
, targs2
);
3357 return cp_tree_equal (t1
, t2
);
3360 /* Return truthvalue of whether T1 is the same tree structure as T2.
3361 Return 1 if they are the same. Return 0 if they are different. */
3364 cp_tree_equal (tree t1
, tree t2
)
3366 enum tree_code code1
, code2
;
3373 code1
= TREE_CODE (t1
);
3374 code2
= TREE_CODE (t2
);
3382 /* There's only a single VOID_CST node, so we should never reach
3387 return tree_int_cst_equal (t1
, t2
);
3390 return real_equal (&TREE_REAL_CST (t1
), &TREE_REAL_CST (t2
));
3393 return TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
3394 && !memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
3395 TREE_STRING_LENGTH (t1
));
3398 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
),
3399 TREE_FIXED_CST (t2
));
3402 return cp_tree_equal (TREE_REALPART (t1
), TREE_REALPART (t2
))
3403 && cp_tree_equal (TREE_IMAGPART (t1
), TREE_IMAGPART (t2
));
3406 return operand_equal_p (t1
, t2
, OEP_ONLY_CONST
);
3409 /* We need to do this when determining whether or not two
3410 non-type pointer to member function template arguments
3412 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
3413 || CONSTRUCTOR_NELTS (t1
) != CONSTRUCTOR_NELTS (t2
))
3418 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t1
), i
, field
, value
)
3420 constructor_elt
*elt2
= CONSTRUCTOR_ELT (t2
, i
);
3421 if (!cp_tree_equal (field
, elt2
->index
)
3422 || !cp_tree_equal (value
, elt2
->value
))
3429 if (!cp_tree_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
)))
3431 if (!cp_tree_equal (TREE_VALUE (t1
), TREE_VALUE (t2
)))
3433 return cp_tree_equal (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
3436 return cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3441 call_expr_arg_iterator iter1
, iter2
;
3442 if (!called_fns_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
)))
3444 for (arg1
= first_call_expr_arg (t1
, &iter1
),
3445 arg2
= first_call_expr_arg (t2
, &iter2
);
3447 arg1
= next_call_expr_arg (&iter1
),
3448 arg2
= next_call_expr_arg (&iter2
))
3449 if (!cp_tree_equal (arg1
, arg2
))
3458 tree o1
= TREE_OPERAND (t1
, 0);
3459 tree o2
= TREE_OPERAND (t2
, 0);
3461 /* Special case: if either target is an unallocated VAR_DECL,
3462 it means that it's going to be unified with whatever the
3463 TARGET_EXPR is really supposed to initialize, so treat it
3464 as being equivalent to anything. */
3465 if (VAR_P (o1
) && DECL_NAME (o1
) == NULL_TREE
3466 && !DECL_RTL_SET_P (o1
))
3468 else if (VAR_P (o2
) && DECL_NAME (o2
) == NULL_TREE
3469 && !DECL_RTL_SET_P (o2
))
3471 else if (!cp_tree_equal (o1
, o2
))
3474 return cp_tree_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
3477 case WITH_CLEANUP_EXPR
:
3478 if (!cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0)))
3480 return cp_tree_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
3483 if (TREE_OPERAND (t1
, 1) != TREE_OPERAND (t2
, 1))
3485 return cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3488 /* For comparing uses of parameters in late-specified return types
3489 with an out-of-class definition of the function, but can also come
3490 up for expressions that involve 'this' in a member function
3493 if (comparing_specializations
&& !CONSTRAINT_VAR_P (t1
))
3494 /* When comparing hash table entries, only an exact match is
3495 good enough; we don't want to replace 'this' with the
3496 version from another function. But be more flexible
3497 with local parameters in a requires-expression. */
3500 if (same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
3502 if (DECL_ARTIFICIAL (t1
) ^ DECL_ARTIFICIAL (t2
))
3504 if (CONSTRAINT_VAR_P (t1
) ^ CONSTRAINT_VAR_P (t2
))
3506 if (DECL_ARTIFICIAL (t1
)
3507 || (DECL_PARM_LEVEL (t1
) == DECL_PARM_LEVEL (t2
)
3508 && DECL_PARM_INDEX (t1
) == DECL_PARM_INDEX (t2
)))
3518 case IDENTIFIER_NODE
:
3523 return (BASELINK_BINFO (t1
) == BASELINK_BINFO (t2
)
3524 && BASELINK_ACCESS_BINFO (t1
) == BASELINK_ACCESS_BINFO (t2
)
3525 && BASELINK_QUALIFIED_P (t1
) == BASELINK_QUALIFIED_P (t2
)
3526 && cp_tree_equal (BASELINK_FUNCTIONS (t1
),
3527 BASELINK_FUNCTIONS (t2
)));
3529 case TEMPLATE_PARM_INDEX
:
3530 return (TEMPLATE_PARM_IDX (t1
) == TEMPLATE_PARM_IDX (t2
)
3531 && TEMPLATE_PARM_LEVEL (t1
) == TEMPLATE_PARM_LEVEL (t2
)
3532 && (TEMPLATE_PARM_PARAMETER_PACK (t1
)
3533 == TEMPLATE_PARM_PARAMETER_PACK (t2
))
3534 && same_type_p (TREE_TYPE (TEMPLATE_PARM_DECL (t1
)),
3535 TREE_TYPE (TEMPLATE_PARM_DECL (t2
))));
3537 case TEMPLATE_ID_EXPR
:
3538 return (cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0))
3539 && cp_tree_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1)));
3541 case CONSTRAINT_INFO
:
3542 return cp_tree_equal (CI_ASSOCIATED_CONSTRAINTS (t1
),
3543 CI_ASSOCIATED_CONSTRAINTS (t2
));
3546 return (CHECK_CONSTR_CONCEPT (t1
) == CHECK_CONSTR_CONCEPT (t2
)
3547 && comp_template_args (CHECK_CONSTR_ARGS (t1
),
3548 CHECK_CONSTR_ARGS (t2
)));
3553 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
3555 for (ix
= TREE_VEC_LENGTH (t1
); ix
--;)
3556 if (!cp_tree_equal (TREE_VEC_ELT (t1
, ix
),
3557 TREE_VEC_ELT (t2
, ix
)))
3565 tree o1
= TREE_OPERAND (t1
, 0);
3566 tree o2
= TREE_OPERAND (t2
, 0);
3568 if (code1
== SIZEOF_EXPR
)
3570 if (SIZEOF_EXPR_TYPE_P (t1
))
3571 o1
= TREE_TYPE (o1
);
3572 if (SIZEOF_EXPR_TYPE_P (t2
))
3573 o2
= TREE_TYPE (o2
);
3575 if (TREE_CODE (o1
) != TREE_CODE (o2
))
3578 return same_type_p (o1
, o2
);
3580 return cp_tree_equal (o1
, o2
);
3585 tree t1_op1
, t2_op1
;
3587 if (!cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0)))
3590 t1_op1
= TREE_OPERAND (t1
, 1);
3591 t2_op1
= TREE_OPERAND (t2
, 1);
3592 if (TREE_CODE (t1_op1
) != TREE_CODE (t2_op1
))
3595 return cp_tree_equal (TREE_OPERAND (t1
, 2), TREE_OPERAND (t2
, 2));
3599 /* Two pointer-to-members are the same if they point to the same
3600 field or function in the same class. */
3601 if (PTRMEM_CST_MEMBER (t1
) != PTRMEM_CST_MEMBER (t2
))
3604 return same_type_p (PTRMEM_CST_CLASS (t1
), PTRMEM_CST_CLASS (t2
));
3608 /* Two overloads. Must be exactly the same set of decls. */
3609 lkp_iterator
first (t1
);
3610 lkp_iterator
second (t2
);
3612 for (; first
&& second
; ++first
, ++second
)
3613 if (*first
!= *second
)
3615 return !(first
|| second
);
3619 if (TRAIT_EXPR_KIND (t1
) != TRAIT_EXPR_KIND (t2
))
3621 return same_type_p (TRAIT_EXPR_TYPE1 (t1
), TRAIT_EXPR_TYPE1 (t2
))
3622 && cp_tree_equal (TRAIT_EXPR_TYPE2 (t1
), TRAIT_EXPR_TYPE2 (t2
));
3625 case STATIC_CAST_EXPR
:
3626 case REINTERPRET_CAST_EXPR
:
3627 case CONST_CAST_EXPR
:
3628 case DYNAMIC_CAST_EXPR
:
3629 case IMPLICIT_CONV_EXPR
:
3632 case NON_LVALUE_EXPR
:
3633 case VIEW_CONVERT_EXPR
:
3634 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
3636 /* Now compare operands as usual. */
3639 case DEFERRED_NOEXCEPT
:
3640 return (cp_tree_equal (DEFERRED_NOEXCEPT_PATTERN (t1
),
3641 DEFERRED_NOEXCEPT_PATTERN (t2
))
3642 && comp_template_args (DEFERRED_NOEXCEPT_ARGS (t1
),
3643 DEFERRED_NOEXCEPT_ARGS (t2
)));
3650 switch (TREE_CODE_CLASS (code1
))
3654 case tcc_comparison
:
3655 case tcc_expression
:
3662 n
= cp_tree_operand_length (t1
);
3663 if (TREE_CODE_CLASS (code1
) == tcc_vl_exp
3664 && n
!= TREE_OPERAND_LENGTH (t2
))
3667 for (i
= 0; i
< n
; ++i
)
3668 if (!cp_tree_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
)))
3675 return same_type_p (t1
, t2
);
3679 /* We can get here with --disable-checking. */
3683 /* The type of ARG when used as an lvalue. */
3686 lvalue_type (tree arg
)
3688 tree type
= TREE_TYPE (arg
);
3692 /* The type of ARG for printing error messages; denote lvalues with
3696 error_type (tree arg
)
3698 tree type
= TREE_TYPE (arg
);
3700 if (TREE_CODE (type
) == ARRAY_TYPE
)
3702 else if (TREE_CODE (type
) == ERROR_MARK
)
3704 else if (lvalue_p (arg
))
3705 type
= build_reference_type (lvalue_type (arg
));
3706 else if (MAYBE_CLASS_TYPE_P (type
))
3707 type
= lvalue_type (arg
);
3712 /* Does FUNCTION use a variable-length argument list? */
3715 varargs_function_p (const_tree function
)
3717 return stdarg_p (TREE_TYPE (function
));
3720 /* Returns 1 if decl is a member of a class. */
3723 member_p (const_tree decl
)
3725 const_tree
const ctx
= DECL_CONTEXT (decl
);
3726 return (ctx
&& TYPE_P (ctx
));
3729 /* Create a placeholder for member access where we don't actually have an
3730 object that the access is against. */
3733 build_dummy_object (tree type
)
3735 tree decl
= build1 (CONVERT_EXPR
, build_pointer_type (type
), void_node
);
3736 return cp_build_indirect_ref (decl
, RO_NULL
, tf_warning_or_error
);
3739 /* We've gotten a reference to a member of TYPE. Return *this if appropriate,
3740 or a dummy object otherwise. If BINFOP is non-0, it is filled with the
3741 binfo path from current_class_type to TYPE, or 0. */
3744 maybe_dummy_object (tree type
, tree
* binfop
)
3748 tree current
= current_nonlambda_class_type ();
3751 && (binfo
= lookup_base (current
, type
, ba_any
, NULL
,
3752 tf_warning_or_error
)))
3756 /* Reference from a nested class member function. */
3758 binfo
= TYPE_BINFO (type
);
3764 if (current_class_ref
3765 /* current_class_ref might not correspond to current_class_type if
3766 we're in tsubst_default_argument or a lambda-declarator; in either
3767 case, we want to use current_class_ref if it matches CONTEXT. */
3768 && (same_type_ignoring_top_level_qualifiers_p
3769 (TREE_TYPE (current_class_ref
), context
)))
3770 decl
= current_class_ref
;
3772 decl
= build_dummy_object (context
);
3777 /* Returns 1 if OB is a placeholder object, or a pointer to one. */
3780 is_dummy_object (const_tree ob
)
3782 if (INDIRECT_REF_P (ob
))
3783 ob
= TREE_OPERAND (ob
, 0);
3784 return (TREE_CODE (ob
) == CONVERT_EXPR
3785 && TREE_OPERAND (ob
, 0) == void_node
);
3788 /* Returns 1 iff type T is something we want to treat as a scalar type for
3789 the purpose of deciding whether it is trivial/POD/standard-layout. */
3792 scalarish_type_p (const_tree t
)
3794 if (t
== error_mark_node
)
3797 return (SCALAR_TYPE_P (t
) || VECTOR_TYPE_P (t
));
3800 /* Returns true iff T requires non-trivial default initialization. */
3803 type_has_nontrivial_default_init (const_tree t
)
3805 t
= strip_array_types (CONST_CAST_TREE (t
));
3807 if (CLASS_TYPE_P (t
))
3808 return TYPE_HAS_COMPLEX_DFLT (t
);
3813 /* Track classes with only deleted copy/move constructors so that we can warn
3814 if they are used in call/return by value. */
3816 static GTY(()) hash_set
<tree
>* deleted_copy_types
;
3818 remember_deleted_copy (const_tree t
)
3820 if (!deleted_copy_types
)
3821 deleted_copy_types
= hash_set
<tree
>::create_ggc(37);
3822 deleted_copy_types
->add (CONST_CAST_TREE (t
));
3825 maybe_warn_parm_abi (tree t
, location_t loc
)
3827 if (!deleted_copy_types
3828 || !deleted_copy_types
->contains (t
))
3831 warning_at (loc
, OPT_Wabi
, "the calling convention for %qT changes in "
3832 "-fabi-version=12 (GCC 8)", t
);
3833 static bool explained
= false;
3836 inform (loc
, " because all of its copy and move constructors "
3842 /* Returns true iff copying an object of type T (including via move
3843 constructor) is non-trivial. That is, T has no non-trivial copy
3844 constructors and no non-trivial move constructors, and not all copy/move
3845 constructors are deleted. This function implements the ABI notion of
3846 non-trivial copy, which has diverged from the one in the standard. */
3849 type_has_nontrivial_copy_init (const_tree type
)
3851 tree t
= strip_array_types (CONST_CAST_TREE (type
));
3853 if (CLASS_TYPE_P (t
))
3855 gcc_assert (COMPLETE_TYPE_P (t
));
3857 if (TYPE_HAS_COMPLEX_COPY_CTOR (t
)
3858 || TYPE_HAS_COMPLEX_MOVE_CTOR (t
))
3862 if (cxx_dialect
< cxx11
)
3863 /* No deleted functions before C++11. */
3866 /* Before ABI v12 we did a bitwise copy of types with only deleted
3867 copy/move constructors. */
3868 if (!abi_version_at_least (12)
3869 && !(warn_abi
&& abi_version_crosses (12)))
3872 bool saw_copy
= false;
3873 bool saw_non_deleted
= false;
3875 if (CLASSTYPE_LAZY_MOVE_CTOR (t
))
3876 saw_copy
= saw_non_deleted
= true;
3877 else if (CLASSTYPE_LAZY_COPY_CTOR (t
))
3880 if (type_has_user_declared_move_constructor (t
)
3881 || type_has_user_declared_move_assign (t
))
3882 /* [class.copy]/8 If the class definition declares a move
3883 constructor or move assignment operator, the implicitly declared
3884 copy constructor is defined as deleted.... */;
3886 /* Any other reason the implicitly-declared function would be
3887 deleted would also cause TYPE_HAS_COMPLEX_COPY_CTOR to be
3889 saw_non_deleted
= true;
3892 if (!saw_non_deleted
&& CLASSTYPE_METHOD_VEC (t
))
3893 for (ovl_iterator
iter (CLASSTYPE_CONSTRUCTORS (t
)); iter
; ++iter
)
3899 if (!DECL_DELETED_FN (fn
))
3901 /* Not deleted, therefore trivial. */
3902 saw_non_deleted
= true;
3908 gcc_assert (saw_copy
);
3910 if (saw_copy
&& !saw_non_deleted
)
3912 if (warn_abi
&& abi_version_crosses (12))
3913 remember_deleted_copy (t
);
3914 if (abi_version_at_least (12))
3924 /* Returns 1 iff type T is a trivially copyable type, as defined in
3925 [basic.types] and [class]. */
3928 trivially_copyable_p (const_tree t
)
3930 t
= strip_array_types (CONST_CAST_TREE (t
));
3932 if (CLASS_TYPE_P (t
))
3933 return ((!TYPE_HAS_COPY_CTOR (t
)
3934 || !TYPE_HAS_COMPLEX_COPY_CTOR (t
))
3935 && !TYPE_HAS_COMPLEX_MOVE_CTOR (t
)
3936 && (!TYPE_HAS_COPY_ASSIGN (t
)
3937 || !TYPE_HAS_COMPLEX_COPY_ASSIGN (t
))
3938 && !TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
)
3939 && TYPE_HAS_TRIVIAL_DESTRUCTOR (t
));
3941 return !CP_TYPE_VOLATILE_P (t
) && scalarish_type_p (t
);
3944 /* Returns 1 iff type T is a trivial type, as defined in [basic.types] and
3948 trivial_type_p (const_tree t
)
3950 t
= strip_array_types (CONST_CAST_TREE (t
));
3952 if (CLASS_TYPE_P (t
))
3953 return (TYPE_HAS_TRIVIAL_DFLT (t
)
3954 && trivially_copyable_p (t
));
3956 return scalarish_type_p (t
);
3959 /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */
3962 pod_type_p (const_tree t
)
3964 /* This CONST_CAST is okay because strip_array_types returns its
3965 argument unmodified and we assign it to a const_tree. */
3966 t
= strip_array_types (CONST_CAST_TREE(t
));
3968 if (!CLASS_TYPE_P (t
))
3969 return scalarish_type_p (t
);
3970 else if (cxx_dialect
> cxx98
)
3971 /* [class]/10: A POD struct is a class that is both a trivial class and a
3972 standard-layout class, and has no non-static data members of type
3973 non-POD struct, non-POD union (or array of such types).
3975 We don't need to check individual members because if a member is
3976 non-std-layout or non-trivial, the class will be too. */
3977 return (std_layout_type_p (t
) && trivial_type_p (t
));
3979 /* The C++98 definition of POD is different. */
3980 return !CLASSTYPE_NON_LAYOUT_POD_P (t
);
3983 /* Returns true iff T is POD for the purpose of layout, as defined in the
3987 layout_pod_type_p (const_tree t
)
3989 t
= strip_array_types (CONST_CAST_TREE (t
));
3991 if (CLASS_TYPE_P (t
))
3992 return !CLASSTYPE_NON_LAYOUT_POD_P (t
);
3994 return scalarish_type_p (t
);
3997 /* Returns true iff T is a standard-layout type, as defined in
4001 std_layout_type_p (const_tree t
)
4003 t
= strip_array_types (CONST_CAST_TREE (t
));
4005 if (CLASS_TYPE_P (t
))
4006 return !CLASSTYPE_NON_STD_LAYOUT (t
);
4008 return scalarish_type_p (t
);
4011 static bool record_has_unique_obj_representations (const_tree
, const_tree
);
4013 /* Returns true iff T satisfies std::has_unique_object_representations<T>,
4014 as defined in [meta.unary.prop]. */
4017 type_has_unique_obj_representations (const_tree t
)
4021 t
= strip_array_types (CONST_CAST_TREE (t
));
4023 if (!trivially_copyable_p (t
))
4026 if (CLASS_TYPE_P (t
) && CLASSTYPE_UNIQUE_OBJ_REPRESENTATIONS_SET (t
))
4027 return CLASSTYPE_UNIQUE_OBJ_REPRESENTATIONS (t
);
4029 switch (TREE_CODE (t
))
4033 case REFERENCE_TYPE
:
4034 /* If some backend has any paddings in these types, we should add
4035 a target hook for this and handle it there. */
4039 /* For bool values other than 0 and 1 should only appear with
4040 undefined behavior. */
4044 return type_has_unique_obj_representations (ENUM_UNDERLYING_TYPE (t
));
4047 /* XFmode certainly contains padding on x86, which the CPU doesn't store
4048 when storing long double values, so for that we have to return false.
4049 Other kinds of floating point values are questionable due to +.0/-.0
4050 and NaNs, let's play safe for now. */
4053 case FIXED_POINT_TYPE
:
4061 return type_has_unique_obj_representations (TREE_TYPE (t
));
4064 ret
= record_has_unique_obj_representations (t
, TYPE_SIZE (t
));
4065 if (CLASS_TYPE_P (t
))
4067 CLASSTYPE_UNIQUE_OBJ_REPRESENTATIONS_SET (t
) = 1;
4068 CLASSTYPE_UNIQUE_OBJ_REPRESENTATIONS (t
) = ret
;
4076 for (tree field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
4077 if (TREE_CODE (field
) == FIELD_DECL
)
4080 if (!type_has_unique_obj_representations (TREE_TYPE (field
))
4081 || simple_cst_equal (DECL_SIZE (field
), TYPE_SIZE (t
)) != 1)
4087 if (!any_fields
&& !integer_zerop (TYPE_SIZE (t
)))
4089 if (CLASS_TYPE_P (t
))
4091 CLASSTYPE_UNIQUE_OBJ_REPRESENTATIONS_SET (t
) = 1;
4092 CLASSTYPE_UNIQUE_OBJ_REPRESENTATIONS (t
) = ret
;
4107 /* Helper function for type_has_unique_obj_representations. */
4110 record_has_unique_obj_representations (const_tree t
, const_tree sz
)
4112 for (tree field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
4113 if (TREE_CODE (field
) != FIELD_DECL
)
4115 /* For bases, can't use type_has_unique_obj_representations here, as in
4116 struct S { int i : 24; S (); };
4117 struct T : public S { int j : 8; T (); };
4118 S doesn't have unique obj representations, but T does. */
4119 else if (DECL_FIELD_IS_BASE (field
))
4121 if (!record_has_unique_obj_representations (TREE_TYPE (field
),
4125 else if (DECL_C_BIT_FIELD (field
))
4127 tree btype
= DECL_BIT_FIELD_TYPE (field
);
4128 if (!type_has_unique_obj_representations (btype
))
4131 else if (!type_has_unique_obj_representations (TREE_TYPE (field
)))
4135 for (tree field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
4136 if (TREE_CODE (field
) == FIELD_DECL
)
4138 offset_int fld
= wi::to_offset (DECL_FIELD_OFFSET (field
));
4139 offset_int bitpos
= wi::to_offset (DECL_FIELD_BIT_OFFSET (field
));
4140 fld
= fld
* BITS_PER_UNIT
+ bitpos
;
4143 if (DECL_SIZE (field
))
4145 offset_int size
= wi::to_offset (DECL_SIZE (field
));
4149 if (cur
!= wi::to_offset (sz
))
4155 /* Nonzero iff type T is a class template implicit specialization. */
4158 class_tmpl_impl_spec_p (const_tree t
)
4160 return CLASS_TYPE_P (t
) && CLASSTYPE_TEMPLATE_INSTANTIATION (t
);
4163 /* Returns 1 iff zero initialization of type T means actually storing
4167 zero_init_p (const_tree t
)
4169 /* This CONST_CAST is okay because strip_array_types returns its
4170 argument unmodified and we assign it to a const_tree. */
4171 t
= strip_array_types (CONST_CAST_TREE(t
));
4173 if (t
== error_mark_node
)
4176 /* NULL pointers to data members are initialized with -1. */
4177 if (TYPE_PTRDATAMEM_P (t
))
4180 /* Classes that contain types that can't be zero-initialized, cannot
4181 be zero-initialized themselves. */
4182 if (CLASS_TYPE_P (t
) && CLASSTYPE_NON_ZERO_INIT_P (t
))
4188 /* Handle the C++17 [[nodiscard]] attribute, which is similar to the GNU
4189 warn_unused_result attribute. */
4192 handle_nodiscard_attribute (tree
*node
, tree name
, tree
/*args*/,
4193 int /*flags*/, bool *no_add_attrs
)
4195 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4197 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (*node
))))
4198 warning (OPT_Wattributes
, "%qE attribute applied to %qD with void "
4199 "return type", name
, *node
);
4201 else if (OVERLOAD_TYPE_P (*node
))
4205 warning (OPT_Wattributes
, "%qE attribute can only be applied to "
4206 "functions or to class or enumeration types", name
);
4207 *no_add_attrs
= true;
4212 /* Table of valid C++ attributes. */
4213 const struct attribute_spec cxx_attribute_table
[] =
4215 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
4216 affects_type_identity } */
4217 { "init_priority", 1, 1, true, false, false,
4218 handle_init_priority_attribute
, false },
4219 { "abi_tag", 1, -1, false, false, false,
4220 handle_abi_tag_attribute
, true },
4221 { NULL
, 0, 0, false, false, false, NULL
, false }
4224 /* Table of C++ standard attributes. */
4225 const struct attribute_spec std_attribute_table
[] =
4227 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
4228 affects_type_identity } */
4229 { "maybe_unused", 0, 0, false, false, false,
4230 handle_unused_attribute
, false },
4231 { "nodiscard", 0, 0, false, false, false,
4232 handle_nodiscard_attribute
, false },
4233 { NULL
, 0, 0, false, false, false, NULL
, false }
4236 /* Handle an "init_priority" attribute; arguments as in
4237 struct attribute_spec.handler. */
4239 handle_init_priority_attribute (tree
* node
,
4245 tree initp_expr
= TREE_VALUE (args
);
4247 tree type
= TREE_TYPE (decl
);
4250 STRIP_NOPS (initp_expr
);
4251 initp_expr
= default_conversion (initp_expr
);
4253 initp_expr
= maybe_constant_value (initp_expr
);
4255 if (!initp_expr
|| TREE_CODE (initp_expr
) != INTEGER_CST
)
4257 error ("requested init_priority is not an integer constant");
4258 cxx_constant_value (initp_expr
);
4259 *no_add_attrs
= true;
4263 pri
= TREE_INT_CST_LOW (initp_expr
);
4265 type
= strip_array_types (type
);
4267 if (decl
== NULL_TREE
4269 || !TREE_STATIC (decl
)
4270 || DECL_EXTERNAL (decl
)
4271 || (TREE_CODE (type
) != RECORD_TYPE
4272 && TREE_CODE (type
) != UNION_TYPE
)
4273 /* Static objects in functions are initialized the
4274 first time control passes through that
4275 function. This is not precise enough to pin down an
4276 init_priority value, so don't allow it. */
4277 || current_function_decl
)
4279 error ("can only use %qE attribute on file-scope definitions "
4280 "of objects of class type", name
);
4281 *no_add_attrs
= true;
4285 if (pri
> MAX_INIT_PRIORITY
|| pri
<= 0)
4287 error ("requested init_priority is out of range");
4288 *no_add_attrs
= true;
4292 /* Check for init_priorities that are reserved for
4293 language and runtime support implementations.*/
4294 if (pri
<= MAX_RESERVED_INIT_PRIORITY
)
4297 (0, "requested init_priority is reserved for internal use");
4300 if (SUPPORTS_INIT_PRIORITY
)
4302 SET_DECL_INIT_PRIORITY (decl
, pri
);
4303 DECL_HAS_INIT_PRIORITY_P (decl
) = 1;
4308 error ("%qE attribute is not supported on this platform", name
);
4309 *no_add_attrs
= true;
4314 /* DECL is being redeclared; the old declaration had the abi tags in OLD,
4315 and the new one has the tags in NEW_. Give an error if there are tags
4316 in NEW_ that weren't in OLD. */
4319 check_abi_tag_redeclaration (const_tree decl
, const_tree old
, const_tree new_
)
4321 if (old
&& TREE_CODE (TREE_VALUE (old
)) == TREE_LIST
)
4322 old
= TREE_VALUE (old
);
4323 if (new_
&& TREE_CODE (TREE_VALUE (new_
)) == TREE_LIST
)
4324 new_
= TREE_VALUE (new_
);
4326 for (const_tree t
= new_
; t
; t
= TREE_CHAIN (t
))
4328 tree str
= TREE_VALUE (t
);
4329 for (const_tree in
= old
; in
; in
= TREE_CHAIN (in
))
4331 tree ostr
= TREE_VALUE (in
);
4332 if (cp_tree_equal (str
, ostr
))
4335 error ("redeclaration of %qD adds abi tag %qE", decl
, str
);
4341 inform (DECL_SOURCE_LOCATION (decl
), "previous declaration here");
4347 /* The abi_tag attribute with the name NAME was given ARGS. If they are
4348 ill-formed, give an error and return false; otherwise, return true. */
4351 check_abi_tag_args (tree args
, tree name
)
4355 error ("the %qE attribute requires arguments", name
);
4358 for (tree arg
= args
; arg
; arg
= TREE_CHAIN (arg
))
4360 tree elt
= TREE_VALUE (arg
);
4361 if (TREE_CODE (elt
) != STRING_CST
4362 || (!same_type_ignoring_top_level_qualifiers_p
4363 (strip_array_types (TREE_TYPE (elt
)),
4366 error ("arguments to the %qE attribute must be narrow string "
4370 const char *begin
= TREE_STRING_POINTER (elt
);
4371 const char *end
= begin
+ TREE_STRING_LENGTH (elt
);
4372 for (const char *p
= begin
; p
!= end
; ++p
)
4377 if (!ISALPHA (c
) && c
!= '_')
4379 error ("arguments to the %qE attribute must contain valid "
4380 "identifiers", name
);
4381 inform (input_location
, "%<%c%> is not a valid first "
4382 "character for an identifier", c
);
4386 else if (p
== end
- 1)
4387 gcc_assert (c
== 0);
4390 if (!ISALNUM (c
) && c
!= '_')
4392 error ("arguments to the %qE attribute must contain valid "
4393 "identifiers", name
);
4394 inform (input_location
, "%<%c%> is not a valid character "
4395 "in an identifier", c
);
4404 /* Handle an "abi_tag" attribute; arguments as in
4405 struct attribute_spec.handler. */
4408 handle_abi_tag_attribute (tree
* node
, tree name
, tree args
,
4409 int flags
, bool* no_add_attrs
)
4411 if (!check_abi_tag_args (args
, name
))
4416 if (!OVERLOAD_TYPE_P (*node
))
4418 error ("%qE attribute applied to non-class, non-enum type %qT",
4422 else if (!(flags
& (int)ATTR_FLAG_TYPE_IN_PLACE
))
4424 error ("%qE attribute applied to %qT after its definition",
4428 else if (CLASS_TYPE_P (*node
)
4429 && CLASSTYPE_TEMPLATE_INSTANTIATION (*node
))
4431 warning (OPT_Wattributes
, "ignoring %qE attribute applied to "
4432 "template instantiation %qT", name
, *node
);
4435 else if (CLASS_TYPE_P (*node
)
4436 && CLASSTYPE_TEMPLATE_SPECIALIZATION (*node
))
4438 warning (OPT_Wattributes
, "ignoring %qE attribute applied to "
4439 "template specialization %qT", name
, *node
);
4443 tree attributes
= TYPE_ATTRIBUTES (*node
);
4444 tree decl
= TYPE_NAME (*node
);
4446 /* Make sure all declarations have the same abi tags. */
4447 if (DECL_SOURCE_LOCATION (decl
) != input_location
)
4449 if (!check_abi_tag_redeclaration (decl
,
4450 lookup_attribute ("abi_tag",
4458 if (!VAR_OR_FUNCTION_DECL_P (*node
))
4460 error ("%qE attribute applied to non-function, non-variable %qD",
4464 else if (DECL_LANGUAGE (*node
) == lang_c
)
4466 error ("%qE attribute applied to extern \"C\" declaration %qD",
4475 *no_add_attrs
= true;
4479 /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the
4480 thing pointed to by the constant. */
4483 make_ptrmem_cst (tree type
, tree member
)
4485 tree ptrmem_cst
= make_node (PTRMEM_CST
);
4486 TREE_TYPE (ptrmem_cst
) = type
;
4487 PTRMEM_CST_MEMBER (ptrmem_cst
) = member
;
4491 /* Build a variant of TYPE that has the indicated ATTRIBUTES. May
4492 return an existing type if an appropriate type already exists. */
4495 cp_build_type_attribute_variant (tree type
, tree attributes
)
4499 new_type
= build_type_attribute_variant (type
, attributes
);
4500 if (TREE_CODE (new_type
) == FUNCTION_TYPE
4501 || TREE_CODE (new_type
) == METHOD_TYPE
)
4503 new_type
= build_exception_variant (new_type
,
4504 TYPE_RAISES_EXCEPTIONS (type
));
4505 new_type
= build_ref_qualified_type (new_type
,
4506 type_memfn_rqual (type
));
4509 /* Making a new main variant of a class type is broken. */
4510 gcc_assert (!CLASS_TYPE_P (type
) || new_type
== type
);
4515 /* Return TRUE if TYPE1 and TYPE2 are identical for type hashing purposes.
4516 Called only after doing all language independent checks. */
4519 cxx_type_hash_eq (const_tree typea
, const_tree typeb
)
4521 gcc_assert (TREE_CODE (typea
) == FUNCTION_TYPE
4522 || TREE_CODE (typea
) == METHOD_TYPE
);
4524 if (type_memfn_rqual (typea
) != type_memfn_rqual (typeb
))
4526 return comp_except_specs (TYPE_RAISES_EXCEPTIONS (typea
),
4527 TYPE_RAISES_EXCEPTIONS (typeb
), ce_exact
);
4530 /* Apply FUNC to all language-specific sub-trees of TP in a pre-order
4531 traversal. Called from walk_tree. */
4534 cp_walk_subtrees (tree
*tp
, int *walk_subtrees_p
, walk_tree_fn func
,
4535 void *data
, hash_set
<tree
> *pset
)
4537 enum tree_code code
= TREE_CODE (*tp
);
4540 #define WALK_SUBTREE(NODE) \
4543 result = cp_walk_tree (&(NODE), func, data, pset); \
4544 if (result) goto out; \
4548 /* Not one of the easy cases. We must explicitly go through the
4554 case TEMPLATE_TEMPLATE_PARM
:
4555 case BOUND_TEMPLATE_TEMPLATE_PARM
:
4556 case UNBOUND_CLASS_TEMPLATE
:
4557 case TEMPLATE_PARM_INDEX
:
4558 case TEMPLATE_TYPE_PARM
:
4561 case UNDERLYING_TYPE
:
4562 /* None of these have subtrees other than those already walked
4564 *walk_subtrees_p
= 0;
4568 WALK_SUBTREE (BASELINK_FUNCTIONS (*tp
));
4569 *walk_subtrees_p
= 0;
4573 WALK_SUBTREE (TREE_TYPE (*tp
));
4574 *walk_subtrees_p
= 0;
4578 WALK_SUBTREE (TREE_PURPOSE (*tp
));
4582 WALK_SUBTREE (OVL_FUNCTION (*tp
));
4583 WALK_SUBTREE (OVL_CHAIN (*tp
));
4584 *walk_subtrees_p
= 0;
4588 WALK_SUBTREE (DECL_NAME (*tp
));
4589 WALK_SUBTREE (USING_DECL_SCOPE (*tp
));
4590 WALK_SUBTREE (USING_DECL_DECLS (*tp
));
4591 *walk_subtrees_p
= 0;
4595 if (TYPE_PTRMEMFUNC_P (*tp
))
4596 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE_RAW (*tp
));
4599 case TYPE_ARGUMENT_PACK
:
4600 case NONTYPE_ARGUMENT_PACK
:
4602 tree args
= ARGUMENT_PACK_ARGS (*tp
);
4603 int i
, len
= TREE_VEC_LENGTH (args
);
4604 for (i
= 0; i
< len
; i
++)
4605 WALK_SUBTREE (TREE_VEC_ELT (args
, i
));
4609 case TYPE_PACK_EXPANSION
:
4610 WALK_SUBTREE (TREE_TYPE (*tp
));
4611 WALK_SUBTREE (PACK_EXPANSION_EXTRA_ARGS (*tp
));
4612 *walk_subtrees_p
= 0;
4615 case EXPR_PACK_EXPANSION
:
4616 WALK_SUBTREE (TREE_OPERAND (*tp
, 0));
4617 WALK_SUBTREE (PACK_EXPANSION_EXTRA_ARGS (*tp
));
4618 *walk_subtrees_p
= 0;
4622 case REINTERPRET_CAST_EXPR
:
4623 case STATIC_CAST_EXPR
:
4624 case CONST_CAST_EXPR
:
4625 case DYNAMIC_CAST_EXPR
:
4626 case IMPLICIT_CONV_EXPR
:
4627 if (TREE_TYPE (*tp
))
4628 WALK_SUBTREE (TREE_TYPE (*tp
));
4632 for (i
= 0; i
< TREE_CODE_LENGTH (TREE_CODE (*tp
)); ++i
)
4633 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
4635 *walk_subtrees_p
= 0;
4639 WALK_SUBTREE (TRAIT_EXPR_TYPE1 (*tp
));
4640 WALK_SUBTREE (TRAIT_EXPR_TYPE2 (*tp
));
4641 *walk_subtrees_p
= 0;
4645 WALK_SUBTREE (DECLTYPE_TYPE_EXPR (*tp
));
4646 *walk_subtrees_p
= 0;
4650 // Only recurse through the nested expression. Do not
4651 // walk the parameter list. Doing so causes false
4652 // positives in the pack expansion checker since the
4653 // requires parameters are introduced as pack expansions.
4654 WALK_SUBTREE (TREE_OPERAND (*tp
, 1));
4655 *walk_subtrees_p
= 0;
4659 /* User variables should be mentioned in BIND_EXPR_VARS
4660 and their initializers and sizes walked when walking
4661 the containing BIND_EXPR. Compiler temporaries are
4663 if (VAR_P (TREE_OPERAND (*tp
, 0))
4664 && DECL_ARTIFICIAL (TREE_OPERAND (*tp
, 0))
4665 && !TREE_STATIC (TREE_OPERAND (*tp
, 0)))
4667 tree decl
= TREE_OPERAND (*tp
, 0);
4668 WALK_SUBTREE (DECL_INITIAL (decl
));
4669 WALK_SUBTREE (DECL_SIZE (decl
));
4670 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
4678 /* We didn't find what we were looking for. */
4685 /* Like save_expr, but for C++. */
4688 cp_save_expr (tree expr
)
4690 /* There is no reason to create a SAVE_EXPR within a template; if
4691 needed, we can create the SAVE_EXPR when instantiating the
4692 template. Furthermore, the middle-end cannot handle C++-specific
4694 if (processing_template_decl
)
4696 return save_expr (expr
);
4699 /* Initialize tree.c. */
4704 list_hash_table
= hash_table
<list_hasher
>::create_ggc (61);
4705 register_scoped_attributes (std_attribute_table
, NULL
);
4708 /* Returns the kind of special function that DECL (a FUNCTION_DECL)
4709 is. Note that sfk_none is zero, so this function can be used as a
4710 predicate to test whether or not DECL is a special function. */
4712 special_function_kind
4713 special_function_p (const_tree decl
)
4715 /* Rather than doing all this stuff with magic names, we should
4716 probably have a field of type `special_function_kind' in
4717 DECL_LANG_SPECIFIC. */
4718 if (DECL_INHERITED_CTOR (decl
))
4719 return sfk_inheriting_constructor
;
4720 if (DECL_COPY_CONSTRUCTOR_P (decl
))
4721 return sfk_copy_constructor
;
4722 if (DECL_MOVE_CONSTRUCTOR_P (decl
))
4723 return sfk_move_constructor
;
4724 if (DECL_CONSTRUCTOR_P (decl
))
4725 return sfk_constructor
;
4726 if (DECL_OVERLOADED_OPERATOR_P (decl
) == NOP_EXPR
)
4728 if (copy_fn_p (decl
))
4729 return sfk_copy_assignment
;
4730 if (move_fn_p (decl
))
4731 return sfk_move_assignment
;
4733 if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl
))
4734 return sfk_destructor
;
4735 if (DECL_COMPLETE_DESTRUCTOR_P (decl
))
4736 return sfk_complete_destructor
;
4737 if (DECL_BASE_DESTRUCTOR_P (decl
))
4738 return sfk_base_destructor
;
4739 if (DECL_DELETING_DESTRUCTOR_P (decl
))
4740 return sfk_deleting_destructor
;
4741 if (DECL_CONV_FN_P (decl
))
4742 return sfk_conversion
;
4743 if (deduction_guide_p (decl
))
4744 return sfk_deduction_guide
;
4749 /* Returns nonzero if TYPE is a character type, including wchar_t. */
4752 char_type_p (tree type
)
4754 return (same_type_p (type
, char_type_node
)
4755 || same_type_p (type
, unsigned_char_type_node
)
4756 || same_type_p (type
, signed_char_type_node
)
4757 || same_type_p (type
, char16_type_node
)
4758 || same_type_p (type
, char32_type_node
)
4759 || same_type_p (type
, wchar_type_node
));
4762 /* Returns the kind of linkage associated with the indicated DECL. Th
4763 value returned is as specified by the language standard; it is
4764 independent of implementation details regarding template
4765 instantiation, etc. For example, it is possible that a declaration
4766 to which this function assigns external linkage would not show up
4767 as a global symbol when you run `nm' on the resulting object file. */
4770 decl_linkage (tree decl
)
4772 /* This function doesn't attempt to calculate the linkage from first
4773 principles as given in [basic.link]. Instead, it makes use of
4774 the fact that we have already set TREE_PUBLIC appropriately, and
4775 then handles a few special cases. Ideally, we would calculate
4776 linkage first, and then transform that into a concrete
4779 /* Things that don't have names have no linkage. */
4780 if (!DECL_NAME (decl
))
4783 /* Fields have no linkage. */
4784 if (TREE_CODE (decl
) == FIELD_DECL
)
4787 /* Things that are TREE_PUBLIC have external linkage. */
4788 if (TREE_PUBLIC (decl
))
4791 /* maybe_thunk_body clears TREE_PUBLIC on the maybe-in-charge 'tor variants,
4792 check one of the "clones" for the real linkage. */
4793 if ((DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl
)
4794 || DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl
))
4795 && DECL_CHAIN (decl
)
4796 && DECL_CLONED_FUNCTION (DECL_CHAIN (decl
)))
4797 return decl_linkage (DECL_CHAIN (decl
));
4799 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
4802 /* Linkage of a CONST_DECL depends on the linkage of the enumeration
4804 if (TREE_CODE (decl
) == CONST_DECL
)
4805 return decl_linkage (TYPE_NAME (DECL_CONTEXT (decl
)));
4807 /* Things in local scope do not have linkage, if they don't have
4809 if (decl_function_context (decl
))
4812 /* Members of the anonymous namespace also have TREE_PUBLIC unset, but
4813 are considered to have external linkage for language purposes, as do
4814 template instantiations on targets without weak symbols. DECLs really
4815 meant to have internal linkage have DECL_THIS_STATIC set. */
4816 if (TREE_CODE (decl
) == TYPE_DECL
)
4818 if (VAR_OR_FUNCTION_DECL_P (decl
))
4820 if (!DECL_THIS_STATIC (decl
))
4823 /* Static data members and static member functions from classes
4824 in anonymous namespace also don't have TREE_PUBLIC set. */
4825 if (DECL_CLASS_CONTEXT (decl
))
4829 /* Everything else has internal linkage. */
4833 /* Returns the storage duration of the object or reference associated with
4834 the indicated DECL, which should be a VAR_DECL or PARM_DECL. */
4837 decl_storage_duration (tree decl
)
4839 if (TREE_CODE (decl
) == PARM_DECL
)
4841 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4843 gcc_assert (VAR_P (decl
));
4844 if (!TREE_STATIC (decl
)
4845 && !DECL_EXTERNAL (decl
))
4847 if (CP_DECL_THREAD_LOCAL_P (decl
))
4852 /* EXP is an expression that we want to pre-evaluate. Returns (in
4853 *INITP) an expression that will perform the pre-evaluation. The
4854 value returned by this function is a side-effect free expression
4855 equivalent to the pre-evaluated expression. Callers must ensure
4856 that *INITP is evaluated before EXP. */
4859 stabilize_expr (tree exp
, tree
* initp
)
4863 if (!TREE_SIDE_EFFECTS (exp
))
4864 init_expr
= NULL_TREE
;
4865 else if (VOID_TYPE_P (TREE_TYPE (exp
)))
4870 /* There are no expressions with REFERENCE_TYPE, but there can be call
4871 arguments with such a type; just treat it as a pointer. */
4872 else if (TREE_CODE (TREE_TYPE (exp
)) == REFERENCE_TYPE
4873 || SCALAR_TYPE_P (TREE_TYPE (exp
))
4874 || !glvalue_p (exp
))
4876 init_expr
= get_target_expr (exp
);
4877 exp
= TARGET_EXPR_SLOT (init_expr
);
4878 if (CLASS_TYPE_P (TREE_TYPE (exp
)))
4885 bool xval
= !lvalue_p (exp
);
4886 exp
= cp_build_addr_expr (exp
, tf_warning_or_error
);
4887 init_expr
= get_target_expr (exp
);
4888 exp
= TARGET_EXPR_SLOT (init_expr
);
4889 exp
= cp_build_indirect_ref (exp
, RO_NULL
, tf_warning_or_error
);
4895 gcc_assert (!TREE_SIDE_EFFECTS (exp
));
4899 /* Add NEW_EXPR, an expression whose value we don't care about, after the
4900 similar expression ORIG. */
4903 add_stmt_to_compound (tree orig
, tree new_expr
)
4905 if (!new_expr
|| !TREE_SIDE_EFFECTS (new_expr
))
4907 if (!orig
|| !TREE_SIDE_EFFECTS (orig
))
4909 return build2 (COMPOUND_EXPR
, void_type_node
, orig
, new_expr
);
4912 /* Like stabilize_expr, but for a call whose arguments we want to
4913 pre-evaluate. CALL is modified in place to use the pre-evaluated
4914 arguments, while, upon return, *INITP contains an expression to
4915 compute the arguments. */
4918 stabilize_call (tree call
, tree
*initp
)
4920 tree inits
= NULL_TREE
;
4922 int nargs
= call_expr_nargs (call
);
4924 if (call
== error_mark_node
|| processing_template_decl
)
4930 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
4932 for (i
= 0; i
< nargs
; i
++)
4935 CALL_EXPR_ARG (call
, i
) =
4936 stabilize_expr (CALL_EXPR_ARG (call
, i
), &init
);
4937 inits
= add_stmt_to_compound (inits
, init
);
4943 /* Like stabilize_expr, but for an AGGR_INIT_EXPR whose arguments we want
4944 to pre-evaluate. CALL is modified in place to use the pre-evaluated
4945 arguments, while, upon return, *INITP contains an expression to
4946 compute the arguments. */
4949 stabilize_aggr_init (tree call
, tree
*initp
)
4951 tree inits
= NULL_TREE
;
4953 int nargs
= aggr_init_expr_nargs (call
);
4955 if (call
== error_mark_node
)
4958 gcc_assert (TREE_CODE (call
) == AGGR_INIT_EXPR
);
4960 for (i
= 0; i
< nargs
; i
++)
4963 AGGR_INIT_EXPR_ARG (call
, i
) =
4964 stabilize_expr (AGGR_INIT_EXPR_ARG (call
, i
), &init
);
4965 inits
= add_stmt_to_compound (inits
, init
);
4971 /* Like stabilize_expr, but for an initialization.
4973 If the initialization is for an object of class type, this function
4974 takes care not to introduce additional temporaries.
4976 Returns TRUE iff the expression was successfully pre-evaluated,
4977 i.e., if INIT is now side-effect free, except for, possibly, a
4978 single call to a constructor. */
4981 stabilize_init (tree init
, tree
*initp
)
4987 if (t
== error_mark_node
|| processing_template_decl
)
4990 if (TREE_CODE (t
) == INIT_EXPR
)
4991 t
= TREE_OPERAND (t
, 1);
4992 if (TREE_CODE (t
) == TARGET_EXPR
)
4993 t
= TARGET_EXPR_INITIAL (t
);
4995 /* If the RHS can be stabilized without breaking copy elision, stabilize
4996 it. We specifically don't stabilize class prvalues here because that
4997 would mean an extra copy, but they might be stabilized below. */
4998 if (TREE_CODE (init
) == INIT_EXPR
4999 && TREE_CODE (t
) != CONSTRUCTOR
5000 && TREE_CODE (t
) != AGGR_INIT_EXPR
5001 && (SCALAR_TYPE_P (TREE_TYPE (t
))
5004 TREE_OPERAND (init
, 1) = stabilize_expr (t
, initp
);
5008 if (TREE_CODE (t
) == COMPOUND_EXPR
5009 && TREE_CODE (init
) == INIT_EXPR
)
5011 tree last
= expr_last (t
);
5012 /* Handle stabilizing the EMPTY_CLASS_EXPR pattern. */
5013 if (!TREE_SIDE_EFFECTS (last
))
5016 TREE_OPERAND (init
, 1) = last
;
5021 if (TREE_CODE (t
) == CONSTRUCTOR
)
5023 /* Aggregate initialization: stabilize each of the field
5026 constructor_elt
*ce
;
5028 vec
<constructor_elt
, va_gc
> *v
= CONSTRUCTOR_ELTS (t
);
5029 for (i
= 0; vec_safe_iterate (v
, i
, &ce
); ++i
)
5031 tree type
= TREE_TYPE (ce
->value
);
5033 if (TREE_CODE (type
) == REFERENCE_TYPE
5034 || SCALAR_TYPE_P (type
))
5035 ce
->value
= stabilize_expr (ce
->value
, &subinit
);
5036 else if (!stabilize_init (ce
->value
, &subinit
))
5038 *initp
= add_stmt_to_compound (*initp
, subinit
);
5043 if (TREE_CODE (t
) == CALL_EXPR
)
5045 stabilize_call (t
, initp
);
5049 if (TREE_CODE (t
) == AGGR_INIT_EXPR
)
5051 stabilize_aggr_init (t
, initp
);
5055 /* The initialization is being performed via a bitwise copy -- and
5056 the item copied may have side effects. */
5057 return !TREE_SIDE_EFFECTS (init
);
5060 /* Returns true if a cast to TYPE may appear in an integral constant
5064 cast_valid_in_integral_constant_expression_p (tree type
)
5066 return (INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
5067 || cxx_dialect
>= cxx11
5068 || dependent_type_p (type
)
5069 || type
== error_mark_node
);
5072 /* Return true if we need to fix linkage information of DECL. */
5075 cp_fix_function_decl_p (tree decl
)
5077 /* Skip if DECL is not externally visible. */
5078 if (!TREE_PUBLIC (decl
))
5081 /* We need to fix DECL if it a appears to be exported but with no
5082 function body. Thunks do not have CFGs and we may need to
5083 handle them specially later. */
5084 if (!gimple_has_body_p (decl
)
5085 && !DECL_THUNK_P (decl
)
5086 && !DECL_EXTERNAL (decl
))
5088 struct cgraph_node
*node
= cgraph_node::get (decl
);
5090 /* Don't fix same_body aliases. Although they don't have their own
5091 CFG, they share it with what they alias to. */
5092 if (!node
|| !node
->alias
5093 || !vec_safe_length (node
->ref_list
.references
))
5100 /* Clean the C++ specific parts of the tree T. */
5103 cp_free_lang_data (tree t
)
5105 if (TREE_CODE (t
) == METHOD_TYPE
5106 || TREE_CODE (t
) == FUNCTION_TYPE
)
5108 /* Default args are not interesting anymore. */
5109 tree argtypes
= TYPE_ARG_TYPES (t
);
5112 TREE_PURPOSE (argtypes
) = 0;
5113 argtypes
= TREE_CHAIN (argtypes
);
5116 else if (TREE_CODE (t
) == FUNCTION_DECL
5117 && cp_fix_function_decl_p (t
))
5119 /* If T is used in this translation unit at all, the definition
5120 must exist somewhere else since we have decided to not emit it
5121 in this TU. So make it an external reference. */
5122 DECL_EXTERNAL (t
) = 1;
5123 TREE_STATIC (t
) = 0;
5125 if (TREE_CODE (t
) == NAMESPACE_DECL
)
5126 /* We do not need the leftover chaining of namespaces from the
5128 DECL_CHAIN (t
) = NULL_TREE
;
5131 /* Stub for c-common. Please keep in sync with c-decl.c.
5132 FIXME: If address space support is target specific, then this
5133 should be a C target hook. But currently this is not possible,
5134 because this function is called via REGISTER_TARGET_PRAGMAS. */
5136 c_register_addr_space (const char * /*word*/, addr_space_t
/*as*/)
5140 /* Return the number of operands in T that we care about for things like
5144 cp_tree_operand_length (const_tree t
)
5146 enum tree_code code
= TREE_CODE (t
);
5148 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
5149 return VL_EXP_OPERAND_LENGTH (t
);
5151 return cp_tree_code_length (code
);
5154 /* Like cp_tree_operand_length, but takes a tree_code CODE. */
5157 cp_tree_code_length (enum tree_code code
)
5159 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
5163 case PREINCREMENT_EXPR
:
5164 case PREDECREMENT_EXPR
:
5165 case POSTINCREMENT_EXPR
:
5166 case POSTDECREMENT_EXPR
:
5172 case EXPR_PACK_EXPANSION
:
5176 return TREE_CODE_LENGTH (code
);
5180 /* Implement -Wzero_as_null_pointer_constant. Return true if the
5181 conditions for the warning hold, false otherwise. */
5183 maybe_warn_zero_as_null_pointer_constant (tree expr
, location_t loc
)
5185 if (c_inhibit_evaluation_warnings
== 0
5186 && !NULLPTR_TYPE_P (TREE_TYPE (expr
)))
5188 warning_at (loc
, OPT_Wzero_as_null_pointer_constant
,
5189 "zero as null pointer constant");
5195 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
5196 /* Complain that some language-specific thing hanging off a tree
5197 node has been accessed improperly. */
5200 lang_check_failed (const char* file
, int line
, const char* function
)
5202 internal_error ("lang_* check: failed in %s, at %s:%d",
5203 function
, trim_filename (file
), line
);
5205 #endif /* ENABLE_TREE_CHECKING */
5207 #include "gt-cp-tree.h"