1 /* Language-dependent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2007, 2008, 2009, 2010, 2011
4 Free Software Foundation, Inc.
5 Hacked by Michael Tiemann (tiemann@cygnus.com)
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 3, or (at your option)
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
25 #include "coretypes.h"
30 #include "tree-inline.h"
34 #include "splay-tree.h"
35 #include "gimple.h" /* gimple_has_body_p */
37 static tree bot_manip (tree *, int *, void *);
38 static tree bot_replace (tree *, int *, void *);
39 static int list_hash_eq (const void *, const void *);
40 static hashval_t list_hash_pieces (tree, tree, tree);
41 static hashval_t list_hash (const void *);
42 static tree build_target_expr (tree, tree, tsubst_flags_t);
43 static tree count_trees_r (tree *, int *, void *);
44 static tree verify_stmt_tree_r (tree *, int *, void *);
45 static tree build_local_temp (tree);
47 static tree handle_java_interface_attribute (tree *, tree, tree, int, bool *);
48 static tree handle_com_interface_attribute (tree *, tree, tree, int, bool *);
49 static tree handle_init_priority_attribute (tree *, tree, tree, int, bool *);
51 /* If REF is an lvalue, returns the kind of lvalue that REF is.
52 Otherwise, returns clk_none. */
55 lvalue_kind (const_tree ref)
57 cp_lvalue_kind op1_lvalue_kind = clk_none;
58 cp_lvalue_kind op2_lvalue_kind = clk_none;
60 /* Expressions of reference type are sometimes wrapped in
61 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
62 representation, not part of the language, so we have to look
64 if (TREE_CODE (ref) == INDIRECT_REF
65 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref, 0)))
67 return lvalue_kind (TREE_OPERAND (ref, 0));
70 && TREE_CODE (TREE_TYPE (ref)) == REFERENCE_TYPE)
72 /* unnamed rvalue references are rvalues */
73 if (TYPE_REF_IS_RVALUE (TREE_TYPE (ref))
74 && TREE_CODE (ref) != PARM_DECL
75 && TREE_CODE (ref) != VAR_DECL
76 && TREE_CODE (ref) != COMPONENT_REF
77 /* Functions are always lvalues. */
78 && TREE_CODE (TREE_TYPE (TREE_TYPE (ref))) != FUNCTION_TYPE)
81 /* lvalue references and named rvalue references are lvalues. */
85 if (ref == current_class_ptr)
88 switch (TREE_CODE (ref))
92 /* preincrements and predecrements are valid lvals, provided
93 what they refer to are valid lvals. */
94 case PREINCREMENT_EXPR:
95 case PREDECREMENT_EXPR:
97 case WITH_CLEANUP_EXPR:
100 return lvalue_kind (TREE_OPERAND (ref, 0));
103 op1_lvalue_kind = lvalue_kind (TREE_OPERAND (ref, 0));
104 /* Look at the member designator. */
105 if (!op1_lvalue_kind)
107 else if (is_overloaded_fn (TREE_OPERAND (ref, 1)))
108 /* The "field" can be a FUNCTION_DECL or an OVERLOAD in some
109 situations. If we're seeing a COMPONENT_REF, it's a non-static
110 member, so it isn't an lvalue. */
111 op1_lvalue_kind = clk_none;
112 else if (TREE_CODE (TREE_OPERAND (ref, 1)) != FIELD_DECL)
113 /* This can be IDENTIFIER_NODE in a template. */;
114 else if (DECL_C_BIT_FIELD (TREE_OPERAND (ref, 1)))
116 /* Clear the ordinary bit. If this object was a class
117 rvalue we want to preserve that information. */
118 op1_lvalue_kind &= ~clk_ordinary;
119 /* The lvalue is for a bitfield. */
120 op1_lvalue_kind |= clk_bitfield;
122 else if (DECL_PACKED (TREE_OPERAND (ref, 1)))
123 op1_lvalue_kind |= clk_packed;
125 return op1_lvalue_kind;
128 case COMPOUND_LITERAL_EXPR:
132 /* CONST_DECL without TREE_STATIC are enumeration values and
133 thus not lvalues. With TREE_STATIC they are used by ObjC++
134 in objc_build_string_object and need to be considered as
136 if (! TREE_STATIC (ref))
139 if (TREE_READONLY (ref) && ! TREE_STATIC (ref)
140 && DECL_LANG_SPECIFIC (ref)
141 && DECL_IN_AGGR_P (ref))
147 if (TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE)
151 /* A scope ref in a template, left as SCOPE_REF to support later
154 gcc_assert (!type_dependent_expression_p (CONST_CAST_TREE(ref)));
155 return lvalue_kind (TREE_OPERAND (ref, 1));
159 /* Disallow <? and >? as lvalues if either argument side-effects. */
160 if (TREE_SIDE_EFFECTS (TREE_OPERAND (ref, 0))
161 || TREE_SIDE_EFFECTS (TREE_OPERAND (ref, 1)))
163 op1_lvalue_kind = lvalue_kind (TREE_OPERAND (ref, 0));
164 op2_lvalue_kind = lvalue_kind (TREE_OPERAND (ref, 1));
168 op1_lvalue_kind = lvalue_kind (TREE_OPERAND (ref, 1)
169 ? TREE_OPERAND (ref, 1)
170 : TREE_OPERAND (ref, 0));
171 op2_lvalue_kind = lvalue_kind (TREE_OPERAND (ref, 2));
178 return lvalue_kind (TREE_OPERAND (ref, 1));
184 return (CLASS_TYPE_P (TREE_TYPE (ref)) ? clk_class : clk_none);
187 /* Any class-valued call would be wrapped in a TARGET_EXPR. */
191 /* All functions (except non-static-member functions) are
193 return (DECL_NONSTATIC_MEMBER_FUNCTION_P (ref)
194 ? clk_none : clk_ordinary);
197 /* We now represent a reference to a single static member function
199 /* This CONST_CAST is okay because BASELINK_FUNCTIONS returns
200 its argument unmodified and we assign it to a const_tree. */
201 return lvalue_kind (BASELINK_FUNCTIONS (CONST_CAST_TREE (ref)));
203 case NON_DEPENDENT_EXPR:
204 /* We must consider NON_DEPENDENT_EXPRs to be lvalues so that
205 things like "&E" where "E" is an expression with a
206 non-dependent type work. It is safe to be lenient because an
207 error will be issued when the template is instantiated if "E"
215 /* If one operand is not an lvalue at all, then this expression is
217 if (!op1_lvalue_kind || !op2_lvalue_kind)
220 /* Otherwise, it's an lvalue, and it has all the odd properties
221 contributed by either operand. */
222 op1_lvalue_kind = op1_lvalue_kind | op2_lvalue_kind;
223 /* It's not an ordinary lvalue if it involves any other kind. */
224 if ((op1_lvalue_kind & ~clk_ordinary) != clk_none)
225 op1_lvalue_kind &= ~clk_ordinary;
226 /* It can't be both a pseudo-lvalue and a non-addressable lvalue.
227 A COND_EXPR of those should be wrapped in a TARGET_EXPR. */
228 if ((op1_lvalue_kind & (clk_rvalueref|clk_class))
229 && (op1_lvalue_kind & (clk_bitfield|clk_packed)))
230 op1_lvalue_kind = clk_none;
231 return op1_lvalue_kind;
234 /* Returns the kind of lvalue that REF is, in the sense of
235 [basic.lval]. This function should really be named lvalue_p; it
236 computes the C++ definition of lvalue. */
239 real_lvalue_p (const_tree ref)
241 cp_lvalue_kind kind = lvalue_kind (ref);
242 if (kind & (clk_rvalueref|clk_class))
248 /* This differs from real_lvalue_p in that class rvalues are considered
252 lvalue_p (const_tree ref)
254 return (lvalue_kind (ref) != clk_none);
257 /* This differs from real_lvalue_p in that rvalues formed by dereferencing
258 rvalue references are considered rvalues. */
261 lvalue_or_rvalue_with_address_p (const_tree ref)
263 cp_lvalue_kind kind = lvalue_kind (ref);
264 if (kind & clk_class)
267 return (kind != clk_none);
270 /* Test whether DECL is a builtin that may appear in a
271 constant-expression. */
274 builtin_valid_in_constant_expr_p (const_tree decl)
276 /* At present BUILT_IN_CONSTANT_P is the only builtin we're allowing
277 in constant-expressions. We may want to add other builtins later. */
278 return DECL_IS_BUILTIN_CONSTANT_P (decl);
281 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
284 build_target_expr (tree decl, tree value, tsubst_flags_t complain)
288 #ifdef ENABLE_CHECKING
289 gcc_assert (VOID_TYPE_P (TREE_TYPE (value))
290 || TREE_TYPE (decl) == TREE_TYPE (value)
291 || useless_type_conversion_p (TREE_TYPE (decl),
295 t = cxx_maybe_build_cleanup (decl, complain);
296 if (t == error_mark_node)
297 return error_mark_node;
298 t = build4 (TARGET_EXPR, TREE_TYPE (decl), decl, value, t, NULL_TREE);
299 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
300 ignore the TARGET_EXPR. If there really turn out to be no
301 side-effects, then the optimizer should be able to get rid of
302 whatever code is generated anyhow. */
303 TREE_SIDE_EFFECTS (t) = 1;
308 /* Return an undeclared local temporary of type TYPE for use in building a
312 build_local_temp (tree type)
314 tree slot = build_decl (input_location,
315 VAR_DECL, NULL_TREE, type);
316 DECL_ARTIFICIAL (slot) = 1;
317 DECL_IGNORED_P (slot) = 1;
318 DECL_CONTEXT (slot) = current_function_decl;
319 layout_decl (slot, 0);
323 /* Set various status flags when building an AGGR_INIT_EXPR object T. */
326 process_aggr_init_operands (tree t)
330 side_effects = TREE_SIDE_EFFECTS (t);
334 n = TREE_OPERAND_LENGTH (t);
335 for (i = 1; i < n; i++)
337 tree op = TREE_OPERAND (t, i);
338 if (op && TREE_SIDE_EFFECTS (op))
345 TREE_SIDE_EFFECTS (t) = side_effects;
348 /* Build an AGGR_INIT_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE,
349 FN, and SLOT. NARGS is the number of call arguments which are specified
350 as a tree array ARGS. */
353 build_aggr_init_array (tree return_type, tree fn, tree slot, int nargs,
359 t = build_vl_exp (AGGR_INIT_EXPR, nargs + 3);
360 TREE_TYPE (t) = return_type;
361 AGGR_INIT_EXPR_FN (t) = fn;
362 AGGR_INIT_EXPR_SLOT (t) = slot;
363 for (i = 0; i < nargs; i++)
364 AGGR_INIT_EXPR_ARG (t, i) = args[i];
365 process_aggr_init_operands (t);
369 /* INIT is a CALL_EXPR or AGGR_INIT_EXPR which needs info about its
370 target. TYPE is the type to be initialized.
372 Build an AGGR_INIT_EXPR to represent the initialization. This function
373 differs from build_cplus_new in that an AGGR_INIT_EXPR can only be used
374 to initialize another object, whereas a TARGET_EXPR can either
375 initialize another object or create its own temporary object, and as a
376 result building up a TARGET_EXPR requires that the type's destructor be
380 build_aggr_init_expr (tree type, tree init, tsubst_flags_t complain)
387 /* Make sure that we're not trying to create an instance of an
389 if (abstract_virtuals_error_sfinae (NULL_TREE, type, complain))
390 return error_mark_node;
392 if (TREE_CODE (init) == CALL_EXPR)
393 fn = CALL_EXPR_FN (init);
394 else if (TREE_CODE (init) == AGGR_INIT_EXPR)
395 fn = AGGR_INIT_EXPR_FN (init);
397 return convert (type, init);
399 is_ctor = (TREE_CODE (fn) == ADDR_EXPR
400 && TREE_CODE (TREE_OPERAND (fn, 0)) == FUNCTION_DECL
401 && DECL_CONSTRUCTOR_P (TREE_OPERAND (fn, 0)));
403 /* We split the CALL_EXPR into its function and its arguments here.
404 Then, in expand_expr, we put them back together. The reason for
405 this is that this expression might be a default argument
406 expression. In that case, we need a new temporary every time the
407 expression is used. That's what break_out_target_exprs does; it
408 replaces every AGGR_INIT_EXPR with a copy that uses a fresh
409 temporary slot. Then, expand_expr builds up a call-expression
410 using the new slot. */
412 /* If we don't need to use a constructor to create an object of this
413 type, don't mess with AGGR_INIT_EXPR. */
414 if (is_ctor || TREE_ADDRESSABLE (type))
416 slot = build_local_temp (type);
418 if (TREE_CODE(init) == CALL_EXPR)
419 rval = build_aggr_init_array (void_type_node, fn, slot,
420 call_expr_nargs (init),
421 CALL_EXPR_ARGP (init));
423 rval = build_aggr_init_array (void_type_node, fn, slot,
424 aggr_init_expr_nargs (init),
425 AGGR_INIT_EXPR_ARGP (init));
426 TREE_SIDE_EFFECTS (rval) = 1;
427 AGGR_INIT_VIA_CTOR_P (rval) = is_ctor;
428 TREE_NOTHROW (rval) = TREE_NOTHROW (init);
436 /* INIT is a CALL_EXPR or AGGR_INIT_EXPR which needs info about its
437 target. TYPE is the type that this initialization should appear to
440 Build an encapsulation of the initialization to perform
441 and return it so that it can be processed by language-independent
442 and language-specific expression expanders. */
445 build_cplus_new (tree type, tree init, tsubst_flags_t complain)
447 tree rval = build_aggr_init_expr (type, init, complain);
450 if (TREE_CODE (rval) == AGGR_INIT_EXPR)
451 slot = AGGR_INIT_EXPR_SLOT (rval);
452 else if (TREE_CODE (rval) == CALL_EXPR
453 || TREE_CODE (rval) == CONSTRUCTOR)
454 slot = build_local_temp (type);
458 rval = build_target_expr (slot, rval, complain);
460 if (rval != error_mark_node)
461 TARGET_EXPR_IMPLICIT_P (rval) = 1;
466 /* Subroutine of build_vec_init_expr: Build up a single element
467 intialization as a proxy for the full array initialization to get things
468 marked as used and any appropriate diagnostics.
470 Since we're deferring building the actual constructor calls until
471 gimplification time, we need to build one now and throw it away so
472 that the relevant constructor gets mark_used before cgraph decides
473 what functions are needed. Here we assume that init is either
474 NULL_TREE, void_type_node (indicating value-initialization), or
475 another array to copy. */
478 build_vec_init_elt (tree type, tree init, tsubst_flags_t complain)
480 tree inner_type = strip_array_types (type);
481 VEC(tree,gc) *argvec;
483 if (integer_zerop (array_type_nelts_total (type))
484 || !CLASS_TYPE_P (inner_type))
485 /* No interesting initialization to do. */
486 return integer_zero_node;
487 else if (init == void_type_node)
488 return build_value_init (inner_type, complain);
490 gcc_assert (init == NULL_TREE
491 || (same_type_ignoring_top_level_qualifiers_p
492 (type, TREE_TYPE (init))));
494 argvec = make_tree_vector ();
497 tree dummy = build_dummy_object (inner_type);
498 if (!real_lvalue_p (init))
499 dummy = move (dummy);
500 VEC_quick_push (tree, argvec, dummy);
502 init = build_special_member_call (NULL_TREE, complete_ctor_identifier,
503 &argvec, inner_type, LOOKUP_NORMAL,
505 release_tree_vector (argvec);
510 /* Return a TARGET_EXPR which expresses the initialization of an array to
511 be named later, either default-initialization or copy-initialization
512 from another array of the same type. */
515 build_vec_init_expr (tree type, tree init, tsubst_flags_t complain)
518 bool value_init = false;
519 tree elt_init = build_vec_init_elt (type, init, complain);
521 if (init == void_type_node)
527 slot = build_local_temp (type);
528 init = build2 (VEC_INIT_EXPR, type, slot, init);
529 TREE_SIDE_EFFECTS (init) = true;
530 SET_EXPR_LOCATION (init, input_location);
532 if (cxx_dialect >= cxx0x
533 && potential_constant_expression (elt_init))
534 VEC_INIT_EXPR_IS_CONSTEXPR (init) = true;
535 VEC_INIT_EXPR_VALUE_INIT (init) = value_init;
537 init = build_target_expr (slot, init, complain);
538 TARGET_EXPR_IMPLICIT_P (init) = 1;
543 /* Give a helpful diagnostic for a non-constexpr VEC_INIT_EXPR in a context
544 that requires a constant expression. */
547 diagnose_non_constexpr_vec_init (tree expr)
549 tree type = TREE_TYPE (VEC_INIT_EXPR_SLOT (expr));
551 if (VEC_INIT_EXPR_VALUE_INIT (expr))
552 init = void_zero_node;
554 init = VEC_INIT_EXPR_INIT (expr);
556 elt_init = build_vec_init_elt (type, init, tf_warning_or_error);
557 require_potential_constant_expression (elt_init);
561 build_array_copy (tree init)
563 return build_vec_init_expr (TREE_TYPE (init), init, tf_warning_or_error);
566 /* Build a TARGET_EXPR using INIT to initialize a new temporary of the
570 build_target_expr_with_type (tree init, tree type, tsubst_flags_t complain)
572 gcc_assert (!VOID_TYPE_P (type));
574 if (TREE_CODE (init) == TARGET_EXPR
575 || init == error_mark_node)
577 else if (CLASS_TYPE_P (type) && type_has_nontrivial_copy_init (type)
578 && !VOID_TYPE_P (TREE_TYPE (init))
579 && TREE_CODE (init) != COND_EXPR
580 && TREE_CODE (init) != CONSTRUCTOR
581 && TREE_CODE (init) != VA_ARG_EXPR)
582 /* We need to build up a copy constructor call. A void initializer
583 means we're being called from bot_manip. COND_EXPR is a special
584 case because we already have copies on the arms and we don't want
585 another one here. A CONSTRUCTOR is aggregate initialization, which
586 is handled separately. A VA_ARG_EXPR is magic creation of an
587 aggregate; there's no additional work to be done. */
588 return force_rvalue (init, complain);
590 return force_target_expr (type, init, complain);
593 /* Like the above function, but without the checking. This function should
594 only be used by code which is deliberately trying to subvert the type
595 system, such as call_builtin_trap. Or build_over_call, to avoid
596 infinite recursion. */
599 force_target_expr (tree type, tree init, tsubst_flags_t complain)
603 gcc_assert (!VOID_TYPE_P (type));
605 slot = build_local_temp (type);
606 return build_target_expr (slot, init, complain);
609 /* Like build_target_expr_with_type, but use the type of INIT. */
612 get_target_expr_sfinae (tree init, tsubst_flags_t complain)
614 if (TREE_CODE (init) == AGGR_INIT_EXPR)
615 return build_target_expr (AGGR_INIT_EXPR_SLOT (init), init, complain);
616 else if (TREE_CODE (init) == VEC_INIT_EXPR)
617 return build_target_expr (VEC_INIT_EXPR_SLOT (init), init, complain);
619 return build_target_expr_with_type (init, TREE_TYPE (init), complain);
623 get_target_expr (tree init)
625 return get_target_expr_sfinae (init, tf_warning_or_error);
628 /* If EXPR is a bitfield reference, convert it to the declared type of
629 the bitfield, and return the resulting expression. Otherwise,
630 return EXPR itself. */
633 convert_bitfield_to_declared_type (tree expr)
637 bitfield_type = is_bitfield_expr_with_lowered_type (expr);
639 expr = convert_to_integer (TYPE_MAIN_VARIANT (bitfield_type),
644 /* EXPR is being used in an rvalue context. Return a version of EXPR
645 that is marked as an rvalue. */
652 if (error_operand_p (expr))
655 expr = mark_rvalue_use (expr);
659 Non-class rvalues always have cv-unqualified types. */
660 type = TREE_TYPE (expr);
661 if (!CLASS_TYPE_P (type) && cv_qualified_p (type))
662 type = cv_unqualified (type);
664 /* We need to do this for rvalue refs as well to get the right answer
665 from decltype; see c++/36628. */
666 if (!processing_template_decl && lvalue_or_rvalue_with_address_p (expr))
667 expr = build1 (NON_LVALUE_EXPR, type, expr);
668 else if (type != TREE_TYPE (expr))
669 expr = build_nop (type, expr);
675 /* Hash an ARRAY_TYPE. K is really of type `tree'. */
678 cplus_array_hash (const void* k)
681 const_tree const t = (const_tree) k;
683 hash = TYPE_UID (TREE_TYPE (t));
685 hash ^= TYPE_UID (TYPE_DOMAIN (t));
689 typedef struct cplus_array_info {
694 /* Compare two ARRAY_TYPEs. K1 is really of type `tree', K2 is really
695 of type `cplus_array_info*'. */
698 cplus_array_compare (const void * k1, const void * k2)
700 const_tree const t1 = (const_tree) k1;
701 const cplus_array_info *const t2 = (const cplus_array_info*) k2;
703 return (TREE_TYPE (t1) == t2->type && TYPE_DOMAIN (t1) == t2->domain);
706 /* Hash table containing dependent array types, which are unsuitable for
707 the language-independent type hash table. */
708 static GTY ((param_is (union tree_node))) htab_t cplus_array_htab;
710 /* Like build_array_type, but handle special C++ semantics. */
713 build_cplus_array_type (tree elt_type, tree index_type)
717 if (elt_type == error_mark_node || index_type == error_mark_node)
718 return error_mark_node;
720 if (processing_template_decl
721 && (dependent_type_p (elt_type)
722 || (index_type && !TREE_CONSTANT (TYPE_MAX_VALUE (index_type)))))
725 cplus_array_info cai;
728 if (cplus_array_htab == NULL)
729 cplus_array_htab = htab_create_ggc (61, &cplus_array_hash,
730 &cplus_array_compare, NULL);
732 hash = TYPE_UID (elt_type);
734 hash ^= TYPE_UID (index_type);
736 cai.domain = index_type;
738 e = htab_find_slot_with_hash (cplus_array_htab, &cai, hash, INSERT);
740 /* We have found the type: we're done. */
744 /* Build a new array type. */
745 t = cxx_make_type (ARRAY_TYPE);
746 TREE_TYPE (t) = elt_type;
747 TYPE_DOMAIN (t) = index_type;
749 /* Store it in the hash table. */
752 /* Set the canonical type for this new node. */
753 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
754 || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type)))
755 SET_TYPE_STRUCTURAL_EQUALITY (t);
756 else if (TYPE_CANONICAL (elt_type) != elt_type
758 && TYPE_CANONICAL (index_type) != index_type))
760 = build_cplus_array_type
761 (TYPE_CANONICAL (elt_type),
762 index_type ? TYPE_CANONICAL (index_type) : index_type);
764 TYPE_CANONICAL (t) = t;
768 t = build_array_type (elt_type, index_type);
770 /* We want TYPE_MAIN_VARIANT of an array to strip cv-quals from the
771 element type as well, so fix it up if needed. */
772 if (elt_type != TYPE_MAIN_VARIANT (elt_type))
774 tree m = build_cplus_array_type (TYPE_MAIN_VARIANT (elt_type),
776 if (TYPE_MAIN_VARIANT (t) != m)
778 TYPE_MAIN_VARIANT (t) = m;
779 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
780 TYPE_NEXT_VARIANT (m) = t;
784 /* Push these needs up so that initialization takes place
786 TYPE_NEEDS_CONSTRUCTING (t)
787 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (elt_type));
788 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
789 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (elt_type));
793 /* Return an ARRAY_TYPE with element type ELT and length N. */
796 build_array_of_n_type (tree elt, int n)
798 return build_cplus_array_type (elt, build_index_type (size_int (n - 1)));
801 /* Return a reference type node referring to TO_TYPE. If RVAL is
802 true, return an rvalue reference type, otherwise return an lvalue
803 reference type. If a type node exists, reuse it, otherwise create
806 cp_build_reference_type (tree to_type, bool rval)
809 lvalue_ref = build_reference_type (to_type);
813 /* This code to create rvalue reference types is based on and tied
814 to the code creating lvalue reference types in the middle-end
815 functions build_reference_type_for_mode and build_reference_type.
817 It works by putting the rvalue reference type nodes after the
818 lvalue reference nodes in the TYPE_NEXT_REF_TO linked list, so
819 they will effectively be ignored by the middle end. */
821 for (t = lvalue_ref; (t = TYPE_NEXT_REF_TO (t)); )
822 if (TYPE_REF_IS_RVALUE (t))
825 t = build_distinct_type_copy (lvalue_ref);
827 TYPE_REF_IS_RVALUE (t) = true;
828 TYPE_NEXT_REF_TO (t) = TYPE_NEXT_REF_TO (lvalue_ref);
829 TYPE_NEXT_REF_TO (lvalue_ref) = t;
831 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
832 SET_TYPE_STRUCTURAL_EQUALITY (t);
833 else if (TYPE_CANONICAL (to_type) != to_type)
835 = cp_build_reference_type (TYPE_CANONICAL (to_type), rval);
837 TYPE_CANONICAL (t) = t;
845 /* Returns EXPR cast to rvalue reference type, like std::move. */
850 tree type = TREE_TYPE (expr);
851 gcc_assert (TREE_CODE (type) != REFERENCE_TYPE);
852 type = cp_build_reference_type (type, /*rval*/true);
853 return build_static_cast (type, expr, tf_warning_or_error);
856 /* Used by the C++ front end to build qualified array types. However,
857 the C version of this function does not properly maintain canonical
858 types (which are not used in C). */
860 c_build_qualified_type (tree type, int type_quals)
862 return cp_build_qualified_type (type, type_quals);
866 /* Make a variant of TYPE, qualified with the TYPE_QUALS. Handles
867 arrays correctly. In particular, if TYPE is an array of T's, and
868 TYPE_QUALS is non-empty, returns an array of qualified T's.
870 FLAGS determines how to deal with ill-formed qualifications. If
871 tf_ignore_bad_quals is set, then bad qualifications are dropped
872 (this is permitted if TYPE was introduced via a typedef or template
873 type parameter). If bad qualifications are dropped and tf_warning
874 is set, then a warning is issued for non-const qualifications. If
875 tf_ignore_bad_quals is not set and tf_error is not set, we
876 return error_mark_node. Otherwise, we issue an error, and ignore
879 Qualification of a reference type is valid when the reference came
880 via a typedef or template type argument. [dcl.ref] No such
881 dispensation is provided for qualifying a function type. [dcl.fct]
882 DR 295 queries this and the proposed resolution brings it into line
883 with qualifying a reference. We implement the DR. We also behave
884 in a similar manner for restricting non-pointer types. */
887 cp_build_qualified_type_real (tree type,
889 tsubst_flags_t complain)
892 int bad_quals = TYPE_UNQUALIFIED;
894 if (type == error_mark_node)
897 if (type_quals == cp_type_quals (type))
900 if (TREE_CODE (type) == ARRAY_TYPE)
902 /* In C++, the qualification really applies to the array element
903 type. Obtain the appropriately qualified element type. */
906 = cp_build_qualified_type_real (TREE_TYPE (type),
910 if (element_type == error_mark_node)
911 return error_mark_node;
913 /* See if we already have an identically qualified type. Tests
914 should be equivalent to those in check_qualified_type. */
915 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
916 if (TREE_TYPE (t) == element_type
917 && TYPE_NAME (t) == TYPE_NAME (type)
918 && TYPE_CONTEXT (t) == TYPE_CONTEXT (type)
919 && attribute_list_equal (TYPE_ATTRIBUTES (t),
920 TYPE_ATTRIBUTES (type)))
925 t = build_cplus_array_type (element_type, TYPE_DOMAIN (type));
927 /* Keep the typedef name. */
928 if (TYPE_NAME (t) != TYPE_NAME (type))
930 t = build_variant_type_copy (t);
931 TYPE_NAME (t) = TYPE_NAME (type);
935 /* Even if we already had this variant, we update
936 TYPE_NEEDS_CONSTRUCTING and TYPE_HAS_NONTRIVIAL_DESTRUCTOR in case
937 they changed since the variant was originally created.
939 This seems hokey; if there is some way to use a previous
940 variant *without* coming through here,
941 TYPE_NEEDS_CONSTRUCTING will never be updated. */
942 TYPE_NEEDS_CONSTRUCTING (t)
943 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (element_type));
944 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
945 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (element_type));
948 else if (TYPE_PTRMEMFUNC_P (type))
950 /* For a pointer-to-member type, we can't just return a
951 cv-qualified version of the RECORD_TYPE. If we do, we
952 haven't changed the field that contains the actual pointer to
953 a method, and so TYPE_PTRMEMFUNC_FN_TYPE will be wrong. */
956 t = TYPE_PTRMEMFUNC_FN_TYPE (type);
957 t = cp_build_qualified_type_real (t, type_quals, complain);
958 return build_ptrmemfunc_type (t);
960 else if (TREE_CODE (type) == TYPE_PACK_EXPANSION)
962 tree t = PACK_EXPANSION_PATTERN (type);
964 t = cp_build_qualified_type_real (t, type_quals, complain);
965 return make_pack_expansion (t);
968 /* A reference or method type shall not be cv-qualified.
969 [dcl.ref], [dcl.fct]. This used to be an error, but as of DR 295
970 (in CD1) we always ignore extra cv-quals on functions. */
971 if (type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE)
972 && (TREE_CODE (type) == REFERENCE_TYPE
973 || TREE_CODE (type) == FUNCTION_TYPE
974 || TREE_CODE (type) == METHOD_TYPE))
976 if (TREE_CODE (type) == REFERENCE_TYPE)
977 bad_quals |= type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
978 type_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
981 /* But preserve any function-cv-quals on a FUNCTION_TYPE. */
982 if (TREE_CODE (type) == FUNCTION_TYPE)
983 type_quals |= type_memfn_quals (type);
985 /* A restrict-qualified type must be a pointer (or reference)
986 to object or incomplete type. */
987 if ((type_quals & TYPE_QUAL_RESTRICT)
988 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
989 && TREE_CODE (type) != TYPENAME_TYPE
990 && !POINTER_TYPE_P (type))
992 bad_quals |= TYPE_QUAL_RESTRICT;
993 type_quals &= ~TYPE_QUAL_RESTRICT;
996 if (bad_quals == TYPE_UNQUALIFIED
997 || (complain & tf_ignore_bad_quals))
999 else if (!(complain & tf_error))
1000 return error_mark_node;
1003 tree bad_type = build_qualified_type (ptr_type_node, bad_quals);
1004 error ("%qV qualifiers cannot be applied to %qT",
1008 /* Retrieve (or create) the appropriately qualified variant. */
1009 result = build_qualified_type (type, type_quals);
1011 /* If this was a pointer-to-method type, and we just made a copy,
1012 then we need to unshare the record that holds the cached
1013 pointer-to-member-function type, because these will be distinct
1014 between the unqualified and qualified types. */
1016 && TREE_CODE (type) == POINTER_TYPE
1017 && TREE_CODE (TREE_TYPE (type)) == METHOD_TYPE
1018 && TYPE_LANG_SPECIFIC (result) == TYPE_LANG_SPECIFIC (type))
1019 TYPE_LANG_SPECIFIC (result) = NULL;
1021 /* We may also have ended up building a new copy of the canonical
1022 type of a pointer-to-method type, which could have the same
1023 sharing problem described above. */
1024 if (TYPE_CANONICAL (result) != TYPE_CANONICAL (type)
1025 && TREE_CODE (type) == POINTER_TYPE
1026 && TREE_CODE (TREE_TYPE (type)) == METHOD_TYPE
1027 && (TYPE_LANG_SPECIFIC (TYPE_CANONICAL (result))
1028 == TYPE_LANG_SPECIFIC (TYPE_CANONICAL (type))))
1029 TYPE_LANG_SPECIFIC (TYPE_CANONICAL (result)) = NULL;
1034 /* Return TYPE with const and volatile removed. */
1037 cv_unqualified (tree type)
1041 if (type == error_mark_node)
1044 quals = cp_type_quals (type);
1045 quals &= ~(TYPE_QUAL_CONST|TYPE_QUAL_VOLATILE);
1046 return cp_build_qualified_type (type, quals);
1049 /* Builds a qualified variant of T that is not a typedef variant.
1050 E.g. consider the following declarations:
1051 typedef const int ConstInt;
1052 typedef ConstInt* PtrConstInt;
1053 If T is PtrConstInt, this function returns a type representing
1055 In other words, if T is a typedef, the function returns the underlying type.
1056 The cv-qualification and attributes of the type returned match the
1058 They will always be compatible types.
1059 The returned type is built so that all of its subtypes
1060 recursively have their typedefs stripped as well.
1062 This is different from just returning TYPE_CANONICAL (T)
1063 Because of several reasons:
1064 * If T is a type that needs structural equality
1065 its TYPE_CANONICAL (T) will be NULL.
1066 * TYPE_CANONICAL (T) desn't carry type attributes
1067 and looses template parameter names. */
1070 strip_typedefs (tree t)
1072 tree result = NULL, type = NULL, t0 = NULL;
1074 if (!t || t == error_mark_node || t == TYPE_CANONICAL (t))
1077 gcc_assert (TYPE_P (t));
1079 switch (TREE_CODE (t))
1082 type = strip_typedefs (TREE_TYPE (t));
1083 result = build_pointer_type (type);
1085 case REFERENCE_TYPE:
1086 type = strip_typedefs (TREE_TYPE (t));
1087 result = cp_build_reference_type (type, TYPE_REF_IS_RVALUE (t));
1090 t0 = strip_typedefs (TYPE_OFFSET_BASETYPE (t));
1091 type = strip_typedefs (TREE_TYPE (t));
1092 result = build_offset_type (t0, type);
1095 if (TYPE_PTRMEMFUNC_P (t))
1097 t0 = strip_typedefs (TYPE_PTRMEMFUNC_FN_TYPE (t));
1098 result = build_ptrmemfunc_type (t0);
1102 type = strip_typedefs (TREE_TYPE (t));
1103 t0 = strip_typedefs (TYPE_DOMAIN (t));;
1104 result = build_cplus_array_type (type, t0);
1109 tree arg_types = NULL, arg_node, arg_type;
1110 for (arg_node = TYPE_ARG_TYPES (t);
1112 arg_node = TREE_CHAIN (arg_node))
1114 if (arg_node == void_list_node)
1116 arg_type = strip_typedefs (TREE_VALUE (arg_node));
1117 gcc_assert (arg_type);
1120 tree_cons (TREE_PURPOSE (arg_node), arg_type, arg_types);
1124 arg_types = nreverse (arg_types);
1126 /* A list of parameters not ending with an ellipsis
1127 must end with void_list_node. */
1129 arg_types = chainon (arg_types, void_list_node);
1131 type = strip_typedefs (TREE_TYPE (t));
1132 if (TREE_CODE (t) == METHOD_TYPE)
1134 tree class_type = TREE_TYPE (TREE_VALUE (arg_types));
1135 gcc_assert (class_type);
1137 build_method_type_directly (class_type, type,
1138 TREE_CHAIN (arg_types));
1142 result = build_function_type (type,
1144 result = apply_memfn_quals (result, type_memfn_quals (t));
1147 if (TYPE_RAISES_EXCEPTIONS (t))
1148 result = build_exception_variant (result,
1149 TYPE_RAISES_EXCEPTIONS (t));
1153 result = make_typename_type (strip_typedefs (TYPE_CONTEXT (t)),
1154 TYPENAME_TYPE_FULLNAME (t),
1155 typename_type, tf_none);
1162 result = TYPE_MAIN_VARIANT (t);
1163 if (TYPE_ATTRIBUTES (t))
1164 result = cp_build_type_attribute_variant (result, TYPE_ATTRIBUTES (t));
1165 return cp_build_qualified_type (result, cp_type_quals (t));
1168 /* Makes a copy of BINFO and TYPE, which is to be inherited into a
1169 graph dominated by T. If BINFO is NULL, TYPE is a dependent base,
1170 and we do a shallow copy. If BINFO is non-NULL, we do a deep copy.
1171 VIRT indicates whether TYPE is inherited virtually or not.
1172 IGO_PREV points at the previous binfo of the inheritance graph
1173 order chain. The newly copied binfo's TREE_CHAIN forms this
1176 The CLASSTYPE_VBASECLASSES vector of T is constructed in the
1177 correct order. That is in the order the bases themselves should be
1180 The BINFO_INHERITANCE of a virtual base class points to the binfo
1181 of the most derived type. ??? We could probably change this so that
1182 BINFO_INHERITANCE becomes synonymous with BINFO_PRIMARY, and hence
1183 remove a field. They currently can only differ for primary virtual
1187 copy_binfo (tree binfo, tree type, tree t, tree *igo_prev, int virt)
1193 /* See if we've already made this virtual base. */
1194 new_binfo = binfo_for_vbase (type, t);
1199 new_binfo = make_tree_binfo (binfo ? BINFO_N_BASE_BINFOS (binfo) : 0);
1200 BINFO_TYPE (new_binfo) = type;
1202 /* Chain it into the inheritance graph. */
1203 TREE_CHAIN (*igo_prev) = new_binfo;
1204 *igo_prev = new_binfo;
1211 gcc_assert (!BINFO_DEPENDENT_BASE_P (binfo));
1212 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), type));
1214 BINFO_OFFSET (new_binfo) = BINFO_OFFSET (binfo);
1215 BINFO_VIRTUALS (new_binfo) = BINFO_VIRTUALS (binfo);
1217 /* We do not need to copy the accesses, as they are read only. */
1218 BINFO_BASE_ACCESSES (new_binfo) = BINFO_BASE_ACCESSES (binfo);
1220 /* Recursively copy base binfos of BINFO. */
1221 for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++)
1223 tree new_base_binfo;
1225 gcc_assert (!BINFO_DEPENDENT_BASE_P (base_binfo));
1226 new_base_binfo = copy_binfo (base_binfo, BINFO_TYPE (base_binfo),
1228 BINFO_VIRTUAL_P (base_binfo));
1230 if (!BINFO_INHERITANCE_CHAIN (new_base_binfo))
1231 BINFO_INHERITANCE_CHAIN (new_base_binfo) = new_binfo;
1232 BINFO_BASE_APPEND (new_binfo, new_base_binfo);
1236 BINFO_DEPENDENT_BASE_P (new_binfo) = 1;
1240 /* Push it onto the list after any virtual bases it contains
1241 will have been pushed. */
1242 VEC_quick_push (tree, CLASSTYPE_VBASECLASSES (t), new_binfo);
1243 BINFO_VIRTUAL_P (new_binfo) = 1;
1244 BINFO_INHERITANCE_CHAIN (new_binfo) = TYPE_BINFO (t);
1250 /* Hashing of lists so that we don't make duplicates.
1251 The entry point is `list_hash_canon'. */
1253 /* Now here is the hash table. When recording a list, it is added
1254 to the slot whose index is the hash code mod the table size.
1255 Note that the hash table is used for several kinds of lists.
1256 While all these live in the same table, they are completely independent,
1257 and the hash code is computed differently for each of these. */
1259 static GTY ((param_is (union tree_node))) htab_t list_hash_table;
1268 /* Compare ENTRY (an entry in the hash table) with DATA (a list_proxy
1269 for a node we are thinking about adding). */
1272 list_hash_eq (const void* entry, const void* data)
1274 const_tree const t = (const_tree) entry;
1275 const struct list_proxy *const proxy = (const struct list_proxy *) data;
1277 return (TREE_VALUE (t) == proxy->value
1278 && TREE_PURPOSE (t) == proxy->purpose
1279 && TREE_CHAIN (t) == proxy->chain);
1282 /* Compute a hash code for a list (chain of TREE_LIST nodes
1283 with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the
1284 TREE_COMMON slots), by adding the hash codes of the individual entries. */
1287 list_hash_pieces (tree purpose, tree value, tree chain)
1289 hashval_t hashcode = 0;
1292 hashcode += TREE_HASH (chain);
1295 hashcode += TREE_HASH (value);
1299 hashcode += TREE_HASH (purpose);
1305 /* Hash an already existing TREE_LIST. */
1308 list_hash (const void* p)
1310 const_tree const t = (const_tree) p;
1311 return list_hash_pieces (TREE_PURPOSE (t),
1316 /* Given list components PURPOSE, VALUE, AND CHAIN, return the canonical
1317 object for an identical list if one already exists. Otherwise, build a
1318 new one, and record it as the canonical object. */
1321 hash_tree_cons (tree purpose, tree value, tree chain)
1325 struct list_proxy proxy;
1327 /* Hash the list node. */
1328 hashcode = list_hash_pieces (purpose, value, chain);
1329 /* Create a proxy for the TREE_LIST we would like to create. We
1330 don't actually create it so as to avoid creating garbage. */
1331 proxy.purpose = purpose;
1332 proxy.value = value;
1333 proxy.chain = chain;
1334 /* See if it is already in the table. */
1335 slot = htab_find_slot_with_hash (list_hash_table, &proxy, hashcode,
1337 /* If not, create a new node. */
1339 *slot = tree_cons (purpose, value, chain);
1340 return (tree) *slot;
1343 /* Constructor for hashed lists. */
1346 hash_tree_chain (tree value, tree chain)
1348 return hash_tree_cons (NULL_TREE, value, chain);
1352 debug_binfo (tree elem)
1357 fprintf (stderr, "type \"%s\", offset = " HOST_WIDE_INT_PRINT_DEC
1359 TYPE_NAME_STRING (BINFO_TYPE (elem)),
1360 TREE_INT_CST_LOW (BINFO_OFFSET (elem)));
1361 debug_tree (BINFO_TYPE (elem));
1362 if (BINFO_VTABLE (elem))
1363 fprintf (stderr, "vtable decl \"%s\"\n",
1364 IDENTIFIER_POINTER (DECL_NAME (get_vtbl_decl_for_binfo (elem))));
1366 fprintf (stderr, "no vtable decl yet\n");
1367 fprintf (stderr, "virtuals:\n");
1368 virtuals = BINFO_VIRTUALS (elem);
1373 tree fndecl = TREE_VALUE (virtuals);
1374 fprintf (stderr, "%s [%ld =? %ld]\n",
1375 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl)),
1376 (long) n, (long) TREE_INT_CST_LOW (DECL_VINDEX (fndecl)));
1378 virtuals = TREE_CHAIN (virtuals);
1382 /* Build a representation for the qualified name SCOPE::NAME. TYPE is
1383 the type of the result expression, if known, or NULL_TREE if the
1384 resulting expression is type-dependent. If TEMPLATE_P is true,
1385 NAME is known to be a template because the user explicitly used the
1386 "template" keyword after the "::".
1388 All SCOPE_REFs should be built by use of this function. */
1391 build_qualified_name (tree type, tree scope, tree name, bool template_p)
1394 if (type == error_mark_node
1395 || scope == error_mark_node
1396 || name == error_mark_node)
1397 return error_mark_node;
1398 t = build2 (SCOPE_REF, type, scope, name);
1399 QUALIFIED_NAME_IS_TEMPLATE (t) = template_p;
1401 t = convert_from_reference (t);
1405 /* Returns nonzero if X is an expression for a (possibly overloaded)
1406 function. If "f" is a function or function template, "f", "c->f",
1407 "c.f", "C::f", and "f<int>" will all be considered possibly
1408 overloaded functions. Returns 2 if the function is actually
1409 overloaded, i.e., if it is impossible to know the type of the
1410 function without performing overload resolution. */
1413 is_overloaded_fn (tree x)
1415 /* A baselink is also considered an overloaded function. */
1416 if (TREE_CODE (x) == OFFSET_REF
1417 || TREE_CODE (x) == COMPONENT_REF)
1418 x = TREE_OPERAND (x, 1);
1420 x = BASELINK_FUNCTIONS (x);
1421 if (TREE_CODE (x) == TEMPLATE_ID_EXPR)
1422 x = TREE_OPERAND (x, 0);
1423 if (DECL_FUNCTION_TEMPLATE_P (OVL_CURRENT (x))
1424 || (TREE_CODE (x) == OVERLOAD && OVL_CHAIN (x)))
1426 return (TREE_CODE (x) == FUNCTION_DECL
1427 || TREE_CODE (x) == OVERLOAD);
1430 /* Returns true iff X is an expression for an overloaded function
1431 whose type cannot be known without performing overload
1435 really_overloaded_fn (tree x)
1437 return is_overloaded_fn (x) == 2;
1443 gcc_assert (is_overloaded_fn (from));
1444 /* A baselink is also considered an overloaded function. */
1445 if (TREE_CODE (from) == OFFSET_REF
1446 || TREE_CODE (from) == COMPONENT_REF)
1447 from = TREE_OPERAND (from, 1);
1448 if (BASELINK_P (from))
1449 from = BASELINK_FUNCTIONS (from);
1450 if (TREE_CODE (from) == TEMPLATE_ID_EXPR)
1451 from = TREE_OPERAND (from, 0);
1456 get_first_fn (tree from)
1458 return OVL_CURRENT (get_fns (from));
1461 /* Return a new OVL node, concatenating it with the old one. */
1464 ovl_cons (tree decl, tree chain)
1466 tree result = make_node (OVERLOAD);
1467 TREE_TYPE (result) = unknown_type_node;
1468 OVL_FUNCTION (result) = decl;
1469 TREE_CHAIN (result) = chain;
1474 /* Build a new overloaded function. If this is the first one,
1475 just return it; otherwise, ovl_cons the _DECLs */
1478 build_overload (tree decl, tree chain)
1480 if (! chain && TREE_CODE (decl) != TEMPLATE_DECL)
1482 return ovl_cons (decl, chain);
1486 #define PRINT_RING_SIZE 4
1489 cxx_printable_name_internal (tree decl, int v, bool translate)
1491 static unsigned int uid_ring[PRINT_RING_SIZE];
1492 static char *print_ring[PRINT_RING_SIZE];
1493 static bool trans_ring[PRINT_RING_SIZE];
1494 static int ring_counter;
1497 /* Only cache functions. */
1499 || TREE_CODE (decl) != FUNCTION_DECL
1500 || DECL_LANG_SPECIFIC (decl) == 0)
1501 return lang_decl_name (decl, v, translate);
1503 /* See if this print name is lying around. */
1504 for (i = 0; i < PRINT_RING_SIZE; i++)
1505 if (uid_ring[i] == DECL_UID (decl) && translate == trans_ring[i])
1506 /* yes, so return it. */
1507 return print_ring[i];
1509 if (++ring_counter == PRINT_RING_SIZE)
1512 if (current_function_decl != NULL_TREE)
1514 /* There may be both translated and untranslated versions of the
1516 for (i = 0; i < 2; i++)
1518 if (uid_ring[ring_counter] == DECL_UID (current_function_decl))
1520 if (ring_counter == PRINT_RING_SIZE)
1523 gcc_assert (uid_ring[ring_counter] != DECL_UID (current_function_decl));
1526 free (print_ring[ring_counter]);
1528 print_ring[ring_counter] = xstrdup (lang_decl_name (decl, v, translate));
1529 uid_ring[ring_counter] = DECL_UID (decl);
1530 trans_ring[ring_counter] = translate;
1531 return print_ring[ring_counter];
1535 cxx_printable_name (tree decl, int v)
1537 return cxx_printable_name_internal (decl, v, false);
1541 cxx_printable_name_translate (tree decl, int v)
1543 return cxx_printable_name_internal (decl, v, true);
1546 /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions
1547 listed in RAISES. */
1550 build_exception_variant (tree type, tree raises)
1555 if (comp_except_specs (raises, TYPE_RAISES_EXCEPTIONS (type), ce_exact))
1558 type_quals = TYPE_QUALS (type);
1559 for (v = TYPE_MAIN_VARIANT (type); v; v = TYPE_NEXT_VARIANT (v))
1560 if (check_qualified_type (v, type, type_quals)
1561 && comp_except_specs (raises, TYPE_RAISES_EXCEPTIONS (v), ce_exact))
1564 /* Need to build a new variant. */
1565 v = build_variant_type_copy (type);
1566 TYPE_RAISES_EXCEPTIONS (v) = raises;
1570 /* Given a TEMPLATE_TEMPLATE_PARM node T, create a new
1571 BOUND_TEMPLATE_TEMPLATE_PARM bound with NEWARGS as its template
1575 bind_template_template_parm (tree t, tree newargs)
1577 tree decl = TYPE_NAME (t);
1580 t2 = cxx_make_type (BOUND_TEMPLATE_TEMPLATE_PARM);
1581 decl = build_decl (input_location,
1582 TYPE_DECL, DECL_NAME (decl), NULL_TREE);
1584 /* These nodes have to be created to reflect new TYPE_DECL and template
1586 TEMPLATE_TYPE_PARM_INDEX (t2) = copy_node (TEMPLATE_TYPE_PARM_INDEX (t));
1587 TEMPLATE_PARM_DECL (TEMPLATE_TYPE_PARM_INDEX (t2)) = decl;
1588 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2)
1589 = build_template_info (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t), newargs);
1591 TREE_TYPE (decl) = t2;
1592 TYPE_NAME (t2) = decl;
1593 TYPE_STUB_DECL (t2) = decl;
1595 SET_TYPE_STRUCTURAL_EQUALITY (t2);
1600 /* Called from count_trees via walk_tree. */
1603 count_trees_r (tree *tp, int *walk_subtrees, void *data)
1613 /* Debugging function for measuring the rough complexity of a tree
1617 count_trees (tree t)
1620 cp_walk_tree_without_duplicates (&t, count_trees_r, &n_trees);
1624 /* Called from verify_stmt_tree via walk_tree. */
1627 verify_stmt_tree_r (tree* tp,
1628 int* walk_subtrees ATTRIBUTE_UNUSED ,
1632 htab_t *statements = (htab_t *) data;
1635 if (!STATEMENT_CODE_P (TREE_CODE (t)))
1638 /* If this statement is already present in the hash table, then
1639 there is a circularity in the statement tree. */
1640 gcc_assert (!htab_find (*statements, t));
1642 slot = htab_find_slot (*statements, t, INSERT);
1648 /* Debugging function to check that the statement T has not been
1649 corrupted. For now, this function simply checks that T contains no
1653 verify_stmt_tree (tree t)
1656 statements = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
1657 cp_walk_tree (&t, verify_stmt_tree_r, &statements, NULL);
1658 htab_delete (statements);
1661 /* Check if the type T depends on a type with no linkage and if so, return
1662 it. If RELAXED_P then do not consider a class type declared within
1663 a vague-linkage function to have no linkage. */
1666 no_linkage_check (tree t, bool relaxed_p)
1670 /* There's no point in checking linkage on template functions; we
1671 can't know their complete types. */
1672 if (processing_template_decl)
1675 switch (TREE_CODE (t))
1678 if (TYPE_PTRMEMFUNC_P (t))
1680 /* Lambda types that don't have mangling scope have no linkage. We
1681 check CLASSTYPE_LAMBDA_EXPR here rather than LAMBDA_TYPE_P because
1682 when we get here from pushtag none of the lambda information is
1683 set up yet, so we want to assume that the lambda has linkage and
1684 fix it up later if not. */
1685 if (CLASSTYPE_LAMBDA_EXPR (t)
1686 && LAMBDA_TYPE_EXTRA_SCOPE (t) == NULL_TREE)
1690 if (!CLASS_TYPE_P (t))
1694 /* Only treat anonymous types as having no linkage if they're at
1695 namespace scope. This is core issue 966. */
1696 if (TYPE_ANONYMOUS_P (t) && TYPE_NAMESPACE_SCOPE_P (t))
1699 for (r = CP_TYPE_CONTEXT (t); ; )
1701 /* If we're a nested type of a !TREE_PUBLIC class, we might not
1702 have linkage, or we might just be in an anonymous namespace.
1703 If we're in a TREE_PUBLIC class, we have linkage. */
1704 if (TYPE_P (r) && !TREE_PUBLIC (TYPE_NAME (r)))
1705 return no_linkage_check (TYPE_CONTEXT (t), relaxed_p);
1706 else if (TREE_CODE (r) == FUNCTION_DECL)
1708 if (!relaxed_p || !vague_linkage_p (r))
1711 r = CP_DECL_CONTEXT (r);
1721 case REFERENCE_TYPE:
1722 return no_linkage_check (TREE_TYPE (t), relaxed_p);
1726 r = no_linkage_check (TYPE_PTRMEM_POINTED_TO_TYPE (t),
1730 return no_linkage_check (TYPE_PTRMEM_CLASS_TYPE (t), relaxed_p);
1733 r = no_linkage_check (TYPE_METHOD_BASETYPE (t), relaxed_p);
1740 for (parm = TYPE_ARG_TYPES (t);
1741 parm && parm != void_list_node;
1742 parm = TREE_CHAIN (parm))
1744 r = no_linkage_check (TREE_VALUE (parm), relaxed_p);
1748 return no_linkage_check (TREE_TYPE (t), relaxed_p);
1756 #ifdef GATHER_STATISTICS
1757 extern int depth_reached;
1761 cxx_print_statistics (void)
1763 print_search_statistics ();
1764 print_class_statistics ();
1765 print_template_statistics ();
1766 #ifdef GATHER_STATISTICS
1767 fprintf (stderr, "maximum template instantiation depth reached: %d\n",
1772 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1773 (which is an ARRAY_TYPE). This counts only elements of the top
1777 array_type_nelts_top (tree type)
1779 return fold_build2_loc (input_location,
1780 PLUS_EXPR, sizetype,
1781 array_type_nelts (type),
1785 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1786 (which is an ARRAY_TYPE). This one is a recursive count of all
1787 ARRAY_TYPEs that are clumped together. */
1790 array_type_nelts_total (tree type)
1792 tree sz = array_type_nelts_top (type);
1793 type = TREE_TYPE (type);
1794 while (TREE_CODE (type) == ARRAY_TYPE)
1796 tree n = array_type_nelts_top (type);
1797 sz = fold_build2_loc (input_location,
1798 MULT_EXPR, sizetype, sz, n);
1799 type = TREE_TYPE (type);
1804 /* Called from break_out_target_exprs via mapcar. */
1807 bot_manip (tree* tp, int* walk_subtrees, void* data)
1809 splay_tree target_remap = ((splay_tree) data);
1812 if (!TYPE_P (t) && TREE_CONSTANT (t) && !TREE_SIDE_EFFECTS (t))
1814 /* There can't be any TARGET_EXPRs or their slot variables below
1819 if (TREE_CODE (t) == TARGET_EXPR)
1823 if (TREE_CODE (TREE_OPERAND (t, 1)) == AGGR_INIT_EXPR)
1824 u = build_cplus_new (TREE_TYPE (t), TREE_OPERAND (t, 1),
1825 tf_warning_or_error);
1827 u = build_target_expr_with_type (TREE_OPERAND (t, 1), TREE_TYPE (t),
1828 tf_warning_or_error);
1830 /* Map the old variable to the new one. */
1831 splay_tree_insert (target_remap,
1832 (splay_tree_key) TREE_OPERAND (t, 0),
1833 (splay_tree_value) TREE_OPERAND (u, 0));
1835 TREE_OPERAND (u, 1) = break_out_target_exprs (TREE_OPERAND (u, 1));
1837 /* Replace the old expression with the new version. */
1839 /* We don't have to go below this point; the recursive call to
1840 break_out_target_exprs will have handled anything below this
1846 /* Make a copy of this node. */
1847 return copy_tree_r (tp, walk_subtrees, NULL);
1850 /* Replace all remapped VAR_DECLs in T with their new equivalents.
1851 DATA is really a splay-tree mapping old variables to new
1855 bot_replace (tree* t,
1856 int* walk_subtrees ATTRIBUTE_UNUSED ,
1859 splay_tree target_remap = ((splay_tree) data);
1861 if (TREE_CODE (*t) == VAR_DECL)
1863 splay_tree_node n = splay_tree_lookup (target_remap,
1864 (splay_tree_key) *t);
1866 *t = (tree) n->value;
1872 /* When we parse a default argument expression, we may create
1873 temporary variables via TARGET_EXPRs. When we actually use the
1874 default-argument expression, we make a copy of the expression, but
1875 we must replace the temporaries with appropriate local versions. */
1878 break_out_target_exprs (tree t)
1880 static int target_remap_count;
1881 static splay_tree target_remap;
1883 if (!target_remap_count++)
1884 target_remap = splay_tree_new (splay_tree_compare_pointers,
1885 /*splay_tree_delete_key_fn=*/NULL,
1886 /*splay_tree_delete_value_fn=*/NULL);
1887 cp_walk_tree (&t, bot_manip, target_remap, NULL);
1888 cp_walk_tree (&t, bot_replace, target_remap, NULL);
1890 if (!--target_remap_count)
1892 splay_tree_delete (target_remap);
1893 target_remap = NULL;
1899 /* Similar to `build_nt', but for template definitions of dependent
1903 build_min_nt (enum tree_code code, ...)
1910 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
1914 t = make_node (code);
1915 length = TREE_CODE_LENGTH (code);
1917 for (i = 0; i < length; i++)
1919 tree x = va_arg (p, tree);
1920 TREE_OPERAND (t, i) = x;
1928 /* Similar to `build', but for template definitions. */
1931 build_min (enum tree_code code, tree tt, ...)
1938 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
1942 t = make_node (code);
1943 length = TREE_CODE_LENGTH (code);
1946 for (i = 0; i < length; i++)
1948 tree x = va_arg (p, tree);
1949 TREE_OPERAND (t, i) = x;
1950 if (x && !TYPE_P (x) && TREE_SIDE_EFFECTS (x))
1951 TREE_SIDE_EFFECTS (t) = 1;
1958 /* Similar to `build', but for template definitions of non-dependent
1959 expressions. NON_DEP is the non-dependent expression that has been
1963 build_min_non_dep (enum tree_code code, tree non_dep, ...)
1970 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
1972 va_start (p, non_dep);
1974 t = make_node (code);
1975 length = TREE_CODE_LENGTH (code);
1976 TREE_TYPE (t) = TREE_TYPE (non_dep);
1977 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (non_dep);
1979 for (i = 0; i < length; i++)
1981 tree x = va_arg (p, tree);
1982 TREE_OPERAND (t, i) = x;
1985 if (code == COMPOUND_EXPR && TREE_CODE (non_dep) != COMPOUND_EXPR)
1986 /* This should not be considered a COMPOUND_EXPR, because it
1987 resolves to an overload. */
1988 COMPOUND_EXPR_OVERLOADED (t) = 1;
1994 /* Similar to `build_nt_call_vec', but for template definitions of
1995 non-dependent expressions. NON_DEP is the non-dependent expression
1996 that has been built. */
1999 build_min_non_dep_call_vec (tree non_dep, tree fn, VEC(tree,gc) *argvec)
2001 tree t = build_nt_call_vec (fn, argvec);
2002 TREE_TYPE (t) = TREE_TYPE (non_dep);
2003 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (non_dep);
2008 get_type_decl (tree t)
2010 if (TREE_CODE (t) == TYPE_DECL)
2013 return TYPE_STUB_DECL (t);
2014 gcc_assert (t == error_mark_node);
2018 /* Returns the namespace that contains DECL, whether directly or
2022 decl_namespace_context (tree decl)
2026 if (TREE_CODE (decl) == NAMESPACE_DECL)
2028 else if (TYPE_P (decl))
2029 decl = CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl));
2031 decl = CP_DECL_CONTEXT (decl);
2035 /* Returns true if decl is within an anonymous namespace, however deeply
2036 nested, or false otherwise. */
2039 decl_anon_ns_mem_p (const_tree decl)
2043 if (decl == NULL_TREE || decl == error_mark_node)
2045 if (TREE_CODE (decl) == NAMESPACE_DECL
2046 && DECL_NAME (decl) == NULL_TREE)
2048 /* Classes and namespaces inside anonymous namespaces have
2049 TREE_PUBLIC == 0, so we can shortcut the search. */
2050 else if (TYPE_P (decl))
2051 return (TREE_PUBLIC (TYPE_NAME (decl)) == 0);
2052 else if (TREE_CODE (decl) == NAMESPACE_DECL)
2053 return (TREE_PUBLIC (decl) == 0);
2055 decl = DECL_CONTEXT (decl);
2059 /* Return truthvalue of whether T1 is the same tree structure as T2.
2060 Return 1 if they are the same. Return 0 if they are different. */
2063 cp_tree_equal (tree t1, tree t2)
2065 enum tree_code code1, code2;
2072 for (code1 = TREE_CODE (t1);
2073 CONVERT_EXPR_CODE_P (code1)
2074 || code1 == NON_LVALUE_EXPR;
2075 code1 = TREE_CODE (t1))
2076 t1 = TREE_OPERAND (t1, 0);
2077 for (code2 = TREE_CODE (t2);
2078 CONVERT_EXPR_CODE_P (code2)
2079 || code1 == NON_LVALUE_EXPR;
2080 code2 = TREE_CODE (t2))
2081 t2 = TREE_OPERAND (t2, 0);
2083 /* They might have become equal now. */
2093 return TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
2094 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2);
2097 return REAL_VALUES_EQUAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
2100 return TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
2101 && !memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
2102 TREE_STRING_LENGTH (t1));
2105 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1),
2106 TREE_FIXED_CST (t2));
2109 return cp_tree_equal (TREE_REALPART (t1), TREE_REALPART (t2))
2110 && cp_tree_equal (TREE_IMAGPART (t1), TREE_IMAGPART (t2));
2113 /* We need to do this when determining whether or not two
2114 non-type pointer to member function template arguments
2116 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
2117 || CONSTRUCTOR_NELTS (t1) != CONSTRUCTOR_NELTS (t2))
2122 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t1), i, field, value)
2124 constructor_elt *elt2 = CONSTRUCTOR_ELT (t2, i);
2125 if (!cp_tree_equal (field, elt2->index)
2126 || !cp_tree_equal (value, elt2->value))
2133 if (!cp_tree_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2)))
2135 if (!cp_tree_equal (TREE_VALUE (t1), TREE_VALUE (t2)))
2137 return cp_tree_equal (TREE_CHAIN (t1), TREE_CHAIN (t2));
2140 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
2145 call_expr_arg_iterator iter1, iter2;
2146 if (!cp_tree_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2)))
2148 for (arg1 = first_call_expr_arg (t1, &iter1),
2149 arg2 = first_call_expr_arg (t2, &iter2);
2151 arg1 = next_call_expr_arg (&iter1),
2152 arg2 = next_call_expr_arg (&iter2))
2153 if (!cp_tree_equal (arg1, arg2))
2162 tree o1 = TREE_OPERAND (t1, 0);
2163 tree o2 = TREE_OPERAND (t2, 0);
2165 /* Special case: if either target is an unallocated VAR_DECL,
2166 it means that it's going to be unified with whatever the
2167 TARGET_EXPR is really supposed to initialize, so treat it
2168 as being equivalent to anything. */
2169 if (TREE_CODE (o1) == VAR_DECL && DECL_NAME (o1) == NULL_TREE
2170 && !DECL_RTL_SET_P (o1))
2172 else if (TREE_CODE (o2) == VAR_DECL && DECL_NAME (o2) == NULL_TREE
2173 && !DECL_RTL_SET_P (o2))
2175 else if (!cp_tree_equal (o1, o2))
2178 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
2181 case WITH_CLEANUP_EXPR:
2182 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
2184 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
2187 if (TREE_OPERAND (t1, 1) != TREE_OPERAND (t2, 1))
2189 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
2192 /* For comparing uses of parameters in late-specified return types
2193 with an out-of-class definition of the function, but can also come
2194 up for expressions that involve 'this' in a member function
2196 if (same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
2198 if (DECL_ARTIFICIAL (t1) ^ DECL_ARTIFICIAL (t2))
2200 if (DECL_ARTIFICIAL (t1)
2201 || (DECL_PARM_LEVEL (t1) == DECL_PARM_LEVEL (t2)
2202 && DECL_PARM_INDEX (t1) == DECL_PARM_INDEX (t2)))
2211 case IDENTIFIER_NODE:
2216 return (BASELINK_BINFO (t1) == BASELINK_BINFO (t2)
2217 && BASELINK_ACCESS_BINFO (t1) == BASELINK_ACCESS_BINFO (t2)
2218 && cp_tree_equal (BASELINK_FUNCTIONS (t1),
2219 BASELINK_FUNCTIONS (t2)));
2221 case TEMPLATE_PARM_INDEX:
2222 if (TEMPLATE_PARM_NUM_SIBLINGS (t1)
2223 != TEMPLATE_PARM_NUM_SIBLINGS (t2))
2225 return (TEMPLATE_PARM_IDX (t1) == TEMPLATE_PARM_IDX (t2)
2226 && TEMPLATE_PARM_LEVEL (t1) == TEMPLATE_PARM_LEVEL (t2)
2227 && (TEMPLATE_PARM_PARAMETER_PACK (t1)
2228 == TEMPLATE_PARM_PARAMETER_PACK (t2))
2229 && same_type_p (TREE_TYPE (TEMPLATE_PARM_DECL (t1)),
2230 TREE_TYPE (TEMPLATE_PARM_DECL (t2))));
2232 case TEMPLATE_ID_EXPR:
2237 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
2239 vec1 = TREE_OPERAND (t1, 1);
2240 vec2 = TREE_OPERAND (t2, 1);
2243 return !vec1 && !vec2;
2245 if (TREE_VEC_LENGTH (vec1) != TREE_VEC_LENGTH (vec2))
2248 for (ix = TREE_VEC_LENGTH (vec1); ix--;)
2249 if (!cp_tree_equal (TREE_VEC_ELT (vec1, ix),
2250 TREE_VEC_ELT (vec2, ix)))
2259 tree o1 = TREE_OPERAND (t1, 0);
2260 tree o2 = TREE_OPERAND (t2, 0);
2262 if (TREE_CODE (o1) != TREE_CODE (o2))
2265 return same_type_p (o1, o2);
2267 return cp_tree_equal (o1, o2);
2272 tree t1_op1, t2_op1;
2274 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
2277 t1_op1 = TREE_OPERAND (t1, 1);
2278 t2_op1 = TREE_OPERAND (t2, 1);
2279 if (TREE_CODE (t1_op1) != TREE_CODE (t2_op1))
2282 return cp_tree_equal (TREE_OPERAND (t1, 2), TREE_OPERAND (t2, 2));
2286 /* Two pointer-to-members are the same if they point to the same
2287 field or function in the same class. */
2288 if (PTRMEM_CST_MEMBER (t1) != PTRMEM_CST_MEMBER (t2))
2291 return same_type_p (PTRMEM_CST_CLASS (t1), PTRMEM_CST_CLASS (t2));
2294 if (OVL_FUNCTION (t1) != OVL_FUNCTION (t2))
2296 return cp_tree_equal (OVL_CHAIN (t1), OVL_CHAIN (t2));
2299 if (TRAIT_EXPR_KIND (t1) != TRAIT_EXPR_KIND (t2))
2301 return same_type_p (TRAIT_EXPR_TYPE1 (t1), TRAIT_EXPR_TYPE1 (t2))
2302 && same_type_p (TRAIT_EXPR_TYPE2 (t1), TRAIT_EXPR_TYPE2 (t2));
2305 case STATIC_CAST_EXPR:
2306 case REINTERPRET_CAST_EXPR:
2307 case CONST_CAST_EXPR:
2308 case DYNAMIC_CAST_EXPR:
2310 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
2312 /* Now compare operands as usual. */
2319 switch (TREE_CODE_CLASS (code1))
2323 case tcc_comparison:
2324 case tcc_expression:
2331 n = TREE_OPERAND_LENGTH (t1);
2332 if (TREE_CODE_CLASS (code1) == tcc_vl_exp
2333 && n != TREE_OPERAND_LENGTH (t2))
2336 for (i = 0; i < n; ++i)
2337 if (!cp_tree_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i)))
2344 return same_type_p (t1, t2);
2348 /* We can get here with --disable-checking. */
2352 /* The type of ARG when used as an lvalue. */
2355 lvalue_type (tree arg)
2357 tree type = TREE_TYPE (arg);
2361 /* The type of ARG for printing error messages; denote lvalues with
2365 error_type (tree arg)
2367 tree type = TREE_TYPE (arg);
2369 if (TREE_CODE (type) == ARRAY_TYPE)
2371 else if (TREE_CODE (type) == ERROR_MARK)
2373 else if (real_lvalue_p (arg))
2374 type = build_reference_type (lvalue_type (arg));
2375 else if (MAYBE_CLASS_TYPE_P (type))
2376 type = lvalue_type (arg);
2381 /* Does FUNCTION use a variable-length argument list? */
2384 varargs_function_p (const_tree function)
2386 return stdarg_p (TREE_TYPE (function));
2389 /* Returns 1 if decl is a member of a class. */
2392 member_p (const_tree decl)
2394 const_tree const ctx = DECL_CONTEXT (decl);
2395 return (ctx && TYPE_P (ctx));
2398 /* Create a placeholder for member access where we don't actually have an
2399 object that the access is against. */
2402 build_dummy_object (tree type)
2404 tree decl = build1 (NOP_EXPR, build_pointer_type (type), void_zero_node);
2405 return cp_build_indirect_ref (decl, RO_NULL, tf_warning_or_error);
2408 /* We've gotten a reference to a member of TYPE. Return *this if appropriate,
2409 or a dummy object otherwise. If BINFOP is non-0, it is filled with the
2410 binfo path from current_class_type to TYPE, or 0. */
2413 maybe_dummy_object (tree type, tree* binfop)
2417 tree current = current_nonlambda_class_type ();
2420 && (binfo = lookup_base (current, type, ba_any, NULL)))
2424 /* Reference from a nested class member function. */
2426 binfo = TYPE_BINFO (type);
2432 if (current_class_ref
2433 /* current_class_ref might not correspond to current_class_type if
2434 we're in tsubst_default_argument or a lambda-declarator; in either
2435 case, we want to use current_class_ref if it matches CONTEXT. */
2436 && (same_type_ignoring_top_level_qualifiers_p
2437 (TREE_TYPE (current_class_ref), context)))
2438 decl = current_class_ref;
2439 else if (current != current_class_type
2440 && context == nonlambda_method_basetype ())
2441 /* In a lambda, need to go through 'this' capture. */
2442 decl = (build_x_indirect_ref
2443 ((lambda_expr_this_capture
2444 (CLASSTYPE_LAMBDA_EXPR (current_class_type))),
2445 RO_NULL, tf_warning_or_error));
2447 decl = build_dummy_object (context);
2452 /* Returns 1 if OB is a placeholder object, or a pointer to one. */
2455 is_dummy_object (const_tree ob)
2457 if (TREE_CODE (ob) == INDIRECT_REF)
2458 ob = TREE_OPERAND (ob, 0);
2459 return (TREE_CODE (ob) == NOP_EXPR
2460 && TREE_OPERAND (ob, 0) == void_zero_node);
2463 /* Returns 1 iff type T is something we want to treat as a scalar type for
2464 the purpose of deciding whether it is trivial/POD/standard-layout. */
2467 scalarish_type_p (const_tree t)
2469 if (t == error_mark_node)
2472 return (SCALAR_TYPE_P (t)
2473 || TREE_CODE (t) == VECTOR_TYPE);
2476 /* Returns true iff T requires non-trivial default initialization. */
2479 type_has_nontrivial_default_init (const_tree t)
2481 t = strip_array_types (CONST_CAST_TREE (t));
2483 if (CLASS_TYPE_P (t))
2484 return TYPE_HAS_COMPLEX_DFLT (t);
2489 /* Returns true iff copying an object of type T (including via move
2490 constructor) is non-trivial. That is, T has no non-trivial copy
2491 constructors and no non-trivial move constructors. */
2494 type_has_nontrivial_copy_init (const_tree t)
2496 t = strip_array_types (CONST_CAST_TREE (t));
2498 if (CLASS_TYPE_P (t))
2500 gcc_assert (COMPLETE_TYPE_P (t));
2501 return ((TYPE_HAS_COPY_CTOR (t)
2502 && TYPE_HAS_COMPLEX_COPY_CTOR (t))
2503 || TYPE_HAS_COMPLEX_MOVE_CTOR (t));
2509 /* Returns 1 iff type T is a trivially copyable type, as defined in
2510 [basic.types] and [class]. */
2513 trivially_copyable_p (const_tree t)
2515 t = strip_array_types (CONST_CAST_TREE (t));
2517 if (CLASS_TYPE_P (t))
2518 return ((!TYPE_HAS_COPY_CTOR (t)
2519 || !TYPE_HAS_COMPLEX_COPY_CTOR (t))
2520 && !TYPE_HAS_COMPLEX_MOVE_CTOR (t)
2521 && (!TYPE_HAS_COPY_ASSIGN (t)
2522 || !TYPE_HAS_COMPLEX_COPY_ASSIGN (t))
2523 && !TYPE_HAS_COMPLEX_MOVE_ASSIGN (t)
2524 && TYPE_HAS_TRIVIAL_DESTRUCTOR (t));
2526 return scalarish_type_p (t);
2529 /* Returns 1 iff type T is a trivial type, as defined in [basic.types] and
2533 trivial_type_p (const_tree t)
2535 t = strip_array_types (CONST_CAST_TREE (t));
2537 if (CLASS_TYPE_P (t))
2538 return (TYPE_HAS_TRIVIAL_DFLT (t)
2539 && trivially_copyable_p (t));
2541 return scalarish_type_p (t);
2544 /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */
2547 pod_type_p (const_tree t)
2549 /* This CONST_CAST is okay because strip_array_types returns its
2550 argument unmodified and we assign it to a const_tree. */
2551 t = strip_array_types (CONST_CAST_TREE(t));
2553 if (!CLASS_TYPE_P (t))
2554 return scalarish_type_p (t);
2555 else if (cxx_dialect > cxx98)
2556 /* [class]/10: A POD struct is a class that is both a trivial class and a
2557 standard-layout class, and has no non-static data members of type
2558 non-POD struct, non-POD union (or array of such types).
2560 We don't need to check individual members because if a member is
2561 non-std-layout or non-trivial, the class will be too. */
2562 return (std_layout_type_p (t) && trivial_type_p (t));
2564 /* The C++98 definition of POD is different. */
2565 return !CLASSTYPE_NON_LAYOUT_POD_P (t);
2568 /* Returns true iff T is POD for the purpose of layout, as defined in the
2572 layout_pod_type_p (const_tree t)
2574 t = strip_array_types (CONST_CAST_TREE (t));
2576 if (CLASS_TYPE_P (t))
2577 return !CLASSTYPE_NON_LAYOUT_POD_P (t);
2579 return scalarish_type_p (t);
2582 /* Returns true iff T is a standard-layout type, as defined in
2586 std_layout_type_p (const_tree t)
2588 t = strip_array_types (CONST_CAST_TREE (t));
2590 if (CLASS_TYPE_P (t))
2591 return !CLASSTYPE_NON_STD_LAYOUT (t);
2593 return scalarish_type_p (t);
2596 /* Nonzero iff type T is a class template implicit specialization. */
2599 class_tmpl_impl_spec_p (const_tree t)
2601 return CLASS_TYPE_P (t) && CLASSTYPE_TEMPLATE_INSTANTIATION (t);
2604 /* Returns 1 iff zero initialization of type T means actually storing
2608 zero_init_p (const_tree t)
2610 /* This CONST_CAST is okay because strip_array_types returns its
2611 argument unmodified and we assign it to a const_tree. */
2612 t = strip_array_types (CONST_CAST_TREE(t));
2614 if (t == error_mark_node)
2617 /* NULL pointers to data members are initialized with -1. */
2618 if (TYPE_PTRMEM_P (t))
2621 /* Classes that contain types that can't be zero-initialized, cannot
2622 be zero-initialized themselves. */
2623 if (CLASS_TYPE_P (t) && CLASSTYPE_NON_ZERO_INIT_P (t))
2629 /* Table of valid C++ attributes. */
2630 const struct attribute_spec cxx_attribute_table[] =
2632 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
2633 affects_type_identity } */
2634 { "java_interface", 0, 0, false, false, false,
2635 handle_java_interface_attribute, false },
2636 { "com_interface", 0, 0, false, false, false,
2637 handle_com_interface_attribute, false },
2638 { "init_priority", 1, 1, true, false, false,
2639 handle_init_priority_attribute, false },
2640 { NULL, 0, 0, false, false, false, NULL, false }
2643 /* Handle a "java_interface" attribute; arguments as in
2644 struct attribute_spec.handler. */
2646 handle_java_interface_attribute (tree* node,
2648 tree args ATTRIBUTE_UNUSED ,
2653 || !CLASS_TYPE_P (*node)
2654 || !TYPE_FOR_JAVA (*node))
2656 error ("%qE attribute can only be applied to Java class definitions",
2658 *no_add_attrs = true;
2661 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
2662 *node = build_variant_type_copy (*node);
2663 TYPE_JAVA_INTERFACE (*node) = 1;
2668 /* Handle a "com_interface" attribute; arguments as in
2669 struct attribute_spec.handler. */
2671 handle_com_interface_attribute (tree* node,
2673 tree args ATTRIBUTE_UNUSED ,
2674 int flags ATTRIBUTE_UNUSED ,
2679 *no_add_attrs = true;
2682 || !CLASS_TYPE_P (*node)
2683 || *node != TYPE_MAIN_VARIANT (*node))
2685 warning (OPT_Wattributes, "%qE attribute can only be applied "
2686 "to class definitions", name);
2691 warning (0, "%qE is obsolete; g++ vtables are now COM-compatible by default",
2697 /* Handle an "init_priority" attribute; arguments as in
2698 struct attribute_spec.handler. */
2700 handle_init_priority_attribute (tree* node,
2703 int flags ATTRIBUTE_UNUSED ,
2706 tree initp_expr = TREE_VALUE (args);
2708 tree type = TREE_TYPE (decl);
2711 STRIP_NOPS (initp_expr);
2713 if (!initp_expr || TREE_CODE (initp_expr) != INTEGER_CST)
2715 error ("requested init_priority is not an integer constant");
2716 *no_add_attrs = true;
2720 pri = TREE_INT_CST_LOW (initp_expr);
2722 type = strip_array_types (type);
2724 if (decl == NULL_TREE
2725 || TREE_CODE (decl) != VAR_DECL
2726 || !TREE_STATIC (decl)
2727 || DECL_EXTERNAL (decl)
2728 || (TREE_CODE (type) != RECORD_TYPE
2729 && TREE_CODE (type) != UNION_TYPE)
2730 /* Static objects in functions are initialized the
2731 first time control passes through that
2732 function. This is not precise enough to pin down an
2733 init_priority value, so don't allow it. */
2734 || current_function_decl)
2736 error ("can only use %qE attribute on file-scope definitions "
2737 "of objects of class type", name);
2738 *no_add_attrs = true;
2742 if (pri > MAX_INIT_PRIORITY || pri <= 0)
2744 error ("requested init_priority is out of range");
2745 *no_add_attrs = true;
2749 /* Check for init_priorities that are reserved for
2750 language and runtime support implementations.*/
2751 if (pri <= MAX_RESERVED_INIT_PRIORITY)
2754 (0, "requested init_priority is reserved for internal use");
2757 if (SUPPORTS_INIT_PRIORITY)
2759 SET_DECL_INIT_PRIORITY (decl, pri);
2760 DECL_HAS_INIT_PRIORITY_P (decl) = 1;
2765 error ("%qE attribute is not supported on this platform", name);
2766 *no_add_attrs = true;
2771 /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the
2772 thing pointed to by the constant. */
2775 make_ptrmem_cst (tree type, tree member)
2777 tree ptrmem_cst = make_node (PTRMEM_CST);
2778 TREE_TYPE (ptrmem_cst) = type;
2779 PTRMEM_CST_MEMBER (ptrmem_cst) = member;
2783 /* Build a variant of TYPE that has the indicated ATTRIBUTES. May
2784 return an existing type if an appropriate type already exists. */
2787 cp_build_type_attribute_variant (tree type, tree attributes)
2791 new_type = build_type_attribute_variant (type, attributes);
2792 if (TREE_CODE (new_type) == FUNCTION_TYPE
2793 || TREE_CODE (new_type) == METHOD_TYPE)
2794 new_type = build_exception_variant (new_type,
2795 TYPE_RAISES_EXCEPTIONS (type));
2797 /* Making a new main variant of a class type is broken. */
2798 gcc_assert (!CLASS_TYPE_P (type) || new_type == type);
2803 /* Return TRUE if TYPE1 and TYPE2 are identical for type hashing purposes.
2804 Called only after doing all language independent checks. Only
2805 to check TYPE_RAISES_EXCEPTIONS for FUNCTION_TYPE, the rest is already
2806 compared in type_hash_eq. */
2809 cxx_type_hash_eq (const_tree typea, const_tree typeb)
2811 gcc_assert (TREE_CODE (typea) == FUNCTION_TYPE
2812 || TREE_CODE (typea) == METHOD_TYPE);
2814 return comp_except_specs (TYPE_RAISES_EXCEPTIONS (typea),
2815 TYPE_RAISES_EXCEPTIONS (typeb), ce_exact);
2818 /* Apply FUNC to all language-specific sub-trees of TP in a pre-order
2819 traversal. Called from walk_tree. */
2822 cp_walk_subtrees (tree *tp, int *walk_subtrees_p, walk_tree_fn func,
2823 void *data, struct pointer_set_t *pset)
2825 enum tree_code code = TREE_CODE (*tp);
2828 #define WALK_SUBTREE(NODE) \
2831 result = cp_walk_tree (&(NODE), func, data, pset); \
2832 if (result) goto out; \
2836 /* Not one of the easy cases. We must explicitly go through the
2842 case TEMPLATE_TEMPLATE_PARM:
2843 case BOUND_TEMPLATE_TEMPLATE_PARM:
2844 case UNBOUND_CLASS_TEMPLATE:
2845 case TEMPLATE_PARM_INDEX:
2846 case TEMPLATE_TYPE_PARM:
2849 case UNDERLYING_TYPE:
2850 /* None of these have subtrees other than those already walked
2852 *walk_subtrees_p = 0;
2856 WALK_SUBTREE (BASELINK_FUNCTIONS (*tp));
2857 *walk_subtrees_p = 0;
2861 WALK_SUBTREE (TREE_TYPE (*tp));
2862 *walk_subtrees_p = 0;
2866 WALK_SUBTREE (TREE_PURPOSE (*tp));
2870 WALK_SUBTREE (OVL_FUNCTION (*tp));
2871 WALK_SUBTREE (OVL_CHAIN (*tp));
2872 *walk_subtrees_p = 0;
2876 WALK_SUBTREE (DECL_NAME (*tp));
2877 WALK_SUBTREE (USING_DECL_SCOPE (*tp));
2878 WALK_SUBTREE (USING_DECL_DECLS (*tp));
2879 *walk_subtrees_p = 0;
2883 if (TYPE_PTRMEMFUNC_P (*tp))
2884 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (*tp));
2887 case TYPE_ARGUMENT_PACK:
2888 case NONTYPE_ARGUMENT_PACK:
2890 tree args = ARGUMENT_PACK_ARGS (*tp);
2891 int i, len = TREE_VEC_LENGTH (args);
2892 for (i = 0; i < len; i++)
2893 WALK_SUBTREE (TREE_VEC_ELT (args, i));
2897 case TYPE_PACK_EXPANSION:
2898 WALK_SUBTREE (TREE_TYPE (*tp));
2899 *walk_subtrees_p = 0;
2902 case EXPR_PACK_EXPANSION:
2903 WALK_SUBTREE (TREE_OPERAND (*tp, 0));
2904 *walk_subtrees_p = 0;
2908 case REINTERPRET_CAST_EXPR:
2909 case STATIC_CAST_EXPR:
2910 case CONST_CAST_EXPR:
2911 case DYNAMIC_CAST_EXPR:
2912 if (TREE_TYPE (*tp))
2913 WALK_SUBTREE (TREE_TYPE (*tp));
2917 for (i = 0; i < TREE_CODE_LENGTH (TREE_CODE (*tp)); ++i)
2918 WALK_SUBTREE (TREE_OPERAND (*tp, i));
2920 *walk_subtrees_p = 0;
2924 WALK_SUBTREE (TRAIT_EXPR_TYPE1 (*tp));
2925 WALK_SUBTREE (TRAIT_EXPR_TYPE2 (*tp));
2926 *walk_subtrees_p = 0;
2930 WALK_SUBTREE (DECLTYPE_TYPE_EXPR (*tp));
2931 *walk_subtrees_p = 0;
2939 /* We didn't find what we were looking for. */
2946 /* Like save_expr, but for C++. */
2949 cp_save_expr (tree expr)
2951 /* There is no reason to create a SAVE_EXPR within a template; if
2952 needed, we can create the SAVE_EXPR when instantiating the
2953 template. Furthermore, the middle-end cannot handle C++-specific
2955 if (processing_template_decl)
2957 return save_expr (expr);
2960 /* Initialize tree.c. */
2965 list_hash_table = htab_create_ggc (31, list_hash, list_hash_eq, NULL);
2968 /* Returns the kind of special function that DECL (a FUNCTION_DECL)
2969 is. Note that sfk_none is zero, so this function can be used as a
2970 predicate to test whether or not DECL is a special function. */
2972 special_function_kind
2973 special_function_p (const_tree decl)
2975 /* Rather than doing all this stuff with magic names, we should
2976 probably have a field of type `special_function_kind' in
2977 DECL_LANG_SPECIFIC. */
2978 if (DECL_COPY_CONSTRUCTOR_P (decl))
2979 return sfk_copy_constructor;
2980 if (DECL_MOVE_CONSTRUCTOR_P (decl))
2981 return sfk_move_constructor;
2982 if (DECL_CONSTRUCTOR_P (decl))
2983 return sfk_constructor;
2984 if (DECL_OVERLOADED_OPERATOR_P (decl) == NOP_EXPR)
2986 if (copy_fn_p (decl))
2987 return sfk_copy_assignment;
2988 if (move_fn_p (decl))
2989 return sfk_move_assignment;
2991 if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl))
2992 return sfk_destructor;
2993 if (DECL_COMPLETE_DESTRUCTOR_P (decl))
2994 return sfk_complete_destructor;
2995 if (DECL_BASE_DESTRUCTOR_P (decl))
2996 return sfk_base_destructor;
2997 if (DECL_DELETING_DESTRUCTOR_P (decl))
2998 return sfk_deleting_destructor;
2999 if (DECL_CONV_FN_P (decl))
3000 return sfk_conversion;
3005 /* Returns nonzero if TYPE is a character type, including wchar_t. */
3008 char_type_p (tree type)
3010 return (same_type_p (type, char_type_node)
3011 || same_type_p (type, unsigned_char_type_node)
3012 || same_type_p (type, signed_char_type_node)
3013 || same_type_p (type, char16_type_node)
3014 || same_type_p (type, char32_type_node)
3015 || same_type_p (type, wchar_type_node));
3018 /* Returns the kind of linkage associated with the indicated DECL. Th
3019 value returned is as specified by the language standard; it is
3020 independent of implementation details regarding template
3021 instantiation, etc. For example, it is possible that a declaration
3022 to which this function assigns external linkage would not show up
3023 as a global symbol when you run `nm' on the resulting object file. */
3026 decl_linkage (tree decl)
3028 /* This function doesn't attempt to calculate the linkage from first
3029 principles as given in [basic.link]. Instead, it makes use of
3030 the fact that we have already set TREE_PUBLIC appropriately, and
3031 then handles a few special cases. Ideally, we would calculate
3032 linkage first, and then transform that into a concrete
3035 /* Things that don't have names have no linkage. */
3036 if (!DECL_NAME (decl))
3039 /* Fields have no linkage. */
3040 if (TREE_CODE (decl) == FIELD_DECL)
3043 /* Things that are TREE_PUBLIC have external linkage. */
3044 if (TREE_PUBLIC (decl))
3047 if (TREE_CODE (decl) == NAMESPACE_DECL)
3050 /* Linkage of a CONST_DECL depends on the linkage of the enumeration
3052 if (TREE_CODE (decl) == CONST_DECL)
3053 return decl_linkage (TYPE_NAME (TREE_TYPE (decl)));
3055 /* Some things that are not TREE_PUBLIC have external linkage, too.
3056 For example, on targets that don't have weak symbols, we make all
3057 template instantiations have internal linkage (in the object
3058 file), but the symbols should still be treated as having external
3059 linkage from the point of view of the language. */
3060 if ((TREE_CODE (decl) == FUNCTION_DECL
3061 || TREE_CODE (decl) == VAR_DECL)
3062 && DECL_COMDAT (decl))
3065 /* Things in local scope do not have linkage, if they don't have
3067 if (decl_function_context (decl))
3070 /* Members of the anonymous namespace also have TREE_PUBLIC unset, but
3071 are considered to have external linkage for language purposes. DECLs
3072 really meant to have internal linkage have DECL_THIS_STATIC set. */
3073 if (TREE_CODE (decl) == TYPE_DECL)
3075 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == FUNCTION_DECL)
3077 if (!DECL_THIS_STATIC (decl))
3080 /* Static data members and static member functions from classes
3081 in anonymous namespace also don't have TREE_PUBLIC set. */
3082 if (DECL_CLASS_CONTEXT (decl))
3086 /* Everything else has internal linkage. */
3090 /* Returns the storage duration of the object or reference associated with
3091 the indicated DECL, which should be a VAR_DECL or PARM_DECL. */
3094 decl_storage_duration (tree decl)
3096 if (TREE_CODE (decl) == PARM_DECL)
3098 if (TREE_CODE (decl) == FUNCTION_DECL)
3100 gcc_assert (TREE_CODE (decl) == VAR_DECL);
3101 if (!TREE_STATIC (decl)
3102 && !DECL_EXTERNAL (decl))
3104 if (DECL_THREAD_LOCAL_P (decl))
3109 /* EXP is an expression that we want to pre-evaluate. Returns (in
3110 *INITP) an expression that will perform the pre-evaluation. The
3111 value returned by this function is a side-effect free expression
3112 equivalent to the pre-evaluated expression. Callers must ensure
3113 that *INITP is evaluated before EXP. */
3116 stabilize_expr (tree exp, tree* initp)
3120 if (!TREE_SIDE_EFFECTS (exp))
3121 init_expr = NULL_TREE;
3122 else if (!TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (exp))
3123 || !lvalue_or_rvalue_with_address_p (exp))
3125 init_expr = get_target_expr (exp);
3126 exp = TARGET_EXPR_SLOT (init_expr);
3130 bool xval = !real_lvalue_p (exp);
3131 exp = cp_build_addr_expr (exp, tf_warning_or_error);
3132 init_expr = get_target_expr (exp);
3133 exp = TARGET_EXPR_SLOT (init_expr);
3134 exp = cp_build_indirect_ref (exp, RO_NULL, tf_warning_or_error);
3140 gcc_assert (!TREE_SIDE_EFFECTS (exp));
3144 /* Add NEW_EXPR, an expression whose value we don't care about, after the
3145 similar expression ORIG. */
3148 add_stmt_to_compound (tree orig, tree new_expr)
3150 if (!new_expr || !TREE_SIDE_EFFECTS (new_expr))
3152 if (!orig || !TREE_SIDE_EFFECTS (orig))
3154 return build2 (COMPOUND_EXPR, void_type_node, orig, new_expr);
3157 /* Like stabilize_expr, but for a call whose arguments we want to
3158 pre-evaluate. CALL is modified in place to use the pre-evaluated
3159 arguments, while, upon return, *INITP contains an expression to
3160 compute the arguments. */
3163 stabilize_call (tree call, tree *initp)
3165 tree inits = NULL_TREE;
3167 int nargs = call_expr_nargs (call);
3169 if (call == error_mark_node || processing_template_decl)
3175 gcc_assert (TREE_CODE (call) == CALL_EXPR);
3177 for (i = 0; i < nargs; i++)
3180 CALL_EXPR_ARG (call, i) =
3181 stabilize_expr (CALL_EXPR_ARG (call, i), &init);
3182 inits = add_stmt_to_compound (inits, init);
3188 /* Like stabilize_expr, but for an AGGR_INIT_EXPR whose arguments we want
3189 to pre-evaluate. CALL is modified in place to use the pre-evaluated
3190 arguments, while, upon return, *INITP contains an expression to
3191 compute the arguments. */
3194 stabilize_aggr_init (tree call, tree *initp)
3196 tree inits = NULL_TREE;
3198 int nargs = aggr_init_expr_nargs (call);
3200 if (call == error_mark_node)
3203 gcc_assert (TREE_CODE (call) == AGGR_INIT_EXPR);
3205 for (i = 0; i < nargs; i++)
3208 AGGR_INIT_EXPR_ARG (call, i) =
3209 stabilize_expr (AGGR_INIT_EXPR_ARG (call, i), &init);
3210 inits = add_stmt_to_compound (inits, init);
3216 /* Like stabilize_expr, but for an initialization.
3218 If the initialization is for an object of class type, this function
3219 takes care not to introduce additional temporaries.
3221 Returns TRUE iff the expression was successfully pre-evaluated,
3222 i.e., if INIT is now side-effect free, except for, possible, a
3223 single call to a constructor. */
3226 stabilize_init (tree init, tree *initp)
3232 if (t == error_mark_node || processing_template_decl)
3235 if (TREE_CODE (t) == INIT_EXPR
3236 && TREE_CODE (TREE_OPERAND (t, 1)) != TARGET_EXPR
3237 && TREE_CODE (TREE_OPERAND (t, 1)) != AGGR_INIT_EXPR)
3239 TREE_OPERAND (t, 1) = stabilize_expr (TREE_OPERAND (t, 1), initp);
3243 if (TREE_CODE (t) == INIT_EXPR)
3244 t = TREE_OPERAND (t, 1);
3245 if (TREE_CODE (t) == TARGET_EXPR)
3246 t = TARGET_EXPR_INITIAL (t);
3247 if (TREE_CODE (t) == COMPOUND_EXPR)
3249 if (TREE_CODE (t) == CONSTRUCTOR
3250 && EMPTY_CONSTRUCTOR_P (t))
3251 /* Default-initialization. */
3254 /* If the initializer is a COND_EXPR, we can't preevaluate
3256 if (TREE_CODE (t) == COND_EXPR)
3259 if (TREE_CODE (t) == CALL_EXPR)
3261 stabilize_call (t, initp);
3265 if (TREE_CODE (t) == AGGR_INIT_EXPR)
3267 stabilize_aggr_init (t, initp);
3271 /* The initialization is being performed via a bitwise copy -- and
3272 the item copied may have side effects. */
3273 return TREE_SIDE_EFFECTS (init);
3276 /* Like "fold", but should be used whenever we might be processing the
3277 body of a template. */
3280 fold_if_not_in_template (tree expr)
3282 /* In the body of a template, there is never any need to call
3283 "fold". We will call fold later when actually instantiating the
3284 template. Integral constant expressions in templates will be
3285 evaluated via fold_non_dependent_expr, as necessary. */
3286 if (processing_template_decl)
3289 /* Fold C++ front-end specific tree codes. */
3290 if (TREE_CODE (expr) == UNARY_PLUS_EXPR)
3291 return fold_convert (TREE_TYPE (expr), TREE_OPERAND (expr, 0));
3296 /* Returns true if a cast to TYPE may appear in an integral constant
3300 cast_valid_in_integral_constant_expression_p (tree type)
3302 return (INTEGRAL_OR_ENUMERATION_TYPE_P (type)
3303 || cxx_dialect >= cxx0x
3304 || dependent_type_p (type)
3305 || type == error_mark_node);
3308 /* Return true if we need to fix linkage information of DECL. */
3311 cp_fix_function_decl_p (tree decl)
3313 /* Skip if DECL is not externally visible. */
3314 if (!TREE_PUBLIC (decl))
3317 /* We need to fix DECL if it a appears to be exported but with no
3318 function body. Thunks do not have CFGs and we may need to
3319 handle them specially later. */
3320 if (!gimple_has_body_p (decl)
3321 && !DECL_THUNK_P (decl)
3322 && !DECL_EXTERNAL (decl))
3324 struct cgraph_node *node = cgraph_get_node (decl);
3326 /* Don't fix same_body aliases. Although they don't have their own
3327 CFG, they share it with what they alias to. */
3329 || node->decl == decl
3330 || !node->same_body)
3337 /* Clean the C++ specific parts of the tree T. */
3340 cp_free_lang_data (tree t)
3342 if (TREE_CODE (t) == METHOD_TYPE
3343 || TREE_CODE (t) == FUNCTION_TYPE)
3345 /* Default args are not interesting anymore. */
3346 tree argtypes = TYPE_ARG_TYPES (t);
3349 TREE_PURPOSE (argtypes) = 0;
3350 argtypes = TREE_CHAIN (argtypes);
3353 else if (TREE_CODE (t) == FUNCTION_DECL
3354 && cp_fix_function_decl_p (t))
3356 /* If T is used in this translation unit at all, the definition
3357 must exist somewhere else since we have decided to not emit it
3358 in this TU. So make it an external reference. */
3359 DECL_EXTERNAL (t) = 1;
3360 TREE_STATIC (t) = 0;
3362 if (CP_AGGREGATE_TYPE_P (t)
3365 tree name = TYPE_NAME (t);
3366 if (TREE_CODE (name) == TYPE_DECL)
3367 name = DECL_NAME (name);
3368 /* Drop anonymous names. */
3369 if (name != NULL_TREE
3370 && ANON_AGGRNAME_P (name))
3371 TYPE_NAME (t) = NULL_TREE;
3373 if (TREE_CODE (t) == NAMESPACE_DECL)
3375 /* The list of users of a namespace isn't useful for the middle-end
3376 or debug generators. */
3377 DECL_NAMESPACE_USERS (t) = NULL_TREE;
3378 /* Neither do we need the leftover chaining of namespaces
3379 from the binding level. */
3380 DECL_CHAIN (t) = NULL_TREE;
3384 /* Stub for c-common. Please keep in sync with c-decl.c.
3385 FIXME: If address space support is target specific, then this
3386 should be a C target hook. But currently this is not possible,
3387 because this function is called via REGISTER_TARGET_PRAGMAS. */
3389 c_register_addr_space (const char *word ATTRIBUTE_UNUSED,
3390 addr_space_t as ATTRIBUTE_UNUSED)
3395 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3396 /* Complain that some language-specific thing hanging off a tree
3397 node has been accessed improperly. */
3400 lang_check_failed (const char* file, int line, const char* function)
3402 internal_error ("lang_* check: failed in %s, at %s:%d",
3403 function, trim_filename (file), line);
3405 #endif /* ENABLE_TREE_CHECKING */
3407 #include "gt-cp-tree.h"