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;
825 bool dependent = (processing_template_decl
826 && (dependent_type_p (elt_type)
827 || (index_type && dependent_type_p (index_type))));
829 if (elt_type != TYPE_MAIN_VARIANT (elt_type))
830 /* Start with an array of the TYPE_MAIN_VARIANT. */
831 t = build_cplus_array_type (TYPE_MAIN_VARIANT (elt_type),
835 /* Since type_hash_canon calls layout_type, we need to use our own
837 cplus_array_info cai;
840 if (cplus_array_htab == NULL)
841 cplus_array_htab = hash_table<cplus_array_hasher>::create_ggc (61);
843 hash = TYPE_UID (elt_type);
845 hash ^= TYPE_UID (index_type);
847 cai.domain = index_type;
849 tree *e = cplus_array_htab->find_slot_with_hash (&cai, hash, INSERT);
851 /* We have found the type: we're done. */
855 /* Build a new array type. */
856 t = build_min_array_type (elt_type, index_type);
858 /* Store it in the hash table. */
861 /* Set the canonical type for this new node. */
862 set_array_type_canon (t, elt_type, index_type);
867 t = build_array_type (elt_type, index_type);
870 /* Now check whether we already have this array variant. */
871 if (elt_type != TYPE_MAIN_VARIANT (elt_type))
874 for (t = m; t; t = TYPE_NEXT_VARIANT (t))
875 if (TREE_TYPE (t) == elt_type
876 && TYPE_NAME (t) == NULL_TREE
877 && TYPE_ATTRIBUTES (t) == NULL_TREE)
881 t = build_min_array_type (elt_type, index_type);
882 set_array_type_canon (t, elt_type, index_type);
884 TYPE_MAIN_VARIANT (t) = m;
885 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
886 TYPE_NEXT_VARIANT (m) = t;
892 /* Avoid spurious warnings with VLAs (c++/54583). */
893 if (TYPE_SIZE (t) && EXPR_P (TYPE_SIZE (t)))
894 TREE_NO_WARNING (TYPE_SIZE (t)) = 1;
896 /* Push these needs up to the ARRAY_TYPE so that initialization takes
897 place more easily. */
898 bool needs_ctor = (TYPE_NEEDS_CONSTRUCTING (t)
899 = TYPE_NEEDS_CONSTRUCTING (elt_type));
900 bool needs_dtor = (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
901 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (elt_type));
903 if (!dependent && t == TYPE_MAIN_VARIANT (t)
904 && !COMPLETE_TYPE_P (t) && COMPLETE_TYPE_P (elt_type))
906 /* The element type has been completed since the last time we saw
907 this array type; update the layout and 'tor flags for any variants
910 for (tree v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
912 TYPE_NEEDS_CONSTRUCTING (v) = needs_ctor;
913 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (v) = needs_dtor;
920 /* Return an ARRAY_TYPE with element type ELT and length N. */
923 build_array_of_n_type (tree elt, int n)
925 return build_cplus_array_type (elt, build_index_type (size_int (n - 1)));
928 /* True iff T is an N3639 array of runtime bound (VLA). These were
929 approved for C++14 but then removed. */
932 array_of_runtime_bound_p (tree t)
934 if (!t || TREE_CODE (t) != ARRAY_TYPE)
936 tree dom = TYPE_DOMAIN (t);
939 tree max = TYPE_MAX_VALUE (dom);
940 return (!potential_rvalue_constant_expression (max)
941 || (!value_dependent_expression_p (max) && !TREE_CONSTANT (max)));
944 /* Return a reference type node referring to TO_TYPE. If RVAL is
945 true, return an rvalue reference type, otherwise return an lvalue
946 reference type. If a type node exists, reuse it, otherwise create
949 cp_build_reference_type (tree to_type, bool rval)
952 lvalue_ref = build_reference_type (to_type);
956 /* This code to create rvalue reference types is based on and tied
957 to the code creating lvalue reference types in the middle-end
958 functions build_reference_type_for_mode and build_reference_type.
960 It works by putting the rvalue reference type nodes after the
961 lvalue reference nodes in the TYPE_NEXT_REF_TO linked list, so
962 they will effectively be ignored by the middle end. */
964 for (t = lvalue_ref; (t = TYPE_NEXT_REF_TO (t)); )
965 if (TYPE_REF_IS_RVALUE (t))
968 t = build_distinct_type_copy (lvalue_ref);
970 TYPE_REF_IS_RVALUE (t) = true;
971 TYPE_NEXT_REF_TO (t) = TYPE_NEXT_REF_TO (lvalue_ref);
972 TYPE_NEXT_REF_TO (lvalue_ref) = t;
974 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
975 SET_TYPE_STRUCTURAL_EQUALITY (t);
976 else if (TYPE_CANONICAL (to_type) != to_type)
978 = cp_build_reference_type (TYPE_CANONICAL (to_type), rval);
980 TYPE_CANONICAL (t) = t;
988 /* Returns EXPR cast to rvalue reference type, like std::move. */
993 tree type = TREE_TYPE (expr);
994 gcc_assert (TREE_CODE (type) != REFERENCE_TYPE);
995 type = cp_build_reference_type (type, /*rval*/true);
996 return build_static_cast (type, expr, tf_warning_or_error);
999 /* Used by the C++ front end to build qualified array types. However,
1000 the C version of this function does not properly maintain canonical
1001 types (which are not used in C). */
1003 c_build_qualified_type (tree type, int type_quals)
1005 return cp_build_qualified_type (type, type_quals);
1009 /* Make a variant of TYPE, qualified with the TYPE_QUALS. Handles
1010 arrays correctly. In particular, if TYPE is an array of T's, and
1011 TYPE_QUALS is non-empty, returns an array of qualified T's.
1013 FLAGS determines how to deal with ill-formed qualifications. If
1014 tf_ignore_bad_quals is set, then bad qualifications are dropped
1015 (this is permitted if TYPE was introduced via a typedef or template
1016 type parameter). If bad qualifications are dropped and tf_warning
1017 is set, then a warning is issued for non-const qualifications. If
1018 tf_ignore_bad_quals is not set and tf_error is not set, we
1019 return error_mark_node. Otherwise, we issue an error, and ignore
1022 Qualification of a reference type is valid when the reference came
1023 via a typedef or template type argument. [dcl.ref] No such
1024 dispensation is provided for qualifying a function type. [dcl.fct]
1025 DR 295 queries this and the proposed resolution brings it into line
1026 with qualifying a reference. We implement the DR. We also behave
1027 in a similar manner for restricting non-pointer types. */
1030 cp_build_qualified_type_real (tree type,
1032 tsubst_flags_t complain)
1035 int bad_quals = TYPE_UNQUALIFIED;
1037 if (type == error_mark_node)
1040 if (type_quals == cp_type_quals (type))
1043 if (TREE_CODE (type) == ARRAY_TYPE)
1045 /* In C++, the qualification really applies to the array element
1046 type. Obtain the appropriately qualified element type. */
1049 = cp_build_qualified_type_real (TREE_TYPE (type),
1053 if (element_type == error_mark_node)
1054 return error_mark_node;
1056 /* See if we already have an identically qualified type. Tests
1057 should be equivalent to those in check_qualified_type. */
1058 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
1059 if (TREE_TYPE (t) == element_type
1060 && TYPE_NAME (t) == TYPE_NAME (type)
1061 && TYPE_CONTEXT (t) == TYPE_CONTEXT (type)
1062 && attribute_list_equal (TYPE_ATTRIBUTES (t),
1063 TYPE_ATTRIBUTES (type)))
1068 t = build_cplus_array_type (element_type, TYPE_DOMAIN (type));
1070 /* Keep the typedef name. */
1071 if (TYPE_NAME (t) != TYPE_NAME (type))
1073 t = build_variant_type_copy (t);
1074 TYPE_NAME (t) = TYPE_NAME (type);
1078 /* Even if we already had this variant, we update
1079 TYPE_NEEDS_CONSTRUCTING and TYPE_HAS_NONTRIVIAL_DESTRUCTOR in case
1080 they changed since the variant was originally created.
1082 This seems hokey; if there is some way to use a previous
1083 variant *without* coming through here,
1084 TYPE_NEEDS_CONSTRUCTING will never be updated. */
1085 TYPE_NEEDS_CONSTRUCTING (t)
1086 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (element_type));
1087 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
1088 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (element_type));
1091 else if (TREE_CODE (type) == TYPE_PACK_EXPANSION)
1093 tree t = PACK_EXPANSION_PATTERN (type);
1095 t = cp_build_qualified_type_real (t, type_quals, complain);
1096 return make_pack_expansion (t);
1099 /* A reference or method type shall not be cv-qualified.
1100 [dcl.ref], [dcl.fct]. This used to be an error, but as of DR 295
1101 (in CD1) we always ignore extra cv-quals on functions. */
1102 if (type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE)
1103 && (TREE_CODE (type) == REFERENCE_TYPE
1104 || TREE_CODE (type) == FUNCTION_TYPE
1105 || TREE_CODE (type) == METHOD_TYPE))
1107 if (TREE_CODE (type) == REFERENCE_TYPE)
1108 bad_quals |= type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
1109 type_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
1112 /* But preserve any function-cv-quals on a FUNCTION_TYPE. */
1113 if (TREE_CODE (type) == FUNCTION_TYPE)
1114 type_quals |= type_memfn_quals (type);
1116 /* A restrict-qualified type must be a pointer (or reference)
1117 to object or incomplete type. */
1118 if ((type_quals & TYPE_QUAL_RESTRICT)
1119 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
1120 && TREE_CODE (type) != TYPENAME_TYPE
1121 && !POINTER_TYPE_P (type))
1123 bad_quals |= TYPE_QUAL_RESTRICT;
1124 type_quals &= ~TYPE_QUAL_RESTRICT;
1127 if (bad_quals == TYPE_UNQUALIFIED
1128 || (complain & tf_ignore_bad_quals))
1130 else if (!(complain & tf_error))
1131 return error_mark_node;
1134 tree bad_type = build_qualified_type (ptr_type_node, bad_quals);
1135 error ("%qV qualifiers cannot be applied to %qT",
1139 /* Retrieve (or create) the appropriately qualified variant. */
1140 result = build_qualified_type (type, type_quals);
1142 /* Preserve exception specs and ref-qualifier since build_qualified_type
1143 doesn't know about them. */
1144 if (TREE_CODE (result) == FUNCTION_TYPE
1145 || TREE_CODE (result) == METHOD_TYPE)
1147 result = build_exception_variant (result, TYPE_RAISES_EXCEPTIONS (type));
1148 result = build_ref_qualified_type (result, type_memfn_rqual (type));
1154 /* Return TYPE with const and volatile removed. */
1157 cv_unqualified (tree type)
1161 if (type == error_mark_node)
1164 quals = cp_type_quals (type);
1165 quals &= ~(TYPE_QUAL_CONST|TYPE_QUAL_VOLATILE);
1166 return cp_build_qualified_type (type, quals);
1169 /* Builds a qualified variant of T that is not a typedef variant.
1170 E.g. consider the following declarations:
1171 typedef const int ConstInt;
1172 typedef ConstInt* PtrConstInt;
1173 If T is PtrConstInt, this function returns a type representing
1175 In other words, if T is a typedef, the function returns the underlying type.
1176 The cv-qualification and attributes of the type returned match the
1178 They will always be compatible types.
1179 The returned type is built so that all of its subtypes
1180 recursively have their typedefs stripped as well.
1182 This is different from just returning TYPE_CANONICAL (T)
1183 Because of several reasons:
1184 * If T is a type that needs structural equality
1185 its TYPE_CANONICAL (T) will be NULL.
1186 * TYPE_CANONICAL (T) desn't carry type attributes
1187 and loses template parameter names. */
1190 strip_typedefs (tree t)
1192 tree result = NULL, type = NULL, t0 = NULL;
1194 if (!t || t == error_mark_node)
1197 if (TREE_CODE (t) == TREE_LIST)
1199 bool changed = false;
1200 vec<tree,va_gc> *vec = make_tree_vector ();
1201 for (; t; t = TREE_CHAIN (t))
1203 gcc_assert (!TREE_PURPOSE (t));
1204 tree elt = strip_typedefs (TREE_VALUE (t));
1205 if (elt != TREE_VALUE (t))
1207 vec_safe_push (vec, elt);
1211 r = build_tree_list_vec (vec);
1212 release_tree_vector (vec);
1216 gcc_assert (TYPE_P (t));
1218 if (t == TYPE_CANONICAL (t))
1221 if (dependent_alias_template_spec_p (t))
1222 /* DR 1558: However, if the template-id is dependent, subsequent
1223 template argument substitution still applies to the template-id. */
1226 switch (TREE_CODE (t))
1229 type = strip_typedefs (TREE_TYPE (t));
1230 result = build_pointer_type (type);
1232 case REFERENCE_TYPE:
1233 type = strip_typedefs (TREE_TYPE (t));
1234 result = cp_build_reference_type (type, TYPE_REF_IS_RVALUE (t));
1237 t0 = strip_typedefs (TYPE_OFFSET_BASETYPE (t));
1238 type = strip_typedefs (TREE_TYPE (t));
1239 result = build_offset_type (t0, type);
1242 if (TYPE_PTRMEMFUNC_P (t))
1244 t0 = strip_typedefs (TYPE_PTRMEMFUNC_FN_TYPE (t));
1245 result = build_ptrmemfunc_type (t0);
1249 type = strip_typedefs (TREE_TYPE (t));
1250 t0 = strip_typedefs (TYPE_DOMAIN (t));;
1251 result = build_cplus_array_type (type, t0);
1256 tree arg_types = NULL, arg_node, arg_type;
1257 for (arg_node = TYPE_ARG_TYPES (t);
1259 arg_node = TREE_CHAIN (arg_node))
1261 if (arg_node == void_list_node)
1263 arg_type = strip_typedefs (TREE_VALUE (arg_node));
1264 gcc_assert (arg_type);
1267 tree_cons (TREE_PURPOSE (arg_node), arg_type, arg_types);
1271 arg_types = nreverse (arg_types);
1273 /* A list of parameters not ending with an ellipsis
1274 must end with void_list_node. */
1276 arg_types = chainon (arg_types, void_list_node);
1278 type = strip_typedefs (TREE_TYPE (t));
1279 if (TREE_CODE (t) == METHOD_TYPE)
1281 tree class_type = TREE_TYPE (TREE_VALUE (arg_types));
1282 gcc_assert (class_type);
1284 build_method_type_directly (class_type, type,
1285 TREE_CHAIN (arg_types));
1287 = build_ref_qualified_type (result, type_memfn_rqual (t));
1291 result = build_function_type (type,
1293 result = apply_memfn_quals (result,
1294 type_memfn_quals (t),
1295 type_memfn_rqual (t));
1298 if (TYPE_RAISES_EXCEPTIONS (t))
1299 result = build_exception_variant (result,
1300 TYPE_RAISES_EXCEPTIONS (t));
1301 if (TYPE_HAS_LATE_RETURN_TYPE (t))
1302 TYPE_HAS_LATE_RETURN_TYPE (result) = 1;
1307 tree fullname = TYPENAME_TYPE_FULLNAME (t);
1308 if (TREE_CODE (fullname) == TEMPLATE_ID_EXPR
1309 && TREE_OPERAND (fullname, 1))
1311 tree args = TREE_OPERAND (fullname, 1);
1312 tree new_args = copy_node (args);
1313 bool changed = false;
1314 for (int i = 0; i < TREE_VEC_LENGTH (args); ++i)
1316 tree arg = TREE_VEC_ELT (args, i);
1319 strip_arg = strip_typedefs (arg);
1321 strip_arg = strip_typedefs_expr (arg);
1322 TREE_VEC_ELT (new_args, i) = strip_arg;
1323 if (strip_arg != arg)
1328 NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_args)
1329 = NON_DEFAULT_TEMPLATE_ARGS_COUNT (args);
1331 = lookup_template_function (TREE_OPERAND (fullname, 0),
1335 ggc_free (new_args);
1337 result = make_typename_type (strip_typedefs (TYPE_CONTEXT (t)),
1338 fullname, typename_type, tf_none);
1342 result = strip_typedefs_expr (DECLTYPE_TYPE_EXPR (t));
1343 if (result == DECLTYPE_TYPE_EXPR (t))
1346 result = (finish_decltype_type
1348 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t),
1356 result = TYPE_MAIN_VARIANT (t);
1357 if (TYPE_USER_ALIGN (t) != TYPE_USER_ALIGN (result)
1358 || TYPE_ALIGN (t) != TYPE_ALIGN (result))
1360 gcc_assert (TYPE_USER_ALIGN (t));
1361 if (TYPE_ALIGN (t) == TYPE_ALIGN (result))
1362 result = build_variant_type_copy (result);
1364 result = build_aligned_type (result, TYPE_ALIGN (t));
1365 TYPE_USER_ALIGN (result) = true;
1367 if (TYPE_ATTRIBUTES (t))
1368 result = cp_build_type_attribute_variant (result, TYPE_ATTRIBUTES (t));
1369 return cp_build_qualified_type (result, cp_type_quals (t));
1372 /* Like strip_typedefs above, but works on expressions, so that in
1374 template<class T> struct A
1380 sizeof(TT) is replaced by sizeof(T). */
1383 strip_typedefs_expr (tree t)
1387 enum tree_code code;
1389 if (t == NULL_TREE || t == error_mark_node)
1392 if (DECL_P (t) || CONSTANT_CLASS_P (t))
1395 /* Some expressions have type operands, so let's handle types here rather
1396 than check TYPE_P in multiple places below. */
1398 return strip_typedefs (t);
1400 code = TREE_CODE (t);
1403 case IDENTIFIER_NODE:
1404 case TEMPLATE_PARM_INDEX:
1407 case ARGUMENT_PACK_SELECT:
1412 tree type1 = strip_typedefs (TRAIT_EXPR_TYPE1 (t));
1413 tree type2 = strip_typedefs (TRAIT_EXPR_TYPE2 (t));
1414 if (type1 == TRAIT_EXPR_TYPE1 (t)
1415 && type2 == TRAIT_EXPR_TYPE2 (t))
1418 TRAIT_EXPR_TYPE1 (t) = type1;
1419 TRAIT_EXPR_TYPE2 (t) = type2;
1425 vec<tree, va_gc> *vec = make_tree_vector ();
1426 bool changed = false;
1428 for (it = t; it; it = TREE_CHAIN (it))
1430 tree val = strip_typedefs_expr (TREE_VALUE (t));
1431 vec_safe_push (vec, val);
1432 if (val != TREE_VALUE (t))
1434 gcc_assert (TREE_PURPOSE (it) == NULL_TREE);
1439 FOR_EACH_VEC_ELT_REVERSE (*vec, i, it)
1440 r = tree_cons (NULL_TREE, it, r);
1444 release_tree_vector (vec);
1450 bool changed = false;
1451 vec<tree, va_gc> *vec = make_tree_vector ();
1452 n = TREE_VEC_LENGTH (t);
1453 vec_safe_reserve (vec, n);
1454 for (i = 0; i < n; ++i)
1456 tree op = strip_typedefs_expr (TREE_VEC_ELT (t, i));
1457 vec->quick_push (op);
1458 if (op != TREE_VEC_ELT (t, i))
1464 for (i = 0; i < n; ++i)
1465 TREE_VEC_ELT (r, i) = (*vec)[i];
1466 NON_DEFAULT_TEMPLATE_ARGS_COUNT (r)
1467 = NON_DEFAULT_TEMPLATE_ARGS_COUNT (t);
1471 release_tree_vector (vec);
1477 bool changed = false;
1478 vec<constructor_elt, va_gc> *vec
1479 = vec_safe_copy (CONSTRUCTOR_ELTS (t));
1480 n = CONSTRUCTOR_NELTS (t);
1481 type = strip_typedefs (TREE_TYPE (t));
1482 for (i = 0; i < n; ++i)
1484 constructor_elt *e = &(*vec)[i];
1485 tree op = strip_typedefs_expr (e->value);
1491 gcc_checking_assert (e->index == strip_typedefs_expr (e->index));
1494 if (!changed && type == TREE_TYPE (t))
1502 TREE_TYPE (r) = type;
1503 CONSTRUCTOR_ELTS (r) = vec;
1509 error ("lambda-expression in a constant expression");
1510 return error_mark_node;
1516 gcc_assert (EXPR_P (t));
1518 n = TREE_OPERAND_LENGTH (t);
1519 ops = XALLOCAVEC (tree, n);
1520 type = TREE_TYPE (t);
1525 case IMPLICIT_CONV_EXPR:
1526 case DYNAMIC_CAST_EXPR:
1527 case STATIC_CAST_EXPR:
1528 case CONST_CAST_EXPR:
1529 case REINTERPRET_CAST_EXPR:
1532 type = strip_typedefs (type);
1536 for (i = 0; i < n; ++i)
1537 ops[i] = strip_typedefs_expr (TREE_OPERAND (t, i));
1541 /* If nothing changed, return t. */
1542 for (i = 0; i < n; ++i)
1543 if (ops[i] != TREE_OPERAND (t, i))
1545 if (i == n && type == TREE_TYPE (t))
1549 TREE_TYPE (r) = type;
1550 for (i = 0; i < n; ++i)
1551 TREE_OPERAND (r, i) = ops[i];
1555 /* Makes a copy of BINFO and TYPE, which is to be inherited into a
1556 graph dominated by T. If BINFO is NULL, TYPE is a dependent base,
1557 and we do a shallow copy. If BINFO is non-NULL, we do a deep copy.
1558 VIRT indicates whether TYPE is inherited virtually or not.
1559 IGO_PREV points at the previous binfo of the inheritance graph
1560 order chain. The newly copied binfo's TREE_CHAIN forms this
1563 The CLASSTYPE_VBASECLASSES vector of T is constructed in the
1564 correct order. That is in the order the bases themselves should be
1567 The BINFO_INHERITANCE of a virtual base class points to the binfo
1568 of the most derived type. ??? We could probably change this so that
1569 BINFO_INHERITANCE becomes synonymous with BINFO_PRIMARY, and hence
1570 remove a field. They currently can only differ for primary virtual
1574 copy_binfo (tree binfo, tree type, tree t, tree *igo_prev, int virt)
1580 /* See if we've already made this virtual base. */
1581 new_binfo = binfo_for_vbase (type, t);
1586 new_binfo = make_tree_binfo (binfo ? BINFO_N_BASE_BINFOS (binfo) : 0);
1587 BINFO_TYPE (new_binfo) = type;
1589 /* Chain it into the inheritance graph. */
1590 TREE_CHAIN (*igo_prev) = new_binfo;
1591 *igo_prev = new_binfo;
1593 if (binfo && !BINFO_DEPENDENT_BASE_P (binfo))
1598 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), type));
1600 BINFO_OFFSET (new_binfo) = BINFO_OFFSET (binfo);
1601 BINFO_VIRTUALS (new_binfo) = BINFO_VIRTUALS (binfo);
1603 /* We do not need to copy the accesses, as they are read only. */
1604 BINFO_BASE_ACCESSES (new_binfo) = BINFO_BASE_ACCESSES (binfo);
1606 /* Recursively copy base binfos of BINFO. */
1607 for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++)
1609 tree new_base_binfo;
1610 new_base_binfo = copy_binfo (base_binfo, BINFO_TYPE (base_binfo),
1612 BINFO_VIRTUAL_P (base_binfo));
1614 if (!BINFO_INHERITANCE_CHAIN (new_base_binfo))
1615 BINFO_INHERITANCE_CHAIN (new_base_binfo) = new_binfo;
1616 BINFO_BASE_APPEND (new_binfo, new_base_binfo);
1620 BINFO_DEPENDENT_BASE_P (new_binfo) = 1;
1624 /* Push it onto the list after any virtual bases it contains
1625 will have been pushed. */
1626 CLASSTYPE_VBASECLASSES (t)->quick_push (new_binfo);
1627 BINFO_VIRTUAL_P (new_binfo) = 1;
1628 BINFO_INHERITANCE_CHAIN (new_binfo) = TYPE_BINFO (t);
1634 /* Hashing of lists so that we don't make duplicates.
1635 The entry point is `list_hash_canon'. */
1644 struct list_hasher : ggc_hasher<tree>
1646 typedef list_proxy *compare_type;
1648 static hashval_t hash (tree);
1649 static bool equal (tree, list_proxy *);
1652 /* Now here is the hash table. When recording a list, it is added
1653 to the slot whose index is the hash code mod the table size.
1654 Note that the hash table is used for several kinds of lists.
1655 While all these live in the same table, they are completely independent,
1656 and the hash code is computed differently for each of these. */
1658 static GTY (()) hash_table<list_hasher> *list_hash_table;
1660 /* Compare ENTRY (an entry in the hash table) with DATA (a list_proxy
1661 for a node we are thinking about adding). */
1664 list_hasher::equal (tree t, list_proxy *proxy)
1666 return (TREE_VALUE (t) == proxy->value
1667 && TREE_PURPOSE (t) == proxy->purpose
1668 && TREE_CHAIN (t) == proxy->chain);
1671 /* Compute a hash code for a list (chain of TREE_LIST nodes
1672 with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the
1673 TREE_COMMON slots), by adding the hash codes of the individual entries. */
1676 list_hash_pieces (tree purpose, tree value, tree chain)
1678 hashval_t hashcode = 0;
1681 hashcode += TREE_HASH (chain);
1684 hashcode += TREE_HASH (value);
1688 hashcode += TREE_HASH (purpose);
1694 /* Hash an already existing TREE_LIST. */
1697 list_hasher::hash (tree t)
1699 return list_hash_pieces (TREE_PURPOSE (t),
1704 /* Given list components PURPOSE, VALUE, AND CHAIN, return the canonical
1705 object for an identical list if one already exists. Otherwise, build a
1706 new one, and record it as the canonical object. */
1709 hash_tree_cons (tree purpose, tree value, tree chain)
1713 struct list_proxy proxy;
1715 /* Hash the list node. */
1716 hashcode = list_hash_pieces (purpose, value, chain);
1717 /* Create a proxy for the TREE_LIST we would like to create. We
1718 don't actually create it so as to avoid creating garbage. */
1719 proxy.purpose = purpose;
1720 proxy.value = value;
1721 proxy.chain = chain;
1722 /* See if it is already in the table. */
1723 slot = list_hash_table->find_slot_with_hash (&proxy, hashcode, INSERT);
1724 /* If not, create a new node. */
1726 *slot = tree_cons (purpose, value, chain);
1727 return (tree) *slot;
1730 /* Constructor for hashed lists. */
1733 hash_tree_chain (tree value, tree chain)
1735 return hash_tree_cons (NULL_TREE, value, chain);
1739 debug_binfo (tree elem)
1744 fprintf (stderr, "type \"%s\", offset = " HOST_WIDE_INT_PRINT_DEC
1746 TYPE_NAME_STRING (BINFO_TYPE (elem)),
1747 TREE_INT_CST_LOW (BINFO_OFFSET (elem)));
1748 debug_tree (BINFO_TYPE (elem));
1749 if (BINFO_VTABLE (elem))
1750 fprintf (stderr, "vtable decl \"%s\"\n",
1751 IDENTIFIER_POINTER (DECL_NAME (get_vtbl_decl_for_binfo (elem))));
1753 fprintf (stderr, "no vtable decl yet\n");
1754 fprintf (stderr, "virtuals:\n");
1755 virtuals = BINFO_VIRTUALS (elem);
1760 tree fndecl = TREE_VALUE (virtuals);
1761 fprintf (stderr, "%s [%ld =? %ld]\n",
1762 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl)),
1763 (long) n, (long) TREE_INT_CST_LOW (DECL_VINDEX (fndecl)));
1765 virtuals = TREE_CHAIN (virtuals);
1769 /* Build a representation for the qualified name SCOPE::NAME. TYPE is
1770 the type of the result expression, if known, or NULL_TREE if the
1771 resulting expression is type-dependent. If TEMPLATE_P is true,
1772 NAME is known to be a template because the user explicitly used the
1773 "template" keyword after the "::".
1775 All SCOPE_REFs should be built by use of this function. */
1778 build_qualified_name (tree type, tree scope, tree name, bool template_p)
1781 if (type == error_mark_node
1782 || scope == error_mark_node
1783 || name == error_mark_node)
1784 return error_mark_node;
1785 t = build2 (SCOPE_REF, type, scope, name);
1786 QUALIFIED_NAME_IS_TEMPLATE (t) = template_p;
1787 PTRMEM_OK_P (t) = true;
1789 t = convert_from_reference (t);
1793 /* Like check_qualified_type, but also check ref-qualifier and exception
1797 cp_check_qualified_type (const_tree cand, const_tree base, int type_quals,
1798 cp_ref_qualifier rqual, tree raises)
1800 return (check_qualified_type (cand, base, type_quals)
1801 && comp_except_specs (raises, TYPE_RAISES_EXCEPTIONS (cand),
1803 && type_memfn_rqual (cand) == rqual);
1806 /* Build the FUNCTION_TYPE or METHOD_TYPE with the ref-qualifier RQUAL. */
1809 build_ref_qualified_type (tree type, cp_ref_qualifier rqual)
1813 if (rqual == type_memfn_rqual (type))
1816 int type_quals = TYPE_QUALS (type);
1817 tree raises = TYPE_RAISES_EXCEPTIONS (type);
1818 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
1819 if (cp_check_qualified_type (t, type, type_quals, rqual, raises))
1822 t = build_variant_type_copy (type);
1825 case REF_QUAL_RVALUE:
1826 FUNCTION_RVALUE_QUALIFIED (t) = 1;
1827 FUNCTION_REF_QUALIFIED (t) = 1;
1829 case REF_QUAL_LVALUE:
1830 FUNCTION_RVALUE_QUALIFIED (t) = 0;
1831 FUNCTION_REF_QUALIFIED (t) = 1;
1834 FUNCTION_REF_QUALIFIED (t) = 0;
1838 if (TYPE_STRUCTURAL_EQUALITY_P (type))
1839 /* Propagate structural equality. */
1840 SET_TYPE_STRUCTURAL_EQUALITY (t);
1841 else if (TYPE_CANONICAL (type) != type)
1842 /* Build the underlying canonical type, since it is different
1844 TYPE_CANONICAL (t) = build_ref_qualified_type (TYPE_CANONICAL (type),
1847 /* T is its own canonical type. */
1848 TYPE_CANONICAL (t) = t;
1853 /* Returns nonzero if X is an expression for a (possibly overloaded)
1854 function. If "f" is a function or function template, "f", "c->f",
1855 "c.f", "C::f", and "f<int>" will all be considered possibly
1856 overloaded functions. Returns 2 if the function is actually
1857 overloaded, i.e., if it is impossible to know the type of the
1858 function without performing overload resolution. */
1861 is_overloaded_fn (tree x)
1863 /* A baselink is also considered an overloaded function. */
1864 if (TREE_CODE (x) == OFFSET_REF
1865 || TREE_CODE (x) == COMPONENT_REF)
1866 x = TREE_OPERAND (x, 1);
1868 x = BASELINK_FUNCTIONS (x);
1869 if (TREE_CODE (x) == TEMPLATE_ID_EXPR)
1870 x = TREE_OPERAND (x, 0);
1871 if (DECL_FUNCTION_TEMPLATE_P (OVL_CURRENT (x))
1872 || (TREE_CODE (x) == OVERLOAD && OVL_CHAIN (x)))
1874 return (TREE_CODE (x) == FUNCTION_DECL
1875 || TREE_CODE (x) == OVERLOAD);
1878 /* X is the CALL_EXPR_FN of a CALL_EXPR. If X represents a dependent name
1879 (14.6.2), return the IDENTIFIER_NODE for that name. Otherwise, return
1883 dependent_name (tree x)
1885 if (identifier_p (x))
1887 if (TREE_CODE (x) != COMPONENT_REF
1888 && TREE_CODE (x) != OFFSET_REF
1889 && TREE_CODE (x) != BASELINK
1890 && is_overloaded_fn (x))
1891 return DECL_NAME (get_first_fn (x));
1895 /* Returns true iff X is an expression for an overloaded function
1896 whose type cannot be known without performing overload
1900 really_overloaded_fn (tree x)
1902 return is_overloaded_fn (x) == 2;
1908 gcc_assert (is_overloaded_fn (from));
1909 /* A baselink is also considered an overloaded function. */
1910 if (TREE_CODE (from) == OFFSET_REF
1911 || TREE_CODE (from) == COMPONENT_REF)
1912 from = TREE_OPERAND (from, 1);
1913 if (BASELINK_P (from))
1914 from = BASELINK_FUNCTIONS (from);
1915 if (TREE_CODE (from) == TEMPLATE_ID_EXPR)
1916 from = TREE_OPERAND (from, 0);
1921 get_first_fn (tree from)
1923 return OVL_CURRENT (get_fns (from));
1926 /* Return a new OVL node, concatenating it with the old one. */
1929 ovl_cons (tree decl, tree chain)
1931 tree result = make_node (OVERLOAD);
1932 TREE_TYPE (result) = unknown_type_node;
1933 OVL_FUNCTION (result) = decl;
1934 TREE_CHAIN (result) = chain;
1939 /* Build a new overloaded function. If this is the first one,
1940 just return it; otherwise, ovl_cons the _DECLs */
1943 build_overload (tree decl, tree chain)
1945 if (! chain && TREE_CODE (decl) != TEMPLATE_DECL)
1947 return ovl_cons (decl, chain);
1950 /* Return the scope where the overloaded functions OVL were found. */
1953 ovl_scope (tree ovl)
1955 if (TREE_CODE (ovl) == OFFSET_REF
1956 || TREE_CODE (ovl) == COMPONENT_REF)
1957 ovl = TREE_OPERAND (ovl, 1);
1958 if (TREE_CODE (ovl) == BASELINK)
1959 return BINFO_TYPE (BASELINK_BINFO (ovl));
1960 if (TREE_CODE (ovl) == TEMPLATE_ID_EXPR)
1961 ovl = TREE_OPERAND (ovl, 0);
1962 /* Skip using-declarations. */
1963 while (TREE_CODE (ovl) == OVERLOAD && OVL_USED (ovl) && OVL_CHAIN (ovl))
1964 ovl = OVL_CHAIN (ovl);
1965 return CP_DECL_CONTEXT (OVL_CURRENT (ovl));
1968 /* Return TRUE if FN is a non-static member function, FALSE otherwise.
1969 This function looks into BASELINK and OVERLOAD nodes. */
1972 non_static_member_function_p (tree fn)
1974 if (fn == NULL_TREE)
1977 if (is_overloaded_fn (fn))
1978 fn = get_first_fn (fn);
1981 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn));
1985 #define PRINT_RING_SIZE 4
1988 cxx_printable_name_internal (tree decl, int v, bool translate)
1990 static unsigned int uid_ring[PRINT_RING_SIZE];
1991 static char *print_ring[PRINT_RING_SIZE];
1992 static bool trans_ring[PRINT_RING_SIZE];
1993 static int ring_counter;
1996 /* Only cache functions. */
1998 || TREE_CODE (decl) != FUNCTION_DECL
1999 || DECL_LANG_SPECIFIC (decl) == 0)
2000 return lang_decl_name (decl, v, translate);
2002 /* See if this print name is lying around. */
2003 for (i = 0; i < PRINT_RING_SIZE; i++)
2004 if (uid_ring[i] == DECL_UID (decl) && translate == trans_ring[i])
2005 /* yes, so return it. */
2006 return print_ring[i];
2008 if (++ring_counter == PRINT_RING_SIZE)
2011 if (current_function_decl != NULL_TREE)
2013 /* There may be both translated and untranslated versions of the
2015 for (i = 0; i < 2; i++)
2017 if (uid_ring[ring_counter] == DECL_UID (current_function_decl))
2019 if (ring_counter == PRINT_RING_SIZE)
2022 gcc_assert (uid_ring[ring_counter] != DECL_UID (current_function_decl));
2025 free (print_ring[ring_counter]);
2027 print_ring[ring_counter] = xstrdup (lang_decl_name (decl, v, translate));
2028 uid_ring[ring_counter] = DECL_UID (decl);
2029 trans_ring[ring_counter] = translate;
2030 return print_ring[ring_counter];
2034 cxx_printable_name (tree decl, int v)
2036 return cxx_printable_name_internal (decl, v, false);
2040 cxx_printable_name_translate (tree decl, int v)
2042 return cxx_printable_name_internal (decl, v, true);
2045 /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions
2046 listed in RAISES. */
2049 build_exception_variant (tree type, tree raises)
2054 if (comp_except_specs (raises, TYPE_RAISES_EXCEPTIONS (type), ce_exact))
2057 type_quals = TYPE_QUALS (type);
2058 cp_ref_qualifier rqual = type_memfn_rqual (type);
2059 for (v = TYPE_MAIN_VARIANT (type); v; v = TYPE_NEXT_VARIANT (v))
2060 if (cp_check_qualified_type (v, type, type_quals, rqual, raises))
2063 /* Need to build a new variant. */
2064 v = build_variant_type_copy (type);
2065 TYPE_RAISES_EXCEPTIONS (v) = raises;
2069 /* Given a TEMPLATE_TEMPLATE_PARM node T, create a new
2070 BOUND_TEMPLATE_TEMPLATE_PARM bound with NEWARGS as its template
2074 bind_template_template_parm (tree t, tree newargs)
2076 tree decl = TYPE_NAME (t);
2079 t2 = cxx_make_type (BOUND_TEMPLATE_TEMPLATE_PARM);
2080 decl = build_decl (input_location,
2081 TYPE_DECL, DECL_NAME (decl), NULL_TREE);
2083 /* These nodes have to be created to reflect new TYPE_DECL and template
2085 TEMPLATE_TYPE_PARM_INDEX (t2) = copy_node (TEMPLATE_TYPE_PARM_INDEX (t));
2086 TEMPLATE_PARM_DECL (TEMPLATE_TYPE_PARM_INDEX (t2)) = decl;
2087 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2)
2088 = build_template_info (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t), newargs);
2090 TREE_TYPE (decl) = t2;
2091 TYPE_NAME (t2) = decl;
2092 TYPE_STUB_DECL (t2) = decl;
2094 SET_TYPE_STRUCTURAL_EQUALITY (t2);
2099 /* Called from count_trees via walk_tree. */
2102 count_trees_r (tree *tp, int *walk_subtrees, void *data)
2112 /* Debugging function for measuring the rough complexity of a tree
2116 count_trees (tree t)
2119 cp_walk_tree_without_duplicates (&t, count_trees_r, &n_trees);
2123 /* Called from verify_stmt_tree via walk_tree. */
2126 verify_stmt_tree_r (tree* tp, int * /*walk_subtrees*/, void* data)
2129 hash_table<pointer_hash <tree_node> > *statements
2130 = static_cast <hash_table<pointer_hash <tree_node> > *> (data);
2133 if (!STATEMENT_CODE_P (TREE_CODE (t)))
2136 /* If this statement is already present in the hash table, then
2137 there is a circularity in the statement tree. */
2138 gcc_assert (!statements->find (t));
2140 slot = statements->find_slot (t, INSERT);
2146 /* Debugging function to check that the statement T has not been
2147 corrupted. For now, this function simply checks that T contains no
2151 verify_stmt_tree (tree t)
2153 hash_table<pointer_hash <tree_node> > statements (37);
2154 cp_walk_tree (&t, verify_stmt_tree_r, &statements, NULL);
2157 /* Check if the type T depends on a type with no linkage and if so, return
2158 it. If RELAXED_P then do not consider a class type declared within
2159 a vague-linkage function to have no linkage. */
2162 no_linkage_check (tree t, bool relaxed_p)
2166 /* There's no point in checking linkage on template functions; we
2167 can't know their complete types. */
2168 if (processing_template_decl)
2171 switch (TREE_CODE (t))
2174 if (TYPE_PTRMEMFUNC_P (t))
2176 /* Lambda types that don't have mangling scope have no linkage. We
2177 check CLASSTYPE_LAMBDA_EXPR for error_mark_node because
2178 when we get here from pushtag none of the lambda information is
2179 set up yet, so we want to assume that the lambda has linkage and
2180 fix it up later if not. */
2181 if (CLASSTYPE_LAMBDA_EXPR (t)
2182 && CLASSTYPE_LAMBDA_EXPR (t) != error_mark_node
2183 && LAMBDA_TYPE_EXTRA_SCOPE (t) == NULL_TREE)
2187 if (!CLASS_TYPE_P (t))
2191 /* Only treat anonymous types as having no linkage if they're at
2192 namespace scope. This is core issue 966. */
2193 if (TYPE_ANONYMOUS_P (t) && TYPE_NAMESPACE_SCOPE_P (t))
2196 for (r = CP_TYPE_CONTEXT (t); ; )
2198 /* If we're a nested type of a !TREE_PUBLIC class, we might not
2199 have linkage, or we might just be in an anonymous namespace.
2200 If we're in a TREE_PUBLIC class, we have linkage. */
2201 if (TYPE_P (r) && !TREE_PUBLIC (TYPE_NAME (r)))
2202 return no_linkage_check (TYPE_CONTEXT (t), relaxed_p);
2203 else if (TREE_CODE (r) == FUNCTION_DECL)
2205 if (!relaxed_p || !vague_linkage_p (r))
2208 r = CP_DECL_CONTEXT (r);
2218 case REFERENCE_TYPE:
2220 return no_linkage_check (TREE_TYPE (t), relaxed_p);
2224 r = no_linkage_check (TYPE_PTRMEM_POINTED_TO_TYPE (t),
2228 return no_linkage_check (TYPE_PTRMEM_CLASS_TYPE (t), relaxed_p);
2231 r = no_linkage_check (TYPE_METHOD_BASETYPE (t), relaxed_p);
2238 for (parm = TYPE_ARG_TYPES (t);
2239 parm && parm != void_list_node;
2240 parm = TREE_CHAIN (parm))
2242 r = no_linkage_check (TREE_VALUE (parm), relaxed_p);
2246 return no_linkage_check (TREE_TYPE (t), relaxed_p);
2254 extern int depth_reached;
2257 cxx_print_statistics (void)
2259 print_search_statistics ();
2260 print_class_statistics ();
2261 print_template_statistics ();
2262 if (GATHER_STATISTICS)
2263 fprintf (stderr, "maximum template instantiation depth reached: %d\n",
2267 /* Return, as an INTEGER_CST node, the number of elements for TYPE
2268 (which is an ARRAY_TYPE). This counts only elements of the top
2272 array_type_nelts_top (tree type)
2274 return fold_build2_loc (input_location,
2275 PLUS_EXPR, sizetype,
2276 array_type_nelts (type),
2280 /* Return, as an INTEGER_CST node, the number of elements for TYPE
2281 (which is an ARRAY_TYPE). This one is a recursive count of all
2282 ARRAY_TYPEs that are clumped together. */
2285 array_type_nelts_total (tree type)
2287 tree sz = array_type_nelts_top (type);
2288 type = TREE_TYPE (type);
2289 while (TREE_CODE (type) == ARRAY_TYPE)
2291 tree n = array_type_nelts_top (type);
2292 sz = fold_build2_loc (input_location,
2293 MULT_EXPR, sizetype, sz, n);
2294 type = TREE_TYPE (type);
2299 /* Called from break_out_target_exprs via mapcar. */
2302 bot_manip (tree* tp, int* walk_subtrees, void* data)
2304 splay_tree target_remap = ((splay_tree) data);
2307 if (!TYPE_P (t) && TREE_CONSTANT (t) && !TREE_SIDE_EFFECTS (t))
2309 /* There can't be any TARGET_EXPRs or their slot variables below this
2310 point. But we must make a copy, in case subsequent processing
2311 alters any part of it. For example, during gimplification a cast
2312 of the form (T) &X::f (where "f" is a member function) will lead
2313 to replacing the PTRMEM_CST for &X::f with a VAR_DECL. */
2315 *tp = unshare_expr (t);
2318 if (TREE_CODE (t) == TARGET_EXPR)
2322 if (TREE_CODE (TREE_OPERAND (t, 1)) == AGGR_INIT_EXPR)
2324 u = build_cplus_new (TREE_TYPE (t), TREE_OPERAND (t, 1),
2325 tf_warning_or_error);
2326 if (AGGR_INIT_ZERO_FIRST (TREE_OPERAND (t, 1)))
2327 AGGR_INIT_ZERO_FIRST (TREE_OPERAND (u, 1)) = true;
2330 u = build_target_expr_with_type (TREE_OPERAND (t, 1), TREE_TYPE (t),
2331 tf_warning_or_error);
2333 TARGET_EXPR_IMPLICIT_P (u) = TARGET_EXPR_IMPLICIT_P (t);
2334 TARGET_EXPR_LIST_INIT_P (u) = TARGET_EXPR_LIST_INIT_P (t);
2335 TARGET_EXPR_DIRECT_INIT_P (u) = TARGET_EXPR_DIRECT_INIT_P (t);
2337 /* Map the old variable to the new one. */
2338 splay_tree_insert (target_remap,
2339 (splay_tree_key) TREE_OPERAND (t, 0),
2340 (splay_tree_value) TREE_OPERAND (u, 0));
2342 TREE_OPERAND (u, 1) = break_out_target_exprs (TREE_OPERAND (u, 1));
2344 /* Replace the old expression with the new version. */
2346 /* We don't have to go below this point; the recursive call to
2347 break_out_target_exprs will have handled anything below this
2353 /* Make a copy of this node. */
2354 t = copy_tree_r (tp, walk_subtrees, NULL);
2355 if (TREE_CODE (*tp) == CALL_EXPR)
2357 set_flags_from_callee (*tp);
2359 /* builtin_LINE and builtin_FILE get the location where the default
2360 argument is expanded, not where the call was written. */
2361 tree callee = get_callee_fndecl (*tp);
2362 if (callee && DECL_BUILT_IN (callee))
2363 switch (DECL_FUNCTION_CODE (callee))
2367 SET_EXPR_LOCATION (*tp, input_location);
2375 /* Replace all remapped VAR_DECLs in T with their new equivalents.
2376 DATA is really a splay-tree mapping old variables to new
2380 bot_replace (tree* t, int* /*walk_subtrees*/, void* data)
2382 splay_tree target_remap = ((splay_tree) data);
2386 splay_tree_node n = splay_tree_lookup (target_remap,
2387 (splay_tree_key) *t);
2389 *t = (tree) n->value;
2391 else if (TREE_CODE (*t) == PARM_DECL
2392 && DECL_NAME (*t) == this_identifier
2393 && !DECL_CONTEXT (*t))
2395 /* In an NSDMI we need to replace the 'this' parameter we used for
2396 parsing with the real one for this function. */
2397 *t = current_class_ptr;
2399 else if (TREE_CODE (*t) == CONVERT_EXPR
2400 && CONVERT_EXPR_VBASE_PATH (*t))
2402 /* In an NSDMI build_base_path defers building conversions to virtual
2403 bases, and we handle it here. */
2404 tree basetype = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (*t)));
2405 vec<tree, va_gc> *vbases = CLASSTYPE_VBASECLASSES (current_class_type);
2407 FOR_EACH_VEC_SAFE_ELT (vbases, i, binfo)
2408 if (BINFO_TYPE (binfo) == basetype)
2410 *t = build_base_path (PLUS_EXPR, TREE_OPERAND (*t, 0), binfo, true,
2411 tf_warning_or_error);
2417 /* When we parse a default argument expression, we may create
2418 temporary variables via TARGET_EXPRs. When we actually use the
2419 default-argument expression, we make a copy of the expression
2420 and replace the temporaries with appropriate local versions. */
2423 break_out_target_exprs (tree t)
2425 static int target_remap_count;
2426 static splay_tree target_remap;
2428 if (!target_remap_count++)
2429 target_remap = splay_tree_new (splay_tree_compare_pointers,
2430 /*splay_tree_delete_key_fn=*/NULL,
2431 /*splay_tree_delete_value_fn=*/NULL);
2432 cp_walk_tree (&t, bot_manip, target_remap, NULL);
2433 cp_walk_tree (&t, bot_replace, target_remap, NULL);
2435 if (!--target_remap_count)
2437 splay_tree_delete (target_remap);
2438 target_remap = NULL;
2444 /* Build an expression for the subobject of OBJ at CONSTRUCTOR index INDEX,
2445 which we expect to have type TYPE. */
2448 build_ctor_subob_ref (tree index, tree type, tree obj)
2450 if (index == NULL_TREE)
2451 /* Can't refer to a particular member of a vector. */
2453 else if (TREE_CODE (index) == INTEGER_CST)
2454 obj = cp_build_array_ref (input_location, obj, index, tf_none);
2456 obj = build_class_member_access_expr (obj, index, NULL_TREE,
2457 /*reference*/false, tf_none);
2459 gcc_assert (same_type_ignoring_top_level_qualifiers_p (type,
2464 /* Like substitute_placeholder_in_expr, but handle C++ tree codes and
2465 build up subexpressions as we go deeper. */
2467 struct replace_placeholders_t
2470 hash_set<tree> *pset;
2474 replace_placeholders_r (tree* t, int* walk_subtrees, void* data_)
2476 tree obj = static_cast<tree>(data_);
2478 if (TREE_CONSTANT (*t))
2480 *walk_subtrees = false;
2484 switch (TREE_CODE (*t))
2486 case PLACEHOLDER_EXPR:
2487 gcc_assert (same_type_ignoring_top_level_qualifiers_p
2488 (TREE_TYPE (*t), TREE_TYPE (obj)));
2490 *walk_subtrees = false;
2494 /* Don't mess with placeholders in an unrelated object. */
2495 *walk_subtrees = false;
2500 constructor_elt *ce;
2501 vec<constructor_elt,va_gc> *v = CONSTRUCTOR_ELTS (*t);
2502 for (unsigned i = 0; vec_safe_iterate (v, i, &ce); ++i)
2504 tree *valp = &ce->value;
2505 tree type = TREE_TYPE (*valp);
2508 if (TREE_CODE (*valp) == CONSTRUCTOR
2509 && AGGREGATE_TYPE_P (type))
2511 subob = build_ctor_subob_ref (ce->index, type, obj);
2512 if (TREE_CODE (*valp) == TARGET_EXPR)
2513 valp = &TARGET_EXPR_INITIAL (*valp);
2516 cp_walk_tree (valp, replace_placeholders_r,
2519 *walk_subtrees = false;
2531 replace_placeholders (tree exp, tree obj)
2533 hash_set<tree> pset;
2535 if (TREE_CODE (exp) == TARGET_EXPR)
2536 tp = &TARGET_EXPR_INITIAL (exp);
2537 cp_walk_tree (tp, replace_placeholders_r, obj, NULL);
2541 /* Similar to `build_nt', but for template definitions of dependent
2545 build_min_nt_loc (location_t loc, enum tree_code code, ...)
2552 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
2556 t = make_node (code);
2557 SET_EXPR_LOCATION (t, loc);
2558 length = TREE_CODE_LENGTH (code);
2560 for (i = 0; i < length; i++)
2562 tree x = va_arg (p, tree);
2563 TREE_OPERAND (t, i) = x;
2571 /* Similar to `build', but for template definitions. */
2574 build_min (enum tree_code code, tree tt, ...)
2581 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
2585 t = make_node (code);
2586 length = TREE_CODE_LENGTH (code);
2589 for (i = 0; i < length; i++)
2591 tree x = va_arg (p, tree);
2592 TREE_OPERAND (t, i) = x;
2593 if (x && !TYPE_P (x) && TREE_SIDE_EFFECTS (x))
2594 TREE_SIDE_EFFECTS (t) = 1;
2601 /* Similar to `build', but for template definitions of non-dependent
2602 expressions. NON_DEP is the non-dependent expression that has been
2606 build_min_non_dep (enum tree_code code, tree non_dep, ...)
2613 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
2615 va_start (p, non_dep);
2617 if (REFERENCE_REF_P (non_dep))
2618 non_dep = TREE_OPERAND (non_dep, 0);
2620 t = make_node (code);
2621 length = TREE_CODE_LENGTH (code);
2622 TREE_TYPE (t) = TREE_TYPE (non_dep);
2623 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (non_dep);
2625 for (i = 0; i < length; i++)
2627 tree x = va_arg (p, tree);
2628 TREE_OPERAND (t, i) = x;
2631 if (code == COMPOUND_EXPR && TREE_CODE (non_dep) != COMPOUND_EXPR)
2632 /* This should not be considered a COMPOUND_EXPR, because it
2633 resolves to an overload. */
2634 COMPOUND_EXPR_OVERLOADED (t) = 1;
2637 return convert_from_reference (t);
2640 /* Similar to `build_nt_call_vec', but for template definitions of
2641 non-dependent expressions. NON_DEP is the non-dependent expression
2642 that has been built. */
2645 build_min_non_dep_call_vec (tree non_dep, tree fn, vec<tree, va_gc> *argvec)
2647 tree t = build_nt_call_vec (fn, argvec);
2648 if (REFERENCE_REF_P (non_dep))
2649 non_dep = TREE_OPERAND (non_dep, 0);
2650 TREE_TYPE (t) = TREE_TYPE (non_dep);
2651 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (non_dep);
2652 return convert_from_reference (t);
2656 get_type_decl (tree t)
2658 if (TREE_CODE (t) == TYPE_DECL)
2661 return TYPE_STUB_DECL (t);
2662 gcc_assert (t == error_mark_node);
2666 /* Returns the namespace that contains DECL, whether directly or
2670 decl_namespace_context (tree decl)
2674 if (TREE_CODE (decl) == NAMESPACE_DECL)
2676 else if (TYPE_P (decl))
2677 decl = CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl));
2679 decl = CP_DECL_CONTEXT (decl);
2683 /* Returns true if decl is within an anonymous namespace, however deeply
2684 nested, or false otherwise. */
2687 decl_anon_ns_mem_p (const_tree decl)
2691 if (decl == NULL_TREE || decl == error_mark_node)
2693 if (TREE_CODE (decl) == NAMESPACE_DECL
2694 && DECL_NAME (decl) == NULL_TREE)
2696 /* Classes and namespaces inside anonymous namespaces have
2697 TREE_PUBLIC == 0, so we can shortcut the search. */
2698 else if (TYPE_P (decl))
2699 return (TREE_PUBLIC (TYPE_MAIN_DECL (decl)) == 0);
2700 else if (TREE_CODE (decl) == NAMESPACE_DECL)
2701 return (TREE_PUBLIC (decl) == 0);
2703 decl = DECL_CONTEXT (decl);
2707 /* Subroutine of cp_tree_equal: t1 and t2 are the CALL_EXPR_FNs of two
2708 CALL_EXPRS. Return whether they are equivalent. */
2711 called_fns_equal (tree t1, tree t2)
2713 /* Core 1321: dependent names are equivalent even if the overload sets
2714 are different. But do compare explicit template arguments. */
2715 tree name1 = dependent_name (t1);
2716 tree name2 = dependent_name (t2);
2719 tree targs1 = NULL_TREE, targs2 = NULL_TREE;
2724 if (TREE_CODE (t1) == TEMPLATE_ID_EXPR)
2725 targs1 = TREE_OPERAND (t1, 1);
2726 if (TREE_CODE (t2) == TEMPLATE_ID_EXPR)
2727 targs2 = TREE_OPERAND (t2, 1);
2728 return cp_tree_equal (targs1, targs2);
2731 return cp_tree_equal (t1, t2);
2734 /* Return truthvalue of whether T1 is the same tree structure as T2.
2735 Return 1 if they are the same. Return 0 if they are different. */
2738 cp_tree_equal (tree t1, tree t2)
2740 enum tree_code code1, code2;
2747 code1 = TREE_CODE (t1);
2748 code2 = TREE_CODE (t2);
2756 /* There's only a single VOID_CST node, so we should never reach
2761 return tree_int_cst_equal (t1, t2);
2764 return REAL_VALUES_EQUAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
2767 return TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
2768 && !memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
2769 TREE_STRING_LENGTH (t1));
2772 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1),
2773 TREE_FIXED_CST (t2));
2776 return cp_tree_equal (TREE_REALPART (t1), TREE_REALPART (t2))
2777 && cp_tree_equal (TREE_IMAGPART (t1), TREE_IMAGPART (t2));
2780 return operand_equal_p (t1, t2, OEP_ONLY_CONST);
2783 /* We need to do this when determining whether or not two
2784 non-type pointer to member function template arguments
2786 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
2787 || CONSTRUCTOR_NELTS (t1) != CONSTRUCTOR_NELTS (t2))
2792 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t1), i, field, value)
2794 constructor_elt *elt2 = CONSTRUCTOR_ELT (t2, i);
2795 if (!cp_tree_equal (field, elt2->index)
2796 || !cp_tree_equal (value, elt2->value))
2803 if (!cp_tree_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2)))
2805 if (!cp_tree_equal (TREE_VALUE (t1), TREE_VALUE (t2)))
2807 return cp_tree_equal (TREE_CHAIN (t1), TREE_CHAIN (t2));
2810 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
2815 call_expr_arg_iterator iter1, iter2;
2816 if (!called_fns_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2)))
2818 for (arg1 = first_call_expr_arg (t1, &iter1),
2819 arg2 = first_call_expr_arg (t2, &iter2);
2821 arg1 = next_call_expr_arg (&iter1),
2822 arg2 = next_call_expr_arg (&iter2))
2823 if (!cp_tree_equal (arg1, arg2))
2832 tree o1 = TREE_OPERAND (t1, 0);
2833 tree o2 = TREE_OPERAND (t2, 0);
2835 /* Special case: if either target is an unallocated VAR_DECL,
2836 it means that it's going to be unified with whatever the
2837 TARGET_EXPR is really supposed to initialize, so treat it
2838 as being equivalent to anything. */
2839 if (VAR_P (o1) && DECL_NAME (o1) == NULL_TREE
2840 && !DECL_RTL_SET_P (o1))
2842 else if (VAR_P (o2) && DECL_NAME (o2) == NULL_TREE
2843 && !DECL_RTL_SET_P (o2))
2845 else if (!cp_tree_equal (o1, o2))
2848 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
2851 case WITH_CLEANUP_EXPR:
2852 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
2854 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
2857 if (TREE_OPERAND (t1, 1) != TREE_OPERAND (t2, 1))
2859 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
2862 /* For comparing uses of parameters in late-specified return types
2863 with an out-of-class definition of the function, but can also come
2864 up for expressions that involve 'this' in a member function
2867 if (comparing_specializations)
2868 /* When comparing hash table entries, only an exact match is
2869 good enough; we don't want to replace 'this' with the
2870 version from another function. */
2873 if (same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
2875 if (DECL_ARTIFICIAL (t1) ^ DECL_ARTIFICIAL (t2))
2877 if (DECL_ARTIFICIAL (t1)
2878 || (DECL_PARM_LEVEL (t1) == DECL_PARM_LEVEL (t2)
2879 && DECL_PARM_INDEX (t1) == DECL_PARM_INDEX (t2)))
2889 case IDENTIFIER_NODE:
2894 return (BASELINK_BINFO (t1) == BASELINK_BINFO (t2)
2895 && BASELINK_ACCESS_BINFO (t1) == BASELINK_ACCESS_BINFO (t2)
2896 && BASELINK_QUALIFIED_P (t1) == BASELINK_QUALIFIED_P (t2)
2897 && cp_tree_equal (BASELINK_FUNCTIONS (t1),
2898 BASELINK_FUNCTIONS (t2)));
2900 case TEMPLATE_PARM_INDEX:
2901 return (TEMPLATE_PARM_IDX (t1) == TEMPLATE_PARM_IDX (t2)
2902 && TEMPLATE_PARM_LEVEL (t1) == TEMPLATE_PARM_LEVEL (t2)
2903 && (TEMPLATE_PARM_PARAMETER_PACK (t1)
2904 == TEMPLATE_PARM_PARAMETER_PACK (t2))
2905 && same_type_p (TREE_TYPE (TEMPLATE_PARM_DECL (t1)),
2906 TREE_TYPE (TEMPLATE_PARM_DECL (t2))));
2908 case TEMPLATE_ID_EXPR:
2909 return (cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0))
2910 && cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1)));
2915 if (TREE_VEC_LENGTH (t1) != TREE_VEC_LENGTH (t2))
2917 for (ix = TREE_VEC_LENGTH (t1); ix--;)
2918 if (!cp_tree_equal (TREE_VEC_ELT (t1, ix),
2919 TREE_VEC_ELT (t2, ix)))
2927 tree o1 = TREE_OPERAND (t1, 0);
2928 tree o2 = TREE_OPERAND (t2, 0);
2930 if (code1 == SIZEOF_EXPR)
2932 if (SIZEOF_EXPR_TYPE_P (t1))
2933 o1 = TREE_TYPE (o1);
2934 if (SIZEOF_EXPR_TYPE_P (t2))
2935 o2 = TREE_TYPE (o2);
2937 if (TREE_CODE (o1) != TREE_CODE (o2))
2940 return same_type_p (o1, o2);
2942 return cp_tree_equal (o1, o2);
2947 tree t1_op1, t2_op1;
2949 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
2952 t1_op1 = TREE_OPERAND (t1, 1);
2953 t2_op1 = TREE_OPERAND (t2, 1);
2954 if (TREE_CODE (t1_op1) != TREE_CODE (t2_op1))
2957 return cp_tree_equal (TREE_OPERAND (t1, 2), TREE_OPERAND (t2, 2));
2961 /* Two pointer-to-members are the same if they point to the same
2962 field or function in the same class. */
2963 if (PTRMEM_CST_MEMBER (t1) != PTRMEM_CST_MEMBER (t2))
2966 return same_type_p (PTRMEM_CST_CLASS (t1), PTRMEM_CST_CLASS (t2));
2969 if (OVL_FUNCTION (t1) != OVL_FUNCTION (t2))
2971 return cp_tree_equal (OVL_CHAIN (t1), OVL_CHAIN (t2));
2974 if (TRAIT_EXPR_KIND (t1) != TRAIT_EXPR_KIND (t2))
2976 return same_type_p (TRAIT_EXPR_TYPE1 (t1), TRAIT_EXPR_TYPE1 (t2))
2977 && cp_tree_equal (TRAIT_EXPR_TYPE2 (t1), TRAIT_EXPR_TYPE2 (t2));
2980 case STATIC_CAST_EXPR:
2981 case REINTERPRET_CAST_EXPR:
2982 case CONST_CAST_EXPR:
2983 case DYNAMIC_CAST_EXPR:
2984 case IMPLICIT_CONV_EXPR:
2987 case NON_LVALUE_EXPR:
2988 case VIEW_CONVERT_EXPR:
2989 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
2991 /* Now compare operands as usual. */
2994 case DEFERRED_NOEXCEPT:
2995 return (cp_tree_equal (DEFERRED_NOEXCEPT_PATTERN (t1),
2996 DEFERRED_NOEXCEPT_PATTERN (t2))
2997 && comp_template_args (DEFERRED_NOEXCEPT_ARGS (t1),
2998 DEFERRED_NOEXCEPT_ARGS (t2)));
3005 switch (TREE_CODE_CLASS (code1))
3009 case tcc_comparison:
3010 case tcc_expression:
3017 n = cp_tree_operand_length (t1);
3018 if (TREE_CODE_CLASS (code1) == tcc_vl_exp
3019 && n != TREE_OPERAND_LENGTH (t2))
3022 for (i = 0; i < n; ++i)
3023 if (!cp_tree_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i)))
3030 return same_type_p (t1, t2);
3034 /* We can get here with --disable-checking. */
3038 /* The type of ARG when used as an lvalue. */
3041 lvalue_type (tree arg)
3043 tree type = TREE_TYPE (arg);
3047 /* The type of ARG for printing error messages; denote lvalues with
3051 error_type (tree arg)
3053 tree type = TREE_TYPE (arg);
3055 if (TREE_CODE (type) == ARRAY_TYPE)
3057 else if (TREE_CODE (type) == ERROR_MARK)
3059 else if (real_lvalue_p (arg))
3060 type = build_reference_type (lvalue_type (arg));
3061 else if (MAYBE_CLASS_TYPE_P (type))
3062 type = lvalue_type (arg);
3067 /* Does FUNCTION use a variable-length argument list? */
3070 varargs_function_p (const_tree function)
3072 return stdarg_p (TREE_TYPE (function));
3075 /* Returns 1 if decl is a member of a class. */
3078 member_p (const_tree decl)
3080 const_tree const ctx = DECL_CONTEXT (decl);
3081 return (ctx && TYPE_P (ctx));
3084 /* Create a placeholder for member access where we don't actually have an
3085 object that the access is against. */
3088 build_dummy_object (tree type)
3090 tree decl = build1 (CONVERT_EXPR, build_pointer_type (type), void_node);
3091 return cp_build_indirect_ref (decl, RO_NULL, tf_warning_or_error);
3094 /* We've gotten a reference to a member of TYPE. Return *this if appropriate,
3095 or a dummy object otherwise. If BINFOP is non-0, it is filled with the
3096 binfo path from current_class_type to TYPE, or 0. */
3099 maybe_dummy_object (tree type, tree* binfop)
3103 tree current = current_nonlambda_class_type ();
3106 && (binfo = lookup_base (current, type, ba_any, NULL,
3107 tf_warning_or_error)))
3111 /* Reference from a nested class member function. */
3113 binfo = TYPE_BINFO (type);
3119 if (current_class_ref
3120 /* current_class_ref might not correspond to current_class_type if
3121 we're in tsubst_default_argument or a lambda-declarator; in either
3122 case, we want to use current_class_ref if it matches CONTEXT. */
3123 && (same_type_ignoring_top_level_qualifiers_p
3124 (TREE_TYPE (current_class_ref), context)))
3125 decl = current_class_ref;
3127 decl = build_dummy_object (context);
3132 /* Returns 1 if OB is a placeholder object, or a pointer to one. */
3135 is_dummy_object (const_tree ob)
3137 if (INDIRECT_REF_P (ob))
3138 ob = TREE_OPERAND (ob, 0);
3139 return (TREE_CODE (ob) == CONVERT_EXPR
3140 && TREE_OPERAND (ob, 0) == void_node);
3143 /* Returns 1 iff type T is something we want to treat as a scalar type for
3144 the purpose of deciding whether it is trivial/POD/standard-layout. */
3147 scalarish_type_p (const_tree t)
3149 if (t == error_mark_node)
3152 return (SCALAR_TYPE_P (t)
3153 || TREE_CODE (t) == VECTOR_TYPE);
3156 /* Returns true iff T requires non-trivial default initialization. */
3159 type_has_nontrivial_default_init (const_tree t)
3161 t = strip_array_types (CONST_CAST_TREE (t));
3163 if (CLASS_TYPE_P (t))
3164 return TYPE_HAS_COMPLEX_DFLT (t);
3169 /* Returns true iff copying an object of type T (including via move
3170 constructor) is non-trivial. That is, T has no non-trivial copy
3171 constructors and no non-trivial move constructors. */
3174 type_has_nontrivial_copy_init (const_tree t)
3176 t = strip_array_types (CONST_CAST_TREE (t));
3178 if (CLASS_TYPE_P (t))
3180 gcc_assert (COMPLETE_TYPE_P (t));
3181 return ((TYPE_HAS_COPY_CTOR (t)
3182 && TYPE_HAS_COMPLEX_COPY_CTOR (t))
3183 || TYPE_HAS_COMPLEX_MOVE_CTOR (t));
3189 /* Returns 1 iff type T is a trivially copyable type, as defined in
3190 [basic.types] and [class]. */
3193 trivially_copyable_p (const_tree t)
3195 t = strip_array_types (CONST_CAST_TREE (t));
3197 if (CLASS_TYPE_P (t))
3198 return ((!TYPE_HAS_COPY_CTOR (t)
3199 || !TYPE_HAS_COMPLEX_COPY_CTOR (t))
3200 && !TYPE_HAS_COMPLEX_MOVE_CTOR (t)
3201 && (!TYPE_HAS_COPY_ASSIGN (t)
3202 || !TYPE_HAS_COMPLEX_COPY_ASSIGN (t))
3203 && !TYPE_HAS_COMPLEX_MOVE_ASSIGN (t)
3204 && TYPE_HAS_TRIVIAL_DESTRUCTOR (t));
3206 return !CP_TYPE_VOLATILE_P (t) && scalarish_type_p (t);
3209 /* Returns 1 iff type T is a trivial type, as defined in [basic.types] and
3213 trivial_type_p (const_tree t)
3215 t = strip_array_types (CONST_CAST_TREE (t));
3217 if (CLASS_TYPE_P (t))
3218 return (TYPE_HAS_TRIVIAL_DFLT (t)
3219 && trivially_copyable_p (t));
3221 return scalarish_type_p (t);
3224 /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */
3227 pod_type_p (const_tree t)
3229 /* This CONST_CAST is okay because strip_array_types returns its
3230 argument unmodified and we assign it to a const_tree. */
3231 t = strip_array_types (CONST_CAST_TREE(t));
3233 if (!CLASS_TYPE_P (t))
3234 return scalarish_type_p (t);
3235 else if (cxx_dialect > cxx98)
3236 /* [class]/10: A POD struct is a class that is both a trivial class and a
3237 standard-layout class, and has no non-static data members of type
3238 non-POD struct, non-POD union (or array of such types).
3240 We don't need to check individual members because if a member is
3241 non-std-layout or non-trivial, the class will be too. */
3242 return (std_layout_type_p (t) && trivial_type_p (t));
3244 /* The C++98 definition of POD is different. */
3245 return !CLASSTYPE_NON_LAYOUT_POD_P (t);
3248 /* Returns true iff T is POD for the purpose of layout, as defined in the
3252 layout_pod_type_p (const_tree t)
3254 t = strip_array_types (CONST_CAST_TREE (t));
3256 if (CLASS_TYPE_P (t))
3257 return !CLASSTYPE_NON_LAYOUT_POD_P (t);
3259 return scalarish_type_p (t);
3262 /* Returns true iff T is a standard-layout type, as defined in
3266 std_layout_type_p (const_tree t)
3268 t = strip_array_types (CONST_CAST_TREE (t));
3270 if (CLASS_TYPE_P (t))
3271 return !CLASSTYPE_NON_STD_LAYOUT (t);
3273 return scalarish_type_p (t);
3276 /* Nonzero iff type T is a class template implicit specialization. */
3279 class_tmpl_impl_spec_p (const_tree t)
3281 return CLASS_TYPE_P (t) && CLASSTYPE_TEMPLATE_INSTANTIATION (t);
3284 /* Returns 1 iff zero initialization of type T means actually storing
3288 zero_init_p (const_tree t)
3290 /* This CONST_CAST is okay because strip_array_types returns its
3291 argument unmodified and we assign it to a const_tree. */
3292 t = strip_array_types (CONST_CAST_TREE(t));
3294 if (t == error_mark_node)
3297 /* NULL pointers to data members are initialized with -1. */
3298 if (TYPE_PTRDATAMEM_P (t))
3301 /* Classes that contain types that can't be zero-initialized, cannot
3302 be zero-initialized themselves. */
3303 if (CLASS_TYPE_P (t) && CLASSTYPE_NON_ZERO_INIT_P (t))
3309 /* Table of valid C++ attributes. */
3310 const struct attribute_spec cxx_attribute_table[] =
3312 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
3313 affects_type_identity } */
3314 { "java_interface", 0, 0, false, false, false,
3315 handle_java_interface_attribute, false },
3316 { "com_interface", 0, 0, false, false, false,
3317 handle_com_interface_attribute, false },
3318 { "init_priority", 1, 1, true, false, false,
3319 handle_init_priority_attribute, false },
3320 { "abi_tag", 1, -1, false, false, false,
3321 handle_abi_tag_attribute, true },
3322 { NULL, 0, 0, false, false, false, NULL, false }
3325 /* Handle a "java_interface" attribute; arguments as in
3326 struct attribute_spec.handler. */
3328 handle_java_interface_attribute (tree* node,
3335 || !CLASS_TYPE_P (*node)
3336 || !TYPE_FOR_JAVA (*node))
3338 error ("%qE attribute can only be applied to Java class definitions",
3340 *no_add_attrs = true;
3343 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
3344 *node = build_variant_type_copy (*node);
3345 TYPE_JAVA_INTERFACE (*node) = 1;
3350 /* Handle a "com_interface" attribute; arguments as in
3351 struct attribute_spec.handler. */
3353 handle_com_interface_attribute (tree* node,
3361 *no_add_attrs = true;
3364 || !CLASS_TYPE_P (*node)
3365 || *node != TYPE_MAIN_VARIANT (*node))
3367 warning (OPT_Wattributes, "%qE attribute can only be applied "
3368 "to class definitions", name);
3373 warning (0, "%qE is obsolete; g++ vtables are now COM-compatible by default",
3379 /* Handle an "init_priority" attribute; arguments as in
3380 struct attribute_spec.handler. */
3382 handle_init_priority_attribute (tree* node,
3388 tree initp_expr = TREE_VALUE (args);
3390 tree type = TREE_TYPE (decl);
3393 STRIP_NOPS (initp_expr);
3394 initp_expr = default_conversion (initp_expr);
3396 if (!initp_expr || TREE_CODE (initp_expr) != INTEGER_CST)
3398 error ("requested init_priority is not an integer constant");
3399 *no_add_attrs = true;
3403 pri = TREE_INT_CST_LOW (initp_expr);
3405 type = strip_array_types (type);
3407 if (decl == NULL_TREE
3409 || !TREE_STATIC (decl)
3410 || DECL_EXTERNAL (decl)
3411 || (TREE_CODE (type) != RECORD_TYPE
3412 && TREE_CODE (type) != UNION_TYPE)
3413 /* Static objects in functions are initialized the
3414 first time control passes through that
3415 function. This is not precise enough to pin down an
3416 init_priority value, so don't allow it. */
3417 || current_function_decl)
3419 error ("can only use %qE attribute on file-scope definitions "
3420 "of objects of class type", name);
3421 *no_add_attrs = true;
3425 if (pri > MAX_INIT_PRIORITY || pri <= 0)
3427 error ("requested init_priority is out of range");
3428 *no_add_attrs = true;
3432 /* Check for init_priorities that are reserved for
3433 language and runtime support implementations.*/
3434 if (pri <= MAX_RESERVED_INIT_PRIORITY)
3437 (0, "requested init_priority is reserved for internal use");
3440 if (SUPPORTS_INIT_PRIORITY)
3442 SET_DECL_INIT_PRIORITY (decl, pri);
3443 DECL_HAS_INIT_PRIORITY_P (decl) = 1;
3448 error ("%qE attribute is not supported on this platform", name);
3449 *no_add_attrs = true;
3454 /* DECL is being redeclared; the old declaration had the abi tags in OLD,
3455 and the new one has the tags in NEW_. Give an error if there are tags
3456 in NEW_ that weren't in OLD. */
3459 check_abi_tag_redeclaration (const_tree decl, const_tree old, const_tree new_)
3461 if (old && TREE_CODE (TREE_VALUE (old)) == TREE_LIST)
3462 old = TREE_VALUE (old);
3463 if (new_ && TREE_CODE (TREE_VALUE (new_)) == TREE_LIST)
3464 new_ = TREE_VALUE (new_);
3466 for (const_tree t = new_; t; t = TREE_CHAIN (t))
3468 tree str = TREE_VALUE (t);
3469 for (const_tree in = old; in; in = TREE_CHAIN (in))
3471 tree ostr = TREE_VALUE (in);
3472 if (cp_tree_equal (str, ostr))
3475 error ("redeclaration of %qD adds abi tag %E", decl, str);
3481 inform (DECL_SOURCE_LOCATION (decl), "previous declaration here");
3487 /* The abi_tag attribute with the name NAME was given ARGS. If they are
3488 ill-formed, give an error and return false; otherwise, return true. */
3491 check_abi_tag_args (tree args, tree name)
3495 error ("the %qE attribute requires arguments", name);
3498 for (tree arg = args; arg; arg = TREE_CHAIN (arg))
3500 tree elt = TREE_VALUE (arg);
3501 if (TREE_CODE (elt) != STRING_CST
3502 || (!same_type_ignoring_top_level_qualifiers_p
3503 (strip_array_types (TREE_TYPE (elt)),
3506 error ("arguments to the %qE attribute must be narrow string "
3510 const char *begin = TREE_STRING_POINTER (elt);
3511 const char *end = begin + TREE_STRING_LENGTH (elt);
3512 for (const char *p = begin; p != end; ++p)
3517 if (!ISALPHA (c) && c != '_')
3519 error ("arguments to the %qE attribute must contain valid "
3520 "identifiers", name);
3521 inform (input_location, "%<%c%> is not a valid first "
3522 "character for an identifier", c);
3526 else if (p == end - 1)
3527 gcc_assert (c == 0);
3530 if (!ISALNUM (c) && c != '_')
3532 error ("arguments to the %qE attribute must contain valid "
3533 "identifiers", name);
3534 inform (input_location, "%<%c%> is not a valid character "
3535 "in an identifier", c);
3544 /* Handle an "abi_tag" attribute; arguments as in
3545 struct attribute_spec.handler. */
3548 handle_abi_tag_attribute (tree* node, tree name, tree args,
3549 int flags, bool* no_add_attrs)
3551 if (!check_abi_tag_args (args, name))
3556 if (!OVERLOAD_TYPE_P (*node))
3558 error ("%qE attribute applied to non-class, non-enum type %qT",
3562 else if (!(flags & (int)ATTR_FLAG_TYPE_IN_PLACE))
3564 error ("%qE attribute applied to %qT after its definition",
3568 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (*node))
3570 warning (OPT_Wattributes, "ignoring %qE attribute applied to "
3571 "template instantiation %qT", name, *node);
3574 else if (CLASSTYPE_TEMPLATE_SPECIALIZATION (*node))
3576 warning (OPT_Wattributes, "ignoring %qE attribute applied to "
3577 "template specialization %qT", name, *node);
3581 tree attributes = TYPE_ATTRIBUTES (*node);
3582 tree decl = TYPE_NAME (*node);
3584 /* Make sure all declarations have the same abi tags. */
3585 if (DECL_SOURCE_LOCATION (decl) != input_location)
3587 if (!check_abi_tag_redeclaration (decl,
3588 lookup_attribute ("abi_tag",
3596 if (TREE_CODE (*node) != FUNCTION_DECL
3597 && TREE_CODE (*node) != VAR_DECL)
3599 error ("%qE attribute applied to non-function, non-variable %qD",
3603 else if (DECL_LANGUAGE (*node) == lang_c)
3605 error ("%qE attribute applied to extern \"C\" declaration %qD",
3614 *no_add_attrs = true;
3618 /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the
3619 thing pointed to by the constant. */
3622 make_ptrmem_cst (tree type, tree member)
3624 tree ptrmem_cst = make_node (PTRMEM_CST);
3625 TREE_TYPE (ptrmem_cst) = type;
3626 PTRMEM_CST_MEMBER (ptrmem_cst) = member;
3630 /* Build a variant of TYPE that has the indicated ATTRIBUTES. May
3631 return an existing type if an appropriate type already exists. */
3634 cp_build_type_attribute_variant (tree type, tree attributes)
3638 new_type = build_type_attribute_variant (type, attributes);
3639 if (TREE_CODE (new_type) == FUNCTION_TYPE
3640 || TREE_CODE (new_type) == METHOD_TYPE)
3642 new_type = build_exception_variant (new_type,
3643 TYPE_RAISES_EXCEPTIONS (type));
3644 new_type = build_ref_qualified_type (new_type,
3645 type_memfn_rqual (type));
3648 /* Making a new main variant of a class type is broken. */
3649 gcc_assert (!CLASS_TYPE_P (type) || new_type == type);
3654 /* Return TRUE if TYPE1 and TYPE2 are identical for type hashing purposes.
3655 Called only after doing all language independent checks. Only
3656 to check TYPE_RAISES_EXCEPTIONS for FUNCTION_TYPE, the rest is already
3657 compared in type_hash_eq. */
3660 cxx_type_hash_eq (const_tree typea, const_tree typeb)
3662 gcc_assert (TREE_CODE (typea) == FUNCTION_TYPE
3663 || TREE_CODE (typea) == METHOD_TYPE);
3665 return comp_except_specs (TYPE_RAISES_EXCEPTIONS (typea),
3666 TYPE_RAISES_EXCEPTIONS (typeb), ce_exact);
3669 /* Apply FUNC to all language-specific sub-trees of TP in a pre-order
3670 traversal. Called from walk_tree. */
3673 cp_walk_subtrees (tree *tp, int *walk_subtrees_p, walk_tree_fn func,
3674 void *data, hash_set<tree> *pset)
3676 enum tree_code code = TREE_CODE (*tp);
3679 #define WALK_SUBTREE(NODE) \
3682 result = cp_walk_tree (&(NODE), func, data, pset); \
3683 if (result) goto out; \
3687 /* Not one of the easy cases. We must explicitly go through the
3693 case TEMPLATE_TEMPLATE_PARM:
3694 case BOUND_TEMPLATE_TEMPLATE_PARM:
3695 case UNBOUND_CLASS_TEMPLATE:
3696 case TEMPLATE_PARM_INDEX:
3697 case TEMPLATE_TYPE_PARM:
3700 case UNDERLYING_TYPE:
3701 /* None of these have subtrees other than those already walked
3703 *walk_subtrees_p = 0;
3707 WALK_SUBTREE (BASELINK_FUNCTIONS (*tp));
3708 *walk_subtrees_p = 0;
3712 WALK_SUBTREE (TREE_TYPE (*tp));
3713 *walk_subtrees_p = 0;
3717 WALK_SUBTREE (TREE_PURPOSE (*tp));
3721 WALK_SUBTREE (OVL_FUNCTION (*tp));
3722 WALK_SUBTREE (OVL_CHAIN (*tp));
3723 *walk_subtrees_p = 0;
3727 WALK_SUBTREE (DECL_NAME (*tp));
3728 WALK_SUBTREE (USING_DECL_SCOPE (*tp));
3729 WALK_SUBTREE (USING_DECL_DECLS (*tp));
3730 *walk_subtrees_p = 0;
3734 if (TYPE_PTRMEMFUNC_P (*tp))
3735 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE_RAW (*tp));
3738 case TYPE_ARGUMENT_PACK:
3739 case NONTYPE_ARGUMENT_PACK:
3741 tree args = ARGUMENT_PACK_ARGS (*tp);
3742 int i, len = TREE_VEC_LENGTH (args);
3743 for (i = 0; i < len; i++)
3744 WALK_SUBTREE (TREE_VEC_ELT (args, i));
3748 case TYPE_PACK_EXPANSION:
3749 WALK_SUBTREE (TREE_TYPE (*tp));
3750 WALK_SUBTREE (PACK_EXPANSION_EXTRA_ARGS (*tp));
3751 *walk_subtrees_p = 0;
3754 case EXPR_PACK_EXPANSION:
3755 WALK_SUBTREE (TREE_OPERAND (*tp, 0));
3756 WALK_SUBTREE (PACK_EXPANSION_EXTRA_ARGS (*tp));
3757 *walk_subtrees_p = 0;
3761 case REINTERPRET_CAST_EXPR:
3762 case STATIC_CAST_EXPR:
3763 case CONST_CAST_EXPR:
3764 case DYNAMIC_CAST_EXPR:
3765 case IMPLICIT_CONV_EXPR:
3766 if (TREE_TYPE (*tp))
3767 WALK_SUBTREE (TREE_TYPE (*tp));
3771 for (i = 0; i < TREE_CODE_LENGTH (TREE_CODE (*tp)); ++i)
3772 WALK_SUBTREE (TREE_OPERAND (*tp, i));
3774 *walk_subtrees_p = 0;
3778 WALK_SUBTREE (TRAIT_EXPR_TYPE1 (*tp));
3779 WALK_SUBTREE (TRAIT_EXPR_TYPE2 (*tp));
3780 *walk_subtrees_p = 0;
3784 WALK_SUBTREE (DECLTYPE_TYPE_EXPR (*tp));
3785 *walk_subtrees_p = 0;
3793 /* We didn't find what we were looking for. */
3800 /* Like save_expr, but for C++. */
3803 cp_save_expr (tree expr)
3805 /* There is no reason to create a SAVE_EXPR within a template; if
3806 needed, we can create the SAVE_EXPR when instantiating the
3807 template. Furthermore, the middle-end cannot handle C++-specific
3809 if (processing_template_decl)
3811 return save_expr (expr);
3814 /* Initialize tree.c. */
3819 list_hash_table = hash_table<list_hasher>::create_ggc (61);
3822 /* Returns the kind of special function that DECL (a FUNCTION_DECL)
3823 is. Note that sfk_none is zero, so this function can be used as a
3824 predicate to test whether or not DECL is a special function. */
3826 special_function_kind
3827 special_function_p (const_tree decl)
3829 /* Rather than doing all this stuff with magic names, we should
3830 probably have a field of type `special_function_kind' in
3831 DECL_LANG_SPECIFIC. */
3832 if (DECL_INHERITED_CTOR_BASE (decl))
3833 return sfk_inheriting_constructor;
3834 if (DECL_COPY_CONSTRUCTOR_P (decl))
3835 return sfk_copy_constructor;
3836 if (DECL_MOVE_CONSTRUCTOR_P (decl))
3837 return sfk_move_constructor;
3838 if (DECL_CONSTRUCTOR_P (decl))
3839 return sfk_constructor;
3840 if (DECL_OVERLOADED_OPERATOR_P (decl) == NOP_EXPR)
3842 if (copy_fn_p (decl))
3843 return sfk_copy_assignment;
3844 if (move_fn_p (decl))
3845 return sfk_move_assignment;
3847 if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl))
3848 return sfk_destructor;
3849 if (DECL_COMPLETE_DESTRUCTOR_P (decl))
3850 return sfk_complete_destructor;
3851 if (DECL_BASE_DESTRUCTOR_P (decl))
3852 return sfk_base_destructor;
3853 if (DECL_DELETING_DESTRUCTOR_P (decl))
3854 return sfk_deleting_destructor;
3855 if (DECL_CONV_FN_P (decl))
3856 return sfk_conversion;
3861 /* Returns nonzero if TYPE is a character type, including wchar_t. */
3864 char_type_p (tree type)
3866 return (same_type_p (type, char_type_node)
3867 || same_type_p (type, unsigned_char_type_node)
3868 || same_type_p (type, signed_char_type_node)
3869 || same_type_p (type, char16_type_node)
3870 || same_type_p (type, char32_type_node)
3871 || same_type_p (type, wchar_type_node));
3874 /* Returns the kind of linkage associated with the indicated DECL. Th
3875 value returned is as specified by the language standard; it is
3876 independent of implementation details regarding template
3877 instantiation, etc. For example, it is possible that a declaration
3878 to which this function assigns external linkage would not show up
3879 as a global symbol when you run `nm' on the resulting object file. */
3882 decl_linkage (tree decl)
3884 /* This function doesn't attempt to calculate the linkage from first
3885 principles as given in [basic.link]. Instead, it makes use of
3886 the fact that we have already set TREE_PUBLIC appropriately, and
3887 then handles a few special cases. Ideally, we would calculate
3888 linkage first, and then transform that into a concrete
3891 /* Things that don't have names have no linkage. */
3892 if (!DECL_NAME (decl))
3895 /* Fields have no linkage. */
3896 if (TREE_CODE (decl) == FIELD_DECL)
3899 /* Things that are TREE_PUBLIC have external linkage. */
3900 if (TREE_PUBLIC (decl))
3903 if (TREE_CODE (decl) == NAMESPACE_DECL)
3906 /* Linkage of a CONST_DECL depends on the linkage of the enumeration
3908 if (TREE_CODE (decl) == CONST_DECL)
3909 return decl_linkage (TYPE_NAME (DECL_CONTEXT (decl)));
3911 /* Things in local scope do not have linkage, if they don't have
3913 if (decl_function_context (decl))
3916 /* Members of the anonymous namespace also have TREE_PUBLIC unset, but
3917 are considered to have external linkage for language purposes, as do
3918 template instantiations on targets without weak symbols. DECLs really
3919 meant to have internal linkage have DECL_THIS_STATIC set. */
3920 if (TREE_CODE (decl) == TYPE_DECL)
3922 if (VAR_OR_FUNCTION_DECL_P (decl))
3924 if (!DECL_THIS_STATIC (decl))
3927 /* Static data members and static member functions from classes
3928 in anonymous namespace also don't have TREE_PUBLIC set. */
3929 if (DECL_CLASS_CONTEXT (decl))
3933 /* Everything else has internal linkage. */
3937 /* Returns the storage duration of the object or reference associated with
3938 the indicated DECL, which should be a VAR_DECL or PARM_DECL. */
3941 decl_storage_duration (tree decl)
3943 if (TREE_CODE (decl) == PARM_DECL)
3945 if (TREE_CODE (decl) == FUNCTION_DECL)
3947 gcc_assert (VAR_P (decl));
3948 if (!TREE_STATIC (decl)
3949 && !DECL_EXTERNAL (decl))
3951 if (DECL_THREAD_LOCAL_P (decl))
3956 /* EXP is an expression that we want to pre-evaluate. Returns (in
3957 *INITP) an expression that will perform the pre-evaluation. The
3958 value returned by this function is a side-effect free expression
3959 equivalent to the pre-evaluated expression. Callers must ensure
3960 that *INITP is evaluated before EXP. */
3963 stabilize_expr (tree exp, tree* initp)
3967 if (!TREE_SIDE_EFFECTS (exp))
3968 init_expr = NULL_TREE;
3969 else if (VOID_TYPE_P (TREE_TYPE (exp)))
3974 /* There are no expressions with REFERENCE_TYPE, but there can be call
3975 arguments with such a type; just treat it as a pointer. */
3976 else if (TREE_CODE (TREE_TYPE (exp)) == REFERENCE_TYPE
3977 || SCALAR_TYPE_P (TREE_TYPE (exp))
3978 || !lvalue_or_rvalue_with_address_p (exp))
3980 init_expr = get_target_expr (exp);
3981 exp = TARGET_EXPR_SLOT (init_expr);
3982 if (CLASS_TYPE_P (TREE_TYPE (exp)))
3989 bool xval = !real_lvalue_p (exp);
3990 exp = cp_build_addr_expr (exp, tf_warning_or_error);
3991 init_expr = get_target_expr (exp);
3992 exp = TARGET_EXPR_SLOT (init_expr);
3993 exp = cp_build_indirect_ref (exp, RO_NULL, tf_warning_or_error);
3999 gcc_assert (!TREE_SIDE_EFFECTS (exp));
4003 /* Add NEW_EXPR, an expression whose value we don't care about, after the
4004 similar expression ORIG. */
4007 add_stmt_to_compound (tree orig, tree new_expr)
4009 if (!new_expr || !TREE_SIDE_EFFECTS (new_expr))
4011 if (!orig || !TREE_SIDE_EFFECTS (orig))
4013 return build2 (COMPOUND_EXPR, void_type_node, orig, new_expr);
4016 /* Like stabilize_expr, but for a call whose arguments we want to
4017 pre-evaluate. CALL is modified in place to use the pre-evaluated
4018 arguments, while, upon return, *INITP contains an expression to
4019 compute the arguments. */
4022 stabilize_call (tree call, tree *initp)
4024 tree inits = NULL_TREE;
4026 int nargs = call_expr_nargs (call);
4028 if (call == error_mark_node || processing_template_decl)
4034 gcc_assert (TREE_CODE (call) == CALL_EXPR);
4036 for (i = 0; i < nargs; i++)
4039 CALL_EXPR_ARG (call, i) =
4040 stabilize_expr (CALL_EXPR_ARG (call, i), &init);
4041 inits = add_stmt_to_compound (inits, init);
4047 /* Like stabilize_expr, but for an AGGR_INIT_EXPR whose arguments we want
4048 to pre-evaluate. CALL is modified in place to use the pre-evaluated
4049 arguments, while, upon return, *INITP contains an expression to
4050 compute the arguments. */
4053 stabilize_aggr_init (tree call, tree *initp)
4055 tree inits = NULL_TREE;
4057 int nargs = aggr_init_expr_nargs (call);
4059 if (call == error_mark_node)
4062 gcc_assert (TREE_CODE (call) == AGGR_INIT_EXPR);
4064 for (i = 0; i < nargs; i++)
4067 AGGR_INIT_EXPR_ARG (call, i) =
4068 stabilize_expr (AGGR_INIT_EXPR_ARG (call, i), &init);
4069 inits = add_stmt_to_compound (inits, init);
4075 /* Like stabilize_expr, but for an initialization.
4077 If the initialization is for an object of class type, this function
4078 takes care not to introduce additional temporaries.
4080 Returns TRUE iff the expression was successfully pre-evaluated,
4081 i.e., if INIT is now side-effect free, except for, possibly, a
4082 single call to a constructor. */
4085 stabilize_init (tree init, tree *initp)
4091 if (t == error_mark_node || processing_template_decl)
4094 if (TREE_CODE (t) == INIT_EXPR)
4095 t = TREE_OPERAND (t, 1);
4096 if (TREE_CODE (t) == TARGET_EXPR)
4097 t = TARGET_EXPR_INITIAL (t);
4099 /* If the RHS can be stabilized without breaking copy elision, stabilize
4100 it. We specifically don't stabilize class prvalues here because that
4101 would mean an extra copy, but they might be stabilized below. */
4102 if (TREE_CODE (init) == INIT_EXPR
4103 && TREE_CODE (t) != CONSTRUCTOR
4104 && TREE_CODE (t) != AGGR_INIT_EXPR
4105 && (SCALAR_TYPE_P (TREE_TYPE (t))
4106 || lvalue_or_rvalue_with_address_p (t)))
4108 TREE_OPERAND (init, 1) = stabilize_expr (t, initp);
4112 if (TREE_CODE (t) == COMPOUND_EXPR
4113 && TREE_CODE (init) == INIT_EXPR)
4115 tree last = expr_last (t);
4116 /* Handle stabilizing the EMPTY_CLASS_EXPR pattern. */
4117 if (!TREE_SIDE_EFFECTS (last))
4120 TREE_OPERAND (init, 1) = last;
4125 if (TREE_CODE (t) == CONSTRUCTOR)
4127 /* Aggregate initialization: stabilize each of the field
4130 constructor_elt *ce;
4132 vec<constructor_elt, va_gc> *v = CONSTRUCTOR_ELTS (t);
4133 for (i = 0; vec_safe_iterate (v, i, &ce); ++i)
4135 tree type = TREE_TYPE (ce->value);
4137 if (TREE_CODE (type) == REFERENCE_TYPE
4138 || SCALAR_TYPE_P (type))
4139 ce->value = stabilize_expr (ce->value, &subinit);
4140 else if (!stabilize_init (ce->value, &subinit))
4142 *initp = add_stmt_to_compound (*initp, subinit);
4147 if (TREE_CODE (t) == CALL_EXPR)
4149 stabilize_call (t, initp);
4153 if (TREE_CODE (t) == AGGR_INIT_EXPR)
4155 stabilize_aggr_init (t, initp);
4159 /* The initialization is being performed via a bitwise copy -- and
4160 the item copied may have side effects. */
4161 return !TREE_SIDE_EFFECTS (init);
4164 /* Like "fold", but should be used whenever we might be processing the
4165 body of a template. */
4168 fold_if_not_in_template (tree expr)
4170 /* In the body of a template, there is never any need to call
4171 "fold". We will call fold later when actually instantiating the
4172 template. Integral constant expressions in templates will be
4173 evaluated via instantiate_non_dependent_expr, as necessary. */
4174 if (processing_template_decl)
4177 /* Fold C++ front-end specific tree codes. */
4178 if (TREE_CODE (expr) == UNARY_PLUS_EXPR)
4179 return fold_convert (TREE_TYPE (expr), TREE_OPERAND (expr, 0));
4184 /* Returns true if a cast to TYPE may appear in an integral constant
4188 cast_valid_in_integral_constant_expression_p (tree type)
4190 return (INTEGRAL_OR_ENUMERATION_TYPE_P (type)
4191 || cxx_dialect >= cxx11
4192 || dependent_type_p (type)
4193 || type == error_mark_node);
4196 /* Return true if we need to fix linkage information of DECL. */
4199 cp_fix_function_decl_p (tree decl)
4201 /* Skip if DECL is not externally visible. */
4202 if (!TREE_PUBLIC (decl))
4205 /* We need to fix DECL if it a appears to be exported but with no
4206 function body. Thunks do not have CFGs and we may need to
4207 handle them specially later. */
4208 if (!gimple_has_body_p (decl)
4209 && !DECL_THUNK_P (decl)
4210 && !DECL_EXTERNAL (decl))
4212 struct cgraph_node *node = cgraph_node::get (decl);
4214 /* Don't fix same_body aliases. Although they don't have their own
4215 CFG, they share it with what they alias to. */
4216 if (!node || !node->alias
4217 || !vec_safe_length (node->ref_list.references))
4224 /* Clean the C++ specific parts of the tree T. */
4227 cp_free_lang_data (tree t)
4229 if (TREE_CODE (t) == METHOD_TYPE
4230 || TREE_CODE (t) == FUNCTION_TYPE)
4232 /* Default args are not interesting anymore. */
4233 tree argtypes = TYPE_ARG_TYPES (t);
4236 TREE_PURPOSE (argtypes) = 0;
4237 argtypes = TREE_CHAIN (argtypes);
4240 else if (TREE_CODE (t) == FUNCTION_DECL
4241 && cp_fix_function_decl_p (t))
4243 /* If T is used in this translation unit at all, the definition
4244 must exist somewhere else since we have decided to not emit it
4245 in this TU. So make it an external reference. */
4246 DECL_EXTERNAL (t) = 1;
4247 TREE_STATIC (t) = 0;
4249 if (TREE_CODE (t) == NAMESPACE_DECL)
4251 /* The list of users of a namespace isn't useful for the middle-end
4252 or debug generators. */
4253 DECL_NAMESPACE_USERS (t) = NULL_TREE;
4254 /* Neither do we need the leftover chaining of namespaces
4255 from the binding level. */
4256 DECL_CHAIN (t) = NULL_TREE;
4260 /* Stub for c-common. Please keep in sync with c-decl.c.
4261 FIXME: If address space support is target specific, then this
4262 should be a C target hook. But currently this is not possible,
4263 because this function is called via REGISTER_TARGET_PRAGMAS. */
4265 c_register_addr_space (const char * /*word*/, addr_space_t /*as*/)
4269 /* Return the number of operands in T that we care about for things like
4273 cp_tree_operand_length (const_tree t)
4275 enum tree_code code = TREE_CODE (t);
4279 case PREINCREMENT_EXPR:
4280 case PREDECREMENT_EXPR:
4281 case POSTINCREMENT_EXPR:
4282 case POSTDECREMENT_EXPR:
4288 case EXPR_PACK_EXPANSION:
4292 return TREE_OPERAND_LENGTH (t);
4296 /* Implement -Wzero_as_null_pointer_constant. Return true if the
4297 conditions for the warning hold, false otherwise. */
4299 maybe_warn_zero_as_null_pointer_constant (tree expr, location_t loc)
4301 if (c_inhibit_evaluation_warnings == 0
4302 && !NULLPTR_TYPE_P (TREE_TYPE (expr)))
4304 warning_at (loc, OPT_Wzero_as_null_pointer_constant,
4305 "zero as null pointer constant");
4311 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4312 /* Complain that some language-specific thing hanging off a tree
4313 node has been accessed improperly. */
4316 lang_check_failed (const char* file, int line, const char* function)
4318 internal_error ("lang_* check: failed in %s, at %s:%d",
4319 function, trim_filename (file), line);
4321 #endif /* ENABLE_TREE_CHECKING */
4323 #include "gt-cp-tree.h"