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;
652 /* Used by the C++ front end to build qualified array types. However,
653 the C version of this function does not properly maintain canonical
654 types (which are not used in C). */
656 c_build_qualified_type (tree type, int type_quals)
658 return cp_build_qualified_type (type, type_quals);
662 /* Make a variant of TYPE, qualified with the TYPE_QUALS. Handles
663 arrays correctly. In particular, if TYPE is an array of T's, and
664 TYPE_QUALS is non-empty, returns an array of qualified T's.
666 FLAGS determines how to deal with illformed qualifications. If
667 tf_ignore_bad_quals is set, then bad qualifications are dropped
668 (this is permitted if TYPE was introduced via a typedef or template
669 type parameter). If bad qualifications are dropped and tf_warning
670 is set, then a warning is issued for non-const qualifications. If
671 tf_ignore_bad_quals is not set and tf_error is not set, we
672 return error_mark_node. Otherwise, we issue an error, and ignore
675 Qualification of a reference type is valid when the reference came
676 via a typedef or template type argument. [dcl.ref] No such
677 dispensation is provided for qualifying a function type. [dcl.fct]
678 DR 295 queries this and the proposed resolution brings it into line
679 with qualifying a reference. We implement the DR. We also behave
680 in a similar manner for restricting non-pointer types. */
683 cp_build_qualified_type_real (tree type,
685 tsubst_flags_t complain)
688 int bad_quals = TYPE_UNQUALIFIED;
690 if (type == error_mark_node)
693 if (type_quals == cp_type_quals (type))
696 if (TREE_CODE (type) == ARRAY_TYPE)
698 /* In C++, the qualification really applies to the array element
699 type. Obtain the appropriately qualified element type. */
702 = cp_build_qualified_type_real (TREE_TYPE (type),
706 if (element_type == error_mark_node)
707 return error_mark_node;
709 /* See if we already have an identically qualified type. */
710 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
711 if (cp_type_quals (t) == type_quals
712 && TYPE_NAME (t) == TYPE_NAME (type)
713 && TYPE_CONTEXT (t) == TYPE_CONTEXT (type))
718 tree index_type = TYPE_DOMAIN (type);
720 cplus_array_info cai;
723 if (cplus_array_htab == NULL)
724 cplus_array_htab = htab_create_ggc (61, &cplus_array_hash,
725 &cplus_array_compare,
728 hash = (htab_hash_pointer (element_type)
729 ^ htab_hash_pointer (index_type));
730 cai.type = element_type;
731 cai.domain = index_type;
733 e = htab_find_slot_with_hash (cplus_array_htab, &cai, hash, INSERT);
735 /* We have found the type: we're done. */
738 /* Build a new array type and add it into the table. */
739 t = build_variant_type_copy (type);
740 TREE_TYPE (t) = element_type;
743 /* Set the canonical type for this new node. */
744 if (TYPE_STRUCTURAL_EQUALITY_P (element_type)
745 || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type)))
746 SET_TYPE_STRUCTURAL_EQUALITY (t);
747 else if (TYPE_CANONICAL (element_type) != element_type
749 && TYPE_CANONICAL (index_type) != index_type)
750 || TYPE_CANONICAL (type) != type)
752 = build_cplus_array_type
753 (TYPE_CANONICAL (element_type),
754 index_type? TYPE_CANONICAL (index_type) : index_type);
756 TYPE_CANONICAL (t) = t;
759 /* Even if we already had this variant, we update
760 TYPE_NEEDS_CONSTRUCTING and TYPE_HAS_NONTRIVIAL_DESTRUCTOR in case
761 they changed since the variant was originally created.
763 This seems hokey; if there is some way to use a previous
764 variant *without* coming through here,
765 TYPE_NEEDS_CONSTRUCTING will never be updated. */
766 TYPE_NEEDS_CONSTRUCTING (t)
767 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (element_type));
768 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
769 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (element_type));
772 else if (TYPE_PTRMEMFUNC_P (type))
774 /* For a pointer-to-member type, we can't just return a
775 cv-qualified version of the RECORD_TYPE. If we do, we
776 haven't changed the field that contains the actual pointer to
777 a method, and so TYPE_PTRMEMFUNC_FN_TYPE will be wrong. */
780 t = TYPE_PTRMEMFUNC_FN_TYPE (type);
781 t = cp_build_qualified_type_real (t, type_quals, complain);
782 return build_ptrmemfunc_type (t);
784 else if (TREE_CODE (type) == TYPE_PACK_EXPANSION)
786 tree t = PACK_EXPANSION_PATTERN (type);
788 t = cp_build_qualified_type_real (t, type_quals, complain);
789 return make_pack_expansion (t);
792 /* A reference or method type shall not be cv qualified.
793 [dcl.ref], [dct.fct] */
794 if (type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE)
795 && (TREE_CODE (type) == REFERENCE_TYPE
796 || TREE_CODE (type) == METHOD_TYPE))
798 bad_quals |= type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
799 type_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
802 /* A restrict-qualified type must be a pointer (or reference)
803 to object or incomplete type, or a function type. */
804 if ((type_quals & TYPE_QUAL_RESTRICT)
805 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
806 && TREE_CODE (type) != TYPENAME_TYPE
807 && TREE_CODE (type) != FUNCTION_TYPE
808 && !POINTER_TYPE_P (type))
810 bad_quals |= TYPE_QUAL_RESTRICT;
811 type_quals &= ~TYPE_QUAL_RESTRICT;
814 if (bad_quals == TYPE_UNQUALIFIED)
816 else if (!(complain & (tf_error | tf_ignore_bad_quals)))
817 return error_mark_node;
820 if (complain & tf_ignore_bad_quals)
821 /* We're not going to warn about constifying things that can't
823 bad_quals &= ~TYPE_QUAL_CONST;
826 tree bad_type = build_qualified_type (ptr_type_node, bad_quals);
828 if (!(complain & tf_ignore_bad_quals))
829 error ("%qV qualifiers cannot be applied to %qT",
834 /* Retrieve (or create) the appropriately qualified variant. */
835 result = build_qualified_type (type, type_quals);
837 /* If this was a pointer-to-method type, and we just made a copy,
838 then we need to unshare the record that holds the cached
839 pointer-to-member-function type, because these will be distinct
840 between the unqualified and qualified types. */
842 && TREE_CODE (type) == POINTER_TYPE
843 && TREE_CODE (TREE_TYPE (type)) == METHOD_TYPE)
844 TYPE_LANG_SPECIFIC (result) = NULL;
849 /* Returns the canonical version of TYPE. In other words, if TYPE is
850 a typedef, returns the underlying type. The cv-qualification of
851 the type returned matches the type input; they will always be
855 canonical_type_variant (tree t)
857 if (t == error_mark_node)
858 return error_mark_node;
860 return cp_build_qualified_type (TYPE_MAIN_VARIANT (t), cp_type_quals (t));
863 /* Makes a copy of BINFO and TYPE, which is to be inherited into a
864 graph dominated by T. If BINFO is NULL, TYPE is a dependent base,
865 and we do a shallow copy. If BINFO is non-NULL, we do a deep copy.
866 VIRT indicates whether TYPE is inherited virtually or not.
867 IGO_PREV points at the previous binfo of the inheritance graph
868 order chain. The newly copied binfo's TREE_CHAIN forms this
871 The CLASSTYPE_VBASECLASSES vector of T is constructed in the
872 correct order. That is in the order the bases themselves should be
875 The BINFO_INHERITANCE of a virtual base class points to the binfo
876 of the most derived type. ??? We could probably change this so that
877 BINFO_INHERITANCE becomes synonymous with BINFO_PRIMARY, and hence
878 remove a field. They currently can only differ for primary virtual
882 copy_binfo (tree binfo, tree type, tree t, tree *igo_prev, int virt)
888 /* See if we've already made this virtual base. */
889 new_binfo = binfo_for_vbase (type, t);
894 new_binfo = make_tree_binfo (binfo ? BINFO_N_BASE_BINFOS (binfo) : 0);
895 BINFO_TYPE (new_binfo) = type;
897 /* Chain it into the inheritance graph. */
898 TREE_CHAIN (*igo_prev) = new_binfo;
899 *igo_prev = new_binfo;
906 gcc_assert (!BINFO_DEPENDENT_BASE_P (binfo));
907 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), type));
909 BINFO_OFFSET (new_binfo) = BINFO_OFFSET (binfo);
910 BINFO_VIRTUALS (new_binfo) = BINFO_VIRTUALS (binfo);
912 /* We do not need to copy the accesses, as they are read only. */
913 BINFO_BASE_ACCESSES (new_binfo) = BINFO_BASE_ACCESSES (binfo);
915 /* Recursively copy base binfos of BINFO. */
916 for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++)
920 gcc_assert (!BINFO_DEPENDENT_BASE_P (base_binfo));
921 new_base_binfo = copy_binfo (base_binfo, BINFO_TYPE (base_binfo),
923 BINFO_VIRTUAL_P (base_binfo));
925 if (!BINFO_INHERITANCE_CHAIN (new_base_binfo))
926 BINFO_INHERITANCE_CHAIN (new_base_binfo) = new_binfo;
927 BINFO_BASE_APPEND (new_binfo, new_base_binfo);
931 BINFO_DEPENDENT_BASE_P (new_binfo) = 1;
935 /* Push it onto the list after any virtual bases it contains
936 will have been pushed. */
937 VEC_quick_push (tree, CLASSTYPE_VBASECLASSES (t), new_binfo);
938 BINFO_VIRTUAL_P (new_binfo) = 1;
939 BINFO_INHERITANCE_CHAIN (new_binfo) = TYPE_BINFO (t);
945 /* Hashing of lists so that we don't make duplicates.
946 The entry point is `list_hash_canon'. */
948 /* Now here is the hash table. When recording a list, it is added
949 to the slot whose index is the hash code mod the table size.
950 Note that the hash table is used for several kinds of lists.
951 While all these live in the same table, they are completely independent,
952 and the hash code is computed differently for each of these. */
954 static GTY ((param_is (union tree_node))) htab_t list_hash_table;
963 /* Compare ENTRY (an entry in the hash table) with DATA (a list_proxy
964 for a node we are thinking about adding). */
967 list_hash_eq (const void* entry, const void* data)
969 const_tree const t = (const_tree) entry;
970 const struct list_proxy *const proxy = (const struct list_proxy *) data;
972 return (TREE_VALUE (t) == proxy->value
973 && TREE_PURPOSE (t) == proxy->purpose
974 && TREE_CHAIN (t) == proxy->chain);
977 /* Compute a hash code for a list (chain of TREE_LIST nodes
978 with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the
979 TREE_COMMON slots), by adding the hash codes of the individual entries. */
982 list_hash_pieces (tree purpose, tree value, tree chain)
984 hashval_t hashcode = 0;
987 hashcode += TREE_HASH (chain);
990 hashcode += TREE_HASH (value);
994 hashcode += TREE_HASH (purpose);
1000 /* Hash an already existing TREE_LIST. */
1003 list_hash (const void* p)
1005 const_tree const t = (const_tree) p;
1006 return list_hash_pieces (TREE_PURPOSE (t),
1011 /* Given list components PURPOSE, VALUE, AND CHAIN, return the canonical
1012 object for an identical list if one already exists. Otherwise, build a
1013 new one, and record it as the canonical object. */
1016 hash_tree_cons (tree purpose, tree value, tree chain)
1020 struct list_proxy proxy;
1022 /* Hash the list node. */
1023 hashcode = list_hash_pieces (purpose, value, chain);
1024 /* Create a proxy for the TREE_LIST we would like to create. We
1025 don't actually create it so as to avoid creating garbage. */
1026 proxy.purpose = purpose;
1027 proxy.value = value;
1028 proxy.chain = chain;
1029 /* See if it is already in the table. */
1030 slot = htab_find_slot_with_hash (list_hash_table, &proxy, hashcode,
1032 /* If not, create a new node. */
1034 *slot = tree_cons (purpose, value, chain);
1035 return (tree) *slot;
1038 /* Constructor for hashed lists. */
1041 hash_tree_chain (tree value, tree chain)
1043 return hash_tree_cons (NULL_TREE, value, chain);
1047 debug_binfo (tree elem)
1052 fprintf (stderr, "type \"%s\", offset = " HOST_WIDE_INT_PRINT_DEC
1054 TYPE_NAME_STRING (BINFO_TYPE (elem)),
1055 TREE_INT_CST_LOW (BINFO_OFFSET (elem)));
1056 debug_tree (BINFO_TYPE (elem));
1057 if (BINFO_VTABLE (elem))
1058 fprintf (stderr, "vtable decl \"%s\"\n",
1059 IDENTIFIER_POINTER (DECL_NAME (get_vtbl_decl_for_binfo (elem))));
1061 fprintf (stderr, "no vtable decl yet\n");
1062 fprintf (stderr, "virtuals:\n");
1063 virtuals = BINFO_VIRTUALS (elem);
1068 tree fndecl = TREE_VALUE (virtuals);
1069 fprintf (stderr, "%s [%ld =? %ld]\n",
1070 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl)),
1071 (long) n, (long) TREE_INT_CST_LOW (DECL_VINDEX (fndecl)));
1073 virtuals = TREE_CHAIN (virtuals);
1077 /* Build a representation for the qualified name SCOPE::NAME. TYPE is
1078 the type of the result expression, if known, or NULL_TREE if the
1079 resulting expression is type-dependent. If TEMPLATE_P is true,
1080 NAME is known to be a template because the user explicitly used the
1081 "template" keyword after the "::".
1083 All SCOPE_REFs should be built by use of this function. */
1086 build_qualified_name (tree type, tree scope, tree name, bool template_p)
1089 if (type == error_mark_node
1090 || scope == error_mark_node
1091 || name == error_mark_node)
1092 return error_mark_node;
1093 t = build2 (SCOPE_REF, type, scope, name);
1094 QUALIFIED_NAME_IS_TEMPLATE (t) = template_p;
1098 /* Returns nonzero if X is an expression for a (possibly overloaded)
1099 function. If "f" is a function or function template, "f", "c->f",
1100 "c.f", "C::f", and "f<int>" will all be considered possibly
1101 overloaded functions. Returns 2 if the function is actually
1102 overloaded, i.e., if it is impossible to know the type of the
1103 function without performing overload resolution. */
1106 is_overloaded_fn (tree x)
1108 /* A baselink is also considered an overloaded function. */
1109 if (TREE_CODE (x) == OFFSET_REF
1110 || TREE_CODE (x) == COMPONENT_REF)
1111 x = TREE_OPERAND (x, 1);
1113 x = BASELINK_FUNCTIONS (x);
1114 if (TREE_CODE (x) == TEMPLATE_ID_EXPR
1115 || DECL_FUNCTION_TEMPLATE_P (OVL_CURRENT (x))
1116 || (TREE_CODE (x) == OVERLOAD && OVL_CHAIN (x)))
1118 return (TREE_CODE (x) == FUNCTION_DECL
1119 || TREE_CODE (x) == OVERLOAD);
1122 /* Returns true iff X is an expression for an overloaded function
1123 whose type cannot be known without performing overload
1127 really_overloaded_fn (tree x)
1129 return is_overloaded_fn (x) == 2;
1133 get_first_fn (tree from)
1135 gcc_assert (is_overloaded_fn (from));
1136 /* A baselink is also considered an overloaded function. */
1137 if (TREE_CODE (from) == COMPONENT_REF)
1138 from = TREE_OPERAND (from, 1);
1139 if (BASELINK_P (from))
1140 from = BASELINK_FUNCTIONS (from);
1141 return OVL_CURRENT (from);
1144 /* Return a new OVL node, concatenating it with the old one. */
1147 ovl_cons (tree decl, tree chain)
1149 tree result = make_node (OVERLOAD);
1150 TREE_TYPE (result) = unknown_type_node;
1151 OVL_FUNCTION (result) = decl;
1152 TREE_CHAIN (result) = chain;
1157 /* Build a new overloaded function. If this is the first one,
1158 just return it; otherwise, ovl_cons the _DECLs */
1161 build_overload (tree decl, tree chain)
1163 if (! chain && TREE_CODE (decl) != TEMPLATE_DECL)
1165 if (chain && TREE_CODE (chain) != OVERLOAD)
1166 chain = ovl_cons (chain, NULL_TREE);
1167 return ovl_cons (decl, chain);
1171 #define PRINT_RING_SIZE 4
1174 cxx_printable_name (tree decl, int v)
1176 static unsigned int uid_ring[PRINT_RING_SIZE];
1177 static char *print_ring[PRINT_RING_SIZE];
1178 static int ring_counter;
1181 /* Only cache functions. */
1183 || TREE_CODE (decl) != FUNCTION_DECL
1184 || DECL_LANG_SPECIFIC (decl) == 0)
1185 return lang_decl_name (decl, v);
1187 /* See if this print name is lying around. */
1188 for (i = 0; i < PRINT_RING_SIZE; i++)
1189 if (uid_ring[i] == DECL_UID (decl))
1190 /* yes, so return it. */
1191 return print_ring[i];
1193 if (++ring_counter == PRINT_RING_SIZE)
1196 if (current_function_decl != NULL_TREE)
1198 if (uid_ring[ring_counter] == DECL_UID (current_function_decl))
1200 if (ring_counter == PRINT_RING_SIZE)
1202 gcc_assert (uid_ring[ring_counter] != DECL_UID (current_function_decl));
1205 if (print_ring[ring_counter])
1206 free (print_ring[ring_counter]);
1208 print_ring[ring_counter] = xstrdup (lang_decl_name (decl, v));
1209 uid_ring[ring_counter] = DECL_UID (decl);
1210 return print_ring[ring_counter];
1213 /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions
1214 listed in RAISES. */
1217 build_exception_variant (tree type, tree raises)
1219 tree v = TYPE_MAIN_VARIANT (type);
1220 int type_quals = TYPE_QUALS (type);
1222 for (; v; v = TYPE_NEXT_VARIANT (v))
1223 if (check_qualified_type (v, type, type_quals)
1224 && comp_except_specs (raises, TYPE_RAISES_EXCEPTIONS (v), 1))
1227 /* Need to build a new variant. */
1228 v = build_variant_type_copy (type);
1229 TYPE_RAISES_EXCEPTIONS (v) = raises;
1233 /* Given a TEMPLATE_TEMPLATE_PARM node T, create a new
1234 BOUND_TEMPLATE_TEMPLATE_PARM bound with NEWARGS as its template
1238 bind_template_template_parm (tree t, tree newargs)
1240 tree decl = TYPE_NAME (t);
1243 t2 = make_aggr_type (BOUND_TEMPLATE_TEMPLATE_PARM);
1244 decl = build_decl (TYPE_DECL, DECL_NAME (decl), NULL_TREE);
1246 /* These nodes have to be created to reflect new TYPE_DECL and template
1248 TEMPLATE_TYPE_PARM_INDEX (t2) = copy_node (TEMPLATE_TYPE_PARM_INDEX (t));
1249 TEMPLATE_PARM_DECL (TEMPLATE_TYPE_PARM_INDEX (t2)) = decl;
1250 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2)
1251 = tree_cons (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t),
1252 newargs, NULL_TREE);
1254 TREE_TYPE (decl) = t2;
1255 TYPE_NAME (t2) = decl;
1256 TYPE_STUB_DECL (t2) = decl;
1258 SET_TYPE_STRUCTURAL_EQUALITY (t2);
1263 /* Called from count_trees via walk_tree. */
1266 count_trees_r (tree *tp, int *walk_subtrees, void *data)
1276 /* Debugging function for measuring the rough complexity of a tree
1280 count_trees (tree t)
1283 cp_walk_tree_without_duplicates (&t, count_trees_r, &n_trees);
1287 /* Called from verify_stmt_tree via walk_tree. */
1290 verify_stmt_tree_r (tree* tp,
1291 int* walk_subtrees ATTRIBUTE_UNUSED ,
1295 htab_t *statements = (htab_t *) data;
1298 if (!STATEMENT_CODE_P (TREE_CODE (t)))
1301 /* If this statement is already present in the hash table, then
1302 there is a circularity in the statement tree. */
1303 gcc_assert (!htab_find (*statements, t));
1305 slot = htab_find_slot (*statements, t, INSERT);
1311 /* Debugging function to check that the statement T has not been
1312 corrupted. For now, this function simply checks that T contains no
1316 verify_stmt_tree (tree t)
1319 statements = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
1320 cp_walk_tree (&t, verify_stmt_tree_r, &statements, NULL);
1321 htab_delete (statements);
1324 /* Check if the type T depends on a type with no linkage and if so, return
1325 it. If RELAXED_P then do not consider a class type declared within
1326 a TREE_PUBLIC function to have no linkage. */
1329 no_linkage_check (tree t, bool relaxed_p)
1333 /* There's no point in checking linkage on template functions; we
1334 can't know their complete types. */
1335 if (processing_template_decl)
1338 switch (TREE_CODE (t))
1343 if (TYPE_PTRMEMFUNC_P (t))
1347 if (!CLASS_TYPE_P (t))
1351 if (TYPE_ANONYMOUS_P (t))
1353 fn = decl_function_context (TYPE_MAIN_DECL (t));
1354 if (fn && (!relaxed_p || !TREE_PUBLIC (fn)))
1360 case REFERENCE_TYPE:
1361 return no_linkage_check (TREE_TYPE (t), relaxed_p);
1365 r = no_linkage_check (TYPE_PTRMEM_POINTED_TO_TYPE (t),
1369 return no_linkage_check (TYPE_PTRMEM_CLASS_TYPE (t), relaxed_p);
1372 r = no_linkage_check (TYPE_METHOD_BASETYPE (t), relaxed_p);
1379 for (parm = TYPE_ARG_TYPES (t);
1380 parm && parm != void_list_node;
1381 parm = TREE_CHAIN (parm))
1383 r = no_linkage_check (TREE_VALUE (parm), relaxed_p);
1387 return no_linkage_check (TREE_TYPE (t), relaxed_p);
1395 #ifdef GATHER_STATISTICS
1396 extern int depth_reached;
1400 cxx_print_statistics (void)
1402 print_search_statistics ();
1403 print_class_statistics ();
1404 #ifdef GATHER_STATISTICS
1405 fprintf (stderr, "maximum template instantiation depth reached: %d\n",
1410 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1411 (which is an ARRAY_TYPE). This counts only elements of the top
1415 array_type_nelts_top (tree type)
1417 return fold_build2 (PLUS_EXPR, sizetype,
1418 array_type_nelts (type),
1422 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1423 (which is an ARRAY_TYPE). This one is a recursive count of all
1424 ARRAY_TYPEs that are clumped together. */
1427 array_type_nelts_total (tree type)
1429 tree sz = array_type_nelts_top (type);
1430 type = TREE_TYPE (type);
1431 while (TREE_CODE (type) == ARRAY_TYPE)
1433 tree n = array_type_nelts_top (type);
1434 sz = fold_build2 (MULT_EXPR, sizetype, sz, n);
1435 type = TREE_TYPE (type);
1440 /* Called from break_out_target_exprs via mapcar. */
1443 bot_manip (tree* tp, int* walk_subtrees, void* data)
1445 splay_tree target_remap = ((splay_tree) data);
1448 if (!TYPE_P (t) && TREE_CONSTANT (t))
1450 /* There can't be any TARGET_EXPRs or their slot variables below
1451 this point. We used to check !TREE_SIDE_EFFECTS, but then we
1452 failed to copy an ADDR_EXPR of the slot VAR_DECL. */
1456 if (TREE_CODE (t) == TARGET_EXPR)
1460 if (TREE_CODE (TREE_OPERAND (t, 1)) == AGGR_INIT_EXPR)
1462 (TREE_TYPE (t), break_out_target_exprs (TREE_OPERAND (t, 1)));
1464 u = build_target_expr_with_type
1465 (break_out_target_exprs (TREE_OPERAND (t, 1)), TREE_TYPE (t));
1467 /* Map the old variable to the new one. */
1468 splay_tree_insert (target_remap,
1469 (splay_tree_key) TREE_OPERAND (t, 0),
1470 (splay_tree_value) TREE_OPERAND (u, 0));
1472 /* Replace the old expression with the new version. */
1474 /* We don't have to go below this point; the recursive call to
1475 break_out_target_exprs will have handled anything below this
1481 /* Make a copy of this node. */
1482 return copy_tree_r (tp, walk_subtrees, NULL);
1485 /* Replace all remapped VAR_DECLs in T with their new equivalents.
1486 DATA is really a splay-tree mapping old variables to new
1490 bot_replace (tree* t,
1491 int* walk_subtrees ATTRIBUTE_UNUSED ,
1494 splay_tree target_remap = ((splay_tree) data);
1496 if (TREE_CODE (*t) == VAR_DECL)
1498 splay_tree_node n = splay_tree_lookup (target_remap,
1499 (splay_tree_key) *t);
1501 *t = (tree) n->value;
1507 /* When we parse a default argument expression, we may create
1508 temporary variables via TARGET_EXPRs. When we actually use the
1509 default-argument expression, we make a copy of the expression, but
1510 we must replace the temporaries with appropriate local versions. */
1513 break_out_target_exprs (tree t)
1515 static int target_remap_count;
1516 static splay_tree target_remap;
1518 if (!target_remap_count++)
1519 target_remap = splay_tree_new (splay_tree_compare_pointers,
1520 /*splay_tree_delete_key_fn=*/NULL,
1521 /*splay_tree_delete_value_fn=*/NULL);
1522 cp_walk_tree (&t, bot_manip, target_remap, NULL);
1523 cp_walk_tree (&t, bot_replace, target_remap, NULL);
1525 if (!--target_remap_count)
1527 splay_tree_delete (target_remap);
1528 target_remap = NULL;
1534 /* Similar to `build_nt', but for template definitions of dependent
1538 build_min_nt (enum tree_code code, ...)
1545 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
1549 t = make_node (code);
1550 length = TREE_CODE_LENGTH (code);
1552 for (i = 0; i < length; i++)
1554 tree x = va_arg (p, tree);
1555 TREE_OPERAND (t, i) = x;
1563 /* Similar to `build', but for template definitions. */
1566 build_min (enum tree_code code, tree tt, ...)
1573 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
1577 t = make_node (code);
1578 length = TREE_CODE_LENGTH (code);
1581 for (i = 0; i < length; i++)
1583 tree x = va_arg (p, tree);
1584 TREE_OPERAND (t, i) = x;
1585 if (x && !TYPE_P (x) && TREE_SIDE_EFFECTS (x))
1586 TREE_SIDE_EFFECTS (t) = 1;
1593 /* Similar to `build', but for template definitions of non-dependent
1594 expressions. NON_DEP is the non-dependent expression that has been
1598 build_min_non_dep (enum tree_code code, tree non_dep, ...)
1605 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
1607 va_start (p, non_dep);
1609 t = make_node (code);
1610 length = TREE_CODE_LENGTH (code);
1611 TREE_TYPE (t) = TREE_TYPE (non_dep);
1612 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (non_dep);
1614 for (i = 0; i < length; i++)
1616 tree x = va_arg (p, tree);
1617 TREE_OPERAND (t, i) = x;
1620 if (code == COMPOUND_EXPR && TREE_CODE (non_dep) != COMPOUND_EXPR)
1621 /* This should not be considered a COMPOUND_EXPR, because it
1622 resolves to an overload. */
1623 COMPOUND_EXPR_OVERLOADED (t) = 1;
1629 /* Similar to `build_call_list', but for template definitions of non-dependent
1630 expressions. NON_DEP is the non-dependent expression that has been
1634 build_min_non_dep_call_list (tree non_dep, tree fn, tree arglist)
1636 tree t = build_nt_call_list (fn, arglist);
1637 TREE_TYPE (t) = TREE_TYPE (non_dep);
1638 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (non_dep);
1643 get_type_decl (tree t)
1645 if (TREE_CODE (t) == TYPE_DECL)
1648 return TYPE_STUB_DECL (t);
1649 gcc_assert (t == error_mark_node);
1653 /* Returns the namespace that contains DECL, whether directly or
1657 decl_namespace_context (tree decl)
1661 if (TREE_CODE (decl) == NAMESPACE_DECL)
1663 else if (TYPE_P (decl))
1664 decl = CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl));
1666 decl = CP_DECL_CONTEXT (decl);
1670 /* Returns true if decl is within an anonymous namespace, however deeply
1671 nested, or false otherwise. */
1674 decl_anon_ns_mem_p (const_tree decl)
1678 if (decl == NULL_TREE || decl == error_mark_node)
1680 if (TREE_CODE (decl) == NAMESPACE_DECL
1681 && DECL_NAME (decl) == NULL_TREE)
1683 /* Classes and namespaces inside anonymous namespaces have
1684 TREE_PUBLIC == 0, so we can shortcut the search. */
1685 else if (TYPE_P (decl))
1686 return (TREE_PUBLIC (TYPE_NAME (decl)) == 0);
1687 else if (TREE_CODE (decl) == NAMESPACE_DECL)
1688 return (TREE_PUBLIC (decl) == 0);
1690 decl = DECL_CONTEXT (decl);
1694 /* Return truthvalue of whether T1 is the same tree structure as T2.
1695 Return 1 if they are the same. Return 0 if they are different. */
1698 cp_tree_equal (tree t1, tree t2)
1700 enum tree_code code1, code2;
1707 for (code1 = TREE_CODE (t1);
1708 code1 == NOP_EXPR || code1 == CONVERT_EXPR
1709 || code1 == NON_LVALUE_EXPR;
1710 code1 = TREE_CODE (t1))
1711 t1 = TREE_OPERAND (t1, 0);
1712 for (code2 = TREE_CODE (t2);
1713 code2 == NOP_EXPR || code2 == CONVERT_EXPR
1714 || code1 == NON_LVALUE_EXPR;
1715 code2 = TREE_CODE (t2))
1716 t2 = TREE_OPERAND (t2, 0);
1718 /* They might have become equal now. */
1728 return TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
1729 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2);
1732 return REAL_VALUES_EQUAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
1735 return TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
1736 && !memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
1737 TREE_STRING_LENGTH (t1));
1740 return cp_tree_equal (TREE_REALPART (t1), TREE_REALPART (t2))
1741 && cp_tree_equal (TREE_IMAGPART (t1), TREE_IMAGPART (t2));
1744 /* We need to do this when determining whether or not two
1745 non-type pointer to member function template arguments
1747 if (!(same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
1748 /* The first operand is RTL. */
1749 && TREE_OPERAND (t1, 0) == TREE_OPERAND (t2, 0)))
1751 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1754 if (!cp_tree_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2)))
1756 if (!cp_tree_equal (TREE_VALUE (t1), TREE_VALUE (t2)))
1758 return cp_tree_equal (TREE_CHAIN (t1), TREE_CHAIN (t2));
1761 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1766 call_expr_arg_iterator iter1, iter2;
1767 if (!cp_tree_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2)))
1769 for (arg1 = first_call_expr_arg (t1, &iter1),
1770 arg2 = first_call_expr_arg (t2, &iter2);
1772 arg1 = next_call_expr_arg (&iter1),
1773 arg2 = next_call_expr_arg (&iter2))
1774 if (!cp_tree_equal (arg1, arg2))
1776 return (arg1 || arg2);
1781 tree o1 = TREE_OPERAND (t1, 0);
1782 tree o2 = TREE_OPERAND (t2, 0);
1784 /* Special case: if either target is an unallocated VAR_DECL,
1785 it means that it's going to be unified with whatever the
1786 TARGET_EXPR is really supposed to initialize, so treat it
1787 as being equivalent to anything. */
1788 if (TREE_CODE (o1) == VAR_DECL && DECL_NAME (o1) == NULL_TREE
1789 && !DECL_RTL_SET_P (o1))
1791 else if (TREE_CODE (o2) == VAR_DECL && DECL_NAME (o2) == NULL_TREE
1792 && !DECL_RTL_SET_P (o2))
1794 else if (!cp_tree_equal (o1, o2))
1797 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1800 case WITH_CLEANUP_EXPR:
1801 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1803 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
1806 if (TREE_OPERAND (t1, 1) != TREE_OPERAND (t2, 1))
1808 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1815 case IDENTIFIER_NODE:
1820 return (BASELINK_BINFO (t1) == BASELINK_BINFO (t2)
1821 && BASELINK_ACCESS_BINFO (t1) == BASELINK_ACCESS_BINFO (t2)
1822 && cp_tree_equal (BASELINK_FUNCTIONS (t1),
1823 BASELINK_FUNCTIONS (t2)));
1825 case TEMPLATE_PARM_INDEX:
1826 return (TEMPLATE_PARM_IDX (t1) == TEMPLATE_PARM_IDX (t2)
1827 && TEMPLATE_PARM_LEVEL (t1) == TEMPLATE_PARM_LEVEL (t2)
1828 && same_type_p (TREE_TYPE (TEMPLATE_PARM_DECL (t1)),
1829 TREE_TYPE (TEMPLATE_PARM_DECL (t2))));
1831 case TEMPLATE_ID_EXPR:
1836 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1838 vec1 = TREE_OPERAND (t1, 1);
1839 vec2 = TREE_OPERAND (t2, 1);
1842 return !vec1 && !vec2;
1844 if (TREE_VEC_LENGTH (vec1) != TREE_VEC_LENGTH (vec2))
1847 for (ix = TREE_VEC_LENGTH (vec1); ix--;)
1848 if (!cp_tree_equal (TREE_VEC_ELT (vec1, ix),
1849 TREE_VEC_ELT (vec2, ix)))
1858 tree o1 = TREE_OPERAND (t1, 0);
1859 tree o2 = TREE_OPERAND (t2, 0);
1861 if (TREE_CODE (o1) != TREE_CODE (o2))
1864 return same_type_p (o1, o2);
1866 return cp_tree_equal (o1, o2);
1871 tree t1_op1, t2_op1;
1873 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1876 t1_op1 = TREE_OPERAND (t1, 1);
1877 t2_op1 = TREE_OPERAND (t2, 1);
1878 if (TREE_CODE (t1_op1) != TREE_CODE (t2_op1))
1881 return cp_tree_equal (TREE_OPERAND (t1, 2), TREE_OPERAND (t2, 2));
1885 /* Two pointer-to-members are the same if they point to the same
1886 field or function in the same class. */
1887 if (PTRMEM_CST_MEMBER (t1) != PTRMEM_CST_MEMBER (t2))
1890 return same_type_p (PTRMEM_CST_CLASS (t1), PTRMEM_CST_CLASS (t2));
1893 if (OVL_FUNCTION (t1) != OVL_FUNCTION (t2))
1895 return cp_tree_equal (OVL_CHAIN (t1), OVL_CHAIN (t2));
1898 if (TRAIT_EXPR_KIND (t1) != TRAIT_EXPR_KIND (t2))
1900 return same_type_p (TRAIT_EXPR_TYPE1 (t1), TRAIT_EXPR_TYPE1 (t2))
1901 && same_type_p (TRAIT_EXPR_TYPE2 (t1), TRAIT_EXPR_TYPE2 (t2));
1907 switch (TREE_CODE_CLASS (code1))
1911 case tcc_comparison:
1912 case tcc_expression:
1919 n = TREE_OPERAND_LENGTH (t1);
1920 if (TREE_CODE_CLASS (code1) == tcc_vl_exp
1921 && n != TREE_OPERAND_LENGTH (t2))
1924 for (i = 0; i < n; ++i)
1925 if (!cp_tree_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i)))
1932 return same_type_p (t1, t2);
1936 /* We can get here with --disable-checking. */
1940 /* The type of ARG when used as an lvalue. */
1943 lvalue_type (tree arg)
1945 tree type = TREE_TYPE (arg);
1949 /* The type of ARG for printing error messages; denote lvalues with
1953 error_type (tree arg)
1955 tree type = TREE_TYPE (arg);
1957 if (TREE_CODE (type) == ARRAY_TYPE)
1959 else if (TREE_CODE (type) == ERROR_MARK)
1961 else if (real_lvalue_p (arg))
1962 type = build_reference_type (lvalue_type (arg));
1963 else if (IS_AGGR_TYPE (type))
1964 type = lvalue_type (arg);
1969 /* Does FUNCTION use a variable-length argument list? */
1972 varargs_function_p (const_tree function)
1974 const_tree parm = TYPE_ARG_TYPES (TREE_TYPE (function));
1975 for (; parm; parm = TREE_CHAIN (parm))
1976 if (TREE_VALUE (parm) == void_type_node)
1981 /* Returns 1 if decl is a member of a class. */
1984 member_p (const_tree decl)
1986 const_tree const ctx = DECL_CONTEXT (decl);
1987 return (ctx && TYPE_P (ctx));
1990 /* Create a placeholder for member access where we don't actually have an
1991 object that the access is against. */
1994 build_dummy_object (tree type)
1996 tree decl = build1 (NOP_EXPR, build_pointer_type (type), void_zero_node);
1997 return build_indirect_ref (decl, NULL);
2000 /* We've gotten a reference to a member of TYPE. Return *this if appropriate,
2001 or a dummy object otherwise. If BINFOP is non-0, it is filled with the
2002 binfo path from current_class_type to TYPE, or 0. */
2005 maybe_dummy_object (tree type, tree* binfop)
2010 if (current_class_type
2011 && (binfo = lookup_base (current_class_type, type,
2012 ba_unique | ba_quiet, NULL)))
2013 context = current_class_type;
2016 /* Reference from a nested class member function. */
2018 binfo = TYPE_BINFO (type);
2024 if (current_class_ref && context == current_class_type
2025 /* Kludge: Make sure that current_class_type is actually
2026 correct. It might not be if we're in the middle of
2027 tsubst_default_argument. */
2028 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref)),
2029 current_class_type))
2030 decl = current_class_ref;
2032 decl = build_dummy_object (context);
2037 /* Returns 1 if OB is a placeholder object, or a pointer to one. */
2040 is_dummy_object (const_tree ob)
2042 if (TREE_CODE (ob) == INDIRECT_REF)
2043 ob = TREE_OPERAND (ob, 0);
2044 return (TREE_CODE (ob) == NOP_EXPR
2045 && TREE_OPERAND (ob, 0) == void_zero_node);
2048 /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */
2051 pod_type_p (const_tree t)
2053 /* This CONST_CAST is okay because strip_array_types returns it's
2054 argument unmodified and we assign it to a const_tree. */
2055 t = strip_array_types (CONST_CAST_TREE(t));
2057 if (t == error_mark_node)
2059 if (INTEGRAL_TYPE_P (t))
2060 return 1; /* integral, character or enumeral type */
2061 if (FLOAT_TYPE_P (t))
2064 return 1; /* pointer to non-member */
2065 if (TYPE_PTR_TO_MEMBER_P (t))
2066 return 1; /* pointer to member */
2068 if (TREE_CODE (t) == VECTOR_TYPE)
2069 return 1; /* vectors are (small) arrays of scalars */
2071 if (! CLASS_TYPE_P (t))
2072 return 0; /* other non-class type (reference or function) */
2073 if (CLASSTYPE_NON_POD_P (t))
2078 /* Nonzero iff type T is a class template implicit specialization. */
2081 class_tmpl_impl_spec_p (const_tree t)
2083 return CLASS_TYPE_P (t) && CLASSTYPE_TEMPLATE_INSTANTIATION (t);
2086 /* Returns 1 iff zero initialization of type T means actually storing
2090 zero_init_p (const_tree t)
2092 /* This CONST_CAST is okay because strip_array_types returns it's
2093 argument unmodified and we assign it to a const_tree. */
2094 t = strip_array_types (CONST_CAST_TREE(t));
2096 if (t == error_mark_node)
2099 /* NULL pointers to data members are initialized with -1. */
2100 if (TYPE_PTRMEM_P (t))
2103 /* Classes that contain types that can't be zero-initialized, cannot
2104 be zero-initialized themselves. */
2105 if (CLASS_TYPE_P (t) && CLASSTYPE_NON_ZERO_INIT_P (t))
2111 /* Table of valid C++ attributes. */
2112 const struct attribute_spec cxx_attribute_table[] =
2114 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
2115 { "java_interface", 0, 0, false, false, false, handle_java_interface_attribute },
2116 { "com_interface", 0, 0, false, false, false, handle_com_interface_attribute },
2117 { "init_priority", 1, 1, true, false, false, handle_init_priority_attribute },
2118 { NULL, 0, 0, false, false, false, NULL }
2121 /* Handle a "java_interface" attribute; arguments as in
2122 struct attribute_spec.handler. */
2124 handle_java_interface_attribute (tree* node,
2126 tree args ATTRIBUTE_UNUSED ,
2131 || !CLASS_TYPE_P (*node)
2132 || !TYPE_FOR_JAVA (*node))
2134 error ("%qE attribute can only be applied to Java class definitions",
2136 *no_add_attrs = true;
2139 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
2140 *node = build_variant_type_copy (*node);
2141 TYPE_JAVA_INTERFACE (*node) = 1;
2146 /* Handle a "com_interface" attribute; arguments as in
2147 struct attribute_spec.handler. */
2149 handle_com_interface_attribute (tree* node,
2151 tree args ATTRIBUTE_UNUSED ,
2152 int flags ATTRIBUTE_UNUSED ,
2157 *no_add_attrs = true;
2160 || !CLASS_TYPE_P (*node)
2161 || *node != TYPE_MAIN_VARIANT (*node))
2163 warning (OPT_Wattributes, "%qE attribute can only be applied "
2164 "to class definitions", name);
2169 warning (0, "%qE is obsolete; g++ vtables are now COM-compatible by default",
2175 /* Handle an "init_priority" attribute; arguments as in
2176 struct attribute_spec.handler. */
2178 handle_init_priority_attribute (tree* node,
2181 int flags ATTRIBUTE_UNUSED ,
2184 tree initp_expr = TREE_VALUE (args);
2186 tree type = TREE_TYPE (decl);
2189 STRIP_NOPS (initp_expr);
2191 if (!initp_expr || TREE_CODE (initp_expr) != INTEGER_CST)
2193 error ("requested init_priority is not an integer constant");
2194 *no_add_attrs = true;
2198 pri = TREE_INT_CST_LOW (initp_expr);
2200 type = strip_array_types (type);
2202 if (decl == NULL_TREE
2203 || TREE_CODE (decl) != VAR_DECL
2204 || !TREE_STATIC (decl)
2205 || DECL_EXTERNAL (decl)
2206 || (TREE_CODE (type) != RECORD_TYPE
2207 && TREE_CODE (type) != UNION_TYPE)
2208 /* Static objects in functions are initialized the
2209 first time control passes through that
2210 function. This is not precise enough to pin down an
2211 init_priority value, so don't allow it. */
2212 || current_function_decl)
2214 error ("can only use %qE attribute on file-scope definitions "
2215 "of objects of class type", name);
2216 *no_add_attrs = true;
2220 if (pri > MAX_INIT_PRIORITY || pri <= 0)
2222 error ("requested init_priority is out of range");
2223 *no_add_attrs = true;
2227 /* Check for init_priorities that are reserved for
2228 language and runtime support implementations.*/
2229 if (pri <= MAX_RESERVED_INIT_PRIORITY)
2232 (0, "requested init_priority is reserved for internal use");
2235 if (SUPPORTS_INIT_PRIORITY)
2237 SET_DECL_INIT_PRIORITY (decl, pri);
2238 DECL_HAS_INIT_PRIORITY_P (decl) = 1;
2243 error ("%qE attribute is not supported on this platform", name);
2244 *no_add_attrs = true;
2249 /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the
2250 thing pointed to by the constant. */
2253 make_ptrmem_cst (tree type, tree member)
2255 tree ptrmem_cst = make_node (PTRMEM_CST);
2256 TREE_TYPE (ptrmem_cst) = type;
2257 PTRMEM_CST_MEMBER (ptrmem_cst) = member;
2261 /* Build a variant of TYPE that has the indicated ATTRIBUTES. May
2262 return an existing type if an appropriate type already exists. */
2265 cp_build_type_attribute_variant (tree type, tree attributes)
2269 new_type = build_type_attribute_variant (type, attributes);
2270 if (TREE_CODE (new_type) == FUNCTION_TYPE
2271 && (TYPE_RAISES_EXCEPTIONS (new_type)
2272 != TYPE_RAISES_EXCEPTIONS (type)))
2273 new_type = build_exception_variant (new_type,
2274 TYPE_RAISES_EXCEPTIONS (type));
2276 /* Making a new main variant of a class type is broken. */
2277 gcc_assert (!CLASS_TYPE_P (type) || new_type == type);
2282 /* Return TRUE if TYPE1 and TYPE2 are identical for type hashing purposes.
2283 Called only after doing all language independent checks. Only
2284 to check TYPE_RAISES_EXCEPTIONS for FUNCTION_TYPE, the rest is already
2285 compared in type_hash_eq. */
2288 cxx_type_hash_eq (const_tree typea, const_tree typeb)
2290 gcc_assert (TREE_CODE (typea) == FUNCTION_TYPE);
2292 return comp_except_specs (TYPE_RAISES_EXCEPTIONS (typea),
2293 TYPE_RAISES_EXCEPTIONS (typeb), 1);
2296 /* Apply FUNC to all language-specific sub-trees of TP in a pre-order
2297 traversal. Called from walk_tree. */
2300 cp_walk_subtrees (tree *tp, int *walk_subtrees_p, walk_tree_fn func,
2301 void *data, struct pointer_set_t *pset)
2303 enum tree_code code = TREE_CODE (*tp);
2306 #define WALK_SUBTREE(NODE) \
2309 result = cp_walk_tree (&(NODE), func, data, pset); \
2310 if (result) goto out; \
2314 /* Not one of the easy cases. We must explicitly go through the
2320 case TEMPLATE_TEMPLATE_PARM:
2321 case BOUND_TEMPLATE_TEMPLATE_PARM:
2322 case UNBOUND_CLASS_TEMPLATE:
2323 case TEMPLATE_PARM_INDEX:
2324 case TEMPLATE_TYPE_PARM:
2327 /* None of these have subtrees other than those already walked
2329 *walk_subtrees_p = 0;
2333 WALK_SUBTREE (BASELINK_FUNCTIONS (*tp));
2334 *walk_subtrees_p = 0;
2338 WALK_SUBTREE (TREE_TYPE (*tp));
2339 *walk_subtrees_p = 0;
2343 WALK_SUBTREE (TREE_PURPOSE (*tp));
2347 WALK_SUBTREE (OVL_FUNCTION (*tp));
2348 WALK_SUBTREE (OVL_CHAIN (*tp));
2349 *walk_subtrees_p = 0;
2353 if (TYPE_PTRMEMFUNC_P (*tp))
2354 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (*tp));
2357 case TYPE_ARGUMENT_PACK:
2358 case NONTYPE_ARGUMENT_PACK:
2360 tree args = ARGUMENT_PACK_ARGS (*tp);
2361 int i, len = TREE_VEC_LENGTH (args);
2362 for (i = 0; i < len; i++)
2363 WALK_SUBTREE (TREE_VEC_ELT (args, i));
2367 case TYPE_PACK_EXPANSION:
2368 WALK_SUBTREE (TREE_TYPE (*tp));
2369 *walk_subtrees_p = 0;
2372 case EXPR_PACK_EXPANSION:
2373 WALK_SUBTREE (TREE_OPERAND (*tp, 0));
2374 *walk_subtrees_p = 0;
2378 if (TREE_TYPE (*tp))
2379 WALK_SUBTREE (TREE_TYPE (*tp));
2383 for (i = 0; i < TREE_CODE_LENGTH (TREE_CODE (*tp)); ++i)
2384 WALK_SUBTREE (TREE_OPERAND (*tp, i));
2386 *walk_subtrees_p = 0;
2390 WALK_SUBTREE (TRAIT_EXPR_TYPE1 (*tp));
2391 WALK_SUBTREE (TRAIT_EXPR_TYPE2 (*tp));
2392 *walk_subtrees_p = 0;
2396 WALK_SUBTREE (DECLTYPE_TYPE_EXPR (*tp));
2397 *walk_subtrees_p = 0;
2405 /* We didn't find what we were looking for. */
2412 /* Like save_expr, but for C++. */
2415 cp_save_expr (tree expr)
2417 /* There is no reason to create a SAVE_EXPR within a template; if
2418 needed, we can create the SAVE_EXPR when instantiating the
2419 template. Furthermore, the middle-end cannot handle C++-specific
2421 if (processing_template_decl)
2423 return save_expr (expr);
2426 /* Initialize tree.c. */
2431 list_hash_table = htab_create_ggc (31, list_hash, list_hash_eq, NULL);
2434 /* Returns the kind of special function that DECL (a FUNCTION_DECL)
2435 is. Note that sfk_none is zero, so this function can be used as a
2436 predicate to test whether or not DECL is a special function. */
2438 special_function_kind
2439 special_function_p (const_tree decl)
2441 /* Rather than doing all this stuff with magic names, we should
2442 probably have a field of type `special_function_kind' in
2443 DECL_LANG_SPECIFIC. */
2444 if (DECL_COPY_CONSTRUCTOR_P (decl))
2445 return sfk_copy_constructor;
2446 if (DECL_CONSTRUCTOR_P (decl))
2447 return sfk_constructor;
2448 if (DECL_OVERLOADED_OPERATOR_P (decl) == NOP_EXPR)
2449 return sfk_assignment_operator;
2450 if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl))
2451 return sfk_destructor;
2452 if (DECL_COMPLETE_DESTRUCTOR_P (decl))
2453 return sfk_complete_destructor;
2454 if (DECL_BASE_DESTRUCTOR_P (decl))
2455 return sfk_base_destructor;
2456 if (DECL_DELETING_DESTRUCTOR_P (decl))
2457 return sfk_deleting_destructor;
2458 if (DECL_CONV_FN_P (decl))
2459 return sfk_conversion;
2464 /* Returns nonzero if TYPE is a character type, including wchar_t. */
2467 char_type_p (tree type)
2469 return (same_type_p (type, char_type_node)
2470 || same_type_p (type, unsigned_char_type_node)
2471 || same_type_p (type, signed_char_type_node)
2472 || same_type_p (type, wchar_type_node));
2475 /* Returns the kind of linkage associated with the indicated DECL. Th
2476 value returned is as specified by the language standard; it is
2477 independent of implementation details regarding template
2478 instantiation, etc. For example, it is possible that a declaration
2479 to which this function assigns external linkage would not show up
2480 as a global symbol when you run `nm' on the resulting object file. */
2483 decl_linkage (tree decl)
2485 /* This function doesn't attempt to calculate the linkage from first
2486 principles as given in [basic.link]. Instead, it makes use of
2487 the fact that we have already set TREE_PUBLIC appropriately, and
2488 then handles a few special cases. Ideally, we would calculate
2489 linkage first, and then transform that into a concrete
2492 /* Things that don't have names have no linkage. */
2493 if (!DECL_NAME (decl))
2496 /* Things that are TREE_PUBLIC have external linkage. */
2497 if (TREE_PUBLIC (decl))
2500 if (TREE_CODE (decl) == NAMESPACE_DECL)
2503 /* Linkage of a CONST_DECL depends on the linkage of the enumeration
2505 if (TREE_CODE (decl) == CONST_DECL)
2506 return decl_linkage (TYPE_NAME (TREE_TYPE (decl)));
2508 /* Some things that are not TREE_PUBLIC have external linkage, too.
2509 For example, on targets that don't have weak symbols, we make all
2510 template instantiations have internal linkage (in the object
2511 file), but the symbols should still be treated as having external
2512 linkage from the point of view of the language. */
2513 if (TREE_CODE (decl) != TYPE_DECL && DECL_LANG_SPECIFIC (decl)
2514 && DECL_COMDAT (decl))
2517 /* Things in local scope do not have linkage, if they don't have
2519 if (decl_function_context (decl))
2522 /* Members of the anonymous namespace also have TREE_PUBLIC unset, but
2523 are considered to have external linkage for language purposes. DECLs
2524 really meant to have internal linkage have DECL_THIS_STATIC set. */
2525 if (TREE_CODE (decl) == TYPE_DECL
2526 || ((TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == FUNCTION_DECL)
2527 && !DECL_THIS_STATIC (decl)))
2530 /* Everything else has internal linkage. */
2534 /* EXP is an expression that we want to pre-evaluate. Returns (in
2535 *INITP) an expression that will perform the pre-evaluation. The
2536 value returned by this function is a side-effect free expression
2537 equivalent to the pre-evaluated expression. Callers must ensure
2538 that *INITP is evaluated before EXP. */
2541 stabilize_expr (tree exp, tree* initp)
2545 if (!TREE_SIDE_EFFECTS (exp))
2546 init_expr = NULL_TREE;
2547 else if (!real_lvalue_p (exp)
2548 || !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (exp)))
2550 init_expr = get_target_expr (exp);
2551 exp = TARGET_EXPR_SLOT (init_expr);
2555 exp = build_unary_op (ADDR_EXPR, exp, 1);
2556 init_expr = get_target_expr (exp);
2557 exp = TARGET_EXPR_SLOT (init_expr);
2558 exp = build_indirect_ref (exp, 0);
2562 gcc_assert (!TREE_SIDE_EFFECTS (exp));
2566 /* Add NEW, an expression whose value we don't care about, after the
2567 similar expression ORIG. */
2570 add_stmt_to_compound (tree orig, tree new)
2572 if (!new || !TREE_SIDE_EFFECTS (new))
2574 if (!orig || !TREE_SIDE_EFFECTS (orig))
2576 return build2 (COMPOUND_EXPR, void_type_node, orig, new);
2579 /* Like stabilize_expr, but for a call whose arguments we want to
2580 pre-evaluate. CALL is modified in place to use the pre-evaluated
2581 arguments, while, upon return, *INITP contains an expression to
2582 compute the arguments. */
2585 stabilize_call (tree call, tree *initp)
2587 tree inits = NULL_TREE;
2589 int nargs = call_expr_nargs (call);
2591 if (call == error_mark_node)
2594 gcc_assert (TREE_CODE (call) == CALL_EXPR);
2596 for (i = 0; i < nargs; i++)
2599 CALL_EXPR_ARG (call, i) =
2600 stabilize_expr (CALL_EXPR_ARG (call, i), &init);
2601 inits = add_stmt_to_compound (inits, init);
2607 /* Like stabilize_expr, but for an AGGR_INIT_EXPR whose arguments we want
2608 to pre-evaluate. CALL is modified in place to use the pre-evaluated
2609 arguments, while, upon return, *INITP contains an expression to
2610 compute the arguments. */
2613 stabilize_aggr_init (tree call, tree *initp)
2615 tree inits = NULL_TREE;
2617 int nargs = aggr_init_expr_nargs (call);
2619 if (call == error_mark_node)
2622 gcc_assert (TREE_CODE (call) == AGGR_INIT_EXPR);
2624 for (i = 0; i < nargs; i++)
2627 AGGR_INIT_EXPR_ARG (call, i) =
2628 stabilize_expr (AGGR_INIT_EXPR_ARG (call, i), &init);
2629 inits = add_stmt_to_compound (inits, init);
2635 /* Like stabilize_expr, but for an initialization.
2637 If the initialization is for an object of class type, this function
2638 takes care not to introduce additional temporaries.
2640 Returns TRUE iff the expression was successfully pre-evaluated,
2641 i.e., if INIT is now side-effect free, except for, possible, a
2642 single call to a constructor. */
2645 stabilize_init (tree init, tree *initp)
2651 if (t == error_mark_node)
2654 if (TREE_CODE (t) == INIT_EXPR
2655 && TREE_CODE (TREE_OPERAND (t, 1)) != TARGET_EXPR)
2657 TREE_OPERAND (t, 1) = stabilize_expr (TREE_OPERAND (t, 1), initp);
2661 if (TREE_CODE (t) == INIT_EXPR)
2662 t = TREE_OPERAND (t, 1);
2663 if (TREE_CODE (t) == TARGET_EXPR)
2664 t = TARGET_EXPR_INITIAL (t);
2665 if (TREE_CODE (t) == COMPOUND_EXPR)
2667 if (TREE_CODE (t) == CONSTRUCTOR
2668 && EMPTY_CONSTRUCTOR_P (t))
2669 /* Default-initialization. */
2672 /* If the initializer is a COND_EXPR, we can't preevaluate
2674 if (TREE_CODE (t) == COND_EXPR)
2677 if (TREE_CODE (t) == CALL_EXPR)
2679 stabilize_call (t, initp);
2683 if (TREE_CODE (t) == AGGR_INIT_EXPR)
2685 stabilize_aggr_init (t, initp);
2689 /* The initialization is being performed via a bitwise copy -- and
2690 the item copied may have side effects. */
2691 return TREE_SIDE_EFFECTS (init);
2694 /* Like "fold", but should be used whenever we might be processing the
2695 body of a template. */
2698 fold_if_not_in_template (tree expr)
2700 /* In the body of a template, there is never any need to call
2701 "fold". We will call fold later when actually instantiating the
2702 template. Integral constant expressions in templates will be
2703 evaluated via fold_non_dependent_expr, as necessary. */
2704 if (processing_template_decl)
2707 /* Fold C++ front-end specific tree codes. */
2708 if (TREE_CODE (expr) == UNARY_PLUS_EXPR)
2709 return fold_convert (TREE_TYPE (expr), TREE_OPERAND (expr, 0));
2714 /* Returns true if a cast to TYPE may appear in an integral constant
2718 cast_valid_in_integral_constant_expression_p (tree type)
2720 return (INTEGRAL_OR_ENUMERATION_TYPE_P (type)
2721 || dependent_type_p (type)
2722 || type == error_mark_node);
2726 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
2727 /* Complain that some language-specific thing hanging off a tree
2728 node has been accessed improperly. */
2731 lang_check_failed (const char* file, int line, const char* function)
2733 internal_error ("lang_* check: failed in %s, at %s:%d",
2734 function, trim_filename (file), line);
2736 #endif /* ENABLE_TREE_CHECKING */
2738 #include "gt-cp-tree.h"