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 Free Software Foundation, Inc.
4 Hacked by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to
20 the Free Software Foundation, 51 Franklin Street, Fifth Floor,
21 Boston, MA 02110-1301, USA. */
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 (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. */
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 if (TREE_CODE (TREE_TYPE (ref
)) == REFERENCE_TYPE
)
70 if (ref
== current_class_ptr
)
73 switch (TREE_CODE (ref
))
75 /* preincrements and predecrements are valid lvals, provided
76 what they refer to are valid lvals. */
77 case PREINCREMENT_EXPR
:
78 case PREDECREMENT_EXPR
:
81 case WITH_CLEANUP_EXPR
:
84 return lvalue_p_1 (TREE_OPERAND (ref
, 0),
85 treat_class_rvalues_as_lvalues
);
88 op1_lvalue_kind
= lvalue_p_1 (TREE_OPERAND (ref
, 0),
89 treat_class_rvalues_as_lvalues
);
90 /* Look at the member designator. */
92 /* The "field" can be a FUNCTION_DECL or an OVERLOAD in some
94 || TREE_CODE (TREE_OPERAND (ref
, 1)) != FIELD_DECL
)
96 else if (DECL_C_BIT_FIELD (TREE_OPERAND (ref
, 1)))
98 /* Clear the ordinary bit. If this object was a class
99 rvalue we want to preserve that information. */
100 op1_lvalue_kind
&= ~clk_ordinary
;
101 /* The lvalue is for a bitfield. */
102 op1_lvalue_kind
|= clk_bitfield
;
104 else if (DECL_PACKED (TREE_OPERAND (ref
, 1)))
105 op1_lvalue_kind
|= clk_packed
;
107 return op1_lvalue_kind
;
114 if (TREE_READONLY (ref
) && ! TREE_STATIC (ref
)
115 && DECL_LANG_SPECIFIC (ref
)
116 && DECL_IN_AGGR_P (ref
))
122 if (TREE_CODE (TREE_TYPE (ref
)) != METHOD_TYPE
)
126 /* A currently unresolved scope ref. */
131 /* Disallow <? and >? as lvalues if either argument side-effects. */
132 if (TREE_SIDE_EFFECTS (TREE_OPERAND (ref
, 0))
133 || TREE_SIDE_EFFECTS (TREE_OPERAND (ref
, 1)))
135 op1_lvalue_kind
= lvalue_p_1 (TREE_OPERAND (ref
, 0),
136 treat_class_rvalues_as_lvalues
);
137 op2_lvalue_kind
= lvalue_p_1 (TREE_OPERAND (ref
, 1),
138 treat_class_rvalues_as_lvalues
);
142 op1_lvalue_kind
= lvalue_p_1 (TREE_OPERAND (ref
, 1),
143 treat_class_rvalues_as_lvalues
);
144 op2_lvalue_kind
= lvalue_p_1 (TREE_OPERAND (ref
, 2),
145 treat_class_rvalues_as_lvalues
);
152 return lvalue_p_1 (TREE_OPERAND (ref
, 1),
153 treat_class_rvalues_as_lvalues
);
156 return treat_class_rvalues_as_lvalues
? clk_class
: clk_none
;
159 return (treat_class_rvalues_as_lvalues
160 && CLASS_TYPE_P (TREE_TYPE (ref
))
161 ? clk_class
: clk_none
);
164 /* Any class-valued call would be wrapped in a TARGET_EXPR. */
168 /* All functions (except non-static-member functions) are
170 return (DECL_NONSTATIC_MEMBER_FUNCTION_P (ref
)
171 ? clk_none
: clk_ordinary
);
173 case NON_DEPENDENT_EXPR
:
174 /* We must consider NON_DEPENDENT_EXPRs to be lvalues so that
175 things like "&E" where "E" is an expression with a
176 non-dependent type work. It is safe to be lenient because an
177 error will be issued when the template is instantiated if "E"
185 /* If one operand is not an lvalue at all, then this expression is
187 if (!op1_lvalue_kind
|| !op2_lvalue_kind
)
190 /* Otherwise, it's an lvalue, and it has all the odd properties
191 contributed by either operand. */
192 op1_lvalue_kind
= op1_lvalue_kind
| op2_lvalue_kind
;
193 /* It's not an ordinary lvalue if it involves either a bit-field or
195 if ((op1_lvalue_kind
& ~clk_ordinary
) != clk_none
)
196 op1_lvalue_kind
&= ~clk_ordinary
;
197 return op1_lvalue_kind
;
200 /* Returns the kind of lvalue that REF is, in the sense of
201 [basic.lval]. This function should really be named lvalue_p; it
202 computes the C++ definition of lvalue. */
205 real_lvalue_p (tree ref
)
207 return lvalue_p_1 (ref
,
208 /*treat_class_rvalues_as_lvalues=*/0);
211 /* This differs from real_lvalue_p in that class rvalues are
212 considered lvalues. */
218 (lvalue_p_1 (ref
, /*class rvalue ok*/ 1) != clk_none
);
221 /* Test whether DECL is a builtin that may appear in a
222 constant-expression. */
225 builtin_valid_in_constant_expr_p (tree decl
)
227 /* At present BUILT_IN_CONSTANT_P is the only builtin we're allowing
228 in constant-expressions. We may want to add other builtins later. */
229 return DECL_IS_BUILTIN_CONSTANT_P (decl
);
232 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
235 build_target_expr (tree decl
, tree value
)
239 t
= build4 (TARGET_EXPR
, TREE_TYPE (decl
), decl
, value
,
240 cxx_maybe_build_cleanup (decl
), NULL_TREE
);
241 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
242 ignore the TARGET_EXPR. If there really turn out to be no
243 side-effects, then the optimizer should be able to get rid of
244 whatever code is generated anyhow. */
245 TREE_SIDE_EFFECTS (t
) = 1;
250 /* Return an undeclared local temporary of type TYPE for use in building a
254 build_local_temp (tree type
)
256 tree slot
= build_decl (VAR_DECL
, NULL_TREE
, type
);
257 DECL_ARTIFICIAL (slot
) = 1;
258 DECL_IGNORED_P (slot
) = 1;
259 DECL_CONTEXT (slot
) = current_function_decl
;
260 layout_decl (slot
, 0);
264 /* Set various status flags when building an AGGR_INIT_EXPR object T. */
267 process_aggr_init_operands (tree t
)
271 side_effects
= TREE_SIDE_EFFECTS (t
);
275 n
= TREE_OPERAND_LENGTH (t
);
276 for (i
= 1; i
< n
; i
++)
278 tree op
= TREE_OPERAND (t
, i
);
279 if (op
&& TREE_SIDE_EFFECTS (op
))
286 TREE_SIDE_EFFECTS (t
) = side_effects
;
289 /* Build an AGGR_INIT_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE,
290 FN, and SLOT. NARGS is the number of call arguments which are specified
291 as a tree array ARGS. */
294 build_aggr_init_array (tree return_type
, tree fn
, tree slot
, int nargs
,
300 t
= build_vl_exp (AGGR_INIT_EXPR
, nargs
+ 3);
301 TREE_TYPE (t
) = return_type
;
302 AGGR_INIT_EXPR_FN (t
) = fn
;
303 AGGR_INIT_EXPR_SLOT (t
) = slot
;
304 for (i
= 0; i
< nargs
; i
++)
305 AGGR_INIT_EXPR_ARG (t
, i
) = args
[i
];
306 process_aggr_init_operands (t
);
310 /* INIT is a CALL_EXPR or AGGR_INIT_EXPR which needs info about its
311 target. TYPE is the type that this initialization should appear to
314 Build an encapsulation of the initialization to perform
315 and return it so that it can be processed by language-independent
316 and language-specific expression expanders. */
319 build_cplus_new (tree type
, tree init
)
326 /* Make sure that we're not trying to create an instance of an
328 abstract_virtuals_error (NULL_TREE
, type
);
330 if (TREE_CODE (init
) == CALL_EXPR
)
331 fn
= CALL_EXPR_FN (init
);
332 else if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
333 fn
= AGGR_INIT_EXPR_FN (init
);
335 return convert (type
, init
);
337 is_ctor
= (TREE_CODE (fn
) == ADDR_EXPR
338 && TREE_CODE (TREE_OPERAND (fn
, 0)) == FUNCTION_DECL
339 && DECL_CONSTRUCTOR_P (TREE_OPERAND (fn
, 0)));
341 slot
= build_local_temp (type
);
343 /* We split the CALL_EXPR into its function and its arguments here.
344 Then, in expand_expr, we put them back together. The reason for
345 this is that this expression might be a default argument
346 expression. In that case, we need a new temporary every time the
347 expression is used. That's what break_out_target_exprs does; it
348 replaces every AGGR_INIT_EXPR with a copy that uses a fresh
349 temporary slot. Then, expand_expr builds up a call-expression
350 using the new slot. */
352 /* If we don't need to use a constructor to create an object of this
353 type, don't mess with AGGR_INIT_EXPR. */
354 if (is_ctor
|| TREE_ADDRESSABLE (type
))
356 if (TREE_CODE(init
) == CALL_EXPR
)
357 rval
= build_aggr_init_array (void_type_node
, fn
, slot
,
358 call_expr_nargs (init
),
359 CALL_EXPR_ARGP (init
));
361 rval
= build_aggr_init_array (void_type_node
, fn
, slot
,
362 aggr_init_expr_nargs (init
),
363 AGGR_INIT_EXPR_ARGP (init
));
364 TREE_SIDE_EFFECTS (rval
) = 1;
365 AGGR_INIT_VIA_CTOR_P (rval
) = is_ctor
;
370 rval
= build_target_expr (slot
, rval
);
371 TARGET_EXPR_IMPLICIT_P (rval
) = 1;
376 /* Build a TARGET_EXPR using INIT to initialize a new temporary of the
380 build_target_expr_with_type (tree init
, tree type
)
382 gcc_assert (!VOID_TYPE_P (type
));
384 if (TREE_CODE (init
) == TARGET_EXPR
)
386 else if (CLASS_TYPE_P (type
) && !TYPE_HAS_TRIVIAL_INIT_REF (type
)
387 && TREE_CODE (init
) != COND_EXPR
388 && TREE_CODE (init
) != CONSTRUCTOR
389 && TREE_CODE (init
) != VA_ARG_EXPR
)
390 /* We need to build up a copy constructor call. COND_EXPR is a special
391 case because we already have copies on the arms and we don't want
392 another one here. A CONSTRUCTOR is aggregate initialization, which
393 is handled separately. A VA_ARG_EXPR is magic creation of an
394 aggregate; there's no additional work to be done. */
395 return force_rvalue (init
);
397 return force_target_expr (type
, init
);
400 /* Like the above function, but without the checking. This function should
401 only be used by code which is deliberately trying to subvert the type
402 system, such as call_builtin_trap. */
405 force_target_expr (tree type
, tree init
)
409 gcc_assert (!VOID_TYPE_P (type
));
411 slot
= build_local_temp (type
);
412 return build_target_expr (slot
, init
);
415 /* Like build_target_expr_with_type, but use the type of INIT. */
418 get_target_expr (tree init
)
420 return build_target_expr_with_type (init
, TREE_TYPE (init
));
423 /* If EXPR is a bitfield reference, convert it to the declared type of
424 the bitfield, and return the resulting expression. Otherwise,
425 return EXPR itself. */
428 convert_bitfield_to_declared_type (tree expr
)
432 bitfield_type
= is_bitfield_expr_with_lowered_type (expr
);
434 expr
= convert_to_integer (TYPE_MAIN_VARIANT (bitfield_type
),
439 /* EXPR is being used in an rvalue context. Return a version of EXPR
440 that is marked as an rvalue. */
447 if (error_operand_p (expr
))
452 Non-class rvalues always have cv-unqualified types. */
453 type
= TREE_TYPE (expr
);
454 if (!CLASS_TYPE_P (type
) && cp_type_quals (type
))
455 type
= TYPE_MAIN_VARIANT (type
);
457 if (!processing_template_decl
&& real_lvalue_p (expr
))
458 expr
= build1 (NON_LVALUE_EXPR
, type
, expr
);
459 else if (type
!= TREE_TYPE (expr
))
460 expr
= build_nop (type
, expr
);
466 /* Hash an ARRAY_TYPE. K is really of type `tree'. */
469 cplus_array_hash (const void* k
)
474 hash
= (htab_hash_pointer (TREE_TYPE (t
))
475 ^ htab_hash_pointer (TYPE_DOMAIN (t
)));
480 typedef struct cplus_array_info
{
485 /* Compare two ARRAY_TYPEs. K1 is really of type `tree', K2 is really
486 of type `cplus_array_info*'. */
489 cplus_array_compare (const void * k1
, const void * k2
)
492 const cplus_array_info
*t2
= (const cplus_array_info
*) k2
;
494 if (!comptypes (TREE_TYPE (t1
), t2
->type
, COMPARE_STRUCTURAL
))
497 if (!TYPE_DOMAIN (t1
))
503 return comptypes (TYPE_DOMAIN (t1
), t2
->domain
, COMPARE_STRUCTURAL
);
506 static GTY ((param_is (union tree_node
))) htab_t cplus_array_htab
;
510 build_cplus_array_type_1 (tree elt_type
, tree index_type
)
514 if (elt_type
== error_mark_node
|| index_type
== error_mark_node
)
515 return error_mark_node
;
517 if (dependent_type_p (elt_type
)
519 && value_dependent_expression_p (TYPE_MAX_VALUE (index_type
))))
522 cplus_array_info cai
;
525 if (cplus_array_htab
== NULL
)
526 cplus_array_htab
= htab_create_ggc (61, &cplus_array_hash
,
527 &cplus_array_compare
, NULL
);
529 hash
= (htab_hash_pointer (elt_type
)
530 ^ htab_hash_pointer (index_type
));
532 cai
.domain
= index_type
;
534 e
= htab_find_slot_with_hash (cplus_array_htab
, &cai
, hash
, INSERT
);
536 /* We have found the type: we're done. */
540 /* Build a new array type. */
541 t
= make_node (ARRAY_TYPE
);
542 TREE_TYPE (t
) = elt_type
;
543 TYPE_DOMAIN (t
) = index_type
;
545 /* Complete building the array type. */
546 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
547 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
548 SET_TYPE_STRUCTURAL_EQUALITY (t
);
549 else if (TYPE_CANONICAL (elt_type
) != elt_type
551 && TYPE_CANONICAL (index_type
) != index_type
))
554 (build_cplus_array_type_1 (TYPE_CANONICAL (elt_type
),
556 TYPE_CANONICAL (index_type
)
559 /* Store it in the hash table. */
564 t
= build_array_type (elt_type
, index_type
);
566 /* Push these needs up so that initialization takes place
568 TYPE_NEEDS_CONSTRUCTING (t
)
569 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (elt_type
));
570 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
571 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (elt_type
));
576 build_cplus_array_type (tree elt_type
, tree index_type
)
579 int type_quals
= cp_type_quals (elt_type
);
581 if (type_quals
!= TYPE_UNQUALIFIED
)
582 elt_type
= cp_build_qualified_type (elt_type
, TYPE_UNQUALIFIED
);
584 t
= build_cplus_array_type_1 (elt_type
, index_type
);
586 if (type_quals
!= TYPE_UNQUALIFIED
)
587 t
= cp_build_qualified_type (t
, type_quals
);
592 /* Make a variant of TYPE, qualified with the TYPE_QUALS. Handles
593 arrays correctly. In particular, if TYPE is an array of T's, and
594 TYPE_QUALS is non-empty, returns an array of qualified T's.
596 FLAGS determines how to deal with illformed qualifications. If
597 tf_ignore_bad_quals is set, then bad qualifications are dropped
598 (this is permitted if TYPE was introduced via a typedef or template
599 type parameter). If bad qualifications are dropped and tf_warning
600 is set, then a warning is issued for non-const qualifications. If
601 tf_ignore_bad_quals is not set and tf_error is not set, we
602 return error_mark_node. Otherwise, we issue an error, and ignore
605 Qualification of a reference type is valid when the reference came
606 via a typedef or template type argument. [dcl.ref] No such
607 dispensation is provided for qualifying a function type. [dcl.fct]
608 DR 295 queries this and the proposed resolution brings it into line
609 with qualifying a reference. We implement the DR. We also behave
610 in a similar manner for restricting non-pointer types. */
613 cp_build_qualified_type_real (tree type
,
615 tsubst_flags_t complain
)
618 int bad_quals
= TYPE_UNQUALIFIED
;
620 if (type
== error_mark_node
)
623 if (type_quals
== cp_type_quals (type
))
626 if (TREE_CODE (type
) == ARRAY_TYPE
)
628 /* In C++, the qualification really applies to the array element
629 type. Obtain the appropriately qualified element type. */
632 = cp_build_qualified_type_real (TREE_TYPE (type
),
636 if (element_type
== error_mark_node
)
637 return error_mark_node
;
639 /* See if we already have an identically qualified type. */
640 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
641 if (cp_type_quals (t
) == type_quals
642 && TYPE_NAME (t
) == TYPE_NAME (type
)
643 && TYPE_CONTEXT (t
) == TYPE_CONTEXT (type
))
648 tree domain
= TYPE_DOMAIN (type
);
650 /* Make a new array type, just like the old one, but with the
651 appropriately qualified element type. */
652 t
= build_variant_type_copy (type
);
653 TREE_TYPE (t
) = element_type
;
655 /* This is a new type. */
656 TYPE_CANONICAL (t
) = t
;
658 if (dependent_type_p (element_type
)
660 && value_dependent_expression_p (TYPE_MAX_VALUE (domain
))))
662 /* The new dependent array type we just created might be
663 equivalent to an existing dependent array type, so we
664 need to keep track of this new array type with a
665 lookup into CPLUS_ARRAY_HTAB. Note that we cannot
666 directly call build_cplus_array_type (that would
667 recurse) or build_cplus_array_type_1 (that would lose
670 cplus_array_info cai
;
673 if (cplus_array_htab
== NULL
)
674 cplus_array_htab
= htab_create_ggc (61, &cplus_array_hash
,
675 &cplus_array_compare
,
678 hash
= (htab_hash_pointer (element_type
)
679 ^ htab_hash_pointer (domain
));
680 cai
.type
= element_type
;
683 e
= htab_find_slot_with_hash (cplus_array_htab
, &cai
, hash
,
686 /* Save this new type. */
690 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (t
))
692 && TYPE_STRUCTURAL_EQUALITY_P (TYPE_DOMAIN (t
))))
693 SET_TYPE_STRUCTURAL_EQUALITY (t
);
697 (build_array_type (TYPE_CANONICAL (TREE_TYPE (t
)),
699 TYPE_CANONICAL (TYPE_DOMAIN(t
))
703 /* Even if we already had this variant, we update
704 TYPE_NEEDS_CONSTRUCTING and TYPE_HAS_NONTRIVIAL_DESTRUCTOR in case
705 they changed since the variant was originally created.
707 This seems hokey; if there is some way to use a previous
708 variant *without* coming through here,
709 TYPE_NEEDS_CONSTRUCTING will never be updated. */
710 TYPE_NEEDS_CONSTRUCTING (t
)
711 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (element_type
));
712 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
713 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (element_type
));
716 else if (TYPE_PTRMEMFUNC_P (type
))
718 /* For a pointer-to-member type, we can't just return a
719 cv-qualified version of the RECORD_TYPE. If we do, we
720 haven't changed the field that contains the actual pointer to
721 a method, and so TYPE_PTRMEMFUNC_FN_TYPE will be wrong. */
724 t
= TYPE_PTRMEMFUNC_FN_TYPE (type
);
725 t
= cp_build_qualified_type_real (t
, type_quals
, complain
);
726 return build_ptrmemfunc_type (t
);
729 /* A reference or method type shall not be cv qualified.
730 [dcl.ref], [dct.fct] */
731 if (type_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)
732 && (TREE_CODE (type
) == REFERENCE_TYPE
733 || TREE_CODE (type
) == METHOD_TYPE
))
735 bad_quals
|= type_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
736 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
739 /* A restrict-qualified type must be a pointer (or reference)
740 to object or incomplete type, or a function type. */
741 if ((type_quals
& TYPE_QUAL_RESTRICT
)
742 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
743 && TREE_CODE (type
) != TYPENAME_TYPE
744 && TREE_CODE (type
) != FUNCTION_TYPE
745 && !POINTER_TYPE_P (type
))
747 bad_quals
|= TYPE_QUAL_RESTRICT
;
748 type_quals
&= ~TYPE_QUAL_RESTRICT
;
751 if (bad_quals
== TYPE_UNQUALIFIED
)
753 else if (!(complain
& (tf_error
| tf_ignore_bad_quals
)))
754 return error_mark_node
;
757 if (complain
& tf_ignore_bad_quals
)
758 /* We're not going to warn about constifying things that can't
760 bad_quals
&= ~TYPE_QUAL_CONST
;
763 tree bad_type
= build_qualified_type (ptr_type_node
, bad_quals
);
765 if (!(complain
& tf_ignore_bad_quals
))
766 error ("%qV qualifiers cannot be applied to %qT",
771 /* Retrieve (or create) the appropriately qualified variant. */
772 result
= build_qualified_type (type
, type_quals
);
774 /* If this was a pointer-to-method type, and we just made a copy,
775 then we need to unshare the record that holds the cached
776 pointer-to-member-function type, because these will be distinct
777 between the unqualified and qualified types. */
779 && TREE_CODE (type
) == POINTER_TYPE
780 && TREE_CODE (TREE_TYPE (type
)) == METHOD_TYPE
)
781 TYPE_LANG_SPECIFIC (result
) = NULL
;
786 /* Returns the canonical version of TYPE. In other words, if TYPE is
787 a typedef, returns the underlying type. The cv-qualification of
788 the type returned matches the type input; they will always be
792 canonical_type_variant (tree t
)
794 return cp_build_qualified_type (TYPE_MAIN_VARIANT (t
), cp_type_quals (t
));
797 /* Makes a copy of BINFO and TYPE, which is to be inherited into a
798 graph dominated by T. If BINFO is NULL, TYPE is a dependent base,
799 and we do a shallow copy. If BINFO is non-NULL, we do a deep copy.
800 VIRT indicates whether TYPE is inherited virtually or not.
801 IGO_PREV points at the previous binfo of the inheritance graph
802 order chain. The newly copied binfo's TREE_CHAIN forms this
805 The CLASSTYPE_VBASECLASSES vector of T is constructed in the
806 correct order. That is in the order the bases themselves should be
809 The BINFO_INHERITANCE of a virtual base class points to the binfo
810 of the most derived type. ??? We could probably change this so that
811 BINFO_INHERITANCE becomes synonymous with BINFO_PRIMARY, and hence
812 remove a field. They currently can only differ for primary virtual
816 copy_binfo (tree binfo
, tree type
, tree t
, tree
*igo_prev
, int virt
)
822 /* See if we've already made this virtual base. */
823 new_binfo
= binfo_for_vbase (type
, t
);
828 new_binfo
= make_tree_binfo (binfo
? BINFO_N_BASE_BINFOS (binfo
) : 0);
829 BINFO_TYPE (new_binfo
) = type
;
831 /* Chain it into the inheritance graph. */
832 TREE_CHAIN (*igo_prev
) = new_binfo
;
833 *igo_prev
= new_binfo
;
840 gcc_assert (!BINFO_DEPENDENT_BASE_P (binfo
));
841 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), type
));
843 BINFO_OFFSET (new_binfo
) = BINFO_OFFSET (binfo
);
844 BINFO_VIRTUALS (new_binfo
) = BINFO_VIRTUALS (binfo
);
846 /* We do not need to copy the accesses, as they are read only. */
847 BINFO_BASE_ACCESSES (new_binfo
) = BINFO_BASE_ACCESSES (binfo
);
849 /* Recursively copy base binfos of BINFO. */
850 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ix
++)
854 gcc_assert (!BINFO_DEPENDENT_BASE_P (base_binfo
));
855 new_base_binfo
= copy_binfo (base_binfo
, BINFO_TYPE (base_binfo
),
857 BINFO_VIRTUAL_P (base_binfo
));
859 if (!BINFO_INHERITANCE_CHAIN (new_base_binfo
))
860 BINFO_INHERITANCE_CHAIN (new_base_binfo
) = new_binfo
;
861 BINFO_BASE_APPEND (new_binfo
, new_base_binfo
);
865 BINFO_DEPENDENT_BASE_P (new_binfo
) = 1;
869 /* Push it onto the list after any virtual bases it contains
870 will have been pushed. */
871 VEC_quick_push (tree
, CLASSTYPE_VBASECLASSES (t
), new_binfo
);
872 BINFO_VIRTUAL_P (new_binfo
) = 1;
873 BINFO_INHERITANCE_CHAIN (new_binfo
) = TYPE_BINFO (t
);
879 /* Hashing of lists so that we don't make duplicates.
880 The entry point is `list_hash_canon'. */
882 /* Now here is the hash table. When recording a list, it is added
883 to the slot whose index is the hash code mod the table size.
884 Note that the hash table is used for several kinds of lists.
885 While all these live in the same table, they are completely independent,
886 and the hash code is computed differently for each of these. */
888 static GTY ((param_is (union tree_node
))) htab_t list_hash_table
;
897 /* Compare ENTRY (an entry in the hash table) with DATA (a list_proxy
898 for a node we are thinking about adding). */
901 list_hash_eq (const void* entry
, const void* data
)
903 tree t
= (tree
) entry
;
904 struct list_proxy
*proxy
= (struct list_proxy
*) data
;
906 return (TREE_VALUE (t
) == proxy
->value
907 && TREE_PURPOSE (t
) == proxy
->purpose
908 && TREE_CHAIN (t
) == proxy
->chain
);
911 /* Compute a hash code for a list (chain of TREE_LIST nodes
912 with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the
913 TREE_COMMON slots), by adding the hash codes of the individual entries. */
916 list_hash_pieces (tree purpose
, tree value
, tree chain
)
918 hashval_t hashcode
= 0;
921 hashcode
+= TREE_HASH (chain
);
924 hashcode
+= TREE_HASH (value
);
928 hashcode
+= TREE_HASH (purpose
);
934 /* Hash an already existing TREE_LIST. */
937 list_hash (const void* p
)
940 return list_hash_pieces (TREE_PURPOSE (t
),
945 /* Given list components PURPOSE, VALUE, AND CHAIN, return the canonical
946 object for an identical list if one already exists. Otherwise, build a
947 new one, and record it as the canonical object. */
950 hash_tree_cons (tree purpose
, tree value
, tree chain
)
954 struct list_proxy proxy
;
956 /* Hash the list node. */
957 hashcode
= list_hash_pieces (purpose
, value
, chain
);
958 /* Create a proxy for the TREE_LIST we would like to create. We
959 don't actually create it so as to avoid creating garbage. */
960 proxy
.purpose
= purpose
;
963 /* See if it is already in the table. */
964 slot
= htab_find_slot_with_hash (list_hash_table
, &proxy
, hashcode
,
966 /* If not, create a new node. */
968 *slot
= tree_cons (purpose
, value
, chain
);
972 /* Constructor for hashed lists. */
975 hash_tree_chain (tree value
, tree chain
)
977 return hash_tree_cons (NULL_TREE
, value
, chain
);
981 debug_binfo (tree elem
)
986 fprintf (stderr
, "type \"%s\", offset = " HOST_WIDE_INT_PRINT_DEC
988 TYPE_NAME_STRING (BINFO_TYPE (elem
)),
989 TREE_INT_CST_LOW (BINFO_OFFSET (elem
)));
990 debug_tree (BINFO_TYPE (elem
));
991 if (BINFO_VTABLE (elem
))
992 fprintf (stderr
, "vtable decl \"%s\"\n",
993 IDENTIFIER_POINTER (DECL_NAME (get_vtbl_decl_for_binfo (elem
))));
995 fprintf (stderr
, "no vtable decl yet\n");
996 fprintf (stderr
, "virtuals:\n");
997 virtuals
= BINFO_VIRTUALS (elem
);
1002 tree fndecl
= TREE_VALUE (virtuals
);
1003 fprintf (stderr
, "%s [%ld =? %ld]\n",
1004 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl
)),
1005 (long) n
, (long) TREE_INT_CST_LOW (DECL_VINDEX (fndecl
)));
1007 virtuals
= TREE_CHAIN (virtuals
);
1011 /* Build a representation for the qualified name SCOPE::NAME. TYPE is
1012 the type of the result expression, if known, or NULL_TREE if the
1013 resulting expression is type-dependent. If TEMPLATE_P is true,
1014 NAME is known to be a template because the user explicitly used the
1015 "template" keyword after the "::".
1017 All SCOPE_REFs should be built by use of this function. */
1020 build_qualified_name (tree type
, tree scope
, tree name
, bool template_p
)
1023 if (type
== error_mark_node
1024 || scope
== error_mark_node
1025 || name
== error_mark_node
)
1026 return error_mark_node
;
1027 t
= build2 (SCOPE_REF
, type
, scope
, name
);
1028 QUALIFIED_NAME_IS_TEMPLATE (t
) = template_p
;
1032 /* Returns nonzero if X is an expression for a (possibly overloaded)
1033 function. If "f" is a function or function template, "f", "c->f",
1034 "c.f", "C::f", and "f<int>" will all be considered possibly
1035 overloaded functions. Returns 2 if the function is actually
1036 overloaded, i.e., if it is impossible to know the type of the
1037 function without performing overload resolution. */
1040 is_overloaded_fn (tree x
)
1042 /* A baselink is also considered an overloaded function. */
1043 if (TREE_CODE (x
) == OFFSET_REF
1044 || TREE_CODE (x
) == COMPONENT_REF
)
1045 x
= TREE_OPERAND (x
, 1);
1047 x
= BASELINK_FUNCTIONS (x
);
1048 if (TREE_CODE (x
) == TEMPLATE_ID_EXPR
1049 || DECL_FUNCTION_TEMPLATE_P (OVL_CURRENT (x
))
1050 || (TREE_CODE (x
) == OVERLOAD
&& OVL_CHAIN (x
)))
1052 return (TREE_CODE (x
) == FUNCTION_DECL
1053 || TREE_CODE (x
) == OVERLOAD
);
1056 /* Returns true iff X is an expression for an overloaded function
1057 whose type cannot be known without performing overload
1061 really_overloaded_fn (tree x
)
1063 return is_overloaded_fn (x
) == 2;
1067 get_first_fn (tree from
)
1069 gcc_assert (is_overloaded_fn (from
));
1070 /* A baselink is also considered an overloaded function. */
1071 if (TREE_CODE (from
) == COMPONENT_REF
)
1072 from
= TREE_OPERAND (from
, 1);
1073 if (BASELINK_P (from
))
1074 from
= BASELINK_FUNCTIONS (from
);
1075 return OVL_CURRENT (from
);
1078 /* Return a new OVL node, concatenating it with the old one. */
1081 ovl_cons (tree decl
, tree chain
)
1083 tree result
= make_node (OVERLOAD
);
1084 TREE_TYPE (result
) = unknown_type_node
;
1085 OVL_FUNCTION (result
) = decl
;
1086 TREE_CHAIN (result
) = chain
;
1091 /* Build a new overloaded function. If this is the first one,
1092 just return it; otherwise, ovl_cons the _DECLs */
1095 build_overload (tree decl
, tree chain
)
1097 if (! chain
&& TREE_CODE (decl
) != TEMPLATE_DECL
)
1099 if (chain
&& TREE_CODE (chain
) != OVERLOAD
)
1100 chain
= ovl_cons (chain
, NULL_TREE
);
1101 return ovl_cons (decl
, chain
);
1105 #define PRINT_RING_SIZE 4
1108 cxx_printable_name (tree decl
, int v
)
1110 static tree decl_ring
[PRINT_RING_SIZE
];
1111 static char *print_ring
[PRINT_RING_SIZE
];
1112 static int ring_counter
;
1115 /* Only cache functions. */
1117 || TREE_CODE (decl
) != FUNCTION_DECL
1118 || DECL_LANG_SPECIFIC (decl
) == 0)
1119 return lang_decl_name (decl
, v
);
1121 /* See if this print name is lying around. */
1122 for (i
= 0; i
< PRINT_RING_SIZE
; i
++)
1123 if (decl_ring
[i
] == decl
)
1124 /* yes, so return it. */
1125 return print_ring
[i
];
1127 if (++ring_counter
== PRINT_RING_SIZE
)
1130 if (current_function_decl
!= NULL_TREE
)
1132 if (decl_ring
[ring_counter
] == current_function_decl
)
1134 if (ring_counter
== PRINT_RING_SIZE
)
1136 gcc_assert (decl_ring
[ring_counter
] != current_function_decl
);
1139 if (print_ring
[ring_counter
])
1140 free (print_ring
[ring_counter
]);
1142 print_ring
[ring_counter
] = xstrdup (lang_decl_name (decl
, v
));
1143 decl_ring
[ring_counter
] = decl
;
1144 return print_ring
[ring_counter
];
1147 /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions
1148 listed in RAISES. */
1151 build_exception_variant (tree type
, tree raises
)
1153 tree v
= TYPE_MAIN_VARIANT (type
);
1154 int type_quals
= TYPE_QUALS (type
);
1156 for (; v
; v
= TYPE_NEXT_VARIANT (v
))
1157 if (check_qualified_type (v
, type
, type_quals
)
1158 && comp_except_specs (raises
, TYPE_RAISES_EXCEPTIONS (v
), 1))
1161 /* Need to build a new variant. */
1162 v
= build_variant_type_copy (type
);
1163 TYPE_RAISES_EXCEPTIONS (v
) = raises
;
1167 /* Given a TEMPLATE_TEMPLATE_PARM node T, create a new
1168 BOUND_TEMPLATE_TEMPLATE_PARM bound with NEWARGS as its template
1172 bind_template_template_parm (tree t
, tree newargs
)
1174 tree decl
= TYPE_NAME (t
);
1177 t2
= make_aggr_type (BOUND_TEMPLATE_TEMPLATE_PARM
);
1178 decl
= build_decl (TYPE_DECL
, DECL_NAME (decl
), NULL_TREE
);
1180 /* These nodes have to be created to reflect new TYPE_DECL and template
1182 TEMPLATE_TYPE_PARM_INDEX (t2
) = copy_node (TEMPLATE_TYPE_PARM_INDEX (t
));
1183 TEMPLATE_PARM_DECL (TEMPLATE_TYPE_PARM_INDEX (t2
)) = decl
;
1184 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2
)
1185 = tree_cons (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t
),
1186 newargs
, NULL_TREE
);
1188 TREE_TYPE (decl
) = t2
;
1189 TYPE_NAME (t2
) = decl
;
1190 TYPE_STUB_DECL (t2
) = decl
;
1192 SET_TYPE_STRUCTURAL_EQUALITY (t2
);
1197 /* Called from count_trees via walk_tree. */
1200 count_trees_r (tree
*tp
, int *walk_subtrees
, void *data
)
1210 /* Debugging function for measuring the rough complexity of a tree
1214 count_trees (tree t
)
1217 walk_tree_without_duplicates (&t
, count_trees_r
, &n_trees
);
1221 /* Called from verify_stmt_tree via walk_tree. */
1224 verify_stmt_tree_r (tree
* tp
,
1225 int* walk_subtrees ATTRIBUTE_UNUSED
,
1229 htab_t
*statements
= (htab_t
*) data
;
1232 if (!STATEMENT_CODE_P (TREE_CODE (t
)))
1235 /* If this statement is already present in the hash table, then
1236 there is a circularity in the statement tree. */
1237 gcc_assert (!htab_find (*statements
, t
));
1239 slot
= htab_find_slot (*statements
, t
, INSERT
);
1245 /* Debugging function to check that the statement T has not been
1246 corrupted. For now, this function simply checks that T contains no
1250 verify_stmt_tree (tree t
)
1253 statements
= htab_create (37, htab_hash_pointer
, htab_eq_pointer
, NULL
);
1254 walk_tree (&t
, verify_stmt_tree_r
, &statements
, NULL
);
1255 htab_delete (statements
);
1258 /* Check if the type T depends on a type with no linkage and if so, return
1259 it. If RELAXED_P then do not consider a class type declared within
1260 a TREE_PUBLIC function to have no linkage. */
1263 no_linkage_check (tree t
, bool relaxed_p
)
1267 /* There's no point in checking linkage on template functions; we
1268 can't know their complete types. */
1269 if (processing_template_decl
)
1272 switch (TREE_CODE (t
))
1277 if (TYPE_PTRMEMFUNC_P (t
))
1281 if (!CLASS_TYPE_P (t
))
1285 if (TYPE_ANONYMOUS_P (t
))
1287 fn
= decl_function_context (TYPE_MAIN_DECL (t
));
1288 if (fn
&& (!relaxed_p
|| !TREE_PUBLIC (fn
)))
1294 case REFERENCE_TYPE
:
1295 return no_linkage_check (TREE_TYPE (t
), relaxed_p
);
1299 r
= no_linkage_check (TYPE_PTRMEM_POINTED_TO_TYPE (t
),
1303 return no_linkage_check (TYPE_PTRMEM_CLASS_TYPE (t
), relaxed_p
);
1306 r
= no_linkage_check (TYPE_METHOD_BASETYPE (t
), relaxed_p
);
1313 for (parm
= TYPE_ARG_TYPES (t
);
1314 parm
&& parm
!= void_list_node
;
1315 parm
= TREE_CHAIN (parm
))
1317 r
= no_linkage_check (TREE_VALUE (parm
), relaxed_p
);
1321 return no_linkage_check (TREE_TYPE (t
), relaxed_p
);
1329 #ifdef GATHER_STATISTICS
1330 extern int depth_reached
;
1334 cxx_print_statistics (void)
1336 print_search_statistics ();
1337 print_class_statistics ();
1338 #ifdef GATHER_STATISTICS
1339 fprintf (stderr
, "maximum template instantiation depth reached: %d\n",
1344 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1345 (which is an ARRAY_TYPE). This counts only elements of the top
1349 array_type_nelts_top (tree type
)
1351 return fold_build2 (PLUS_EXPR
, sizetype
,
1352 array_type_nelts (type
),
1356 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1357 (which is an ARRAY_TYPE). This one is a recursive count of all
1358 ARRAY_TYPEs that are clumped together. */
1361 array_type_nelts_total (tree type
)
1363 tree sz
= array_type_nelts_top (type
);
1364 type
= TREE_TYPE (type
);
1365 while (TREE_CODE (type
) == ARRAY_TYPE
)
1367 tree n
= array_type_nelts_top (type
);
1368 sz
= fold_build2 (MULT_EXPR
, sizetype
, sz
, n
);
1369 type
= TREE_TYPE (type
);
1374 /* Called from break_out_target_exprs via mapcar. */
1377 bot_manip (tree
* tp
, int* walk_subtrees
, void* data
)
1379 splay_tree target_remap
= ((splay_tree
) data
);
1382 if (!TYPE_P (t
) && TREE_CONSTANT (t
))
1384 /* There can't be any TARGET_EXPRs or their slot variables below
1385 this point. We used to check !TREE_SIDE_EFFECTS, but then we
1386 failed to copy an ADDR_EXPR of the slot VAR_DECL. */
1390 if (TREE_CODE (t
) == TARGET_EXPR
)
1394 if (TREE_CODE (TREE_OPERAND (t
, 1)) == AGGR_INIT_EXPR
)
1396 (TREE_TYPE (t
), break_out_target_exprs (TREE_OPERAND (t
, 1)));
1398 u
= build_target_expr_with_type
1399 (break_out_target_exprs (TREE_OPERAND (t
, 1)), TREE_TYPE (t
));
1401 /* Map the old variable to the new one. */
1402 splay_tree_insert (target_remap
,
1403 (splay_tree_key
) TREE_OPERAND (t
, 0),
1404 (splay_tree_value
) TREE_OPERAND (u
, 0));
1406 /* Replace the old expression with the new version. */
1408 /* We don't have to go below this point; the recursive call to
1409 break_out_target_exprs will have handled anything below this
1415 /* Make a copy of this node. */
1416 return copy_tree_r (tp
, walk_subtrees
, NULL
);
1419 /* Replace all remapped VAR_DECLs in T with their new equivalents.
1420 DATA is really a splay-tree mapping old variables to new
1424 bot_replace (tree
* t
,
1425 int* walk_subtrees ATTRIBUTE_UNUSED
,
1428 splay_tree target_remap
= ((splay_tree
) data
);
1430 if (TREE_CODE (*t
) == VAR_DECL
)
1432 splay_tree_node n
= splay_tree_lookup (target_remap
,
1433 (splay_tree_key
) *t
);
1435 *t
= (tree
) n
->value
;
1441 /* When we parse a default argument expression, we may create
1442 temporary variables via TARGET_EXPRs. When we actually use the
1443 default-argument expression, we make a copy of the expression, but
1444 we must replace the temporaries with appropriate local versions. */
1447 break_out_target_exprs (tree t
)
1449 static int target_remap_count
;
1450 static splay_tree target_remap
;
1452 if (!target_remap_count
++)
1453 target_remap
= splay_tree_new (splay_tree_compare_pointers
,
1454 /*splay_tree_delete_key_fn=*/NULL
,
1455 /*splay_tree_delete_value_fn=*/NULL
);
1456 walk_tree (&t
, bot_manip
, target_remap
, NULL
);
1457 walk_tree (&t
, bot_replace
, target_remap
, NULL
);
1459 if (!--target_remap_count
)
1461 splay_tree_delete (target_remap
);
1462 target_remap
= NULL
;
1468 /* Similar to `build_nt', but for template definitions of dependent
1472 build_min_nt (enum tree_code code
, ...)
1479 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
1483 t
= make_node (code
);
1484 length
= TREE_CODE_LENGTH (code
);
1486 for (i
= 0; i
< length
; i
++)
1488 tree x
= va_arg (p
, tree
);
1489 TREE_OPERAND (t
, i
) = x
;
1497 /* Similar to `build', but for template definitions. */
1500 build_min (enum tree_code code
, tree tt
, ...)
1507 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
1511 t
= make_node (code
);
1512 length
= TREE_CODE_LENGTH (code
);
1515 for (i
= 0; i
< length
; i
++)
1517 tree x
= va_arg (p
, tree
);
1518 TREE_OPERAND (t
, i
) = x
;
1519 if (x
&& !TYPE_P (x
) && TREE_SIDE_EFFECTS (x
))
1520 TREE_SIDE_EFFECTS (t
) = 1;
1527 /* Similar to `build', but for template definitions of non-dependent
1528 expressions. NON_DEP is the non-dependent expression that has been
1532 build_min_non_dep (enum tree_code code
, tree non_dep
, ...)
1539 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
1541 va_start (p
, non_dep
);
1543 t
= make_node (code
);
1544 length
= TREE_CODE_LENGTH (code
);
1545 TREE_TYPE (t
) = TREE_TYPE (non_dep
);
1546 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (non_dep
);
1548 for (i
= 0; i
< length
; i
++)
1550 tree x
= va_arg (p
, tree
);
1551 TREE_OPERAND (t
, i
) = x
;
1554 if (code
== COMPOUND_EXPR
&& TREE_CODE (non_dep
) != COMPOUND_EXPR
)
1555 /* This should not be considered a COMPOUND_EXPR, because it
1556 resolves to an overload. */
1557 COMPOUND_EXPR_OVERLOADED (t
) = 1;
1563 /* Similar to `build_call_list', but for template definitions of non-dependent
1564 expressions. NON_DEP is the non-dependent expression that has been
1568 build_min_non_dep_call_list (tree non_dep
, tree fn
, tree arglist
)
1570 tree t
= build_nt_call_list (fn
, arglist
);
1571 TREE_TYPE (t
) = TREE_TYPE (non_dep
);
1572 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (non_dep
);
1577 get_type_decl (tree t
)
1579 if (TREE_CODE (t
) == TYPE_DECL
)
1582 return TYPE_STUB_DECL (t
);
1583 gcc_assert (t
== error_mark_node
);
1587 /* Returns the namespace that contains DECL, whether directly or
1591 decl_namespace_context (tree decl
)
1595 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
1597 else if (TYPE_P (decl
))
1598 decl
= CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl
));
1600 decl
= CP_DECL_CONTEXT (decl
);
1604 /* Returns true if decl is within an anonymous namespace, however deeply
1605 nested, or false otherwise. */
1608 decl_anon_ns_mem_p (tree decl
)
1612 if (decl
== NULL_TREE
|| decl
== error_mark_node
)
1614 if (TREE_CODE (decl
) == NAMESPACE_DECL
1615 && DECL_NAME (decl
) == NULL_TREE
)
1617 /* Classes and namespaces inside anonymous namespaces have
1618 TREE_PUBLIC == 0, so we can shortcut the search. */
1619 else if (TYPE_P (decl
))
1620 return (TREE_PUBLIC (TYPE_NAME (decl
)) == 0);
1621 else if (TREE_CODE (decl
) == NAMESPACE_DECL
)
1622 return (TREE_PUBLIC (decl
) == 0);
1624 decl
= DECL_CONTEXT (decl
);
1628 /* Return truthvalue of whether T1 is the same tree structure as T2.
1629 Return 1 if they are the same. Return 0 if they are different. */
1632 cp_tree_equal (tree t1
, tree t2
)
1634 enum tree_code code1
, code2
;
1641 for (code1
= TREE_CODE (t1
);
1642 code1
== NOP_EXPR
|| code1
== CONVERT_EXPR
1643 || code1
== NON_LVALUE_EXPR
;
1644 code1
= TREE_CODE (t1
))
1645 t1
= TREE_OPERAND (t1
, 0);
1646 for (code2
= TREE_CODE (t2
);
1647 code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
1648 || code1
== NON_LVALUE_EXPR
;
1649 code2
= TREE_CODE (t2
))
1650 t2
= TREE_OPERAND (t2
, 0);
1652 /* They might have become equal now. */
1662 return TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
1663 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
);
1666 return REAL_VALUES_EQUAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
1669 return TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
1670 && !memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
1671 TREE_STRING_LENGTH (t1
));
1674 return cp_tree_equal (TREE_REALPART (t1
), TREE_REALPART (t2
))
1675 && cp_tree_equal (TREE_IMAGPART (t1
), TREE_IMAGPART (t2
));
1678 /* We need to do this when determining whether or not two
1679 non-type pointer to member function template arguments
1681 if (!(same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
1682 /* The first operand is RTL. */
1683 && TREE_OPERAND (t1
, 0) == TREE_OPERAND (t2
, 0)))
1685 return cp_tree_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
1688 if (!cp_tree_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
)))
1690 if (!cp_tree_equal (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1692 return cp_tree_equal (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
1695 return cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
1700 call_expr_arg_iterator iter1
, iter2
;
1701 if (!cp_tree_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
)))
1703 for (arg1
= first_call_expr_arg (t1
, &iter1
),
1704 arg2
= first_call_expr_arg (t2
, &iter2
);
1706 arg1
= next_call_expr_arg (&iter1
),
1707 arg2
= next_call_expr_arg (&iter2
))
1708 if (!cp_tree_equal (arg1
, arg2
))
1710 return (arg1
|| arg2
);
1715 tree o1
= TREE_OPERAND (t1
, 0);
1716 tree o2
= TREE_OPERAND (t2
, 0);
1718 /* Special case: if either target is an unallocated VAR_DECL,
1719 it means that it's going to be unified with whatever the
1720 TARGET_EXPR is really supposed to initialize, so treat it
1721 as being equivalent to anything. */
1722 if (TREE_CODE (o1
) == VAR_DECL
&& DECL_NAME (o1
) == NULL_TREE
1723 && !DECL_RTL_SET_P (o1
))
1725 else if (TREE_CODE (o2
) == VAR_DECL
&& DECL_NAME (o2
) == NULL_TREE
1726 && !DECL_RTL_SET_P (o2
))
1728 else if (!cp_tree_equal (o1
, o2
))
1731 return cp_tree_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
1734 case WITH_CLEANUP_EXPR
:
1735 if (!cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0)))
1737 return cp_tree_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
1740 if (TREE_OPERAND (t1
, 1) != TREE_OPERAND (t2
, 1))
1742 return cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
1749 case IDENTIFIER_NODE
:
1754 return (BASELINK_BINFO (t1
) == BASELINK_BINFO (t2
)
1755 && BASELINK_ACCESS_BINFO (t1
) == BASELINK_ACCESS_BINFO (t2
)
1756 && cp_tree_equal (BASELINK_FUNCTIONS (t1
),
1757 BASELINK_FUNCTIONS (t2
)));
1759 case TEMPLATE_PARM_INDEX
:
1760 return (TEMPLATE_PARM_IDX (t1
) == TEMPLATE_PARM_IDX (t2
)
1761 && TEMPLATE_PARM_LEVEL (t1
) == TEMPLATE_PARM_LEVEL (t2
)
1762 && same_type_p (TREE_TYPE (TEMPLATE_PARM_DECL (t1
)),
1763 TREE_TYPE (TEMPLATE_PARM_DECL (t2
))));
1765 case TEMPLATE_ID_EXPR
:
1770 if (!cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0)))
1772 vec1
= TREE_OPERAND (t1
, 1);
1773 vec2
= TREE_OPERAND (t2
, 1);
1776 return !vec1
&& !vec2
;
1778 if (TREE_VEC_LENGTH (vec1
) != TREE_VEC_LENGTH (vec2
))
1781 for (ix
= TREE_VEC_LENGTH (vec1
); ix
--;)
1782 if (!cp_tree_equal (TREE_VEC_ELT (vec1
, ix
),
1783 TREE_VEC_ELT (vec2
, ix
)))
1792 tree o1
= TREE_OPERAND (t1
, 0);
1793 tree o2
= TREE_OPERAND (t2
, 0);
1795 if (TREE_CODE (o1
) != TREE_CODE (o2
))
1798 return same_type_p (o1
, o2
);
1800 return cp_tree_equal (o1
, o2
);
1805 tree t1_op1
, t2_op1
;
1807 if (!cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0)))
1810 t1_op1
= TREE_OPERAND (t1
, 1);
1811 t2_op1
= TREE_OPERAND (t2
, 1);
1812 if (TREE_CODE (t1_op1
) != TREE_CODE (t2_op1
))
1815 return cp_tree_equal (TREE_OPERAND (t1
, 2), TREE_OPERAND (t2
, 2));
1819 /* Two pointer-to-members are the same if they point to the same
1820 field or function in the same class. */
1821 if (PTRMEM_CST_MEMBER (t1
) != PTRMEM_CST_MEMBER (t2
))
1824 return same_type_p (PTRMEM_CST_CLASS (t1
), PTRMEM_CST_CLASS (t2
));
1827 if (OVL_FUNCTION (t1
) != OVL_FUNCTION (t2
))
1829 return cp_tree_equal (OVL_CHAIN (t1
), OVL_CHAIN (t2
));
1832 if (TRAIT_EXPR_KIND (t1
) != TRAIT_EXPR_KIND (t2
))
1834 return same_type_p (TRAIT_EXPR_TYPE1 (t1
), TRAIT_EXPR_TYPE1 (t2
))
1835 && same_type_p (TRAIT_EXPR_TYPE2 (t1
), TRAIT_EXPR_TYPE2 (t2
));
1841 switch (TREE_CODE_CLASS (code1
))
1845 case tcc_comparison
:
1846 case tcc_expression
:
1853 n
= TREE_OPERAND_LENGTH (t1
);
1854 if (TREE_CODE_CLASS (code1
) == tcc_vl_exp
1855 && n
!= TREE_OPERAND_LENGTH (t2
))
1858 for (i
= 0; i
< n
; ++i
)
1859 if (!cp_tree_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
)))
1866 return same_type_p (t1
, t2
);
1870 /* We can get here with --disable-checking. */
1874 /* The type of ARG when used as an lvalue. */
1877 lvalue_type (tree arg
)
1879 tree type
= TREE_TYPE (arg
);
1883 /* The type of ARG for printing error messages; denote lvalues with
1887 error_type (tree arg
)
1889 tree type
= TREE_TYPE (arg
);
1891 if (TREE_CODE (type
) == ARRAY_TYPE
)
1893 else if (TREE_CODE (type
) == ERROR_MARK
)
1895 else if (real_lvalue_p (arg
))
1896 type
= build_reference_type (lvalue_type (arg
));
1897 else if (IS_AGGR_TYPE (type
))
1898 type
= lvalue_type (arg
);
1903 /* Does FUNCTION use a variable-length argument list? */
1906 varargs_function_p (tree function
)
1908 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (function
));
1909 for (; parm
; parm
= TREE_CHAIN (parm
))
1910 if (TREE_VALUE (parm
) == void_type_node
)
1915 /* Returns 1 if decl is a member of a class. */
1918 member_p (tree decl
)
1920 const tree ctx
= DECL_CONTEXT (decl
);
1921 return (ctx
&& TYPE_P (ctx
));
1924 /* Create a placeholder for member access where we don't actually have an
1925 object that the access is against. */
1928 build_dummy_object (tree type
)
1930 tree decl
= build1 (NOP_EXPR
, build_pointer_type (type
), void_zero_node
);
1931 return build_indirect_ref (decl
, NULL
);
1934 /* We've gotten a reference to a member of TYPE. Return *this if appropriate,
1935 or a dummy object otherwise. If BINFOP is non-0, it is filled with the
1936 binfo path from current_class_type to TYPE, or 0. */
1939 maybe_dummy_object (tree type
, tree
* binfop
)
1944 if (current_class_type
1945 && (binfo
= lookup_base (current_class_type
, type
,
1946 ba_unique
| ba_quiet
, NULL
)))
1947 context
= current_class_type
;
1950 /* Reference from a nested class member function. */
1952 binfo
= TYPE_BINFO (type
);
1958 if (current_class_ref
&& context
== current_class_type
1959 /* Kludge: Make sure that current_class_type is actually
1960 correct. It might not be if we're in the middle of
1961 tsubst_default_argument. */
1962 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref
)),
1963 current_class_type
))
1964 decl
= current_class_ref
;
1966 decl
= build_dummy_object (context
);
1971 /* Returns 1 if OB is a placeholder object, or a pointer to one. */
1974 is_dummy_object (tree ob
)
1976 if (TREE_CODE (ob
) == INDIRECT_REF
)
1977 ob
= TREE_OPERAND (ob
, 0);
1978 return (TREE_CODE (ob
) == NOP_EXPR
1979 && TREE_OPERAND (ob
, 0) == void_zero_node
);
1982 /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */
1987 t
= strip_array_types (t
);
1989 if (t
== error_mark_node
)
1991 if (INTEGRAL_TYPE_P (t
))
1992 return 1; /* integral, character or enumeral type */
1993 if (FLOAT_TYPE_P (t
))
1996 return 1; /* pointer to non-member */
1997 if (TYPE_PTR_TO_MEMBER_P (t
))
1998 return 1; /* pointer to member */
2000 if (TREE_CODE (t
) == VECTOR_TYPE
)
2001 return 1; /* vectors are (small) arrays of scalars */
2003 if (! CLASS_TYPE_P (t
))
2004 return 0; /* other non-class type (reference or function) */
2005 if (CLASSTYPE_NON_POD_P (t
))
2010 /* Nonzero iff type T is a class template implicit specialization. */
2013 class_tmpl_impl_spec_p (tree t
)
2015 return CLASS_TYPE_P (t
) && CLASSTYPE_TEMPLATE_INSTANTIATION (t
);
2018 /* Returns 1 iff zero initialization of type T means actually storing
2022 zero_init_p (tree t
)
2024 t
= strip_array_types (t
);
2026 if (t
== error_mark_node
)
2029 /* NULL pointers to data members are initialized with -1. */
2030 if (TYPE_PTRMEM_P (t
))
2033 /* Classes that contain types that can't be zero-initialized, cannot
2034 be zero-initialized themselves. */
2035 if (CLASS_TYPE_P (t
) && CLASSTYPE_NON_ZERO_INIT_P (t
))
2041 /* Table of valid C++ attributes. */
2042 const struct attribute_spec cxx_attribute_table
[] =
2044 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
2045 { "java_interface", 0, 0, false, false, false, handle_java_interface_attribute
},
2046 { "com_interface", 0, 0, false, false, false, handle_com_interface_attribute
},
2047 { "init_priority", 1, 1, true, false, false, handle_init_priority_attribute
},
2048 { NULL
, 0, 0, false, false, false, NULL
}
2051 /* Handle a "java_interface" attribute; arguments as in
2052 struct attribute_spec.handler. */
2054 handle_java_interface_attribute (tree
* node
,
2056 tree args ATTRIBUTE_UNUSED
,
2061 || !CLASS_TYPE_P (*node
)
2062 || !TYPE_FOR_JAVA (*node
))
2064 error ("%qE attribute can only be applied to Java class definitions",
2066 *no_add_attrs
= true;
2069 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
2070 *node
= build_variant_type_copy (*node
);
2071 TYPE_JAVA_INTERFACE (*node
) = 1;
2076 /* Handle a "com_interface" attribute; arguments as in
2077 struct attribute_spec.handler. */
2079 handle_com_interface_attribute (tree
* node
,
2081 tree args ATTRIBUTE_UNUSED
,
2082 int flags ATTRIBUTE_UNUSED
,
2087 *no_add_attrs
= true;
2090 || !CLASS_TYPE_P (*node
)
2091 || *node
!= TYPE_MAIN_VARIANT (*node
))
2093 warning (OPT_Wattributes
, "%qE attribute can only be applied "
2094 "to class definitions", name
);
2099 warning (0, "%qE is obsolete; g++ vtables are now COM-compatible by default",
2105 /* Handle an "init_priority" attribute; arguments as in
2106 struct attribute_spec.handler. */
2108 handle_init_priority_attribute (tree
* node
,
2111 int flags ATTRIBUTE_UNUSED
,
2114 tree initp_expr
= TREE_VALUE (args
);
2116 tree type
= TREE_TYPE (decl
);
2119 STRIP_NOPS (initp_expr
);
2121 if (!initp_expr
|| TREE_CODE (initp_expr
) != INTEGER_CST
)
2123 error ("requested init_priority is not an integer constant");
2124 *no_add_attrs
= true;
2128 pri
= TREE_INT_CST_LOW (initp_expr
);
2130 type
= strip_array_types (type
);
2132 if (decl
== NULL_TREE
2133 || TREE_CODE (decl
) != VAR_DECL
2134 || !TREE_STATIC (decl
)
2135 || DECL_EXTERNAL (decl
)
2136 || (TREE_CODE (type
) != RECORD_TYPE
2137 && TREE_CODE (type
) != UNION_TYPE
)
2138 /* Static objects in functions are initialized the
2139 first time control passes through that
2140 function. This is not precise enough to pin down an
2141 init_priority value, so don't allow it. */
2142 || current_function_decl
)
2144 error ("can only use %qE attribute on file-scope definitions "
2145 "of objects of class type", name
);
2146 *no_add_attrs
= true;
2150 if (pri
> MAX_INIT_PRIORITY
|| pri
<= 0)
2152 error ("requested init_priority is out of range");
2153 *no_add_attrs
= true;
2157 /* Check for init_priorities that are reserved for
2158 language and runtime support implementations.*/
2159 if (pri
<= MAX_RESERVED_INIT_PRIORITY
)
2162 (0, "requested init_priority is reserved for internal use");
2165 if (SUPPORTS_INIT_PRIORITY
)
2167 SET_DECL_INIT_PRIORITY (decl
, pri
);
2168 DECL_HAS_INIT_PRIORITY_P (decl
) = 1;
2173 error ("%qE attribute is not supported on this platform", name
);
2174 *no_add_attrs
= true;
2179 /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the
2180 thing pointed to by the constant. */
2183 make_ptrmem_cst (tree type
, tree member
)
2185 tree ptrmem_cst
= make_node (PTRMEM_CST
);
2186 TREE_TYPE (ptrmem_cst
) = type
;
2187 PTRMEM_CST_MEMBER (ptrmem_cst
) = member
;
2191 /* Build a variant of TYPE that has the indicated ATTRIBUTES. May
2192 return an existing type of an appropriate type already exists. */
2195 cp_build_type_attribute_variant (tree type
, tree attributes
)
2199 new_type
= build_type_attribute_variant (type
, attributes
);
2200 if (TREE_CODE (new_type
) == FUNCTION_TYPE
2201 && (TYPE_RAISES_EXCEPTIONS (new_type
)
2202 != TYPE_RAISES_EXCEPTIONS (type
)))
2203 new_type
= build_exception_variant (new_type
,
2204 TYPE_RAISES_EXCEPTIONS (type
));
2206 /* Making a new main variant of a class type is broken. */
2207 gcc_assert (!CLASS_TYPE_P (type
) || new_type
== type
);
2212 /* Apply FUNC to all language-specific sub-trees of TP in a pre-order
2213 traversal. Called from walk_tree. */
2216 cp_walk_subtrees (tree
*tp
, int *walk_subtrees_p
, walk_tree_fn func
,
2217 void *data
, struct pointer_set_t
*pset
)
2219 enum tree_code code
= TREE_CODE (*tp
);
2222 #define WALK_SUBTREE(NODE) \
2225 result = walk_tree (&(NODE), func, data, pset); \
2226 if (result) goto out; \
2230 /* Not one of the easy cases. We must explicitly go through the
2236 case TEMPLATE_TEMPLATE_PARM
:
2237 case BOUND_TEMPLATE_TEMPLATE_PARM
:
2238 case UNBOUND_CLASS_TEMPLATE
:
2239 case TEMPLATE_PARM_INDEX
:
2240 case TEMPLATE_TYPE_PARM
:
2243 /* None of these have subtrees other than those already walked
2245 *walk_subtrees_p
= 0;
2249 WALK_SUBTREE (BASELINK_FUNCTIONS (*tp
));
2250 *walk_subtrees_p
= 0;
2254 WALK_SUBTREE (TINST_DECL (*tp
));
2255 *walk_subtrees_p
= 0;
2259 WALK_SUBTREE (TREE_TYPE (*tp
));
2260 *walk_subtrees_p
= 0;
2264 WALK_SUBTREE (TREE_PURPOSE (*tp
));
2268 WALK_SUBTREE (OVL_FUNCTION (*tp
));
2269 WALK_SUBTREE (OVL_CHAIN (*tp
));
2270 *walk_subtrees_p
= 0;
2274 if (TYPE_PTRMEMFUNC_P (*tp
))
2275 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (*tp
));
2278 case TYPE_ARGUMENT_PACK
:
2279 case NONTYPE_ARGUMENT_PACK
:
2281 tree args
= ARGUMENT_PACK_ARGS (*tp
);
2282 int i
, len
= TREE_VEC_LENGTH (args
);
2283 for (i
= 0; i
< len
; i
++)
2284 WALK_SUBTREE (TREE_VEC_ELT (args
, i
));
2288 case TYPE_PACK_EXPANSION
:
2289 WALK_SUBTREE (TREE_TYPE (*tp
));
2290 *walk_subtrees_p
= 0;
2293 case EXPR_PACK_EXPANSION
:
2294 WALK_SUBTREE (TREE_OPERAND (*tp
, 0));
2295 *walk_subtrees_p
= 0;
2299 if (TREE_TYPE (*tp
))
2300 WALK_SUBTREE (TREE_TYPE (*tp
));
2304 for (i
= 0; i
< TREE_CODE_LENGTH (TREE_CODE (*tp
)); ++i
)
2305 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
2307 *walk_subtrees_p
= 0;
2311 WALK_SUBTREE (TRAIT_EXPR_TYPE1 (*tp
));
2312 WALK_SUBTREE (TRAIT_EXPR_TYPE2 (*tp
));
2313 *walk_subtrees_p
= 0;
2320 /* We didn't find what we were looking for. */
2327 /* Decide whether there are language-specific reasons to not inline a
2328 function as a tree. */
2331 cp_cannot_inline_tree_fn (tree
* fnp
)
2335 /* We can inline a template instantiation only if it's fully
2337 if (DECL_TEMPLATE_INFO (fn
)
2338 && TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (fn
)))
2340 /* Don't instantiate functions that are not going to be
2342 if (!DECL_INLINE (DECL_TEMPLATE_RESULT
2343 (template_for_substitution (fn
))))
2346 fn
= *fnp
= instantiate_decl (fn
, /*defer_ok=*/0, /*undefined_ok=*/0);
2348 if (TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (fn
)))
2352 if (flag_really_no_inline
2353 && lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)) == NULL
)
2356 /* Don't auto-inline functions that might be replaced at link-time
2357 with an alternative definition. */
2358 if (!DECL_DECLARED_INLINE_P (fn
) && DECL_REPLACEABLE_P (fn
))
2360 DECL_UNINLINABLE (fn
) = 1;
2364 if (varargs_function_p (fn
))
2366 DECL_UNINLINABLE (fn
) = 1;
2370 if (! function_attribute_inlinable_p (fn
))
2372 DECL_UNINLINABLE (fn
) = 1;
2379 /* Determine whether VAR is a declaration of an automatic variable in
2383 cp_auto_var_in_fn_p (tree var
, tree fn
)
2385 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
2386 && nonstatic_local_decl_p (var
));
2389 /* Like save_expr, but for C++. */
2392 cp_save_expr (tree expr
)
2394 /* There is no reason to create a SAVE_EXPR within a template; if
2395 needed, we can create the SAVE_EXPR when instantiating the
2396 template. Furthermore, the middle-end cannot handle C++-specific
2398 if (processing_template_decl
)
2400 return save_expr (expr
);
2403 /* Initialize tree.c. */
2408 list_hash_table
= htab_create_ggc (31, list_hash
, list_hash_eq
, NULL
);
2411 /* Returns the kind of special function that DECL (a FUNCTION_DECL)
2412 is. Note that sfk_none is zero, so this function can be used as a
2413 predicate to test whether or not DECL is a special function. */
2415 special_function_kind
2416 special_function_p (tree decl
)
2418 /* Rather than doing all this stuff with magic names, we should
2419 probably have a field of type `special_function_kind' in
2420 DECL_LANG_SPECIFIC. */
2421 if (DECL_COPY_CONSTRUCTOR_P (decl
))
2422 return sfk_copy_constructor
;
2423 if (DECL_CONSTRUCTOR_P (decl
))
2424 return sfk_constructor
;
2425 if (DECL_OVERLOADED_OPERATOR_P (decl
) == NOP_EXPR
)
2426 return sfk_assignment_operator
;
2427 if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl
))
2428 return sfk_destructor
;
2429 if (DECL_COMPLETE_DESTRUCTOR_P (decl
))
2430 return sfk_complete_destructor
;
2431 if (DECL_BASE_DESTRUCTOR_P (decl
))
2432 return sfk_base_destructor
;
2433 if (DECL_DELETING_DESTRUCTOR_P (decl
))
2434 return sfk_deleting_destructor
;
2435 if (DECL_CONV_FN_P (decl
))
2436 return sfk_conversion
;
2441 /* Returns nonzero if TYPE is a character type, including wchar_t. */
2444 char_type_p (tree type
)
2446 return (same_type_p (type
, char_type_node
)
2447 || same_type_p (type
, unsigned_char_type_node
)
2448 || same_type_p (type
, signed_char_type_node
)
2449 || same_type_p (type
, wchar_type_node
));
2452 /* Returns the kind of linkage associated with the indicated DECL. Th
2453 value returned is as specified by the language standard; it is
2454 independent of implementation details regarding template
2455 instantiation, etc. For example, it is possible that a declaration
2456 to which this function assigns external linkage would not show up
2457 as a global symbol when you run `nm' on the resulting object file. */
2460 decl_linkage (tree decl
)
2462 /* This function doesn't attempt to calculate the linkage from first
2463 principles as given in [basic.link]. Instead, it makes use of
2464 the fact that we have already set TREE_PUBLIC appropriately, and
2465 then handles a few special cases. Ideally, we would calculate
2466 linkage first, and then transform that into a concrete
2469 /* Things that don't have names have no linkage. */
2470 if (!DECL_NAME (decl
))
2473 /* Things that are TREE_PUBLIC have external linkage. */
2474 if (TREE_PUBLIC (decl
))
2477 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
2480 /* Linkage of a CONST_DECL depends on the linkage of the enumeration
2482 if (TREE_CODE (decl
) == CONST_DECL
)
2483 return decl_linkage (TYPE_NAME (TREE_TYPE (decl
)));
2485 /* Some things that are not TREE_PUBLIC have external linkage, too.
2486 For example, on targets that don't have weak symbols, we make all
2487 template instantiations have internal linkage (in the object
2488 file), but the symbols should still be treated as having external
2489 linkage from the point of view of the language. */
2490 if (TREE_CODE (decl
) != TYPE_DECL
&& DECL_LANG_SPECIFIC (decl
)
2491 && DECL_COMDAT (decl
))
2494 /* Things in local scope do not have linkage, if they don't have
2496 if (decl_function_context (decl
))
2499 /* Members of the anonymous namespace also have TREE_PUBLIC unset, but
2500 are considered to have external linkage for language purposes. DECLs
2501 really meant to have internal linkage have DECL_THIS_STATIC set. */
2502 if (TREE_CODE (decl
) == TYPE_DECL
2503 || ((TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
)
2504 && !DECL_THIS_STATIC (decl
)))
2507 /* Everything else has internal linkage. */
2511 /* EXP is an expression that we want to pre-evaluate. Returns (in
2512 *INITP) an expression that will perform the pre-evaluation. The
2513 value returned by this function is a side-effect free expression
2514 equivalent to the pre-evaluated expression. Callers must ensure
2515 that *INITP is evaluated before EXP. */
2518 stabilize_expr (tree exp
, tree
* initp
)
2522 if (!TREE_SIDE_EFFECTS (exp
))
2523 init_expr
= NULL_TREE
;
2524 else if (!real_lvalue_p (exp
)
2525 || !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (exp
)))
2527 init_expr
= get_target_expr (exp
);
2528 exp
= TARGET_EXPR_SLOT (init_expr
);
2532 exp
= build_unary_op (ADDR_EXPR
, exp
, 1);
2533 init_expr
= get_target_expr (exp
);
2534 exp
= TARGET_EXPR_SLOT (init_expr
);
2535 exp
= build_indirect_ref (exp
, 0);
2539 gcc_assert (!TREE_SIDE_EFFECTS (exp
));
2543 /* Add NEW, an expression whose value we don't care about, after the
2544 similar expression ORIG. */
2547 add_stmt_to_compound (tree orig
, tree
new)
2549 if (!new || !TREE_SIDE_EFFECTS (new))
2551 if (!orig
|| !TREE_SIDE_EFFECTS (orig
))
2553 return build2 (COMPOUND_EXPR
, void_type_node
, orig
, new);
2556 /* Like stabilize_expr, but for a call whose arguments we want to
2557 pre-evaluate. CALL is modified in place to use the pre-evaluated
2558 arguments, while, upon return, *INITP contains an expression to
2559 compute the arguments. */
2562 stabilize_call (tree call
, tree
*initp
)
2564 tree inits
= NULL_TREE
;
2566 int nargs
= call_expr_nargs (call
);
2568 if (call
== error_mark_node
)
2571 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
2573 for (i
= 0; i
< nargs
; i
++)
2576 CALL_EXPR_ARG (call
, i
) =
2577 stabilize_expr (CALL_EXPR_ARG (call
, i
), &init
);
2578 inits
= add_stmt_to_compound (inits
, init
);
2584 /* Like stabilize_expr, but for an AGGR_INIT_EXPR whose arguments we want
2585 to pre-evaluate. CALL is modified in place to use the pre-evaluated
2586 arguments, while, upon return, *INITP contains an expression to
2587 compute the arguments. */
2590 stabilize_aggr_init (tree call
, tree
*initp
)
2592 tree inits
= NULL_TREE
;
2594 int nargs
= aggr_init_expr_nargs (call
);
2596 if (call
== error_mark_node
)
2599 gcc_assert (TREE_CODE (call
) == AGGR_INIT_EXPR
);
2601 for (i
= 0; i
< nargs
; i
++)
2604 AGGR_INIT_EXPR_ARG (call
, i
) =
2605 stabilize_expr (AGGR_INIT_EXPR_ARG (call
, i
), &init
);
2606 inits
= add_stmt_to_compound (inits
, init
);
2612 /* Like stabilize_expr, but for an initialization.
2614 If the initialization is for an object of class type, this function
2615 takes care not to introduce additional temporaries.
2617 Returns TRUE iff the expression was successfully pre-evaluated,
2618 i.e., if INIT is now side-effect free, except for, possible, a
2619 single call to a constructor. */
2622 stabilize_init (tree init
, tree
*initp
)
2628 if (t
== error_mark_node
)
2631 if (TREE_CODE (t
) == INIT_EXPR
2632 && TREE_CODE (TREE_OPERAND (t
, 1)) != TARGET_EXPR
)
2634 TREE_OPERAND (t
, 1) = stabilize_expr (TREE_OPERAND (t
, 1), initp
);
2638 if (TREE_CODE (t
) == INIT_EXPR
)
2639 t
= TREE_OPERAND (t
, 1);
2640 if (TREE_CODE (t
) == TARGET_EXPR
)
2641 t
= TARGET_EXPR_INITIAL (t
);
2642 if (TREE_CODE (t
) == COMPOUND_EXPR
)
2644 if (TREE_CODE (t
) == CONSTRUCTOR
2645 && EMPTY_CONSTRUCTOR_P (t
))
2646 /* Default-initialization. */
2649 /* If the initializer is a COND_EXPR, we can't preevaluate
2651 if (TREE_CODE (t
) == COND_EXPR
)
2654 if (TREE_CODE (t
) == CALL_EXPR
)
2656 stabilize_call (t
, initp
);
2660 if (TREE_CODE (t
) == AGGR_INIT_EXPR
)
2662 stabilize_aggr_init (t
, initp
);
2666 /* The initialization is being performed via a bitwise copy -- and
2667 the item copied may have side effects. */
2668 return TREE_SIDE_EFFECTS (init
);
2671 /* Like "fold", but should be used whenever we might be processing the
2672 body of a template. */
2675 fold_if_not_in_template (tree expr
)
2677 /* In the body of a template, there is never any need to call
2678 "fold". We will call fold later when actually instantiating the
2679 template. Integral constant expressions in templates will be
2680 evaluated via fold_non_dependent_expr, as necessary. */
2681 if (processing_template_decl
)
2684 /* Fold C++ front-end specific tree codes. */
2685 if (TREE_CODE (expr
) == UNARY_PLUS_EXPR
)
2686 return fold_convert (TREE_TYPE (expr
), TREE_OPERAND (expr
, 0));
2691 /* Returns true if a cast to TYPE may appear in an integral constant
2695 cast_valid_in_integral_constant_expression_p (tree type
)
2697 return (INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
2698 || dependent_type_p (type
)
2699 || type
== error_mark_node
);
2703 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
2704 /* Complain that some language-specific thing hanging off a tree
2705 node has been accessed improperly. */
2708 lang_check_failed (const char* file
, int line
, const char* function
)
2710 internal_error ("lang_* check: failed in %s, at %s:%d",
2711 function
, trim_filename (file
), line
);
2713 #endif /* ENABLE_TREE_CHECKING */
2715 #include "gt-cp-tree.h"