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
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"
33 #include "insn-config.h"
34 #include "integrate.h"
35 #include "tree-inline.h"
39 #include "tree-flow.h"
41 static tree bot_manip (tree *, int *, void *);
42 static tree bot_replace (tree *, int *, void *);
43 static tree build_cplus_array_type_1 (tree, tree);
44 static int list_hash_eq (const void *, const void *);
45 static hashval_t list_hash_pieces (tree, tree, tree);
46 static hashval_t list_hash (const void *);
47 static cp_lvalue_kind lvalue_p_1 (const_tree, int);
48 static tree build_target_expr (tree, tree);
49 static tree count_trees_r (tree *, int *, void *);
50 static tree verify_stmt_tree_r (tree *, int *, void *);
51 static tree build_local_temp (tree);
53 static tree handle_java_interface_attribute (tree *, tree, tree, int, bool *);
54 static tree handle_com_interface_attribute (tree *, tree, tree, int, bool *);
55 static tree handle_init_priority_attribute (tree *, tree, tree, int, bool *);
57 /* If REF is an lvalue, returns the kind of lvalue that REF is.
58 Otherwise, returns clk_none. If TREAT_CLASS_RVALUES_AS_LVALUES is
59 nonzero, rvalues of class type are considered lvalues. */
62 lvalue_p_1 (const_tree ref,
63 int treat_class_rvalues_as_lvalues)
65 cp_lvalue_kind op1_lvalue_kind = clk_none;
66 cp_lvalue_kind op2_lvalue_kind = clk_none;
68 /* Expressions of reference type are sometimes wrapped in
69 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
70 representation, not part of the language, so we have to look
72 if (TREE_CODE (ref) == INDIRECT_REF
73 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref, 0)))
75 return lvalue_p_1 (TREE_OPERAND (ref, 0),
76 treat_class_rvalues_as_lvalues);
78 if (TREE_CODE (TREE_TYPE (ref)) == REFERENCE_TYPE)
80 /* unnamed rvalue references are rvalues */
81 if (TYPE_REF_IS_RVALUE (TREE_TYPE (ref))
82 && TREE_CODE (ref) != PARM_DECL
83 && TREE_CODE (ref) != VAR_DECL
84 && TREE_CODE (ref) != COMPONENT_REF)
86 if (CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (ref))))
87 return treat_class_rvalues_as_lvalues ? clk_class : clk_none;
92 /* lvalue references and named rvalue references are lvalues. */
96 if (ref == current_class_ptr)
99 switch (TREE_CODE (ref))
103 /* preincrements and predecrements are valid lvals, provided
104 what they refer to are valid lvals. */
105 case PREINCREMENT_EXPR:
106 case PREDECREMENT_EXPR:
108 case WITH_CLEANUP_EXPR:
111 return lvalue_p_1 (TREE_OPERAND (ref, 0),
112 treat_class_rvalues_as_lvalues);
115 op1_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 0),
116 treat_class_rvalues_as_lvalues);
117 /* Look at the member designator. */
118 if (!op1_lvalue_kind)
120 else if (is_overloaded_fn (TREE_OPERAND (ref, 1)))
121 /* The "field" can be a FUNCTION_DECL or an OVERLOAD in some
122 situations. If we're seeing a COMPONENT_REF, it's a non-static
123 member, so it isn't an lvalue. */
124 op1_lvalue_kind = clk_none;
125 else if (TREE_CODE (TREE_OPERAND (ref, 1)) != FIELD_DECL)
126 /* This can be IDENTIFIER_NODE in a template. */;
127 else if (DECL_C_BIT_FIELD (TREE_OPERAND (ref, 1)))
129 /* Clear the ordinary bit. If this object was a class
130 rvalue we want to preserve that information. */
131 op1_lvalue_kind &= ~clk_ordinary;
132 /* The lvalue is for a bitfield. */
133 op1_lvalue_kind |= clk_bitfield;
135 else if (DECL_PACKED (TREE_OPERAND (ref, 1)))
136 op1_lvalue_kind |= clk_packed;
138 return op1_lvalue_kind;
141 case COMPOUND_LITERAL_EXPR:
146 if (TREE_READONLY (ref) && ! TREE_STATIC (ref)
147 && DECL_LANG_SPECIFIC (ref)
148 && DECL_IN_AGGR_P (ref))
154 if (TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE)
158 /* A currently unresolved scope ref. */
163 /* Disallow <? and >? as lvalues if either argument side-effects. */
164 if (TREE_SIDE_EFFECTS (TREE_OPERAND (ref, 0))
165 || TREE_SIDE_EFFECTS (TREE_OPERAND (ref, 1)))
167 op1_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 0),
168 treat_class_rvalues_as_lvalues);
169 op2_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 1),
170 treat_class_rvalues_as_lvalues);
174 op1_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 1)
175 ? TREE_OPERAND (ref, 1)
176 : TREE_OPERAND (ref, 0),
177 treat_class_rvalues_as_lvalues);
178 op2_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 2),
179 treat_class_rvalues_as_lvalues);
186 return lvalue_p_1 (TREE_OPERAND (ref, 1),
187 treat_class_rvalues_as_lvalues);
190 return treat_class_rvalues_as_lvalues ? clk_class : clk_none;
193 return (treat_class_rvalues_as_lvalues
194 && CLASS_TYPE_P (TREE_TYPE (ref))
195 ? clk_class : clk_none);
198 /* Any class-valued call would be wrapped in a TARGET_EXPR. */
202 /* All functions (except non-static-member functions) are
204 return (DECL_NONSTATIC_MEMBER_FUNCTION_P (ref)
205 ? clk_none : clk_ordinary);
208 /* We now represent a reference to a single static member function
210 /* This CONST_CAST is okay because BASELINK_FUNCTIONS returns
211 its argument unmodified and we assign it to a const_tree. */
212 return lvalue_p_1 (BASELINK_FUNCTIONS (CONST_CAST_TREE (ref)),
213 treat_class_rvalues_as_lvalues);
215 case NON_DEPENDENT_EXPR:
216 /* We must consider NON_DEPENDENT_EXPRs to be lvalues so that
217 things like "&E" where "E" is an expression with a
218 non-dependent type work. It is safe to be lenient because an
219 error will be issued when the template is instantiated if "E"
227 /* If one operand is not an lvalue at all, then this expression is
229 if (!op1_lvalue_kind || !op2_lvalue_kind)
232 /* Otherwise, it's an lvalue, and it has all the odd properties
233 contributed by either operand. */
234 op1_lvalue_kind = op1_lvalue_kind | op2_lvalue_kind;
235 /* It's not an ordinary lvalue if it involves either a bit-field or
237 if ((op1_lvalue_kind & ~clk_ordinary) != clk_none)
238 op1_lvalue_kind &= ~clk_ordinary;
239 return op1_lvalue_kind;
242 /* Returns the kind of lvalue that REF is, in the sense of
243 [basic.lval]. This function should really be named lvalue_p; it
244 computes the C++ definition of lvalue. */
247 real_lvalue_p (tree ref)
249 return lvalue_p_1 (ref,
250 /*treat_class_rvalues_as_lvalues=*/0);
253 /* This differs from real_lvalue_p in that class rvalues are
254 considered lvalues. */
257 lvalue_p (const_tree ref)
260 (lvalue_p_1 (ref, /*class rvalue ok*/ 1) != clk_none);
263 /* Test whether DECL is a builtin that may appear in a
264 constant-expression. */
267 builtin_valid_in_constant_expr_p (const_tree decl)
269 /* At present BUILT_IN_CONSTANT_P is the only builtin we're allowing
270 in constant-expressions. We may want to add other builtins later. */
271 return DECL_IS_BUILTIN_CONSTANT_P (decl);
274 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
277 build_target_expr (tree decl, tree value)
281 #ifdef ENABLE_CHECKING
282 gcc_assert (VOID_TYPE_P (TREE_TYPE (value))
283 || TREE_TYPE (decl) == TREE_TYPE (value)
284 || useless_type_conversion_p (TREE_TYPE (decl),
288 t = build4 (TARGET_EXPR, TREE_TYPE (decl), decl, value,
289 cxx_maybe_build_cleanup (decl), NULL_TREE);
290 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
291 ignore the TARGET_EXPR. If there really turn out to be no
292 side-effects, then the optimizer should be able to get rid of
293 whatever code is generated anyhow. */
294 TREE_SIDE_EFFECTS (t) = 1;
299 /* Return an undeclared local temporary of type TYPE for use in building a
303 build_local_temp (tree type)
305 tree slot = build_decl (VAR_DECL, NULL_TREE, type);
306 DECL_ARTIFICIAL (slot) = 1;
307 DECL_IGNORED_P (slot) = 1;
308 DECL_CONTEXT (slot) = current_function_decl;
309 layout_decl (slot, 0);
313 /* Set various status flags when building an AGGR_INIT_EXPR object T. */
316 process_aggr_init_operands (tree t)
320 side_effects = TREE_SIDE_EFFECTS (t);
324 n = TREE_OPERAND_LENGTH (t);
325 for (i = 1; i < n; i++)
327 tree op = TREE_OPERAND (t, i);
328 if (op && TREE_SIDE_EFFECTS (op))
335 TREE_SIDE_EFFECTS (t) = side_effects;
338 /* Build an AGGR_INIT_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE,
339 FN, and SLOT. NARGS is the number of call arguments which are specified
340 as a tree array ARGS. */
343 build_aggr_init_array (tree return_type, tree fn, tree slot, int nargs,
349 t = build_vl_exp (AGGR_INIT_EXPR, nargs + 3);
350 TREE_TYPE (t) = return_type;
351 AGGR_INIT_EXPR_FN (t) = fn;
352 AGGR_INIT_EXPR_SLOT (t) = slot;
353 for (i = 0; i < nargs; i++)
354 AGGR_INIT_EXPR_ARG (t, i) = args[i];
355 process_aggr_init_operands (t);
359 /* INIT is a CALL_EXPR or AGGR_INIT_EXPR which needs info about its
360 target. TYPE is the type to be initialized.
362 Build an AGGR_INIT_EXPR to represent the initialization. This function
363 differs from build_cplus_new in that an AGGR_INIT_EXPR can only be used
364 to initialize another object, whereas a TARGET_EXPR can either
365 initialize another object or create its own temporary object, and as a
366 result building up a TARGET_EXPR requires that the type's destructor be
370 build_aggr_init_expr (tree type, tree init)
377 /* Make sure that we're not trying to create an instance of an
379 abstract_virtuals_error (NULL_TREE, type);
381 if (TREE_CODE (init) == CALL_EXPR)
382 fn = CALL_EXPR_FN (init);
383 else if (TREE_CODE (init) == AGGR_INIT_EXPR)
384 fn = AGGR_INIT_EXPR_FN (init);
386 return convert (type, init);
388 is_ctor = (TREE_CODE (fn) == ADDR_EXPR
389 && TREE_CODE (TREE_OPERAND (fn, 0)) == FUNCTION_DECL
390 && DECL_CONSTRUCTOR_P (TREE_OPERAND (fn, 0)));
392 /* We split the CALL_EXPR into its function and its arguments here.
393 Then, in expand_expr, we put them back together. The reason for
394 this is that this expression might be a default argument
395 expression. In that case, we need a new temporary every time the
396 expression is used. That's what break_out_target_exprs does; it
397 replaces every AGGR_INIT_EXPR with a copy that uses a fresh
398 temporary slot. Then, expand_expr builds up a call-expression
399 using the new slot. */
401 /* If we don't need to use a constructor to create an object of this
402 type, don't mess with AGGR_INIT_EXPR. */
403 if (is_ctor || TREE_ADDRESSABLE (type))
405 slot = build_local_temp (type);
407 if (TREE_CODE(init) == CALL_EXPR)
408 rval = build_aggr_init_array (void_type_node, fn, slot,
409 call_expr_nargs (init),
410 CALL_EXPR_ARGP (init));
412 rval = build_aggr_init_array (void_type_node, fn, slot,
413 aggr_init_expr_nargs (init),
414 AGGR_INIT_EXPR_ARGP (init));
415 TREE_SIDE_EFFECTS (rval) = 1;
416 AGGR_INIT_VIA_CTOR_P (rval) = is_ctor;
424 /* INIT is a CALL_EXPR or AGGR_INIT_EXPR which needs info about its
425 target. TYPE is the type that this initialization should appear to
428 Build an encapsulation of the initialization to perform
429 and return it so that it can be processed by language-independent
430 and language-specific expression expanders. */
433 build_cplus_new (tree type, tree init)
435 tree rval = build_aggr_init_expr (type, init);
438 if (TREE_CODE (rval) == AGGR_INIT_EXPR)
439 slot = AGGR_INIT_EXPR_SLOT (rval);
440 else if (TREE_CODE (rval) == CALL_EXPR)
441 slot = build_local_temp (type);
445 rval = build_target_expr (slot, rval);
446 TARGET_EXPR_IMPLICIT_P (rval) = 1;
451 /* Build a TARGET_EXPR using INIT to initialize a new temporary of the
455 build_target_expr_with_type (tree init, tree type)
457 gcc_assert (!VOID_TYPE_P (type));
459 if (TREE_CODE (init) == TARGET_EXPR)
461 else if (CLASS_TYPE_P (type) && !TYPE_HAS_TRIVIAL_INIT_REF (type)
462 && !VOID_TYPE_P (TREE_TYPE (init))
463 && TREE_CODE (init) != COND_EXPR
464 && TREE_CODE (init) != CONSTRUCTOR
465 && TREE_CODE (init) != VA_ARG_EXPR)
466 /* We need to build up a copy constructor call. A void initializer
467 means we're being called from bot_manip. COND_EXPR is a special
468 case because we already have copies on the arms and we don't want
469 another one here. A CONSTRUCTOR is aggregate initialization, which
470 is handled separately. A VA_ARG_EXPR is magic creation of an
471 aggregate; there's no additional work to be done. */
472 return force_rvalue (init);
474 return force_target_expr (type, init);
477 /* Like the above function, but without the checking. This function should
478 only be used by code which is deliberately trying to subvert the type
479 system, such as call_builtin_trap. */
482 force_target_expr (tree type, tree init)
486 gcc_assert (!VOID_TYPE_P (type));
488 slot = build_local_temp (type);
489 return build_target_expr (slot, init);
492 /* Like build_target_expr_with_type, but use the type of INIT. */
495 get_target_expr (tree init)
497 if (TREE_CODE (init) == AGGR_INIT_EXPR)
498 return build_target_expr (AGGR_INIT_EXPR_SLOT (init), init);
500 return build_target_expr_with_type (init, TREE_TYPE (init));
503 /* If EXPR is a bitfield reference, convert it to the declared type of
504 the bitfield, and return the resulting expression. Otherwise,
505 return EXPR itself. */
508 convert_bitfield_to_declared_type (tree expr)
512 bitfield_type = is_bitfield_expr_with_lowered_type (expr);
514 expr = convert_to_integer (TYPE_MAIN_VARIANT (bitfield_type),
519 /* EXPR is being used in an rvalue context. Return a version of EXPR
520 that is marked as an rvalue. */
527 if (error_operand_p (expr))
532 Non-class rvalues always have cv-unqualified types. */
533 type = TREE_TYPE (expr);
534 if (!CLASS_TYPE_P (type) && cp_type_quals (type))
535 type = TYPE_MAIN_VARIANT (type);
537 if (!processing_template_decl && real_lvalue_p (expr))
538 expr = build1 (NON_LVALUE_EXPR, type, expr);
539 else if (type != TREE_TYPE (expr))
540 expr = build_nop (type, expr);
546 /* Hash an ARRAY_TYPE. K is really of type `tree'. */
549 cplus_array_hash (const void* k)
552 const_tree const t = (const_tree) k;
554 hash = TYPE_UID (TREE_TYPE (t));
556 hash ^= TYPE_UID (TYPE_DOMAIN (t));
560 typedef struct cplus_array_info {
565 /* Compare two ARRAY_TYPEs. K1 is really of type `tree', K2 is really
566 of type `cplus_array_info*'. */
569 cplus_array_compare (const void * k1, const void * k2)
571 const_tree const t1 = (const_tree) k1;
572 const cplus_array_info *const t2 = (const cplus_array_info*) k2;
574 return (TREE_TYPE (t1) == t2->type && TYPE_DOMAIN (t1) == t2->domain);
577 /* Hash table containing all of the C++ array types, including
578 dependent array types and array types whose element type is
580 static GTY ((param_is (union tree_node))) htab_t cplus_array_htab;
584 build_cplus_array_type_1 (tree elt_type, tree index_type)
588 if (elt_type == error_mark_node || index_type == error_mark_node)
589 return error_mark_node;
591 if (processing_template_decl
592 && (dependent_type_p (elt_type)
593 || (index_type && !TREE_CONSTANT (TYPE_MAX_VALUE (index_type)))))
596 cplus_array_info cai;
599 if (cplus_array_htab == NULL)
600 cplus_array_htab = htab_create_ggc (61, &cplus_array_hash,
601 &cplus_array_compare, NULL);
603 hash = TYPE_UID (elt_type);
605 hash ^= TYPE_UID (index_type);
607 cai.domain = index_type;
609 e = htab_find_slot_with_hash (cplus_array_htab, &cai, hash, INSERT);
611 /* We have found the type: we're done. */
615 /* Build a new array type. */
616 t = make_node (ARRAY_TYPE);
617 TREE_TYPE (t) = elt_type;
618 TYPE_DOMAIN (t) = index_type;
620 /* Store it in the hash table. */
623 /* Set the canonical type for this new node. */
624 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
625 || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type)))
626 SET_TYPE_STRUCTURAL_EQUALITY (t);
627 else if (TYPE_CANONICAL (elt_type) != elt_type
629 && TYPE_CANONICAL (index_type) != index_type))
631 = build_cplus_array_type
632 (TYPE_CANONICAL (elt_type),
633 index_type ? TYPE_CANONICAL (index_type) : index_type);
635 TYPE_CANONICAL (t) = t;
639 t = build_array_type (elt_type, index_type);
641 /* Push these needs up so that initialization takes place
643 TYPE_NEEDS_CONSTRUCTING (t)
644 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (elt_type));
645 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
646 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (elt_type));
651 build_cplus_array_type (tree elt_type, tree index_type)
654 int type_quals = cp_type_quals (elt_type);
656 if (type_quals != TYPE_UNQUALIFIED)
657 elt_type = cp_build_qualified_type (elt_type, TYPE_UNQUALIFIED);
659 t = build_cplus_array_type_1 (elt_type, index_type);
661 if (type_quals != TYPE_UNQUALIFIED)
662 t = cp_build_qualified_type (t, type_quals);
667 /* Return an ARRAY_TYPE with element type ELT and length N. */
670 build_array_of_n_type (tree elt, int n)
672 return build_cplus_array_type (elt, build_index_type (size_int (n - 1)));
675 /* Return a reference type node referring to TO_TYPE. If RVAL is
676 true, return an rvalue reference type, otherwise return an lvalue
677 reference type. If a type node exists, reuse it, otherwise create
680 cp_build_reference_type (tree to_type, bool rval)
683 lvalue_ref = build_reference_type (to_type);
687 /* This code to create rvalue reference types is based on and tied
688 to the code creating lvalue reference types in the middle-end
689 functions build_reference_type_for_mode and build_reference_type.
691 It works by putting the rvalue reference type nodes after the
692 lvalue reference nodes in the TYPE_NEXT_REF_TO linked list, so
693 they will effectively be ignored by the middle end. */
695 for (t = lvalue_ref; (t = TYPE_NEXT_REF_TO (t)); )
696 if (TYPE_REF_IS_RVALUE (t))
699 t = copy_node (lvalue_ref);
701 TYPE_REF_IS_RVALUE (t) = true;
702 TYPE_NEXT_REF_TO (t) = TYPE_NEXT_REF_TO (lvalue_ref);
703 TYPE_NEXT_REF_TO (lvalue_ref) = t;
704 TYPE_MAIN_VARIANT (t) = t;
706 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
707 SET_TYPE_STRUCTURAL_EQUALITY (t);
708 else if (TYPE_CANONICAL (to_type) != to_type)
710 = cp_build_reference_type (TYPE_CANONICAL (to_type), rval);
712 TYPE_CANONICAL (t) = t;
720 /* Used by the C++ front end to build qualified array types. However,
721 the C version of this function does not properly maintain canonical
722 types (which are not used in C). */
724 c_build_qualified_type (tree type, int type_quals)
726 return cp_build_qualified_type (type, type_quals);
730 /* Make a variant of TYPE, qualified with the TYPE_QUALS. Handles
731 arrays correctly. In particular, if TYPE is an array of T's, and
732 TYPE_QUALS is non-empty, returns an array of qualified T's.
734 FLAGS determines how to deal with ill-formed qualifications. If
735 tf_ignore_bad_quals is set, then bad qualifications are dropped
736 (this is permitted if TYPE was introduced via a typedef or template
737 type parameter). If bad qualifications are dropped and tf_warning
738 is set, then a warning is issued for non-const qualifications. If
739 tf_ignore_bad_quals is not set and tf_error is not set, we
740 return error_mark_node. Otherwise, we issue an error, and ignore
743 Qualification of a reference type is valid when the reference came
744 via a typedef or template type argument. [dcl.ref] No such
745 dispensation is provided for qualifying a function type. [dcl.fct]
746 DR 295 queries this and the proposed resolution brings it into line
747 with qualifying a reference. We implement the DR. We also behave
748 in a similar manner for restricting non-pointer types. */
751 cp_build_qualified_type_real (tree type,
753 tsubst_flags_t complain)
756 int bad_quals = TYPE_UNQUALIFIED;
758 if (type == error_mark_node)
761 if (type_quals == cp_type_quals (type))
764 if (TREE_CODE (type) == ARRAY_TYPE)
766 /* In C++, the qualification really applies to the array element
767 type. Obtain the appropriately qualified element type. */
770 = cp_build_qualified_type_real (TREE_TYPE (type),
774 if (element_type == error_mark_node)
775 return error_mark_node;
777 /* See if we already have an identically qualified type. */
778 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
779 if (cp_type_quals (t) == type_quals
780 && TYPE_NAME (t) == TYPE_NAME (type)
781 && TYPE_CONTEXT (t) == TYPE_CONTEXT (type))
786 t = build_cplus_array_type_1 (element_type, TYPE_DOMAIN (type));
788 if (TYPE_MAIN_VARIANT (t) != TYPE_MAIN_VARIANT (type))
790 /* Set the main variant of the newly-created ARRAY_TYPE
791 (with cv-qualified element type) to the main variant of
792 the unqualified ARRAY_TYPE we started with. */
793 tree last_variant = t;
794 tree m = TYPE_MAIN_VARIANT (type);
796 /* Find the last variant on the new ARRAY_TYPEs list of
797 variants, setting the main variant of each of the other
798 types to the main variant of our unqualified
800 while (TYPE_NEXT_VARIANT (last_variant))
802 TYPE_MAIN_VARIANT (last_variant) = m;
803 last_variant = TYPE_NEXT_VARIANT (last_variant);
806 /* Splice in the newly-created variants. */
807 TYPE_NEXT_VARIANT (last_variant) = TYPE_NEXT_VARIANT (m);
808 TYPE_NEXT_VARIANT (m) = t;
809 TYPE_MAIN_VARIANT (last_variant) = m;
813 /* Even if we already had this variant, we update
814 TYPE_NEEDS_CONSTRUCTING and TYPE_HAS_NONTRIVIAL_DESTRUCTOR in case
815 they changed since the variant was originally created.
817 This seems hokey; if there is some way to use a previous
818 variant *without* coming through here,
819 TYPE_NEEDS_CONSTRUCTING will never be updated. */
820 TYPE_NEEDS_CONSTRUCTING (t)
821 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (element_type));
822 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
823 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (element_type));
826 else if (TYPE_PTRMEMFUNC_P (type))
828 /* For a pointer-to-member type, we can't just return a
829 cv-qualified version of the RECORD_TYPE. If we do, we
830 haven't changed the field that contains the actual pointer to
831 a method, and so TYPE_PTRMEMFUNC_FN_TYPE will be wrong. */
834 t = TYPE_PTRMEMFUNC_FN_TYPE (type);
835 t = cp_build_qualified_type_real (t, type_quals, complain);
836 return build_ptrmemfunc_type (t);
838 else if (TREE_CODE (type) == TYPE_PACK_EXPANSION)
840 tree t = PACK_EXPANSION_PATTERN (type);
842 t = cp_build_qualified_type_real (t, type_quals, complain);
843 return make_pack_expansion (t);
846 /* A reference or method type shall not be cv-qualified.
847 [dcl.ref], [dcl.fct] */
848 if (type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE)
849 && (TREE_CODE (type) == REFERENCE_TYPE
850 || TREE_CODE (type) == METHOD_TYPE))
852 bad_quals |= type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
853 type_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
856 /* A restrict-qualified type must be a pointer (or reference)
857 to object or incomplete type. */
858 if ((type_quals & TYPE_QUAL_RESTRICT)
859 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
860 && TREE_CODE (type) != TYPENAME_TYPE
861 && !POINTER_TYPE_P (type))
863 bad_quals |= TYPE_QUAL_RESTRICT;
864 type_quals &= ~TYPE_QUAL_RESTRICT;
867 if (bad_quals == TYPE_UNQUALIFIED)
869 else if (!(complain & (tf_error | tf_ignore_bad_quals)))
870 return error_mark_node;
873 if (complain & tf_ignore_bad_quals)
874 /* We're not going to warn about constifying things that can't
876 bad_quals &= ~TYPE_QUAL_CONST;
879 tree bad_type = build_qualified_type (ptr_type_node, bad_quals);
881 if (!(complain & tf_ignore_bad_quals))
882 error ("%qV qualifiers cannot be applied to %qT",
887 /* Retrieve (or create) the appropriately qualified variant. */
888 result = build_qualified_type (type, type_quals);
890 /* If this was a pointer-to-method type, and we just made a copy,
891 then we need to unshare the record that holds the cached
892 pointer-to-member-function type, because these will be distinct
893 between the unqualified and qualified types. */
895 && TREE_CODE (type) == POINTER_TYPE
896 && TREE_CODE (TREE_TYPE (type)) == METHOD_TYPE
897 && TYPE_LANG_SPECIFIC (result) == TYPE_LANG_SPECIFIC (type))
898 TYPE_LANG_SPECIFIC (result) = NULL;
900 /* We may also have ended up building a new copy of the canonical
901 type of a pointer-to-method type, which could have the same
902 sharing problem described above. */
903 if (TYPE_CANONICAL (result) != TYPE_CANONICAL (type)
904 && TREE_CODE (type) == POINTER_TYPE
905 && TREE_CODE (TREE_TYPE (type)) == METHOD_TYPE
906 && (TYPE_LANG_SPECIFIC (TYPE_CANONICAL (result))
907 == TYPE_LANG_SPECIFIC (TYPE_CANONICAL (type))))
908 TYPE_LANG_SPECIFIC (TYPE_CANONICAL (result)) = NULL;
914 /* Returns the canonical version of TYPE. In other words, if TYPE is
915 a typedef, returns the underlying type. The cv-qualification of
916 the type returned matches the type input; they will always be
920 canonical_type_variant (tree t)
922 if (t == error_mark_node)
923 return error_mark_node;
925 return cp_build_qualified_type (TYPE_MAIN_VARIANT (t), cp_type_quals (t));
928 /* Makes a copy of BINFO and TYPE, which is to be inherited into a
929 graph dominated by T. If BINFO is NULL, TYPE is a dependent base,
930 and we do a shallow copy. If BINFO is non-NULL, we do a deep copy.
931 VIRT indicates whether TYPE is inherited virtually or not.
932 IGO_PREV points at the previous binfo of the inheritance graph
933 order chain. The newly copied binfo's TREE_CHAIN forms this
936 The CLASSTYPE_VBASECLASSES vector of T is constructed in the
937 correct order. That is in the order the bases themselves should be
940 The BINFO_INHERITANCE of a virtual base class points to the binfo
941 of the most derived type. ??? We could probably change this so that
942 BINFO_INHERITANCE becomes synonymous with BINFO_PRIMARY, and hence
943 remove a field. They currently can only differ for primary virtual
947 copy_binfo (tree binfo, tree type, tree t, tree *igo_prev, int virt)
953 /* See if we've already made this virtual base. */
954 new_binfo = binfo_for_vbase (type, t);
959 new_binfo = make_tree_binfo (binfo ? BINFO_N_BASE_BINFOS (binfo) : 0);
960 BINFO_TYPE (new_binfo) = type;
962 /* Chain it into the inheritance graph. */
963 TREE_CHAIN (*igo_prev) = new_binfo;
964 *igo_prev = new_binfo;
971 gcc_assert (!BINFO_DEPENDENT_BASE_P (binfo));
972 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), type));
974 BINFO_OFFSET (new_binfo) = BINFO_OFFSET (binfo);
975 BINFO_VIRTUALS (new_binfo) = BINFO_VIRTUALS (binfo);
977 /* We do not need to copy the accesses, as they are read only. */
978 BINFO_BASE_ACCESSES (new_binfo) = BINFO_BASE_ACCESSES (binfo);
980 /* Recursively copy base binfos of BINFO. */
981 for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++)
985 gcc_assert (!BINFO_DEPENDENT_BASE_P (base_binfo));
986 new_base_binfo = copy_binfo (base_binfo, BINFO_TYPE (base_binfo),
988 BINFO_VIRTUAL_P (base_binfo));
990 if (!BINFO_INHERITANCE_CHAIN (new_base_binfo))
991 BINFO_INHERITANCE_CHAIN (new_base_binfo) = new_binfo;
992 BINFO_BASE_APPEND (new_binfo, new_base_binfo);
996 BINFO_DEPENDENT_BASE_P (new_binfo) = 1;
1000 /* Push it onto the list after any virtual bases it contains
1001 will have been pushed. */
1002 VEC_quick_push (tree, CLASSTYPE_VBASECLASSES (t), new_binfo);
1003 BINFO_VIRTUAL_P (new_binfo) = 1;
1004 BINFO_INHERITANCE_CHAIN (new_binfo) = TYPE_BINFO (t);
1010 /* Hashing of lists so that we don't make duplicates.
1011 The entry point is `list_hash_canon'. */
1013 /* Now here is the hash table. When recording a list, it is added
1014 to the slot whose index is the hash code mod the table size.
1015 Note that the hash table is used for several kinds of lists.
1016 While all these live in the same table, they are completely independent,
1017 and the hash code is computed differently for each of these. */
1019 static GTY ((param_is (union tree_node))) htab_t list_hash_table;
1028 /* Compare ENTRY (an entry in the hash table) with DATA (a list_proxy
1029 for a node we are thinking about adding). */
1032 list_hash_eq (const void* entry, const void* data)
1034 const_tree const t = (const_tree) entry;
1035 const struct list_proxy *const proxy = (const struct list_proxy *) data;
1037 return (TREE_VALUE (t) == proxy->value
1038 && TREE_PURPOSE (t) == proxy->purpose
1039 && TREE_CHAIN (t) == proxy->chain);
1042 /* Compute a hash code for a list (chain of TREE_LIST nodes
1043 with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the
1044 TREE_COMMON slots), by adding the hash codes of the individual entries. */
1047 list_hash_pieces (tree purpose, tree value, tree chain)
1049 hashval_t hashcode = 0;
1052 hashcode += TREE_HASH (chain);
1055 hashcode += TREE_HASH (value);
1059 hashcode += TREE_HASH (purpose);
1065 /* Hash an already existing TREE_LIST. */
1068 list_hash (const void* p)
1070 const_tree const t = (const_tree) p;
1071 return list_hash_pieces (TREE_PURPOSE (t),
1076 /* Given list components PURPOSE, VALUE, AND CHAIN, return the canonical
1077 object for an identical list if one already exists. Otherwise, build a
1078 new one, and record it as the canonical object. */
1081 hash_tree_cons (tree purpose, tree value, tree chain)
1085 struct list_proxy proxy;
1087 /* Hash the list node. */
1088 hashcode = list_hash_pieces (purpose, value, chain);
1089 /* Create a proxy for the TREE_LIST we would like to create. We
1090 don't actually create it so as to avoid creating garbage. */
1091 proxy.purpose = purpose;
1092 proxy.value = value;
1093 proxy.chain = chain;
1094 /* See if it is already in the table. */
1095 slot = htab_find_slot_with_hash (list_hash_table, &proxy, hashcode,
1097 /* If not, create a new node. */
1099 *slot = tree_cons (purpose, value, chain);
1100 return (tree) *slot;
1103 /* Constructor for hashed lists. */
1106 hash_tree_chain (tree value, tree chain)
1108 return hash_tree_cons (NULL_TREE, value, chain);
1112 debug_binfo (tree elem)
1117 fprintf (stderr, "type \"%s\", offset = " HOST_WIDE_INT_PRINT_DEC
1119 TYPE_NAME_STRING (BINFO_TYPE (elem)),
1120 TREE_INT_CST_LOW (BINFO_OFFSET (elem)));
1121 debug_tree (BINFO_TYPE (elem));
1122 if (BINFO_VTABLE (elem))
1123 fprintf (stderr, "vtable decl \"%s\"\n",
1124 IDENTIFIER_POINTER (DECL_NAME (get_vtbl_decl_for_binfo (elem))));
1126 fprintf (stderr, "no vtable decl yet\n");
1127 fprintf (stderr, "virtuals:\n");
1128 virtuals = BINFO_VIRTUALS (elem);
1133 tree fndecl = TREE_VALUE (virtuals);
1134 fprintf (stderr, "%s [%ld =? %ld]\n",
1135 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl)),
1136 (long) n, (long) TREE_INT_CST_LOW (DECL_VINDEX (fndecl)));
1138 virtuals = TREE_CHAIN (virtuals);
1142 /* Build a representation for the qualified name SCOPE::NAME. TYPE is
1143 the type of the result expression, if known, or NULL_TREE if the
1144 resulting expression is type-dependent. If TEMPLATE_P is true,
1145 NAME is known to be a template because the user explicitly used the
1146 "template" keyword after the "::".
1148 All SCOPE_REFs should be built by use of this function. */
1151 build_qualified_name (tree type, tree scope, tree name, bool template_p)
1154 if (type == error_mark_node
1155 || scope == error_mark_node
1156 || name == error_mark_node)
1157 return error_mark_node;
1158 t = build2 (SCOPE_REF, type, scope, name);
1159 QUALIFIED_NAME_IS_TEMPLATE (t) = template_p;
1163 /* Returns nonzero if X is an expression for a (possibly overloaded)
1164 function. If "f" is a function or function template, "f", "c->f",
1165 "c.f", "C::f", and "f<int>" will all be considered possibly
1166 overloaded functions. Returns 2 if the function is actually
1167 overloaded, i.e., if it is impossible to know the type of the
1168 function without performing overload resolution. */
1171 is_overloaded_fn (tree x)
1173 /* A baselink is also considered an overloaded function. */
1174 if (TREE_CODE (x) == OFFSET_REF
1175 || TREE_CODE (x) == COMPONENT_REF)
1176 x = TREE_OPERAND (x, 1);
1178 x = BASELINK_FUNCTIONS (x);
1179 if (TREE_CODE (x) == TEMPLATE_ID_EXPR)
1180 x = TREE_OPERAND (x, 0);
1181 if (DECL_FUNCTION_TEMPLATE_P (OVL_CURRENT (x))
1182 || (TREE_CODE (x) == OVERLOAD && OVL_CHAIN (x)))
1184 return (TREE_CODE (x) == FUNCTION_DECL
1185 || TREE_CODE (x) == OVERLOAD);
1188 /* Returns true iff X is an expression for an overloaded function
1189 whose type cannot be known without performing overload
1193 really_overloaded_fn (tree x)
1195 return is_overloaded_fn (x) == 2;
1199 get_first_fn (tree from)
1201 gcc_assert (is_overloaded_fn (from));
1202 /* A baselink is also considered an overloaded function. */
1203 if (TREE_CODE (from) == COMPONENT_REF)
1204 from = TREE_OPERAND (from, 1);
1205 if (BASELINK_P (from))
1206 from = BASELINK_FUNCTIONS (from);
1207 if (TREE_CODE (from) == TEMPLATE_ID_EXPR)
1208 from = TREE_OPERAND (from, 0);
1209 return OVL_CURRENT (from);
1212 /* Return a new OVL node, concatenating it with the old one. */
1215 ovl_cons (tree decl, tree chain)
1217 tree result = make_node (OVERLOAD);
1218 TREE_TYPE (result) = unknown_type_node;
1219 OVL_FUNCTION (result) = decl;
1220 TREE_CHAIN (result) = chain;
1225 /* Build a new overloaded function. If this is the first one,
1226 just return it; otherwise, ovl_cons the _DECLs */
1229 build_overload (tree decl, tree chain)
1231 if (! chain && TREE_CODE (decl) != TEMPLATE_DECL)
1233 if (chain && TREE_CODE (chain) != OVERLOAD)
1234 chain = ovl_cons (chain, NULL_TREE);
1235 return ovl_cons (decl, chain);
1239 #define PRINT_RING_SIZE 4
1242 cxx_printable_name (tree decl, int v)
1244 static unsigned int uid_ring[PRINT_RING_SIZE];
1245 static char *print_ring[PRINT_RING_SIZE];
1246 static int ring_counter;
1249 /* Only cache functions. */
1251 || TREE_CODE (decl) != FUNCTION_DECL
1252 || DECL_LANG_SPECIFIC (decl) == 0)
1253 return lang_decl_name (decl, v);
1255 /* See if this print name is lying around. */
1256 for (i = 0; i < PRINT_RING_SIZE; i++)
1257 if (uid_ring[i] == DECL_UID (decl))
1258 /* yes, so return it. */
1259 return print_ring[i];
1261 if (++ring_counter == PRINT_RING_SIZE)
1264 if (current_function_decl != NULL_TREE)
1266 if (uid_ring[ring_counter] == DECL_UID (current_function_decl))
1268 if (ring_counter == PRINT_RING_SIZE)
1270 gcc_assert (uid_ring[ring_counter] != DECL_UID (current_function_decl));
1273 if (print_ring[ring_counter])
1274 free (print_ring[ring_counter]);
1276 print_ring[ring_counter] = xstrdup (lang_decl_name (decl, v));
1277 uid_ring[ring_counter] = DECL_UID (decl);
1278 return print_ring[ring_counter];
1281 /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions
1282 listed in RAISES. */
1285 build_exception_variant (tree type, tree raises)
1287 tree v = TYPE_MAIN_VARIANT (type);
1288 int type_quals = TYPE_QUALS (type);
1290 for (; v; v = TYPE_NEXT_VARIANT (v))
1291 if (check_qualified_type (v, type, type_quals)
1292 && comp_except_specs (raises, TYPE_RAISES_EXCEPTIONS (v), 1))
1295 /* Need to build a new variant. */
1296 v = build_variant_type_copy (type);
1297 TYPE_RAISES_EXCEPTIONS (v) = raises;
1301 /* Given a TEMPLATE_TEMPLATE_PARM node T, create a new
1302 BOUND_TEMPLATE_TEMPLATE_PARM bound with NEWARGS as its template
1306 bind_template_template_parm (tree t, tree newargs)
1308 tree decl = TYPE_NAME (t);
1311 t2 = cxx_make_type (BOUND_TEMPLATE_TEMPLATE_PARM);
1312 decl = build_decl (TYPE_DECL, DECL_NAME (decl), NULL_TREE);
1314 /* These nodes have to be created to reflect new TYPE_DECL and template
1316 TEMPLATE_TYPE_PARM_INDEX (t2) = copy_node (TEMPLATE_TYPE_PARM_INDEX (t));
1317 TEMPLATE_PARM_DECL (TEMPLATE_TYPE_PARM_INDEX (t2)) = decl;
1318 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2)
1319 = tree_cons (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t),
1320 newargs, NULL_TREE);
1322 TREE_TYPE (decl) = t2;
1323 TYPE_NAME (t2) = decl;
1324 TYPE_STUB_DECL (t2) = decl;
1326 SET_TYPE_STRUCTURAL_EQUALITY (t2);
1331 /* Called from count_trees via walk_tree. */
1334 count_trees_r (tree *tp, int *walk_subtrees, void *data)
1344 /* Debugging function for measuring the rough complexity of a tree
1348 count_trees (tree t)
1351 cp_walk_tree_without_duplicates (&t, count_trees_r, &n_trees);
1355 /* Called from verify_stmt_tree via walk_tree. */
1358 verify_stmt_tree_r (tree* tp,
1359 int* walk_subtrees ATTRIBUTE_UNUSED ,
1363 htab_t *statements = (htab_t *) data;
1366 if (!STATEMENT_CODE_P (TREE_CODE (t)))
1369 /* If this statement is already present in the hash table, then
1370 there is a circularity in the statement tree. */
1371 gcc_assert (!htab_find (*statements, t));
1373 slot = htab_find_slot (*statements, t, INSERT);
1379 /* Debugging function to check that the statement T has not been
1380 corrupted. For now, this function simply checks that T contains no
1384 verify_stmt_tree (tree t)
1387 statements = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
1388 cp_walk_tree (&t, verify_stmt_tree_r, &statements, NULL);
1389 htab_delete (statements);
1392 /* Check if the type T depends on a type with no linkage and if so, return
1393 it. If RELAXED_P then do not consider a class type declared within
1394 a TREE_PUBLIC function to have no linkage. */
1397 no_linkage_check (tree t, bool relaxed_p)
1401 /* There's no point in checking linkage on template functions; we
1402 can't know their complete types. */
1403 if (processing_template_decl)
1406 switch (TREE_CODE (t))
1411 if (TYPE_PTRMEMFUNC_P (t))
1415 if (!CLASS_TYPE_P (t))
1419 if (TYPE_ANONYMOUS_P (t))
1421 fn = decl_function_context (TYPE_MAIN_DECL (t));
1422 if (fn && (!relaxed_p || !TREE_PUBLIC (fn)))
1428 case REFERENCE_TYPE:
1429 return no_linkage_check (TREE_TYPE (t), relaxed_p);
1433 r = no_linkage_check (TYPE_PTRMEM_POINTED_TO_TYPE (t),
1437 return no_linkage_check (TYPE_PTRMEM_CLASS_TYPE (t), relaxed_p);
1440 r = no_linkage_check (TYPE_METHOD_BASETYPE (t), relaxed_p);
1447 for (parm = TYPE_ARG_TYPES (t);
1448 parm && parm != void_list_node;
1449 parm = TREE_CHAIN (parm))
1451 r = no_linkage_check (TREE_VALUE (parm), relaxed_p);
1455 return no_linkage_check (TREE_TYPE (t), relaxed_p);
1463 #ifdef GATHER_STATISTICS
1464 extern int depth_reached;
1468 cxx_print_statistics (void)
1470 print_search_statistics ();
1471 print_class_statistics ();
1472 #ifdef GATHER_STATISTICS
1473 fprintf (stderr, "maximum template instantiation depth reached: %d\n",
1478 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1479 (which is an ARRAY_TYPE). This counts only elements of the top
1483 array_type_nelts_top (tree type)
1485 return fold_build2 (PLUS_EXPR, sizetype,
1486 array_type_nelts (type),
1490 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1491 (which is an ARRAY_TYPE). This one is a recursive count of all
1492 ARRAY_TYPEs that are clumped together. */
1495 array_type_nelts_total (tree type)
1497 tree sz = array_type_nelts_top (type);
1498 type = TREE_TYPE (type);
1499 while (TREE_CODE (type) == ARRAY_TYPE)
1501 tree n = array_type_nelts_top (type);
1502 sz = fold_build2 (MULT_EXPR, sizetype, sz, n);
1503 type = TREE_TYPE (type);
1508 /* Called from break_out_target_exprs via mapcar. */
1511 bot_manip (tree* tp, int* walk_subtrees, void* data)
1513 splay_tree target_remap = ((splay_tree) data);
1516 if (!TYPE_P (t) && TREE_CONSTANT (t))
1518 /* There can't be any TARGET_EXPRs or their slot variables below
1519 this point. We used to check !TREE_SIDE_EFFECTS, but then we
1520 failed to copy an ADDR_EXPR of the slot VAR_DECL. */
1524 if (TREE_CODE (t) == TARGET_EXPR)
1528 if (TREE_CODE (TREE_OPERAND (t, 1)) == AGGR_INIT_EXPR)
1529 u = build_cplus_new (TREE_TYPE (t), TREE_OPERAND (t, 1));
1531 u = build_target_expr_with_type (TREE_OPERAND (t, 1), TREE_TYPE (t));
1533 /* Map the old variable to the new one. */
1534 splay_tree_insert (target_remap,
1535 (splay_tree_key) TREE_OPERAND (t, 0),
1536 (splay_tree_value) TREE_OPERAND (u, 0));
1538 TREE_OPERAND (u, 1) = break_out_target_exprs (TREE_OPERAND (u, 1));
1540 /* Replace the old expression with the new version. */
1542 /* We don't have to go below this point; the recursive call to
1543 break_out_target_exprs will have handled anything below this
1549 /* Make a copy of this node. */
1550 return copy_tree_r (tp, walk_subtrees, NULL);
1553 /* Replace all remapped VAR_DECLs in T with their new equivalents.
1554 DATA is really a splay-tree mapping old variables to new
1558 bot_replace (tree* t,
1559 int* walk_subtrees ATTRIBUTE_UNUSED ,
1562 splay_tree target_remap = ((splay_tree) data);
1564 if (TREE_CODE (*t) == VAR_DECL)
1566 splay_tree_node n = splay_tree_lookup (target_remap,
1567 (splay_tree_key) *t);
1569 *t = (tree) n->value;
1575 /* When we parse a default argument expression, we may create
1576 temporary variables via TARGET_EXPRs. When we actually use the
1577 default-argument expression, we make a copy of the expression, but
1578 we must replace the temporaries with appropriate local versions. */
1581 break_out_target_exprs (tree t)
1583 static int target_remap_count;
1584 static splay_tree target_remap;
1586 if (!target_remap_count++)
1587 target_remap = splay_tree_new (splay_tree_compare_pointers,
1588 /*splay_tree_delete_key_fn=*/NULL,
1589 /*splay_tree_delete_value_fn=*/NULL);
1590 cp_walk_tree (&t, bot_manip, target_remap, NULL);
1591 cp_walk_tree (&t, bot_replace, target_remap, NULL);
1593 if (!--target_remap_count)
1595 splay_tree_delete (target_remap);
1596 target_remap = NULL;
1602 /* Similar to `build_nt', but for template definitions of dependent
1606 build_min_nt (enum tree_code code, ...)
1613 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
1617 t = make_node (code);
1618 length = TREE_CODE_LENGTH (code);
1620 for (i = 0; i < length; i++)
1622 tree x = va_arg (p, tree);
1623 TREE_OPERAND (t, i) = x;
1631 /* Similar to `build', but for template definitions. */
1634 build_min (enum tree_code code, tree tt, ...)
1641 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
1645 t = make_node (code);
1646 length = TREE_CODE_LENGTH (code);
1649 for (i = 0; i < length; i++)
1651 tree x = va_arg (p, tree);
1652 TREE_OPERAND (t, i) = x;
1653 if (x && !TYPE_P (x) && TREE_SIDE_EFFECTS (x))
1654 TREE_SIDE_EFFECTS (t) = 1;
1661 /* Similar to `build', but for template definitions of non-dependent
1662 expressions. NON_DEP is the non-dependent expression that has been
1666 build_min_non_dep (enum tree_code code, tree non_dep, ...)
1673 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
1675 va_start (p, non_dep);
1677 t = make_node (code);
1678 length = TREE_CODE_LENGTH (code);
1679 TREE_TYPE (t) = TREE_TYPE (non_dep);
1680 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (non_dep);
1682 for (i = 0; i < length; i++)
1684 tree x = va_arg (p, tree);
1685 TREE_OPERAND (t, i) = x;
1688 if (code == COMPOUND_EXPR && TREE_CODE (non_dep) != COMPOUND_EXPR)
1689 /* This should not be considered a COMPOUND_EXPR, because it
1690 resolves to an overload. */
1691 COMPOUND_EXPR_OVERLOADED (t) = 1;
1697 /* Similar to `build_call_list', but for template definitions of non-dependent
1698 expressions. NON_DEP is the non-dependent expression that has been
1702 build_min_non_dep_call_list (tree non_dep, tree fn, tree arglist)
1704 tree t = build_nt_call_list (fn, arglist);
1705 TREE_TYPE (t) = TREE_TYPE (non_dep);
1706 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (non_dep);
1711 get_type_decl (tree t)
1713 if (TREE_CODE (t) == TYPE_DECL)
1716 return TYPE_STUB_DECL (t);
1717 gcc_assert (t == error_mark_node);
1721 /* Returns the namespace that contains DECL, whether directly or
1725 decl_namespace_context (tree decl)
1729 if (TREE_CODE (decl) == NAMESPACE_DECL)
1731 else if (TYPE_P (decl))
1732 decl = CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl));
1734 decl = CP_DECL_CONTEXT (decl);
1738 /* Returns true if decl is within an anonymous namespace, however deeply
1739 nested, or false otherwise. */
1742 decl_anon_ns_mem_p (const_tree decl)
1746 if (decl == NULL_TREE || decl == error_mark_node)
1748 if (TREE_CODE (decl) == NAMESPACE_DECL
1749 && DECL_NAME (decl) == NULL_TREE)
1751 /* Classes and namespaces inside anonymous namespaces have
1752 TREE_PUBLIC == 0, so we can shortcut the search. */
1753 else if (TYPE_P (decl))
1754 return (TREE_PUBLIC (TYPE_NAME (decl)) == 0);
1755 else if (TREE_CODE (decl) == NAMESPACE_DECL)
1756 return (TREE_PUBLIC (decl) == 0);
1758 decl = DECL_CONTEXT (decl);
1762 /* Return truthvalue of whether T1 is the same tree structure as T2.
1763 Return 1 if they are the same. Return 0 if they are different. */
1766 cp_tree_equal (tree t1, tree t2)
1768 enum tree_code code1, code2;
1775 for (code1 = TREE_CODE (t1);
1776 CONVERT_EXPR_CODE_P (code1)
1777 || code1 == NON_LVALUE_EXPR;
1778 code1 = TREE_CODE (t1))
1779 t1 = TREE_OPERAND (t1, 0);
1780 for (code2 = TREE_CODE (t2);
1781 CONVERT_EXPR_CODE_P (code2)
1782 || code1 == NON_LVALUE_EXPR;
1783 code2 = TREE_CODE (t2))
1784 t2 = TREE_OPERAND (t2, 0);
1786 /* They might have become equal now. */
1796 return TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
1797 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2);
1800 return REAL_VALUES_EQUAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
1803 return TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
1804 && !memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
1805 TREE_STRING_LENGTH (t1));
1808 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1),
1809 TREE_FIXED_CST (t2));
1812 return cp_tree_equal (TREE_REALPART (t1), TREE_REALPART (t2))
1813 && cp_tree_equal (TREE_IMAGPART (t1), TREE_IMAGPART (t2));
1816 /* We need to do this when determining whether or not two
1817 non-type pointer to member function template arguments
1819 if (!(same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
1820 /* The first operand is RTL. */
1821 && TREE_OPERAND (t1, 0) == TREE_OPERAND (t2, 0)))
1823 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1826 if (!cp_tree_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2)))
1828 if (!cp_tree_equal (TREE_VALUE (t1), TREE_VALUE (t2)))
1830 return cp_tree_equal (TREE_CHAIN (t1), TREE_CHAIN (t2));
1833 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1838 call_expr_arg_iterator iter1, iter2;
1839 if (!cp_tree_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2)))
1841 for (arg1 = first_call_expr_arg (t1, &iter1),
1842 arg2 = first_call_expr_arg (t2, &iter2);
1844 arg1 = next_call_expr_arg (&iter1),
1845 arg2 = next_call_expr_arg (&iter2))
1846 if (!cp_tree_equal (arg1, arg2))
1848 return (arg1 || arg2);
1853 tree o1 = TREE_OPERAND (t1, 0);
1854 tree o2 = TREE_OPERAND (t2, 0);
1856 /* Special case: if either target is an unallocated VAR_DECL,
1857 it means that it's going to be unified with whatever the
1858 TARGET_EXPR is really supposed to initialize, so treat it
1859 as being equivalent to anything. */
1860 if (TREE_CODE (o1) == VAR_DECL && DECL_NAME (o1) == NULL_TREE
1861 && !DECL_RTL_SET_P (o1))
1863 else if (TREE_CODE (o2) == VAR_DECL && DECL_NAME (o2) == NULL_TREE
1864 && !DECL_RTL_SET_P (o2))
1866 else if (!cp_tree_equal (o1, o2))
1869 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1872 case WITH_CLEANUP_EXPR:
1873 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1875 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
1878 if (TREE_OPERAND (t1, 1) != TREE_OPERAND (t2, 1))
1880 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1883 /* For comparing uses of parameters in late-specified return types
1884 with an out-of-class definition of the function. */
1885 if (same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
1886 && parm_index (t1) == parm_index (t2))
1895 case IDENTIFIER_NODE:
1900 return (BASELINK_BINFO (t1) == BASELINK_BINFO (t2)
1901 && BASELINK_ACCESS_BINFO (t1) == BASELINK_ACCESS_BINFO (t2)
1902 && cp_tree_equal (BASELINK_FUNCTIONS (t1),
1903 BASELINK_FUNCTIONS (t2)));
1905 case TEMPLATE_PARM_INDEX:
1906 return (TEMPLATE_PARM_IDX (t1) == TEMPLATE_PARM_IDX (t2)
1907 && TEMPLATE_PARM_LEVEL (t1) == TEMPLATE_PARM_LEVEL (t2)
1908 && same_type_p (TREE_TYPE (TEMPLATE_PARM_DECL (t1)),
1909 TREE_TYPE (TEMPLATE_PARM_DECL (t2))));
1911 case TEMPLATE_ID_EXPR:
1916 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1918 vec1 = TREE_OPERAND (t1, 1);
1919 vec2 = TREE_OPERAND (t2, 1);
1922 return !vec1 && !vec2;
1924 if (TREE_VEC_LENGTH (vec1) != TREE_VEC_LENGTH (vec2))
1927 for (ix = TREE_VEC_LENGTH (vec1); ix--;)
1928 if (!cp_tree_equal (TREE_VEC_ELT (vec1, ix),
1929 TREE_VEC_ELT (vec2, ix)))
1938 tree o1 = TREE_OPERAND (t1, 0);
1939 tree o2 = TREE_OPERAND (t2, 0);
1941 if (TREE_CODE (o1) != TREE_CODE (o2))
1944 return same_type_p (o1, o2);
1946 return cp_tree_equal (o1, o2);
1951 tree t1_op1, t2_op1;
1953 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1956 t1_op1 = TREE_OPERAND (t1, 1);
1957 t2_op1 = TREE_OPERAND (t2, 1);
1958 if (TREE_CODE (t1_op1) != TREE_CODE (t2_op1))
1961 return cp_tree_equal (TREE_OPERAND (t1, 2), TREE_OPERAND (t2, 2));
1965 /* Two pointer-to-members are the same if they point to the same
1966 field or function in the same class. */
1967 if (PTRMEM_CST_MEMBER (t1) != PTRMEM_CST_MEMBER (t2))
1970 return same_type_p (PTRMEM_CST_CLASS (t1), PTRMEM_CST_CLASS (t2));
1973 if (OVL_FUNCTION (t1) != OVL_FUNCTION (t2))
1975 return cp_tree_equal (OVL_CHAIN (t1), OVL_CHAIN (t2));
1978 if (TRAIT_EXPR_KIND (t1) != TRAIT_EXPR_KIND (t2))
1980 return same_type_p (TRAIT_EXPR_TYPE1 (t1), TRAIT_EXPR_TYPE1 (t2))
1981 && same_type_p (TRAIT_EXPR_TYPE2 (t1), TRAIT_EXPR_TYPE2 (t2));
1987 switch (TREE_CODE_CLASS (code1))
1991 case tcc_comparison:
1992 case tcc_expression:
1999 n = TREE_OPERAND_LENGTH (t1);
2000 if (TREE_CODE_CLASS (code1) == tcc_vl_exp
2001 && n != TREE_OPERAND_LENGTH (t2))
2004 for (i = 0; i < n; ++i)
2005 if (!cp_tree_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i)))
2012 return same_type_p (t1, t2);
2016 /* We can get here with --disable-checking. */
2020 /* The type of ARG when used as an lvalue. */
2023 lvalue_type (tree arg)
2025 tree type = TREE_TYPE (arg);
2029 /* The type of ARG for printing error messages; denote lvalues with
2033 error_type (tree arg)
2035 tree type = TREE_TYPE (arg);
2037 if (TREE_CODE (type) == ARRAY_TYPE)
2039 else if (TREE_CODE (type) == ERROR_MARK)
2041 else if (real_lvalue_p (arg))
2042 type = build_reference_type (lvalue_type (arg));
2043 else if (MAYBE_CLASS_TYPE_P (type))
2044 type = lvalue_type (arg);
2049 /* Does FUNCTION use a variable-length argument list? */
2052 varargs_function_p (const_tree function)
2054 const_tree parm = TYPE_ARG_TYPES (TREE_TYPE (function));
2055 for (; parm; parm = TREE_CHAIN (parm))
2056 if (TREE_VALUE (parm) == void_type_node)
2061 /* Returns 1 if decl is a member of a class. */
2064 member_p (const_tree decl)
2066 const_tree const ctx = DECL_CONTEXT (decl);
2067 return (ctx && TYPE_P (ctx));
2070 /* Create a placeholder for member access where we don't actually have an
2071 object that the access is against. */
2074 build_dummy_object (tree type)
2076 tree decl = build1 (NOP_EXPR, build_pointer_type (type), void_zero_node);
2077 return cp_build_indirect_ref (decl, NULL, tf_warning_or_error);
2080 /* We've gotten a reference to a member of TYPE. Return *this if appropriate,
2081 or a dummy object otherwise. If BINFOP is non-0, it is filled with the
2082 binfo path from current_class_type to TYPE, or 0. */
2085 maybe_dummy_object (tree type, tree* binfop)
2090 if (current_class_type
2091 && (binfo = lookup_base (current_class_type, type,
2092 ba_unique | ba_quiet, NULL)))
2093 context = current_class_type;
2096 /* Reference from a nested class member function. */
2098 binfo = TYPE_BINFO (type);
2104 if (current_class_ref && context == current_class_type
2105 /* Kludge: Make sure that current_class_type is actually
2106 correct. It might not be if we're in the middle of
2107 tsubst_default_argument. */
2108 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref)),
2109 current_class_type))
2110 decl = current_class_ref;
2112 decl = build_dummy_object (context);
2117 /* Returns 1 if OB is a placeholder object, or a pointer to one. */
2120 is_dummy_object (const_tree ob)
2122 if (TREE_CODE (ob) == INDIRECT_REF)
2123 ob = TREE_OPERAND (ob, 0);
2124 return (TREE_CODE (ob) == NOP_EXPR
2125 && TREE_OPERAND (ob, 0) == void_zero_node);
2128 /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */
2131 pod_type_p (const_tree t)
2133 /* This CONST_CAST is okay because strip_array_types returns its
2134 argument unmodified and we assign it to a const_tree. */
2135 t = strip_array_types (CONST_CAST_TREE(t));
2137 if (t == error_mark_node)
2139 if (INTEGRAL_TYPE_P (t))
2140 return 1; /* integral, character or enumeral type */
2141 if (FLOAT_TYPE_P (t))
2144 return 1; /* pointer to non-member */
2145 if (TYPE_PTR_TO_MEMBER_P (t))
2146 return 1; /* pointer to member */
2148 if (TREE_CODE (t) == VECTOR_TYPE)
2149 return 1; /* vectors are (small) arrays of scalars */
2151 if (! RECORD_OR_UNION_CODE_P (TREE_CODE (t)))
2152 return 0; /* other non-class type (reference or function) */
2153 if (! CLASS_TYPE_P (t))
2154 return 1; /* struct created by the back end */
2155 if (CLASSTYPE_NON_POD_P (t))
2160 /* Nonzero iff type T is a class template implicit specialization. */
2163 class_tmpl_impl_spec_p (const_tree t)
2165 return CLASS_TYPE_P (t) && CLASSTYPE_TEMPLATE_INSTANTIATION (t);
2168 /* Returns 1 iff zero initialization of type T means actually storing
2172 zero_init_p (const_tree t)
2174 /* This CONST_CAST is okay because strip_array_types returns its
2175 argument unmodified and we assign it to a const_tree. */
2176 t = strip_array_types (CONST_CAST_TREE(t));
2178 if (t == error_mark_node)
2181 /* NULL pointers to data members are initialized with -1. */
2182 if (TYPE_PTRMEM_P (t))
2185 /* Classes that contain types that can't be zero-initialized, cannot
2186 be zero-initialized themselves. */
2187 if (CLASS_TYPE_P (t) && CLASSTYPE_NON_ZERO_INIT_P (t))
2193 /* Table of valid C++ attributes. */
2194 const struct attribute_spec cxx_attribute_table[] =
2196 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
2197 { "java_interface", 0, 0, false, false, false, handle_java_interface_attribute },
2198 { "com_interface", 0, 0, false, false, false, handle_com_interface_attribute },
2199 { "init_priority", 1, 1, true, false, false, handle_init_priority_attribute },
2200 { NULL, 0, 0, false, false, false, NULL }
2203 /* Handle a "java_interface" attribute; arguments as in
2204 struct attribute_spec.handler. */
2206 handle_java_interface_attribute (tree* node,
2208 tree args ATTRIBUTE_UNUSED ,
2213 || !CLASS_TYPE_P (*node)
2214 || !TYPE_FOR_JAVA (*node))
2216 error ("%qE attribute can only be applied to Java class definitions",
2218 *no_add_attrs = true;
2221 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
2222 *node = build_variant_type_copy (*node);
2223 TYPE_JAVA_INTERFACE (*node) = 1;
2228 /* Handle a "com_interface" attribute; arguments as in
2229 struct attribute_spec.handler. */
2231 handle_com_interface_attribute (tree* node,
2233 tree args ATTRIBUTE_UNUSED ,
2234 int flags ATTRIBUTE_UNUSED ,
2239 *no_add_attrs = true;
2242 || !CLASS_TYPE_P (*node)
2243 || *node != TYPE_MAIN_VARIANT (*node))
2245 warning (OPT_Wattributes, "%qE attribute can only be applied "
2246 "to class definitions", name);
2251 warning (0, "%qE is obsolete; g++ vtables are now COM-compatible by default",
2257 /* Handle an "init_priority" attribute; arguments as in
2258 struct attribute_spec.handler. */
2260 handle_init_priority_attribute (tree* node,
2263 int flags ATTRIBUTE_UNUSED ,
2266 tree initp_expr = TREE_VALUE (args);
2268 tree type = TREE_TYPE (decl);
2271 STRIP_NOPS (initp_expr);
2273 if (!initp_expr || TREE_CODE (initp_expr) != INTEGER_CST)
2275 error ("requested init_priority is not an integer constant");
2276 *no_add_attrs = true;
2280 pri = TREE_INT_CST_LOW (initp_expr);
2282 type = strip_array_types (type);
2284 if (decl == NULL_TREE
2285 || TREE_CODE (decl) != VAR_DECL
2286 || !TREE_STATIC (decl)
2287 || DECL_EXTERNAL (decl)
2288 || (TREE_CODE (type) != RECORD_TYPE
2289 && TREE_CODE (type) != UNION_TYPE)
2290 /* Static objects in functions are initialized the
2291 first time control passes through that
2292 function. This is not precise enough to pin down an
2293 init_priority value, so don't allow it. */
2294 || current_function_decl)
2296 error ("can only use %qE attribute on file-scope definitions "
2297 "of objects of class type", name);
2298 *no_add_attrs = true;
2302 if (pri > MAX_INIT_PRIORITY || pri <= 0)
2304 error ("requested init_priority is out of range");
2305 *no_add_attrs = true;
2309 /* Check for init_priorities that are reserved for
2310 language and runtime support implementations.*/
2311 if (pri <= MAX_RESERVED_INIT_PRIORITY)
2314 (0, "requested init_priority is reserved for internal use");
2317 if (SUPPORTS_INIT_PRIORITY)
2319 SET_DECL_INIT_PRIORITY (decl, pri);
2320 DECL_HAS_INIT_PRIORITY_P (decl) = 1;
2325 error ("%qE attribute is not supported on this platform", name);
2326 *no_add_attrs = true;
2331 /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the
2332 thing pointed to by the constant. */
2335 make_ptrmem_cst (tree type, tree member)
2337 tree ptrmem_cst = make_node (PTRMEM_CST);
2338 TREE_TYPE (ptrmem_cst) = type;
2339 PTRMEM_CST_MEMBER (ptrmem_cst) = member;
2343 /* Build a variant of TYPE that has the indicated ATTRIBUTES. May
2344 return an existing type if an appropriate type already exists. */
2347 cp_build_type_attribute_variant (tree type, tree attributes)
2351 new_type = build_type_attribute_variant (type, attributes);
2352 if (TREE_CODE (new_type) == FUNCTION_TYPE
2353 && (TYPE_RAISES_EXCEPTIONS (new_type)
2354 != TYPE_RAISES_EXCEPTIONS (type)))
2355 new_type = build_exception_variant (new_type,
2356 TYPE_RAISES_EXCEPTIONS (type));
2358 /* Making a new main variant of a class type is broken. */
2359 gcc_assert (!CLASS_TYPE_P (type) || new_type == type);
2364 /* Return TRUE if TYPE1 and TYPE2 are identical for type hashing purposes.
2365 Called only after doing all language independent checks. Only
2366 to check TYPE_RAISES_EXCEPTIONS for FUNCTION_TYPE, the rest is already
2367 compared in type_hash_eq. */
2370 cxx_type_hash_eq (const_tree typea, const_tree typeb)
2372 gcc_assert (TREE_CODE (typea) == FUNCTION_TYPE);
2374 return comp_except_specs (TYPE_RAISES_EXCEPTIONS (typea),
2375 TYPE_RAISES_EXCEPTIONS (typeb), 1);
2378 /* Apply FUNC to all language-specific sub-trees of TP in a pre-order
2379 traversal. Called from walk_tree. */
2382 cp_walk_subtrees (tree *tp, int *walk_subtrees_p, walk_tree_fn func,
2383 void *data, struct pointer_set_t *pset)
2385 enum tree_code code = TREE_CODE (*tp);
2388 #define WALK_SUBTREE(NODE) \
2391 result = cp_walk_tree (&(NODE), func, data, pset); \
2392 if (result) goto out; \
2396 /* Not one of the easy cases. We must explicitly go through the
2402 case TEMPLATE_TEMPLATE_PARM:
2403 case BOUND_TEMPLATE_TEMPLATE_PARM:
2404 case UNBOUND_CLASS_TEMPLATE:
2405 case TEMPLATE_PARM_INDEX:
2406 case TEMPLATE_TYPE_PARM:
2409 /* None of these have subtrees other than those already walked
2411 *walk_subtrees_p = 0;
2415 WALK_SUBTREE (BASELINK_FUNCTIONS (*tp));
2416 *walk_subtrees_p = 0;
2420 WALK_SUBTREE (TREE_TYPE (*tp));
2421 *walk_subtrees_p = 0;
2425 WALK_SUBTREE (TREE_PURPOSE (*tp));
2429 WALK_SUBTREE (OVL_FUNCTION (*tp));
2430 WALK_SUBTREE (OVL_CHAIN (*tp));
2431 *walk_subtrees_p = 0;
2435 WALK_SUBTREE (DECL_NAME (*tp));
2436 WALK_SUBTREE (USING_DECL_SCOPE (*tp));
2437 WALK_SUBTREE (USING_DECL_DECLS (*tp));
2438 *walk_subtrees_p = 0;
2442 if (TYPE_PTRMEMFUNC_P (*tp))
2443 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (*tp));
2446 case TYPE_ARGUMENT_PACK:
2447 case NONTYPE_ARGUMENT_PACK:
2449 tree args = ARGUMENT_PACK_ARGS (*tp);
2450 int i, len = TREE_VEC_LENGTH (args);
2451 for (i = 0; i < len; i++)
2452 WALK_SUBTREE (TREE_VEC_ELT (args, i));
2456 case TYPE_PACK_EXPANSION:
2457 WALK_SUBTREE (TREE_TYPE (*tp));
2458 *walk_subtrees_p = 0;
2461 case EXPR_PACK_EXPANSION:
2462 WALK_SUBTREE (TREE_OPERAND (*tp, 0));
2463 *walk_subtrees_p = 0;
2467 case REINTERPRET_CAST_EXPR:
2468 case STATIC_CAST_EXPR:
2469 case CONST_CAST_EXPR:
2470 case DYNAMIC_CAST_EXPR:
2471 if (TREE_TYPE (*tp))
2472 WALK_SUBTREE (TREE_TYPE (*tp));
2476 for (i = 0; i < TREE_CODE_LENGTH (TREE_CODE (*tp)); ++i)
2477 WALK_SUBTREE (TREE_OPERAND (*tp, i));
2479 *walk_subtrees_p = 0;
2483 WALK_SUBTREE (TRAIT_EXPR_TYPE1 (*tp));
2484 WALK_SUBTREE (TRAIT_EXPR_TYPE2 (*tp));
2485 *walk_subtrees_p = 0;
2489 WALK_SUBTREE (DECLTYPE_TYPE_EXPR (*tp));
2490 *walk_subtrees_p = 0;
2498 /* We didn't find what we were looking for. */
2505 /* Like save_expr, but for C++. */
2508 cp_save_expr (tree expr)
2510 /* There is no reason to create a SAVE_EXPR within a template; if
2511 needed, we can create the SAVE_EXPR when instantiating the
2512 template. Furthermore, the middle-end cannot handle C++-specific
2514 if (processing_template_decl)
2516 return save_expr (expr);
2519 /* Initialize tree.c. */
2524 list_hash_table = htab_create_ggc (31, list_hash, list_hash_eq, NULL);
2527 /* Returns the kind of special function that DECL (a FUNCTION_DECL)
2528 is. Note that sfk_none is zero, so this function can be used as a
2529 predicate to test whether or not DECL is a special function. */
2531 special_function_kind
2532 special_function_p (const_tree decl)
2534 /* Rather than doing all this stuff with magic names, we should
2535 probably have a field of type `special_function_kind' in
2536 DECL_LANG_SPECIFIC. */
2537 if (DECL_COPY_CONSTRUCTOR_P (decl))
2538 return sfk_copy_constructor;
2539 if (DECL_CONSTRUCTOR_P (decl))
2540 return sfk_constructor;
2541 if (DECL_OVERLOADED_OPERATOR_P (decl) == NOP_EXPR)
2542 return sfk_assignment_operator;
2543 if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl))
2544 return sfk_destructor;
2545 if (DECL_COMPLETE_DESTRUCTOR_P (decl))
2546 return sfk_complete_destructor;
2547 if (DECL_BASE_DESTRUCTOR_P (decl))
2548 return sfk_base_destructor;
2549 if (DECL_DELETING_DESTRUCTOR_P (decl))
2550 return sfk_deleting_destructor;
2551 if (DECL_CONV_FN_P (decl))
2552 return sfk_conversion;
2557 /* Returns nonzero if TYPE is a character type, including wchar_t. */
2560 char_type_p (tree type)
2562 return (same_type_p (type, char_type_node)
2563 || same_type_p (type, unsigned_char_type_node)
2564 || same_type_p (type, signed_char_type_node)
2565 || same_type_p (type, char16_type_node)
2566 || same_type_p (type, char32_type_node)
2567 || same_type_p (type, wchar_type_node));
2570 /* Returns the kind of linkage associated with the indicated DECL. Th
2571 value returned is as specified by the language standard; it is
2572 independent of implementation details regarding template
2573 instantiation, etc. For example, it is possible that a declaration
2574 to which this function assigns external linkage would not show up
2575 as a global symbol when you run `nm' on the resulting object file. */
2578 decl_linkage (tree decl)
2580 /* This function doesn't attempt to calculate the linkage from first
2581 principles as given in [basic.link]. Instead, it makes use of
2582 the fact that we have already set TREE_PUBLIC appropriately, and
2583 then handles a few special cases. Ideally, we would calculate
2584 linkage first, and then transform that into a concrete
2587 /* Things that don't have names have no linkage. */
2588 if (!DECL_NAME (decl))
2591 /* Fields have no linkage. */
2592 if (TREE_CODE (decl) == FIELD_DECL)
2595 /* Things that are TREE_PUBLIC have external linkage. */
2596 if (TREE_PUBLIC (decl))
2599 if (TREE_CODE (decl) == NAMESPACE_DECL)
2602 /* Linkage of a CONST_DECL depends on the linkage of the enumeration
2604 if (TREE_CODE (decl) == CONST_DECL)
2605 return decl_linkage (TYPE_NAME (TREE_TYPE (decl)));
2607 /* Some things that are not TREE_PUBLIC have external linkage, too.
2608 For example, on targets that don't have weak symbols, we make all
2609 template instantiations have internal linkage (in the object
2610 file), but the symbols should still be treated as having external
2611 linkage from the point of view of the language. */
2612 if (TREE_CODE (decl) != TYPE_DECL && DECL_LANG_SPECIFIC (decl)
2613 && DECL_COMDAT (decl))
2616 /* Things in local scope do not have linkage, if they don't have
2618 if (decl_function_context (decl))
2621 /* Members of the anonymous namespace also have TREE_PUBLIC unset, but
2622 are considered to have external linkage for language purposes. DECLs
2623 really meant to have internal linkage have DECL_THIS_STATIC set. */
2624 if (TREE_CODE (decl) == TYPE_DECL)
2626 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == FUNCTION_DECL)
2628 if (!DECL_THIS_STATIC (decl))
2631 /* Static data members and static member functions from classes
2632 in anonymous namespace also don't have TREE_PUBLIC set. */
2633 if (DECL_CLASS_CONTEXT (decl))
2637 /* Everything else has internal linkage. */
2641 /* EXP is an expression that we want to pre-evaluate. Returns (in
2642 *INITP) an expression that will perform the pre-evaluation. The
2643 value returned by this function is a side-effect free expression
2644 equivalent to the pre-evaluated expression. Callers must ensure
2645 that *INITP is evaluated before EXP. */
2648 stabilize_expr (tree exp, tree* initp)
2652 if (!TREE_SIDE_EFFECTS (exp))
2653 init_expr = NULL_TREE;
2654 else if (!real_lvalue_p (exp)
2655 || !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (exp)))
2657 init_expr = get_target_expr (exp);
2658 exp = TARGET_EXPR_SLOT (init_expr);
2662 exp = cp_build_unary_op (ADDR_EXPR, exp, 1, tf_warning_or_error);
2663 init_expr = get_target_expr (exp);
2664 exp = TARGET_EXPR_SLOT (init_expr);
2665 exp = cp_build_indirect_ref (exp, 0, tf_warning_or_error);
2669 gcc_assert (!TREE_SIDE_EFFECTS (exp));
2673 /* Add NEW_EXPR, an expression whose value we don't care about, after the
2674 similar expression ORIG. */
2677 add_stmt_to_compound (tree orig, tree new_expr)
2679 if (!new_expr || !TREE_SIDE_EFFECTS (new_expr))
2681 if (!orig || !TREE_SIDE_EFFECTS (orig))
2683 return build2 (COMPOUND_EXPR, void_type_node, orig, new_expr);
2686 /* Like stabilize_expr, but for a call whose arguments we want to
2687 pre-evaluate. CALL is modified in place to use the pre-evaluated
2688 arguments, while, upon return, *INITP contains an expression to
2689 compute the arguments. */
2692 stabilize_call (tree call, tree *initp)
2694 tree inits = NULL_TREE;
2696 int nargs = call_expr_nargs (call);
2698 if (call == error_mark_node || processing_template_decl)
2704 gcc_assert (TREE_CODE (call) == CALL_EXPR);
2706 for (i = 0; i < nargs; i++)
2709 CALL_EXPR_ARG (call, i) =
2710 stabilize_expr (CALL_EXPR_ARG (call, i), &init);
2711 inits = add_stmt_to_compound (inits, init);
2717 /* Like stabilize_expr, but for an AGGR_INIT_EXPR whose arguments we want
2718 to pre-evaluate. CALL is modified in place to use the pre-evaluated
2719 arguments, while, upon return, *INITP contains an expression to
2720 compute the arguments. */
2723 stabilize_aggr_init (tree call, tree *initp)
2725 tree inits = NULL_TREE;
2727 int nargs = aggr_init_expr_nargs (call);
2729 if (call == error_mark_node)
2732 gcc_assert (TREE_CODE (call) == AGGR_INIT_EXPR);
2734 for (i = 0; i < nargs; i++)
2737 AGGR_INIT_EXPR_ARG (call, i) =
2738 stabilize_expr (AGGR_INIT_EXPR_ARG (call, i), &init);
2739 inits = add_stmt_to_compound (inits, init);
2745 /* Like stabilize_expr, but for an initialization.
2747 If the initialization is for an object of class type, this function
2748 takes care not to introduce additional temporaries.
2750 Returns TRUE iff the expression was successfully pre-evaluated,
2751 i.e., if INIT is now side-effect free, except for, possible, a
2752 single call to a constructor. */
2755 stabilize_init (tree init, tree *initp)
2761 if (t == error_mark_node || processing_template_decl)
2764 if (TREE_CODE (t) == INIT_EXPR
2765 && TREE_CODE (TREE_OPERAND (t, 1)) != TARGET_EXPR
2766 && TREE_CODE (TREE_OPERAND (t, 1)) != AGGR_INIT_EXPR)
2768 TREE_OPERAND (t, 1) = stabilize_expr (TREE_OPERAND (t, 1), initp);
2772 if (TREE_CODE (t) == INIT_EXPR)
2773 t = TREE_OPERAND (t, 1);
2774 if (TREE_CODE (t) == TARGET_EXPR)
2775 t = TARGET_EXPR_INITIAL (t);
2776 if (TREE_CODE (t) == COMPOUND_EXPR)
2778 if (TREE_CODE (t) == CONSTRUCTOR
2779 && EMPTY_CONSTRUCTOR_P (t))
2780 /* Default-initialization. */
2783 /* If the initializer is a COND_EXPR, we can't preevaluate
2785 if (TREE_CODE (t) == COND_EXPR)
2788 if (TREE_CODE (t) == CALL_EXPR)
2790 stabilize_call (t, initp);
2794 if (TREE_CODE (t) == AGGR_INIT_EXPR)
2796 stabilize_aggr_init (t, initp);
2800 /* The initialization is being performed via a bitwise copy -- and
2801 the item copied may have side effects. */
2802 return TREE_SIDE_EFFECTS (init);
2805 /* Like "fold", but should be used whenever we might be processing the
2806 body of a template. */
2809 fold_if_not_in_template (tree expr)
2811 /* In the body of a template, there is never any need to call
2812 "fold". We will call fold later when actually instantiating the
2813 template. Integral constant expressions in templates will be
2814 evaluated via fold_non_dependent_expr, as necessary. */
2815 if (processing_template_decl)
2818 /* Fold C++ front-end specific tree codes. */
2819 if (TREE_CODE (expr) == UNARY_PLUS_EXPR)
2820 return fold_convert (TREE_TYPE (expr), TREE_OPERAND (expr, 0));
2825 /* Returns true if a cast to TYPE may appear in an integral constant
2829 cast_valid_in_integral_constant_expression_p (tree type)
2831 return (INTEGRAL_OR_ENUMERATION_TYPE_P (type)
2832 || dependent_type_p (type)
2833 || type == error_mark_node);
2837 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
2838 /* Complain that some language-specific thing hanging off a tree
2839 node has been accessed improperly. */
2842 lang_check_failed (const char* file, int line, const char* function)
2844 internal_error ("lang_* check: failed in %s, at %s:%d",
2845 function, trim_filename (file), line);
2847 #endif /* ENABLE_TREE_CHECKING */
2849 #include "gt-cp-tree.h"