1 /* Language-dependent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2016 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"
37 static tree
bot_manip (tree
*, int *, void *);
38 static tree
bot_replace (tree
*, int *, void *);
39 static hashval_t
list_hash_pieces (tree
, tree
, tree
);
40 static tree
build_target_expr (tree
, tree
, tsubst_flags_t
);
41 static tree
count_trees_r (tree
*, int *, void *);
42 static tree
verify_stmt_tree_r (tree
*, int *, void *);
43 static tree
build_local_temp (tree
);
45 static tree
handle_init_priority_attribute (tree
*, tree
, tree
, int, bool *);
46 static tree
handle_abi_tag_attribute (tree
*, tree
, tree
, int, bool *);
48 /* If REF is an lvalue, returns the kind of lvalue that REF is.
49 Otherwise, returns clk_none. */
52 lvalue_kind (const_tree ref
)
54 cp_lvalue_kind op1_lvalue_kind
= clk_none
;
55 cp_lvalue_kind op2_lvalue_kind
= clk_none
;
57 /* Expressions of reference type are sometimes wrapped in
58 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
59 representation, not part of the language, so we have to look
61 if (REFERENCE_REF_P (ref
))
62 return lvalue_kind (TREE_OPERAND (ref
, 0));
65 && TREE_CODE (TREE_TYPE (ref
)) == REFERENCE_TYPE
)
67 /* unnamed rvalue references are rvalues */
68 if (TYPE_REF_IS_RVALUE (TREE_TYPE (ref
))
69 && TREE_CODE (ref
) != PARM_DECL
71 && TREE_CODE (ref
) != COMPONENT_REF
72 /* Functions are always lvalues. */
73 && TREE_CODE (TREE_TYPE (TREE_TYPE (ref
))) != FUNCTION_TYPE
)
76 /* lvalue references and named rvalue references are lvalues. */
80 if (ref
== current_class_ptr
)
83 switch (TREE_CODE (ref
))
87 /* preincrements and predecrements are valid lvals, provided
88 what they refer to are valid lvals. */
89 case PREINCREMENT_EXPR
:
90 case PREDECREMENT_EXPR
:
92 case WITH_CLEANUP_EXPR
:
95 return lvalue_kind (TREE_OPERAND (ref
, 0));
99 if (TREE_CODE (ref
) == MEMBER_REF
)
100 op1_lvalue_kind
= clk_ordinary
;
102 op1_lvalue_kind
= lvalue_kind (TREE_OPERAND (ref
, 0));
103 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (ref
, 1))))
104 op1_lvalue_kind
= clk_none
;
105 return op1_lvalue_kind
;
108 op1_lvalue_kind
= lvalue_kind (TREE_OPERAND (ref
, 0));
109 /* Look at the member designator. */
110 if (!op1_lvalue_kind
)
112 else if (is_overloaded_fn (TREE_OPERAND (ref
, 1)))
113 /* The "field" can be a FUNCTION_DECL or an OVERLOAD in some
114 situations. If we're seeing a COMPONENT_REF, it's a non-static
115 member, so it isn't an lvalue. */
116 op1_lvalue_kind
= clk_none
;
117 else if (TREE_CODE (TREE_OPERAND (ref
, 1)) != FIELD_DECL
)
118 /* This can be IDENTIFIER_NODE in a template. */;
119 else if (DECL_C_BIT_FIELD (TREE_OPERAND (ref
, 1)))
121 /* Clear the ordinary bit. If this object was a class
122 rvalue we want to preserve that information. */
123 op1_lvalue_kind
&= ~clk_ordinary
;
124 /* The lvalue is for a bitfield. */
125 op1_lvalue_kind
|= clk_bitfield
;
127 else if (DECL_PACKED (TREE_OPERAND (ref
, 1)))
128 op1_lvalue_kind
|= clk_packed
;
130 return op1_lvalue_kind
;
133 case COMPOUND_LITERAL_EXPR
:
137 /* CONST_DECL without TREE_STATIC are enumeration values and
138 thus not lvalues. With TREE_STATIC they are used by ObjC++
139 in objc_build_string_object and need to be considered as
141 if (! TREE_STATIC (ref
))
145 if (DECL_HAS_VALUE_EXPR_P (ref
))
146 return lvalue_kind (DECL_VALUE_EXPR (CONST_CAST_TREE (ref
)));
148 if (TREE_READONLY (ref
) && ! TREE_STATIC (ref
)
149 && DECL_LANG_SPECIFIC (ref
)
150 && DECL_IN_AGGR_P (ref
))
156 case ARRAY_NOTATION_REF
:
159 case PLACEHOLDER_EXPR
:
162 /* A scope ref in a template, left as SCOPE_REF to support later
165 gcc_assert (!type_dependent_expression_p (CONST_CAST_TREE (ref
)));
167 tree op
= TREE_OPERAND (ref
, 1);
168 if (TREE_CODE (op
) == FIELD_DECL
)
169 return (DECL_C_BIT_FIELD (op
) ? clk_bitfield
: clk_ordinary
);
171 return lvalue_kind (op
);
176 /* Disallow <? and >? as lvalues if either argument side-effects. */
177 if (TREE_SIDE_EFFECTS (TREE_OPERAND (ref
, 0))
178 || TREE_SIDE_EFFECTS (TREE_OPERAND (ref
, 1)))
180 op1_lvalue_kind
= lvalue_kind (TREE_OPERAND (ref
, 0));
181 op2_lvalue_kind
= lvalue_kind (TREE_OPERAND (ref
, 1));
185 op1_lvalue_kind
= lvalue_kind (TREE_OPERAND (ref
, 1)
186 ? TREE_OPERAND (ref
, 1)
187 : TREE_OPERAND (ref
, 0));
188 op2_lvalue_kind
= lvalue_kind (TREE_OPERAND (ref
, 2));
192 /* We expect to see unlowered MODOP_EXPRs only during
193 template processing. */
194 gcc_assert (processing_template_decl
);
202 return lvalue_kind (TREE_OPERAND (ref
, 1));
208 return (CLASS_TYPE_P (TREE_TYPE (ref
)) ? clk_class
: clk_none
);
211 /* We can see calls outside of TARGET_EXPR in templates. */
212 if (CLASS_TYPE_P (TREE_TYPE (ref
)))
217 /* All functions (except non-static-member functions) are
219 return (DECL_NONSTATIC_MEMBER_FUNCTION_P (ref
)
220 ? clk_none
: clk_ordinary
);
223 /* We now represent a reference to a single static member function
225 /* This CONST_CAST is okay because BASELINK_FUNCTIONS returns
226 its argument unmodified and we assign it to a const_tree. */
227 return lvalue_kind (BASELINK_FUNCTIONS (CONST_CAST_TREE (ref
)));
229 case NON_DEPENDENT_EXPR
:
230 return lvalue_kind (TREE_OPERAND (ref
, 0));
233 if (!TREE_TYPE (ref
))
235 if (CLASS_TYPE_P (TREE_TYPE (ref
)))
240 /* If one operand is not an lvalue at all, then this expression is
242 if (!op1_lvalue_kind
|| !op2_lvalue_kind
)
245 /* Otherwise, it's an lvalue, and it has all the odd properties
246 contributed by either operand. */
247 op1_lvalue_kind
= op1_lvalue_kind
| op2_lvalue_kind
;
248 /* It's not an ordinary lvalue if it involves any other kind. */
249 if ((op1_lvalue_kind
& ~clk_ordinary
) != clk_none
)
250 op1_lvalue_kind
&= ~clk_ordinary
;
251 /* It can't be both a pseudo-lvalue and a non-addressable lvalue.
252 A COND_EXPR of those should be wrapped in a TARGET_EXPR. */
253 if ((op1_lvalue_kind
& (clk_rvalueref
|clk_class
))
254 && (op1_lvalue_kind
& (clk_bitfield
|clk_packed
)))
255 op1_lvalue_kind
= clk_none
;
256 return op1_lvalue_kind
;
259 /* Returns the kind of lvalue that REF is, in the sense of [basic.lval]. */
262 real_lvalue_p (const_tree ref
)
264 cp_lvalue_kind kind
= lvalue_kind (ref
);
265 if (kind
& (clk_rvalueref
|clk_class
))
271 /* c-common wants us to return bool. */
274 lvalue_p (const_tree t
)
276 return real_lvalue_p (t
);
279 /* This differs from lvalue_p in that xvalues are included. */
282 glvalue_p (const_tree ref
)
284 cp_lvalue_kind kind
= lvalue_kind (ref
);
285 if (kind
& clk_class
)
288 return (kind
!= clk_none
);
291 /* This differs from glvalue_p in that class prvalues are included. */
294 obvalue_p (const_tree ref
)
296 return (lvalue_kind (ref
) != clk_none
);
299 /* Returns true if REF is an xvalue (the result of dereferencing an rvalue
300 reference), false otherwise. */
303 xvalue_p (const_tree ref
)
305 return (lvalue_kind (ref
) == clk_rvalueref
);
308 /* C++-specific version of stabilize_reference. */
311 cp_stabilize_reference (tree ref
)
313 switch (TREE_CODE (ref
))
315 /* We need to treat specially anything stabilize_reference doesn't
316 handle specifically. */
327 case ARRAY_RANGE_REF
:
331 cp_lvalue_kind kind
= lvalue_kind (ref
);
332 if ((kind
& ~clk_class
) != clk_none
)
334 tree type
= unlowered_expr_type (ref
);
335 bool rval
= !!(kind
& clk_rvalueref
);
336 type
= cp_build_reference_type (type
, rval
);
337 /* This inhibits warnings in, eg, cxx_mark_addressable
339 warning_sentinel
s (extra_warnings
);
340 ref
= build_static_cast (type
, ref
, tf_error
);
344 return stabilize_reference (ref
);
347 /* Test whether DECL is a builtin that may appear in a
348 constant-expression. */
351 builtin_valid_in_constant_expr_p (const_tree decl
)
353 if (!(TREE_CODE (decl
) == FUNCTION_DECL
354 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
))
355 /* Not a built-in. */
357 switch (DECL_FUNCTION_CODE (decl
))
359 /* These always have constant results like the corresponding
362 case BUILT_IN_FUNCTION
:
365 /* The following built-ins are valid in constant expressions
366 when their arguments are. */
367 case BUILT_IN_ADD_OVERFLOW_P
:
368 case BUILT_IN_SUB_OVERFLOW_P
:
369 case BUILT_IN_MUL_OVERFLOW_P
:
371 /* These have constant results even if their operands are
373 case BUILT_IN_CONSTANT_P
:
374 case BUILT_IN_ATOMIC_ALWAYS_LOCK_FREE
:
381 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
384 build_target_expr (tree decl
, tree value
, tsubst_flags_t complain
)
387 tree type
= TREE_TYPE (decl
);
389 value
= mark_rvalue_use (value
);
391 gcc_checking_assert (VOID_TYPE_P (TREE_TYPE (value
))
392 || TREE_TYPE (decl
) == TREE_TYPE (value
)
393 /* On ARM ctors return 'this'. */
394 || (TYPE_PTR_P (TREE_TYPE (value
))
395 && TREE_CODE (value
) == CALL_EXPR
)
396 || useless_type_conversion_p (TREE_TYPE (decl
),
399 t
= cxx_maybe_build_cleanup (decl
, complain
);
400 if (t
== error_mark_node
)
401 return error_mark_node
;
402 t
= build4 (TARGET_EXPR
, type
, decl
, value
, t
, NULL_TREE
);
403 if (EXPR_HAS_LOCATION (value
))
404 SET_EXPR_LOCATION (t
, EXPR_LOCATION (value
));
405 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
406 ignore the TARGET_EXPR. If there really turn out to be no
407 side-effects, then the optimizer should be able to get rid of
408 whatever code is generated anyhow. */
409 TREE_SIDE_EFFECTS (t
) = 1;
414 /* Return an undeclared local temporary of type TYPE for use in building a
418 build_local_temp (tree type
)
420 tree slot
= build_decl (input_location
,
421 VAR_DECL
, NULL_TREE
, type
);
422 DECL_ARTIFICIAL (slot
) = 1;
423 DECL_IGNORED_P (slot
) = 1;
424 DECL_CONTEXT (slot
) = current_function_decl
;
425 layout_decl (slot
, 0);
429 /* Set various status flags when building an AGGR_INIT_EXPR object T. */
432 process_aggr_init_operands (tree t
)
436 side_effects
= TREE_SIDE_EFFECTS (t
);
440 n
= TREE_OPERAND_LENGTH (t
);
441 for (i
= 1; i
< n
; i
++)
443 tree op
= TREE_OPERAND (t
, i
);
444 if (op
&& TREE_SIDE_EFFECTS (op
))
451 TREE_SIDE_EFFECTS (t
) = side_effects
;
454 /* Build an AGGR_INIT_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE,
455 FN, and SLOT. NARGS is the number of call arguments which are specified
456 as a tree array ARGS. */
459 build_aggr_init_array (tree return_type
, tree fn
, tree slot
, int nargs
,
465 t
= build_vl_exp (AGGR_INIT_EXPR
, nargs
+ 3);
466 TREE_TYPE (t
) = return_type
;
467 AGGR_INIT_EXPR_FN (t
) = fn
;
468 AGGR_INIT_EXPR_SLOT (t
) = slot
;
469 for (i
= 0; i
< nargs
; i
++)
470 AGGR_INIT_EXPR_ARG (t
, i
) = args
[i
];
471 process_aggr_init_operands (t
);
475 /* INIT is a CALL_EXPR or AGGR_INIT_EXPR which needs info about its
476 target. TYPE is the type to be initialized.
478 Build an AGGR_INIT_EXPR to represent the initialization. This function
479 differs from build_cplus_new in that an AGGR_INIT_EXPR can only be used
480 to initialize another object, whereas a TARGET_EXPR can either
481 initialize another object or create its own temporary object, and as a
482 result building up a TARGET_EXPR requires that the type's destructor be
486 build_aggr_init_expr (tree type
, tree init
)
493 /* Don't build AGGR_INIT_EXPR in a template. */
494 if (processing_template_decl
)
497 fn
= cp_get_callee (init
);
499 return convert (type
, init
);
501 is_ctor
= (TREE_CODE (fn
) == ADDR_EXPR
502 && TREE_CODE (TREE_OPERAND (fn
, 0)) == FUNCTION_DECL
503 && DECL_CONSTRUCTOR_P (TREE_OPERAND (fn
, 0)));
505 /* We split the CALL_EXPR into its function and its arguments here.
506 Then, in expand_expr, we put them back together. The reason for
507 this is that this expression might be a default argument
508 expression. In that case, we need a new temporary every time the
509 expression is used. That's what break_out_target_exprs does; it
510 replaces every AGGR_INIT_EXPR with a copy that uses a fresh
511 temporary slot. Then, expand_expr builds up a call-expression
512 using the new slot. */
514 /* If we don't need to use a constructor to create an object of this
515 type, don't mess with AGGR_INIT_EXPR. */
516 if (is_ctor
|| TREE_ADDRESSABLE (type
))
518 slot
= build_local_temp (type
);
520 if (TREE_CODE (init
) == CALL_EXPR
)
522 rval
= build_aggr_init_array (void_type_node
, fn
, slot
,
523 call_expr_nargs (init
),
524 CALL_EXPR_ARGP (init
));
525 AGGR_INIT_FROM_THUNK_P (rval
)
526 = CALL_FROM_THUNK_P (init
);
530 rval
= build_aggr_init_array (void_type_node
, fn
, slot
,
531 aggr_init_expr_nargs (init
),
532 AGGR_INIT_EXPR_ARGP (init
));
533 AGGR_INIT_FROM_THUNK_P (rval
)
534 = AGGR_INIT_FROM_THUNK_P (init
);
536 TREE_SIDE_EFFECTS (rval
) = 1;
537 AGGR_INIT_VIA_CTOR_P (rval
) = is_ctor
;
538 TREE_NOTHROW (rval
) = TREE_NOTHROW (init
);
539 CALL_EXPR_OPERATOR_SYNTAX (rval
) = CALL_EXPR_OPERATOR_SYNTAX (init
);
540 CALL_EXPR_ORDERED_ARGS (rval
) = CALL_EXPR_ORDERED_ARGS (init
);
541 CALL_EXPR_REVERSE_ARGS (rval
) = CALL_EXPR_REVERSE_ARGS (init
);
549 /* INIT is a CALL_EXPR or AGGR_INIT_EXPR which needs info about its
550 target. TYPE is the type that this initialization should appear to
553 Build an encapsulation of the initialization to perform
554 and return it so that it can be processed by language-independent
555 and language-specific expression expanders. */
558 build_cplus_new (tree type
, tree init
, tsubst_flags_t complain
)
560 tree rval
= build_aggr_init_expr (type
, init
);
563 if (!complete_type_or_maybe_complain (type
, init
, complain
))
564 return error_mark_node
;
566 /* Make sure that we're not trying to create an instance of an
568 if (abstract_virtuals_error_sfinae (NULL_TREE
, type
, complain
))
569 return error_mark_node
;
571 if (TREE_CODE (rval
) == AGGR_INIT_EXPR
)
572 slot
= AGGR_INIT_EXPR_SLOT (rval
);
573 else if (TREE_CODE (rval
) == CALL_EXPR
574 || TREE_CODE (rval
) == CONSTRUCTOR
)
575 slot
= build_local_temp (type
);
579 rval
= build_target_expr (slot
, rval
, complain
);
581 if (rval
!= error_mark_node
)
582 TARGET_EXPR_IMPLICIT_P (rval
) = 1;
587 /* Subroutine of build_vec_init_expr: Build up a single element
588 intialization as a proxy for the full array initialization to get things
589 marked as used and any appropriate diagnostics.
591 Since we're deferring building the actual constructor calls until
592 gimplification time, we need to build one now and throw it away so
593 that the relevant constructor gets mark_used before cgraph decides
594 what functions are needed. Here we assume that init is either
595 NULL_TREE, void_type_node (indicating value-initialization), or
596 another array to copy. */
599 build_vec_init_elt (tree type
, tree init
, tsubst_flags_t complain
)
601 tree inner_type
= strip_array_types (type
);
602 vec
<tree
, va_gc
> *argvec
;
604 if (integer_zerop (array_type_nelts_total (type
))
605 || !CLASS_TYPE_P (inner_type
))
606 /* No interesting initialization to do. */
607 return integer_zero_node
;
608 else if (init
== void_type_node
)
609 return build_value_init (inner_type
, complain
);
611 gcc_assert (init
== NULL_TREE
612 || (same_type_ignoring_top_level_qualifiers_p
613 (type
, TREE_TYPE (init
))));
615 argvec
= make_tree_vector ();
618 tree init_type
= strip_array_types (TREE_TYPE (init
));
619 tree dummy
= build_dummy_object (init_type
);
620 if (!lvalue_p (init
))
621 dummy
= move (dummy
);
622 argvec
->quick_push (dummy
);
624 init
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
625 &argvec
, inner_type
, LOOKUP_NORMAL
,
627 release_tree_vector (argvec
);
629 /* For a trivial constructor, build_over_call creates a TARGET_EXPR. But
630 we don't want one here because we aren't creating a temporary. */
631 if (TREE_CODE (init
) == TARGET_EXPR
)
632 init
= TARGET_EXPR_INITIAL (init
);
637 /* Return a TARGET_EXPR which expresses the initialization of an array to
638 be named later, either default-initialization or copy-initialization
639 from another array of the same type. */
642 build_vec_init_expr (tree type
, tree init
, tsubst_flags_t complain
)
645 bool value_init
= false;
646 tree elt_init
= build_vec_init_elt (type
, init
, complain
);
648 if (init
== void_type_node
)
654 slot
= build_local_temp (type
);
655 init
= build2 (VEC_INIT_EXPR
, type
, slot
, init
);
656 TREE_SIDE_EFFECTS (init
) = true;
657 SET_EXPR_LOCATION (init
, input_location
);
659 if (cxx_dialect
>= cxx11
660 && potential_constant_expression (elt_init
))
661 VEC_INIT_EXPR_IS_CONSTEXPR (init
) = true;
662 VEC_INIT_EXPR_VALUE_INIT (init
) = value_init
;
667 /* Give a helpful diagnostic for a non-constexpr VEC_INIT_EXPR in a context
668 that requires a constant expression. */
671 diagnose_non_constexpr_vec_init (tree expr
)
673 tree type
= TREE_TYPE (VEC_INIT_EXPR_SLOT (expr
));
675 if (VEC_INIT_EXPR_VALUE_INIT (expr
))
676 init
= void_type_node
;
678 init
= VEC_INIT_EXPR_INIT (expr
);
680 elt_init
= build_vec_init_elt (type
, init
, tf_warning_or_error
);
681 require_potential_constant_expression (elt_init
);
685 build_array_copy (tree init
)
687 return build_vec_init_expr (TREE_TYPE (init
), init
, tf_warning_or_error
);
690 /* Build a TARGET_EXPR using INIT to initialize a new temporary of the
694 build_target_expr_with_type (tree init
, tree type
, tsubst_flags_t complain
)
696 gcc_assert (!VOID_TYPE_P (type
));
698 if (TREE_CODE (init
) == TARGET_EXPR
699 || init
== error_mark_node
)
701 else if (CLASS_TYPE_P (type
) && type_has_nontrivial_copy_init (type
)
702 && !VOID_TYPE_P (TREE_TYPE (init
))
703 && TREE_CODE (init
) != COND_EXPR
704 && TREE_CODE (init
) != CONSTRUCTOR
705 && TREE_CODE (init
) != VA_ARG_EXPR
)
706 /* We need to build up a copy constructor call. A void initializer
707 means we're being called from bot_manip. COND_EXPR is a special
708 case because we already have copies on the arms and we don't want
709 another one here. A CONSTRUCTOR is aggregate initialization, which
710 is handled separately. A VA_ARG_EXPR is magic creation of an
711 aggregate; there's no additional work to be done. */
712 return force_rvalue (init
, complain
);
714 return force_target_expr (type
, init
, complain
);
717 /* Like the above function, but without the checking. This function should
718 only be used by code which is deliberately trying to subvert the type
719 system, such as call_builtin_trap. Or build_over_call, to avoid
720 infinite recursion. */
723 force_target_expr (tree type
, tree init
, tsubst_flags_t complain
)
727 gcc_assert (!VOID_TYPE_P (type
));
729 slot
= build_local_temp (type
);
730 return build_target_expr (slot
, init
, complain
);
733 /* Like build_target_expr_with_type, but use the type of INIT. */
736 get_target_expr_sfinae (tree init
, tsubst_flags_t complain
)
738 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
739 return build_target_expr (AGGR_INIT_EXPR_SLOT (init
), init
, complain
);
740 else if (TREE_CODE (init
) == VEC_INIT_EXPR
)
741 return build_target_expr (VEC_INIT_EXPR_SLOT (init
), init
, complain
);
744 init
= convert_bitfield_to_declared_type (init
);
745 return build_target_expr_with_type (init
, TREE_TYPE (init
), complain
);
750 get_target_expr (tree init
)
752 return get_target_expr_sfinae (init
, tf_warning_or_error
);
755 /* If EXPR is a bitfield reference, convert it to the declared type of
756 the bitfield, and return the resulting expression. Otherwise,
757 return EXPR itself. */
760 convert_bitfield_to_declared_type (tree expr
)
764 bitfield_type
= is_bitfield_expr_with_lowered_type (expr
);
766 expr
= convert_to_integer_nofold (TYPE_MAIN_VARIANT (bitfield_type
),
771 /* EXPR is being used in an rvalue context. Return a version of EXPR
772 that is marked as an rvalue. */
779 if (error_operand_p (expr
))
782 expr
= mark_rvalue_use (expr
);
786 Non-class rvalues always have cv-unqualified types. */
787 type
= TREE_TYPE (expr
);
788 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
789 type
= cv_unqualified (type
);
791 /* We need to do this for rvalue refs as well to get the right answer
792 from decltype; see c++/36628. */
793 if (!processing_template_decl
&& glvalue_p (expr
))
794 expr
= build1 (NON_LVALUE_EXPR
, type
, expr
);
795 else if (type
!= TREE_TYPE (expr
))
796 expr
= build_nop (type
, expr
);
802 struct cplus_array_info
808 struct cplus_array_hasher
: ggc_ptr_hash
<tree_node
>
810 typedef cplus_array_info
*compare_type
;
812 static hashval_t
hash (tree t
);
813 static bool equal (tree
, cplus_array_info
*);
816 /* Hash an ARRAY_TYPE. K is really of type `tree'. */
819 cplus_array_hasher::hash (tree t
)
823 hash
= TYPE_UID (TREE_TYPE (t
));
825 hash
^= TYPE_UID (TYPE_DOMAIN (t
));
829 /* Compare two ARRAY_TYPEs. K1 is really of type `tree', K2 is really
830 of type `cplus_array_info*'. */
833 cplus_array_hasher::equal (tree t1
, cplus_array_info
*t2
)
835 return (TREE_TYPE (t1
) == t2
->type
&& TYPE_DOMAIN (t1
) == t2
->domain
);
838 /* Hash table containing dependent array types, which are unsuitable for
839 the language-independent type hash table. */
840 static GTY (()) hash_table
<cplus_array_hasher
> *cplus_array_htab
;
842 /* Build an ARRAY_TYPE without laying it out. */
845 build_min_array_type (tree elt_type
, tree index_type
)
847 tree t
= cxx_make_type (ARRAY_TYPE
);
848 TREE_TYPE (t
) = elt_type
;
849 TYPE_DOMAIN (t
) = index_type
;
853 /* Set TYPE_CANONICAL like build_array_type_1, but using
854 build_cplus_array_type. */
857 set_array_type_canon (tree t
, tree elt_type
, tree index_type
)
859 /* Set the canonical type for this new node. */
860 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
861 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
862 SET_TYPE_STRUCTURAL_EQUALITY (t
);
863 else if (TYPE_CANONICAL (elt_type
) != elt_type
864 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
866 = build_cplus_array_type (TYPE_CANONICAL (elt_type
),
868 ? TYPE_CANONICAL (index_type
) : index_type
);
870 TYPE_CANONICAL (t
) = t
;
873 /* Like build_array_type, but handle special C++ semantics: an array of a
874 variant element type is a variant of the array of the main variant of
878 build_cplus_array_type (tree elt_type
, tree index_type
)
882 if (elt_type
== error_mark_node
|| index_type
== error_mark_node
)
883 return error_mark_node
;
885 bool dependent
= (uses_template_parms (elt_type
)
886 || (index_type
&& uses_template_parms (index_type
)));
888 if (elt_type
!= TYPE_MAIN_VARIANT (elt_type
))
889 /* Start with an array of the TYPE_MAIN_VARIANT. */
890 t
= build_cplus_array_type (TYPE_MAIN_VARIANT (elt_type
),
894 /* Since type_hash_canon calls layout_type, we need to use our own
896 cplus_array_info cai
;
899 if (cplus_array_htab
== NULL
)
900 cplus_array_htab
= hash_table
<cplus_array_hasher
>::create_ggc (61);
902 hash
= TYPE_UID (elt_type
);
904 hash
^= TYPE_UID (index_type
);
906 cai
.domain
= index_type
;
908 tree
*e
= cplus_array_htab
->find_slot_with_hash (&cai
, hash
, INSERT
);
910 /* We have found the type: we're done. */
914 /* Build a new array type. */
915 t
= build_min_array_type (elt_type
, index_type
);
917 /* Store it in the hash table. */
920 /* Set the canonical type for this new node. */
921 set_array_type_canon (t
, elt_type
, index_type
);
926 t
= build_array_type (elt_type
, index_type
);
929 /* Now check whether we already have this array variant. */
930 if (elt_type
!= TYPE_MAIN_VARIANT (elt_type
))
933 for (t
= m
; t
; t
= TYPE_NEXT_VARIANT (t
))
934 if (TREE_TYPE (t
) == elt_type
935 && TYPE_NAME (t
) == NULL_TREE
936 && TYPE_ATTRIBUTES (t
) == NULL_TREE
)
940 t
= build_min_array_type (elt_type
, index_type
);
941 set_array_type_canon (t
, elt_type
, index_type
);
945 /* Make sure sizes are shared with the main variant.
946 layout_type can't be called after setting TYPE_NEXT_VARIANT,
947 as it will overwrite alignment etc. of all variants. */
948 TYPE_SIZE (t
) = TYPE_SIZE (m
);
949 TYPE_SIZE_UNIT (t
) = TYPE_SIZE_UNIT (m
);
952 TYPE_MAIN_VARIANT (t
) = m
;
953 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
954 TYPE_NEXT_VARIANT (m
) = t
;
958 /* Avoid spurious warnings with VLAs (c++/54583). */
959 if (TYPE_SIZE (t
) && EXPR_P (TYPE_SIZE (t
)))
960 TREE_NO_WARNING (TYPE_SIZE (t
)) = 1;
962 /* Push these needs up to the ARRAY_TYPE so that initialization takes
963 place more easily. */
964 bool needs_ctor
= (TYPE_NEEDS_CONSTRUCTING (t
)
965 = TYPE_NEEDS_CONSTRUCTING (elt_type
));
966 bool needs_dtor
= (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
967 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (elt_type
));
969 if (!dependent
&& t
== TYPE_MAIN_VARIANT (t
)
970 && !COMPLETE_TYPE_P (t
) && COMPLETE_TYPE_P (elt_type
))
972 /* The element type has been completed since the last time we saw
973 this array type; update the layout and 'tor flags for any variants
976 for (tree v
= TYPE_NEXT_VARIANT (t
); v
; v
= TYPE_NEXT_VARIANT (v
))
978 TYPE_NEEDS_CONSTRUCTING (v
) = needs_ctor
;
979 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (v
) = needs_dtor
;
986 /* Return an ARRAY_TYPE with element type ELT and length N. */
989 build_array_of_n_type (tree elt
, int n
)
991 return build_cplus_array_type (elt
, build_index_type (size_int (n
- 1)));
994 /* True iff T is an N3639 array of runtime bound (VLA). These were
995 approved for C++14 but then removed. */
998 array_of_runtime_bound_p (tree t
)
1000 if (!t
|| TREE_CODE (t
) != ARRAY_TYPE
)
1002 tree dom
= TYPE_DOMAIN (t
);
1005 tree max
= TYPE_MAX_VALUE (dom
);
1006 return (!potential_rvalue_constant_expression (max
)
1007 || (!value_dependent_expression_p (max
) && !TREE_CONSTANT (max
)));
1010 /* Return a reference type node referring to TO_TYPE. If RVAL is
1011 true, return an rvalue reference type, otherwise return an lvalue
1012 reference type. If a type node exists, reuse it, otherwise create
1015 cp_build_reference_type (tree to_type
, bool rval
)
1019 if (TREE_CODE (to_type
) == REFERENCE_TYPE
)
1021 rval
= rval
&& TYPE_REF_IS_RVALUE (to_type
);
1022 to_type
= TREE_TYPE (to_type
);
1025 lvalue_ref
= build_reference_type (to_type
);
1029 /* This code to create rvalue reference types is based on and tied
1030 to the code creating lvalue reference types in the middle-end
1031 functions build_reference_type_for_mode and build_reference_type.
1033 It works by putting the rvalue reference type nodes after the
1034 lvalue reference nodes in the TYPE_NEXT_REF_TO linked list, so
1035 they will effectively be ignored by the middle end. */
1037 for (t
= lvalue_ref
; (t
= TYPE_NEXT_REF_TO (t
)); )
1038 if (TYPE_REF_IS_RVALUE (t
))
1041 t
= build_distinct_type_copy (lvalue_ref
);
1043 TYPE_REF_IS_RVALUE (t
) = true;
1044 TYPE_NEXT_REF_TO (t
) = TYPE_NEXT_REF_TO (lvalue_ref
);
1045 TYPE_NEXT_REF_TO (lvalue_ref
) = t
;
1047 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
1048 SET_TYPE_STRUCTURAL_EQUALITY (t
);
1049 else if (TYPE_CANONICAL (to_type
) != to_type
)
1051 = cp_build_reference_type (TYPE_CANONICAL (to_type
), rval
);
1053 TYPE_CANONICAL (t
) = t
;
1061 /* Returns EXPR cast to rvalue reference type, like std::move. */
1066 tree type
= TREE_TYPE (expr
);
1067 gcc_assert (TREE_CODE (type
) != REFERENCE_TYPE
);
1068 type
= cp_build_reference_type (type
, /*rval*/true);
1069 return build_static_cast (type
, expr
, tf_warning_or_error
);
1072 /* Used by the C++ front end to build qualified array types. However,
1073 the C version of this function does not properly maintain canonical
1074 types (which are not used in C). */
1076 c_build_qualified_type (tree type
, int type_quals
, tree
/* orig_qual_type */,
1077 size_t /* orig_qual_indirect */)
1079 return cp_build_qualified_type (type
, type_quals
);
1083 /* Make a variant of TYPE, qualified with the TYPE_QUALS. Handles
1084 arrays correctly. In particular, if TYPE is an array of T's, and
1085 TYPE_QUALS is non-empty, returns an array of qualified T's.
1087 FLAGS determines how to deal with ill-formed qualifications. If
1088 tf_ignore_bad_quals is set, then bad qualifications are dropped
1089 (this is permitted if TYPE was introduced via a typedef or template
1090 type parameter). If bad qualifications are dropped and tf_warning
1091 is set, then a warning is issued for non-const qualifications. If
1092 tf_ignore_bad_quals is not set and tf_error is not set, we
1093 return error_mark_node. Otherwise, we issue an error, and ignore
1096 Qualification of a reference type is valid when the reference came
1097 via a typedef or template type argument. [dcl.ref] No such
1098 dispensation is provided for qualifying a function type. [dcl.fct]
1099 DR 295 queries this and the proposed resolution brings it into line
1100 with qualifying a reference. We implement the DR. We also behave
1101 in a similar manner for restricting non-pointer types. */
1104 cp_build_qualified_type_real (tree type
,
1106 tsubst_flags_t complain
)
1109 int bad_quals
= TYPE_UNQUALIFIED
;
1111 if (type
== error_mark_node
)
1114 if (type_quals
== cp_type_quals (type
))
1117 if (TREE_CODE (type
) == ARRAY_TYPE
)
1119 /* In C++, the qualification really applies to the array element
1120 type. Obtain the appropriately qualified element type. */
1123 = cp_build_qualified_type_real (TREE_TYPE (type
),
1127 if (element_type
== error_mark_node
)
1128 return error_mark_node
;
1130 /* See if we already have an identically qualified type. Tests
1131 should be equivalent to those in check_qualified_type. */
1132 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
1133 if (TREE_TYPE (t
) == element_type
1134 && TYPE_NAME (t
) == TYPE_NAME (type
)
1135 && TYPE_CONTEXT (t
) == TYPE_CONTEXT (type
)
1136 && attribute_list_equal (TYPE_ATTRIBUTES (t
),
1137 TYPE_ATTRIBUTES (type
)))
1142 t
= build_cplus_array_type (element_type
, TYPE_DOMAIN (type
));
1144 /* Keep the typedef name. */
1145 if (TYPE_NAME (t
) != TYPE_NAME (type
))
1147 t
= build_variant_type_copy (t
);
1148 TYPE_NAME (t
) = TYPE_NAME (type
);
1149 SET_TYPE_ALIGN (t
, TYPE_ALIGN (type
));
1150 TYPE_USER_ALIGN (t
) = TYPE_USER_ALIGN (type
);
1154 /* Even if we already had this variant, we update
1155 TYPE_NEEDS_CONSTRUCTING and TYPE_HAS_NONTRIVIAL_DESTRUCTOR in case
1156 they changed since the variant was originally created.
1158 This seems hokey; if there is some way to use a previous
1159 variant *without* coming through here,
1160 TYPE_NEEDS_CONSTRUCTING will never be updated. */
1161 TYPE_NEEDS_CONSTRUCTING (t
)
1162 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (element_type
));
1163 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
1164 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (element_type
));
1167 else if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
1169 tree t
= PACK_EXPANSION_PATTERN (type
);
1171 t
= cp_build_qualified_type_real (t
, type_quals
, complain
);
1172 return make_pack_expansion (t
);
1175 /* A reference or method type shall not be cv-qualified.
1176 [dcl.ref], [dcl.fct]. This used to be an error, but as of DR 295
1177 (in CD1) we always ignore extra cv-quals on functions. */
1178 if (type_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)
1179 && (TREE_CODE (type
) == REFERENCE_TYPE
1180 || TREE_CODE (type
) == FUNCTION_TYPE
1181 || TREE_CODE (type
) == METHOD_TYPE
))
1183 if (TREE_CODE (type
) == REFERENCE_TYPE
)
1184 bad_quals
|= type_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
1185 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
1188 /* But preserve any function-cv-quals on a FUNCTION_TYPE. */
1189 if (TREE_CODE (type
) == FUNCTION_TYPE
)
1190 type_quals
|= type_memfn_quals (type
);
1192 /* A restrict-qualified type must be a pointer (or reference)
1193 to object or incomplete type. */
1194 if ((type_quals
& TYPE_QUAL_RESTRICT
)
1195 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
1196 && TREE_CODE (type
) != TYPENAME_TYPE
1197 && !POINTER_TYPE_P (type
))
1199 bad_quals
|= TYPE_QUAL_RESTRICT
;
1200 type_quals
&= ~TYPE_QUAL_RESTRICT
;
1203 if (bad_quals
== TYPE_UNQUALIFIED
1204 || (complain
& tf_ignore_bad_quals
))
1206 else if (!(complain
& tf_error
))
1207 return error_mark_node
;
1210 tree bad_type
= build_qualified_type (ptr_type_node
, bad_quals
);
1211 error ("%qV qualifiers cannot be applied to %qT",
1215 /* Retrieve (or create) the appropriately qualified variant. */
1216 result
= build_qualified_type (type
, type_quals
);
1218 /* Preserve exception specs and ref-qualifier since build_qualified_type
1219 doesn't know about them. */
1220 if (TREE_CODE (result
) == FUNCTION_TYPE
1221 || TREE_CODE (result
) == METHOD_TYPE
)
1223 result
= build_exception_variant (result
, TYPE_RAISES_EXCEPTIONS (type
));
1224 result
= build_ref_qualified_type (result
, type_memfn_rqual (type
));
1230 /* Return TYPE with const and volatile removed. */
1233 cv_unqualified (tree type
)
1237 if (type
== error_mark_node
)
1240 quals
= cp_type_quals (type
);
1241 quals
&= ~(TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
);
1242 return cp_build_qualified_type (type
, quals
);
1245 /* Subroutine of strip_typedefs. We want to apply to RESULT the attributes
1246 from ATTRIBS that affect type identity, and no others. If any are not
1247 applied, set *remove_attributes to true. */
1250 apply_identity_attributes (tree result
, tree attribs
, bool *remove_attributes
)
1252 tree first_ident
= NULL_TREE
;
1253 tree new_attribs
= NULL_TREE
;
1254 tree
*p
= &new_attribs
;
1256 if (OVERLOAD_TYPE_P (result
))
1258 /* On classes and enums all attributes are ingrained. */
1259 gcc_assert (attribs
== TYPE_ATTRIBUTES (result
));
1263 for (tree a
= attribs
; a
; a
= TREE_CHAIN (a
))
1265 const attribute_spec
*as
1266 = lookup_attribute_spec (get_attribute_name (a
));
1267 if (as
&& as
->affects_type_identity
)
1271 else if (first_ident
== error_mark_node
)
1273 *p
= tree_cons (TREE_PURPOSE (a
), TREE_VALUE (a
), NULL_TREE
);
1274 p
= &TREE_CHAIN (*p
);
1277 else if (first_ident
)
1279 for (tree a2
= first_ident
; a2
; a2
= TREE_CHAIN (a2
))
1281 *p
= tree_cons (TREE_PURPOSE (a2
), TREE_VALUE (a2
), NULL_TREE
);
1282 p
= &TREE_CHAIN (*p
);
1284 first_ident
= error_mark_node
;
1287 if (first_ident
!= error_mark_node
)
1288 new_attribs
= first_ident
;
1290 if (first_ident
== attribs
)
1291 /* All attributes affected type identity. */;
1293 *remove_attributes
= true;
1295 return cp_build_type_attribute_variant (result
, new_attribs
);
1298 /* Builds a qualified variant of T that is not a typedef variant.
1299 E.g. consider the following declarations:
1300 typedef const int ConstInt;
1301 typedef ConstInt* PtrConstInt;
1302 If T is PtrConstInt, this function returns a type representing
1304 In other words, if T is a typedef, the function returns the underlying type.
1305 The cv-qualification and attributes of the type returned match the
1307 They will always be compatible types.
1308 The returned type is built so that all of its subtypes
1309 recursively have their typedefs stripped as well.
1311 This is different from just returning TYPE_CANONICAL (T)
1312 Because of several reasons:
1313 * If T is a type that needs structural equality
1314 its TYPE_CANONICAL (T) will be NULL.
1315 * TYPE_CANONICAL (T) desn't carry type attributes
1316 and loses template parameter names.
1318 If REMOVE_ATTRIBUTES is non-null, also strip attributes that don't
1319 affect type identity, and set the referent to true if any were
1323 strip_typedefs (tree t
, bool *remove_attributes
)
1325 tree result
= NULL
, type
= NULL
, t0
= NULL
;
1327 if (!t
|| t
== error_mark_node
)
1330 if (TREE_CODE (t
) == TREE_LIST
)
1332 bool changed
= false;
1333 vec
<tree
,va_gc
> *vec
= make_tree_vector ();
1335 for (; t
; t
= TREE_CHAIN (t
))
1337 gcc_assert (!TREE_PURPOSE (t
));
1338 tree elt
= strip_typedefs (TREE_VALUE (t
), remove_attributes
);
1339 if (elt
!= TREE_VALUE (t
))
1341 vec_safe_push (vec
, elt
);
1344 r
= build_tree_list_vec (vec
);
1345 release_tree_vector (vec
);
1349 gcc_assert (TYPE_P (t
));
1351 if (t
== TYPE_CANONICAL (t
))
1354 if (dependent_alias_template_spec_p (t
))
1355 /* DR 1558: However, if the template-id is dependent, subsequent
1356 template argument substitution still applies to the template-id. */
1359 switch (TREE_CODE (t
))
1362 type
= strip_typedefs (TREE_TYPE (t
), remove_attributes
);
1363 result
= build_pointer_type (type
);
1365 case REFERENCE_TYPE
:
1366 type
= strip_typedefs (TREE_TYPE (t
), remove_attributes
);
1367 result
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
1370 t0
= strip_typedefs (TYPE_OFFSET_BASETYPE (t
), remove_attributes
);
1371 type
= strip_typedefs (TREE_TYPE (t
), remove_attributes
);
1372 result
= build_offset_type (t0
, type
);
1375 if (TYPE_PTRMEMFUNC_P (t
))
1377 t0
= strip_typedefs (TYPE_PTRMEMFUNC_FN_TYPE (t
), remove_attributes
);
1378 result
= build_ptrmemfunc_type (t0
);
1382 type
= strip_typedefs (TREE_TYPE (t
), remove_attributes
);
1383 t0
= strip_typedefs (TYPE_DOMAIN (t
), remove_attributes
);
1384 result
= build_cplus_array_type (type
, t0
);
1389 tree arg_types
= NULL
, arg_node
, arg_node2
, arg_type
;
1392 /* Because we stomp on TREE_PURPOSE of TYPE_ARG_TYPES in many places
1393 around the compiler (e.g. cp_parser_late_parsing_default_args), we
1394 can't expect that re-hashing a function type will find a previous
1395 equivalent type, so try to reuse the input type if nothing has
1396 changed. If the type is itself a variant, that will change. */
1397 bool is_variant
= typedef_variant_p (t
);
1398 if (remove_attributes
1399 && (TYPE_ATTRIBUTES (t
) || TYPE_USER_ALIGN (t
)))
1402 type
= strip_typedefs (TREE_TYPE (t
), remove_attributes
);
1403 changed
= type
!= TREE_TYPE (t
) || is_variant
;
1405 for (arg_node
= TYPE_ARG_TYPES (t
);
1407 arg_node
= TREE_CHAIN (arg_node
))
1409 if (arg_node
== void_list_node
)
1411 arg_type
= strip_typedefs (TREE_VALUE (arg_node
),
1413 gcc_assert (arg_type
);
1414 if (arg_type
== TREE_VALUE (arg_node
) && !changed
)
1420 for (arg_node2
= TYPE_ARG_TYPES (t
);
1421 arg_node2
!= arg_node
;
1422 arg_node2
= TREE_CHAIN (arg_node2
))
1424 = tree_cons (TREE_PURPOSE (arg_node2
),
1425 TREE_VALUE (arg_node2
), arg_types
);
1429 = tree_cons (TREE_PURPOSE (arg_node
), arg_type
, arg_types
);
1436 arg_types
= nreverse (arg_types
);
1438 /* A list of parameters not ending with an ellipsis
1439 must end with void_list_node. */
1441 arg_types
= chainon (arg_types
, void_list_node
);
1443 if (TREE_CODE (t
) == METHOD_TYPE
)
1445 tree class_type
= TREE_TYPE (TREE_VALUE (arg_types
));
1446 gcc_assert (class_type
);
1448 build_method_type_directly (class_type
, type
,
1449 TREE_CHAIN (arg_types
));
1451 = build_ref_qualified_type (result
, type_memfn_rqual (t
));
1455 result
= build_function_type (type
,
1457 result
= apply_memfn_quals (result
,
1458 type_memfn_quals (t
),
1459 type_memfn_rqual (t
));
1462 if (TYPE_RAISES_EXCEPTIONS (t
))
1463 result
= build_exception_variant (result
,
1464 TYPE_RAISES_EXCEPTIONS (t
));
1465 if (TYPE_HAS_LATE_RETURN_TYPE (t
))
1466 TYPE_HAS_LATE_RETURN_TYPE (result
) = 1;
1471 tree fullname
= TYPENAME_TYPE_FULLNAME (t
);
1472 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
1473 && TREE_OPERAND (fullname
, 1))
1475 tree args
= TREE_OPERAND (fullname
, 1);
1476 tree new_args
= copy_node (args
);
1477 bool changed
= false;
1478 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
1480 tree arg
= TREE_VEC_ELT (args
, i
);
1483 strip_arg
= strip_typedefs (arg
, remove_attributes
);
1485 strip_arg
= strip_typedefs_expr (arg
, remove_attributes
);
1486 TREE_VEC_ELT (new_args
, i
) = strip_arg
;
1487 if (strip_arg
!= arg
)
1492 NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_args
)
1493 = NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
1495 = lookup_template_function (TREE_OPERAND (fullname
, 0),
1499 ggc_free (new_args
);
1501 result
= make_typename_type (strip_typedefs (TYPE_CONTEXT (t
),
1503 fullname
, typename_type
, tf_none
);
1504 /* Handle 'typedef typename A::N N;' */
1505 if (typedef_variant_p (result
))
1506 result
= TYPE_MAIN_VARIANT (DECL_ORIGINAL_TYPE (TYPE_NAME (result
)));
1510 result
= strip_typedefs_expr (DECLTYPE_TYPE_EXPR (t
),
1512 if (result
== DECLTYPE_TYPE_EXPR (t
))
1515 result
= (finish_decltype_type
1517 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
),
1526 if (typedef_variant_p (t
))
1528 /* Explicitly get the underlying type, as TYPE_MAIN_VARIANT doesn't
1529 strip typedefs with attributes. */
1530 result
= TYPE_MAIN_VARIANT (DECL_ORIGINAL_TYPE (TYPE_NAME (t
)));
1531 result
= strip_typedefs (result
);
1534 result
= TYPE_MAIN_VARIANT (t
);
1536 gcc_assert (!typedef_variant_p (result
));
1537 if (TYPE_USER_ALIGN (t
) != TYPE_USER_ALIGN (result
)
1538 || TYPE_ALIGN (t
) != TYPE_ALIGN (result
))
1540 gcc_assert (TYPE_USER_ALIGN (t
));
1541 if (remove_attributes
)
1542 *remove_attributes
= true;
1545 if (TYPE_ALIGN (t
) == TYPE_ALIGN (result
))
1546 result
= build_variant_type_copy (result
);
1548 result
= build_aligned_type (result
, TYPE_ALIGN (t
));
1549 TYPE_USER_ALIGN (result
) = true;
1552 if (TYPE_ATTRIBUTES (t
))
1554 if (remove_attributes
)
1555 result
= apply_identity_attributes (result
, TYPE_ATTRIBUTES (t
),
1558 result
= cp_build_type_attribute_variant (result
, TYPE_ATTRIBUTES (t
));
1560 return cp_build_qualified_type (result
, cp_type_quals (t
));
1563 /* Like strip_typedefs above, but works on expressions, so that in
1565 template<class T> struct A
1571 sizeof(TT) is replaced by sizeof(T). */
1574 strip_typedefs_expr (tree t
, bool *remove_attributes
)
1578 enum tree_code code
;
1580 if (t
== NULL_TREE
|| t
== error_mark_node
)
1583 if (DECL_P (t
) || CONSTANT_CLASS_P (t
))
1586 /* Some expressions have type operands, so let's handle types here rather
1587 than check TYPE_P in multiple places below. */
1589 return strip_typedefs (t
, remove_attributes
);
1591 code
= TREE_CODE (t
);
1594 case IDENTIFIER_NODE
:
1595 case TEMPLATE_PARM_INDEX
:
1598 case ARGUMENT_PACK_SELECT
:
1603 tree type1
= strip_typedefs (TRAIT_EXPR_TYPE1 (t
), remove_attributes
);
1604 tree type2
= strip_typedefs (TRAIT_EXPR_TYPE2 (t
), remove_attributes
);
1605 if (type1
== TRAIT_EXPR_TYPE1 (t
)
1606 && type2
== TRAIT_EXPR_TYPE2 (t
))
1609 TRAIT_EXPR_TYPE1 (r
) = type1
;
1610 TRAIT_EXPR_TYPE2 (r
) = type2
;
1616 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
1617 bool changed
= false;
1619 for (it
= t
; it
; it
= TREE_CHAIN (it
))
1621 tree val
= strip_typedefs_expr (TREE_VALUE (t
), remove_attributes
);
1622 vec_safe_push (vec
, val
);
1623 if (val
!= TREE_VALUE (t
))
1625 gcc_assert (TREE_PURPOSE (it
) == NULL_TREE
);
1630 FOR_EACH_VEC_ELT_REVERSE (*vec
, i
, it
)
1631 r
= tree_cons (NULL_TREE
, it
, r
);
1635 release_tree_vector (vec
);
1641 bool changed
= false;
1642 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
1643 n
= TREE_VEC_LENGTH (t
);
1644 vec_safe_reserve (vec
, n
);
1645 for (i
= 0; i
< n
; ++i
)
1647 tree op
= strip_typedefs_expr (TREE_VEC_ELT (t
, i
),
1649 vec
->quick_push (op
);
1650 if (op
!= TREE_VEC_ELT (t
, i
))
1656 for (i
= 0; i
< n
; ++i
)
1657 TREE_VEC_ELT (r
, i
) = (*vec
)[i
];
1658 NON_DEFAULT_TEMPLATE_ARGS_COUNT (r
)
1659 = NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
);
1663 release_tree_vector (vec
);
1669 bool changed
= false;
1670 vec
<constructor_elt
, va_gc
> *vec
1671 = vec_safe_copy (CONSTRUCTOR_ELTS (t
));
1672 n
= CONSTRUCTOR_NELTS (t
);
1673 type
= strip_typedefs (TREE_TYPE (t
), remove_attributes
);
1674 for (i
= 0; i
< n
; ++i
)
1676 constructor_elt
*e
= &(*vec
)[i
];
1677 tree op
= strip_typedefs_expr (e
->value
, remove_attributes
);
1684 (e
->index
== strip_typedefs_expr (e
->index
, remove_attributes
));
1687 if (!changed
&& type
== TREE_TYPE (t
))
1695 TREE_TYPE (r
) = type
;
1696 CONSTRUCTOR_ELTS (r
) = vec
;
1702 error ("lambda-expression in a constant expression");
1703 return error_mark_node
;
1709 gcc_assert (EXPR_P (t
));
1711 n
= TREE_OPERAND_LENGTH (t
);
1712 ops
= XALLOCAVEC (tree
, n
);
1713 type
= TREE_TYPE (t
);
1718 case IMPLICIT_CONV_EXPR
:
1719 case DYNAMIC_CAST_EXPR
:
1720 case STATIC_CAST_EXPR
:
1721 case CONST_CAST_EXPR
:
1722 case REINTERPRET_CAST_EXPR
:
1725 type
= strip_typedefs (type
, remove_attributes
);
1729 for (i
= 0; i
< n
; ++i
)
1730 ops
[i
] = strip_typedefs_expr (TREE_OPERAND (t
, i
), remove_attributes
);
1734 /* If nothing changed, return t. */
1735 for (i
= 0; i
< n
; ++i
)
1736 if (ops
[i
] != TREE_OPERAND (t
, i
))
1738 if (i
== n
&& type
== TREE_TYPE (t
))
1742 TREE_TYPE (r
) = type
;
1743 for (i
= 0; i
< n
; ++i
)
1744 TREE_OPERAND (r
, i
) = ops
[i
];
1748 /* Makes a copy of BINFO and TYPE, which is to be inherited into a
1749 graph dominated by T. If BINFO is NULL, TYPE is a dependent base,
1750 and we do a shallow copy. If BINFO is non-NULL, we do a deep copy.
1751 VIRT indicates whether TYPE is inherited virtually or not.
1752 IGO_PREV points at the previous binfo of the inheritance graph
1753 order chain. The newly copied binfo's TREE_CHAIN forms this
1756 The CLASSTYPE_VBASECLASSES vector of T is constructed in the
1757 correct order. That is in the order the bases themselves should be
1760 The BINFO_INHERITANCE of a virtual base class points to the binfo
1761 of the most derived type. ??? We could probably change this so that
1762 BINFO_INHERITANCE becomes synonymous with BINFO_PRIMARY, and hence
1763 remove a field. They currently can only differ for primary virtual
1767 copy_binfo (tree binfo
, tree type
, tree t
, tree
*igo_prev
, int virt
)
1773 /* See if we've already made this virtual base. */
1774 new_binfo
= binfo_for_vbase (type
, t
);
1779 new_binfo
= make_tree_binfo (binfo
? BINFO_N_BASE_BINFOS (binfo
) : 0);
1780 BINFO_TYPE (new_binfo
) = type
;
1782 /* Chain it into the inheritance graph. */
1783 TREE_CHAIN (*igo_prev
) = new_binfo
;
1784 *igo_prev
= new_binfo
;
1786 if (binfo
&& !BINFO_DEPENDENT_BASE_P (binfo
))
1791 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), type
));
1793 BINFO_OFFSET (new_binfo
) = BINFO_OFFSET (binfo
);
1794 BINFO_VIRTUALS (new_binfo
) = BINFO_VIRTUALS (binfo
);
1796 /* We do not need to copy the accesses, as they are read only. */
1797 BINFO_BASE_ACCESSES (new_binfo
) = BINFO_BASE_ACCESSES (binfo
);
1799 /* Recursively copy base binfos of BINFO. */
1800 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ix
++)
1802 tree new_base_binfo
;
1803 new_base_binfo
= copy_binfo (base_binfo
, BINFO_TYPE (base_binfo
),
1805 BINFO_VIRTUAL_P (base_binfo
));
1807 if (!BINFO_INHERITANCE_CHAIN (new_base_binfo
))
1808 BINFO_INHERITANCE_CHAIN (new_base_binfo
) = new_binfo
;
1809 BINFO_BASE_APPEND (new_binfo
, new_base_binfo
);
1813 BINFO_DEPENDENT_BASE_P (new_binfo
) = 1;
1817 /* Push it onto the list after any virtual bases it contains
1818 will have been pushed. */
1819 CLASSTYPE_VBASECLASSES (t
)->quick_push (new_binfo
);
1820 BINFO_VIRTUAL_P (new_binfo
) = 1;
1821 BINFO_INHERITANCE_CHAIN (new_binfo
) = TYPE_BINFO (t
);
1827 /* Hashing of lists so that we don't make duplicates.
1828 The entry point is `list_hash_canon'. */
1837 struct list_hasher
: ggc_ptr_hash
<tree_node
>
1839 typedef list_proxy
*compare_type
;
1841 static hashval_t
hash (tree
);
1842 static bool equal (tree
, list_proxy
*);
1845 /* Now here is the hash table. When recording a list, it is added
1846 to the slot whose index is the hash code mod the table size.
1847 Note that the hash table is used for several kinds of lists.
1848 While all these live in the same table, they are completely independent,
1849 and the hash code is computed differently for each of these. */
1851 static GTY (()) hash_table
<list_hasher
> *list_hash_table
;
1853 /* Compare ENTRY (an entry in the hash table) with DATA (a list_proxy
1854 for a node we are thinking about adding). */
1857 list_hasher::equal (tree t
, list_proxy
*proxy
)
1859 return (TREE_VALUE (t
) == proxy
->value
1860 && TREE_PURPOSE (t
) == proxy
->purpose
1861 && TREE_CHAIN (t
) == proxy
->chain
);
1864 /* Compute a hash code for a list (chain of TREE_LIST nodes
1865 with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the
1866 TREE_COMMON slots), by adding the hash codes of the individual entries. */
1869 list_hash_pieces (tree purpose
, tree value
, tree chain
)
1871 hashval_t hashcode
= 0;
1874 hashcode
+= TREE_HASH (chain
);
1877 hashcode
+= TREE_HASH (value
);
1881 hashcode
+= TREE_HASH (purpose
);
1887 /* Hash an already existing TREE_LIST. */
1890 list_hasher::hash (tree t
)
1892 return list_hash_pieces (TREE_PURPOSE (t
),
1897 /* Given list components PURPOSE, VALUE, AND CHAIN, return the canonical
1898 object for an identical list if one already exists. Otherwise, build a
1899 new one, and record it as the canonical object. */
1902 hash_tree_cons (tree purpose
, tree value
, tree chain
)
1906 struct list_proxy proxy
;
1908 /* Hash the list node. */
1909 hashcode
= list_hash_pieces (purpose
, value
, chain
);
1910 /* Create a proxy for the TREE_LIST we would like to create. We
1911 don't actually create it so as to avoid creating garbage. */
1912 proxy
.purpose
= purpose
;
1913 proxy
.value
= value
;
1914 proxy
.chain
= chain
;
1915 /* See if it is already in the table. */
1916 slot
= list_hash_table
->find_slot_with_hash (&proxy
, hashcode
, INSERT
);
1917 /* If not, create a new node. */
1919 *slot
= tree_cons (purpose
, value
, chain
);
1920 return (tree
) *slot
;
1923 /* Constructor for hashed lists. */
1926 hash_tree_chain (tree value
, tree chain
)
1928 return hash_tree_cons (NULL_TREE
, value
, chain
);
1932 debug_binfo (tree elem
)
1937 fprintf (stderr
, "type \"%s\", offset = " HOST_WIDE_INT_PRINT_DEC
1939 TYPE_NAME_STRING (BINFO_TYPE (elem
)),
1940 TREE_INT_CST_LOW (BINFO_OFFSET (elem
)));
1941 debug_tree (BINFO_TYPE (elem
));
1942 if (BINFO_VTABLE (elem
))
1943 fprintf (stderr
, "vtable decl \"%s\"\n",
1944 IDENTIFIER_POINTER (DECL_NAME (get_vtbl_decl_for_binfo (elem
))));
1946 fprintf (stderr
, "no vtable decl yet\n");
1947 fprintf (stderr
, "virtuals:\n");
1948 virtuals
= BINFO_VIRTUALS (elem
);
1953 tree fndecl
= TREE_VALUE (virtuals
);
1954 fprintf (stderr
, "%s [%ld =? %ld]\n",
1955 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl
)),
1956 (long) n
, (long) TREE_INT_CST_LOW (DECL_VINDEX (fndecl
)));
1958 virtuals
= TREE_CHAIN (virtuals
);
1962 /* Build a representation for the qualified name SCOPE::NAME. TYPE is
1963 the type of the result expression, if known, or NULL_TREE if the
1964 resulting expression is type-dependent. If TEMPLATE_P is true,
1965 NAME is known to be a template because the user explicitly used the
1966 "template" keyword after the "::".
1968 All SCOPE_REFs should be built by use of this function. */
1971 build_qualified_name (tree type
, tree scope
, tree name
, bool template_p
)
1974 if (type
== error_mark_node
1975 || scope
== error_mark_node
1976 || name
== error_mark_node
)
1977 return error_mark_node
;
1978 t
= build2 (SCOPE_REF
, type
, scope
, name
);
1979 QUALIFIED_NAME_IS_TEMPLATE (t
) = template_p
;
1980 PTRMEM_OK_P (t
) = true;
1982 t
= convert_from_reference (t
);
1986 /* Like check_qualified_type, but also check ref-qualifier and exception
1990 cp_check_qualified_type (const_tree cand
, const_tree base
, int type_quals
,
1991 cp_ref_qualifier rqual
, tree raises
)
1993 return (TYPE_QUALS (cand
) == type_quals
1994 && check_base_type (cand
, base
)
1995 && comp_except_specs (raises
, TYPE_RAISES_EXCEPTIONS (cand
),
1997 && type_memfn_rqual (cand
) == rqual
);
2000 /* Build the FUNCTION_TYPE or METHOD_TYPE with the ref-qualifier RQUAL. */
2003 build_ref_qualified_type (tree type
, cp_ref_qualifier rqual
)
2007 if (rqual
== type_memfn_rqual (type
))
2010 int type_quals
= TYPE_QUALS (type
);
2011 tree raises
= TYPE_RAISES_EXCEPTIONS (type
);
2012 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
2013 if (cp_check_qualified_type (t
, type
, type_quals
, rqual
, raises
))
2016 t
= build_variant_type_copy (type
);
2019 case REF_QUAL_RVALUE
:
2020 FUNCTION_RVALUE_QUALIFIED (t
) = 1;
2021 FUNCTION_REF_QUALIFIED (t
) = 1;
2023 case REF_QUAL_LVALUE
:
2024 FUNCTION_RVALUE_QUALIFIED (t
) = 0;
2025 FUNCTION_REF_QUALIFIED (t
) = 1;
2028 FUNCTION_REF_QUALIFIED (t
) = 0;
2032 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
2033 /* Propagate structural equality. */
2034 SET_TYPE_STRUCTURAL_EQUALITY (t
);
2035 else if (TYPE_CANONICAL (type
) != type
)
2036 /* Build the underlying canonical type, since it is different
2038 TYPE_CANONICAL (t
) = build_ref_qualified_type (TYPE_CANONICAL (type
),
2041 /* T is its own canonical type. */
2042 TYPE_CANONICAL (t
) = t
;
2047 /* Returns nonzero if X is an expression for a (possibly overloaded)
2048 function. If "f" is a function or function template, "f", "c->f",
2049 "c.f", "C::f", and "f<int>" will all be considered possibly
2050 overloaded functions. Returns 2 if the function is actually
2051 overloaded, i.e., if it is impossible to know the type of the
2052 function without performing overload resolution. */
2055 is_overloaded_fn (tree x
)
2057 /* A baselink is also considered an overloaded function. */
2058 if (TREE_CODE (x
) == OFFSET_REF
2059 || TREE_CODE (x
) == COMPONENT_REF
)
2060 x
= TREE_OPERAND (x
, 1);
2062 x
= BASELINK_FUNCTIONS (x
);
2063 if (TREE_CODE (x
) == TEMPLATE_ID_EXPR
)
2064 x
= TREE_OPERAND (x
, 0);
2065 if (DECL_FUNCTION_TEMPLATE_P (OVL_CURRENT (x
))
2066 || (TREE_CODE (x
) == OVERLOAD
&& OVL_CHAIN (x
)))
2068 return (TREE_CODE (x
) == FUNCTION_DECL
2069 || TREE_CODE (x
) == OVERLOAD
);
2072 /* X is the CALL_EXPR_FN of a CALL_EXPR. If X represents a dependent name
2073 (14.6.2), return the IDENTIFIER_NODE for that name. Otherwise, return
2077 dependent_name (tree x
)
2079 if (identifier_p (x
))
2081 if (TREE_CODE (x
) != COMPONENT_REF
2082 && TREE_CODE (x
) != OFFSET_REF
2083 && TREE_CODE (x
) != BASELINK
2084 && is_overloaded_fn (x
))
2085 return DECL_NAME (get_first_fn (x
));
2089 /* Returns true iff X is an expression for an overloaded function
2090 whose type cannot be known without performing overload
2094 really_overloaded_fn (tree x
)
2096 return is_overloaded_fn (x
) == 2;
2102 gcc_assert (is_overloaded_fn (from
));
2103 /* A baselink is also considered an overloaded function. */
2104 if (TREE_CODE (from
) == OFFSET_REF
2105 || TREE_CODE (from
) == COMPONENT_REF
)
2106 from
= TREE_OPERAND (from
, 1);
2107 if (BASELINK_P (from
))
2108 from
= BASELINK_FUNCTIONS (from
);
2109 if (TREE_CODE (from
) == TEMPLATE_ID_EXPR
)
2110 from
= TREE_OPERAND (from
, 0);
2115 get_first_fn (tree from
)
2117 return OVL_CURRENT (get_fns (from
));
2120 /* Return a new OVL node, concatenating it with the old one. */
2123 ovl_cons (tree decl
, tree chain
)
2125 tree result
= make_node (OVERLOAD
);
2126 TREE_TYPE (result
) = unknown_type_node
;
2127 OVL_FUNCTION (result
) = decl
;
2128 TREE_CHAIN (result
) = chain
;
2133 /* Build a new overloaded function. If this is the first one,
2134 just return it; otherwise, ovl_cons the _DECLs */
2137 build_overload (tree decl
, tree chain
)
2139 if (! chain
&& TREE_CODE (decl
) != TEMPLATE_DECL
)
2141 return ovl_cons (decl
, chain
);
2144 /* Return the scope where the overloaded functions OVL were found. */
2147 ovl_scope (tree ovl
)
2149 if (TREE_CODE (ovl
) == OFFSET_REF
2150 || TREE_CODE (ovl
) == COMPONENT_REF
)
2151 ovl
= TREE_OPERAND (ovl
, 1);
2152 if (TREE_CODE (ovl
) == BASELINK
)
2153 return BINFO_TYPE (BASELINK_BINFO (ovl
));
2154 if (TREE_CODE (ovl
) == TEMPLATE_ID_EXPR
)
2155 ovl
= TREE_OPERAND (ovl
, 0);
2156 /* Skip using-declarations. */
2157 while (TREE_CODE (ovl
) == OVERLOAD
&& OVL_USED (ovl
) && OVL_CHAIN (ovl
))
2158 ovl
= OVL_CHAIN (ovl
);
2159 return CP_DECL_CONTEXT (OVL_CURRENT (ovl
));
2162 #define PRINT_RING_SIZE 4
2165 cxx_printable_name_internal (tree decl
, int v
, bool translate
)
2167 static unsigned int uid_ring
[PRINT_RING_SIZE
];
2168 static char *print_ring
[PRINT_RING_SIZE
];
2169 static bool trans_ring
[PRINT_RING_SIZE
];
2170 static int ring_counter
;
2173 /* Only cache functions. */
2175 || TREE_CODE (decl
) != FUNCTION_DECL
2176 || DECL_LANG_SPECIFIC (decl
) == 0)
2177 return lang_decl_name (decl
, v
, translate
);
2179 /* See if this print name is lying around. */
2180 for (i
= 0; i
< PRINT_RING_SIZE
; i
++)
2181 if (uid_ring
[i
] == DECL_UID (decl
) && translate
== trans_ring
[i
])
2182 /* yes, so return it. */
2183 return print_ring
[i
];
2185 if (++ring_counter
== PRINT_RING_SIZE
)
2188 if (current_function_decl
!= NULL_TREE
)
2190 /* There may be both translated and untranslated versions of the
2192 for (i
= 0; i
< 2; i
++)
2194 if (uid_ring
[ring_counter
] == DECL_UID (current_function_decl
))
2196 if (ring_counter
== PRINT_RING_SIZE
)
2199 gcc_assert (uid_ring
[ring_counter
] != DECL_UID (current_function_decl
));
2202 free (print_ring
[ring_counter
]);
2204 print_ring
[ring_counter
] = xstrdup (lang_decl_name (decl
, v
, translate
));
2205 uid_ring
[ring_counter
] = DECL_UID (decl
);
2206 trans_ring
[ring_counter
] = translate
;
2207 return print_ring
[ring_counter
];
2211 cxx_printable_name (tree decl
, int v
)
2213 return cxx_printable_name_internal (decl
, v
, false);
2217 cxx_printable_name_translate (tree decl
, int v
)
2219 return cxx_printable_name_internal (decl
, v
, true);
2222 /* Return the canonical version of exception-specification RAISES for a C++17
2223 function type, for use in type comparison and building TYPE_CANONICAL. */
2226 canonical_eh_spec (tree raises
)
2228 if (raises
== NULL_TREE
)
2230 else if (DEFERRED_NOEXCEPT_SPEC_P (raises
)
2231 || uses_template_parms (raises
)
2232 || uses_template_parms (TREE_PURPOSE (raises
)))
2233 /* Keep a dependent or deferred exception specification. */
2235 else if (nothrow_spec_p (raises
))
2236 /* throw() -> noexcept. */
2237 return noexcept_true_spec
;
2239 /* For C++17 type matching, anything else -> nothing. */
2243 /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions
2244 listed in RAISES. */
2247 build_exception_variant (tree type
, tree raises
)
2252 if (comp_except_specs (raises
, TYPE_RAISES_EXCEPTIONS (type
), ce_exact
))
2255 type_quals
= TYPE_QUALS (type
);
2256 cp_ref_qualifier rqual
= type_memfn_rqual (type
);
2257 for (v
= TYPE_MAIN_VARIANT (type
); v
; v
= TYPE_NEXT_VARIANT (v
))
2258 if (cp_check_qualified_type (v
, type
, type_quals
, rqual
, raises
))
2261 /* Need to build a new variant. */
2262 v
= build_variant_type_copy (type
);
2263 TYPE_RAISES_EXCEPTIONS (v
) = raises
;
2265 if (!flag_noexcept_type
)
2266 /* The exception-specification is not part of the canonical type. */
2269 /* Canonicalize the exception specification. */
2270 tree cr
= canonical_eh_spec (raises
);
2272 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
2273 /* Propagate structural equality. */
2274 SET_TYPE_STRUCTURAL_EQUALITY (v
);
2275 else if (TYPE_CANONICAL (type
) != type
|| cr
!= raises
)
2276 /* Build the underlying canonical type, since it is different
2278 TYPE_CANONICAL (v
) = build_exception_variant (TYPE_CANONICAL (type
), cr
);
2280 /* T is its own canonical type. */
2281 TYPE_CANONICAL (v
) = v
;
2286 /* Given a TEMPLATE_TEMPLATE_PARM node T, create a new
2287 BOUND_TEMPLATE_TEMPLATE_PARM bound with NEWARGS as its template
2291 bind_template_template_parm (tree t
, tree newargs
)
2293 tree decl
= TYPE_NAME (t
);
2296 t2
= cxx_make_type (BOUND_TEMPLATE_TEMPLATE_PARM
);
2297 decl
= build_decl (input_location
,
2298 TYPE_DECL
, DECL_NAME (decl
), NULL_TREE
);
2300 /* These nodes have to be created to reflect new TYPE_DECL and template
2302 TEMPLATE_TYPE_PARM_INDEX (t2
) = copy_node (TEMPLATE_TYPE_PARM_INDEX (t
));
2303 TEMPLATE_PARM_DECL (TEMPLATE_TYPE_PARM_INDEX (t2
)) = decl
;
2304 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2
)
2305 = build_template_info (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t
), newargs
);
2307 TREE_TYPE (decl
) = t2
;
2308 TYPE_NAME (t2
) = decl
;
2309 TYPE_STUB_DECL (t2
) = decl
;
2311 SET_TYPE_STRUCTURAL_EQUALITY (t2
);
2316 /* Called from count_trees via walk_tree. */
2319 count_trees_r (tree
*tp
, int *walk_subtrees
, void *data
)
2329 /* Debugging function for measuring the rough complexity of a tree
2333 count_trees (tree t
)
2336 cp_walk_tree_without_duplicates (&t
, count_trees_r
, &n_trees
);
2340 /* Called from verify_stmt_tree via walk_tree. */
2343 verify_stmt_tree_r (tree
* tp
, int * /*walk_subtrees*/, void* data
)
2346 hash_table
<nofree_ptr_hash
<tree_node
> > *statements
2347 = static_cast <hash_table
<nofree_ptr_hash
<tree_node
> > *> (data
);
2350 if (!STATEMENT_CODE_P (TREE_CODE (t
)))
2353 /* If this statement is already present in the hash table, then
2354 there is a circularity in the statement tree. */
2355 gcc_assert (!statements
->find (t
));
2357 slot
= statements
->find_slot (t
, INSERT
);
2363 /* Debugging function to check that the statement T has not been
2364 corrupted. For now, this function simply checks that T contains no
2368 verify_stmt_tree (tree t
)
2370 hash_table
<nofree_ptr_hash
<tree_node
> > statements (37);
2371 cp_walk_tree (&t
, verify_stmt_tree_r
, &statements
, NULL
);
2374 /* Check if the type T depends on a type with no linkage and if so, return
2375 it. If RELAXED_P then do not consider a class type declared within
2376 a vague-linkage function to have no linkage. */
2379 no_linkage_check (tree t
, bool relaxed_p
)
2383 /* There's no point in checking linkage on template functions; we
2384 can't know their complete types. */
2385 if (processing_template_decl
)
2388 switch (TREE_CODE (t
))
2391 if (TYPE_PTRMEMFUNC_P (t
))
2393 /* Lambda types that don't have mangling scope have no linkage. We
2394 check CLASSTYPE_LAMBDA_EXPR for error_mark_node because
2395 when we get here from pushtag none of the lambda information is
2396 set up yet, so we want to assume that the lambda has linkage and
2397 fix it up later if not. */
2398 if (CLASSTYPE_LAMBDA_EXPR (t
)
2399 && CLASSTYPE_LAMBDA_EXPR (t
) != error_mark_node
2400 && LAMBDA_TYPE_EXTRA_SCOPE (t
) == NULL_TREE
)
2404 if (!CLASS_TYPE_P (t
))
2408 /* Only treat unnamed types as having no linkage if they're at
2409 namespace scope. This is core issue 966. */
2410 if (TYPE_UNNAMED_P (t
) && TYPE_NAMESPACE_SCOPE_P (t
))
2413 for (r
= CP_TYPE_CONTEXT (t
); ; )
2415 /* If we're a nested type of a !TREE_PUBLIC class, we might not
2416 have linkage, or we might just be in an anonymous namespace.
2417 If we're in a TREE_PUBLIC class, we have linkage. */
2418 if (TYPE_P (r
) && !TREE_PUBLIC (TYPE_NAME (r
)))
2419 return no_linkage_check (TYPE_CONTEXT (t
), relaxed_p
);
2420 else if (TREE_CODE (r
) == FUNCTION_DECL
)
2422 if (!relaxed_p
|| !vague_linkage_p (r
))
2425 r
= CP_DECL_CONTEXT (r
);
2435 case REFERENCE_TYPE
:
2437 return no_linkage_check (TREE_TYPE (t
), relaxed_p
);
2441 r
= no_linkage_check (TYPE_PTRMEM_POINTED_TO_TYPE (t
),
2445 return no_linkage_check (TYPE_PTRMEM_CLASS_TYPE (t
), relaxed_p
);
2450 tree parm
= TYPE_ARG_TYPES (t
);
2451 if (TREE_CODE (t
) == METHOD_TYPE
)
2452 /* The 'this' pointer isn't interesting; a method has the same
2453 linkage (or lack thereof) as its enclosing class. */
2454 parm
= TREE_CHAIN (parm
);
2456 parm
&& parm
!= void_list_node
;
2457 parm
= TREE_CHAIN (parm
))
2459 r
= no_linkage_check (TREE_VALUE (parm
), relaxed_p
);
2463 return no_linkage_check (TREE_TYPE (t
), relaxed_p
);
2471 extern int depth_reached
;
2474 cxx_print_statistics (void)
2476 print_search_statistics ();
2477 print_class_statistics ();
2478 print_template_statistics ();
2479 if (GATHER_STATISTICS
)
2480 fprintf (stderr
, "maximum template instantiation depth reached: %d\n",
2484 /* Return, as an INTEGER_CST node, the number of elements for TYPE
2485 (which is an ARRAY_TYPE). This counts only elements of the top
2489 array_type_nelts_top (tree type
)
2491 return fold_build2_loc (input_location
,
2492 PLUS_EXPR
, sizetype
,
2493 array_type_nelts (type
),
2497 /* Return, as an INTEGER_CST node, the number of elements for TYPE
2498 (which is an ARRAY_TYPE). This one is a recursive count of all
2499 ARRAY_TYPEs that are clumped together. */
2502 array_type_nelts_total (tree type
)
2504 tree sz
= array_type_nelts_top (type
);
2505 type
= TREE_TYPE (type
);
2506 while (TREE_CODE (type
) == ARRAY_TYPE
)
2508 tree n
= array_type_nelts_top (type
);
2509 sz
= fold_build2_loc (input_location
,
2510 MULT_EXPR
, sizetype
, sz
, n
);
2511 type
= TREE_TYPE (type
);
2516 /* Called from break_out_target_exprs via mapcar. */
2519 bot_manip (tree
* tp
, int* walk_subtrees
, void* data
)
2521 splay_tree target_remap
= ((splay_tree
) data
);
2524 if (!TYPE_P (t
) && TREE_CONSTANT (t
) && !TREE_SIDE_EFFECTS (t
))
2526 /* There can't be any TARGET_EXPRs or their slot variables below this
2527 point. But we must make a copy, in case subsequent processing
2528 alters any part of it. For example, during gimplification a cast
2529 of the form (T) &X::f (where "f" is a member function) will lead
2530 to replacing the PTRMEM_CST for &X::f with a VAR_DECL. */
2532 *tp
= unshare_expr (t
);
2535 if (TREE_CODE (t
) == TARGET_EXPR
)
2539 if (TREE_CODE (TREE_OPERAND (t
, 1)) == AGGR_INIT_EXPR
)
2541 u
= build_cplus_new (TREE_TYPE (t
), TREE_OPERAND (t
, 1),
2542 tf_warning_or_error
);
2543 if (AGGR_INIT_ZERO_FIRST (TREE_OPERAND (t
, 1)))
2544 AGGR_INIT_ZERO_FIRST (TREE_OPERAND (u
, 1)) = true;
2547 u
= build_target_expr_with_type (TREE_OPERAND (t
, 1), TREE_TYPE (t
),
2548 tf_warning_or_error
);
2550 TARGET_EXPR_IMPLICIT_P (u
) = TARGET_EXPR_IMPLICIT_P (t
);
2551 TARGET_EXPR_LIST_INIT_P (u
) = TARGET_EXPR_LIST_INIT_P (t
);
2552 TARGET_EXPR_DIRECT_INIT_P (u
) = TARGET_EXPR_DIRECT_INIT_P (t
);
2554 /* Map the old variable to the new one. */
2555 splay_tree_insert (target_remap
,
2556 (splay_tree_key
) TREE_OPERAND (t
, 0),
2557 (splay_tree_value
) TREE_OPERAND (u
, 0));
2559 TREE_OPERAND (u
, 1) = break_out_target_exprs (TREE_OPERAND (u
, 1));
2561 /* Replace the old expression with the new version. */
2563 /* We don't have to go below this point; the recursive call to
2564 break_out_target_exprs will have handled anything below this
2569 if (TREE_CODE (*tp
) == SAVE_EXPR
)
2572 splay_tree_node n
= splay_tree_lookup (target_remap
,
2573 (splay_tree_key
) t
);
2576 *tp
= (tree
)n
->value
;
2581 copy_tree_r (tp
, walk_subtrees
, NULL
);
2582 splay_tree_insert (target_remap
,
2584 (splay_tree_value
)*tp
);
2585 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
2586 splay_tree_insert (target_remap
,
2587 (splay_tree_key
)*tp
,
2588 (splay_tree_value
)*tp
);
2593 /* Make a copy of this node. */
2594 t
= copy_tree_r (tp
, walk_subtrees
, NULL
);
2595 if (TREE_CODE (*tp
) == CALL_EXPR
)
2597 set_flags_from_callee (*tp
);
2599 /* builtin_LINE and builtin_FILE get the location where the default
2600 argument is expanded, not where the call was written. */
2601 tree callee
= get_callee_fndecl (*tp
);
2602 if (callee
&& DECL_BUILT_IN_CLASS (callee
) == BUILT_IN_NORMAL
)
2603 switch (DECL_FUNCTION_CODE (callee
))
2607 SET_EXPR_LOCATION (*tp
, input_location
);
2615 /* Replace all remapped VAR_DECLs in T with their new equivalents.
2616 DATA is really a splay-tree mapping old variables to new
2620 bot_replace (tree
* t
, int* /*walk_subtrees*/, void* data
)
2622 splay_tree target_remap
= ((splay_tree
) data
);
2626 splay_tree_node n
= splay_tree_lookup (target_remap
,
2627 (splay_tree_key
) *t
);
2629 *t
= (tree
) n
->value
;
2631 else if (TREE_CODE (*t
) == PARM_DECL
2632 && DECL_NAME (*t
) == this_identifier
2633 && !DECL_CONTEXT (*t
))
2635 /* In an NSDMI we need to replace the 'this' parameter we used for
2636 parsing with the real one for this function. */
2637 *t
= current_class_ptr
;
2639 else if (TREE_CODE (*t
) == CONVERT_EXPR
2640 && CONVERT_EXPR_VBASE_PATH (*t
))
2642 /* In an NSDMI build_base_path defers building conversions to virtual
2643 bases, and we handle it here. */
2644 tree basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (*t
)));
2645 vec
<tree
, va_gc
> *vbases
= CLASSTYPE_VBASECLASSES (current_class_type
);
2647 FOR_EACH_VEC_SAFE_ELT (vbases
, i
, binfo
)
2648 if (BINFO_TYPE (binfo
) == basetype
)
2650 *t
= build_base_path (PLUS_EXPR
, TREE_OPERAND (*t
, 0), binfo
, true,
2651 tf_warning_or_error
);
2657 /* When we parse a default argument expression, we may create
2658 temporary variables via TARGET_EXPRs. When we actually use the
2659 default-argument expression, we make a copy of the expression
2660 and replace the temporaries with appropriate local versions. */
2663 break_out_target_exprs (tree t
)
2665 static int target_remap_count
;
2666 static splay_tree target_remap
;
2668 if (!target_remap_count
++)
2669 target_remap
= splay_tree_new (splay_tree_compare_pointers
,
2670 /*splay_tree_delete_key_fn=*/NULL
,
2671 /*splay_tree_delete_value_fn=*/NULL
);
2672 cp_walk_tree (&t
, bot_manip
, target_remap
, NULL
);
2673 cp_walk_tree (&t
, bot_replace
, target_remap
, NULL
);
2675 if (!--target_remap_count
)
2677 splay_tree_delete (target_remap
);
2678 target_remap
= NULL
;
2684 /* Build an expression for the subobject of OBJ at CONSTRUCTOR index INDEX,
2685 which we expect to have type TYPE. */
2688 build_ctor_subob_ref (tree index
, tree type
, tree obj
)
2690 if (index
== NULL_TREE
)
2691 /* Can't refer to a particular member of a vector. */
2693 else if (TREE_CODE (index
) == INTEGER_CST
)
2694 obj
= cp_build_array_ref (input_location
, obj
, index
, tf_none
);
2696 obj
= build_class_member_access_expr (obj
, index
, NULL_TREE
,
2697 /*reference*/false, tf_none
);
2700 tree objtype
= TREE_TYPE (obj
);
2701 if (TREE_CODE (objtype
) == ARRAY_TYPE
&& !TYPE_DOMAIN (objtype
))
2703 /* When the destination object refers to a flexible array member
2704 verify that it matches the type of the source object except
2705 for its domain and qualifiers. */
2706 gcc_assert (comptypes (TYPE_MAIN_VARIANT (type
),
2707 TYPE_MAIN_VARIANT (objtype
),
2708 COMPARE_REDECLARATION
));
2711 gcc_assert (same_type_ignoring_top_level_qualifiers_p (type
, objtype
));
2717 /* Like substitute_placeholder_in_expr, but handle C++ tree codes and
2718 build up subexpressions as we go deeper. */
2721 replace_placeholders_r (tree
* t
, int* walk_subtrees
, void* data_
)
2723 tree obj
= static_cast<tree
>(data_
);
2725 if (TREE_CONSTANT (*t
))
2727 *walk_subtrees
= false;
2731 switch (TREE_CODE (*t
))
2733 case PLACEHOLDER_EXPR
:
2736 for (; !(same_type_ignoring_top_level_qualifiers_p
2737 (TREE_TYPE (*t
), TREE_TYPE (x
)));
2738 x
= TREE_OPERAND (x
, 0))
2739 gcc_assert (TREE_CODE (x
) == COMPONENT_REF
);
2741 *walk_subtrees
= false;
2747 constructor_elt
*ce
;
2748 vec
<constructor_elt
,va_gc
> *v
= CONSTRUCTOR_ELTS (*t
);
2749 for (unsigned i
= 0; vec_safe_iterate (v
, i
, &ce
); ++i
)
2751 tree
*valp
= &ce
->value
;
2752 tree type
= TREE_TYPE (*valp
);
2755 if (TREE_CODE (*valp
) == CONSTRUCTOR
2756 && AGGREGATE_TYPE_P (type
))
2758 /* If we're looking at the initializer for OBJ, then build
2759 a sub-object reference. If we're looking at an
2760 initializer for another object, just pass OBJ down. */
2761 if (same_type_ignoring_top_level_qualifiers_p
2762 (TREE_TYPE (*t
), TREE_TYPE (obj
)))
2763 subob
= build_ctor_subob_ref (ce
->index
, type
, obj
);
2764 if (TREE_CODE (*valp
) == TARGET_EXPR
)
2765 valp
= &TARGET_EXPR_INITIAL (*valp
);
2768 cp_walk_tree (valp
, replace_placeholders_r
,
2771 *walk_subtrees
= false;
2783 replace_placeholders (tree exp
, tree obj
)
2786 if (TREE_CODE (exp
) == TARGET_EXPR
)
2787 tp
= &TARGET_EXPR_INITIAL (exp
);
2788 cp_walk_tree (tp
, replace_placeholders_r
, obj
, NULL
);
2792 /* Similar to `build_nt', but for template definitions of dependent
2796 build_min_nt_loc (location_t loc
, enum tree_code code
, ...)
2803 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
2807 t
= make_node (code
);
2808 SET_EXPR_LOCATION (t
, loc
);
2809 length
= TREE_CODE_LENGTH (code
);
2811 for (i
= 0; i
< length
; i
++)
2813 tree x
= va_arg (p
, tree
);
2814 TREE_OPERAND (t
, i
) = x
;
2822 /* Similar to `build', but for template definitions. */
2825 build_min (enum tree_code code
, tree tt
, ...)
2832 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
2836 t
= make_node (code
);
2837 length
= TREE_CODE_LENGTH (code
);
2840 for (i
= 0; i
< length
; i
++)
2842 tree x
= va_arg (p
, tree
);
2843 TREE_OPERAND (t
, i
) = x
;
2844 if (x
&& !TYPE_P (x
) && TREE_SIDE_EFFECTS (x
))
2845 TREE_SIDE_EFFECTS (t
) = 1;
2852 /* Similar to `build', but for template definitions of non-dependent
2853 expressions. NON_DEP is the non-dependent expression that has been
2857 build_min_non_dep (enum tree_code code
, tree non_dep
, ...)
2864 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
2866 va_start (p
, non_dep
);
2868 if (REFERENCE_REF_P (non_dep
))
2869 non_dep
= TREE_OPERAND (non_dep
, 0);
2871 t
= make_node (code
);
2872 length
= TREE_CODE_LENGTH (code
);
2873 TREE_TYPE (t
) = TREE_TYPE (non_dep
);
2874 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (non_dep
);
2876 for (i
= 0; i
< length
; i
++)
2878 tree x
= va_arg (p
, tree
);
2879 TREE_OPERAND (t
, i
) = x
;
2882 if (code
== COMPOUND_EXPR
&& TREE_CODE (non_dep
) != COMPOUND_EXPR
)
2883 /* This should not be considered a COMPOUND_EXPR, because it
2884 resolves to an overload. */
2885 COMPOUND_EXPR_OVERLOADED (t
) = 1;
2888 return convert_from_reference (t
);
2891 /* Similar to `build_nt_call_vec', but for template definitions of
2892 non-dependent expressions. NON_DEP is the non-dependent expression
2893 that has been built. */
2896 build_min_non_dep_call_vec (tree non_dep
, tree fn
, vec
<tree
, va_gc
> *argvec
)
2898 tree t
= build_nt_call_vec (fn
, argvec
);
2899 if (REFERENCE_REF_P (non_dep
))
2900 non_dep
= TREE_OPERAND (non_dep
, 0);
2901 TREE_TYPE (t
) = TREE_TYPE (non_dep
);
2902 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (non_dep
);
2903 return convert_from_reference (t
);
2906 /* Similar to build_min_non_dep, but for expressions that have been resolved to
2907 a call to an operator overload. OP is the operator that has been
2908 overloaded. NON_DEP is the non-dependent expression that's been built,
2909 which should be a CALL_EXPR or an INDIRECT_REF to a CALL_EXPR. OVERLOAD is
2910 the overload that NON_DEP is calling. */
2913 build_min_non_dep_op_overload (enum tree_code op
,
2918 int nargs
, expected_nargs
;
2920 vec
<tree
, va_gc
> *args
;
2922 non_dep
= extract_call_expr (non_dep
);
2924 nargs
= call_expr_nargs (non_dep
);
2926 expected_nargs
= cp_tree_code_length (op
);
2927 if (op
== POSTINCREMENT_EXPR
2928 || op
== POSTDECREMENT_EXPR
)
2929 expected_nargs
+= 1;
2930 gcc_assert (nargs
== expected_nargs
);
2932 args
= make_tree_vector ();
2933 va_start (p
, overload
);
2935 if (TREE_CODE (TREE_TYPE (overload
)) == FUNCTION_TYPE
)
2938 for (int i
= 0; i
< nargs
; i
++)
2940 tree arg
= va_arg (p
, tree
);
2941 vec_safe_push (args
, arg
);
2944 else if (TREE_CODE (TREE_TYPE (overload
)) == METHOD_TYPE
)
2946 tree object
= va_arg (p
, tree
);
2947 tree binfo
= TYPE_BINFO (TREE_TYPE (object
));
2948 tree method
= build_baselink (binfo
, binfo
, overload
, NULL_TREE
);
2949 fn
= build_min (COMPONENT_REF
, TREE_TYPE (overload
),
2950 object
, method
, NULL_TREE
);
2951 for (int i
= 1; i
< nargs
; i
++)
2953 tree arg
= va_arg (p
, tree
);
2954 vec_safe_push (args
, arg
);
2961 call
= build_min_non_dep_call_vec (non_dep
, fn
, args
);
2962 release_tree_vector (args
);
2964 tree call_expr
= extract_call_expr (call
);
2965 KOENIG_LOOKUP_P (call_expr
) = KOENIG_LOOKUP_P (non_dep
);
2966 CALL_EXPR_OPERATOR_SYNTAX (call_expr
) = true;
2967 CALL_EXPR_ORDERED_ARGS (call_expr
) = CALL_EXPR_ORDERED_ARGS (non_dep
);
2968 CALL_EXPR_REVERSE_ARGS (call_expr
) = CALL_EXPR_REVERSE_ARGS (non_dep
);
2973 /* Return a new tree vec copied from VEC, with ELT inserted at index IDX. */
2976 vec_copy_and_insert (vec
<tree
, va_gc
> *old_vec
, tree elt
, unsigned idx
)
2978 unsigned len
= vec_safe_length (old_vec
);
2979 gcc_assert (idx
<= len
);
2981 vec
<tree
, va_gc
> *new_vec
= NULL
;
2982 vec_alloc (new_vec
, len
+ 1);
2985 for (i
= 0; i
< len
; ++i
)
2988 new_vec
->quick_push (elt
);
2989 new_vec
->quick_push ((*old_vec
)[i
]);
2992 new_vec
->quick_push (elt
);
2998 get_type_decl (tree t
)
3000 if (TREE_CODE (t
) == TYPE_DECL
)
3003 return TYPE_STUB_DECL (t
);
3004 gcc_assert (t
== error_mark_node
);
3008 /* Returns the namespace that contains DECL, whether directly or
3012 decl_namespace_context (tree decl
)
3016 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
3018 else if (TYPE_P (decl
))
3019 decl
= CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl
));
3021 decl
= CP_DECL_CONTEXT (decl
);
3025 /* Returns true if decl is within an anonymous namespace, however deeply
3026 nested, or false otherwise. */
3029 decl_anon_ns_mem_p (const_tree decl
)
3033 if (decl
== NULL_TREE
|| decl
== error_mark_node
)
3035 if (TREE_CODE (decl
) == NAMESPACE_DECL
3036 && DECL_NAME (decl
) == NULL_TREE
)
3038 /* Classes and namespaces inside anonymous namespaces have
3039 TREE_PUBLIC == 0, so we can shortcut the search. */
3040 else if (TYPE_P (decl
))
3041 return (TREE_PUBLIC (TYPE_MAIN_DECL (decl
)) == 0);
3042 else if (TREE_CODE (decl
) == NAMESPACE_DECL
)
3043 return (TREE_PUBLIC (decl
) == 0);
3045 decl
= DECL_CONTEXT (decl
);
3049 /* Subroutine of cp_tree_equal: t1 and t2 are the CALL_EXPR_FNs of two
3050 CALL_EXPRS. Return whether they are equivalent. */
3053 called_fns_equal (tree t1
, tree t2
)
3055 /* Core 1321: dependent names are equivalent even if the overload sets
3056 are different. But do compare explicit template arguments. */
3057 tree name1
= dependent_name (t1
);
3058 tree name2
= dependent_name (t2
);
3061 tree targs1
= NULL_TREE
, targs2
= NULL_TREE
;
3066 if (TREE_CODE (t1
) == TEMPLATE_ID_EXPR
)
3067 targs1
= TREE_OPERAND (t1
, 1);
3068 if (TREE_CODE (t2
) == TEMPLATE_ID_EXPR
)
3069 targs2
= TREE_OPERAND (t2
, 1);
3070 return cp_tree_equal (targs1
, targs2
);
3073 return cp_tree_equal (t1
, t2
);
3076 /* Return truthvalue of whether T1 is the same tree structure as T2.
3077 Return 1 if they are the same. Return 0 if they are different. */
3080 cp_tree_equal (tree t1
, tree t2
)
3082 enum tree_code code1
, code2
;
3089 code1
= TREE_CODE (t1
);
3090 code2
= TREE_CODE (t2
);
3098 /* There's only a single VOID_CST node, so we should never reach
3103 return tree_int_cst_equal (t1
, t2
);
3106 return real_equal (&TREE_REAL_CST (t1
), &TREE_REAL_CST (t2
));
3109 return TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
3110 && !memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
3111 TREE_STRING_LENGTH (t1
));
3114 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
),
3115 TREE_FIXED_CST (t2
));
3118 return cp_tree_equal (TREE_REALPART (t1
), TREE_REALPART (t2
))
3119 && cp_tree_equal (TREE_IMAGPART (t1
), TREE_IMAGPART (t2
));
3122 return operand_equal_p (t1
, t2
, OEP_ONLY_CONST
);
3125 /* We need to do this when determining whether or not two
3126 non-type pointer to member function template arguments
3128 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
3129 || CONSTRUCTOR_NELTS (t1
) != CONSTRUCTOR_NELTS (t2
))
3134 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t1
), i
, field
, value
)
3136 constructor_elt
*elt2
= CONSTRUCTOR_ELT (t2
, i
);
3137 if (!cp_tree_equal (field
, elt2
->index
)
3138 || !cp_tree_equal (value
, elt2
->value
))
3145 if (!cp_tree_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
)))
3147 if (!cp_tree_equal (TREE_VALUE (t1
), TREE_VALUE (t2
)))
3149 return cp_tree_equal (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
3152 return cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3157 call_expr_arg_iterator iter1
, iter2
;
3158 if (!called_fns_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
)))
3160 for (arg1
= first_call_expr_arg (t1
, &iter1
),
3161 arg2
= first_call_expr_arg (t2
, &iter2
);
3163 arg1
= next_call_expr_arg (&iter1
),
3164 arg2
= next_call_expr_arg (&iter2
))
3165 if (!cp_tree_equal (arg1
, arg2
))
3174 tree o1
= TREE_OPERAND (t1
, 0);
3175 tree o2
= TREE_OPERAND (t2
, 0);
3177 /* Special case: if either target is an unallocated VAR_DECL,
3178 it means that it's going to be unified with whatever the
3179 TARGET_EXPR is really supposed to initialize, so treat it
3180 as being equivalent to anything. */
3181 if (VAR_P (o1
) && DECL_NAME (o1
) == NULL_TREE
3182 && !DECL_RTL_SET_P (o1
))
3184 else if (VAR_P (o2
) && DECL_NAME (o2
) == NULL_TREE
3185 && !DECL_RTL_SET_P (o2
))
3187 else if (!cp_tree_equal (o1
, o2
))
3190 return cp_tree_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
3193 case WITH_CLEANUP_EXPR
:
3194 if (!cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0)))
3196 return cp_tree_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
3199 if (TREE_OPERAND (t1
, 1) != TREE_OPERAND (t2
, 1))
3201 return cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3204 /* For comparing uses of parameters in late-specified return types
3205 with an out-of-class definition of the function, but can also come
3206 up for expressions that involve 'this' in a member function
3209 if (comparing_specializations
&& !CONSTRAINT_VAR_P (t1
))
3210 /* When comparing hash table entries, only an exact match is
3211 good enough; we don't want to replace 'this' with the
3212 version from another function. But be more flexible
3213 with local parameters in a requires-expression. */
3216 if (same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
3218 if (DECL_ARTIFICIAL (t1
) ^ DECL_ARTIFICIAL (t2
))
3220 if (CONSTRAINT_VAR_P (t1
) ^ CONSTRAINT_VAR_P (t2
))
3222 if (DECL_ARTIFICIAL (t1
)
3223 || (DECL_PARM_LEVEL (t1
) == DECL_PARM_LEVEL (t2
)
3224 && DECL_PARM_INDEX (t1
) == DECL_PARM_INDEX (t2
)))
3234 case IDENTIFIER_NODE
:
3239 return (BASELINK_BINFO (t1
) == BASELINK_BINFO (t2
)
3240 && BASELINK_ACCESS_BINFO (t1
) == BASELINK_ACCESS_BINFO (t2
)
3241 && BASELINK_QUALIFIED_P (t1
) == BASELINK_QUALIFIED_P (t2
)
3242 && cp_tree_equal (BASELINK_FUNCTIONS (t1
),
3243 BASELINK_FUNCTIONS (t2
)));
3245 case TEMPLATE_PARM_INDEX
:
3246 return (TEMPLATE_PARM_IDX (t1
) == TEMPLATE_PARM_IDX (t2
)
3247 && TEMPLATE_PARM_LEVEL (t1
) == TEMPLATE_PARM_LEVEL (t2
)
3248 && (TEMPLATE_PARM_PARAMETER_PACK (t1
)
3249 == TEMPLATE_PARM_PARAMETER_PACK (t2
))
3250 && same_type_p (TREE_TYPE (TEMPLATE_PARM_DECL (t1
)),
3251 TREE_TYPE (TEMPLATE_PARM_DECL (t2
))));
3253 case TEMPLATE_ID_EXPR
:
3254 return (cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0))
3255 && cp_tree_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1)));
3257 case CONSTRAINT_INFO
:
3258 return cp_tree_equal (CI_ASSOCIATED_CONSTRAINTS (t1
),
3259 CI_ASSOCIATED_CONSTRAINTS (t2
));
3262 return (CHECK_CONSTR_CONCEPT (t1
) == CHECK_CONSTR_CONCEPT (t2
)
3263 && comp_template_args (CHECK_CONSTR_ARGS (t1
),
3264 CHECK_CONSTR_ARGS (t2
)));
3269 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
3271 for (ix
= TREE_VEC_LENGTH (t1
); ix
--;)
3272 if (!cp_tree_equal (TREE_VEC_ELT (t1
, ix
),
3273 TREE_VEC_ELT (t2
, ix
)))
3281 tree o1
= TREE_OPERAND (t1
, 0);
3282 tree o2
= TREE_OPERAND (t2
, 0);
3284 if (code1
== SIZEOF_EXPR
)
3286 if (SIZEOF_EXPR_TYPE_P (t1
))
3287 o1
= TREE_TYPE (o1
);
3288 if (SIZEOF_EXPR_TYPE_P (t2
))
3289 o2
= TREE_TYPE (o2
);
3291 if (TREE_CODE (o1
) != TREE_CODE (o2
))
3294 return same_type_p (o1
, o2
);
3296 return cp_tree_equal (o1
, o2
);
3301 tree t1_op1
, t2_op1
;
3303 if (!cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0)))
3306 t1_op1
= TREE_OPERAND (t1
, 1);
3307 t2_op1
= TREE_OPERAND (t2
, 1);
3308 if (TREE_CODE (t1_op1
) != TREE_CODE (t2_op1
))
3311 return cp_tree_equal (TREE_OPERAND (t1
, 2), TREE_OPERAND (t2
, 2));
3315 /* Two pointer-to-members are the same if they point to the same
3316 field or function in the same class. */
3317 if (PTRMEM_CST_MEMBER (t1
) != PTRMEM_CST_MEMBER (t2
))
3320 return same_type_p (PTRMEM_CST_CLASS (t1
), PTRMEM_CST_CLASS (t2
));
3323 if (OVL_FUNCTION (t1
) != OVL_FUNCTION (t2
))
3325 return cp_tree_equal (OVL_CHAIN (t1
), OVL_CHAIN (t2
));
3328 if (TRAIT_EXPR_KIND (t1
) != TRAIT_EXPR_KIND (t2
))
3330 return same_type_p (TRAIT_EXPR_TYPE1 (t1
), TRAIT_EXPR_TYPE1 (t2
))
3331 && cp_tree_equal (TRAIT_EXPR_TYPE2 (t1
), TRAIT_EXPR_TYPE2 (t2
));
3334 case STATIC_CAST_EXPR
:
3335 case REINTERPRET_CAST_EXPR
:
3336 case CONST_CAST_EXPR
:
3337 case DYNAMIC_CAST_EXPR
:
3338 case IMPLICIT_CONV_EXPR
:
3341 case NON_LVALUE_EXPR
:
3342 case VIEW_CONVERT_EXPR
:
3343 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
3345 /* Now compare operands as usual. */
3348 case DEFERRED_NOEXCEPT
:
3349 return (cp_tree_equal (DEFERRED_NOEXCEPT_PATTERN (t1
),
3350 DEFERRED_NOEXCEPT_PATTERN (t2
))
3351 && comp_template_args (DEFERRED_NOEXCEPT_ARGS (t1
),
3352 DEFERRED_NOEXCEPT_ARGS (t2
)));
3359 switch (TREE_CODE_CLASS (code1
))
3363 case tcc_comparison
:
3364 case tcc_expression
:
3371 n
= cp_tree_operand_length (t1
);
3372 if (TREE_CODE_CLASS (code1
) == tcc_vl_exp
3373 && n
!= TREE_OPERAND_LENGTH (t2
))
3376 for (i
= 0; i
< n
; ++i
)
3377 if (!cp_tree_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
)))
3384 return same_type_p (t1
, t2
);
3388 /* We can get here with --disable-checking. */
3392 /* The type of ARG when used as an lvalue. */
3395 lvalue_type (tree arg
)
3397 tree type
= TREE_TYPE (arg
);
3401 /* The type of ARG for printing error messages; denote lvalues with
3405 error_type (tree arg
)
3407 tree type
= TREE_TYPE (arg
);
3409 if (TREE_CODE (type
) == ARRAY_TYPE
)
3411 else if (TREE_CODE (type
) == ERROR_MARK
)
3413 else if (lvalue_p (arg
))
3414 type
= build_reference_type (lvalue_type (arg
));
3415 else if (MAYBE_CLASS_TYPE_P (type
))
3416 type
= lvalue_type (arg
);
3421 /* Does FUNCTION use a variable-length argument list? */
3424 varargs_function_p (const_tree function
)
3426 return stdarg_p (TREE_TYPE (function
));
3429 /* Returns 1 if decl is a member of a class. */
3432 member_p (const_tree decl
)
3434 const_tree
const ctx
= DECL_CONTEXT (decl
);
3435 return (ctx
&& TYPE_P (ctx
));
3438 /* Create a placeholder for member access where we don't actually have an
3439 object that the access is against. */
3442 build_dummy_object (tree type
)
3444 tree decl
= build1 (CONVERT_EXPR
, build_pointer_type (type
), void_node
);
3445 return cp_build_indirect_ref (decl
, RO_NULL
, tf_warning_or_error
);
3448 /* We've gotten a reference to a member of TYPE. Return *this if appropriate,
3449 or a dummy object otherwise. If BINFOP is non-0, it is filled with the
3450 binfo path from current_class_type to TYPE, or 0. */
3453 maybe_dummy_object (tree type
, tree
* binfop
)
3457 tree current
= current_nonlambda_class_type ();
3460 && (binfo
= lookup_base (current
, type
, ba_any
, NULL
,
3461 tf_warning_or_error
)))
3465 /* Reference from a nested class member function. */
3467 binfo
= TYPE_BINFO (type
);
3473 if (current_class_ref
3474 /* current_class_ref might not correspond to current_class_type if
3475 we're in tsubst_default_argument or a lambda-declarator; in either
3476 case, we want to use current_class_ref if it matches CONTEXT. */
3477 && (same_type_ignoring_top_level_qualifiers_p
3478 (TREE_TYPE (current_class_ref
), context
)))
3479 decl
= current_class_ref
;
3481 decl
= build_dummy_object (context
);
3486 /* Returns 1 if OB is a placeholder object, or a pointer to one. */
3489 is_dummy_object (const_tree ob
)
3491 if (INDIRECT_REF_P (ob
))
3492 ob
= TREE_OPERAND (ob
, 0);
3493 return (TREE_CODE (ob
) == CONVERT_EXPR
3494 && TREE_OPERAND (ob
, 0) == void_node
);
3497 /* Returns 1 iff type T is something we want to treat as a scalar type for
3498 the purpose of deciding whether it is trivial/POD/standard-layout. */
3501 scalarish_type_p (const_tree t
)
3503 if (t
== error_mark_node
)
3506 return (SCALAR_TYPE_P (t
) || VECTOR_TYPE_P (t
));
3509 /* Returns true iff T requires non-trivial default initialization. */
3512 type_has_nontrivial_default_init (const_tree t
)
3514 t
= strip_array_types (CONST_CAST_TREE (t
));
3516 if (CLASS_TYPE_P (t
))
3517 return TYPE_HAS_COMPLEX_DFLT (t
);
3522 /* Returns true iff copying an object of type T (including via move
3523 constructor) is non-trivial. That is, T has no non-trivial copy
3524 constructors and no non-trivial move constructors. */
3527 type_has_nontrivial_copy_init (const_tree t
)
3529 t
= strip_array_types (CONST_CAST_TREE (t
));
3531 if (CLASS_TYPE_P (t
))
3533 gcc_assert (COMPLETE_TYPE_P (t
));
3534 return ((TYPE_HAS_COPY_CTOR (t
)
3535 && TYPE_HAS_COMPLEX_COPY_CTOR (t
))
3536 || TYPE_HAS_COMPLEX_MOVE_CTOR (t
));
3542 /* Returns 1 iff type T is a trivially copyable type, as defined in
3543 [basic.types] and [class]. */
3546 trivially_copyable_p (const_tree t
)
3548 t
= strip_array_types (CONST_CAST_TREE (t
));
3550 if (CLASS_TYPE_P (t
))
3551 return ((!TYPE_HAS_COPY_CTOR (t
)
3552 || !TYPE_HAS_COMPLEX_COPY_CTOR (t
))
3553 && !TYPE_HAS_COMPLEX_MOVE_CTOR (t
)
3554 && (!TYPE_HAS_COPY_ASSIGN (t
)
3555 || !TYPE_HAS_COMPLEX_COPY_ASSIGN (t
))
3556 && !TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
)
3557 && TYPE_HAS_TRIVIAL_DESTRUCTOR (t
));
3559 return !CP_TYPE_VOLATILE_P (t
) && scalarish_type_p (t
);
3562 /* Returns 1 iff type T is a trivial type, as defined in [basic.types] and
3566 trivial_type_p (const_tree t
)
3568 t
= strip_array_types (CONST_CAST_TREE (t
));
3570 if (CLASS_TYPE_P (t
))
3571 return (TYPE_HAS_TRIVIAL_DFLT (t
)
3572 && trivially_copyable_p (t
));
3574 return scalarish_type_p (t
);
3577 /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */
3580 pod_type_p (const_tree t
)
3582 /* This CONST_CAST is okay because strip_array_types returns its
3583 argument unmodified and we assign it to a const_tree. */
3584 t
= strip_array_types (CONST_CAST_TREE(t
));
3586 if (!CLASS_TYPE_P (t
))
3587 return scalarish_type_p (t
);
3588 else if (cxx_dialect
> cxx98
)
3589 /* [class]/10: A POD struct is a class that is both a trivial class and a
3590 standard-layout class, and has no non-static data members of type
3591 non-POD struct, non-POD union (or array of such types).
3593 We don't need to check individual members because if a member is
3594 non-std-layout or non-trivial, the class will be too. */
3595 return (std_layout_type_p (t
) && trivial_type_p (t
));
3597 /* The C++98 definition of POD is different. */
3598 return !CLASSTYPE_NON_LAYOUT_POD_P (t
);
3601 /* Returns true iff T is POD for the purpose of layout, as defined in the
3605 layout_pod_type_p (const_tree t
)
3607 t
= strip_array_types (CONST_CAST_TREE (t
));
3609 if (CLASS_TYPE_P (t
))
3610 return !CLASSTYPE_NON_LAYOUT_POD_P (t
);
3612 return scalarish_type_p (t
);
3615 /* Returns true iff T is a standard-layout type, as defined in
3619 std_layout_type_p (const_tree t
)
3621 t
= strip_array_types (CONST_CAST_TREE (t
));
3623 if (CLASS_TYPE_P (t
))
3624 return !CLASSTYPE_NON_STD_LAYOUT (t
);
3626 return scalarish_type_p (t
);
3629 static bool record_has_unique_obj_representations (const_tree
, const_tree
);
3631 /* Returns true iff T satisfies std::has_unique_object_representations<T>,
3632 as defined in [meta.unary.prop]. */
3635 type_has_unique_obj_representations (const_tree t
)
3639 t
= strip_array_types (CONST_CAST_TREE (t
));
3641 if (!trivially_copyable_p (t
))
3644 if (CLASS_TYPE_P (t
) && CLASSTYPE_UNIQUE_OBJ_REPRESENTATIONS_SET (t
))
3645 return CLASSTYPE_UNIQUE_OBJ_REPRESENTATIONS (t
);
3647 switch (TREE_CODE (t
))
3651 case REFERENCE_TYPE
:
3652 /* If some backend has any paddings in these types, we should add
3653 a target hook for this and handle it there. */
3657 /* For bool values other than 0 and 1 should only appear with
3658 undefined behavior. */
3662 return type_has_unique_obj_representations (ENUM_UNDERLYING_TYPE (t
));
3665 /* XFmode certainly contains padding on x86, which the CPU doesn't store
3666 when storing long double values, so for that we have to return false.
3667 Other kinds of floating point values are questionable due to +.0/-.0
3668 and NaNs, let's play safe for now. */
3671 case FIXED_POINT_TYPE
:
3679 return type_has_unique_obj_representations (TREE_TYPE (t
));
3682 ret
= record_has_unique_obj_representations (t
, TYPE_SIZE (t
));
3683 if (CLASS_TYPE_P (t
))
3685 CLASSTYPE_UNIQUE_OBJ_REPRESENTATIONS_SET (t
) = 1;
3686 CLASSTYPE_UNIQUE_OBJ_REPRESENTATIONS (t
) = ret
;
3694 for (tree field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
3695 if (TREE_CODE (field
) == FIELD_DECL
)
3698 if (!type_has_unique_obj_representations (TREE_TYPE (field
))
3699 || simple_cst_equal (DECL_SIZE (field
), TYPE_SIZE (t
)) != 1)
3705 if (!any_fields
&& !integer_zerop (TYPE_SIZE (t
)))
3707 if (CLASS_TYPE_P (t
))
3709 CLASSTYPE_UNIQUE_OBJ_REPRESENTATIONS_SET (t
) = 1;
3710 CLASSTYPE_UNIQUE_OBJ_REPRESENTATIONS (t
) = ret
;
3725 /* Helper function for type_has_unique_obj_representations. */
3728 record_has_unique_obj_representations (const_tree t
, const_tree sz
)
3730 for (tree field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
3731 if (TREE_CODE (field
) != FIELD_DECL
)
3733 /* For bases, can't use type_has_unique_obj_representations here, as in
3734 struct S { int i : 24; S (); };
3735 struct T : public S { int j : 8; T (); };
3736 S doesn't have unique obj representations, but T does. */
3737 else if (DECL_FIELD_IS_BASE (field
))
3739 if (!record_has_unique_obj_representations (TREE_TYPE (field
),
3743 else if (DECL_C_BIT_FIELD (field
))
3745 tree btype
= DECL_BIT_FIELD_TYPE (field
);
3746 if (!type_has_unique_obj_representations (btype
))
3749 else if (!type_has_unique_obj_representations (TREE_TYPE (field
)))
3753 for (tree field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
3754 if (TREE_CODE (field
) == FIELD_DECL
)
3756 offset_int fld
= wi::to_offset (DECL_FIELD_OFFSET (field
));
3757 offset_int bitpos
= wi::to_offset (DECL_FIELD_BIT_OFFSET (field
));
3758 fld
= fld
* BITS_PER_UNIT
+ bitpos
;
3761 if (DECL_SIZE (field
))
3763 offset_int size
= wi::to_offset (DECL_SIZE (field
));
3767 if (cur
!= wi::to_offset (sz
))
3773 /* Nonzero iff type T is a class template implicit specialization. */
3776 class_tmpl_impl_spec_p (const_tree t
)
3778 return CLASS_TYPE_P (t
) && CLASSTYPE_TEMPLATE_INSTANTIATION (t
);
3781 /* Returns 1 iff zero initialization of type T means actually storing
3785 zero_init_p (const_tree t
)
3787 /* This CONST_CAST is okay because strip_array_types returns its
3788 argument unmodified and we assign it to a const_tree. */
3789 t
= strip_array_types (CONST_CAST_TREE(t
));
3791 if (t
== error_mark_node
)
3794 /* NULL pointers to data members are initialized with -1. */
3795 if (TYPE_PTRDATAMEM_P (t
))
3798 /* Classes that contain types that can't be zero-initialized, cannot
3799 be zero-initialized themselves. */
3800 if (CLASS_TYPE_P (t
) && CLASSTYPE_NON_ZERO_INIT_P (t
))
3806 /* Handle the C++17 [[nodiscard]] attribute, which is similar to the GNU
3807 warn_unused_result attribute. */
3810 handle_nodiscard_attribute (tree
*node
, tree name
, tree
/*args*/,
3811 int /*flags*/, bool *no_add_attrs
)
3813 if (TREE_CODE (*node
) == FUNCTION_DECL
)
3815 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (*node
))))
3816 warning (OPT_Wattributes
, "%qE attribute applied to %qD with void "
3817 "return type", name
, *node
);
3819 else if (OVERLOAD_TYPE_P (*node
))
3823 warning (OPT_Wattributes
, "%qE attribute can only be applied to "
3824 "functions or to class or enumeration types", name
);
3825 *no_add_attrs
= true;
3830 /* Table of valid C++ attributes. */
3831 const struct attribute_spec cxx_attribute_table
[] =
3833 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
3834 affects_type_identity } */
3835 { "init_priority", 1, 1, true, false, false,
3836 handle_init_priority_attribute
, false },
3837 { "abi_tag", 1, -1, false, false, false,
3838 handle_abi_tag_attribute
, true },
3839 { NULL
, 0, 0, false, false, false, NULL
, false }
3842 /* Table of C++ standard attributes. */
3843 const struct attribute_spec std_attribute_table
[] =
3845 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
3846 affects_type_identity } */
3847 { "maybe_unused", 0, 0, false, false, false,
3848 handle_unused_attribute
, false },
3849 { "nodiscard", 0, 0, false, false, false,
3850 handle_nodiscard_attribute
, false },
3851 { NULL
, 0, 0, false, false, false, NULL
, false }
3854 /* Handle an "init_priority" attribute; arguments as in
3855 struct attribute_spec.handler. */
3857 handle_init_priority_attribute (tree
* node
,
3863 tree initp_expr
= TREE_VALUE (args
);
3865 tree type
= TREE_TYPE (decl
);
3868 STRIP_NOPS (initp_expr
);
3869 initp_expr
= default_conversion (initp_expr
);
3871 initp_expr
= maybe_constant_value (initp_expr
);
3873 if (!initp_expr
|| TREE_CODE (initp_expr
) != INTEGER_CST
)
3875 error ("requested init_priority is not an integer constant");
3876 cxx_constant_value (initp_expr
);
3877 *no_add_attrs
= true;
3881 pri
= TREE_INT_CST_LOW (initp_expr
);
3883 type
= strip_array_types (type
);
3885 if (decl
== NULL_TREE
3887 || !TREE_STATIC (decl
)
3888 || DECL_EXTERNAL (decl
)
3889 || (TREE_CODE (type
) != RECORD_TYPE
3890 && TREE_CODE (type
) != UNION_TYPE
)
3891 /* Static objects in functions are initialized the
3892 first time control passes through that
3893 function. This is not precise enough to pin down an
3894 init_priority value, so don't allow it. */
3895 || current_function_decl
)
3897 error ("can only use %qE attribute on file-scope definitions "
3898 "of objects of class type", name
);
3899 *no_add_attrs
= true;
3903 if (pri
> MAX_INIT_PRIORITY
|| pri
<= 0)
3905 error ("requested init_priority is out of range");
3906 *no_add_attrs
= true;
3910 /* Check for init_priorities that are reserved for
3911 language and runtime support implementations.*/
3912 if (pri
<= MAX_RESERVED_INIT_PRIORITY
)
3915 (0, "requested init_priority is reserved for internal use");
3918 if (SUPPORTS_INIT_PRIORITY
)
3920 SET_DECL_INIT_PRIORITY (decl
, pri
);
3921 DECL_HAS_INIT_PRIORITY_P (decl
) = 1;
3926 error ("%qE attribute is not supported on this platform", name
);
3927 *no_add_attrs
= true;
3932 /* DECL is being redeclared; the old declaration had the abi tags in OLD,
3933 and the new one has the tags in NEW_. Give an error if there are tags
3934 in NEW_ that weren't in OLD. */
3937 check_abi_tag_redeclaration (const_tree decl
, const_tree old
, const_tree new_
)
3939 if (old
&& TREE_CODE (TREE_VALUE (old
)) == TREE_LIST
)
3940 old
= TREE_VALUE (old
);
3941 if (new_
&& TREE_CODE (TREE_VALUE (new_
)) == TREE_LIST
)
3942 new_
= TREE_VALUE (new_
);
3944 for (const_tree t
= new_
; t
; t
= TREE_CHAIN (t
))
3946 tree str
= TREE_VALUE (t
);
3947 for (const_tree in
= old
; in
; in
= TREE_CHAIN (in
))
3949 tree ostr
= TREE_VALUE (in
);
3950 if (cp_tree_equal (str
, ostr
))
3953 error ("redeclaration of %qD adds abi tag %E", decl
, str
);
3959 inform (DECL_SOURCE_LOCATION (decl
), "previous declaration here");
3965 /* The abi_tag attribute with the name NAME was given ARGS. If they are
3966 ill-formed, give an error and return false; otherwise, return true. */
3969 check_abi_tag_args (tree args
, tree name
)
3973 error ("the %qE attribute requires arguments", name
);
3976 for (tree arg
= args
; arg
; arg
= TREE_CHAIN (arg
))
3978 tree elt
= TREE_VALUE (arg
);
3979 if (TREE_CODE (elt
) != STRING_CST
3980 || (!same_type_ignoring_top_level_qualifiers_p
3981 (strip_array_types (TREE_TYPE (elt
)),
3984 error ("arguments to the %qE attribute must be narrow string "
3988 const char *begin
= TREE_STRING_POINTER (elt
);
3989 const char *end
= begin
+ TREE_STRING_LENGTH (elt
);
3990 for (const char *p
= begin
; p
!= end
; ++p
)
3995 if (!ISALPHA (c
) && c
!= '_')
3997 error ("arguments to the %qE attribute must contain valid "
3998 "identifiers", name
);
3999 inform (input_location
, "%<%c%> is not a valid first "
4000 "character for an identifier", c
);
4004 else if (p
== end
- 1)
4005 gcc_assert (c
== 0);
4008 if (!ISALNUM (c
) && c
!= '_')
4010 error ("arguments to the %qE attribute must contain valid "
4011 "identifiers", name
);
4012 inform (input_location
, "%<%c%> is not a valid character "
4013 "in an identifier", c
);
4022 /* Handle an "abi_tag" attribute; arguments as in
4023 struct attribute_spec.handler. */
4026 handle_abi_tag_attribute (tree
* node
, tree name
, tree args
,
4027 int flags
, bool* no_add_attrs
)
4029 if (!check_abi_tag_args (args
, name
))
4034 if (!OVERLOAD_TYPE_P (*node
))
4036 error ("%qE attribute applied to non-class, non-enum type %qT",
4040 else if (!(flags
& (int)ATTR_FLAG_TYPE_IN_PLACE
))
4042 error ("%qE attribute applied to %qT after its definition",
4046 else if (CLASS_TYPE_P (*node
)
4047 && CLASSTYPE_TEMPLATE_INSTANTIATION (*node
))
4049 warning (OPT_Wattributes
, "ignoring %qE attribute applied to "
4050 "template instantiation %qT", name
, *node
);
4053 else if (CLASS_TYPE_P (*node
)
4054 && CLASSTYPE_TEMPLATE_SPECIALIZATION (*node
))
4056 warning (OPT_Wattributes
, "ignoring %qE attribute applied to "
4057 "template specialization %qT", name
, *node
);
4061 tree attributes
= TYPE_ATTRIBUTES (*node
);
4062 tree decl
= TYPE_NAME (*node
);
4064 /* Make sure all declarations have the same abi tags. */
4065 if (DECL_SOURCE_LOCATION (decl
) != input_location
)
4067 if (!check_abi_tag_redeclaration (decl
,
4068 lookup_attribute ("abi_tag",
4076 if (!VAR_OR_FUNCTION_DECL_P (*node
))
4078 error ("%qE attribute applied to non-function, non-variable %qD",
4082 else if (DECL_LANGUAGE (*node
) == lang_c
)
4084 error ("%qE attribute applied to extern \"C\" declaration %qD",
4093 *no_add_attrs
= true;
4097 /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the
4098 thing pointed to by the constant. */
4101 make_ptrmem_cst (tree type
, tree member
)
4103 tree ptrmem_cst
= make_node (PTRMEM_CST
);
4104 TREE_TYPE (ptrmem_cst
) = type
;
4105 PTRMEM_CST_MEMBER (ptrmem_cst
) = member
;
4109 /* Build a variant of TYPE that has the indicated ATTRIBUTES. May
4110 return an existing type if an appropriate type already exists. */
4113 cp_build_type_attribute_variant (tree type
, tree attributes
)
4117 new_type
= build_type_attribute_variant (type
, attributes
);
4118 if (TREE_CODE (new_type
) == FUNCTION_TYPE
4119 || TREE_CODE (new_type
) == METHOD_TYPE
)
4121 new_type
= build_exception_variant (new_type
,
4122 TYPE_RAISES_EXCEPTIONS (type
));
4123 new_type
= build_ref_qualified_type (new_type
,
4124 type_memfn_rqual (type
));
4127 /* Making a new main variant of a class type is broken. */
4128 gcc_assert (!CLASS_TYPE_P (type
) || new_type
== type
);
4133 /* Return TRUE if TYPE1 and TYPE2 are identical for type hashing purposes.
4134 Called only after doing all language independent checks. */
4137 cxx_type_hash_eq (const_tree typea
, const_tree typeb
)
4139 gcc_assert (TREE_CODE (typea
) == FUNCTION_TYPE
4140 || TREE_CODE (typea
) == METHOD_TYPE
);
4142 if (type_memfn_rqual (typea
) != type_memfn_rqual (typeb
))
4144 return comp_except_specs (TYPE_RAISES_EXCEPTIONS (typea
),
4145 TYPE_RAISES_EXCEPTIONS (typeb
), ce_exact
);
4148 /* Apply FUNC to all language-specific sub-trees of TP in a pre-order
4149 traversal. Called from walk_tree. */
4152 cp_walk_subtrees (tree
*tp
, int *walk_subtrees_p
, walk_tree_fn func
,
4153 void *data
, hash_set
<tree
> *pset
)
4155 enum tree_code code
= TREE_CODE (*tp
);
4158 #define WALK_SUBTREE(NODE) \
4161 result = cp_walk_tree (&(NODE), func, data, pset); \
4162 if (result) goto out; \
4166 /* Not one of the easy cases. We must explicitly go through the
4172 case TEMPLATE_TEMPLATE_PARM
:
4173 case BOUND_TEMPLATE_TEMPLATE_PARM
:
4174 case UNBOUND_CLASS_TEMPLATE
:
4175 case TEMPLATE_PARM_INDEX
:
4176 case TEMPLATE_TYPE_PARM
:
4179 case UNDERLYING_TYPE
:
4180 /* None of these have subtrees other than those already walked
4182 *walk_subtrees_p
= 0;
4186 WALK_SUBTREE (BASELINK_FUNCTIONS (*tp
));
4187 *walk_subtrees_p
= 0;
4191 WALK_SUBTREE (TREE_TYPE (*tp
));
4192 *walk_subtrees_p
= 0;
4196 WALK_SUBTREE (TREE_PURPOSE (*tp
));
4200 WALK_SUBTREE (OVL_FUNCTION (*tp
));
4201 WALK_SUBTREE (OVL_CHAIN (*tp
));
4202 *walk_subtrees_p
= 0;
4206 WALK_SUBTREE (DECL_NAME (*tp
));
4207 WALK_SUBTREE (USING_DECL_SCOPE (*tp
));
4208 WALK_SUBTREE (USING_DECL_DECLS (*tp
));
4209 *walk_subtrees_p
= 0;
4213 if (TYPE_PTRMEMFUNC_P (*tp
))
4214 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE_RAW (*tp
));
4217 case TYPE_ARGUMENT_PACK
:
4218 case NONTYPE_ARGUMENT_PACK
:
4220 tree args
= ARGUMENT_PACK_ARGS (*tp
);
4221 int i
, len
= TREE_VEC_LENGTH (args
);
4222 for (i
= 0; i
< len
; i
++)
4223 WALK_SUBTREE (TREE_VEC_ELT (args
, i
));
4227 case TYPE_PACK_EXPANSION
:
4228 WALK_SUBTREE (TREE_TYPE (*tp
));
4229 WALK_SUBTREE (PACK_EXPANSION_EXTRA_ARGS (*tp
));
4230 *walk_subtrees_p
= 0;
4233 case EXPR_PACK_EXPANSION
:
4234 WALK_SUBTREE (TREE_OPERAND (*tp
, 0));
4235 WALK_SUBTREE (PACK_EXPANSION_EXTRA_ARGS (*tp
));
4236 *walk_subtrees_p
= 0;
4240 case REINTERPRET_CAST_EXPR
:
4241 case STATIC_CAST_EXPR
:
4242 case CONST_CAST_EXPR
:
4243 case DYNAMIC_CAST_EXPR
:
4244 case IMPLICIT_CONV_EXPR
:
4245 if (TREE_TYPE (*tp
))
4246 WALK_SUBTREE (TREE_TYPE (*tp
));
4250 for (i
= 0; i
< TREE_CODE_LENGTH (TREE_CODE (*tp
)); ++i
)
4251 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
4253 *walk_subtrees_p
= 0;
4257 WALK_SUBTREE (TRAIT_EXPR_TYPE1 (*tp
));
4258 WALK_SUBTREE (TRAIT_EXPR_TYPE2 (*tp
));
4259 *walk_subtrees_p
= 0;
4263 WALK_SUBTREE (DECLTYPE_TYPE_EXPR (*tp
));
4264 *walk_subtrees_p
= 0;
4268 // Only recurse through the nested expression. Do not
4269 // walk the parameter list. Doing so causes false
4270 // positives in the pack expansion checker since the
4271 // requires parameters are introduced as pack expansions.
4272 WALK_SUBTREE (TREE_OPERAND (*tp
, 1));
4273 *walk_subtrees_p
= 0;
4277 /* User variables should be mentioned in BIND_EXPR_VARS
4278 and their initializers and sizes walked when walking
4279 the containing BIND_EXPR. Compiler temporaries are
4281 if (VAR_P (TREE_OPERAND (*tp
, 0))
4282 && DECL_ARTIFICIAL (TREE_OPERAND (*tp
, 0))
4283 && !TREE_STATIC (TREE_OPERAND (*tp
, 0)))
4285 tree decl
= TREE_OPERAND (*tp
, 0);
4286 WALK_SUBTREE (DECL_INITIAL (decl
));
4287 WALK_SUBTREE (DECL_SIZE (decl
));
4288 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
4296 /* We didn't find what we were looking for. */
4303 /* Like save_expr, but for C++. */
4306 cp_save_expr (tree expr
)
4308 /* There is no reason to create a SAVE_EXPR within a template; if
4309 needed, we can create the SAVE_EXPR when instantiating the
4310 template. Furthermore, the middle-end cannot handle C++-specific
4312 if (processing_template_decl
)
4314 return save_expr (expr
);
4317 /* Initialize tree.c. */
4322 list_hash_table
= hash_table
<list_hasher
>::create_ggc (61);
4323 register_scoped_attributes (std_attribute_table
, NULL
);
4326 /* Returns the kind of special function that DECL (a FUNCTION_DECL)
4327 is. Note that sfk_none is zero, so this function can be used as a
4328 predicate to test whether or not DECL is a special function. */
4330 special_function_kind
4331 special_function_p (const_tree decl
)
4333 /* Rather than doing all this stuff with magic names, we should
4334 probably have a field of type `special_function_kind' in
4335 DECL_LANG_SPECIFIC. */
4336 if (DECL_INHERITED_CTOR (decl
))
4337 return sfk_inheriting_constructor
;
4338 if (DECL_COPY_CONSTRUCTOR_P (decl
))
4339 return sfk_copy_constructor
;
4340 if (DECL_MOVE_CONSTRUCTOR_P (decl
))
4341 return sfk_move_constructor
;
4342 if (DECL_CONSTRUCTOR_P (decl
))
4343 return sfk_constructor
;
4344 if (DECL_OVERLOADED_OPERATOR_P (decl
) == NOP_EXPR
)
4346 if (copy_fn_p (decl
))
4347 return sfk_copy_assignment
;
4348 if (move_fn_p (decl
))
4349 return sfk_move_assignment
;
4351 if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl
))
4352 return sfk_destructor
;
4353 if (DECL_COMPLETE_DESTRUCTOR_P (decl
))
4354 return sfk_complete_destructor
;
4355 if (DECL_BASE_DESTRUCTOR_P (decl
))
4356 return sfk_base_destructor
;
4357 if (DECL_DELETING_DESTRUCTOR_P (decl
))
4358 return sfk_deleting_destructor
;
4359 if (DECL_CONV_FN_P (decl
))
4360 return sfk_conversion
;
4365 /* Returns nonzero if TYPE is a character type, including wchar_t. */
4368 char_type_p (tree type
)
4370 return (same_type_p (type
, char_type_node
)
4371 || same_type_p (type
, unsigned_char_type_node
)
4372 || same_type_p (type
, signed_char_type_node
)
4373 || same_type_p (type
, char16_type_node
)
4374 || same_type_p (type
, char32_type_node
)
4375 || same_type_p (type
, wchar_type_node
));
4378 /* Returns the kind of linkage associated with the indicated DECL. Th
4379 value returned is as specified by the language standard; it is
4380 independent of implementation details regarding template
4381 instantiation, etc. For example, it is possible that a declaration
4382 to which this function assigns external linkage would not show up
4383 as a global symbol when you run `nm' on the resulting object file. */
4386 decl_linkage (tree decl
)
4388 /* This function doesn't attempt to calculate the linkage from first
4389 principles as given in [basic.link]. Instead, it makes use of
4390 the fact that we have already set TREE_PUBLIC appropriately, and
4391 then handles a few special cases. Ideally, we would calculate
4392 linkage first, and then transform that into a concrete
4395 /* Things that don't have names have no linkage. */
4396 if (!DECL_NAME (decl
))
4399 /* Fields have no linkage. */
4400 if (TREE_CODE (decl
) == FIELD_DECL
)
4403 /* Things that are TREE_PUBLIC have external linkage. */
4404 if (TREE_PUBLIC (decl
))
4407 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
4410 /* Linkage of a CONST_DECL depends on the linkage of the enumeration
4412 if (TREE_CODE (decl
) == CONST_DECL
)
4413 return decl_linkage (TYPE_NAME (DECL_CONTEXT (decl
)));
4415 /* Things in local scope do not have linkage, if they don't have
4417 if (decl_function_context (decl
))
4420 /* Members of the anonymous namespace also have TREE_PUBLIC unset, but
4421 are considered to have external linkage for language purposes, as do
4422 template instantiations on targets without weak symbols. DECLs really
4423 meant to have internal linkage have DECL_THIS_STATIC set. */
4424 if (TREE_CODE (decl
) == TYPE_DECL
)
4426 if (VAR_OR_FUNCTION_DECL_P (decl
))
4428 if (!DECL_THIS_STATIC (decl
))
4431 /* Static data members and static member functions from classes
4432 in anonymous namespace also don't have TREE_PUBLIC set. */
4433 if (DECL_CLASS_CONTEXT (decl
))
4437 /* Everything else has internal linkage. */
4441 /* Returns the storage duration of the object or reference associated with
4442 the indicated DECL, which should be a VAR_DECL or PARM_DECL. */
4445 decl_storage_duration (tree decl
)
4447 if (TREE_CODE (decl
) == PARM_DECL
)
4449 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4451 gcc_assert (VAR_P (decl
));
4452 if (!TREE_STATIC (decl
)
4453 && !DECL_EXTERNAL (decl
))
4455 if (CP_DECL_THREAD_LOCAL_P (decl
))
4460 /* EXP is an expression that we want to pre-evaluate. Returns (in
4461 *INITP) an expression that will perform the pre-evaluation. The
4462 value returned by this function is a side-effect free expression
4463 equivalent to the pre-evaluated expression. Callers must ensure
4464 that *INITP is evaluated before EXP. */
4467 stabilize_expr (tree exp
, tree
* initp
)
4471 if (!TREE_SIDE_EFFECTS (exp
))
4472 init_expr
= NULL_TREE
;
4473 else if (VOID_TYPE_P (TREE_TYPE (exp
)))
4478 /* There are no expressions with REFERENCE_TYPE, but there can be call
4479 arguments with such a type; just treat it as a pointer. */
4480 else if (TREE_CODE (TREE_TYPE (exp
)) == REFERENCE_TYPE
4481 || SCALAR_TYPE_P (TREE_TYPE (exp
))
4482 || !glvalue_p (exp
))
4484 init_expr
= get_target_expr (exp
);
4485 exp
= TARGET_EXPR_SLOT (init_expr
);
4486 if (CLASS_TYPE_P (TREE_TYPE (exp
)))
4493 bool xval
= !lvalue_p (exp
);
4494 exp
= cp_build_addr_expr (exp
, tf_warning_or_error
);
4495 init_expr
= get_target_expr (exp
);
4496 exp
= TARGET_EXPR_SLOT (init_expr
);
4497 exp
= cp_build_indirect_ref (exp
, RO_NULL
, tf_warning_or_error
);
4503 gcc_assert (!TREE_SIDE_EFFECTS (exp
));
4507 /* Add NEW_EXPR, an expression whose value we don't care about, after the
4508 similar expression ORIG. */
4511 add_stmt_to_compound (tree orig
, tree new_expr
)
4513 if (!new_expr
|| !TREE_SIDE_EFFECTS (new_expr
))
4515 if (!orig
|| !TREE_SIDE_EFFECTS (orig
))
4517 return build2 (COMPOUND_EXPR
, void_type_node
, orig
, new_expr
);
4520 /* Like stabilize_expr, but for a call whose arguments we want to
4521 pre-evaluate. CALL is modified in place to use the pre-evaluated
4522 arguments, while, upon return, *INITP contains an expression to
4523 compute the arguments. */
4526 stabilize_call (tree call
, tree
*initp
)
4528 tree inits
= NULL_TREE
;
4530 int nargs
= call_expr_nargs (call
);
4532 if (call
== error_mark_node
|| processing_template_decl
)
4538 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
4540 for (i
= 0; i
< nargs
; i
++)
4543 CALL_EXPR_ARG (call
, i
) =
4544 stabilize_expr (CALL_EXPR_ARG (call
, i
), &init
);
4545 inits
= add_stmt_to_compound (inits
, init
);
4551 /* Like stabilize_expr, but for an AGGR_INIT_EXPR whose arguments we want
4552 to pre-evaluate. CALL is modified in place to use the pre-evaluated
4553 arguments, while, upon return, *INITP contains an expression to
4554 compute the arguments. */
4557 stabilize_aggr_init (tree call
, tree
*initp
)
4559 tree inits
= NULL_TREE
;
4561 int nargs
= aggr_init_expr_nargs (call
);
4563 if (call
== error_mark_node
)
4566 gcc_assert (TREE_CODE (call
) == AGGR_INIT_EXPR
);
4568 for (i
= 0; i
< nargs
; i
++)
4571 AGGR_INIT_EXPR_ARG (call
, i
) =
4572 stabilize_expr (AGGR_INIT_EXPR_ARG (call
, i
), &init
);
4573 inits
= add_stmt_to_compound (inits
, init
);
4579 /* Like stabilize_expr, but for an initialization.
4581 If the initialization is for an object of class type, this function
4582 takes care not to introduce additional temporaries.
4584 Returns TRUE iff the expression was successfully pre-evaluated,
4585 i.e., if INIT is now side-effect free, except for, possibly, a
4586 single call to a constructor. */
4589 stabilize_init (tree init
, tree
*initp
)
4595 if (t
== error_mark_node
|| processing_template_decl
)
4598 if (TREE_CODE (t
) == INIT_EXPR
)
4599 t
= TREE_OPERAND (t
, 1);
4600 if (TREE_CODE (t
) == TARGET_EXPR
)
4601 t
= TARGET_EXPR_INITIAL (t
);
4603 /* If the RHS can be stabilized without breaking copy elision, stabilize
4604 it. We specifically don't stabilize class prvalues here because that
4605 would mean an extra copy, but they might be stabilized below. */
4606 if (TREE_CODE (init
) == INIT_EXPR
4607 && TREE_CODE (t
) != CONSTRUCTOR
4608 && TREE_CODE (t
) != AGGR_INIT_EXPR
4609 && (SCALAR_TYPE_P (TREE_TYPE (t
))
4612 TREE_OPERAND (init
, 1) = stabilize_expr (t
, initp
);
4616 if (TREE_CODE (t
) == COMPOUND_EXPR
4617 && TREE_CODE (init
) == INIT_EXPR
)
4619 tree last
= expr_last (t
);
4620 /* Handle stabilizing the EMPTY_CLASS_EXPR pattern. */
4621 if (!TREE_SIDE_EFFECTS (last
))
4624 TREE_OPERAND (init
, 1) = last
;
4629 if (TREE_CODE (t
) == CONSTRUCTOR
)
4631 /* Aggregate initialization: stabilize each of the field
4634 constructor_elt
*ce
;
4636 vec
<constructor_elt
, va_gc
> *v
= CONSTRUCTOR_ELTS (t
);
4637 for (i
= 0; vec_safe_iterate (v
, i
, &ce
); ++i
)
4639 tree type
= TREE_TYPE (ce
->value
);
4641 if (TREE_CODE (type
) == REFERENCE_TYPE
4642 || SCALAR_TYPE_P (type
))
4643 ce
->value
= stabilize_expr (ce
->value
, &subinit
);
4644 else if (!stabilize_init (ce
->value
, &subinit
))
4646 *initp
= add_stmt_to_compound (*initp
, subinit
);
4651 if (TREE_CODE (t
) == CALL_EXPR
)
4653 stabilize_call (t
, initp
);
4657 if (TREE_CODE (t
) == AGGR_INIT_EXPR
)
4659 stabilize_aggr_init (t
, initp
);
4663 /* The initialization is being performed via a bitwise copy -- and
4664 the item copied may have side effects. */
4665 return !TREE_SIDE_EFFECTS (init
);
4668 /* Returns true if a cast to TYPE may appear in an integral constant
4672 cast_valid_in_integral_constant_expression_p (tree type
)
4674 return (INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
4675 || cxx_dialect
>= cxx11
4676 || dependent_type_p (type
)
4677 || type
== error_mark_node
);
4680 /* Return true if we need to fix linkage information of DECL. */
4683 cp_fix_function_decl_p (tree decl
)
4685 /* Skip if DECL is not externally visible. */
4686 if (!TREE_PUBLIC (decl
))
4689 /* We need to fix DECL if it a appears to be exported but with no
4690 function body. Thunks do not have CFGs and we may need to
4691 handle them specially later. */
4692 if (!gimple_has_body_p (decl
)
4693 && !DECL_THUNK_P (decl
)
4694 && !DECL_EXTERNAL (decl
))
4696 struct cgraph_node
*node
= cgraph_node::get (decl
);
4698 /* Don't fix same_body aliases. Although they don't have their own
4699 CFG, they share it with what they alias to. */
4700 if (!node
|| !node
->alias
4701 || !vec_safe_length (node
->ref_list
.references
))
4708 /* Clean the C++ specific parts of the tree T. */
4711 cp_free_lang_data (tree t
)
4713 if (TREE_CODE (t
) == METHOD_TYPE
4714 || TREE_CODE (t
) == FUNCTION_TYPE
)
4716 /* Default args are not interesting anymore. */
4717 tree argtypes
= TYPE_ARG_TYPES (t
);
4720 TREE_PURPOSE (argtypes
) = 0;
4721 argtypes
= TREE_CHAIN (argtypes
);
4724 else if (TREE_CODE (t
) == FUNCTION_DECL
4725 && cp_fix_function_decl_p (t
))
4727 /* If T is used in this translation unit at all, the definition
4728 must exist somewhere else since we have decided to not emit it
4729 in this TU. So make it an external reference. */
4730 DECL_EXTERNAL (t
) = 1;
4731 TREE_STATIC (t
) = 0;
4733 if (TREE_CODE (t
) == NAMESPACE_DECL
)
4735 /* The list of users of a namespace isn't useful for the middle-end
4736 or debug generators. */
4737 DECL_NAMESPACE_USERS (t
) = NULL_TREE
;
4738 /* Neither do we need the leftover chaining of namespaces
4739 from the binding level. */
4740 DECL_CHAIN (t
) = NULL_TREE
;
4744 /* Stub for c-common. Please keep in sync with c-decl.c.
4745 FIXME: If address space support is target specific, then this
4746 should be a C target hook. But currently this is not possible,
4747 because this function is called via REGISTER_TARGET_PRAGMAS. */
4749 c_register_addr_space (const char * /*word*/, addr_space_t
/*as*/)
4753 /* Return the number of operands in T that we care about for things like
4757 cp_tree_operand_length (const_tree t
)
4759 enum tree_code code
= TREE_CODE (t
);
4761 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
4762 return VL_EXP_OPERAND_LENGTH (t
);
4764 return cp_tree_code_length (code
);
4767 /* Like cp_tree_operand_length, but takes a tree_code CODE. */
4770 cp_tree_code_length (enum tree_code code
)
4772 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4776 case PREINCREMENT_EXPR
:
4777 case PREDECREMENT_EXPR
:
4778 case POSTINCREMENT_EXPR
:
4779 case POSTDECREMENT_EXPR
:
4785 case EXPR_PACK_EXPANSION
:
4789 return TREE_CODE_LENGTH (code
);
4793 /* Implement -Wzero_as_null_pointer_constant. Return true if the
4794 conditions for the warning hold, false otherwise. */
4796 maybe_warn_zero_as_null_pointer_constant (tree expr
, location_t loc
)
4798 if (c_inhibit_evaluation_warnings
== 0
4799 && !NULLPTR_TYPE_P (TREE_TYPE (expr
)))
4801 warning_at (loc
, OPT_Wzero_as_null_pointer_constant
,
4802 "zero as null pointer constant");
4808 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4809 /* Complain that some language-specific thing hanging off a tree
4810 node has been accessed improperly. */
4813 lang_check_failed (const char* file
, int line
, const char* function
)
4815 internal_error ("lang_* check: failed in %s, at %s:%d",
4816 function
, trim_filename (file
), line
);
4818 #endif /* ENABLE_TREE_CHECKING */
4820 #include "gt-cp-tree.h"