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 ? TREE_OPERAND (ref, 1)
165 : TREE_OPERAND (ref, 0),
166 treat_class_rvalues_as_lvalues);
167 op2_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 2),
168 treat_class_rvalues_as_lvalues);
175 return lvalue_p_1 (TREE_OPERAND (ref, 1),
176 treat_class_rvalues_as_lvalues);
179 return treat_class_rvalues_as_lvalues ? clk_class : clk_none;
182 return (treat_class_rvalues_as_lvalues
183 && CLASS_TYPE_P (TREE_TYPE (ref))
184 ? clk_class : clk_none);
187 /* Any class-valued call would be wrapped in a TARGET_EXPR. */
191 /* All functions (except non-static-member functions) are
193 return (DECL_NONSTATIC_MEMBER_FUNCTION_P (ref)
194 ? clk_none : clk_ordinary);
196 case NON_DEPENDENT_EXPR:
197 /* We must consider NON_DEPENDENT_EXPRs to be lvalues so that
198 things like "&E" where "E" is an expression with a
199 non-dependent type work. It is safe to be lenient because an
200 error will be issued when the template is instantiated if "E"
208 /* If one operand is not an lvalue at all, then this expression is
210 if (!op1_lvalue_kind || !op2_lvalue_kind)
213 /* Otherwise, it's an lvalue, and it has all the odd properties
214 contributed by either operand. */
215 op1_lvalue_kind = op1_lvalue_kind | op2_lvalue_kind;
216 /* It's not an ordinary lvalue if it involves either a bit-field or
218 if ((op1_lvalue_kind & ~clk_ordinary) != clk_none)
219 op1_lvalue_kind &= ~clk_ordinary;
220 return op1_lvalue_kind;
223 /* Returns the kind of lvalue that REF is, in the sense of
224 [basic.lval]. This function should really be named lvalue_p; it
225 computes the C++ definition of lvalue. */
228 real_lvalue_p (const_tree ref)
230 return lvalue_p_1 (ref,
231 /*treat_class_rvalues_as_lvalues=*/0);
234 /* This differs from real_lvalue_p in that class rvalues are
235 considered lvalues. */
238 lvalue_p (const_tree ref)
241 (lvalue_p_1 (ref, /*class rvalue ok*/ 1) != clk_none);
244 /* Test whether DECL is a builtin that may appear in a
245 constant-expression. */
248 builtin_valid_in_constant_expr_p (const_tree decl)
250 /* At present BUILT_IN_CONSTANT_P is the only builtin we're allowing
251 in constant-expressions. We may want to add other builtins later. */
252 return DECL_IS_BUILTIN_CONSTANT_P (decl);
255 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
258 build_target_expr (tree decl, tree value)
262 t = build4 (TARGET_EXPR, TREE_TYPE (decl), decl, value,
263 cxx_maybe_build_cleanup (decl), NULL_TREE);
264 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
265 ignore the TARGET_EXPR. If there really turn out to be no
266 side-effects, then the optimizer should be able to get rid of
267 whatever code is generated anyhow. */
268 TREE_SIDE_EFFECTS (t) = 1;
273 /* Return an undeclared local temporary of type TYPE for use in building a
277 build_local_temp (tree type)
279 tree slot = build_decl (VAR_DECL, NULL_TREE, type);
280 DECL_ARTIFICIAL (slot) = 1;
281 DECL_IGNORED_P (slot) = 1;
282 DECL_CONTEXT (slot) = current_function_decl;
283 layout_decl (slot, 0);
287 /* Set various status flags when building an AGGR_INIT_EXPR object T. */
290 process_aggr_init_operands (tree t)
294 side_effects = TREE_SIDE_EFFECTS (t);
298 n = TREE_OPERAND_LENGTH (t);
299 for (i = 1; i < n; i++)
301 tree op = TREE_OPERAND (t, i);
302 if (op && TREE_SIDE_EFFECTS (op))
309 TREE_SIDE_EFFECTS (t) = side_effects;
312 /* Build an AGGR_INIT_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE,
313 FN, and SLOT. NARGS is the number of call arguments which are specified
314 as a tree array ARGS. */
317 build_aggr_init_array (tree return_type, tree fn, tree slot, int nargs,
323 t = build_vl_exp (AGGR_INIT_EXPR, nargs + 3);
324 TREE_TYPE (t) = return_type;
325 AGGR_INIT_EXPR_FN (t) = fn;
326 AGGR_INIT_EXPR_SLOT (t) = slot;
327 for (i = 0; i < nargs; i++)
328 AGGR_INIT_EXPR_ARG (t, i) = args[i];
329 process_aggr_init_operands (t);
333 /* INIT is a CALL_EXPR or AGGR_INIT_EXPR which needs info about its
334 target. TYPE is the type that this initialization should appear to
337 Build an encapsulation of the initialization to perform
338 and return it so that it can be processed by language-independent
339 and language-specific expression expanders. */
342 build_cplus_new (tree type, tree init)
349 /* Make sure that we're not trying to create an instance of an
351 abstract_virtuals_error (NULL_TREE, type);
353 if (TREE_CODE (init) == CALL_EXPR)
354 fn = CALL_EXPR_FN (init);
355 else if (TREE_CODE (init) == AGGR_INIT_EXPR)
356 fn = AGGR_INIT_EXPR_FN (init);
358 return convert (type, init);
360 is_ctor = (TREE_CODE (fn) == ADDR_EXPR
361 && TREE_CODE (TREE_OPERAND (fn, 0)) == FUNCTION_DECL
362 && DECL_CONSTRUCTOR_P (TREE_OPERAND (fn, 0)));
364 slot = build_local_temp (type);
366 /* We split the CALL_EXPR into its function and its arguments here.
367 Then, in expand_expr, we put them back together. The reason for
368 this is that this expression might be a default argument
369 expression. In that case, we need a new temporary every time the
370 expression is used. That's what break_out_target_exprs does; it
371 replaces every AGGR_INIT_EXPR with a copy that uses a fresh
372 temporary slot. Then, expand_expr builds up a call-expression
373 using the new slot. */
375 /* If we don't need to use a constructor to create an object of this
376 type, don't mess with AGGR_INIT_EXPR. */
377 if (is_ctor || TREE_ADDRESSABLE (type))
379 if (TREE_CODE(init) == CALL_EXPR)
380 rval = build_aggr_init_array (void_type_node, fn, slot,
381 call_expr_nargs (init),
382 CALL_EXPR_ARGP (init));
384 rval = build_aggr_init_array (void_type_node, fn, slot,
385 aggr_init_expr_nargs (init),
386 AGGR_INIT_EXPR_ARGP (init));
387 TREE_SIDE_EFFECTS (rval) = 1;
388 AGGR_INIT_VIA_CTOR_P (rval) = is_ctor;
393 rval = build_target_expr (slot, rval);
394 TARGET_EXPR_IMPLICIT_P (rval) = 1;
399 /* Build a TARGET_EXPR using INIT to initialize a new temporary of the
403 build_target_expr_with_type (tree init, tree type)
405 gcc_assert (!VOID_TYPE_P (type));
407 if (TREE_CODE (init) == TARGET_EXPR)
409 else if (CLASS_TYPE_P (type) && !TYPE_HAS_TRIVIAL_INIT_REF (type)
410 && TREE_CODE (init) != COND_EXPR
411 && TREE_CODE (init) != CONSTRUCTOR
412 && TREE_CODE (init) != VA_ARG_EXPR)
413 /* We need to build up a copy constructor call. COND_EXPR is a special
414 case because we already have copies on the arms and we don't want
415 another one here. A CONSTRUCTOR is aggregate initialization, which
416 is handled separately. A VA_ARG_EXPR is magic creation of an
417 aggregate; there's no additional work to be done. */
418 return force_rvalue (init);
420 return force_target_expr (type, init);
423 /* Like the above function, but without the checking. This function should
424 only be used by code which is deliberately trying to subvert the type
425 system, such as call_builtin_trap. */
428 force_target_expr (tree type, tree init)
432 gcc_assert (!VOID_TYPE_P (type));
434 slot = build_local_temp (type);
435 return build_target_expr (slot, init);
438 /* Like build_target_expr_with_type, but use the type of INIT. */
441 get_target_expr (tree init)
443 return build_target_expr_with_type (init, TREE_TYPE (init));
446 /* If EXPR is a bitfield reference, convert it to the declared type of
447 the bitfield, and return the resulting expression. Otherwise,
448 return EXPR itself. */
451 convert_bitfield_to_declared_type (tree expr)
455 bitfield_type = is_bitfield_expr_with_lowered_type (expr);
457 expr = convert_to_integer (TYPE_MAIN_VARIANT (bitfield_type),
462 /* EXPR is being used in an rvalue context. Return a version of EXPR
463 that is marked as an rvalue. */
470 if (error_operand_p (expr))
475 Non-class rvalues always have cv-unqualified types. */
476 type = TREE_TYPE (expr);
477 if (!CLASS_TYPE_P (type) && cp_type_quals (type))
478 type = TYPE_MAIN_VARIANT (type);
480 if (!processing_template_decl && real_lvalue_p (expr))
481 expr = build1 (NON_LVALUE_EXPR, type, expr);
482 else if (type != TREE_TYPE (expr))
483 expr = build_nop (type, expr);
489 /* Hash an ARRAY_TYPE. K is really of type `tree'. */
492 cplus_array_hash (const void* k)
495 const_tree const t = (const_tree) k;
497 hash = (htab_hash_pointer (TREE_TYPE (t))
498 ^ htab_hash_pointer (TYPE_DOMAIN (t)));
503 typedef struct cplus_array_info {
508 /* Compare two ARRAY_TYPEs. K1 is really of type `tree', K2 is really
509 of type `cplus_array_info*'. */
512 cplus_array_compare (const void * k1, const void * k2)
514 const_tree const t1 = (const_tree) k1;
515 const cplus_array_info *const t2 = (const cplus_array_info*) k2;
517 return (TREE_TYPE (t1) == t2->type && TYPE_DOMAIN (t1) == t2->domain);
520 /* Hash table containing all of the C++ array types, including
521 dependent array types and array types whose element type is
523 static GTY ((param_is (union tree_node))) htab_t cplus_array_htab;
527 build_cplus_array_type_1 (tree elt_type, tree index_type)
531 if (elt_type == error_mark_node || index_type == error_mark_node)
532 return error_mark_node;
534 if (processing_template_decl
535 && (dependent_type_p (elt_type)
536 || (index_type && !TREE_CONSTANT (TYPE_MAX_VALUE (index_type)))))
539 cplus_array_info cai;
542 if (cplus_array_htab == NULL)
543 cplus_array_htab = htab_create_ggc (61, &cplus_array_hash,
544 &cplus_array_compare, NULL);
546 hash = (htab_hash_pointer (elt_type)
547 ^ htab_hash_pointer (index_type));
549 cai.domain = index_type;
551 e = htab_find_slot_with_hash (cplus_array_htab, &cai, hash, INSERT);
553 /* We have found the type: we're done. */
557 /* Build a new array type. */
558 t = make_node (ARRAY_TYPE);
559 TREE_TYPE (t) = elt_type;
560 TYPE_DOMAIN (t) = index_type;
562 /* Store it in the hash table. */
565 /* Set the canonical type for this new node. */
566 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
567 || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type)))
568 SET_TYPE_STRUCTURAL_EQUALITY (t);
569 else if (TYPE_CANONICAL (elt_type) != elt_type
571 && TYPE_CANONICAL (index_type) != index_type))
573 = build_cplus_array_type
574 (TYPE_CANONICAL (elt_type),
575 index_type ? TYPE_CANONICAL (index_type) : index_type);
577 TYPE_CANONICAL (t) = t;
581 t = build_array_type (elt_type, index_type);
583 /* Push these needs up so that initialization takes place
585 TYPE_NEEDS_CONSTRUCTING (t)
586 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (elt_type));
587 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
588 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (elt_type));
593 build_cplus_array_type (tree elt_type, tree index_type)
596 int type_quals = cp_type_quals (elt_type);
598 if (type_quals != TYPE_UNQUALIFIED)
599 elt_type = cp_build_qualified_type (elt_type, TYPE_UNQUALIFIED);
601 t = build_cplus_array_type_1 (elt_type, index_type);
603 if (type_quals != TYPE_UNQUALIFIED)
604 t = cp_build_qualified_type (t, type_quals);
609 /* Return a reference type node referring to TO_TYPE. If RVAL is
610 true, return an rvalue reference type, otherwise return an lvalue
611 reference type. If a type node exists, reuse it, otherwise create
614 cp_build_reference_type (tree to_type, bool rval)
617 lvalue_ref = build_reference_type (to_type);
621 /* This code to create rvalue reference types is based on and tied
622 to the code creating lvalue reference types in the middle-end
623 functions build_reference_type_for_mode and build_reference_type.
625 It works by putting the rvalue reference type nodes after the
626 lvalue reference nodes in the TYPE_NEXT_REF_TO linked list, so
627 they will effectively be ignored by the middle end. */
629 for (t = lvalue_ref; (t = TYPE_NEXT_REF_TO (t)); )
630 if (TYPE_REF_IS_RVALUE (t))
633 t = copy_node (lvalue_ref);
635 TYPE_REF_IS_RVALUE (t) = true;
636 TYPE_NEXT_REF_TO (t) = TYPE_NEXT_REF_TO (lvalue_ref);
637 TYPE_NEXT_REF_TO (lvalue_ref) = t;
638 TYPE_MAIN_VARIANT (t) = t;
640 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
641 SET_TYPE_STRUCTURAL_EQUALITY (t);
642 else if (TYPE_CANONICAL (to_type) != to_type)
644 = cp_build_reference_type (TYPE_CANONICAL (to_type), rval);
646 TYPE_CANONICAL (t) = t;
654 /* Used by the C++ front end to build qualified array types. However,
655 the C version of this function does not properly maintain canonical
656 types (which are not used in C). */
658 c_build_qualified_type (tree type, int type_quals)
660 return cp_build_qualified_type (type, type_quals);
664 /* Make a variant of TYPE, qualified with the TYPE_QUALS. Handles
665 arrays correctly. In particular, if TYPE is an array of T's, and
666 TYPE_QUALS is non-empty, returns an array of qualified T's.
668 FLAGS determines how to deal with illformed qualifications. If
669 tf_ignore_bad_quals is set, then bad qualifications are dropped
670 (this is permitted if TYPE was introduced via a typedef or template
671 type parameter). If bad qualifications are dropped and tf_warning
672 is set, then a warning is issued for non-const qualifications. If
673 tf_ignore_bad_quals is not set and tf_error is not set, we
674 return error_mark_node. Otherwise, we issue an error, and ignore
677 Qualification of a reference type is valid when the reference came
678 via a typedef or template type argument. [dcl.ref] No such
679 dispensation is provided for qualifying a function type. [dcl.fct]
680 DR 295 queries this and the proposed resolution brings it into line
681 with qualifying a reference. We implement the DR. We also behave
682 in a similar manner for restricting non-pointer types. */
685 cp_build_qualified_type_real (tree type,
687 tsubst_flags_t complain)
690 int bad_quals = TYPE_UNQUALIFIED;
692 if (type == error_mark_node)
695 if (type_quals == cp_type_quals (type))
698 if (TREE_CODE (type) == ARRAY_TYPE)
700 /* In C++, the qualification really applies to the array element
701 type. Obtain the appropriately qualified element type. */
704 = cp_build_qualified_type_real (TREE_TYPE (type),
708 if (element_type == error_mark_node)
709 return error_mark_node;
711 /* See if we already have an identically qualified type. */
712 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
713 if (cp_type_quals (t) == type_quals
714 && TYPE_NAME (t) == TYPE_NAME (type)
715 && TYPE_CONTEXT (t) == TYPE_CONTEXT (type))
720 tree index_type = TYPE_DOMAIN (type);
722 cplus_array_info cai;
725 if (cplus_array_htab == NULL)
726 cplus_array_htab = htab_create_ggc (61, &cplus_array_hash,
727 &cplus_array_compare,
730 hash = (htab_hash_pointer (element_type)
731 ^ htab_hash_pointer (index_type));
732 cai.type = element_type;
733 cai.domain = index_type;
735 e = htab_find_slot_with_hash (cplus_array_htab, &cai, hash, INSERT);
737 /* We have found the type: we're done. */
740 /* Build a new array type and add it into the table. */
741 t = build_variant_type_copy (type);
742 TREE_TYPE (t) = element_type;
745 /* Set the canonical type for this new node. */
746 if (TYPE_STRUCTURAL_EQUALITY_P (element_type)
747 || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type)))
748 SET_TYPE_STRUCTURAL_EQUALITY (t);
749 else if (TYPE_CANONICAL (element_type) != element_type
751 && TYPE_CANONICAL (index_type) != index_type)
752 || TYPE_CANONICAL (type) != type)
754 = build_cplus_array_type
755 (TYPE_CANONICAL (element_type),
756 index_type? TYPE_CANONICAL (index_type) : index_type);
758 TYPE_CANONICAL (t) = t;
761 /* Even if we already had this variant, we update
762 TYPE_NEEDS_CONSTRUCTING and TYPE_HAS_NONTRIVIAL_DESTRUCTOR in case
763 they changed since the variant was originally created.
765 This seems hokey; if there is some way to use a previous
766 variant *without* coming through here,
767 TYPE_NEEDS_CONSTRUCTING will never be updated. */
768 TYPE_NEEDS_CONSTRUCTING (t)
769 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (element_type));
770 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
771 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (element_type));
774 else if (TYPE_PTRMEMFUNC_P (type))
776 /* For a pointer-to-member type, we can't just return a
777 cv-qualified version of the RECORD_TYPE. If we do, we
778 haven't changed the field that contains the actual pointer to
779 a method, and so TYPE_PTRMEMFUNC_FN_TYPE will be wrong. */
782 t = TYPE_PTRMEMFUNC_FN_TYPE (type);
783 t = cp_build_qualified_type_real (t, type_quals, complain);
784 return build_ptrmemfunc_type (t);
786 else if (TREE_CODE (type) == TYPE_PACK_EXPANSION)
788 tree t = PACK_EXPANSION_PATTERN (type);
790 t = cp_build_qualified_type_real (t, type_quals, complain);
791 return make_pack_expansion (t);
794 /* A reference or method type shall not be cv qualified.
795 [dcl.ref], [dct.fct] */
796 if (type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE)
797 && (TREE_CODE (type) == REFERENCE_TYPE
798 || TREE_CODE (type) == METHOD_TYPE))
800 bad_quals |= type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
801 type_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
804 /* A restrict-qualified type must be a pointer (or reference)
805 to object or incomplete type, or a function type. */
806 if ((type_quals & TYPE_QUAL_RESTRICT)
807 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
808 && TREE_CODE (type) != TYPENAME_TYPE
809 && TREE_CODE (type) != FUNCTION_TYPE
810 && !POINTER_TYPE_P (type))
812 bad_quals |= TYPE_QUAL_RESTRICT;
813 type_quals &= ~TYPE_QUAL_RESTRICT;
816 if (bad_quals == TYPE_UNQUALIFIED)
818 else if (!(complain & (tf_error | tf_ignore_bad_quals)))
819 return error_mark_node;
822 if (complain & tf_ignore_bad_quals)
823 /* We're not going to warn about constifying things that can't
825 bad_quals &= ~TYPE_QUAL_CONST;
828 tree bad_type = build_qualified_type (ptr_type_node, bad_quals);
830 if (!(complain & tf_ignore_bad_quals))
831 error ("%qV qualifiers cannot be applied to %qT",
836 /* Retrieve (or create) the appropriately qualified variant. */
837 result = build_qualified_type (type, type_quals);
839 /* If this was a pointer-to-method type, and we just made a copy,
840 then we need to unshare the record that holds the cached
841 pointer-to-member-function type, because these will be distinct
842 between the unqualified and qualified types. */
844 && TREE_CODE (type) == POINTER_TYPE
845 && TREE_CODE (TREE_TYPE (type)) == METHOD_TYPE)
846 TYPE_LANG_SPECIFIC (result) = NULL;
851 /* Returns the canonical version of TYPE. In other words, if TYPE is
852 a typedef, returns the underlying type. The cv-qualification of
853 the type returned matches the type input; they will always be
857 canonical_type_variant (tree t)
859 if (t == error_mark_node)
860 return error_mark_node;
862 return cp_build_qualified_type (TYPE_MAIN_VARIANT (t), cp_type_quals (t));
865 /* Makes a copy of BINFO and TYPE, which is to be inherited into a
866 graph dominated by T. If BINFO is NULL, TYPE is a dependent base,
867 and we do a shallow copy. If BINFO is non-NULL, we do a deep copy.
868 VIRT indicates whether TYPE is inherited virtually or not.
869 IGO_PREV points at the previous binfo of the inheritance graph
870 order chain. The newly copied binfo's TREE_CHAIN forms this
873 The CLASSTYPE_VBASECLASSES vector of T is constructed in the
874 correct order. That is in the order the bases themselves should be
877 The BINFO_INHERITANCE of a virtual base class points to the binfo
878 of the most derived type. ??? We could probably change this so that
879 BINFO_INHERITANCE becomes synonymous with BINFO_PRIMARY, and hence
880 remove a field. They currently can only differ for primary virtual
884 copy_binfo (tree binfo, tree type, tree t, tree *igo_prev, int virt)
890 /* See if we've already made this virtual base. */
891 new_binfo = binfo_for_vbase (type, t);
896 new_binfo = make_tree_binfo (binfo ? BINFO_N_BASE_BINFOS (binfo) : 0);
897 BINFO_TYPE (new_binfo) = type;
899 /* Chain it into the inheritance graph. */
900 TREE_CHAIN (*igo_prev) = new_binfo;
901 *igo_prev = new_binfo;
908 gcc_assert (!BINFO_DEPENDENT_BASE_P (binfo));
909 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), type));
911 BINFO_OFFSET (new_binfo) = BINFO_OFFSET (binfo);
912 BINFO_VIRTUALS (new_binfo) = BINFO_VIRTUALS (binfo);
914 /* We do not need to copy the accesses, as they are read only. */
915 BINFO_BASE_ACCESSES (new_binfo) = BINFO_BASE_ACCESSES (binfo);
917 /* Recursively copy base binfos of BINFO. */
918 for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++)
922 gcc_assert (!BINFO_DEPENDENT_BASE_P (base_binfo));
923 new_base_binfo = copy_binfo (base_binfo, BINFO_TYPE (base_binfo),
925 BINFO_VIRTUAL_P (base_binfo));
927 if (!BINFO_INHERITANCE_CHAIN (new_base_binfo))
928 BINFO_INHERITANCE_CHAIN (new_base_binfo) = new_binfo;
929 BINFO_BASE_APPEND (new_binfo, new_base_binfo);
933 BINFO_DEPENDENT_BASE_P (new_binfo) = 1;
937 /* Push it onto the list after any virtual bases it contains
938 will have been pushed. */
939 VEC_quick_push (tree, CLASSTYPE_VBASECLASSES (t), new_binfo);
940 BINFO_VIRTUAL_P (new_binfo) = 1;
941 BINFO_INHERITANCE_CHAIN (new_binfo) = TYPE_BINFO (t);
947 /* Hashing of lists so that we don't make duplicates.
948 The entry point is `list_hash_canon'. */
950 /* Now here is the hash table. When recording a list, it is added
951 to the slot whose index is the hash code mod the table size.
952 Note that the hash table is used for several kinds of lists.
953 While all these live in the same table, they are completely independent,
954 and the hash code is computed differently for each of these. */
956 static GTY ((param_is (union tree_node))) htab_t list_hash_table;
965 /* Compare ENTRY (an entry in the hash table) with DATA (a list_proxy
966 for a node we are thinking about adding). */
969 list_hash_eq (const void* entry, const void* data)
971 const_tree const t = (const_tree) entry;
972 const struct list_proxy *const proxy = (const struct list_proxy *) data;
974 return (TREE_VALUE (t) == proxy->value
975 && TREE_PURPOSE (t) == proxy->purpose
976 && TREE_CHAIN (t) == proxy->chain);
979 /* Compute a hash code for a list (chain of TREE_LIST nodes
980 with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the
981 TREE_COMMON slots), by adding the hash codes of the individual entries. */
984 list_hash_pieces (tree purpose, tree value, tree chain)
986 hashval_t hashcode = 0;
989 hashcode += TREE_HASH (chain);
992 hashcode += TREE_HASH (value);
996 hashcode += TREE_HASH (purpose);
1002 /* Hash an already existing TREE_LIST. */
1005 list_hash (const void* p)
1007 const_tree const t = (const_tree) p;
1008 return list_hash_pieces (TREE_PURPOSE (t),
1013 /* Given list components PURPOSE, VALUE, AND CHAIN, return the canonical
1014 object for an identical list if one already exists. Otherwise, build a
1015 new one, and record it as the canonical object. */
1018 hash_tree_cons (tree purpose, tree value, tree chain)
1022 struct list_proxy proxy;
1024 /* Hash the list node. */
1025 hashcode = list_hash_pieces (purpose, value, chain);
1026 /* Create a proxy for the TREE_LIST we would like to create. We
1027 don't actually create it so as to avoid creating garbage. */
1028 proxy.purpose = purpose;
1029 proxy.value = value;
1030 proxy.chain = chain;
1031 /* See if it is already in the table. */
1032 slot = htab_find_slot_with_hash (list_hash_table, &proxy, hashcode,
1034 /* If not, create a new node. */
1036 *slot = tree_cons (purpose, value, chain);
1037 return (tree) *slot;
1040 /* Constructor for hashed lists. */
1043 hash_tree_chain (tree value, tree chain)
1045 return hash_tree_cons (NULL_TREE, value, chain);
1049 debug_binfo (tree elem)
1054 fprintf (stderr, "type \"%s\", offset = " HOST_WIDE_INT_PRINT_DEC
1056 TYPE_NAME_STRING (BINFO_TYPE (elem)),
1057 TREE_INT_CST_LOW (BINFO_OFFSET (elem)));
1058 debug_tree (BINFO_TYPE (elem));
1059 if (BINFO_VTABLE (elem))
1060 fprintf (stderr, "vtable decl \"%s\"\n",
1061 IDENTIFIER_POINTER (DECL_NAME (get_vtbl_decl_for_binfo (elem))));
1063 fprintf (stderr, "no vtable decl yet\n");
1064 fprintf (stderr, "virtuals:\n");
1065 virtuals = BINFO_VIRTUALS (elem);
1070 tree fndecl = TREE_VALUE (virtuals);
1071 fprintf (stderr, "%s [%ld =? %ld]\n",
1072 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl)),
1073 (long) n, (long) TREE_INT_CST_LOW (DECL_VINDEX (fndecl)));
1075 virtuals = TREE_CHAIN (virtuals);
1079 /* Build a representation for the qualified name SCOPE::NAME. TYPE is
1080 the type of the result expression, if known, or NULL_TREE if the
1081 resulting expression is type-dependent. If TEMPLATE_P is true,
1082 NAME is known to be a template because the user explicitly used the
1083 "template" keyword after the "::".
1085 All SCOPE_REFs should be built by use of this function. */
1088 build_qualified_name (tree type, tree scope, tree name, bool template_p)
1091 if (type == error_mark_node
1092 || scope == error_mark_node
1093 || name == error_mark_node)
1094 return error_mark_node;
1095 t = build2 (SCOPE_REF, type, scope, name);
1096 QUALIFIED_NAME_IS_TEMPLATE (t) = template_p;
1100 /* Returns nonzero if X is an expression for a (possibly overloaded)
1101 function. If "f" is a function or function template, "f", "c->f",
1102 "c.f", "C::f", and "f<int>" will all be considered possibly
1103 overloaded functions. Returns 2 if the function is actually
1104 overloaded, i.e., if it is impossible to know the type of the
1105 function without performing overload resolution. */
1108 is_overloaded_fn (tree x)
1110 /* A baselink is also considered an overloaded function. */
1111 if (TREE_CODE (x) == OFFSET_REF
1112 || TREE_CODE (x) == COMPONENT_REF)
1113 x = TREE_OPERAND (x, 1);
1115 x = BASELINK_FUNCTIONS (x);
1116 if (TREE_CODE (x) == TEMPLATE_ID_EXPR
1117 || DECL_FUNCTION_TEMPLATE_P (OVL_CURRENT (x))
1118 || (TREE_CODE (x) == OVERLOAD && OVL_CHAIN (x)))
1120 return (TREE_CODE (x) == FUNCTION_DECL
1121 || TREE_CODE (x) == OVERLOAD);
1124 /* Returns true iff X is an expression for an overloaded function
1125 whose type cannot be known without performing overload
1129 really_overloaded_fn (tree x)
1131 return is_overloaded_fn (x) == 2;
1135 get_first_fn (tree from)
1137 gcc_assert (is_overloaded_fn (from));
1138 /* A baselink is also considered an overloaded function. */
1139 if (TREE_CODE (from) == COMPONENT_REF)
1140 from = TREE_OPERAND (from, 1);
1141 if (BASELINK_P (from))
1142 from = BASELINK_FUNCTIONS (from);
1143 return OVL_CURRENT (from);
1146 /* Return a new OVL node, concatenating it with the old one. */
1149 ovl_cons (tree decl, tree chain)
1151 tree result = make_node (OVERLOAD);
1152 TREE_TYPE (result) = unknown_type_node;
1153 OVL_FUNCTION (result) = decl;
1154 TREE_CHAIN (result) = chain;
1159 /* Build a new overloaded function. If this is the first one,
1160 just return it; otherwise, ovl_cons the _DECLs */
1163 build_overload (tree decl, tree chain)
1165 if (! chain && TREE_CODE (decl) != TEMPLATE_DECL)
1167 if (chain && TREE_CODE (chain) != OVERLOAD)
1168 chain = ovl_cons (chain, NULL_TREE);
1169 return ovl_cons (decl, chain);
1173 #define PRINT_RING_SIZE 4
1176 cxx_printable_name (tree decl, int v)
1178 static unsigned int uid_ring[PRINT_RING_SIZE];
1179 static char *print_ring[PRINT_RING_SIZE];
1180 static int ring_counter;
1183 /* Only cache functions. */
1185 || TREE_CODE (decl) != FUNCTION_DECL
1186 || DECL_LANG_SPECIFIC (decl) == 0)
1187 return lang_decl_name (decl, v);
1189 /* See if this print name is lying around. */
1190 for (i = 0; i < PRINT_RING_SIZE; i++)
1191 if (uid_ring[i] == DECL_UID (decl))
1192 /* yes, so return it. */
1193 return print_ring[i];
1195 if (++ring_counter == PRINT_RING_SIZE)
1198 if (current_function_decl != NULL_TREE)
1200 if (uid_ring[ring_counter] == DECL_UID (current_function_decl))
1202 if (ring_counter == PRINT_RING_SIZE)
1204 gcc_assert (uid_ring[ring_counter] != DECL_UID (current_function_decl));
1207 if (print_ring[ring_counter])
1208 free (print_ring[ring_counter]);
1210 print_ring[ring_counter] = xstrdup (lang_decl_name (decl, v));
1211 uid_ring[ring_counter] = DECL_UID (decl);
1212 return print_ring[ring_counter];
1215 /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions
1216 listed in RAISES. */
1219 build_exception_variant (tree type, tree raises)
1221 tree v = TYPE_MAIN_VARIANT (type);
1222 int type_quals = TYPE_QUALS (type);
1224 for (; v; v = TYPE_NEXT_VARIANT (v))
1225 if (check_qualified_type (v, type, type_quals)
1226 && comp_except_specs (raises, TYPE_RAISES_EXCEPTIONS (v), 1))
1229 /* Need to build a new variant. */
1230 v = build_variant_type_copy (type);
1231 TYPE_RAISES_EXCEPTIONS (v) = raises;
1235 /* Given a TEMPLATE_TEMPLATE_PARM node T, create a new
1236 BOUND_TEMPLATE_TEMPLATE_PARM bound with NEWARGS as its template
1240 bind_template_template_parm (tree t, tree newargs)
1242 tree decl = TYPE_NAME (t);
1245 t2 = make_aggr_type (BOUND_TEMPLATE_TEMPLATE_PARM);
1246 decl = build_decl (TYPE_DECL, DECL_NAME (decl), NULL_TREE);
1248 /* These nodes have to be created to reflect new TYPE_DECL and template
1250 TEMPLATE_TYPE_PARM_INDEX (t2) = copy_node (TEMPLATE_TYPE_PARM_INDEX (t));
1251 TEMPLATE_PARM_DECL (TEMPLATE_TYPE_PARM_INDEX (t2)) = decl;
1252 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2)
1253 = tree_cons (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t),
1254 newargs, NULL_TREE);
1256 TREE_TYPE (decl) = t2;
1257 TYPE_NAME (t2) = decl;
1258 TYPE_STUB_DECL (t2) = decl;
1260 SET_TYPE_STRUCTURAL_EQUALITY (t2);
1265 /* Called from count_trees via walk_tree. */
1268 count_trees_r (tree *tp, int *walk_subtrees, void *data)
1278 /* Debugging function for measuring the rough complexity of a tree
1282 count_trees (tree t)
1285 cp_walk_tree_without_duplicates (&t, count_trees_r, &n_trees);
1289 /* Called from verify_stmt_tree via walk_tree. */
1292 verify_stmt_tree_r (tree* tp,
1293 int* walk_subtrees ATTRIBUTE_UNUSED ,
1297 htab_t *statements = (htab_t *) data;
1300 if (!STATEMENT_CODE_P (TREE_CODE (t)))
1303 /* If this statement is already present in the hash table, then
1304 there is a circularity in the statement tree. */
1305 gcc_assert (!htab_find (*statements, t));
1307 slot = htab_find_slot (*statements, t, INSERT);
1313 /* Debugging function to check that the statement T has not been
1314 corrupted. For now, this function simply checks that T contains no
1318 verify_stmt_tree (tree t)
1321 statements = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
1322 cp_walk_tree (&t, verify_stmt_tree_r, &statements, NULL);
1323 htab_delete (statements);
1326 /* Check if the type T depends on a type with no linkage and if so, return
1327 it. If RELAXED_P then do not consider a class type declared within
1328 a TREE_PUBLIC function to have no linkage. */
1331 no_linkage_check (tree t, bool relaxed_p)
1335 /* There's no point in checking linkage on template functions; we
1336 can't know their complete types. */
1337 if (processing_template_decl)
1340 switch (TREE_CODE (t))
1345 if (TYPE_PTRMEMFUNC_P (t))
1349 if (!CLASS_TYPE_P (t))
1353 if (TYPE_ANONYMOUS_P (t))
1355 fn = decl_function_context (TYPE_MAIN_DECL (t));
1356 if (fn && (!relaxed_p || !TREE_PUBLIC (fn)))
1362 case REFERENCE_TYPE:
1363 return no_linkage_check (TREE_TYPE (t), relaxed_p);
1367 r = no_linkage_check (TYPE_PTRMEM_POINTED_TO_TYPE (t),
1371 return no_linkage_check (TYPE_PTRMEM_CLASS_TYPE (t), relaxed_p);
1374 r = no_linkage_check (TYPE_METHOD_BASETYPE (t), relaxed_p);
1381 for (parm = TYPE_ARG_TYPES (t);
1382 parm && parm != void_list_node;
1383 parm = TREE_CHAIN (parm))
1385 r = no_linkage_check (TREE_VALUE (parm), relaxed_p);
1389 return no_linkage_check (TREE_TYPE (t), relaxed_p);
1397 #ifdef GATHER_STATISTICS
1398 extern int depth_reached;
1402 cxx_print_statistics (void)
1404 print_search_statistics ();
1405 print_class_statistics ();
1406 #ifdef GATHER_STATISTICS
1407 fprintf (stderr, "maximum template instantiation depth reached: %d\n",
1412 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1413 (which is an ARRAY_TYPE). This counts only elements of the top
1417 array_type_nelts_top (tree type)
1419 return fold_build2 (PLUS_EXPR, sizetype,
1420 array_type_nelts (type),
1424 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1425 (which is an ARRAY_TYPE). This one is a recursive count of all
1426 ARRAY_TYPEs that are clumped together. */
1429 array_type_nelts_total (tree type)
1431 tree sz = array_type_nelts_top (type);
1432 type = TREE_TYPE (type);
1433 while (TREE_CODE (type) == ARRAY_TYPE)
1435 tree n = array_type_nelts_top (type);
1436 sz = fold_build2 (MULT_EXPR, sizetype, sz, n);
1437 type = TREE_TYPE (type);
1442 /* Called from break_out_target_exprs via mapcar. */
1445 bot_manip (tree* tp, int* walk_subtrees, void* data)
1447 splay_tree target_remap = ((splay_tree) data);
1450 if (!TYPE_P (t) && TREE_CONSTANT (t))
1452 /* There can't be any TARGET_EXPRs or their slot variables below
1453 this point. We used to check !TREE_SIDE_EFFECTS, but then we
1454 failed to copy an ADDR_EXPR of the slot VAR_DECL. */
1458 if (TREE_CODE (t) == TARGET_EXPR)
1462 if (TREE_CODE (TREE_OPERAND (t, 1)) == AGGR_INIT_EXPR)
1464 (TREE_TYPE (t), break_out_target_exprs (TREE_OPERAND (t, 1)));
1466 u = build_target_expr_with_type
1467 (break_out_target_exprs (TREE_OPERAND (t, 1)), TREE_TYPE (t));
1469 /* Map the old variable to the new one. */
1470 splay_tree_insert (target_remap,
1471 (splay_tree_key) TREE_OPERAND (t, 0),
1472 (splay_tree_value) TREE_OPERAND (u, 0));
1474 /* Replace the old expression with the new version. */
1476 /* We don't have to go below this point; the recursive call to
1477 break_out_target_exprs will have handled anything below this
1483 /* Make a copy of this node. */
1484 return copy_tree_r (tp, walk_subtrees, NULL);
1487 /* Replace all remapped VAR_DECLs in T with their new equivalents.
1488 DATA is really a splay-tree mapping old variables to new
1492 bot_replace (tree* t,
1493 int* walk_subtrees ATTRIBUTE_UNUSED ,
1496 splay_tree target_remap = ((splay_tree) data);
1498 if (TREE_CODE (*t) == VAR_DECL)
1500 splay_tree_node n = splay_tree_lookup (target_remap,
1501 (splay_tree_key) *t);
1503 *t = (tree) n->value;
1509 /* When we parse a default argument expression, we may create
1510 temporary variables via TARGET_EXPRs. When we actually use the
1511 default-argument expression, we make a copy of the expression, but
1512 we must replace the temporaries with appropriate local versions. */
1515 break_out_target_exprs (tree t)
1517 static int target_remap_count;
1518 static splay_tree target_remap;
1520 if (!target_remap_count++)
1521 target_remap = splay_tree_new (splay_tree_compare_pointers,
1522 /*splay_tree_delete_key_fn=*/NULL,
1523 /*splay_tree_delete_value_fn=*/NULL);
1524 cp_walk_tree (&t, bot_manip, target_remap, NULL);
1525 cp_walk_tree (&t, bot_replace, target_remap, NULL);
1527 if (!--target_remap_count)
1529 splay_tree_delete (target_remap);
1530 target_remap = NULL;
1536 /* Similar to `build_nt', but for template definitions of dependent
1540 build_min_nt (enum tree_code code, ...)
1547 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
1551 t = make_node (code);
1552 length = TREE_CODE_LENGTH (code);
1554 for (i = 0; i < length; i++)
1556 tree x = va_arg (p, tree);
1557 TREE_OPERAND (t, i) = x;
1565 /* Similar to `build', but for template definitions. */
1568 build_min (enum tree_code code, tree tt, ...)
1575 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
1579 t = make_node (code);
1580 length = TREE_CODE_LENGTH (code);
1583 for (i = 0; i < length; i++)
1585 tree x = va_arg (p, tree);
1586 TREE_OPERAND (t, i) = x;
1587 if (x && !TYPE_P (x) && TREE_SIDE_EFFECTS (x))
1588 TREE_SIDE_EFFECTS (t) = 1;
1595 /* Similar to `build', but for template definitions of non-dependent
1596 expressions. NON_DEP is the non-dependent expression that has been
1600 build_min_non_dep (enum tree_code code, tree non_dep, ...)
1607 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
1609 va_start (p, non_dep);
1611 t = make_node (code);
1612 length = TREE_CODE_LENGTH (code);
1613 TREE_TYPE (t) = TREE_TYPE (non_dep);
1614 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (non_dep);
1616 for (i = 0; i < length; i++)
1618 tree x = va_arg (p, tree);
1619 TREE_OPERAND (t, i) = x;
1622 if (code == COMPOUND_EXPR && TREE_CODE (non_dep) != COMPOUND_EXPR)
1623 /* This should not be considered a COMPOUND_EXPR, because it
1624 resolves to an overload. */
1625 COMPOUND_EXPR_OVERLOADED (t) = 1;
1631 /* Similar to `build_call_list', but for template definitions of non-dependent
1632 expressions. NON_DEP is the non-dependent expression that has been
1636 build_min_non_dep_call_list (tree non_dep, tree fn, tree arglist)
1638 tree t = build_nt_call_list (fn, arglist);
1639 TREE_TYPE (t) = TREE_TYPE (non_dep);
1640 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (non_dep);
1645 get_type_decl (tree t)
1647 if (TREE_CODE (t) == TYPE_DECL)
1650 return TYPE_STUB_DECL (t);
1651 gcc_assert (t == error_mark_node);
1655 /* Returns the namespace that contains DECL, whether directly or
1659 decl_namespace_context (tree decl)
1663 if (TREE_CODE (decl) == NAMESPACE_DECL)
1665 else if (TYPE_P (decl))
1666 decl = CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl));
1668 decl = CP_DECL_CONTEXT (decl);
1672 /* Returns true if decl is within an anonymous namespace, however deeply
1673 nested, or false otherwise. */
1676 decl_anon_ns_mem_p (const_tree decl)
1680 if (decl == NULL_TREE || decl == error_mark_node)
1682 if (TREE_CODE (decl) == NAMESPACE_DECL
1683 && DECL_NAME (decl) == NULL_TREE)
1685 /* Classes and namespaces inside anonymous namespaces have
1686 TREE_PUBLIC == 0, so we can shortcut the search. */
1687 else if (TYPE_P (decl))
1688 return (TREE_PUBLIC (TYPE_NAME (decl)) == 0);
1689 else if (TREE_CODE (decl) == NAMESPACE_DECL)
1690 return (TREE_PUBLIC (decl) == 0);
1692 decl = DECL_CONTEXT (decl);
1696 /* Return truthvalue of whether T1 is the same tree structure as T2.
1697 Return 1 if they are the same. Return 0 if they are different. */
1700 cp_tree_equal (tree t1, tree t2)
1702 enum tree_code code1, code2;
1709 for (code1 = TREE_CODE (t1);
1710 code1 == NOP_EXPR || code1 == CONVERT_EXPR
1711 || code1 == NON_LVALUE_EXPR;
1712 code1 = TREE_CODE (t1))
1713 t1 = TREE_OPERAND (t1, 0);
1714 for (code2 = TREE_CODE (t2);
1715 code2 == NOP_EXPR || code2 == CONVERT_EXPR
1716 || code1 == NON_LVALUE_EXPR;
1717 code2 = TREE_CODE (t2))
1718 t2 = TREE_OPERAND (t2, 0);
1720 /* They might have become equal now. */
1730 return TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
1731 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2);
1734 return REAL_VALUES_EQUAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
1737 return TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
1738 && !memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
1739 TREE_STRING_LENGTH (t1));
1742 return cp_tree_equal (TREE_REALPART (t1), TREE_REALPART (t2))
1743 && cp_tree_equal (TREE_IMAGPART (t1), TREE_IMAGPART (t2));
1746 /* We need to do this when determining whether or not two
1747 non-type pointer to member function template arguments
1749 if (!(same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
1750 /* The first operand is RTL. */
1751 && TREE_OPERAND (t1, 0) == TREE_OPERAND (t2, 0)))
1753 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1756 if (!cp_tree_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2)))
1758 if (!cp_tree_equal (TREE_VALUE (t1), TREE_VALUE (t2)))
1760 return cp_tree_equal (TREE_CHAIN (t1), TREE_CHAIN (t2));
1763 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1768 call_expr_arg_iterator iter1, iter2;
1769 if (!cp_tree_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2)))
1771 for (arg1 = first_call_expr_arg (t1, &iter1),
1772 arg2 = first_call_expr_arg (t2, &iter2);
1774 arg1 = next_call_expr_arg (&iter1),
1775 arg2 = next_call_expr_arg (&iter2))
1776 if (!cp_tree_equal (arg1, arg2))
1778 return (arg1 || arg2);
1783 tree o1 = TREE_OPERAND (t1, 0);
1784 tree o2 = TREE_OPERAND (t2, 0);
1786 /* Special case: if either target is an unallocated VAR_DECL,
1787 it means that it's going to be unified with whatever the
1788 TARGET_EXPR is really supposed to initialize, so treat it
1789 as being equivalent to anything. */
1790 if (TREE_CODE (o1) == VAR_DECL && DECL_NAME (o1) == NULL_TREE
1791 && !DECL_RTL_SET_P (o1))
1793 else if (TREE_CODE (o2) == VAR_DECL && DECL_NAME (o2) == NULL_TREE
1794 && !DECL_RTL_SET_P (o2))
1796 else if (!cp_tree_equal (o1, o2))
1799 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1802 case WITH_CLEANUP_EXPR:
1803 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1805 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
1808 if (TREE_OPERAND (t1, 1) != TREE_OPERAND (t2, 1))
1810 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1817 case IDENTIFIER_NODE:
1822 return (BASELINK_BINFO (t1) == BASELINK_BINFO (t2)
1823 && BASELINK_ACCESS_BINFO (t1) == BASELINK_ACCESS_BINFO (t2)
1824 && cp_tree_equal (BASELINK_FUNCTIONS (t1),
1825 BASELINK_FUNCTIONS (t2)));
1827 case TEMPLATE_PARM_INDEX:
1828 return (TEMPLATE_PARM_IDX (t1) == TEMPLATE_PARM_IDX (t2)
1829 && TEMPLATE_PARM_LEVEL (t1) == TEMPLATE_PARM_LEVEL (t2)
1830 && same_type_p (TREE_TYPE (TEMPLATE_PARM_DECL (t1)),
1831 TREE_TYPE (TEMPLATE_PARM_DECL (t2))));
1833 case TEMPLATE_ID_EXPR:
1838 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1840 vec1 = TREE_OPERAND (t1, 1);
1841 vec2 = TREE_OPERAND (t2, 1);
1844 return !vec1 && !vec2;
1846 if (TREE_VEC_LENGTH (vec1) != TREE_VEC_LENGTH (vec2))
1849 for (ix = TREE_VEC_LENGTH (vec1); ix--;)
1850 if (!cp_tree_equal (TREE_VEC_ELT (vec1, ix),
1851 TREE_VEC_ELT (vec2, ix)))
1860 tree o1 = TREE_OPERAND (t1, 0);
1861 tree o2 = TREE_OPERAND (t2, 0);
1863 if (TREE_CODE (o1) != TREE_CODE (o2))
1866 return same_type_p (o1, o2);
1868 return cp_tree_equal (o1, o2);
1873 tree t1_op1, t2_op1;
1875 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1878 t1_op1 = TREE_OPERAND (t1, 1);
1879 t2_op1 = TREE_OPERAND (t2, 1);
1880 if (TREE_CODE (t1_op1) != TREE_CODE (t2_op1))
1883 return cp_tree_equal (TREE_OPERAND (t1, 2), TREE_OPERAND (t2, 2));
1887 /* Two pointer-to-members are the same if they point to the same
1888 field or function in the same class. */
1889 if (PTRMEM_CST_MEMBER (t1) != PTRMEM_CST_MEMBER (t2))
1892 return same_type_p (PTRMEM_CST_CLASS (t1), PTRMEM_CST_CLASS (t2));
1895 if (OVL_FUNCTION (t1) != OVL_FUNCTION (t2))
1897 return cp_tree_equal (OVL_CHAIN (t1), OVL_CHAIN (t2));
1900 if (TRAIT_EXPR_KIND (t1) != TRAIT_EXPR_KIND (t2))
1902 return same_type_p (TRAIT_EXPR_TYPE1 (t1), TRAIT_EXPR_TYPE1 (t2))
1903 && same_type_p (TRAIT_EXPR_TYPE2 (t1), TRAIT_EXPR_TYPE2 (t2));
1909 switch (TREE_CODE_CLASS (code1))
1913 case tcc_comparison:
1914 case tcc_expression:
1921 n = TREE_OPERAND_LENGTH (t1);
1922 if (TREE_CODE_CLASS (code1) == tcc_vl_exp
1923 && n != TREE_OPERAND_LENGTH (t2))
1926 for (i = 0; i < n; ++i)
1927 if (!cp_tree_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i)))
1934 return same_type_p (t1, t2);
1938 /* We can get here with --disable-checking. */
1942 /* The type of ARG when used as an lvalue. */
1945 lvalue_type (tree arg)
1947 tree type = TREE_TYPE (arg);
1951 /* The type of ARG for printing error messages; denote lvalues with
1955 error_type (tree arg)
1957 tree type = TREE_TYPE (arg);
1959 if (TREE_CODE (type) == ARRAY_TYPE)
1961 else if (TREE_CODE (type) == ERROR_MARK)
1963 else if (real_lvalue_p (arg))
1964 type = build_reference_type (lvalue_type (arg));
1965 else if (IS_AGGR_TYPE (type))
1966 type = lvalue_type (arg);
1971 /* Does FUNCTION use a variable-length argument list? */
1974 varargs_function_p (const_tree function)
1976 const_tree parm = TYPE_ARG_TYPES (TREE_TYPE (function));
1977 for (; parm; parm = TREE_CHAIN (parm))
1978 if (TREE_VALUE (parm) == void_type_node)
1983 /* Returns 1 if decl is a member of a class. */
1986 member_p (const_tree decl)
1988 const_tree const ctx = DECL_CONTEXT (decl);
1989 return (ctx && TYPE_P (ctx));
1992 /* Create a placeholder for member access where we don't actually have an
1993 object that the access is against. */
1996 build_dummy_object (tree type)
1998 tree decl = build1 (NOP_EXPR, build_pointer_type (type), void_zero_node);
1999 return build_indirect_ref (decl, NULL);
2002 /* We've gotten a reference to a member of TYPE. Return *this if appropriate,
2003 or a dummy object otherwise. If BINFOP is non-0, it is filled with the
2004 binfo path from current_class_type to TYPE, or 0. */
2007 maybe_dummy_object (tree type, tree* binfop)
2012 if (current_class_type
2013 && (binfo = lookup_base (current_class_type, type,
2014 ba_unique | ba_quiet, NULL)))
2015 context = current_class_type;
2018 /* Reference from a nested class member function. */
2020 binfo = TYPE_BINFO (type);
2026 if (current_class_ref && context == current_class_type
2027 /* Kludge: Make sure that current_class_type is actually
2028 correct. It might not be if we're in the middle of
2029 tsubst_default_argument. */
2030 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref)),
2031 current_class_type))
2032 decl = current_class_ref;
2034 decl = build_dummy_object (context);
2039 /* Returns 1 if OB is a placeholder object, or a pointer to one. */
2042 is_dummy_object (const_tree ob)
2044 if (TREE_CODE (ob) == INDIRECT_REF)
2045 ob = TREE_OPERAND (ob, 0);
2046 return (TREE_CODE (ob) == NOP_EXPR
2047 && TREE_OPERAND (ob, 0) == void_zero_node);
2050 /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */
2053 pod_type_p (const_tree t)
2055 /* This CONST_CAST is okay because strip_array_types returns it's
2056 argument unmodified and we assign it to a const_tree. */
2057 t = strip_array_types (CONST_CAST_TREE(t));
2059 if (t == error_mark_node)
2061 if (INTEGRAL_TYPE_P (t))
2062 return 1; /* integral, character or enumeral type */
2063 if (FLOAT_TYPE_P (t))
2066 return 1; /* pointer to non-member */
2067 if (TYPE_PTR_TO_MEMBER_P (t))
2068 return 1; /* pointer to member */
2070 if (TREE_CODE (t) == VECTOR_TYPE)
2071 return 1; /* vectors are (small) arrays of scalars */
2073 if (! CLASS_TYPE_P (t))
2074 return 0; /* other non-class type (reference or function) */
2075 if (CLASSTYPE_NON_POD_P (t))
2080 /* Nonzero iff type T is a class template implicit specialization. */
2083 class_tmpl_impl_spec_p (const_tree t)
2085 return CLASS_TYPE_P (t) && CLASSTYPE_TEMPLATE_INSTANTIATION (t);
2088 /* Returns 1 iff zero initialization of type T means actually storing
2092 zero_init_p (const_tree t)
2094 /* This CONST_CAST is okay because strip_array_types returns it's
2095 argument unmodified and we assign it to a const_tree. */
2096 t = strip_array_types (CONST_CAST_TREE(t));
2098 if (t == error_mark_node)
2101 /* NULL pointers to data members are initialized with -1. */
2102 if (TYPE_PTRMEM_P (t))
2105 /* Classes that contain types that can't be zero-initialized, cannot
2106 be zero-initialized themselves. */
2107 if (CLASS_TYPE_P (t) && CLASSTYPE_NON_ZERO_INIT_P (t))
2113 /* Table of valid C++ attributes. */
2114 const struct attribute_spec cxx_attribute_table[] =
2116 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
2117 { "java_interface", 0, 0, false, false, false, handle_java_interface_attribute },
2118 { "com_interface", 0, 0, false, false, false, handle_com_interface_attribute },
2119 { "init_priority", 1, 1, true, false, false, handle_init_priority_attribute },
2120 { NULL, 0, 0, false, false, false, NULL }
2123 /* Handle a "java_interface" attribute; arguments as in
2124 struct attribute_spec.handler. */
2126 handle_java_interface_attribute (tree* node,
2128 tree args ATTRIBUTE_UNUSED ,
2133 || !CLASS_TYPE_P (*node)
2134 || !TYPE_FOR_JAVA (*node))
2136 error ("%qE attribute can only be applied to Java class definitions",
2138 *no_add_attrs = true;
2141 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
2142 *node = build_variant_type_copy (*node);
2143 TYPE_JAVA_INTERFACE (*node) = 1;
2148 /* Handle a "com_interface" attribute; arguments as in
2149 struct attribute_spec.handler. */
2151 handle_com_interface_attribute (tree* node,
2153 tree args ATTRIBUTE_UNUSED ,
2154 int flags ATTRIBUTE_UNUSED ,
2159 *no_add_attrs = true;
2162 || !CLASS_TYPE_P (*node)
2163 || *node != TYPE_MAIN_VARIANT (*node))
2165 warning (OPT_Wattributes, "%qE attribute can only be applied "
2166 "to class definitions", name);
2171 warning (0, "%qE is obsolete; g++ vtables are now COM-compatible by default",
2177 /* Handle an "init_priority" attribute; arguments as in
2178 struct attribute_spec.handler. */
2180 handle_init_priority_attribute (tree* node,
2183 int flags ATTRIBUTE_UNUSED ,
2186 tree initp_expr = TREE_VALUE (args);
2188 tree type = TREE_TYPE (decl);
2191 STRIP_NOPS (initp_expr);
2193 if (!initp_expr || TREE_CODE (initp_expr) != INTEGER_CST)
2195 error ("requested init_priority is not an integer constant");
2196 *no_add_attrs = true;
2200 pri = TREE_INT_CST_LOW (initp_expr);
2202 type = strip_array_types (type);
2204 if (decl == NULL_TREE
2205 || TREE_CODE (decl) != VAR_DECL
2206 || !TREE_STATIC (decl)
2207 || DECL_EXTERNAL (decl)
2208 || (TREE_CODE (type) != RECORD_TYPE
2209 && TREE_CODE (type) != UNION_TYPE)
2210 /* Static objects in functions are initialized the
2211 first time control passes through that
2212 function. This is not precise enough to pin down an
2213 init_priority value, so don't allow it. */
2214 || current_function_decl)
2216 error ("can only use %qE attribute on file-scope definitions "
2217 "of objects of class type", name);
2218 *no_add_attrs = true;
2222 if (pri > MAX_INIT_PRIORITY || pri <= 0)
2224 error ("requested init_priority is out of range");
2225 *no_add_attrs = true;
2229 /* Check for init_priorities that are reserved for
2230 language and runtime support implementations.*/
2231 if (pri <= MAX_RESERVED_INIT_PRIORITY)
2234 (0, "requested init_priority is reserved for internal use");
2237 if (SUPPORTS_INIT_PRIORITY)
2239 SET_DECL_INIT_PRIORITY (decl, pri);
2240 DECL_HAS_INIT_PRIORITY_P (decl) = 1;
2245 error ("%qE attribute is not supported on this platform", name);
2246 *no_add_attrs = true;
2251 /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the
2252 thing pointed to by the constant. */
2255 make_ptrmem_cst (tree type, tree member)
2257 tree ptrmem_cst = make_node (PTRMEM_CST);
2258 TREE_TYPE (ptrmem_cst) = type;
2259 PTRMEM_CST_MEMBER (ptrmem_cst) = member;
2263 /* Build a variant of TYPE that has the indicated ATTRIBUTES. May
2264 return an existing type if an appropriate type already exists. */
2267 cp_build_type_attribute_variant (tree type, tree attributes)
2271 new_type = build_type_attribute_variant (type, attributes);
2272 if (TREE_CODE (new_type) == FUNCTION_TYPE
2273 && (TYPE_RAISES_EXCEPTIONS (new_type)
2274 != TYPE_RAISES_EXCEPTIONS (type)))
2275 new_type = build_exception_variant (new_type,
2276 TYPE_RAISES_EXCEPTIONS (type));
2278 /* Making a new main variant of a class type is broken. */
2279 gcc_assert (!CLASS_TYPE_P (type) || new_type == type);
2284 /* Return TRUE if TYPE1 and TYPE2 are identical for type hashing purposes.
2285 Called only after doing all language independent checks. Only
2286 to check TYPE_RAISES_EXCEPTIONS for FUNCTION_TYPE, the rest is already
2287 compared in type_hash_eq. */
2290 cxx_type_hash_eq (const_tree typea, const_tree typeb)
2292 gcc_assert (TREE_CODE (typea) == FUNCTION_TYPE);
2294 return comp_except_specs (TYPE_RAISES_EXCEPTIONS (typea),
2295 TYPE_RAISES_EXCEPTIONS (typeb), 1);
2298 /* Apply FUNC to all language-specific sub-trees of TP in a pre-order
2299 traversal. Called from walk_tree. */
2302 cp_walk_subtrees (tree *tp, int *walk_subtrees_p, walk_tree_fn func,
2303 void *data, struct pointer_set_t *pset)
2305 enum tree_code code = TREE_CODE (*tp);
2308 #define WALK_SUBTREE(NODE) \
2311 result = cp_walk_tree (&(NODE), func, data, pset); \
2312 if (result) goto out; \
2316 /* Not one of the easy cases. We must explicitly go through the
2322 case TEMPLATE_TEMPLATE_PARM:
2323 case BOUND_TEMPLATE_TEMPLATE_PARM:
2324 case UNBOUND_CLASS_TEMPLATE:
2325 case TEMPLATE_PARM_INDEX:
2326 case TEMPLATE_TYPE_PARM:
2329 /* None of these have subtrees other than those already walked
2331 *walk_subtrees_p = 0;
2335 WALK_SUBTREE (BASELINK_FUNCTIONS (*tp));
2336 *walk_subtrees_p = 0;
2340 WALK_SUBTREE (TREE_TYPE (*tp));
2341 *walk_subtrees_p = 0;
2345 WALK_SUBTREE (TREE_PURPOSE (*tp));
2349 WALK_SUBTREE (OVL_FUNCTION (*tp));
2350 WALK_SUBTREE (OVL_CHAIN (*tp));
2351 *walk_subtrees_p = 0;
2355 if (TYPE_PTRMEMFUNC_P (*tp))
2356 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (*tp));
2359 case TYPE_ARGUMENT_PACK:
2360 case NONTYPE_ARGUMENT_PACK:
2362 tree args = ARGUMENT_PACK_ARGS (*tp);
2363 int i, len = TREE_VEC_LENGTH (args);
2364 for (i = 0; i < len; i++)
2365 WALK_SUBTREE (TREE_VEC_ELT (args, i));
2369 case TYPE_PACK_EXPANSION:
2370 WALK_SUBTREE (TREE_TYPE (*tp));
2371 *walk_subtrees_p = 0;
2374 case EXPR_PACK_EXPANSION:
2375 WALK_SUBTREE (TREE_OPERAND (*tp, 0));
2376 *walk_subtrees_p = 0;
2380 if (TREE_TYPE (*tp))
2381 WALK_SUBTREE (TREE_TYPE (*tp));
2385 for (i = 0; i < TREE_CODE_LENGTH (TREE_CODE (*tp)); ++i)
2386 WALK_SUBTREE (TREE_OPERAND (*tp, i));
2388 *walk_subtrees_p = 0;
2392 WALK_SUBTREE (TRAIT_EXPR_TYPE1 (*tp));
2393 WALK_SUBTREE (TRAIT_EXPR_TYPE2 (*tp));
2394 *walk_subtrees_p = 0;
2398 WALK_SUBTREE (DECLTYPE_TYPE_EXPR (*tp));
2399 *walk_subtrees_p = 0;
2407 /* We didn't find what we were looking for. */
2414 /* Like save_expr, but for C++. */
2417 cp_save_expr (tree expr)
2419 /* There is no reason to create a SAVE_EXPR within a template; if
2420 needed, we can create the SAVE_EXPR when instantiating the
2421 template. Furthermore, the middle-end cannot handle C++-specific
2423 if (processing_template_decl)
2425 return save_expr (expr);
2428 /* Initialize tree.c. */
2433 list_hash_table = htab_create_ggc (31, list_hash, list_hash_eq, NULL);
2436 /* Returns the kind of special function that DECL (a FUNCTION_DECL)
2437 is. Note that sfk_none is zero, so this function can be used as a
2438 predicate to test whether or not DECL is a special function. */
2440 special_function_kind
2441 special_function_p (const_tree decl)
2443 /* Rather than doing all this stuff with magic names, we should
2444 probably have a field of type `special_function_kind' in
2445 DECL_LANG_SPECIFIC. */
2446 if (DECL_COPY_CONSTRUCTOR_P (decl))
2447 return sfk_copy_constructor;
2448 if (DECL_CONSTRUCTOR_P (decl))
2449 return sfk_constructor;
2450 if (DECL_OVERLOADED_OPERATOR_P (decl) == NOP_EXPR)
2451 return sfk_assignment_operator;
2452 if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl))
2453 return sfk_destructor;
2454 if (DECL_COMPLETE_DESTRUCTOR_P (decl))
2455 return sfk_complete_destructor;
2456 if (DECL_BASE_DESTRUCTOR_P (decl))
2457 return sfk_base_destructor;
2458 if (DECL_DELETING_DESTRUCTOR_P (decl))
2459 return sfk_deleting_destructor;
2460 if (DECL_CONV_FN_P (decl))
2461 return sfk_conversion;
2466 /* Returns nonzero if TYPE is a character type, including wchar_t. */
2469 char_type_p (tree type)
2471 return (same_type_p (type, char_type_node)
2472 || same_type_p (type, unsigned_char_type_node)
2473 || same_type_p (type, signed_char_type_node)
2474 || same_type_p (type, wchar_type_node));
2477 /* Returns the kind of linkage associated with the indicated DECL. Th
2478 value returned is as specified by the language standard; it is
2479 independent of implementation details regarding template
2480 instantiation, etc. For example, it is possible that a declaration
2481 to which this function assigns external linkage would not show up
2482 as a global symbol when you run `nm' on the resulting object file. */
2485 decl_linkage (tree decl)
2487 /* This function doesn't attempt to calculate the linkage from first
2488 principles as given in [basic.link]. Instead, it makes use of
2489 the fact that we have already set TREE_PUBLIC appropriately, and
2490 then handles a few special cases. Ideally, we would calculate
2491 linkage first, and then transform that into a concrete
2494 /* Things that don't have names have no linkage. */
2495 if (!DECL_NAME (decl))
2498 /* Fields have no linkage. */
2499 if (TREE_CODE (decl) == FIELD_DECL)
2502 /* Things that are TREE_PUBLIC have external linkage. */
2503 if (TREE_PUBLIC (decl))
2506 if (TREE_CODE (decl) == NAMESPACE_DECL)
2509 /* Linkage of a CONST_DECL depends on the linkage of the enumeration
2511 if (TREE_CODE (decl) == CONST_DECL)
2512 return decl_linkage (TYPE_NAME (TREE_TYPE (decl)));
2514 /* Some things that are not TREE_PUBLIC have external linkage, too.
2515 For example, on targets that don't have weak symbols, we make all
2516 template instantiations have internal linkage (in the object
2517 file), but the symbols should still be treated as having external
2518 linkage from the point of view of the language. */
2519 if (TREE_CODE (decl) != TYPE_DECL && DECL_LANG_SPECIFIC (decl)
2520 && DECL_COMDAT (decl))
2523 /* Things in local scope do not have linkage, if they don't have
2525 if (decl_function_context (decl))
2528 /* Members of the anonymous namespace also have TREE_PUBLIC unset, but
2529 are considered to have external linkage for language purposes. DECLs
2530 really meant to have internal linkage have DECL_THIS_STATIC set. */
2531 if (TREE_CODE (decl) == TYPE_DECL)
2533 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == FUNCTION_DECL)
2535 if (!DECL_THIS_STATIC (decl))
2538 /* Static data members and static member functions from classes
2539 in anonymous namespace also don't have TREE_PUBLIC set. */
2540 if (DECL_CLASS_CONTEXT (decl))
2544 /* Everything else has internal linkage. */
2548 /* EXP is an expression that we want to pre-evaluate. Returns (in
2549 *INITP) an expression that will perform the pre-evaluation. The
2550 value returned by this function is a side-effect free expression
2551 equivalent to the pre-evaluated expression. Callers must ensure
2552 that *INITP is evaluated before EXP. */
2555 stabilize_expr (tree exp, tree* initp)
2559 if (!TREE_SIDE_EFFECTS (exp))
2560 init_expr = NULL_TREE;
2561 else if (!real_lvalue_p (exp)
2562 || !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (exp)))
2564 init_expr = get_target_expr (exp);
2565 exp = TARGET_EXPR_SLOT (init_expr);
2569 exp = build_unary_op (ADDR_EXPR, exp, 1);
2570 init_expr = get_target_expr (exp);
2571 exp = TARGET_EXPR_SLOT (init_expr);
2572 exp = build_indirect_ref (exp, 0);
2576 gcc_assert (!TREE_SIDE_EFFECTS (exp));
2580 /* Add NEW, an expression whose value we don't care about, after the
2581 similar expression ORIG. */
2584 add_stmt_to_compound (tree orig, tree new)
2586 if (!new || !TREE_SIDE_EFFECTS (new))
2588 if (!orig || !TREE_SIDE_EFFECTS (orig))
2590 return build2 (COMPOUND_EXPR, void_type_node, orig, new);
2593 /* Like stabilize_expr, but for a call whose arguments we want to
2594 pre-evaluate. CALL is modified in place to use the pre-evaluated
2595 arguments, while, upon return, *INITP contains an expression to
2596 compute the arguments. */
2599 stabilize_call (tree call, tree *initp)
2601 tree inits = NULL_TREE;
2603 int nargs = call_expr_nargs (call);
2605 if (call == error_mark_node || processing_template_decl)
2611 gcc_assert (TREE_CODE (call) == CALL_EXPR);
2613 for (i = 0; i < nargs; i++)
2616 CALL_EXPR_ARG (call, i) =
2617 stabilize_expr (CALL_EXPR_ARG (call, i), &init);
2618 inits = add_stmt_to_compound (inits, init);
2624 /* Like stabilize_expr, but for an AGGR_INIT_EXPR whose arguments we want
2625 to pre-evaluate. CALL is modified in place to use the pre-evaluated
2626 arguments, while, upon return, *INITP contains an expression to
2627 compute the arguments. */
2630 stabilize_aggr_init (tree call, tree *initp)
2632 tree inits = NULL_TREE;
2634 int nargs = aggr_init_expr_nargs (call);
2636 if (call == error_mark_node)
2639 gcc_assert (TREE_CODE (call) == AGGR_INIT_EXPR);
2641 for (i = 0; i < nargs; i++)
2644 AGGR_INIT_EXPR_ARG (call, i) =
2645 stabilize_expr (AGGR_INIT_EXPR_ARG (call, i), &init);
2646 inits = add_stmt_to_compound (inits, init);
2652 /* Like stabilize_expr, but for an initialization.
2654 If the initialization is for an object of class type, this function
2655 takes care not to introduce additional temporaries.
2657 Returns TRUE iff the expression was successfully pre-evaluated,
2658 i.e., if INIT is now side-effect free, except for, possible, a
2659 single call to a constructor. */
2662 stabilize_init (tree init, tree *initp)
2668 if (t == error_mark_node || processing_template_decl)
2671 if (TREE_CODE (t) == INIT_EXPR
2672 && TREE_CODE (TREE_OPERAND (t, 1)) != TARGET_EXPR)
2674 TREE_OPERAND (t, 1) = stabilize_expr (TREE_OPERAND (t, 1), initp);
2678 if (TREE_CODE (t) == INIT_EXPR)
2679 t = TREE_OPERAND (t, 1);
2680 if (TREE_CODE (t) == TARGET_EXPR)
2681 t = TARGET_EXPR_INITIAL (t);
2682 if (TREE_CODE (t) == COMPOUND_EXPR)
2684 if (TREE_CODE (t) == CONSTRUCTOR
2685 && EMPTY_CONSTRUCTOR_P (t))
2686 /* Default-initialization. */
2689 /* If the initializer is a COND_EXPR, we can't preevaluate
2691 if (TREE_CODE (t) == COND_EXPR)
2694 if (TREE_CODE (t) == CALL_EXPR)
2696 stabilize_call (t, initp);
2700 if (TREE_CODE (t) == AGGR_INIT_EXPR)
2702 stabilize_aggr_init (t, initp);
2706 /* The initialization is being performed via a bitwise copy -- and
2707 the item copied may have side effects. */
2708 return TREE_SIDE_EFFECTS (init);
2711 /* Like "fold", but should be used whenever we might be processing the
2712 body of a template. */
2715 fold_if_not_in_template (tree expr)
2717 /* In the body of a template, there is never any need to call
2718 "fold". We will call fold later when actually instantiating the
2719 template. Integral constant expressions in templates will be
2720 evaluated via fold_non_dependent_expr, as necessary. */
2721 if (processing_template_decl)
2724 /* Fold C++ front-end specific tree codes. */
2725 if (TREE_CODE (expr) == UNARY_PLUS_EXPR)
2726 return fold_convert (TREE_TYPE (expr), TREE_OPERAND (expr, 0));
2731 /* Returns true if a cast to TYPE may appear in an integral constant
2735 cast_valid_in_integral_constant_expression_p (tree type)
2737 return (INTEGRAL_OR_ENUMERATION_TYPE_P (type)
2738 || dependent_type_p (type)
2739 || type == error_mark_node);
2743 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
2744 /* Complain that some language-specific thing hanging off a tree
2745 node has been accessed improperly. */
2748 lang_check_failed (const char* file, int line, const char* function)
2750 internal_error ("lang_* check: failed in %s, at %s:%d",
2751 function, trim_filename (file), line);
2753 #endif /* ENABLE_TREE_CHECKING */
2755 #include "gt-cp-tree.h"