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
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);
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)
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 = build4 (TARGET_EXPR, TREE_TYPE (decl), decl, value,
296 cxx_maybe_build_cleanup (decl), NULL_TREE);
297 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
298 ignore the TARGET_EXPR. If there really turn out to be no
299 side-effects, then the optimizer should be able to get rid of
300 whatever code is generated anyhow. */
301 TREE_SIDE_EFFECTS (t) = 1;
306 /* Return an undeclared local temporary of type TYPE for use in building a
310 build_local_temp (tree type)
312 tree slot = build_decl (input_location,
313 VAR_DECL, NULL_TREE, type);
314 DECL_ARTIFICIAL (slot) = 1;
315 DECL_IGNORED_P (slot) = 1;
316 DECL_CONTEXT (slot) = current_function_decl;
317 layout_decl (slot, 0);
321 /* Set various status flags when building an AGGR_INIT_EXPR object T. */
324 process_aggr_init_operands (tree t)
328 side_effects = TREE_SIDE_EFFECTS (t);
332 n = TREE_OPERAND_LENGTH (t);
333 for (i = 1; i < n; i++)
335 tree op = TREE_OPERAND (t, i);
336 if (op && TREE_SIDE_EFFECTS (op))
343 TREE_SIDE_EFFECTS (t) = side_effects;
346 /* Build an AGGR_INIT_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE,
347 FN, and SLOT. NARGS is the number of call arguments which are specified
348 as a tree array ARGS. */
351 build_aggr_init_array (tree return_type, tree fn, tree slot, int nargs,
357 t = build_vl_exp (AGGR_INIT_EXPR, nargs + 3);
358 TREE_TYPE (t) = return_type;
359 AGGR_INIT_EXPR_FN (t) = fn;
360 AGGR_INIT_EXPR_SLOT (t) = slot;
361 for (i = 0; i < nargs; i++)
362 AGGR_INIT_EXPR_ARG (t, i) = args[i];
363 process_aggr_init_operands (t);
367 /* INIT is a CALL_EXPR or AGGR_INIT_EXPR which needs info about its
368 target. TYPE is the type to be initialized.
370 Build an AGGR_INIT_EXPR to represent the initialization. This function
371 differs from build_cplus_new in that an AGGR_INIT_EXPR can only be used
372 to initialize another object, whereas a TARGET_EXPR can either
373 initialize another object or create its own temporary object, and as a
374 result building up a TARGET_EXPR requires that the type's destructor be
378 build_aggr_init_expr (tree type, tree init, tsubst_flags_t complain)
385 /* Make sure that we're not trying to create an instance of an
387 if (abstract_virtuals_error_sfinae (NULL_TREE, type, complain))
388 return error_mark_node;
390 if (TREE_CODE (init) == CALL_EXPR)
391 fn = CALL_EXPR_FN (init);
392 else if (TREE_CODE (init) == AGGR_INIT_EXPR)
393 fn = AGGR_INIT_EXPR_FN (init);
395 return convert (type, init);
397 is_ctor = (TREE_CODE (fn) == ADDR_EXPR
398 && TREE_CODE (TREE_OPERAND (fn, 0)) == FUNCTION_DECL
399 && DECL_CONSTRUCTOR_P (TREE_OPERAND (fn, 0)));
401 /* We split the CALL_EXPR into its function and its arguments here.
402 Then, in expand_expr, we put them back together. The reason for
403 this is that this expression might be a default argument
404 expression. In that case, we need a new temporary every time the
405 expression is used. That's what break_out_target_exprs does; it
406 replaces every AGGR_INIT_EXPR with a copy that uses a fresh
407 temporary slot. Then, expand_expr builds up a call-expression
408 using the new slot. */
410 /* If we don't need to use a constructor to create an object of this
411 type, don't mess with AGGR_INIT_EXPR. */
412 if (is_ctor || TREE_ADDRESSABLE (type))
414 slot = build_local_temp (type);
416 if (TREE_CODE(init) == CALL_EXPR)
417 rval = build_aggr_init_array (void_type_node, fn, slot,
418 call_expr_nargs (init),
419 CALL_EXPR_ARGP (init));
421 rval = build_aggr_init_array (void_type_node, fn, slot,
422 aggr_init_expr_nargs (init),
423 AGGR_INIT_EXPR_ARGP (init));
424 TREE_SIDE_EFFECTS (rval) = 1;
425 AGGR_INIT_VIA_CTOR_P (rval) = is_ctor;
426 TREE_NOTHROW (rval) = TREE_NOTHROW (init);
434 /* INIT is a CALL_EXPR or AGGR_INIT_EXPR which needs info about its
435 target. TYPE is the type that this initialization should appear to
438 Build an encapsulation of the initialization to perform
439 and return it so that it can be processed by language-independent
440 and language-specific expression expanders. */
443 build_cplus_new (tree type, tree init, tsubst_flags_t complain)
445 tree rval = build_aggr_init_expr (type, init, complain);
448 if (TREE_CODE (rval) == AGGR_INIT_EXPR)
449 slot = AGGR_INIT_EXPR_SLOT (rval);
450 else if (TREE_CODE (rval) == CALL_EXPR
451 || TREE_CODE (rval) == CONSTRUCTOR)
452 slot = build_local_temp (type);
456 rval = build_target_expr (slot, rval);
457 TARGET_EXPR_IMPLICIT_P (rval) = 1;
462 /* Subroutine of build_vec_init_expr: Build up a single element
463 intialization as a proxy for the full array initialization to get things
464 marked as used and any appropriate diagnostics.
466 Since we're deferring building the actual constructor calls until
467 gimplification time, we need to build one now and throw it away so
468 that the relevant constructor gets mark_used before cgraph decides
469 what functions are needed. Here we assume that init is either
470 NULL_TREE, void_type_node (indicating value-initialization), or
471 another array to copy. */
474 build_vec_init_elt (tree type, tree init)
476 tree inner_type = strip_array_types (type);
477 VEC(tree,gc) *argvec;
479 if (integer_zerop (array_type_nelts_total (type))
480 || !CLASS_TYPE_P (inner_type))
481 /* No interesting initialization to do. */
482 return integer_zero_node;
483 else if (init == void_type_node)
484 return build_value_init (inner_type, tf_warning_or_error);
486 gcc_assert (init == NULL_TREE
487 || (same_type_ignoring_top_level_qualifiers_p
488 (type, TREE_TYPE (init))));
490 argvec = make_tree_vector ();
493 tree dummy = build_dummy_object (inner_type);
494 if (!real_lvalue_p (init))
495 dummy = move (dummy);
496 VEC_quick_push (tree, argvec, dummy);
498 return build_special_member_call (NULL_TREE, complete_ctor_identifier,
499 &argvec, inner_type, LOOKUP_NORMAL,
500 tf_warning_or_error);
503 /* Return a TARGET_EXPR which expresses the initialization of an array to
504 be named later, either default-initialization or copy-initialization
505 from another array of the same type. */
508 build_vec_init_expr (tree type, tree init)
511 bool value_init = false;
512 tree elt_init = build_vec_init_elt (type, init);
514 if (init == void_type_node)
520 slot = build_local_temp (type);
521 init = build2 (VEC_INIT_EXPR, type, slot, init);
522 SET_EXPR_LOCATION (init, input_location);
524 if (cxx_dialect >= cxx0x
525 && potential_constant_expression (elt_init))
526 VEC_INIT_EXPR_IS_CONSTEXPR (init) = true;
527 VEC_INIT_EXPR_VALUE_INIT (init) = value_init;
529 init = build_target_expr (slot, init);
530 TARGET_EXPR_IMPLICIT_P (init) = 1;
535 /* Give a helpful diagnostic for a non-constexpr VEC_INIT_EXPR in a context
536 that requires a constant expression. */
539 diagnose_non_constexpr_vec_init (tree expr)
541 tree type = TREE_TYPE (VEC_INIT_EXPR_SLOT (expr));
543 if (VEC_INIT_EXPR_VALUE_INIT (expr))
544 init = void_zero_node;
546 init = VEC_INIT_EXPR_INIT (expr);
548 elt_init = build_vec_init_elt (type, init);
549 require_potential_constant_expression (elt_init);
553 build_array_copy (tree init)
555 return build_vec_init_expr (TREE_TYPE (init), init);
558 /* Build a TARGET_EXPR using INIT to initialize a new temporary of the
562 build_target_expr_with_type (tree init, tree type)
564 gcc_assert (!VOID_TYPE_P (type));
566 if (TREE_CODE (init) == TARGET_EXPR
567 || init == error_mark_node)
569 else if (CLASS_TYPE_P (type) && type_has_nontrivial_copy_init (type)
570 && !VOID_TYPE_P (TREE_TYPE (init))
571 && TREE_CODE (init) != COND_EXPR
572 && TREE_CODE (init) != CONSTRUCTOR
573 && TREE_CODE (init) != VA_ARG_EXPR)
574 /* We need to build up a copy constructor call. A void initializer
575 means we're being called from bot_manip. COND_EXPR is a special
576 case because we already have copies on the arms and we don't want
577 another one here. A CONSTRUCTOR is aggregate initialization, which
578 is handled separately. A VA_ARG_EXPR is magic creation of an
579 aggregate; there's no additional work to be done. */
580 return force_rvalue (init);
582 return force_target_expr (type, init);
585 /* Like the above function, but without the checking. This function should
586 only be used by code which is deliberately trying to subvert the type
587 system, such as call_builtin_trap. Or build_over_call, to avoid
588 infinite recursion. */
591 force_target_expr (tree type, tree init)
595 gcc_assert (!VOID_TYPE_P (type));
597 slot = build_local_temp (type);
598 return build_target_expr (slot, init);
601 /* Like build_target_expr_with_type, but use the type of INIT. */
604 get_target_expr (tree init)
606 if (TREE_CODE (init) == AGGR_INIT_EXPR)
607 return build_target_expr (AGGR_INIT_EXPR_SLOT (init), init);
609 return build_target_expr_with_type (init, TREE_TYPE (init));
612 /* If EXPR is a bitfield reference, convert it to the declared type of
613 the bitfield, and return the resulting expression. Otherwise,
614 return EXPR itself. */
617 convert_bitfield_to_declared_type (tree expr)
621 bitfield_type = is_bitfield_expr_with_lowered_type (expr);
623 expr = convert_to_integer (TYPE_MAIN_VARIANT (bitfield_type),
628 /* EXPR is being used in an rvalue context. Return a version of EXPR
629 that is marked as an rvalue. */
636 if (error_operand_p (expr))
639 expr = mark_rvalue_use (expr);
643 Non-class rvalues always have cv-unqualified types. */
644 type = TREE_TYPE (expr);
645 if (!CLASS_TYPE_P (type) && cv_qualified_p (type))
646 type = cv_unqualified (type);
648 /* We need to do this for rvalue refs as well to get the right answer
649 from decltype; see c++/36628. */
650 if (!processing_template_decl && lvalue_or_rvalue_with_address_p (expr))
651 expr = build1 (NON_LVALUE_EXPR, type, expr);
652 else if (type != TREE_TYPE (expr))
653 expr = build_nop (type, expr);
659 /* Hash an ARRAY_TYPE. K is really of type `tree'. */
662 cplus_array_hash (const void* k)
665 const_tree const t = (const_tree) k;
667 hash = TYPE_UID (TREE_TYPE (t));
669 hash ^= TYPE_UID (TYPE_DOMAIN (t));
673 typedef struct cplus_array_info {
678 /* Compare two ARRAY_TYPEs. K1 is really of type `tree', K2 is really
679 of type `cplus_array_info*'. */
682 cplus_array_compare (const void * k1, const void * k2)
684 const_tree const t1 = (const_tree) k1;
685 const cplus_array_info *const t2 = (const cplus_array_info*) k2;
687 return (TREE_TYPE (t1) == t2->type && TYPE_DOMAIN (t1) == t2->domain);
690 /* Hash table containing dependent array types, which are unsuitable for
691 the language-independent type hash table. */
692 static GTY ((param_is (union tree_node))) htab_t cplus_array_htab;
694 /* Like build_array_type, but handle special C++ semantics. */
697 build_cplus_array_type (tree elt_type, tree index_type)
701 if (elt_type == error_mark_node || index_type == error_mark_node)
702 return error_mark_node;
704 if (processing_template_decl
705 && (dependent_type_p (elt_type)
706 || (index_type && !TREE_CONSTANT (TYPE_MAX_VALUE (index_type)))))
709 cplus_array_info cai;
712 if (cplus_array_htab == NULL)
713 cplus_array_htab = htab_create_ggc (61, &cplus_array_hash,
714 &cplus_array_compare, NULL);
716 hash = TYPE_UID (elt_type);
718 hash ^= TYPE_UID (index_type);
720 cai.domain = index_type;
722 e = htab_find_slot_with_hash (cplus_array_htab, &cai, hash, INSERT);
724 /* We have found the type: we're done. */
728 /* Build a new array type. */
729 t = cxx_make_type (ARRAY_TYPE);
730 TREE_TYPE (t) = elt_type;
731 TYPE_DOMAIN (t) = index_type;
733 /* Store it in the hash table. */
736 /* Set the canonical type for this new node. */
737 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
738 || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type)))
739 SET_TYPE_STRUCTURAL_EQUALITY (t);
740 else if (TYPE_CANONICAL (elt_type) != elt_type
742 && TYPE_CANONICAL (index_type) != index_type))
744 = build_cplus_array_type
745 (TYPE_CANONICAL (elt_type),
746 index_type ? TYPE_CANONICAL (index_type) : index_type);
748 TYPE_CANONICAL (t) = t;
752 t = build_array_type (elt_type, index_type);
754 /* We want TYPE_MAIN_VARIANT of an array to strip cv-quals from the
755 element type as well, so fix it up if needed. */
756 if (elt_type != TYPE_MAIN_VARIANT (elt_type))
758 tree m = build_cplus_array_type (TYPE_MAIN_VARIANT (elt_type),
760 if (TYPE_MAIN_VARIANT (t) != m)
762 TYPE_MAIN_VARIANT (t) = m;
763 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
764 TYPE_NEXT_VARIANT (m) = t;
768 /* Push these needs up so that initialization takes place
770 TYPE_NEEDS_CONSTRUCTING (t)
771 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (elt_type));
772 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
773 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (elt_type));
777 /* Return an ARRAY_TYPE with element type ELT and length N. */
780 build_array_of_n_type (tree elt, int n)
782 return build_cplus_array_type (elt, build_index_type (size_int (n - 1)));
785 /* Return a reference type node referring to TO_TYPE. If RVAL is
786 true, return an rvalue reference type, otherwise return an lvalue
787 reference type. If a type node exists, reuse it, otherwise create
790 cp_build_reference_type (tree to_type, bool rval)
793 lvalue_ref = build_reference_type (to_type);
797 /* This code to create rvalue reference types is based on and tied
798 to the code creating lvalue reference types in the middle-end
799 functions build_reference_type_for_mode and build_reference_type.
801 It works by putting the rvalue reference type nodes after the
802 lvalue reference nodes in the TYPE_NEXT_REF_TO linked list, so
803 they will effectively be ignored by the middle end. */
805 for (t = lvalue_ref; (t = TYPE_NEXT_REF_TO (t)); )
806 if (TYPE_REF_IS_RVALUE (t))
809 t = build_distinct_type_copy (lvalue_ref);
811 TYPE_REF_IS_RVALUE (t) = true;
812 TYPE_NEXT_REF_TO (t) = TYPE_NEXT_REF_TO (lvalue_ref);
813 TYPE_NEXT_REF_TO (lvalue_ref) = t;
815 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
816 SET_TYPE_STRUCTURAL_EQUALITY (t);
817 else if (TYPE_CANONICAL (to_type) != to_type)
819 = cp_build_reference_type (TYPE_CANONICAL (to_type), rval);
821 TYPE_CANONICAL (t) = t;
829 /* Returns EXPR cast to rvalue reference type, like std::move. */
834 tree type = TREE_TYPE (expr);
835 gcc_assert (TREE_CODE (type) != REFERENCE_TYPE);
836 type = cp_build_reference_type (type, /*rval*/true);
837 return build_static_cast (type, expr, tf_warning_or_error);
840 /* Used by the C++ front end to build qualified array types. However,
841 the C version of this function does not properly maintain canonical
842 types (which are not used in C). */
844 c_build_qualified_type (tree type, int type_quals)
846 return cp_build_qualified_type (type, type_quals);
850 /* Make a variant of TYPE, qualified with the TYPE_QUALS. Handles
851 arrays correctly. In particular, if TYPE is an array of T's, and
852 TYPE_QUALS is non-empty, returns an array of qualified T's.
854 FLAGS determines how to deal with ill-formed qualifications. If
855 tf_ignore_bad_quals is set, then bad qualifications are dropped
856 (this is permitted if TYPE was introduced via a typedef or template
857 type parameter). If bad qualifications are dropped and tf_warning
858 is set, then a warning is issued for non-const qualifications. If
859 tf_ignore_bad_quals is not set and tf_error is not set, we
860 return error_mark_node. Otherwise, we issue an error, and ignore
863 Qualification of a reference type is valid when the reference came
864 via a typedef or template type argument. [dcl.ref] No such
865 dispensation is provided for qualifying a function type. [dcl.fct]
866 DR 295 queries this and the proposed resolution brings it into line
867 with qualifying a reference. We implement the DR. We also behave
868 in a similar manner for restricting non-pointer types. */
871 cp_build_qualified_type_real (tree type,
873 tsubst_flags_t complain)
876 int bad_quals = TYPE_UNQUALIFIED;
878 if (type == error_mark_node)
881 if (type_quals == cp_type_quals (type))
884 if (TREE_CODE (type) == ARRAY_TYPE)
886 /* In C++, the qualification really applies to the array element
887 type. Obtain the appropriately qualified element type. */
890 = cp_build_qualified_type_real (TREE_TYPE (type),
894 if (element_type == error_mark_node)
895 return error_mark_node;
897 /* See if we already have an identically qualified type. Tests
898 should be equivalent to those in check_qualified_type. */
899 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
900 if (TREE_TYPE (t) == element_type
901 && TYPE_NAME (t) == TYPE_NAME (type)
902 && TYPE_CONTEXT (t) == TYPE_CONTEXT (type)
903 && attribute_list_equal (TYPE_ATTRIBUTES (t),
904 TYPE_ATTRIBUTES (type)))
909 t = build_cplus_array_type (element_type, TYPE_DOMAIN (type));
911 /* Keep the typedef name. */
912 if (TYPE_NAME (t) != TYPE_NAME (type))
914 t = build_variant_type_copy (t);
915 TYPE_NAME (t) = TYPE_NAME (type);
919 /* Even if we already had this variant, we update
920 TYPE_NEEDS_CONSTRUCTING and TYPE_HAS_NONTRIVIAL_DESTRUCTOR in case
921 they changed since the variant was originally created.
923 This seems hokey; if there is some way to use a previous
924 variant *without* coming through here,
925 TYPE_NEEDS_CONSTRUCTING will never be updated. */
926 TYPE_NEEDS_CONSTRUCTING (t)
927 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (element_type));
928 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
929 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (element_type));
932 else if (TYPE_PTRMEMFUNC_P (type))
934 /* For a pointer-to-member type, we can't just return a
935 cv-qualified version of the RECORD_TYPE. If we do, we
936 haven't changed the field that contains the actual pointer to
937 a method, and so TYPE_PTRMEMFUNC_FN_TYPE will be wrong. */
940 t = TYPE_PTRMEMFUNC_FN_TYPE (type);
941 t = cp_build_qualified_type_real (t, type_quals, complain);
942 return build_ptrmemfunc_type (t);
944 else if (TREE_CODE (type) == TYPE_PACK_EXPANSION)
946 tree t = PACK_EXPANSION_PATTERN (type);
948 t = cp_build_qualified_type_real (t, type_quals, complain);
949 return make_pack_expansion (t);
952 /* A reference or method type shall not be cv-qualified.
953 [dcl.ref], [dcl.fct]. This used to be an error, but as of DR 295
954 (in CD1) we always ignore extra cv-quals on functions. */
955 if (type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE)
956 && (TREE_CODE (type) == REFERENCE_TYPE
957 || TREE_CODE (type) == FUNCTION_TYPE
958 || TREE_CODE (type) == METHOD_TYPE))
960 if (TREE_CODE (type) == REFERENCE_TYPE)
961 bad_quals |= type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
962 type_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
965 /* But preserve any function-cv-quals on a FUNCTION_TYPE. */
966 if (TREE_CODE (type) == FUNCTION_TYPE)
967 type_quals |= type_memfn_quals (type);
969 /* A restrict-qualified type must be a pointer (or reference)
970 to object or incomplete type. */
971 if ((type_quals & TYPE_QUAL_RESTRICT)
972 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
973 && TREE_CODE (type) != TYPENAME_TYPE
974 && !POINTER_TYPE_P (type))
976 bad_quals |= TYPE_QUAL_RESTRICT;
977 type_quals &= ~TYPE_QUAL_RESTRICT;
980 if (bad_quals == TYPE_UNQUALIFIED
981 || (complain & tf_ignore_bad_quals))
983 else if (!(complain & tf_error))
984 return error_mark_node;
987 tree bad_type = build_qualified_type (ptr_type_node, bad_quals);
988 error ("%qV qualifiers cannot be applied to %qT",
992 /* Retrieve (or create) the appropriately qualified variant. */
993 result = build_qualified_type (type, type_quals);
995 /* If this was a pointer-to-method type, and we just made a copy,
996 then we need to unshare the record that holds the cached
997 pointer-to-member-function type, because these will be distinct
998 between the unqualified and qualified types. */
1000 && TREE_CODE (type) == POINTER_TYPE
1001 && TREE_CODE (TREE_TYPE (type)) == METHOD_TYPE
1002 && TYPE_LANG_SPECIFIC (result) == TYPE_LANG_SPECIFIC (type))
1003 TYPE_LANG_SPECIFIC (result) = NULL;
1005 /* We may also have ended up building a new copy of the canonical
1006 type of a pointer-to-method type, which could have the same
1007 sharing problem described above. */
1008 if (TYPE_CANONICAL (result) != TYPE_CANONICAL (type)
1009 && TREE_CODE (type) == POINTER_TYPE
1010 && TREE_CODE (TREE_TYPE (type)) == METHOD_TYPE
1011 && (TYPE_LANG_SPECIFIC (TYPE_CANONICAL (result))
1012 == TYPE_LANG_SPECIFIC (TYPE_CANONICAL (type))))
1013 TYPE_LANG_SPECIFIC (TYPE_CANONICAL (result)) = NULL;
1018 /* Return TYPE with const and volatile removed. */
1021 cv_unqualified (tree type)
1025 if (type == error_mark_node)
1028 quals = cp_type_quals (type);
1029 quals &= ~(TYPE_QUAL_CONST|TYPE_QUAL_VOLATILE);
1030 return cp_build_qualified_type (type, quals);
1033 /* Builds a qualified variant of T that is not a typedef variant.
1034 E.g. consider the following declarations:
1035 typedef const int ConstInt;
1036 typedef ConstInt* PtrConstInt;
1037 If T is PtrConstInt, this function returns a type representing
1039 In other words, if T is a typedef, the function returns the underlying type.
1040 The cv-qualification and attributes of the type returned match the
1042 They will always be compatible types.
1043 The returned type is built so that all of its subtypes
1044 recursively have their typedefs stripped as well.
1046 This is different from just returning TYPE_CANONICAL (T)
1047 Because of several reasons:
1048 * If T is a type that needs structural equality
1049 its TYPE_CANONICAL (T) will be NULL.
1050 * TYPE_CANONICAL (T) desn't carry type attributes
1051 and looses template parameter names. */
1054 strip_typedefs (tree t)
1056 tree result = NULL, type = NULL, t0 = NULL;
1058 if (!t || t == error_mark_node || t == TYPE_CANONICAL (t))
1061 gcc_assert (TYPE_P (t));
1063 switch (TREE_CODE (t))
1066 type = strip_typedefs (TREE_TYPE (t));
1067 result = build_pointer_type (type);
1069 case REFERENCE_TYPE:
1070 type = strip_typedefs (TREE_TYPE (t));
1071 result = cp_build_reference_type (type, TYPE_REF_IS_RVALUE (t));
1074 t0 = strip_typedefs (TYPE_OFFSET_BASETYPE (t));
1075 type = strip_typedefs (TREE_TYPE (t));
1076 result = build_offset_type (t0, type);
1079 if (TYPE_PTRMEMFUNC_P (t))
1081 t0 = strip_typedefs (TYPE_PTRMEMFUNC_FN_TYPE (t));
1082 result = build_ptrmemfunc_type (t0);
1086 type = strip_typedefs (TREE_TYPE (t));
1087 t0 = strip_typedefs (TYPE_DOMAIN (t));;
1088 result = build_cplus_array_type (type, t0);
1093 tree arg_types = NULL, arg_node, arg_type;
1094 for (arg_node = TYPE_ARG_TYPES (t);
1096 arg_node = TREE_CHAIN (arg_node))
1098 if (arg_node == void_list_node)
1100 arg_type = strip_typedefs (TREE_VALUE (arg_node));
1101 gcc_assert (arg_type);
1104 tree_cons (TREE_PURPOSE (arg_node), arg_type, arg_types);
1108 arg_types = nreverse (arg_types);
1110 /* A list of parameters not ending with an ellipsis
1111 must end with void_list_node. */
1113 arg_types = chainon (arg_types, void_list_node);
1115 type = strip_typedefs (TREE_TYPE (t));
1116 if (TREE_CODE (t) == METHOD_TYPE)
1118 tree class_type = TREE_TYPE (TREE_VALUE (arg_types));
1119 gcc_assert (class_type);
1121 build_method_type_directly (class_type, type,
1122 TREE_CHAIN (arg_types));
1126 result = build_function_type (type,
1128 result = apply_memfn_quals (result, type_memfn_quals (t));
1131 if (TYPE_RAISES_EXCEPTIONS (t))
1132 result = build_exception_variant (result,
1133 TYPE_RAISES_EXCEPTIONS (t));
1137 result = make_typename_type (strip_typedefs (TYPE_CONTEXT (t)),
1138 TYPENAME_TYPE_FULLNAME (t),
1139 typename_type, tf_none);
1146 result = TYPE_MAIN_VARIANT (t);
1147 if (TYPE_ATTRIBUTES (t))
1148 result = cp_build_type_attribute_variant (result, TYPE_ATTRIBUTES (t));
1149 return cp_build_qualified_type (result, cp_type_quals (t));
1152 /* Makes a copy of BINFO and TYPE, which is to be inherited into a
1153 graph dominated by T. If BINFO is NULL, TYPE is a dependent base,
1154 and we do a shallow copy. If BINFO is non-NULL, we do a deep copy.
1155 VIRT indicates whether TYPE is inherited virtually or not.
1156 IGO_PREV points at the previous binfo of the inheritance graph
1157 order chain. The newly copied binfo's TREE_CHAIN forms this
1160 The CLASSTYPE_VBASECLASSES vector of T is constructed in the
1161 correct order. That is in the order the bases themselves should be
1164 The BINFO_INHERITANCE of a virtual base class points to the binfo
1165 of the most derived type. ??? We could probably change this so that
1166 BINFO_INHERITANCE becomes synonymous with BINFO_PRIMARY, and hence
1167 remove a field. They currently can only differ for primary virtual
1171 copy_binfo (tree binfo, tree type, tree t, tree *igo_prev, int virt)
1177 /* See if we've already made this virtual base. */
1178 new_binfo = binfo_for_vbase (type, t);
1183 new_binfo = make_tree_binfo (binfo ? BINFO_N_BASE_BINFOS (binfo) : 0);
1184 BINFO_TYPE (new_binfo) = type;
1186 /* Chain it into the inheritance graph. */
1187 TREE_CHAIN (*igo_prev) = new_binfo;
1188 *igo_prev = new_binfo;
1195 gcc_assert (!BINFO_DEPENDENT_BASE_P (binfo));
1196 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), type));
1198 BINFO_OFFSET (new_binfo) = BINFO_OFFSET (binfo);
1199 BINFO_VIRTUALS (new_binfo) = BINFO_VIRTUALS (binfo);
1201 /* We do not need to copy the accesses, as they are read only. */
1202 BINFO_BASE_ACCESSES (new_binfo) = BINFO_BASE_ACCESSES (binfo);
1204 /* Recursively copy base binfos of BINFO. */
1205 for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++)
1207 tree new_base_binfo;
1209 gcc_assert (!BINFO_DEPENDENT_BASE_P (base_binfo));
1210 new_base_binfo = copy_binfo (base_binfo, BINFO_TYPE (base_binfo),
1212 BINFO_VIRTUAL_P (base_binfo));
1214 if (!BINFO_INHERITANCE_CHAIN (new_base_binfo))
1215 BINFO_INHERITANCE_CHAIN (new_base_binfo) = new_binfo;
1216 BINFO_BASE_APPEND (new_binfo, new_base_binfo);
1220 BINFO_DEPENDENT_BASE_P (new_binfo) = 1;
1224 /* Push it onto the list after any virtual bases it contains
1225 will have been pushed. */
1226 VEC_quick_push (tree, CLASSTYPE_VBASECLASSES (t), new_binfo);
1227 BINFO_VIRTUAL_P (new_binfo) = 1;
1228 BINFO_INHERITANCE_CHAIN (new_binfo) = TYPE_BINFO (t);
1234 /* Hashing of lists so that we don't make duplicates.
1235 The entry point is `list_hash_canon'. */
1237 /* Now here is the hash table. When recording a list, it is added
1238 to the slot whose index is the hash code mod the table size.
1239 Note that the hash table is used for several kinds of lists.
1240 While all these live in the same table, they are completely independent,
1241 and the hash code is computed differently for each of these. */
1243 static GTY ((param_is (union tree_node))) htab_t list_hash_table;
1252 /* Compare ENTRY (an entry in the hash table) with DATA (a list_proxy
1253 for a node we are thinking about adding). */
1256 list_hash_eq (const void* entry, const void* data)
1258 const_tree const t = (const_tree) entry;
1259 const struct list_proxy *const proxy = (const struct list_proxy *) data;
1261 return (TREE_VALUE (t) == proxy->value
1262 && TREE_PURPOSE (t) == proxy->purpose
1263 && TREE_CHAIN (t) == proxy->chain);
1266 /* Compute a hash code for a list (chain of TREE_LIST nodes
1267 with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the
1268 TREE_COMMON slots), by adding the hash codes of the individual entries. */
1271 list_hash_pieces (tree purpose, tree value, tree chain)
1273 hashval_t hashcode = 0;
1276 hashcode += TREE_HASH (chain);
1279 hashcode += TREE_HASH (value);
1283 hashcode += TREE_HASH (purpose);
1289 /* Hash an already existing TREE_LIST. */
1292 list_hash (const void* p)
1294 const_tree const t = (const_tree) p;
1295 return list_hash_pieces (TREE_PURPOSE (t),
1300 /* Given list components PURPOSE, VALUE, AND CHAIN, return the canonical
1301 object for an identical list if one already exists. Otherwise, build a
1302 new one, and record it as the canonical object. */
1305 hash_tree_cons (tree purpose, tree value, tree chain)
1309 struct list_proxy proxy;
1311 /* Hash the list node. */
1312 hashcode = list_hash_pieces (purpose, value, chain);
1313 /* Create a proxy for the TREE_LIST we would like to create. We
1314 don't actually create it so as to avoid creating garbage. */
1315 proxy.purpose = purpose;
1316 proxy.value = value;
1317 proxy.chain = chain;
1318 /* See if it is already in the table. */
1319 slot = htab_find_slot_with_hash (list_hash_table, &proxy, hashcode,
1321 /* If not, create a new node. */
1323 *slot = tree_cons (purpose, value, chain);
1324 return (tree) *slot;
1327 /* Constructor for hashed lists. */
1330 hash_tree_chain (tree value, tree chain)
1332 return hash_tree_cons (NULL_TREE, value, chain);
1336 debug_binfo (tree elem)
1341 fprintf (stderr, "type \"%s\", offset = " HOST_WIDE_INT_PRINT_DEC
1343 TYPE_NAME_STRING (BINFO_TYPE (elem)),
1344 TREE_INT_CST_LOW (BINFO_OFFSET (elem)));
1345 debug_tree (BINFO_TYPE (elem));
1346 if (BINFO_VTABLE (elem))
1347 fprintf (stderr, "vtable decl \"%s\"\n",
1348 IDENTIFIER_POINTER (DECL_NAME (get_vtbl_decl_for_binfo (elem))));
1350 fprintf (stderr, "no vtable decl yet\n");
1351 fprintf (stderr, "virtuals:\n");
1352 virtuals = BINFO_VIRTUALS (elem);
1357 tree fndecl = TREE_VALUE (virtuals);
1358 fprintf (stderr, "%s [%ld =? %ld]\n",
1359 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl)),
1360 (long) n, (long) TREE_INT_CST_LOW (DECL_VINDEX (fndecl)));
1362 virtuals = TREE_CHAIN (virtuals);
1366 /* Build a representation for the qualified name SCOPE::NAME. TYPE is
1367 the type of the result expression, if known, or NULL_TREE if the
1368 resulting expression is type-dependent. If TEMPLATE_P is true,
1369 NAME is known to be a template because the user explicitly used the
1370 "template" keyword after the "::".
1372 All SCOPE_REFs should be built by use of this function. */
1375 build_qualified_name (tree type, tree scope, tree name, bool template_p)
1378 if (type == error_mark_node
1379 || scope == error_mark_node
1380 || name == error_mark_node)
1381 return error_mark_node;
1382 t = build2 (SCOPE_REF, type, scope, name);
1383 QUALIFIED_NAME_IS_TEMPLATE (t) = template_p;
1385 t = convert_from_reference (t);
1389 /* Returns nonzero if X is an expression for a (possibly overloaded)
1390 function. If "f" is a function or function template, "f", "c->f",
1391 "c.f", "C::f", and "f<int>" will all be considered possibly
1392 overloaded functions. Returns 2 if the function is actually
1393 overloaded, i.e., if it is impossible to know the type of the
1394 function without performing overload resolution. */
1397 is_overloaded_fn (tree x)
1399 /* A baselink is also considered an overloaded function. */
1400 if (TREE_CODE (x) == OFFSET_REF
1401 || TREE_CODE (x) == COMPONENT_REF)
1402 x = TREE_OPERAND (x, 1);
1404 x = BASELINK_FUNCTIONS (x);
1405 if (TREE_CODE (x) == TEMPLATE_ID_EXPR)
1406 x = TREE_OPERAND (x, 0);
1407 if (DECL_FUNCTION_TEMPLATE_P (OVL_CURRENT (x))
1408 || (TREE_CODE (x) == OVERLOAD && OVL_CHAIN (x)))
1410 return (TREE_CODE (x) == FUNCTION_DECL
1411 || TREE_CODE (x) == OVERLOAD);
1414 /* Returns true iff X is an expression for an overloaded function
1415 whose type cannot be known without performing overload
1419 really_overloaded_fn (tree x)
1421 return is_overloaded_fn (x) == 2;
1427 gcc_assert (is_overloaded_fn (from));
1428 /* A baselink is also considered an overloaded function. */
1429 if (TREE_CODE (from) == OFFSET_REF
1430 || TREE_CODE (from) == COMPONENT_REF)
1431 from = TREE_OPERAND (from, 1);
1432 if (BASELINK_P (from))
1433 from = BASELINK_FUNCTIONS (from);
1434 if (TREE_CODE (from) == TEMPLATE_ID_EXPR)
1435 from = TREE_OPERAND (from, 0);
1440 get_first_fn (tree from)
1442 return OVL_CURRENT (get_fns (from));
1445 /* Return a new OVL node, concatenating it with the old one. */
1448 ovl_cons (tree decl, tree chain)
1450 tree result = make_node (OVERLOAD);
1451 TREE_TYPE (result) = unknown_type_node;
1452 OVL_FUNCTION (result) = decl;
1453 TREE_CHAIN (result) = chain;
1458 /* Build a new overloaded function. If this is the first one,
1459 just return it; otherwise, ovl_cons the _DECLs */
1462 build_overload (tree decl, tree chain)
1464 if (! chain && TREE_CODE (decl) != TEMPLATE_DECL)
1466 return ovl_cons (decl, chain);
1470 #define PRINT_RING_SIZE 4
1473 cxx_printable_name_internal (tree decl, int v, bool translate)
1475 static unsigned int uid_ring[PRINT_RING_SIZE];
1476 static char *print_ring[PRINT_RING_SIZE];
1477 static bool trans_ring[PRINT_RING_SIZE];
1478 static int ring_counter;
1481 /* Only cache functions. */
1483 || TREE_CODE (decl) != FUNCTION_DECL
1484 || DECL_LANG_SPECIFIC (decl) == 0)
1485 return lang_decl_name (decl, v, translate);
1487 /* See if this print name is lying around. */
1488 for (i = 0; i < PRINT_RING_SIZE; i++)
1489 if (uid_ring[i] == DECL_UID (decl) && translate == trans_ring[i])
1490 /* yes, so return it. */
1491 return print_ring[i];
1493 if (++ring_counter == PRINT_RING_SIZE)
1496 if (current_function_decl != NULL_TREE)
1498 /* There may be both translated and untranslated versions of the
1500 for (i = 0; i < 2; i++)
1502 if (uid_ring[ring_counter] == DECL_UID (current_function_decl))
1504 if (ring_counter == PRINT_RING_SIZE)
1507 gcc_assert (uid_ring[ring_counter] != DECL_UID (current_function_decl));
1510 if (print_ring[ring_counter])
1511 free (print_ring[ring_counter]);
1513 print_ring[ring_counter] = xstrdup (lang_decl_name (decl, v, translate));
1514 uid_ring[ring_counter] = DECL_UID (decl);
1515 trans_ring[ring_counter] = translate;
1516 return print_ring[ring_counter];
1520 cxx_printable_name (tree decl, int v)
1522 return cxx_printable_name_internal (decl, v, false);
1526 cxx_printable_name_translate (tree decl, int v)
1528 return cxx_printable_name_internal (decl, v, true);
1531 /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions
1532 listed in RAISES. */
1535 build_exception_variant (tree type, tree raises)
1540 if (comp_except_specs (raises, TYPE_RAISES_EXCEPTIONS (type), ce_exact))
1543 type_quals = TYPE_QUALS (type);
1544 for (v = TYPE_MAIN_VARIANT (type); v; v = TYPE_NEXT_VARIANT (v))
1545 if (check_qualified_type (v, type, type_quals)
1546 && comp_except_specs (raises, TYPE_RAISES_EXCEPTIONS (v), ce_exact))
1549 /* Need to build a new variant. */
1550 v = build_variant_type_copy (type);
1551 TYPE_RAISES_EXCEPTIONS (v) = raises;
1555 /* Given a TEMPLATE_TEMPLATE_PARM node T, create a new
1556 BOUND_TEMPLATE_TEMPLATE_PARM bound with NEWARGS as its template
1560 bind_template_template_parm (tree t, tree newargs)
1562 tree decl = TYPE_NAME (t);
1565 t2 = cxx_make_type (BOUND_TEMPLATE_TEMPLATE_PARM);
1566 decl = build_decl (input_location,
1567 TYPE_DECL, DECL_NAME (decl), NULL_TREE);
1569 /* These nodes have to be created to reflect new TYPE_DECL and template
1571 TEMPLATE_TYPE_PARM_INDEX (t2) = copy_node (TEMPLATE_TYPE_PARM_INDEX (t));
1572 TEMPLATE_PARM_DECL (TEMPLATE_TYPE_PARM_INDEX (t2)) = decl;
1573 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2)
1574 = build_template_info (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t), newargs);
1576 TREE_TYPE (decl) = t2;
1577 TYPE_NAME (t2) = decl;
1578 TYPE_STUB_DECL (t2) = decl;
1580 SET_TYPE_STRUCTURAL_EQUALITY (t2);
1585 /* Called from count_trees via walk_tree. */
1588 count_trees_r (tree *tp, int *walk_subtrees, void *data)
1598 /* Debugging function for measuring the rough complexity of a tree
1602 count_trees (tree t)
1605 cp_walk_tree_without_duplicates (&t, count_trees_r, &n_trees);
1609 /* Called from verify_stmt_tree via walk_tree. */
1612 verify_stmt_tree_r (tree* tp,
1613 int* walk_subtrees ATTRIBUTE_UNUSED ,
1617 htab_t *statements = (htab_t *) data;
1620 if (!STATEMENT_CODE_P (TREE_CODE (t)))
1623 /* If this statement is already present in the hash table, then
1624 there is a circularity in the statement tree. */
1625 gcc_assert (!htab_find (*statements, t));
1627 slot = htab_find_slot (*statements, t, INSERT);
1633 /* Debugging function to check that the statement T has not been
1634 corrupted. For now, this function simply checks that T contains no
1638 verify_stmt_tree (tree t)
1641 statements = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
1642 cp_walk_tree (&t, verify_stmt_tree_r, &statements, NULL);
1643 htab_delete (statements);
1646 /* Check if the type T depends on a type with no linkage and if so, return
1647 it. If RELAXED_P then do not consider a class type declared within
1648 a vague-linkage function to have no linkage. */
1651 no_linkage_check (tree t, bool relaxed_p)
1655 /* There's no point in checking linkage on template functions; we
1656 can't know their complete types. */
1657 if (processing_template_decl)
1660 switch (TREE_CODE (t))
1663 if (TYPE_PTRMEMFUNC_P (t))
1665 /* Lambda types that don't have mangling scope have no linkage. We
1666 check CLASSTYPE_LAMBDA_EXPR here rather than LAMBDA_TYPE_P because
1667 when we get here from pushtag none of the lambda information is
1668 set up yet, so we want to assume that the lambda has linkage and
1669 fix it up later if not. */
1670 if (CLASSTYPE_LAMBDA_EXPR (t)
1671 && LAMBDA_TYPE_EXTRA_SCOPE (t) == NULL_TREE)
1675 if (!CLASS_TYPE_P (t))
1679 /* Only treat anonymous types as having no linkage if they're at
1680 namespace scope. This is core issue 966. */
1681 if (TYPE_ANONYMOUS_P (t) && TYPE_NAMESPACE_SCOPE_P (t))
1684 for (r = CP_TYPE_CONTEXT (t); ; )
1686 /* If we're a nested type of a !TREE_PUBLIC class, we might not
1687 have linkage, or we might just be in an anonymous namespace.
1688 If we're in a TREE_PUBLIC class, we have linkage. */
1689 if (TYPE_P (r) && !TREE_PUBLIC (TYPE_NAME (r)))
1690 return no_linkage_check (TYPE_CONTEXT (t), relaxed_p);
1691 else if (TREE_CODE (r) == FUNCTION_DECL)
1693 if (!relaxed_p || !vague_linkage_p (r))
1696 r = CP_DECL_CONTEXT (r);
1706 case REFERENCE_TYPE:
1707 return no_linkage_check (TREE_TYPE (t), relaxed_p);
1711 r = no_linkage_check (TYPE_PTRMEM_POINTED_TO_TYPE (t),
1715 return no_linkage_check (TYPE_PTRMEM_CLASS_TYPE (t), relaxed_p);
1718 r = no_linkage_check (TYPE_METHOD_BASETYPE (t), relaxed_p);
1725 for (parm = TYPE_ARG_TYPES (t);
1726 parm && parm != void_list_node;
1727 parm = TREE_CHAIN (parm))
1729 r = no_linkage_check (TREE_VALUE (parm), relaxed_p);
1733 return no_linkage_check (TREE_TYPE (t), relaxed_p);
1741 #ifdef GATHER_STATISTICS
1742 extern int depth_reached;
1746 cxx_print_statistics (void)
1748 print_search_statistics ();
1749 print_class_statistics ();
1750 print_template_statistics ();
1751 #ifdef GATHER_STATISTICS
1752 fprintf (stderr, "maximum template instantiation depth reached: %d\n",
1757 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1758 (which is an ARRAY_TYPE). This counts only elements of the top
1762 array_type_nelts_top (tree type)
1764 return fold_build2_loc (input_location,
1765 PLUS_EXPR, sizetype,
1766 array_type_nelts (type),
1770 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1771 (which is an ARRAY_TYPE). This one is a recursive count of all
1772 ARRAY_TYPEs that are clumped together. */
1775 array_type_nelts_total (tree type)
1777 tree sz = array_type_nelts_top (type);
1778 type = TREE_TYPE (type);
1779 while (TREE_CODE (type) == ARRAY_TYPE)
1781 tree n = array_type_nelts_top (type);
1782 sz = fold_build2_loc (input_location,
1783 MULT_EXPR, sizetype, sz, n);
1784 type = TREE_TYPE (type);
1789 /* Called from break_out_target_exprs via mapcar. */
1792 bot_manip (tree* tp, int* walk_subtrees, void* data)
1794 splay_tree target_remap = ((splay_tree) data);
1797 if (!TYPE_P (t) && TREE_CONSTANT (t) && !TREE_SIDE_EFFECTS (t))
1799 /* There can't be any TARGET_EXPRs or their slot variables below
1804 if (TREE_CODE (t) == TARGET_EXPR)
1808 if (TREE_CODE (TREE_OPERAND (t, 1)) == AGGR_INIT_EXPR)
1809 u = build_cplus_new (TREE_TYPE (t), TREE_OPERAND (t, 1),
1810 tf_warning_or_error);
1812 u = build_target_expr_with_type (TREE_OPERAND (t, 1), TREE_TYPE (t));
1814 /* Map the old variable to the new one. */
1815 splay_tree_insert (target_remap,
1816 (splay_tree_key) TREE_OPERAND (t, 0),
1817 (splay_tree_value) TREE_OPERAND (u, 0));
1819 TREE_OPERAND (u, 1) = break_out_target_exprs (TREE_OPERAND (u, 1));
1821 /* Replace the old expression with the new version. */
1823 /* We don't have to go below this point; the recursive call to
1824 break_out_target_exprs will have handled anything below this
1830 /* Make a copy of this node. */
1831 return copy_tree_r (tp, walk_subtrees, NULL);
1834 /* Replace all remapped VAR_DECLs in T with their new equivalents.
1835 DATA is really a splay-tree mapping old variables to new
1839 bot_replace (tree* t,
1840 int* walk_subtrees ATTRIBUTE_UNUSED ,
1843 splay_tree target_remap = ((splay_tree) data);
1845 if (TREE_CODE (*t) == VAR_DECL)
1847 splay_tree_node n = splay_tree_lookup (target_remap,
1848 (splay_tree_key) *t);
1850 *t = (tree) n->value;
1856 /* When we parse a default argument expression, we may create
1857 temporary variables via TARGET_EXPRs. When we actually use the
1858 default-argument expression, we make a copy of the expression, but
1859 we must replace the temporaries with appropriate local versions. */
1862 break_out_target_exprs (tree t)
1864 static int target_remap_count;
1865 static splay_tree target_remap;
1867 if (!target_remap_count++)
1868 target_remap = splay_tree_new (splay_tree_compare_pointers,
1869 /*splay_tree_delete_key_fn=*/NULL,
1870 /*splay_tree_delete_value_fn=*/NULL);
1871 cp_walk_tree (&t, bot_manip, target_remap, NULL);
1872 cp_walk_tree (&t, bot_replace, target_remap, NULL);
1874 if (!--target_remap_count)
1876 splay_tree_delete (target_remap);
1877 target_remap = NULL;
1883 /* Similar to `build_nt', but for template definitions of dependent
1887 build_min_nt (enum tree_code code, ...)
1894 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
1898 t = make_node (code);
1899 length = TREE_CODE_LENGTH (code);
1901 for (i = 0; i < length; i++)
1903 tree x = va_arg (p, tree);
1904 TREE_OPERAND (t, i) = x;
1912 /* Similar to `build', but for template definitions. */
1915 build_min (enum tree_code code, tree tt, ...)
1922 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
1926 t = make_node (code);
1927 length = TREE_CODE_LENGTH (code);
1930 for (i = 0; i < length; i++)
1932 tree x = va_arg (p, tree);
1933 TREE_OPERAND (t, i) = x;
1934 if (x && !TYPE_P (x) && TREE_SIDE_EFFECTS (x))
1935 TREE_SIDE_EFFECTS (t) = 1;
1942 /* Similar to `build', but for template definitions of non-dependent
1943 expressions. NON_DEP is the non-dependent expression that has been
1947 build_min_non_dep (enum tree_code code, tree non_dep, ...)
1954 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
1956 va_start (p, non_dep);
1958 t = make_node (code);
1959 length = TREE_CODE_LENGTH (code);
1960 TREE_TYPE (t) = TREE_TYPE (non_dep);
1961 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (non_dep);
1963 for (i = 0; i < length; i++)
1965 tree x = va_arg (p, tree);
1966 TREE_OPERAND (t, i) = x;
1969 if (code == COMPOUND_EXPR && TREE_CODE (non_dep) != COMPOUND_EXPR)
1970 /* This should not be considered a COMPOUND_EXPR, because it
1971 resolves to an overload. */
1972 COMPOUND_EXPR_OVERLOADED (t) = 1;
1978 /* Similar to `build_nt_call_vec', but for template definitions of
1979 non-dependent expressions. NON_DEP is the non-dependent expression
1980 that has been built. */
1983 build_min_non_dep_call_vec (tree non_dep, tree fn, VEC(tree,gc) *argvec)
1985 tree t = build_nt_call_vec (fn, argvec);
1986 TREE_TYPE (t) = TREE_TYPE (non_dep);
1987 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (non_dep);
1992 get_type_decl (tree t)
1994 if (TREE_CODE (t) == TYPE_DECL)
1997 return TYPE_STUB_DECL (t);
1998 gcc_assert (t == error_mark_node);
2002 /* Returns the namespace that contains DECL, whether directly or
2006 decl_namespace_context (tree decl)
2010 if (TREE_CODE (decl) == NAMESPACE_DECL)
2012 else if (TYPE_P (decl))
2013 decl = CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl));
2015 decl = CP_DECL_CONTEXT (decl);
2019 /* Returns true if decl is within an anonymous namespace, however deeply
2020 nested, or false otherwise. */
2023 decl_anon_ns_mem_p (const_tree decl)
2027 if (decl == NULL_TREE || decl == error_mark_node)
2029 if (TREE_CODE (decl) == NAMESPACE_DECL
2030 && DECL_NAME (decl) == NULL_TREE)
2032 /* Classes and namespaces inside anonymous namespaces have
2033 TREE_PUBLIC == 0, so we can shortcut the search. */
2034 else if (TYPE_P (decl))
2035 return (TREE_PUBLIC (TYPE_NAME (decl)) == 0);
2036 else if (TREE_CODE (decl) == NAMESPACE_DECL)
2037 return (TREE_PUBLIC (decl) == 0);
2039 decl = DECL_CONTEXT (decl);
2043 /* Return truthvalue of whether T1 is the same tree structure as T2.
2044 Return 1 if they are the same. Return 0 if they are different. */
2047 cp_tree_equal (tree t1, tree t2)
2049 enum tree_code code1, code2;
2056 for (code1 = TREE_CODE (t1);
2057 CONVERT_EXPR_CODE_P (code1)
2058 || code1 == NON_LVALUE_EXPR;
2059 code1 = TREE_CODE (t1))
2060 t1 = TREE_OPERAND (t1, 0);
2061 for (code2 = TREE_CODE (t2);
2062 CONVERT_EXPR_CODE_P (code2)
2063 || code1 == NON_LVALUE_EXPR;
2064 code2 = TREE_CODE (t2))
2065 t2 = TREE_OPERAND (t2, 0);
2067 /* They might have become equal now. */
2077 return TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
2078 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2);
2081 return REAL_VALUES_EQUAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
2084 return TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
2085 && !memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
2086 TREE_STRING_LENGTH (t1));
2089 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1),
2090 TREE_FIXED_CST (t2));
2093 return cp_tree_equal (TREE_REALPART (t1), TREE_REALPART (t2))
2094 && cp_tree_equal (TREE_IMAGPART (t1), TREE_IMAGPART (t2));
2097 /* We need to do this when determining whether or not two
2098 non-type pointer to member function template arguments
2100 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
2101 || CONSTRUCTOR_NELTS (t1) != CONSTRUCTOR_NELTS (t2))
2106 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t1), i, field, value)
2108 constructor_elt *elt2 = CONSTRUCTOR_ELT (t2, i);
2109 if (!cp_tree_equal (field, elt2->index)
2110 || !cp_tree_equal (value, elt2->value))
2117 if (!cp_tree_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2)))
2119 if (!cp_tree_equal (TREE_VALUE (t1), TREE_VALUE (t2)))
2121 return cp_tree_equal (TREE_CHAIN (t1), TREE_CHAIN (t2));
2124 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
2129 call_expr_arg_iterator iter1, iter2;
2130 if (!cp_tree_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2)))
2132 for (arg1 = first_call_expr_arg (t1, &iter1),
2133 arg2 = first_call_expr_arg (t2, &iter2);
2135 arg1 = next_call_expr_arg (&iter1),
2136 arg2 = next_call_expr_arg (&iter2))
2137 if (!cp_tree_equal (arg1, arg2))
2146 tree o1 = TREE_OPERAND (t1, 0);
2147 tree o2 = TREE_OPERAND (t2, 0);
2149 /* Special case: if either target is an unallocated VAR_DECL,
2150 it means that it's going to be unified with whatever the
2151 TARGET_EXPR is really supposed to initialize, so treat it
2152 as being equivalent to anything. */
2153 if (TREE_CODE (o1) == VAR_DECL && DECL_NAME (o1) == NULL_TREE
2154 && !DECL_RTL_SET_P (o1))
2156 else if (TREE_CODE (o2) == VAR_DECL && DECL_NAME (o2) == NULL_TREE
2157 && !DECL_RTL_SET_P (o2))
2159 else if (!cp_tree_equal (o1, o2))
2162 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
2165 case WITH_CLEANUP_EXPR:
2166 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
2168 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
2171 if (TREE_OPERAND (t1, 1) != TREE_OPERAND (t2, 1))
2173 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
2176 /* For comparing uses of parameters in late-specified return types
2177 with an out-of-class definition of the function, but can also come
2178 up for expressions that involve 'this' in a member function
2180 if (same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
2182 if (DECL_ARTIFICIAL (t1) ^ DECL_ARTIFICIAL (t2))
2184 if (DECL_ARTIFICIAL (t1)
2185 || (DECL_PARM_LEVEL (t1) == DECL_PARM_LEVEL (t2)
2186 && DECL_PARM_INDEX (t1) == DECL_PARM_INDEX (t2)))
2195 case IDENTIFIER_NODE:
2200 return (BASELINK_BINFO (t1) == BASELINK_BINFO (t2)
2201 && BASELINK_ACCESS_BINFO (t1) == BASELINK_ACCESS_BINFO (t2)
2202 && cp_tree_equal (BASELINK_FUNCTIONS (t1),
2203 BASELINK_FUNCTIONS (t2)));
2205 case TEMPLATE_PARM_INDEX:
2206 if (TEMPLATE_PARM_NUM_SIBLINGS (t1)
2207 != TEMPLATE_PARM_NUM_SIBLINGS (t2))
2209 return (TEMPLATE_PARM_IDX (t1) == TEMPLATE_PARM_IDX (t2)
2210 && TEMPLATE_PARM_LEVEL (t1) == TEMPLATE_PARM_LEVEL (t2)
2211 && (TEMPLATE_PARM_PARAMETER_PACK (t1)
2212 == TEMPLATE_PARM_PARAMETER_PACK (t2))
2213 && same_type_p (TREE_TYPE (TEMPLATE_PARM_DECL (t1)),
2214 TREE_TYPE (TEMPLATE_PARM_DECL (t2))));
2216 case TEMPLATE_ID_EXPR:
2221 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
2223 vec1 = TREE_OPERAND (t1, 1);
2224 vec2 = TREE_OPERAND (t2, 1);
2227 return !vec1 && !vec2;
2229 if (TREE_VEC_LENGTH (vec1) != TREE_VEC_LENGTH (vec2))
2232 for (ix = TREE_VEC_LENGTH (vec1); ix--;)
2233 if (!cp_tree_equal (TREE_VEC_ELT (vec1, ix),
2234 TREE_VEC_ELT (vec2, ix)))
2243 tree o1 = TREE_OPERAND (t1, 0);
2244 tree o2 = TREE_OPERAND (t2, 0);
2246 if (TREE_CODE (o1) != TREE_CODE (o2))
2249 return same_type_p (o1, o2);
2251 return cp_tree_equal (o1, o2);
2256 tree t1_op1, t2_op1;
2258 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
2261 t1_op1 = TREE_OPERAND (t1, 1);
2262 t2_op1 = TREE_OPERAND (t2, 1);
2263 if (TREE_CODE (t1_op1) != TREE_CODE (t2_op1))
2266 return cp_tree_equal (TREE_OPERAND (t1, 2), TREE_OPERAND (t2, 2));
2270 /* Two pointer-to-members are the same if they point to the same
2271 field or function in the same class. */
2272 if (PTRMEM_CST_MEMBER (t1) != PTRMEM_CST_MEMBER (t2))
2275 return same_type_p (PTRMEM_CST_CLASS (t1), PTRMEM_CST_CLASS (t2));
2278 if (OVL_FUNCTION (t1) != OVL_FUNCTION (t2))
2280 return cp_tree_equal (OVL_CHAIN (t1), OVL_CHAIN (t2));
2283 if (TRAIT_EXPR_KIND (t1) != TRAIT_EXPR_KIND (t2))
2285 return same_type_p (TRAIT_EXPR_TYPE1 (t1), TRAIT_EXPR_TYPE1 (t2))
2286 && same_type_p (TRAIT_EXPR_TYPE2 (t1), TRAIT_EXPR_TYPE2 (t2));
2289 case STATIC_CAST_EXPR:
2290 case REINTERPRET_CAST_EXPR:
2291 case CONST_CAST_EXPR:
2292 case DYNAMIC_CAST_EXPR:
2294 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
2296 /* Now compare operands as usual. */
2303 switch (TREE_CODE_CLASS (code1))
2307 case tcc_comparison:
2308 case tcc_expression:
2315 n = TREE_OPERAND_LENGTH (t1);
2316 if (TREE_CODE_CLASS (code1) == tcc_vl_exp
2317 && n != TREE_OPERAND_LENGTH (t2))
2320 for (i = 0; i < n; ++i)
2321 if (!cp_tree_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i)))
2328 return same_type_p (t1, t2);
2332 /* We can get here with --disable-checking. */
2336 /* The type of ARG when used as an lvalue. */
2339 lvalue_type (tree arg)
2341 tree type = TREE_TYPE (arg);
2345 /* The type of ARG for printing error messages; denote lvalues with
2349 error_type (tree arg)
2351 tree type = TREE_TYPE (arg);
2353 if (TREE_CODE (type) == ARRAY_TYPE)
2355 else if (TREE_CODE (type) == ERROR_MARK)
2357 else if (real_lvalue_p (arg))
2358 type = build_reference_type (lvalue_type (arg));
2359 else if (MAYBE_CLASS_TYPE_P (type))
2360 type = lvalue_type (arg);
2365 /* Does FUNCTION use a variable-length argument list? */
2368 varargs_function_p (const_tree function)
2370 return stdarg_p (TREE_TYPE (function));
2373 /* Returns 1 if decl is a member of a class. */
2376 member_p (const_tree decl)
2378 const_tree const ctx = DECL_CONTEXT (decl);
2379 return (ctx && TYPE_P (ctx));
2382 /* Create a placeholder for member access where we don't actually have an
2383 object that the access is against. */
2386 build_dummy_object (tree type)
2388 tree decl = build1 (NOP_EXPR, build_pointer_type (type), void_zero_node);
2389 return cp_build_indirect_ref (decl, RO_NULL, tf_warning_or_error);
2392 /* We've gotten a reference to a member of TYPE. Return *this if appropriate,
2393 or a dummy object otherwise. If BINFOP is non-0, it is filled with the
2394 binfo path from current_class_type to TYPE, or 0. */
2397 maybe_dummy_object (tree type, tree* binfop)
2401 tree current = current_nonlambda_class_type ();
2404 && (binfo = lookup_base (current, type, ba_any, NULL)))
2408 /* Reference from a nested class member function. */
2410 binfo = TYPE_BINFO (type);
2416 if (current_class_ref
2417 /* current_class_ref might not correspond to current_class_type if
2418 we're in tsubst_default_argument or a lambda-declarator; in either
2419 case, we want to use current_class_ref if it matches CONTEXT. */
2420 && (same_type_ignoring_top_level_qualifiers_p
2421 (TREE_TYPE (current_class_ref), context)))
2422 decl = current_class_ref;
2423 else if (current != current_class_type
2424 && context == nonlambda_method_basetype ())
2425 /* In a lambda, need to go through 'this' capture. */
2426 decl = (build_x_indirect_ref
2427 ((lambda_expr_this_capture
2428 (CLASSTYPE_LAMBDA_EXPR (current_class_type))),
2429 RO_NULL, tf_warning_or_error));
2431 decl = build_dummy_object (context);
2436 /* Returns 1 if OB is a placeholder object, or a pointer to one. */
2439 is_dummy_object (const_tree ob)
2441 if (TREE_CODE (ob) == INDIRECT_REF)
2442 ob = TREE_OPERAND (ob, 0);
2443 return (TREE_CODE (ob) == NOP_EXPR
2444 && TREE_OPERAND (ob, 0) == void_zero_node);
2447 /* Returns 1 iff type T is something we want to treat as a scalar type for
2448 the purpose of deciding whether it is trivial/POD/standard-layout. */
2451 scalarish_type_p (const_tree t)
2453 if (t == error_mark_node)
2456 return (SCALAR_TYPE_P (t)
2457 || TREE_CODE (t) == VECTOR_TYPE);
2460 /* Returns true iff T requires non-trivial default initialization. */
2463 type_has_nontrivial_default_init (const_tree t)
2465 t = strip_array_types (CONST_CAST_TREE (t));
2467 if (CLASS_TYPE_P (t))
2468 return TYPE_HAS_COMPLEX_DFLT (t);
2473 /* Returns true iff copying an object of type T (including via move
2474 constructor) is non-trivial. That is, T has no non-trivial copy
2475 constructors and no non-trivial move constructors. */
2478 type_has_nontrivial_copy_init (const_tree t)
2480 t = strip_array_types (CONST_CAST_TREE (t));
2482 if (CLASS_TYPE_P (t))
2484 gcc_assert (COMPLETE_TYPE_P (t));
2485 return ((TYPE_HAS_COPY_CTOR (t)
2486 && TYPE_HAS_COMPLEX_COPY_CTOR (t))
2487 || TYPE_HAS_COMPLEX_MOVE_CTOR (t));
2493 /* Returns 1 iff type T is a trivially copyable type, as defined in
2494 [basic.types] and [class]. */
2497 trivially_copyable_p (const_tree t)
2499 t = strip_array_types (CONST_CAST_TREE (t));
2501 if (CLASS_TYPE_P (t))
2502 return ((!TYPE_HAS_COPY_CTOR (t)
2503 || !TYPE_HAS_COMPLEX_COPY_CTOR (t))
2504 && !TYPE_HAS_COMPLEX_MOVE_CTOR (t)
2505 && (!TYPE_HAS_COPY_ASSIGN (t)
2506 || !TYPE_HAS_COMPLEX_COPY_ASSIGN (t))
2507 && !TYPE_HAS_COMPLEX_MOVE_ASSIGN (t)
2508 && TYPE_HAS_TRIVIAL_DESTRUCTOR (t));
2510 return scalarish_type_p (t);
2513 /* Returns 1 iff type T is a trivial type, as defined in [basic.types] and
2517 trivial_type_p (const_tree t)
2519 t = strip_array_types (CONST_CAST_TREE (t));
2521 if (CLASS_TYPE_P (t))
2522 return (TYPE_HAS_TRIVIAL_DFLT (t)
2523 && trivially_copyable_p (t));
2525 return scalarish_type_p (t);
2528 /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */
2531 pod_type_p (const_tree t)
2533 /* This CONST_CAST is okay because strip_array_types returns its
2534 argument unmodified and we assign it to a const_tree. */
2535 t = strip_array_types (CONST_CAST_TREE(t));
2537 if (!CLASS_TYPE_P (t))
2538 return scalarish_type_p (t);
2539 else if (cxx_dialect > cxx98)
2540 /* [class]/10: A POD struct is a class that is both a trivial class and a
2541 standard-layout class, and has no non-static data members of type
2542 non-POD struct, non-POD union (or array of such types).
2544 We don't need to check individual members because if a member is
2545 non-std-layout or non-trivial, the class will be too. */
2546 return (std_layout_type_p (t) && trivial_type_p (t));
2548 /* The C++98 definition of POD is different. */
2549 return !CLASSTYPE_NON_LAYOUT_POD_P (t);
2552 /* Returns true iff T is POD for the purpose of layout, as defined in the
2556 layout_pod_type_p (const_tree t)
2558 t = strip_array_types (CONST_CAST_TREE (t));
2560 if (CLASS_TYPE_P (t))
2561 return !CLASSTYPE_NON_LAYOUT_POD_P (t);
2563 return scalarish_type_p (t);
2566 /* Returns true iff T is a standard-layout type, as defined in
2570 std_layout_type_p (const_tree t)
2572 t = strip_array_types (CONST_CAST_TREE (t));
2574 if (CLASS_TYPE_P (t))
2575 return !CLASSTYPE_NON_STD_LAYOUT (t);
2577 return scalarish_type_p (t);
2580 /* Nonzero iff type T is a class template implicit specialization. */
2583 class_tmpl_impl_spec_p (const_tree t)
2585 return CLASS_TYPE_P (t) && CLASSTYPE_TEMPLATE_INSTANTIATION (t);
2588 /* Returns 1 iff zero initialization of type T means actually storing
2592 zero_init_p (const_tree t)
2594 /* This CONST_CAST is okay because strip_array_types returns its
2595 argument unmodified and we assign it to a const_tree. */
2596 t = strip_array_types (CONST_CAST_TREE(t));
2598 if (t == error_mark_node)
2601 /* NULL pointers to data members are initialized with -1. */
2602 if (TYPE_PTRMEM_P (t))
2605 /* Classes that contain types that can't be zero-initialized, cannot
2606 be zero-initialized themselves. */
2607 if (CLASS_TYPE_P (t) && CLASSTYPE_NON_ZERO_INIT_P (t))
2613 /* Table of valid C++ attributes. */
2614 const struct attribute_spec cxx_attribute_table[] =
2616 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
2617 affects_type_identity } */
2618 { "java_interface", 0, 0, false, false, false,
2619 handle_java_interface_attribute, false },
2620 { "com_interface", 0, 0, false, false, false,
2621 handle_com_interface_attribute, false },
2622 { "init_priority", 1, 1, true, false, false,
2623 handle_init_priority_attribute, false },
2624 { NULL, 0, 0, false, false, false, NULL, false }
2627 /* Handle a "java_interface" attribute; arguments as in
2628 struct attribute_spec.handler. */
2630 handle_java_interface_attribute (tree* node,
2632 tree args ATTRIBUTE_UNUSED ,
2637 || !CLASS_TYPE_P (*node)
2638 || !TYPE_FOR_JAVA (*node))
2640 error ("%qE attribute can only be applied to Java class definitions",
2642 *no_add_attrs = true;
2645 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
2646 *node = build_variant_type_copy (*node);
2647 TYPE_JAVA_INTERFACE (*node) = 1;
2652 /* Handle a "com_interface" attribute; arguments as in
2653 struct attribute_spec.handler. */
2655 handle_com_interface_attribute (tree* node,
2657 tree args ATTRIBUTE_UNUSED ,
2658 int flags ATTRIBUTE_UNUSED ,
2663 *no_add_attrs = true;
2666 || !CLASS_TYPE_P (*node)
2667 || *node != TYPE_MAIN_VARIANT (*node))
2669 warning (OPT_Wattributes, "%qE attribute can only be applied "
2670 "to class definitions", name);
2675 warning (0, "%qE is obsolete; g++ vtables are now COM-compatible by default",
2681 /* Handle an "init_priority" attribute; arguments as in
2682 struct attribute_spec.handler. */
2684 handle_init_priority_attribute (tree* node,
2687 int flags ATTRIBUTE_UNUSED ,
2690 tree initp_expr = TREE_VALUE (args);
2692 tree type = TREE_TYPE (decl);
2695 STRIP_NOPS (initp_expr);
2697 if (!initp_expr || TREE_CODE (initp_expr) != INTEGER_CST)
2699 error ("requested init_priority is not an integer constant");
2700 *no_add_attrs = true;
2704 pri = TREE_INT_CST_LOW (initp_expr);
2706 type = strip_array_types (type);
2708 if (decl == NULL_TREE
2709 || TREE_CODE (decl) != VAR_DECL
2710 || !TREE_STATIC (decl)
2711 || DECL_EXTERNAL (decl)
2712 || (TREE_CODE (type) != RECORD_TYPE
2713 && TREE_CODE (type) != UNION_TYPE)
2714 /* Static objects in functions are initialized the
2715 first time control passes through that
2716 function. This is not precise enough to pin down an
2717 init_priority value, so don't allow it. */
2718 || current_function_decl)
2720 error ("can only use %qE attribute on file-scope definitions "
2721 "of objects of class type", name);
2722 *no_add_attrs = true;
2726 if (pri > MAX_INIT_PRIORITY || pri <= 0)
2728 error ("requested init_priority is out of range");
2729 *no_add_attrs = true;
2733 /* Check for init_priorities that are reserved for
2734 language and runtime support implementations.*/
2735 if (pri <= MAX_RESERVED_INIT_PRIORITY)
2738 (0, "requested init_priority is reserved for internal use");
2741 if (SUPPORTS_INIT_PRIORITY)
2743 SET_DECL_INIT_PRIORITY (decl, pri);
2744 DECL_HAS_INIT_PRIORITY_P (decl) = 1;
2749 error ("%qE attribute is not supported on this platform", name);
2750 *no_add_attrs = true;
2755 /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the
2756 thing pointed to by the constant. */
2759 make_ptrmem_cst (tree type, tree member)
2761 tree ptrmem_cst = make_node (PTRMEM_CST);
2762 TREE_TYPE (ptrmem_cst) = type;
2763 PTRMEM_CST_MEMBER (ptrmem_cst) = member;
2767 /* Build a variant of TYPE that has the indicated ATTRIBUTES. May
2768 return an existing type if an appropriate type already exists. */
2771 cp_build_type_attribute_variant (tree type, tree attributes)
2775 new_type = build_type_attribute_variant (type, attributes);
2776 if (TREE_CODE (new_type) == FUNCTION_TYPE
2777 || TREE_CODE (new_type) == METHOD_TYPE)
2778 new_type = build_exception_variant (new_type,
2779 TYPE_RAISES_EXCEPTIONS (type));
2781 /* Making a new main variant of a class type is broken. */
2782 gcc_assert (!CLASS_TYPE_P (type) || new_type == type);
2787 /* Return TRUE if TYPE1 and TYPE2 are identical for type hashing purposes.
2788 Called only after doing all language independent checks. Only
2789 to check TYPE_RAISES_EXCEPTIONS for FUNCTION_TYPE, the rest is already
2790 compared in type_hash_eq. */
2793 cxx_type_hash_eq (const_tree typea, const_tree typeb)
2795 gcc_assert (TREE_CODE (typea) == FUNCTION_TYPE
2796 || TREE_CODE (typea) == METHOD_TYPE);
2798 return comp_except_specs (TYPE_RAISES_EXCEPTIONS (typea),
2799 TYPE_RAISES_EXCEPTIONS (typeb), ce_exact);
2802 /* Apply FUNC to all language-specific sub-trees of TP in a pre-order
2803 traversal. Called from walk_tree. */
2806 cp_walk_subtrees (tree *tp, int *walk_subtrees_p, walk_tree_fn func,
2807 void *data, struct pointer_set_t *pset)
2809 enum tree_code code = TREE_CODE (*tp);
2812 #define WALK_SUBTREE(NODE) \
2815 result = cp_walk_tree (&(NODE), func, data, pset); \
2816 if (result) goto out; \
2820 /* Not one of the easy cases. We must explicitly go through the
2826 case TEMPLATE_TEMPLATE_PARM:
2827 case BOUND_TEMPLATE_TEMPLATE_PARM:
2828 case UNBOUND_CLASS_TEMPLATE:
2829 case TEMPLATE_PARM_INDEX:
2830 case TEMPLATE_TYPE_PARM:
2833 /* None of these have subtrees other than those already walked
2835 *walk_subtrees_p = 0;
2839 WALK_SUBTREE (BASELINK_FUNCTIONS (*tp));
2840 *walk_subtrees_p = 0;
2844 WALK_SUBTREE (TREE_TYPE (*tp));
2845 *walk_subtrees_p = 0;
2849 WALK_SUBTREE (TREE_PURPOSE (*tp));
2853 WALK_SUBTREE (OVL_FUNCTION (*tp));
2854 WALK_SUBTREE (OVL_CHAIN (*tp));
2855 *walk_subtrees_p = 0;
2859 WALK_SUBTREE (DECL_NAME (*tp));
2860 WALK_SUBTREE (USING_DECL_SCOPE (*tp));
2861 WALK_SUBTREE (USING_DECL_DECLS (*tp));
2862 *walk_subtrees_p = 0;
2866 if (TYPE_PTRMEMFUNC_P (*tp))
2867 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (*tp));
2870 case TYPE_ARGUMENT_PACK:
2871 case NONTYPE_ARGUMENT_PACK:
2873 tree args = ARGUMENT_PACK_ARGS (*tp);
2874 int i, len = TREE_VEC_LENGTH (args);
2875 for (i = 0; i < len; i++)
2876 WALK_SUBTREE (TREE_VEC_ELT (args, i));
2880 case TYPE_PACK_EXPANSION:
2881 WALK_SUBTREE (TREE_TYPE (*tp));
2882 *walk_subtrees_p = 0;
2885 case EXPR_PACK_EXPANSION:
2886 WALK_SUBTREE (TREE_OPERAND (*tp, 0));
2887 *walk_subtrees_p = 0;
2891 case REINTERPRET_CAST_EXPR:
2892 case STATIC_CAST_EXPR:
2893 case CONST_CAST_EXPR:
2894 case DYNAMIC_CAST_EXPR:
2895 if (TREE_TYPE (*tp))
2896 WALK_SUBTREE (TREE_TYPE (*tp));
2900 for (i = 0; i < TREE_CODE_LENGTH (TREE_CODE (*tp)); ++i)
2901 WALK_SUBTREE (TREE_OPERAND (*tp, i));
2903 *walk_subtrees_p = 0;
2907 WALK_SUBTREE (TRAIT_EXPR_TYPE1 (*tp));
2908 WALK_SUBTREE (TRAIT_EXPR_TYPE2 (*tp));
2909 *walk_subtrees_p = 0;
2913 WALK_SUBTREE (DECLTYPE_TYPE_EXPR (*tp));
2914 *walk_subtrees_p = 0;
2922 /* We didn't find what we were looking for. */
2929 /* Like save_expr, but for C++. */
2932 cp_save_expr (tree expr)
2934 /* There is no reason to create a SAVE_EXPR within a template; if
2935 needed, we can create the SAVE_EXPR when instantiating the
2936 template. Furthermore, the middle-end cannot handle C++-specific
2938 if (processing_template_decl)
2940 return save_expr (expr);
2943 /* Initialize tree.c. */
2948 list_hash_table = htab_create_ggc (31, list_hash, list_hash_eq, NULL);
2951 /* Returns the kind of special function that DECL (a FUNCTION_DECL)
2952 is. Note that sfk_none is zero, so this function can be used as a
2953 predicate to test whether or not DECL is a special function. */
2955 special_function_kind
2956 special_function_p (const_tree decl)
2958 /* Rather than doing all this stuff with magic names, we should
2959 probably have a field of type `special_function_kind' in
2960 DECL_LANG_SPECIFIC. */
2961 if (DECL_COPY_CONSTRUCTOR_P (decl))
2962 return sfk_copy_constructor;
2963 if (DECL_MOVE_CONSTRUCTOR_P (decl))
2964 return sfk_move_constructor;
2965 if (DECL_CONSTRUCTOR_P (decl))
2966 return sfk_constructor;
2967 if (DECL_OVERLOADED_OPERATOR_P (decl) == NOP_EXPR)
2969 if (copy_fn_p (decl))
2970 return sfk_copy_assignment;
2971 if (move_fn_p (decl))
2972 return sfk_move_assignment;
2974 if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl))
2975 return sfk_destructor;
2976 if (DECL_COMPLETE_DESTRUCTOR_P (decl))
2977 return sfk_complete_destructor;
2978 if (DECL_BASE_DESTRUCTOR_P (decl))
2979 return sfk_base_destructor;
2980 if (DECL_DELETING_DESTRUCTOR_P (decl))
2981 return sfk_deleting_destructor;
2982 if (DECL_CONV_FN_P (decl))
2983 return sfk_conversion;
2988 /* Returns nonzero if TYPE is a character type, including wchar_t. */
2991 char_type_p (tree type)
2993 return (same_type_p (type, char_type_node)
2994 || same_type_p (type, unsigned_char_type_node)
2995 || same_type_p (type, signed_char_type_node)
2996 || same_type_p (type, char16_type_node)
2997 || same_type_p (type, char32_type_node)
2998 || same_type_p (type, wchar_type_node));
3001 /* Returns the kind of linkage associated with the indicated DECL. Th
3002 value returned is as specified by the language standard; it is
3003 independent of implementation details regarding template
3004 instantiation, etc. For example, it is possible that a declaration
3005 to which this function assigns external linkage would not show up
3006 as a global symbol when you run `nm' on the resulting object file. */
3009 decl_linkage (tree decl)
3011 /* This function doesn't attempt to calculate the linkage from first
3012 principles as given in [basic.link]. Instead, it makes use of
3013 the fact that we have already set TREE_PUBLIC appropriately, and
3014 then handles a few special cases. Ideally, we would calculate
3015 linkage first, and then transform that into a concrete
3018 /* Things that don't have names have no linkage. */
3019 if (!DECL_NAME (decl))
3022 /* Fields have no linkage. */
3023 if (TREE_CODE (decl) == FIELD_DECL)
3026 /* Things that are TREE_PUBLIC have external linkage. */
3027 if (TREE_PUBLIC (decl))
3030 if (TREE_CODE (decl) == NAMESPACE_DECL)
3033 /* Linkage of a CONST_DECL depends on the linkage of the enumeration
3035 if (TREE_CODE (decl) == CONST_DECL)
3036 return decl_linkage (TYPE_NAME (TREE_TYPE (decl)));
3038 /* Some things that are not TREE_PUBLIC have external linkage, too.
3039 For example, on targets that don't have weak symbols, we make all
3040 template instantiations have internal linkage (in the object
3041 file), but the symbols should still be treated as having external
3042 linkage from the point of view of the language. */
3043 if ((TREE_CODE (decl) == FUNCTION_DECL
3044 || TREE_CODE (decl) == VAR_DECL)
3045 && DECL_COMDAT (decl))
3048 /* Things in local scope do not have linkage, if they don't have
3050 if (decl_function_context (decl))
3053 /* Members of the anonymous namespace also have TREE_PUBLIC unset, but
3054 are considered to have external linkage for language purposes. DECLs
3055 really meant to have internal linkage have DECL_THIS_STATIC set. */
3056 if (TREE_CODE (decl) == TYPE_DECL)
3058 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == FUNCTION_DECL)
3060 if (!DECL_THIS_STATIC (decl))
3063 /* Static data members and static member functions from classes
3064 in anonymous namespace also don't have TREE_PUBLIC set. */
3065 if (DECL_CLASS_CONTEXT (decl))
3069 /* Everything else has internal linkage. */
3073 /* Returns the storage duration of the object or reference associated with
3074 the indicated DECL, which should be a VAR_DECL or PARM_DECL. */
3077 decl_storage_duration (tree decl)
3079 if (TREE_CODE (decl) == PARM_DECL)
3081 if (TREE_CODE (decl) == FUNCTION_DECL)
3083 gcc_assert (TREE_CODE (decl) == VAR_DECL);
3084 if (!TREE_STATIC (decl)
3085 && !DECL_EXTERNAL (decl))
3087 if (DECL_THREAD_LOCAL_P (decl))
3092 /* EXP is an expression that we want to pre-evaluate. Returns (in
3093 *INITP) an expression that will perform the pre-evaluation. The
3094 value returned by this function is a side-effect free expression
3095 equivalent to the pre-evaluated expression. Callers must ensure
3096 that *INITP is evaluated before EXP. */
3099 stabilize_expr (tree exp, tree* initp)
3103 if (!TREE_SIDE_EFFECTS (exp))
3104 init_expr = NULL_TREE;
3105 else if (!TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (exp))
3106 || !lvalue_or_rvalue_with_address_p (exp))
3108 init_expr = get_target_expr (exp);
3109 exp = TARGET_EXPR_SLOT (init_expr);
3113 bool xval = !real_lvalue_p (exp);
3114 exp = cp_build_addr_expr (exp, tf_warning_or_error);
3115 init_expr = get_target_expr (exp);
3116 exp = TARGET_EXPR_SLOT (init_expr);
3117 exp = cp_build_indirect_ref (exp, RO_NULL, tf_warning_or_error);
3123 gcc_assert (!TREE_SIDE_EFFECTS (exp));
3127 /* Add NEW_EXPR, an expression whose value we don't care about, after the
3128 similar expression ORIG. */
3131 add_stmt_to_compound (tree orig, tree new_expr)
3133 if (!new_expr || !TREE_SIDE_EFFECTS (new_expr))
3135 if (!orig || !TREE_SIDE_EFFECTS (orig))
3137 return build2 (COMPOUND_EXPR, void_type_node, orig, new_expr);
3140 /* Like stabilize_expr, but for a call whose arguments we want to
3141 pre-evaluate. CALL is modified in place to use the pre-evaluated
3142 arguments, while, upon return, *INITP contains an expression to
3143 compute the arguments. */
3146 stabilize_call (tree call, tree *initp)
3148 tree inits = NULL_TREE;
3150 int nargs = call_expr_nargs (call);
3152 if (call == error_mark_node || processing_template_decl)
3158 gcc_assert (TREE_CODE (call) == CALL_EXPR);
3160 for (i = 0; i < nargs; i++)
3163 CALL_EXPR_ARG (call, i) =
3164 stabilize_expr (CALL_EXPR_ARG (call, i), &init);
3165 inits = add_stmt_to_compound (inits, init);
3171 /* Like stabilize_expr, but for an AGGR_INIT_EXPR whose arguments we want
3172 to pre-evaluate. CALL is modified in place to use the pre-evaluated
3173 arguments, while, upon return, *INITP contains an expression to
3174 compute the arguments. */
3177 stabilize_aggr_init (tree call, tree *initp)
3179 tree inits = NULL_TREE;
3181 int nargs = aggr_init_expr_nargs (call);
3183 if (call == error_mark_node)
3186 gcc_assert (TREE_CODE (call) == AGGR_INIT_EXPR);
3188 for (i = 0; i < nargs; i++)
3191 AGGR_INIT_EXPR_ARG (call, i) =
3192 stabilize_expr (AGGR_INIT_EXPR_ARG (call, i), &init);
3193 inits = add_stmt_to_compound (inits, init);
3199 /* Like stabilize_expr, but for an initialization.
3201 If the initialization is for an object of class type, this function
3202 takes care not to introduce additional temporaries.
3204 Returns TRUE iff the expression was successfully pre-evaluated,
3205 i.e., if INIT is now side-effect free, except for, possible, a
3206 single call to a constructor. */
3209 stabilize_init (tree init, tree *initp)
3215 if (t == error_mark_node || processing_template_decl)
3218 if (TREE_CODE (t) == INIT_EXPR
3219 && TREE_CODE (TREE_OPERAND (t, 1)) != TARGET_EXPR
3220 && TREE_CODE (TREE_OPERAND (t, 1)) != AGGR_INIT_EXPR)
3222 TREE_OPERAND (t, 1) = stabilize_expr (TREE_OPERAND (t, 1), initp);
3226 if (TREE_CODE (t) == INIT_EXPR)
3227 t = TREE_OPERAND (t, 1);
3228 if (TREE_CODE (t) == TARGET_EXPR)
3229 t = TARGET_EXPR_INITIAL (t);
3230 if (TREE_CODE (t) == COMPOUND_EXPR)
3232 if (TREE_CODE (t) == CONSTRUCTOR
3233 && EMPTY_CONSTRUCTOR_P (t))
3234 /* Default-initialization. */
3237 /* If the initializer is a COND_EXPR, we can't preevaluate
3239 if (TREE_CODE (t) == COND_EXPR)
3242 if (TREE_CODE (t) == CALL_EXPR)
3244 stabilize_call (t, initp);
3248 if (TREE_CODE (t) == AGGR_INIT_EXPR)
3250 stabilize_aggr_init (t, initp);
3254 /* The initialization is being performed via a bitwise copy -- and
3255 the item copied may have side effects. */
3256 return TREE_SIDE_EFFECTS (init);
3259 /* Like "fold", but should be used whenever we might be processing the
3260 body of a template. */
3263 fold_if_not_in_template (tree expr)
3265 /* In the body of a template, there is never any need to call
3266 "fold". We will call fold later when actually instantiating the
3267 template. Integral constant expressions in templates will be
3268 evaluated via fold_non_dependent_expr, as necessary. */
3269 if (processing_template_decl)
3272 /* Fold C++ front-end specific tree codes. */
3273 if (TREE_CODE (expr) == UNARY_PLUS_EXPR)
3274 return fold_convert (TREE_TYPE (expr), TREE_OPERAND (expr, 0));
3279 /* Returns true if a cast to TYPE may appear in an integral constant
3283 cast_valid_in_integral_constant_expression_p (tree type)
3285 return (INTEGRAL_OR_ENUMERATION_TYPE_P (type)
3286 || cxx_dialect >= cxx0x
3287 || dependent_type_p (type)
3288 || type == error_mark_node);
3291 /* Return true if we need to fix linkage information of DECL. */
3294 cp_fix_function_decl_p (tree decl)
3296 /* Skip if DECL is not externally visible. */
3297 if (!TREE_PUBLIC (decl))
3300 /* We need to fix DECL if it a appears to be exported but with no
3301 function body. Thunks do not have CFGs and we may need to
3302 handle them specially later. */
3303 if (!gimple_has_body_p (decl)
3304 && !DECL_THUNK_P (decl)
3305 && !DECL_EXTERNAL (decl))
3307 struct cgraph_node *node = cgraph_get_node (decl);
3309 /* Don't fix same_body aliases. Although they don't have their own
3310 CFG, they share it with what they alias to. */
3312 || node->decl == decl
3313 || !node->same_body)
3320 /* Clean the C++ specific parts of the tree T. */
3323 cp_free_lang_data (tree t)
3325 if (TREE_CODE (t) == METHOD_TYPE
3326 || TREE_CODE (t) == FUNCTION_TYPE)
3328 /* Default args are not interesting anymore. */
3329 tree argtypes = TYPE_ARG_TYPES (t);
3332 TREE_PURPOSE (argtypes) = 0;
3333 argtypes = TREE_CHAIN (argtypes);
3336 else if (TREE_CODE (t) == FUNCTION_DECL
3337 && cp_fix_function_decl_p (t))
3339 /* If T is used in this translation unit at all, the definition
3340 must exist somewhere else since we have decided to not emit it
3341 in this TU. So make it an external reference. */
3342 DECL_EXTERNAL (t) = 1;
3343 TREE_STATIC (t) = 0;
3345 if (CP_AGGREGATE_TYPE_P (t)
3348 tree name = TYPE_NAME (t);
3349 if (TREE_CODE (name) == TYPE_DECL)
3350 name = DECL_NAME (name);
3351 /* Drop anonymous names. */
3352 if (name != NULL_TREE
3353 && ANON_AGGRNAME_P (name))
3354 TYPE_NAME (t) = NULL_TREE;
3356 if (TREE_CODE (t) == NAMESPACE_DECL)
3358 /* The list of users of a namespace isn't useful for the middle-end
3359 or debug generators. */
3360 DECL_NAMESPACE_USERS (t) = NULL_TREE;
3361 /* Neither do we need the leftover chaining of namespaces
3362 from the binding level. */
3363 DECL_CHAIN (t) = NULL_TREE;
3367 /* Stub for c-common. Please keep in sync with c-decl.c.
3368 FIXME: If address space support is target specific, then this
3369 should be a C target hook. But currently this is not possible,
3370 because this function is called via REGISTER_TARGET_PRAGMAS. */
3372 c_register_addr_space (const char *word ATTRIBUTE_UNUSED,
3373 addr_space_t as ATTRIBUTE_UNUSED)
3378 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3379 /* Complain that some language-specific thing hanging off a tree
3380 node has been accessed improperly. */
3383 lang_check_failed (const char* file, int line, const char* function)
3385 internal_error ("lang_* check: failed in %s, at %s:%d",
3386 function, trim_filename (file), line);
3388 #endif /* ENABLE_TREE_CHECKING */
3390 #include "gt-cp-tree.h"