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 (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. */
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 return lvalue_p_1 (BASELINK_FUNCTIONS (ref),
211 treat_class_rvalues_as_lvalues);
213 case NON_DEPENDENT_EXPR:
214 /* We must consider NON_DEPENDENT_EXPRs to be lvalues so that
215 things like "&E" where "E" is an expression with a
216 non-dependent type work. It is safe to be lenient because an
217 error will be issued when the template is instantiated if "E"
225 /* If one operand is not an lvalue at all, then this expression is
227 if (!op1_lvalue_kind || !op2_lvalue_kind)
230 /* Otherwise, it's an lvalue, and it has all the odd properties
231 contributed by either operand. */
232 op1_lvalue_kind = op1_lvalue_kind | op2_lvalue_kind;
233 /* It's not an ordinary lvalue if it involves either a bit-field or
235 if ((op1_lvalue_kind & ~clk_ordinary) != clk_none)
236 op1_lvalue_kind &= ~clk_ordinary;
237 return op1_lvalue_kind;
240 /* Returns the kind of lvalue that REF is, in the sense of
241 [basic.lval]. This function should really be named lvalue_p; it
242 computes the C++ definition of lvalue. */
245 real_lvalue_p (tree ref)
247 return lvalue_p_1 (ref,
248 /*treat_class_rvalues_as_lvalues=*/0);
251 /* This differs from real_lvalue_p in that class rvalues are
252 considered lvalues. */
258 (lvalue_p_1 (ref, /*class rvalue ok*/ 1) != clk_none);
261 /* Test whether DECL is a builtin that may appear in a
262 constant-expression. */
265 builtin_valid_in_constant_expr_p (const_tree decl)
267 /* At present BUILT_IN_CONSTANT_P is the only builtin we're allowing
268 in constant-expressions. We may want to add other builtins later. */
269 return DECL_IS_BUILTIN_CONSTANT_P (decl);
272 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
275 build_target_expr (tree decl, tree value)
279 #ifdef ENABLE_CHECKING
280 gcc_assert (VOID_TYPE_P (TREE_TYPE (value))
281 || TREE_TYPE (decl) == TREE_TYPE (value)
282 || useless_type_conversion_p (TREE_TYPE (decl),
286 t = build4 (TARGET_EXPR, TREE_TYPE (decl), decl, value,
287 cxx_maybe_build_cleanup (decl), NULL_TREE);
288 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
289 ignore the TARGET_EXPR. If there really turn out to be no
290 side-effects, then the optimizer should be able to get rid of
291 whatever code is generated anyhow. */
292 TREE_SIDE_EFFECTS (t) = 1;
297 /* Return an undeclared local temporary of type TYPE for use in building a
301 build_local_temp (tree type)
303 tree slot = build_decl (VAR_DECL, NULL_TREE, type);
304 DECL_ARTIFICIAL (slot) = 1;
305 DECL_IGNORED_P (slot) = 1;
306 DECL_CONTEXT (slot) = current_function_decl;
307 layout_decl (slot, 0);
311 /* Set various status flags when building an AGGR_INIT_EXPR object T. */
314 process_aggr_init_operands (tree t)
318 side_effects = TREE_SIDE_EFFECTS (t);
322 n = TREE_OPERAND_LENGTH (t);
323 for (i = 1; i < n; i++)
325 tree op = TREE_OPERAND (t, i);
326 if (op && TREE_SIDE_EFFECTS (op))
333 TREE_SIDE_EFFECTS (t) = side_effects;
336 /* Build an AGGR_INIT_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE,
337 FN, and SLOT. NARGS is the number of call arguments which are specified
338 as a tree array ARGS. */
341 build_aggr_init_array (tree return_type, tree fn, tree slot, int nargs,
347 t = build_vl_exp (AGGR_INIT_EXPR, nargs + 3);
348 TREE_TYPE (t) = return_type;
349 AGGR_INIT_EXPR_FN (t) = fn;
350 AGGR_INIT_EXPR_SLOT (t) = slot;
351 for (i = 0; i < nargs; i++)
352 AGGR_INIT_EXPR_ARG (t, i) = args[i];
353 process_aggr_init_operands (t);
357 /* INIT is a CALL_EXPR or AGGR_INIT_EXPR which needs info about its
358 target. TYPE is the type to be initialized.
360 Build an AGGR_INIT_EXPR to represent the initialization. This function
361 differs from build_cplus_new in that an AGGR_INIT_EXPR can only be used
362 to initialize another object, whereas a TARGET_EXPR can either
363 initialize another object or create its own temporary object, and as a
364 result building up a TARGET_EXPR requires that the type's destructor be
368 build_aggr_init_expr (tree type, tree init)
375 /* Make sure that we're not trying to create an instance of an
377 abstract_virtuals_error (NULL_TREE, type);
379 if (TREE_CODE (init) == CALL_EXPR)
380 fn = CALL_EXPR_FN (init);
381 else if (TREE_CODE (init) == AGGR_INIT_EXPR)
382 fn = AGGR_INIT_EXPR_FN (init);
384 return convert (type, init);
386 is_ctor = (TREE_CODE (fn) == ADDR_EXPR
387 && TREE_CODE (TREE_OPERAND (fn, 0)) == FUNCTION_DECL
388 && DECL_CONSTRUCTOR_P (TREE_OPERAND (fn, 0)));
390 /* We split the CALL_EXPR into its function and its arguments here.
391 Then, in expand_expr, we put them back together. The reason for
392 this is that this expression might be a default argument
393 expression. In that case, we need a new temporary every time the
394 expression is used. That's what break_out_target_exprs does; it
395 replaces every AGGR_INIT_EXPR with a copy that uses a fresh
396 temporary slot. Then, expand_expr builds up a call-expression
397 using the new slot. */
399 /* If we don't need to use a constructor to create an object of this
400 type, don't mess with AGGR_INIT_EXPR. */
401 if (is_ctor || TREE_ADDRESSABLE (type))
403 slot = build_local_temp (type);
405 if (TREE_CODE(init) == CALL_EXPR)
406 rval = build_aggr_init_array (void_type_node, fn, slot,
407 call_expr_nargs (init),
408 CALL_EXPR_ARGP (init));
410 rval = build_aggr_init_array (void_type_node, fn, slot,
411 aggr_init_expr_nargs (init),
412 AGGR_INIT_EXPR_ARGP (init));
413 TREE_SIDE_EFFECTS (rval) = 1;
414 AGGR_INIT_VIA_CTOR_P (rval) = is_ctor;
422 /* INIT is a CALL_EXPR or AGGR_INIT_EXPR which needs info about its
423 target. TYPE is the type that this initialization should appear to
426 Build an encapsulation of the initialization to perform
427 and return it so that it can be processed by language-independent
428 and language-specific expression expanders. */
431 build_cplus_new (tree type, tree init)
433 tree rval = build_aggr_init_expr (type, init);
436 if (TREE_CODE (rval) == AGGR_INIT_EXPR)
437 slot = AGGR_INIT_EXPR_SLOT (rval);
438 else if (TREE_CODE (rval) == CALL_EXPR)
439 slot = build_local_temp (type);
443 rval = build_target_expr (slot, rval);
444 TARGET_EXPR_IMPLICIT_P (rval) = 1;
449 /* Build a TARGET_EXPR using INIT to initialize a new temporary of the
453 build_target_expr_with_type (tree init, tree type)
455 gcc_assert (!VOID_TYPE_P (type));
457 if (TREE_CODE (init) == TARGET_EXPR)
459 else if (CLASS_TYPE_P (type) && !TYPE_HAS_TRIVIAL_INIT_REF (type)
460 && !VOID_TYPE_P (TREE_TYPE (init))
461 && TREE_CODE (init) != COND_EXPR
462 && TREE_CODE (init) != CONSTRUCTOR
463 && TREE_CODE (init) != VA_ARG_EXPR)
464 /* We need to build up a copy constructor call. A void initializer
465 means we're being called from bot_manip. COND_EXPR is a special
466 case because we already have copies on the arms and we don't want
467 another one here. A CONSTRUCTOR is aggregate initialization, which
468 is handled separately. A VA_ARG_EXPR is magic creation of an
469 aggregate; there's no additional work to be done. */
470 return force_rvalue (init);
472 return force_target_expr (type, init);
475 /* Like the above function, but without the checking. This function should
476 only be used by code which is deliberately trying to subvert the type
477 system, such as call_builtin_trap. */
480 force_target_expr (tree type, tree init)
484 gcc_assert (!VOID_TYPE_P (type));
486 slot = build_local_temp (type);
487 return build_target_expr (slot, init);
490 /* Like build_target_expr_with_type, but use the type of INIT. */
493 get_target_expr (tree init)
495 if (TREE_CODE (init) == AGGR_INIT_EXPR)
496 return build_target_expr (AGGR_INIT_EXPR_SLOT (init), init);
498 return build_target_expr_with_type (init, TREE_TYPE (init));
501 /* If EXPR is a bitfield reference, convert it to the declared type of
502 the bitfield, and return the resulting expression. Otherwise,
503 return EXPR itself. */
506 convert_bitfield_to_declared_type (tree expr)
510 bitfield_type = is_bitfield_expr_with_lowered_type (expr);
512 expr = convert_to_integer (TYPE_MAIN_VARIANT (bitfield_type),
517 /* EXPR is being used in an rvalue context. Return a version of EXPR
518 that is marked as an rvalue. */
525 if (error_operand_p (expr))
530 Non-class rvalues always have cv-unqualified types. */
531 type = TREE_TYPE (expr);
532 if (!CLASS_TYPE_P (type) && cp_type_quals (type))
533 type = TYPE_MAIN_VARIANT (type);
535 if (!processing_template_decl && real_lvalue_p (expr))
536 expr = build1 (NON_LVALUE_EXPR, type, expr);
537 else if (type != TREE_TYPE (expr))
538 expr = build_nop (type, expr);
544 /* Hash an ARRAY_TYPE. K is really of type `tree'. */
547 cplus_array_hash (const void* k)
550 const_tree const t = (const_tree) k;
552 hash = TYPE_UID (TREE_TYPE (t));
554 hash ^= TYPE_UID (TYPE_DOMAIN (t));
558 typedef struct cplus_array_info {
563 /* Compare two ARRAY_TYPEs. K1 is really of type `tree', K2 is really
564 of type `cplus_array_info*'. */
567 cplus_array_compare (const void * k1, const void * k2)
569 const_tree const t1 = (const_tree) k1;
570 const cplus_array_info *const t2 = (const cplus_array_info*) k2;
572 return (TREE_TYPE (t1) == t2->type && TYPE_DOMAIN (t1) == t2->domain);
575 /* Hash table containing all of the C++ array types, including
576 dependent array types and array types whose element type is
578 static GTY ((param_is (union tree_node))) htab_t cplus_array_htab;
582 build_cplus_array_type_1 (tree elt_type, tree index_type)
586 if (elt_type == error_mark_node || index_type == error_mark_node)
587 return error_mark_node;
589 if (processing_template_decl
590 && (dependent_type_p (elt_type)
591 || (index_type && !TREE_CONSTANT (TYPE_MAX_VALUE (index_type)))))
594 cplus_array_info cai;
597 if (cplus_array_htab == NULL)
598 cplus_array_htab = htab_create_ggc (61, &cplus_array_hash,
599 &cplus_array_compare, NULL);
601 hash = TYPE_UID (elt_type);
603 hash ^= TYPE_UID (index_type);
605 cai.domain = index_type;
607 e = htab_find_slot_with_hash (cplus_array_htab, &cai, hash, INSERT);
609 /* We have found the type: we're done. */
613 /* Build a new array type. */
614 t = make_node (ARRAY_TYPE);
615 TREE_TYPE (t) = elt_type;
616 TYPE_DOMAIN (t) = index_type;
618 /* Store it in the hash table. */
621 /* Set the canonical type for this new node. */
622 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
623 || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type)))
624 SET_TYPE_STRUCTURAL_EQUALITY (t);
625 else if (TYPE_CANONICAL (elt_type) != elt_type
627 && TYPE_CANONICAL (index_type) != index_type))
629 = build_cplus_array_type
630 (TYPE_CANONICAL (elt_type),
631 index_type ? TYPE_CANONICAL (index_type) : index_type);
633 TYPE_CANONICAL (t) = t;
637 t = build_array_type (elt_type, index_type);
639 /* Push these needs up so that initialization takes place
641 TYPE_NEEDS_CONSTRUCTING (t)
642 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (elt_type));
643 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
644 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (elt_type));
649 build_cplus_array_type (tree elt_type, tree index_type)
652 int type_quals = cp_type_quals (elt_type);
654 if (type_quals != TYPE_UNQUALIFIED)
655 elt_type = cp_build_qualified_type (elt_type, TYPE_UNQUALIFIED);
657 t = build_cplus_array_type_1 (elt_type, index_type);
659 if (type_quals != TYPE_UNQUALIFIED)
660 t = cp_build_qualified_type (t, type_quals);
665 /* Return an ARRAY_TYPE with element type ELT and length N. */
668 build_array_of_n_type (tree elt, int n)
670 return build_cplus_array_type (elt, build_index_type (size_int (n - 1)));
673 /* Return a reference type node referring to TO_TYPE. If RVAL is
674 true, return an rvalue reference type, otherwise return an lvalue
675 reference type. If a type node exists, reuse it, otherwise create
678 cp_build_reference_type (tree to_type, bool rval)
681 lvalue_ref = build_reference_type (to_type);
685 /* This code to create rvalue reference types is based on and tied
686 to the code creating lvalue reference types in the middle-end
687 functions build_reference_type_for_mode and build_reference_type.
689 It works by putting the rvalue reference type nodes after the
690 lvalue reference nodes in the TYPE_NEXT_REF_TO linked list, so
691 they will effectively be ignored by the middle end. */
693 for (t = lvalue_ref; (t = TYPE_NEXT_REF_TO (t)); )
694 if (TYPE_REF_IS_RVALUE (t))
697 t = copy_node (lvalue_ref);
699 TYPE_REF_IS_RVALUE (t) = true;
700 TYPE_NEXT_REF_TO (t) = TYPE_NEXT_REF_TO (lvalue_ref);
701 TYPE_NEXT_REF_TO (lvalue_ref) = t;
702 TYPE_MAIN_VARIANT (t) = t;
704 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
705 SET_TYPE_STRUCTURAL_EQUALITY (t);
706 else if (TYPE_CANONICAL (to_type) != to_type)
708 = cp_build_reference_type (TYPE_CANONICAL (to_type), rval);
710 TYPE_CANONICAL (t) = t;
718 /* Used by the C++ front end to build qualified array types. However,
719 the C version of this function does not properly maintain canonical
720 types (which are not used in C). */
722 c_build_qualified_type (tree type, int type_quals)
724 return cp_build_qualified_type (type, type_quals);
728 /* Make a variant of TYPE, qualified with the TYPE_QUALS. Handles
729 arrays correctly. In particular, if TYPE is an array of T's, and
730 TYPE_QUALS is non-empty, returns an array of qualified T's.
732 FLAGS determines how to deal with ill-formed qualifications. If
733 tf_ignore_bad_quals is set, then bad qualifications are dropped
734 (this is permitted if TYPE was introduced via a typedef or template
735 type parameter). If bad qualifications are dropped and tf_warning
736 is set, then a warning is issued for non-const qualifications. If
737 tf_ignore_bad_quals is not set and tf_error is not set, we
738 return error_mark_node. Otherwise, we issue an error, and ignore
741 Qualification of a reference type is valid when the reference came
742 via a typedef or template type argument. [dcl.ref] No such
743 dispensation is provided for qualifying a function type. [dcl.fct]
744 DR 295 queries this and the proposed resolution brings it into line
745 with qualifying a reference. We implement the DR. We also behave
746 in a similar manner for restricting non-pointer types. */
749 cp_build_qualified_type_real (tree type,
751 tsubst_flags_t complain)
754 int bad_quals = TYPE_UNQUALIFIED;
756 if (type == error_mark_node)
759 if (type_quals == cp_type_quals (type))
762 if (TREE_CODE (type) == ARRAY_TYPE)
764 /* In C++, the qualification really applies to the array element
765 type. Obtain the appropriately qualified element type. */
768 = cp_build_qualified_type_real (TREE_TYPE (type),
772 if (element_type == error_mark_node)
773 return error_mark_node;
775 /* See if we already have an identically qualified type. */
776 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
777 if (cp_type_quals (t) == type_quals
778 && TYPE_NAME (t) == TYPE_NAME (type)
779 && TYPE_CONTEXT (t) == TYPE_CONTEXT (type))
784 t = build_cplus_array_type_1 (element_type, TYPE_DOMAIN (type));
786 if (TYPE_MAIN_VARIANT (t) != TYPE_MAIN_VARIANT (type))
788 /* Set the main variant of the newly-created ARRAY_TYPE
789 (with cv-qualified element type) to the main variant of
790 the unqualified ARRAY_TYPE we started with. */
791 tree last_variant = t;
792 tree m = TYPE_MAIN_VARIANT (type);
794 /* Find the last variant on the new ARRAY_TYPEs list of
795 variants, setting the main variant of each of the other
796 types to the main variant of our unqualified
798 while (TYPE_NEXT_VARIANT (last_variant))
800 TYPE_MAIN_VARIANT (last_variant) = m;
801 last_variant = TYPE_NEXT_VARIANT (last_variant);
804 /* Splice in the newly-created variants. */
805 TYPE_NEXT_VARIANT (last_variant) = TYPE_NEXT_VARIANT (m);
806 TYPE_NEXT_VARIANT (m) = t;
807 TYPE_MAIN_VARIANT (last_variant) = m;
811 /* Even if we already had this variant, we update
812 TYPE_NEEDS_CONSTRUCTING and TYPE_HAS_NONTRIVIAL_DESTRUCTOR in case
813 they changed since the variant was originally created.
815 This seems hokey; if there is some way to use a previous
816 variant *without* coming through here,
817 TYPE_NEEDS_CONSTRUCTING will never be updated. */
818 TYPE_NEEDS_CONSTRUCTING (t)
819 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (element_type));
820 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
821 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (element_type));
824 else if (TYPE_PTRMEMFUNC_P (type))
826 /* For a pointer-to-member type, we can't just return a
827 cv-qualified version of the RECORD_TYPE. If we do, we
828 haven't changed the field that contains the actual pointer to
829 a method, and so TYPE_PTRMEMFUNC_FN_TYPE will be wrong. */
832 t = TYPE_PTRMEMFUNC_FN_TYPE (type);
833 t = cp_build_qualified_type_real (t, type_quals, complain);
834 return build_ptrmemfunc_type (t);
836 else if (TREE_CODE (type) == TYPE_PACK_EXPANSION)
838 tree t = PACK_EXPANSION_PATTERN (type);
840 t = cp_build_qualified_type_real (t, type_quals, complain);
841 return make_pack_expansion (t);
844 /* A reference or method type shall not be cv-qualified.
845 [dcl.ref], [dcl.fct] */
846 if (type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE)
847 && (TREE_CODE (type) == REFERENCE_TYPE
848 || TREE_CODE (type) == METHOD_TYPE))
850 bad_quals |= type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
851 type_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
854 /* A restrict-qualified type must be a pointer (or reference)
855 to object or incomplete type, or a function type. */
856 if ((type_quals & TYPE_QUAL_RESTRICT)
857 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
858 && TREE_CODE (type) != TYPENAME_TYPE
859 && TREE_CODE (type) != FUNCTION_TYPE
860 && !POINTER_TYPE_P (type))
862 bad_quals |= TYPE_QUAL_RESTRICT;
863 type_quals &= ~TYPE_QUAL_RESTRICT;
866 if (bad_quals == TYPE_UNQUALIFIED)
868 else if (!(complain & (tf_error | tf_ignore_bad_quals)))
869 return error_mark_node;
872 if (complain & tf_ignore_bad_quals)
873 /* We're not going to warn about constifying things that can't
875 bad_quals &= ~TYPE_QUAL_CONST;
878 tree bad_type = build_qualified_type (ptr_type_node, bad_quals);
880 if (!(complain & tf_ignore_bad_quals))
881 error ("%qV qualifiers cannot be applied to %qT",
886 /* Retrieve (or create) the appropriately qualified variant. */
887 result = build_qualified_type (type, type_quals);
889 /* If this was a pointer-to-method type, and we just made a copy,
890 then we need to unshare the record that holds the cached
891 pointer-to-member-function type, because these will be distinct
892 between the unqualified and qualified types. */
894 && TREE_CODE (type) == POINTER_TYPE
895 && TREE_CODE (TREE_TYPE (type)) == METHOD_TYPE
896 && TYPE_LANG_SPECIFIC (result) == TYPE_LANG_SPECIFIC (type))
897 TYPE_LANG_SPECIFIC (result) = NULL;
899 /* We may also have ended up building a new copy of the canonical
900 type of a pointer-to-method type, which could have the same
901 sharing problem described above. */
902 if (TYPE_CANONICAL (result) != TYPE_CANONICAL (type)
903 && TREE_CODE (type) == POINTER_TYPE
904 && TREE_CODE (TREE_TYPE (type)) == METHOD_TYPE
905 && (TYPE_LANG_SPECIFIC (TYPE_CANONICAL (result))
906 == TYPE_LANG_SPECIFIC (TYPE_CANONICAL (type))))
907 TYPE_LANG_SPECIFIC (TYPE_CANONICAL (result)) = NULL;
913 /* Returns the canonical version of TYPE. In other words, if TYPE is
914 a typedef, returns the underlying type. The cv-qualification of
915 the type returned matches the type input; they will always be
919 canonical_type_variant (tree t)
921 if (t == error_mark_node)
922 return error_mark_node;
924 return cp_build_qualified_type (TYPE_MAIN_VARIANT (t), cp_type_quals (t));
927 /* Makes a copy of BINFO and TYPE, which is to be inherited into a
928 graph dominated by T. If BINFO is NULL, TYPE is a dependent base,
929 and we do a shallow copy. If BINFO is non-NULL, we do a deep copy.
930 VIRT indicates whether TYPE is inherited virtually or not.
931 IGO_PREV points at the previous binfo of the inheritance graph
932 order chain. The newly copied binfo's TREE_CHAIN forms this
935 The CLASSTYPE_VBASECLASSES vector of T is constructed in the
936 correct order. That is in the order the bases themselves should be
939 The BINFO_INHERITANCE of a virtual base class points to the binfo
940 of the most derived type. ??? We could probably change this so that
941 BINFO_INHERITANCE becomes synonymous with BINFO_PRIMARY, and hence
942 remove a field. They currently can only differ for primary virtual
946 copy_binfo (tree binfo, tree type, tree t, tree *igo_prev, int virt)
952 /* See if we've already made this virtual base. */
953 new_binfo = binfo_for_vbase (type, t);
958 new_binfo = make_tree_binfo (binfo ? BINFO_N_BASE_BINFOS (binfo) : 0);
959 BINFO_TYPE (new_binfo) = type;
961 /* Chain it into the inheritance graph. */
962 TREE_CHAIN (*igo_prev) = new_binfo;
963 *igo_prev = new_binfo;
970 gcc_assert (!BINFO_DEPENDENT_BASE_P (binfo));
971 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), type));
973 BINFO_OFFSET (new_binfo) = BINFO_OFFSET (binfo);
974 BINFO_VIRTUALS (new_binfo) = BINFO_VIRTUALS (binfo);
976 /* We do not need to copy the accesses, as they are read only. */
977 BINFO_BASE_ACCESSES (new_binfo) = BINFO_BASE_ACCESSES (binfo);
979 /* Recursively copy base binfos of BINFO. */
980 for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++)
984 gcc_assert (!BINFO_DEPENDENT_BASE_P (base_binfo));
985 new_base_binfo = copy_binfo (base_binfo, BINFO_TYPE (base_binfo),
987 BINFO_VIRTUAL_P (base_binfo));
989 if (!BINFO_INHERITANCE_CHAIN (new_base_binfo))
990 BINFO_INHERITANCE_CHAIN (new_base_binfo) = new_binfo;
991 BINFO_BASE_APPEND (new_binfo, new_base_binfo);
995 BINFO_DEPENDENT_BASE_P (new_binfo) = 1;
999 /* Push it onto the list after any virtual bases it contains
1000 will have been pushed. */
1001 VEC_quick_push (tree, CLASSTYPE_VBASECLASSES (t), new_binfo);
1002 BINFO_VIRTUAL_P (new_binfo) = 1;
1003 BINFO_INHERITANCE_CHAIN (new_binfo) = TYPE_BINFO (t);
1009 /* Hashing of lists so that we don't make duplicates.
1010 The entry point is `list_hash_canon'. */
1012 /* Now here is the hash table. When recording a list, it is added
1013 to the slot whose index is the hash code mod the table size.
1014 Note that the hash table is used for several kinds of lists.
1015 While all these live in the same table, they are completely independent,
1016 and the hash code is computed differently for each of these. */
1018 static GTY ((param_is (union tree_node))) htab_t list_hash_table;
1027 /* Compare ENTRY (an entry in the hash table) with DATA (a list_proxy
1028 for a node we are thinking about adding). */
1031 list_hash_eq (const void* entry, const void* data)
1033 const_tree const t = (const_tree) entry;
1034 const struct list_proxy *const proxy = (const struct list_proxy *) data;
1036 return (TREE_VALUE (t) == proxy->value
1037 && TREE_PURPOSE (t) == proxy->purpose
1038 && TREE_CHAIN (t) == proxy->chain);
1041 /* Compute a hash code for a list (chain of TREE_LIST nodes
1042 with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the
1043 TREE_COMMON slots), by adding the hash codes of the individual entries. */
1046 list_hash_pieces (tree purpose, tree value, tree chain)
1048 hashval_t hashcode = 0;
1051 hashcode += TREE_HASH (chain);
1054 hashcode += TREE_HASH (value);
1058 hashcode += TREE_HASH (purpose);
1064 /* Hash an already existing TREE_LIST. */
1067 list_hash (const void* p)
1069 const_tree const t = (const_tree) p;
1070 return list_hash_pieces (TREE_PURPOSE (t),
1075 /* Given list components PURPOSE, VALUE, AND CHAIN, return the canonical
1076 object for an identical list if one already exists. Otherwise, build a
1077 new one, and record it as the canonical object. */
1080 hash_tree_cons (tree purpose, tree value, tree chain)
1084 struct list_proxy proxy;
1086 /* Hash the list node. */
1087 hashcode = list_hash_pieces (purpose, value, chain);
1088 /* Create a proxy for the TREE_LIST we would like to create. We
1089 don't actually create it so as to avoid creating garbage. */
1090 proxy.purpose = purpose;
1091 proxy.value = value;
1092 proxy.chain = chain;
1093 /* See if it is already in the table. */
1094 slot = htab_find_slot_with_hash (list_hash_table, &proxy, hashcode,
1096 /* If not, create a new node. */
1098 *slot = tree_cons (purpose, value, chain);
1099 return (tree) *slot;
1102 /* Constructor for hashed lists. */
1105 hash_tree_chain (tree value, tree chain)
1107 return hash_tree_cons (NULL_TREE, value, chain);
1111 debug_binfo (tree elem)
1116 fprintf (stderr, "type \"%s\", offset = " HOST_WIDE_INT_PRINT_DEC
1118 TYPE_NAME_STRING (BINFO_TYPE (elem)),
1119 TREE_INT_CST_LOW (BINFO_OFFSET (elem)));
1120 debug_tree (BINFO_TYPE (elem));
1121 if (BINFO_VTABLE (elem))
1122 fprintf (stderr, "vtable decl \"%s\"\n",
1123 IDENTIFIER_POINTER (DECL_NAME (get_vtbl_decl_for_binfo (elem))));
1125 fprintf (stderr, "no vtable decl yet\n");
1126 fprintf (stderr, "virtuals:\n");
1127 virtuals = BINFO_VIRTUALS (elem);
1132 tree fndecl = TREE_VALUE (virtuals);
1133 fprintf (stderr, "%s [%ld =? %ld]\n",
1134 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl)),
1135 (long) n, (long) TREE_INT_CST_LOW (DECL_VINDEX (fndecl)));
1137 virtuals = TREE_CHAIN (virtuals);
1141 /* Build a representation for the qualified name SCOPE::NAME. TYPE is
1142 the type of the result expression, if known, or NULL_TREE if the
1143 resulting expression is type-dependent. If TEMPLATE_P is true,
1144 NAME is known to be a template because the user explicitly used the
1145 "template" keyword after the "::".
1147 All SCOPE_REFs should be built by use of this function. */
1150 build_qualified_name (tree type, tree scope, tree name, bool template_p)
1153 if (type == error_mark_node
1154 || scope == error_mark_node
1155 || name == error_mark_node)
1156 return error_mark_node;
1157 t = build2 (SCOPE_REF, type, scope, name);
1158 QUALIFIED_NAME_IS_TEMPLATE (t) = template_p;
1162 /* Returns nonzero if X is an expression for a (possibly overloaded)
1163 function. If "f" is a function or function template, "f", "c->f",
1164 "c.f", "C::f", and "f<int>" will all be considered possibly
1165 overloaded functions. Returns 2 if the function is actually
1166 overloaded, i.e., if it is impossible to know the type of the
1167 function without performing overload resolution. */
1170 is_overloaded_fn (tree x)
1172 /* A baselink is also considered an overloaded function. */
1173 if (TREE_CODE (x) == OFFSET_REF
1174 || TREE_CODE (x) == COMPONENT_REF)
1175 x = TREE_OPERAND (x, 1);
1177 x = BASELINK_FUNCTIONS (x);
1178 if (TREE_CODE (x) == TEMPLATE_ID_EXPR)
1179 x = TREE_OPERAND (x, 0);
1180 if (DECL_FUNCTION_TEMPLATE_P (OVL_CURRENT (x))
1181 || (TREE_CODE (x) == OVERLOAD && OVL_CHAIN (x)))
1183 return (TREE_CODE (x) == FUNCTION_DECL
1184 || TREE_CODE (x) == OVERLOAD);
1187 /* Returns true iff X is an expression for an overloaded function
1188 whose type cannot be known without performing overload
1192 really_overloaded_fn (tree x)
1194 return is_overloaded_fn (x) == 2;
1198 get_first_fn (tree from)
1200 gcc_assert (is_overloaded_fn (from));
1201 /* A baselink is also considered an overloaded function. */
1202 if (TREE_CODE (from) == COMPONENT_REF)
1203 from = TREE_OPERAND (from, 1);
1204 if (BASELINK_P (from))
1205 from = BASELINK_FUNCTIONS (from);
1206 if (TREE_CODE (from) == TEMPLATE_ID_EXPR)
1207 from = TREE_OPERAND (from, 0);
1208 return OVL_CURRENT (from);
1211 /* Return a new OVL node, concatenating it with the old one. */
1214 ovl_cons (tree decl, tree chain)
1216 tree result = make_node (OVERLOAD);
1217 TREE_TYPE (result) = unknown_type_node;
1218 OVL_FUNCTION (result) = decl;
1219 TREE_CHAIN (result) = chain;
1224 /* Build a new overloaded function. If this is the first one,
1225 just return it; otherwise, ovl_cons the _DECLs */
1228 build_overload (tree decl, tree chain)
1230 if (! chain && TREE_CODE (decl) != TEMPLATE_DECL)
1232 if (chain && TREE_CODE (chain) != OVERLOAD)
1233 chain = ovl_cons (chain, NULL_TREE);
1234 return ovl_cons (decl, chain);
1238 #define PRINT_RING_SIZE 4
1241 cxx_printable_name (tree decl, int v)
1243 static unsigned int uid_ring[PRINT_RING_SIZE];
1244 static char *print_ring[PRINT_RING_SIZE];
1245 static int ring_counter;
1248 /* Only cache functions. */
1250 || TREE_CODE (decl) != FUNCTION_DECL
1251 || DECL_LANG_SPECIFIC (decl) == 0)
1252 return lang_decl_name (decl, v);
1254 /* See if this print name is lying around. */
1255 for (i = 0; i < PRINT_RING_SIZE; i++)
1256 if (uid_ring[i] == DECL_UID (decl))
1257 /* yes, so return it. */
1258 return print_ring[i];
1260 if (++ring_counter == PRINT_RING_SIZE)
1263 if (current_function_decl != NULL_TREE)
1265 if (uid_ring[ring_counter] == DECL_UID (current_function_decl))
1267 if (ring_counter == PRINT_RING_SIZE)
1269 gcc_assert (uid_ring[ring_counter] != DECL_UID (current_function_decl));
1272 if (print_ring[ring_counter])
1273 free (print_ring[ring_counter]);
1275 print_ring[ring_counter] = xstrdup (lang_decl_name (decl, v));
1276 uid_ring[ring_counter] = DECL_UID (decl);
1277 return print_ring[ring_counter];
1280 /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions
1281 listed in RAISES. */
1284 build_exception_variant (tree type, tree raises)
1286 tree v = TYPE_MAIN_VARIANT (type);
1287 int type_quals = TYPE_QUALS (type);
1289 for (; v; v = TYPE_NEXT_VARIANT (v))
1290 if (check_qualified_type (v, type, type_quals)
1291 && comp_except_specs (raises, TYPE_RAISES_EXCEPTIONS (v), 1))
1294 /* Need to build a new variant. */
1295 v = build_variant_type_copy (type);
1296 TYPE_RAISES_EXCEPTIONS (v) = raises;
1300 /* Given a TEMPLATE_TEMPLATE_PARM node T, create a new
1301 BOUND_TEMPLATE_TEMPLATE_PARM bound with NEWARGS as its template
1305 bind_template_template_parm (tree t, tree newargs)
1307 tree decl = TYPE_NAME (t);
1310 t2 = cxx_make_type (BOUND_TEMPLATE_TEMPLATE_PARM);
1311 decl = build_decl (TYPE_DECL, DECL_NAME (decl), NULL_TREE);
1313 /* These nodes have to be created to reflect new TYPE_DECL and template
1315 TEMPLATE_TYPE_PARM_INDEX (t2) = copy_node (TEMPLATE_TYPE_PARM_INDEX (t));
1316 TEMPLATE_PARM_DECL (TEMPLATE_TYPE_PARM_INDEX (t2)) = decl;
1317 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2)
1318 = tree_cons (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t),
1319 newargs, NULL_TREE);
1321 TREE_TYPE (decl) = t2;
1322 TYPE_NAME (t2) = decl;
1323 TYPE_STUB_DECL (t2) = decl;
1325 SET_TYPE_STRUCTURAL_EQUALITY (t2);
1330 /* Called from count_trees via walk_tree. */
1333 count_trees_r (tree *tp, int *walk_subtrees, void *data)
1343 /* Debugging function for measuring the rough complexity of a tree
1347 count_trees (tree t)
1350 cp_walk_tree_without_duplicates (&t, count_trees_r, &n_trees);
1354 /* Called from verify_stmt_tree via walk_tree. */
1357 verify_stmt_tree_r (tree* tp,
1358 int* walk_subtrees ATTRIBUTE_UNUSED ,
1362 htab_t *statements = (htab_t *) data;
1365 if (!STATEMENT_CODE_P (TREE_CODE (t)))
1368 /* If this statement is already present in the hash table, then
1369 there is a circularity in the statement tree. */
1370 gcc_assert (!htab_find (*statements, t));
1372 slot = htab_find_slot (*statements, t, INSERT);
1378 /* Debugging function to check that the statement T has not been
1379 corrupted. For now, this function simply checks that T contains no
1383 verify_stmt_tree (tree t)
1386 statements = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
1387 cp_walk_tree (&t, verify_stmt_tree_r, &statements, NULL);
1388 htab_delete (statements);
1391 /* Check if the type T depends on a type with no linkage and if so, return
1392 it. If RELAXED_P then do not consider a class type declared within
1393 a TREE_PUBLIC function to have no linkage. */
1396 no_linkage_check (tree t, bool relaxed_p)
1400 /* There's no point in checking linkage on template functions; we
1401 can't know their complete types. */
1402 if (processing_template_decl)
1405 switch (TREE_CODE (t))
1410 if (TYPE_PTRMEMFUNC_P (t))
1414 if (!CLASS_TYPE_P (t))
1418 if (TYPE_ANONYMOUS_P (t))
1420 fn = decl_function_context (TYPE_MAIN_DECL (t));
1421 if (fn && (!relaxed_p || !TREE_PUBLIC (fn)))
1427 case REFERENCE_TYPE:
1428 return no_linkage_check (TREE_TYPE (t), relaxed_p);
1432 r = no_linkage_check (TYPE_PTRMEM_POINTED_TO_TYPE (t),
1436 return no_linkage_check (TYPE_PTRMEM_CLASS_TYPE (t), relaxed_p);
1439 r = no_linkage_check (TYPE_METHOD_BASETYPE (t), relaxed_p);
1446 for (parm = TYPE_ARG_TYPES (t);
1447 parm && parm != void_list_node;
1448 parm = TREE_CHAIN (parm))
1450 r = no_linkage_check (TREE_VALUE (parm), relaxed_p);
1454 return no_linkage_check (TREE_TYPE (t), relaxed_p);
1462 #ifdef GATHER_STATISTICS
1463 extern int depth_reached;
1467 cxx_print_statistics (void)
1469 print_search_statistics ();
1470 print_class_statistics ();
1471 #ifdef GATHER_STATISTICS
1472 fprintf (stderr, "maximum template instantiation depth reached: %d\n",
1477 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1478 (which is an ARRAY_TYPE). This counts only elements of the top
1482 array_type_nelts_top (tree type)
1484 return fold_build2 (PLUS_EXPR, sizetype,
1485 array_type_nelts (type),
1489 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1490 (which is an ARRAY_TYPE). This one is a recursive count of all
1491 ARRAY_TYPEs that are clumped together. */
1494 array_type_nelts_total (tree type)
1496 tree sz = array_type_nelts_top (type);
1497 type = TREE_TYPE (type);
1498 while (TREE_CODE (type) == ARRAY_TYPE)
1500 tree n = array_type_nelts_top (type);
1501 sz = fold_build2 (MULT_EXPR, sizetype, sz, n);
1502 type = TREE_TYPE (type);
1507 /* Called from break_out_target_exprs via mapcar. */
1510 bot_manip (tree* tp, int* walk_subtrees, void* data)
1512 splay_tree target_remap = ((splay_tree) data);
1515 if (!TYPE_P (t) && TREE_CONSTANT (t))
1517 /* There can't be any TARGET_EXPRs or their slot variables below
1518 this point. We used to check !TREE_SIDE_EFFECTS, but then we
1519 failed to copy an ADDR_EXPR of the slot VAR_DECL. */
1523 if (TREE_CODE (t) == TARGET_EXPR)
1527 if (TREE_CODE (TREE_OPERAND (t, 1)) == AGGR_INIT_EXPR)
1528 u = build_cplus_new (TREE_TYPE (t), TREE_OPERAND (t, 1));
1530 u = build_target_expr_with_type (TREE_OPERAND (t, 1), TREE_TYPE (t));
1532 /* Map the old variable to the new one. */
1533 splay_tree_insert (target_remap,
1534 (splay_tree_key) TREE_OPERAND (t, 0),
1535 (splay_tree_value) TREE_OPERAND (u, 0));
1537 TREE_OPERAND (u, 1) = break_out_target_exprs (TREE_OPERAND (u, 1));
1539 /* Replace the old expression with the new version. */
1541 /* We don't have to go below this point; the recursive call to
1542 break_out_target_exprs will have handled anything below this
1548 /* Make a copy of this node. */
1549 return copy_tree_r (tp, walk_subtrees, NULL);
1552 /* Replace all remapped VAR_DECLs in T with their new equivalents.
1553 DATA is really a splay-tree mapping old variables to new
1557 bot_replace (tree* t,
1558 int* walk_subtrees ATTRIBUTE_UNUSED ,
1561 splay_tree target_remap = ((splay_tree) data);
1563 if (TREE_CODE (*t) == VAR_DECL)
1565 splay_tree_node n = splay_tree_lookup (target_remap,
1566 (splay_tree_key) *t);
1568 *t = (tree) n->value;
1574 /* When we parse a default argument expression, we may create
1575 temporary variables via TARGET_EXPRs. When we actually use the
1576 default-argument expression, we make a copy of the expression, but
1577 we must replace the temporaries with appropriate local versions. */
1580 break_out_target_exprs (tree t)
1582 static int target_remap_count;
1583 static splay_tree target_remap;
1585 if (!target_remap_count++)
1586 target_remap = splay_tree_new (splay_tree_compare_pointers,
1587 /*splay_tree_delete_key_fn=*/NULL,
1588 /*splay_tree_delete_value_fn=*/NULL);
1589 cp_walk_tree (&t, bot_manip, target_remap, NULL);
1590 cp_walk_tree (&t, bot_replace, target_remap, NULL);
1592 if (!--target_remap_count)
1594 splay_tree_delete (target_remap);
1595 target_remap = NULL;
1601 /* Similar to `build_nt', but for template definitions of dependent
1605 build_min_nt (enum tree_code code, ...)
1612 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
1616 t = make_node (code);
1617 length = TREE_CODE_LENGTH (code);
1619 for (i = 0; i < length; i++)
1621 tree x = va_arg (p, tree);
1622 TREE_OPERAND (t, i) = x;
1630 /* Similar to `build', but for template definitions. */
1633 build_min (enum tree_code code, tree tt, ...)
1640 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
1644 t = make_node (code);
1645 length = TREE_CODE_LENGTH (code);
1648 for (i = 0; i < length; i++)
1650 tree x = va_arg (p, tree);
1651 TREE_OPERAND (t, i) = x;
1652 if (x && !TYPE_P (x) && TREE_SIDE_EFFECTS (x))
1653 TREE_SIDE_EFFECTS (t) = 1;
1660 /* Similar to `build', but for template definitions of non-dependent
1661 expressions. NON_DEP is the non-dependent expression that has been
1665 build_min_non_dep (enum tree_code code, tree non_dep, ...)
1672 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
1674 va_start (p, non_dep);
1676 t = make_node (code);
1677 length = TREE_CODE_LENGTH (code);
1678 TREE_TYPE (t) = TREE_TYPE (non_dep);
1679 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (non_dep);
1681 for (i = 0; i < length; i++)
1683 tree x = va_arg (p, tree);
1684 TREE_OPERAND (t, i) = x;
1687 if (code == COMPOUND_EXPR && TREE_CODE (non_dep) != COMPOUND_EXPR)
1688 /* This should not be considered a COMPOUND_EXPR, because it
1689 resolves to an overload. */
1690 COMPOUND_EXPR_OVERLOADED (t) = 1;
1696 /* Similar to `build_call_list', but for template definitions of non-dependent
1697 expressions. NON_DEP is the non-dependent expression that has been
1701 build_min_non_dep_call_list (tree non_dep, tree fn, tree arglist)
1703 tree t = build_nt_call_list (fn, arglist);
1704 TREE_TYPE (t) = TREE_TYPE (non_dep);
1705 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (non_dep);
1710 get_type_decl (tree t)
1712 if (TREE_CODE (t) == TYPE_DECL)
1715 return TYPE_STUB_DECL (t);
1716 gcc_assert (t == error_mark_node);
1720 /* Returns the namespace that contains DECL, whether directly or
1724 decl_namespace_context (tree decl)
1728 if (TREE_CODE (decl) == NAMESPACE_DECL)
1730 else if (TYPE_P (decl))
1731 decl = CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl));
1733 decl = CP_DECL_CONTEXT (decl);
1737 /* Returns true if decl is within an anonymous namespace, however deeply
1738 nested, or false otherwise. */
1741 decl_anon_ns_mem_p (const_tree decl)
1745 if (decl == NULL_TREE || decl == error_mark_node)
1747 if (TREE_CODE (decl) == NAMESPACE_DECL
1748 && DECL_NAME (decl) == NULL_TREE)
1750 /* Classes and namespaces inside anonymous namespaces have
1751 TREE_PUBLIC == 0, so we can shortcut the search. */
1752 else if (TYPE_P (decl))
1753 return (TREE_PUBLIC (TYPE_NAME (decl)) == 0);
1754 else if (TREE_CODE (decl) == NAMESPACE_DECL)
1755 return (TREE_PUBLIC (decl) == 0);
1757 decl = DECL_CONTEXT (decl);
1761 /* Return truthvalue of whether T1 is the same tree structure as T2.
1762 Return 1 if they are the same. Return 0 if they are different. */
1765 cp_tree_equal (tree t1, tree t2)
1767 enum tree_code code1, code2;
1774 for (code1 = TREE_CODE (t1);
1775 CONVERT_EXPR_CODE_P (code1)
1776 || code1 == NON_LVALUE_EXPR;
1777 code1 = TREE_CODE (t1))
1778 t1 = TREE_OPERAND (t1, 0);
1779 for (code2 = TREE_CODE (t2);
1780 CONVERT_EXPR_CODE_P (code2)
1781 || code1 == NON_LVALUE_EXPR;
1782 code2 = TREE_CODE (t2))
1783 t2 = TREE_OPERAND (t2, 0);
1785 /* They might have become equal now. */
1795 return TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
1796 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2);
1799 return REAL_VALUES_EQUAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
1802 return TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
1803 && !memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
1804 TREE_STRING_LENGTH (t1));
1807 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1),
1808 TREE_FIXED_CST (t2));
1811 return cp_tree_equal (TREE_REALPART (t1), TREE_REALPART (t2))
1812 && cp_tree_equal (TREE_IMAGPART (t1), TREE_IMAGPART (t2));
1815 /* We need to do this when determining whether or not two
1816 non-type pointer to member function template arguments
1818 if (!(same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
1819 /* The first operand is RTL. */
1820 && TREE_OPERAND (t1, 0) == TREE_OPERAND (t2, 0)))
1822 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1825 if (!cp_tree_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2)))
1827 if (!cp_tree_equal (TREE_VALUE (t1), TREE_VALUE (t2)))
1829 return cp_tree_equal (TREE_CHAIN (t1), TREE_CHAIN (t2));
1832 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1837 call_expr_arg_iterator iter1, iter2;
1838 if (!cp_tree_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2)))
1840 for (arg1 = first_call_expr_arg (t1, &iter1),
1841 arg2 = first_call_expr_arg (t2, &iter2);
1843 arg1 = next_call_expr_arg (&iter1),
1844 arg2 = next_call_expr_arg (&iter2))
1845 if (!cp_tree_equal (arg1, arg2))
1847 return (arg1 || arg2);
1852 tree o1 = TREE_OPERAND (t1, 0);
1853 tree o2 = TREE_OPERAND (t2, 0);
1855 /* Special case: if either target is an unallocated VAR_DECL,
1856 it means that it's going to be unified with whatever the
1857 TARGET_EXPR is really supposed to initialize, so treat it
1858 as being equivalent to anything. */
1859 if (TREE_CODE (o1) == VAR_DECL && DECL_NAME (o1) == NULL_TREE
1860 && !DECL_RTL_SET_P (o1))
1862 else if (TREE_CODE (o2) == VAR_DECL && DECL_NAME (o2) == NULL_TREE
1863 && !DECL_RTL_SET_P (o2))
1865 else if (!cp_tree_equal (o1, o2))
1868 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1871 case WITH_CLEANUP_EXPR:
1872 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1874 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
1877 if (TREE_OPERAND (t1, 1) != TREE_OPERAND (t2, 1))
1879 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1882 /* For comparing uses of parameters in late-specified return types
1883 with an out-of-class definition of the function. */
1884 if (same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
1885 && parm_index (t1) == parm_index (t2))
1894 case IDENTIFIER_NODE:
1899 return (BASELINK_BINFO (t1) == BASELINK_BINFO (t2)
1900 && BASELINK_ACCESS_BINFO (t1) == BASELINK_ACCESS_BINFO (t2)
1901 && cp_tree_equal (BASELINK_FUNCTIONS (t1),
1902 BASELINK_FUNCTIONS (t2)));
1904 case TEMPLATE_PARM_INDEX:
1905 return (TEMPLATE_PARM_IDX (t1) == TEMPLATE_PARM_IDX (t2)
1906 && TEMPLATE_PARM_LEVEL (t1) == TEMPLATE_PARM_LEVEL (t2)
1907 && same_type_p (TREE_TYPE (TEMPLATE_PARM_DECL (t1)),
1908 TREE_TYPE (TEMPLATE_PARM_DECL (t2))));
1910 case TEMPLATE_ID_EXPR:
1915 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1917 vec1 = TREE_OPERAND (t1, 1);
1918 vec2 = TREE_OPERAND (t2, 1);
1921 return !vec1 && !vec2;
1923 if (TREE_VEC_LENGTH (vec1) != TREE_VEC_LENGTH (vec2))
1926 for (ix = TREE_VEC_LENGTH (vec1); ix--;)
1927 if (!cp_tree_equal (TREE_VEC_ELT (vec1, ix),
1928 TREE_VEC_ELT (vec2, ix)))
1937 tree o1 = TREE_OPERAND (t1, 0);
1938 tree o2 = TREE_OPERAND (t2, 0);
1940 if (TREE_CODE (o1) != TREE_CODE (o2))
1943 return same_type_p (o1, o2);
1945 return cp_tree_equal (o1, o2);
1950 tree t1_op1, t2_op1;
1952 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1955 t1_op1 = TREE_OPERAND (t1, 1);
1956 t2_op1 = TREE_OPERAND (t2, 1);
1957 if (TREE_CODE (t1_op1) != TREE_CODE (t2_op1))
1960 return cp_tree_equal (TREE_OPERAND (t1, 2), TREE_OPERAND (t2, 2));
1964 /* Two pointer-to-members are the same if they point to the same
1965 field or function in the same class. */
1966 if (PTRMEM_CST_MEMBER (t1) != PTRMEM_CST_MEMBER (t2))
1969 return same_type_p (PTRMEM_CST_CLASS (t1), PTRMEM_CST_CLASS (t2));
1972 if (OVL_FUNCTION (t1) != OVL_FUNCTION (t2))
1974 return cp_tree_equal (OVL_CHAIN (t1), OVL_CHAIN (t2));
1977 if (TRAIT_EXPR_KIND (t1) != TRAIT_EXPR_KIND (t2))
1979 return same_type_p (TRAIT_EXPR_TYPE1 (t1), TRAIT_EXPR_TYPE1 (t2))
1980 && same_type_p (TRAIT_EXPR_TYPE2 (t1), TRAIT_EXPR_TYPE2 (t2));
1986 switch (TREE_CODE_CLASS (code1))
1990 case tcc_comparison:
1991 case tcc_expression:
1998 n = TREE_OPERAND_LENGTH (t1);
1999 if (TREE_CODE_CLASS (code1) == tcc_vl_exp
2000 && n != TREE_OPERAND_LENGTH (t2))
2003 for (i = 0; i < n; ++i)
2004 if (!cp_tree_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i)))
2011 return same_type_p (t1, t2);
2015 /* We can get here with --disable-checking. */
2019 /* The type of ARG when used as an lvalue. */
2022 lvalue_type (tree arg)
2024 tree type = TREE_TYPE (arg);
2028 /* The type of ARG for printing error messages; denote lvalues with
2032 error_type (tree arg)
2034 tree type = TREE_TYPE (arg);
2036 if (TREE_CODE (type) == ARRAY_TYPE)
2038 else if (TREE_CODE (type) == ERROR_MARK)
2040 else if (real_lvalue_p (arg))
2041 type = build_reference_type (lvalue_type (arg));
2042 else if (MAYBE_CLASS_TYPE_P (type))
2043 type = lvalue_type (arg);
2048 /* Does FUNCTION use a variable-length argument list? */
2051 varargs_function_p (const_tree function)
2053 const_tree parm = TYPE_ARG_TYPES (TREE_TYPE (function));
2054 for (; parm; parm = TREE_CHAIN (parm))
2055 if (TREE_VALUE (parm) == void_type_node)
2060 /* Returns 1 if decl is a member of a class. */
2063 member_p (const_tree decl)
2065 const_tree const ctx = DECL_CONTEXT (decl);
2066 return (ctx && TYPE_P (ctx));
2069 /* Create a placeholder for member access where we don't actually have an
2070 object that the access is against. */
2073 build_dummy_object (tree type)
2075 tree decl = build1 (NOP_EXPR, build_pointer_type (type), void_zero_node);
2076 return cp_build_indirect_ref (decl, NULL, tf_warning_or_error);
2079 /* We've gotten a reference to a member of TYPE. Return *this if appropriate,
2080 or a dummy object otherwise. If BINFOP is non-0, it is filled with the
2081 binfo path from current_class_type to TYPE, or 0. */
2084 maybe_dummy_object (tree type, tree* binfop)
2089 if (current_class_type
2090 && (binfo = lookup_base (current_class_type, type,
2091 ba_unique | ba_quiet, NULL)))
2092 context = current_class_type;
2095 /* Reference from a nested class member function. */
2097 binfo = TYPE_BINFO (type);
2103 if (current_class_ref && context == current_class_type
2104 /* Kludge: Make sure that current_class_type is actually
2105 correct. It might not be if we're in the middle of
2106 tsubst_default_argument. */
2107 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref)),
2108 current_class_type))
2109 decl = current_class_ref;
2111 decl = build_dummy_object (context);
2116 /* Returns 1 if OB is a placeholder object, or a pointer to one. */
2119 is_dummy_object (const_tree ob)
2121 if (TREE_CODE (ob) == INDIRECT_REF)
2122 ob = TREE_OPERAND (ob, 0);
2123 return (TREE_CODE (ob) == NOP_EXPR
2124 && TREE_OPERAND (ob, 0) == void_zero_node);
2127 /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */
2130 pod_type_p (const_tree t)
2132 /* This CONST_CAST is okay because strip_array_types returns its
2133 argument unmodified and we assign it to a const_tree. */
2134 t = strip_array_types (CONST_CAST_TREE(t));
2136 if (t == error_mark_node)
2138 if (INTEGRAL_TYPE_P (t))
2139 return 1; /* integral, character or enumeral type */
2140 if (FLOAT_TYPE_P (t))
2143 return 1; /* pointer to non-member */
2144 if (TYPE_PTR_TO_MEMBER_P (t))
2145 return 1; /* pointer to member */
2147 if (TREE_CODE (t) == VECTOR_TYPE)
2148 return 1; /* vectors are (small) arrays of scalars */
2150 if (! RECORD_OR_UNION_CODE_P (TREE_CODE (t)))
2151 return 0; /* other non-class type (reference or function) */
2152 if (! CLASS_TYPE_P (t))
2153 return 1; /* struct created by the back end */
2154 if (CLASSTYPE_NON_POD_P (t))
2159 /* Nonzero iff type T is a class template implicit specialization. */
2162 class_tmpl_impl_spec_p (const_tree t)
2164 return CLASS_TYPE_P (t) && CLASSTYPE_TEMPLATE_INSTANTIATION (t);
2167 /* Returns 1 iff zero initialization of type T means actually storing
2171 zero_init_p (const_tree t)
2173 /* This CONST_CAST is okay because strip_array_types returns its
2174 argument unmodified and we assign it to a const_tree. */
2175 t = strip_array_types (CONST_CAST_TREE(t));
2177 if (t == error_mark_node)
2180 /* NULL pointers to data members are initialized with -1. */
2181 if (TYPE_PTRMEM_P (t))
2184 /* Classes that contain types that can't be zero-initialized, cannot
2185 be zero-initialized themselves. */
2186 if (CLASS_TYPE_P (t) && CLASSTYPE_NON_ZERO_INIT_P (t))
2192 /* Table of valid C++ attributes. */
2193 const struct attribute_spec cxx_attribute_table[] =
2195 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
2196 { "java_interface", 0, 0, false, false, false, handle_java_interface_attribute },
2197 { "com_interface", 0, 0, false, false, false, handle_com_interface_attribute },
2198 { "init_priority", 1, 1, true, false, false, handle_init_priority_attribute },
2199 { NULL, 0, 0, false, false, false, NULL }
2202 /* Handle a "java_interface" attribute; arguments as in
2203 struct attribute_spec.handler. */
2205 handle_java_interface_attribute (tree* node,
2207 tree args ATTRIBUTE_UNUSED ,
2212 || !CLASS_TYPE_P (*node)
2213 || !TYPE_FOR_JAVA (*node))
2215 error ("%qE attribute can only be applied to Java class definitions",
2217 *no_add_attrs = true;
2220 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
2221 *node = build_variant_type_copy (*node);
2222 TYPE_JAVA_INTERFACE (*node) = 1;
2227 /* Handle a "com_interface" attribute; arguments as in
2228 struct attribute_spec.handler. */
2230 handle_com_interface_attribute (tree* node,
2232 tree args ATTRIBUTE_UNUSED ,
2233 int flags ATTRIBUTE_UNUSED ,
2238 *no_add_attrs = true;
2241 || !CLASS_TYPE_P (*node)
2242 || *node != TYPE_MAIN_VARIANT (*node))
2244 warning (OPT_Wattributes, "%qE attribute can only be applied "
2245 "to class definitions", name);
2250 warning (0, "%qE is obsolete; g++ vtables are now COM-compatible by default",
2256 /* Handle an "init_priority" attribute; arguments as in
2257 struct attribute_spec.handler. */
2259 handle_init_priority_attribute (tree* node,
2262 int flags ATTRIBUTE_UNUSED ,
2265 tree initp_expr = TREE_VALUE (args);
2267 tree type = TREE_TYPE (decl);
2270 STRIP_NOPS (initp_expr);
2272 if (!initp_expr || TREE_CODE (initp_expr) != INTEGER_CST)
2274 error ("requested init_priority is not an integer constant");
2275 *no_add_attrs = true;
2279 pri = TREE_INT_CST_LOW (initp_expr);
2281 type = strip_array_types (type);
2283 if (decl == NULL_TREE
2284 || TREE_CODE (decl) != VAR_DECL
2285 || !TREE_STATIC (decl)
2286 || DECL_EXTERNAL (decl)
2287 || (TREE_CODE (type) != RECORD_TYPE
2288 && TREE_CODE (type) != UNION_TYPE)
2289 /* Static objects in functions are initialized the
2290 first time control passes through that
2291 function. This is not precise enough to pin down an
2292 init_priority value, so don't allow it. */
2293 || current_function_decl)
2295 error ("can only use %qE attribute on file-scope definitions "
2296 "of objects of class type", name);
2297 *no_add_attrs = true;
2301 if (pri > MAX_INIT_PRIORITY || pri <= 0)
2303 error ("requested init_priority is out of range");
2304 *no_add_attrs = true;
2308 /* Check for init_priorities that are reserved for
2309 language and runtime support implementations.*/
2310 if (pri <= MAX_RESERVED_INIT_PRIORITY)
2313 (0, "requested init_priority is reserved for internal use");
2316 if (SUPPORTS_INIT_PRIORITY)
2318 SET_DECL_INIT_PRIORITY (decl, pri);
2319 DECL_HAS_INIT_PRIORITY_P (decl) = 1;
2324 error ("%qE attribute is not supported on this platform", name);
2325 *no_add_attrs = true;
2330 /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the
2331 thing pointed to by the constant. */
2334 make_ptrmem_cst (tree type, tree member)
2336 tree ptrmem_cst = make_node (PTRMEM_CST);
2337 TREE_TYPE (ptrmem_cst) = type;
2338 PTRMEM_CST_MEMBER (ptrmem_cst) = member;
2342 /* Build a variant of TYPE that has the indicated ATTRIBUTES. May
2343 return an existing type if an appropriate type already exists. */
2346 cp_build_type_attribute_variant (tree type, tree attributes)
2350 new_type = build_type_attribute_variant (type, attributes);
2351 if (TREE_CODE (new_type) == FUNCTION_TYPE
2352 && (TYPE_RAISES_EXCEPTIONS (new_type)
2353 != TYPE_RAISES_EXCEPTIONS (type)))
2354 new_type = build_exception_variant (new_type,
2355 TYPE_RAISES_EXCEPTIONS (type));
2357 /* Making a new main variant of a class type is broken. */
2358 gcc_assert (!CLASS_TYPE_P (type) || new_type == type);
2363 /* Return TRUE if TYPE1 and TYPE2 are identical for type hashing purposes.
2364 Called only after doing all language independent checks. Only
2365 to check TYPE_RAISES_EXCEPTIONS for FUNCTION_TYPE, the rest is already
2366 compared in type_hash_eq. */
2369 cxx_type_hash_eq (const_tree typea, const_tree typeb)
2371 gcc_assert (TREE_CODE (typea) == FUNCTION_TYPE);
2373 return comp_except_specs (TYPE_RAISES_EXCEPTIONS (typea),
2374 TYPE_RAISES_EXCEPTIONS (typeb), 1);
2377 /* Apply FUNC to all language-specific sub-trees of TP in a pre-order
2378 traversal. Called from walk_tree. */
2381 cp_walk_subtrees (tree *tp, int *walk_subtrees_p, walk_tree_fn func,
2382 void *data, struct pointer_set_t *pset)
2384 enum tree_code code = TREE_CODE (*tp);
2387 #define WALK_SUBTREE(NODE) \
2390 result = cp_walk_tree (&(NODE), func, data, pset); \
2391 if (result) goto out; \
2395 /* Not one of the easy cases. We must explicitly go through the
2401 case TEMPLATE_TEMPLATE_PARM:
2402 case BOUND_TEMPLATE_TEMPLATE_PARM:
2403 case UNBOUND_CLASS_TEMPLATE:
2404 case TEMPLATE_PARM_INDEX:
2405 case TEMPLATE_TYPE_PARM:
2408 /* None of these have subtrees other than those already walked
2410 *walk_subtrees_p = 0;
2414 WALK_SUBTREE (BASELINK_FUNCTIONS (*tp));
2415 *walk_subtrees_p = 0;
2419 WALK_SUBTREE (TREE_TYPE (*tp));
2420 *walk_subtrees_p = 0;
2424 WALK_SUBTREE (TREE_PURPOSE (*tp));
2428 WALK_SUBTREE (OVL_FUNCTION (*tp));
2429 WALK_SUBTREE (OVL_CHAIN (*tp));
2430 *walk_subtrees_p = 0;
2434 WALK_SUBTREE (DECL_NAME (*tp));
2435 WALK_SUBTREE (USING_DECL_SCOPE (*tp));
2436 WALK_SUBTREE (USING_DECL_DECLS (*tp));
2437 *walk_subtrees_p = 0;
2441 if (TYPE_PTRMEMFUNC_P (*tp))
2442 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (*tp));
2445 case TYPE_ARGUMENT_PACK:
2446 case NONTYPE_ARGUMENT_PACK:
2448 tree args = ARGUMENT_PACK_ARGS (*tp);
2449 int i, len = TREE_VEC_LENGTH (args);
2450 for (i = 0; i < len; i++)
2451 WALK_SUBTREE (TREE_VEC_ELT (args, i));
2455 case TYPE_PACK_EXPANSION:
2456 WALK_SUBTREE (TREE_TYPE (*tp));
2457 *walk_subtrees_p = 0;
2460 case EXPR_PACK_EXPANSION:
2461 WALK_SUBTREE (TREE_OPERAND (*tp, 0));
2462 *walk_subtrees_p = 0;
2466 case REINTERPRET_CAST_EXPR:
2467 case STATIC_CAST_EXPR:
2468 case CONST_CAST_EXPR:
2469 case DYNAMIC_CAST_EXPR:
2470 if (TREE_TYPE (*tp))
2471 WALK_SUBTREE (TREE_TYPE (*tp));
2475 for (i = 0; i < TREE_CODE_LENGTH (TREE_CODE (*tp)); ++i)
2476 WALK_SUBTREE (TREE_OPERAND (*tp, i));
2478 *walk_subtrees_p = 0;
2482 WALK_SUBTREE (TRAIT_EXPR_TYPE1 (*tp));
2483 WALK_SUBTREE (TRAIT_EXPR_TYPE2 (*tp));
2484 *walk_subtrees_p = 0;
2488 WALK_SUBTREE (DECLTYPE_TYPE_EXPR (*tp));
2489 *walk_subtrees_p = 0;
2497 /* We didn't find what we were looking for. */
2504 /* Like save_expr, but for C++. */
2507 cp_save_expr (tree expr)
2509 /* There is no reason to create a SAVE_EXPR within a template; if
2510 needed, we can create the SAVE_EXPR when instantiating the
2511 template. Furthermore, the middle-end cannot handle C++-specific
2513 if (processing_template_decl)
2515 return save_expr (expr);
2518 /* Initialize tree.c. */
2523 list_hash_table = htab_create_ggc (31, list_hash, list_hash_eq, NULL);
2526 /* Returns the kind of special function that DECL (a FUNCTION_DECL)
2527 is. Note that sfk_none is zero, so this function can be used as a
2528 predicate to test whether or not DECL is a special function. */
2530 special_function_kind
2531 special_function_p (const_tree decl)
2533 /* Rather than doing all this stuff with magic names, we should
2534 probably have a field of type `special_function_kind' in
2535 DECL_LANG_SPECIFIC. */
2536 if (DECL_COPY_CONSTRUCTOR_P (decl))
2537 return sfk_copy_constructor;
2538 if (DECL_CONSTRUCTOR_P (decl))
2539 return sfk_constructor;
2540 if (DECL_OVERLOADED_OPERATOR_P (decl) == NOP_EXPR)
2541 return sfk_assignment_operator;
2542 if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl))
2543 return sfk_destructor;
2544 if (DECL_COMPLETE_DESTRUCTOR_P (decl))
2545 return sfk_complete_destructor;
2546 if (DECL_BASE_DESTRUCTOR_P (decl))
2547 return sfk_base_destructor;
2548 if (DECL_DELETING_DESTRUCTOR_P (decl))
2549 return sfk_deleting_destructor;
2550 if (DECL_CONV_FN_P (decl))
2551 return sfk_conversion;
2556 /* Returns nonzero if TYPE is a character type, including wchar_t. */
2559 char_type_p (tree type)
2561 return (same_type_p (type, char_type_node)
2562 || same_type_p (type, unsigned_char_type_node)
2563 || same_type_p (type, signed_char_type_node)
2564 || same_type_p (type, char16_type_node)
2565 || same_type_p (type, char32_type_node)
2566 || same_type_p (type, wchar_type_node));
2569 /* Returns the kind of linkage associated with the indicated DECL. Th
2570 value returned is as specified by the language standard; it is
2571 independent of implementation details regarding template
2572 instantiation, etc. For example, it is possible that a declaration
2573 to which this function assigns external linkage would not show up
2574 as a global symbol when you run `nm' on the resulting object file. */
2577 decl_linkage (tree decl)
2579 /* This function doesn't attempt to calculate the linkage from first
2580 principles as given in [basic.link]. Instead, it makes use of
2581 the fact that we have already set TREE_PUBLIC appropriately, and
2582 then handles a few special cases. Ideally, we would calculate
2583 linkage first, and then transform that into a concrete
2586 /* Things that don't have names have no linkage. */
2587 if (!DECL_NAME (decl))
2590 /* Fields have no linkage. */
2591 if (TREE_CODE (decl) == FIELD_DECL)
2594 /* Things that are TREE_PUBLIC have external linkage. */
2595 if (TREE_PUBLIC (decl))
2598 if (TREE_CODE (decl) == NAMESPACE_DECL)
2601 /* Linkage of a CONST_DECL depends on the linkage of the enumeration
2603 if (TREE_CODE (decl) == CONST_DECL)
2604 return decl_linkage (TYPE_NAME (TREE_TYPE (decl)));
2606 /* Some things that are not TREE_PUBLIC have external linkage, too.
2607 For example, on targets that don't have weak symbols, we make all
2608 template instantiations have internal linkage (in the object
2609 file), but the symbols should still be treated as having external
2610 linkage from the point of view of the language. */
2611 if (TREE_CODE (decl) != TYPE_DECL && DECL_LANG_SPECIFIC (decl)
2612 && DECL_COMDAT (decl))
2615 /* Things in local scope do not have linkage, if they don't have
2617 if (decl_function_context (decl))
2620 /* Members of the anonymous namespace also have TREE_PUBLIC unset, but
2621 are considered to have external linkage for language purposes. DECLs
2622 really meant to have internal linkage have DECL_THIS_STATIC set. */
2623 if (TREE_CODE (decl) == TYPE_DECL)
2625 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == FUNCTION_DECL)
2627 if (!DECL_THIS_STATIC (decl))
2630 /* Static data members and static member functions from classes
2631 in anonymous namespace also don't have TREE_PUBLIC set. */
2632 if (DECL_CLASS_CONTEXT (decl))
2636 /* Everything else has internal linkage. */
2640 /* EXP is an expression that we want to pre-evaluate. Returns (in
2641 *INITP) an expression that will perform the pre-evaluation. The
2642 value returned by this function is a side-effect free expression
2643 equivalent to the pre-evaluated expression. Callers must ensure
2644 that *INITP is evaluated before EXP. */
2647 stabilize_expr (tree exp, tree* initp)
2651 if (!TREE_SIDE_EFFECTS (exp))
2652 init_expr = NULL_TREE;
2653 else if (!real_lvalue_p (exp)
2654 || !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (exp)))
2656 init_expr = get_target_expr (exp);
2657 exp = TARGET_EXPR_SLOT (init_expr);
2661 exp = cp_build_unary_op (ADDR_EXPR, exp, 1, tf_warning_or_error);
2662 init_expr = get_target_expr (exp);
2663 exp = TARGET_EXPR_SLOT (init_expr);
2664 exp = cp_build_indirect_ref (exp, 0, tf_warning_or_error);
2668 gcc_assert (!TREE_SIDE_EFFECTS (exp));
2672 /* Add NEW_EXPR, an expression whose value we don't care about, after the
2673 similar expression ORIG. */
2676 add_stmt_to_compound (tree orig, tree new_expr)
2678 if (!new_expr || !TREE_SIDE_EFFECTS (new_expr))
2680 if (!orig || !TREE_SIDE_EFFECTS (orig))
2682 return build2 (COMPOUND_EXPR, void_type_node, orig, new_expr);
2685 /* Like stabilize_expr, but for a call whose arguments we want to
2686 pre-evaluate. CALL is modified in place to use the pre-evaluated
2687 arguments, while, upon return, *INITP contains an expression to
2688 compute the arguments. */
2691 stabilize_call (tree call, tree *initp)
2693 tree inits = NULL_TREE;
2695 int nargs = call_expr_nargs (call);
2697 if (call == error_mark_node || processing_template_decl)
2703 gcc_assert (TREE_CODE (call) == CALL_EXPR);
2705 for (i = 0; i < nargs; i++)
2708 CALL_EXPR_ARG (call, i) =
2709 stabilize_expr (CALL_EXPR_ARG (call, i), &init);
2710 inits = add_stmt_to_compound (inits, init);
2716 /* Like stabilize_expr, but for an AGGR_INIT_EXPR whose arguments we want
2717 to pre-evaluate. CALL is modified in place to use the pre-evaluated
2718 arguments, while, upon return, *INITP contains an expression to
2719 compute the arguments. */
2722 stabilize_aggr_init (tree call, tree *initp)
2724 tree inits = NULL_TREE;
2726 int nargs = aggr_init_expr_nargs (call);
2728 if (call == error_mark_node)
2731 gcc_assert (TREE_CODE (call) == AGGR_INIT_EXPR);
2733 for (i = 0; i < nargs; i++)
2736 AGGR_INIT_EXPR_ARG (call, i) =
2737 stabilize_expr (AGGR_INIT_EXPR_ARG (call, i), &init);
2738 inits = add_stmt_to_compound (inits, init);
2744 /* Like stabilize_expr, but for an initialization.
2746 If the initialization is for an object of class type, this function
2747 takes care not to introduce additional temporaries.
2749 Returns TRUE iff the expression was successfully pre-evaluated,
2750 i.e., if INIT is now side-effect free, except for, possible, a
2751 single call to a constructor. */
2754 stabilize_init (tree init, tree *initp)
2760 if (t == error_mark_node || processing_template_decl)
2763 if (TREE_CODE (t) == INIT_EXPR
2764 && TREE_CODE (TREE_OPERAND (t, 1)) != TARGET_EXPR
2765 && TREE_CODE (TREE_OPERAND (t, 1)) != AGGR_INIT_EXPR)
2767 TREE_OPERAND (t, 1) = stabilize_expr (TREE_OPERAND (t, 1), initp);
2771 if (TREE_CODE (t) == INIT_EXPR)
2772 t = TREE_OPERAND (t, 1);
2773 if (TREE_CODE (t) == TARGET_EXPR)
2774 t = TARGET_EXPR_INITIAL (t);
2775 if (TREE_CODE (t) == COMPOUND_EXPR)
2777 if (TREE_CODE (t) == CONSTRUCTOR
2778 && EMPTY_CONSTRUCTOR_P (t))
2779 /* Default-initialization. */
2782 /* If the initializer is a COND_EXPR, we can't preevaluate
2784 if (TREE_CODE (t) == COND_EXPR)
2787 if (TREE_CODE (t) == CALL_EXPR)
2789 stabilize_call (t, initp);
2793 if (TREE_CODE (t) == AGGR_INIT_EXPR)
2795 stabilize_aggr_init (t, initp);
2799 /* The initialization is being performed via a bitwise copy -- and
2800 the item copied may have side effects. */
2801 return TREE_SIDE_EFFECTS (init);
2804 /* Like "fold", but should be used whenever we might be processing the
2805 body of a template. */
2808 fold_if_not_in_template (tree expr)
2810 /* In the body of a template, there is never any need to call
2811 "fold". We will call fold later when actually instantiating the
2812 template. Integral constant expressions in templates will be
2813 evaluated via fold_non_dependent_expr, as necessary. */
2814 if (processing_template_decl)
2817 /* Fold C++ front-end specific tree codes. */
2818 if (TREE_CODE (expr) == UNARY_PLUS_EXPR)
2819 return fold_convert (TREE_TYPE (expr), TREE_OPERAND (expr, 0));
2824 /* Returns true if a cast to TYPE may appear in an integral constant
2828 cast_valid_in_integral_constant_expression_p (tree type)
2830 return (INTEGRAL_OR_ENUMERATION_TYPE_P (type)
2831 || dependent_type_p (type)
2832 || type == error_mark_node);
2836 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
2837 /* Complain that some language-specific thing hanging off a tree
2838 node has been accessed improperly. */
2841 lang_check_failed (const char* file, int line, const char* function)
2843 internal_error ("lang_* check: failed in %s, at %s:%d",
2844 function, trim_filename (file), line);
2846 #endif /* ENABLE_TREE_CHECKING */
2848 #include "gt-cp-tree.h"