1 /* Language-dependent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2020 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"
35 #include "stringpool.h"
40 static tree
bot_manip (tree
*, int *, void *);
41 static tree
bot_replace (tree
*, int *, void *);
42 static hashval_t
list_hash_pieces (tree
, tree
, tree
);
43 static tree
build_target_expr (tree
, tree
, tsubst_flags_t
);
44 static tree
count_trees_r (tree
*, int *, void *);
45 static tree
verify_stmt_tree_r (tree
*, int *, void *);
47 static tree
handle_init_priority_attribute (tree
*, tree
, tree
, int, bool *);
48 static tree
handle_abi_tag_attribute (tree
*, tree
, tree
, int, bool *);
50 /* If REF is an lvalue, returns the kind of lvalue that REF is.
51 Otherwise, returns clk_none. */
54 lvalue_kind (const_tree ref
)
56 cp_lvalue_kind op1_lvalue_kind
= clk_none
;
57 cp_lvalue_kind op2_lvalue_kind
= clk_none
;
59 /* Expressions of reference type are sometimes wrapped in
60 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
61 representation, not part of the language, so we have to look
63 if (REFERENCE_REF_P (ref
))
64 return lvalue_kind (TREE_OPERAND (ref
, 0));
67 && TYPE_REF_P (TREE_TYPE (ref
)))
69 /* unnamed rvalue references are rvalues */
70 if (TYPE_REF_IS_RVALUE (TREE_TYPE (ref
))
71 && TREE_CODE (ref
) != PARM_DECL
73 && TREE_CODE (ref
) != COMPONENT_REF
74 /* Functions are always lvalues. */
75 && TREE_CODE (TREE_TYPE (TREE_TYPE (ref
))) != FUNCTION_TYPE
)
77 op1_lvalue_kind
= clk_rvalueref
;
78 if (implicit_rvalue_p (ref
))
79 op1_lvalue_kind
|= clk_implicit_rval
;
80 return op1_lvalue_kind
;
83 /* lvalue references and named rvalue references are lvalues. */
87 if (ref
== current_class_ptr
)
90 /* Expressions with cv void type are prvalues. */
91 if (TREE_TYPE (ref
) && VOID_TYPE_P (TREE_TYPE (ref
)))
94 switch (TREE_CODE (ref
))
99 /* preincrements and predecrements are valid lvals, provided
100 what they refer to are valid lvals. */
101 case PREINCREMENT_EXPR
:
102 case PREDECREMENT_EXPR
:
106 case VIEW_CONVERT_EXPR
:
107 return lvalue_kind (TREE_OPERAND (ref
, 0));
111 tree op1
= TREE_OPERAND (ref
, 0);
112 if (TREE_CODE (TREE_TYPE (op1
)) == ARRAY_TYPE
)
114 op1_lvalue_kind
= lvalue_kind (op1
);
115 if (op1_lvalue_kind
== clk_class
)
116 /* in the case of an array operand, the result is an lvalue if
117 that operand is an lvalue and an xvalue otherwise */
118 op1_lvalue_kind
= clk_rvalueref
;
119 return op1_lvalue_kind
;
127 if (TREE_CODE (ref
) == MEMBER_REF
)
128 op1_lvalue_kind
= clk_ordinary
;
130 op1_lvalue_kind
= lvalue_kind (TREE_OPERAND (ref
, 0));
131 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (ref
, 1))))
132 op1_lvalue_kind
= clk_none
;
133 else if (op1_lvalue_kind
== clk_class
)
134 /* The result of a .* expression whose second operand is a pointer to a
135 data member is an lvalue if the first operand is an lvalue and an
137 op1_lvalue_kind
= clk_rvalueref
;
138 return op1_lvalue_kind
;
141 if (BASELINK_P (TREE_OPERAND (ref
, 1)))
143 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (ref
, 1));
145 /* For static member function recurse on the BASELINK, we can get
146 here e.g. from reference_binding. If BASELINK_FUNCTIONS is
147 OVERLOAD, the overload is resolved first if possible through
148 resolve_address_of_overloaded_function. */
149 if (TREE_CODE (fn
) == FUNCTION_DECL
&& DECL_STATIC_FUNCTION_P (fn
))
150 return lvalue_kind (TREE_OPERAND (ref
, 1));
152 op1_lvalue_kind
= lvalue_kind (TREE_OPERAND (ref
, 0));
153 if (op1_lvalue_kind
== clk_class
)
154 /* If E1 is an lvalue, then E1.E2 is an lvalue;
155 otherwise E1.E2 is an xvalue. */
156 op1_lvalue_kind
= clk_rvalueref
;
158 /* Look at the member designator. */
159 if (!op1_lvalue_kind
)
161 else if (is_overloaded_fn (TREE_OPERAND (ref
, 1)))
162 /* The "field" can be a FUNCTION_DECL or an OVERLOAD in some
163 situations. If we're seeing a COMPONENT_REF, it's a non-static
164 member, so it isn't an lvalue. */
165 op1_lvalue_kind
= clk_none
;
166 else if (TREE_CODE (TREE_OPERAND (ref
, 1)) != FIELD_DECL
)
167 /* This can be IDENTIFIER_NODE in a template. */;
168 else if (DECL_C_BIT_FIELD (TREE_OPERAND (ref
, 1)))
170 /* Clear the ordinary bit. If this object was a class
171 rvalue we want to preserve that information. */
172 op1_lvalue_kind
&= ~clk_ordinary
;
173 /* The lvalue is for a bitfield. */
174 op1_lvalue_kind
|= clk_bitfield
;
176 else if (DECL_PACKED (TREE_OPERAND (ref
, 1)))
177 op1_lvalue_kind
|= clk_packed
;
179 return op1_lvalue_kind
;
182 case COMPOUND_LITERAL_EXPR
:
186 /* CONST_DECL without TREE_STATIC are enumeration values and
187 thus not lvalues. With TREE_STATIC they are used by ObjC++
188 in objc_build_string_object and need to be considered as
190 if (! TREE_STATIC (ref
))
194 if (VAR_P (ref
) && DECL_HAS_VALUE_EXPR_P (ref
))
195 return lvalue_kind (DECL_VALUE_EXPR (CONST_CAST_TREE (ref
)));
197 if (TREE_READONLY (ref
) && ! TREE_STATIC (ref
)
198 && DECL_LANG_SPECIFIC (ref
)
199 && DECL_IN_AGGR_P (ref
))
206 case PLACEHOLDER_EXPR
:
209 /* A scope ref in a template, left as SCOPE_REF to support later
212 gcc_assert (!type_dependent_expression_p (CONST_CAST_TREE (ref
)));
214 tree op
= TREE_OPERAND (ref
, 1);
215 if (TREE_CODE (op
) == FIELD_DECL
)
216 return (DECL_C_BIT_FIELD (op
) ? clk_bitfield
: clk_ordinary
);
218 return lvalue_kind (op
);
223 /* Disallow <? and >? as lvalues if either argument side-effects. */
224 if (TREE_SIDE_EFFECTS (TREE_OPERAND (ref
, 0))
225 || TREE_SIDE_EFFECTS (TREE_OPERAND (ref
, 1)))
227 op1_lvalue_kind
= lvalue_kind (TREE_OPERAND (ref
, 0));
228 op2_lvalue_kind
= lvalue_kind (TREE_OPERAND (ref
, 1));
232 if (processing_template_decl
)
234 /* Within templates, a REFERENCE_TYPE will indicate whether
235 the COND_EXPR result is an ordinary lvalue or rvalueref.
236 Since REFERENCE_TYPEs are handled above, if we reach this
237 point, we know we got a plain rvalue. Unless we have a
238 type-dependent expr, that is, but we shouldn't be testing
239 lvalueness if we can't even tell the types yet! */
240 gcc_assert (!type_dependent_expression_p (CONST_CAST_TREE (ref
)));
244 tree op1
= TREE_OPERAND (ref
, 1);
245 if (!op1
) op1
= TREE_OPERAND (ref
, 0);
246 tree op2
= TREE_OPERAND (ref
, 2);
247 op1_lvalue_kind
= lvalue_kind (op1
);
248 op2_lvalue_kind
= lvalue_kind (op2
);
249 if (!op1_lvalue_kind
!= !op2_lvalue_kind
)
251 /* The second or the third operand (but not both) is a
252 throw-expression; the result is of the type
253 and value category of the other. */
254 if (op1_lvalue_kind
&& TREE_CODE (op2
) == THROW_EXPR
)
255 op2_lvalue_kind
= op1_lvalue_kind
;
256 else if (op2_lvalue_kind
&& TREE_CODE (op1
) == THROW_EXPR
)
257 op1_lvalue_kind
= op2_lvalue_kind
;
263 /* We expect to see unlowered MODOP_EXPRs only during
264 template processing. */
265 gcc_assert (processing_template_decl
);
273 return lvalue_kind (TREE_OPERAND (ref
, 1));
279 return (CLASS_TYPE_P (TREE_TYPE (ref
)) ? clk_class
: clk_none
);
282 /* We can see calls outside of TARGET_EXPR in templates. */
283 if (CLASS_TYPE_P (TREE_TYPE (ref
)))
288 /* All functions (except non-static-member functions) are
290 return (DECL_NONSTATIC_MEMBER_FUNCTION_P (ref
)
291 ? clk_none
: clk_ordinary
);
294 /* We now represent a reference to a single static member function
296 /* This CONST_CAST is okay because BASELINK_FUNCTIONS returns
297 its argument unmodified and we assign it to a const_tree. */
298 return lvalue_kind (BASELINK_FUNCTIONS (CONST_CAST_TREE (ref
)));
300 case NON_DEPENDENT_EXPR
:
302 return lvalue_kind (TREE_OPERAND (ref
, 0));
304 case TEMPLATE_PARM_INDEX
:
305 if (CLASS_TYPE_P (TREE_TYPE (ref
)))
306 /* A template parameter object is an lvalue. */
312 if (!TREE_TYPE (ref
))
314 if (CLASS_TYPE_P (TREE_TYPE (ref
))
315 || TREE_CODE (TREE_TYPE (ref
)) == ARRAY_TYPE
)
320 /* If one operand is not an lvalue at all, then this expression is
322 if (!op1_lvalue_kind
|| !op2_lvalue_kind
)
325 /* Otherwise, it's an lvalue, and it has all the odd properties
326 contributed by either operand. */
327 op1_lvalue_kind
= op1_lvalue_kind
| op2_lvalue_kind
;
328 /* It's not an ordinary lvalue if it involves any other kind. */
329 if ((op1_lvalue_kind
& ~clk_ordinary
) != clk_none
)
330 op1_lvalue_kind
&= ~clk_ordinary
;
331 /* It can't be both a pseudo-lvalue and a non-addressable lvalue.
332 A COND_EXPR of those should be wrapped in a TARGET_EXPR. */
333 if ((op1_lvalue_kind
& (clk_rvalueref
|clk_class
))
334 && (op1_lvalue_kind
& (clk_bitfield
|clk_packed
)))
335 op1_lvalue_kind
= clk_none
;
336 return op1_lvalue_kind
;
339 /* Returns the kind of lvalue that REF is, in the sense of [basic.lval]. */
342 real_lvalue_p (const_tree ref
)
344 cp_lvalue_kind kind
= lvalue_kind (ref
);
345 if (kind
& (clk_rvalueref
|clk_class
))
351 /* c-common wants us to return bool. */
354 lvalue_p (const_tree t
)
356 return real_lvalue_p (t
);
359 /* This differs from lvalue_p in that xvalues are included. */
362 glvalue_p (const_tree ref
)
364 cp_lvalue_kind kind
= lvalue_kind (ref
);
365 if (kind
& clk_class
)
368 return (kind
!= clk_none
);
371 /* This differs from glvalue_p in that class prvalues are included. */
374 obvalue_p (const_tree ref
)
376 return (lvalue_kind (ref
) != clk_none
);
379 /* Returns true if REF is an xvalue (the result of dereferencing an rvalue
380 reference), false otherwise. */
383 xvalue_p (const_tree ref
)
385 return (lvalue_kind (ref
) == clk_rvalueref
);
388 /* True if REF is a bit-field. */
391 bitfield_p (const_tree ref
)
393 return (lvalue_kind (ref
) & clk_bitfield
);
396 /* C++-specific version of stabilize_reference. */
399 cp_stabilize_reference (tree ref
)
401 STRIP_ANY_LOCATION_WRAPPER (ref
);
402 switch (TREE_CODE (ref
))
404 case NON_DEPENDENT_EXPR
:
405 /* We aren't actually evaluating this. */
408 /* We need to treat specially anything stabilize_reference doesn't
409 handle specifically. */
420 case ARRAY_RANGE_REF
:
424 cp_lvalue_kind kind
= lvalue_kind (ref
);
425 if ((kind
& ~clk_class
) != clk_none
)
427 tree type
= unlowered_expr_type (ref
);
428 bool rval
= !!(kind
& clk_rvalueref
);
429 type
= cp_build_reference_type (type
, rval
);
430 /* This inhibits warnings in, eg, cxx_mark_addressable
432 warning_sentinel
s (extra_warnings
);
433 ref
= build_static_cast (input_location
, type
, ref
,
438 return stabilize_reference (ref
);
441 /* Test whether DECL is a builtin that may appear in a
442 constant-expression. */
445 builtin_valid_in_constant_expr_p (const_tree decl
)
447 STRIP_ANY_LOCATION_WRAPPER (decl
);
448 if (TREE_CODE (decl
) != FUNCTION_DECL
)
449 /* Not a function. */
451 if (DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_NORMAL
)
453 if (fndecl_built_in_p (decl
, CP_BUILT_IN_IS_CONSTANT_EVALUATED
,
455 || fndecl_built_in_p (decl
, CP_BUILT_IN_SOURCE_LOCATION
,
458 /* Not a built-in. */
461 switch (DECL_FUNCTION_CODE (decl
))
463 /* These always have constant results like the corresponding
466 case BUILT_IN_FUNCTION
:
469 /* The following built-ins are valid in constant expressions
470 when their arguments are. */
471 case BUILT_IN_ADD_OVERFLOW_P
:
472 case BUILT_IN_SUB_OVERFLOW_P
:
473 case BUILT_IN_MUL_OVERFLOW_P
:
475 /* These have constant results even if their operands are
477 case BUILT_IN_CONSTANT_P
:
478 case BUILT_IN_ATOMIC_ALWAYS_LOCK_FREE
:
485 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
488 build_target_expr (tree decl
, tree value
, tsubst_flags_t complain
)
491 tree type
= TREE_TYPE (decl
);
493 value
= mark_rvalue_use (value
);
495 gcc_checking_assert (VOID_TYPE_P (TREE_TYPE (value
))
496 || TREE_TYPE (decl
) == TREE_TYPE (value
)
497 /* On ARM ctors return 'this'. */
498 || (TYPE_PTR_P (TREE_TYPE (value
))
499 && TREE_CODE (value
) == CALL_EXPR
)
500 || useless_type_conversion_p (TREE_TYPE (decl
),
503 /* Set TREE_READONLY for optimization, such as gimplify_init_constructor
504 moving a constant aggregate into .rodata. */
505 if (CP_TYPE_CONST_NON_VOLATILE_P (type
)
506 && !TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
507 && !VOID_TYPE_P (TREE_TYPE (value
))
508 && reduced_constant_expression_p (value
))
509 TREE_READONLY (decl
) = true;
511 if (complain
& tf_no_cleanup
)
512 /* The caller is building a new-expr and does not need a cleanup. */
516 t
= cxx_maybe_build_cleanup (decl
, complain
);
517 if (t
== error_mark_node
)
518 return error_mark_node
;
520 t
= build4 (TARGET_EXPR
, type
, decl
, value
, t
, NULL_TREE
);
521 if (location_t eloc
= cp_expr_location (value
))
522 SET_EXPR_LOCATION (t
, eloc
);
523 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
524 ignore the TARGET_EXPR. If there really turn out to be no
525 side-effects, then the optimizer should be able to get rid of
526 whatever code is generated anyhow. */
527 TREE_SIDE_EFFECTS (t
) = 1;
532 /* Return an undeclared local temporary of type TYPE for use in building a
536 build_local_temp (tree type
)
538 tree slot
= build_decl (input_location
,
539 VAR_DECL
, NULL_TREE
, type
);
540 DECL_ARTIFICIAL (slot
) = 1;
541 DECL_IGNORED_P (slot
) = 1;
542 DECL_CONTEXT (slot
) = current_function_decl
;
543 layout_decl (slot
, 0);
547 /* Return whether DECL is such a local temporary (or one from
548 create_tmp_var_raw). */
551 is_local_temp (tree decl
)
553 return (VAR_P (decl
) && DECL_ARTIFICIAL (decl
)
554 && !TREE_STATIC (decl
)
555 && DECL_FUNCTION_SCOPE_P (decl
));
558 /* Set various status flags when building an AGGR_INIT_EXPR object T. */
561 process_aggr_init_operands (tree t
)
565 side_effects
= TREE_SIDE_EFFECTS (t
);
569 n
= TREE_OPERAND_LENGTH (t
);
570 for (i
= 1; i
< n
; i
++)
572 tree op
= TREE_OPERAND (t
, i
);
573 if (op
&& TREE_SIDE_EFFECTS (op
))
580 TREE_SIDE_EFFECTS (t
) = side_effects
;
583 /* Build an AGGR_INIT_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE,
584 FN, and SLOT. NARGS is the number of call arguments which are specified
585 as a tree array ARGS. */
588 build_aggr_init_array (tree return_type
, tree fn
, tree slot
, int nargs
,
594 t
= build_vl_exp (AGGR_INIT_EXPR
, nargs
+ 3);
595 TREE_TYPE (t
) = return_type
;
596 AGGR_INIT_EXPR_FN (t
) = fn
;
597 AGGR_INIT_EXPR_SLOT (t
) = slot
;
598 for (i
= 0; i
< nargs
; i
++)
599 AGGR_INIT_EXPR_ARG (t
, i
) = args
[i
];
600 process_aggr_init_operands (t
);
604 /* INIT is a CALL_EXPR or AGGR_INIT_EXPR which needs info about its
605 target. TYPE is the type to be initialized.
607 Build an AGGR_INIT_EXPR to represent the initialization. This function
608 differs from build_cplus_new in that an AGGR_INIT_EXPR can only be used
609 to initialize another object, whereas a TARGET_EXPR can either
610 initialize another object or create its own temporary object, and as a
611 result building up a TARGET_EXPR requires that the type's destructor be
615 build_aggr_init_expr (tree type
, tree init
)
622 gcc_assert (!VOID_TYPE_P (type
));
624 /* Don't build AGGR_INIT_EXPR in a template. */
625 if (processing_template_decl
)
628 fn
= cp_get_callee (init
);
630 return convert (type
, init
);
632 is_ctor
= (TREE_CODE (fn
) == ADDR_EXPR
633 && TREE_CODE (TREE_OPERAND (fn
, 0)) == FUNCTION_DECL
634 && DECL_CONSTRUCTOR_P (TREE_OPERAND (fn
, 0)));
636 /* We split the CALL_EXPR into its function and its arguments here.
637 Then, in expand_expr, we put them back together. The reason for
638 this is that this expression might be a default argument
639 expression. In that case, we need a new temporary every time the
640 expression is used. That's what break_out_target_exprs does; it
641 replaces every AGGR_INIT_EXPR with a copy that uses a fresh
642 temporary slot. Then, expand_expr builds up a call-expression
643 using the new slot. */
645 /* If we don't need to use a constructor to create an object of this
646 type, don't mess with AGGR_INIT_EXPR. */
647 if (is_ctor
|| TREE_ADDRESSABLE (type
))
649 slot
= build_local_temp (type
);
651 if (TREE_CODE (init
) == CALL_EXPR
)
653 rval
= build_aggr_init_array (void_type_node
, fn
, slot
,
654 call_expr_nargs (init
),
655 CALL_EXPR_ARGP (init
));
656 AGGR_INIT_FROM_THUNK_P (rval
)
657 = CALL_FROM_THUNK_P (init
);
661 rval
= build_aggr_init_array (void_type_node
, fn
, slot
,
662 aggr_init_expr_nargs (init
),
663 AGGR_INIT_EXPR_ARGP (init
));
664 AGGR_INIT_FROM_THUNK_P (rval
)
665 = AGGR_INIT_FROM_THUNK_P (init
);
667 TREE_SIDE_EFFECTS (rval
) = 1;
668 AGGR_INIT_VIA_CTOR_P (rval
) = is_ctor
;
669 TREE_NOTHROW (rval
) = TREE_NOTHROW (init
);
670 CALL_EXPR_OPERATOR_SYNTAX (rval
) = CALL_EXPR_OPERATOR_SYNTAX (init
);
671 CALL_EXPR_ORDERED_ARGS (rval
) = CALL_EXPR_ORDERED_ARGS (init
);
672 CALL_EXPR_REVERSE_ARGS (rval
) = CALL_EXPR_REVERSE_ARGS (init
);
677 if (location_t loc
= EXPR_LOCATION (init
))
678 SET_EXPR_LOCATION (rval
, loc
);
683 /* INIT is a CALL_EXPR or AGGR_INIT_EXPR which needs info about its
684 target. TYPE is the type that this initialization should appear to
687 Build an encapsulation of the initialization to perform
688 and return it so that it can be processed by language-independent
689 and language-specific expression expanders. */
692 build_cplus_new (tree type
, tree init
, tsubst_flags_t complain
)
694 /* This function should cope with what build_special_member_call
695 can produce. When performing parenthesized aggregate initialization,
696 it can produce a { }. */
697 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
699 gcc_assert (cxx_dialect
>= cxx20
);
700 return finish_compound_literal (type
, init
, complain
);
703 tree rval
= build_aggr_init_expr (type
, init
);
706 if (init
== error_mark_node
)
707 return error_mark_node
;
709 if (!complete_type_or_maybe_complain (type
, init
, complain
))
710 return error_mark_node
;
712 /* Make sure that we're not trying to create an instance of an
714 if (abstract_virtuals_error_sfinae (NULL_TREE
, type
, complain
))
715 return error_mark_node
;
717 if (TREE_CODE (rval
) == AGGR_INIT_EXPR
)
718 slot
= AGGR_INIT_EXPR_SLOT (rval
);
719 else if (TREE_CODE (rval
) == CALL_EXPR
720 || TREE_CODE (rval
) == CONSTRUCTOR
)
721 slot
= build_local_temp (type
);
725 rval
= build_target_expr (slot
, rval
, complain
);
727 if (rval
!= error_mark_node
)
728 TARGET_EXPR_IMPLICIT_P (rval
) = 1;
733 /* Subroutine of build_vec_init_expr: Build up a single element
734 intialization as a proxy for the full array initialization to get things
735 marked as used and any appropriate diagnostics.
737 Since we're deferring building the actual constructor calls until
738 gimplification time, we need to build one now and throw it away so
739 that the relevant constructor gets mark_used before cgraph decides
740 what functions are needed. Here we assume that init is either
741 NULL_TREE, void_type_node (indicating value-initialization), or
742 another array to copy. */
745 build_vec_init_elt (tree type
, tree init
, tsubst_flags_t complain
)
747 tree inner_type
= strip_array_types (type
);
749 if (integer_zerop (array_type_nelts_total (type
))
750 || !CLASS_TYPE_P (inner_type
))
751 /* No interesting initialization to do. */
752 return integer_zero_node
;
753 else if (init
== void_type_node
)
754 return build_value_init (inner_type
, complain
);
756 gcc_assert (init
== NULL_TREE
757 || (same_type_ignoring_top_level_qualifiers_p
758 (type
, TREE_TYPE (init
))));
760 releasing_vec argvec
;
763 tree init_type
= strip_array_types (TREE_TYPE (init
));
764 tree dummy
= build_dummy_object (init_type
);
765 if (!lvalue_p (init
))
766 dummy
= move (dummy
);
767 argvec
->quick_push (dummy
);
769 init
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
770 &argvec
, inner_type
, LOOKUP_NORMAL
,
773 /* For a trivial constructor, build_over_call creates a TARGET_EXPR. But
774 we don't want one here because we aren't creating a temporary. */
775 if (TREE_CODE (init
) == TARGET_EXPR
)
776 init
= TARGET_EXPR_INITIAL (init
);
781 /* Return a TARGET_EXPR which expresses the initialization of an array to
782 be named later, either default-initialization or copy-initialization
783 from another array of the same type. */
786 build_vec_init_expr (tree type
, tree init
, tsubst_flags_t complain
)
789 bool value_init
= false;
790 tree elt_init
= build_vec_init_elt (type
, init
, complain
);
792 if (init
== void_type_node
)
798 slot
= build_local_temp (type
);
799 init
= build2 (VEC_INIT_EXPR
, type
, slot
, init
);
800 TREE_SIDE_EFFECTS (init
) = true;
801 SET_EXPR_LOCATION (init
, input_location
);
803 if (cxx_dialect
>= cxx11
804 && potential_constant_expression (elt_init
))
805 VEC_INIT_EXPR_IS_CONSTEXPR (init
) = true;
806 VEC_INIT_EXPR_VALUE_INIT (init
) = value_init
;
811 /* Give a helpful diagnostic for a non-constexpr VEC_INIT_EXPR in a context
812 that requires a constant expression. */
815 diagnose_non_constexpr_vec_init (tree expr
)
817 tree type
= TREE_TYPE (VEC_INIT_EXPR_SLOT (expr
));
819 if (VEC_INIT_EXPR_VALUE_INIT (expr
))
820 init
= void_type_node
;
822 init
= VEC_INIT_EXPR_INIT (expr
);
824 elt_init
= build_vec_init_elt (type
, init
, tf_warning_or_error
);
825 require_potential_constant_expression (elt_init
);
829 build_array_copy (tree init
)
831 return build_vec_init_expr (TREE_TYPE (init
), init
, tf_warning_or_error
);
834 /* Build a TARGET_EXPR using INIT to initialize a new temporary of the
838 build_target_expr_with_type (tree init
, tree type
, tsubst_flags_t complain
)
840 gcc_assert (!VOID_TYPE_P (type
));
842 if (TREE_CODE (init
) == TARGET_EXPR
843 || init
== error_mark_node
)
845 else if (CLASS_TYPE_P (type
) && type_has_nontrivial_copy_init (type
)
846 && !VOID_TYPE_P (TREE_TYPE (init
))
847 && TREE_CODE (init
) != COND_EXPR
848 && TREE_CODE (init
) != CONSTRUCTOR
849 && TREE_CODE (init
) != VA_ARG_EXPR
)
850 /* We need to build up a copy constructor call. A void initializer
851 means we're being called from bot_manip. COND_EXPR is a special
852 case because we already have copies on the arms and we don't want
853 another one here. A CONSTRUCTOR is aggregate initialization, which
854 is handled separately. A VA_ARG_EXPR is magic creation of an
855 aggregate; there's no additional work to be done. */
856 return force_rvalue (init
, complain
);
858 return force_target_expr (type
, init
, complain
);
861 /* Like the above function, but without the checking. This function should
862 only be used by code which is deliberately trying to subvert the type
863 system, such as call_builtin_trap. Or build_over_call, to avoid
864 infinite recursion. */
867 force_target_expr (tree type
, tree init
, tsubst_flags_t complain
)
871 gcc_assert (!VOID_TYPE_P (type
));
873 slot
= build_local_temp (type
);
874 return build_target_expr (slot
, init
, complain
);
877 /* Like build_target_expr_with_type, but use the type of INIT. */
880 get_target_expr_sfinae (tree init
, tsubst_flags_t complain
)
882 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
883 return build_target_expr (AGGR_INIT_EXPR_SLOT (init
), init
, complain
);
884 else if (TREE_CODE (init
) == VEC_INIT_EXPR
)
885 return build_target_expr (VEC_INIT_EXPR_SLOT (init
), init
, complain
);
888 init
= convert_bitfield_to_declared_type (init
);
889 return build_target_expr_with_type (init
, TREE_TYPE (init
), complain
);
894 get_target_expr (tree init
)
896 return get_target_expr_sfinae (init
, tf_warning_or_error
);
899 /* If EXPR is a bitfield reference, convert it to the declared type of
900 the bitfield, and return the resulting expression. Otherwise,
901 return EXPR itself. */
904 convert_bitfield_to_declared_type (tree expr
)
908 bitfield_type
= is_bitfield_expr_with_lowered_type (expr
);
910 expr
= convert_to_integer_nofold (TYPE_MAIN_VARIANT (bitfield_type
),
915 /* EXPR is being used in an rvalue context. Return a version of EXPR
916 that is marked as an rvalue. */
923 if (error_operand_p (expr
))
926 expr
= mark_rvalue_use (expr
);
930 Non-class rvalues always have cv-unqualified types. */
931 type
= TREE_TYPE (expr
);
932 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
933 type
= cv_unqualified (type
);
935 /* We need to do this for rvalue refs as well to get the right answer
936 from decltype; see c++/36628. */
937 if (!processing_template_decl
&& glvalue_p (expr
))
938 expr
= build1 (NON_LVALUE_EXPR
, type
, expr
);
939 else if (type
!= TREE_TYPE (expr
))
940 expr
= build_nop (type
, expr
);
946 struct cplus_array_info
952 struct cplus_array_hasher
: ggc_ptr_hash
<tree_node
>
954 typedef cplus_array_info
*compare_type
;
956 static hashval_t
hash (tree t
);
957 static bool equal (tree
, cplus_array_info
*);
960 /* Hash an ARRAY_TYPE. K is really of type `tree'. */
963 cplus_array_hasher::hash (tree t
)
967 hash
= TYPE_UID (TREE_TYPE (t
));
969 hash
^= TYPE_UID (TYPE_DOMAIN (t
));
973 /* Compare two ARRAY_TYPEs. K1 is really of type `tree', K2 is really
974 of type `cplus_array_info*'. */
977 cplus_array_hasher::equal (tree t1
, cplus_array_info
*t2
)
979 return (TREE_TYPE (t1
) == t2
->type
&& TYPE_DOMAIN (t1
) == t2
->domain
);
982 /* Hash table containing dependent array types, which are unsuitable for
983 the language-independent type hash table. */
984 static GTY (()) hash_table
<cplus_array_hasher
> *cplus_array_htab
;
986 /* Build an ARRAY_TYPE without laying it out. */
989 build_min_array_type (tree elt_type
, tree index_type
)
991 tree t
= cxx_make_type (ARRAY_TYPE
);
992 TREE_TYPE (t
) = elt_type
;
993 TYPE_DOMAIN (t
) = index_type
;
997 /* Set TYPE_CANONICAL like build_array_type_1, but using
998 build_cplus_array_type. */
1001 set_array_type_canon (tree t
, tree elt_type
, tree index_type
)
1003 /* Set the canonical type for this new node. */
1004 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
1005 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
1006 SET_TYPE_STRUCTURAL_EQUALITY (t
);
1007 else if (TYPE_CANONICAL (elt_type
) != elt_type
1008 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
1010 = build_cplus_array_type (TYPE_CANONICAL (elt_type
),
1012 ? TYPE_CANONICAL (index_type
) : index_type
);
1014 TYPE_CANONICAL (t
) = t
;
1017 /* Like build_array_type, but handle special C++ semantics: an array of a
1018 variant element type is a variant of the array of the main variant of
1019 the element type. */
1022 build_cplus_array_type (tree elt_type
, tree index_type
)
1026 if (elt_type
== error_mark_node
|| index_type
== error_mark_node
)
1027 return error_mark_node
;
1029 bool dependent
= (uses_template_parms (elt_type
)
1030 || (index_type
&& uses_template_parms (index_type
)));
1032 if (elt_type
!= TYPE_MAIN_VARIANT (elt_type
))
1033 /* Start with an array of the TYPE_MAIN_VARIANT. */
1034 t
= build_cplus_array_type (TYPE_MAIN_VARIANT (elt_type
),
1038 /* Since type_hash_canon calls layout_type, we need to use our own
1040 cplus_array_info cai
;
1043 if (cplus_array_htab
== NULL
)
1044 cplus_array_htab
= hash_table
<cplus_array_hasher
>::create_ggc (61);
1046 hash
= TYPE_UID (elt_type
);
1048 hash
^= TYPE_UID (index_type
);
1049 cai
.type
= elt_type
;
1050 cai
.domain
= index_type
;
1052 tree
*e
= cplus_array_htab
->find_slot_with_hash (&cai
, hash
, INSERT
);
1054 /* We have found the type: we're done. */
1058 /* Build a new array type. */
1059 t
= build_min_array_type (elt_type
, index_type
);
1061 /* Store it in the hash table. */
1064 /* Set the canonical type for this new node. */
1065 set_array_type_canon (t
, elt_type
, index_type
);
1070 bool typeless_storage
= is_byte_access_type (elt_type
);
1071 t
= build_array_type (elt_type
, index_type
, typeless_storage
);
1074 /* Now check whether we already have this array variant. */
1075 if (elt_type
!= TYPE_MAIN_VARIANT (elt_type
))
1078 for (t
= m
; t
; t
= TYPE_NEXT_VARIANT (t
))
1079 if (TREE_TYPE (t
) == elt_type
1080 && TYPE_NAME (t
) == NULL_TREE
1081 && TYPE_ATTRIBUTES (t
) == NULL_TREE
)
1085 t
= build_min_array_type (elt_type
, index_type
);
1086 set_array_type_canon (t
, elt_type
, index_type
);
1090 /* Make sure sizes are shared with the main variant.
1091 layout_type can't be called after setting TYPE_NEXT_VARIANT,
1092 as it will overwrite alignment etc. of all variants. */
1093 TYPE_SIZE (t
) = TYPE_SIZE (m
);
1094 TYPE_SIZE_UNIT (t
) = TYPE_SIZE_UNIT (m
);
1095 TYPE_TYPELESS_STORAGE (t
) = TYPE_TYPELESS_STORAGE (m
);
1098 TYPE_MAIN_VARIANT (t
) = m
;
1099 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
1100 TYPE_NEXT_VARIANT (m
) = t
;
1104 /* Avoid spurious warnings with VLAs (c++/54583). */
1105 if (TYPE_SIZE (t
) && EXPR_P (TYPE_SIZE (t
)))
1106 TREE_NO_WARNING (TYPE_SIZE (t
)) = 1;
1108 /* Push these needs up to the ARRAY_TYPE so that initialization takes
1109 place more easily. */
1110 bool needs_ctor
= (TYPE_NEEDS_CONSTRUCTING (t
)
1111 = TYPE_NEEDS_CONSTRUCTING (elt_type
));
1112 bool needs_dtor
= (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
1113 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (elt_type
));
1115 if (!dependent
&& t
== TYPE_MAIN_VARIANT (t
)
1116 && !COMPLETE_TYPE_P (t
) && COMPLETE_TYPE_P (elt_type
))
1118 /* The element type has been completed since the last time we saw
1119 this array type; update the layout and 'tor flags for any variants
1122 for (tree v
= TYPE_NEXT_VARIANT (t
); v
; v
= TYPE_NEXT_VARIANT (v
))
1124 TYPE_NEEDS_CONSTRUCTING (v
) = needs_ctor
;
1125 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (v
) = needs_dtor
;
1132 /* Return an ARRAY_TYPE with element type ELT and length N. */
1135 build_array_of_n_type (tree elt
, int n
)
1137 return build_cplus_array_type (elt
, build_index_type (size_int (n
- 1)));
1140 /* True iff T is an array of unknown bound. */
1143 array_of_unknown_bound_p (const_tree t
)
1145 return (TREE_CODE (t
) == ARRAY_TYPE
1146 && !TYPE_DOMAIN (t
));
1149 /* True iff T is an N3639 array of runtime bound (VLA). These were approved
1150 for C++14 but then removed. This should only be used for N3639
1151 specifically; code wondering more generally if something is a VLA should use
1155 array_of_runtime_bound_p (tree t
)
1157 if (!t
|| TREE_CODE (t
) != ARRAY_TYPE
)
1159 if (variably_modified_type_p (TREE_TYPE (t
), NULL_TREE
))
1161 tree dom
= TYPE_DOMAIN (t
);
1164 tree max
= TYPE_MAX_VALUE (dom
);
1165 return (!potential_rvalue_constant_expression (max
)
1166 || (!value_dependent_expression_p (max
) && !TREE_CONSTANT (max
)));
1169 /* True iff T is a variable length array. */
1174 for (; t
&& TREE_CODE (t
) == ARRAY_TYPE
;
1176 if (tree dom
= TYPE_DOMAIN (t
))
1178 tree max
= TYPE_MAX_VALUE (dom
);
1179 if (!potential_rvalue_constant_expression (max
)
1180 || (!value_dependent_expression_p (max
) && !TREE_CONSTANT (max
)))
1186 /* Return a reference type node referring to TO_TYPE. If RVAL is
1187 true, return an rvalue reference type, otherwise return an lvalue
1188 reference type. If a type node exists, reuse it, otherwise create
1191 cp_build_reference_type (tree to_type
, bool rval
)
1195 if (to_type
== error_mark_node
)
1196 return error_mark_node
;
1198 if (TYPE_REF_P (to_type
))
1200 rval
= rval
&& TYPE_REF_IS_RVALUE (to_type
);
1201 to_type
= TREE_TYPE (to_type
);
1204 lvalue_ref
= build_reference_type (to_type
);
1208 /* This code to create rvalue reference types is based on and tied
1209 to the code creating lvalue reference types in the middle-end
1210 functions build_reference_type_for_mode and build_reference_type.
1212 It works by putting the rvalue reference type nodes after the
1213 lvalue reference nodes in the TYPE_NEXT_REF_TO linked list, so
1214 they will effectively be ignored by the middle end. */
1216 for (t
= lvalue_ref
; (t
= TYPE_NEXT_REF_TO (t
)); )
1217 if (TYPE_REF_IS_RVALUE (t
))
1220 t
= build_distinct_type_copy (lvalue_ref
);
1222 TYPE_REF_IS_RVALUE (t
) = true;
1223 TYPE_NEXT_REF_TO (t
) = TYPE_NEXT_REF_TO (lvalue_ref
);
1224 TYPE_NEXT_REF_TO (lvalue_ref
) = t
;
1226 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
1227 SET_TYPE_STRUCTURAL_EQUALITY (t
);
1228 else if (TYPE_CANONICAL (to_type
) != to_type
)
1230 = cp_build_reference_type (TYPE_CANONICAL (to_type
), rval
);
1232 TYPE_CANONICAL (t
) = t
;
1240 /* Returns EXPR cast to rvalue reference type, like std::move. */
1245 tree type
= TREE_TYPE (expr
);
1246 gcc_assert (!TYPE_REF_P (type
));
1247 type
= cp_build_reference_type (type
, /*rval*/true);
1248 return build_static_cast (input_location
, type
, expr
,
1249 tf_warning_or_error
);
1252 /* Used by the C++ front end to build qualified array types. However,
1253 the C version of this function does not properly maintain canonical
1254 types (which are not used in C). */
1256 c_build_qualified_type (tree type
, int type_quals
, tree
/* orig_qual_type */,
1257 size_t /* orig_qual_indirect */)
1259 return cp_build_qualified_type (type
, type_quals
);
1263 /* Make a variant of TYPE, qualified with the TYPE_QUALS. Handles
1264 arrays correctly. In particular, if TYPE is an array of T's, and
1265 TYPE_QUALS is non-empty, returns an array of qualified T's.
1267 FLAGS determines how to deal with ill-formed qualifications. If
1268 tf_ignore_bad_quals is set, then bad qualifications are dropped
1269 (this is permitted if TYPE was introduced via a typedef or template
1270 type parameter). If bad qualifications are dropped and tf_warning
1271 is set, then a warning is issued for non-const qualifications. If
1272 tf_ignore_bad_quals is not set and tf_error is not set, we
1273 return error_mark_node. Otherwise, we issue an error, and ignore
1276 Qualification of a reference type is valid when the reference came
1277 via a typedef or template type argument. [dcl.ref] No such
1278 dispensation is provided for qualifying a function type. [dcl.fct]
1279 DR 295 queries this and the proposed resolution brings it into line
1280 with qualifying a reference. We implement the DR. We also behave
1281 in a similar manner for restricting non-pointer types. */
1284 cp_build_qualified_type_real (tree type
,
1286 tsubst_flags_t complain
)
1289 int bad_quals
= TYPE_UNQUALIFIED
;
1291 if (type
== error_mark_node
)
1294 if (type_quals
== cp_type_quals (type
))
1297 if (TREE_CODE (type
) == ARRAY_TYPE
)
1299 /* In C++, the qualification really applies to the array element
1300 type. Obtain the appropriately qualified element type. */
1303 = cp_build_qualified_type_real (TREE_TYPE (type
),
1307 if (element_type
== error_mark_node
)
1308 return error_mark_node
;
1310 /* See if we already have an identically qualified type. Tests
1311 should be equivalent to those in check_qualified_type. */
1312 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
1313 if (TREE_TYPE (t
) == element_type
1314 && TYPE_NAME (t
) == TYPE_NAME (type
)
1315 && TYPE_CONTEXT (t
) == TYPE_CONTEXT (type
)
1316 && attribute_list_equal (TYPE_ATTRIBUTES (t
),
1317 TYPE_ATTRIBUTES (type
)))
1322 t
= build_cplus_array_type (element_type
, TYPE_DOMAIN (type
));
1324 /* Keep the typedef name. */
1325 if (TYPE_NAME (t
) != TYPE_NAME (type
))
1327 t
= build_variant_type_copy (t
);
1328 TYPE_NAME (t
) = TYPE_NAME (type
);
1329 SET_TYPE_ALIGN (t
, TYPE_ALIGN (type
));
1330 TYPE_USER_ALIGN (t
) = TYPE_USER_ALIGN (type
);
1334 /* Even if we already had this variant, we update
1335 TYPE_NEEDS_CONSTRUCTING and TYPE_HAS_NONTRIVIAL_DESTRUCTOR in case
1336 they changed since the variant was originally created.
1338 This seems hokey; if there is some way to use a previous
1339 variant *without* coming through here,
1340 TYPE_NEEDS_CONSTRUCTING will never be updated. */
1341 TYPE_NEEDS_CONSTRUCTING (t
)
1342 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (element_type
));
1343 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
1344 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (element_type
));
1347 else if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
1349 tree t
= PACK_EXPANSION_PATTERN (type
);
1351 t
= cp_build_qualified_type_real (t
, type_quals
, complain
);
1352 return make_pack_expansion (t
, complain
);
1355 /* A reference or method type shall not be cv-qualified.
1356 [dcl.ref], [dcl.fct]. This used to be an error, but as of DR 295
1357 (in CD1) we always ignore extra cv-quals on functions. */
1358 if (type_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)
1359 && (TYPE_REF_P (type
)
1360 || FUNC_OR_METHOD_TYPE_P (type
)))
1362 if (TYPE_REF_P (type
))
1363 bad_quals
|= type_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
1364 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
1367 /* But preserve any function-cv-quals on a FUNCTION_TYPE. */
1368 if (TREE_CODE (type
) == FUNCTION_TYPE
)
1369 type_quals
|= type_memfn_quals (type
);
1371 /* A restrict-qualified type must be a pointer (or reference)
1372 to object or incomplete type. */
1373 if ((type_quals
& TYPE_QUAL_RESTRICT
)
1374 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
1375 && TREE_CODE (type
) != TYPENAME_TYPE
1376 && !INDIRECT_TYPE_P (type
))
1378 bad_quals
|= TYPE_QUAL_RESTRICT
;
1379 type_quals
&= ~TYPE_QUAL_RESTRICT
;
1382 if (bad_quals
== TYPE_UNQUALIFIED
1383 || (complain
& tf_ignore_bad_quals
))
1385 else if (!(complain
& tf_error
))
1386 return error_mark_node
;
1389 tree bad_type
= build_qualified_type (ptr_type_node
, bad_quals
);
1390 error ("%qV qualifiers cannot be applied to %qT",
1394 /* Retrieve (or create) the appropriately qualified variant. */
1395 result
= build_qualified_type (type
, type_quals
);
1400 /* Return TYPE with const and volatile removed. */
1403 cv_unqualified (tree type
)
1407 if (type
== error_mark_node
)
1410 quals
= cp_type_quals (type
);
1411 quals
&= ~(TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
);
1412 return cp_build_qualified_type (type
, quals
);
1415 /* Subroutine of strip_typedefs. We want to apply to RESULT the attributes
1416 from ATTRIBS that affect type identity, and no others. If any are not
1417 applied, set *remove_attributes to true. */
1420 apply_identity_attributes (tree result
, tree attribs
, bool *remove_attributes
)
1422 tree first_ident
= NULL_TREE
;
1423 tree new_attribs
= NULL_TREE
;
1424 tree
*p
= &new_attribs
;
1426 if (OVERLOAD_TYPE_P (result
))
1428 /* On classes and enums all attributes are ingrained. */
1429 gcc_assert (attribs
== TYPE_ATTRIBUTES (result
));
1433 for (tree a
= attribs
; a
; a
= TREE_CHAIN (a
))
1435 const attribute_spec
*as
1436 = lookup_attribute_spec (get_attribute_name (a
));
1437 if (as
&& as
->affects_type_identity
)
1441 else if (first_ident
== error_mark_node
)
1443 *p
= tree_cons (TREE_PURPOSE (a
), TREE_VALUE (a
), NULL_TREE
);
1444 p
= &TREE_CHAIN (*p
);
1447 else if (first_ident
)
1449 for (tree a2
= first_ident
; a2
; a2
= TREE_CHAIN (a2
))
1451 *p
= tree_cons (TREE_PURPOSE (a2
), TREE_VALUE (a2
), NULL_TREE
);
1452 p
= &TREE_CHAIN (*p
);
1454 first_ident
= error_mark_node
;
1457 if (first_ident
!= error_mark_node
)
1458 new_attribs
= first_ident
;
1460 if (first_ident
== attribs
)
1461 /* All attributes affected type identity. */;
1463 *remove_attributes
= true;
1465 return cp_build_type_attribute_variant (result
, new_attribs
);
1468 /* Builds a qualified variant of T that is either not a typedef variant
1469 (the default behavior) or not a typedef variant of a user-facing type
1470 (if FLAGS contains STF_USER_FACING).
1472 E.g. consider the following declarations:
1473 typedef const int ConstInt;
1474 typedef ConstInt* PtrConstInt;
1475 If T is PtrConstInt, this function returns a type representing
1477 In other words, if T is a typedef, the function returns the underlying type.
1478 The cv-qualification and attributes of the type returned match the
1480 They will always be compatible types.
1481 The returned type is built so that all of its subtypes
1482 recursively have their typedefs stripped as well.
1484 This is different from just returning TYPE_CANONICAL (T)
1485 Because of several reasons:
1486 * If T is a type that needs structural equality
1487 its TYPE_CANONICAL (T) will be NULL.
1488 * TYPE_CANONICAL (T) desn't carry type attributes
1489 and loses template parameter names.
1491 If REMOVE_ATTRIBUTES is non-null, also strip attributes that don't
1492 affect type identity, and set the referent to true if any were
1496 strip_typedefs (tree t
, bool *remove_attributes
, unsigned int flags
)
1498 tree result
= NULL
, type
= NULL
, t0
= NULL
;
1500 if (!t
|| t
== error_mark_node
)
1503 if (TREE_CODE (t
) == TREE_LIST
)
1505 bool changed
= false;
1508 for (; t
; t
= TREE_CHAIN (t
))
1510 gcc_assert (!TREE_PURPOSE (t
));
1511 tree elt
= strip_typedefs (TREE_VALUE (t
), remove_attributes
, flags
);
1512 if (elt
!= TREE_VALUE (t
))
1514 vec_safe_push (vec
, elt
);
1517 r
= build_tree_list_vec (vec
);
1521 gcc_assert (TYPE_P (t
));
1523 if (t
== TYPE_CANONICAL (t
))
1526 if (!(flags
& STF_STRIP_DEPENDENT
)
1527 && dependent_alias_template_spec_p (t
, nt_opaque
))
1528 /* DR 1558: However, if the template-id is dependent, subsequent
1529 template argument substitution still applies to the template-id. */
1532 switch (TREE_CODE (t
))
1535 type
= strip_typedefs (TREE_TYPE (t
), remove_attributes
, flags
);
1536 result
= build_pointer_type (type
);
1538 case REFERENCE_TYPE
:
1539 type
= strip_typedefs (TREE_TYPE (t
), remove_attributes
, flags
);
1540 result
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
1543 t0
= strip_typedefs (TYPE_OFFSET_BASETYPE (t
), remove_attributes
, flags
);
1544 type
= strip_typedefs (TREE_TYPE (t
), remove_attributes
, flags
);
1545 result
= build_offset_type (t0
, type
);
1548 if (TYPE_PTRMEMFUNC_P (t
))
1550 t0
= strip_typedefs (TYPE_PTRMEMFUNC_FN_TYPE (t
),
1551 remove_attributes
, flags
);
1552 result
= build_ptrmemfunc_type (t0
);
1556 type
= strip_typedefs (TREE_TYPE (t
), remove_attributes
, flags
);
1557 t0
= strip_typedefs (TYPE_DOMAIN (t
), remove_attributes
, flags
);
1558 result
= build_cplus_array_type (type
, t0
);
1563 tree arg_types
= NULL
, arg_node
, arg_node2
, arg_type
;
1566 /* Because we stomp on TREE_PURPOSE of TYPE_ARG_TYPES in many places
1567 around the compiler (e.g. cp_parser_late_parsing_default_args), we
1568 can't expect that re-hashing a function type will find a previous
1569 equivalent type, so try to reuse the input type if nothing has
1570 changed. If the type is itself a variant, that will change. */
1571 bool is_variant
= typedef_variant_p (t
);
1572 if (remove_attributes
1573 && (TYPE_ATTRIBUTES (t
) || TYPE_USER_ALIGN (t
)))
1576 type
= strip_typedefs (TREE_TYPE (t
), remove_attributes
, flags
);
1577 tree canon_spec
= (flag_noexcept_type
1578 ? canonical_eh_spec (TYPE_RAISES_EXCEPTIONS (t
))
1580 changed
= (type
!= TREE_TYPE (t
) || is_variant
1581 || TYPE_RAISES_EXCEPTIONS (t
) != canon_spec
);
1583 for (arg_node
= TYPE_ARG_TYPES (t
);
1585 arg_node
= TREE_CHAIN (arg_node
))
1587 if (arg_node
== void_list_node
)
1589 arg_type
= strip_typedefs (TREE_VALUE (arg_node
),
1590 remove_attributes
, flags
);
1591 gcc_assert (arg_type
);
1592 if (arg_type
== TREE_VALUE (arg_node
) && !changed
)
1598 for (arg_node2
= TYPE_ARG_TYPES (t
);
1599 arg_node2
!= arg_node
;
1600 arg_node2
= TREE_CHAIN (arg_node2
))
1602 = tree_cons (TREE_PURPOSE (arg_node2
),
1603 TREE_VALUE (arg_node2
), arg_types
);
1607 = tree_cons (TREE_PURPOSE (arg_node
), arg_type
, arg_types
);
1614 arg_types
= nreverse (arg_types
);
1616 /* A list of parameters not ending with an ellipsis
1617 must end with void_list_node. */
1619 arg_types
= chainon (arg_types
, void_list_node
);
1621 if (TREE_CODE (t
) == METHOD_TYPE
)
1623 tree class_type
= TREE_TYPE (TREE_VALUE (arg_types
));
1624 gcc_assert (class_type
);
1626 build_method_type_directly (class_type
, type
,
1627 TREE_CHAIN (arg_types
));
1631 result
= build_function_type (type
, arg_types
);
1632 result
= apply_memfn_quals (result
, type_memfn_quals (t
));
1635 result
= build_cp_fntype_variant (result
,
1636 type_memfn_rqual (t
), canon_spec
,
1637 TYPE_HAS_LATE_RETURN_TYPE (t
));
1642 bool changed
= false;
1643 tree fullname
= TYPENAME_TYPE_FULLNAME (t
);
1644 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
1645 && TREE_OPERAND (fullname
, 1))
1647 tree args
= TREE_OPERAND (fullname
, 1);
1648 tree new_args
= copy_node (args
);
1649 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
1651 tree arg
= TREE_VEC_ELT (args
, i
);
1654 strip_arg
= strip_typedefs (arg
, remove_attributes
, flags
);
1656 strip_arg
= strip_typedefs_expr (arg
, remove_attributes
,
1658 TREE_VEC_ELT (new_args
, i
) = strip_arg
;
1659 if (strip_arg
!= arg
)
1664 NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_args
)
1665 = NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
1667 = lookup_template_function (TREE_OPERAND (fullname
, 0),
1671 ggc_free (new_args
);
1673 tree ctx
= strip_typedefs (TYPE_CONTEXT (t
), remove_attributes
, flags
);
1674 if (!changed
&& ctx
== TYPE_CONTEXT (t
) && !typedef_variant_p (t
))
1676 tree name
= fullname
;
1677 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
1678 name
= TREE_OPERAND (fullname
, 0);
1679 /* Use build_typename_type rather than make_typename_type because we
1680 don't want to resolve it here, just strip typedefs. */
1681 result
= build_typename_type (ctx
, name
, fullname
, typename_type
);
1685 result
= strip_typedefs_expr (DECLTYPE_TYPE_EXPR (t
),
1686 remove_attributes
, flags
);
1687 if (result
== DECLTYPE_TYPE_EXPR (t
))
1690 result
= (finish_decltype_type
1692 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
),
1695 case UNDERLYING_TYPE
:
1696 type
= strip_typedefs (UNDERLYING_TYPE_TYPE (t
),
1697 remove_attributes
, flags
);
1698 result
= finish_underlying_type (type
);
1706 if (typedef_variant_p (t
))
1708 if ((flags
& STF_USER_VISIBLE
)
1709 && !user_facing_original_type_p (t
))
1711 /* If T is a non-template alias or typedef, we can assume that
1712 instantiating its definition will hit any substitution failure,
1713 so we don't need to retain it here as well. */
1714 if (!alias_template_specialization_p (t
, nt_opaque
))
1715 flags
|= STF_STRIP_DEPENDENT
;
1716 result
= strip_typedefs (DECL_ORIGINAL_TYPE (TYPE_NAME (t
)),
1717 remove_attributes
, flags
);
1720 result
= TYPE_MAIN_VARIANT (t
);
1722 /*gcc_assert (!typedef_variant_p (result)
1723 || dependent_alias_template_spec_p (result, nt_opaque)
1724 || ((flags & STF_USER_VISIBLE)
1725 && !user_facing_original_type_p (result)));*/
1727 if (COMPLETE_TYPE_P (result
) && !COMPLETE_TYPE_P (t
))
1728 /* If RESULT is complete and T isn't, it's likely the case that T
1729 is a variant of RESULT which hasn't been updated yet. Skip the
1730 attribute handling. */;
1733 if (TYPE_USER_ALIGN (t
) != TYPE_USER_ALIGN (result
)
1734 || TYPE_ALIGN (t
) != TYPE_ALIGN (result
))
1736 gcc_assert (TYPE_USER_ALIGN (t
));
1737 if (remove_attributes
)
1738 *remove_attributes
= true;
1741 if (TYPE_ALIGN (t
) == TYPE_ALIGN (result
))
1742 result
= build_variant_type_copy (result
);
1744 result
= build_aligned_type (result
, TYPE_ALIGN (t
));
1745 TYPE_USER_ALIGN (result
) = true;
1749 if (TYPE_ATTRIBUTES (t
))
1751 if (remove_attributes
)
1752 result
= apply_identity_attributes (result
, TYPE_ATTRIBUTES (t
),
1755 result
= cp_build_type_attribute_variant (result
,
1756 TYPE_ATTRIBUTES (t
));
1760 return cp_build_qualified_type (result
, cp_type_quals (t
));
1763 /* Like strip_typedefs above, but works on expressions, so that in
1765 template<class T> struct A
1771 sizeof(TT) is replaced by sizeof(T). */
1774 strip_typedefs_expr (tree t
, bool *remove_attributes
, unsigned int flags
)
1778 enum tree_code code
;
1780 if (t
== NULL_TREE
|| t
== error_mark_node
)
1783 STRIP_ANY_LOCATION_WRAPPER (t
);
1785 if (DECL_P (t
) || CONSTANT_CLASS_P (t
))
1788 /* Some expressions have type operands, so let's handle types here rather
1789 than check TYPE_P in multiple places below. */
1791 return strip_typedefs (t
, remove_attributes
, flags
);
1793 code
= TREE_CODE (t
);
1796 case IDENTIFIER_NODE
:
1797 case TEMPLATE_PARM_INDEX
:
1800 case ARGUMENT_PACK_SELECT
:
1805 tree type1
= strip_typedefs (TRAIT_EXPR_TYPE1 (t
),
1806 remove_attributes
, flags
);
1807 tree type2
= strip_typedefs (TRAIT_EXPR_TYPE2 (t
),
1808 remove_attributes
, flags
);
1809 if (type1
== TRAIT_EXPR_TYPE1 (t
)
1810 && type2
== TRAIT_EXPR_TYPE2 (t
))
1813 TRAIT_EXPR_TYPE1 (r
) = type1
;
1814 TRAIT_EXPR_TYPE2 (r
) = type2
;
1821 bool changed
= false;
1823 for (it
= t
; it
; it
= TREE_CHAIN (it
))
1825 tree val
= strip_typedefs_expr (TREE_VALUE (it
),
1826 remove_attributes
, flags
);
1827 vec_safe_push (vec
, val
);
1828 if (val
!= TREE_VALUE (it
))
1830 gcc_assert (TREE_PURPOSE (it
) == NULL_TREE
);
1835 FOR_EACH_VEC_ELT_REVERSE (*vec
, i
, it
)
1836 r
= tree_cons (NULL_TREE
, it
, r
);
1845 bool changed
= false;
1847 n
= TREE_VEC_LENGTH (t
);
1848 vec_safe_reserve (vec
, n
);
1849 for (i
= 0; i
< n
; ++i
)
1851 tree op
= strip_typedefs_expr (TREE_VEC_ELT (t
, i
),
1852 remove_attributes
, flags
);
1853 vec
->quick_push (op
);
1854 if (op
!= TREE_VEC_ELT (t
, i
))
1860 for (i
= 0; i
< n
; ++i
)
1861 TREE_VEC_ELT (r
, i
) = (*vec
)[i
];
1862 NON_DEFAULT_TEMPLATE_ARGS_COUNT (r
)
1863 = NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
);
1872 bool changed
= false;
1873 vec
<constructor_elt
, va_gc
> *vec
1874 = vec_safe_copy (CONSTRUCTOR_ELTS (t
));
1875 n
= CONSTRUCTOR_NELTS (t
);
1876 type
= strip_typedefs (TREE_TYPE (t
), remove_attributes
, flags
);
1877 for (i
= 0; i
< n
; ++i
)
1879 constructor_elt
*e
= &(*vec
)[i
];
1880 tree op
= strip_typedefs_expr (e
->value
, remove_attributes
, flags
);
1887 (e
->index
== strip_typedefs_expr (e
->index
, remove_attributes
,
1891 if (!changed
&& type
== TREE_TYPE (t
))
1899 TREE_TYPE (r
) = type
;
1900 CONSTRUCTOR_ELTS (r
) = vec
;
1908 case STATEMENT_LIST
:
1909 error ("statement-expression in a constant expression");
1910 return error_mark_node
;
1916 gcc_assert (EXPR_P (t
));
1918 n
= cp_tree_operand_length (t
);
1919 ops
= XALLOCAVEC (tree
, n
);
1920 type
= TREE_TYPE (t
);
1925 case IMPLICIT_CONV_EXPR
:
1926 case DYNAMIC_CAST_EXPR
:
1927 case STATIC_CAST_EXPR
:
1928 case CONST_CAST_EXPR
:
1929 case REINTERPRET_CAST_EXPR
:
1932 type
= strip_typedefs (type
, remove_attributes
, flags
);
1936 for (i
= 0; i
< n
; ++i
)
1937 ops
[i
] = strip_typedefs_expr (TREE_OPERAND (t
, i
),
1938 remove_attributes
, flags
);
1942 /* If nothing changed, return t. */
1943 for (i
= 0; i
< n
; ++i
)
1944 if (ops
[i
] != TREE_OPERAND (t
, i
))
1946 if (i
== n
&& type
== TREE_TYPE (t
))
1950 TREE_TYPE (r
) = type
;
1951 for (i
= 0; i
< n
; ++i
)
1952 TREE_OPERAND (r
, i
) = ops
[i
];
1956 /* Makes a copy of BINFO and TYPE, which is to be inherited into a
1957 graph dominated by T. If BINFO is NULL, TYPE is a dependent base,
1958 and we do a shallow copy. If BINFO is non-NULL, we do a deep copy.
1959 VIRT indicates whether TYPE is inherited virtually or not.
1960 IGO_PREV points at the previous binfo of the inheritance graph
1961 order chain. The newly copied binfo's TREE_CHAIN forms this
1964 The CLASSTYPE_VBASECLASSES vector of T is constructed in the
1965 correct order. That is in the order the bases themselves should be
1968 The BINFO_INHERITANCE of a virtual base class points to the binfo
1969 of the most derived type. ??? We could probably change this so that
1970 BINFO_INHERITANCE becomes synonymous with BINFO_PRIMARY, and hence
1971 remove a field. They currently can only differ for primary virtual
1975 copy_binfo (tree binfo
, tree type
, tree t
, tree
*igo_prev
, int virt
)
1981 /* See if we've already made this virtual base. */
1982 new_binfo
= binfo_for_vbase (type
, t
);
1987 new_binfo
= make_tree_binfo (binfo
? BINFO_N_BASE_BINFOS (binfo
) : 0);
1988 BINFO_TYPE (new_binfo
) = type
;
1990 /* Chain it into the inheritance graph. */
1991 TREE_CHAIN (*igo_prev
) = new_binfo
;
1992 *igo_prev
= new_binfo
;
1994 if (binfo
&& !BINFO_DEPENDENT_BASE_P (binfo
))
1999 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), type
));
2001 BINFO_OFFSET (new_binfo
) = BINFO_OFFSET (binfo
);
2002 BINFO_VIRTUALS (new_binfo
) = BINFO_VIRTUALS (binfo
);
2004 /* We do not need to copy the accesses, as they are read only. */
2005 BINFO_BASE_ACCESSES (new_binfo
) = BINFO_BASE_ACCESSES (binfo
);
2007 /* Recursively copy base binfos of BINFO. */
2008 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ix
++)
2010 tree new_base_binfo
;
2011 new_base_binfo
= copy_binfo (base_binfo
, BINFO_TYPE (base_binfo
),
2013 BINFO_VIRTUAL_P (base_binfo
));
2015 if (!BINFO_INHERITANCE_CHAIN (new_base_binfo
))
2016 BINFO_INHERITANCE_CHAIN (new_base_binfo
) = new_binfo
;
2017 BINFO_BASE_APPEND (new_binfo
, new_base_binfo
);
2021 BINFO_DEPENDENT_BASE_P (new_binfo
) = 1;
2025 /* Push it onto the list after any virtual bases it contains
2026 will have been pushed. */
2027 CLASSTYPE_VBASECLASSES (t
)->quick_push (new_binfo
);
2028 BINFO_VIRTUAL_P (new_binfo
) = 1;
2029 BINFO_INHERITANCE_CHAIN (new_binfo
) = TYPE_BINFO (t
);
2035 /* Hashing of lists so that we don't make duplicates.
2036 The entry point is `list_hash_canon'. */
2045 struct list_hasher
: ggc_ptr_hash
<tree_node
>
2047 typedef list_proxy
*compare_type
;
2049 static hashval_t
hash (tree
);
2050 static bool equal (tree
, list_proxy
*);
2053 /* Now here is the hash table. When recording a list, it is added
2054 to the slot whose index is the hash code mod the table size.
2055 Note that the hash table is used for several kinds of lists.
2056 While all these live in the same table, they are completely independent,
2057 and the hash code is computed differently for each of these. */
2059 static GTY (()) hash_table
<list_hasher
> *list_hash_table
;
2061 /* Compare ENTRY (an entry in the hash table) with DATA (a list_proxy
2062 for a node we are thinking about adding). */
2065 list_hasher::equal (tree t
, list_proxy
*proxy
)
2067 return (TREE_VALUE (t
) == proxy
->value
2068 && TREE_PURPOSE (t
) == proxy
->purpose
2069 && TREE_CHAIN (t
) == proxy
->chain
);
2072 /* Compute a hash code for a list (chain of TREE_LIST nodes
2073 with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the
2074 TREE_COMMON slots), by adding the hash codes of the individual entries. */
2077 list_hash_pieces (tree purpose
, tree value
, tree chain
)
2079 hashval_t hashcode
= 0;
2082 hashcode
+= TREE_HASH (chain
);
2085 hashcode
+= TREE_HASH (value
);
2089 hashcode
+= TREE_HASH (purpose
);
2095 /* Hash an already existing TREE_LIST. */
2098 list_hasher::hash (tree t
)
2100 return list_hash_pieces (TREE_PURPOSE (t
),
2105 /* Given list components PURPOSE, VALUE, AND CHAIN, return the canonical
2106 object for an identical list if one already exists. Otherwise, build a
2107 new one, and record it as the canonical object. */
2110 hash_tree_cons (tree purpose
, tree value
, tree chain
)
2114 struct list_proxy proxy
;
2116 /* Hash the list node. */
2117 hashcode
= list_hash_pieces (purpose
, value
, chain
);
2118 /* Create a proxy for the TREE_LIST we would like to create. We
2119 don't actually create it so as to avoid creating garbage. */
2120 proxy
.purpose
= purpose
;
2121 proxy
.value
= value
;
2122 proxy
.chain
= chain
;
2123 /* See if it is already in the table. */
2124 slot
= list_hash_table
->find_slot_with_hash (&proxy
, hashcode
, INSERT
);
2125 /* If not, create a new node. */
2127 *slot
= tree_cons (purpose
, value
, chain
);
2128 return (tree
) *slot
;
2131 /* Constructor for hashed lists. */
2134 hash_tree_chain (tree value
, tree chain
)
2136 return hash_tree_cons (NULL_TREE
, value
, chain
);
2140 debug_binfo (tree elem
)
2145 fprintf (stderr
, "type \"%s\", offset = " HOST_WIDE_INT_PRINT_DEC
2147 TYPE_NAME_STRING (BINFO_TYPE (elem
)),
2148 TREE_INT_CST_LOW (BINFO_OFFSET (elem
)));
2149 debug_tree (BINFO_TYPE (elem
));
2150 if (BINFO_VTABLE (elem
))
2151 fprintf (stderr
, "vtable decl \"%s\"\n",
2152 IDENTIFIER_POINTER (DECL_NAME (get_vtbl_decl_for_binfo (elem
))));
2154 fprintf (stderr
, "no vtable decl yet\n");
2155 fprintf (stderr
, "virtuals:\n");
2156 virtuals
= BINFO_VIRTUALS (elem
);
2161 tree fndecl
= TREE_VALUE (virtuals
);
2162 fprintf (stderr
, "%s [%ld =? %ld]\n",
2163 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl
)),
2164 (long) n
, (long) TREE_INT_CST_LOW (DECL_VINDEX (fndecl
)));
2166 virtuals
= TREE_CHAIN (virtuals
);
2170 /* Build a representation for the qualified name SCOPE::NAME. TYPE is
2171 the type of the result expression, if known, or NULL_TREE if the
2172 resulting expression is type-dependent. If TEMPLATE_P is true,
2173 NAME is known to be a template because the user explicitly used the
2174 "template" keyword after the "::".
2176 All SCOPE_REFs should be built by use of this function. */
2179 build_qualified_name (tree type
, tree scope
, tree name
, bool template_p
)
2182 if (type
== error_mark_node
2183 || scope
== error_mark_node
2184 || name
== error_mark_node
)
2185 return error_mark_node
;
2186 gcc_assert (TREE_CODE (name
) != SCOPE_REF
);
2187 t
= build2 (SCOPE_REF
, type
, scope
, name
);
2188 QUALIFIED_NAME_IS_TEMPLATE (t
) = template_p
;
2189 PTRMEM_OK_P (t
) = true;
2191 t
= convert_from_reference (t
);
2195 /* Like check_qualified_type, but also check ref-qualifier, exception
2196 specification, and whether the return type was specified after the
2200 cp_check_qualified_type (const_tree cand
, const_tree base
, int type_quals
,
2201 cp_ref_qualifier rqual
, tree raises
, bool late
)
2203 return (TYPE_QUALS (cand
) == type_quals
2204 && check_base_type (cand
, base
)
2205 && comp_except_specs (raises
, TYPE_RAISES_EXCEPTIONS (cand
),
2207 && TYPE_HAS_LATE_RETURN_TYPE (cand
) == late
2208 && type_memfn_rqual (cand
) == rqual
);
2211 /* Build the FUNCTION_TYPE or METHOD_TYPE with the ref-qualifier RQUAL. */
2214 build_ref_qualified_type (tree type
, cp_ref_qualifier rqual
)
2216 tree raises
= TYPE_RAISES_EXCEPTIONS (type
);
2217 bool late
= TYPE_HAS_LATE_RETURN_TYPE (type
);
2218 return build_cp_fntype_variant (type
, rqual
, raises
, late
);
2221 /* Make a raw overload node containing FN. */
2224 ovl_make (tree fn
, tree next
)
2226 tree result
= make_node (OVERLOAD
);
2228 if (TREE_CODE (fn
) == OVERLOAD
)
2229 OVL_NESTED_P (result
) = true;
2231 TREE_TYPE (result
) = (next
|| TREE_CODE (fn
) == TEMPLATE_DECL
2232 ? unknown_type_node
: TREE_TYPE (fn
));
2233 if (next
&& TREE_CODE (next
) == OVERLOAD
&& OVL_DEDUP_P (next
))
2234 OVL_DEDUP_P (result
) = true;
2235 OVL_FUNCTION (result
) = fn
;
2236 OVL_CHAIN (result
) = next
;
2240 /* Add FN to the (potentially NULL) overload set OVL. USING_P is
2241 true, if FN is via a using declaration. We also pay attention to
2242 DECL_HIDDEN. We keep the hidden decls first, but remaining ones
2246 ovl_insert (tree fn
, tree maybe_ovl
, bool using_p
)
2248 tree result
= maybe_ovl
;
2249 tree insert_after
= NULL_TREE
;
2252 for (; maybe_ovl
&& TREE_CODE (maybe_ovl
) == OVERLOAD
2253 && OVL_HIDDEN_P (maybe_ovl
);
2254 maybe_ovl
= OVL_CHAIN (maybe_ovl
))
2256 gcc_checking_assert (!OVL_LOOKUP_P (maybe_ovl
));
2257 insert_after
= maybe_ovl
;
2260 bool hidden_p
= DECL_HIDDEN_P (fn
);
2261 if (maybe_ovl
|| using_p
|| hidden_p
|| TREE_CODE (fn
) == TEMPLATE_DECL
)
2263 maybe_ovl
= ovl_make (fn
, maybe_ovl
);
2265 OVL_HIDDEN_P (maybe_ovl
) = true;
2267 OVL_DEDUP_P (maybe_ovl
) = OVL_USING_P (maybe_ovl
) = true;
2274 OVL_CHAIN (insert_after
) = maybe_ovl
;
2275 TREE_TYPE (insert_after
) = unknown_type_node
;
2283 /* Skip any hidden names at the beginning of OVL. */
2286 ovl_skip_hidden (tree ovl
)
2289 ovl
&& TREE_CODE (ovl
) == OVERLOAD
&& OVL_HIDDEN_P (ovl
);
2290 ovl
= OVL_CHAIN (ovl
))
2291 gcc_checking_assert (DECL_HIDDEN_P (OVL_FUNCTION (ovl
)));
2293 if (ovl
&& TREE_CODE (ovl
) != OVERLOAD
&& DECL_HIDDEN_P (ovl
))
2295 /* Any hidden functions should have been wrapped in an
2296 overload, but injected friend classes will not. */
2297 gcc_checking_assert (!DECL_DECLARES_FUNCTION_P (ovl
));
2304 /* NODE is an OVL_HIDDEN_P node that is now revealed. */
2307 ovl_iterator::reveal_node (tree overload
, tree node
)
2309 /* We cannot have returned NODE as part of a lookup overload, so we
2310 don't have to worry about preserving that. */
2312 OVL_HIDDEN_P (node
) = false;
2313 if (tree chain
= OVL_CHAIN (node
))
2314 if (TREE_CODE (chain
) == OVERLOAD
)
2316 if (OVL_HIDDEN_P (chain
))
2318 /* The node needs moving, and the simplest way is to remove it
2320 overload
= remove_node (overload
, node
);
2321 overload
= ovl_insert (OVL_FUNCTION (node
), overload
);
2323 else if (OVL_DEDUP_P (chain
))
2324 OVL_DEDUP_P (node
) = true;
2329 /* NODE is on the overloads of OVL. Remove it.
2330 The removed node is unaltered and may continue to be iterated
2331 from (i.e. it is safe to remove a node from an overload one is
2332 currently iterating over). */
2335 ovl_iterator::remove_node (tree overload
, tree node
)
2337 tree
*slot
= &overload
;
2338 while (*slot
!= node
)
2341 gcc_checking_assert (!OVL_LOOKUP_P (probe
));
2343 slot
= &OVL_CHAIN (probe
);
2346 /* Stitch out NODE. We don't have to worry about now making a
2347 singleton overload (and consequently maybe setting its type),
2348 because all uses of this function will be followed by inserting a
2349 new node that must follow the place we've cut this out from. */
2350 if (TREE_CODE (node
) != OVERLOAD
)
2351 /* Cloned inherited ctors don't mark themselves as via_using. */
2354 *slot
= OVL_CHAIN (node
);
2359 /* Mark or unmark a lookup set. */
2362 lookup_mark (tree ovl
, bool val
)
2364 for (lkp_iterator
iter (ovl
); iter
; ++iter
)
2366 gcc_checking_assert (LOOKUP_SEEN_P (*iter
) != val
);
2367 LOOKUP_SEEN_P (*iter
) = val
;
2371 /* Add a set of new FNS into a lookup. */
2374 lookup_add (tree fns
, tree lookup
)
2376 if (fns
== error_mark_node
|| lookup
== error_mark_node
)
2377 return error_mark_node
;
2379 if (lookup
|| TREE_CODE (fns
) == TEMPLATE_DECL
)
2381 lookup
= ovl_make (fns
, lookup
);
2382 OVL_LOOKUP_P (lookup
) = true;
2390 /* FNS is a new overload set, add them to LOOKUP, if they are not
2391 already present there. */
2394 lookup_maybe_add (tree fns
, tree lookup
, bool deduping
)
2397 for (tree next
, probe
= fns
; probe
; probe
= next
)
2402 if (TREE_CODE (probe
) == OVERLOAD
)
2404 fn
= OVL_FUNCTION (probe
);
2405 next
= OVL_CHAIN (probe
);
2408 if (!LOOKUP_SEEN_P (fn
))
2409 LOOKUP_SEEN_P (fn
) = true;
2412 /* This function was already seen. Insert all the
2413 predecessors onto the lookup. */
2414 for (; fns
!= probe
; fns
= OVL_CHAIN (fns
))
2416 lookup
= lookup_add (OVL_FUNCTION (fns
), lookup
);
2417 /* Propagate OVL_USING, but OVL_HIDDEN &
2418 OVL_DEDUP_P don't matter. */
2419 if (OVL_USING_P (fns
))
2420 OVL_USING_P (lookup
) = true;
2423 /* And now skip this function. */
2429 /* We ended in a set of new functions. Add them all in one go. */
2430 lookup
= lookup_add (fns
, lookup
);
2435 /* Returns nonzero if X is an expression for a (possibly overloaded)
2436 function. If "f" is a function or function template, "f", "c->f",
2437 "c.f", "C::f", and "f<int>" will all be considered possibly
2438 overloaded functions. Returns 2 if the function is actually
2439 overloaded, i.e., if it is impossible to know the type of the
2440 function without performing overload resolution. */
2443 is_overloaded_fn (tree x
)
2445 STRIP_ANY_LOCATION_WRAPPER (x
);
2447 /* A baselink is also considered an overloaded function. */
2448 if (TREE_CODE (x
) == OFFSET_REF
2449 || TREE_CODE (x
) == COMPONENT_REF
)
2450 x
= TREE_OPERAND (x
, 1);
2451 x
= MAYBE_BASELINK_FUNCTIONS (x
);
2452 if (TREE_CODE (x
) == TEMPLATE_ID_EXPR
)
2453 x
= TREE_OPERAND (x
, 0);
2455 if (DECL_FUNCTION_TEMPLATE_P (OVL_FIRST (x
))
2456 || (TREE_CODE (x
) == OVERLOAD
&& !OVL_SINGLE_P (x
)))
2462 /* X is the CALL_EXPR_FN of a CALL_EXPR. If X represents a dependent name
2463 (14.6.2), return the IDENTIFIER_NODE for that name. Otherwise, return
2467 dependent_name (tree x
)
2469 /* FIXME a dependent name must be unqualified, but this function doesn't
2470 distinguish between qualified and unqualified identifiers. */
2471 if (identifier_p (x
))
2473 if (TREE_CODE (x
) == TEMPLATE_ID_EXPR
)
2474 x
= TREE_OPERAND (x
, 0);
2476 return OVL_NAME (x
);
2480 /* Returns true iff X is an expression for an overloaded function
2481 whose type cannot be known without performing overload
2485 really_overloaded_fn (tree x
)
2487 return is_overloaded_fn (x
) == 2;
2490 /* Get the overload set FROM refers to. Returns NULL if it's not an
2494 maybe_get_fns (tree from
)
2496 STRIP_ANY_LOCATION_WRAPPER (from
);
2498 /* A baselink is also considered an overloaded function. */
2499 if (TREE_CODE (from
) == OFFSET_REF
2500 || TREE_CODE (from
) == COMPONENT_REF
)
2501 from
= TREE_OPERAND (from
, 1);
2502 if (BASELINK_P (from
))
2503 from
= BASELINK_FUNCTIONS (from
);
2504 if (TREE_CODE (from
) == TEMPLATE_ID_EXPR
)
2505 from
= TREE_OPERAND (from
, 0);
2513 /* FROM refers to an overload set. Return that set (or die). */
2518 tree res
= maybe_get_fns (from
);
2524 /* Return the first function of the overload set FROM refers to. */
2527 get_first_fn (tree from
)
2529 return OVL_FIRST (get_fns (from
));
2532 /* Return the scope where the overloaded functions OVL were found. */
2535 ovl_scope (tree ovl
)
2537 if (TREE_CODE (ovl
) == OFFSET_REF
2538 || TREE_CODE (ovl
) == COMPONENT_REF
)
2539 ovl
= TREE_OPERAND (ovl
, 1);
2540 if (TREE_CODE (ovl
) == BASELINK
)
2541 return BINFO_TYPE (BASELINK_BINFO (ovl
));
2542 if (TREE_CODE (ovl
) == TEMPLATE_ID_EXPR
)
2543 ovl
= TREE_OPERAND (ovl
, 0);
2544 /* Skip using-declarations. */
2545 lkp_iterator
iter (ovl
);
2548 while (iter
.using_p () && ++iter
);
2550 return CP_DECL_CONTEXT (ovl
);
2553 #define PRINT_RING_SIZE 4
2556 cxx_printable_name_internal (tree decl
, int v
, bool translate
)
2558 static unsigned int uid_ring
[PRINT_RING_SIZE
];
2559 static char *print_ring
[PRINT_RING_SIZE
];
2560 static bool trans_ring
[PRINT_RING_SIZE
];
2561 static int ring_counter
;
2564 /* Only cache functions. */
2566 || TREE_CODE (decl
) != FUNCTION_DECL
2567 || DECL_LANG_SPECIFIC (decl
) == 0)
2568 return lang_decl_name (decl
, v
, translate
);
2570 /* See if this print name is lying around. */
2571 for (i
= 0; i
< PRINT_RING_SIZE
; i
++)
2572 if (uid_ring
[i
] == DECL_UID (decl
) && translate
== trans_ring
[i
])
2573 /* yes, so return it. */
2574 return print_ring
[i
];
2576 if (++ring_counter
== PRINT_RING_SIZE
)
2579 if (current_function_decl
!= NULL_TREE
)
2581 /* There may be both translated and untranslated versions of the
2583 for (i
= 0; i
< 2; i
++)
2585 if (uid_ring
[ring_counter
] == DECL_UID (current_function_decl
))
2587 if (ring_counter
== PRINT_RING_SIZE
)
2590 gcc_assert (uid_ring
[ring_counter
] != DECL_UID (current_function_decl
));
2593 free (print_ring
[ring_counter
]);
2595 print_ring
[ring_counter
] = xstrdup (lang_decl_name (decl
, v
, translate
));
2596 uid_ring
[ring_counter
] = DECL_UID (decl
);
2597 trans_ring
[ring_counter
] = translate
;
2598 return print_ring
[ring_counter
];
2602 cxx_printable_name (tree decl
, int v
)
2604 return cxx_printable_name_internal (decl
, v
, false);
2608 cxx_printable_name_translate (tree decl
, int v
)
2610 return cxx_printable_name_internal (decl
, v
, true);
2613 /* Return the canonical version of exception-specification RAISES for a C++17
2614 function type, for use in type comparison and building TYPE_CANONICAL. */
2617 canonical_eh_spec (tree raises
)
2619 if (raises
== NULL_TREE
)
2621 else if (DEFERRED_NOEXCEPT_SPEC_P (raises
)
2622 || UNPARSED_NOEXCEPT_SPEC_P (raises
)
2623 || uses_template_parms (raises
)
2624 || uses_template_parms (TREE_PURPOSE (raises
)))
2625 /* Keep a dependent or deferred exception specification. */
2627 else if (nothrow_spec_p (raises
))
2628 /* throw() -> noexcept. */
2629 return noexcept_true_spec
;
2631 /* For C++17 type matching, anything else -> nothing. */
2636 build_cp_fntype_variant (tree type
, cp_ref_qualifier rqual
,
2637 tree raises
, bool late
)
2639 cp_cv_quals type_quals
= TYPE_QUALS (type
);
2641 if (cp_check_qualified_type (type
, type
, type_quals
, rqual
, raises
, late
))
2644 tree v
= TYPE_MAIN_VARIANT (type
);
2645 for (; v
; v
= TYPE_NEXT_VARIANT (v
))
2646 if (cp_check_qualified_type (v
, type
, type_quals
, rqual
, raises
, late
))
2649 /* Need to build a new variant. */
2650 v
= build_variant_type_copy (type
);
2651 TYPE_RAISES_EXCEPTIONS (v
) = raises
;
2652 TYPE_HAS_LATE_RETURN_TYPE (v
) = late
;
2655 case REF_QUAL_RVALUE
:
2656 FUNCTION_RVALUE_QUALIFIED (v
) = 1;
2657 FUNCTION_REF_QUALIFIED (v
) = 1;
2659 case REF_QUAL_LVALUE
:
2660 FUNCTION_RVALUE_QUALIFIED (v
) = 0;
2661 FUNCTION_REF_QUALIFIED (v
) = 1;
2664 FUNCTION_REF_QUALIFIED (v
) = 0;
2668 /* Canonicalize the exception specification. */
2669 tree cr
= flag_noexcept_type
? canonical_eh_spec (raises
) : NULL_TREE
;
2671 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
2672 /* Propagate structural equality. */
2673 SET_TYPE_STRUCTURAL_EQUALITY (v
);
2674 else if (TYPE_CANONICAL (type
) != type
|| cr
!= raises
|| late
)
2675 /* Build the underlying canonical type, since it is different
2677 TYPE_CANONICAL (v
) = build_cp_fntype_variant (TYPE_CANONICAL (type
),
2680 /* T is its own canonical type. */
2681 TYPE_CANONICAL (v
) = v
;
2686 /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions
2687 listed in RAISES. */
2690 build_exception_variant (tree type
, tree raises
)
2692 cp_ref_qualifier rqual
= type_memfn_rqual (type
);
2693 bool late
= TYPE_HAS_LATE_RETURN_TYPE (type
);
2694 return build_cp_fntype_variant (type
, rqual
, raises
, late
);
2697 /* Given a TEMPLATE_TEMPLATE_PARM node T, create a new
2698 BOUND_TEMPLATE_TEMPLATE_PARM bound with NEWARGS as its template
2702 bind_template_template_parm (tree t
, tree newargs
)
2704 tree decl
= TYPE_NAME (t
);
2707 t2
= cxx_make_type (BOUND_TEMPLATE_TEMPLATE_PARM
);
2708 decl
= build_decl (input_location
,
2709 TYPE_DECL
, DECL_NAME (decl
), NULL_TREE
);
2711 /* These nodes have to be created to reflect new TYPE_DECL and template
2713 TEMPLATE_TYPE_PARM_INDEX (t2
) = copy_node (TEMPLATE_TYPE_PARM_INDEX (t
));
2714 TEMPLATE_PARM_DECL (TEMPLATE_TYPE_PARM_INDEX (t2
)) = decl
;
2715 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2
)
2716 = build_template_info (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t
), newargs
);
2718 TREE_TYPE (decl
) = t2
;
2719 TYPE_NAME (t2
) = decl
;
2720 TYPE_STUB_DECL (t2
) = decl
;
2722 SET_TYPE_STRUCTURAL_EQUALITY (t2
);
2727 /* Called from count_trees via walk_tree. */
2730 count_trees_r (tree
*tp
, int *walk_subtrees
, void *data
)
2740 /* Debugging function for measuring the rough complexity of a tree
2744 count_trees (tree t
)
2747 cp_walk_tree_without_duplicates (&t
, count_trees_r
, &n_trees
);
2751 /* Called from verify_stmt_tree via walk_tree. */
2754 verify_stmt_tree_r (tree
* tp
, int * /*walk_subtrees*/, void* data
)
2757 hash_table
<nofree_ptr_hash
<tree_node
> > *statements
2758 = static_cast <hash_table
<nofree_ptr_hash
<tree_node
> > *> (data
);
2761 if (!STATEMENT_CODE_P (TREE_CODE (t
)))
2764 /* If this statement is already present in the hash table, then
2765 there is a circularity in the statement tree. */
2766 gcc_assert (!statements
->find (t
));
2768 slot
= statements
->find_slot (t
, INSERT
);
2774 /* Debugging function to check that the statement T has not been
2775 corrupted. For now, this function simply checks that T contains no
2779 verify_stmt_tree (tree t
)
2781 hash_table
<nofree_ptr_hash
<tree_node
> > statements (37);
2782 cp_walk_tree (&t
, verify_stmt_tree_r
, &statements
, NULL
);
2785 /* Check if the type T depends on a type with no linkage and if so,
2786 return it. If RELAXED_P then do not consider a class type declared
2787 within a vague-linkage function to have no linkage. Remember:
2788 no-linkage is not the same as internal-linkage*/
2791 no_linkage_check (tree t
, bool relaxed_p
)
2795 /* Lambda types that don't have mangling scope have no linkage. We
2796 check CLASSTYPE_LAMBDA_EXPR for error_mark_node because
2797 when we get here from pushtag none of the lambda information is
2798 set up yet, so we want to assume that the lambda has linkage and
2799 fix it up later if not. We need to check this even in templates so
2800 that we properly handle a lambda-expression in the signature. */
2801 if (LAMBDA_TYPE_P (t
)
2802 && CLASSTYPE_LAMBDA_EXPR (t
) != error_mark_node
)
2804 tree extra
= LAMBDA_TYPE_EXTRA_SCOPE (t
);
2809 /* Otherwise there's no point in checking linkage on template functions; we
2810 can't know their complete types. */
2811 if (processing_template_decl
)
2814 switch (TREE_CODE (t
))
2817 if (TYPE_PTRMEMFUNC_P (t
))
2821 if (!CLASS_TYPE_P (t
))
2825 /* Only treat unnamed types as having no linkage if they're at
2826 namespace scope. This is core issue 966. */
2827 if (TYPE_UNNAMED_P (t
) && TYPE_NAMESPACE_SCOPE_P (t
))
2830 for (r
= CP_TYPE_CONTEXT (t
); ; )
2832 /* If we're a nested type of a !TREE_PUBLIC class, we might not
2833 have linkage, or we might just be in an anonymous namespace.
2834 If we're in a TREE_PUBLIC class, we have linkage. */
2835 if (TYPE_P (r
) && !TREE_PUBLIC (TYPE_NAME (r
)))
2836 return no_linkage_check (TYPE_CONTEXT (t
), relaxed_p
);
2837 else if (TREE_CODE (r
) == FUNCTION_DECL
)
2839 if (!relaxed_p
|| !vague_linkage_p (r
))
2842 r
= CP_DECL_CONTEXT (r
);
2852 case REFERENCE_TYPE
:
2854 return no_linkage_check (TREE_TYPE (t
), relaxed_p
);
2858 r
= no_linkage_check (TYPE_PTRMEM_POINTED_TO_TYPE (t
),
2862 return no_linkage_check (TYPE_PTRMEM_CLASS_TYPE (t
), relaxed_p
);
2867 tree parm
= TYPE_ARG_TYPES (t
);
2868 if (TREE_CODE (t
) == METHOD_TYPE
)
2869 /* The 'this' pointer isn't interesting; a method has the same
2870 linkage (or lack thereof) as its enclosing class. */
2871 parm
= TREE_CHAIN (parm
);
2873 parm
&& parm
!= void_list_node
;
2874 parm
= TREE_CHAIN (parm
))
2876 r
= no_linkage_check (TREE_VALUE (parm
), relaxed_p
);
2880 return no_linkage_check (TREE_TYPE (t
), relaxed_p
);
2888 extern int depth_reached
;
2891 cxx_print_statistics (void)
2893 print_template_statistics ();
2894 if (GATHER_STATISTICS
)
2895 fprintf (stderr
, "maximum template instantiation depth reached: %d\n",
2899 /* Return, as an INTEGER_CST node, the number of elements for TYPE
2900 (which is an ARRAY_TYPE). This counts only elements of the top
2904 array_type_nelts_top (tree type
)
2906 return fold_build2_loc (input_location
,
2907 PLUS_EXPR
, sizetype
,
2908 array_type_nelts (type
),
2912 /* Return, as an INTEGER_CST node, the number of elements for TYPE
2913 (which is an ARRAY_TYPE). This one is a recursive count of all
2914 ARRAY_TYPEs that are clumped together. */
2917 array_type_nelts_total (tree type
)
2919 tree sz
= array_type_nelts_top (type
);
2920 type
= TREE_TYPE (type
);
2921 while (TREE_CODE (type
) == ARRAY_TYPE
)
2923 tree n
= array_type_nelts_top (type
);
2924 sz
= fold_build2_loc (input_location
,
2925 MULT_EXPR
, sizetype
, sz
, n
);
2926 type
= TREE_TYPE (type
);
2933 splay_tree target_remap
;
2934 bool clear_location
;
2937 /* Called from break_out_target_exprs via mapcar. */
2940 bot_manip (tree
* tp
, int* walk_subtrees
, void* data_
)
2942 bot_data
&data
= *(bot_data
*)data_
;
2943 splay_tree target_remap
= data
.target_remap
;
2946 if (!TYPE_P (t
) && TREE_CONSTANT (t
) && !TREE_SIDE_EFFECTS (t
))
2948 /* There can't be any TARGET_EXPRs or their slot variables below this
2949 point. But we must make a copy, in case subsequent processing
2950 alters any part of it. For example, during gimplification a cast
2951 of the form (T) &X::f (where "f" is a member function) will lead
2952 to replacing the PTRMEM_CST for &X::f with a VAR_DECL. */
2954 *tp
= unshare_expr (t
);
2957 if (TREE_CODE (t
) == TARGET_EXPR
)
2961 if (TREE_CODE (TREE_OPERAND (t
, 1)) == AGGR_INIT_EXPR
)
2963 u
= build_cplus_new (TREE_TYPE (t
), TREE_OPERAND (t
, 1),
2964 tf_warning_or_error
);
2965 if (u
== error_mark_node
)
2967 if (AGGR_INIT_ZERO_FIRST (TREE_OPERAND (t
, 1)))
2968 AGGR_INIT_ZERO_FIRST (TREE_OPERAND (u
, 1)) = true;
2971 u
= build_target_expr_with_type (TREE_OPERAND (t
, 1), TREE_TYPE (t
),
2972 tf_warning_or_error
);
2974 TARGET_EXPR_IMPLICIT_P (u
) = TARGET_EXPR_IMPLICIT_P (t
);
2975 TARGET_EXPR_LIST_INIT_P (u
) = TARGET_EXPR_LIST_INIT_P (t
);
2976 TARGET_EXPR_DIRECT_INIT_P (u
) = TARGET_EXPR_DIRECT_INIT_P (t
);
2978 /* Map the old variable to the new one. */
2979 splay_tree_insert (target_remap
,
2980 (splay_tree_key
) TREE_OPERAND (t
, 0),
2981 (splay_tree_value
) TREE_OPERAND (u
, 0));
2983 TREE_OPERAND (u
, 1) = break_out_target_exprs (TREE_OPERAND (u
, 1),
2984 data
.clear_location
);
2985 if (TREE_OPERAND (u
, 1) == error_mark_node
)
2986 return error_mark_node
;
2988 /* Replace the old expression with the new version. */
2990 /* We don't have to go below this point; the recursive call to
2991 break_out_target_exprs will have handled anything below this
2996 if (TREE_CODE (*tp
) == SAVE_EXPR
)
2999 splay_tree_node n
= splay_tree_lookup (target_remap
,
3000 (splay_tree_key
) t
);
3003 *tp
= (tree
)n
->value
;
3008 copy_tree_r (tp
, walk_subtrees
, NULL
);
3009 splay_tree_insert (target_remap
,
3011 (splay_tree_value
)*tp
);
3012 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
3013 splay_tree_insert (target_remap
,
3014 (splay_tree_key
)*tp
,
3015 (splay_tree_value
)*tp
);
3020 /* Make a copy of this node. */
3021 t
= copy_tree_r (tp
, walk_subtrees
, NULL
);
3022 if (TREE_CODE (*tp
) == CALL_EXPR
|| TREE_CODE (*tp
) == AGGR_INIT_EXPR
)
3023 if (!processing_template_decl
)
3024 set_flags_from_callee (*tp
);
3025 if (data
.clear_location
&& EXPR_HAS_LOCATION (*tp
))
3026 SET_EXPR_LOCATION (*tp
, input_location
);
3030 /* Replace all remapped VAR_DECLs in T with their new equivalents.
3031 DATA is really a splay-tree mapping old variables to new
3035 bot_replace (tree
* t
, int* /*walk_subtrees*/, void* data_
)
3037 bot_data
&data
= *(bot_data
*)data_
;
3038 splay_tree target_remap
= data
.target_remap
;
3042 splay_tree_node n
= splay_tree_lookup (target_remap
,
3043 (splay_tree_key
) *t
);
3045 *t
= (tree
) n
->value
;
3047 else if (TREE_CODE (*t
) == PARM_DECL
3048 && DECL_NAME (*t
) == this_identifier
3049 && !DECL_CONTEXT (*t
))
3051 /* In an NSDMI we need to replace the 'this' parameter we used for
3052 parsing with the real one for this function. */
3053 *t
= current_class_ptr
;
3055 else if (TREE_CODE (*t
) == CONVERT_EXPR
3056 && CONVERT_EXPR_VBASE_PATH (*t
))
3058 /* In an NSDMI build_base_path defers building conversions to virtual
3059 bases, and we handle it here. */
3060 tree basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (*t
)));
3061 vec
<tree
, va_gc
> *vbases
= CLASSTYPE_VBASECLASSES (current_class_type
);
3063 FOR_EACH_VEC_SAFE_ELT (vbases
, i
, binfo
)
3064 if (BINFO_TYPE (binfo
) == basetype
)
3066 *t
= build_base_path (PLUS_EXPR
, TREE_OPERAND (*t
, 0), binfo
, true,
3067 tf_warning_or_error
);
3073 /* When we parse a default argument expression, we may create
3074 temporary variables via TARGET_EXPRs. When we actually use the
3075 default-argument expression, we make a copy of the expression
3076 and replace the temporaries with appropriate local versions.
3078 If CLEAR_LOCATION is true, override any EXPR_LOCATION with
3082 break_out_target_exprs (tree t
, bool clear_location
/* = false */)
3084 static int target_remap_count
;
3085 static splay_tree target_remap
;
3087 if (!target_remap_count
++)
3088 target_remap
= splay_tree_new (splay_tree_compare_pointers
,
3089 /*splay_tree_delete_key_fn=*/NULL
,
3090 /*splay_tree_delete_value_fn=*/NULL
);
3091 bot_data data
= { target_remap
, clear_location
};
3092 if (cp_walk_tree (&t
, bot_manip
, &data
, NULL
) == error_mark_node
)
3093 t
= error_mark_node
;
3094 cp_walk_tree (&t
, bot_replace
, &data
, NULL
);
3096 if (!--target_remap_count
)
3098 splay_tree_delete (target_remap
);
3099 target_remap
= NULL
;
3105 /* Build an expression for the subobject of OBJ at CONSTRUCTOR index INDEX,
3106 which we expect to have type TYPE. */
3109 build_ctor_subob_ref (tree index
, tree type
, tree obj
)
3111 if (index
== NULL_TREE
)
3112 /* Can't refer to a particular member of a vector. */
3114 else if (TREE_CODE (index
) == INTEGER_CST
)
3115 obj
= cp_build_array_ref (input_location
, obj
, index
, tf_none
);
3117 obj
= build_class_member_access_expr (obj
, index
, NULL_TREE
,
3118 /*reference*/false, tf_none
);
3121 tree objtype
= TREE_TYPE (obj
);
3122 if (TREE_CODE (objtype
) == ARRAY_TYPE
&& !TYPE_DOMAIN (objtype
))
3124 /* When the destination object refers to a flexible array member
3125 verify that it matches the type of the source object except
3126 for its domain and qualifiers. */
3127 gcc_assert (comptypes (TYPE_MAIN_VARIANT (type
),
3128 TYPE_MAIN_VARIANT (objtype
),
3129 COMPARE_REDECLARATION
));
3132 gcc_assert (same_type_ignoring_top_level_qualifiers_p (type
, objtype
));
3138 struct replace_placeholders_t
3140 tree obj
; /* The object to be substituted for a PLACEHOLDER_EXPR. */
3141 tree exp
; /* The outermost exp. */
3142 bool seen
; /* Whether we've encountered a PLACEHOLDER_EXPR. */
3143 hash_set
<tree
> *pset
; /* To avoid walking same trees multiple times. */
3146 /* Like substitute_placeholder_in_expr, but handle C++ tree codes and
3147 build up subexpressions as we go deeper. */
3150 replace_placeholders_r (tree
* t
, int* walk_subtrees
, void* data_
)
3152 replace_placeholders_t
*d
= static_cast<replace_placeholders_t
*>(data_
);
3155 if (TYPE_P (*t
) || TREE_CONSTANT (*t
))
3157 *walk_subtrees
= false;
3161 switch (TREE_CODE (*t
))
3163 case PLACEHOLDER_EXPR
:
3166 for (; !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (*t
),
3168 x
= TREE_OPERAND (x
, 0))
3169 gcc_assert (handled_component_p (x
));
3170 *t
= unshare_expr (x
);
3171 *walk_subtrees
= false;
3178 constructor_elt
*ce
;
3179 vec
<constructor_elt
,va_gc
> *v
= CONSTRUCTOR_ELTS (*t
);
3180 /* Don't walk into CONSTRUCTOR_PLACEHOLDER_BOUNDARY ctors
3181 other than the d->exp one, those have PLACEHOLDER_EXPRs
3182 related to another object. */
3183 if ((CONSTRUCTOR_PLACEHOLDER_BOUNDARY (*t
)
3185 || d
->pset
->add (*t
))
3187 *walk_subtrees
= false;
3190 for (unsigned i
= 0; vec_safe_iterate (v
, i
, &ce
); ++i
)
3192 tree
*valp
= &ce
->value
;
3193 tree type
= TREE_TYPE (*valp
);
3196 /* Elements with RANGE_EXPR index shouldn't have any
3197 placeholders in them. */
3198 if (ce
->index
&& TREE_CODE (ce
->index
) == RANGE_EXPR
)
3201 if (TREE_CODE (*valp
) == CONSTRUCTOR
3202 && AGGREGATE_TYPE_P (type
))
3204 /* If we're looking at the initializer for OBJ, then build
3205 a sub-object reference. If we're looking at an
3206 initializer for another object, just pass OBJ down. */
3207 if (same_type_ignoring_top_level_qualifiers_p
3208 (TREE_TYPE (*t
), TREE_TYPE (obj
)))
3209 subob
= build_ctor_subob_ref (ce
->index
, type
, obj
);
3210 if (TREE_CODE (*valp
) == TARGET_EXPR
)
3211 valp
= &TARGET_EXPR_INITIAL (*valp
);
3214 cp_walk_tree (valp
, replace_placeholders_r
, data_
, NULL
);
3217 *walk_subtrees
= false;
3222 if (d
->pset
->add (*t
))
3223 *walk_subtrees
= false;
3230 /* Replace PLACEHOLDER_EXPRs in EXP with object OBJ. SEEN_P is set if
3231 a PLACEHOLDER_EXPR has been encountered. */
3234 replace_placeholders (tree exp
, tree obj
, bool *seen_p
/*= NULL*/)
3236 /* This is only relevant for C++14. */
3237 if (cxx_dialect
< cxx14
)
3240 /* If the object isn't a (member of a) class, do nothing. */
3242 while (handled_component_p (op0
))
3243 op0
= TREE_OPERAND (op0
, 0);
3244 if (!CLASS_TYPE_P (strip_array_types (TREE_TYPE (op0
))))
3248 if (TREE_CODE (exp
) == TARGET_EXPR
)
3249 tp
= &TARGET_EXPR_INITIAL (exp
);
3250 hash_set
<tree
> pset
;
3251 replace_placeholders_t data
= { obj
, *tp
, false, &pset
};
3252 cp_walk_tree (tp
, replace_placeholders_r
, &data
, NULL
);
3254 *seen_p
= data
.seen
;
3258 /* Callback function for find_placeholders. */
3261 find_placeholders_r (tree
*t
, int *walk_subtrees
, void *)
3263 if (TYPE_P (*t
) || TREE_CONSTANT (*t
))
3265 *walk_subtrees
= false;
3269 switch (TREE_CODE (*t
))
3271 case PLACEHOLDER_EXPR
:
3275 if (CONSTRUCTOR_PLACEHOLDER_BOUNDARY (*t
))
3276 *walk_subtrees
= false;
3286 /* Return true if EXP contains a PLACEHOLDER_EXPR. Don't walk into
3287 ctors with CONSTRUCTOR_PLACEHOLDER_BOUNDARY flag set. */
3290 find_placeholders (tree exp
)
3292 /* This is only relevant for C++14. */
3293 if (cxx_dialect
< cxx14
)
3296 return cp_walk_tree_without_duplicates (&exp
, find_placeholders_r
, NULL
);
3299 /* Similar to `build_nt', but for template definitions of dependent
3303 build_min_nt_loc (location_t loc
, enum tree_code code
, ...)
3310 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3314 t
= make_node (code
);
3315 SET_EXPR_LOCATION (t
, loc
);
3316 length
= TREE_CODE_LENGTH (code
);
3318 for (i
= 0; i
< length
; i
++)
3319 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
3325 /* Similar to `build', but for template definitions. */
3328 build_min (enum tree_code code
, tree tt
, ...)
3335 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3339 t
= make_node (code
);
3340 length
= TREE_CODE_LENGTH (code
);
3343 for (i
= 0; i
< length
; i
++)
3345 tree x
= va_arg (p
, tree
);
3346 TREE_OPERAND (t
, i
) = x
;
3347 if (x
&& !TYPE_P (x
) && TREE_SIDE_EFFECTS (x
))
3348 TREE_SIDE_EFFECTS (t
) = 1;
3356 /* Similar to `build', but for template definitions of non-dependent
3357 expressions. NON_DEP is the non-dependent expression that has been
3361 build_min_non_dep (enum tree_code code
, tree non_dep
, ...)
3368 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3370 va_start (p
, non_dep
);
3372 if (REFERENCE_REF_P (non_dep
))
3373 non_dep
= TREE_OPERAND (non_dep
, 0);
3375 t
= make_node (code
);
3376 SET_EXPR_LOCATION (t
, cp_expr_loc_or_input_loc (non_dep
));
3377 length
= TREE_CODE_LENGTH (code
);
3378 TREE_TYPE (t
) = unlowered_expr_type (non_dep
);
3379 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (non_dep
);
3381 for (i
= 0; i
< length
; i
++)
3382 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
3384 if (code
== COMPOUND_EXPR
&& TREE_CODE (non_dep
) != COMPOUND_EXPR
)
3385 /* This should not be considered a COMPOUND_EXPR, because it
3386 resolves to an overload. */
3387 COMPOUND_EXPR_OVERLOADED (t
) = 1;
3390 return convert_from_reference (t
);
3393 /* Similar to build_min_nt, but call expressions */
3396 build_min_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
3401 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
3402 CALL_EXPR_FN (ret
) = fn
;
3403 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
3404 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
3405 CALL_EXPR_ARG (ret
, ix
) = t
;
3410 /* Similar to `build_min_nt_call_vec', but for template definitions of
3411 non-dependent expressions. NON_DEP is the non-dependent expression
3412 that has been built. */
3415 build_min_non_dep_call_vec (tree non_dep
, tree fn
, vec
<tree
, va_gc
> *argvec
)
3417 tree t
= build_min_nt_call_vec (fn
, argvec
);
3418 if (REFERENCE_REF_P (non_dep
))
3419 non_dep
= TREE_OPERAND (non_dep
, 0);
3420 TREE_TYPE (t
) = TREE_TYPE (non_dep
);
3421 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (non_dep
);
3422 return convert_from_reference (t
);
3425 /* Similar to build_min_non_dep, but for expressions that have been resolved to
3426 a call to an operator overload. OP is the operator that has been
3427 overloaded. NON_DEP is the non-dependent expression that's been built,
3428 which should be a CALL_EXPR or an INDIRECT_REF to a CALL_EXPR. OVERLOAD is
3429 the overload that NON_DEP is calling. */
3432 build_min_non_dep_op_overload (enum tree_code op
,
3437 int nargs
, expected_nargs
;
3440 non_dep
= extract_call_expr (non_dep
);
3442 nargs
= call_expr_nargs (non_dep
);
3444 expected_nargs
= cp_tree_code_length (op
);
3445 if ((op
== POSTINCREMENT_EXPR
3446 || op
== POSTDECREMENT_EXPR
)
3447 /* With -fpermissive non_dep could be operator++(). */
3448 && (!flag_permissive
|| nargs
!= expected_nargs
))
3449 expected_nargs
+= 1;
3450 gcc_assert (nargs
== expected_nargs
);
3453 va_start (p
, overload
);
3455 if (TREE_CODE (TREE_TYPE (overload
)) == FUNCTION_TYPE
)
3458 for (int i
= 0; i
< nargs
; i
++)
3460 tree arg
= va_arg (p
, tree
);
3461 vec_safe_push (args
, arg
);
3464 else if (TREE_CODE (TREE_TYPE (overload
)) == METHOD_TYPE
)
3466 tree object
= va_arg (p
, tree
);
3467 tree binfo
= TYPE_BINFO (TREE_TYPE (object
));
3468 tree method
= build_baselink (binfo
, binfo
, overload
, NULL_TREE
);
3469 fn
= build_min (COMPONENT_REF
, TREE_TYPE (overload
),
3470 object
, method
, NULL_TREE
);
3471 for (int i
= 1; i
< nargs
; i
++)
3473 tree arg
= va_arg (p
, tree
);
3474 vec_safe_push (args
, arg
);
3481 call
= build_min_non_dep_call_vec (non_dep
, fn
, args
);
3483 tree call_expr
= extract_call_expr (call
);
3484 KOENIG_LOOKUP_P (call_expr
) = KOENIG_LOOKUP_P (non_dep
);
3485 CALL_EXPR_OPERATOR_SYNTAX (call_expr
) = true;
3486 CALL_EXPR_ORDERED_ARGS (call_expr
) = CALL_EXPR_ORDERED_ARGS (non_dep
);
3487 CALL_EXPR_REVERSE_ARGS (call_expr
) = CALL_EXPR_REVERSE_ARGS (non_dep
);
3492 /* Return a new tree vec copied from VEC, with ELT inserted at index IDX. */
3495 vec_copy_and_insert (vec
<tree
, va_gc
> *old_vec
, tree elt
, unsigned idx
)
3497 unsigned len
= vec_safe_length (old_vec
);
3498 gcc_assert (idx
<= len
);
3500 vec
<tree
, va_gc
> *new_vec
= NULL
;
3501 vec_alloc (new_vec
, len
+ 1);
3504 for (i
= 0; i
< len
; ++i
)
3507 new_vec
->quick_push (elt
);
3508 new_vec
->quick_push ((*old_vec
)[i
]);
3511 new_vec
->quick_push (elt
);
3517 get_type_decl (tree t
)
3519 if (TREE_CODE (t
) == TYPE_DECL
)
3522 return TYPE_STUB_DECL (t
);
3523 gcc_assert (t
== error_mark_node
);
3527 /* Returns the namespace that contains DECL, whether directly or
3531 decl_namespace_context (tree decl
)
3535 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
3537 else if (TYPE_P (decl
))
3538 decl
= CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl
));
3540 decl
= CP_DECL_CONTEXT (decl
);
3544 /* Returns true if decl is within an anonymous namespace, however deeply
3545 nested, or false otherwise. */
3548 decl_anon_ns_mem_p (const_tree decl
)
3550 while (TREE_CODE (decl
) != NAMESPACE_DECL
)
3552 /* Classes inside anonymous namespaces have TREE_PUBLIC == 0. */
3554 return !TREE_PUBLIC (TYPE_MAIN_DECL (decl
));
3556 decl
= CP_DECL_CONTEXT (decl
);
3558 return !TREE_PUBLIC (decl
);
3561 /* Subroutine of cp_tree_equal: t1 and t2 are the CALL_EXPR_FNs of two
3562 CALL_EXPRS. Return whether they are equivalent. */
3565 called_fns_equal (tree t1
, tree t2
)
3567 /* Core 1321: dependent names are equivalent even if the overload sets
3568 are different. But do compare explicit template arguments. */
3569 tree name1
= dependent_name (t1
);
3570 tree name2
= dependent_name (t2
);
3573 tree targs1
= NULL_TREE
, targs2
= NULL_TREE
;
3578 /* FIXME dependent_name currently returns an unqualified name regardless
3579 of whether the function was named with a qualified- or unqualified-id.
3580 Until that's fixed, check that we aren't looking at overload sets from
3581 different scopes. */
3582 if (is_overloaded_fn (t1
) && is_overloaded_fn (t2
)
3583 && (DECL_CONTEXT (get_first_fn (t1
))
3584 != DECL_CONTEXT (get_first_fn (t2
))))
3587 if (TREE_CODE (t1
) == TEMPLATE_ID_EXPR
)
3588 targs1
= TREE_OPERAND (t1
, 1);
3589 if (TREE_CODE (t2
) == TEMPLATE_ID_EXPR
)
3590 targs2
= TREE_OPERAND (t2
, 1);
3591 return cp_tree_equal (targs1
, targs2
);
3594 return cp_tree_equal (t1
, t2
);
3597 /* Return truthvalue of whether T1 is the same tree structure as T2.
3598 Return 1 if they are the same. Return 0 if they are different. */
3601 cp_tree_equal (tree t1
, tree t2
)
3603 enum tree_code code1
, code2
;
3610 code1
= TREE_CODE (t1
);
3611 code2
= TREE_CODE (t2
);
3616 if (CONSTANT_CLASS_P (t1
)
3617 && !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
3623 /* There's only a single VOID_CST node, so we should never reach
3628 return tree_int_cst_equal (t1
, t2
);
3631 return real_equal (&TREE_REAL_CST (t1
), &TREE_REAL_CST (t2
));
3634 return TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
3635 && !memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
3636 TREE_STRING_LENGTH (t1
));
3639 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
),
3640 TREE_FIXED_CST (t2
));
3643 return cp_tree_equal (TREE_REALPART (t1
), TREE_REALPART (t2
))
3644 && cp_tree_equal (TREE_IMAGPART (t1
), TREE_IMAGPART (t2
));
3647 return operand_equal_p (t1
, t2
, OEP_ONLY_CONST
);
3650 /* We need to do this when determining whether or not two
3651 non-type pointer to member function template arguments
3653 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
3654 || CONSTRUCTOR_NELTS (t1
) != CONSTRUCTOR_NELTS (t2
))
3659 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t1
), i
, field
, value
)
3661 constructor_elt
*elt2
= CONSTRUCTOR_ELT (t2
, i
);
3662 if (!cp_tree_equal (field
, elt2
->index
)
3663 || !cp_tree_equal (value
, elt2
->value
))
3670 if (!cp_tree_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
)))
3672 if (!cp_tree_equal (TREE_VALUE (t1
), TREE_VALUE (t2
)))
3674 return cp_tree_equal (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
3677 return cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3682 call_expr_arg_iterator iter1
, iter2
;
3683 if (KOENIG_LOOKUP_P (t1
) != KOENIG_LOOKUP_P (t2
)
3684 || !called_fns_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
)))
3686 for (arg1
= first_call_expr_arg (t1
, &iter1
),
3687 arg2
= first_call_expr_arg (t2
, &iter2
);
3689 arg1
= next_call_expr_arg (&iter1
),
3690 arg2
= next_call_expr_arg (&iter2
))
3691 if (!cp_tree_equal (arg1
, arg2
))
3700 tree o1
= TREE_OPERAND (t1
, 0);
3701 tree o2
= TREE_OPERAND (t2
, 0);
3703 /* Special case: if either target is an unallocated VAR_DECL,
3704 it means that it's going to be unified with whatever the
3705 TARGET_EXPR is really supposed to initialize, so treat it
3706 as being equivalent to anything. */
3707 if (VAR_P (o1
) && DECL_NAME (o1
) == NULL_TREE
3708 && !DECL_RTL_SET_P (o1
))
3710 else if (VAR_P (o2
) && DECL_NAME (o2
) == NULL_TREE
3711 && !DECL_RTL_SET_P (o2
))
3713 else if (!cp_tree_equal (o1
, o2
))
3716 return cp_tree_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
3720 /* For comparing uses of parameters in late-specified return types
3721 with an out-of-class definition of the function, but can also come
3722 up for expressions that involve 'this' in a member function
3725 if (comparing_specializations
3726 && DECL_CONTEXT (t1
) != DECL_CONTEXT (t2
))
3727 /* When comparing hash table entries, only an exact match is
3728 good enough; we don't want to replace 'this' with the
3729 version from another function. But be more flexible
3730 with parameters with identical contexts. */
3733 if (same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
3735 if (DECL_ARTIFICIAL (t1
) ^ DECL_ARTIFICIAL (t2
))
3737 if (CONSTRAINT_VAR_P (t1
) ^ CONSTRAINT_VAR_P (t2
))
3739 if (DECL_ARTIFICIAL (t1
)
3740 || (DECL_PARM_LEVEL (t1
) == DECL_PARM_LEVEL (t2
)
3741 && DECL_PARM_INDEX (t1
) == DECL_PARM_INDEX (t2
)))
3751 case IDENTIFIER_NODE
:
3754 case DEFERRED_PARSE
:
3758 return (BASELINK_BINFO (t1
) == BASELINK_BINFO (t2
)
3759 && BASELINK_ACCESS_BINFO (t1
) == BASELINK_ACCESS_BINFO (t2
)
3760 && BASELINK_QUALIFIED_P (t1
) == BASELINK_QUALIFIED_P (t2
)
3761 && cp_tree_equal (BASELINK_FUNCTIONS (t1
),
3762 BASELINK_FUNCTIONS (t2
)));
3764 case TEMPLATE_PARM_INDEX
:
3765 return (TEMPLATE_PARM_IDX (t1
) == TEMPLATE_PARM_IDX (t2
)
3766 && TEMPLATE_PARM_LEVEL (t1
) == TEMPLATE_PARM_LEVEL (t2
)
3767 && (TEMPLATE_PARM_PARAMETER_PACK (t1
)
3768 == TEMPLATE_PARM_PARAMETER_PACK (t2
))
3769 && same_type_p (TREE_TYPE (TEMPLATE_PARM_DECL (t1
)),
3770 TREE_TYPE (TEMPLATE_PARM_DECL (t2
))));
3772 case TEMPLATE_ID_EXPR
:
3773 if (!cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0)))
3775 if (!comp_template_args (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1)))
3779 case CONSTRAINT_INFO
:
3780 return cp_tree_equal (CI_ASSOCIATED_CONSTRAINTS (t1
),
3781 CI_ASSOCIATED_CONSTRAINTS (t2
));
3784 return (CHECK_CONSTR_CONCEPT (t1
) == CHECK_CONSTR_CONCEPT (t2
)
3785 && comp_template_args (CHECK_CONSTR_ARGS (t1
),
3786 CHECK_CONSTR_ARGS (t2
)));
3791 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
3793 for (ix
= TREE_VEC_LENGTH (t1
); ix
--;)
3794 if (!cp_tree_equal (TREE_VEC_ELT (t1
, ix
),
3795 TREE_VEC_ELT (t2
, ix
)))
3803 tree o1
= TREE_OPERAND (t1
, 0);
3804 tree o2
= TREE_OPERAND (t2
, 0);
3806 if (code1
== SIZEOF_EXPR
)
3808 if (SIZEOF_EXPR_TYPE_P (t1
))
3809 o1
= TREE_TYPE (o1
);
3810 if (SIZEOF_EXPR_TYPE_P (t2
))
3811 o2
= TREE_TYPE (o2
);
3814 if (TREE_CODE (o1
) != TREE_CODE (o2
))
3817 if (ARGUMENT_PACK_P (o1
))
3818 return template_args_equal (o1
, o2
);
3819 else if (TYPE_P (o1
))
3820 return same_type_p (o1
, o2
);
3822 return cp_tree_equal (o1
, o2
);
3827 tree t1_op1
, t2_op1
;
3829 if (!cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0)))
3832 t1_op1
= TREE_OPERAND (t1
, 1);
3833 t2_op1
= TREE_OPERAND (t2
, 1);
3834 if (TREE_CODE (t1_op1
) != TREE_CODE (t2_op1
))
3837 return cp_tree_equal (TREE_OPERAND (t1
, 2), TREE_OPERAND (t2
, 2));
3841 /* Two pointer-to-members are the same if they point to the same
3842 field or function in the same class. */
3843 if (PTRMEM_CST_MEMBER (t1
) != PTRMEM_CST_MEMBER (t2
))
3846 return same_type_p (PTRMEM_CST_CLASS (t1
), PTRMEM_CST_CLASS (t2
));
3850 /* Two overloads. Must be exactly the same set of decls. */
3851 lkp_iterator
first (t1
);
3852 lkp_iterator
second (t2
);
3854 for (; first
&& second
; ++first
, ++second
)
3855 if (*first
!= *second
)
3857 return !(first
|| second
);
3861 if (TRAIT_EXPR_KIND (t1
) != TRAIT_EXPR_KIND (t2
))
3863 return same_type_p (TRAIT_EXPR_TYPE1 (t1
), TRAIT_EXPR_TYPE1 (t2
))
3864 && cp_tree_equal (TRAIT_EXPR_TYPE2 (t1
), TRAIT_EXPR_TYPE2 (t2
));
3867 case STATIC_CAST_EXPR
:
3868 case REINTERPRET_CAST_EXPR
:
3869 case CONST_CAST_EXPR
:
3870 case DYNAMIC_CAST_EXPR
:
3871 case IMPLICIT_CONV_EXPR
:
3874 case NON_LVALUE_EXPR
:
3875 case VIEW_CONVERT_EXPR
:
3876 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
3878 /* Now compare operands as usual. */
3881 case DEFERRED_NOEXCEPT
:
3882 return (cp_tree_equal (DEFERRED_NOEXCEPT_PATTERN (t1
),
3883 DEFERRED_NOEXCEPT_PATTERN (t2
))
3884 && comp_template_args (DEFERRED_NOEXCEPT_ARGS (t1
),
3885 DEFERRED_NOEXCEPT_ARGS (t2
)));
3888 /* Two lambda-expressions are never considered equivalent. */
3891 case TYPE_ARGUMENT_PACK
:
3892 case NONTYPE_ARGUMENT_PACK
:
3894 tree p1
= ARGUMENT_PACK_ARGS (t1
);
3895 tree p2
= ARGUMENT_PACK_ARGS (t2
);
3896 int len
= TREE_VEC_LENGTH (p1
);
3897 if (TREE_VEC_LENGTH (p2
) != len
)
3900 for (int ix
= 0; ix
!= len
; ix
++)
3901 if (!template_args_equal (TREE_VEC_ELT (p1
, ix
),
3902 TREE_VEC_ELT (p2
, ix
)))
3907 case EXPR_PACK_EXPANSION
:
3908 if (!cp_tree_equal (PACK_EXPANSION_PATTERN (t1
),
3909 PACK_EXPANSION_PATTERN (t2
)))
3911 if (!comp_template_args (PACK_EXPANSION_EXTRA_ARGS (t1
),
3912 PACK_EXPANSION_EXTRA_ARGS (t2
)))
3920 switch (TREE_CODE_CLASS (code1
))
3924 case tcc_comparison
:
3925 case tcc_expression
:
3930 int n
= cp_tree_operand_length (t1
);
3931 if (TREE_CODE_CLASS (code1
) == tcc_vl_exp
3932 && n
!= TREE_OPERAND_LENGTH (t2
))
3935 for (int i
= 0; i
< n
; ++i
)
3936 if (!cp_tree_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
)))
3943 return same_type_p (t1
, t2
);
3949 /* We can get here with --disable-checking. */
3953 /* The type of ARG when used as an lvalue. */
3956 lvalue_type (tree arg
)
3958 tree type
= TREE_TYPE (arg
);
3962 /* The type of ARG for printing error messages; denote lvalues with
3966 error_type (tree arg
)
3968 tree type
= TREE_TYPE (arg
);
3970 if (TREE_CODE (type
) == ARRAY_TYPE
)
3972 else if (TREE_CODE (type
) == ERROR_MARK
)
3974 else if (lvalue_p (arg
))
3975 type
= build_reference_type (lvalue_type (arg
));
3976 else if (MAYBE_CLASS_TYPE_P (type
))
3977 type
= lvalue_type (arg
);
3982 /* Does FUNCTION use a variable-length argument list? */
3985 varargs_function_p (const_tree function
)
3987 return stdarg_p (TREE_TYPE (function
));
3990 /* Returns 1 if decl is a member of a class. */
3993 member_p (const_tree decl
)
3995 const_tree
const ctx
= DECL_CONTEXT (decl
);
3996 return (ctx
&& TYPE_P (ctx
));
3999 /* Create a placeholder for member access where we don't actually have an
4000 object that the access is against. */
4003 build_dummy_object (tree type
)
4005 tree decl
= build1 (CONVERT_EXPR
, build_pointer_type (type
), void_node
);
4006 return cp_build_fold_indirect_ref (decl
);
4009 /* We've gotten a reference to a member of TYPE. Return *this if appropriate,
4010 or a dummy object otherwise. If BINFOP is non-0, it is filled with the
4011 binfo path from current_class_type to TYPE, or 0. */
4014 maybe_dummy_object (tree type
, tree
* binfop
)
4018 tree current
= current_nonlambda_class_type ();
4021 && (binfo
= lookup_base (current
, type
, ba_any
, NULL
,
4022 tf_warning_or_error
)))
4026 /* Reference from a nested class member function. */
4028 binfo
= TYPE_BINFO (type
);
4034 if (current_class_ref
4035 /* current_class_ref might not correspond to current_class_type if
4036 we're in tsubst_default_argument or a lambda-declarator; in either
4037 case, we want to use current_class_ref if it matches CONTEXT. */
4038 && (same_type_ignoring_top_level_qualifiers_p
4039 (TREE_TYPE (current_class_ref
), context
)))
4040 decl
= current_class_ref
;
4042 decl
= build_dummy_object (context
);
4047 /* Returns 1 if OB is a placeholder object, or a pointer to one. */
4050 is_dummy_object (const_tree ob
)
4052 if (INDIRECT_REF_P (ob
))
4053 ob
= TREE_OPERAND (ob
, 0);
4054 return (TREE_CODE (ob
) == CONVERT_EXPR
4055 && TREE_OPERAND (ob
, 0) == void_node
);
4058 /* Returns true if TYPE is a character type or std::byte. */
4061 is_byte_access_type (tree type
)
4063 type
= TYPE_MAIN_VARIANT (type
);
4064 if (char_type_p (type
))
4067 return (TREE_CODE (type
) == ENUMERAL_TYPE
4068 && TYPE_CONTEXT (type
) == std_node
4069 && !strcmp ("byte", TYPE_NAME_STRING (type
)));
4072 /* Returns 1 iff type T is something we want to treat as a scalar type for
4073 the purpose of deciding whether it is trivial/POD/standard-layout. */
4076 scalarish_type_p (const_tree t
)
4078 if (t
== error_mark_node
)
4081 return (SCALAR_TYPE_P (t
) || VECTOR_TYPE_P (t
));
4084 /* Returns true iff T requires non-trivial default initialization. */
4087 type_has_nontrivial_default_init (const_tree t
)
4089 t
= strip_array_types (CONST_CAST_TREE (t
));
4091 if (CLASS_TYPE_P (t
))
4092 return TYPE_HAS_COMPLEX_DFLT (t
);
4097 /* Track classes with only deleted copy/move constructors so that we can warn
4098 if they are used in call/return by value. */
4100 static GTY(()) hash_set
<tree
>* deleted_copy_types
;
4102 remember_deleted_copy (const_tree t
)
4104 if (!deleted_copy_types
)
4105 deleted_copy_types
= hash_set
<tree
>::create_ggc(37);
4106 deleted_copy_types
->add (CONST_CAST_TREE (t
));
4109 maybe_warn_parm_abi (tree t
, location_t loc
)
4111 if (!deleted_copy_types
4112 || !deleted_copy_types
->contains (t
))
4115 if ((flag_abi_version
== 12 || warn_abi_version
== 12)
4116 && classtype_has_non_deleted_move_ctor (t
))
4119 auto_diagnostic_group d
;
4120 if (flag_abi_version
> 12)
4121 w
= warning_at (loc
, OPT_Wabi
, "%<-fabi-version=13%> (GCC 8.2) fixes "
4122 "the calling convention for %qT, which was "
4123 "accidentally changed in 8.1", t
);
4125 w
= warning_at (loc
, OPT_Wabi
, "%<-fabi-version=12%> (GCC 8.1) accident"
4126 "ally changes the calling convention for %qT", t
);
4128 inform (location_of (t
), " declared here");
4132 auto_diagnostic_group d
;
4133 if (warning_at (loc
, OPT_Wabi
, "the calling convention for %qT changes in "
4134 "%<-fabi-version=13%> (GCC 8.2)", t
))
4135 inform (location_of (t
), " because all of its copy and move "
4136 "constructors are deleted");
4139 /* Returns true iff copying an object of type T (including via move
4140 constructor) is non-trivial. That is, T has no non-trivial copy
4141 constructors and no non-trivial move constructors, and not all copy/move
4142 constructors are deleted. This function implements the ABI notion of
4143 non-trivial copy, which has diverged from the one in the standard. */
4146 type_has_nontrivial_copy_init (const_tree type
)
4148 tree t
= strip_array_types (CONST_CAST_TREE (type
));
4150 if (CLASS_TYPE_P (t
))
4152 gcc_assert (COMPLETE_TYPE_P (t
));
4154 if (TYPE_HAS_COMPLEX_COPY_CTOR (t
)
4155 || TYPE_HAS_COMPLEX_MOVE_CTOR (t
))
4159 if (cxx_dialect
< cxx11
)
4160 /* No deleted functions before C++11. */
4163 /* Before ABI v12 we did a bitwise copy of types with only deleted
4164 copy/move constructors. */
4165 if (!abi_version_at_least (12)
4166 && !(warn_abi
&& abi_version_crosses (12)))
4169 bool saw_copy
= false;
4170 bool saw_non_deleted
= false;
4171 bool saw_non_deleted_move
= false;
4173 if (CLASSTYPE_LAZY_MOVE_CTOR (t
))
4174 saw_copy
= saw_non_deleted
= true;
4175 else if (CLASSTYPE_LAZY_COPY_CTOR (t
))
4178 if (classtype_has_move_assign_or_move_ctor_p (t
, true))
4179 /* [class.copy]/8 If the class definition declares a move
4180 constructor or move assignment operator, the implicitly declared
4181 copy constructor is defined as deleted.... */;
4183 /* Any other reason the implicitly-declared function would be
4184 deleted would also cause TYPE_HAS_COMPLEX_COPY_CTOR to be
4186 saw_non_deleted
= true;
4189 if (!saw_non_deleted
)
4190 for (ovl_iterator
iter (CLASSTYPE_CONSTRUCTORS (t
)); iter
; ++iter
)
4196 if (!DECL_DELETED_FN (fn
))
4198 /* Not deleted, therefore trivial. */
4199 saw_non_deleted
= true;
4203 else if (move_fn_p (fn
))
4204 if (!DECL_DELETED_FN (fn
))
4205 saw_non_deleted_move
= true;
4208 gcc_assert (saw_copy
);
4210 /* ABI v12 buggily ignored move constructors. */
4211 bool v11nontriv
= false;
4212 bool v12nontriv
= !saw_non_deleted
;
4213 bool v13nontriv
= !saw_non_deleted
&& !saw_non_deleted_move
;
4214 bool nontriv
= (abi_version_at_least (13) ? v13nontriv
4215 : flag_abi_version
== 12 ? v12nontriv
4217 bool warn_nontriv
= (warn_abi_version
>= 13 ? v13nontriv
4218 : warn_abi_version
== 12 ? v12nontriv
4220 if (nontriv
!= warn_nontriv
)
4221 remember_deleted_copy (t
);
4229 /* Returns 1 iff type T is a trivially copyable type, as defined in
4230 [basic.types] and [class]. */
4233 trivially_copyable_p (const_tree t
)
4235 t
= strip_array_types (CONST_CAST_TREE (t
));
4237 if (CLASS_TYPE_P (t
))
4238 return ((!TYPE_HAS_COPY_CTOR (t
)
4239 || !TYPE_HAS_COMPLEX_COPY_CTOR (t
))
4240 && !TYPE_HAS_COMPLEX_MOVE_CTOR (t
)
4241 && (!TYPE_HAS_COPY_ASSIGN (t
)
4242 || !TYPE_HAS_COMPLEX_COPY_ASSIGN (t
))
4243 && !TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
)
4244 && TYPE_HAS_TRIVIAL_DESTRUCTOR (t
));
4246 /* CWG 2094 makes volatile-qualified scalars trivially copyable again. */
4247 return scalarish_type_p (t
);
4250 /* Returns 1 iff type T is a trivial type, as defined in [basic.types] and
4254 trivial_type_p (const_tree t
)
4256 t
= strip_array_types (CONST_CAST_TREE (t
));
4258 if (CLASS_TYPE_P (t
))
4259 return (TYPE_HAS_TRIVIAL_DFLT (t
)
4260 && trivially_copyable_p (t
));
4262 return scalarish_type_p (t
);
4265 /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */
4268 pod_type_p (const_tree t
)
4270 /* This CONST_CAST is okay because strip_array_types returns its
4271 argument unmodified and we assign it to a const_tree. */
4272 t
= strip_array_types (CONST_CAST_TREE(t
));
4274 if (!CLASS_TYPE_P (t
))
4275 return scalarish_type_p (t
);
4276 else if (cxx_dialect
> cxx98
)
4277 /* [class]/10: A POD struct is a class that is both a trivial class and a
4278 standard-layout class, and has no non-static data members of type
4279 non-POD struct, non-POD union (or array of such types).
4281 We don't need to check individual members because if a member is
4282 non-std-layout or non-trivial, the class will be too. */
4283 return (std_layout_type_p (t
) && trivial_type_p (t
));
4285 /* The C++98 definition of POD is different. */
4286 return !CLASSTYPE_NON_LAYOUT_POD_P (t
);
4289 /* Returns true iff T is POD for the purpose of layout, as defined in the
4293 layout_pod_type_p (const_tree t
)
4295 t
= strip_array_types (CONST_CAST_TREE (t
));
4297 if (CLASS_TYPE_P (t
))
4298 return !CLASSTYPE_NON_LAYOUT_POD_P (t
);
4300 return scalarish_type_p (t
);
4303 /* Returns true iff T is a standard-layout type, as defined in
4307 std_layout_type_p (const_tree t
)
4309 t
= strip_array_types (CONST_CAST_TREE (t
));
4311 if (CLASS_TYPE_P (t
))
4312 return !CLASSTYPE_NON_STD_LAYOUT (t
);
4314 return scalarish_type_p (t
);
4317 static bool record_has_unique_obj_representations (const_tree
, const_tree
);
4319 /* Returns true iff T satisfies std::has_unique_object_representations<T>,
4320 as defined in [meta.unary.prop]. */
4323 type_has_unique_obj_representations (const_tree t
)
4327 t
= strip_array_types (CONST_CAST_TREE (t
));
4329 if (!trivially_copyable_p (t
))
4332 if (CLASS_TYPE_P (t
) && CLASSTYPE_UNIQUE_OBJ_REPRESENTATIONS_SET (t
))
4333 return CLASSTYPE_UNIQUE_OBJ_REPRESENTATIONS (t
);
4335 switch (TREE_CODE (t
))
4339 case REFERENCE_TYPE
:
4340 /* If some backend has any paddings in these types, we should add
4341 a target hook for this and handle it there. */
4345 /* For bool values other than 0 and 1 should only appear with
4346 undefined behavior. */
4350 return type_has_unique_obj_representations (ENUM_UNDERLYING_TYPE (t
));
4353 /* XFmode certainly contains padding on x86, which the CPU doesn't store
4354 when storing long double values, so for that we have to return false.
4355 Other kinds of floating point values are questionable due to +.0/-.0
4356 and NaNs, let's play safe for now. */
4359 case FIXED_POINT_TYPE
:
4367 return type_has_unique_obj_representations (TREE_TYPE (t
));
4370 ret
= record_has_unique_obj_representations (t
, TYPE_SIZE (t
));
4371 if (CLASS_TYPE_P (t
))
4373 CLASSTYPE_UNIQUE_OBJ_REPRESENTATIONS_SET (t
) = 1;
4374 CLASSTYPE_UNIQUE_OBJ_REPRESENTATIONS (t
) = ret
;
4382 for (tree field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
4383 if (TREE_CODE (field
) == FIELD_DECL
)
4386 if (!type_has_unique_obj_representations (TREE_TYPE (field
))
4387 || simple_cst_equal (DECL_SIZE (field
), TYPE_SIZE (t
)) != 1)
4393 if (!any_fields
&& !integer_zerop (TYPE_SIZE (t
)))
4395 if (CLASS_TYPE_P (t
))
4397 CLASSTYPE_UNIQUE_OBJ_REPRESENTATIONS_SET (t
) = 1;
4398 CLASSTYPE_UNIQUE_OBJ_REPRESENTATIONS (t
) = ret
;
4413 /* Helper function for type_has_unique_obj_representations. */
4416 record_has_unique_obj_representations (const_tree t
, const_tree sz
)
4418 for (tree field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
4419 if (TREE_CODE (field
) != FIELD_DECL
)
4421 /* For bases, can't use type_has_unique_obj_representations here, as in
4422 struct S { int i : 24; S (); };
4423 struct T : public S { int j : 8; T (); };
4424 S doesn't have unique obj representations, but T does. */
4425 else if (DECL_FIELD_IS_BASE (field
))
4427 if (!record_has_unique_obj_representations (TREE_TYPE (field
),
4431 else if (DECL_C_BIT_FIELD (field
))
4433 tree btype
= DECL_BIT_FIELD_TYPE (field
);
4434 if (!type_has_unique_obj_representations (btype
))
4437 else if (!type_has_unique_obj_representations (TREE_TYPE (field
)))
4441 for (tree field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
4442 if (TREE_CODE (field
) == FIELD_DECL
)
4444 offset_int fld
= wi::to_offset (DECL_FIELD_OFFSET (field
));
4445 offset_int bitpos
= wi::to_offset (DECL_FIELD_BIT_OFFSET (field
));
4446 fld
= fld
* BITS_PER_UNIT
+ bitpos
;
4449 if (DECL_SIZE (field
))
4451 offset_int size
= wi::to_offset (DECL_SIZE (field
));
4455 if (cur
!= wi::to_offset (sz
))
4461 /* Nonzero iff type T is a class template implicit specialization. */
4464 class_tmpl_impl_spec_p (const_tree t
)
4466 return CLASS_TYPE_P (t
) && CLASSTYPE_TEMPLATE_INSTANTIATION (t
);
4469 /* Returns 1 iff zero initialization of type T means actually storing
4473 zero_init_p (const_tree t
)
4475 /* This CONST_CAST is okay because strip_array_types returns its
4476 argument unmodified and we assign it to a const_tree. */
4477 t
= strip_array_types (CONST_CAST_TREE(t
));
4479 if (t
== error_mark_node
)
4482 /* NULL pointers to data members are initialized with -1. */
4483 if (TYPE_PTRDATAMEM_P (t
))
4486 /* Classes that contain types that can't be zero-initialized, cannot
4487 be zero-initialized themselves. */
4488 if (CLASS_TYPE_P (t
) && CLASSTYPE_NON_ZERO_INIT_P (t
))
4494 /* Returns true if the expression or initializer T is the result of
4495 zero-initialization for its type, taking pointers to members
4496 into consideration. */
4499 zero_init_expr_p (tree t
)
4501 tree type
= TREE_TYPE (t
);
4502 if (!type
|| uses_template_parms (type
))
4504 if (zero_init_p (type
))
4505 return initializer_zerop (t
);
4506 if (TYPE_PTRMEM_P (type
))
4507 return null_member_pointer_value_p (t
);
4508 if (TREE_CODE (t
) == CONSTRUCTOR
4509 && CP_AGGREGATE_TYPE_P (type
))
4512 unsigned HOST_WIDE_INT i
;
4513 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (t
), i
, elt_init
)
4514 if (!zero_init_expr_p (elt_init
))
4521 /* True IFF T is a C++20 structural type (P1907R1) that can be used as a
4522 non-type template parameter. If EXPLAIN, explain why not. */
4525 structural_type_p (tree t
, bool explain
)
4527 /* A structural type is one of the following: */
4529 /* a scalar type, or */
4530 if (SCALAR_TYPE_P (t
))
4532 /* an lvalue reference type, or */
4533 if (TYPE_REF_P (t
) && !TYPE_REF_IS_RVALUE (t
))
4535 /* a literal class type with the following properties:
4536 - all base classes and non-static data members are public and non-mutable
4538 - the types of all bases classes and non-static data members are
4539 structural types or (possibly multi-dimensional) array thereof. */
4540 if (!CLASS_TYPE_P (t
))
4542 if (!literal_type_p (t
))
4545 explain_non_literal_class (t
);
4548 for (tree m
= next_initializable_field (TYPE_FIELDS (t
)); m
;
4549 m
= next_initializable_field (DECL_CHAIN (m
)))
4551 if (TREE_PRIVATE (m
) || TREE_PROTECTED (m
))
4555 if (DECL_FIELD_IS_BASE (m
))
4556 inform (location_of (m
), "base class %qT is not public",
4559 inform (location_of (m
), "%qD is not public", m
);
4563 if (DECL_MUTABLE_P (m
))
4566 inform (location_of (m
), "%qD is mutable", m
);
4569 tree mtype
= strip_array_types (TREE_TYPE (m
));
4570 if (!structural_type_p (mtype
))
4574 inform (location_of (m
), "%qD has a non-structural type", m
);
4575 structural_type_p (mtype
, true);
4583 /* Handle the C++17 [[nodiscard]] attribute, which is similar to the GNU
4584 warn_unused_result attribute. */
4587 handle_nodiscard_attribute (tree
*node
, tree name
, tree args
,
4588 int /*flags*/, bool *no_add_attrs
)
4590 if (args
&& TREE_CODE (TREE_VALUE (args
)) != STRING_CST
)
4592 error ("%qE attribute argument must be a string constant", name
);
4593 *no_add_attrs
= true;
4595 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4597 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (*node
)))
4598 && !DECL_CONSTRUCTOR_P (*node
))
4599 warning_at (DECL_SOURCE_LOCATION (*node
),
4600 OPT_Wattributes
, "%qE attribute applied to %qD with void "
4601 "return type", name
, *node
);
4603 else if (OVERLOAD_TYPE_P (*node
))
4607 warning (OPT_Wattributes
, "%qE attribute can only be applied to "
4608 "functions or to class or enumeration types", name
);
4609 *no_add_attrs
= true;
4614 /* Handle a C++20 "no_unique_address" attribute; arguments as in
4615 struct attribute_spec.handler. */
4617 handle_no_unique_addr_attribute (tree
* node
,
4623 if (TREE_CODE (*node
) != FIELD_DECL
)
4625 warning (OPT_Wattributes
, "%qE attribute can only be applied to "
4626 "non-static data members", name
);
4627 *no_add_attrs
= true;
4629 else if (DECL_C_BIT_FIELD (*node
))
4631 warning (OPT_Wattributes
, "%qE attribute cannot be applied to "
4632 "a bit-field", name
);
4633 *no_add_attrs
= true;
4639 /* The C++20 [[likely]] and [[unlikely]] attributes on labels map to the GNU
4640 hot/cold attributes. */
4643 handle_likeliness_attribute (tree
*node
, tree name
, tree args
,
4644 int flags
, bool *no_add_attrs
)
4646 *no_add_attrs
= true;
4647 if (TREE_CODE (*node
) == LABEL_DECL
4648 || TREE_CODE (*node
) == FUNCTION_DECL
)
4651 warning (OPT_Wattributes
, "%qE attribute takes no arguments", name
);
4652 tree bname
= (is_attribute_p ("likely", name
)
4653 ? get_identifier ("hot") : get_identifier ("cold"));
4654 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4655 warning (OPT_Wattributes
, "ISO C++ %qE attribute does not apply to "
4656 "functions; treating as %<[[gnu::%E]]%>", name
, bname
);
4657 tree battr
= build_tree_list (bname
, NULL_TREE
);
4658 decl_attributes (node
, battr
, flags
);
4662 return error_mark_node
;
4665 /* Table of valid C++ attributes. */
4666 const struct attribute_spec cxx_attribute_table
[] =
4668 /* { name, min_len, max_len, decl_req, type_req, fn_type_req,
4669 affects_type_identity, handler, exclude } */
4670 { "init_priority", 1, 1, true, false, false, false,
4671 handle_init_priority_attribute
, NULL
},
4672 { "abi_tag", 1, -1, false, false, false, true,
4673 handle_abi_tag_attribute
, NULL
},
4674 { NULL
, 0, 0, false, false, false, false, NULL
, NULL
}
4677 /* Table of C++ standard attributes. */
4678 const struct attribute_spec std_attribute_table
[] =
4680 /* { name, min_len, max_len, decl_req, type_req, fn_type_req,
4681 affects_type_identity, handler, exclude } */
4682 { "maybe_unused", 0, 0, false, false, false, false,
4683 handle_unused_attribute
, NULL
},
4684 { "nodiscard", 0, 1, false, false, false, false,
4685 handle_nodiscard_attribute
, NULL
},
4686 { "no_unique_address", 0, 0, true, false, false, false,
4687 handle_no_unique_addr_attribute
, NULL
},
4688 { "likely", 0, 0, false, false, false, false,
4689 handle_likeliness_attribute
, attr_cold_hot_exclusions
},
4690 { "unlikely", 0, 0, false, false, false, false,
4691 handle_likeliness_attribute
, attr_cold_hot_exclusions
},
4692 { "noreturn", 0, 0, true, false, false, false,
4693 handle_noreturn_attribute
, attr_noreturn_exclusions
},
4694 { NULL
, 0, 0, false, false, false, false, NULL
, NULL
}
4697 /* Handle an "init_priority" attribute; arguments as in
4698 struct attribute_spec.handler. */
4700 handle_init_priority_attribute (tree
* node
,
4706 tree initp_expr
= TREE_VALUE (args
);
4708 tree type
= TREE_TYPE (decl
);
4711 STRIP_NOPS (initp_expr
);
4712 initp_expr
= default_conversion (initp_expr
);
4714 initp_expr
= maybe_constant_value (initp_expr
);
4716 if (!initp_expr
|| TREE_CODE (initp_expr
) != INTEGER_CST
)
4718 error ("requested %<init_priority%> is not an integer constant");
4719 cxx_constant_value (initp_expr
);
4720 *no_add_attrs
= true;
4724 pri
= TREE_INT_CST_LOW (initp_expr
);
4726 type
= strip_array_types (type
);
4728 if (decl
== NULL_TREE
4730 || !TREE_STATIC (decl
)
4731 || DECL_EXTERNAL (decl
)
4732 || (TREE_CODE (type
) != RECORD_TYPE
4733 && TREE_CODE (type
) != UNION_TYPE
)
4734 /* Static objects in functions are initialized the
4735 first time control passes through that
4736 function. This is not precise enough to pin down an
4737 init_priority value, so don't allow it. */
4738 || current_function_decl
)
4740 error ("can only use %qE attribute on file-scope definitions "
4741 "of objects of class type", name
);
4742 *no_add_attrs
= true;
4746 if (pri
> MAX_INIT_PRIORITY
|| pri
<= 0)
4748 error ("requested %<init_priority%> %i is out of range [0, %i]",
4749 pri
, MAX_INIT_PRIORITY
);
4750 *no_add_attrs
= true;
4754 /* Check for init_priorities that are reserved for
4755 language and runtime support implementations.*/
4756 if (pri
<= MAX_RESERVED_INIT_PRIORITY
)
4759 (0, "requested %<init_priority%> %i is reserved for internal use",
4763 if (SUPPORTS_INIT_PRIORITY
)
4765 SET_DECL_INIT_PRIORITY (decl
, pri
);
4766 DECL_HAS_INIT_PRIORITY_P (decl
) = 1;
4771 error ("%qE attribute is not supported on this platform", name
);
4772 *no_add_attrs
= true;
4777 /* DECL is being redeclared; the old declaration had the abi tags in OLD,
4778 and the new one has the tags in NEW_. Give an error if there are tags
4779 in NEW_ that weren't in OLD. */
4782 check_abi_tag_redeclaration (const_tree decl
, const_tree old
, const_tree new_
)
4784 if (old
&& TREE_CODE (TREE_VALUE (old
)) == TREE_LIST
)
4785 old
= TREE_VALUE (old
);
4786 if (new_
&& TREE_CODE (TREE_VALUE (new_
)) == TREE_LIST
)
4787 new_
= TREE_VALUE (new_
);
4789 for (const_tree t
= new_
; t
; t
= TREE_CHAIN (t
))
4791 tree str
= TREE_VALUE (t
);
4792 for (const_tree in
= old
; in
; in
= TREE_CHAIN (in
))
4794 tree ostr
= TREE_VALUE (in
);
4795 if (cp_tree_equal (str
, ostr
))
4798 error ("redeclaration of %qD adds abi tag %qE", decl
, str
);
4804 inform (DECL_SOURCE_LOCATION (decl
), "previous declaration here");
4810 /* The abi_tag attribute with the name NAME was given ARGS. If they are
4811 ill-formed, give an error and return false; otherwise, return true. */
4814 check_abi_tag_args (tree args
, tree name
)
4818 error ("the %qE attribute requires arguments", name
);
4821 for (tree arg
= args
; arg
; arg
= TREE_CHAIN (arg
))
4823 tree elt
= TREE_VALUE (arg
);
4824 if (TREE_CODE (elt
) != STRING_CST
4825 || (!same_type_ignoring_top_level_qualifiers_p
4826 (strip_array_types (TREE_TYPE (elt
)),
4829 error ("arguments to the %qE attribute must be narrow string "
4833 const char *begin
= TREE_STRING_POINTER (elt
);
4834 const char *end
= begin
+ TREE_STRING_LENGTH (elt
);
4835 for (const char *p
= begin
; p
!= end
; ++p
)
4840 if (!ISALPHA (c
) && c
!= '_')
4842 error ("arguments to the %qE attribute must contain valid "
4843 "identifiers", name
);
4844 inform (input_location
, "%<%c%> is not a valid first "
4845 "character for an identifier", c
);
4849 else if (p
== end
- 1)
4850 gcc_assert (c
== 0);
4853 if (!ISALNUM (c
) && c
!= '_')
4855 error ("arguments to the %qE attribute must contain valid "
4856 "identifiers", name
);
4857 inform (input_location
, "%<%c%> is not a valid character "
4858 "in an identifier", c
);
4867 /* Handle an "abi_tag" attribute; arguments as in
4868 struct attribute_spec.handler. */
4871 handle_abi_tag_attribute (tree
* node
, tree name
, tree args
,
4872 int flags
, bool* no_add_attrs
)
4874 if (!check_abi_tag_args (args
, name
))
4879 if (!OVERLOAD_TYPE_P (*node
))
4881 error ("%qE attribute applied to non-class, non-enum type %qT",
4885 else if (!(flags
& (int)ATTR_FLAG_TYPE_IN_PLACE
))
4887 error ("%qE attribute applied to %qT after its definition",
4891 else if (CLASS_TYPE_P (*node
)
4892 && CLASSTYPE_TEMPLATE_INSTANTIATION (*node
))
4894 warning (OPT_Wattributes
, "ignoring %qE attribute applied to "
4895 "template instantiation %qT", name
, *node
);
4898 else if (CLASS_TYPE_P (*node
)
4899 && CLASSTYPE_TEMPLATE_SPECIALIZATION (*node
))
4901 warning (OPT_Wattributes
, "ignoring %qE attribute applied to "
4902 "template specialization %qT", name
, *node
);
4906 tree attributes
= TYPE_ATTRIBUTES (*node
);
4907 tree decl
= TYPE_NAME (*node
);
4909 /* Make sure all declarations have the same abi tags. */
4910 if (DECL_SOURCE_LOCATION (decl
) != input_location
)
4912 if (!check_abi_tag_redeclaration (decl
,
4913 lookup_attribute ("abi_tag",
4921 if (!VAR_OR_FUNCTION_DECL_P (*node
))
4923 error ("%qE attribute applied to non-function, non-variable %qD",
4927 else if (DECL_LANGUAGE (*node
) == lang_c
)
4929 error ("%qE attribute applied to extern \"C\" declaration %qD",
4938 *no_add_attrs
= true;
4942 /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the
4943 thing pointed to by the constant. */
4946 make_ptrmem_cst (tree type
, tree member
)
4948 tree ptrmem_cst
= make_node (PTRMEM_CST
);
4949 TREE_TYPE (ptrmem_cst
) = type
;
4950 PTRMEM_CST_MEMBER (ptrmem_cst
) = member
;
4954 /* Build a variant of TYPE that has the indicated ATTRIBUTES. May
4955 return an existing type if an appropriate type already exists. */
4958 cp_build_type_attribute_variant (tree type
, tree attributes
)
4962 new_type
= build_type_attribute_variant (type
, attributes
);
4963 if (FUNC_OR_METHOD_TYPE_P (new_type
))
4964 gcc_checking_assert (cxx_type_hash_eq (type
, new_type
));
4966 /* Making a new main variant of a class type is broken. */
4967 gcc_assert (!CLASS_TYPE_P (type
) || new_type
== type
);
4972 /* Return TRUE if TYPE1 and TYPE2 are identical for type hashing purposes.
4973 Called only after doing all language independent checks. */
4976 cxx_type_hash_eq (const_tree typea
, const_tree typeb
)
4978 gcc_assert (FUNC_OR_METHOD_TYPE_P (typea
));
4980 if (type_memfn_rqual (typea
) != type_memfn_rqual (typeb
))
4982 if (TYPE_HAS_LATE_RETURN_TYPE (typea
) != TYPE_HAS_LATE_RETURN_TYPE (typeb
))
4984 return comp_except_specs (TYPE_RAISES_EXCEPTIONS (typea
),
4985 TYPE_RAISES_EXCEPTIONS (typeb
), ce_exact
);
4988 /* Copy the language-specific type variant modifiers from TYPEB to TYPEA. For
4989 C++, these are the exception-specifier and ref-qualifier. */
4992 cxx_copy_lang_qualifiers (const_tree typea
, const_tree typeb
)
4994 tree type
= CONST_CAST_TREE (typea
);
4995 if (FUNC_OR_METHOD_TYPE_P (type
))
4996 type
= build_cp_fntype_variant (type
, type_memfn_rqual (typeb
),
4997 TYPE_RAISES_EXCEPTIONS (typeb
),
4998 TYPE_HAS_LATE_RETURN_TYPE (typeb
));
5002 /* Apply FUNC to all language-specific sub-trees of TP in a pre-order
5003 traversal. Called from walk_tree. */
5006 cp_walk_subtrees (tree
*tp
, int *walk_subtrees_p
, walk_tree_fn func
,
5007 void *data
, hash_set
<tree
> *pset
)
5009 enum tree_code code
= TREE_CODE (*tp
);
5012 #define WALK_SUBTREE(NODE) \
5015 result = cp_walk_tree (&(NODE), func, data, pset); \
5016 if (result) goto out; \
5022 /* Walk into template args without looking through typedefs. */
5023 if (tree ti
= TYPE_TEMPLATE_INFO_MAYBE_ALIAS (*tp
))
5024 WALK_SUBTREE (TI_ARGS (ti
));
5025 /* Don't look through typedefs; walk_tree_fns that want to look through
5026 typedefs (like min_vis_r) need to do that themselves. */
5027 if (typedef_variant_p (*tp
))
5029 *walk_subtrees_p
= 0;
5034 /* Not one of the easy cases. We must explicitly go through the
5039 case DEFERRED_PARSE
:
5040 case TEMPLATE_TEMPLATE_PARM
:
5041 case BOUND_TEMPLATE_TEMPLATE_PARM
:
5042 case UNBOUND_CLASS_TEMPLATE
:
5043 case TEMPLATE_PARM_INDEX
:
5044 case TEMPLATE_TYPE_PARM
:
5046 case UNDERLYING_TYPE
:
5047 /* None of these have subtrees other than those already walked
5049 *walk_subtrees_p
= 0;
5053 WALK_SUBTREE (TYPE_CONTEXT (*tp
));
5054 WALK_SUBTREE (TYPENAME_TYPE_FULLNAME (*tp
));
5055 *walk_subtrees_p
= 0;
5059 if (BASELINK_QUALIFIED_P (*tp
))
5060 WALK_SUBTREE (BINFO_TYPE (BASELINK_ACCESS_BINFO (*tp
)));
5061 WALK_SUBTREE (BASELINK_FUNCTIONS (*tp
));
5062 *walk_subtrees_p
= 0;
5066 WALK_SUBTREE (TREE_TYPE (*tp
));
5067 *walk_subtrees_p
= 0;
5071 WALK_SUBTREE (TREE_PURPOSE (*tp
));
5075 WALK_SUBTREE (OVL_FUNCTION (*tp
));
5076 WALK_SUBTREE (OVL_CHAIN (*tp
));
5077 *walk_subtrees_p
= 0;
5081 WALK_SUBTREE (DECL_NAME (*tp
));
5082 WALK_SUBTREE (USING_DECL_SCOPE (*tp
));
5083 WALK_SUBTREE (USING_DECL_DECLS (*tp
));
5084 *walk_subtrees_p
= 0;
5088 if (TYPE_PTRMEMFUNC_P (*tp
))
5089 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE_RAW (*tp
));
5092 case TYPE_ARGUMENT_PACK
:
5093 case NONTYPE_ARGUMENT_PACK
:
5095 tree args
= ARGUMENT_PACK_ARGS (*tp
);
5096 int i
, len
= TREE_VEC_LENGTH (args
);
5097 for (i
= 0; i
< len
; i
++)
5098 WALK_SUBTREE (TREE_VEC_ELT (args
, i
));
5102 case TYPE_PACK_EXPANSION
:
5103 WALK_SUBTREE (TREE_TYPE (*tp
));
5104 WALK_SUBTREE (PACK_EXPANSION_EXTRA_ARGS (*tp
));
5105 *walk_subtrees_p
= 0;
5108 case EXPR_PACK_EXPANSION
:
5109 WALK_SUBTREE (TREE_OPERAND (*tp
, 0));
5110 WALK_SUBTREE (PACK_EXPANSION_EXTRA_ARGS (*tp
));
5111 *walk_subtrees_p
= 0;
5115 case REINTERPRET_CAST_EXPR
:
5116 case STATIC_CAST_EXPR
:
5117 case CONST_CAST_EXPR
:
5118 case DYNAMIC_CAST_EXPR
:
5119 case IMPLICIT_CONV_EXPR
:
5120 if (TREE_TYPE (*tp
))
5121 WALK_SUBTREE (TREE_TYPE (*tp
));
5125 for (i
= 0; i
< TREE_CODE_LENGTH (TREE_CODE (*tp
)); ++i
)
5126 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
5128 *walk_subtrees_p
= 0;
5132 if (COMPOUND_LITERAL_P (*tp
))
5133 WALK_SUBTREE (TREE_TYPE (*tp
));
5137 WALK_SUBTREE (TRAIT_EXPR_TYPE1 (*tp
));
5138 WALK_SUBTREE (TRAIT_EXPR_TYPE2 (*tp
));
5139 *walk_subtrees_p
= 0;
5143 ++cp_unevaluated_operand
;
5144 /* We can't use WALK_SUBTREE here because of the goto. */
5145 result
= cp_walk_tree (&DECLTYPE_TYPE_EXPR (*tp
), func
, data
, pset
);
5146 --cp_unevaluated_operand
;
5147 *walk_subtrees_p
= 0;
5153 ++cp_unevaluated_operand
;
5154 result
= cp_walk_tree (&TREE_OPERAND (*tp
, 0), func
, data
, pset
);
5155 --cp_unevaluated_operand
;
5156 *walk_subtrees_p
= 0;
5160 // Only recurse through the nested expression. Do not
5161 // walk the parameter list. Doing so causes false
5162 // positives in the pack expansion checker since the
5163 // requires parameters are introduced as pack expansions.
5164 WALK_SUBTREE (TREE_OPERAND (*tp
, 1));
5165 *walk_subtrees_p
= 0;
5169 /* User variables should be mentioned in BIND_EXPR_VARS
5170 and their initializers and sizes walked when walking
5171 the containing BIND_EXPR. Compiler temporaries are
5172 handled here. And also normal variables in templates,
5173 since do_poplevel doesn't build a BIND_EXPR then. */
5174 if (VAR_P (TREE_OPERAND (*tp
, 0))
5175 && (processing_template_decl
5176 || (DECL_ARTIFICIAL (TREE_OPERAND (*tp
, 0))
5177 && !TREE_STATIC (TREE_OPERAND (*tp
, 0)))))
5179 tree decl
= TREE_OPERAND (*tp
, 0);
5180 WALK_SUBTREE (DECL_INITIAL (decl
));
5181 WALK_SUBTREE (DECL_SIZE (decl
));
5182 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
5187 /* Don't walk into the body of the lambda, but the capture initializers
5188 are part of the enclosing context. */
5189 for (tree cap
= LAMBDA_EXPR_CAPTURE_LIST (*tp
); cap
;
5190 cap
= TREE_CHAIN (cap
))
5191 WALK_SUBTREE (TREE_VALUE (cap
));
5195 if (TREE_OPERAND (*tp
, 1))
5196 /* Operand 1 is the tree for the relevant co_await which has any
5197 interesting sub-trees. */
5198 WALK_SUBTREE (TREE_OPERAND (*tp
, 1));
5202 if (TREE_OPERAND (*tp
, 1))
5203 /* Operand 1 is frame variable. */
5204 WALK_SUBTREE (TREE_OPERAND (*tp
, 1));
5205 if (TREE_OPERAND (*tp
, 2))
5206 /* Operand 2 has the initialiser, and we need to walk any subtrees
5208 WALK_SUBTREE (TREE_OPERAND (*tp
, 2));
5211 case CO_RETURN_EXPR
:
5212 if (TREE_OPERAND (*tp
, 0))
5214 if (VOID_TYPE_P (TREE_OPERAND (*tp
, 0)))
5215 /* For void expressions, operand 1 is a trivial call, and any
5216 interesting subtrees will be part of operand 0. */
5217 WALK_SUBTREE (TREE_OPERAND (*tp
, 0));
5218 else if (TREE_OPERAND (*tp
, 1))
5219 /* Interesting sub-trees will be in the return_value () call
5221 WALK_SUBTREE (TREE_OPERAND (*tp
, 1));
5229 /* We didn't find what we were looking for. */
5236 /* Like save_expr, but for C++. */
5239 cp_save_expr (tree expr
)
5241 /* There is no reason to create a SAVE_EXPR within a template; if
5242 needed, we can create the SAVE_EXPR when instantiating the
5243 template. Furthermore, the middle-end cannot handle C++-specific
5245 if (processing_template_decl
)
5248 /* TARGET_EXPRs are only expanded once. */
5249 if (TREE_CODE (expr
) == TARGET_EXPR
)
5252 return save_expr (expr
);
5255 /* Initialize tree.c. */
5260 list_hash_table
= hash_table
<list_hasher
>::create_ggc (61);
5261 register_scoped_attributes (std_attribute_table
, NULL
);
5264 /* Returns the kind of special function that DECL (a FUNCTION_DECL)
5265 is. Note that sfk_none is zero, so this function can be used as a
5266 predicate to test whether or not DECL is a special function. */
5268 special_function_kind
5269 special_function_p (const_tree decl
)
5271 /* Rather than doing all this stuff with magic names, we should
5272 probably have a field of type `special_function_kind' in
5273 DECL_LANG_SPECIFIC. */
5274 if (DECL_INHERITED_CTOR (decl
))
5275 return sfk_inheriting_constructor
;
5276 if (DECL_COPY_CONSTRUCTOR_P (decl
))
5277 return sfk_copy_constructor
;
5278 if (DECL_MOVE_CONSTRUCTOR_P (decl
))
5279 return sfk_move_constructor
;
5280 if (DECL_CONSTRUCTOR_P (decl
))
5281 return sfk_constructor
;
5282 if (DECL_ASSIGNMENT_OPERATOR_P (decl
)
5283 && DECL_OVERLOADED_OPERATOR_IS (decl
, NOP_EXPR
))
5285 if (copy_fn_p (decl
))
5286 return sfk_copy_assignment
;
5287 if (move_fn_p (decl
))
5288 return sfk_move_assignment
;
5290 if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl
))
5291 return sfk_destructor
;
5292 if (DECL_COMPLETE_DESTRUCTOR_P (decl
))
5293 return sfk_complete_destructor
;
5294 if (DECL_BASE_DESTRUCTOR_P (decl
))
5295 return sfk_base_destructor
;
5296 if (DECL_DELETING_DESTRUCTOR_P (decl
))
5297 return sfk_deleting_destructor
;
5298 if (DECL_CONV_FN_P (decl
))
5299 return sfk_conversion
;
5300 if (deduction_guide_p (decl
))
5301 return sfk_deduction_guide
;
5302 if (DECL_OVERLOADED_OPERATOR_CODE_RAW (decl
) >= OVL_OP_EQ_EXPR
5303 && DECL_OVERLOADED_OPERATOR_CODE_RAW (decl
) <= OVL_OP_SPACESHIP_EXPR
)
5304 return sfk_comparison
;
5309 /* As above, but only if DECL is a special member function as per 11.3.3
5310 [special]: default/copy/move ctor, copy/move assignment, or destructor. */
5312 special_function_kind
5313 special_memfn_p (const_tree decl
)
5315 switch (special_function_kind sfk
= special_function_p (decl
))
5317 case sfk_constructor
:
5318 if (!default_ctor_p (decl
))
5321 case sfk_copy_constructor
:
5322 case sfk_copy_assignment
:
5323 case sfk_move_assignment
:
5324 case sfk_move_constructor
:
5325 case sfk_destructor
:
5334 /* Returns nonzero if TYPE is a character type, including wchar_t. */
5337 char_type_p (tree type
)
5339 return (same_type_p (type
, char_type_node
)
5340 || same_type_p (type
, unsigned_char_type_node
)
5341 || same_type_p (type
, signed_char_type_node
)
5342 || same_type_p (type
, char8_type_node
)
5343 || same_type_p (type
, char16_type_node
)
5344 || same_type_p (type
, char32_type_node
)
5345 || same_type_p (type
, wchar_type_node
));
5348 /* Returns the kind of linkage associated with the indicated DECL. Th
5349 value returned is as specified by the language standard; it is
5350 independent of implementation details regarding template
5351 instantiation, etc. For example, it is possible that a declaration
5352 to which this function assigns external linkage would not show up
5353 as a global symbol when you run `nm' on the resulting object file. */
5356 decl_linkage (tree decl
)
5358 /* This function doesn't attempt to calculate the linkage from first
5359 principles as given in [basic.link]. Instead, it makes use of
5360 the fact that we have already set TREE_PUBLIC appropriately, and
5361 then handles a few special cases. Ideally, we would calculate
5362 linkage first, and then transform that into a concrete
5365 /* Things that don't have names have no linkage. */
5366 if (!DECL_NAME (decl
))
5369 /* Fields have no linkage. */
5370 if (TREE_CODE (decl
) == FIELD_DECL
)
5373 /* Things in local scope do not have linkage. */
5374 if (decl_function_context (decl
))
5377 /* Things that are TREE_PUBLIC have external linkage. */
5378 if (TREE_PUBLIC (decl
))
5381 /* maybe_thunk_body clears TREE_PUBLIC on the maybe-in-charge 'tor variants,
5382 check one of the "clones" for the real linkage. */
5383 if (DECL_MAYBE_IN_CHARGE_CDTOR_P (decl
)
5384 && DECL_CHAIN (decl
)
5385 && DECL_CLONED_FUNCTION_P (DECL_CHAIN (decl
)))
5386 return decl_linkage (DECL_CHAIN (decl
));
5388 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
5391 /* Linkage of a CONST_DECL depends on the linkage of the enumeration
5393 if (TREE_CODE (decl
) == CONST_DECL
)
5394 return decl_linkage (TYPE_NAME (DECL_CONTEXT (decl
)));
5396 /* Members of the anonymous namespace also have TREE_PUBLIC unset, but
5397 are considered to have external linkage for language purposes, as do
5398 template instantiations on targets without weak symbols. DECLs really
5399 meant to have internal linkage have DECL_THIS_STATIC set. */
5400 if (TREE_CODE (decl
) == TYPE_DECL
)
5402 if (VAR_OR_FUNCTION_DECL_P (decl
))
5404 if (!DECL_THIS_STATIC (decl
))
5407 /* Static data members and static member functions from classes
5408 in anonymous namespace also don't have TREE_PUBLIC set. */
5409 if (DECL_CLASS_CONTEXT (decl
))
5413 /* Everything else has internal linkage. */
5417 /* Returns the storage duration of the object or reference associated with
5418 the indicated DECL, which should be a VAR_DECL or PARM_DECL. */
5421 decl_storage_duration (tree decl
)
5423 if (TREE_CODE (decl
) == PARM_DECL
)
5425 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5427 gcc_assert (VAR_P (decl
));
5428 if (!TREE_STATIC (decl
)
5429 && !DECL_EXTERNAL (decl
))
5431 if (CP_DECL_THREAD_LOCAL_P (decl
))
5436 /* EXP is an expression that we want to pre-evaluate. Returns (in
5437 *INITP) an expression that will perform the pre-evaluation. The
5438 value returned by this function is a side-effect free expression
5439 equivalent to the pre-evaluated expression. Callers must ensure
5440 that *INITP is evaluated before EXP. */
5443 stabilize_expr (tree exp
, tree
* initp
)
5447 if (!TREE_SIDE_EFFECTS (exp
))
5448 init_expr
= NULL_TREE
;
5449 else if (VOID_TYPE_P (TREE_TYPE (exp
)))
5454 /* There are no expressions with REFERENCE_TYPE, but there can be call
5455 arguments with such a type; just treat it as a pointer. */
5456 else if (TYPE_REF_P (TREE_TYPE (exp
))
5457 || SCALAR_TYPE_P (TREE_TYPE (exp
))
5458 || !glvalue_p (exp
))
5460 init_expr
= get_target_expr (exp
);
5461 exp
= TARGET_EXPR_SLOT (init_expr
);
5462 if (CLASS_TYPE_P (TREE_TYPE (exp
)))
5469 bool xval
= !lvalue_p (exp
);
5470 exp
= cp_build_addr_expr (exp
, tf_warning_or_error
);
5471 init_expr
= get_target_expr (exp
);
5472 exp
= TARGET_EXPR_SLOT (init_expr
);
5473 exp
= cp_build_fold_indirect_ref (exp
);
5479 gcc_assert (!TREE_SIDE_EFFECTS (exp
));
5483 /* Add NEW_EXPR, an expression whose value we don't care about, after the
5484 similar expression ORIG. */
5487 add_stmt_to_compound (tree orig
, tree new_expr
)
5489 if (!new_expr
|| !TREE_SIDE_EFFECTS (new_expr
))
5491 if (!orig
|| !TREE_SIDE_EFFECTS (orig
))
5493 return build2 (COMPOUND_EXPR
, void_type_node
, orig
, new_expr
);
5496 /* Like stabilize_expr, but for a call whose arguments we want to
5497 pre-evaluate. CALL is modified in place to use the pre-evaluated
5498 arguments, while, upon return, *INITP contains an expression to
5499 compute the arguments. */
5502 stabilize_call (tree call
, tree
*initp
)
5504 tree inits
= NULL_TREE
;
5506 int nargs
= call_expr_nargs (call
);
5508 if (call
== error_mark_node
|| processing_template_decl
)
5514 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
5516 for (i
= 0; i
< nargs
; i
++)
5519 CALL_EXPR_ARG (call
, i
) =
5520 stabilize_expr (CALL_EXPR_ARG (call
, i
), &init
);
5521 inits
= add_stmt_to_compound (inits
, init
);
5527 /* Like stabilize_expr, but for an AGGR_INIT_EXPR whose arguments we want
5528 to pre-evaluate. CALL is modified in place to use the pre-evaluated
5529 arguments, while, upon return, *INITP contains an expression to
5530 compute the arguments. */
5533 stabilize_aggr_init (tree call
, tree
*initp
)
5535 tree inits
= NULL_TREE
;
5537 int nargs
= aggr_init_expr_nargs (call
);
5539 if (call
== error_mark_node
)
5542 gcc_assert (TREE_CODE (call
) == AGGR_INIT_EXPR
);
5544 for (i
= 0; i
< nargs
; i
++)
5547 AGGR_INIT_EXPR_ARG (call
, i
) =
5548 stabilize_expr (AGGR_INIT_EXPR_ARG (call
, i
), &init
);
5549 inits
= add_stmt_to_compound (inits
, init
);
5555 /* Like stabilize_expr, but for an initialization.
5557 If the initialization is for an object of class type, this function
5558 takes care not to introduce additional temporaries.
5560 Returns TRUE iff the expression was successfully pre-evaluated,
5561 i.e., if INIT is now side-effect free, except for, possibly, a
5562 single call to a constructor. */
5565 stabilize_init (tree init
, tree
*initp
)
5571 if (t
== error_mark_node
|| processing_template_decl
)
5574 if (TREE_CODE (t
) == INIT_EXPR
)
5575 t
= TREE_OPERAND (t
, 1);
5576 if (TREE_CODE (t
) == TARGET_EXPR
)
5577 t
= TARGET_EXPR_INITIAL (t
);
5579 /* If the RHS can be stabilized without breaking copy elision, stabilize
5580 it. We specifically don't stabilize class prvalues here because that
5581 would mean an extra copy, but they might be stabilized below. */
5582 if (TREE_CODE (init
) == INIT_EXPR
5583 && TREE_CODE (t
) != CONSTRUCTOR
5584 && TREE_CODE (t
) != AGGR_INIT_EXPR
5585 && (SCALAR_TYPE_P (TREE_TYPE (t
))
5588 TREE_OPERAND (init
, 1) = stabilize_expr (t
, initp
);
5592 if (TREE_CODE (t
) == COMPOUND_EXPR
5593 && TREE_CODE (init
) == INIT_EXPR
)
5595 tree last
= expr_last (t
);
5596 /* Handle stabilizing the EMPTY_CLASS_EXPR pattern. */
5597 if (!TREE_SIDE_EFFECTS (last
))
5600 TREE_OPERAND (init
, 1) = last
;
5605 if (TREE_CODE (t
) == CONSTRUCTOR
)
5607 /* Aggregate initialization: stabilize each of the field
5610 constructor_elt
*ce
;
5612 vec
<constructor_elt
, va_gc
> *v
= CONSTRUCTOR_ELTS (t
);
5613 for (i
= 0; vec_safe_iterate (v
, i
, &ce
); ++i
)
5615 tree type
= TREE_TYPE (ce
->value
);
5617 if (TYPE_REF_P (type
)
5618 || SCALAR_TYPE_P (type
))
5619 ce
->value
= stabilize_expr (ce
->value
, &subinit
);
5620 else if (!stabilize_init (ce
->value
, &subinit
))
5622 *initp
= add_stmt_to_compound (*initp
, subinit
);
5627 if (TREE_CODE (t
) == CALL_EXPR
)
5629 stabilize_call (t
, initp
);
5633 if (TREE_CODE (t
) == AGGR_INIT_EXPR
)
5635 stabilize_aggr_init (t
, initp
);
5639 /* The initialization is being performed via a bitwise copy -- and
5640 the item copied may have side effects. */
5641 return !TREE_SIDE_EFFECTS (init
);
5644 /* Returns true if a cast to TYPE may appear in an integral constant
5648 cast_valid_in_integral_constant_expression_p (tree type
)
5650 return (INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
5651 || cxx_dialect
>= cxx11
5652 || dependent_type_p (type
)
5653 || type
== error_mark_node
);
5656 /* Return true if we need to fix linkage information of DECL. */
5659 cp_fix_function_decl_p (tree decl
)
5661 /* Skip if DECL is not externally visible. */
5662 if (!TREE_PUBLIC (decl
))
5665 /* We need to fix DECL if it a appears to be exported but with no
5666 function body. Thunks do not have CFGs and we may need to
5667 handle them specially later. */
5668 if (!gimple_has_body_p (decl
)
5669 && !DECL_THUNK_P (decl
)
5670 && !DECL_EXTERNAL (decl
))
5672 struct cgraph_node
*node
= cgraph_node::get (decl
);
5674 /* Don't fix same_body aliases. Although they don't have their own
5675 CFG, they share it with what they alias to. */
5676 if (!node
|| !node
->alias
5677 || !vec_safe_length (node
->ref_list
.references
))
5684 /* Clean the C++ specific parts of the tree T. */
5687 cp_free_lang_data (tree t
)
5689 if (FUNC_OR_METHOD_TYPE_P (t
))
5691 /* Default args are not interesting anymore. */
5692 tree argtypes
= TYPE_ARG_TYPES (t
);
5695 TREE_PURPOSE (argtypes
) = 0;
5696 argtypes
= TREE_CHAIN (argtypes
);
5699 else if (TREE_CODE (t
) == FUNCTION_DECL
5700 && cp_fix_function_decl_p (t
))
5702 /* If T is used in this translation unit at all, the definition
5703 must exist somewhere else since we have decided to not emit it
5704 in this TU. So make it an external reference. */
5705 DECL_EXTERNAL (t
) = 1;
5706 TREE_STATIC (t
) = 0;
5708 if (TREE_CODE (t
) == FUNCTION_DECL
)
5709 discard_operator_bindings (t
);
5710 if (TREE_CODE (t
) == NAMESPACE_DECL
)
5711 /* We do not need the leftover chaining of namespaces from the
5713 DECL_CHAIN (t
) = NULL_TREE
;
5716 /* Stub for c-common. Please keep in sync with c-decl.c.
5717 FIXME: If address space support is target specific, then this
5718 should be a C target hook. But currently this is not possible,
5719 because this function is called via REGISTER_TARGET_PRAGMAS. */
5721 c_register_addr_space (const char * /*word*/, addr_space_t
/*as*/)
5725 /* Return the number of operands in T that we care about for things like
5729 cp_tree_operand_length (const_tree t
)
5731 enum tree_code code
= TREE_CODE (t
);
5733 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
5734 return VL_EXP_OPERAND_LENGTH (t
);
5736 return cp_tree_code_length (code
);
5739 /* Like cp_tree_operand_length, but takes a tree_code CODE. */
5742 cp_tree_code_length (enum tree_code code
)
5744 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
5748 case PREINCREMENT_EXPR
:
5749 case PREDECREMENT_EXPR
:
5750 case POSTINCREMENT_EXPR
:
5751 case POSTDECREMENT_EXPR
:
5757 case EXPR_PACK_EXPANSION
:
5761 return TREE_CODE_LENGTH (code
);
5765 /* Like EXPR_LOCATION, but also handle some tcc_exceptional that have
5769 cp_expr_location (const_tree t_
)
5771 tree t
= CONST_CAST_TREE (t_
);
5773 return UNKNOWN_LOCATION
;
5774 switch (TREE_CODE (t
))
5777 return LAMBDA_EXPR_LOCATION (t
);
5779 return STATIC_ASSERT_SOURCE_LOCATION (t
);
5781 return TRAIT_EXPR_LOCATION (t
);
5783 return EXPR_LOCATION (t
);
5787 /* Implement -Wzero_as_null_pointer_constant. Return true if the
5788 conditions for the warning hold, false otherwise. */
5790 maybe_warn_zero_as_null_pointer_constant (tree expr
, location_t loc
)
5792 if (c_inhibit_evaluation_warnings
== 0
5793 && !null_node_p (expr
) && !NULLPTR_TYPE_P (TREE_TYPE (expr
)))
5795 warning_at (loc
, OPT_Wzero_as_null_pointer_constant
,
5796 "zero as null pointer constant");
5802 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
5803 /* Complain that some language-specific thing hanging off a tree
5804 node has been accessed improperly. */
5807 lang_check_failed (const char* file
, int line
, const char* function
)
5809 internal_error ("%<lang_*%> check: failed in %s, at %s:%d",
5810 function
, trim_filename (file
), line
);
5812 #endif /* ENABLE_TREE_CHECKING */
5816 namespace selftest
{
5818 /* Verify that lvalue_kind () works, for various expressions,
5819 and that location wrappers don't affect the results. */
5824 location_t loc
= BUILTINS_LOCATION
;
5826 /* Verify constants and parameters, without and with
5827 location wrappers. */
5828 tree int_cst
= build_int_cst (integer_type_node
, 42);
5829 ASSERT_EQ (clk_none
, lvalue_kind (int_cst
));
5831 tree wrapped_int_cst
= maybe_wrap_with_location (int_cst
, loc
);
5832 ASSERT_TRUE (location_wrapper_p (wrapped_int_cst
));
5833 ASSERT_EQ (clk_none
, lvalue_kind (wrapped_int_cst
));
5835 tree string_lit
= build_string (4, "foo");
5836 TREE_TYPE (string_lit
) = char_array_type_node
;
5837 string_lit
= fix_string_type (string_lit
);
5838 ASSERT_EQ (clk_ordinary
, lvalue_kind (string_lit
));
5840 tree wrapped_string_lit
= maybe_wrap_with_location (string_lit
, loc
);
5841 ASSERT_TRUE (location_wrapper_p (wrapped_string_lit
));
5842 ASSERT_EQ (clk_ordinary
, lvalue_kind (wrapped_string_lit
));
5844 tree parm
= build_decl (UNKNOWN_LOCATION
, PARM_DECL
,
5845 get_identifier ("some_parm"),
5847 ASSERT_EQ (clk_ordinary
, lvalue_kind (parm
));
5849 tree wrapped_parm
= maybe_wrap_with_location (parm
, loc
);
5850 ASSERT_TRUE (location_wrapper_p (wrapped_parm
));
5851 ASSERT_EQ (clk_ordinary
, lvalue_kind (wrapped_parm
));
5853 /* Verify that lvalue_kind of std::move on a parm isn't
5854 affected by location wrappers. */
5855 tree rvalue_ref_of_parm
= move (parm
);
5856 ASSERT_EQ (clk_rvalueref
, lvalue_kind (rvalue_ref_of_parm
));
5857 tree rvalue_ref_of_wrapped_parm
= move (wrapped_parm
);
5858 ASSERT_EQ (clk_rvalueref
, lvalue_kind (rvalue_ref_of_wrapped_parm
));
5860 /* Verify lvalue_p. */
5861 ASSERT_FALSE (lvalue_p (int_cst
));
5862 ASSERT_FALSE (lvalue_p (wrapped_int_cst
));
5863 ASSERT_TRUE (lvalue_p (parm
));
5864 ASSERT_TRUE (lvalue_p (wrapped_parm
));
5865 ASSERT_FALSE (lvalue_p (rvalue_ref_of_parm
));
5866 ASSERT_FALSE (lvalue_p (rvalue_ref_of_wrapped_parm
));
5869 /* Run all of the selftests within this file. */
5874 test_lvalue_kind ();
5877 } // namespace selftest
5879 #endif /* #if CHECKING_P */
5882 #include "gt-cp-tree.h"