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_OR_HIDDEN
2241 is > 0, if FN is via a using declaration. USING_OR_HIDDEN is < 0,
2242 if FN is hidden. (A decl cannot be both using and hidden.) We
2243 keep the hidden decls first, but remaining ones are unordered. */
2246 ovl_insert (tree fn
, tree maybe_ovl
, int using_or_hidden
)
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 if (maybe_ovl
|| using_or_hidden
|| TREE_CODE (fn
) == TEMPLATE_DECL
)
2262 maybe_ovl
= ovl_make (fn
, maybe_ovl
);
2264 if (using_or_hidden
< 0)
2265 OVL_HIDDEN_P (maybe_ovl
) = true;
2266 if (using_or_hidden
> 0)
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
)
2288 while (ovl
&& TREE_CODE (ovl
) == OVERLOAD
&& OVL_HIDDEN_P (ovl
))
2289 ovl
= OVL_CHAIN (ovl
);
2294 /* NODE is an OVL_HIDDEN_P node that is now revealed. */
2297 ovl_iterator::reveal_node (tree overload
, tree node
)
2299 /* We cannot have returned NODE as part of a lookup overload, so we
2300 don't have to worry about preserving that. */
2302 OVL_HIDDEN_P (node
) = false;
2303 if (tree chain
= OVL_CHAIN (node
))
2304 if (TREE_CODE (chain
) == OVERLOAD
)
2306 if (OVL_HIDDEN_P (chain
))
2308 /* The node needs moving, and the simplest way is to remove it
2310 overload
= remove_node (overload
, node
);
2311 overload
= ovl_insert (OVL_FUNCTION (node
), overload
);
2313 else if (OVL_DEDUP_P (chain
))
2314 OVL_DEDUP_P (node
) = true;
2319 /* NODE is on the overloads of OVL. Remove it.
2320 The removed node is unaltered and may continue to be iterated
2321 from (i.e. it is safe to remove a node from an overload one is
2322 currently iterating over). */
2325 ovl_iterator::remove_node (tree overload
, tree node
)
2327 tree
*slot
= &overload
;
2328 while (*slot
!= node
)
2331 gcc_checking_assert (!OVL_LOOKUP_P (probe
));
2333 slot
= &OVL_CHAIN (probe
);
2336 /* Stitch out NODE. We don't have to worry about now making a
2337 singleton overload (and consequently maybe setting its type),
2338 because all uses of this function will be followed by inserting a
2339 new node that must follow the place we've cut this out from. */
2340 if (TREE_CODE (node
) != OVERLOAD
)
2341 /* Cloned inherited ctors don't mark themselves as via_using. */
2344 *slot
= OVL_CHAIN (node
);
2349 /* Mark or unmark a lookup set. */
2352 lookup_mark (tree ovl
, bool val
)
2354 for (lkp_iterator
iter (ovl
); iter
; ++iter
)
2356 gcc_checking_assert (LOOKUP_SEEN_P (*iter
) != val
);
2357 LOOKUP_SEEN_P (*iter
) = val
;
2361 /* Add a set of new FNS into a lookup. */
2364 lookup_add (tree fns
, tree lookup
)
2366 if (fns
== error_mark_node
|| lookup
== error_mark_node
)
2367 return error_mark_node
;
2369 if (lookup
|| TREE_CODE (fns
) == TEMPLATE_DECL
)
2371 lookup
= ovl_make (fns
, lookup
);
2372 OVL_LOOKUP_P (lookup
) = true;
2380 /* FNS is a new overload set, add them to LOOKUP, if they are not
2381 already present there. */
2384 lookup_maybe_add (tree fns
, tree lookup
, bool deduping
)
2387 for (tree next
, probe
= fns
; probe
; probe
= next
)
2392 if (TREE_CODE (probe
) == OVERLOAD
)
2394 fn
= OVL_FUNCTION (probe
);
2395 next
= OVL_CHAIN (probe
);
2398 if (!LOOKUP_SEEN_P (fn
))
2399 LOOKUP_SEEN_P (fn
) = true;
2402 /* This function was already seen. Insert all the
2403 predecessors onto the lookup. */
2404 for (; fns
!= probe
; fns
= OVL_CHAIN (fns
))
2406 lookup
= lookup_add (OVL_FUNCTION (fns
), lookup
);
2407 /* Propagate OVL_USING, but OVL_HIDDEN &
2408 OVL_DEDUP_P don't matter. */
2409 if (OVL_USING_P (fns
))
2410 OVL_USING_P (lookup
) = true;
2413 /* And now skip this function. */
2419 /* We ended in a set of new functions. Add them all in one go. */
2420 lookup
= lookup_add (fns
, lookup
);
2425 /* Returns nonzero if X is an expression for a (possibly overloaded)
2426 function. If "f" is a function or function template, "f", "c->f",
2427 "c.f", "C::f", and "f<int>" will all be considered possibly
2428 overloaded functions. Returns 2 if the function is actually
2429 overloaded, i.e., if it is impossible to know the type of the
2430 function without performing overload resolution. */
2433 is_overloaded_fn (tree x
)
2435 STRIP_ANY_LOCATION_WRAPPER (x
);
2437 /* A baselink is also considered an overloaded function. */
2438 if (TREE_CODE (x
) == OFFSET_REF
2439 || TREE_CODE (x
) == COMPONENT_REF
)
2440 x
= TREE_OPERAND (x
, 1);
2441 x
= MAYBE_BASELINK_FUNCTIONS (x
);
2442 if (TREE_CODE (x
) == TEMPLATE_ID_EXPR
)
2443 x
= TREE_OPERAND (x
, 0);
2445 if (DECL_FUNCTION_TEMPLATE_P (OVL_FIRST (x
))
2446 || (TREE_CODE (x
) == OVERLOAD
&& !OVL_SINGLE_P (x
)))
2452 /* X is the CALL_EXPR_FN of a CALL_EXPR. If X represents a dependent name
2453 (14.6.2), return the IDENTIFIER_NODE for that name. Otherwise, return
2457 dependent_name (tree x
)
2459 /* FIXME a dependent name must be unqualified, but this function doesn't
2460 distinguish between qualified and unqualified identifiers. */
2461 if (identifier_p (x
))
2463 if (TREE_CODE (x
) == TEMPLATE_ID_EXPR
)
2464 x
= TREE_OPERAND (x
, 0);
2466 return OVL_NAME (x
);
2470 /* Returns true iff X is an expression for an overloaded function
2471 whose type cannot be known without performing overload
2475 really_overloaded_fn (tree x
)
2477 return is_overloaded_fn (x
) == 2;
2480 /* Get the overload set FROM refers to. Returns NULL if it's not an
2484 maybe_get_fns (tree from
)
2486 STRIP_ANY_LOCATION_WRAPPER (from
);
2488 /* A baselink is also considered an overloaded function. */
2489 if (TREE_CODE (from
) == OFFSET_REF
2490 || TREE_CODE (from
) == COMPONENT_REF
)
2491 from
= TREE_OPERAND (from
, 1);
2492 if (BASELINK_P (from
))
2493 from
= BASELINK_FUNCTIONS (from
);
2494 if (TREE_CODE (from
) == TEMPLATE_ID_EXPR
)
2495 from
= TREE_OPERAND (from
, 0);
2503 /* FROM refers to an overload set. Return that set (or die). */
2508 tree res
= maybe_get_fns (from
);
2514 /* Return the first function of the overload set FROM refers to. */
2517 get_first_fn (tree from
)
2519 return OVL_FIRST (get_fns (from
));
2522 /* Return the scope where the overloaded functions OVL were found. */
2525 ovl_scope (tree ovl
)
2527 if (TREE_CODE (ovl
) == OFFSET_REF
2528 || TREE_CODE (ovl
) == COMPONENT_REF
)
2529 ovl
= TREE_OPERAND (ovl
, 1);
2530 if (TREE_CODE (ovl
) == BASELINK
)
2531 return BINFO_TYPE (BASELINK_BINFO (ovl
));
2532 if (TREE_CODE (ovl
) == TEMPLATE_ID_EXPR
)
2533 ovl
= TREE_OPERAND (ovl
, 0);
2534 /* Skip using-declarations. */
2535 lkp_iterator
iter (ovl
);
2538 while (iter
.using_p () && ++iter
);
2540 return CP_DECL_CONTEXT (ovl
);
2543 #define PRINT_RING_SIZE 4
2546 cxx_printable_name_internal (tree decl
, int v
, bool translate
)
2548 static unsigned int uid_ring
[PRINT_RING_SIZE
];
2549 static char *print_ring
[PRINT_RING_SIZE
];
2550 static bool trans_ring
[PRINT_RING_SIZE
];
2551 static int ring_counter
;
2554 /* Only cache functions. */
2556 || TREE_CODE (decl
) != FUNCTION_DECL
2557 || DECL_LANG_SPECIFIC (decl
) == 0)
2558 return lang_decl_name (decl
, v
, translate
);
2560 /* See if this print name is lying around. */
2561 for (i
= 0; i
< PRINT_RING_SIZE
; i
++)
2562 if (uid_ring
[i
] == DECL_UID (decl
) && translate
== trans_ring
[i
])
2563 /* yes, so return it. */
2564 return print_ring
[i
];
2566 if (++ring_counter
== PRINT_RING_SIZE
)
2569 if (current_function_decl
!= NULL_TREE
)
2571 /* There may be both translated and untranslated versions of the
2573 for (i
= 0; i
< 2; i
++)
2575 if (uid_ring
[ring_counter
] == DECL_UID (current_function_decl
))
2577 if (ring_counter
== PRINT_RING_SIZE
)
2580 gcc_assert (uid_ring
[ring_counter
] != DECL_UID (current_function_decl
));
2583 free (print_ring
[ring_counter
]);
2585 print_ring
[ring_counter
] = xstrdup (lang_decl_name (decl
, v
, translate
));
2586 uid_ring
[ring_counter
] = DECL_UID (decl
);
2587 trans_ring
[ring_counter
] = translate
;
2588 return print_ring
[ring_counter
];
2592 cxx_printable_name (tree decl
, int v
)
2594 return cxx_printable_name_internal (decl
, v
, false);
2598 cxx_printable_name_translate (tree decl
, int v
)
2600 return cxx_printable_name_internal (decl
, v
, true);
2603 /* Return the canonical version of exception-specification RAISES for a C++17
2604 function type, for use in type comparison and building TYPE_CANONICAL. */
2607 canonical_eh_spec (tree raises
)
2609 if (raises
== NULL_TREE
)
2611 else if (DEFERRED_NOEXCEPT_SPEC_P (raises
)
2612 || UNPARSED_NOEXCEPT_SPEC_P (raises
)
2613 || uses_template_parms (raises
)
2614 || uses_template_parms (TREE_PURPOSE (raises
)))
2615 /* Keep a dependent or deferred exception specification. */
2617 else if (nothrow_spec_p (raises
))
2618 /* throw() -> noexcept. */
2619 return noexcept_true_spec
;
2621 /* For C++17 type matching, anything else -> nothing. */
2626 build_cp_fntype_variant (tree type
, cp_ref_qualifier rqual
,
2627 tree raises
, bool late
)
2629 cp_cv_quals type_quals
= TYPE_QUALS (type
);
2631 if (cp_check_qualified_type (type
, type
, type_quals
, rqual
, raises
, late
))
2634 tree v
= TYPE_MAIN_VARIANT (type
);
2635 for (; v
; v
= TYPE_NEXT_VARIANT (v
))
2636 if (cp_check_qualified_type (v
, type
, type_quals
, rqual
, raises
, late
))
2639 /* Need to build a new variant. */
2640 v
= build_variant_type_copy (type
);
2641 TYPE_RAISES_EXCEPTIONS (v
) = raises
;
2642 TYPE_HAS_LATE_RETURN_TYPE (v
) = late
;
2645 case REF_QUAL_RVALUE
:
2646 FUNCTION_RVALUE_QUALIFIED (v
) = 1;
2647 FUNCTION_REF_QUALIFIED (v
) = 1;
2649 case REF_QUAL_LVALUE
:
2650 FUNCTION_RVALUE_QUALIFIED (v
) = 0;
2651 FUNCTION_REF_QUALIFIED (v
) = 1;
2654 FUNCTION_REF_QUALIFIED (v
) = 0;
2658 /* Canonicalize the exception specification. */
2659 tree cr
= flag_noexcept_type
? canonical_eh_spec (raises
) : NULL_TREE
;
2661 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
2662 /* Propagate structural equality. */
2663 SET_TYPE_STRUCTURAL_EQUALITY (v
);
2664 else if (TYPE_CANONICAL (type
) != type
|| cr
!= raises
|| late
)
2665 /* Build the underlying canonical type, since it is different
2667 TYPE_CANONICAL (v
) = build_cp_fntype_variant (TYPE_CANONICAL (type
),
2670 /* T is its own canonical type. */
2671 TYPE_CANONICAL (v
) = v
;
2676 /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions
2677 listed in RAISES. */
2680 build_exception_variant (tree type
, tree raises
)
2682 cp_ref_qualifier rqual
= type_memfn_rqual (type
);
2683 bool late
= TYPE_HAS_LATE_RETURN_TYPE (type
);
2684 return build_cp_fntype_variant (type
, rqual
, raises
, late
);
2687 /* Given a TEMPLATE_TEMPLATE_PARM node T, create a new
2688 BOUND_TEMPLATE_TEMPLATE_PARM bound with NEWARGS as its template
2692 bind_template_template_parm (tree t
, tree newargs
)
2694 tree decl
= TYPE_NAME (t
);
2697 t2
= cxx_make_type (BOUND_TEMPLATE_TEMPLATE_PARM
);
2698 decl
= build_decl (input_location
,
2699 TYPE_DECL
, DECL_NAME (decl
), NULL_TREE
);
2701 /* These nodes have to be created to reflect new TYPE_DECL and template
2703 TEMPLATE_TYPE_PARM_INDEX (t2
) = copy_node (TEMPLATE_TYPE_PARM_INDEX (t
));
2704 TEMPLATE_PARM_DECL (TEMPLATE_TYPE_PARM_INDEX (t2
)) = decl
;
2705 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2
)
2706 = build_template_info (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t
), newargs
);
2708 TREE_TYPE (decl
) = t2
;
2709 TYPE_NAME (t2
) = decl
;
2710 TYPE_STUB_DECL (t2
) = decl
;
2712 SET_TYPE_STRUCTURAL_EQUALITY (t2
);
2717 /* Called from count_trees via walk_tree. */
2720 count_trees_r (tree
*tp
, int *walk_subtrees
, void *data
)
2730 /* Debugging function for measuring the rough complexity of a tree
2734 count_trees (tree t
)
2737 cp_walk_tree_without_duplicates (&t
, count_trees_r
, &n_trees
);
2741 /* Called from verify_stmt_tree via walk_tree. */
2744 verify_stmt_tree_r (tree
* tp
, int * /*walk_subtrees*/, void* data
)
2747 hash_table
<nofree_ptr_hash
<tree_node
> > *statements
2748 = static_cast <hash_table
<nofree_ptr_hash
<tree_node
> > *> (data
);
2751 if (!STATEMENT_CODE_P (TREE_CODE (t
)))
2754 /* If this statement is already present in the hash table, then
2755 there is a circularity in the statement tree. */
2756 gcc_assert (!statements
->find (t
));
2758 slot
= statements
->find_slot (t
, INSERT
);
2764 /* Debugging function to check that the statement T has not been
2765 corrupted. For now, this function simply checks that T contains no
2769 verify_stmt_tree (tree t
)
2771 hash_table
<nofree_ptr_hash
<tree_node
> > statements (37);
2772 cp_walk_tree (&t
, verify_stmt_tree_r
, &statements
, NULL
);
2775 /* Check if the type T depends on a type with no linkage and if so,
2776 return it. If RELAXED_P then do not consider a class type declared
2777 within a vague-linkage function to have no linkage. Remember:
2778 no-linkage is not the same as internal-linkage*/
2781 no_linkage_check (tree t
, bool relaxed_p
)
2785 /* Lambda types that don't have mangling scope have no linkage. We
2786 check CLASSTYPE_LAMBDA_EXPR for error_mark_node because
2787 when we get here from pushtag none of the lambda information is
2788 set up yet, so we want to assume that the lambda has linkage and
2789 fix it up later if not. We need to check this even in templates so
2790 that we properly handle a lambda-expression in the signature. */
2791 if (LAMBDA_TYPE_P (t
)
2792 && CLASSTYPE_LAMBDA_EXPR (t
) != error_mark_node
)
2794 tree extra
= LAMBDA_TYPE_EXTRA_SCOPE (t
);
2799 /* Otherwise there's no point in checking linkage on template functions; we
2800 can't know their complete types. */
2801 if (processing_template_decl
)
2804 switch (TREE_CODE (t
))
2807 if (TYPE_PTRMEMFUNC_P (t
))
2811 if (!CLASS_TYPE_P (t
))
2815 /* Only treat unnamed types as having no linkage if they're at
2816 namespace scope. This is core issue 966. */
2817 if (TYPE_UNNAMED_P (t
) && TYPE_NAMESPACE_SCOPE_P (t
))
2820 for (r
= CP_TYPE_CONTEXT (t
); ; )
2822 /* If we're a nested type of a !TREE_PUBLIC class, we might not
2823 have linkage, or we might just be in an anonymous namespace.
2824 If we're in a TREE_PUBLIC class, we have linkage. */
2825 if (TYPE_P (r
) && !TREE_PUBLIC (TYPE_NAME (r
)))
2826 return no_linkage_check (TYPE_CONTEXT (t
), relaxed_p
);
2827 else if (TREE_CODE (r
) == FUNCTION_DECL
)
2829 if (!relaxed_p
|| !vague_linkage_p (r
))
2832 r
= CP_DECL_CONTEXT (r
);
2842 case REFERENCE_TYPE
:
2844 return no_linkage_check (TREE_TYPE (t
), relaxed_p
);
2848 r
= no_linkage_check (TYPE_PTRMEM_POINTED_TO_TYPE (t
),
2852 return no_linkage_check (TYPE_PTRMEM_CLASS_TYPE (t
), relaxed_p
);
2857 tree parm
= TYPE_ARG_TYPES (t
);
2858 if (TREE_CODE (t
) == METHOD_TYPE
)
2859 /* The 'this' pointer isn't interesting; a method has the same
2860 linkage (or lack thereof) as its enclosing class. */
2861 parm
= TREE_CHAIN (parm
);
2863 parm
&& parm
!= void_list_node
;
2864 parm
= TREE_CHAIN (parm
))
2866 r
= no_linkage_check (TREE_VALUE (parm
), relaxed_p
);
2870 return no_linkage_check (TREE_TYPE (t
), relaxed_p
);
2878 extern int depth_reached
;
2881 cxx_print_statistics (void)
2883 print_template_statistics ();
2884 if (GATHER_STATISTICS
)
2885 fprintf (stderr
, "maximum template instantiation depth reached: %d\n",
2889 /* Return, as an INTEGER_CST node, the number of elements for TYPE
2890 (which is an ARRAY_TYPE). This counts only elements of the top
2894 array_type_nelts_top (tree type
)
2896 return fold_build2_loc (input_location
,
2897 PLUS_EXPR
, sizetype
,
2898 array_type_nelts (type
),
2902 /* Return, as an INTEGER_CST node, the number of elements for TYPE
2903 (which is an ARRAY_TYPE). This one is a recursive count of all
2904 ARRAY_TYPEs that are clumped together. */
2907 array_type_nelts_total (tree type
)
2909 tree sz
= array_type_nelts_top (type
);
2910 type
= TREE_TYPE (type
);
2911 while (TREE_CODE (type
) == ARRAY_TYPE
)
2913 tree n
= array_type_nelts_top (type
);
2914 sz
= fold_build2_loc (input_location
,
2915 MULT_EXPR
, sizetype
, sz
, n
);
2916 type
= TREE_TYPE (type
);
2923 splay_tree target_remap
;
2924 bool clear_location
;
2927 /* Called from break_out_target_exprs via mapcar. */
2930 bot_manip (tree
* tp
, int* walk_subtrees
, void* data_
)
2932 bot_data
&data
= *(bot_data
*)data_
;
2933 splay_tree target_remap
= data
.target_remap
;
2936 if (!TYPE_P (t
) && TREE_CONSTANT (t
) && !TREE_SIDE_EFFECTS (t
))
2938 /* There can't be any TARGET_EXPRs or their slot variables below this
2939 point. But we must make a copy, in case subsequent processing
2940 alters any part of it. For example, during gimplification a cast
2941 of the form (T) &X::f (where "f" is a member function) will lead
2942 to replacing the PTRMEM_CST for &X::f with a VAR_DECL. */
2944 *tp
= unshare_expr (t
);
2947 if (TREE_CODE (t
) == TARGET_EXPR
)
2951 if (TREE_CODE (TREE_OPERAND (t
, 1)) == AGGR_INIT_EXPR
)
2953 u
= build_cplus_new (TREE_TYPE (t
), TREE_OPERAND (t
, 1),
2954 tf_warning_or_error
);
2955 if (u
== error_mark_node
)
2957 if (AGGR_INIT_ZERO_FIRST (TREE_OPERAND (t
, 1)))
2958 AGGR_INIT_ZERO_FIRST (TREE_OPERAND (u
, 1)) = true;
2961 u
= build_target_expr_with_type (TREE_OPERAND (t
, 1), TREE_TYPE (t
),
2962 tf_warning_or_error
);
2964 TARGET_EXPR_IMPLICIT_P (u
) = TARGET_EXPR_IMPLICIT_P (t
);
2965 TARGET_EXPR_LIST_INIT_P (u
) = TARGET_EXPR_LIST_INIT_P (t
);
2966 TARGET_EXPR_DIRECT_INIT_P (u
) = TARGET_EXPR_DIRECT_INIT_P (t
);
2968 /* Map the old variable to the new one. */
2969 splay_tree_insert (target_remap
,
2970 (splay_tree_key
) TREE_OPERAND (t
, 0),
2971 (splay_tree_value
) TREE_OPERAND (u
, 0));
2973 TREE_OPERAND (u
, 1) = break_out_target_exprs (TREE_OPERAND (u
, 1),
2974 data
.clear_location
);
2975 if (TREE_OPERAND (u
, 1) == error_mark_node
)
2976 return error_mark_node
;
2978 /* Replace the old expression with the new version. */
2980 /* We don't have to go below this point; the recursive call to
2981 break_out_target_exprs will have handled anything below this
2986 if (TREE_CODE (*tp
) == SAVE_EXPR
)
2989 splay_tree_node n
= splay_tree_lookup (target_remap
,
2990 (splay_tree_key
) t
);
2993 *tp
= (tree
)n
->value
;
2998 copy_tree_r (tp
, walk_subtrees
, NULL
);
2999 splay_tree_insert (target_remap
,
3001 (splay_tree_value
)*tp
);
3002 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
3003 splay_tree_insert (target_remap
,
3004 (splay_tree_key
)*tp
,
3005 (splay_tree_value
)*tp
);
3010 /* Make a copy of this node. */
3011 t
= copy_tree_r (tp
, walk_subtrees
, NULL
);
3012 if (TREE_CODE (*tp
) == CALL_EXPR
|| TREE_CODE (*tp
) == AGGR_INIT_EXPR
)
3013 if (!processing_template_decl
)
3014 set_flags_from_callee (*tp
);
3015 if (data
.clear_location
&& EXPR_HAS_LOCATION (*tp
))
3016 SET_EXPR_LOCATION (*tp
, input_location
);
3020 /* Replace all remapped VAR_DECLs in T with their new equivalents.
3021 DATA is really a splay-tree mapping old variables to new
3025 bot_replace (tree
* t
, int* /*walk_subtrees*/, void* data_
)
3027 bot_data
&data
= *(bot_data
*)data_
;
3028 splay_tree target_remap
= data
.target_remap
;
3032 splay_tree_node n
= splay_tree_lookup (target_remap
,
3033 (splay_tree_key
) *t
);
3035 *t
= (tree
) n
->value
;
3037 else if (TREE_CODE (*t
) == PARM_DECL
3038 && DECL_NAME (*t
) == this_identifier
3039 && !DECL_CONTEXT (*t
))
3041 /* In an NSDMI we need to replace the 'this' parameter we used for
3042 parsing with the real one for this function. */
3043 *t
= current_class_ptr
;
3045 else if (TREE_CODE (*t
) == CONVERT_EXPR
3046 && CONVERT_EXPR_VBASE_PATH (*t
))
3048 /* In an NSDMI build_base_path defers building conversions to virtual
3049 bases, and we handle it here. */
3050 tree basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (*t
)));
3051 vec
<tree
, va_gc
> *vbases
= CLASSTYPE_VBASECLASSES (current_class_type
);
3053 FOR_EACH_VEC_SAFE_ELT (vbases
, i
, binfo
)
3054 if (BINFO_TYPE (binfo
) == basetype
)
3056 *t
= build_base_path (PLUS_EXPR
, TREE_OPERAND (*t
, 0), binfo
, true,
3057 tf_warning_or_error
);
3063 /* When we parse a default argument expression, we may create
3064 temporary variables via TARGET_EXPRs. When we actually use the
3065 default-argument expression, we make a copy of the expression
3066 and replace the temporaries with appropriate local versions.
3068 If CLEAR_LOCATION is true, override any EXPR_LOCATION with
3072 break_out_target_exprs (tree t
, bool clear_location
/* = false */)
3074 static int target_remap_count
;
3075 static splay_tree target_remap
;
3077 if (!target_remap_count
++)
3078 target_remap
= splay_tree_new (splay_tree_compare_pointers
,
3079 /*splay_tree_delete_key_fn=*/NULL
,
3080 /*splay_tree_delete_value_fn=*/NULL
);
3081 bot_data data
= { target_remap
, clear_location
};
3082 if (cp_walk_tree (&t
, bot_manip
, &data
, NULL
) == error_mark_node
)
3083 t
= error_mark_node
;
3084 cp_walk_tree (&t
, bot_replace
, &data
, NULL
);
3086 if (!--target_remap_count
)
3088 splay_tree_delete (target_remap
);
3089 target_remap
= NULL
;
3095 /* Build an expression for the subobject of OBJ at CONSTRUCTOR index INDEX,
3096 which we expect to have type TYPE. */
3099 build_ctor_subob_ref (tree index
, tree type
, tree obj
)
3101 if (index
== NULL_TREE
)
3102 /* Can't refer to a particular member of a vector. */
3104 else if (TREE_CODE (index
) == INTEGER_CST
)
3105 obj
= cp_build_array_ref (input_location
, obj
, index
, tf_none
);
3107 obj
= build_class_member_access_expr (obj
, index
, NULL_TREE
,
3108 /*reference*/false, tf_none
);
3111 tree objtype
= TREE_TYPE (obj
);
3112 if (TREE_CODE (objtype
) == ARRAY_TYPE
&& !TYPE_DOMAIN (objtype
))
3114 /* When the destination object refers to a flexible array member
3115 verify that it matches the type of the source object except
3116 for its domain and qualifiers. */
3117 gcc_assert (comptypes (TYPE_MAIN_VARIANT (type
),
3118 TYPE_MAIN_VARIANT (objtype
),
3119 COMPARE_REDECLARATION
));
3122 gcc_assert (same_type_ignoring_top_level_qualifiers_p (type
, objtype
));
3128 struct replace_placeholders_t
3130 tree obj
; /* The object to be substituted for a PLACEHOLDER_EXPR. */
3131 tree exp
; /* The outermost exp. */
3132 bool seen
; /* Whether we've encountered a PLACEHOLDER_EXPR. */
3133 hash_set
<tree
> *pset
; /* To avoid walking same trees multiple times. */
3136 /* Like substitute_placeholder_in_expr, but handle C++ tree codes and
3137 build up subexpressions as we go deeper. */
3140 replace_placeholders_r (tree
* t
, int* walk_subtrees
, void* data_
)
3142 replace_placeholders_t
*d
= static_cast<replace_placeholders_t
*>(data_
);
3145 if (TYPE_P (*t
) || TREE_CONSTANT (*t
))
3147 *walk_subtrees
= false;
3151 switch (TREE_CODE (*t
))
3153 case PLACEHOLDER_EXPR
:
3156 for (; !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (*t
),
3158 x
= TREE_OPERAND (x
, 0))
3159 gcc_assert (handled_component_p (x
));
3160 *t
= unshare_expr (x
);
3161 *walk_subtrees
= false;
3168 constructor_elt
*ce
;
3169 vec
<constructor_elt
,va_gc
> *v
= CONSTRUCTOR_ELTS (*t
);
3170 /* Don't walk into CONSTRUCTOR_PLACEHOLDER_BOUNDARY ctors
3171 other than the d->exp one, those have PLACEHOLDER_EXPRs
3172 related to another object. */
3173 if ((CONSTRUCTOR_PLACEHOLDER_BOUNDARY (*t
)
3175 || d
->pset
->add (*t
))
3177 *walk_subtrees
= false;
3180 for (unsigned i
= 0; vec_safe_iterate (v
, i
, &ce
); ++i
)
3182 tree
*valp
= &ce
->value
;
3183 tree type
= TREE_TYPE (*valp
);
3186 /* Elements with RANGE_EXPR index shouldn't have any
3187 placeholders in them. */
3188 if (ce
->index
&& TREE_CODE (ce
->index
) == RANGE_EXPR
)
3191 if (TREE_CODE (*valp
) == CONSTRUCTOR
3192 && AGGREGATE_TYPE_P (type
))
3194 /* If we're looking at the initializer for OBJ, then build
3195 a sub-object reference. If we're looking at an
3196 initializer for another object, just pass OBJ down. */
3197 if (same_type_ignoring_top_level_qualifiers_p
3198 (TREE_TYPE (*t
), TREE_TYPE (obj
)))
3199 subob
= build_ctor_subob_ref (ce
->index
, type
, obj
);
3200 if (TREE_CODE (*valp
) == TARGET_EXPR
)
3201 valp
= &TARGET_EXPR_INITIAL (*valp
);
3204 cp_walk_tree (valp
, replace_placeholders_r
, data_
, NULL
);
3207 *walk_subtrees
= false;
3212 if (d
->pset
->add (*t
))
3213 *walk_subtrees
= false;
3220 /* Replace PLACEHOLDER_EXPRs in EXP with object OBJ. SEEN_P is set if
3221 a PLACEHOLDER_EXPR has been encountered. */
3224 replace_placeholders (tree exp
, tree obj
, bool *seen_p
/*= NULL*/)
3226 /* This is only relevant for C++14. */
3227 if (cxx_dialect
< cxx14
)
3230 /* If the object isn't a (member of a) class, do nothing. */
3232 while (handled_component_p (op0
))
3233 op0
= TREE_OPERAND (op0
, 0);
3234 if (!CLASS_TYPE_P (strip_array_types (TREE_TYPE (op0
))))
3238 if (TREE_CODE (exp
) == TARGET_EXPR
)
3239 tp
= &TARGET_EXPR_INITIAL (exp
);
3240 hash_set
<tree
> pset
;
3241 replace_placeholders_t data
= { obj
, *tp
, false, &pset
};
3242 cp_walk_tree (tp
, replace_placeholders_r
, &data
, NULL
);
3244 *seen_p
= data
.seen
;
3248 /* Callback function for find_placeholders. */
3251 find_placeholders_r (tree
*t
, int *walk_subtrees
, void *)
3253 if (TYPE_P (*t
) || TREE_CONSTANT (*t
))
3255 *walk_subtrees
= false;
3259 switch (TREE_CODE (*t
))
3261 case PLACEHOLDER_EXPR
:
3265 if (CONSTRUCTOR_PLACEHOLDER_BOUNDARY (*t
))
3266 *walk_subtrees
= false;
3276 /* Return true if EXP contains a PLACEHOLDER_EXPR. Don't walk into
3277 ctors with CONSTRUCTOR_PLACEHOLDER_BOUNDARY flag set. */
3280 find_placeholders (tree exp
)
3282 /* This is only relevant for C++14. */
3283 if (cxx_dialect
< cxx14
)
3286 return cp_walk_tree_without_duplicates (&exp
, find_placeholders_r
, NULL
);
3289 /* Similar to `build_nt', but for template definitions of dependent
3293 build_min_nt_loc (location_t loc
, enum tree_code code
, ...)
3300 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3304 t
= make_node (code
);
3305 SET_EXPR_LOCATION (t
, loc
);
3306 length
= TREE_CODE_LENGTH (code
);
3308 for (i
= 0; i
< length
; i
++)
3309 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
3315 /* Similar to `build', but for template definitions. */
3318 build_min (enum tree_code code
, tree tt
, ...)
3325 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3329 t
= make_node (code
);
3330 length
= TREE_CODE_LENGTH (code
);
3333 for (i
= 0; i
< length
; i
++)
3335 tree x
= va_arg (p
, tree
);
3336 TREE_OPERAND (t
, i
) = x
;
3337 if (x
&& !TYPE_P (x
) && TREE_SIDE_EFFECTS (x
))
3338 TREE_SIDE_EFFECTS (t
) = 1;
3346 /* Similar to `build', but for template definitions of non-dependent
3347 expressions. NON_DEP is the non-dependent expression that has been
3351 build_min_non_dep (enum tree_code code
, tree non_dep
, ...)
3358 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3360 va_start (p
, non_dep
);
3362 if (REFERENCE_REF_P (non_dep
))
3363 non_dep
= TREE_OPERAND (non_dep
, 0);
3365 t
= make_node (code
);
3366 SET_EXPR_LOCATION (t
, cp_expr_loc_or_input_loc (non_dep
));
3367 length
= TREE_CODE_LENGTH (code
);
3368 TREE_TYPE (t
) = unlowered_expr_type (non_dep
);
3369 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (non_dep
);
3371 for (i
= 0; i
< length
; i
++)
3372 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
3374 if (code
== COMPOUND_EXPR
&& TREE_CODE (non_dep
) != COMPOUND_EXPR
)
3375 /* This should not be considered a COMPOUND_EXPR, because it
3376 resolves to an overload. */
3377 COMPOUND_EXPR_OVERLOADED (t
) = 1;
3380 return convert_from_reference (t
);
3383 /* Similar to build_min_nt, but call expressions */
3386 build_min_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
3391 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
3392 CALL_EXPR_FN (ret
) = fn
;
3393 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
3394 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
3395 CALL_EXPR_ARG (ret
, ix
) = t
;
3400 /* Similar to `build_min_nt_call_vec', but for template definitions of
3401 non-dependent expressions. NON_DEP is the non-dependent expression
3402 that has been built. */
3405 build_min_non_dep_call_vec (tree non_dep
, tree fn
, vec
<tree
, va_gc
> *argvec
)
3407 tree t
= build_min_nt_call_vec (fn
, argvec
);
3408 if (REFERENCE_REF_P (non_dep
))
3409 non_dep
= TREE_OPERAND (non_dep
, 0);
3410 TREE_TYPE (t
) = TREE_TYPE (non_dep
);
3411 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (non_dep
);
3412 return convert_from_reference (t
);
3415 /* Similar to build_min_non_dep, but for expressions that have been resolved to
3416 a call to an operator overload. OP is the operator that has been
3417 overloaded. NON_DEP is the non-dependent expression that's been built,
3418 which should be a CALL_EXPR or an INDIRECT_REF to a CALL_EXPR. OVERLOAD is
3419 the overload that NON_DEP is calling. */
3422 build_min_non_dep_op_overload (enum tree_code op
,
3427 int nargs
, expected_nargs
;
3430 non_dep
= extract_call_expr (non_dep
);
3432 nargs
= call_expr_nargs (non_dep
);
3434 expected_nargs
= cp_tree_code_length (op
);
3435 if ((op
== POSTINCREMENT_EXPR
3436 || op
== POSTDECREMENT_EXPR
)
3437 /* With -fpermissive non_dep could be operator++(). */
3438 && (!flag_permissive
|| nargs
!= expected_nargs
))
3439 expected_nargs
+= 1;
3440 gcc_assert (nargs
== expected_nargs
);
3443 va_start (p
, overload
);
3445 if (TREE_CODE (TREE_TYPE (overload
)) == FUNCTION_TYPE
)
3448 for (int i
= 0; i
< nargs
; i
++)
3450 tree arg
= va_arg (p
, tree
);
3451 vec_safe_push (args
, arg
);
3454 else if (TREE_CODE (TREE_TYPE (overload
)) == METHOD_TYPE
)
3456 tree object
= va_arg (p
, tree
);
3457 tree binfo
= TYPE_BINFO (TREE_TYPE (object
));
3458 tree method
= build_baselink (binfo
, binfo
, overload
, NULL_TREE
);
3459 fn
= build_min (COMPONENT_REF
, TREE_TYPE (overload
),
3460 object
, method
, NULL_TREE
);
3461 for (int i
= 1; i
< nargs
; i
++)
3463 tree arg
= va_arg (p
, tree
);
3464 vec_safe_push (args
, arg
);
3471 call
= build_min_non_dep_call_vec (non_dep
, fn
, args
);
3473 tree call_expr
= extract_call_expr (call
);
3474 KOENIG_LOOKUP_P (call_expr
) = KOENIG_LOOKUP_P (non_dep
);
3475 CALL_EXPR_OPERATOR_SYNTAX (call_expr
) = true;
3476 CALL_EXPR_ORDERED_ARGS (call_expr
) = CALL_EXPR_ORDERED_ARGS (non_dep
);
3477 CALL_EXPR_REVERSE_ARGS (call_expr
) = CALL_EXPR_REVERSE_ARGS (non_dep
);
3482 /* Return a new tree vec copied from VEC, with ELT inserted at index IDX. */
3485 vec_copy_and_insert (vec
<tree
, va_gc
> *old_vec
, tree elt
, unsigned idx
)
3487 unsigned len
= vec_safe_length (old_vec
);
3488 gcc_assert (idx
<= len
);
3490 vec
<tree
, va_gc
> *new_vec
= NULL
;
3491 vec_alloc (new_vec
, len
+ 1);
3494 for (i
= 0; i
< len
; ++i
)
3497 new_vec
->quick_push (elt
);
3498 new_vec
->quick_push ((*old_vec
)[i
]);
3501 new_vec
->quick_push (elt
);
3507 get_type_decl (tree t
)
3509 if (TREE_CODE (t
) == TYPE_DECL
)
3512 return TYPE_STUB_DECL (t
);
3513 gcc_assert (t
== error_mark_node
);
3517 /* Returns the namespace that contains DECL, whether directly or
3521 decl_namespace_context (tree decl
)
3525 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
3527 else if (TYPE_P (decl
))
3528 decl
= CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl
));
3530 decl
= CP_DECL_CONTEXT (decl
);
3534 /* Returns true if decl is within an anonymous namespace, however deeply
3535 nested, or false otherwise. */
3538 decl_anon_ns_mem_p (const_tree decl
)
3540 while (TREE_CODE (decl
) != NAMESPACE_DECL
)
3542 /* Classes inside anonymous namespaces have TREE_PUBLIC == 0. */
3544 return !TREE_PUBLIC (TYPE_MAIN_DECL (decl
));
3546 decl
= CP_DECL_CONTEXT (decl
);
3548 return !TREE_PUBLIC (decl
);
3551 /* Subroutine of cp_tree_equal: t1 and t2 are the CALL_EXPR_FNs of two
3552 CALL_EXPRS. Return whether they are equivalent. */
3555 called_fns_equal (tree t1
, tree t2
)
3557 /* Core 1321: dependent names are equivalent even if the overload sets
3558 are different. But do compare explicit template arguments. */
3559 tree name1
= dependent_name (t1
);
3560 tree name2
= dependent_name (t2
);
3563 tree targs1
= NULL_TREE
, targs2
= NULL_TREE
;
3568 /* FIXME dependent_name currently returns an unqualified name regardless
3569 of whether the function was named with a qualified- or unqualified-id.
3570 Until that's fixed, check that we aren't looking at overload sets from
3571 different scopes. */
3572 if (is_overloaded_fn (t1
) && is_overloaded_fn (t2
)
3573 && (DECL_CONTEXT (get_first_fn (t1
))
3574 != DECL_CONTEXT (get_first_fn (t2
))))
3577 if (TREE_CODE (t1
) == TEMPLATE_ID_EXPR
)
3578 targs1
= TREE_OPERAND (t1
, 1);
3579 if (TREE_CODE (t2
) == TEMPLATE_ID_EXPR
)
3580 targs2
= TREE_OPERAND (t2
, 1);
3581 return cp_tree_equal (targs1
, targs2
);
3584 return cp_tree_equal (t1
, t2
);
3587 /* Return truthvalue of whether T1 is the same tree structure as T2.
3588 Return 1 if they are the same. Return 0 if they are different. */
3591 cp_tree_equal (tree t1
, tree t2
)
3593 enum tree_code code1
, code2
;
3600 code1
= TREE_CODE (t1
);
3601 code2
= TREE_CODE (t2
);
3606 if (CONSTANT_CLASS_P (t1
)
3607 && !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
3613 /* There's only a single VOID_CST node, so we should never reach
3618 return tree_int_cst_equal (t1
, t2
);
3621 return real_equal (&TREE_REAL_CST (t1
), &TREE_REAL_CST (t2
));
3624 return TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
3625 && !memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
3626 TREE_STRING_LENGTH (t1
));
3629 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
),
3630 TREE_FIXED_CST (t2
));
3633 return cp_tree_equal (TREE_REALPART (t1
), TREE_REALPART (t2
))
3634 && cp_tree_equal (TREE_IMAGPART (t1
), TREE_IMAGPART (t2
));
3637 return operand_equal_p (t1
, t2
, OEP_ONLY_CONST
);
3640 /* We need to do this when determining whether or not two
3641 non-type pointer to member function template arguments
3643 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
3644 || CONSTRUCTOR_NELTS (t1
) != CONSTRUCTOR_NELTS (t2
))
3649 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t1
), i
, field
, value
)
3651 constructor_elt
*elt2
= CONSTRUCTOR_ELT (t2
, i
);
3652 if (!cp_tree_equal (field
, elt2
->index
)
3653 || !cp_tree_equal (value
, elt2
->value
))
3660 if (!cp_tree_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
)))
3662 if (!cp_tree_equal (TREE_VALUE (t1
), TREE_VALUE (t2
)))
3664 return cp_tree_equal (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
3667 return cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3672 call_expr_arg_iterator iter1
, iter2
;
3673 if (KOENIG_LOOKUP_P (t1
) != KOENIG_LOOKUP_P (t2
)
3674 || !called_fns_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
)))
3676 for (arg1
= first_call_expr_arg (t1
, &iter1
),
3677 arg2
= first_call_expr_arg (t2
, &iter2
);
3679 arg1
= next_call_expr_arg (&iter1
),
3680 arg2
= next_call_expr_arg (&iter2
))
3681 if (!cp_tree_equal (arg1
, arg2
))
3690 tree o1
= TREE_OPERAND (t1
, 0);
3691 tree o2
= TREE_OPERAND (t2
, 0);
3693 /* Special case: if either target is an unallocated VAR_DECL,
3694 it means that it's going to be unified with whatever the
3695 TARGET_EXPR is really supposed to initialize, so treat it
3696 as being equivalent to anything. */
3697 if (VAR_P (o1
) && DECL_NAME (o1
) == NULL_TREE
3698 && !DECL_RTL_SET_P (o1
))
3700 else if (VAR_P (o2
) && DECL_NAME (o2
) == NULL_TREE
3701 && !DECL_RTL_SET_P (o2
))
3703 else if (!cp_tree_equal (o1
, o2
))
3706 return cp_tree_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
3710 /* For comparing uses of parameters in late-specified return types
3711 with an out-of-class definition of the function, but can also come
3712 up for expressions that involve 'this' in a member function
3715 if (comparing_specializations
3716 && DECL_CONTEXT (t1
) != DECL_CONTEXT (t2
))
3717 /* When comparing hash table entries, only an exact match is
3718 good enough; we don't want to replace 'this' with the
3719 version from another function. But be more flexible
3720 with parameters with identical contexts. */
3723 if (same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
3725 if (DECL_ARTIFICIAL (t1
) ^ DECL_ARTIFICIAL (t2
))
3727 if (CONSTRAINT_VAR_P (t1
) ^ CONSTRAINT_VAR_P (t2
))
3729 if (DECL_ARTIFICIAL (t1
)
3730 || (DECL_PARM_LEVEL (t1
) == DECL_PARM_LEVEL (t2
)
3731 && DECL_PARM_INDEX (t1
) == DECL_PARM_INDEX (t2
)))
3741 case IDENTIFIER_NODE
:
3744 case DEFERRED_PARSE
:
3748 return (BASELINK_BINFO (t1
) == BASELINK_BINFO (t2
)
3749 && BASELINK_ACCESS_BINFO (t1
) == BASELINK_ACCESS_BINFO (t2
)
3750 && BASELINK_QUALIFIED_P (t1
) == BASELINK_QUALIFIED_P (t2
)
3751 && cp_tree_equal (BASELINK_FUNCTIONS (t1
),
3752 BASELINK_FUNCTIONS (t2
)));
3754 case TEMPLATE_PARM_INDEX
:
3755 return (TEMPLATE_PARM_IDX (t1
) == TEMPLATE_PARM_IDX (t2
)
3756 && TEMPLATE_PARM_LEVEL (t1
) == TEMPLATE_PARM_LEVEL (t2
)
3757 && (TEMPLATE_PARM_PARAMETER_PACK (t1
)
3758 == TEMPLATE_PARM_PARAMETER_PACK (t2
))
3759 && same_type_p (TREE_TYPE (TEMPLATE_PARM_DECL (t1
)),
3760 TREE_TYPE (TEMPLATE_PARM_DECL (t2
))));
3762 case TEMPLATE_ID_EXPR
:
3763 if (!cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0)))
3765 if (!comp_template_args (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1)))
3769 case CONSTRAINT_INFO
:
3770 return cp_tree_equal (CI_ASSOCIATED_CONSTRAINTS (t1
),
3771 CI_ASSOCIATED_CONSTRAINTS (t2
));
3774 return (CHECK_CONSTR_CONCEPT (t1
) == CHECK_CONSTR_CONCEPT (t2
)
3775 && comp_template_args (CHECK_CONSTR_ARGS (t1
),
3776 CHECK_CONSTR_ARGS (t2
)));
3781 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
3783 for (ix
= TREE_VEC_LENGTH (t1
); ix
--;)
3784 if (!cp_tree_equal (TREE_VEC_ELT (t1
, ix
),
3785 TREE_VEC_ELT (t2
, ix
)))
3793 tree o1
= TREE_OPERAND (t1
, 0);
3794 tree o2
= TREE_OPERAND (t2
, 0);
3796 if (code1
== SIZEOF_EXPR
)
3798 if (SIZEOF_EXPR_TYPE_P (t1
))
3799 o1
= TREE_TYPE (o1
);
3800 if (SIZEOF_EXPR_TYPE_P (t2
))
3801 o2
= TREE_TYPE (o2
);
3804 if (TREE_CODE (o1
) != TREE_CODE (o2
))
3807 if (ARGUMENT_PACK_P (o1
))
3808 return template_args_equal (o1
, o2
);
3809 else if (TYPE_P (o1
))
3810 return same_type_p (o1
, o2
);
3812 return cp_tree_equal (o1
, o2
);
3817 tree t1_op1
, t2_op1
;
3819 if (!cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0)))
3822 t1_op1
= TREE_OPERAND (t1
, 1);
3823 t2_op1
= TREE_OPERAND (t2
, 1);
3824 if (TREE_CODE (t1_op1
) != TREE_CODE (t2_op1
))
3827 return cp_tree_equal (TREE_OPERAND (t1
, 2), TREE_OPERAND (t2
, 2));
3831 /* Two pointer-to-members are the same if they point to the same
3832 field or function in the same class. */
3833 if (PTRMEM_CST_MEMBER (t1
) != PTRMEM_CST_MEMBER (t2
))
3836 return same_type_p (PTRMEM_CST_CLASS (t1
), PTRMEM_CST_CLASS (t2
));
3840 /* Two overloads. Must be exactly the same set of decls. */
3841 lkp_iterator
first (t1
);
3842 lkp_iterator
second (t2
);
3844 for (; first
&& second
; ++first
, ++second
)
3845 if (*first
!= *second
)
3847 return !(first
|| second
);
3851 if (TRAIT_EXPR_KIND (t1
) != TRAIT_EXPR_KIND (t2
))
3853 return same_type_p (TRAIT_EXPR_TYPE1 (t1
), TRAIT_EXPR_TYPE1 (t2
))
3854 && cp_tree_equal (TRAIT_EXPR_TYPE2 (t1
), TRAIT_EXPR_TYPE2 (t2
));
3857 case STATIC_CAST_EXPR
:
3858 case REINTERPRET_CAST_EXPR
:
3859 case CONST_CAST_EXPR
:
3860 case DYNAMIC_CAST_EXPR
:
3861 case IMPLICIT_CONV_EXPR
:
3864 case NON_LVALUE_EXPR
:
3865 case VIEW_CONVERT_EXPR
:
3866 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
3868 /* Now compare operands as usual. */
3871 case DEFERRED_NOEXCEPT
:
3872 return (cp_tree_equal (DEFERRED_NOEXCEPT_PATTERN (t1
),
3873 DEFERRED_NOEXCEPT_PATTERN (t2
))
3874 && comp_template_args (DEFERRED_NOEXCEPT_ARGS (t1
),
3875 DEFERRED_NOEXCEPT_ARGS (t2
)));
3878 /* Two lambda-expressions are never considered equivalent. */
3881 case TYPE_ARGUMENT_PACK
:
3882 case NONTYPE_ARGUMENT_PACK
:
3884 tree p1
= ARGUMENT_PACK_ARGS (t1
);
3885 tree p2
= ARGUMENT_PACK_ARGS (t2
);
3886 int len
= TREE_VEC_LENGTH (p1
);
3887 if (TREE_VEC_LENGTH (p2
) != len
)
3890 for (int ix
= 0; ix
!= len
; ix
++)
3891 if (!template_args_equal (TREE_VEC_ELT (p1
, ix
),
3892 TREE_VEC_ELT (p2
, ix
)))
3897 case EXPR_PACK_EXPANSION
:
3898 if (!cp_tree_equal (PACK_EXPANSION_PATTERN (t1
),
3899 PACK_EXPANSION_PATTERN (t2
)))
3901 if (!comp_template_args (PACK_EXPANSION_EXTRA_ARGS (t1
),
3902 PACK_EXPANSION_EXTRA_ARGS (t2
)))
3910 switch (TREE_CODE_CLASS (code1
))
3914 case tcc_comparison
:
3915 case tcc_expression
:
3920 int n
= cp_tree_operand_length (t1
);
3921 if (TREE_CODE_CLASS (code1
) == tcc_vl_exp
3922 && n
!= TREE_OPERAND_LENGTH (t2
))
3925 for (int i
= 0; i
< n
; ++i
)
3926 if (!cp_tree_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
)))
3933 return same_type_p (t1
, t2
);
3939 /* We can get here with --disable-checking. */
3943 /* The type of ARG when used as an lvalue. */
3946 lvalue_type (tree arg
)
3948 tree type
= TREE_TYPE (arg
);
3952 /* The type of ARG for printing error messages; denote lvalues with
3956 error_type (tree arg
)
3958 tree type
= TREE_TYPE (arg
);
3960 if (TREE_CODE (type
) == ARRAY_TYPE
)
3962 else if (TREE_CODE (type
) == ERROR_MARK
)
3964 else if (lvalue_p (arg
))
3965 type
= build_reference_type (lvalue_type (arg
));
3966 else if (MAYBE_CLASS_TYPE_P (type
))
3967 type
= lvalue_type (arg
);
3972 /* Does FUNCTION use a variable-length argument list? */
3975 varargs_function_p (const_tree function
)
3977 return stdarg_p (TREE_TYPE (function
));
3980 /* Returns 1 if decl is a member of a class. */
3983 member_p (const_tree decl
)
3985 const_tree
const ctx
= DECL_CONTEXT (decl
);
3986 return (ctx
&& TYPE_P (ctx
));
3989 /* Create a placeholder for member access where we don't actually have an
3990 object that the access is against. */
3993 build_dummy_object (tree type
)
3995 tree decl
= build1 (CONVERT_EXPR
, build_pointer_type (type
), void_node
);
3996 return cp_build_fold_indirect_ref (decl
);
3999 /* We've gotten a reference to a member of TYPE. Return *this if appropriate,
4000 or a dummy object otherwise. If BINFOP is non-0, it is filled with the
4001 binfo path from current_class_type to TYPE, or 0. */
4004 maybe_dummy_object (tree type
, tree
* binfop
)
4008 tree current
= current_nonlambda_class_type ();
4011 && (binfo
= lookup_base (current
, type
, ba_any
, NULL
,
4012 tf_warning_or_error
)))
4016 /* Reference from a nested class member function. */
4018 binfo
= TYPE_BINFO (type
);
4024 if (current_class_ref
4025 /* current_class_ref might not correspond to current_class_type if
4026 we're in tsubst_default_argument or a lambda-declarator; in either
4027 case, we want to use current_class_ref if it matches CONTEXT. */
4028 && (same_type_ignoring_top_level_qualifiers_p
4029 (TREE_TYPE (current_class_ref
), context
)))
4030 decl
= current_class_ref
;
4032 decl
= build_dummy_object (context
);
4037 /* Returns 1 if OB is a placeholder object, or a pointer to one. */
4040 is_dummy_object (const_tree ob
)
4042 if (INDIRECT_REF_P (ob
))
4043 ob
= TREE_OPERAND (ob
, 0);
4044 return (TREE_CODE (ob
) == CONVERT_EXPR
4045 && TREE_OPERAND (ob
, 0) == void_node
);
4048 /* Returns true if TYPE is a character type or std::byte. */
4051 is_byte_access_type (tree type
)
4053 type
= TYPE_MAIN_VARIANT (type
);
4054 if (char_type_p (type
))
4057 return (TREE_CODE (type
) == ENUMERAL_TYPE
4058 && TYPE_CONTEXT (type
) == std_node
4059 && !strcmp ("byte", TYPE_NAME_STRING (type
)));
4062 /* Returns 1 iff type T is something we want to treat as a scalar type for
4063 the purpose of deciding whether it is trivial/POD/standard-layout. */
4066 scalarish_type_p (const_tree t
)
4068 if (t
== error_mark_node
)
4071 return (SCALAR_TYPE_P (t
) || VECTOR_TYPE_P (t
));
4074 /* Returns true iff T requires non-trivial default initialization. */
4077 type_has_nontrivial_default_init (const_tree t
)
4079 t
= strip_array_types (CONST_CAST_TREE (t
));
4081 if (CLASS_TYPE_P (t
))
4082 return TYPE_HAS_COMPLEX_DFLT (t
);
4087 /* Track classes with only deleted copy/move constructors so that we can warn
4088 if they are used in call/return by value. */
4090 static GTY(()) hash_set
<tree
>* deleted_copy_types
;
4092 remember_deleted_copy (const_tree t
)
4094 if (!deleted_copy_types
)
4095 deleted_copy_types
= hash_set
<tree
>::create_ggc(37);
4096 deleted_copy_types
->add (CONST_CAST_TREE (t
));
4099 maybe_warn_parm_abi (tree t
, location_t loc
)
4101 if (!deleted_copy_types
4102 || !deleted_copy_types
->contains (t
))
4105 if ((flag_abi_version
== 12 || warn_abi_version
== 12)
4106 && classtype_has_non_deleted_move_ctor (t
))
4109 auto_diagnostic_group d
;
4110 if (flag_abi_version
> 12)
4111 w
= warning_at (loc
, OPT_Wabi
, "%<-fabi-version=13%> (GCC 8.2) fixes "
4112 "the calling convention for %qT, which was "
4113 "accidentally changed in 8.1", t
);
4115 w
= warning_at (loc
, OPT_Wabi
, "%<-fabi-version=12%> (GCC 8.1) accident"
4116 "ally changes the calling convention for %qT", t
);
4118 inform (location_of (t
), " declared here");
4122 auto_diagnostic_group d
;
4123 if (warning_at (loc
, OPT_Wabi
, "the calling convention for %qT changes in "
4124 "%<-fabi-version=13%> (GCC 8.2)", t
))
4125 inform (location_of (t
), " because all of its copy and move "
4126 "constructors are deleted");
4129 /* Returns true iff copying an object of type T (including via move
4130 constructor) is non-trivial. That is, T has no non-trivial copy
4131 constructors and no non-trivial move constructors, and not all copy/move
4132 constructors are deleted. This function implements the ABI notion of
4133 non-trivial copy, which has diverged from the one in the standard. */
4136 type_has_nontrivial_copy_init (const_tree type
)
4138 tree t
= strip_array_types (CONST_CAST_TREE (type
));
4140 if (CLASS_TYPE_P (t
))
4142 gcc_assert (COMPLETE_TYPE_P (t
));
4144 if (TYPE_HAS_COMPLEX_COPY_CTOR (t
)
4145 || TYPE_HAS_COMPLEX_MOVE_CTOR (t
))
4149 if (cxx_dialect
< cxx11
)
4150 /* No deleted functions before C++11. */
4153 /* Before ABI v12 we did a bitwise copy of types with only deleted
4154 copy/move constructors. */
4155 if (!abi_version_at_least (12)
4156 && !(warn_abi
&& abi_version_crosses (12)))
4159 bool saw_copy
= false;
4160 bool saw_non_deleted
= false;
4161 bool saw_non_deleted_move
= false;
4163 if (CLASSTYPE_LAZY_MOVE_CTOR (t
))
4164 saw_copy
= saw_non_deleted
= true;
4165 else if (CLASSTYPE_LAZY_COPY_CTOR (t
))
4168 if (classtype_has_move_assign_or_move_ctor_p (t
, true))
4169 /* [class.copy]/8 If the class definition declares a move
4170 constructor or move assignment operator, the implicitly declared
4171 copy constructor is defined as deleted.... */;
4173 /* Any other reason the implicitly-declared function would be
4174 deleted would also cause TYPE_HAS_COMPLEX_COPY_CTOR to be
4176 saw_non_deleted
= true;
4179 if (!saw_non_deleted
)
4180 for (ovl_iterator
iter (CLASSTYPE_CONSTRUCTORS (t
)); iter
; ++iter
)
4186 if (!DECL_DELETED_FN (fn
))
4188 /* Not deleted, therefore trivial. */
4189 saw_non_deleted
= true;
4193 else if (move_fn_p (fn
))
4194 if (!DECL_DELETED_FN (fn
))
4195 saw_non_deleted_move
= true;
4198 gcc_assert (saw_copy
);
4200 /* ABI v12 buggily ignored move constructors. */
4201 bool v11nontriv
= false;
4202 bool v12nontriv
= !saw_non_deleted
;
4203 bool v13nontriv
= !saw_non_deleted
&& !saw_non_deleted_move
;
4204 bool nontriv
= (abi_version_at_least (13) ? v13nontriv
4205 : flag_abi_version
== 12 ? v12nontriv
4207 bool warn_nontriv
= (warn_abi_version
>= 13 ? v13nontriv
4208 : warn_abi_version
== 12 ? v12nontriv
4210 if (nontriv
!= warn_nontriv
)
4211 remember_deleted_copy (t
);
4219 /* Returns 1 iff type T is a trivially copyable type, as defined in
4220 [basic.types] and [class]. */
4223 trivially_copyable_p (const_tree t
)
4225 t
= strip_array_types (CONST_CAST_TREE (t
));
4227 if (CLASS_TYPE_P (t
))
4228 return ((!TYPE_HAS_COPY_CTOR (t
)
4229 || !TYPE_HAS_COMPLEX_COPY_CTOR (t
))
4230 && !TYPE_HAS_COMPLEX_MOVE_CTOR (t
)
4231 && (!TYPE_HAS_COPY_ASSIGN (t
)
4232 || !TYPE_HAS_COMPLEX_COPY_ASSIGN (t
))
4233 && !TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
)
4234 && TYPE_HAS_TRIVIAL_DESTRUCTOR (t
));
4236 /* CWG 2094 makes volatile-qualified scalars trivially copyable again. */
4237 return scalarish_type_p (t
);
4240 /* Returns 1 iff type T is a trivial type, as defined in [basic.types] and
4244 trivial_type_p (const_tree t
)
4246 t
= strip_array_types (CONST_CAST_TREE (t
));
4248 if (CLASS_TYPE_P (t
))
4249 return (TYPE_HAS_TRIVIAL_DFLT (t
)
4250 && trivially_copyable_p (t
));
4252 return scalarish_type_p (t
);
4255 /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */
4258 pod_type_p (const_tree t
)
4260 /* This CONST_CAST is okay because strip_array_types returns its
4261 argument unmodified and we assign it to a const_tree. */
4262 t
= strip_array_types (CONST_CAST_TREE(t
));
4264 if (!CLASS_TYPE_P (t
))
4265 return scalarish_type_p (t
);
4266 else if (cxx_dialect
> cxx98
)
4267 /* [class]/10: A POD struct is a class that is both a trivial class and a
4268 standard-layout class, and has no non-static data members of type
4269 non-POD struct, non-POD union (or array of such types).
4271 We don't need to check individual members because if a member is
4272 non-std-layout or non-trivial, the class will be too. */
4273 return (std_layout_type_p (t
) && trivial_type_p (t
));
4275 /* The C++98 definition of POD is different. */
4276 return !CLASSTYPE_NON_LAYOUT_POD_P (t
);
4279 /* Returns true iff T is POD for the purpose of layout, as defined in the
4283 layout_pod_type_p (const_tree t
)
4285 t
= strip_array_types (CONST_CAST_TREE (t
));
4287 if (CLASS_TYPE_P (t
))
4288 return !CLASSTYPE_NON_LAYOUT_POD_P (t
);
4290 return scalarish_type_p (t
);
4293 /* Returns true iff T is a standard-layout type, as defined in
4297 std_layout_type_p (const_tree t
)
4299 t
= strip_array_types (CONST_CAST_TREE (t
));
4301 if (CLASS_TYPE_P (t
))
4302 return !CLASSTYPE_NON_STD_LAYOUT (t
);
4304 return scalarish_type_p (t
);
4307 static bool record_has_unique_obj_representations (const_tree
, const_tree
);
4309 /* Returns true iff T satisfies std::has_unique_object_representations<T>,
4310 as defined in [meta.unary.prop]. */
4313 type_has_unique_obj_representations (const_tree t
)
4317 t
= strip_array_types (CONST_CAST_TREE (t
));
4319 if (!trivially_copyable_p (t
))
4322 if (CLASS_TYPE_P (t
) && CLASSTYPE_UNIQUE_OBJ_REPRESENTATIONS_SET (t
))
4323 return CLASSTYPE_UNIQUE_OBJ_REPRESENTATIONS (t
);
4325 switch (TREE_CODE (t
))
4329 case REFERENCE_TYPE
:
4330 /* If some backend has any paddings in these types, we should add
4331 a target hook for this and handle it there. */
4335 /* For bool values other than 0 and 1 should only appear with
4336 undefined behavior. */
4340 return type_has_unique_obj_representations (ENUM_UNDERLYING_TYPE (t
));
4343 /* XFmode certainly contains padding on x86, which the CPU doesn't store
4344 when storing long double values, so for that we have to return false.
4345 Other kinds of floating point values are questionable due to +.0/-.0
4346 and NaNs, let's play safe for now. */
4349 case FIXED_POINT_TYPE
:
4357 return type_has_unique_obj_representations (TREE_TYPE (t
));
4360 ret
= record_has_unique_obj_representations (t
, TYPE_SIZE (t
));
4361 if (CLASS_TYPE_P (t
))
4363 CLASSTYPE_UNIQUE_OBJ_REPRESENTATIONS_SET (t
) = 1;
4364 CLASSTYPE_UNIQUE_OBJ_REPRESENTATIONS (t
) = ret
;
4372 for (tree field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
4373 if (TREE_CODE (field
) == FIELD_DECL
)
4376 if (!type_has_unique_obj_representations (TREE_TYPE (field
))
4377 || simple_cst_equal (DECL_SIZE (field
), TYPE_SIZE (t
)) != 1)
4383 if (!any_fields
&& !integer_zerop (TYPE_SIZE (t
)))
4385 if (CLASS_TYPE_P (t
))
4387 CLASSTYPE_UNIQUE_OBJ_REPRESENTATIONS_SET (t
) = 1;
4388 CLASSTYPE_UNIQUE_OBJ_REPRESENTATIONS (t
) = ret
;
4403 /* Helper function for type_has_unique_obj_representations. */
4406 record_has_unique_obj_representations (const_tree t
, const_tree sz
)
4408 for (tree field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
4409 if (TREE_CODE (field
) != FIELD_DECL
)
4411 /* For bases, can't use type_has_unique_obj_representations here, as in
4412 struct S { int i : 24; S (); };
4413 struct T : public S { int j : 8; T (); };
4414 S doesn't have unique obj representations, but T does. */
4415 else if (DECL_FIELD_IS_BASE (field
))
4417 if (!record_has_unique_obj_representations (TREE_TYPE (field
),
4421 else if (DECL_C_BIT_FIELD (field
))
4423 tree btype
= DECL_BIT_FIELD_TYPE (field
);
4424 if (!type_has_unique_obj_representations (btype
))
4427 else if (!type_has_unique_obj_representations (TREE_TYPE (field
)))
4431 for (tree field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
4432 if (TREE_CODE (field
) == FIELD_DECL
)
4434 offset_int fld
= wi::to_offset (DECL_FIELD_OFFSET (field
));
4435 offset_int bitpos
= wi::to_offset (DECL_FIELD_BIT_OFFSET (field
));
4436 fld
= fld
* BITS_PER_UNIT
+ bitpos
;
4439 if (DECL_SIZE (field
))
4441 offset_int size
= wi::to_offset (DECL_SIZE (field
));
4445 if (cur
!= wi::to_offset (sz
))
4451 /* Nonzero iff type T is a class template implicit specialization. */
4454 class_tmpl_impl_spec_p (const_tree t
)
4456 return CLASS_TYPE_P (t
) && CLASSTYPE_TEMPLATE_INSTANTIATION (t
);
4459 /* Returns 1 iff zero initialization of type T means actually storing
4463 zero_init_p (const_tree t
)
4465 /* This CONST_CAST is okay because strip_array_types returns its
4466 argument unmodified and we assign it to a const_tree. */
4467 t
= strip_array_types (CONST_CAST_TREE(t
));
4469 if (t
== error_mark_node
)
4472 /* NULL pointers to data members are initialized with -1. */
4473 if (TYPE_PTRDATAMEM_P (t
))
4476 /* Classes that contain types that can't be zero-initialized, cannot
4477 be zero-initialized themselves. */
4478 if (CLASS_TYPE_P (t
) && CLASSTYPE_NON_ZERO_INIT_P (t
))
4484 /* Returns true if the expression or initializer T is the result of
4485 zero-initialization for its type, taking pointers to members
4486 into consideration. */
4489 zero_init_expr_p (tree t
)
4491 tree type
= TREE_TYPE (t
);
4492 if (!type
|| uses_template_parms (type
))
4494 if (zero_init_p (type
))
4495 return initializer_zerop (t
);
4496 if (TYPE_PTRMEM_P (type
))
4497 return null_member_pointer_value_p (t
);
4498 if (TREE_CODE (t
) == CONSTRUCTOR
4499 && CP_AGGREGATE_TYPE_P (type
))
4502 unsigned HOST_WIDE_INT i
;
4503 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (t
), i
, elt_init
)
4504 if (!zero_init_expr_p (elt_init
))
4511 /* True IFF T is a C++20 structural type (P1907R1) that can be used as a
4512 non-type template parameter. If EXPLAIN, explain why not. */
4515 structural_type_p (tree t
, bool explain
)
4517 /* A structural type is one of the following: */
4519 /* a scalar type, or */
4520 if (SCALAR_TYPE_P (t
))
4522 /* an lvalue reference type, or */
4523 if (TYPE_REF_P (t
) && !TYPE_REF_IS_RVALUE (t
))
4525 /* a literal class type with the following properties:
4526 - all base classes and non-static data members are public and non-mutable
4528 - the types of all bases classes and non-static data members are
4529 structural types or (possibly multi-dimensional) array thereof. */
4530 if (!CLASS_TYPE_P (t
))
4532 if (!literal_type_p (t
))
4535 explain_non_literal_class (t
);
4538 for (tree m
= next_initializable_field (TYPE_FIELDS (t
)); m
;
4539 m
= next_initializable_field (DECL_CHAIN (m
)))
4541 if (TREE_PRIVATE (m
) || TREE_PROTECTED (m
))
4545 if (DECL_FIELD_IS_BASE (m
))
4546 inform (location_of (m
), "base class %qT is not public",
4549 inform (location_of (m
), "%qD is not public", m
);
4553 if (DECL_MUTABLE_P (m
))
4556 inform (location_of (m
), "%qD is mutable", m
);
4559 tree mtype
= strip_array_types (TREE_TYPE (m
));
4560 if (!structural_type_p (mtype
))
4564 inform (location_of (m
), "%qD has a non-structural type", m
);
4565 structural_type_p (mtype
, true);
4573 /* Handle the C++17 [[nodiscard]] attribute, which is similar to the GNU
4574 warn_unused_result attribute. */
4577 handle_nodiscard_attribute (tree
*node
, tree name
, tree args
,
4578 int /*flags*/, bool *no_add_attrs
)
4580 if (args
&& TREE_CODE (TREE_VALUE (args
)) != STRING_CST
)
4582 error ("%qE attribute argument must be a string constant", name
);
4583 *no_add_attrs
= true;
4585 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4587 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (*node
)))
4588 && !DECL_CONSTRUCTOR_P (*node
))
4589 warning_at (DECL_SOURCE_LOCATION (*node
),
4590 OPT_Wattributes
, "%qE attribute applied to %qD with void "
4591 "return type", name
, *node
);
4593 else if (OVERLOAD_TYPE_P (*node
))
4597 warning (OPT_Wattributes
, "%qE attribute can only be applied to "
4598 "functions or to class or enumeration types", name
);
4599 *no_add_attrs
= true;
4604 /* Handle a C++20 "no_unique_address" attribute; arguments as in
4605 struct attribute_spec.handler. */
4607 handle_no_unique_addr_attribute (tree
* node
,
4613 if (TREE_CODE (*node
) != FIELD_DECL
)
4615 warning (OPT_Wattributes
, "%qE attribute can only be applied to "
4616 "non-static data members", name
);
4617 *no_add_attrs
= true;
4619 else if (DECL_C_BIT_FIELD (*node
))
4621 warning (OPT_Wattributes
, "%qE attribute cannot be applied to "
4622 "a bit-field", name
);
4623 *no_add_attrs
= true;
4629 /* The C++20 [[likely]] and [[unlikely]] attributes on labels map to the GNU
4630 hot/cold attributes. */
4633 handle_likeliness_attribute (tree
*node
, tree name
, tree args
,
4634 int flags
, bool *no_add_attrs
)
4636 *no_add_attrs
= true;
4637 if (TREE_CODE (*node
) == LABEL_DECL
4638 || TREE_CODE (*node
) == FUNCTION_DECL
)
4641 warning (OPT_Wattributes
, "%qE attribute takes no arguments", name
);
4642 tree bname
= (is_attribute_p ("likely", name
)
4643 ? get_identifier ("hot") : get_identifier ("cold"));
4644 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4645 warning (OPT_Wattributes
, "ISO C++ %qE attribute does not apply to "
4646 "functions; treating as %<[[gnu::%E]]%>", name
, bname
);
4647 tree battr
= build_tree_list (bname
, NULL_TREE
);
4648 decl_attributes (node
, battr
, flags
);
4652 return error_mark_node
;
4655 /* Table of valid C++ attributes. */
4656 const struct attribute_spec cxx_attribute_table
[] =
4658 /* { name, min_len, max_len, decl_req, type_req, fn_type_req,
4659 affects_type_identity, handler, exclude } */
4660 { "init_priority", 1, 1, true, false, false, false,
4661 handle_init_priority_attribute
, NULL
},
4662 { "abi_tag", 1, -1, false, false, false, true,
4663 handle_abi_tag_attribute
, NULL
},
4664 { NULL
, 0, 0, false, false, false, false, NULL
, NULL
}
4667 /* Table of C++ standard attributes. */
4668 const struct attribute_spec std_attribute_table
[] =
4670 /* { name, min_len, max_len, decl_req, type_req, fn_type_req,
4671 affects_type_identity, handler, exclude } */
4672 { "maybe_unused", 0, 0, false, false, false, false,
4673 handle_unused_attribute
, NULL
},
4674 { "nodiscard", 0, 1, false, false, false, false,
4675 handle_nodiscard_attribute
, NULL
},
4676 { "no_unique_address", 0, 0, true, false, false, false,
4677 handle_no_unique_addr_attribute
, NULL
},
4678 { "likely", 0, 0, false, false, false, false,
4679 handle_likeliness_attribute
, attr_cold_hot_exclusions
},
4680 { "unlikely", 0, 0, false, false, false, false,
4681 handle_likeliness_attribute
, attr_cold_hot_exclusions
},
4682 { "noreturn", 0, 0, true, false, false, false,
4683 handle_noreturn_attribute
, attr_noreturn_exclusions
},
4684 { NULL
, 0, 0, false, false, false, false, NULL
, NULL
}
4687 /* Handle an "init_priority" attribute; arguments as in
4688 struct attribute_spec.handler. */
4690 handle_init_priority_attribute (tree
* node
,
4696 tree initp_expr
= TREE_VALUE (args
);
4698 tree type
= TREE_TYPE (decl
);
4701 STRIP_NOPS (initp_expr
);
4702 initp_expr
= default_conversion (initp_expr
);
4704 initp_expr
= maybe_constant_value (initp_expr
);
4706 if (!initp_expr
|| TREE_CODE (initp_expr
) != INTEGER_CST
)
4708 error ("requested %<init_priority%> is not an integer constant");
4709 cxx_constant_value (initp_expr
);
4710 *no_add_attrs
= true;
4714 pri
= TREE_INT_CST_LOW (initp_expr
);
4716 type
= strip_array_types (type
);
4718 if (decl
== NULL_TREE
4720 || !TREE_STATIC (decl
)
4721 || DECL_EXTERNAL (decl
)
4722 || (TREE_CODE (type
) != RECORD_TYPE
4723 && TREE_CODE (type
) != UNION_TYPE
)
4724 /* Static objects in functions are initialized the
4725 first time control passes through that
4726 function. This is not precise enough to pin down an
4727 init_priority value, so don't allow it. */
4728 || current_function_decl
)
4730 error ("can only use %qE attribute on file-scope definitions "
4731 "of objects of class type", name
);
4732 *no_add_attrs
= true;
4736 if (pri
> MAX_INIT_PRIORITY
|| pri
<= 0)
4738 error ("requested %<init_priority%> %i is out of range [0, %i]",
4739 pri
, MAX_INIT_PRIORITY
);
4740 *no_add_attrs
= true;
4744 /* Check for init_priorities that are reserved for
4745 language and runtime support implementations.*/
4746 if (pri
<= MAX_RESERVED_INIT_PRIORITY
)
4749 (0, "requested %<init_priority%> %i is reserved for internal use",
4753 if (SUPPORTS_INIT_PRIORITY
)
4755 SET_DECL_INIT_PRIORITY (decl
, pri
);
4756 DECL_HAS_INIT_PRIORITY_P (decl
) = 1;
4761 error ("%qE attribute is not supported on this platform", name
);
4762 *no_add_attrs
= true;
4767 /* DECL is being redeclared; the old declaration had the abi tags in OLD,
4768 and the new one has the tags in NEW_. Give an error if there are tags
4769 in NEW_ that weren't in OLD. */
4772 check_abi_tag_redeclaration (const_tree decl
, const_tree old
, const_tree new_
)
4774 if (old
&& TREE_CODE (TREE_VALUE (old
)) == TREE_LIST
)
4775 old
= TREE_VALUE (old
);
4776 if (new_
&& TREE_CODE (TREE_VALUE (new_
)) == TREE_LIST
)
4777 new_
= TREE_VALUE (new_
);
4779 for (const_tree t
= new_
; t
; t
= TREE_CHAIN (t
))
4781 tree str
= TREE_VALUE (t
);
4782 for (const_tree in
= old
; in
; in
= TREE_CHAIN (in
))
4784 tree ostr
= TREE_VALUE (in
);
4785 if (cp_tree_equal (str
, ostr
))
4788 error ("redeclaration of %qD adds abi tag %qE", decl
, str
);
4794 inform (DECL_SOURCE_LOCATION (decl
), "previous declaration here");
4800 /* The abi_tag attribute with the name NAME was given ARGS. If they are
4801 ill-formed, give an error and return false; otherwise, return true. */
4804 check_abi_tag_args (tree args
, tree name
)
4808 error ("the %qE attribute requires arguments", name
);
4811 for (tree arg
= args
; arg
; arg
= TREE_CHAIN (arg
))
4813 tree elt
= TREE_VALUE (arg
);
4814 if (TREE_CODE (elt
) != STRING_CST
4815 || (!same_type_ignoring_top_level_qualifiers_p
4816 (strip_array_types (TREE_TYPE (elt
)),
4819 error ("arguments to the %qE attribute must be narrow string "
4823 const char *begin
= TREE_STRING_POINTER (elt
);
4824 const char *end
= begin
+ TREE_STRING_LENGTH (elt
);
4825 for (const char *p
= begin
; p
!= end
; ++p
)
4830 if (!ISALPHA (c
) && c
!= '_')
4832 error ("arguments to the %qE attribute must contain valid "
4833 "identifiers", name
);
4834 inform (input_location
, "%<%c%> is not a valid first "
4835 "character for an identifier", c
);
4839 else if (p
== end
- 1)
4840 gcc_assert (c
== 0);
4843 if (!ISALNUM (c
) && c
!= '_')
4845 error ("arguments to the %qE attribute must contain valid "
4846 "identifiers", name
);
4847 inform (input_location
, "%<%c%> is not a valid character "
4848 "in an identifier", c
);
4857 /* Handle an "abi_tag" attribute; arguments as in
4858 struct attribute_spec.handler. */
4861 handle_abi_tag_attribute (tree
* node
, tree name
, tree args
,
4862 int flags
, bool* no_add_attrs
)
4864 if (!check_abi_tag_args (args
, name
))
4869 if (!OVERLOAD_TYPE_P (*node
))
4871 error ("%qE attribute applied to non-class, non-enum type %qT",
4875 else if (!(flags
& (int)ATTR_FLAG_TYPE_IN_PLACE
))
4877 error ("%qE attribute applied to %qT after its definition",
4881 else if (CLASS_TYPE_P (*node
)
4882 && CLASSTYPE_TEMPLATE_INSTANTIATION (*node
))
4884 warning (OPT_Wattributes
, "ignoring %qE attribute applied to "
4885 "template instantiation %qT", name
, *node
);
4888 else if (CLASS_TYPE_P (*node
)
4889 && CLASSTYPE_TEMPLATE_SPECIALIZATION (*node
))
4891 warning (OPT_Wattributes
, "ignoring %qE attribute applied to "
4892 "template specialization %qT", name
, *node
);
4896 tree attributes
= TYPE_ATTRIBUTES (*node
);
4897 tree decl
= TYPE_NAME (*node
);
4899 /* Make sure all declarations have the same abi tags. */
4900 if (DECL_SOURCE_LOCATION (decl
) != input_location
)
4902 if (!check_abi_tag_redeclaration (decl
,
4903 lookup_attribute ("abi_tag",
4911 if (!VAR_OR_FUNCTION_DECL_P (*node
))
4913 error ("%qE attribute applied to non-function, non-variable %qD",
4917 else if (DECL_LANGUAGE (*node
) == lang_c
)
4919 error ("%qE attribute applied to extern \"C\" declaration %qD",
4928 *no_add_attrs
= true;
4932 /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the
4933 thing pointed to by the constant. */
4936 make_ptrmem_cst (tree type
, tree member
)
4938 tree ptrmem_cst
= make_node (PTRMEM_CST
);
4939 TREE_TYPE (ptrmem_cst
) = type
;
4940 PTRMEM_CST_MEMBER (ptrmem_cst
) = member
;
4944 /* Build a variant of TYPE that has the indicated ATTRIBUTES. May
4945 return an existing type if an appropriate type already exists. */
4948 cp_build_type_attribute_variant (tree type
, tree attributes
)
4952 new_type
= build_type_attribute_variant (type
, attributes
);
4953 if (FUNC_OR_METHOD_TYPE_P (new_type
))
4954 gcc_checking_assert (cxx_type_hash_eq (type
, new_type
));
4956 /* Making a new main variant of a class type is broken. */
4957 gcc_assert (!CLASS_TYPE_P (type
) || new_type
== type
);
4962 /* Return TRUE if TYPE1 and TYPE2 are identical for type hashing purposes.
4963 Called only after doing all language independent checks. */
4966 cxx_type_hash_eq (const_tree typea
, const_tree typeb
)
4968 gcc_assert (FUNC_OR_METHOD_TYPE_P (typea
));
4970 if (type_memfn_rqual (typea
) != type_memfn_rqual (typeb
))
4972 if (TYPE_HAS_LATE_RETURN_TYPE (typea
) != TYPE_HAS_LATE_RETURN_TYPE (typeb
))
4974 return comp_except_specs (TYPE_RAISES_EXCEPTIONS (typea
),
4975 TYPE_RAISES_EXCEPTIONS (typeb
), ce_exact
);
4978 /* Copy the language-specific type variant modifiers from TYPEB to TYPEA. For
4979 C++, these are the exception-specifier and ref-qualifier. */
4982 cxx_copy_lang_qualifiers (const_tree typea
, const_tree typeb
)
4984 tree type
= CONST_CAST_TREE (typea
);
4985 if (FUNC_OR_METHOD_TYPE_P (type
))
4986 type
= build_cp_fntype_variant (type
, type_memfn_rqual (typeb
),
4987 TYPE_RAISES_EXCEPTIONS (typeb
),
4988 TYPE_HAS_LATE_RETURN_TYPE (typeb
));
4992 /* Apply FUNC to all language-specific sub-trees of TP in a pre-order
4993 traversal. Called from walk_tree. */
4996 cp_walk_subtrees (tree
*tp
, int *walk_subtrees_p
, walk_tree_fn func
,
4997 void *data
, hash_set
<tree
> *pset
)
4999 enum tree_code code
= TREE_CODE (*tp
);
5002 #define WALK_SUBTREE(NODE) \
5005 result = cp_walk_tree (&(NODE), func, data, pset); \
5006 if (result) goto out; \
5012 /* Walk into template args without looking through typedefs. */
5013 if (tree ti
= TYPE_TEMPLATE_INFO_MAYBE_ALIAS (*tp
))
5014 WALK_SUBTREE (TI_ARGS (ti
));
5015 /* Don't look through typedefs; walk_tree_fns that want to look through
5016 typedefs (like min_vis_r) need to do that themselves. */
5017 if (typedef_variant_p (*tp
))
5019 *walk_subtrees_p
= 0;
5024 /* Not one of the easy cases. We must explicitly go through the
5029 case DEFERRED_PARSE
:
5030 case TEMPLATE_TEMPLATE_PARM
:
5031 case BOUND_TEMPLATE_TEMPLATE_PARM
:
5032 case UNBOUND_CLASS_TEMPLATE
:
5033 case TEMPLATE_PARM_INDEX
:
5034 case TEMPLATE_TYPE_PARM
:
5036 case UNDERLYING_TYPE
:
5037 /* None of these have subtrees other than those already walked
5039 *walk_subtrees_p
= 0;
5043 WALK_SUBTREE (TYPE_CONTEXT (*tp
));
5044 WALK_SUBTREE (TYPENAME_TYPE_FULLNAME (*tp
));
5045 *walk_subtrees_p
= 0;
5049 if (BASELINK_QUALIFIED_P (*tp
))
5050 WALK_SUBTREE (BINFO_TYPE (BASELINK_ACCESS_BINFO (*tp
)));
5051 WALK_SUBTREE (BASELINK_FUNCTIONS (*tp
));
5052 *walk_subtrees_p
= 0;
5056 WALK_SUBTREE (TREE_TYPE (*tp
));
5057 *walk_subtrees_p
= 0;
5061 WALK_SUBTREE (TREE_PURPOSE (*tp
));
5065 WALK_SUBTREE (OVL_FUNCTION (*tp
));
5066 WALK_SUBTREE (OVL_CHAIN (*tp
));
5067 *walk_subtrees_p
= 0;
5071 WALK_SUBTREE (DECL_NAME (*tp
));
5072 WALK_SUBTREE (USING_DECL_SCOPE (*tp
));
5073 WALK_SUBTREE (USING_DECL_DECLS (*tp
));
5074 *walk_subtrees_p
= 0;
5078 if (TYPE_PTRMEMFUNC_P (*tp
))
5079 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE_RAW (*tp
));
5082 case TYPE_ARGUMENT_PACK
:
5083 case NONTYPE_ARGUMENT_PACK
:
5085 tree args
= ARGUMENT_PACK_ARGS (*tp
);
5086 int i
, len
= TREE_VEC_LENGTH (args
);
5087 for (i
= 0; i
< len
; i
++)
5088 WALK_SUBTREE (TREE_VEC_ELT (args
, i
));
5092 case TYPE_PACK_EXPANSION
:
5093 WALK_SUBTREE (TREE_TYPE (*tp
));
5094 WALK_SUBTREE (PACK_EXPANSION_EXTRA_ARGS (*tp
));
5095 *walk_subtrees_p
= 0;
5098 case EXPR_PACK_EXPANSION
:
5099 WALK_SUBTREE (TREE_OPERAND (*tp
, 0));
5100 WALK_SUBTREE (PACK_EXPANSION_EXTRA_ARGS (*tp
));
5101 *walk_subtrees_p
= 0;
5105 case REINTERPRET_CAST_EXPR
:
5106 case STATIC_CAST_EXPR
:
5107 case CONST_CAST_EXPR
:
5108 case DYNAMIC_CAST_EXPR
:
5109 case IMPLICIT_CONV_EXPR
:
5110 if (TREE_TYPE (*tp
))
5111 WALK_SUBTREE (TREE_TYPE (*tp
));
5115 for (i
= 0; i
< TREE_CODE_LENGTH (TREE_CODE (*tp
)); ++i
)
5116 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
5118 *walk_subtrees_p
= 0;
5122 if (COMPOUND_LITERAL_P (*tp
))
5123 WALK_SUBTREE (TREE_TYPE (*tp
));
5127 WALK_SUBTREE (TRAIT_EXPR_TYPE1 (*tp
));
5128 WALK_SUBTREE (TRAIT_EXPR_TYPE2 (*tp
));
5129 *walk_subtrees_p
= 0;
5133 ++cp_unevaluated_operand
;
5134 /* We can't use WALK_SUBTREE here because of the goto. */
5135 result
= cp_walk_tree (&DECLTYPE_TYPE_EXPR (*tp
), func
, data
, pset
);
5136 --cp_unevaluated_operand
;
5137 *walk_subtrees_p
= 0;
5143 ++cp_unevaluated_operand
;
5144 result
= cp_walk_tree (&TREE_OPERAND (*tp
, 0), func
, data
, pset
);
5145 --cp_unevaluated_operand
;
5146 *walk_subtrees_p
= 0;
5150 // Only recurse through the nested expression. Do not
5151 // walk the parameter list. Doing so causes false
5152 // positives in the pack expansion checker since the
5153 // requires parameters are introduced as pack expansions.
5154 WALK_SUBTREE (TREE_OPERAND (*tp
, 1));
5155 *walk_subtrees_p
= 0;
5159 /* User variables should be mentioned in BIND_EXPR_VARS
5160 and their initializers and sizes walked when walking
5161 the containing BIND_EXPR. Compiler temporaries are
5162 handled here. And also normal variables in templates,
5163 since do_poplevel doesn't build a BIND_EXPR then. */
5164 if (VAR_P (TREE_OPERAND (*tp
, 0))
5165 && (processing_template_decl
5166 || (DECL_ARTIFICIAL (TREE_OPERAND (*tp
, 0))
5167 && !TREE_STATIC (TREE_OPERAND (*tp
, 0)))))
5169 tree decl
= TREE_OPERAND (*tp
, 0);
5170 WALK_SUBTREE (DECL_INITIAL (decl
));
5171 WALK_SUBTREE (DECL_SIZE (decl
));
5172 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
5177 /* Don't walk into the body of the lambda, but the capture initializers
5178 are part of the enclosing context. */
5179 for (tree cap
= LAMBDA_EXPR_CAPTURE_LIST (*tp
); cap
;
5180 cap
= TREE_CHAIN (cap
))
5181 WALK_SUBTREE (TREE_VALUE (cap
));
5185 if (TREE_OPERAND (*tp
, 1))
5186 /* Operand 1 is the tree for the relevant co_await which has any
5187 interesting sub-trees. */
5188 WALK_SUBTREE (TREE_OPERAND (*tp
, 1));
5192 if (TREE_OPERAND (*tp
, 1))
5193 /* Operand 1 is frame variable. */
5194 WALK_SUBTREE (TREE_OPERAND (*tp
, 1));
5195 if (TREE_OPERAND (*tp
, 2))
5196 /* Operand 2 has the initialiser, and we need to walk any subtrees
5198 WALK_SUBTREE (TREE_OPERAND (*tp
, 2));
5201 case CO_RETURN_EXPR
:
5202 if (TREE_OPERAND (*tp
, 0))
5204 if (VOID_TYPE_P (TREE_OPERAND (*tp
, 0)))
5205 /* For void expressions, operand 1 is a trivial call, and any
5206 interesting subtrees will be part of operand 0. */
5207 WALK_SUBTREE (TREE_OPERAND (*tp
, 0));
5208 else if (TREE_OPERAND (*tp
, 1))
5209 /* Interesting sub-trees will be in the return_value () call
5211 WALK_SUBTREE (TREE_OPERAND (*tp
, 1));
5219 /* We didn't find what we were looking for. */
5226 /* Like save_expr, but for C++. */
5229 cp_save_expr (tree expr
)
5231 /* There is no reason to create a SAVE_EXPR within a template; if
5232 needed, we can create the SAVE_EXPR when instantiating the
5233 template. Furthermore, the middle-end cannot handle C++-specific
5235 if (processing_template_decl
)
5238 /* TARGET_EXPRs are only expanded once. */
5239 if (TREE_CODE (expr
) == TARGET_EXPR
)
5242 return save_expr (expr
);
5245 /* Initialize tree.c. */
5250 list_hash_table
= hash_table
<list_hasher
>::create_ggc (61);
5251 register_scoped_attributes (std_attribute_table
, NULL
);
5254 /* Returns the kind of special function that DECL (a FUNCTION_DECL)
5255 is. Note that sfk_none is zero, so this function can be used as a
5256 predicate to test whether or not DECL is a special function. */
5258 special_function_kind
5259 special_function_p (const_tree decl
)
5261 /* Rather than doing all this stuff with magic names, we should
5262 probably have a field of type `special_function_kind' in
5263 DECL_LANG_SPECIFIC. */
5264 if (DECL_INHERITED_CTOR (decl
))
5265 return sfk_inheriting_constructor
;
5266 if (DECL_COPY_CONSTRUCTOR_P (decl
))
5267 return sfk_copy_constructor
;
5268 if (DECL_MOVE_CONSTRUCTOR_P (decl
))
5269 return sfk_move_constructor
;
5270 if (DECL_CONSTRUCTOR_P (decl
))
5271 return sfk_constructor
;
5272 if (DECL_ASSIGNMENT_OPERATOR_P (decl
)
5273 && DECL_OVERLOADED_OPERATOR_IS (decl
, NOP_EXPR
))
5275 if (copy_fn_p (decl
))
5276 return sfk_copy_assignment
;
5277 if (move_fn_p (decl
))
5278 return sfk_move_assignment
;
5280 if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl
))
5281 return sfk_destructor
;
5282 if (DECL_COMPLETE_DESTRUCTOR_P (decl
))
5283 return sfk_complete_destructor
;
5284 if (DECL_BASE_DESTRUCTOR_P (decl
))
5285 return sfk_base_destructor
;
5286 if (DECL_DELETING_DESTRUCTOR_P (decl
))
5287 return sfk_deleting_destructor
;
5288 if (DECL_CONV_FN_P (decl
))
5289 return sfk_conversion
;
5290 if (deduction_guide_p (decl
))
5291 return sfk_deduction_guide
;
5292 if (DECL_OVERLOADED_OPERATOR_CODE_RAW (decl
) >= OVL_OP_EQ_EXPR
5293 && DECL_OVERLOADED_OPERATOR_CODE_RAW (decl
) <= OVL_OP_SPACESHIP_EXPR
)
5294 return sfk_comparison
;
5299 /* As above, but only if DECL is a special member function as per 11.3.3
5300 [special]: default/copy/move ctor, copy/move assignment, or destructor. */
5302 special_function_kind
5303 special_memfn_p (const_tree decl
)
5305 switch (special_function_kind sfk
= special_function_p (decl
))
5307 case sfk_constructor
:
5308 if (!default_ctor_p (decl
))
5311 case sfk_copy_constructor
:
5312 case sfk_copy_assignment
:
5313 case sfk_move_assignment
:
5314 case sfk_move_constructor
:
5315 case sfk_destructor
:
5324 /* Returns nonzero if TYPE is a character type, including wchar_t. */
5327 char_type_p (tree type
)
5329 return (same_type_p (type
, char_type_node
)
5330 || same_type_p (type
, unsigned_char_type_node
)
5331 || same_type_p (type
, signed_char_type_node
)
5332 || same_type_p (type
, char8_type_node
)
5333 || same_type_p (type
, char16_type_node
)
5334 || same_type_p (type
, char32_type_node
)
5335 || same_type_p (type
, wchar_type_node
));
5338 /* Returns the kind of linkage associated with the indicated DECL. Th
5339 value returned is as specified by the language standard; it is
5340 independent of implementation details regarding template
5341 instantiation, etc. For example, it is possible that a declaration
5342 to which this function assigns external linkage would not show up
5343 as a global symbol when you run `nm' on the resulting object file. */
5346 decl_linkage (tree decl
)
5348 /* This function doesn't attempt to calculate the linkage from first
5349 principles as given in [basic.link]. Instead, it makes use of
5350 the fact that we have already set TREE_PUBLIC appropriately, and
5351 then handles a few special cases. Ideally, we would calculate
5352 linkage first, and then transform that into a concrete
5355 /* Things that don't have names have no linkage. */
5356 if (!DECL_NAME (decl
))
5359 /* Fields have no linkage. */
5360 if (TREE_CODE (decl
) == FIELD_DECL
)
5363 /* Things in local scope do not have linkage. */
5364 if (decl_function_context (decl
))
5367 /* Things that are TREE_PUBLIC have external linkage. */
5368 if (TREE_PUBLIC (decl
))
5371 /* maybe_thunk_body clears TREE_PUBLIC on the maybe-in-charge 'tor variants,
5372 check one of the "clones" for the real linkage. */
5373 if (DECL_MAYBE_IN_CHARGE_CDTOR_P (decl
)
5374 && DECL_CHAIN (decl
)
5375 && DECL_CLONED_FUNCTION_P (DECL_CHAIN (decl
)))
5376 return decl_linkage (DECL_CHAIN (decl
));
5378 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
5381 /* Linkage of a CONST_DECL depends on the linkage of the enumeration
5383 if (TREE_CODE (decl
) == CONST_DECL
)
5384 return decl_linkage (TYPE_NAME (DECL_CONTEXT (decl
)));
5386 /* Members of the anonymous namespace also have TREE_PUBLIC unset, but
5387 are considered to have external linkage for language purposes, as do
5388 template instantiations on targets without weak symbols. DECLs really
5389 meant to have internal linkage have DECL_THIS_STATIC set. */
5390 if (TREE_CODE (decl
) == TYPE_DECL
)
5392 if (VAR_OR_FUNCTION_DECL_P (decl
))
5394 if (!DECL_THIS_STATIC (decl
))
5397 /* Static data members and static member functions from classes
5398 in anonymous namespace also don't have TREE_PUBLIC set. */
5399 if (DECL_CLASS_CONTEXT (decl
))
5403 /* Everything else has internal linkage. */
5407 /* Returns the storage duration of the object or reference associated with
5408 the indicated DECL, which should be a VAR_DECL or PARM_DECL. */
5411 decl_storage_duration (tree decl
)
5413 if (TREE_CODE (decl
) == PARM_DECL
)
5415 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5417 gcc_assert (VAR_P (decl
));
5418 if (!TREE_STATIC (decl
)
5419 && !DECL_EXTERNAL (decl
))
5421 if (CP_DECL_THREAD_LOCAL_P (decl
))
5426 /* EXP is an expression that we want to pre-evaluate. Returns (in
5427 *INITP) an expression that will perform the pre-evaluation. The
5428 value returned by this function is a side-effect free expression
5429 equivalent to the pre-evaluated expression. Callers must ensure
5430 that *INITP is evaluated before EXP. */
5433 stabilize_expr (tree exp
, tree
* initp
)
5437 if (!TREE_SIDE_EFFECTS (exp
))
5438 init_expr
= NULL_TREE
;
5439 else if (VOID_TYPE_P (TREE_TYPE (exp
)))
5444 /* There are no expressions with REFERENCE_TYPE, but there can be call
5445 arguments with such a type; just treat it as a pointer. */
5446 else if (TYPE_REF_P (TREE_TYPE (exp
))
5447 || SCALAR_TYPE_P (TREE_TYPE (exp
))
5448 || !glvalue_p (exp
))
5450 init_expr
= get_target_expr (exp
);
5451 exp
= TARGET_EXPR_SLOT (init_expr
);
5452 if (CLASS_TYPE_P (TREE_TYPE (exp
)))
5459 bool xval
= !lvalue_p (exp
);
5460 exp
= cp_build_addr_expr (exp
, tf_warning_or_error
);
5461 init_expr
= get_target_expr (exp
);
5462 exp
= TARGET_EXPR_SLOT (init_expr
);
5463 exp
= cp_build_fold_indirect_ref (exp
);
5469 gcc_assert (!TREE_SIDE_EFFECTS (exp
));
5473 /* Add NEW_EXPR, an expression whose value we don't care about, after the
5474 similar expression ORIG. */
5477 add_stmt_to_compound (tree orig
, tree new_expr
)
5479 if (!new_expr
|| !TREE_SIDE_EFFECTS (new_expr
))
5481 if (!orig
|| !TREE_SIDE_EFFECTS (orig
))
5483 return build2 (COMPOUND_EXPR
, void_type_node
, orig
, new_expr
);
5486 /* Like stabilize_expr, but for a call whose arguments we want to
5487 pre-evaluate. CALL is modified in place to use the pre-evaluated
5488 arguments, while, upon return, *INITP contains an expression to
5489 compute the arguments. */
5492 stabilize_call (tree call
, tree
*initp
)
5494 tree inits
= NULL_TREE
;
5496 int nargs
= call_expr_nargs (call
);
5498 if (call
== error_mark_node
|| processing_template_decl
)
5504 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
5506 for (i
= 0; i
< nargs
; i
++)
5509 CALL_EXPR_ARG (call
, i
) =
5510 stabilize_expr (CALL_EXPR_ARG (call
, i
), &init
);
5511 inits
= add_stmt_to_compound (inits
, init
);
5517 /* Like stabilize_expr, but for an AGGR_INIT_EXPR whose arguments we want
5518 to pre-evaluate. CALL is modified in place to use the pre-evaluated
5519 arguments, while, upon return, *INITP contains an expression to
5520 compute the arguments. */
5523 stabilize_aggr_init (tree call
, tree
*initp
)
5525 tree inits
= NULL_TREE
;
5527 int nargs
= aggr_init_expr_nargs (call
);
5529 if (call
== error_mark_node
)
5532 gcc_assert (TREE_CODE (call
) == AGGR_INIT_EXPR
);
5534 for (i
= 0; i
< nargs
; i
++)
5537 AGGR_INIT_EXPR_ARG (call
, i
) =
5538 stabilize_expr (AGGR_INIT_EXPR_ARG (call
, i
), &init
);
5539 inits
= add_stmt_to_compound (inits
, init
);
5545 /* Like stabilize_expr, but for an initialization.
5547 If the initialization is for an object of class type, this function
5548 takes care not to introduce additional temporaries.
5550 Returns TRUE iff the expression was successfully pre-evaluated,
5551 i.e., if INIT is now side-effect free, except for, possibly, a
5552 single call to a constructor. */
5555 stabilize_init (tree init
, tree
*initp
)
5561 if (t
== error_mark_node
|| processing_template_decl
)
5564 if (TREE_CODE (t
) == INIT_EXPR
)
5565 t
= TREE_OPERAND (t
, 1);
5566 if (TREE_CODE (t
) == TARGET_EXPR
)
5567 t
= TARGET_EXPR_INITIAL (t
);
5569 /* If the RHS can be stabilized without breaking copy elision, stabilize
5570 it. We specifically don't stabilize class prvalues here because that
5571 would mean an extra copy, but they might be stabilized below. */
5572 if (TREE_CODE (init
) == INIT_EXPR
5573 && TREE_CODE (t
) != CONSTRUCTOR
5574 && TREE_CODE (t
) != AGGR_INIT_EXPR
5575 && (SCALAR_TYPE_P (TREE_TYPE (t
))
5578 TREE_OPERAND (init
, 1) = stabilize_expr (t
, initp
);
5582 if (TREE_CODE (t
) == COMPOUND_EXPR
5583 && TREE_CODE (init
) == INIT_EXPR
)
5585 tree last
= expr_last (t
);
5586 /* Handle stabilizing the EMPTY_CLASS_EXPR pattern. */
5587 if (!TREE_SIDE_EFFECTS (last
))
5590 TREE_OPERAND (init
, 1) = last
;
5595 if (TREE_CODE (t
) == CONSTRUCTOR
)
5597 /* Aggregate initialization: stabilize each of the field
5600 constructor_elt
*ce
;
5602 vec
<constructor_elt
, va_gc
> *v
= CONSTRUCTOR_ELTS (t
);
5603 for (i
= 0; vec_safe_iterate (v
, i
, &ce
); ++i
)
5605 tree type
= TREE_TYPE (ce
->value
);
5607 if (TYPE_REF_P (type
)
5608 || SCALAR_TYPE_P (type
))
5609 ce
->value
= stabilize_expr (ce
->value
, &subinit
);
5610 else if (!stabilize_init (ce
->value
, &subinit
))
5612 *initp
= add_stmt_to_compound (*initp
, subinit
);
5617 if (TREE_CODE (t
) == CALL_EXPR
)
5619 stabilize_call (t
, initp
);
5623 if (TREE_CODE (t
) == AGGR_INIT_EXPR
)
5625 stabilize_aggr_init (t
, initp
);
5629 /* The initialization is being performed via a bitwise copy -- and
5630 the item copied may have side effects. */
5631 return !TREE_SIDE_EFFECTS (init
);
5634 /* Returns true if a cast to TYPE may appear in an integral constant
5638 cast_valid_in_integral_constant_expression_p (tree type
)
5640 return (INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
5641 || cxx_dialect
>= cxx11
5642 || dependent_type_p (type
)
5643 || type
== error_mark_node
);
5646 /* Return true if we need to fix linkage information of DECL. */
5649 cp_fix_function_decl_p (tree decl
)
5651 /* Skip if DECL is not externally visible. */
5652 if (!TREE_PUBLIC (decl
))
5655 /* We need to fix DECL if it a appears to be exported but with no
5656 function body. Thunks do not have CFGs and we may need to
5657 handle them specially later. */
5658 if (!gimple_has_body_p (decl
)
5659 && !DECL_THUNK_P (decl
)
5660 && !DECL_EXTERNAL (decl
))
5662 struct cgraph_node
*node
= cgraph_node::get (decl
);
5664 /* Don't fix same_body aliases. Although they don't have their own
5665 CFG, they share it with what they alias to. */
5666 if (!node
|| !node
->alias
5667 || !vec_safe_length (node
->ref_list
.references
))
5674 /* Clean the C++ specific parts of the tree T. */
5677 cp_free_lang_data (tree t
)
5679 if (FUNC_OR_METHOD_TYPE_P (t
))
5681 /* Default args are not interesting anymore. */
5682 tree argtypes
= TYPE_ARG_TYPES (t
);
5685 TREE_PURPOSE (argtypes
) = 0;
5686 argtypes
= TREE_CHAIN (argtypes
);
5689 else if (TREE_CODE (t
) == FUNCTION_DECL
5690 && cp_fix_function_decl_p (t
))
5692 /* If T is used in this translation unit at all, the definition
5693 must exist somewhere else since we have decided to not emit it
5694 in this TU. So make it an external reference. */
5695 DECL_EXTERNAL (t
) = 1;
5696 TREE_STATIC (t
) = 0;
5698 if (TREE_CODE (t
) == FUNCTION_DECL
)
5699 discard_operator_bindings (t
);
5700 if (TREE_CODE (t
) == NAMESPACE_DECL
)
5701 /* We do not need the leftover chaining of namespaces from the
5703 DECL_CHAIN (t
) = NULL_TREE
;
5706 /* Stub for c-common. Please keep in sync with c-decl.c.
5707 FIXME: If address space support is target specific, then this
5708 should be a C target hook. But currently this is not possible,
5709 because this function is called via REGISTER_TARGET_PRAGMAS. */
5711 c_register_addr_space (const char * /*word*/, addr_space_t
/*as*/)
5715 /* Return the number of operands in T that we care about for things like
5719 cp_tree_operand_length (const_tree t
)
5721 enum tree_code code
= TREE_CODE (t
);
5723 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
5724 return VL_EXP_OPERAND_LENGTH (t
);
5726 return cp_tree_code_length (code
);
5729 /* Like cp_tree_operand_length, but takes a tree_code CODE. */
5732 cp_tree_code_length (enum tree_code code
)
5734 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
5738 case PREINCREMENT_EXPR
:
5739 case PREDECREMENT_EXPR
:
5740 case POSTINCREMENT_EXPR
:
5741 case POSTDECREMENT_EXPR
:
5747 case EXPR_PACK_EXPANSION
:
5751 return TREE_CODE_LENGTH (code
);
5755 /* Like EXPR_LOCATION, but also handle some tcc_exceptional that have
5759 cp_expr_location (const_tree t_
)
5761 tree t
= CONST_CAST_TREE (t_
);
5763 return UNKNOWN_LOCATION
;
5764 switch (TREE_CODE (t
))
5767 return LAMBDA_EXPR_LOCATION (t
);
5769 return STATIC_ASSERT_SOURCE_LOCATION (t
);
5771 return TRAIT_EXPR_LOCATION (t
);
5773 return EXPR_LOCATION (t
);
5777 /* Implement -Wzero_as_null_pointer_constant. Return true if the
5778 conditions for the warning hold, false otherwise. */
5780 maybe_warn_zero_as_null_pointer_constant (tree expr
, location_t loc
)
5782 if (c_inhibit_evaluation_warnings
== 0
5783 && !null_node_p (expr
) && !NULLPTR_TYPE_P (TREE_TYPE (expr
)))
5785 warning_at (loc
, OPT_Wzero_as_null_pointer_constant
,
5786 "zero as null pointer constant");
5792 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
5793 /* Complain that some language-specific thing hanging off a tree
5794 node has been accessed improperly. */
5797 lang_check_failed (const char* file
, int line
, const char* function
)
5799 internal_error ("%<lang_*%> check: failed in %s, at %s:%d",
5800 function
, trim_filename (file
), line
);
5802 #endif /* ENABLE_TREE_CHECKING */
5806 namespace selftest
{
5808 /* Verify that lvalue_kind () works, for various expressions,
5809 and that location wrappers don't affect the results. */
5814 location_t loc
= BUILTINS_LOCATION
;
5816 /* Verify constants and parameters, without and with
5817 location wrappers. */
5818 tree int_cst
= build_int_cst (integer_type_node
, 42);
5819 ASSERT_EQ (clk_none
, lvalue_kind (int_cst
));
5821 tree wrapped_int_cst
= maybe_wrap_with_location (int_cst
, loc
);
5822 ASSERT_TRUE (location_wrapper_p (wrapped_int_cst
));
5823 ASSERT_EQ (clk_none
, lvalue_kind (wrapped_int_cst
));
5825 tree string_lit
= build_string (4, "foo");
5826 TREE_TYPE (string_lit
) = char_array_type_node
;
5827 string_lit
= fix_string_type (string_lit
);
5828 ASSERT_EQ (clk_ordinary
, lvalue_kind (string_lit
));
5830 tree wrapped_string_lit
= maybe_wrap_with_location (string_lit
, loc
);
5831 ASSERT_TRUE (location_wrapper_p (wrapped_string_lit
));
5832 ASSERT_EQ (clk_ordinary
, lvalue_kind (wrapped_string_lit
));
5834 tree parm
= build_decl (UNKNOWN_LOCATION
, PARM_DECL
,
5835 get_identifier ("some_parm"),
5837 ASSERT_EQ (clk_ordinary
, lvalue_kind (parm
));
5839 tree wrapped_parm
= maybe_wrap_with_location (parm
, loc
);
5840 ASSERT_TRUE (location_wrapper_p (wrapped_parm
));
5841 ASSERT_EQ (clk_ordinary
, lvalue_kind (wrapped_parm
));
5843 /* Verify that lvalue_kind of std::move on a parm isn't
5844 affected by location wrappers. */
5845 tree rvalue_ref_of_parm
= move (parm
);
5846 ASSERT_EQ (clk_rvalueref
, lvalue_kind (rvalue_ref_of_parm
));
5847 tree rvalue_ref_of_wrapped_parm
= move (wrapped_parm
);
5848 ASSERT_EQ (clk_rvalueref
, lvalue_kind (rvalue_ref_of_wrapped_parm
));
5850 /* Verify lvalue_p. */
5851 ASSERT_FALSE (lvalue_p (int_cst
));
5852 ASSERT_FALSE (lvalue_p (wrapped_int_cst
));
5853 ASSERT_TRUE (lvalue_p (parm
));
5854 ASSERT_TRUE (lvalue_p (wrapped_parm
));
5855 ASSERT_FALSE (lvalue_p (rvalue_ref_of_parm
));
5856 ASSERT_FALSE (lvalue_p (rvalue_ref_of_wrapped_parm
));
5859 /* Run all of the selftests within this file. */
5864 test_lvalue_kind ();
5867 } // namespace selftest
5869 #endif /* #if CHECKING_P */
5872 #include "gt-cp-tree.h"