1 /* Language-dependent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2015 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"
28 #include "double-int.h"
35 #include "fold-const.h"
36 #include "tree-hasher.h"
37 #include "stor-layout.h"
38 #include "print-tree.h"
39 #include "tree-iterator.h"
42 #include "tree-inline.h"
47 #include "plugin-api.h"
48 #include "hard-reg-set.h"
53 #include "splay-tree.h"
54 #include "hash-table.h"
55 #include "gimple-expr.h"
59 static tree bot_manip (tree *, int *, void *);
60 static tree bot_replace (tree *, int *, void *);
61 static hashval_t list_hash_pieces (tree, tree, tree);
62 static tree build_target_expr (tree, tree, tsubst_flags_t);
63 static tree count_trees_r (tree *, int *, void *);
64 static tree verify_stmt_tree_r (tree *, int *, void *);
65 static tree build_local_temp (tree);
67 static tree handle_java_interface_attribute (tree *, tree, tree, int, bool *);
68 static tree handle_com_interface_attribute (tree *, tree, tree, int, bool *);
69 static tree handle_init_priority_attribute (tree *, tree, tree, int, bool *);
70 static tree handle_abi_tag_attribute (tree *, tree, tree, int, bool *);
72 /* If REF is an lvalue, returns the kind of lvalue that REF is.
73 Otherwise, returns clk_none. */
76 lvalue_kind (const_tree ref)
78 cp_lvalue_kind op1_lvalue_kind = clk_none;
79 cp_lvalue_kind op2_lvalue_kind = clk_none;
81 /* Expressions of reference type are sometimes wrapped in
82 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
83 representation, not part of the language, so we have to look
85 if (REFERENCE_REF_P (ref))
86 return lvalue_kind (TREE_OPERAND (ref, 0));
89 && TREE_CODE (TREE_TYPE (ref)) == REFERENCE_TYPE)
91 /* unnamed rvalue references are rvalues */
92 if (TYPE_REF_IS_RVALUE (TREE_TYPE (ref))
93 && TREE_CODE (ref) != PARM_DECL
95 && TREE_CODE (ref) != COMPONENT_REF
96 /* Functions are always lvalues. */
97 && TREE_CODE (TREE_TYPE (TREE_TYPE (ref))) != FUNCTION_TYPE)
100 /* lvalue references and named rvalue references are lvalues. */
104 if (ref == current_class_ptr)
107 switch (TREE_CODE (ref))
111 /* preincrements and predecrements are valid lvals, provided
112 what they refer to are valid lvals. */
113 case PREINCREMENT_EXPR:
114 case PREDECREMENT_EXPR:
116 case WITH_CLEANUP_EXPR:
119 return lvalue_kind (TREE_OPERAND (ref, 0));
123 if (TREE_CODE (ref) == MEMBER_REF)
124 op1_lvalue_kind = clk_ordinary;
126 op1_lvalue_kind = lvalue_kind (TREE_OPERAND (ref, 0));
127 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (ref, 1))))
128 op1_lvalue_kind = clk_none;
129 return op1_lvalue_kind;
132 op1_lvalue_kind = lvalue_kind (TREE_OPERAND (ref, 0));
133 /* Look at the member designator. */
134 if (!op1_lvalue_kind)
136 else if (is_overloaded_fn (TREE_OPERAND (ref, 1)))
137 /* The "field" can be a FUNCTION_DECL or an OVERLOAD in some
138 situations. If we're seeing a COMPONENT_REF, it's a non-static
139 member, so it isn't an lvalue. */
140 op1_lvalue_kind = clk_none;
141 else if (TREE_CODE (TREE_OPERAND (ref, 1)) != FIELD_DECL)
142 /* This can be IDENTIFIER_NODE in a template. */;
143 else if (DECL_C_BIT_FIELD (TREE_OPERAND (ref, 1)))
145 /* Clear the ordinary bit. If this object was a class
146 rvalue we want to preserve that information. */
147 op1_lvalue_kind &= ~clk_ordinary;
148 /* The lvalue is for a bitfield. */
149 op1_lvalue_kind |= clk_bitfield;
151 else if (DECL_PACKED (TREE_OPERAND (ref, 1)))
152 op1_lvalue_kind |= clk_packed;
154 return op1_lvalue_kind;
157 case COMPOUND_LITERAL_EXPR:
161 /* CONST_DECL without TREE_STATIC are enumeration values and
162 thus not lvalues. With TREE_STATIC they are used by ObjC++
163 in objc_build_string_object and need to be considered as
165 if (! TREE_STATIC (ref))
168 if (TREE_READONLY (ref) && ! TREE_STATIC (ref)
169 && DECL_LANG_SPECIFIC (ref)
170 && DECL_IN_AGGR_P (ref))
175 case ARRAY_NOTATION_REF:
178 case PLACEHOLDER_EXPR:
181 /* A scope ref in a template, left as SCOPE_REF to support later
184 gcc_assert (!type_dependent_expression_p (CONST_CAST_TREE (ref)));
186 tree op = TREE_OPERAND (ref, 1);
187 if (TREE_CODE (op) == FIELD_DECL)
188 return (DECL_C_BIT_FIELD (op) ? clk_bitfield : clk_ordinary);
190 return lvalue_kind (op);
195 /* Disallow <? and >? as lvalues if either argument side-effects. */
196 if (TREE_SIDE_EFFECTS (TREE_OPERAND (ref, 0))
197 || TREE_SIDE_EFFECTS (TREE_OPERAND (ref, 1)))
199 op1_lvalue_kind = lvalue_kind (TREE_OPERAND (ref, 0));
200 op2_lvalue_kind = lvalue_kind (TREE_OPERAND (ref, 1));
204 op1_lvalue_kind = lvalue_kind (TREE_OPERAND (ref, 1)
205 ? TREE_OPERAND (ref, 1)
206 : TREE_OPERAND (ref, 0));
207 op2_lvalue_kind = lvalue_kind (TREE_OPERAND (ref, 2));
215 return lvalue_kind (TREE_OPERAND (ref, 1));
221 return (CLASS_TYPE_P (TREE_TYPE (ref)) ? clk_class : clk_none);
224 /* We can see calls outside of TARGET_EXPR in templates. */
225 if (CLASS_TYPE_P (TREE_TYPE (ref)))
230 /* All functions (except non-static-member functions) are
232 return (DECL_NONSTATIC_MEMBER_FUNCTION_P (ref)
233 ? clk_none : clk_ordinary);
236 /* We now represent a reference to a single static member function
238 /* This CONST_CAST is okay because BASELINK_FUNCTIONS returns
239 its argument unmodified and we assign it to a const_tree. */
240 return lvalue_kind (BASELINK_FUNCTIONS (CONST_CAST_TREE (ref)));
242 case NON_DEPENDENT_EXPR:
243 /* We just return clk_ordinary for NON_DEPENDENT_EXPR in C++98, but
244 in C++11 lvalues don't bind to rvalue references, so we need to
245 work harder to avoid bogus errors (c++/44870). */
246 if (cxx_dialect < cxx11)
249 return lvalue_kind (TREE_OPERAND (ref, 0));
252 if (!TREE_TYPE (ref))
254 if (CLASS_TYPE_P (TREE_TYPE (ref)))
259 /* If one operand is not an lvalue at all, then this expression is
261 if (!op1_lvalue_kind || !op2_lvalue_kind)
264 /* Otherwise, it's an lvalue, and it has all the odd properties
265 contributed by either operand. */
266 op1_lvalue_kind = op1_lvalue_kind | op2_lvalue_kind;
267 /* It's not an ordinary lvalue if it involves any other kind. */
268 if ((op1_lvalue_kind & ~clk_ordinary) != clk_none)
269 op1_lvalue_kind &= ~clk_ordinary;
270 /* It can't be both a pseudo-lvalue and a non-addressable lvalue.
271 A COND_EXPR of those should be wrapped in a TARGET_EXPR. */
272 if ((op1_lvalue_kind & (clk_rvalueref|clk_class))
273 && (op1_lvalue_kind & (clk_bitfield|clk_packed)))
274 op1_lvalue_kind = clk_none;
275 return op1_lvalue_kind;
278 /* Returns the kind of lvalue that REF is, in the sense of
279 [basic.lval]. This function should really be named lvalue_p; it
280 computes the C++ definition of lvalue. */
283 real_lvalue_p (const_tree ref)
285 cp_lvalue_kind kind = lvalue_kind (ref);
286 if (kind & (clk_rvalueref|clk_class))
292 /* This differs from real_lvalue_p in that class rvalues are considered
296 lvalue_p (const_tree ref)
298 return (lvalue_kind (ref) != clk_none);
301 /* This differs from real_lvalue_p in that rvalues formed by dereferencing
302 rvalue references are considered rvalues. */
305 lvalue_or_rvalue_with_address_p (const_tree ref)
307 cp_lvalue_kind kind = lvalue_kind (ref);
308 if (kind & clk_class)
311 return (kind != clk_none);
314 /* Returns true if REF is an xvalue, false otherwise. */
317 xvalue_p (const_tree ref)
319 return (lvalue_kind (ref) == clk_rvalueref);
322 /* Test whether DECL is a builtin that may appear in a
323 constant-expression. */
326 builtin_valid_in_constant_expr_p (const_tree decl)
328 /* At present BUILT_IN_CONSTANT_P is the only builtin we're allowing
329 in constant-expressions. We may want to add other builtins later. */
330 return DECL_IS_BUILTIN_CONSTANT_P (decl);
333 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
336 build_target_expr (tree decl, tree value, tsubst_flags_t complain)
339 tree type = TREE_TYPE (decl);
341 #ifdef ENABLE_CHECKING
342 gcc_assert (VOID_TYPE_P (TREE_TYPE (value))
343 || TREE_TYPE (decl) == TREE_TYPE (value)
344 /* On ARM ctors return 'this'. */
345 || (TYPE_PTR_P (TREE_TYPE (value))
346 && TREE_CODE (value) == CALL_EXPR)
347 || useless_type_conversion_p (TREE_TYPE (decl),
351 t = cxx_maybe_build_cleanup (decl, complain);
352 if (t == error_mark_node)
353 return error_mark_node;
354 t = build4 (TARGET_EXPR, type, decl, value, t, NULL_TREE);
355 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
356 ignore the TARGET_EXPR. If there really turn out to be no
357 side-effects, then the optimizer should be able to get rid of
358 whatever code is generated anyhow. */
359 TREE_SIDE_EFFECTS (t) = 1;
364 /* Return an undeclared local temporary of type TYPE for use in building a
368 build_local_temp (tree type)
370 tree slot = build_decl (input_location,
371 VAR_DECL, NULL_TREE, type);
372 DECL_ARTIFICIAL (slot) = 1;
373 DECL_IGNORED_P (slot) = 1;
374 DECL_CONTEXT (slot) = current_function_decl;
375 layout_decl (slot, 0);
379 /* Set various status flags when building an AGGR_INIT_EXPR object T. */
382 process_aggr_init_operands (tree t)
386 side_effects = TREE_SIDE_EFFECTS (t);
390 n = TREE_OPERAND_LENGTH (t);
391 for (i = 1; i < n; i++)
393 tree op = TREE_OPERAND (t, i);
394 if (op && TREE_SIDE_EFFECTS (op))
401 TREE_SIDE_EFFECTS (t) = side_effects;
404 /* Build an AGGR_INIT_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE,
405 FN, and SLOT. NARGS is the number of call arguments which are specified
406 as a tree array ARGS. */
409 build_aggr_init_array (tree return_type, tree fn, tree slot, int nargs,
415 t = build_vl_exp (AGGR_INIT_EXPR, nargs + 3);
416 TREE_TYPE (t) = return_type;
417 AGGR_INIT_EXPR_FN (t) = fn;
418 AGGR_INIT_EXPR_SLOT (t) = slot;
419 for (i = 0; i < nargs; i++)
420 AGGR_INIT_EXPR_ARG (t, i) = args[i];
421 process_aggr_init_operands (t);
425 /* INIT is a CALL_EXPR or AGGR_INIT_EXPR which needs info about its
426 target. TYPE is the type to be initialized.
428 Build an AGGR_INIT_EXPR to represent the initialization. This function
429 differs from build_cplus_new in that an AGGR_INIT_EXPR can only be used
430 to initialize another object, whereas a TARGET_EXPR can either
431 initialize another object or create its own temporary object, and as a
432 result building up a TARGET_EXPR requires that the type's destructor be
436 build_aggr_init_expr (tree type, tree init)
443 /* Don't build AGGR_INIT_EXPR in a template. */
444 if (processing_template_decl)
447 if (TREE_CODE (init) == CALL_EXPR)
448 fn = CALL_EXPR_FN (init);
449 else if (TREE_CODE (init) == AGGR_INIT_EXPR)
450 fn = AGGR_INIT_EXPR_FN (init);
452 return convert (type, init);
454 is_ctor = (TREE_CODE (fn) == ADDR_EXPR
455 && TREE_CODE (TREE_OPERAND (fn, 0)) == FUNCTION_DECL
456 && DECL_CONSTRUCTOR_P (TREE_OPERAND (fn, 0)));
458 /* We split the CALL_EXPR into its function and its arguments here.
459 Then, in expand_expr, we put them back together. The reason for
460 this is that this expression might be a default argument
461 expression. In that case, we need a new temporary every time the
462 expression is used. That's what break_out_target_exprs does; it
463 replaces every AGGR_INIT_EXPR with a copy that uses a fresh
464 temporary slot. Then, expand_expr builds up a call-expression
465 using the new slot. */
467 /* If we don't need to use a constructor to create an object of this
468 type, don't mess with AGGR_INIT_EXPR. */
469 if (is_ctor || TREE_ADDRESSABLE (type))
471 slot = build_local_temp (type);
473 if (TREE_CODE(init) == CALL_EXPR)
474 rval = build_aggr_init_array (void_type_node, fn, slot,
475 call_expr_nargs (init),
476 CALL_EXPR_ARGP (init));
478 rval = build_aggr_init_array (void_type_node, fn, slot,
479 aggr_init_expr_nargs (init),
480 AGGR_INIT_EXPR_ARGP (init));
481 TREE_SIDE_EFFECTS (rval) = 1;
482 AGGR_INIT_VIA_CTOR_P (rval) = is_ctor;
483 TREE_NOTHROW (rval) = TREE_NOTHROW (init);
484 CALL_EXPR_LIST_INIT_P (rval) = CALL_EXPR_LIST_INIT_P (init);
492 /* INIT is a CALL_EXPR or AGGR_INIT_EXPR which needs info about its
493 target. TYPE is the type that this initialization should appear to
496 Build an encapsulation of the initialization to perform
497 and return it so that it can be processed by language-independent
498 and language-specific expression expanders. */
501 build_cplus_new (tree type, tree init, tsubst_flags_t complain)
503 tree rval = build_aggr_init_expr (type, init);
506 if (!complete_type_or_maybe_complain (type, init, complain))
507 return error_mark_node;
509 /* Make sure that we're not trying to create an instance of an
511 if (abstract_virtuals_error_sfinae (NULL_TREE, type, complain))
512 return error_mark_node;
514 if (TREE_CODE (rval) == AGGR_INIT_EXPR)
515 slot = AGGR_INIT_EXPR_SLOT (rval);
516 else if (TREE_CODE (rval) == CALL_EXPR
517 || TREE_CODE (rval) == CONSTRUCTOR)
518 slot = build_local_temp (type);
522 rval = build_target_expr (slot, rval, complain);
524 if (rval != error_mark_node)
525 TARGET_EXPR_IMPLICIT_P (rval) = 1;
530 /* Subroutine of build_vec_init_expr: Build up a single element
531 intialization as a proxy for the full array initialization to get things
532 marked as used and any appropriate diagnostics.
534 Since we're deferring building the actual constructor calls until
535 gimplification time, we need to build one now and throw it away so
536 that the relevant constructor gets mark_used before cgraph decides
537 what functions are needed. Here we assume that init is either
538 NULL_TREE, void_type_node (indicating value-initialization), or
539 another array to copy. */
542 build_vec_init_elt (tree type, tree init, tsubst_flags_t complain)
544 tree inner_type = strip_array_types (type);
545 vec<tree, va_gc> *argvec;
547 if (integer_zerop (array_type_nelts_total (type))
548 || !CLASS_TYPE_P (inner_type))
549 /* No interesting initialization to do. */
550 return integer_zero_node;
551 else if (init == void_type_node)
552 return build_value_init (inner_type, complain);
554 gcc_assert (init == NULL_TREE
555 || (same_type_ignoring_top_level_qualifiers_p
556 (type, TREE_TYPE (init))));
558 argvec = make_tree_vector ();
561 tree init_type = strip_array_types (TREE_TYPE (init));
562 tree dummy = build_dummy_object (init_type);
563 if (!real_lvalue_p (init))
564 dummy = move (dummy);
565 argvec->quick_push (dummy);
567 init = build_special_member_call (NULL_TREE, complete_ctor_identifier,
568 &argvec, inner_type, LOOKUP_NORMAL,
570 release_tree_vector (argvec);
572 /* For a trivial constructor, build_over_call creates a TARGET_EXPR. But
573 we don't want one here because we aren't creating a temporary. */
574 if (TREE_CODE (init) == TARGET_EXPR)
575 init = TARGET_EXPR_INITIAL (init);
580 /* Return a TARGET_EXPR which expresses the initialization of an array to
581 be named later, either default-initialization or copy-initialization
582 from another array of the same type. */
585 build_vec_init_expr (tree type, tree init, tsubst_flags_t complain)
588 bool value_init = false;
589 tree elt_init = build_vec_init_elt (type, init, complain);
591 if (init == void_type_node)
597 slot = build_local_temp (type);
598 init = build2 (VEC_INIT_EXPR, type, slot, init);
599 TREE_SIDE_EFFECTS (init) = true;
600 SET_EXPR_LOCATION (init, input_location);
602 if (cxx_dialect >= cxx11
603 && potential_constant_expression (elt_init))
604 VEC_INIT_EXPR_IS_CONSTEXPR (init) = true;
605 VEC_INIT_EXPR_VALUE_INIT (init) = value_init;
610 /* Give a helpful diagnostic for a non-constexpr VEC_INIT_EXPR in a context
611 that requires a constant expression. */
614 diagnose_non_constexpr_vec_init (tree expr)
616 tree type = TREE_TYPE (VEC_INIT_EXPR_SLOT (expr));
618 if (VEC_INIT_EXPR_VALUE_INIT (expr))
619 init = void_type_node;
621 init = VEC_INIT_EXPR_INIT (expr);
623 elt_init = build_vec_init_elt (type, init, tf_warning_or_error);
624 require_potential_constant_expression (elt_init);
628 build_array_copy (tree init)
630 return build_vec_init_expr (TREE_TYPE (init), init, tf_warning_or_error);
633 /* Build a TARGET_EXPR using INIT to initialize a new temporary of the
637 build_target_expr_with_type (tree init, tree type, tsubst_flags_t complain)
639 gcc_assert (!VOID_TYPE_P (type));
641 if (TREE_CODE (init) == TARGET_EXPR
642 || init == error_mark_node)
644 else if (CLASS_TYPE_P (type) && type_has_nontrivial_copy_init (type)
645 && !VOID_TYPE_P (TREE_TYPE (init))
646 && TREE_CODE (init) != COND_EXPR
647 && TREE_CODE (init) != CONSTRUCTOR
648 && TREE_CODE (init) != VA_ARG_EXPR)
649 /* We need to build up a copy constructor call. A void initializer
650 means we're being called from bot_manip. COND_EXPR is a special
651 case because we already have copies on the arms and we don't want
652 another one here. A CONSTRUCTOR is aggregate initialization, which
653 is handled separately. A VA_ARG_EXPR is magic creation of an
654 aggregate; there's no additional work to be done. */
655 return force_rvalue (init, complain);
657 return force_target_expr (type, init, complain);
660 /* Like the above function, but without the checking. This function should
661 only be used by code which is deliberately trying to subvert the type
662 system, such as call_builtin_trap. Or build_over_call, to avoid
663 infinite recursion. */
666 force_target_expr (tree type, tree init, tsubst_flags_t complain)
670 gcc_assert (!VOID_TYPE_P (type));
672 slot = build_local_temp (type);
673 return build_target_expr (slot, init, complain);
676 /* Like build_target_expr_with_type, but use the type of INIT. */
679 get_target_expr_sfinae (tree init, tsubst_flags_t complain)
681 if (TREE_CODE (init) == AGGR_INIT_EXPR)
682 return build_target_expr (AGGR_INIT_EXPR_SLOT (init), init, complain);
683 else if (TREE_CODE (init) == VEC_INIT_EXPR)
684 return build_target_expr (VEC_INIT_EXPR_SLOT (init), init, complain);
686 return build_target_expr_with_type (init, TREE_TYPE (init), complain);
690 get_target_expr (tree init)
692 return get_target_expr_sfinae (init, tf_warning_or_error);
695 /* If EXPR is a bitfield reference, convert it to the declared type of
696 the bitfield, and return the resulting expression. Otherwise,
697 return EXPR itself. */
700 convert_bitfield_to_declared_type (tree expr)
704 bitfield_type = is_bitfield_expr_with_lowered_type (expr);
706 expr = convert_to_integer (TYPE_MAIN_VARIANT (bitfield_type),
711 /* EXPR is being used in an rvalue context. Return a version of EXPR
712 that is marked as an rvalue. */
719 if (error_operand_p (expr))
722 expr = mark_rvalue_use (expr);
726 Non-class rvalues always have cv-unqualified types. */
727 type = TREE_TYPE (expr);
728 if (!CLASS_TYPE_P (type) && cv_qualified_p (type))
729 type = cv_unqualified (type);
731 /* We need to do this for rvalue refs as well to get the right answer
732 from decltype; see c++/36628. */
733 if (!processing_template_decl && lvalue_or_rvalue_with_address_p (expr))
734 expr = build1 (NON_LVALUE_EXPR, type, expr);
735 else if (type != TREE_TYPE (expr))
736 expr = build_nop (type, expr);
742 struct cplus_array_info
748 struct cplus_array_hasher : ggc_hasher<tree>
750 typedef cplus_array_info *compare_type;
752 static hashval_t hash (tree t);
753 static bool equal (tree, cplus_array_info *);
756 /* Hash an ARRAY_TYPE. K is really of type `tree'. */
759 cplus_array_hasher::hash (tree t)
763 hash = TYPE_UID (TREE_TYPE (t));
765 hash ^= TYPE_UID (TYPE_DOMAIN (t));
769 /* Compare two ARRAY_TYPEs. K1 is really of type `tree', K2 is really
770 of type `cplus_array_info*'. */
773 cplus_array_hasher::equal (tree t1, cplus_array_info *t2)
775 return (TREE_TYPE (t1) == t2->type && TYPE_DOMAIN (t1) == t2->domain);
778 /* Hash table containing dependent array types, which are unsuitable for
779 the language-independent type hash table. */
780 static GTY (()) hash_table<cplus_array_hasher> *cplus_array_htab;
782 /* Build an ARRAY_TYPE without laying it out. */
785 build_min_array_type (tree elt_type, tree index_type)
787 tree t = cxx_make_type (ARRAY_TYPE);
788 TREE_TYPE (t) = elt_type;
789 TYPE_DOMAIN (t) = index_type;
793 /* Set TYPE_CANONICAL like build_array_type_1, but using
794 build_cplus_array_type. */
797 set_array_type_canon (tree t, tree elt_type, tree index_type)
799 /* Set the canonical type for this new node. */
800 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
801 || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type)))
802 SET_TYPE_STRUCTURAL_EQUALITY (t);
803 else if (TYPE_CANONICAL (elt_type) != elt_type
804 || (index_type && TYPE_CANONICAL (index_type) != index_type))
806 = build_cplus_array_type (TYPE_CANONICAL (elt_type),
808 ? TYPE_CANONICAL (index_type) : index_type);
810 TYPE_CANONICAL (t) = t;
813 /* Like build_array_type, but handle special C++ semantics: an array of a
814 variant element type is a variant of the array of the main variant of
818 build_cplus_array_type (tree elt_type, tree index_type)
822 if (elt_type == error_mark_node || index_type == error_mark_node)
823 return error_mark_node;
826 = (processing_template_decl
827 && (dependent_type_p (elt_type)
828 || (index_type && !TREE_CONSTANT (TYPE_MAX_VALUE (index_type)))));
830 if (elt_type != TYPE_MAIN_VARIANT (elt_type))
831 /* Start with an array of the TYPE_MAIN_VARIANT. */
832 t = build_cplus_array_type (TYPE_MAIN_VARIANT (elt_type),
836 /* Since type_hash_canon calls layout_type, we need to use our own
838 cplus_array_info cai;
841 if (cplus_array_htab == NULL)
842 cplus_array_htab = hash_table<cplus_array_hasher>::create_ggc (61);
844 hash = TYPE_UID (elt_type);
846 hash ^= TYPE_UID (index_type);
848 cai.domain = index_type;
850 tree *e = cplus_array_htab->find_slot_with_hash (&cai, hash, INSERT);
852 /* We have found the type: we're done. */
856 /* Build a new array type. */
857 t = build_min_array_type (elt_type, index_type);
859 /* Store it in the hash table. */
862 /* Set the canonical type for this new node. */
863 set_array_type_canon (t, elt_type, index_type);
868 t = build_array_type (elt_type, index_type);
871 /* Now check whether we already have this array variant. */
872 if (elt_type != TYPE_MAIN_VARIANT (elt_type))
875 for (t = m; t; t = TYPE_NEXT_VARIANT (t))
876 if (TREE_TYPE (t) == elt_type
877 && TYPE_NAME (t) == NULL_TREE
878 && TYPE_ATTRIBUTES (t) == NULL_TREE)
882 t = build_min_array_type (elt_type, index_type);
883 set_array_type_canon (t, elt_type, index_type);
885 TYPE_MAIN_VARIANT (t) = m;
886 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
887 TYPE_NEXT_VARIANT (m) = t;
893 /* Avoid spurious warnings with VLAs (c++/54583). */
894 if (TYPE_SIZE (t) && EXPR_P (TYPE_SIZE (t)))
895 TREE_NO_WARNING (TYPE_SIZE (t)) = 1;
897 /* Push these needs up to the ARRAY_TYPE so that initialization takes
898 place more easily. */
899 bool needs_ctor = (TYPE_NEEDS_CONSTRUCTING (t)
900 = TYPE_NEEDS_CONSTRUCTING (elt_type));
901 bool needs_dtor = (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
902 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (elt_type));
904 if (!dependent && t == TYPE_MAIN_VARIANT (t)
905 && !COMPLETE_TYPE_P (t) && COMPLETE_TYPE_P (elt_type))
907 /* The element type has been completed since the last time we saw
908 this array type; update the layout and 'tor flags for any variants
911 for (tree v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
913 TYPE_NEEDS_CONSTRUCTING (v) = needs_ctor;
914 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (v) = needs_dtor;
921 /* Return an ARRAY_TYPE with element type ELT and length N. */
924 build_array_of_n_type (tree elt, int n)
926 return build_cplus_array_type (elt, build_index_type (size_int (n - 1)));
929 /* True iff T is an N3639 array of runtime bound (VLA). These were
930 approved for C++14 but then removed. */
933 array_of_runtime_bound_p (tree t)
935 if (!t || TREE_CODE (t) != ARRAY_TYPE)
937 tree dom = TYPE_DOMAIN (t);
940 tree max = TYPE_MAX_VALUE (dom);
941 return (!potential_rvalue_constant_expression (max)
942 || (!value_dependent_expression_p (max) && !TREE_CONSTANT (max)));
945 /* Return a reference type node referring to TO_TYPE. If RVAL is
946 true, return an rvalue reference type, otherwise return an lvalue
947 reference type. If a type node exists, reuse it, otherwise create
950 cp_build_reference_type (tree to_type, bool rval)
953 lvalue_ref = build_reference_type (to_type);
957 /* This code to create rvalue reference types is based on and tied
958 to the code creating lvalue reference types in the middle-end
959 functions build_reference_type_for_mode and build_reference_type.
961 It works by putting the rvalue reference type nodes after the
962 lvalue reference nodes in the TYPE_NEXT_REF_TO linked list, so
963 they will effectively be ignored by the middle end. */
965 for (t = lvalue_ref; (t = TYPE_NEXT_REF_TO (t)); )
966 if (TYPE_REF_IS_RVALUE (t))
969 t = build_distinct_type_copy (lvalue_ref);
971 TYPE_REF_IS_RVALUE (t) = true;
972 TYPE_NEXT_REF_TO (t) = TYPE_NEXT_REF_TO (lvalue_ref);
973 TYPE_NEXT_REF_TO (lvalue_ref) = t;
975 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
976 SET_TYPE_STRUCTURAL_EQUALITY (t);
977 else if (TYPE_CANONICAL (to_type) != to_type)
979 = cp_build_reference_type (TYPE_CANONICAL (to_type), rval);
981 TYPE_CANONICAL (t) = t;
989 /* Returns EXPR cast to rvalue reference type, like std::move. */
994 tree type = TREE_TYPE (expr);
995 gcc_assert (TREE_CODE (type) != REFERENCE_TYPE);
996 type = cp_build_reference_type (type, /*rval*/true);
997 return build_static_cast (type, expr, tf_warning_or_error);
1000 /* Used by the C++ front end to build qualified array types. However,
1001 the C version of this function does not properly maintain canonical
1002 types (which are not used in C). */
1004 c_build_qualified_type (tree type, int type_quals)
1006 return cp_build_qualified_type (type, type_quals);
1010 /* Make a variant of TYPE, qualified with the TYPE_QUALS. Handles
1011 arrays correctly. In particular, if TYPE is an array of T's, and
1012 TYPE_QUALS is non-empty, returns an array of qualified T's.
1014 FLAGS determines how to deal with ill-formed qualifications. If
1015 tf_ignore_bad_quals is set, then bad qualifications are dropped
1016 (this is permitted if TYPE was introduced via a typedef or template
1017 type parameter). If bad qualifications are dropped and tf_warning
1018 is set, then a warning is issued for non-const qualifications. If
1019 tf_ignore_bad_quals is not set and tf_error is not set, we
1020 return error_mark_node. Otherwise, we issue an error, and ignore
1023 Qualification of a reference type is valid when the reference came
1024 via a typedef or template type argument. [dcl.ref] No such
1025 dispensation is provided for qualifying a function type. [dcl.fct]
1026 DR 295 queries this and the proposed resolution brings it into line
1027 with qualifying a reference. We implement the DR. We also behave
1028 in a similar manner for restricting non-pointer types. */
1031 cp_build_qualified_type_real (tree type,
1033 tsubst_flags_t complain)
1036 int bad_quals = TYPE_UNQUALIFIED;
1038 if (type == error_mark_node)
1041 if (type_quals == cp_type_quals (type))
1044 if (TREE_CODE (type) == ARRAY_TYPE)
1046 /* In C++, the qualification really applies to the array element
1047 type. Obtain the appropriately qualified element type. */
1050 = cp_build_qualified_type_real (TREE_TYPE (type),
1054 if (element_type == error_mark_node)
1055 return error_mark_node;
1057 /* See if we already have an identically qualified type. Tests
1058 should be equivalent to those in check_qualified_type. */
1059 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
1060 if (TREE_TYPE (t) == element_type
1061 && TYPE_NAME (t) == TYPE_NAME (type)
1062 && TYPE_CONTEXT (t) == TYPE_CONTEXT (type)
1063 && attribute_list_equal (TYPE_ATTRIBUTES (t),
1064 TYPE_ATTRIBUTES (type)))
1069 t = build_cplus_array_type (element_type, TYPE_DOMAIN (type));
1071 /* Keep the typedef name. */
1072 if (TYPE_NAME (t) != TYPE_NAME (type))
1074 t = build_variant_type_copy (t);
1075 TYPE_NAME (t) = TYPE_NAME (type);
1079 /* Even if we already had this variant, we update
1080 TYPE_NEEDS_CONSTRUCTING and TYPE_HAS_NONTRIVIAL_DESTRUCTOR in case
1081 they changed since the variant was originally created.
1083 This seems hokey; if there is some way to use a previous
1084 variant *without* coming through here,
1085 TYPE_NEEDS_CONSTRUCTING will never be updated. */
1086 TYPE_NEEDS_CONSTRUCTING (t)
1087 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (element_type));
1088 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
1089 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (element_type));
1092 else if (TREE_CODE (type) == TYPE_PACK_EXPANSION)
1094 tree t = PACK_EXPANSION_PATTERN (type);
1096 t = cp_build_qualified_type_real (t, type_quals, complain);
1097 return make_pack_expansion (t);
1100 /* A reference or method type shall not be cv-qualified.
1101 [dcl.ref], [dcl.fct]. This used to be an error, but as of DR 295
1102 (in CD1) we always ignore extra cv-quals on functions. */
1103 if (type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE)
1104 && (TREE_CODE (type) == REFERENCE_TYPE
1105 || TREE_CODE (type) == FUNCTION_TYPE
1106 || TREE_CODE (type) == METHOD_TYPE))
1108 if (TREE_CODE (type) == REFERENCE_TYPE)
1109 bad_quals |= type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
1110 type_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
1113 /* But preserve any function-cv-quals on a FUNCTION_TYPE. */
1114 if (TREE_CODE (type) == FUNCTION_TYPE)
1115 type_quals |= type_memfn_quals (type);
1117 /* A restrict-qualified type must be a pointer (or reference)
1118 to object or incomplete type. */
1119 if ((type_quals & TYPE_QUAL_RESTRICT)
1120 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
1121 && TREE_CODE (type) != TYPENAME_TYPE
1122 && !POINTER_TYPE_P (type))
1124 bad_quals |= TYPE_QUAL_RESTRICT;
1125 type_quals &= ~TYPE_QUAL_RESTRICT;
1128 if (bad_quals == TYPE_UNQUALIFIED
1129 || (complain & tf_ignore_bad_quals))
1131 else if (!(complain & tf_error))
1132 return error_mark_node;
1135 tree bad_type = build_qualified_type (ptr_type_node, bad_quals);
1136 error ("%qV qualifiers cannot be applied to %qT",
1140 /* Retrieve (or create) the appropriately qualified variant. */
1141 result = build_qualified_type (type, type_quals);
1143 /* Preserve exception specs and ref-qualifier since build_qualified_type
1144 doesn't know about them. */
1145 if (TREE_CODE (result) == FUNCTION_TYPE
1146 || TREE_CODE (result) == METHOD_TYPE)
1148 result = build_exception_variant (result, TYPE_RAISES_EXCEPTIONS (type));
1149 result = build_ref_qualified_type (result, type_memfn_rqual (type));
1155 /* Return TYPE with const and volatile removed. */
1158 cv_unqualified (tree type)
1162 if (type == error_mark_node)
1165 quals = cp_type_quals (type);
1166 quals &= ~(TYPE_QUAL_CONST|TYPE_QUAL_VOLATILE);
1167 return cp_build_qualified_type (type, quals);
1170 /* Builds a qualified variant of T that is not a typedef variant.
1171 E.g. consider the following declarations:
1172 typedef const int ConstInt;
1173 typedef ConstInt* PtrConstInt;
1174 If T is PtrConstInt, this function returns a type representing
1176 In other words, if T is a typedef, the function returns the underlying type.
1177 The cv-qualification and attributes of the type returned match the
1179 They will always be compatible types.
1180 The returned type is built so that all of its subtypes
1181 recursively have their typedefs stripped as well.
1183 This is different from just returning TYPE_CANONICAL (T)
1184 Because of several reasons:
1185 * If T is a type that needs structural equality
1186 its TYPE_CANONICAL (T) will be NULL.
1187 * TYPE_CANONICAL (T) desn't carry type attributes
1188 and loses template parameter names. */
1191 strip_typedefs (tree t)
1193 tree result = NULL, type = NULL, t0 = NULL;
1195 if (!t || t == error_mark_node)
1198 if (TREE_CODE (t) == TREE_LIST)
1200 bool changed = false;
1201 vec<tree,va_gc> *vec = make_tree_vector ();
1202 for (; t; t = TREE_CHAIN (t))
1204 gcc_assert (!TREE_PURPOSE (t));
1205 tree elt = strip_typedefs (TREE_VALUE (t));
1206 if (elt != TREE_VALUE (t))
1208 vec_safe_push (vec, elt);
1212 r = build_tree_list_vec (vec);
1213 release_tree_vector (vec);
1217 gcc_assert (TYPE_P (t));
1219 if (t == TYPE_CANONICAL (t))
1222 if (dependent_alias_template_spec_p (t))
1223 /* DR 1558: However, if the template-id is dependent, subsequent
1224 template argument substitution still applies to the template-id. */
1227 switch (TREE_CODE (t))
1230 type = strip_typedefs (TREE_TYPE (t));
1231 result = build_pointer_type (type);
1233 case REFERENCE_TYPE:
1234 type = strip_typedefs (TREE_TYPE (t));
1235 result = cp_build_reference_type (type, TYPE_REF_IS_RVALUE (t));
1238 t0 = strip_typedefs (TYPE_OFFSET_BASETYPE (t));
1239 type = strip_typedefs (TREE_TYPE (t));
1240 result = build_offset_type (t0, type);
1243 if (TYPE_PTRMEMFUNC_P (t))
1245 t0 = strip_typedefs (TYPE_PTRMEMFUNC_FN_TYPE (t));
1246 result = build_ptrmemfunc_type (t0);
1250 type = strip_typedefs (TREE_TYPE (t));
1251 t0 = strip_typedefs (TYPE_DOMAIN (t));;
1252 result = build_cplus_array_type (type, t0);
1257 tree arg_types = NULL, arg_node, arg_type;
1258 for (arg_node = TYPE_ARG_TYPES (t);
1260 arg_node = TREE_CHAIN (arg_node))
1262 if (arg_node == void_list_node)
1264 arg_type = strip_typedefs (TREE_VALUE (arg_node));
1265 gcc_assert (arg_type);
1268 tree_cons (TREE_PURPOSE (arg_node), arg_type, arg_types);
1272 arg_types = nreverse (arg_types);
1274 /* A list of parameters not ending with an ellipsis
1275 must end with void_list_node. */
1277 arg_types = chainon (arg_types, void_list_node);
1279 type = strip_typedefs (TREE_TYPE (t));
1280 if (TREE_CODE (t) == METHOD_TYPE)
1282 tree class_type = TREE_TYPE (TREE_VALUE (arg_types));
1283 gcc_assert (class_type);
1285 build_method_type_directly (class_type, type,
1286 TREE_CHAIN (arg_types));
1288 = build_ref_qualified_type (result, type_memfn_rqual (t));
1292 result = build_function_type (type,
1294 result = apply_memfn_quals (result,
1295 type_memfn_quals (t),
1296 type_memfn_rqual (t));
1299 if (TYPE_RAISES_EXCEPTIONS (t))
1300 result = build_exception_variant (result,
1301 TYPE_RAISES_EXCEPTIONS (t));
1302 if (TYPE_HAS_LATE_RETURN_TYPE (t))
1303 TYPE_HAS_LATE_RETURN_TYPE (result) = 1;
1308 tree fullname = TYPENAME_TYPE_FULLNAME (t);
1309 if (TREE_CODE (fullname) == TEMPLATE_ID_EXPR
1310 && TREE_OPERAND (fullname, 1))
1312 tree args = TREE_OPERAND (fullname, 1);
1313 tree new_args = copy_node (args);
1314 bool changed = false;
1315 for (int i = 0; i < TREE_VEC_LENGTH (args); ++i)
1317 tree arg = TREE_VEC_ELT (args, i);
1320 strip_arg = strip_typedefs (arg);
1322 strip_arg = strip_typedefs_expr (arg);
1323 TREE_VEC_ELT (new_args, i) = strip_arg;
1324 if (strip_arg != arg)
1329 NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_args)
1330 = NON_DEFAULT_TEMPLATE_ARGS_COUNT (args);
1332 = lookup_template_function (TREE_OPERAND (fullname, 0),
1336 ggc_free (new_args);
1338 result = make_typename_type (strip_typedefs (TYPE_CONTEXT (t)),
1339 fullname, typename_type, tf_none);
1343 result = strip_typedefs_expr (DECLTYPE_TYPE_EXPR (t));
1344 if (result == DECLTYPE_TYPE_EXPR (t))
1347 result = (finish_decltype_type
1349 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t),
1357 result = TYPE_MAIN_VARIANT (t);
1358 if (TYPE_USER_ALIGN (t) != TYPE_USER_ALIGN (result)
1359 || TYPE_ALIGN (t) != TYPE_ALIGN (result))
1361 gcc_assert (TYPE_USER_ALIGN (t));
1362 if (TYPE_ALIGN (t) == TYPE_ALIGN (result))
1363 result = build_variant_type_copy (result);
1365 result = build_aligned_type (result, TYPE_ALIGN (t));
1366 TYPE_USER_ALIGN (result) = true;
1368 if (TYPE_ATTRIBUTES (t))
1369 result = cp_build_type_attribute_variant (result, TYPE_ATTRIBUTES (t));
1370 return cp_build_qualified_type (result, cp_type_quals (t));
1373 /* Like strip_typedefs above, but works on expressions, so that in
1375 template<class T> struct A
1381 sizeof(TT) is replaced by sizeof(T). */
1384 strip_typedefs_expr (tree t)
1388 enum tree_code code;
1390 if (t == NULL_TREE || t == error_mark_node)
1393 if (DECL_P (t) || CONSTANT_CLASS_P (t))
1396 /* Some expressions have type operands, so let's handle types here rather
1397 than check TYPE_P in multiple places below. */
1399 return strip_typedefs (t);
1401 code = TREE_CODE (t);
1404 case IDENTIFIER_NODE:
1405 case TEMPLATE_PARM_INDEX:
1408 case ARGUMENT_PACK_SELECT:
1413 tree type1 = strip_typedefs (TRAIT_EXPR_TYPE1 (t));
1414 tree type2 = strip_typedefs (TRAIT_EXPR_TYPE2 (t));
1415 if (type1 == TRAIT_EXPR_TYPE1 (t)
1416 && type2 == TRAIT_EXPR_TYPE2 (t))
1419 TRAIT_EXPR_TYPE1 (t) = type1;
1420 TRAIT_EXPR_TYPE2 (t) = type2;
1426 vec<tree, va_gc> *vec = make_tree_vector ();
1427 bool changed = false;
1429 for (it = t; it; it = TREE_CHAIN (it))
1431 tree val = strip_typedefs_expr (TREE_VALUE (t));
1432 vec_safe_push (vec, val);
1433 if (val != TREE_VALUE (t))
1435 gcc_assert (TREE_PURPOSE (it) == NULL_TREE);
1440 FOR_EACH_VEC_ELT_REVERSE (*vec, i, it)
1441 r = tree_cons (NULL_TREE, it, r);
1445 release_tree_vector (vec);
1451 bool changed = false;
1452 vec<tree, va_gc> *vec = make_tree_vector ();
1453 n = TREE_VEC_LENGTH (t);
1454 vec_safe_reserve (vec, n);
1455 for (i = 0; i < n; ++i)
1457 tree op = strip_typedefs_expr (TREE_VEC_ELT (t, i));
1458 vec->quick_push (op);
1459 if (op != TREE_VEC_ELT (t, i))
1465 for (i = 0; i < n; ++i)
1466 TREE_VEC_ELT (r, i) = (*vec)[i];
1467 NON_DEFAULT_TEMPLATE_ARGS_COUNT (r)
1468 = NON_DEFAULT_TEMPLATE_ARGS_COUNT (t);
1472 release_tree_vector (vec);
1478 bool changed = false;
1479 vec<constructor_elt, va_gc> *vec
1480 = vec_safe_copy (CONSTRUCTOR_ELTS (t));
1481 n = CONSTRUCTOR_NELTS (t);
1482 type = strip_typedefs (TREE_TYPE (t));
1483 for (i = 0; i < n; ++i)
1485 constructor_elt *e = &(*vec)[i];
1486 tree op = strip_typedefs_expr (e->value);
1492 gcc_checking_assert (e->index == strip_typedefs_expr (e->index));
1495 if (!changed && type == TREE_TYPE (t))
1503 TREE_TYPE (r) = type;
1504 CONSTRUCTOR_ELTS (r) = vec;
1510 error ("lambda-expression in a constant expression");
1511 return error_mark_node;
1517 gcc_assert (EXPR_P (t));
1519 n = TREE_OPERAND_LENGTH (t);
1520 ops = XALLOCAVEC (tree, n);
1521 type = TREE_TYPE (t);
1526 case IMPLICIT_CONV_EXPR:
1527 case DYNAMIC_CAST_EXPR:
1528 case STATIC_CAST_EXPR:
1529 case CONST_CAST_EXPR:
1530 case REINTERPRET_CAST_EXPR:
1533 type = strip_typedefs (type);
1537 for (i = 0; i < n; ++i)
1538 ops[i] = strip_typedefs_expr (TREE_OPERAND (t, i));
1542 /* If nothing changed, return t. */
1543 for (i = 0; i < n; ++i)
1544 if (ops[i] != TREE_OPERAND (t, i))
1546 if (i == n && type == TREE_TYPE (t))
1550 TREE_TYPE (r) = type;
1551 for (i = 0; i < n; ++i)
1552 TREE_OPERAND (r, i) = ops[i];
1556 /* Makes a copy of BINFO and TYPE, which is to be inherited into a
1557 graph dominated by T. If BINFO is NULL, TYPE is a dependent base,
1558 and we do a shallow copy. If BINFO is non-NULL, we do a deep copy.
1559 VIRT indicates whether TYPE is inherited virtually or not.
1560 IGO_PREV points at the previous binfo of the inheritance graph
1561 order chain. The newly copied binfo's TREE_CHAIN forms this
1564 The CLASSTYPE_VBASECLASSES vector of T is constructed in the
1565 correct order. That is in the order the bases themselves should be
1568 The BINFO_INHERITANCE of a virtual base class points to the binfo
1569 of the most derived type. ??? We could probably change this so that
1570 BINFO_INHERITANCE becomes synonymous with BINFO_PRIMARY, and hence
1571 remove a field. They currently can only differ for primary virtual
1575 copy_binfo (tree binfo, tree type, tree t, tree *igo_prev, int virt)
1581 /* See if we've already made this virtual base. */
1582 new_binfo = binfo_for_vbase (type, t);
1587 new_binfo = make_tree_binfo (binfo ? BINFO_N_BASE_BINFOS (binfo) : 0);
1588 BINFO_TYPE (new_binfo) = type;
1590 /* Chain it into the inheritance graph. */
1591 TREE_CHAIN (*igo_prev) = new_binfo;
1592 *igo_prev = new_binfo;
1594 if (binfo && !BINFO_DEPENDENT_BASE_P (binfo))
1599 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), type));
1601 BINFO_OFFSET (new_binfo) = BINFO_OFFSET (binfo);
1602 BINFO_VIRTUALS (new_binfo) = BINFO_VIRTUALS (binfo);
1604 /* We do not need to copy the accesses, as they are read only. */
1605 BINFO_BASE_ACCESSES (new_binfo) = BINFO_BASE_ACCESSES (binfo);
1607 /* Recursively copy base binfos of BINFO. */
1608 for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++)
1610 tree new_base_binfo;
1611 new_base_binfo = copy_binfo (base_binfo, BINFO_TYPE (base_binfo),
1613 BINFO_VIRTUAL_P (base_binfo));
1615 if (!BINFO_INHERITANCE_CHAIN (new_base_binfo))
1616 BINFO_INHERITANCE_CHAIN (new_base_binfo) = new_binfo;
1617 BINFO_BASE_APPEND (new_binfo, new_base_binfo);
1621 BINFO_DEPENDENT_BASE_P (new_binfo) = 1;
1625 /* Push it onto the list after any virtual bases it contains
1626 will have been pushed. */
1627 CLASSTYPE_VBASECLASSES (t)->quick_push (new_binfo);
1628 BINFO_VIRTUAL_P (new_binfo) = 1;
1629 BINFO_INHERITANCE_CHAIN (new_binfo) = TYPE_BINFO (t);
1635 /* Hashing of lists so that we don't make duplicates.
1636 The entry point is `list_hash_canon'. */
1645 struct list_hasher : ggc_hasher<tree>
1647 typedef list_proxy *compare_type;
1649 static hashval_t hash (tree);
1650 static bool equal (tree, list_proxy *);
1653 /* Now here is the hash table. When recording a list, it is added
1654 to the slot whose index is the hash code mod the table size.
1655 Note that the hash table is used for several kinds of lists.
1656 While all these live in the same table, they are completely independent,
1657 and the hash code is computed differently for each of these. */
1659 static GTY (()) hash_table<list_hasher> *list_hash_table;
1661 /* Compare ENTRY (an entry in the hash table) with DATA (a list_proxy
1662 for a node we are thinking about adding). */
1665 list_hasher::equal (tree t, list_proxy *proxy)
1667 return (TREE_VALUE (t) == proxy->value
1668 && TREE_PURPOSE (t) == proxy->purpose
1669 && TREE_CHAIN (t) == proxy->chain);
1672 /* Compute a hash code for a list (chain of TREE_LIST nodes
1673 with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the
1674 TREE_COMMON slots), by adding the hash codes of the individual entries. */
1677 list_hash_pieces (tree purpose, tree value, tree chain)
1679 hashval_t hashcode = 0;
1682 hashcode += TREE_HASH (chain);
1685 hashcode += TREE_HASH (value);
1689 hashcode += TREE_HASH (purpose);
1695 /* Hash an already existing TREE_LIST. */
1698 list_hasher::hash (tree t)
1700 return list_hash_pieces (TREE_PURPOSE (t),
1705 /* Given list components PURPOSE, VALUE, AND CHAIN, return the canonical
1706 object for an identical list if one already exists. Otherwise, build a
1707 new one, and record it as the canonical object. */
1710 hash_tree_cons (tree purpose, tree value, tree chain)
1714 struct list_proxy proxy;
1716 /* Hash the list node. */
1717 hashcode = list_hash_pieces (purpose, value, chain);
1718 /* Create a proxy for the TREE_LIST we would like to create. We
1719 don't actually create it so as to avoid creating garbage. */
1720 proxy.purpose = purpose;
1721 proxy.value = value;
1722 proxy.chain = chain;
1723 /* See if it is already in the table. */
1724 slot = list_hash_table->find_slot_with_hash (&proxy, hashcode, INSERT);
1725 /* If not, create a new node. */
1727 *slot = tree_cons (purpose, value, chain);
1728 return (tree) *slot;
1731 /* Constructor for hashed lists. */
1734 hash_tree_chain (tree value, tree chain)
1736 return hash_tree_cons (NULL_TREE, value, chain);
1740 debug_binfo (tree elem)
1745 fprintf (stderr, "type \"%s\", offset = " HOST_WIDE_INT_PRINT_DEC
1747 TYPE_NAME_STRING (BINFO_TYPE (elem)),
1748 TREE_INT_CST_LOW (BINFO_OFFSET (elem)));
1749 debug_tree (BINFO_TYPE (elem));
1750 if (BINFO_VTABLE (elem))
1751 fprintf (stderr, "vtable decl \"%s\"\n",
1752 IDENTIFIER_POINTER (DECL_NAME (get_vtbl_decl_for_binfo (elem))));
1754 fprintf (stderr, "no vtable decl yet\n");
1755 fprintf (stderr, "virtuals:\n");
1756 virtuals = BINFO_VIRTUALS (elem);
1761 tree fndecl = TREE_VALUE (virtuals);
1762 fprintf (stderr, "%s [%ld =? %ld]\n",
1763 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl)),
1764 (long) n, (long) TREE_INT_CST_LOW (DECL_VINDEX (fndecl)));
1766 virtuals = TREE_CHAIN (virtuals);
1770 /* Build a representation for the qualified name SCOPE::NAME. TYPE is
1771 the type of the result expression, if known, or NULL_TREE if the
1772 resulting expression is type-dependent. If TEMPLATE_P is true,
1773 NAME is known to be a template because the user explicitly used the
1774 "template" keyword after the "::".
1776 All SCOPE_REFs should be built by use of this function. */
1779 build_qualified_name (tree type, tree scope, tree name, bool template_p)
1782 if (type == error_mark_node
1783 || scope == error_mark_node
1784 || name == error_mark_node)
1785 return error_mark_node;
1786 t = build2 (SCOPE_REF, type, scope, name);
1787 QUALIFIED_NAME_IS_TEMPLATE (t) = template_p;
1788 PTRMEM_OK_P (t) = true;
1790 t = convert_from_reference (t);
1794 /* Like check_qualified_type, but also check ref-qualifier and exception
1798 cp_check_qualified_type (const_tree cand, const_tree base, int type_quals,
1799 cp_ref_qualifier rqual, tree raises)
1801 return (check_qualified_type (cand, base, type_quals)
1802 && comp_except_specs (raises, TYPE_RAISES_EXCEPTIONS (cand),
1804 && type_memfn_rqual (cand) == rqual);
1807 /* Build the FUNCTION_TYPE or METHOD_TYPE with the ref-qualifier RQUAL. */
1810 build_ref_qualified_type (tree type, cp_ref_qualifier rqual)
1814 if (rqual == type_memfn_rqual (type))
1817 int type_quals = TYPE_QUALS (type);
1818 tree raises = TYPE_RAISES_EXCEPTIONS (type);
1819 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
1820 if (cp_check_qualified_type (t, type, type_quals, rqual, raises))
1823 t = build_variant_type_copy (type);
1826 case REF_QUAL_RVALUE:
1827 FUNCTION_RVALUE_QUALIFIED (t) = 1;
1828 FUNCTION_REF_QUALIFIED (t) = 1;
1830 case REF_QUAL_LVALUE:
1831 FUNCTION_RVALUE_QUALIFIED (t) = 0;
1832 FUNCTION_REF_QUALIFIED (t) = 1;
1835 FUNCTION_REF_QUALIFIED (t) = 0;
1839 if (TYPE_STRUCTURAL_EQUALITY_P (type))
1840 /* Propagate structural equality. */
1841 SET_TYPE_STRUCTURAL_EQUALITY (t);
1842 else if (TYPE_CANONICAL (type) != type)
1843 /* Build the underlying canonical type, since it is different
1845 TYPE_CANONICAL (t) = build_ref_qualified_type (TYPE_CANONICAL (type),
1848 /* T is its own canonical type. */
1849 TYPE_CANONICAL (t) = t;
1854 /* Returns nonzero if X is an expression for a (possibly overloaded)
1855 function. If "f" is a function or function template, "f", "c->f",
1856 "c.f", "C::f", and "f<int>" will all be considered possibly
1857 overloaded functions. Returns 2 if the function is actually
1858 overloaded, i.e., if it is impossible to know the type of the
1859 function without performing overload resolution. */
1862 is_overloaded_fn (tree x)
1864 /* A baselink is also considered an overloaded function. */
1865 if (TREE_CODE (x) == OFFSET_REF
1866 || TREE_CODE (x) == COMPONENT_REF)
1867 x = TREE_OPERAND (x, 1);
1869 x = BASELINK_FUNCTIONS (x);
1870 if (TREE_CODE (x) == TEMPLATE_ID_EXPR)
1871 x = TREE_OPERAND (x, 0);
1872 if (DECL_FUNCTION_TEMPLATE_P (OVL_CURRENT (x))
1873 || (TREE_CODE (x) == OVERLOAD && OVL_CHAIN (x)))
1875 return (TREE_CODE (x) == FUNCTION_DECL
1876 || TREE_CODE (x) == OVERLOAD);
1879 /* X is the CALL_EXPR_FN of a CALL_EXPR. If X represents a dependent name
1880 (14.6.2), return the IDENTIFIER_NODE for that name. Otherwise, return
1884 dependent_name (tree x)
1886 if (identifier_p (x))
1888 if (TREE_CODE (x) != COMPONENT_REF
1889 && TREE_CODE (x) != OFFSET_REF
1890 && TREE_CODE (x) != BASELINK
1891 && is_overloaded_fn (x))
1892 return DECL_NAME (get_first_fn (x));
1896 /* Returns true iff X is an expression for an overloaded function
1897 whose type cannot be known without performing overload
1901 really_overloaded_fn (tree x)
1903 return is_overloaded_fn (x) == 2;
1909 gcc_assert (is_overloaded_fn (from));
1910 /* A baselink is also considered an overloaded function. */
1911 if (TREE_CODE (from) == OFFSET_REF
1912 || TREE_CODE (from) == COMPONENT_REF)
1913 from = TREE_OPERAND (from, 1);
1914 if (BASELINK_P (from))
1915 from = BASELINK_FUNCTIONS (from);
1916 if (TREE_CODE (from) == TEMPLATE_ID_EXPR)
1917 from = TREE_OPERAND (from, 0);
1922 get_first_fn (tree from)
1924 return OVL_CURRENT (get_fns (from));
1927 /* Return a new OVL node, concatenating it with the old one. */
1930 ovl_cons (tree decl, tree chain)
1932 tree result = make_node (OVERLOAD);
1933 TREE_TYPE (result) = unknown_type_node;
1934 OVL_FUNCTION (result) = decl;
1935 TREE_CHAIN (result) = chain;
1940 /* Build a new overloaded function. If this is the first one,
1941 just return it; otherwise, ovl_cons the _DECLs */
1944 build_overload (tree decl, tree chain)
1946 if (! chain && TREE_CODE (decl) != TEMPLATE_DECL)
1948 return ovl_cons (decl, chain);
1951 /* Return the scope where the overloaded functions OVL were found. */
1954 ovl_scope (tree ovl)
1956 if (TREE_CODE (ovl) == OFFSET_REF
1957 || TREE_CODE (ovl) == COMPONENT_REF)
1958 ovl = TREE_OPERAND (ovl, 1);
1959 if (TREE_CODE (ovl) == BASELINK)
1960 return BINFO_TYPE (BASELINK_BINFO (ovl));
1961 if (TREE_CODE (ovl) == TEMPLATE_ID_EXPR)
1962 ovl = TREE_OPERAND (ovl, 0);
1963 /* Skip using-declarations. */
1964 while (TREE_CODE (ovl) == OVERLOAD && OVL_USED (ovl) && OVL_CHAIN (ovl))
1965 ovl = OVL_CHAIN (ovl);
1966 return CP_DECL_CONTEXT (OVL_CURRENT (ovl));
1969 /* Return TRUE if FN is a non-static member function, FALSE otherwise.
1970 This function looks into BASELINK and OVERLOAD nodes. */
1973 non_static_member_function_p (tree fn)
1975 if (fn == NULL_TREE)
1978 if (is_overloaded_fn (fn))
1979 fn = get_first_fn (fn);
1982 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn));
1986 #define PRINT_RING_SIZE 4
1989 cxx_printable_name_internal (tree decl, int v, bool translate)
1991 static unsigned int uid_ring[PRINT_RING_SIZE];
1992 static char *print_ring[PRINT_RING_SIZE];
1993 static bool trans_ring[PRINT_RING_SIZE];
1994 static int ring_counter;
1997 /* Only cache functions. */
1999 || TREE_CODE (decl) != FUNCTION_DECL
2000 || DECL_LANG_SPECIFIC (decl) == 0)
2001 return lang_decl_name (decl, v, translate);
2003 /* See if this print name is lying around. */
2004 for (i = 0; i < PRINT_RING_SIZE; i++)
2005 if (uid_ring[i] == DECL_UID (decl) && translate == trans_ring[i])
2006 /* yes, so return it. */
2007 return print_ring[i];
2009 if (++ring_counter == PRINT_RING_SIZE)
2012 if (current_function_decl != NULL_TREE)
2014 /* There may be both translated and untranslated versions of the
2016 for (i = 0; i < 2; i++)
2018 if (uid_ring[ring_counter] == DECL_UID (current_function_decl))
2020 if (ring_counter == PRINT_RING_SIZE)
2023 gcc_assert (uid_ring[ring_counter] != DECL_UID (current_function_decl));
2026 free (print_ring[ring_counter]);
2028 print_ring[ring_counter] = xstrdup (lang_decl_name (decl, v, translate));
2029 uid_ring[ring_counter] = DECL_UID (decl);
2030 trans_ring[ring_counter] = translate;
2031 return print_ring[ring_counter];
2035 cxx_printable_name (tree decl, int v)
2037 return cxx_printable_name_internal (decl, v, false);
2041 cxx_printable_name_translate (tree decl, int v)
2043 return cxx_printable_name_internal (decl, v, true);
2046 /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions
2047 listed in RAISES. */
2050 build_exception_variant (tree type, tree raises)
2055 if (comp_except_specs (raises, TYPE_RAISES_EXCEPTIONS (type), ce_exact))
2058 type_quals = TYPE_QUALS (type);
2059 cp_ref_qualifier rqual = type_memfn_rqual (type);
2060 for (v = TYPE_MAIN_VARIANT (type); v; v = TYPE_NEXT_VARIANT (v))
2061 if (cp_check_qualified_type (v, type, type_quals, rqual, raises))
2064 /* Need to build a new variant. */
2065 v = build_variant_type_copy (type);
2066 TYPE_RAISES_EXCEPTIONS (v) = raises;
2070 /* Given a TEMPLATE_TEMPLATE_PARM node T, create a new
2071 BOUND_TEMPLATE_TEMPLATE_PARM bound with NEWARGS as its template
2075 bind_template_template_parm (tree t, tree newargs)
2077 tree decl = TYPE_NAME (t);
2080 t2 = cxx_make_type (BOUND_TEMPLATE_TEMPLATE_PARM);
2081 decl = build_decl (input_location,
2082 TYPE_DECL, DECL_NAME (decl), NULL_TREE);
2084 /* These nodes have to be created to reflect new TYPE_DECL and template
2086 TEMPLATE_TYPE_PARM_INDEX (t2) = copy_node (TEMPLATE_TYPE_PARM_INDEX (t));
2087 TEMPLATE_PARM_DECL (TEMPLATE_TYPE_PARM_INDEX (t2)) = decl;
2088 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2)
2089 = build_template_info (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t), newargs);
2091 TREE_TYPE (decl) = t2;
2092 TYPE_NAME (t2) = decl;
2093 TYPE_STUB_DECL (t2) = decl;
2095 SET_TYPE_STRUCTURAL_EQUALITY (t2);
2100 /* Called from count_trees via walk_tree. */
2103 count_trees_r (tree *tp, int *walk_subtrees, void *data)
2113 /* Debugging function for measuring the rough complexity of a tree
2117 count_trees (tree t)
2120 cp_walk_tree_without_duplicates (&t, count_trees_r, &n_trees);
2124 /* Called from verify_stmt_tree via walk_tree. */
2127 verify_stmt_tree_r (tree* tp, int * /*walk_subtrees*/, void* data)
2130 hash_table<pointer_hash <tree_node> > *statements
2131 = static_cast <hash_table<pointer_hash <tree_node> > *> (data);
2134 if (!STATEMENT_CODE_P (TREE_CODE (t)))
2137 /* If this statement is already present in the hash table, then
2138 there is a circularity in the statement tree. */
2139 gcc_assert (!statements->find (t));
2141 slot = statements->find_slot (t, INSERT);
2147 /* Debugging function to check that the statement T has not been
2148 corrupted. For now, this function simply checks that T contains no
2152 verify_stmt_tree (tree t)
2154 hash_table<pointer_hash <tree_node> > statements (37);
2155 cp_walk_tree (&t, verify_stmt_tree_r, &statements, NULL);
2158 /* Check if the type T depends on a type with no linkage and if so, return
2159 it. If RELAXED_P then do not consider a class type declared within
2160 a vague-linkage function to have no linkage. */
2163 no_linkage_check (tree t, bool relaxed_p)
2167 /* There's no point in checking linkage on template functions; we
2168 can't know their complete types. */
2169 if (processing_template_decl)
2172 switch (TREE_CODE (t))
2175 if (TYPE_PTRMEMFUNC_P (t))
2177 /* Lambda types that don't have mangling scope have no linkage. We
2178 check CLASSTYPE_LAMBDA_EXPR for error_mark_node because
2179 when we get here from pushtag none of the lambda information is
2180 set up yet, so we want to assume that the lambda has linkage and
2181 fix it up later if not. */
2182 if (CLASSTYPE_LAMBDA_EXPR (t)
2183 && CLASSTYPE_LAMBDA_EXPR (t) != error_mark_node
2184 && LAMBDA_TYPE_EXTRA_SCOPE (t) == NULL_TREE)
2188 if (!CLASS_TYPE_P (t))
2192 /* Only treat anonymous types as having no linkage if they're at
2193 namespace scope. This is core issue 966. */
2194 if (TYPE_ANONYMOUS_P (t) && TYPE_NAMESPACE_SCOPE_P (t))
2197 for (r = CP_TYPE_CONTEXT (t); ; )
2199 /* If we're a nested type of a !TREE_PUBLIC class, we might not
2200 have linkage, or we might just be in an anonymous namespace.
2201 If we're in a TREE_PUBLIC class, we have linkage. */
2202 if (TYPE_P (r) && !TREE_PUBLIC (TYPE_NAME (r)))
2203 return no_linkage_check (TYPE_CONTEXT (t), relaxed_p);
2204 else if (TREE_CODE (r) == FUNCTION_DECL)
2206 if (!relaxed_p || !vague_linkage_p (r))
2209 r = CP_DECL_CONTEXT (r);
2219 case REFERENCE_TYPE:
2221 return no_linkage_check (TREE_TYPE (t), relaxed_p);
2225 r = no_linkage_check (TYPE_PTRMEM_POINTED_TO_TYPE (t),
2229 return no_linkage_check (TYPE_PTRMEM_CLASS_TYPE (t), relaxed_p);
2232 r = no_linkage_check (TYPE_METHOD_BASETYPE (t), relaxed_p);
2239 for (parm = TYPE_ARG_TYPES (t);
2240 parm && parm != void_list_node;
2241 parm = TREE_CHAIN (parm))
2243 r = no_linkage_check (TREE_VALUE (parm), relaxed_p);
2247 return no_linkage_check (TREE_TYPE (t), relaxed_p);
2255 extern int depth_reached;
2258 cxx_print_statistics (void)
2260 print_search_statistics ();
2261 print_class_statistics ();
2262 print_template_statistics ();
2263 if (GATHER_STATISTICS)
2264 fprintf (stderr, "maximum template instantiation depth reached: %d\n",
2268 /* Return, as an INTEGER_CST node, the number of elements for TYPE
2269 (which is an ARRAY_TYPE). This counts only elements of the top
2273 array_type_nelts_top (tree type)
2275 return fold_build2_loc (input_location,
2276 PLUS_EXPR, sizetype,
2277 array_type_nelts (type),
2281 /* Return, as an INTEGER_CST node, the number of elements for TYPE
2282 (which is an ARRAY_TYPE). This one is a recursive count of all
2283 ARRAY_TYPEs that are clumped together. */
2286 array_type_nelts_total (tree type)
2288 tree sz = array_type_nelts_top (type);
2289 type = TREE_TYPE (type);
2290 while (TREE_CODE (type) == ARRAY_TYPE)
2292 tree n = array_type_nelts_top (type);
2293 sz = fold_build2_loc (input_location,
2294 MULT_EXPR, sizetype, sz, n);
2295 type = TREE_TYPE (type);
2300 /* Called from break_out_target_exprs via mapcar. */
2303 bot_manip (tree* tp, int* walk_subtrees, void* data)
2305 splay_tree target_remap = ((splay_tree) data);
2308 if (!TYPE_P (t) && TREE_CONSTANT (t) && !TREE_SIDE_EFFECTS (t))
2310 /* There can't be any TARGET_EXPRs or their slot variables below this
2311 point. But we must make a copy, in case subsequent processing
2312 alters any part of it. For example, during gimplification a cast
2313 of the form (T) &X::f (where "f" is a member function) will lead
2314 to replacing the PTRMEM_CST for &X::f with a VAR_DECL. */
2316 *tp = unshare_expr (t);
2319 if (TREE_CODE (t) == TARGET_EXPR)
2323 if (TREE_CODE (TREE_OPERAND (t, 1)) == AGGR_INIT_EXPR)
2325 u = build_cplus_new (TREE_TYPE (t), TREE_OPERAND (t, 1),
2326 tf_warning_or_error);
2327 if (AGGR_INIT_ZERO_FIRST (TREE_OPERAND (t, 1)))
2328 AGGR_INIT_ZERO_FIRST (TREE_OPERAND (u, 1)) = true;
2331 u = build_target_expr_with_type (TREE_OPERAND (t, 1), TREE_TYPE (t),
2332 tf_warning_or_error);
2334 TARGET_EXPR_IMPLICIT_P (u) = TARGET_EXPR_IMPLICIT_P (t);
2335 TARGET_EXPR_LIST_INIT_P (u) = TARGET_EXPR_LIST_INIT_P (t);
2336 TARGET_EXPR_DIRECT_INIT_P (u) = TARGET_EXPR_DIRECT_INIT_P (t);
2338 /* Map the old variable to the new one. */
2339 splay_tree_insert (target_remap,
2340 (splay_tree_key) TREE_OPERAND (t, 0),
2341 (splay_tree_value) TREE_OPERAND (u, 0));
2343 TREE_OPERAND (u, 1) = break_out_target_exprs (TREE_OPERAND (u, 1));
2345 /* Replace the old expression with the new version. */
2347 /* We don't have to go below this point; the recursive call to
2348 break_out_target_exprs will have handled anything below this
2354 /* Make a copy of this node. */
2355 t = copy_tree_r (tp, walk_subtrees, NULL);
2356 if (TREE_CODE (*tp) == CALL_EXPR)
2358 set_flags_from_callee (*tp);
2360 /* builtin_LINE and builtin_FILE get the location where the default
2361 argument is expanded, not where the call was written. */
2362 tree callee = get_callee_fndecl (*tp);
2363 if (callee && DECL_BUILT_IN (callee))
2364 switch (DECL_FUNCTION_CODE (callee))
2368 SET_EXPR_LOCATION (*tp, input_location);
2376 /* Replace all remapped VAR_DECLs in T with their new equivalents.
2377 DATA is really a splay-tree mapping old variables to new
2381 bot_replace (tree* t, int* /*walk_subtrees*/, void* data)
2383 splay_tree target_remap = ((splay_tree) data);
2387 splay_tree_node n = splay_tree_lookup (target_remap,
2388 (splay_tree_key) *t);
2390 *t = (tree) n->value;
2392 else if (TREE_CODE (*t) == PARM_DECL
2393 && DECL_NAME (*t) == this_identifier
2394 && !DECL_CONTEXT (*t))
2396 /* In an NSDMI we need to replace the 'this' parameter we used for
2397 parsing with the real one for this function. */
2398 *t = current_class_ptr;
2400 else if (TREE_CODE (*t) == CONVERT_EXPR
2401 && CONVERT_EXPR_VBASE_PATH (*t))
2403 /* In an NSDMI build_base_path defers building conversions to virtual
2404 bases, and we handle it here. */
2405 tree basetype = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (*t)));
2406 vec<tree, va_gc> *vbases = CLASSTYPE_VBASECLASSES (current_class_type);
2408 FOR_EACH_VEC_SAFE_ELT (vbases, i, binfo)
2409 if (BINFO_TYPE (binfo) == basetype)
2411 *t = build_base_path (PLUS_EXPR, TREE_OPERAND (*t, 0), binfo, true,
2412 tf_warning_or_error);
2418 /* When we parse a default argument expression, we may create
2419 temporary variables via TARGET_EXPRs. When we actually use the
2420 default-argument expression, we make a copy of the expression
2421 and replace the temporaries with appropriate local versions. */
2424 break_out_target_exprs (tree t)
2426 static int target_remap_count;
2427 static splay_tree target_remap;
2429 if (!target_remap_count++)
2430 target_remap = splay_tree_new (splay_tree_compare_pointers,
2431 /*splay_tree_delete_key_fn=*/NULL,
2432 /*splay_tree_delete_value_fn=*/NULL);
2433 cp_walk_tree (&t, bot_manip, target_remap, NULL);
2434 cp_walk_tree (&t, bot_replace, target_remap, NULL);
2436 if (!--target_remap_count)
2438 splay_tree_delete (target_remap);
2439 target_remap = NULL;
2445 /* Build an expression for the subobject of OBJ at CONSTRUCTOR index INDEX,
2446 which we expect to have type TYPE. */
2449 build_ctor_subob_ref (tree index, tree type, tree obj)
2451 if (index == NULL_TREE)
2452 /* Can't refer to a particular member of a vector. */
2454 else if (TREE_CODE (index) == INTEGER_CST)
2455 obj = cp_build_array_ref (input_location, obj, index, tf_none);
2457 obj = build_class_member_access_expr (obj, index, NULL_TREE,
2458 /*reference*/false, tf_none);
2460 gcc_assert (same_type_ignoring_top_level_qualifiers_p (type,
2465 /* Like substitute_placeholder_in_expr, but handle C++ tree codes and
2466 build up subexpressions as we go deeper. */
2468 struct replace_placeholders_t
2471 hash_set<tree> *pset;
2475 replace_placeholders_r (tree* t, int* walk_subtrees, void* data_)
2477 tree obj = static_cast<tree>(data_);
2479 if (TREE_CONSTANT (*t))
2481 *walk_subtrees = false;
2485 switch (TREE_CODE (*t))
2487 case PLACEHOLDER_EXPR:
2488 gcc_assert (same_type_ignoring_top_level_qualifiers_p
2489 (TREE_TYPE (*t), TREE_TYPE (obj)));
2491 *walk_subtrees = false;
2495 /* Don't mess with placeholders in an unrelated object. */
2496 *walk_subtrees = false;
2501 constructor_elt *ce;
2502 vec<constructor_elt,va_gc> *v = CONSTRUCTOR_ELTS (*t);
2503 for (unsigned i = 0; vec_safe_iterate (v, i, &ce); ++i)
2505 tree *valp = &ce->value;
2506 tree type = TREE_TYPE (*valp);
2509 if (TREE_CODE (*valp) == CONSTRUCTOR
2510 && AGGREGATE_TYPE_P (type))
2512 subob = build_ctor_subob_ref (ce->index, type, obj);
2513 if (TREE_CODE (*valp) == TARGET_EXPR)
2514 valp = &TARGET_EXPR_INITIAL (*valp);
2517 cp_walk_tree (valp, replace_placeholders_r,
2520 *walk_subtrees = false;
2532 replace_placeholders (tree exp, tree obj)
2534 hash_set<tree> pset;
2536 if (TREE_CODE (exp) == TARGET_EXPR)
2537 tp = &TARGET_EXPR_INITIAL (exp);
2538 cp_walk_tree (tp, replace_placeholders_r, obj, NULL);
2542 /* Similar to `build_nt', but for template definitions of dependent
2546 build_min_nt_loc (location_t loc, enum tree_code code, ...)
2553 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
2557 t = make_node (code);
2558 SET_EXPR_LOCATION (t, loc);
2559 length = TREE_CODE_LENGTH (code);
2561 for (i = 0; i < length; i++)
2563 tree x = va_arg (p, tree);
2564 TREE_OPERAND (t, i) = x;
2572 /* Similar to `build', but for template definitions. */
2575 build_min (enum tree_code code, tree tt, ...)
2582 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
2586 t = make_node (code);
2587 length = TREE_CODE_LENGTH (code);
2590 for (i = 0; i < length; i++)
2592 tree x = va_arg (p, tree);
2593 TREE_OPERAND (t, i) = x;
2594 if (x && !TYPE_P (x) && TREE_SIDE_EFFECTS (x))
2595 TREE_SIDE_EFFECTS (t) = 1;
2602 /* Similar to `build', but for template definitions of non-dependent
2603 expressions. NON_DEP is the non-dependent expression that has been
2607 build_min_non_dep (enum tree_code code, tree non_dep, ...)
2614 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
2616 va_start (p, non_dep);
2618 if (REFERENCE_REF_P (non_dep))
2619 non_dep = TREE_OPERAND (non_dep, 0);
2621 t = make_node (code);
2622 length = TREE_CODE_LENGTH (code);
2623 TREE_TYPE (t) = TREE_TYPE (non_dep);
2624 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (non_dep);
2626 for (i = 0; i < length; i++)
2628 tree x = va_arg (p, tree);
2629 TREE_OPERAND (t, i) = x;
2632 if (code == COMPOUND_EXPR && TREE_CODE (non_dep) != COMPOUND_EXPR)
2633 /* This should not be considered a COMPOUND_EXPR, because it
2634 resolves to an overload. */
2635 COMPOUND_EXPR_OVERLOADED (t) = 1;
2638 return convert_from_reference (t);
2641 /* Similar to `build_nt_call_vec', but for template definitions of
2642 non-dependent expressions. NON_DEP is the non-dependent expression
2643 that has been built. */
2646 build_min_non_dep_call_vec (tree non_dep, tree fn, vec<tree, va_gc> *argvec)
2648 tree t = build_nt_call_vec (fn, argvec);
2649 if (REFERENCE_REF_P (non_dep))
2650 non_dep = TREE_OPERAND (non_dep, 0);
2651 TREE_TYPE (t) = TREE_TYPE (non_dep);
2652 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (non_dep);
2653 return convert_from_reference (t);
2657 get_type_decl (tree t)
2659 if (TREE_CODE (t) == TYPE_DECL)
2662 return TYPE_STUB_DECL (t);
2663 gcc_assert (t == error_mark_node);
2667 /* Returns the namespace that contains DECL, whether directly or
2671 decl_namespace_context (tree decl)
2675 if (TREE_CODE (decl) == NAMESPACE_DECL)
2677 else if (TYPE_P (decl))
2678 decl = CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl));
2680 decl = CP_DECL_CONTEXT (decl);
2684 /* Returns true if decl is within an anonymous namespace, however deeply
2685 nested, or false otherwise. */
2688 decl_anon_ns_mem_p (const_tree decl)
2692 if (decl == NULL_TREE || decl == error_mark_node)
2694 if (TREE_CODE (decl) == NAMESPACE_DECL
2695 && DECL_NAME (decl) == NULL_TREE)
2697 /* Classes and namespaces inside anonymous namespaces have
2698 TREE_PUBLIC == 0, so we can shortcut the search. */
2699 else if (TYPE_P (decl))
2700 return (TREE_PUBLIC (TYPE_MAIN_DECL (decl)) == 0);
2701 else if (TREE_CODE (decl) == NAMESPACE_DECL)
2702 return (TREE_PUBLIC (decl) == 0);
2704 decl = DECL_CONTEXT (decl);
2708 /* Subroutine of cp_tree_equal: t1 and t2 are the CALL_EXPR_FNs of two
2709 CALL_EXPRS. Return whether they are equivalent. */
2712 called_fns_equal (tree t1, tree t2)
2714 /* Core 1321: dependent names are equivalent even if the overload sets
2715 are different. But do compare explicit template arguments. */
2716 tree name1 = dependent_name (t1);
2717 tree name2 = dependent_name (t2);
2720 tree targs1 = NULL_TREE, targs2 = NULL_TREE;
2725 if (TREE_CODE (t1) == TEMPLATE_ID_EXPR)
2726 targs1 = TREE_OPERAND (t1, 1);
2727 if (TREE_CODE (t2) == TEMPLATE_ID_EXPR)
2728 targs2 = TREE_OPERAND (t2, 1);
2729 return cp_tree_equal (targs1, targs2);
2732 return cp_tree_equal (t1, t2);
2735 /* Return truthvalue of whether T1 is the same tree structure as T2.
2736 Return 1 if they are the same. Return 0 if they are different. */
2739 cp_tree_equal (tree t1, tree t2)
2741 enum tree_code code1, code2;
2748 for (code1 = TREE_CODE (t1);
2749 CONVERT_EXPR_CODE_P (code1)
2750 || code1 == NON_LVALUE_EXPR;
2751 code1 = TREE_CODE (t1))
2752 t1 = TREE_OPERAND (t1, 0);
2753 for (code2 = TREE_CODE (t2);
2754 CONVERT_EXPR_CODE_P (code2)
2755 || code2 == NON_LVALUE_EXPR;
2756 code2 = TREE_CODE (t2))
2757 t2 = TREE_OPERAND (t2, 0);
2759 /* They might have become equal now. */
2769 /* There's only a single VOID_CST node, so we should never reach
2774 return tree_int_cst_equal (t1, t2);
2777 return REAL_VALUES_EQUAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
2780 return TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
2781 && !memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
2782 TREE_STRING_LENGTH (t1));
2785 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1),
2786 TREE_FIXED_CST (t2));
2789 return cp_tree_equal (TREE_REALPART (t1), TREE_REALPART (t2))
2790 && cp_tree_equal (TREE_IMAGPART (t1), TREE_IMAGPART (t2));
2793 return operand_equal_p (t1, t2, OEP_ONLY_CONST);
2796 /* We need to do this when determining whether or not two
2797 non-type pointer to member function template arguments
2799 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
2800 || CONSTRUCTOR_NELTS (t1) != CONSTRUCTOR_NELTS (t2))
2805 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t1), i, field, value)
2807 constructor_elt *elt2 = CONSTRUCTOR_ELT (t2, i);
2808 if (!cp_tree_equal (field, elt2->index)
2809 || !cp_tree_equal (value, elt2->value))
2816 if (!cp_tree_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2)))
2818 if (!cp_tree_equal (TREE_VALUE (t1), TREE_VALUE (t2)))
2820 return cp_tree_equal (TREE_CHAIN (t1), TREE_CHAIN (t2));
2823 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
2828 call_expr_arg_iterator iter1, iter2;
2829 if (!called_fns_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2)))
2831 for (arg1 = first_call_expr_arg (t1, &iter1),
2832 arg2 = first_call_expr_arg (t2, &iter2);
2834 arg1 = next_call_expr_arg (&iter1),
2835 arg2 = next_call_expr_arg (&iter2))
2836 if (!cp_tree_equal (arg1, arg2))
2845 tree o1 = TREE_OPERAND (t1, 0);
2846 tree o2 = TREE_OPERAND (t2, 0);
2848 /* Special case: if either target is an unallocated VAR_DECL,
2849 it means that it's going to be unified with whatever the
2850 TARGET_EXPR is really supposed to initialize, so treat it
2851 as being equivalent to anything. */
2852 if (VAR_P (o1) && DECL_NAME (o1) == NULL_TREE
2853 && !DECL_RTL_SET_P (o1))
2855 else if (VAR_P (o2) && DECL_NAME (o2) == NULL_TREE
2856 && !DECL_RTL_SET_P (o2))
2858 else if (!cp_tree_equal (o1, o2))
2861 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
2864 case WITH_CLEANUP_EXPR:
2865 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
2867 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
2870 if (TREE_OPERAND (t1, 1) != TREE_OPERAND (t2, 1))
2872 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
2875 /* For comparing uses of parameters in late-specified return types
2876 with an out-of-class definition of the function, but can also come
2877 up for expressions that involve 'this' in a member function
2880 if (comparing_specializations)
2881 /* When comparing hash table entries, only an exact match is
2882 good enough; we don't want to replace 'this' with the
2883 version from another function. */
2886 if (same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
2888 if (DECL_ARTIFICIAL (t1) ^ DECL_ARTIFICIAL (t2))
2890 if (DECL_ARTIFICIAL (t1)
2891 || (DECL_PARM_LEVEL (t1) == DECL_PARM_LEVEL (t2)
2892 && DECL_PARM_INDEX (t1) == DECL_PARM_INDEX (t2)))
2902 case IDENTIFIER_NODE:
2907 return (BASELINK_BINFO (t1) == BASELINK_BINFO (t2)
2908 && BASELINK_ACCESS_BINFO (t1) == BASELINK_ACCESS_BINFO (t2)
2909 && BASELINK_QUALIFIED_P (t1) == BASELINK_QUALIFIED_P (t2)
2910 && cp_tree_equal (BASELINK_FUNCTIONS (t1),
2911 BASELINK_FUNCTIONS (t2)));
2913 case TEMPLATE_PARM_INDEX:
2914 return (TEMPLATE_PARM_IDX (t1) == TEMPLATE_PARM_IDX (t2)
2915 && TEMPLATE_PARM_LEVEL (t1) == TEMPLATE_PARM_LEVEL (t2)
2916 && (TEMPLATE_PARM_PARAMETER_PACK (t1)
2917 == TEMPLATE_PARM_PARAMETER_PACK (t2))
2918 && same_type_p (TREE_TYPE (TEMPLATE_PARM_DECL (t1)),
2919 TREE_TYPE (TEMPLATE_PARM_DECL (t2))));
2921 case TEMPLATE_ID_EXPR:
2922 return (cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0))
2923 && cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1)));
2928 if (TREE_VEC_LENGTH (t1) != TREE_VEC_LENGTH (t2))
2930 for (ix = TREE_VEC_LENGTH (t1); ix--;)
2931 if (!cp_tree_equal (TREE_VEC_ELT (t1, ix),
2932 TREE_VEC_ELT (t2, ix)))
2940 tree o1 = TREE_OPERAND (t1, 0);
2941 tree o2 = TREE_OPERAND (t2, 0);
2943 if (code1 == SIZEOF_EXPR)
2945 if (SIZEOF_EXPR_TYPE_P (t1))
2946 o1 = TREE_TYPE (o1);
2947 if (SIZEOF_EXPR_TYPE_P (t2))
2948 o2 = TREE_TYPE (o2);
2950 if (TREE_CODE (o1) != TREE_CODE (o2))
2953 return same_type_p (o1, o2);
2955 return cp_tree_equal (o1, o2);
2960 tree t1_op1, t2_op1;
2962 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
2965 t1_op1 = TREE_OPERAND (t1, 1);
2966 t2_op1 = TREE_OPERAND (t2, 1);
2967 if (TREE_CODE (t1_op1) != TREE_CODE (t2_op1))
2970 return cp_tree_equal (TREE_OPERAND (t1, 2), TREE_OPERAND (t2, 2));
2974 /* Two pointer-to-members are the same if they point to the same
2975 field or function in the same class. */
2976 if (PTRMEM_CST_MEMBER (t1) != PTRMEM_CST_MEMBER (t2))
2979 return same_type_p (PTRMEM_CST_CLASS (t1), PTRMEM_CST_CLASS (t2));
2982 if (OVL_FUNCTION (t1) != OVL_FUNCTION (t2))
2984 return cp_tree_equal (OVL_CHAIN (t1), OVL_CHAIN (t2));
2987 if (TRAIT_EXPR_KIND (t1) != TRAIT_EXPR_KIND (t2))
2989 return same_type_p (TRAIT_EXPR_TYPE1 (t1), TRAIT_EXPR_TYPE1 (t2))
2990 && cp_tree_equal (TRAIT_EXPR_TYPE2 (t1), TRAIT_EXPR_TYPE2 (t2));
2993 case STATIC_CAST_EXPR:
2994 case REINTERPRET_CAST_EXPR:
2995 case CONST_CAST_EXPR:
2996 case DYNAMIC_CAST_EXPR:
2997 case IMPLICIT_CONV_EXPR:
2999 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
3001 /* Now compare operands as usual. */
3004 case DEFERRED_NOEXCEPT:
3005 return (cp_tree_equal (DEFERRED_NOEXCEPT_PATTERN (t1),
3006 DEFERRED_NOEXCEPT_PATTERN (t2))
3007 && comp_template_args (DEFERRED_NOEXCEPT_ARGS (t1),
3008 DEFERRED_NOEXCEPT_ARGS (t2)));
3015 switch (TREE_CODE_CLASS (code1))
3019 case tcc_comparison:
3020 case tcc_expression:
3027 n = cp_tree_operand_length (t1);
3028 if (TREE_CODE_CLASS (code1) == tcc_vl_exp
3029 && n != TREE_OPERAND_LENGTH (t2))
3032 for (i = 0; i < n; ++i)
3033 if (!cp_tree_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i)))
3040 return same_type_p (t1, t2);
3044 /* We can get here with --disable-checking. */
3048 /* The type of ARG when used as an lvalue. */
3051 lvalue_type (tree arg)
3053 tree type = TREE_TYPE (arg);
3057 /* The type of ARG for printing error messages; denote lvalues with
3061 error_type (tree arg)
3063 tree type = TREE_TYPE (arg);
3065 if (TREE_CODE (type) == ARRAY_TYPE)
3067 else if (TREE_CODE (type) == ERROR_MARK)
3069 else if (real_lvalue_p (arg))
3070 type = build_reference_type (lvalue_type (arg));
3071 else if (MAYBE_CLASS_TYPE_P (type))
3072 type = lvalue_type (arg);
3077 /* Does FUNCTION use a variable-length argument list? */
3080 varargs_function_p (const_tree function)
3082 return stdarg_p (TREE_TYPE (function));
3085 /* Returns 1 if decl is a member of a class. */
3088 member_p (const_tree decl)
3090 const_tree const ctx = DECL_CONTEXT (decl);
3091 return (ctx && TYPE_P (ctx));
3094 /* Create a placeholder for member access where we don't actually have an
3095 object that the access is against. */
3098 build_dummy_object (tree type)
3100 tree decl = build1 (CONVERT_EXPR, build_pointer_type (type), void_node);
3101 return cp_build_indirect_ref (decl, RO_NULL, tf_warning_or_error);
3104 /* We've gotten a reference to a member of TYPE. Return *this if appropriate,
3105 or a dummy object otherwise. If BINFOP is non-0, it is filled with the
3106 binfo path from current_class_type to TYPE, or 0. */
3109 maybe_dummy_object (tree type, tree* binfop)
3113 tree current = current_nonlambda_class_type ();
3116 && (binfo = lookup_base (current, type, ba_any, NULL,
3117 tf_warning_or_error)))
3121 /* Reference from a nested class member function. */
3123 binfo = TYPE_BINFO (type);
3129 if (current_class_ref
3130 /* current_class_ref might not correspond to current_class_type if
3131 we're in tsubst_default_argument or a lambda-declarator; in either
3132 case, we want to use current_class_ref if it matches CONTEXT. */
3133 && (same_type_ignoring_top_level_qualifiers_p
3134 (TREE_TYPE (current_class_ref), context)))
3135 decl = current_class_ref;
3137 decl = build_dummy_object (context);
3142 /* Returns 1 if OB is a placeholder object, or a pointer to one. */
3145 is_dummy_object (const_tree ob)
3147 if (INDIRECT_REF_P (ob))
3148 ob = TREE_OPERAND (ob, 0);
3149 return (TREE_CODE (ob) == CONVERT_EXPR
3150 && TREE_OPERAND (ob, 0) == void_node);
3153 /* Returns 1 iff type T is something we want to treat as a scalar type for
3154 the purpose of deciding whether it is trivial/POD/standard-layout. */
3157 scalarish_type_p (const_tree t)
3159 if (t == error_mark_node)
3162 return (SCALAR_TYPE_P (t)
3163 || TREE_CODE (t) == VECTOR_TYPE);
3166 /* Returns true iff T requires non-trivial default initialization. */
3169 type_has_nontrivial_default_init (const_tree t)
3171 t = strip_array_types (CONST_CAST_TREE (t));
3173 if (CLASS_TYPE_P (t))
3174 return TYPE_HAS_COMPLEX_DFLT (t);
3179 /* Returns true iff copying an object of type T (including via move
3180 constructor) is non-trivial. That is, T has no non-trivial copy
3181 constructors and no non-trivial move constructors. */
3184 type_has_nontrivial_copy_init (const_tree t)
3186 t = strip_array_types (CONST_CAST_TREE (t));
3188 if (CLASS_TYPE_P (t))
3190 gcc_assert (COMPLETE_TYPE_P (t));
3191 return ((TYPE_HAS_COPY_CTOR (t)
3192 && TYPE_HAS_COMPLEX_COPY_CTOR (t))
3193 || TYPE_HAS_COMPLEX_MOVE_CTOR (t));
3199 /* Returns 1 iff type T is a trivially copyable type, as defined in
3200 [basic.types] and [class]. */
3203 trivially_copyable_p (const_tree t)
3205 t = strip_array_types (CONST_CAST_TREE (t));
3207 if (CLASS_TYPE_P (t))
3208 return ((!TYPE_HAS_COPY_CTOR (t)
3209 || !TYPE_HAS_COMPLEX_COPY_CTOR (t))
3210 && !TYPE_HAS_COMPLEX_MOVE_CTOR (t)
3211 && (!TYPE_HAS_COPY_ASSIGN (t)
3212 || !TYPE_HAS_COMPLEX_COPY_ASSIGN (t))
3213 && !TYPE_HAS_COMPLEX_MOVE_ASSIGN (t)
3214 && TYPE_HAS_TRIVIAL_DESTRUCTOR (t));
3216 return !CP_TYPE_VOLATILE_P (t) && scalarish_type_p (t);
3219 /* Returns 1 iff type T is a trivial type, as defined in [basic.types] and
3223 trivial_type_p (const_tree t)
3225 t = strip_array_types (CONST_CAST_TREE (t));
3227 if (CLASS_TYPE_P (t))
3228 return (TYPE_HAS_TRIVIAL_DFLT (t)
3229 && trivially_copyable_p (t));
3231 return scalarish_type_p (t);
3234 /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */
3237 pod_type_p (const_tree t)
3239 /* This CONST_CAST is okay because strip_array_types returns its
3240 argument unmodified and we assign it to a const_tree. */
3241 t = strip_array_types (CONST_CAST_TREE(t));
3243 if (!CLASS_TYPE_P (t))
3244 return scalarish_type_p (t);
3245 else if (cxx_dialect > cxx98)
3246 /* [class]/10: A POD struct is a class that is both a trivial class and a
3247 standard-layout class, and has no non-static data members of type
3248 non-POD struct, non-POD union (or array of such types).
3250 We don't need to check individual members because if a member is
3251 non-std-layout or non-trivial, the class will be too. */
3252 return (std_layout_type_p (t) && trivial_type_p (t));
3254 /* The C++98 definition of POD is different. */
3255 return !CLASSTYPE_NON_LAYOUT_POD_P (t);
3258 /* Returns true iff T is POD for the purpose of layout, as defined in the
3262 layout_pod_type_p (const_tree t)
3264 t = strip_array_types (CONST_CAST_TREE (t));
3266 if (CLASS_TYPE_P (t))
3267 return !CLASSTYPE_NON_LAYOUT_POD_P (t);
3269 return scalarish_type_p (t);
3272 /* Returns true iff T is a standard-layout type, as defined in
3276 std_layout_type_p (const_tree t)
3278 t = strip_array_types (CONST_CAST_TREE (t));
3280 if (CLASS_TYPE_P (t))
3281 return !CLASSTYPE_NON_STD_LAYOUT (t);
3283 return scalarish_type_p (t);
3286 /* Nonzero iff type T is a class template implicit specialization. */
3289 class_tmpl_impl_spec_p (const_tree t)
3291 return CLASS_TYPE_P (t) && CLASSTYPE_TEMPLATE_INSTANTIATION (t);
3294 /* Returns 1 iff zero initialization of type T means actually storing
3298 zero_init_p (const_tree t)
3300 /* This CONST_CAST is okay because strip_array_types returns its
3301 argument unmodified and we assign it to a const_tree. */
3302 t = strip_array_types (CONST_CAST_TREE(t));
3304 if (t == error_mark_node)
3307 /* NULL pointers to data members are initialized with -1. */
3308 if (TYPE_PTRDATAMEM_P (t))
3311 /* Classes that contain types that can't be zero-initialized, cannot
3312 be zero-initialized themselves. */
3313 if (CLASS_TYPE_P (t) && CLASSTYPE_NON_ZERO_INIT_P (t))
3319 /* Table of valid C++ attributes. */
3320 const struct attribute_spec cxx_attribute_table[] =
3322 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
3323 affects_type_identity } */
3324 { "java_interface", 0, 0, false, false, false,
3325 handle_java_interface_attribute, false },
3326 { "com_interface", 0, 0, false, false, false,
3327 handle_com_interface_attribute, false },
3328 { "init_priority", 1, 1, true, false, false,
3329 handle_init_priority_attribute, false },
3330 { "abi_tag", 1, -1, false, false, false,
3331 handle_abi_tag_attribute, true },
3332 { NULL, 0, 0, false, false, false, NULL, false }
3335 /* Handle a "java_interface" attribute; arguments as in
3336 struct attribute_spec.handler. */
3338 handle_java_interface_attribute (tree* node,
3345 || !CLASS_TYPE_P (*node)
3346 || !TYPE_FOR_JAVA (*node))
3348 error ("%qE attribute can only be applied to Java class definitions",
3350 *no_add_attrs = true;
3353 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
3354 *node = build_variant_type_copy (*node);
3355 TYPE_JAVA_INTERFACE (*node) = 1;
3360 /* Handle a "com_interface" attribute; arguments as in
3361 struct attribute_spec.handler. */
3363 handle_com_interface_attribute (tree* node,
3371 *no_add_attrs = true;
3374 || !CLASS_TYPE_P (*node)
3375 || *node != TYPE_MAIN_VARIANT (*node))
3377 warning (OPT_Wattributes, "%qE attribute can only be applied "
3378 "to class definitions", name);
3383 warning (0, "%qE is obsolete; g++ vtables are now COM-compatible by default",
3389 /* Handle an "init_priority" attribute; arguments as in
3390 struct attribute_spec.handler. */
3392 handle_init_priority_attribute (tree* node,
3398 tree initp_expr = TREE_VALUE (args);
3400 tree type = TREE_TYPE (decl);
3403 STRIP_NOPS (initp_expr);
3404 initp_expr = default_conversion (initp_expr);
3406 if (!initp_expr || TREE_CODE (initp_expr) != INTEGER_CST)
3408 error ("requested init_priority is not an integer constant");
3409 *no_add_attrs = true;
3413 pri = TREE_INT_CST_LOW (initp_expr);
3415 type = strip_array_types (type);
3417 if (decl == NULL_TREE
3419 || !TREE_STATIC (decl)
3420 || DECL_EXTERNAL (decl)
3421 || (TREE_CODE (type) != RECORD_TYPE
3422 && TREE_CODE (type) != UNION_TYPE)
3423 /* Static objects in functions are initialized the
3424 first time control passes through that
3425 function. This is not precise enough to pin down an
3426 init_priority value, so don't allow it. */
3427 || current_function_decl)
3429 error ("can only use %qE attribute on file-scope definitions "
3430 "of objects of class type", name);
3431 *no_add_attrs = true;
3435 if (pri > MAX_INIT_PRIORITY || pri <= 0)
3437 error ("requested init_priority is out of range");
3438 *no_add_attrs = true;
3442 /* Check for init_priorities that are reserved for
3443 language and runtime support implementations.*/
3444 if (pri <= MAX_RESERVED_INIT_PRIORITY)
3447 (0, "requested init_priority is reserved for internal use");
3450 if (SUPPORTS_INIT_PRIORITY)
3452 SET_DECL_INIT_PRIORITY (decl, pri);
3453 DECL_HAS_INIT_PRIORITY_P (decl) = 1;
3458 error ("%qE attribute is not supported on this platform", name);
3459 *no_add_attrs = true;
3464 /* DECL is being redeclared; the old declaration had the abi tags in OLD,
3465 and the new one has the tags in NEW_. Give an error if there are tags
3466 in NEW_ that weren't in OLD. */
3469 check_abi_tag_redeclaration (const_tree decl, const_tree old, const_tree new_)
3471 if (old && TREE_CODE (TREE_VALUE (old)) == TREE_LIST)
3472 old = TREE_VALUE (old);
3473 if (new_ && TREE_CODE (TREE_VALUE (new_)) == TREE_LIST)
3474 new_ = TREE_VALUE (new_);
3476 for (const_tree t = new_; t; t = TREE_CHAIN (t))
3478 tree str = TREE_VALUE (t);
3479 for (const_tree in = old; in; in = TREE_CHAIN (in))
3481 tree ostr = TREE_VALUE (in);
3482 if (cp_tree_equal (str, ostr))
3485 error ("redeclaration of %qD adds abi tag %E", decl, str);
3491 inform (DECL_SOURCE_LOCATION (decl), "previous declaration here");
3497 /* Handle an "abi_tag" attribute; arguments as in
3498 struct attribute_spec.handler. */
3501 handle_abi_tag_attribute (tree* node, tree name, tree args,
3502 int flags, bool* no_add_attrs)
3506 if (!OVERLOAD_TYPE_P (*node))
3508 error ("%qE attribute applied to non-class, non-enum type %qT",
3512 else if (!(flags & (int)ATTR_FLAG_TYPE_IN_PLACE))
3514 error ("%qE attribute applied to %qT after its definition",
3518 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (*node))
3520 warning (OPT_Wattributes, "ignoring %qE attribute applied to "
3521 "template instantiation %qT", name, *node);
3524 else if (CLASSTYPE_TEMPLATE_SPECIALIZATION (*node))
3526 warning (OPT_Wattributes, "ignoring %qE attribute applied to "
3527 "template specialization %qT", name, *node);
3531 tree attributes = TYPE_ATTRIBUTES (*node);
3532 tree decl = TYPE_NAME (*node);
3534 /* Make sure all declarations have the same abi tags. */
3535 if (DECL_SOURCE_LOCATION (decl) != input_location)
3537 if (!check_abi_tag_redeclaration (decl,
3538 lookup_attribute ("abi_tag",
3546 if (TREE_CODE (*node) != FUNCTION_DECL)
3548 error ("%qE attribute applied to non-function %qD", name, *node);
3551 else if (DECL_LANGUAGE (*node) == lang_c)
3553 error ("%qE attribute applied to extern \"C\" function %qD",
3562 *no_add_attrs = true;
3566 /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the
3567 thing pointed to by the constant. */
3570 make_ptrmem_cst (tree type, tree member)
3572 tree ptrmem_cst = make_node (PTRMEM_CST);
3573 TREE_TYPE (ptrmem_cst) = type;
3574 PTRMEM_CST_MEMBER (ptrmem_cst) = member;
3578 /* Build a variant of TYPE that has the indicated ATTRIBUTES. May
3579 return an existing type if an appropriate type already exists. */
3582 cp_build_type_attribute_variant (tree type, tree attributes)
3586 new_type = build_type_attribute_variant (type, attributes);
3587 if (TREE_CODE (new_type) == FUNCTION_TYPE
3588 || TREE_CODE (new_type) == METHOD_TYPE)
3590 new_type = build_exception_variant (new_type,
3591 TYPE_RAISES_EXCEPTIONS (type));
3592 new_type = build_ref_qualified_type (new_type,
3593 type_memfn_rqual (type));
3596 /* Making a new main variant of a class type is broken. */
3597 gcc_assert (!CLASS_TYPE_P (type) || new_type == type);
3602 /* Return TRUE if TYPE1 and TYPE2 are identical for type hashing purposes.
3603 Called only after doing all language independent checks. Only
3604 to check TYPE_RAISES_EXCEPTIONS for FUNCTION_TYPE, the rest is already
3605 compared in type_hash_eq. */
3608 cxx_type_hash_eq (const_tree typea, const_tree typeb)
3610 gcc_assert (TREE_CODE (typea) == FUNCTION_TYPE
3611 || TREE_CODE (typea) == METHOD_TYPE);
3613 return comp_except_specs (TYPE_RAISES_EXCEPTIONS (typea),
3614 TYPE_RAISES_EXCEPTIONS (typeb), ce_exact);
3617 /* Apply FUNC to all language-specific sub-trees of TP in a pre-order
3618 traversal. Called from walk_tree. */
3621 cp_walk_subtrees (tree *tp, int *walk_subtrees_p, walk_tree_fn func,
3622 void *data, hash_set<tree> *pset)
3624 enum tree_code code = TREE_CODE (*tp);
3627 #define WALK_SUBTREE(NODE) \
3630 result = cp_walk_tree (&(NODE), func, data, pset); \
3631 if (result) goto out; \
3635 /* Not one of the easy cases. We must explicitly go through the
3641 case TEMPLATE_TEMPLATE_PARM:
3642 case BOUND_TEMPLATE_TEMPLATE_PARM:
3643 case UNBOUND_CLASS_TEMPLATE:
3644 case TEMPLATE_PARM_INDEX:
3645 case TEMPLATE_TYPE_PARM:
3648 case UNDERLYING_TYPE:
3649 /* None of these have subtrees other than those already walked
3651 *walk_subtrees_p = 0;
3655 WALK_SUBTREE (BASELINK_FUNCTIONS (*tp));
3656 *walk_subtrees_p = 0;
3660 WALK_SUBTREE (TREE_TYPE (*tp));
3661 *walk_subtrees_p = 0;
3665 WALK_SUBTREE (TREE_PURPOSE (*tp));
3669 WALK_SUBTREE (OVL_FUNCTION (*tp));
3670 WALK_SUBTREE (OVL_CHAIN (*tp));
3671 *walk_subtrees_p = 0;
3675 WALK_SUBTREE (DECL_NAME (*tp));
3676 WALK_SUBTREE (USING_DECL_SCOPE (*tp));
3677 WALK_SUBTREE (USING_DECL_DECLS (*tp));
3678 *walk_subtrees_p = 0;
3682 if (TYPE_PTRMEMFUNC_P (*tp))
3683 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE_RAW (*tp));
3686 case TYPE_ARGUMENT_PACK:
3687 case NONTYPE_ARGUMENT_PACK:
3689 tree args = ARGUMENT_PACK_ARGS (*tp);
3690 int i, len = TREE_VEC_LENGTH (args);
3691 for (i = 0; i < len; i++)
3692 WALK_SUBTREE (TREE_VEC_ELT (args, i));
3696 case TYPE_PACK_EXPANSION:
3697 WALK_SUBTREE (TREE_TYPE (*tp));
3698 WALK_SUBTREE (PACK_EXPANSION_EXTRA_ARGS (*tp));
3699 *walk_subtrees_p = 0;
3702 case EXPR_PACK_EXPANSION:
3703 WALK_SUBTREE (TREE_OPERAND (*tp, 0));
3704 WALK_SUBTREE (PACK_EXPANSION_EXTRA_ARGS (*tp));
3705 *walk_subtrees_p = 0;
3709 case REINTERPRET_CAST_EXPR:
3710 case STATIC_CAST_EXPR:
3711 case CONST_CAST_EXPR:
3712 case DYNAMIC_CAST_EXPR:
3713 case IMPLICIT_CONV_EXPR:
3714 if (TREE_TYPE (*tp))
3715 WALK_SUBTREE (TREE_TYPE (*tp));
3719 for (i = 0; i < TREE_CODE_LENGTH (TREE_CODE (*tp)); ++i)
3720 WALK_SUBTREE (TREE_OPERAND (*tp, i));
3722 *walk_subtrees_p = 0;
3726 WALK_SUBTREE (TRAIT_EXPR_TYPE1 (*tp));
3727 WALK_SUBTREE (TRAIT_EXPR_TYPE2 (*tp));
3728 *walk_subtrees_p = 0;
3732 WALK_SUBTREE (DECLTYPE_TYPE_EXPR (*tp));
3733 *walk_subtrees_p = 0;
3741 /* We didn't find what we were looking for. */
3748 /* Like save_expr, but for C++. */
3751 cp_save_expr (tree expr)
3753 /* There is no reason to create a SAVE_EXPR within a template; if
3754 needed, we can create the SAVE_EXPR when instantiating the
3755 template. Furthermore, the middle-end cannot handle C++-specific
3757 if (processing_template_decl)
3759 return save_expr (expr);
3762 /* Initialize tree.c. */
3767 list_hash_table = hash_table<list_hasher>::create_ggc (61);
3770 /* Returns the kind of special function that DECL (a FUNCTION_DECL)
3771 is. Note that sfk_none is zero, so this function can be used as a
3772 predicate to test whether or not DECL is a special function. */
3774 special_function_kind
3775 special_function_p (const_tree decl)
3777 /* Rather than doing all this stuff with magic names, we should
3778 probably have a field of type `special_function_kind' in
3779 DECL_LANG_SPECIFIC. */
3780 if (DECL_INHERITED_CTOR_BASE (decl))
3781 return sfk_inheriting_constructor;
3782 if (DECL_COPY_CONSTRUCTOR_P (decl))
3783 return sfk_copy_constructor;
3784 if (DECL_MOVE_CONSTRUCTOR_P (decl))
3785 return sfk_move_constructor;
3786 if (DECL_CONSTRUCTOR_P (decl))
3787 return sfk_constructor;
3788 if (DECL_OVERLOADED_OPERATOR_P (decl) == NOP_EXPR)
3790 if (copy_fn_p (decl))
3791 return sfk_copy_assignment;
3792 if (move_fn_p (decl))
3793 return sfk_move_assignment;
3795 if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl))
3796 return sfk_destructor;
3797 if (DECL_COMPLETE_DESTRUCTOR_P (decl))
3798 return sfk_complete_destructor;
3799 if (DECL_BASE_DESTRUCTOR_P (decl))
3800 return sfk_base_destructor;
3801 if (DECL_DELETING_DESTRUCTOR_P (decl))
3802 return sfk_deleting_destructor;
3803 if (DECL_CONV_FN_P (decl))
3804 return sfk_conversion;
3809 /* Returns nonzero if TYPE is a character type, including wchar_t. */
3812 char_type_p (tree type)
3814 return (same_type_p (type, char_type_node)
3815 || same_type_p (type, unsigned_char_type_node)
3816 || same_type_p (type, signed_char_type_node)
3817 || same_type_p (type, char16_type_node)
3818 || same_type_p (type, char32_type_node)
3819 || same_type_p (type, wchar_type_node));
3822 /* Returns the kind of linkage associated with the indicated DECL. Th
3823 value returned is as specified by the language standard; it is
3824 independent of implementation details regarding template
3825 instantiation, etc. For example, it is possible that a declaration
3826 to which this function assigns external linkage would not show up
3827 as a global symbol when you run `nm' on the resulting object file. */
3830 decl_linkage (tree decl)
3832 /* This function doesn't attempt to calculate the linkage from first
3833 principles as given in [basic.link]. Instead, it makes use of
3834 the fact that we have already set TREE_PUBLIC appropriately, and
3835 then handles a few special cases. Ideally, we would calculate
3836 linkage first, and then transform that into a concrete
3839 /* Things that don't have names have no linkage. */
3840 if (!DECL_NAME (decl))
3843 /* Fields have no linkage. */
3844 if (TREE_CODE (decl) == FIELD_DECL)
3847 /* Things that are TREE_PUBLIC have external linkage. */
3848 if (TREE_PUBLIC (decl))
3851 if (TREE_CODE (decl) == NAMESPACE_DECL)
3854 /* Linkage of a CONST_DECL depends on the linkage of the enumeration
3856 if (TREE_CODE (decl) == CONST_DECL)
3857 return decl_linkage (TYPE_NAME (DECL_CONTEXT (decl)));
3859 /* Things in local scope do not have linkage, if they don't have
3861 if (decl_function_context (decl))
3864 /* Members of the anonymous namespace also have TREE_PUBLIC unset, but
3865 are considered to have external linkage for language purposes, as do
3866 template instantiations on targets without weak symbols. DECLs really
3867 meant to have internal linkage have DECL_THIS_STATIC set. */
3868 if (TREE_CODE (decl) == TYPE_DECL)
3870 if (VAR_OR_FUNCTION_DECL_P (decl))
3872 if (!DECL_THIS_STATIC (decl))
3875 /* Static data members and static member functions from classes
3876 in anonymous namespace also don't have TREE_PUBLIC set. */
3877 if (DECL_CLASS_CONTEXT (decl))
3881 /* Everything else has internal linkage. */
3885 /* Returns the storage duration of the object or reference associated with
3886 the indicated DECL, which should be a VAR_DECL or PARM_DECL. */
3889 decl_storage_duration (tree decl)
3891 if (TREE_CODE (decl) == PARM_DECL)
3893 if (TREE_CODE (decl) == FUNCTION_DECL)
3895 gcc_assert (VAR_P (decl));
3896 if (!TREE_STATIC (decl)
3897 && !DECL_EXTERNAL (decl))
3899 if (DECL_THREAD_LOCAL_P (decl))
3904 /* EXP is an expression that we want to pre-evaluate. Returns (in
3905 *INITP) an expression that will perform the pre-evaluation. The
3906 value returned by this function is a side-effect free expression
3907 equivalent to the pre-evaluated expression. Callers must ensure
3908 that *INITP is evaluated before EXP. */
3911 stabilize_expr (tree exp, tree* initp)
3915 if (!TREE_SIDE_EFFECTS (exp))
3916 init_expr = NULL_TREE;
3917 else if (VOID_TYPE_P (TREE_TYPE (exp)))
3922 /* There are no expressions with REFERENCE_TYPE, but there can be call
3923 arguments with such a type; just treat it as a pointer. */
3924 else if (TREE_CODE (TREE_TYPE (exp)) == REFERENCE_TYPE
3925 || SCALAR_TYPE_P (TREE_TYPE (exp))
3926 || !lvalue_or_rvalue_with_address_p (exp))
3928 init_expr = get_target_expr (exp);
3929 exp = TARGET_EXPR_SLOT (init_expr);
3930 if (CLASS_TYPE_P (TREE_TYPE (exp)))
3937 bool xval = !real_lvalue_p (exp);
3938 exp = cp_build_addr_expr (exp, tf_warning_or_error);
3939 init_expr = get_target_expr (exp);
3940 exp = TARGET_EXPR_SLOT (init_expr);
3941 exp = cp_build_indirect_ref (exp, RO_NULL, tf_warning_or_error);
3947 gcc_assert (!TREE_SIDE_EFFECTS (exp));
3951 /* Add NEW_EXPR, an expression whose value we don't care about, after the
3952 similar expression ORIG. */
3955 add_stmt_to_compound (tree orig, tree new_expr)
3957 if (!new_expr || !TREE_SIDE_EFFECTS (new_expr))
3959 if (!orig || !TREE_SIDE_EFFECTS (orig))
3961 return build2 (COMPOUND_EXPR, void_type_node, orig, new_expr);
3964 /* Like stabilize_expr, but for a call whose arguments we want to
3965 pre-evaluate. CALL is modified in place to use the pre-evaluated
3966 arguments, while, upon return, *INITP contains an expression to
3967 compute the arguments. */
3970 stabilize_call (tree call, tree *initp)
3972 tree inits = NULL_TREE;
3974 int nargs = call_expr_nargs (call);
3976 if (call == error_mark_node || processing_template_decl)
3982 gcc_assert (TREE_CODE (call) == CALL_EXPR);
3984 for (i = 0; i < nargs; i++)
3987 CALL_EXPR_ARG (call, i) =
3988 stabilize_expr (CALL_EXPR_ARG (call, i), &init);
3989 inits = add_stmt_to_compound (inits, init);
3995 /* Like stabilize_expr, but for an AGGR_INIT_EXPR whose arguments we want
3996 to pre-evaluate. CALL is modified in place to use the pre-evaluated
3997 arguments, while, upon return, *INITP contains an expression to
3998 compute the arguments. */
4001 stabilize_aggr_init (tree call, tree *initp)
4003 tree inits = NULL_TREE;
4005 int nargs = aggr_init_expr_nargs (call);
4007 if (call == error_mark_node)
4010 gcc_assert (TREE_CODE (call) == AGGR_INIT_EXPR);
4012 for (i = 0; i < nargs; i++)
4015 AGGR_INIT_EXPR_ARG (call, i) =
4016 stabilize_expr (AGGR_INIT_EXPR_ARG (call, i), &init);
4017 inits = add_stmt_to_compound (inits, init);
4023 /* Like stabilize_expr, but for an initialization.
4025 If the initialization is for an object of class type, this function
4026 takes care not to introduce additional temporaries.
4028 Returns TRUE iff the expression was successfully pre-evaluated,
4029 i.e., if INIT is now side-effect free, except for, possibly, a
4030 single call to a constructor. */
4033 stabilize_init (tree init, tree *initp)
4039 if (t == error_mark_node || processing_template_decl)
4042 if (TREE_CODE (t) == INIT_EXPR)
4043 t = TREE_OPERAND (t, 1);
4044 if (TREE_CODE (t) == TARGET_EXPR)
4045 t = TARGET_EXPR_INITIAL (t);
4047 /* If the RHS can be stabilized without breaking copy elision, stabilize
4048 it. We specifically don't stabilize class prvalues here because that
4049 would mean an extra copy, but they might be stabilized below. */
4050 if (TREE_CODE (init) == INIT_EXPR
4051 && TREE_CODE (t) != CONSTRUCTOR
4052 && TREE_CODE (t) != AGGR_INIT_EXPR
4053 && (SCALAR_TYPE_P (TREE_TYPE (t))
4054 || lvalue_or_rvalue_with_address_p (t)))
4056 TREE_OPERAND (init, 1) = stabilize_expr (t, initp);
4060 if (TREE_CODE (t) == COMPOUND_EXPR
4061 && TREE_CODE (init) == INIT_EXPR)
4063 tree last = expr_last (t);
4064 /* Handle stabilizing the EMPTY_CLASS_EXPR pattern. */
4065 if (!TREE_SIDE_EFFECTS (last))
4068 TREE_OPERAND (init, 1) = last;
4073 if (TREE_CODE (t) == CONSTRUCTOR)
4075 /* Aggregate initialization: stabilize each of the field
4078 constructor_elt *ce;
4080 vec<constructor_elt, va_gc> *v = CONSTRUCTOR_ELTS (t);
4081 for (i = 0; vec_safe_iterate (v, i, &ce); ++i)
4083 tree type = TREE_TYPE (ce->value);
4085 if (TREE_CODE (type) == REFERENCE_TYPE
4086 || SCALAR_TYPE_P (type))
4087 ce->value = stabilize_expr (ce->value, &subinit);
4088 else if (!stabilize_init (ce->value, &subinit))
4090 *initp = add_stmt_to_compound (*initp, subinit);
4095 if (TREE_CODE (t) == CALL_EXPR)
4097 stabilize_call (t, initp);
4101 if (TREE_CODE (t) == AGGR_INIT_EXPR)
4103 stabilize_aggr_init (t, initp);
4107 /* The initialization is being performed via a bitwise copy -- and
4108 the item copied may have side effects. */
4109 return !TREE_SIDE_EFFECTS (init);
4112 /* Like "fold", but should be used whenever we might be processing the
4113 body of a template. */
4116 fold_if_not_in_template (tree expr)
4118 /* In the body of a template, there is never any need to call
4119 "fold". We will call fold later when actually instantiating the
4120 template. Integral constant expressions in templates will be
4121 evaluated via instantiate_non_dependent_expr, as necessary. */
4122 if (processing_template_decl)
4125 /* Fold C++ front-end specific tree codes. */
4126 if (TREE_CODE (expr) == UNARY_PLUS_EXPR)
4127 return fold_convert (TREE_TYPE (expr), TREE_OPERAND (expr, 0));
4132 /* Returns true if a cast to TYPE may appear in an integral constant
4136 cast_valid_in_integral_constant_expression_p (tree type)
4138 return (INTEGRAL_OR_ENUMERATION_TYPE_P (type)
4139 || cxx_dialect >= cxx11
4140 || dependent_type_p (type)
4141 || type == error_mark_node);
4144 /* Return true if we need to fix linkage information of DECL. */
4147 cp_fix_function_decl_p (tree decl)
4149 /* Skip if DECL is not externally visible. */
4150 if (!TREE_PUBLIC (decl))
4153 /* We need to fix DECL if it a appears to be exported but with no
4154 function body. Thunks do not have CFGs and we may need to
4155 handle them specially later. */
4156 if (!gimple_has_body_p (decl)
4157 && !DECL_THUNK_P (decl)
4158 && !DECL_EXTERNAL (decl))
4160 struct cgraph_node *node = cgraph_node::get (decl);
4162 /* Don't fix same_body aliases. Although they don't have their own
4163 CFG, they share it with what they alias to. */
4164 if (!node || !node->alias
4165 || !vec_safe_length (node->ref_list.references))
4172 /* Clean the C++ specific parts of the tree T. */
4175 cp_free_lang_data (tree t)
4177 if (TREE_CODE (t) == METHOD_TYPE
4178 || TREE_CODE (t) == FUNCTION_TYPE)
4180 /* Default args are not interesting anymore. */
4181 tree argtypes = TYPE_ARG_TYPES (t);
4184 TREE_PURPOSE (argtypes) = 0;
4185 argtypes = TREE_CHAIN (argtypes);
4188 else if (TREE_CODE (t) == FUNCTION_DECL
4189 && cp_fix_function_decl_p (t))
4191 /* If T is used in this translation unit at all, the definition
4192 must exist somewhere else since we have decided to not emit it
4193 in this TU. So make it an external reference. */
4194 DECL_EXTERNAL (t) = 1;
4195 TREE_STATIC (t) = 0;
4197 if (TREE_CODE (t) == NAMESPACE_DECL)
4199 /* The list of users of a namespace isn't useful for the middle-end
4200 or debug generators. */
4201 DECL_NAMESPACE_USERS (t) = NULL_TREE;
4202 /* Neither do we need the leftover chaining of namespaces
4203 from the binding level. */
4204 DECL_CHAIN (t) = NULL_TREE;
4208 /* Stub for c-common. Please keep in sync with c-decl.c.
4209 FIXME: If address space support is target specific, then this
4210 should be a C target hook. But currently this is not possible,
4211 because this function is called via REGISTER_TARGET_PRAGMAS. */
4213 c_register_addr_space (const char * /*word*/, addr_space_t /*as*/)
4217 /* Return the number of operands in T that we care about for things like
4221 cp_tree_operand_length (const_tree t)
4223 enum tree_code code = TREE_CODE (t);
4227 case PREINCREMENT_EXPR:
4228 case PREDECREMENT_EXPR:
4229 case POSTINCREMENT_EXPR:
4230 case POSTDECREMENT_EXPR:
4236 case EXPR_PACK_EXPANSION:
4240 return TREE_OPERAND_LENGTH (t);
4244 /* Implement -Wzero_as_null_pointer_constant. Return true if the
4245 conditions for the warning hold, false otherwise. */
4247 maybe_warn_zero_as_null_pointer_constant (tree expr, location_t loc)
4249 if (c_inhibit_evaluation_warnings == 0
4250 && !NULLPTR_TYPE_P (TREE_TYPE (expr)))
4252 warning_at (loc, OPT_Wzero_as_null_pointer_constant,
4253 "zero as null pointer constant");
4259 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4260 /* Complain that some language-specific thing hanging off a tree
4261 node has been accessed improperly. */
4264 lang_check_failed (const char* file, int line, const char* function)
4266 internal_error ("lang_* check: failed in %s, at %s:%d",
4267 function, trim_filename (file), line);
4269 #endif /* ENABLE_TREE_CHECKING */
4271 #include "gt-cp-tree.h"