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);
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. */
63 cp_lvalue_kind op1_lvalue_kind = clk_none;
64 cp_lvalue_kind op2_lvalue_kind = clk_none;
66 /* Expressions of reference type are sometimes wrapped in
67 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
68 representation, not part of the language, so we have to look
70 if (TREE_CODE (ref) == INDIRECT_REF
71 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref, 0)))
73 return lvalue_p_1 (TREE_OPERAND (ref, 0));
75 if (TREE_CODE (TREE_TYPE (ref)) == REFERENCE_TYPE)
77 /* unnamed rvalue references are rvalues */
78 if (TYPE_REF_IS_RVALUE (TREE_TYPE (ref))
79 && TREE_CODE (ref) != PARM_DECL
80 && TREE_CODE (ref) != VAR_DECL
81 && TREE_CODE (ref) != COMPONENT_REF)
84 /* lvalue references and named rvalue references are lvalues. */
88 if (ref == current_class_ptr)
91 switch (TREE_CODE (ref))
95 /* preincrements and predecrements are valid lvals, provided
96 what they refer to are valid lvals. */
97 case PREINCREMENT_EXPR:
98 case PREDECREMENT_EXPR:
100 case WITH_CLEANUP_EXPR:
103 return lvalue_p_1 (TREE_OPERAND (ref, 0));
106 op1_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 0));
107 /* Look at the member designator. */
108 if (!op1_lvalue_kind)
110 else if (is_overloaded_fn (TREE_OPERAND (ref, 1)))
111 /* The "field" can be a FUNCTION_DECL or an OVERLOAD in some
112 situations. If we're seeing a COMPONENT_REF, it's a non-static
113 member, so it isn't an lvalue. */
114 op1_lvalue_kind = clk_none;
115 else if (TREE_CODE (TREE_OPERAND (ref, 1)) != FIELD_DECL)
116 /* This can be IDENTIFIER_NODE in a template. */;
117 else if (DECL_C_BIT_FIELD (TREE_OPERAND (ref, 1)))
119 /* Clear the ordinary bit. If this object was a class
120 rvalue we want to preserve that information. */
121 op1_lvalue_kind &= ~clk_ordinary;
122 /* The lvalue is for a bitfield. */
123 op1_lvalue_kind |= clk_bitfield;
125 else if (DECL_PACKED (TREE_OPERAND (ref, 1)))
126 op1_lvalue_kind |= clk_packed;
128 return op1_lvalue_kind;
131 case COMPOUND_LITERAL_EXPR:
136 if (TREE_READONLY (ref) && ! TREE_STATIC (ref)
137 && DECL_LANG_SPECIFIC (ref)
138 && DECL_IN_AGGR_P (ref))
144 if (TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE)
148 /* A currently unresolved scope ref. */
153 /* Disallow <? and >? as lvalues if either argument side-effects. */
154 if (TREE_SIDE_EFFECTS (TREE_OPERAND (ref, 0))
155 || TREE_SIDE_EFFECTS (TREE_OPERAND (ref, 1)))
157 op1_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 0));
158 op2_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 1));
162 op1_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 1)
163 ? TREE_OPERAND (ref, 1)
164 : TREE_OPERAND (ref, 0));
165 op2_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 2));
172 return lvalue_p_1 (TREE_OPERAND (ref, 1));
178 return (CLASS_TYPE_P (TREE_TYPE (ref)) ? clk_class : clk_none);
181 /* Any class-valued call would be wrapped in a TARGET_EXPR. */
185 /* All functions (except non-static-member functions) are
187 return (DECL_NONSTATIC_MEMBER_FUNCTION_P (ref)
188 ? clk_none : clk_ordinary);
191 /* We now represent a reference to a single static member function
193 return lvalue_p_1 (BASELINK_FUNCTIONS (ref));
195 case NON_DEPENDENT_EXPR:
196 /* We must consider NON_DEPENDENT_EXPRs to be lvalues so that
197 things like "&E" where "E" is an expression with a
198 non-dependent type work. It is safe to be lenient because an
199 error will be issued when the template is instantiated if "E"
207 /* If one operand is not an lvalue at all, then this expression is
209 if (!op1_lvalue_kind || !op2_lvalue_kind)
212 /* Otherwise, it's an lvalue, and it has all the odd properties
213 contributed by either operand. */
214 op1_lvalue_kind = op1_lvalue_kind | op2_lvalue_kind;
215 /* It's not an ordinary lvalue if it involves either a bit-field or
217 if ((op1_lvalue_kind & ~clk_ordinary) != clk_none)
218 op1_lvalue_kind &= ~clk_ordinary;
219 return op1_lvalue_kind;
222 /* Returns the kind of lvalue that REF is, in the sense of
223 [basic.lval]. This function should really be named lvalue_p; it
224 computes the C++ definition of lvalue. */
227 real_lvalue_p (tree ref)
229 cp_lvalue_kind kind = lvalue_p_1 (ref);
230 if (kind & (clk_rvalueref|clk_class))
236 /* This differs from real_lvalue_p in that class rvalues are considered
242 return (lvalue_p_1 (ref) != clk_none);
245 /* This differs from real_lvalue_p in that rvalues formed by dereferencing
246 rvalue references are considered rvalues. */
249 lvalue_or_rvalue_with_address_p (tree ref)
251 cp_lvalue_kind kind = lvalue_p_1 (ref);
252 if (kind & clk_class)
255 return (kind != clk_none);
258 /* Test whether DECL is a builtin that may appear in a
259 constant-expression. */
262 builtin_valid_in_constant_expr_p (const_tree decl)
264 /* At present BUILT_IN_CONSTANT_P is the only builtin we're allowing
265 in constant-expressions. We may want to add other builtins later. */
266 return DECL_IS_BUILTIN_CONSTANT_P (decl);
269 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
272 build_target_expr (tree decl, tree value)
276 #ifdef ENABLE_CHECKING
277 gcc_assert (VOID_TYPE_P (TREE_TYPE (value))
278 || TREE_TYPE (decl) == TREE_TYPE (value)
279 || useless_type_conversion_p (TREE_TYPE (decl),
283 t = build4 (TARGET_EXPR, TREE_TYPE (decl), decl, value,
284 cxx_maybe_build_cleanup (decl), NULL_TREE);
285 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
286 ignore the TARGET_EXPR. If there really turn out to be no
287 side-effects, then the optimizer should be able to get rid of
288 whatever code is generated anyhow. */
289 TREE_SIDE_EFFECTS (t) = 1;
294 /* Return an undeclared local temporary of type TYPE for use in building a
298 build_local_temp (tree type)
300 tree slot = build_decl (VAR_DECL, NULL_TREE, type);
301 DECL_ARTIFICIAL (slot) = 1;
302 DECL_IGNORED_P (slot) = 1;
303 DECL_CONTEXT (slot) = current_function_decl;
304 layout_decl (slot, 0);
308 /* Set various status flags when building an AGGR_INIT_EXPR object T. */
311 process_aggr_init_operands (tree t)
315 side_effects = TREE_SIDE_EFFECTS (t);
319 n = TREE_OPERAND_LENGTH (t);
320 for (i = 1; i < n; i++)
322 tree op = TREE_OPERAND (t, i);
323 if (op && TREE_SIDE_EFFECTS (op))
330 TREE_SIDE_EFFECTS (t) = side_effects;
333 /* Build an AGGR_INIT_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE,
334 FN, and SLOT. NARGS is the number of call arguments which are specified
335 as a tree array ARGS. */
338 build_aggr_init_array (tree return_type, tree fn, tree slot, int nargs,
344 t = build_vl_exp (AGGR_INIT_EXPR, nargs + 3);
345 TREE_TYPE (t) = return_type;
346 AGGR_INIT_EXPR_FN (t) = fn;
347 AGGR_INIT_EXPR_SLOT (t) = slot;
348 for (i = 0; i < nargs; i++)
349 AGGR_INIT_EXPR_ARG (t, i) = args[i];
350 process_aggr_init_operands (t);
354 /* INIT is a CALL_EXPR or AGGR_INIT_EXPR which needs info about its
355 target. TYPE is the type to be initialized.
357 Build an AGGR_INIT_EXPR to represent the initialization. This function
358 differs from build_cplus_new in that an AGGR_INIT_EXPR can only be used
359 to initialize another object, whereas a TARGET_EXPR can either
360 initialize another object or create its own temporary object, and as a
361 result building up a TARGET_EXPR requires that the type's destructor be
365 build_aggr_init_expr (tree type, tree init)
372 /* Make sure that we're not trying to create an instance of an
374 abstract_virtuals_error (NULL_TREE, type);
376 if (TREE_CODE (init) == CALL_EXPR)
377 fn = CALL_EXPR_FN (init);
378 else if (TREE_CODE (init) == AGGR_INIT_EXPR)
379 fn = AGGR_INIT_EXPR_FN (init);
381 return convert (type, init);
383 is_ctor = (TREE_CODE (fn) == ADDR_EXPR
384 && TREE_CODE (TREE_OPERAND (fn, 0)) == FUNCTION_DECL
385 && DECL_CONSTRUCTOR_P (TREE_OPERAND (fn, 0)));
387 /* We split the CALL_EXPR into its function and its arguments here.
388 Then, in expand_expr, we put them back together. The reason for
389 this is that this expression might be a default argument
390 expression. In that case, we need a new temporary every time the
391 expression is used. That's what break_out_target_exprs does; it
392 replaces every AGGR_INIT_EXPR with a copy that uses a fresh
393 temporary slot. Then, expand_expr builds up a call-expression
394 using the new slot. */
396 /* If we don't need to use a constructor to create an object of this
397 type, don't mess with AGGR_INIT_EXPR. */
398 if (is_ctor || TREE_ADDRESSABLE (type))
400 slot = build_local_temp (type);
402 if (TREE_CODE(init) == CALL_EXPR)
403 rval = build_aggr_init_array (void_type_node, fn, slot,
404 call_expr_nargs (init),
405 CALL_EXPR_ARGP (init));
407 rval = build_aggr_init_array (void_type_node, fn, slot,
408 aggr_init_expr_nargs (init),
409 AGGR_INIT_EXPR_ARGP (init));
410 TREE_SIDE_EFFECTS (rval) = 1;
411 AGGR_INIT_VIA_CTOR_P (rval) = is_ctor;
419 /* INIT is a CALL_EXPR or AGGR_INIT_EXPR which needs info about its
420 target. TYPE is the type that this initialization should appear to
423 Build an encapsulation of the initialization to perform
424 and return it so that it can be processed by language-independent
425 and language-specific expression expanders. */
428 build_cplus_new (tree type, tree init)
430 tree rval = build_aggr_init_expr (type, init);
433 if (TREE_CODE (rval) == AGGR_INIT_EXPR)
434 slot = AGGR_INIT_EXPR_SLOT (rval);
435 else if (TREE_CODE (rval) == CALL_EXPR)
436 slot = build_local_temp (type);
440 rval = build_target_expr (slot, rval);
441 TARGET_EXPR_IMPLICIT_P (rval) = 1;
446 /* Build a TARGET_EXPR using INIT to initialize a new temporary of the
450 build_target_expr_with_type (tree init, tree type)
452 gcc_assert (!VOID_TYPE_P (type));
454 if (TREE_CODE (init) == TARGET_EXPR)
456 else if (CLASS_TYPE_P (type) && !TYPE_HAS_TRIVIAL_INIT_REF (type)
457 && !VOID_TYPE_P (TREE_TYPE (init))
458 && TREE_CODE (init) != COND_EXPR
459 && TREE_CODE (init) != CONSTRUCTOR
460 && TREE_CODE (init) != VA_ARG_EXPR)
461 /* We need to build up a copy constructor call. A void initializer
462 means we're being called from bot_manip. COND_EXPR is a special
463 case because we already have copies on the arms and we don't want
464 another one here. A CONSTRUCTOR is aggregate initialization, which
465 is handled separately. A VA_ARG_EXPR is magic creation of an
466 aggregate; there's no additional work to be done. */
467 return force_rvalue (init);
469 return force_target_expr (type, init);
472 /* Like the above function, but without the checking. This function should
473 only be used by code which is deliberately trying to subvert the type
474 system, such as call_builtin_trap. */
477 force_target_expr (tree type, tree init)
481 gcc_assert (!VOID_TYPE_P (type));
483 slot = build_local_temp (type);
484 return build_target_expr (slot, init);
487 /* Like build_target_expr_with_type, but use the type of INIT. */
490 get_target_expr (tree init)
492 if (TREE_CODE (init) == AGGR_INIT_EXPR)
493 return build_target_expr (AGGR_INIT_EXPR_SLOT (init), init);
495 return build_target_expr_with_type (init, TREE_TYPE (init));
498 /* If EXPR is a bitfield reference, convert it to the declared type of
499 the bitfield, and return the resulting expression. Otherwise,
500 return EXPR itself. */
503 convert_bitfield_to_declared_type (tree expr)
507 bitfield_type = is_bitfield_expr_with_lowered_type (expr);
509 expr = convert_to_integer (TYPE_MAIN_VARIANT (bitfield_type),
514 /* EXPR is being used in an rvalue context. Return a version of EXPR
515 that is marked as an rvalue. */
522 if (error_operand_p (expr))
527 Non-class rvalues always have cv-unqualified types. */
528 type = TREE_TYPE (expr);
529 if (!CLASS_TYPE_P (type) && cp_type_quals (type))
530 type = TYPE_MAIN_VARIANT (type);
532 /* We need to do this for rvalue refs as well to get the right answer
533 from decltype; see c++/36628. */
534 if (!processing_template_decl && lvalue_or_rvalue_with_address_p (expr))
535 expr = build1 (NON_LVALUE_EXPR, type, expr);
536 else if (type != TREE_TYPE (expr))
537 expr = build_nop (type, expr);
543 /* Hash an ARRAY_TYPE. K is really of type `tree'. */
546 cplus_array_hash (const void* k)
549 const_tree const t = (const_tree) k;
551 hash = TYPE_UID (TREE_TYPE (t));
553 hash ^= TYPE_UID (TYPE_DOMAIN (t));
557 typedef struct cplus_array_info {
562 /* Compare two ARRAY_TYPEs. K1 is really of type `tree', K2 is really
563 of type `cplus_array_info*'. */
566 cplus_array_compare (const void * k1, const void * k2)
568 const_tree const t1 = (const_tree) k1;
569 const cplus_array_info *const t2 = (const cplus_array_info*) k2;
571 return (TREE_TYPE (t1) == t2->type && TYPE_DOMAIN (t1) == t2->domain);
574 /* Hash table containing all of the C++ array types, including
575 dependent array types and array types whose element type is
577 static GTY ((param_is (union tree_node))) htab_t cplus_array_htab;
581 build_cplus_array_type_1 (tree elt_type, tree index_type)
585 if (elt_type == error_mark_node || index_type == error_mark_node)
586 return error_mark_node;
588 if (processing_template_decl
589 && (dependent_type_p (elt_type)
590 || (index_type && !TREE_CONSTANT (TYPE_MAX_VALUE (index_type)))))
593 cplus_array_info cai;
596 if (cplus_array_htab == NULL)
597 cplus_array_htab = htab_create_ggc (61, &cplus_array_hash,
598 &cplus_array_compare, NULL);
600 hash = TYPE_UID (elt_type);
602 hash ^= TYPE_UID (index_type);
604 cai.domain = index_type;
606 e = htab_find_slot_with_hash (cplus_array_htab, &cai, hash, INSERT);
608 /* We have found the type: we're done. */
612 /* Build a new array type. */
613 t = make_node (ARRAY_TYPE);
614 TREE_TYPE (t) = elt_type;
615 TYPE_DOMAIN (t) = index_type;
617 /* Store it in the hash table. */
620 /* Set the canonical type for this new node. */
621 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
622 || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type)))
623 SET_TYPE_STRUCTURAL_EQUALITY (t);
624 else if (TYPE_CANONICAL (elt_type) != elt_type
626 && TYPE_CANONICAL (index_type) != index_type))
628 = build_cplus_array_type
629 (TYPE_CANONICAL (elt_type),
630 index_type ? TYPE_CANONICAL (index_type) : index_type);
632 TYPE_CANONICAL (t) = t;
636 t = build_array_type (elt_type, index_type);
638 /* Push these needs up so that initialization takes place
640 TYPE_NEEDS_CONSTRUCTING (t)
641 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (elt_type));
642 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
643 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (elt_type));
648 build_cplus_array_type (tree elt_type, tree index_type)
651 int type_quals = cp_type_quals (elt_type);
653 if (type_quals != TYPE_UNQUALIFIED)
654 elt_type = cp_build_qualified_type (elt_type, TYPE_UNQUALIFIED);
656 t = build_cplus_array_type_1 (elt_type, index_type);
658 if (type_quals != TYPE_UNQUALIFIED)
659 t = cp_build_qualified_type (t, type_quals);
664 /* Return an ARRAY_TYPE with element type ELT and length N. */
667 build_array_of_n_type (tree elt, int n)
669 return build_cplus_array_type (elt, build_index_type (size_int (n - 1)));
672 /* Return a reference type node referring to TO_TYPE. If RVAL is
673 true, return an rvalue reference type, otherwise return an lvalue
674 reference type. If a type node exists, reuse it, otherwise create
677 cp_build_reference_type (tree to_type, bool rval)
680 lvalue_ref = build_reference_type (to_type);
684 /* This code to create rvalue reference types is based on and tied
685 to the code creating lvalue reference types in the middle-end
686 functions build_reference_type_for_mode and build_reference_type.
688 It works by putting the rvalue reference type nodes after the
689 lvalue reference nodes in the TYPE_NEXT_REF_TO linked list, so
690 they will effectively be ignored by the middle end. */
692 for (t = lvalue_ref; (t = TYPE_NEXT_REF_TO (t)); )
693 if (TYPE_REF_IS_RVALUE (t))
696 t = copy_node (lvalue_ref);
698 TYPE_REF_IS_RVALUE (t) = true;
699 TYPE_NEXT_REF_TO (t) = TYPE_NEXT_REF_TO (lvalue_ref);
700 TYPE_NEXT_REF_TO (lvalue_ref) = t;
701 TYPE_MAIN_VARIANT (t) = t;
703 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
704 SET_TYPE_STRUCTURAL_EQUALITY (t);
705 else if (TYPE_CANONICAL (to_type) != to_type)
707 = cp_build_reference_type (TYPE_CANONICAL (to_type), rval);
709 TYPE_CANONICAL (t) = t;
717 /* Used by the C++ front end to build qualified array types. However,
718 the C version of this function does not properly maintain canonical
719 types (which are not used in C). */
721 c_build_qualified_type (tree type, int type_quals)
723 return cp_build_qualified_type (type, type_quals);
727 /* Make a variant of TYPE, qualified with the TYPE_QUALS. Handles
728 arrays correctly. In particular, if TYPE is an array of T's, and
729 TYPE_QUALS is non-empty, returns an array of qualified T's.
731 FLAGS determines how to deal with ill-formed qualifications. If
732 tf_ignore_bad_quals is set, then bad qualifications are dropped
733 (this is permitted if TYPE was introduced via a typedef or template
734 type parameter). If bad qualifications are dropped and tf_warning
735 is set, then a warning is issued for non-const qualifications. If
736 tf_ignore_bad_quals is not set and tf_error is not set, we
737 return error_mark_node. Otherwise, we issue an error, and ignore
740 Qualification of a reference type is valid when the reference came
741 via a typedef or template type argument. [dcl.ref] No such
742 dispensation is provided for qualifying a function type. [dcl.fct]
743 DR 295 queries this and the proposed resolution brings it into line
744 with qualifying a reference. We implement the DR. We also behave
745 in a similar manner for restricting non-pointer types. */
748 cp_build_qualified_type_real (tree type,
750 tsubst_flags_t complain)
753 int bad_quals = TYPE_UNQUALIFIED;
755 if (type == error_mark_node)
758 if (type_quals == cp_type_quals (type))
761 if (TREE_CODE (type) == ARRAY_TYPE)
763 /* In C++, the qualification really applies to the array element
764 type. Obtain the appropriately qualified element type. */
767 = cp_build_qualified_type_real (TREE_TYPE (type),
771 if (element_type == error_mark_node)
772 return error_mark_node;
774 /* See if we already have an identically qualified type. */
775 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
776 if (cp_type_quals (t) == type_quals
777 && TYPE_NAME (t) == TYPE_NAME (type)
778 && TYPE_CONTEXT (t) == TYPE_CONTEXT (type))
783 t = build_cplus_array_type_1 (element_type, TYPE_DOMAIN (type));
785 if (TYPE_MAIN_VARIANT (t) != TYPE_MAIN_VARIANT (type))
787 /* Set the main variant of the newly-created ARRAY_TYPE
788 (with cv-qualified element type) to the main variant of
789 the unqualified ARRAY_TYPE we started with. */
790 tree last_variant = t;
791 tree m = TYPE_MAIN_VARIANT (type);
793 /* Find the last variant on the new ARRAY_TYPEs list of
794 variants, setting the main variant of each of the other
795 types to the main variant of our unqualified
797 while (TYPE_NEXT_VARIANT (last_variant))
799 TYPE_MAIN_VARIANT (last_variant) = m;
800 last_variant = TYPE_NEXT_VARIANT (last_variant);
803 /* Splice in the newly-created variants. */
804 TYPE_NEXT_VARIANT (last_variant) = TYPE_NEXT_VARIANT (m);
805 TYPE_NEXT_VARIANT (m) = t;
806 TYPE_MAIN_VARIANT (last_variant) = m;
810 /* Even if we already had this variant, we update
811 TYPE_NEEDS_CONSTRUCTING and TYPE_HAS_NONTRIVIAL_DESTRUCTOR in case
812 they changed since the variant was originally created.
814 This seems hokey; if there is some way to use a previous
815 variant *without* coming through here,
816 TYPE_NEEDS_CONSTRUCTING will never be updated. */
817 TYPE_NEEDS_CONSTRUCTING (t)
818 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (element_type));
819 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
820 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (element_type));
823 else if (TYPE_PTRMEMFUNC_P (type))
825 /* For a pointer-to-member type, we can't just return a
826 cv-qualified version of the RECORD_TYPE. If we do, we
827 haven't changed the field that contains the actual pointer to
828 a method, and so TYPE_PTRMEMFUNC_FN_TYPE will be wrong. */
831 t = TYPE_PTRMEMFUNC_FN_TYPE (type);
832 t = cp_build_qualified_type_real (t, type_quals, complain);
833 return build_ptrmemfunc_type (t);
835 else if (TREE_CODE (type) == TYPE_PACK_EXPANSION)
837 tree t = PACK_EXPANSION_PATTERN (type);
839 t = cp_build_qualified_type_real (t, type_quals, complain);
840 return make_pack_expansion (t);
843 /* A reference or method type shall not be cv-qualified.
844 [dcl.ref], [dcl.fct] */
845 if (type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE)
846 && (TREE_CODE (type) == REFERENCE_TYPE
847 || TREE_CODE (type) == METHOD_TYPE))
849 bad_quals |= type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
850 type_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
853 /* A restrict-qualified type must be a pointer (or reference)
854 to object or incomplete type. */
855 if ((type_quals & TYPE_QUAL_RESTRICT)
856 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
857 && TREE_CODE (type) != TYPENAME_TYPE
858 && !POINTER_TYPE_P (type))
860 bad_quals |= TYPE_QUAL_RESTRICT;
861 type_quals &= ~TYPE_QUAL_RESTRICT;
864 if (bad_quals == TYPE_UNQUALIFIED)
866 else if (!(complain & (tf_error | tf_ignore_bad_quals)))
867 return error_mark_node;
870 if (complain & tf_ignore_bad_quals)
871 /* We're not going to warn about constifying things that can't
873 bad_quals &= ~TYPE_QUAL_CONST;
876 tree bad_type = build_qualified_type (ptr_type_node, bad_quals);
878 if (!(complain & tf_ignore_bad_quals))
879 error ("%qV qualifiers cannot be applied to %qT",
884 /* Retrieve (or create) the appropriately qualified variant. */
885 result = build_qualified_type (type, type_quals);
887 /* If this was a pointer-to-method type, and we just made a copy,
888 then we need to unshare the record that holds the cached
889 pointer-to-member-function type, because these will be distinct
890 between the unqualified and qualified types. */
892 && TREE_CODE (type) == POINTER_TYPE
893 && TREE_CODE (TREE_TYPE (type)) == METHOD_TYPE
894 && TYPE_LANG_SPECIFIC (result) == TYPE_LANG_SPECIFIC (type))
895 TYPE_LANG_SPECIFIC (result) = NULL;
897 /* We may also have ended up building a new copy of the canonical
898 type of a pointer-to-method type, which could have the same
899 sharing problem described above. */
900 if (TYPE_CANONICAL (result) != TYPE_CANONICAL (type)
901 && TREE_CODE (type) == POINTER_TYPE
902 && TREE_CODE (TREE_TYPE (type)) == METHOD_TYPE
903 && (TYPE_LANG_SPECIFIC (TYPE_CANONICAL (result))
904 == TYPE_LANG_SPECIFIC (TYPE_CANONICAL (type))))
905 TYPE_LANG_SPECIFIC (TYPE_CANONICAL (result)) = NULL;
911 /* Returns the canonical version of TYPE. In other words, if TYPE is
912 a typedef, returns the underlying type. The cv-qualification of
913 the type returned matches the type input; they will always be
917 canonical_type_variant (tree t)
919 if (t == error_mark_node)
920 return error_mark_node;
922 return cp_build_qualified_type (TYPE_MAIN_VARIANT (t), cp_type_quals (t));
925 /* Makes a copy of BINFO and TYPE, which is to be inherited into a
926 graph dominated by T. If BINFO is NULL, TYPE is a dependent base,
927 and we do a shallow copy. If BINFO is non-NULL, we do a deep copy.
928 VIRT indicates whether TYPE is inherited virtually or not.
929 IGO_PREV points at the previous binfo of the inheritance graph
930 order chain. The newly copied binfo's TREE_CHAIN forms this
933 The CLASSTYPE_VBASECLASSES vector of T is constructed in the
934 correct order. That is in the order the bases themselves should be
937 The BINFO_INHERITANCE of a virtual base class points to the binfo
938 of the most derived type. ??? We could probably change this so that
939 BINFO_INHERITANCE becomes synonymous with BINFO_PRIMARY, and hence
940 remove a field. They currently can only differ for primary virtual
944 copy_binfo (tree binfo, tree type, tree t, tree *igo_prev, int virt)
950 /* See if we've already made this virtual base. */
951 new_binfo = binfo_for_vbase (type, t);
956 new_binfo = make_tree_binfo (binfo ? BINFO_N_BASE_BINFOS (binfo) : 0);
957 BINFO_TYPE (new_binfo) = type;
959 /* Chain it into the inheritance graph. */
960 TREE_CHAIN (*igo_prev) = new_binfo;
961 *igo_prev = new_binfo;
968 gcc_assert (!BINFO_DEPENDENT_BASE_P (binfo));
969 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), type));
971 BINFO_OFFSET (new_binfo) = BINFO_OFFSET (binfo);
972 BINFO_VIRTUALS (new_binfo) = BINFO_VIRTUALS (binfo);
974 /* We do not need to copy the accesses, as they are read only. */
975 BINFO_BASE_ACCESSES (new_binfo) = BINFO_BASE_ACCESSES (binfo);
977 /* Recursively copy base binfos of BINFO. */
978 for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++)
982 gcc_assert (!BINFO_DEPENDENT_BASE_P (base_binfo));
983 new_base_binfo = copy_binfo (base_binfo, BINFO_TYPE (base_binfo),
985 BINFO_VIRTUAL_P (base_binfo));
987 if (!BINFO_INHERITANCE_CHAIN (new_base_binfo))
988 BINFO_INHERITANCE_CHAIN (new_base_binfo) = new_binfo;
989 BINFO_BASE_APPEND (new_binfo, new_base_binfo);
993 BINFO_DEPENDENT_BASE_P (new_binfo) = 1;
997 /* Push it onto the list after any virtual bases it contains
998 will have been pushed. */
999 VEC_quick_push (tree, CLASSTYPE_VBASECLASSES (t), new_binfo);
1000 BINFO_VIRTUAL_P (new_binfo) = 1;
1001 BINFO_INHERITANCE_CHAIN (new_binfo) = TYPE_BINFO (t);
1007 /* Hashing of lists so that we don't make duplicates.
1008 The entry point is `list_hash_canon'. */
1010 /* Now here is the hash table. When recording a list, it is added
1011 to the slot whose index is the hash code mod the table size.
1012 Note that the hash table is used for several kinds of lists.
1013 While all these live in the same table, they are completely independent,
1014 and the hash code is computed differently for each of these. */
1016 static GTY ((param_is (union tree_node))) htab_t list_hash_table;
1025 /* Compare ENTRY (an entry in the hash table) with DATA (a list_proxy
1026 for a node we are thinking about adding). */
1029 list_hash_eq (const void* entry, const void* data)
1031 const_tree const t = (const_tree) entry;
1032 const struct list_proxy *const proxy = (const struct list_proxy *) data;
1034 return (TREE_VALUE (t) == proxy->value
1035 && TREE_PURPOSE (t) == proxy->purpose
1036 && TREE_CHAIN (t) == proxy->chain);
1039 /* Compute a hash code for a list (chain of TREE_LIST nodes
1040 with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the
1041 TREE_COMMON slots), by adding the hash codes of the individual entries. */
1044 list_hash_pieces (tree purpose, tree value, tree chain)
1046 hashval_t hashcode = 0;
1049 hashcode += TREE_HASH (chain);
1052 hashcode += TREE_HASH (value);
1056 hashcode += TREE_HASH (purpose);
1062 /* Hash an already existing TREE_LIST. */
1065 list_hash (const void* p)
1067 const_tree const t = (const_tree) p;
1068 return list_hash_pieces (TREE_PURPOSE (t),
1073 /* Given list components PURPOSE, VALUE, AND CHAIN, return the canonical
1074 object for an identical list if one already exists. Otherwise, build a
1075 new one, and record it as the canonical object. */
1078 hash_tree_cons (tree purpose, tree value, tree chain)
1082 struct list_proxy proxy;
1084 /* Hash the list node. */
1085 hashcode = list_hash_pieces (purpose, value, chain);
1086 /* Create a proxy for the TREE_LIST we would like to create. We
1087 don't actually create it so as to avoid creating garbage. */
1088 proxy.purpose = purpose;
1089 proxy.value = value;
1090 proxy.chain = chain;
1091 /* See if it is already in the table. */
1092 slot = htab_find_slot_with_hash (list_hash_table, &proxy, hashcode,
1094 /* If not, create a new node. */
1096 *slot = tree_cons (purpose, value, chain);
1097 return (tree) *slot;
1100 /* Constructor for hashed lists. */
1103 hash_tree_chain (tree value, tree chain)
1105 return hash_tree_cons (NULL_TREE, value, chain);
1109 debug_binfo (tree elem)
1114 fprintf (stderr, "type \"%s\", offset = " HOST_WIDE_INT_PRINT_DEC
1116 TYPE_NAME_STRING (BINFO_TYPE (elem)),
1117 TREE_INT_CST_LOW (BINFO_OFFSET (elem)));
1118 debug_tree (BINFO_TYPE (elem));
1119 if (BINFO_VTABLE (elem))
1120 fprintf (stderr, "vtable decl \"%s\"\n",
1121 IDENTIFIER_POINTER (DECL_NAME (get_vtbl_decl_for_binfo (elem))));
1123 fprintf (stderr, "no vtable decl yet\n");
1124 fprintf (stderr, "virtuals:\n");
1125 virtuals = BINFO_VIRTUALS (elem);
1130 tree fndecl = TREE_VALUE (virtuals);
1131 fprintf (stderr, "%s [%ld =? %ld]\n",
1132 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl)),
1133 (long) n, (long) TREE_INT_CST_LOW (DECL_VINDEX (fndecl)));
1135 virtuals = TREE_CHAIN (virtuals);
1139 /* Build a representation for the qualified name SCOPE::NAME. TYPE is
1140 the type of the result expression, if known, or NULL_TREE if the
1141 resulting expression is type-dependent. If TEMPLATE_P is true,
1142 NAME is known to be a template because the user explicitly used the
1143 "template" keyword after the "::".
1145 All SCOPE_REFs should be built by use of this function. */
1148 build_qualified_name (tree type, tree scope, tree name, bool template_p)
1151 if (type == error_mark_node
1152 || scope == error_mark_node
1153 || name == error_mark_node)
1154 return error_mark_node;
1155 t = build2 (SCOPE_REF, type, scope, name);
1156 QUALIFIED_NAME_IS_TEMPLATE (t) = template_p;
1160 /* Returns nonzero if X is an expression for a (possibly overloaded)
1161 function. If "f" is a function or function template, "f", "c->f",
1162 "c.f", "C::f", and "f<int>" will all be considered possibly
1163 overloaded functions. Returns 2 if the function is actually
1164 overloaded, i.e., if it is impossible to know the type of the
1165 function without performing overload resolution. */
1168 is_overloaded_fn (tree x)
1170 /* A baselink is also considered an overloaded function. */
1171 if (TREE_CODE (x) == OFFSET_REF
1172 || TREE_CODE (x) == COMPONENT_REF)
1173 x = TREE_OPERAND (x, 1);
1175 x = BASELINK_FUNCTIONS (x);
1176 if (TREE_CODE (x) == TEMPLATE_ID_EXPR)
1177 x = TREE_OPERAND (x, 0);
1178 if (DECL_FUNCTION_TEMPLATE_P (OVL_CURRENT (x))
1179 || (TREE_CODE (x) == OVERLOAD && OVL_CHAIN (x)))
1181 return (TREE_CODE (x) == FUNCTION_DECL
1182 || TREE_CODE (x) == OVERLOAD);
1185 /* Returns true iff X is an expression for an overloaded function
1186 whose type cannot be known without performing overload
1190 really_overloaded_fn (tree x)
1192 return is_overloaded_fn (x) == 2;
1196 get_first_fn (tree from)
1198 gcc_assert (is_overloaded_fn (from));
1199 /* A baselink is also considered an overloaded function. */
1200 if (TREE_CODE (from) == COMPONENT_REF)
1201 from = TREE_OPERAND (from, 1);
1202 if (BASELINK_P (from))
1203 from = BASELINK_FUNCTIONS (from);
1204 if (TREE_CODE (from) == TEMPLATE_ID_EXPR)
1205 from = TREE_OPERAND (from, 0);
1206 return OVL_CURRENT (from);
1209 /* Return a new OVL node, concatenating it with the old one. */
1212 ovl_cons (tree decl, tree chain)
1214 tree result = make_node (OVERLOAD);
1215 TREE_TYPE (result) = unknown_type_node;
1216 OVL_FUNCTION (result) = decl;
1217 TREE_CHAIN (result) = chain;
1222 /* Build a new overloaded function. If this is the first one,
1223 just return it; otherwise, ovl_cons the _DECLs */
1226 build_overload (tree decl, tree chain)
1228 if (! chain && TREE_CODE (decl) != TEMPLATE_DECL)
1230 if (chain && TREE_CODE (chain) != OVERLOAD)
1231 chain = ovl_cons (chain, NULL_TREE);
1232 return ovl_cons (decl, chain);
1236 #define PRINT_RING_SIZE 4
1239 cxx_printable_name (tree decl, int v)
1241 static unsigned int uid_ring[PRINT_RING_SIZE];
1242 static char *print_ring[PRINT_RING_SIZE];
1243 static int ring_counter;
1246 /* Only cache functions. */
1248 || TREE_CODE (decl) != FUNCTION_DECL
1249 || DECL_LANG_SPECIFIC (decl) == 0)
1250 return lang_decl_name (decl, v);
1252 /* See if this print name is lying around. */
1253 for (i = 0; i < PRINT_RING_SIZE; i++)
1254 if (uid_ring[i] == DECL_UID (decl))
1255 /* yes, so return it. */
1256 return print_ring[i];
1258 if (++ring_counter == PRINT_RING_SIZE)
1261 if (current_function_decl != NULL_TREE)
1263 if (uid_ring[ring_counter] == DECL_UID (current_function_decl))
1265 if (ring_counter == PRINT_RING_SIZE)
1267 gcc_assert (uid_ring[ring_counter] != DECL_UID (current_function_decl));
1270 if (print_ring[ring_counter])
1271 free (print_ring[ring_counter]);
1273 print_ring[ring_counter] = xstrdup (lang_decl_name (decl, v));
1274 uid_ring[ring_counter] = DECL_UID (decl);
1275 return print_ring[ring_counter];
1278 /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions
1279 listed in RAISES. */
1282 build_exception_variant (tree type, tree raises)
1284 tree v = TYPE_MAIN_VARIANT (type);
1285 int type_quals = TYPE_QUALS (type);
1287 for (; v; v = TYPE_NEXT_VARIANT (v))
1288 if (check_qualified_type (v, type, type_quals)
1289 && comp_except_specs (raises, TYPE_RAISES_EXCEPTIONS (v), 1))
1292 /* Need to build a new variant. */
1293 v = build_variant_type_copy (type);
1294 TYPE_RAISES_EXCEPTIONS (v) = raises;
1298 /* Given a TEMPLATE_TEMPLATE_PARM node T, create a new
1299 BOUND_TEMPLATE_TEMPLATE_PARM bound with NEWARGS as its template
1303 bind_template_template_parm (tree t, tree newargs)
1305 tree decl = TYPE_NAME (t);
1308 t2 = cxx_make_type (BOUND_TEMPLATE_TEMPLATE_PARM);
1309 decl = build_decl (TYPE_DECL, DECL_NAME (decl), NULL_TREE);
1311 /* These nodes have to be created to reflect new TYPE_DECL and template
1313 TEMPLATE_TYPE_PARM_INDEX (t2) = copy_node (TEMPLATE_TYPE_PARM_INDEX (t));
1314 TEMPLATE_PARM_DECL (TEMPLATE_TYPE_PARM_INDEX (t2)) = decl;
1315 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2)
1316 = tree_cons (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t),
1317 newargs, NULL_TREE);
1319 TREE_TYPE (decl) = t2;
1320 TYPE_NAME (t2) = decl;
1321 TYPE_STUB_DECL (t2) = decl;
1323 SET_TYPE_STRUCTURAL_EQUALITY (t2);
1328 /* Called from count_trees via walk_tree. */
1331 count_trees_r (tree *tp, int *walk_subtrees, void *data)
1341 /* Debugging function for measuring the rough complexity of a tree
1345 count_trees (tree t)
1348 cp_walk_tree_without_duplicates (&t, count_trees_r, &n_trees);
1352 /* Called from verify_stmt_tree via walk_tree. */
1355 verify_stmt_tree_r (tree* tp,
1356 int* walk_subtrees ATTRIBUTE_UNUSED ,
1360 htab_t *statements = (htab_t *) data;
1363 if (!STATEMENT_CODE_P (TREE_CODE (t)))
1366 /* If this statement is already present in the hash table, then
1367 there is a circularity in the statement tree. */
1368 gcc_assert (!htab_find (*statements, t));
1370 slot = htab_find_slot (*statements, t, INSERT);
1376 /* Debugging function to check that the statement T has not been
1377 corrupted. For now, this function simply checks that T contains no
1381 verify_stmt_tree (tree t)
1384 statements = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
1385 cp_walk_tree (&t, verify_stmt_tree_r, &statements, NULL);
1386 htab_delete (statements);
1389 /* Check if the type T depends on a type with no linkage and if so, return
1390 it. If RELAXED_P then do not consider a class type declared within
1391 a TREE_PUBLIC function to have no linkage. */
1394 no_linkage_check (tree t, bool relaxed_p)
1398 /* There's no point in checking linkage on template functions; we
1399 can't know their complete types. */
1400 if (processing_template_decl)
1403 switch (TREE_CODE (t))
1408 if (TYPE_PTRMEMFUNC_P (t))
1412 if (!CLASS_TYPE_P (t))
1416 if (TYPE_ANONYMOUS_P (t))
1418 fn = decl_function_context (TYPE_MAIN_DECL (t));
1419 if (fn && (!relaxed_p || !TREE_PUBLIC (fn)))
1425 case REFERENCE_TYPE:
1426 return no_linkage_check (TREE_TYPE (t), relaxed_p);
1430 r = no_linkage_check (TYPE_PTRMEM_POINTED_TO_TYPE (t),
1434 return no_linkage_check (TYPE_PTRMEM_CLASS_TYPE (t), relaxed_p);
1437 r = no_linkage_check (TYPE_METHOD_BASETYPE (t), relaxed_p);
1444 for (parm = TYPE_ARG_TYPES (t);
1445 parm && parm != void_list_node;
1446 parm = TREE_CHAIN (parm))
1448 r = no_linkage_check (TREE_VALUE (parm), relaxed_p);
1452 return no_linkage_check (TREE_TYPE (t), relaxed_p);
1460 #ifdef GATHER_STATISTICS
1461 extern int depth_reached;
1465 cxx_print_statistics (void)
1467 print_search_statistics ();
1468 print_class_statistics ();
1469 #ifdef GATHER_STATISTICS
1470 fprintf (stderr, "maximum template instantiation depth reached: %d\n",
1475 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1476 (which is an ARRAY_TYPE). This counts only elements of the top
1480 array_type_nelts_top (tree type)
1482 return fold_build2 (PLUS_EXPR, sizetype,
1483 array_type_nelts (type),
1487 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1488 (which is an ARRAY_TYPE). This one is a recursive count of all
1489 ARRAY_TYPEs that are clumped together. */
1492 array_type_nelts_total (tree type)
1494 tree sz = array_type_nelts_top (type);
1495 type = TREE_TYPE (type);
1496 while (TREE_CODE (type) == ARRAY_TYPE)
1498 tree n = array_type_nelts_top (type);
1499 sz = fold_build2 (MULT_EXPR, sizetype, sz, n);
1500 type = TREE_TYPE (type);
1505 /* Called from break_out_target_exprs via mapcar. */
1508 bot_manip (tree* tp, int* walk_subtrees, void* data)
1510 splay_tree target_remap = ((splay_tree) data);
1513 if (!TYPE_P (t) && TREE_CONSTANT (t))
1515 /* There can't be any TARGET_EXPRs or their slot variables below
1516 this point. We used to check !TREE_SIDE_EFFECTS, but then we
1517 failed to copy an ADDR_EXPR of the slot VAR_DECL. */
1521 if (TREE_CODE (t) == TARGET_EXPR)
1525 if (TREE_CODE (TREE_OPERAND (t, 1)) == AGGR_INIT_EXPR)
1526 u = build_cplus_new (TREE_TYPE (t), TREE_OPERAND (t, 1));
1528 u = build_target_expr_with_type (TREE_OPERAND (t, 1), TREE_TYPE (t));
1530 /* Map the old variable to the new one. */
1531 splay_tree_insert (target_remap,
1532 (splay_tree_key) TREE_OPERAND (t, 0),
1533 (splay_tree_value) TREE_OPERAND (u, 0));
1535 TREE_OPERAND (u, 1) = break_out_target_exprs (TREE_OPERAND (u, 1));
1537 /* Replace the old expression with the new version. */
1539 /* We don't have to go below this point; the recursive call to
1540 break_out_target_exprs will have handled anything below this
1546 /* Make a copy of this node. */
1547 return copy_tree_r (tp, walk_subtrees, NULL);
1550 /* Replace all remapped VAR_DECLs in T with their new equivalents.
1551 DATA is really a splay-tree mapping old variables to new
1555 bot_replace (tree* t,
1556 int* walk_subtrees ATTRIBUTE_UNUSED ,
1559 splay_tree target_remap = ((splay_tree) data);
1561 if (TREE_CODE (*t) == VAR_DECL)
1563 splay_tree_node n = splay_tree_lookup (target_remap,
1564 (splay_tree_key) *t);
1566 *t = (tree) n->value;
1572 /* When we parse a default argument expression, we may create
1573 temporary variables via TARGET_EXPRs. When we actually use the
1574 default-argument expression, we make a copy of the expression, but
1575 we must replace the temporaries with appropriate local versions. */
1578 break_out_target_exprs (tree t)
1580 static int target_remap_count;
1581 static splay_tree target_remap;
1583 if (!target_remap_count++)
1584 target_remap = splay_tree_new (splay_tree_compare_pointers,
1585 /*splay_tree_delete_key_fn=*/NULL,
1586 /*splay_tree_delete_value_fn=*/NULL);
1587 cp_walk_tree (&t, bot_manip, target_remap, NULL);
1588 cp_walk_tree (&t, bot_replace, target_remap, NULL);
1590 if (!--target_remap_count)
1592 splay_tree_delete (target_remap);
1593 target_remap = NULL;
1599 /* Similar to `build_nt', but for template definitions of dependent
1603 build_min_nt (enum tree_code code, ...)
1610 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
1614 t = make_node (code);
1615 length = TREE_CODE_LENGTH (code);
1617 for (i = 0; i < length; i++)
1619 tree x = va_arg (p, tree);
1620 TREE_OPERAND (t, i) = x;
1628 /* Similar to `build', but for template definitions. */
1631 build_min (enum tree_code code, tree tt, ...)
1638 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
1642 t = make_node (code);
1643 length = TREE_CODE_LENGTH (code);
1646 for (i = 0; i < length; i++)
1648 tree x = va_arg (p, tree);
1649 TREE_OPERAND (t, i) = x;
1650 if (x && !TYPE_P (x) && TREE_SIDE_EFFECTS (x))
1651 TREE_SIDE_EFFECTS (t) = 1;
1658 /* Similar to `build', but for template definitions of non-dependent
1659 expressions. NON_DEP is the non-dependent expression that has been
1663 build_min_non_dep (enum tree_code code, tree non_dep, ...)
1670 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
1672 va_start (p, non_dep);
1674 t = make_node (code);
1675 length = TREE_CODE_LENGTH (code);
1676 TREE_TYPE (t) = TREE_TYPE (non_dep);
1677 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (non_dep);
1679 for (i = 0; i < length; i++)
1681 tree x = va_arg (p, tree);
1682 TREE_OPERAND (t, i) = x;
1685 if (code == COMPOUND_EXPR && TREE_CODE (non_dep) != COMPOUND_EXPR)
1686 /* This should not be considered a COMPOUND_EXPR, because it
1687 resolves to an overload. */
1688 COMPOUND_EXPR_OVERLOADED (t) = 1;
1694 /* Similar to `build_call_list', but for template definitions of non-dependent
1695 expressions. NON_DEP is the non-dependent expression that has been
1699 build_min_non_dep_call_list (tree non_dep, tree fn, tree arglist)
1701 tree t = build_nt_call_list (fn, arglist);
1702 TREE_TYPE (t) = TREE_TYPE (non_dep);
1703 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (non_dep);
1708 get_type_decl (tree t)
1710 if (TREE_CODE (t) == TYPE_DECL)
1713 return TYPE_STUB_DECL (t);
1714 gcc_assert (t == error_mark_node);
1718 /* Returns the namespace that contains DECL, whether directly or
1722 decl_namespace_context (tree decl)
1726 if (TREE_CODE (decl) == NAMESPACE_DECL)
1728 else if (TYPE_P (decl))
1729 decl = CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl));
1731 decl = CP_DECL_CONTEXT (decl);
1735 /* Returns true if decl is within an anonymous namespace, however deeply
1736 nested, or false otherwise. */
1739 decl_anon_ns_mem_p (const_tree decl)
1743 if (decl == NULL_TREE || decl == error_mark_node)
1745 if (TREE_CODE (decl) == NAMESPACE_DECL
1746 && DECL_NAME (decl) == NULL_TREE)
1748 /* Classes and namespaces inside anonymous namespaces have
1749 TREE_PUBLIC == 0, so we can shortcut the search. */
1750 else if (TYPE_P (decl))
1751 return (TREE_PUBLIC (TYPE_NAME (decl)) == 0);
1752 else if (TREE_CODE (decl) == NAMESPACE_DECL)
1753 return (TREE_PUBLIC (decl) == 0);
1755 decl = DECL_CONTEXT (decl);
1759 /* Return truthvalue of whether T1 is the same tree structure as T2.
1760 Return 1 if they are the same. Return 0 if they are different. */
1763 cp_tree_equal (tree t1, tree t2)
1765 enum tree_code code1, code2;
1772 for (code1 = TREE_CODE (t1);
1773 CONVERT_EXPR_CODE_P (code1)
1774 || code1 == NON_LVALUE_EXPR;
1775 code1 = TREE_CODE (t1))
1776 t1 = TREE_OPERAND (t1, 0);
1777 for (code2 = TREE_CODE (t2);
1778 CONVERT_EXPR_CODE_P (code2)
1779 || code1 == NON_LVALUE_EXPR;
1780 code2 = TREE_CODE (t2))
1781 t2 = TREE_OPERAND (t2, 0);
1783 /* They might have become equal now. */
1793 return TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
1794 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2);
1797 return REAL_VALUES_EQUAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
1800 return TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
1801 && !memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
1802 TREE_STRING_LENGTH (t1));
1805 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1),
1806 TREE_FIXED_CST (t2));
1809 return cp_tree_equal (TREE_REALPART (t1), TREE_REALPART (t2))
1810 && cp_tree_equal (TREE_IMAGPART (t1), TREE_IMAGPART (t2));
1813 /* We need to do this when determining whether or not two
1814 non-type pointer to member function template arguments
1816 if (!(same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
1817 /* The first operand is RTL. */
1818 && TREE_OPERAND (t1, 0) == TREE_OPERAND (t2, 0)))
1820 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1823 if (!cp_tree_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2)))
1825 if (!cp_tree_equal (TREE_VALUE (t1), TREE_VALUE (t2)))
1827 return cp_tree_equal (TREE_CHAIN (t1), TREE_CHAIN (t2));
1830 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1835 call_expr_arg_iterator iter1, iter2;
1836 if (!cp_tree_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2)))
1838 for (arg1 = first_call_expr_arg (t1, &iter1),
1839 arg2 = first_call_expr_arg (t2, &iter2);
1841 arg1 = next_call_expr_arg (&iter1),
1842 arg2 = next_call_expr_arg (&iter2))
1843 if (!cp_tree_equal (arg1, arg2))
1845 return (arg1 || arg2);
1850 tree o1 = TREE_OPERAND (t1, 0);
1851 tree o2 = TREE_OPERAND (t2, 0);
1853 /* Special case: if either target is an unallocated VAR_DECL,
1854 it means that it's going to be unified with whatever the
1855 TARGET_EXPR is really supposed to initialize, so treat it
1856 as being equivalent to anything. */
1857 if (TREE_CODE (o1) == VAR_DECL && DECL_NAME (o1) == NULL_TREE
1858 && !DECL_RTL_SET_P (o1))
1860 else if (TREE_CODE (o2) == VAR_DECL && DECL_NAME (o2) == NULL_TREE
1861 && !DECL_RTL_SET_P (o2))
1863 else if (!cp_tree_equal (o1, o2))
1866 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1869 case WITH_CLEANUP_EXPR:
1870 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1872 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
1875 if (TREE_OPERAND (t1, 1) != TREE_OPERAND (t2, 1))
1877 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1880 /* For comparing uses of parameters in late-specified return types
1881 with an out-of-class definition of the function. */
1882 if (same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1891 case IDENTIFIER_NODE:
1896 return (BASELINK_BINFO (t1) == BASELINK_BINFO (t2)
1897 && BASELINK_ACCESS_BINFO (t1) == BASELINK_ACCESS_BINFO (t2)
1898 && cp_tree_equal (BASELINK_FUNCTIONS (t1),
1899 BASELINK_FUNCTIONS (t2)));
1901 case TEMPLATE_PARM_INDEX:
1902 return (TEMPLATE_PARM_IDX (t1) == TEMPLATE_PARM_IDX (t2)
1903 && TEMPLATE_PARM_LEVEL (t1) == TEMPLATE_PARM_LEVEL (t2)
1904 && same_type_p (TREE_TYPE (TEMPLATE_PARM_DECL (t1)),
1905 TREE_TYPE (TEMPLATE_PARM_DECL (t2))));
1907 case TEMPLATE_ID_EXPR:
1912 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1914 vec1 = TREE_OPERAND (t1, 1);
1915 vec2 = TREE_OPERAND (t2, 1);
1918 return !vec1 && !vec2;
1920 if (TREE_VEC_LENGTH (vec1) != TREE_VEC_LENGTH (vec2))
1923 for (ix = TREE_VEC_LENGTH (vec1); ix--;)
1924 if (!cp_tree_equal (TREE_VEC_ELT (vec1, ix),
1925 TREE_VEC_ELT (vec2, ix)))
1934 tree o1 = TREE_OPERAND (t1, 0);
1935 tree o2 = TREE_OPERAND (t2, 0);
1937 if (TREE_CODE (o1) != TREE_CODE (o2))
1940 return same_type_p (o1, o2);
1942 return cp_tree_equal (o1, o2);
1947 tree t1_op1, t2_op1;
1949 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1952 t1_op1 = TREE_OPERAND (t1, 1);
1953 t2_op1 = TREE_OPERAND (t2, 1);
1954 if (TREE_CODE (t1_op1) != TREE_CODE (t2_op1))
1957 return cp_tree_equal (TREE_OPERAND (t1, 2), TREE_OPERAND (t2, 2));
1961 /* Two pointer-to-members are the same if they point to the same
1962 field or function in the same class. */
1963 if (PTRMEM_CST_MEMBER (t1) != PTRMEM_CST_MEMBER (t2))
1966 return same_type_p (PTRMEM_CST_CLASS (t1), PTRMEM_CST_CLASS (t2));
1969 if (OVL_FUNCTION (t1) != OVL_FUNCTION (t2))
1971 return cp_tree_equal (OVL_CHAIN (t1), OVL_CHAIN (t2));
1974 if (TRAIT_EXPR_KIND (t1) != TRAIT_EXPR_KIND (t2))
1976 return same_type_p (TRAIT_EXPR_TYPE1 (t1), TRAIT_EXPR_TYPE1 (t2))
1977 && same_type_p (TRAIT_EXPR_TYPE2 (t1), TRAIT_EXPR_TYPE2 (t2));
1983 switch (TREE_CODE_CLASS (code1))
1987 case tcc_comparison:
1988 case tcc_expression:
1995 n = TREE_OPERAND_LENGTH (t1);
1996 if (TREE_CODE_CLASS (code1) == tcc_vl_exp
1997 && n != TREE_OPERAND_LENGTH (t2))
2000 for (i = 0; i < n; ++i)
2001 if (!cp_tree_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i)))
2008 return same_type_p (t1, t2);
2012 /* We can get here with --disable-checking. */
2016 /* The type of ARG when used as an lvalue. */
2019 lvalue_type (tree arg)
2021 tree type = TREE_TYPE (arg);
2025 /* The type of ARG for printing error messages; denote lvalues with
2029 error_type (tree arg)
2031 tree type = TREE_TYPE (arg);
2033 if (TREE_CODE (type) == ARRAY_TYPE)
2035 else if (TREE_CODE (type) == ERROR_MARK)
2037 else if (real_lvalue_p (arg))
2038 type = build_reference_type (lvalue_type (arg));
2039 else if (MAYBE_CLASS_TYPE_P (type))
2040 type = lvalue_type (arg);
2045 /* Does FUNCTION use a variable-length argument list? */
2048 varargs_function_p (const_tree function)
2050 const_tree parm = TYPE_ARG_TYPES (TREE_TYPE (function));
2051 for (; parm; parm = TREE_CHAIN (parm))
2052 if (TREE_VALUE (parm) == void_type_node)
2057 /* Returns 1 if decl is a member of a class. */
2060 member_p (const_tree decl)
2062 const_tree const ctx = DECL_CONTEXT (decl);
2063 return (ctx && TYPE_P (ctx));
2066 /* Create a placeholder for member access where we don't actually have an
2067 object that the access is against. */
2070 build_dummy_object (tree type)
2072 tree decl = build1 (NOP_EXPR, build_pointer_type (type), void_zero_node);
2073 return cp_build_indirect_ref (decl, NULL, tf_warning_or_error);
2076 /* We've gotten a reference to a member of TYPE. Return *this if appropriate,
2077 or a dummy object otherwise. If BINFOP is non-0, it is filled with the
2078 binfo path from current_class_type to TYPE, or 0. */
2081 maybe_dummy_object (tree type, tree* binfop)
2086 if (current_class_type
2087 && (binfo = lookup_base (current_class_type, type,
2088 ba_unique | ba_quiet, NULL)))
2089 context = current_class_type;
2092 /* Reference from a nested class member function. */
2094 binfo = TYPE_BINFO (type);
2100 if (current_class_ref && context == current_class_type
2101 /* Kludge: Make sure that current_class_type is actually
2102 correct. It might not be if we're in the middle of
2103 tsubst_default_argument. */
2104 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref)),
2105 current_class_type))
2106 decl = current_class_ref;
2108 decl = build_dummy_object (context);
2113 /* Returns 1 if OB is a placeholder object, or a pointer to one. */
2116 is_dummy_object (const_tree ob)
2118 if (TREE_CODE (ob) == INDIRECT_REF)
2119 ob = TREE_OPERAND (ob, 0);
2120 return (TREE_CODE (ob) == NOP_EXPR
2121 && TREE_OPERAND (ob, 0) == void_zero_node);
2124 /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */
2127 pod_type_p (const_tree t)
2129 /* This CONST_CAST is okay because strip_array_types returns its
2130 argument unmodified and we assign it to a const_tree. */
2131 t = strip_array_types (CONST_CAST_TREE(t));
2133 if (t == error_mark_node)
2135 if (INTEGRAL_TYPE_P (t))
2136 return 1; /* integral, character or enumeral type */
2137 if (FLOAT_TYPE_P (t))
2140 return 1; /* pointer to non-member */
2141 if (TYPE_PTR_TO_MEMBER_P (t))
2142 return 1; /* pointer to member */
2144 if (TREE_CODE (t) == VECTOR_TYPE)
2145 return 1; /* vectors are (small) arrays of scalars */
2147 if (! RECORD_OR_UNION_CODE_P (TREE_CODE (t)))
2148 return 0; /* other non-class type (reference or function) */
2149 if (! CLASS_TYPE_P (t))
2150 return 1; /* struct created by the back end */
2151 if (CLASSTYPE_NON_POD_P (t))
2156 /* Nonzero iff type T is a class template implicit specialization. */
2159 class_tmpl_impl_spec_p (const_tree t)
2161 return CLASS_TYPE_P (t) && CLASSTYPE_TEMPLATE_INSTANTIATION (t);
2164 /* Returns 1 iff zero initialization of type T means actually storing
2168 zero_init_p (const_tree t)
2170 /* This CONST_CAST is okay because strip_array_types returns its
2171 argument unmodified and we assign it to a const_tree. */
2172 t = strip_array_types (CONST_CAST_TREE(t));
2174 if (t == error_mark_node)
2177 /* NULL pointers to data members are initialized with -1. */
2178 if (TYPE_PTRMEM_P (t))
2181 /* Classes that contain types that can't be zero-initialized, cannot
2182 be zero-initialized themselves. */
2183 if (CLASS_TYPE_P (t) && CLASSTYPE_NON_ZERO_INIT_P (t))
2189 /* Table of valid C++ attributes. */
2190 const struct attribute_spec cxx_attribute_table[] =
2192 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
2193 { "java_interface", 0, 0, false, false, false, handle_java_interface_attribute },
2194 { "com_interface", 0, 0, false, false, false, handle_com_interface_attribute },
2195 { "init_priority", 1, 1, true, false, false, handle_init_priority_attribute },
2196 { NULL, 0, 0, false, false, false, NULL }
2199 /* Handle a "java_interface" attribute; arguments as in
2200 struct attribute_spec.handler. */
2202 handle_java_interface_attribute (tree* node,
2204 tree args ATTRIBUTE_UNUSED ,
2209 || !CLASS_TYPE_P (*node)
2210 || !TYPE_FOR_JAVA (*node))
2212 error ("%qE attribute can only be applied to Java class definitions",
2214 *no_add_attrs = true;
2217 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
2218 *node = build_variant_type_copy (*node);
2219 TYPE_JAVA_INTERFACE (*node) = 1;
2224 /* Handle a "com_interface" attribute; arguments as in
2225 struct attribute_spec.handler. */
2227 handle_com_interface_attribute (tree* node,
2229 tree args ATTRIBUTE_UNUSED ,
2230 int flags ATTRIBUTE_UNUSED ,
2235 *no_add_attrs = true;
2238 || !CLASS_TYPE_P (*node)
2239 || *node != TYPE_MAIN_VARIANT (*node))
2241 warning (OPT_Wattributes, "%qE attribute can only be applied "
2242 "to class definitions", name);
2247 warning (0, "%qE is obsolete; g++ vtables are now COM-compatible by default",
2253 /* Handle an "init_priority" attribute; arguments as in
2254 struct attribute_spec.handler. */
2256 handle_init_priority_attribute (tree* node,
2259 int flags ATTRIBUTE_UNUSED ,
2262 tree initp_expr = TREE_VALUE (args);
2264 tree type = TREE_TYPE (decl);
2267 STRIP_NOPS (initp_expr);
2269 if (!initp_expr || TREE_CODE (initp_expr) != INTEGER_CST)
2271 error ("requested init_priority is not an integer constant");
2272 *no_add_attrs = true;
2276 pri = TREE_INT_CST_LOW (initp_expr);
2278 type = strip_array_types (type);
2280 if (decl == NULL_TREE
2281 || TREE_CODE (decl) != VAR_DECL
2282 || !TREE_STATIC (decl)
2283 || DECL_EXTERNAL (decl)
2284 || (TREE_CODE (type) != RECORD_TYPE
2285 && TREE_CODE (type) != UNION_TYPE)
2286 /* Static objects in functions are initialized the
2287 first time control passes through that
2288 function. This is not precise enough to pin down an
2289 init_priority value, so don't allow it. */
2290 || current_function_decl)
2292 error ("can only use %qE attribute on file-scope definitions "
2293 "of objects of class type", name);
2294 *no_add_attrs = true;
2298 if (pri > MAX_INIT_PRIORITY || pri <= 0)
2300 error ("requested init_priority is out of range");
2301 *no_add_attrs = true;
2305 /* Check for init_priorities that are reserved for
2306 language and runtime support implementations.*/
2307 if (pri <= MAX_RESERVED_INIT_PRIORITY)
2310 (0, "requested init_priority is reserved for internal use");
2313 if (SUPPORTS_INIT_PRIORITY)
2315 SET_DECL_INIT_PRIORITY (decl, pri);
2316 DECL_HAS_INIT_PRIORITY_P (decl) = 1;
2321 error ("%qE attribute is not supported on this platform", name);
2322 *no_add_attrs = true;
2327 /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the
2328 thing pointed to by the constant. */
2331 make_ptrmem_cst (tree type, tree member)
2333 tree ptrmem_cst = make_node (PTRMEM_CST);
2334 TREE_TYPE (ptrmem_cst) = type;
2335 PTRMEM_CST_MEMBER (ptrmem_cst) = member;
2339 /* Build a variant of TYPE that has the indicated ATTRIBUTES. May
2340 return an existing type if an appropriate type already exists. */
2343 cp_build_type_attribute_variant (tree type, tree attributes)
2347 new_type = build_type_attribute_variant (type, attributes);
2348 if (TREE_CODE (new_type) == FUNCTION_TYPE
2349 && (TYPE_RAISES_EXCEPTIONS (new_type)
2350 != TYPE_RAISES_EXCEPTIONS (type)))
2351 new_type = build_exception_variant (new_type,
2352 TYPE_RAISES_EXCEPTIONS (type));
2354 /* Making a new main variant of a class type is broken. */
2355 gcc_assert (!CLASS_TYPE_P (type) || new_type == type);
2360 /* Return TRUE if TYPE1 and TYPE2 are identical for type hashing purposes.
2361 Called only after doing all language independent checks. Only
2362 to check TYPE_RAISES_EXCEPTIONS for FUNCTION_TYPE, the rest is already
2363 compared in type_hash_eq. */
2366 cxx_type_hash_eq (const_tree typea, const_tree typeb)
2368 gcc_assert (TREE_CODE (typea) == FUNCTION_TYPE);
2370 return comp_except_specs (TYPE_RAISES_EXCEPTIONS (typea),
2371 TYPE_RAISES_EXCEPTIONS (typeb), 1);
2374 /* Apply FUNC to all language-specific sub-trees of TP in a pre-order
2375 traversal. Called from walk_tree. */
2378 cp_walk_subtrees (tree *tp, int *walk_subtrees_p, walk_tree_fn func,
2379 void *data, struct pointer_set_t *pset)
2381 enum tree_code code = TREE_CODE (*tp);
2384 #define WALK_SUBTREE(NODE) \
2387 result = cp_walk_tree (&(NODE), func, data, pset); \
2388 if (result) goto out; \
2392 /* Not one of the easy cases. We must explicitly go through the
2398 case TEMPLATE_TEMPLATE_PARM:
2399 case BOUND_TEMPLATE_TEMPLATE_PARM:
2400 case UNBOUND_CLASS_TEMPLATE:
2401 case TEMPLATE_PARM_INDEX:
2402 case TEMPLATE_TYPE_PARM:
2405 /* None of these have subtrees other than those already walked
2407 *walk_subtrees_p = 0;
2411 WALK_SUBTREE (BASELINK_FUNCTIONS (*tp));
2412 *walk_subtrees_p = 0;
2416 WALK_SUBTREE (TREE_TYPE (*tp));
2417 *walk_subtrees_p = 0;
2421 WALK_SUBTREE (TREE_PURPOSE (*tp));
2425 WALK_SUBTREE (OVL_FUNCTION (*tp));
2426 WALK_SUBTREE (OVL_CHAIN (*tp));
2427 *walk_subtrees_p = 0;
2431 WALK_SUBTREE (DECL_NAME (*tp));
2432 WALK_SUBTREE (USING_DECL_SCOPE (*tp));
2433 WALK_SUBTREE (USING_DECL_DECLS (*tp));
2434 *walk_subtrees_p = 0;
2438 if (TYPE_PTRMEMFUNC_P (*tp))
2439 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (*tp));
2442 case TYPE_ARGUMENT_PACK:
2443 case NONTYPE_ARGUMENT_PACK:
2445 tree args = ARGUMENT_PACK_ARGS (*tp);
2446 int i, len = TREE_VEC_LENGTH (args);
2447 for (i = 0; i < len; i++)
2448 WALK_SUBTREE (TREE_VEC_ELT (args, i));
2452 case TYPE_PACK_EXPANSION:
2453 WALK_SUBTREE (TREE_TYPE (*tp));
2454 *walk_subtrees_p = 0;
2457 case EXPR_PACK_EXPANSION:
2458 WALK_SUBTREE (TREE_OPERAND (*tp, 0));
2459 *walk_subtrees_p = 0;
2463 case REINTERPRET_CAST_EXPR:
2464 case STATIC_CAST_EXPR:
2465 case CONST_CAST_EXPR:
2466 case DYNAMIC_CAST_EXPR:
2467 if (TREE_TYPE (*tp))
2468 WALK_SUBTREE (TREE_TYPE (*tp));
2472 for (i = 0; i < TREE_CODE_LENGTH (TREE_CODE (*tp)); ++i)
2473 WALK_SUBTREE (TREE_OPERAND (*tp, i));
2475 *walk_subtrees_p = 0;
2479 WALK_SUBTREE (TRAIT_EXPR_TYPE1 (*tp));
2480 WALK_SUBTREE (TRAIT_EXPR_TYPE2 (*tp));
2481 *walk_subtrees_p = 0;
2485 WALK_SUBTREE (DECLTYPE_TYPE_EXPR (*tp));
2486 *walk_subtrees_p = 0;
2494 /* We didn't find what we were looking for. */
2501 /* Like save_expr, but for C++. */
2504 cp_save_expr (tree expr)
2506 /* There is no reason to create a SAVE_EXPR within a template; if
2507 needed, we can create the SAVE_EXPR when instantiating the
2508 template. Furthermore, the middle-end cannot handle C++-specific
2510 if (processing_template_decl)
2512 return save_expr (expr);
2515 /* Initialize tree.c. */
2520 list_hash_table = htab_create_ggc (31, list_hash, list_hash_eq, NULL);
2523 /* Returns the kind of special function that DECL (a FUNCTION_DECL)
2524 is. Note that sfk_none is zero, so this function can be used as a
2525 predicate to test whether or not DECL is a special function. */
2527 special_function_kind
2528 special_function_p (const_tree decl)
2530 /* Rather than doing all this stuff with magic names, we should
2531 probably have a field of type `special_function_kind' in
2532 DECL_LANG_SPECIFIC. */
2533 if (DECL_COPY_CONSTRUCTOR_P (decl))
2534 return sfk_copy_constructor;
2535 if (DECL_CONSTRUCTOR_P (decl))
2536 return sfk_constructor;
2537 if (DECL_OVERLOADED_OPERATOR_P (decl) == NOP_EXPR)
2538 return sfk_assignment_operator;
2539 if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl))
2540 return sfk_destructor;
2541 if (DECL_COMPLETE_DESTRUCTOR_P (decl))
2542 return sfk_complete_destructor;
2543 if (DECL_BASE_DESTRUCTOR_P (decl))
2544 return sfk_base_destructor;
2545 if (DECL_DELETING_DESTRUCTOR_P (decl))
2546 return sfk_deleting_destructor;
2547 if (DECL_CONV_FN_P (decl))
2548 return sfk_conversion;
2553 /* Returns nonzero if TYPE is a character type, including wchar_t. */
2556 char_type_p (tree type)
2558 return (same_type_p (type, char_type_node)
2559 || same_type_p (type, unsigned_char_type_node)
2560 || same_type_p (type, signed_char_type_node)
2561 || same_type_p (type, char16_type_node)
2562 || same_type_p (type, char32_type_node)
2563 || same_type_p (type, wchar_type_node));
2566 /* Returns the kind of linkage associated with the indicated DECL. Th
2567 value returned is as specified by the language standard; it is
2568 independent of implementation details regarding template
2569 instantiation, etc. For example, it is possible that a declaration
2570 to which this function assigns external linkage would not show up
2571 as a global symbol when you run `nm' on the resulting object file. */
2574 decl_linkage (tree decl)
2576 /* This function doesn't attempt to calculate the linkage from first
2577 principles as given in [basic.link]. Instead, it makes use of
2578 the fact that we have already set TREE_PUBLIC appropriately, and
2579 then handles a few special cases. Ideally, we would calculate
2580 linkage first, and then transform that into a concrete
2583 /* Things that don't have names have no linkage. */
2584 if (!DECL_NAME (decl))
2587 /* Fields have no linkage. */
2588 if (TREE_CODE (decl) == FIELD_DECL)
2591 /* Things that are TREE_PUBLIC have external linkage. */
2592 if (TREE_PUBLIC (decl))
2595 if (TREE_CODE (decl) == NAMESPACE_DECL)
2598 /* Linkage of a CONST_DECL depends on the linkage of the enumeration
2600 if (TREE_CODE (decl) == CONST_DECL)
2601 return decl_linkage (TYPE_NAME (TREE_TYPE (decl)));
2603 /* Some things that are not TREE_PUBLIC have external linkage, too.
2604 For example, on targets that don't have weak symbols, we make all
2605 template instantiations have internal linkage (in the object
2606 file), but the symbols should still be treated as having external
2607 linkage from the point of view of the language. */
2608 if (TREE_CODE (decl) != TYPE_DECL && DECL_LANG_SPECIFIC (decl)
2609 && DECL_COMDAT (decl))
2612 /* Things in local scope do not have linkage, if they don't have
2614 if (decl_function_context (decl))
2617 /* Members of the anonymous namespace also have TREE_PUBLIC unset, but
2618 are considered to have external linkage for language purposes. DECLs
2619 really meant to have internal linkage have DECL_THIS_STATIC set. */
2620 if (TREE_CODE (decl) == TYPE_DECL)
2622 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == FUNCTION_DECL)
2624 if (!DECL_THIS_STATIC (decl))
2627 /* Static data members and static member functions from classes
2628 in anonymous namespace also don't have TREE_PUBLIC set. */
2629 if (DECL_CLASS_CONTEXT (decl))
2633 /* Everything else has internal linkage. */
2637 /* EXP is an expression that we want to pre-evaluate. Returns (in
2638 *INITP) an expression that will perform the pre-evaluation. The
2639 value returned by this function is a side-effect free expression
2640 equivalent to the pre-evaluated expression. Callers must ensure
2641 that *INITP is evaluated before EXP. */
2644 stabilize_expr (tree exp, tree* initp)
2648 if (!TREE_SIDE_EFFECTS (exp))
2649 init_expr = NULL_TREE;
2650 else if (!real_lvalue_p (exp)
2651 || !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (exp)))
2653 init_expr = get_target_expr (exp);
2654 exp = TARGET_EXPR_SLOT (init_expr);
2658 exp = cp_build_unary_op (ADDR_EXPR, exp, 1, tf_warning_or_error);
2659 init_expr = get_target_expr (exp);
2660 exp = TARGET_EXPR_SLOT (init_expr);
2661 exp = cp_build_indirect_ref (exp, 0, tf_warning_or_error);
2665 gcc_assert (!TREE_SIDE_EFFECTS (exp));
2669 /* Add NEW_EXPR, an expression whose value we don't care about, after the
2670 similar expression ORIG. */
2673 add_stmt_to_compound (tree orig, tree new_expr)
2675 if (!new_expr || !TREE_SIDE_EFFECTS (new_expr))
2677 if (!orig || !TREE_SIDE_EFFECTS (orig))
2679 return build2 (COMPOUND_EXPR, void_type_node, orig, new_expr);
2682 /* Like stabilize_expr, but for a call whose arguments we want to
2683 pre-evaluate. CALL is modified in place to use the pre-evaluated
2684 arguments, while, upon return, *INITP contains an expression to
2685 compute the arguments. */
2688 stabilize_call (tree call, tree *initp)
2690 tree inits = NULL_TREE;
2692 int nargs = call_expr_nargs (call);
2694 if (call == error_mark_node || processing_template_decl)
2700 gcc_assert (TREE_CODE (call) == CALL_EXPR);
2702 for (i = 0; i < nargs; i++)
2705 CALL_EXPR_ARG (call, i) =
2706 stabilize_expr (CALL_EXPR_ARG (call, i), &init);
2707 inits = add_stmt_to_compound (inits, init);
2713 /* Like stabilize_expr, but for an AGGR_INIT_EXPR whose arguments we want
2714 to pre-evaluate. CALL is modified in place to use the pre-evaluated
2715 arguments, while, upon return, *INITP contains an expression to
2716 compute the arguments. */
2719 stabilize_aggr_init (tree call, tree *initp)
2721 tree inits = NULL_TREE;
2723 int nargs = aggr_init_expr_nargs (call);
2725 if (call == error_mark_node)
2728 gcc_assert (TREE_CODE (call) == AGGR_INIT_EXPR);
2730 for (i = 0; i < nargs; i++)
2733 AGGR_INIT_EXPR_ARG (call, i) =
2734 stabilize_expr (AGGR_INIT_EXPR_ARG (call, i), &init);
2735 inits = add_stmt_to_compound (inits, init);
2741 /* Like stabilize_expr, but for an initialization.
2743 If the initialization is for an object of class type, this function
2744 takes care not to introduce additional temporaries.
2746 Returns TRUE iff the expression was successfully pre-evaluated,
2747 i.e., if INIT is now side-effect free, except for, possible, a
2748 single call to a constructor. */
2751 stabilize_init (tree init, tree *initp)
2757 if (t == error_mark_node || processing_template_decl)
2760 if (TREE_CODE (t) == INIT_EXPR
2761 && TREE_CODE (TREE_OPERAND (t, 1)) != TARGET_EXPR
2762 && TREE_CODE (TREE_OPERAND (t, 1)) != AGGR_INIT_EXPR)
2764 TREE_OPERAND (t, 1) = stabilize_expr (TREE_OPERAND (t, 1), initp);
2768 if (TREE_CODE (t) == INIT_EXPR)
2769 t = TREE_OPERAND (t, 1);
2770 if (TREE_CODE (t) == TARGET_EXPR)
2771 t = TARGET_EXPR_INITIAL (t);
2772 if (TREE_CODE (t) == COMPOUND_EXPR)
2774 if (TREE_CODE (t) == CONSTRUCTOR
2775 && EMPTY_CONSTRUCTOR_P (t))
2776 /* Default-initialization. */
2779 /* If the initializer is a COND_EXPR, we can't preevaluate
2781 if (TREE_CODE (t) == COND_EXPR)
2784 if (TREE_CODE (t) == CALL_EXPR)
2786 stabilize_call (t, initp);
2790 if (TREE_CODE (t) == AGGR_INIT_EXPR)
2792 stabilize_aggr_init (t, initp);
2796 /* The initialization is being performed via a bitwise copy -- and
2797 the item copied may have side effects. */
2798 return TREE_SIDE_EFFECTS (init);
2801 /* Like "fold", but should be used whenever we might be processing the
2802 body of a template. */
2805 fold_if_not_in_template (tree expr)
2807 /* In the body of a template, there is never any need to call
2808 "fold". We will call fold later when actually instantiating the
2809 template. Integral constant expressions in templates will be
2810 evaluated via fold_non_dependent_expr, as necessary. */
2811 if (processing_template_decl)
2814 /* Fold C++ front-end specific tree codes. */
2815 if (TREE_CODE (expr) == UNARY_PLUS_EXPR)
2816 return fold_convert (TREE_TYPE (expr), TREE_OPERAND (expr, 0));
2821 /* Returns true if a cast to TYPE may appear in an integral constant
2825 cast_valid_in_integral_constant_expression_p (tree type)
2827 return (INTEGRAL_OR_ENUMERATION_TYPE_P (type)
2828 || dependent_type_p (type)
2829 || type == error_mark_node);
2833 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
2834 /* Complain that some language-specific thing hanging off a tree
2835 node has been accessed improperly. */
2838 lang_check_failed (const char* file, int line, const char* function)
2840 internal_error ("lang_* check: failed in %s, at %s:%d",
2841 function, trim_filename (file), line);
2843 #endif /* ENABLE_TREE_CHECKING */
2845 #include "gt-cp-tree.h"