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
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"
40 static tree bot_manip (tree *, int *, void *);
41 static tree bot_replace (tree *, int *, void *);
42 static tree build_cplus_array_type_1 (tree, tree);
43 static int list_hash_eq (const void *, const void *);
44 static hashval_t list_hash_pieces (tree, tree, tree);
45 static hashval_t list_hash (const void *);
46 static cp_lvalue_kind lvalue_p_1 (const_tree, int);
47 static tree build_target_expr (tree, tree);
48 static tree count_trees_r (tree *, int *, void *);
49 static tree verify_stmt_tree_r (tree *, int *, void *);
50 static tree build_local_temp (tree);
52 static tree handle_java_interface_attribute (tree *, tree, tree, int, bool *);
53 static tree handle_com_interface_attribute (tree *, tree, tree, int, bool *);
54 static tree handle_init_priority_attribute (tree *, tree, tree, int, bool *);
56 /* If REF is an lvalue, returns the kind of lvalue that REF is.
57 Otherwise, returns clk_none. If TREAT_CLASS_RVALUES_AS_LVALUES is
58 nonzero, rvalues of class type are considered lvalues. */
61 lvalue_p_1 (const_tree ref,
62 int treat_class_rvalues_as_lvalues)
64 cp_lvalue_kind op1_lvalue_kind = clk_none;
65 cp_lvalue_kind op2_lvalue_kind = clk_none;
67 /* Expressions of reference type are sometimes wrapped in
68 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
69 representation, not part of the language, so we have to look
71 if (TREE_CODE (ref) == INDIRECT_REF
72 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref, 0)))
74 return lvalue_p_1 (TREE_OPERAND (ref, 0),
75 treat_class_rvalues_as_lvalues);
77 if (TREE_CODE (TREE_TYPE (ref)) == REFERENCE_TYPE)
79 /* unnamed rvalue references are rvalues */
80 if (TYPE_REF_IS_RVALUE (TREE_TYPE (ref))
81 && TREE_CODE (ref) != PARM_DECL
82 && TREE_CODE (ref) != VAR_DECL
83 && TREE_CODE (ref) != COMPONENT_REF)
86 /* lvalue references and named rvalue references are lvalues. */
90 if (ref == current_class_ptr)
93 switch (TREE_CODE (ref))
97 /* preincrements and predecrements are valid lvals, provided
98 what they refer to are valid lvals. */
99 case PREINCREMENT_EXPR:
100 case PREDECREMENT_EXPR:
102 case WITH_CLEANUP_EXPR:
105 return lvalue_p_1 (TREE_OPERAND (ref, 0),
106 treat_class_rvalues_as_lvalues);
109 op1_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 0),
110 treat_class_rvalues_as_lvalues);
111 /* Look at the member designator. */
113 /* The "field" can be a FUNCTION_DECL or an OVERLOAD in some
115 || TREE_CODE (TREE_OPERAND (ref, 1)) != FIELD_DECL)
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;
135 if (TREE_READONLY (ref) && ! TREE_STATIC (ref)
136 && DECL_LANG_SPECIFIC (ref)
137 && DECL_IN_AGGR_P (ref))
143 if (TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE)
147 /* A currently unresolved scope ref. */
152 /* Disallow <? and >? as lvalues if either argument side-effects. */
153 if (TREE_SIDE_EFFECTS (TREE_OPERAND (ref, 0))
154 || TREE_SIDE_EFFECTS (TREE_OPERAND (ref, 1)))
156 op1_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 0),
157 treat_class_rvalues_as_lvalues);
158 op2_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 1),
159 treat_class_rvalues_as_lvalues);
163 op1_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 1),
164 treat_class_rvalues_as_lvalues);
165 op2_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 2),
166 treat_class_rvalues_as_lvalues);
173 return lvalue_p_1 (TREE_OPERAND (ref, 1),
174 treat_class_rvalues_as_lvalues);
177 return treat_class_rvalues_as_lvalues ? clk_class : clk_none;
180 return (treat_class_rvalues_as_lvalues
181 && CLASS_TYPE_P (TREE_TYPE (ref))
182 ? clk_class : clk_none);
185 /* Any class-valued call would be wrapped in a TARGET_EXPR. */
189 /* All functions (except non-static-member functions) are
191 return (DECL_NONSTATIC_MEMBER_FUNCTION_P (ref)
192 ? clk_none : clk_ordinary);
194 case NON_DEPENDENT_EXPR:
195 /* We must consider NON_DEPENDENT_EXPRs to be lvalues so that
196 things like "&E" where "E" is an expression with a
197 non-dependent type work. It is safe to be lenient because an
198 error will be issued when the template is instantiated if "E"
206 /* If one operand is not an lvalue at all, then this expression is
208 if (!op1_lvalue_kind || !op2_lvalue_kind)
211 /* Otherwise, it's an lvalue, and it has all the odd properties
212 contributed by either operand. */
213 op1_lvalue_kind = op1_lvalue_kind | op2_lvalue_kind;
214 /* It's not an ordinary lvalue if it involves either a bit-field or
216 if ((op1_lvalue_kind & ~clk_ordinary) != clk_none)
217 op1_lvalue_kind &= ~clk_ordinary;
218 return op1_lvalue_kind;
221 /* Returns the kind of lvalue that REF is, in the sense of
222 [basic.lval]. This function should really be named lvalue_p; it
223 computes the C++ definition of lvalue. */
226 real_lvalue_p (const_tree ref)
228 return lvalue_p_1 (ref,
229 /*treat_class_rvalues_as_lvalues=*/0);
232 /* This differs from real_lvalue_p in that class rvalues are
233 considered lvalues. */
236 lvalue_p (const_tree ref)
239 (lvalue_p_1 (ref, /*class rvalue ok*/ 1) != clk_none);
242 /* Test whether DECL is a builtin that may appear in a
243 constant-expression. */
246 builtin_valid_in_constant_expr_p (const_tree decl)
248 /* At present BUILT_IN_CONSTANT_P is the only builtin we're allowing
249 in constant-expressions. We may want to add other builtins later. */
250 return DECL_IS_BUILTIN_CONSTANT_P (decl);
253 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
256 build_target_expr (tree decl, tree value)
260 t = build4 (TARGET_EXPR, TREE_TYPE (decl), decl, value,
261 cxx_maybe_build_cleanup (decl), NULL_TREE);
262 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
263 ignore the TARGET_EXPR. If there really turn out to be no
264 side-effects, then the optimizer should be able to get rid of
265 whatever code is generated anyhow. */
266 TREE_SIDE_EFFECTS (t) = 1;
271 /* Return an undeclared local temporary of type TYPE for use in building a
275 build_local_temp (tree type)
277 tree slot = build_decl (VAR_DECL, NULL_TREE, type);
278 DECL_ARTIFICIAL (slot) = 1;
279 DECL_IGNORED_P (slot) = 1;
280 DECL_CONTEXT (slot) = current_function_decl;
281 layout_decl (slot, 0);
285 /* Set various status flags when building an AGGR_INIT_EXPR object T. */
288 process_aggr_init_operands (tree t)
292 side_effects = TREE_SIDE_EFFECTS (t);
296 n = TREE_OPERAND_LENGTH (t);
297 for (i = 1; i < n; i++)
299 tree op = TREE_OPERAND (t, i);
300 if (op && TREE_SIDE_EFFECTS (op))
307 TREE_SIDE_EFFECTS (t) = side_effects;
310 /* Build an AGGR_INIT_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE,
311 FN, and SLOT. NARGS is the number of call arguments which are specified
312 as a tree array ARGS. */
315 build_aggr_init_array (tree return_type, tree fn, tree slot, int nargs,
321 t = build_vl_exp (AGGR_INIT_EXPR, nargs + 3);
322 TREE_TYPE (t) = return_type;
323 AGGR_INIT_EXPR_FN (t) = fn;
324 AGGR_INIT_EXPR_SLOT (t) = slot;
325 for (i = 0; i < nargs; i++)
326 AGGR_INIT_EXPR_ARG (t, i) = args[i];
327 process_aggr_init_operands (t);
331 /* INIT is a CALL_EXPR or AGGR_INIT_EXPR which needs info about its
332 target. TYPE is the type that this initialization should appear to
335 Build an encapsulation of the initialization to perform
336 and return it so that it can be processed by language-independent
337 and language-specific expression expanders. */
340 build_cplus_new (tree type, tree init)
347 /* Make sure that we're not trying to create an instance of an
349 abstract_virtuals_error (NULL_TREE, type);
351 if (TREE_CODE (init) == CALL_EXPR)
352 fn = CALL_EXPR_FN (init);
353 else if (TREE_CODE (init) == AGGR_INIT_EXPR)
354 fn = AGGR_INIT_EXPR_FN (init);
356 return convert (type, init);
358 is_ctor = (TREE_CODE (fn) == ADDR_EXPR
359 && TREE_CODE (TREE_OPERAND (fn, 0)) == FUNCTION_DECL
360 && DECL_CONSTRUCTOR_P (TREE_OPERAND (fn, 0)));
362 slot = build_local_temp (type);
364 /* We split the CALL_EXPR into its function and its arguments here.
365 Then, in expand_expr, we put them back together. The reason for
366 this is that this expression might be a default argument
367 expression. In that case, we need a new temporary every time the
368 expression is used. That's what break_out_target_exprs does; it
369 replaces every AGGR_INIT_EXPR with a copy that uses a fresh
370 temporary slot. Then, expand_expr builds up a call-expression
371 using the new slot. */
373 /* If we don't need to use a constructor to create an object of this
374 type, don't mess with AGGR_INIT_EXPR. */
375 if (is_ctor || TREE_ADDRESSABLE (type))
377 if (TREE_CODE(init) == CALL_EXPR)
378 rval = build_aggr_init_array (void_type_node, fn, slot,
379 call_expr_nargs (init),
380 CALL_EXPR_ARGP (init));
382 rval = build_aggr_init_array (void_type_node, fn, slot,
383 aggr_init_expr_nargs (init),
384 AGGR_INIT_EXPR_ARGP (init));
385 TREE_SIDE_EFFECTS (rval) = 1;
386 AGGR_INIT_VIA_CTOR_P (rval) = is_ctor;
391 rval = build_target_expr (slot, rval);
392 TARGET_EXPR_IMPLICIT_P (rval) = 1;
397 /* Build a TARGET_EXPR using INIT to initialize a new temporary of the
401 build_target_expr_with_type (tree init, tree type)
403 gcc_assert (!VOID_TYPE_P (type));
405 if (TREE_CODE (init) == TARGET_EXPR)
407 else if (CLASS_TYPE_P (type) && !TYPE_HAS_TRIVIAL_INIT_REF (type)
408 && TREE_CODE (init) != COND_EXPR
409 && TREE_CODE (init) != CONSTRUCTOR
410 && TREE_CODE (init) != VA_ARG_EXPR)
411 /* We need to build up a copy constructor call. COND_EXPR is a special
412 case because we already have copies on the arms and we don't want
413 another one here. A CONSTRUCTOR is aggregate initialization, which
414 is handled separately. A VA_ARG_EXPR is magic creation of an
415 aggregate; there's no additional work to be done. */
416 return force_rvalue (init);
418 return force_target_expr (type, init);
421 /* Like the above function, but without the checking. This function should
422 only be used by code which is deliberately trying to subvert the type
423 system, such as call_builtin_trap. */
426 force_target_expr (tree type, tree init)
430 gcc_assert (!VOID_TYPE_P (type));
432 slot = build_local_temp (type);
433 return build_target_expr (slot, init);
436 /* Like build_target_expr_with_type, but use the type of INIT. */
439 get_target_expr (tree init)
441 return build_target_expr_with_type (init, TREE_TYPE (init));
444 /* If EXPR is a bitfield reference, convert it to the declared type of
445 the bitfield, and return the resulting expression. Otherwise,
446 return EXPR itself. */
449 convert_bitfield_to_declared_type (tree expr)
453 bitfield_type = is_bitfield_expr_with_lowered_type (expr);
455 expr = convert_to_integer (TYPE_MAIN_VARIANT (bitfield_type),
460 /* EXPR is being used in an rvalue context. Return a version of EXPR
461 that is marked as an rvalue. */
468 if (error_operand_p (expr))
473 Non-class rvalues always have cv-unqualified types. */
474 type = TREE_TYPE (expr);
475 if (!CLASS_TYPE_P (type) && cp_type_quals (type))
476 type = TYPE_MAIN_VARIANT (type);
478 if (!processing_template_decl && real_lvalue_p (expr))
479 expr = build1 (NON_LVALUE_EXPR, type, expr);
480 else if (type != TREE_TYPE (expr))
481 expr = build_nop (type, expr);
487 /* Hash an ARRAY_TYPE. K is really of type `tree'. */
490 cplus_array_hash (const void* k)
493 const_tree const t = (const_tree) k;
495 hash = (htab_hash_pointer (TREE_TYPE (t))
496 ^ htab_hash_pointer (TYPE_DOMAIN (t)));
501 typedef struct cplus_array_info {
506 /* Compare two ARRAY_TYPEs. K1 is really of type `tree', K2 is really
507 of type `cplus_array_info*'. */
510 cplus_array_compare (const void * k1, const void * k2)
512 const_tree const t1 = (const_tree) k1;
513 const cplus_array_info *const t2 = (const cplus_array_info*) k2;
515 return (TREE_TYPE (t1) == t2->type && TYPE_DOMAIN (t1) == t2->domain);
518 /* Hash table containing all of the C++ array types, including
519 dependent array types and array types whose element type is
521 static GTY ((param_is (union tree_node))) htab_t cplus_array_htab;
525 build_cplus_array_type_1 (tree elt_type, tree index_type)
529 if (elt_type == error_mark_node || index_type == error_mark_node)
530 return error_mark_node;
532 if (dependent_type_p (elt_type)
534 && value_dependent_expression_p (TYPE_MAX_VALUE (index_type))))
537 cplus_array_info cai;
540 if (cplus_array_htab == NULL)
541 cplus_array_htab = htab_create_ggc (61, &cplus_array_hash,
542 &cplus_array_compare, NULL);
544 hash = (htab_hash_pointer (elt_type)
545 ^ htab_hash_pointer (index_type));
547 cai.domain = index_type;
549 e = htab_find_slot_with_hash (cplus_array_htab, &cai, hash, INSERT);
551 /* We have found the type: we're done. */
555 /* Build a new array type. */
556 t = make_node (ARRAY_TYPE);
557 TREE_TYPE (t) = elt_type;
558 TYPE_DOMAIN (t) = index_type;
560 /* Store it in the hash table. */
563 /* Set the canonical type for this new node. */
564 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
565 || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type)))
566 SET_TYPE_STRUCTURAL_EQUALITY (t);
567 else if (TYPE_CANONICAL (elt_type) != elt_type
569 && TYPE_CANONICAL (index_type) != index_type))
571 = build_cplus_array_type
572 (TYPE_CANONICAL (elt_type),
573 index_type? TYPE_CANONICAL (index_type) : index_type);
575 TYPE_CANONICAL (t) = t;
579 t = build_array_type (elt_type, index_type);
581 /* Push these needs up so that initialization takes place
583 TYPE_NEEDS_CONSTRUCTING (t)
584 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (elt_type));
585 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
586 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (elt_type));
591 build_cplus_array_type (tree elt_type, tree index_type)
594 int type_quals = cp_type_quals (elt_type);
596 if (type_quals != TYPE_UNQUALIFIED)
597 elt_type = cp_build_qualified_type (elt_type, TYPE_UNQUALIFIED);
599 t = build_cplus_array_type_1 (elt_type, index_type);
601 if (type_quals != TYPE_UNQUALIFIED)
602 t = cp_build_qualified_type (t, type_quals);
607 /* Return a reference type node referring to TO_TYPE. If RVAL is
608 true, return an rvalue reference type, otherwise return an lvalue
609 reference type. If a type node exists, reuse it, otherwise create
612 cp_build_reference_type (tree to_type, bool rval)
615 lvalue_ref = build_reference_type (to_type);
619 /* This code to create rvalue reference types is based on and tied
620 to the code creating lvalue reference types in the middle-end
621 functions build_reference_type_for_mode and build_reference_type.
623 It works by putting the rvalue reference type nodes after the
624 lvalue reference nodes in the TYPE_NEXT_REF_TO linked list, so
625 they will effectively be ignored by the middle end. */
627 for (t = lvalue_ref; (t = TYPE_NEXT_REF_TO (t)); )
628 if (TYPE_REF_IS_RVALUE (t))
631 t = copy_node (lvalue_ref);
633 TYPE_REF_IS_RVALUE (t) = true;
634 TYPE_NEXT_REF_TO (t) = TYPE_NEXT_REF_TO (lvalue_ref);
635 TYPE_NEXT_REF_TO (lvalue_ref) = t;
636 TYPE_MAIN_VARIANT (t) = t;
638 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
639 SET_TYPE_STRUCTURAL_EQUALITY (t);
640 else if (TYPE_CANONICAL (to_type) != to_type)
642 = cp_build_reference_type (TYPE_CANONICAL (to_type), rval);
644 TYPE_CANONICAL (t) = t;
654 /* Make a variant of TYPE, qualified with the TYPE_QUALS. Handles
655 arrays correctly. In particular, if TYPE is an array of T's, and
656 TYPE_QUALS is non-empty, returns an array of qualified T's.
658 FLAGS determines how to deal with illformed qualifications. If
659 tf_ignore_bad_quals is set, then bad qualifications are dropped
660 (this is permitted if TYPE was introduced via a typedef or template
661 type parameter). If bad qualifications are dropped and tf_warning
662 is set, then a warning is issued for non-const qualifications. If
663 tf_ignore_bad_quals is not set and tf_error is not set, we
664 return error_mark_node. Otherwise, we issue an error, and ignore
667 Qualification of a reference type is valid when the reference came
668 via a typedef or template type argument. [dcl.ref] No such
669 dispensation is provided for qualifying a function type. [dcl.fct]
670 DR 295 queries this and the proposed resolution brings it into line
671 with qualifying a reference. We implement the DR. We also behave
672 in a similar manner for restricting non-pointer types. */
675 cp_build_qualified_type_real (tree type,
677 tsubst_flags_t complain)
680 int bad_quals = TYPE_UNQUALIFIED;
682 if (type == error_mark_node)
685 if (type_quals == cp_type_quals (type))
688 if (TREE_CODE (type) == ARRAY_TYPE)
690 /* In C++, the qualification really applies to the array element
691 type. Obtain the appropriately qualified element type. */
694 = cp_build_qualified_type_real (TREE_TYPE (type),
698 if (element_type == error_mark_node)
699 return error_mark_node;
701 /* See if we already have an identically qualified type. */
702 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
703 if (cp_type_quals (t) == type_quals
704 && TYPE_NAME (t) == TYPE_NAME (type)
705 && TYPE_CONTEXT (t) == TYPE_CONTEXT (type))
710 tree index_type = TYPE_DOMAIN (type);
712 cplus_array_info cai;
715 if (cplus_array_htab == NULL)
716 cplus_array_htab = htab_create_ggc (61, &cplus_array_hash,
717 &cplus_array_compare,
720 hash = (htab_hash_pointer (element_type)
721 ^ htab_hash_pointer (index_type));
722 cai.type = element_type;
723 cai.domain = index_type;
725 e = htab_find_slot_with_hash (cplus_array_htab, &cai, hash, INSERT);
727 /* We have found the type: we're done. */
730 /* Build a new array type and add it into the table. */
731 t = build_variant_type_copy (type);
732 TREE_TYPE (t) = element_type;
735 /* Set the canonical type for this new node. */
736 if (TYPE_STRUCTURAL_EQUALITY_P (element_type)
737 || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type)))
738 SET_TYPE_STRUCTURAL_EQUALITY (t);
739 else if (TYPE_CANONICAL (element_type) != element_type
741 && TYPE_CANONICAL (index_type) != index_type)
742 || TYPE_CANONICAL (type) != type)
744 = build_cplus_array_type
745 (TYPE_CANONICAL (element_type),
746 index_type? TYPE_CANONICAL (index_type) : index_type);
748 TYPE_CANONICAL (t) = t;
751 /* Even if we already had this variant, we update
752 TYPE_NEEDS_CONSTRUCTING and TYPE_HAS_NONTRIVIAL_DESTRUCTOR in case
753 they changed since the variant was originally created.
755 This seems hokey; if there is some way to use a previous
756 variant *without* coming through here,
757 TYPE_NEEDS_CONSTRUCTING will never be updated. */
758 TYPE_NEEDS_CONSTRUCTING (t)
759 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (element_type));
760 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
761 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (element_type));
764 else if (TYPE_PTRMEMFUNC_P (type))
766 /* For a pointer-to-member type, we can't just return a
767 cv-qualified version of the RECORD_TYPE. If we do, we
768 haven't changed the field that contains the actual pointer to
769 a method, and so TYPE_PTRMEMFUNC_FN_TYPE will be wrong. */
772 t = TYPE_PTRMEMFUNC_FN_TYPE (type);
773 t = cp_build_qualified_type_real (t, type_quals, complain);
774 return build_ptrmemfunc_type (t);
776 else if (TREE_CODE (type) == TYPE_PACK_EXPANSION)
778 tree t = PACK_EXPANSION_PATTERN (type);
780 t = cp_build_qualified_type_real (t, type_quals, complain);
781 return make_pack_expansion (t);
784 /* A reference or method type shall not be cv qualified.
785 [dcl.ref], [dct.fct] */
786 if (type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE)
787 && (TREE_CODE (type) == REFERENCE_TYPE
788 || TREE_CODE (type) == METHOD_TYPE))
790 bad_quals |= type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
791 type_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
794 /* A restrict-qualified type must be a pointer (or reference)
795 to object or incomplete type, or a function type. */
796 if ((type_quals & TYPE_QUAL_RESTRICT)
797 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
798 && TREE_CODE (type) != TYPENAME_TYPE
799 && TREE_CODE (type) != FUNCTION_TYPE
800 && !POINTER_TYPE_P (type))
802 bad_quals |= TYPE_QUAL_RESTRICT;
803 type_quals &= ~TYPE_QUAL_RESTRICT;
806 if (bad_quals == TYPE_UNQUALIFIED)
808 else if (!(complain & (tf_error | tf_ignore_bad_quals)))
809 return error_mark_node;
812 if (complain & tf_ignore_bad_quals)
813 /* We're not going to warn about constifying things that can't
815 bad_quals &= ~TYPE_QUAL_CONST;
818 tree bad_type = build_qualified_type (ptr_type_node, bad_quals);
820 if (!(complain & tf_ignore_bad_quals))
821 error ("%qV qualifiers cannot be applied to %qT",
826 /* Retrieve (or create) the appropriately qualified variant. */
827 result = build_qualified_type (type, type_quals);
829 /* If this was a pointer-to-method type, and we just made a copy,
830 then we need to unshare the record that holds the cached
831 pointer-to-member-function type, because these will be distinct
832 between the unqualified and qualified types. */
834 && TREE_CODE (type) == POINTER_TYPE
835 && TREE_CODE (TREE_TYPE (type)) == METHOD_TYPE)
836 TYPE_LANG_SPECIFIC (result) = NULL;
841 /* Returns the canonical version of TYPE. In other words, if TYPE is
842 a typedef, returns the underlying type. The cv-qualification of
843 the type returned matches the type input; they will always be
847 canonical_type_variant (tree t)
849 return cp_build_qualified_type (TYPE_MAIN_VARIANT (t), cp_type_quals (t));
852 /* Makes a copy of BINFO and TYPE, which is to be inherited into a
853 graph dominated by T. If BINFO is NULL, TYPE is a dependent base,
854 and we do a shallow copy. If BINFO is non-NULL, we do a deep copy.
855 VIRT indicates whether TYPE is inherited virtually or not.
856 IGO_PREV points at the previous binfo of the inheritance graph
857 order chain. The newly copied binfo's TREE_CHAIN forms this
860 The CLASSTYPE_VBASECLASSES vector of T is constructed in the
861 correct order. That is in the order the bases themselves should be
864 The BINFO_INHERITANCE of a virtual base class points to the binfo
865 of the most derived type. ??? We could probably change this so that
866 BINFO_INHERITANCE becomes synonymous with BINFO_PRIMARY, and hence
867 remove a field. They currently can only differ for primary virtual
871 copy_binfo (tree binfo, tree type, tree t, tree *igo_prev, int virt)
877 /* See if we've already made this virtual base. */
878 new_binfo = binfo_for_vbase (type, t);
883 new_binfo = make_tree_binfo (binfo ? BINFO_N_BASE_BINFOS (binfo) : 0);
884 BINFO_TYPE (new_binfo) = type;
886 /* Chain it into the inheritance graph. */
887 TREE_CHAIN (*igo_prev) = new_binfo;
888 *igo_prev = new_binfo;
895 gcc_assert (!BINFO_DEPENDENT_BASE_P (binfo));
896 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), type));
898 BINFO_OFFSET (new_binfo) = BINFO_OFFSET (binfo);
899 BINFO_VIRTUALS (new_binfo) = BINFO_VIRTUALS (binfo);
901 /* We do not need to copy the accesses, as they are read only. */
902 BINFO_BASE_ACCESSES (new_binfo) = BINFO_BASE_ACCESSES (binfo);
904 /* Recursively copy base binfos of BINFO. */
905 for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++)
909 gcc_assert (!BINFO_DEPENDENT_BASE_P (base_binfo));
910 new_base_binfo = copy_binfo (base_binfo, BINFO_TYPE (base_binfo),
912 BINFO_VIRTUAL_P (base_binfo));
914 if (!BINFO_INHERITANCE_CHAIN (new_base_binfo))
915 BINFO_INHERITANCE_CHAIN (new_base_binfo) = new_binfo;
916 BINFO_BASE_APPEND (new_binfo, new_base_binfo);
920 BINFO_DEPENDENT_BASE_P (new_binfo) = 1;
924 /* Push it onto the list after any virtual bases it contains
925 will have been pushed. */
926 VEC_quick_push (tree, CLASSTYPE_VBASECLASSES (t), new_binfo);
927 BINFO_VIRTUAL_P (new_binfo) = 1;
928 BINFO_INHERITANCE_CHAIN (new_binfo) = TYPE_BINFO (t);
934 /* Hashing of lists so that we don't make duplicates.
935 The entry point is `list_hash_canon'. */
937 /* Now here is the hash table. When recording a list, it is added
938 to the slot whose index is the hash code mod the table size.
939 Note that the hash table is used for several kinds of lists.
940 While all these live in the same table, they are completely independent,
941 and the hash code is computed differently for each of these. */
943 static GTY ((param_is (union tree_node))) htab_t list_hash_table;
952 /* Compare ENTRY (an entry in the hash table) with DATA (a list_proxy
953 for a node we are thinking about adding). */
956 list_hash_eq (const void* entry, const void* data)
958 const_tree const t = (const_tree) entry;
959 const struct list_proxy *const proxy = (const struct list_proxy *) data;
961 return (TREE_VALUE (t) == proxy->value
962 && TREE_PURPOSE (t) == proxy->purpose
963 && TREE_CHAIN (t) == proxy->chain);
966 /* Compute a hash code for a list (chain of TREE_LIST nodes
967 with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the
968 TREE_COMMON slots), by adding the hash codes of the individual entries. */
971 list_hash_pieces (tree purpose, tree value, tree chain)
973 hashval_t hashcode = 0;
976 hashcode += TREE_HASH (chain);
979 hashcode += TREE_HASH (value);
983 hashcode += TREE_HASH (purpose);
989 /* Hash an already existing TREE_LIST. */
992 list_hash (const void* p)
994 const_tree const t = (const_tree) p;
995 return list_hash_pieces (TREE_PURPOSE (t),
1000 /* Given list components PURPOSE, VALUE, AND CHAIN, return the canonical
1001 object for an identical list if one already exists. Otherwise, build a
1002 new one, and record it as the canonical object. */
1005 hash_tree_cons (tree purpose, tree value, tree chain)
1009 struct list_proxy proxy;
1011 /* Hash the list node. */
1012 hashcode = list_hash_pieces (purpose, value, chain);
1013 /* Create a proxy for the TREE_LIST we would like to create. We
1014 don't actually create it so as to avoid creating garbage. */
1015 proxy.purpose = purpose;
1016 proxy.value = value;
1017 proxy.chain = chain;
1018 /* See if it is already in the table. */
1019 slot = htab_find_slot_with_hash (list_hash_table, &proxy, hashcode,
1021 /* If not, create a new node. */
1023 *slot = tree_cons (purpose, value, chain);
1024 return (tree) *slot;
1027 /* Constructor for hashed lists. */
1030 hash_tree_chain (tree value, tree chain)
1032 return hash_tree_cons (NULL_TREE, value, chain);
1036 debug_binfo (tree elem)
1041 fprintf (stderr, "type \"%s\", offset = " HOST_WIDE_INT_PRINT_DEC
1043 TYPE_NAME_STRING (BINFO_TYPE (elem)),
1044 TREE_INT_CST_LOW (BINFO_OFFSET (elem)));
1045 debug_tree (BINFO_TYPE (elem));
1046 if (BINFO_VTABLE (elem))
1047 fprintf (stderr, "vtable decl \"%s\"\n",
1048 IDENTIFIER_POINTER (DECL_NAME (get_vtbl_decl_for_binfo (elem))));
1050 fprintf (stderr, "no vtable decl yet\n");
1051 fprintf (stderr, "virtuals:\n");
1052 virtuals = BINFO_VIRTUALS (elem);
1057 tree fndecl = TREE_VALUE (virtuals);
1058 fprintf (stderr, "%s [%ld =? %ld]\n",
1059 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl)),
1060 (long) n, (long) TREE_INT_CST_LOW (DECL_VINDEX (fndecl)));
1062 virtuals = TREE_CHAIN (virtuals);
1066 /* Build a representation for the qualified name SCOPE::NAME. TYPE is
1067 the type of the result expression, if known, or NULL_TREE if the
1068 resulting expression is type-dependent. If TEMPLATE_P is true,
1069 NAME is known to be a template because the user explicitly used the
1070 "template" keyword after the "::".
1072 All SCOPE_REFs should be built by use of this function. */
1075 build_qualified_name (tree type, tree scope, tree name, bool template_p)
1078 if (type == error_mark_node
1079 || scope == error_mark_node
1080 || name == error_mark_node)
1081 return error_mark_node;
1082 t = build2 (SCOPE_REF, type, scope, name);
1083 QUALIFIED_NAME_IS_TEMPLATE (t) = template_p;
1087 /* Returns nonzero if X is an expression for a (possibly overloaded)
1088 function. If "f" is a function or function template, "f", "c->f",
1089 "c.f", "C::f", and "f<int>" will all be considered possibly
1090 overloaded functions. Returns 2 if the function is actually
1091 overloaded, i.e., if it is impossible to know the type of the
1092 function without performing overload resolution. */
1095 is_overloaded_fn (tree x)
1097 /* A baselink is also considered an overloaded function. */
1098 if (TREE_CODE (x) == OFFSET_REF
1099 || TREE_CODE (x) == COMPONENT_REF)
1100 x = TREE_OPERAND (x, 1);
1102 x = BASELINK_FUNCTIONS (x);
1103 if (TREE_CODE (x) == TEMPLATE_ID_EXPR
1104 || DECL_FUNCTION_TEMPLATE_P (OVL_CURRENT (x))
1105 || (TREE_CODE (x) == OVERLOAD && OVL_CHAIN (x)))
1107 return (TREE_CODE (x) == FUNCTION_DECL
1108 || TREE_CODE (x) == OVERLOAD);
1111 /* Returns true iff X is an expression for an overloaded function
1112 whose type cannot be known without performing overload
1116 really_overloaded_fn (tree x)
1118 return is_overloaded_fn (x) == 2;
1122 get_first_fn (tree from)
1124 gcc_assert (is_overloaded_fn (from));
1125 /* A baselink is also considered an overloaded function. */
1126 if (TREE_CODE (from) == COMPONENT_REF)
1127 from = TREE_OPERAND (from, 1);
1128 if (BASELINK_P (from))
1129 from = BASELINK_FUNCTIONS (from);
1130 return OVL_CURRENT (from);
1133 /* Return a new OVL node, concatenating it with the old one. */
1136 ovl_cons (tree decl, tree chain)
1138 tree result = make_node (OVERLOAD);
1139 TREE_TYPE (result) = unknown_type_node;
1140 OVL_FUNCTION (result) = decl;
1141 TREE_CHAIN (result) = chain;
1146 /* Build a new overloaded function. If this is the first one,
1147 just return it; otherwise, ovl_cons the _DECLs */
1150 build_overload (tree decl, tree chain)
1152 if (! chain && TREE_CODE (decl) != TEMPLATE_DECL)
1154 if (chain && TREE_CODE (chain) != OVERLOAD)
1155 chain = ovl_cons (chain, NULL_TREE);
1156 return ovl_cons (decl, chain);
1160 #define PRINT_RING_SIZE 4
1163 cxx_printable_name (tree decl, int v)
1165 static unsigned int uid_ring[PRINT_RING_SIZE];
1166 static char *print_ring[PRINT_RING_SIZE];
1167 static int ring_counter;
1170 /* Only cache functions. */
1172 || TREE_CODE (decl) != FUNCTION_DECL
1173 || DECL_LANG_SPECIFIC (decl) == 0)
1174 return lang_decl_name (decl, v);
1176 /* See if this print name is lying around. */
1177 for (i = 0; i < PRINT_RING_SIZE; i++)
1178 if (uid_ring[i] == DECL_UID (decl))
1179 /* yes, so return it. */
1180 return print_ring[i];
1182 if (++ring_counter == PRINT_RING_SIZE)
1185 if (current_function_decl != NULL_TREE)
1187 if (uid_ring[ring_counter] == DECL_UID (current_function_decl))
1189 if (ring_counter == PRINT_RING_SIZE)
1191 gcc_assert (uid_ring[ring_counter] != DECL_UID (current_function_decl));
1194 if (print_ring[ring_counter])
1195 free (print_ring[ring_counter]);
1197 print_ring[ring_counter] = xstrdup (lang_decl_name (decl, v));
1198 uid_ring[ring_counter] = DECL_UID (decl);
1199 return print_ring[ring_counter];
1202 /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions
1203 listed in RAISES. */
1206 build_exception_variant (tree type, tree raises)
1208 tree v = TYPE_MAIN_VARIANT (type);
1209 int type_quals = TYPE_QUALS (type);
1211 for (; v; v = TYPE_NEXT_VARIANT (v))
1212 if (check_qualified_type (v, type, type_quals)
1213 && comp_except_specs (raises, TYPE_RAISES_EXCEPTIONS (v), 1))
1216 /* Need to build a new variant. */
1217 v = build_variant_type_copy (type);
1218 TYPE_RAISES_EXCEPTIONS (v) = raises;
1222 /* Given a TEMPLATE_TEMPLATE_PARM node T, create a new
1223 BOUND_TEMPLATE_TEMPLATE_PARM bound with NEWARGS as its template
1227 bind_template_template_parm (tree t, tree newargs)
1229 tree decl = TYPE_NAME (t);
1232 t2 = make_aggr_type (BOUND_TEMPLATE_TEMPLATE_PARM);
1233 decl = build_decl (TYPE_DECL, DECL_NAME (decl), NULL_TREE);
1235 /* These nodes have to be created to reflect new TYPE_DECL and template
1237 TEMPLATE_TYPE_PARM_INDEX (t2) = copy_node (TEMPLATE_TYPE_PARM_INDEX (t));
1238 TEMPLATE_PARM_DECL (TEMPLATE_TYPE_PARM_INDEX (t2)) = decl;
1239 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2)
1240 = tree_cons (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t),
1241 newargs, NULL_TREE);
1243 TREE_TYPE (decl) = t2;
1244 TYPE_NAME (t2) = decl;
1245 TYPE_STUB_DECL (t2) = decl;
1247 SET_TYPE_STRUCTURAL_EQUALITY (t2);
1252 /* Called from count_trees via walk_tree. */
1255 count_trees_r (tree *tp, int *walk_subtrees, void *data)
1265 /* Debugging function for measuring the rough complexity of a tree
1269 count_trees (tree t)
1272 cp_walk_tree_without_duplicates (&t, count_trees_r, &n_trees);
1276 /* Called from verify_stmt_tree via walk_tree. */
1279 verify_stmt_tree_r (tree* tp,
1280 int* walk_subtrees ATTRIBUTE_UNUSED ,
1284 htab_t *statements = (htab_t *) data;
1287 if (!STATEMENT_CODE_P (TREE_CODE (t)))
1290 /* If this statement is already present in the hash table, then
1291 there is a circularity in the statement tree. */
1292 gcc_assert (!htab_find (*statements, t));
1294 slot = htab_find_slot (*statements, t, INSERT);
1300 /* Debugging function to check that the statement T has not been
1301 corrupted. For now, this function simply checks that T contains no
1305 verify_stmt_tree (tree t)
1308 statements = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
1309 cp_walk_tree (&t, verify_stmt_tree_r, &statements, NULL);
1310 htab_delete (statements);
1313 /* Check if the type T depends on a type with no linkage and if so, return
1314 it. If RELAXED_P then do not consider a class type declared within
1315 a TREE_PUBLIC function to have no linkage. */
1318 no_linkage_check (tree t, bool relaxed_p)
1322 /* There's no point in checking linkage on template functions; we
1323 can't know their complete types. */
1324 if (processing_template_decl)
1327 switch (TREE_CODE (t))
1332 if (TYPE_PTRMEMFUNC_P (t))
1336 if (!CLASS_TYPE_P (t))
1340 if (TYPE_ANONYMOUS_P (t))
1342 fn = decl_function_context (TYPE_MAIN_DECL (t));
1343 if (fn && (!relaxed_p || !TREE_PUBLIC (fn)))
1349 case REFERENCE_TYPE:
1350 return no_linkage_check (TREE_TYPE (t), relaxed_p);
1354 r = no_linkage_check (TYPE_PTRMEM_POINTED_TO_TYPE (t),
1358 return no_linkage_check (TYPE_PTRMEM_CLASS_TYPE (t), relaxed_p);
1361 r = no_linkage_check (TYPE_METHOD_BASETYPE (t), relaxed_p);
1368 for (parm = TYPE_ARG_TYPES (t);
1369 parm && parm != void_list_node;
1370 parm = TREE_CHAIN (parm))
1372 r = no_linkage_check (TREE_VALUE (parm), relaxed_p);
1376 return no_linkage_check (TREE_TYPE (t), relaxed_p);
1384 #ifdef GATHER_STATISTICS
1385 extern int depth_reached;
1389 cxx_print_statistics (void)
1391 print_search_statistics ();
1392 print_class_statistics ();
1393 #ifdef GATHER_STATISTICS
1394 fprintf (stderr, "maximum template instantiation depth reached: %d\n",
1399 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1400 (which is an ARRAY_TYPE). This counts only elements of the top
1404 array_type_nelts_top (tree type)
1406 return fold_build2 (PLUS_EXPR, sizetype,
1407 array_type_nelts (type),
1411 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1412 (which is an ARRAY_TYPE). This one is a recursive count of all
1413 ARRAY_TYPEs that are clumped together. */
1416 array_type_nelts_total (tree type)
1418 tree sz = array_type_nelts_top (type);
1419 type = TREE_TYPE (type);
1420 while (TREE_CODE (type) == ARRAY_TYPE)
1422 tree n = array_type_nelts_top (type);
1423 sz = fold_build2 (MULT_EXPR, sizetype, sz, n);
1424 type = TREE_TYPE (type);
1429 /* Called from break_out_target_exprs via mapcar. */
1432 bot_manip (tree* tp, int* walk_subtrees, void* data)
1434 splay_tree target_remap = ((splay_tree) data);
1437 if (!TYPE_P (t) && TREE_CONSTANT (t))
1439 /* There can't be any TARGET_EXPRs or their slot variables below
1440 this point. We used to check !TREE_SIDE_EFFECTS, but then we
1441 failed to copy an ADDR_EXPR of the slot VAR_DECL. */
1445 if (TREE_CODE (t) == TARGET_EXPR)
1449 if (TREE_CODE (TREE_OPERAND (t, 1)) == AGGR_INIT_EXPR)
1451 (TREE_TYPE (t), break_out_target_exprs (TREE_OPERAND (t, 1)));
1453 u = build_target_expr_with_type
1454 (break_out_target_exprs (TREE_OPERAND (t, 1)), TREE_TYPE (t));
1456 /* Map the old variable to the new one. */
1457 splay_tree_insert (target_remap,
1458 (splay_tree_key) TREE_OPERAND (t, 0),
1459 (splay_tree_value) TREE_OPERAND (u, 0));
1461 /* Replace the old expression with the new version. */
1463 /* We don't have to go below this point; the recursive call to
1464 break_out_target_exprs will have handled anything below this
1470 /* Make a copy of this node. */
1471 return copy_tree_r (tp, walk_subtrees, NULL);
1474 /* Replace all remapped VAR_DECLs in T with their new equivalents.
1475 DATA is really a splay-tree mapping old variables to new
1479 bot_replace (tree* t,
1480 int* walk_subtrees ATTRIBUTE_UNUSED ,
1483 splay_tree target_remap = ((splay_tree) data);
1485 if (TREE_CODE (*t) == VAR_DECL)
1487 splay_tree_node n = splay_tree_lookup (target_remap,
1488 (splay_tree_key) *t);
1490 *t = (tree) n->value;
1496 /* When we parse a default argument expression, we may create
1497 temporary variables via TARGET_EXPRs. When we actually use the
1498 default-argument expression, we make a copy of the expression, but
1499 we must replace the temporaries with appropriate local versions. */
1502 break_out_target_exprs (tree t)
1504 static int target_remap_count;
1505 static splay_tree target_remap;
1507 if (!target_remap_count++)
1508 target_remap = splay_tree_new (splay_tree_compare_pointers,
1509 /*splay_tree_delete_key_fn=*/NULL,
1510 /*splay_tree_delete_value_fn=*/NULL);
1511 cp_walk_tree (&t, bot_manip, target_remap, NULL);
1512 cp_walk_tree (&t, bot_replace, target_remap, NULL);
1514 if (!--target_remap_count)
1516 splay_tree_delete (target_remap);
1517 target_remap = NULL;
1523 /* Similar to `build_nt', but for template definitions of dependent
1527 build_min_nt (enum tree_code code, ...)
1534 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
1538 t = make_node (code);
1539 length = TREE_CODE_LENGTH (code);
1541 for (i = 0; i < length; i++)
1543 tree x = va_arg (p, tree);
1544 TREE_OPERAND (t, i) = x;
1552 /* Similar to `build', but for template definitions. */
1555 build_min (enum tree_code code, tree tt, ...)
1562 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
1566 t = make_node (code);
1567 length = TREE_CODE_LENGTH (code);
1570 for (i = 0; i < length; i++)
1572 tree x = va_arg (p, tree);
1573 TREE_OPERAND (t, i) = x;
1574 if (x && !TYPE_P (x) && TREE_SIDE_EFFECTS (x))
1575 TREE_SIDE_EFFECTS (t) = 1;
1582 /* Similar to `build', but for template definitions of non-dependent
1583 expressions. NON_DEP is the non-dependent expression that has been
1587 build_min_non_dep (enum tree_code code, tree non_dep, ...)
1594 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
1596 va_start (p, non_dep);
1598 t = make_node (code);
1599 length = TREE_CODE_LENGTH (code);
1600 TREE_TYPE (t) = TREE_TYPE (non_dep);
1601 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (non_dep);
1603 for (i = 0; i < length; i++)
1605 tree x = va_arg (p, tree);
1606 TREE_OPERAND (t, i) = x;
1609 if (code == COMPOUND_EXPR && TREE_CODE (non_dep) != COMPOUND_EXPR)
1610 /* This should not be considered a COMPOUND_EXPR, because it
1611 resolves to an overload. */
1612 COMPOUND_EXPR_OVERLOADED (t) = 1;
1618 /* Similar to `build_call_list', but for template definitions of non-dependent
1619 expressions. NON_DEP is the non-dependent expression that has been
1623 build_min_non_dep_call_list (tree non_dep, tree fn, tree arglist)
1625 tree t = build_nt_call_list (fn, arglist);
1626 TREE_TYPE (t) = TREE_TYPE (non_dep);
1627 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (non_dep);
1632 get_type_decl (tree t)
1634 if (TREE_CODE (t) == TYPE_DECL)
1637 return TYPE_STUB_DECL (t);
1638 gcc_assert (t == error_mark_node);
1642 /* Returns the namespace that contains DECL, whether directly or
1646 decl_namespace_context (tree decl)
1650 if (TREE_CODE (decl) == NAMESPACE_DECL)
1652 else if (TYPE_P (decl))
1653 decl = CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl));
1655 decl = CP_DECL_CONTEXT (decl);
1659 /* Returns true if decl is within an anonymous namespace, however deeply
1660 nested, or false otherwise. */
1663 decl_anon_ns_mem_p (const_tree decl)
1667 if (decl == NULL_TREE || decl == error_mark_node)
1669 if (TREE_CODE (decl) == NAMESPACE_DECL
1670 && DECL_NAME (decl) == NULL_TREE)
1672 /* Classes and namespaces inside anonymous namespaces have
1673 TREE_PUBLIC == 0, so we can shortcut the search. */
1674 else if (TYPE_P (decl))
1675 return (TREE_PUBLIC (TYPE_NAME (decl)) == 0);
1676 else if (TREE_CODE (decl) == NAMESPACE_DECL)
1677 return (TREE_PUBLIC (decl) == 0);
1679 decl = DECL_CONTEXT (decl);
1683 /* Return truthvalue of whether T1 is the same tree structure as T2.
1684 Return 1 if they are the same. Return 0 if they are different. */
1687 cp_tree_equal (tree t1, tree t2)
1689 enum tree_code code1, code2;
1696 for (code1 = TREE_CODE (t1);
1697 code1 == NOP_EXPR || code1 == CONVERT_EXPR
1698 || code1 == NON_LVALUE_EXPR;
1699 code1 = TREE_CODE (t1))
1700 t1 = TREE_OPERAND (t1, 0);
1701 for (code2 = TREE_CODE (t2);
1702 code2 == NOP_EXPR || code2 == CONVERT_EXPR
1703 || code1 == NON_LVALUE_EXPR;
1704 code2 = TREE_CODE (t2))
1705 t2 = TREE_OPERAND (t2, 0);
1707 /* They might have become equal now. */
1717 return TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
1718 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2);
1721 return REAL_VALUES_EQUAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
1724 return TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
1725 && !memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
1726 TREE_STRING_LENGTH (t1));
1729 return cp_tree_equal (TREE_REALPART (t1), TREE_REALPART (t2))
1730 && cp_tree_equal (TREE_IMAGPART (t1), TREE_IMAGPART (t2));
1733 /* We need to do this when determining whether or not two
1734 non-type pointer to member function template arguments
1736 if (!(same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
1737 /* The first operand is RTL. */
1738 && TREE_OPERAND (t1, 0) == TREE_OPERAND (t2, 0)))
1740 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1743 if (!cp_tree_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2)))
1745 if (!cp_tree_equal (TREE_VALUE (t1), TREE_VALUE (t2)))
1747 return cp_tree_equal (TREE_CHAIN (t1), TREE_CHAIN (t2));
1750 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1755 call_expr_arg_iterator iter1, iter2;
1756 if (!cp_tree_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2)))
1758 for (arg1 = first_call_expr_arg (t1, &iter1),
1759 arg2 = first_call_expr_arg (t2, &iter2);
1761 arg1 = next_call_expr_arg (&iter1),
1762 arg2 = next_call_expr_arg (&iter2))
1763 if (!cp_tree_equal (arg1, arg2))
1765 return (arg1 || arg2);
1770 tree o1 = TREE_OPERAND (t1, 0);
1771 tree o2 = TREE_OPERAND (t2, 0);
1773 /* Special case: if either target is an unallocated VAR_DECL,
1774 it means that it's going to be unified with whatever the
1775 TARGET_EXPR is really supposed to initialize, so treat it
1776 as being equivalent to anything. */
1777 if (TREE_CODE (o1) == VAR_DECL && DECL_NAME (o1) == NULL_TREE
1778 && !DECL_RTL_SET_P (o1))
1780 else if (TREE_CODE (o2) == VAR_DECL && DECL_NAME (o2) == NULL_TREE
1781 && !DECL_RTL_SET_P (o2))
1783 else if (!cp_tree_equal (o1, o2))
1786 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1789 case WITH_CLEANUP_EXPR:
1790 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1792 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
1795 if (TREE_OPERAND (t1, 1) != TREE_OPERAND (t2, 1))
1797 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1804 case IDENTIFIER_NODE:
1809 return (BASELINK_BINFO (t1) == BASELINK_BINFO (t2)
1810 && BASELINK_ACCESS_BINFO (t1) == BASELINK_ACCESS_BINFO (t2)
1811 && cp_tree_equal (BASELINK_FUNCTIONS (t1),
1812 BASELINK_FUNCTIONS (t2)));
1814 case TEMPLATE_PARM_INDEX:
1815 return (TEMPLATE_PARM_IDX (t1) == TEMPLATE_PARM_IDX (t2)
1816 && TEMPLATE_PARM_LEVEL (t1) == TEMPLATE_PARM_LEVEL (t2)
1817 && same_type_p (TREE_TYPE (TEMPLATE_PARM_DECL (t1)),
1818 TREE_TYPE (TEMPLATE_PARM_DECL (t2))));
1820 case TEMPLATE_ID_EXPR:
1825 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1827 vec1 = TREE_OPERAND (t1, 1);
1828 vec2 = TREE_OPERAND (t2, 1);
1831 return !vec1 && !vec2;
1833 if (TREE_VEC_LENGTH (vec1) != TREE_VEC_LENGTH (vec2))
1836 for (ix = TREE_VEC_LENGTH (vec1); ix--;)
1837 if (!cp_tree_equal (TREE_VEC_ELT (vec1, ix),
1838 TREE_VEC_ELT (vec2, ix)))
1847 tree o1 = TREE_OPERAND (t1, 0);
1848 tree o2 = TREE_OPERAND (t2, 0);
1850 if (TREE_CODE (o1) != TREE_CODE (o2))
1853 return same_type_p (o1, o2);
1855 return cp_tree_equal (o1, o2);
1860 tree t1_op1, t2_op1;
1862 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1865 t1_op1 = TREE_OPERAND (t1, 1);
1866 t2_op1 = TREE_OPERAND (t2, 1);
1867 if (TREE_CODE (t1_op1) != TREE_CODE (t2_op1))
1870 return cp_tree_equal (TREE_OPERAND (t1, 2), TREE_OPERAND (t2, 2));
1874 /* Two pointer-to-members are the same if they point to the same
1875 field or function in the same class. */
1876 if (PTRMEM_CST_MEMBER (t1) != PTRMEM_CST_MEMBER (t2))
1879 return same_type_p (PTRMEM_CST_CLASS (t1), PTRMEM_CST_CLASS (t2));
1882 if (OVL_FUNCTION (t1) != OVL_FUNCTION (t2))
1884 return cp_tree_equal (OVL_CHAIN (t1), OVL_CHAIN (t2));
1887 if (TRAIT_EXPR_KIND (t1) != TRAIT_EXPR_KIND (t2))
1889 return same_type_p (TRAIT_EXPR_TYPE1 (t1), TRAIT_EXPR_TYPE1 (t2))
1890 && same_type_p (TRAIT_EXPR_TYPE2 (t1), TRAIT_EXPR_TYPE2 (t2));
1896 switch (TREE_CODE_CLASS (code1))
1900 case tcc_comparison:
1901 case tcc_expression:
1908 n = TREE_OPERAND_LENGTH (t1);
1909 if (TREE_CODE_CLASS (code1) == tcc_vl_exp
1910 && n != TREE_OPERAND_LENGTH (t2))
1913 for (i = 0; i < n; ++i)
1914 if (!cp_tree_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i)))
1921 return same_type_p (t1, t2);
1925 /* We can get here with --disable-checking. */
1929 /* The type of ARG when used as an lvalue. */
1932 lvalue_type (tree arg)
1934 tree type = TREE_TYPE (arg);
1938 /* The type of ARG for printing error messages; denote lvalues with
1942 error_type (tree arg)
1944 tree type = TREE_TYPE (arg);
1946 if (TREE_CODE (type) == ARRAY_TYPE)
1948 else if (TREE_CODE (type) == ERROR_MARK)
1950 else if (real_lvalue_p (arg))
1951 type = build_reference_type (lvalue_type (arg));
1952 else if (IS_AGGR_TYPE (type))
1953 type = lvalue_type (arg);
1958 /* Does FUNCTION use a variable-length argument list? */
1961 varargs_function_p (const_tree function)
1963 const_tree parm = TYPE_ARG_TYPES (TREE_TYPE (function));
1964 for (; parm; parm = TREE_CHAIN (parm))
1965 if (TREE_VALUE (parm) == void_type_node)
1970 /* Returns 1 if decl is a member of a class. */
1973 member_p (const_tree decl)
1975 const_tree const ctx = DECL_CONTEXT (decl);
1976 return (ctx && TYPE_P (ctx));
1979 /* Create a placeholder for member access where we don't actually have an
1980 object that the access is against. */
1983 build_dummy_object (tree type)
1985 tree decl = build1 (NOP_EXPR, build_pointer_type (type), void_zero_node);
1986 return build_indirect_ref (decl, NULL);
1989 /* We've gotten a reference to a member of TYPE. Return *this if appropriate,
1990 or a dummy object otherwise. If BINFOP is non-0, it is filled with the
1991 binfo path from current_class_type to TYPE, or 0. */
1994 maybe_dummy_object (tree type, tree* binfop)
1999 if (current_class_type
2000 && (binfo = lookup_base (current_class_type, type,
2001 ba_unique | ba_quiet, NULL)))
2002 context = current_class_type;
2005 /* Reference from a nested class member function. */
2007 binfo = TYPE_BINFO (type);
2013 if (current_class_ref && context == current_class_type
2014 /* Kludge: Make sure that current_class_type is actually
2015 correct. It might not be if we're in the middle of
2016 tsubst_default_argument. */
2017 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref)),
2018 current_class_type))
2019 decl = current_class_ref;
2021 decl = build_dummy_object (context);
2026 /* Returns 1 if OB is a placeholder object, or a pointer to one. */
2029 is_dummy_object (const_tree ob)
2031 if (TREE_CODE (ob) == INDIRECT_REF)
2032 ob = TREE_OPERAND (ob, 0);
2033 return (TREE_CODE (ob) == NOP_EXPR
2034 && TREE_OPERAND (ob, 0) == void_zero_node);
2037 /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */
2040 pod_type_p (const_tree t)
2042 /* This CONST_CAST is okay because strip_array_types returns it's
2043 argument unmodified and we assign it to a const_tree. */
2044 t = strip_array_types (CONST_CAST_TREE(t));
2046 if (t == error_mark_node)
2048 if (INTEGRAL_TYPE_P (t))
2049 return 1; /* integral, character or enumeral type */
2050 if (FLOAT_TYPE_P (t))
2053 return 1; /* pointer to non-member */
2054 if (TYPE_PTR_TO_MEMBER_P (t))
2055 return 1; /* pointer to member */
2057 if (TREE_CODE (t) == VECTOR_TYPE)
2058 return 1; /* vectors are (small) arrays of scalars */
2060 if (! CLASS_TYPE_P (t))
2061 return 0; /* other non-class type (reference or function) */
2062 if (CLASSTYPE_NON_POD_P (t))
2067 /* Nonzero iff type T is a class template implicit specialization. */
2070 class_tmpl_impl_spec_p (const_tree t)
2072 return CLASS_TYPE_P (t) && CLASSTYPE_TEMPLATE_INSTANTIATION (t);
2075 /* Returns 1 iff zero initialization of type T means actually storing
2079 zero_init_p (const_tree t)
2081 /* This CONST_CAST is okay because strip_array_types returns it's
2082 argument unmodified and we assign it to a const_tree. */
2083 t = strip_array_types (CONST_CAST_TREE(t));
2085 if (t == error_mark_node)
2088 /* NULL pointers to data members are initialized with -1. */
2089 if (TYPE_PTRMEM_P (t))
2092 /* Classes that contain types that can't be zero-initialized, cannot
2093 be zero-initialized themselves. */
2094 if (CLASS_TYPE_P (t) && CLASSTYPE_NON_ZERO_INIT_P (t))
2100 /* Table of valid C++ attributes. */
2101 const struct attribute_spec cxx_attribute_table[] =
2103 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
2104 { "java_interface", 0, 0, false, false, false, handle_java_interface_attribute },
2105 { "com_interface", 0, 0, false, false, false, handle_com_interface_attribute },
2106 { "init_priority", 1, 1, true, false, false, handle_init_priority_attribute },
2107 { NULL, 0, 0, false, false, false, NULL }
2110 /* Handle a "java_interface" attribute; arguments as in
2111 struct attribute_spec.handler. */
2113 handle_java_interface_attribute (tree* node,
2115 tree args ATTRIBUTE_UNUSED ,
2120 || !CLASS_TYPE_P (*node)
2121 || !TYPE_FOR_JAVA (*node))
2123 error ("%qE attribute can only be applied to Java class definitions",
2125 *no_add_attrs = true;
2128 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
2129 *node = build_variant_type_copy (*node);
2130 TYPE_JAVA_INTERFACE (*node) = 1;
2135 /* Handle a "com_interface" attribute; arguments as in
2136 struct attribute_spec.handler. */
2138 handle_com_interface_attribute (tree* node,
2140 tree args ATTRIBUTE_UNUSED ,
2141 int flags ATTRIBUTE_UNUSED ,
2146 *no_add_attrs = true;
2149 || !CLASS_TYPE_P (*node)
2150 || *node != TYPE_MAIN_VARIANT (*node))
2152 warning (OPT_Wattributes, "%qE attribute can only be applied "
2153 "to class definitions", name);
2158 warning (0, "%qE is obsolete; g++ vtables are now COM-compatible by default",
2164 /* Handle an "init_priority" attribute; arguments as in
2165 struct attribute_spec.handler. */
2167 handle_init_priority_attribute (tree* node,
2170 int flags ATTRIBUTE_UNUSED ,
2173 tree initp_expr = TREE_VALUE (args);
2175 tree type = TREE_TYPE (decl);
2178 STRIP_NOPS (initp_expr);
2180 if (!initp_expr || TREE_CODE (initp_expr) != INTEGER_CST)
2182 error ("requested init_priority is not an integer constant");
2183 *no_add_attrs = true;
2187 pri = TREE_INT_CST_LOW (initp_expr);
2189 type = strip_array_types (type);
2191 if (decl == NULL_TREE
2192 || TREE_CODE (decl) != VAR_DECL
2193 || !TREE_STATIC (decl)
2194 || DECL_EXTERNAL (decl)
2195 || (TREE_CODE (type) != RECORD_TYPE
2196 && TREE_CODE (type) != UNION_TYPE)
2197 /* Static objects in functions are initialized the
2198 first time control passes through that
2199 function. This is not precise enough to pin down an
2200 init_priority value, so don't allow it. */
2201 || current_function_decl)
2203 error ("can only use %qE attribute on file-scope definitions "
2204 "of objects of class type", name);
2205 *no_add_attrs = true;
2209 if (pri > MAX_INIT_PRIORITY || pri <= 0)
2211 error ("requested init_priority is out of range");
2212 *no_add_attrs = true;
2216 /* Check for init_priorities that are reserved for
2217 language and runtime support implementations.*/
2218 if (pri <= MAX_RESERVED_INIT_PRIORITY)
2221 (0, "requested init_priority is reserved for internal use");
2224 if (SUPPORTS_INIT_PRIORITY)
2226 SET_DECL_INIT_PRIORITY (decl, pri);
2227 DECL_HAS_INIT_PRIORITY_P (decl) = 1;
2232 error ("%qE attribute is not supported on this platform", name);
2233 *no_add_attrs = true;
2238 /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the
2239 thing pointed to by the constant. */
2242 make_ptrmem_cst (tree type, tree member)
2244 tree ptrmem_cst = make_node (PTRMEM_CST);
2245 TREE_TYPE (ptrmem_cst) = type;
2246 PTRMEM_CST_MEMBER (ptrmem_cst) = member;
2250 /* Build a variant of TYPE that has the indicated ATTRIBUTES. May
2251 return an existing type if an appropriate type already exists. */
2254 cp_build_type_attribute_variant (tree type, tree attributes)
2258 new_type = build_type_attribute_variant (type, attributes);
2259 if (TREE_CODE (new_type) == FUNCTION_TYPE
2260 && (TYPE_RAISES_EXCEPTIONS (new_type)
2261 != TYPE_RAISES_EXCEPTIONS (type)))
2262 new_type = build_exception_variant (new_type,
2263 TYPE_RAISES_EXCEPTIONS (type));
2265 /* Making a new main variant of a class type is broken. */
2266 gcc_assert (!CLASS_TYPE_P (type) || new_type == type);
2271 /* Return TRUE if TYPE1 and TYPE2 are identical for type hashing purposes.
2272 Called only after doing all language independent checks. Only
2273 to check TYPE_RAISES_EXCEPTIONS for FUNCTION_TYPE, the rest is already
2274 compared in type_hash_eq. */
2277 cxx_type_hash_eq (const_tree typea, const_tree typeb)
2279 gcc_assert (TREE_CODE (typea) == FUNCTION_TYPE);
2281 return comp_except_specs (TYPE_RAISES_EXCEPTIONS (typea),
2282 TYPE_RAISES_EXCEPTIONS (typeb), 1);
2285 /* Apply FUNC to all language-specific sub-trees of TP in a pre-order
2286 traversal. Called from walk_tree. */
2289 cp_walk_subtrees (tree *tp, int *walk_subtrees_p, walk_tree_fn func,
2290 void *data, struct pointer_set_t *pset)
2292 enum tree_code code = TREE_CODE (*tp);
2295 #define WALK_SUBTREE(NODE) \
2298 result = cp_walk_tree (&(NODE), func, data, pset); \
2299 if (result) goto out; \
2303 /* Not one of the easy cases. We must explicitly go through the
2309 case TEMPLATE_TEMPLATE_PARM:
2310 case BOUND_TEMPLATE_TEMPLATE_PARM:
2311 case UNBOUND_CLASS_TEMPLATE:
2312 case TEMPLATE_PARM_INDEX:
2313 case TEMPLATE_TYPE_PARM:
2316 /* None of these have subtrees other than those already walked
2318 *walk_subtrees_p = 0;
2322 WALK_SUBTREE (BASELINK_FUNCTIONS (*tp));
2323 *walk_subtrees_p = 0;
2327 WALK_SUBTREE (TREE_TYPE (*tp));
2328 *walk_subtrees_p = 0;
2332 WALK_SUBTREE (TREE_PURPOSE (*tp));
2336 WALK_SUBTREE (OVL_FUNCTION (*tp));
2337 WALK_SUBTREE (OVL_CHAIN (*tp));
2338 *walk_subtrees_p = 0;
2342 if (TYPE_PTRMEMFUNC_P (*tp))
2343 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (*tp));
2346 case TYPE_ARGUMENT_PACK:
2347 case NONTYPE_ARGUMENT_PACK:
2349 tree args = ARGUMENT_PACK_ARGS (*tp);
2350 int i, len = TREE_VEC_LENGTH (args);
2351 for (i = 0; i < len; i++)
2352 WALK_SUBTREE (TREE_VEC_ELT (args, i));
2356 case TYPE_PACK_EXPANSION:
2357 WALK_SUBTREE (TREE_TYPE (*tp));
2358 *walk_subtrees_p = 0;
2361 case EXPR_PACK_EXPANSION:
2362 WALK_SUBTREE (TREE_OPERAND (*tp, 0));
2363 *walk_subtrees_p = 0;
2367 if (TREE_TYPE (*tp))
2368 WALK_SUBTREE (TREE_TYPE (*tp));
2372 for (i = 0; i < TREE_CODE_LENGTH (TREE_CODE (*tp)); ++i)
2373 WALK_SUBTREE (TREE_OPERAND (*tp, i));
2375 *walk_subtrees_p = 0;
2379 WALK_SUBTREE (TRAIT_EXPR_TYPE1 (*tp));
2380 WALK_SUBTREE (TRAIT_EXPR_TYPE2 (*tp));
2381 *walk_subtrees_p = 0;
2385 WALK_SUBTREE (DECLTYPE_TYPE_EXPR (*tp));
2386 *walk_subtrees_p = 0;
2394 /* We didn't find what we were looking for. */
2401 /* Like save_expr, but for C++. */
2404 cp_save_expr (tree expr)
2406 /* There is no reason to create a SAVE_EXPR within a template; if
2407 needed, we can create the SAVE_EXPR when instantiating the
2408 template. Furthermore, the middle-end cannot handle C++-specific
2410 if (processing_template_decl)
2412 return save_expr (expr);
2415 /* Initialize tree.c. */
2420 list_hash_table = htab_create_ggc (31, list_hash, list_hash_eq, NULL);
2423 /* Returns the kind of special function that DECL (a FUNCTION_DECL)
2424 is. Note that sfk_none is zero, so this function can be used as a
2425 predicate to test whether or not DECL is a special function. */
2427 special_function_kind
2428 special_function_p (const_tree decl)
2430 /* Rather than doing all this stuff with magic names, we should
2431 probably have a field of type `special_function_kind' in
2432 DECL_LANG_SPECIFIC. */
2433 if (DECL_COPY_CONSTRUCTOR_P (decl))
2434 return sfk_copy_constructor;
2435 if (DECL_CONSTRUCTOR_P (decl))
2436 return sfk_constructor;
2437 if (DECL_OVERLOADED_OPERATOR_P (decl) == NOP_EXPR)
2438 return sfk_assignment_operator;
2439 if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl))
2440 return sfk_destructor;
2441 if (DECL_COMPLETE_DESTRUCTOR_P (decl))
2442 return sfk_complete_destructor;
2443 if (DECL_BASE_DESTRUCTOR_P (decl))
2444 return sfk_base_destructor;
2445 if (DECL_DELETING_DESTRUCTOR_P (decl))
2446 return sfk_deleting_destructor;
2447 if (DECL_CONV_FN_P (decl))
2448 return sfk_conversion;
2453 /* Returns nonzero if TYPE is a character type, including wchar_t. */
2456 char_type_p (tree type)
2458 return (same_type_p (type, char_type_node)
2459 || same_type_p (type, unsigned_char_type_node)
2460 || same_type_p (type, signed_char_type_node)
2461 || same_type_p (type, wchar_type_node));
2464 /* Returns the kind of linkage associated with the indicated DECL. Th
2465 value returned is as specified by the language standard; it is
2466 independent of implementation details regarding template
2467 instantiation, etc. For example, it is possible that a declaration
2468 to which this function assigns external linkage would not show up
2469 as a global symbol when you run `nm' on the resulting object file. */
2472 decl_linkage (tree decl)
2474 /* This function doesn't attempt to calculate the linkage from first
2475 principles as given in [basic.link]. Instead, it makes use of
2476 the fact that we have already set TREE_PUBLIC appropriately, and
2477 then handles a few special cases. Ideally, we would calculate
2478 linkage first, and then transform that into a concrete
2481 /* Things that don't have names have no linkage. */
2482 if (!DECL_NAME (decl))
2485 /* Things that are TREE_PUBLIC have external linkage. */
2486 if (TREE_PUBLIC (decl))
2489 if (TREE_CODE (decl) == NAMESPACE_DECL)
2492 /* Linkage of a CONST_DECL depends on the linkage of the enumeration
2494 if (TREE_CODE (decl) == CONST_DECL)
2495 return decl_linkage (TYPE_NAME (TREE_TYPE (decl)));
2497 /* Some things that are not TREE_PUBLIC have external linkage, too.
2498 For example, on targets that don't have weak symbols, we make all
2499 template instantiations have internal linkage (in the object
2500 file), but the symbols should still be treated as having external
2501 linkage from the point of view of the language. */
2502 if (TREE_CODE (decl) != TYPE_DECL && DECL_LANG_SPECIFIC (decl)
2503 && DECL_COMDAT (decl))
2506 /* Things in local scope do not have linkage, if they don't have
2508 if (decl_function_context (decl))
2511 /* Members of the anonymous namespace also have TREE_PUBLIC unset, but
2512 are considered to have external linkage for language purposes. DECLs
2513 really meant to have internal linkage have DECL_THIS_STATIC set. */
2514 if (TREE_CODE (decl) == TYPE_DECL
2515 || ((TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == FUNCTION_DECL)
2516 && !DECL_THIS_STATIC (decl)))
2519 /* Everything else has internal linkage. */
2523 /* EXP is an expression that we want to pre-evaluate. Returns (in
2524 *INITP) an expression that will perform the pre-evaluation. The
2525 value returned by this function is a side-effect free expression
2526 equivalent to the pre-evaluated expression. Callers must ensure
2527 that *INITP is evaluated before EXP. */
2530 stabilize_expr (tree exp, tree* initp)
2534 if (!TREE_SIDE_EFFECTS (exp))
2535 init_expr = NULL_TREE;
2536 else if (!real_lvalue_p (exp)
2537 || !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (exp)))
2539 init_expr = get_target_expr (exp);
2540 exp = TARGET_EXPR_SLOT (init_expr);
2544 exp = build_unary_op (ADDR_EXPR, exp, 1);
2545 init_expr = get_target_expr (exp);
2546 exp = TARGET_EXPR_SLOT (init_expr);
2547 exp = build_indirect_ref (exp, 0);
2551 gcc_assert (!TREE_SIDE_EFFECTS (exp));
2555 /* Add NEW, an expression whose value we don't care about, after the
2556 similar expression ORIG. */
2559 add_stmt_to_compound (tree orig, tree new)
2561 if (!new || !TREE_SIDE_EFFECTS (new))
2563 if (!orig || !TREE_SIDE_EFFECTS (orig))
2565 return build2 (COMPOUND_EXPR, void_type_node, orig, new);
2568 /* Like stabilize_expr, but for a call whose arguments we want to
2569 pre-evaluate. CALL is modified in place to use the pre-evaluated
2570 arguments, while, upon return, *INITP contains an expression to
2571 compute the arguments. */
2574 stabilize_call (tree call, tree *initp)
2576 tree inits = NULL_TREE;
2578 int nargs = call_expr_nargs (call);
2580 if (call == error_mark_node)
2583 gcc_assert (TREE_CODE (call) == CALL_EXPR);
2585 for (i = 0; i < nargs; i++)
2588 CALL_EXPR_ARG (call, i) =
2589 stabilize_expr (CALL_EXPR_ARG (call, i), &init);
2590 inits = add_stmt_to_compound (inits, init);
2596 /* Like stabilize_expr, but for an AGGR_INIT_EXPR whose arguments we want
2597 to pre-evaluate. CALL is modified in place to use the pre-evaluated
2598 arguments, while, upon return, *INITP contains an expression to
2599 compute the arguments. */
2602 stabilize_aggr_init (tree call, tree *initp)
2604 tree inits = NULL_TREE;
2606 int nargs = aggr_init_expr_nargs (call);
2608 if (call == error_mark_node)
2611 gcc_assert (TREE_CODE (call) == AGGR_INIT_EXPR);
2613 for (i = 0; i < nargs; i++)
2616 AGGR_INIT_EXPR_ARG (call, i) =
2617 stabilize_expr (AGGR_INIT_EXPR_ARG (call, i), &init);
2618 inits = add_stmt_to_compound (inits, init);
2624 /* Like stabilize_expr, but for an initialization.
2626 If the initialization is for an object of class type, this function
2627 takes care not to introduce additional temporaries.
2629 Returns TRUE iff the expression was successfully pre-evaluated,
2630 i.e., if INIT is now side-effect free, except for, possible, a
2631 single call to a constructor. */
2634 stabilize_init (tree init, tree *initp)
2640 if (t == error_mark_node)
2643 if (TREE_CODE (t) == INIT_EXPR
2644 && TREE_CODE (TREE_OPERAND (t, 1)) != TARGET_EXPR)
2646 TREE_OPERAND (t, 1) = stabilize_expr (TREE_OPERAND (t, 1), initp);
2650 if (TREE_CODE (t) == INIT_EXPR)
2651 t = TREE_OPERAND (t, 1);
2652 if (TREE_CODE (t) == TARGET_EXPR)
2653 t = TARGET_EXPR_INITIAL (t);
2654 if (TREE_CODE (t) == COMPOUND_EXPR)
2656 if (TREE_CODE (t) == CONSTRUCTOR
2657 && EMPTY_CONSTRUCTOR_P (t))
2658 /* Default-initialization. */
2661 /* If the initializer is a COND_EXPR, we can't preevaluate
2663 if (TREE_CODE (t) == COND_EXPR)
2666 if (TREE_CODE (t) == CALL_EXPR)
2668 stabilize_call (t, initp);
2672 if (TREE_CODE (t) == AGGR_INIT_EXPR)
2674 stabilize_aggr_init (t, initp);
2678 /* The initialization is being performed via a bitwise copy -- and
2679 the item copied may have side effects. */
2680 return TREE_SIDE_EFFECTS (init);
2683 /* Like "fold", but should be used whenever we might be processing the
2684 body of a template. */
2687 fold_if_not_in_template (tree expr)
2689 /* In the body of a template, there is never any need to call
2690 "fold". We will call fold later when actually instantiating the
2691 template. Integral constant expressions in templates will be
2692 evaluated via fold_non_dependent_expr, as necessary. */
2693 if (processing_template_decl)
2696 /* Fold C++ front-end specific tree codes. */
2697 if (TREE_CODE (expr) == UNARY_PLUS_EXPR)
2698 return fold_convert (TREE_TYPE (expr), TREE_OPERAND (expr, 0));
2703 /* Returns true if a cast to TYPE may appear in an integral constant
2707 cast_valid_in_integral_constant_expression_p (tree type)
2709 return (INTEGRAL_OR_ENUMERATION_TYPE_P (type)
2710 || dependent_type_p (type)
2711 || type == error_mark_node);
2715 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
2716 /* Complain that some language-specific thing hanging off a tree
2717 node has been accessed improperly. */
2720 lang_check_failed (const char* file, int line, const char* function)
2722 internal_error ("lang_* check: failed in %s, at %s:%d",
2723 function, trim_filename (file), line);
2725 #endif /* ENABLE_TREE_CHECKING */
2727 #include "gt-cp-tree.h"