1 /* Language-dependent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2007, 2008, 2009, 2010, 2011
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"
30 #include "tree-inline.h"
34 #include "splay-tree.h"
35 #include "gimple.h" /* gimple_has_body_p */
37 static tree
bot_manip (tree
*, int *, void *);
38 static tree
bot_replace (tree
*, int *, void *);
39 static int list_hash_eq (const void *, const void *);
40 static hashval_t
list_hash_pieces (tree
, tree
, tree
);
41 static hashval_t
list_hash (const void *);
42 static tree
build_target_expr (tree
, tree
, tsubst_flags_t
);
43 static tree
count_trees_r (tree
*, int *, void *);
44 static tree
verify_stmt_tree_r (tree
*, int *, void *);
45 static tree
build_local_temp (tree
);
47 static tree
handle_java_interface_attribute (tree
*, tree
, tree
, int, bool *);
48 static tree
handle_com_interface_attribute (tree
*, tree
, tree
, int, bool *);
49 static tree
handle_init_priority_attribute (tree
*, tree
, tree
, int, bool *);
51 /* If REF is an lvalue, returns the kind of lvalue that REF is.
52 Otherwise, returns clk_none. */
55 lvalue_kind (const_tree ref
)
57 cp_lvalue_kind op1_lvalue_kind
= clk_none
;
58 cp_lvalue_kind op2_lvalue_kind
= clk_none
;
60 /* Expressions of reference type are sometimes wrapped in
61 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
62 representation, not part of the language, so we have to look
64 if (TREE_CODE (ref
) == INDIRECT_REF
65 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 0)))
67 return lvalue_kind (TREE_OPERAND (ref
, 0));
70 && TREE_CODE (TREE_TYPE (ref
)) == REFERENCE_TYPE
)
72 /* unnamed rvalue references are rvalues */
73 if (TYPE_REF_IS_RVALUE (TREE_TYPE (ref
))
74 && TREE_CODE (ref
) != PARM_DECL
75 && TREE_CODE (ref
) != VAR_DECL
76 && TREE_CODE (ref
) != COMPONENT_REF
77 /* Functions are always lvalues. */
78 && TREE_CODE (TREE_TYPE (TREE_TYPE (ref
))) != FUNCTION_TYPE
)
81 /* lvalue references and named rvalue references are lvalues. */
85 if (ref
== current_class_ptr
)
88 switch (TREE_CODE (ref
))
92 /* preincrements and predecrements are valid lvals, provided
93 what they refer to are valid lvals. */
94 case PREINCREMENT_EXPR
:
95 case PREDECREMENT_EXPR
:
97 case WITH_CLEANUP_EXPR
:
100 return lvalue_kind (TREE_OPERAND (ref
, 0));
103 op1_lvalue_kind
= lvalue_kind (TREE_OPERAND (ref
, 0));
104 /* Look at the member designator. */
105 if (!op1_lvalue_kind
)
107 else if (is_overloaded_fn (TREE_OPERAND (ref
, 1)))
108 /* The "field" can be a FUNCTION_DECL or an OVERLOAD in some
109 situations. If we're seeing a COMPONENT_REF, it's a non-static
110 member, so it isn't an lvalue. */
111 op1_lvalue_kind
= clk_none
;
112 else if (TREE_CODE (TREE_OPERAND (ref
, 1)) != FIELD_DECL
)
113 /* This can be IDENTIFIER_NODE in a template. */;
114 else if (DECL_C_BIT_FIELD (TREE_OPERAND (ref
, 1)))
116 /* Clear the ordinary bit. If this object was a class
117 rvalue we want to preserve that information. */
118 op1_lvalue_kind
&= ~clk_ordinary
;
119 /* The lvalue is for a bitfield. */
120 op1_lvalue_kind
|= clk_bitfield
;
122 else if (DECL_PACKED (TREE_OPERAND (ref
, 1)))
123 op1_lvalue_kind
|= clk_packed
;
125 return op1_lvalue_kind
;
128 case COMPOUND_LITERAL_EXPR
:
132 /* CONST_DECL without TREE_STATIC are enumeration values and
133 thus not lvalues. With TREE_STATIC they are used by ObjC++
134 in objc_build_string_object and need to be considered as
136 if (! TREE_STATIC (ref
))
139 if (TREE_READONLY (ref
) && ! TREE_STATIC (ref
)
140 && DECL_LANG_SPECIFIC (ref
)
141 && DECL_IN_AGGR_P (ref
))
147 if (TREE_CODE (TREE_TYPE (ref
)) != METHOD_TYPE
)
151 /* A scope ref in a template, left as SCOPE_REF to support later
154 gcc_assert (!type_dependent_expression_p (CONST_CAST_TREE(ref
)));
155 return lvalue_kind (TREE_OPERAND (ref
, 1));
159 /* Disallow <? and >? as lvalues if either argument side-effects. */
160 if (TREE_SIDE_EFFECTS (TREE_OPERAND (ref
, 0))
161 || TREE_SIDE_EFFECTS (TREE_OPERAND (ref
, 1)))
163 op1_lvalue_kind
= lvalue_kind (TREE_OPERAND (ref
, 0));
164 op2_lvalue_kind
= lvalue_kind (TREE_OPERAND (ref
, 1));
168 op1_lvalue_kind
= lvalue_kind (TREE_OPERAND (ref
, 1)
169 ? TREE_OPERAND (ref
, 1)
170 : TREE_OPERAND (ref
, 0));
171 op2_lvalue_kind
= lvalue_kind (TREE_OPERAND (ref
, 2));
178 return lvalue_kind (TREE_OPERAND (ref
, 1));
184 return (CLASS_TYPE_P (TREE_TYPE (ref
)) ? clk_class
: clk_none
);
187 /* Any class-valued call would be wrapped in a TARGET_EXPR. */
191 /* All functions (except non-static-member functions) are
193 return (DECL_NONSTATIC_MEMBER_FUNCTION_P (ref
)
194 ? clk_none
: clk_ordinary
);
197 /* We now represent a reference to a single static member function
199 /* This CONST_CAST is okay because BASELINK_FUNCTIONS returns
200 its argument unmodified and we assign it to a const_tree. */
201 return lvalue_kind (BASELINK_FUNCTIONS (CONST_CAST_TREE (ref
)));
203 case NON_DEPENDENT_EXPR
:
204 /* We must consider NON_DEPENDENT_EXPRs to be lvalues so that
205 things like "&E" where "E" is an expression with a
206 non-dependent type work. It is safe to be lenient because an
207 error will be issued when the template is instantiated if "E"
215 /* If one operand is not an lvalue at all, then this expression is
217 if (!op1_lvalue_kind
|| !op2_lvalue_kind
)
220 /* Otherwise, it's an lvalue, and it has all the odd properties
221 contributed by either operand. */
222 op1_lvalue_kind
= op1_lvalue_kind
| op2_lvalue_kind
;
223 /* It's not an ordinary lvalue if it involves any other kind. */
224 if ((op1_lvalue_kind
& ~clk_ordinary
) != clk_none
)
225 op1_lvalue_kind
&= ~clk_ordinary
;
226 /* It can't be both a pseudo-lvalue and a non-addressable lvalue.
227 A COND_EXPR of those should be wrapped in a TARGET_EXPR. */
228 if ((op1_lvalue_kind
& (clk_rvalueref
|clk_class
))
229 && (op1_lvalue_kind
& (clk_bitfield
|clk_packed
)))
230 op1_lvalue_kind
= clk_none
;
231 return op1_lvalue_kind
;
234 /* Returns the kind of lvalue that REF is, in the sense of
235 [basic.lval]. This function should really be named lvalue_p; it
236 computes the C++ definition of lvalue. */
239 real_lvalue_p (const_tree ref
)
241 cp_lvalue_kind kind
= lvalue_kind (ref
);
242 if (kind
& (clk_rvalueref
|clk_class
))
248 /* This differs from real_lvalue_p in that class rvalues are considered
252 lvalue_p (const_tree ref
)
254 return (lvalue_kind (ref
) != clk_none
);
257 /* This differs from real_lvalue_p in that rvalues formed by dereferencing
258 rvalue references are considered rvalues. */
261 lvalue_or_rvalue_with_address_p (const_tree ref
)
263 cp_lvalue_kind kind
= lvalue_kind (ref
);
264 if (kind
& clk_class
)
267 return (kind
!= clk_none
);
270 /* Test whether DECL is a builtin that may appear in a
271 constant-expression. */
274 builtin_valid_in_constant_expr_p (const_tree decl
)
276 /* At present BUILT_IN_CONSTANT_P is the only builtin we're allowing
277 in constant-expressions. We may want to add other builtins later. */
278 return DECL_IS_BUILTIN_CONSTANT_P (decl
);
281 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
284 build_target_expr (tree decl
, tree value
, tsubst_flags_t complain
)
288 #ifdef ENABLE_CHECKING
289 gcc_assert (VOID_TYPE_P (TREE_TYPE (value
))
290 || TREE_TYPE (decl
) == TREE_TYPE (value
)
291 || useless_type_conversion_p (TREE_TYPE (decl
),
295 t
= cxx_maybe_build_cleanup (decl
, complain
);
296 if (t
== error_mark_node
)
297 return error_mark_node
;
298 t
= build4 (TARGET_EXPR
, TREE_TYPE (decl
), decl
, value
, t
, NULL_TREE
);
299 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
300 ignore the TARGET_EXPR. If there really turn out to be no
301 side-effects, then the optimizer should be able to get rid of
302 whatever code is generated anyhow. */
303 TREE_SIDE_EFFECTS (t
) = 1;
308 /* Return an undeclared local temporary of type TYPE for use in building a
312 build_local_temp (tree type
)
314 tree slot
= build_decl (input_location
,
315 VAR_DECL
, NULL_TREE
, type
);
316 DECL_ARTIFICIAL (slot
) = 1;
317 DECL_IGNORED_P (slot
) = 1;
318 DECL_CONTEXT (slot
) = current_function_decl
;
319 layout_decl (slot
, 0);
323 /* Set various status flags when building an AGGR_INIT_EXPR object T. */
326 process_aggr_init_operands (tree t
)
330 side_effects
= TREE_SIDE_EFFECTS (t
);
334 n
= TREE_OPERAND_LENGTH (t
);
335 for (i
= 1; i
< n
; i
++)
337 tree op
= TREE_OPERAND (t
, i
);
338 if (op
&& TREE_SIDE_EFFECTS (op
))
345 TREE_SIDE_EFFECTS (t
) = side_effects
;
348 /* Build an AGGR_INIT_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE,
349 FN, and SLOT. NARGS is the number of call arguments which are specified
350 as a tree array ARGS. */
353 build_aggr_init_array (tree return_type
, tree fn
, tree slot
, int nargs
,
359 t
= build_vl_exp (AGGR_INIT_EXPR
, nargs
+ 3);
360 TREE_TYPE (t
) = return_type
;
361 AGGR_INIT_EXPR_FN (t
) = fn
;
362 AGGR_INIT_EXPR_SLOT (t
) = slot
;
363 for (i
= 0; i
< nargs
; i
++)
364 AGGR_INIT_EXPR_ARG (t
, i
) = args
[i
];
365 process_aggr_init_operands (t
);
369 /* INIT is a CALL_EXPR or AGGR_INIT_EXPR which needs info about its
370 target. TYPE is the type to be initialized.
372 Build an AGGR_INIT_EXPR to represent the initialization. This function
373 differs from build_cplus_new in that an AGGR_INIT_EXPR can only be used
374 to initialize another object, whereas a TARGET_EXPR can either
375 initialize another object or create its own temporary object, and as a
376 result building up a TARGET_EXPR requires that the type's destructor be
380 build_aggr_init_expr (tree type
, tree init
, tsubst_flags_t complain
)
387 /* Make sure that we're not trying to create an instance of an
389 if (abstract_virtuals_error_sfinae (NULL_TREE
, type
, complain
))
390 return error_mark_node
;
392 if (TREE_CODE (init
) == CALL_EXPR
)
393 fn
= CALL_EXPR_FN (init
);
394 else if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
395 fn
= AGGR_INIT_EXPR_FN (init
);
397 return convert (type
, init
);
399 is_ctor
= (TREE_CODE (fn
) == ADDR_EXPR
400 && TREE_CODE (TREE_OPERAND (fn
, 0)) == FUNCTION_DECL
401 && DECL_CONSTRUCTOR_P (TREE_OPERAND (fn
, 0)));
403 /* We split the CALL_EXPR into its function and its arguments here.
404 Then, in expand_expr, we put them back together. The reason for
405 this is that this expression might be a default argument
406 expression. In that case, we need a new temporary every time the
407 expression is used. That's what break_out_target_exprs does; it
408 replaces every AGGR_INIT_EXPR with a copy that uses a fresh
409 temporary slot. Then, expand_expr builds up a call-expression
410 using the new slot. */
412 /* If we don't need to use a constructor to create an object of this
413 type, don't mess with AGGR_INIT_EXPR. */
414 if (is_ctor
|| TREE_ADDRESSABLE (type
))
416 slot
= build_local_temp (type
);
418 if (TREE_CODE(init
) == CALL_EXPR
)
419 rval
= build_aggr_init_array (void_type_node
, fn
, slot
,
420 call_expr_nargs (init
),
421 CALL_EXPR_ARGP (init
));
423 rval
= build_aggr_init_array (void_type_node
, fn
, slot
,
424 aggr_init_expr_nargs (init
),
425 AGGR_INIT_EXPR_ARGP (init
));
426 TREE_SIDE_EFFECTS (rval
) = 1;
427 AGGR_INIT_VIA_CTOR_P (rval
) = is_ctor
;
428 TREE_NOTHROW (rval
) = TREE_NOTHROW (init
);
436 /* INIT is a CALL_EXPR or AGGR_INIT_EXPR which needs info about its
437 target. TYPE is the type that this initialization should appear to
440 Build an encapsulation of the initialization to perform
441 and return it so that it can be processed by language-independent
442 and language-specific expression expanders. */
445 build_cplus_new (tree type
, tree init
, tsubst_flags_t complain
)
447 tree rval
= build_aggr_init_expr (type
, init
, complain
);
450 if (TREE_CODE (rval
) == AGGR_INIT_EXPR
)
451 slot
= AGGR_INIT_EXPR_SLOT (rval
);
452 else if (TREE_CODE (rval
) == CALL_EXPR
453 || TREE_CODE (rval
) == CONSTRUCTOR
)
454 slot
= build_local_temp (type
);
458 rval
= build_target_expr (slot
, rval
, complain
);
460 if (rval
!= error_mark_node
)
461 TARGET_EXPR_IMPLICIT_P (rval
) = 1;
466 /* Subroutine of build_vec_init_expr: Build up a single element
467 intialization as a proxy for the full array initialization to get things
468 marked as used and any appropriate diagnostics.
470 Since we're deferring building the actual constructor calls until
471 gimplification time, we need to build one now and throw it away so
472 that the relevant constructor gets mark_used before cgraph decides
473 what functions are needed. Here we assume that init is either
474 NULL_TREE, void_type_node (indicating value-initialization), or
475 another array to copy. */
478 build_vec_init_elt (tree type
, tree init
, tsubst_flags_t complain
)
480 tree inner_type
= strip_array_types (TREE_TYPE (type
));
481 VEC(tree
,gc
) *argvec
;
483 if (!CLASS_TYPE_P (inner_type
))
484 /* No interesting initialization to do. */
485 return integer_zero_node
;
486 else if (init
== void_type_node
)
487 return build_value_init (inner_type
, tf_warning_or_error
);
489 if (init
== NULL_TREE
)
490 argvec
= make_tree_vector ();
491 else if (TREE_CODE (init
) == TREE_LIST
)
492 /* Array init extension, i.e. g++.robertl/eb58.C. */
493 argvec
= make_tree_vector_from_list (init
);
494 else if (same_type_ignoring_top_level_qualifiers_p
495 (inner_type
, strip_array_types (TREE_TYPE (init
))))
497 /* Array copy or list-initialization. */
498 tree dummy
= build_dummy_object (inner_type
);
499 if (!real_lvalue_p (init
))
500 dummy
= move (dummy
);
501 argvec
= make_tree_vector_single (dummy
);
505 init
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
506 &argvec
, inner_type
, LOOKUP_NORMAL
,
508 release_tree_vector (argvec
);
510 /* For array new, also mark the destructor as used. */
511 if (TREE_CODE (type
) == POINTER_TYPE
512 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (inner_type
))
514 tree dtor
= get_dtor_sfinae (inner_type
, complain
);
515 if (dtor
== error_mark_node
)
516 return error_mark_node
;
523 /* Return a TARGET_EXPR which expresses the initialization of an array. If
524 TARGET is an array type, the initialization is of an array to be named
525 later, and the initialization will be wrapped in a TARGET_EXPR. If
526 TARGET is an expression, it is the array to be initialized. INIT is the
527 initializer, or void_type_node for value-initialization. If TARGET is
528 an expression, NELTS is the number of elements to initialize. */
531 build_vec_init_expr (tree target
, tree init
, tree nelts
,
532 tsubst_flags_t complain
)
535 bool value_init
= false;
541 gcc_assert (TREE_CODE (target
) == ARRAY_TYPE
&& nelts
== NULL_TREE
);
543 slot
= build_local_temp (type
);
547 gcc_assert (EXPR_P (target
));
549 type
= TREE_TYPE (slot
);
550 gcc_assert (TREE_CODE (type
) == POINTER_TYPE
&& nelts
!= NULL_TREE
);
553 if (init
== void_type_node
)
559 real_nelts
= nelts
? nelts
: array_type_nelts_total (type
);
560 if (integer_zerop (real_nelts
))
561 /* No elements to initialize. */
562 elt_init
= integer_zero_node
;
564 elt_init
= build_vec_init_elt (type
, init
, complain
);
566 init
= build3 (VEC_INIT_EXPR
, type
, slot
, init
, nelts
);
567 TREE_SIDE_EFFECTS (init
) = true;
568 SET_EXPR_LOCATION (init
, input_location
);
570 if (cxx_dialect
>= cxx0x
571 && potential_constant_expression (elt_init
))
572 VEC_INIT_EXPR_IS_CONSTEXPR (init
) = true;
573 VEC_INIT_EXPR_VALUE_INIT (init
) = value_init
;
576 /* If we specified what array we're initializing, make sure
577 we don't override that in cp_gimplify_init_expr. */
578 init
= cp_build_compound_expr (init
, slot
, complain
);
581 init
= build_target_expr (slot
, init
, complain
);
582 TARGET_EXPR_IMPLICIT_P (init
) = 1;
588 /* Give a helpful diagnostic for a non-constexpr VEC_INIT_EXPR in a context
589 that requires a constant expression. */
592 diagnose_non_constexpr_vec_init (tree expr
)
594 tree type
= TREE_TYPE (VEC_INIT_EXPR_SLOT (expr
));
596 if (VEC_INIT_EXPR_VALUE_INIT (expr
))
597 init
= void_zero_node
;
599 init
= VEC_INIT_EXPR_INIT (expr
);
601 elt_init
= build_vec_init_elt (type
, init
, tf_warning_or_error
);
602 require_potential_constant_expression (elt_init
);
606 build_array_copy (tree init
)
608 return build_vec_init_expr (TREE_TYPE (init
), init
, NULL_TREE
,
609 tf_warning_or_error
);
612 /* Build a TARGET_EXPR using INIT to initialize a new temporary of the
616 build_target_expr_with_type (tree init
, tree type
, tsubst_flags_t complain
)
618 gcc_assert (!VOID_TYPE_P (type
));
620 if (TREE_CODE (init
) == TARGET_EXPR
621 || init
== error_mark_node
)
623 else if (CLASS_TYPE_P (type
) && type_has_nontrivial_copy_init (type
)
624 && !VOID_TYPE_P (TREE_TYPE (init
))
625 && TREE_CODE (init
) != COND_EXPR
626 && TREE_CODE (init
) != CONSTRUCTOR
627 && TREE_CODE (init
) != VA_ARG_EXPR
)
628 /* We need to build up a copy constructor call. A void initializer
629 means we're being called from bot_manip. COND_EXPR is a special
630 case because we already have copies on the arms and we don't want
631 another one here. A CONSTRUCTOR is aggregate initialization, which
632 is handled separately. A VA_ARG_EXPR is magic creation of an
633 aggregate; there's no additional work to be done. */
634 return force_rvalue (init
, complain
);
636 return force_target_expr (type
, init
, complain
);
639 /* Like the above function, but without the checking. This function should
640 only be used by code which is deliberately trying to subvert the type
641 system, such as call_builtin_trap. Or build_over_call, to avoid
642 infinite recursion. */
645 force_target_expr (tree type
, tree init
, tsubst_flags_t complain
)
649 gcc_assert (!VOID_TYPE_P (type
));
651 slot
= build_local_temp (type
);
652 return build_target_expr (slot
, init
, complain
);
655 /* Like build_target_expr_with_type, but use the type of INIT. */
658 get_target_expr_sfinae (tree init
, tsubst_flags_t complain
)
660 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
661 return build_target_expr (AGGR_INIT_EXPR_SLOT (init
), init
, complain
);
662 else if (TREE_CODE (init
) == VEC_INIT_EXPR
)
663 return build_target_expr (VEC_INIT_EXPR_SLOT (init
), init
, complain
);
665 return build_target_expr_with_type (init
, TREE_TYPE (init
), complain
);
669 get_target_expr (tree init
)
671 return get_target_expr_sfinae (init
, tf_warning_or_error
);
674 /* If EXPR is a bitfield reference, convert it to the declared type of
675 the bitfield, and return the resulting expression. Otherwise,
676 return EXPR itself. */
679 convert_bitfield_to_declared_type (tree expr
)
683 bitfield_type
= is_bitfield_expr_with_lowered_type (expr
);
685 expr
= convert_to_integer (TYPE_MAIN_VARIANT (bitfield_type
),
690 /* EXPR is being used in an rvalue context. Return a version of EXPR
691 that is marked as an rvalue. */
698 if (error_operand_p (expr
))
701 expr
= mark_rvalue_use (expr
);
705 Non-class rvalues always have cv-unqualified types. */
706 type
= TREE_TYPE (expr
);
707 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
708 type
= cv_unqualified (type
);
710 /* We need to do this for rvalue refs as well to get the right answer
711 from decltype; see c++/36628. */
712 if (!processing_template_decl
&& lvalue_or_rvalue_with_address_p (expr
))
713 expr
= build1 (NON_LVALUE_EXPR
, type
, expr
);
714 else if (type
!= TREE_TYPE (expr
))
715 expr
= build_nop (type
, expr
);
721 /* Hash an ARRAY_TYPE. K is really of type `tree'. */
724 cplus_array_hash (const void* k
)
727 const_tree
const t
= (const_tree
) k
;
729 hash
= TYPE_UID (TREE_TYPE (t
));
731 hash
^= TYPE_UID (TYPE_DOMAIN (t
));
735 typedef struct cplus_array_info
{
740 /* Compare two ARRAY_TYPEs. K1 is really of type `tree', K2 is really
741 of type `cplus_array_info*'. */
744 cplus_array_compare (const void * k1
, const void * k2
)
746 const_tree
const t1
= (const_tree
) k1
;
747 const cplus_array_info
*const t2
= (const cplus_array_info
*) k2
;
749 return (TREE_TYPE (t1
) == t2
->type
&& TYPE_DOMAIN (t1
) == t2
->domain
);
752 /* Hash table containing dependent array types, which are unsuitable for
753 the language-independent type hash table. */
754 static GTY ((param_is (union tree_node
))) htab_t cplus_array_htab
;
756 /* Like build_array_type, but handle special C++ semantics. */
759 build_cplus_array_type (tree elt_type
, tree index_type
)
763 if (elt_type
== error_mark_node
|| index_type
== error_mark_node
)
764 return error_mark_node
;
766 if (processing_template_decl
767 && (dependent_type_p (elt_type
)
768 || (index_type
&& !TREE_CONSTANT (TYPE_MAX_VALUE (index_type
)))))
771 cplus_array_info cai
;
774 if (cplus_array_htab
== NULL
)
775 cplus_array_htab
= htab_create_ggc (61, &cplus_array_hash
,
776 &cplus_array_compare
, NULL
);
778 hash
= TYPE_UID (elt_type
);
780 hash
^= TYPE_UID (index_type
);
782 cai
.domain
= index_type
;
784 e
= htab_find_slot_with_hash (cplus_array_htab
, &cai
, hash
, INSERT
);
786 /* We have found the type: we're done. */
790 /* Build a new array type. */
791 t
= cxx_make_type (ARRAY_TYPE
);
792 TREE_TYPE (t
) = elt_type
;
793 TYPE_DOMAIN (t
) = index_type
;
795 /* Store it in the hash table. */
798 /* Set the canonical type for this new node. */
799 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
800 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
801 SET_TYPE_STRUCTURAL_EQUALITY (t
);
802 else if (TYPE_CANONICAL (elt_type
) != elt_type
804 && TYPE_CANONICAL (index_type
) != index_type
))
806 = build_cplus_array_type
807 (TYPE_CANONICAL (elt_type
),
808 index_type
? TYPE_CANONICAL (index_type
) : index_type
);
810 TYPE_CANONICAL (t
) = t
;
814 t
= build_array_type (elt_type
, index_type
);
816 /* We want TYPE_MAIN_VARIANT of an array to strip cv-quals from the
817 element type as well, so fix it up if needed. */
818 if (elt_type
!= TYPE_MAIN_VARIANT (elt_type
))
820 tree m
= build_cplus_array_type (TYPE_MAIN_VARIANT (elt_type
),
822 if (TYPE_MAIN_VARIANT (t
) != m
)
824 TYPE_MAIN_VARIANT (t
) = m
;
825 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
826 TYPE_NEXT_VARIANT (m
) = t
;
830 /* Push these needs up so that initialization takes place
832 TYPE_NEEDS_CONSTRUCTING (t
)
833 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (elt_type
));
834 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
835 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (elt_type
));
839 /* Return an ARRAY_TYPE with element type ELT and length N. */
842 build_array_of_n_type (tree elt
, int n
)
844 return build_cplus_array_type (elt
, build_index_type (size_int (n
- 1)));
847 /* Return a reference type node referring to TO_TYPE. If RVAL is
848 true, return an rvalue reference type, otherwise return an lvalue
849 reference type. If a type node exists, reuse it, otherwise create
852 cp_build_reference_type (tree to_type
, bool rval
)
855 lvalue_ref
= build_reference_type (to_type
);
859 /* This code to create rvalue reference types is based on and tied
860 to the code creating lvalue reference types in the middle-end
861 functions build_reference_type_for_mode and build_reference_type.
863 It works by putting the rvalue reference type nodes after the
864 lvalue reference nodes in the TYPE_NEXT_REF_TO linked list, so
865 they will effectively be ignored by the middle end. */
867 for (t
= lvalue_ref
; (t
= TYPE_NEXT_REF_TO (t
)); )
868 if (TYPE_REF_IS_RVALUE (t
))
871 t
= build_distinct_type_copy (lvalue_ref
);
873 TYPE_REF_IS_RVALUE (t
) = true;
874 TYPE_NEXT_REF_TO (t
) = TYPE_NEXT_REF_TO (lvalue_ref
);
875 TYPE_NEXT_REF_TO (lvalue_ref
) = t
;
877 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
878 SET_TYPE_STRUCTURAL_EQUALITY (t
);
879 else if (TYPE_CANONICAL (to_type
) != to_type
)
881 = cp_build_reference_type (TYPE_CANONICAL (to_type
), rval
);
883 TYPE_CANONICAL (t
) = t
;
891 /* Returns EXPR cast to rvalue reference type, like std::move. */
896 tree type
= TREE_TYPE (expr
);
897 gcc_assert (TREE_CODE (type
) != REFERENCE_TYPE
);
898 type
= cp_build_reference_type (type
, /*rval*/true);
899 return build_static_cast (type
, expr
, tf_warning_or_error
);
902 /* Used by the C++ front end to build qualified array types. However,
903 the C version of this function does not properly maintain canonical
904 types (which are not used in C). */
906 c_build_qualified_type (tree type
, int type_quals
)
908 return cp_build_qualified_type (type
, type_quals
);
912 /* Make a variant of TYPE, qualified with the TYPE_QUALS. Handles
913 arrays correctly. In particular, if TYPE is an array of T's, and
914 TYPE_QUALS is non-empty, returns an array of qualified T's.
916 FLAGS determines how to deal with ill-formed qualifications. If
917 tf_ignore_bad_quals is set, then bad qualifications are dropped
918 (this is permitted if TYPE was introduced via a typedef or template
919 type parameter). If bad qualifications are dropped and tf_warning
920 is set, then a warning is issued for non-const qualifications. If
921 tf_ignore_bad_quals is not set and tf_error is not set, we
922 return error_mark_node. Otherwise, we issue an error, and ignore
925 Qualification of a reference type is valid when the reference came
926 via a typedef or template type argument. [dcl.ref] No such
927 dispensation is provided for qualifying a function type. [dcl.fct]
928 DR 295 queries this and the proposed resolution brings it into line
929 with qualifying a reference. We implement the DR. We also behave
930 in a similar manner for restricting non-pointer types. */
933 cp_build_qualified_type_real (tree type
,
935 tsubst_flags_t complain
)
938 int bad_quals
= TYPE_UNQUALIFIED
;
940 if (type
== error_mark_node
)
943 if (type_quals
== cp_type_quals (type
))
946 if (TREE_CODE (type
) == ARRAY_TYPE
)
948 /* In C++, the qualification really applies to the array element
949 type. Obtain the appropriately qualified element type. */
952 = cp_build_qualified_type_real (TREE_TYPE (type
),
956 if (element_type
== error_mark_node
)
957 return error_mark_node
;
959 /* See if we already have an identically qualified type. Tests
960 should be equivalent to those in check_qualified_type. */
961 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
962 if (TREE_TYPE (t
) == element_type
963 && TYPE_NAME (t
) == TYPE_NAME (type
)
964 && TYPE_CONTEXT (t
) == TYPE_CONTEXT (type
)
965 && attribute_list_equal (TYPE_ATTRIBUTES (t
),
966 TYPE_ATTRIBUTES (type
)))
971 t
= build_cplus_array_type (element_type
, TYPE_DOMAIN (type
));
973 /* Keep the typedef name. */
974 if (TYPE_NAME (t
) != TYPE_NAME (type
))
976 t
= build_variant_type_copy (t
);
977 TYPE_NAME (t
) = TYPE_NAME (type
);
981 /* Even if we already had this variant, we update
982 TYPE_NEEDS_CONSTRUCTING and TYPE_HAS_NONTRIVIAL_DESTRUCTOR in case
983 they changed since the variant was originally created.
985 This seems hokey; if there is some way to use a previous
986 variant *without* coming through here,
987 TYPE_NEEDS_CONSTRUCTING will never be updated. */
988 TYPE_NEEDS_CONSTRUCTING (t
)
989 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (element_type
));
990 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
991 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (element_type
));
994 else if (TYPE_PTRMEMFUNC_P (type
))
996 /* For a pointer-to-member type, we can't just return a
997 cv-qualified version of the RECORD_TYPE. If we do, we
998 haven't changed the field that contains the actual pointer to
999 a method, and so TYPE_PTRMEMFUNC_FN_TYPE will be wrong. */
1002 t
= TYPE_PTRMEMFUNC_FN_TYPE (type
);
1003 t
= cp_build_qualified_type_real (t
, type_quals
, complain
);
1004 return build_ptrmemfunc_type (t
);
1006 else if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
1008 tree t
= PACK_EXPANSION_PATTERN (type
);
1010 t
= cp_build_qualified_type_real (t
, type_quals
, complain
);
1011 return make_pack_expansion (t
);
1014 /* A reference or method type shall not be cv-qualified.
1015 [dcl.ref], [dcl.fct]. This used to be an error, but as of DR 295
1016 (in CD1) we always ignore extra cv-quals on functions. */
1017 if (type_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)
1018 && (TREE_CODE (type
) == REFERENCE_TYPE
1019 || TREE_CODE (type
) == FUNCTION_TYPE
1020 || TREE_CODE (type
) == METHOD_TYPE
))
1022 if (TREE_CODE (type
) == REFERENCE_TYPE
)
1023 bad_quals
|= type_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
1024 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
1027 /* But preserve any function-cv-quals on a FUNCTION_TYPE. */
1028 if (TREE_CODE (type
) == FUNCTION_TYPE
)
1029 type_quals
|= type_memfn_quals (type
);
1031 /* A restrict-qualified type must be a pointer (or reference)
1032 to object or incomplete type. */
1033 if ((type_quals
& TYPE_QUAL_RESTRICT
)
1034 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
1035 && TREE_CODE (type
) != TYPENAME_TYPE
1036 && !POINTER_TYPE_P (type
))
1038 bad_quals
|= TYPE_QUAL_RESTRICT
;
1039 type_quals
&= ~TYPE_QUAL_RESTRICT
;
1042 if (bad_quals
== TYPE_UNQUALIFIED
1043 || (complain
& tf_ignore_bad_quals
))
1045 else if (!(complain
& tf_error
))
1046 return error_mark_node
;
1049 tree bad_type
= build_qualified_type (ptr_type_node
, bad_quals
);
1050 error ("%qV qualifiers cannot be applied to %qT",
1054 /* Retrieve (or create) the appropriately qualified variant. */
1055 result
= build_qualified_type (type
, type_quals
);
1057 /* If this was a pointer-to-method type, and we just made a copy,
1058 then we need to unshare the record that holds the cached
1059 pointer-to-member-function type, because these will be distinct
1060 between the unqualified and qualified types. */
1062 && TREE_CODE (type
) == POINTER_TYPE
1063 && TREE_CODE (TREE_TYPE (type
)) == METHOD_TYPE
1064 && TYPE_LANG_SPECIFIC (result
) == TYPE_LANG_SPECIFIC (type
))
1065 TYPE_LANG_SPECIFIC (result
) = NULL
;
1067 /* We may also have ended up building a new copy of the canonical
1068 type of a pointer-to-method type, which could have the same
1069 sharing problem described above. */
1070 if (TYPE_CANONICAL (result
) != TYPE_CANONICAL (type
)
1071 && TREE_CODE (type
) == POINTER_TYPE
1072 && TREE_CODE (TREE_TYPE (type
)) == METHOD_TYPE
1073 && (TYPE_LANG_SPECIFIC (TYPE_CANONICAL (result
))
1074 == TYPE_LANG_SPECIFIC (TYPE_CANONICAL (type
))))
1075 TYPE_LANG_SPECIFIC (TYPE_CANONICAL (result
)) = NULL
;
1080 /* Return TYPE with const and volatile removed. */
1083 cv_unqualified (tree type
)
1087 if (type
== error_mark_node
)
1090 quals
= cp_type_quals (type
);
1091 quals
&= ~(TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
);
1092 return cp_build_qualified_type (type
, quals
);
1095 /* Builds a qualified variant of T that is not a typedef variant.
1096 E.g. consider the following declarations:
1097 typedef const int ConstInt;
1098 typedef ConstInt* PtrConstInt;
1099 If T is PtrConstInt, this function returns a type representing
1101 In other words, if T is a typedef, the function returns the underlying type.
1102 The cv-qualification and attributes of the type returned match the
1104 They will always be compatible types.
1105 The returned type is built so that all of its subtypes
1106 recursively have their typedefs stripped as well.
1108 This is different from just returning TYPE_CANONICAL (T)
1109 Because of several reasons:
1110 * If T is a type that needs structural equality
1111 its TYPE_CANONICAL (T) will be NULL.
1112 * TYPE_CANONICAL (T) desn't carry type attributes
1113 and looses template parameter names. */
1116 strip_typedefs (tree t
)
1118 tree result
= NULL
, type
= NULL
, t0
= NULL
;
1120 if (!t
|| t
== error_mark_node
|| t
== TYPE_CANONICAL (t
))
1123 gcc_assert (TYPE_P (t
));
1125 switch (TREE_CODE (t
))
1128 type
= strip_typedefs (TREE_TYPE (t
));
1129 result
= build_pointer_type (type
);
1131 case REFERENCE_TYPE
:
1132 type
= strip_typedefs (TREE_TYPE (t
));
1133 result
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
1136 t0
= strip_typedefs (TYPE_OFFSET_BASETYPE (t
));
1137 type
= strip_typedefs (TREE_TYPE (t
));
1138 result
= build_offset_type (t0
, type
);
1141 if (TYPE_PTRMEMFUNC_P (t
))
1143 t0
= strip_typedefs (TYPE_PTRMEMFUNC_FN_TYPE (t
));
1144 result
= build_ptrmemfunc_type (t0
);
1148 type
= strip_typedefs (TREE_TYPE (t
));
1149 t0
= strip_typedefs (TYPE_DOMAIN (t
));;
1150 result
= build_cplus_array_type (type
, t0
);
1155 tree arg_types
= NULL
, arg_node
, arg_type
;
1156 for (arg_node
= TYPE_ARG_TYPES (t
);
1158 arg_node
= TREE_CHAIN (arg_node
))
1160 if (arg_node
== void_list_node
)
1162 arg_type
= strip_typedefs (TREE_VALUE (arg_node
));
1163 gcc_assert (arg_type
);
1166 tree_cons (TREE_PURPOSE (arg_node
), arg_type
, arg_types
);
1170 arg_types
= nreverse (arg_types
);
1172 /* A list of parameters not ending with an ellipsis
1173 must end with void_list_node. */
1175 arg_types
= chainon (arg_types
, void_list_node
);
1177 type
= strip_typedefs (TREE_TYPE (t
));
1178 if (TREE_CODE (t
) == METHOD_TYPE
)
1180 tree class_type
= TREE_TYPE (TREE_VALUE (arg_types
));
1181 gcc_assert (class_type
);
1183 build_method_type_directly (class_type
, type
,
1184 TREE_CHAIN (arg_types
));
1188 result
= build_function_type (type
,
1190 result
= apply_memfn_quals (result
, type_memfn_quals (t
));
1193 if (TYPE_RAISES_EXCEPTIONS (t
))
1194 result
= build_exception_variant (result
,
1195 TYPE_RAISES_EXCEPTIONS (t
));
1199 result
= make_typename_type (strip_typedefs (TYPE_CONTEXT (t
)),
1200 TYPENAME_TYPE_FULLNAME (t
),
1201 typename_type
, tf_none
);
1208 result
= TYPE_MAIN_VARIANT (t
);
1209 if (TYPE_ATTRIBUTES (t
))
1210 result
= cp_build_type_attribute_variant (result
, TYPE_ATTRIBUTES (t
));
1211 return cp_build_qualified_type (result
, cp_type_quals (t
));
1214 /* Makes a copy of BINFO and TYPE, which is to be inherited into a
1215 graph dominated by T. If BINFO is NULL, TYPE is a dependent base,
1216 and we do a shallow copy. If BINFO is non-NULL, we do a deep copy.
1217 VIRT indicates whether TYPE is inherited virtually or not.
1218 IGO_PREV points at the previous binfo of the inheritance graph
1219 order chain. The newly copied binfo's TREE_CHAIN forms this
1222 The CLASSTYPE_VBASECLASSES vector of T is constructed in the
1223 correct order. That is in the order the bases themselves should be
1226 The BINFO_INHERITANCE of a virtual base class points to the binfo
1227 of the most derived type. ??? We could probably change this so that
1228 BINFO_INHERITANCE becomes synonymous with BINFO_PRIMARY, and hence
1229 remove a field. They currently can only differ for primary virtual
1233 copy_binfo (tree binfo
, tree type
, tree t
, tree
*igo_prev
, int virt
)
1239 /* See if we've already made this virtual base. */
1240 new_binfo
= binfo_for_vbase (type
, t
);
1245 new_binfo
= make_tree_binfo (binfo
? BINFO_N_BASE_BINFOS (binfo
) : 0);
1246 BINFO_TYPE (new_binfo
) = type
;
1248 /* Chain it into the inheritance graph. */
1249 TREE_CHAIN (*igo_prev
) = new_binfo
;
1250 *igo_prev
= new_binfo
;
1257 gcc_assert (!BINFO_DEPENDENT_BASE_P (binfo
));
1258 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), type
));
1260 BINFO_OFFSET (new_binfo
) = BINFO_OFFSET (binfo
);
1261 BINFO_VIRTUALS (new_binfo
) = BINFO_VIRTUALS (binfo
);
1263 /* We do not need to copy the accesses, as they are read only. */
1264 BINFO_BASE_ACCESSES (new_binfo
) = BINFO_BASE_ACCESSES (binfo
);
1266 /* Recursively copy base binfos of BINFO. */
1267 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ix
++)
1269 tree new_base_binfo
;
1271 gcc_assert (!BINFO_DEPENDENT_BASE_P (base_binfo
));
1272 new_base_binfo
= copy_binfo (base_binfo
, BINFO_TYPE (base_binfo
),
1274 BINFO_VIRTUAL_P (base_binfo
));
1276 if (!BINFO_INHERITANCE_CHAIN (new_base_binfo
))
1277 BINFO_INHERITANCE_CHAIN (new_base_binfo
) = new_binfo
;
1278 BINFO_BASE_APPEND (new_binfo
, new_base_binfo
);
1282 BINFO_DEPENDENT_BASE_P (new_binfo
) = 1;
1286 /* Push it onto the list after any virtual bases it contains
1287 will have been pushed. */
1288 VEC_quick_push (tree
, CLASSTYPE_VBASECLASSES (t
), new_binfo
);
1289 BINFO_VIRTUAL_P (new_binfo
) = 1;
1290 BINFO_INHERITANCE_CHAIN (new_binfo
) = TYPE_BINFO (t
);
1296 /* Hashing of lists so that we don't make duplicates.
1297 The entry point is `list_hash_canon'. */
1299 /* Now here is the hash table. When recording a list, it is added
1300 to the slot whose index is the hash code mod the table size.
1301 Note that the hash table is used for several kinds of lists.
1302 While all these live in the same table, they are completely independent,
1303 and the hash code is computed differently for each of these. */
1305 static GTY ((param_is (union tree_node
))) htab_t list_hash_table
;
1314 /* Compare ENTRY (an entry in the hash table) with DATA (a list_proxy
1315 for a node we are thinking about adding). */
1318 list_hash_eq (const void* entry
, const void* data
)
1320 const_tree
const t
= (const_tree
) entry
;
1321 const struct list_proxy
*const proxy
= (const struct list_proxy
*) data
;
1323 return (TREE_VALUE (t
) == proxy
->value
1324 && TREE_PURPOSE (t
) == proxy
->purpose
1325 && TREE_CHAIN (t
) == proxy
->chain
);
1328 /* Compute a hash code for a list (chain of TREE_LIST nodes
1329 with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the
1330 TREE_COMMON slots), by adding the hash codes of the individual entries. */
1333 list_hash_pieces (tree purpose
, tree value
, tree chain
)
1335 hashval_t hashcode
= 0;
1338 hashcode
+= TREE_HASH (chain
);
1341 hashcode
+= TREE_HASH (value
);
1345 hashcode
+= TREE_HASH (purpose
);
1351 /* Hash an already existing TREE_LIST. */
1354 list_hash (const void* p
)
1356 const_tree
const t
= (const_tree
) p
;
1357 return list_hash_pieces (TREE_PURPOSE (t
),
1362 /* Given list components PURPOSE, VALUE, AND CHAIN, return the canonical
1363 object for an identical list if one already exists. Otherwise, build a
1364 new one, and record it as the canonical object. */
1367 hash_tree_cons (tree purpose
, tree value
, tree chain
)
1371 struct list_proxy proxy
;
1373 /* Hash the list node. */
1374 hashcode
= list_hash_pieces (purpose
, value
, chain
);
1375 /* Create a proxy for the TREE_LIST we would like to create. We
1376 don't actually create it so as to avoid creating garbage. */
1377 proxy
.purpose
= purpose
;
1378 proxy
.value
= value
;
1379 proxy
.chain
= chain
;
1380 /* See if it is already in the table. */
1381 slot
= htab_find_slot_with_hash (list_hash_table
, &proxy
, hashcode
,
1383 /* If not, create a new node. */
1385 *slot
= tree_cons (purpose
, value
, chain
);
1386 return (tree
) *slot
;
1389 /* Constructor for hashed lists. */
1392 hash_tree_chain (tree value
, tree chain
)
1394 return hash_tree_cons (NULL_TREE
, value
, chain
);
1398 debug_binfo (tree elem
)
1403 fprintf (stderr
, "type \"%s\", offset = " HOST_WIDE_INT_PRINT_DEC
1405 TYPE_NAME_STRING (BINFO_TYPE (elem
)),
1406 TREE_INT_CST_LOW (BINFO_OFFSET (elem
)));
1407 debug_tree (BINFO_TYPE (elem
));
1408 if (BINFO_VTABLE (elem
))
1409 fprintf (stderr
, "vtable decl \"%s\"\n",
1410 IDENTIFIER_POINTER (DECL_NAME (get_vtbl_decl_for_binfo (elem
))));
1412 fprintf (stderr
, "no vtable decl yet\n");
1413 fprintf (stderr
, "virtuals:\n");
1414 virtuals
= BINFO_VIRTUALS (elem
);
1419 tree fndecl
= TREE_VALUE (virtuals
);
1420 fprintf (stderr
, "%s [%ld =? %ld]\n",
1421 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl
)),
1422 (long) n
, (long) TREE_INT_CST_LOW (DECL_VINDEX (fndecl
)));
1424 virtuals
= TREE_CHAIN (virtuals
);
1428 /* Build a representation for the qualified name SCOPE::NAME. TYPE is
1429 the type of the result expression, if known, or NULL_TREE if the
1430 resulting expression is type-dependent. If TEMPLATE_P is true,
1431 NAME is known to be a template because the user explicitly used the
1432 "template" keyword after the "::".
1434 All SCOPE_REFs should be built by use of this function. */
1437 build_qualified_name (tree type
, tree scope
, tree name
, bool template_p
)
1440 if (type
== error_mark_node
1441 || scope
== error_mark_node
1442 || name
== error_mark_node
)
1443 return error_mark_node
;
1444 t
= build2 (SCOPE_REF
, type
, scope
, name
);
1445 QUALIFIED_NAME_IS_TEMPLATE (t
) = template_p
;
1447 t
= convert_from_reference (t
);
1451 /* Returns nonzero if X is an expression for a (possibly overloaded)
1452 function. If "f" is a function or function template, "f", "c->f",
1453 "c.f", "C::f", and "f<int>" will all be considered possibly
1454 overloaded functions. Returns 2 if the function is actually
1455 overloaded, i.e., if it is impossible to know the type of the
1456 function without performing overload resolution. */
1459 is_overloaded_fn (tree x
)
1461 /* A baselink is also considered an overloaded function. */
1462 if (TREE_CODE (x
) == OFFSET_REF
1463 || TREE_CODE (x
) == COMPONENT_REF
)
1464 x
= TREE_OPERAND (x
, 1);
1466 x
= BASELINK_FUNCTIONS (x
);
1467 if (TREE_CODE (x
) == TEMPLATE_ID_EXPR
)
1468 x
= TREE_OPERAND (x
, 0);
1469 if (DECL_FUNCTION_TEMPLATE_P (OVL_CURRENT (x
))
1470 || (TREE_CODE (x
) == OVERLOAD
&& OVL_CHAIN (x
)))
1472 return (TREE_CODE (x
) == FUNCTION_DECL
1473 || TREE_CODE (x
) == OVERLOAD
);
1476 /* Returns true iff X is an expression for an overloaded function
1477 whose type cannot be known without performing overload
1481 really_overloaded_fn (tree x
)
1483 return is_overloaded_fn (x
) == 2;
1489 gcc_assert (is_overloaded_fn (from
));
1490 /* A baselink is also considered an overloaded function. */
1491 if (TREE_CODE (from
) == OFFSET_REF
1492 || TREE_CODE (from
) == COMPONENT_REF
)
1493 from
= TREE_OPERAND (from
, 1);
1494 if (BASELINK_P (from
))
1495 from
= BASELINK_FUNCTIONS (from
);
1496 if (TREE_CODE (from
) == TEMPLATE_ID_EXPR
)
1497 from
= TREE_OPERAND (from
, 0);
1502 get_first_fn (tree from
)
1504 return OVL_CURRENT (get_fns (from
));
1507 /* Return a new OVL node, concatenating it with the old one. */
1510 ovl_cons (tree decl
, tree chain
)
1512 tree result
= make_node (OVERLOAD
);
1513 TREE_TYPE (result
) = unknown_type_node
;
1514 OVL_FUNCTION (result
) = decl
;
1515 TREE_CHAIN (result
) = chain
;
1520 /* Build a new overloaded function. If this is the first one,
1521 just return it; otherwise, ovl_cons the _DECLs */
1524 build_overload (tree decl
, tree chain
)
1526 if (! chain
&& TREE_CODE (decl
) != TEMPLATE_DECL
)
1528 return ovl_cons (decl
, chain
);
1532 #define PRINT_RING_SIZE 4
1535 cxx_printable_name_internal (tree decl
, int v
, bool translate
)
1537 static unsigned int uid_ring
[PRINT_RING_SIZE
];
1538 static char *print_ring
[PRINT_RING_SIZE
];
1539 static bool trans_ring
[PRINT_RING_SIZE
];
1540 static int ring_counter
;
1543 /* Only cache functions. */
1545 || TREE_CODE (decl
) != FUNCTION_DECL
1546 || DECL_LANG_SPECIFIC (decl
) == 0)
1547 return lang_decl_name (decl
, v
, translate
);
1549 /* See if this print name is lying around. */
1550 for (i
= 0; i
< PRINT_RING_SIZE
; i
++)
1551 if (uid_ring
[i
] == DECL_UID (decl
) && translate
== trans_ring
[i
])
1552 /* yes, so return it. */
1553 return print_ring
[i
];
1555 if (++ring_counter
== PRINT_RING_SIZE
)
1558 if (current_function_decl
!= NULL_TREE
)
1560 /* There may be both translated and untranslated versions of the
1562 for (i
= 0; i
< 2; i
++)
1564 if (uid_ring
[ring_counter
] == DECL_UID (current_function_decl
))
1566 if (ring_counter
== PRINT_RING_SIZE
)
1569 gcc_assert (uid_ring
[ring_counter
] != DECL_UID (current_function_decl
));
1572 free (print_ring
[ring_counter
]);
1574 print_ring
[ring_counter
] = xstrdup (lang_decl_name (decl
, v
, translate
));
1575 uid_ring
[ring_counter
] = DECL_UID (decl
);
1576 trans_ring
[ring_counter
] = translate
;
1577 return print_ring
[ring_counter
];
1581 cxx_printable_name (tree decl
, int v
)
1583 return cxx_printable_name_internal (decl
, v
, false);
1587 cxx_printable_name_translate (tree decl
, int v
)
1589 return cxx_printable_name_internal (decl
, v
, true);
1592 /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions
1593 listed in RAISES. */
1596 build_exception_variant (tree type
, tree raises
)
1601 if (comp_except_specs (raises
, TYPE_RAISES_EXCEPTIONS (type
), ce_exact
))
1604 type_quals
= TYPE_QUALS (type
);
1605 for (v
= TYPE_MAIN_VARIANT (type
); v
; v
= TYPE_NEXT_VARIANT (v
))
1606 if (check_qualified_type (v
, type
, type_quals
)
1607 && comp_except_specs (raises
, TYPE_RAISES_EXCEPTIONS (v
), ce_exact
))
1610 /* Need to build a new variant. */
1611 v
= build_variant_type_copy (type
);
1612 TYPE_RAISES_EXCEPTIONS (v
) = raises
;
1616 /* Given a TEMPLATE_TEMPLATE_PARM node T, create a new
1617 BOUND_TEMPLATE_TEMPLATE_PARM bound with NEWARGS as its template
1621 bind_template_template_parm (tree t
, tree newargs
)
1623 tree decl
= TYPE_NAME (t
);
1626 t2
= cxx_make_type (BOUND_TEMPLATE_TEMPLATE_PARM
);
1627 decl
= build_decl (input_location
,
1628 TYPE_DECL
, DECL_NAME (decl
), NULL_TREE
);
1630 /* These nodes have to be created to reflect new TYPE_DECL and template
1632 TEMPLATE_TYPE_PARM_INDEX (t2
) = copy_node (TEMPLATE_TYPE_PARM_INDEX (t
));
1633 TEMPLATE_PARM_DECL (TEMPLATE_TYPE_PARM_INDEX (t2
)) = decl
;
1634 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2
)
1635 = build_template_info (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t
), newargs
);
1637 TREE_TYPE (decl
) = t2
;
1638 TYPE_NAME (t2
) = decl
;
1639 TYPE_STUB_DECL (t2
) = decl
;
1641 SET_TYPE_STRUCTURAL_EQUALITY (t2
);
1646 /* Called from count_trees via walk_tree. */
1649 count_trees_r (tree
*tp
, int *walk_subtrees
, void *data
)
1659 /* Debugging function for measuring the rough complexity of a tree
1663 count_trees (tree t
)
1666 cp_walk_tree_without_duplicates (&t
, count_trees_r
, &n_trees
);
1670 /* Called from verify_stmt_tree via walk_tree. */
1673 verify_stmt_tree_r (tree
* tp
,
1674 int* walk_subtrees ATTRIBUTE_UNUSED
,
1678 htab_t
*statements
= (htab_t
*) data
;
1681 if (!STATEMENT_CODE_P (TREE_CODE (t
)))
1684 /* If this statement is already present in the hash table, then
1685 there is a circularity in the statement tree. */
1686 gcc_assert (!htab_find (*statements
, t
));
1688 slot
= htab_find_slot (*statements
, t
, INSERT
);
1694 /* Debugging function to check that the statement T has not been
1695 corrupted. For now, this function simply checks that T contains no
1699 verify_stmt_tree (tree t
)
1702 statements
= htab_create (37, htab_hash_pointer
, htab_eq_pointer
, NULL
);
1703 cp_walk_tree (&t
, verify_stmt_tree_r
, &statements
, NULL
);
1704 htab_delete (statements
);
1707 /* Check if the type T depends on a type with no linkage and if so, return
1708 it. If RELAXED_P then do not consider a class type declared within
1709 a vague-linkage function to have no linkage. */
1712 no_linkage_check (tree t
, bool relaxed_p
)
1716 /* There's no point in checking linkage on template functions; we
1717 can't know their complete types. */
1718 if (processing_template_decl
)
1721 switch (TREE_CODE (t
))
1724 if (TYPE_PTRMEMFUNC_P (t
))
1726 /* Lambda types that don't have mangling scope have no linkage. We
1727 check CLASSTYPE_LAMBDA_EXPR here rather than LAMBDA_TYPE_P because
1728 when we get here from pushtag none of the lambda information is
1729 set up yet, so we want to assume that the lambda has linkage and
1730 fix it up later if not. */
1731 if (CLASSTYPE_LAMBDA_EXPR (t
)
1732 && LAMBDA_TYPE_EXTRA_SCOPE (t
) == NULL_TREE
)
1736 if (!CLASS_TYPE_P (t
))
1740 /* Only treat anonymous types as having no linkage if they're at
1741 namespace scope. This is core issue 966. */
1742 if (TYPE_ANONYMOUS_P (t
) && TYPE_NAMESPACE_SCOPE_P (t
))
1745 for (r
= CP_TYPE_CONTEXT (t
); ; )
1747 /* If we're a nested type of a !TREE_PUBLIC class, we might not
1748 have linkage, or we might just be in an anonymous namespace.
1749 If we're in a TREE_PUBLIC class, we have linkage. */
1750 if (TYPE_P (r
) && !TREE_PUBLIC (TYPE_NAME (r
)))
1751 return no_linkage_check (TYPE_CONTEXT (t
), relaxed_p
);
1752 else if (TREE_CODE (r
) == FUNCTION_DECL
)
1754 if (!relaxed_p
|| !vague_linkage_p (r
))
1757 r
= CP_DECL_CONTEXT (r
);
1767 case REFERENCE_TYPE
:
1768 return no_linkage_check (TREE_TYPE (t
), relaxed_p
);
1772 r
= no_linkage_check (TYPE_PTRMEM_POINTED_TO_TYPE (t
),
1776 return no_linkage_check (TYPE_PTRMEM_CLASS_TYPE (t
), relaxed_p
);
1779 r
= no_linkage_check (TYPE_METHOD_BASETYPE (t
), relaxed_p
);
1786 for (parm
= TYPE_ARG_TYPES (t
);
1787 parm
&& parm
!= void_list_node
;
1788 parm
= TREE_CHAIN (parm
))
1790 r
= no_linkage_check (TREE_VALUE (parm
), relaxed_p
);
1794 return no_linkage_check (TREE_TYPE (t
), relaxed_p
);
1802 #ifdef GATHER_STATISTICS
1803 extern int depth_reached
;
1807 cxx_print_statistics (void)
1809 print_search_statistics ();
1810 print_class_statistics ();
1811 print_template_statistics ();
1812 #ifdef GATHER_STATISTICS
1813 fprintf (stderr
, "maximum template instantiation depth reached: %d\n",
1818 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1819 (which is an ARRAY_TYPE). This counts only elements of the top
1823 array_type_nelts_top (tree type
)
1825 return fold_build2_loc (input_location
,
1826 PLUS_EXPR
, sizetype
,
1827 array_type_nelts (type
),
1831 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1832 (which is an ARRAY_TYPE). This one is a recursive count of all
1833 ARRAY_TYPEs that are clumped together. */
1836 array_type_nelts_total (tree type
)
1838 tree sz
= array_type_nelts_top (type
);
1839 type
= TREE_TYPE (type
);
1840 while (TREE_CODE (type
) == ARRAY_TYPE
)
1842 tree n
= array_type_nelts_top (type
);
1843 sz
= fold_build2_loc (input_location
,
1844 MULT_EXPR
, sizetype
, sz
, n
);
1845 type
= TREE_TYPE (type
);
1850 /* Called from break_out_target_exprs via mapcar. */
1853 bot_manip (tree
* tp
, int* walk_subtrees
, void* data
)
1855 splay_tree target_remap
= ((splay_tree
) data
);
1858 if (!TYPE_P (t
) && TREE_CONSTANT (t
) && !TREE_SIDE_EFFECTS (t
))
1860 /* There can't be any TARGET_EXPRs or their slot variables below
1865 if (TREE_CODE (t
) == TARGET_EXPR
)
1869 if (TREE_CODE (TREE_OPERAND (t
, 1)) == AGGR_INIT_EXPR
)
1870 u
= build_cplus_new (TREE_TYPE (t
), TREE_OPERAND (t
, 1),
1871 tf_warning_or_error
);
1873 u
= build_target_expr_with_type (TREE_OPERAND (t
, 1), TREE_TYPE (t
),
1874 tf_warning_or_error
);
1876 /* Map the old variable to the new one. */
1877 splay_tree_insert (target_remap
,
1878 (splay_tree_key
) TREE_OPERAND (t
, 0),
1879 (splay_tree_value
) TREE_OPERAND (u
, 0));
1881 TREE_OPERAND (u
, 1) = break_out_target_exprs (TREE_OPERAND (u
, 1));
1883 /* Replace the old expression with the new version. */
1885 /* We don't have to go below this point; the recursive call to
1886 break_out_target_exprs will have handled anything below this
1892 /* Make a copy of this node. */
1893 return copy_tree_r (tp
, walk_subtrees
, NULL
);
1896 /* Replace all remapped VAR_DECLs in T with their new equivalents.
1897 DATA is really a splay-tree mapping old variables to new
1901 bot_replace (tree
* t
,
1902 int* walk_subtrees ATTRIBUTE_UNUSED
,
1905 splay_tree target_remap
= ((splay_tree
) data
);
1907 if (TREE_CODE (*t
) == VAR_DECL
)
1909 splay_tree_node n
= splay_tree_lookup (target_remap
,
1910 (splay_tree_key
) *t
);
1912 *t
= (tree
) n
->value
;
1918 /* When we parse a default argument expression, we may create
1919 temporary variables via TARGET_EXPRs. When we actually use the
1920 default-argument expression, we make a copy of the expression, but
1921 we must replace the temporaries with appropriate local versions. */
1924 break_out_target_exprs (tree t
)
1926 static int target_remap_count
;
1927 static splay_tree target_remap
;
1929 if (!target_remap_count
++)
1930 target_remap
= splay_tree_new (splay_tree_compare_pointers
,
1931 /*splay_tree_delete_key_fn=*/NULL
,
1932 /*splay_tree_delete_value_fn=*/NULL
);
1933 cp_walk_tree (&t
, bot_manip
, target_remap
, NULL
);
1934 cp_walk_tree (&t
, bot_replace
, target_remap
, NULL
);
1936 if (!--target_remap_count
)
1938 splay_tree_delete (target_remap
);
1939 target_remap
= NULL
;
1945 /* Similar to `build_nt', but for template definitions of dependent
1949 build_min_nt (enum tree_code code
, ...)
1956 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
1960 t
= make_node (code
);
1961 length
= TREE_CODE_LENGTH (code
);
1963 for (i
= 0; i
< length
; i
++)
1965 tree x
= va_arg (p
, tree
);
1966 TREE_OPERAND (t
, i
) = x
;
1974 /* Similar to `build', but for template definitions. */
1977 build_min (enum tree_code code
, tree tt
, ...)
1984 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
1988 t
= make_node (code
);
1989 length
= TREE_CODE_LENGTH (code
);
1992 for (i
= 0; i
< length
; i
++)
1994 tree x
= va_arg (p
, tree
);
1995 TREE_OPERAND (t
, i
) = x
;
1996 if (x
&& !TYPE_P (x
) && TREE_SIDE_EFFECTS (x
))
1997 TREE_SIDE_EFFECTS (t
) = 1;
2004 /* Similar to `build', but for template definitions of non-dependent
2005 expressions. NON_DEP is the non-dependent expression that has been
2009 build_min_non_dep (enum tree_code code
, tree non_dep
, ...)
2016 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
2018 va_start (p
, non_dep
);
2020 t
= make_node (code
);
2021 length
= TREE_CODE_LENGTH (code
);
2022 TREE_TYPE (t
) = TREE_TYPE (non_dep
);
2023 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (non_dep
);
2025 for (i
= 0; i
< length
; i
++)
2027 tree x
= va_arg (p
, tree
);
2028 TREE_OPERAND (t
, i
) = x
;
2031 if (code
== COMPOUND_EXPR
&& TREE_CODE (non_dep
) != COMPOUND_EXPR
)
2032 /* This should not be considered a COMPOUND_EXPR, because it
2033 resolves to an overload. */
2034 COMPOUND_EXPR_OVERLOADED (t
) = 1;
2040 /* Similar to `build_nt_call_vec', but for template definitions of
2041 non-dependent expressions. NON_DEP is the non-dependent expression
2042 that has been built. */
2045 build_min_non_dep_call_vec (tree non_dep
, tree fn
, VEC(tree
,gc
) *argvec
)
2047 tree t
= build_nt_call_vec (fn
, argvec
);
2048 TREE_TYPE (t
) = TREE_TYPE (non_dep
);
2049 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (non_dep
);
2054 get_type_decl (tree t
)
2056 if (TREE_CODE (t
) == TYPE_DECL
)
2059 return TYPE_STUB_DECL (t
);
2060 gcc_assert (t
== error_mark_node
);
2064 /* Returns the namespace that contains DECL, whether directly or
2068 decl_namespace_context (tree decl
)
2072 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
2074 else if (TYPE_P (decl
))
2075 decl
= CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl
));
2077 decl
= CP_DECL_CONTEXT (decl
);
2081 /* Returns true if decl is within an anonymous namespace, however deeply
2082 nested, or false otherwise. */
2085 decl_anon_ns_mem_p (const_tree decl
)
2089 if (decl
== NULL_TREE
|| decl
== error_mark_node
)
2091 if (TREE_CODE (decl
) == NAMESPACE_DECL
2092 && DECL_NAME (decl
) == NULL_TREE
)
2094 /* Classes and namespaces inside anonymous namespaces have
2095 TREE_PUBLIC == 0, so we can shortcut the search. */
2096 else if (TYPE_P (decl
))
2097 return (TREE_PUBLIC (TYPE_NAME (decl
)) == 0);
2098 else if (TREE_CODE (decl
) == NAMESPACE_DECL
)
2099 return (TREE_PUBLIC (decl
) == 0);
2101 decl
= DECL_CONTEXT (decl
);
2105 /* Return truthvalue of whether T1 is the same tree structure as T2.
2106 Return 1 if they are the same. Return 0 if they are different. */
2109 cp_tree_equal (tree t1
, tree t2
)
2111 enum tree_code code1
, code2
;
2118 for (code1
= TREE_CODE (t1
);
2119 CONVERT_EXPR_CODE_P (code1
)
2120 || code1
== NON_LVALUE_EXPR
;
2121 code1
= TREE_CODE (t1
))
2122 t1
= TREE_OPERAND (t1
, 0);
2123 for (code2
= TREE_CODE (t2
);
2124 CONVERT_EXPR_CODE_P (code2
)
2125 || code1
== NON_LVALUE_EXPR
;
2126 code2
= TREE_CODE (t2
))
2127 t2
= TREE_OPERAND (t2
, 0);
2129 /* They might have become equal now. */
2139 return TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
2140 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
);
2143 return REAL_VALUES_EQUAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
2146 return TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
2147 && !memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
2148 TREE_STRING_LENGTH (t1
));
2151 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
),
2152 TREE_FIXED_CST (t2
));
2155 return cp_tree_equal (TREE_REALPART (t1
), TREE_REALPART (t2
))
2156 && cp_tree_equal (TREE_IMAGPART (t1
), TREE_IMAGPART (t2
));
2159 /* We need to do this when determining whether or not two
2160 non-type pointer to member function template arguments
2162 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
2163 || CONSTRUCTOR_NELTS (t1
) != CONSTRUCTOR_NELTS (t2
))
2168 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t1
), i
, field
, value
)
2170 constructor_elt
*elt2
= CONSTRUCTOR_ELT (t2
, i
);
2171 if (!cp_tree_equal (field
, elt2
->index
)
2172 || !cp_tree_equal (value
, elt2
->value
))
2179 if (!cp_tree_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
)))
2181 if (!cp_tree_equal (TREE_VALUE (t1
), TREE_VALUE (t2
)))
2183 return cp_tree_equal (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
2186 return cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2191 call_expr_arg_iterator iter1
, iter2
;
2192 if (!cp_tree_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
)))
2194 for (arg1
= first_call_expr_arg (t1
, &iter1
),
2195 arg2
= first_call_expr_arg (t2
, &iter2
);
2197 arg1
= next_call_expr_arg (&iter1
),
2198 arg2
= next_call_expr_arg (&iter2
))
2199 if (!cp_tree_equal (arg1
, arg2
))
2208 tree o1
= TREE_OPERAND (t1
, 0);
2209 tree o2
= TREE_OPERAND (t2
, 0);
2211 /* Special case: if either target is an unallocated VAR_DECL,
2212 it means that it's going to be unified with whatever the
2213 TARGET_EXPR is really supposed to initialize, so treat it
2214 as being equivalent to anything. */
2215 if (TREE_CODE (o1
) == VAR_DECL
&& DECL_NAME (o1
) == NULL_TREE
2216 && !DECL_RTL_SET_P (o1
))
2218 else if (TREE_CODE (o2
) == VAR_DECL
&& DECL_NAME (o2
) == NULL_TREE
2219 && !DECL_RTL_SET_P (o2
))
2221 else if (!cp_tree_equal (o1
, o2
))
2224 return cp_tree_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
2227 case WITH_CLEANUP_EXPR
:
2228 if (!cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0)))
2230 return cp_tree_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
2233 if (TREE_OPERAND (t1
, 1) != TREE_OPERAND (t2
, 1))
2235 return cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2238 /* For comparing uses of parameters in late-specified return types
2239 with an out-of-class definition of the function, but can also come
2240 up for expressions that involve 'this' in a member function
2242 if (same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
2244 if (DECL_ARTIFICIAL (t1
) ^ DECL_ARTIFICIAL (t2
))
2246 if (DECL_ARTIFICIAL (t1
)
2247 || (DECL_PARM_LEVEL (t1
) == DECL_PARM_LEVEL (t2
)
2248 && DECL_PARM_INDEX (t1
) == DECL_PARM_INDEX (t2
)))
2257 case IDENTIFIER_NODE
:
2262 return (BASELINK_BINFO (t1
) == BASELINK_BINFO (t2
)
2263 && BASELINK_ACCESS_BINFO (t1
) == BASELINK_ACCESS_BINFO (t2
)
2264 && cp_tree_equal (BASELINK_FUNCTIONS (t1
),
2265 BASELINK_FUNCTIONS (t2
)));
2267 case TEMPLATE_PARM_INDEX
:
2268 if (TEMPLATE_PARM_NUM_SIBLINGS (t1
)
2269 != TEMPLATE_PARM_NUM_SIBLINGS (t2
))
2271 return (TEMPLATE_PARM_IDX (t1
) == TEMPLATE_PARM_IDX (t2
)
2272 && TEMPLATE_PARM_LEVEL (t1
) == TEMPLATE_PARM_LEVEL (t2
)
2273 && (TEMPLATE_PARM_PARAMETER_PACK (t1
)
2274 == TEMPLATE_PARM_PARAMETER_PACK (t2
))
2275 && same_type_p (TREE_TYPE (TEMPLATE_PARM_DECL (t1
)),
2276 TREE_TYPE (TEMPLATE_PARM_DECL (t2
))));
2278 case TEMPLATE_ID_EXPR
:
2283 if (!cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0)))
2285 vec1
= TREE_OPERAND (t1
, 1);
2286 vec2
= TREE_OPERAND (t2
, 1);
2289 return !vec1
&& !vec2
;
2291 if (TREE_VEC_LENGTH (vec1
) != TREE_VEC_LENGTH (vec2
))
2294 for (ix
= TREE_VEC_LENGTH (vec1
); ix
--;)
2295 if (!cp_tree_equal (TREE_VEC_ELT (vec1
, ix
),
2296 TREE_VEC_ELT (vec2
, ix
)))
2305 tree o1
= TREE_OPERAND (t1
, 0);
2306 tree o2
= TREE_OPERAND (t2
, 0);
2308 if (TREE_CODE (o1
) != TREE_CODE (o2
))
2311 return same_type_p (o1
, o2
);
2313 return cp_tree_equal (o1
, o2
);
2318 tree t1_op1
, t2_op1
;
2320 if (!cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0)))
2323 t1_op1
= TREE_OPERAND (t1
, 1);
2324 t2_op1
= TREE_OPERAND (t2
, 1);
2325 if (TREE_CODE (t1_op1
) != TREE_CODE (t2_op1
))
2328 return cp_tree_equal (TREE_OPERAND (t1
, 2), TREE_OPERAND (t2
, 2));
2332 /* Two pointer-to-members are the same if they point to the same
2333 field or function in the same class. */
2334 if (PTRMEM_CST_MEMBER (t1
) != PTRMEM_CST_MEMBER (t2
))
2337 return same_type_p (PTRMEM_CST_CLASS (t1
), PTRMEM_CST_CLASS (t2
));
2340 if (OVL_FUNCTION (t1
) != OVL_FUNCTION (t2
))
2342 return cp_tree_equal (OVL_CHAIN (t1
), OVL_CHAIN (t2
));
2345 if (TRAIT_EXPR_KIND (t1
) != TRAIT_EXPR_KIND (t2
))
2347 return same_type_p (TRAIT_EXPR_TYPE1 (t1
), TRAIT_EXPR_TYPE1 (t2
))
2348 && same_type_p (TRAIT_EXPR_TYPE2 (t1
), TRAIT_EXPR_TYPE2 (t2
));
2351 case STATIC_CAST_EXPR
:
2352 case REINTERPRET_CAST_EXPR
:
2353 case CONST_CAST_EXPR
:
2354 case DYNAMIC_CAST_EXPR
:
2356 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
2358 /* Now compare operands as usual. */
2365 switch (TREE_CODE_CLASS (code1
))
2369 case tcc_comparison
:
2370 case tcc_expression
:
2377 n
= TREE_OPERAND_LENGTH (t1
);
2378 if (TREE_CODE_CLASS (code1
) == tcc_vl_exp
2379 && n
!= TREE_OPERAND_LENGTH (t2
))
2382 for (i
= 0; i
< n
; ++i
)
2383 if (!cp_tree_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
)))
2390 return same_type_p (t1
, t2
);
2394 /* We can get here with --disable-checking. */
2398 /* The type of ARG when used as an lvalue. */
2401 lvalue_type (tree arg
)
2403 tree type
= TREE_TYPE (arg
);
2407 /* The type of ARG for printing error messages; denote lvalues with
2411 error_type (tree arg
)
2413 tree type
= TREE_TYPE (arg
);
2415 if (TREE_CODE (type
) == ARRAY_TYPE
)
2417 else if (TREE_CODE (type
) == ERROR_MARK
)
2419 else if (real_lvalue_p (arg
))
2420 type
= build_reference_type (lvalue_type (arg
));
2421 else if (MAYBE_CLASS_TYPE_P (type
))
2422 type
= lvalue_type (arg
);
2427 /* Does FUNCTION use a variable-length argument list? */
2430 varargs_function_p (const_tree function
)
2432 return stdarg_p (TREE_TYPE (function
));
2435 /* Returns 1 if decl is a member of a class. */
2438 member_p (const_tree decl
)
2440 const_tree
const ctx
= DECL_CONTEXT (decl
);
2441 return (ctx
&& TYPE_P (ctx
));
2444 /* Create a placeholder for member access where we don't actually have an
2445 object that the access is against. */
2448 build_dummy_object (tree type
)
2450 tree decl
= build1 (NOP_EXPR
, build_pointer_type (type
), void_zero_node
);
2451 return cp_build_indirect_ref (decl
, RO_NULL
, tf_warning_or_error
);
2454 /* We've gotten a reference to a member of TYPE. Return *this if appropriate,
2455 or a dummy object otherwise. If BINFOP is non-0, it is filled with the
2456 binfo path from current_class_type to TYPE, or 0. */
2459 maybe_dummy_object (tree type
, tree
* binfop
)
2463 tree current
= current_nonlambda_class_type ();
2466 && (binfo
= lookup_base (current
, type
, ba_any
, NULL
)))
2470 /* Reference from a nested class member function. */
2472 binfo
= TYPE_BINFO (type
);
2478 if (current_class_ref
2479 /* current_class_ref might not correspond to current_class_type if
2480 we're in tsubst_default_argument or a lambda-declarator; in either
2481 case, we want to use current_class_ref if it matches CONTEXT. */
2482 && (same_type_ignoring_top_level_qualifiers_p
2483 (TREE_TYPE (current_class_ref
), context
)))
2484 decl
= current_class_ref
;
2485 else if (current
!= current_class_type
2486 && context
== nonlambda_method_basetype ())
2487 /* In a lambda, need to go through 'this' capture. */
2488 decl
= (build_x_indirect_ref
2489 ((lambda_expr_this_capture
2490 (CLASSTYPE_LAMBDA_EXPR (current_class_type
))),
2491 RO_NULL
, tf_warning_or_error
));
2493 decl
= build_dummy_object (context
);
2498 /* Returns 1 if OB is a placeholder object, or a pointer to one. */
2501 is_dummy_object (const_tree ob
)
2503 if (TREE_CODE (ob
) == INDIRECT_REF
)
2504 ob
= TREE_OPERAND (ob
, 0);
2505 return (TREE_CODE (ob
) == NOP_EXPR
2506 && TREE_OPERAND (ob
, 0) == void_zero_node
);
2509 /* Returns 1 iff type T is something we want to treat as a scalar type for
2510 the purpose of deciding whether it is trivial/POD/standard-layout. */
2513 scalarish_type_p (const_tree t
)
2515 if (t
== error_mark_node
)
2518 return (SCALAR_TYPE_P (t
)
2519 || TREE_CODE (t
) == VECTOR_TYPE
);
2522 /* Returns true iff T requires non-trivial default initialization. */
2525 type_has_nontrivial_default_init (const_tree t
)
2527 t
= strip_array_types (CONST_CAST_TREE (t
));
2529 if (CLASS_TYPE_P (t
))
2530 return TYPE_HAS_COMPLEX_DFLT (t
);
2535 /* Returns true iff copying an object of type T (including via move
2536 constructor) is non-trivial. That is, T has no non-trivial copy
2537 constructors and no non-trivial move constructors. */
2540 type_has_nontrivial_copy_init (const_tree t
)
2542 t
= strip_array_types (CONST_CAST_TREE (t
));
2544 if (CLASS_TYPE_P (t
))
2546 gcc_assert (COMPLETE_TYPE_P (t
));
2547 return ((TYPE_HAS_COPY_CTOR (t
)
2548 && TYPE_HAS_COMPLEX_COPY_CTOR (t
))
2549 || TYPE_HAS_COMPLEX_MOVE_CTOR (t
));
2555 /* Returns 1 iff type T is a trivially copyable type, as defined in
2556 [basic.types] and [class]. */
2559 trivially_copyable_p (const_tree t
)
2561 t
= strip_array_types (CONST_CAST_TREE (t
));
2563 if (CLASS_TYPE_P (t
))
2564 return ((!TYPE_HAS_COPY_CTOR (t
)
2565 || !TYPE_HAS_COMPLEX_COPY_CTOR (t
))
2566 && !TYPE_HAS_COMPLEX_MOVE_CTOR (t
)
2567 && (!TYPE_HAS_COPY_ASSIGN (t
)
2568 || !TYPE_HAS_COMPLEX_COPY_ASSIGN (t
))
2569 && !TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
)
2570 && TYPE_HAS_TRIVIAL_DESTRUCTOR (t
));
2572 return scalarish_type_p (t
);
2575 /* Returns 1 iff type T is a trivial type, as defined in [basic.types] and
2579 trivial_type_p (const_tree t
)
2581 t
= strip_array_types (CONST_CAST_TREE (t
));
2583 if (CLASS_TYPE_P (t
))
2584 return (TYPE_HAS_TRIVIAL_DFLT (t
)
2585 && trivially_copyable_p (t
));
2587 return scalarish_type_p (t
);
2590 /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */
2593 pod_type_p (const_tree t
)
2595 /* This CONST_CAST is okay because strip_array_types returns its
2596 argument unmodified and we assign it to a const_tree. */
2597 t
= strip_array_types (CONST_CAST_TREE(t
));
2599 if (!CLASS_TYPE_P (t
))
2600 return scalarish_type_p (t
);
2601 else if (cxx_dialect
> cxx98
)
2602 /* [class]/10: A POD struct is a class that is both a trivial class and a
2603 standard-layout class, and has no non-static data members of type
2604 non-POD struct, non-POD union (or array of such types).
2606 We don't need to check individual members because if a member is
2607 non-std-layout or non-trivial, the class will be too. */
2608 return (std_layout_type_p (t
) && trivial_type_p (t
));
2610 /* The C++98 definition of POD is different. */
2611 return !CLASSTYPE_NON_LAYOUT_POD_P (t
);
2614 /* Returns true iff T is POD for the purpose of layout, as defined in the
2618 layout_pod_type_p (const_tree t
)
2620 t
= strip_array_types (CONST_CAST_TREE (t
));
2622 if (CLASS_TYPE_P (t
))
2623 return !CLASSTYPE_NON_LAYOUT_POD_P (t
);
2625 return scalarish_type_p (t
);
2628 /* Returns true iff T is a standard-layout type, as defined in
2632 std_layout_type_p (const_tree t
)
2634 t
= strip_array_types (CONST_CAST_TREE (t
));
2636 if (CLASS_TYPE_P (t
))
2637 return !CLASSTYPE_NON_STD_LAYOUT (t
);
2639 return scalarish_type_p (t
);
2642 /* Nonzero iff type T is a class template implicit specialization. */
2645 class_tmpl_impl_spec_p (const_tree t
)
2647 return CLASS_TYPE_P (t
) && CLASSTYPE_TEMPLATE_INSTANTIATION (t
);
2650 /* Returns 1 iff zero initialization of type T means actually storing
2654 zero_init_p (const_tree t
)
2656 /* This CONST_CAST is okay because strip_array_types returns its
2657 argument unmodified and we assign it to a const_tree. */
2658 t
= strip_array_types (CONST_CAST_TREE(t
));
2660 if (t
== error_mark_node
)
2663 /* NULL pointers to data members are initialized with -1. */
2664 if (TYPE_PTRMEM_P (t
))
2667 /* Classes that contain types that can't be zero-initialized, cannot
2668 be zero-initialized themselves. */
2669 if (CLASS_TYPE_P (t
) && CLASSTYPE_NON_ZERO_INIT_P (t
))
2675 /* Table of valid C++ attributes. */
2676 const struct attribute_spec cxx_attribute_table
[] =
2678 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
2679 affects_type_identity } */
2680 { "java_interface", 0, 0, false, false, false,
2681 handle_java_interface_attribute
, false },
2682 { "com_interface", 0, 0, false, false, false,
2683 handle_com_interface_attribute
, false },
2684 { "init_priority", 1, 1, true, false, false,
2685 handle_init_priority_attribute
, false },
2686 { NULL
, 0, 0, false, false, false, NULL
, false }
2689 /* Handle a "java_interface" attribute; arguments as in
2690 struct attribute_spec.handler. */
2692 handle_java_interface_attribute (tree
* node
,
2694 tree args ATTRIBUTE_UNUSED
,
2699 || !CLASS_TYPE_P (*node
)
2700 || !TYPE_FOR_JAVA (*node
))
2702 error ("%qE attribute can only be applied to Java class definitions",
2704 *no_add_attrs
= true;
2707 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
2708 *node
= build_variant_type_copy (*node
);
2709 TYPE_JAVA_INTERFACE (*node
) = 1;
2714 /* Handle a "com_interface" attribute; arguments as in
2715 struct attribute_spec.handler. */
2717 handle_com_interface_attribute (tree
* node
,
2719 tree args ATTRIBUTE_UNUSED
,
2720 int flags ATTRIBUTE_UNUSED
,
2725 *no_add_attrs
= true;
2728 || !CLASS_TYPE_P (*node
)
2729 || *node
!= TYPE_MAIN_VARIANT (*node
))
2731 warning (OPT_Wattributes
, "%qE attribute can only be applied "
2732 "to class definitions", name
);
2737 warning (0, "%qE is obsolete; g++ vtables are now COM-compatible by default",
2743 /* Handle an "init_priority" attribute; arguments as in
2744 struct attribute_spec.handler. */
2746 handle_init_priority_attribute (tree
* node
,
2749 int flags ATTRIBUTE_UNUSED
,
2752 tree initp_expr
= TREE_VALUE (args
);
2754 tree type
= TREE_TYPE (decl
);
2757 STRIP_NOPS (initp_expr
);
2759 if (!initp_expr
|| TREE_CODE (initp_expr
) != INTEGER_CST
)
2761 error ("requested init_priority is not an integer constant");
2762 *no_add_attrs
= true;
2766 pri
= TREE_INT_CST_LOW (initp_expr
);
2768 type
= strip_array_types (type
);
2770 if (decl
== NULL_TREE
2771 || TREE_CODE (decl
) != VAR_DECL
2772 || !TREE_STATIC (decl
)
2773 || DECL_EXTERNAL (decl
)
2774 || (TREE_CODE (type
) != RECORD_TYPE
2775 && TREE_CODE (type
) != UNION_TYPE
)
2776 /* Static objects in functions are initialized the
2777 first time control passes through that
2778 function. This is not precise enough to pin down an
2779 init_priority value, so don't allow it. */
2780 || current_function_decl
)
2782 error ("can only use %qE attribute on file-scope definitions "
2783 "of objects of class type", name
);
2784 *no_add_attrs
= true;
2788 if (pri
> MAX_INIT_PRIORITY
|| pri
<= 0)
2790 error ("requested init_priority is out of range");
2791 *no_add_attrs
= true;
2795 /* Check for init_priorities that are reserved for
2796 language and runtime support implementations.*/
2797 if (pri
<= MAX_RESERVED_INIT_PRIORITY
)
2800 (0, "requested init_priority is reserved for internal use");
2803 if (SUPPORTS_INIT_PRIORITY
)
2805 SET_DECL_INIT_PRIORITY (decl
, pri
);
2806 DECL_HAS_INIT_PRIORITY_P (decl
) = 1;
2811 error ("%qE attribute is not supported on this platform", name
);
2812 *no_add_attrs
= true;
2817 /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the
2818 thing pointed to by the constant. */
2821 make_ptrmem_cst (tree type
, tree member
)
2823 tree ptrmem_cst
= make_node (PTRMEM_CST
);
2824 TREE_TYPE (ptrmem_cst
) = type
;
2825 PTRMEM_CST_MEMBER (ptrmem_cst
) = member
;
2829 /* Build a variant of TYPE that has the indicated ATTRIBUTES. May
2830 return an existing type if an appropriate type already exists. */
2833 cp_build_type_attribute_variant (tree type
, tree attributes
)
2837 new_type
= build_type_attribute_variant (type
, attributes
);
2838 if (TREE_CODE (new_type
) == FUNCTION_TYPE
2839 || TREE_CODE (new_type
) == METHOD_TYPE
)
2840 new_type
= build_exception_variant (new_type
,
2841 TYPE_RAISES_EXCEPTIONS (type
));
2843 /* Making a new main variant of a class type is broken. */
2844 gcc_assert (!CLASS_TYPE_P (type
) || new_type
== type
);
2849 /* Return TRUE if TYPE1 and TYPE2 are identical for type hashing purposes.
2850 Called only after doing all language independent checks. Only
2851 to check TYPE_RAISES_EXCEPTIONS for FUNCTION_TYPE, the rest is already
2852 compared in type_hash_eq. */
2855 cxx_type_hash_eq (const_tree typea
, const_tree typeb
)
2857 gcc_assert (TREE_CODE (typea
) == FUNCTION_TYPE
2858 || TREE_CODE (typea
) == METHOD_TYPE
);
2860 return comp_except_specs (TYPE_RAISES_EXCEPTIONS (typea
),
2861 TYPE_RAISES_EXCEPTIONS (typeb
), ce_exact
);
2864 /* Apply FUNC to all language-specific sub-trees of TP in a pre-order
2865 traversal. Called from walk_tree. */
2868 cp_walk_subtrees (tree
*tp
, int *walk_subtrees_p
, walk_tree_fn func
,
2869 void *data
, struct pointer_set_t
*pset
)
2871 enum tree_code code
= TREE_CODE (*tp
);
2874 #define WALK_SUBTREE(NODE) \
2877 result = cp_walk_tree (&(NODE), func, data, pset); \
2878 if (result) goto out; \
2882 /* Not one of the easy cases. We must explicitly go through the
2888 case TEMPLATE_TEMPLATE_PARM
:
2889 case BOUND_TEMPLATE_TEMPLATE_PARM
:
2890 case UNBOUND_CLASS_TEMPLATE
:
2891 case TEMPLATE_PARM_INDEX
:
2892 case TEMPLATE_TYPE_PARM
:
2895 case UNDERLYING_TYPE
:
2896 /* None of these have subtrees other than those already walked
2898 *walk_subtrees_p
= 0;
2902 WALK_SUBTREE (BASELINK_FUNCTIONS (*tp
));
2903 *walk_subtrees_p
= 0;
2907 WALK_SUBTREE (TREE_TYPE (*tp
));
2908 *walk_subtrees_p
= 0;
2912 WALK_SUBTREE (TREE_PURPOSE (*tp
));
2916 WALK_SUBTREE (OVL_FUNCTION (*tp
));
2917 WALK_SUBTREE (OVL_CHAIN (*tp
));
2918 *walk_subtrees_p
= 0;
2922 WALK_SUBTREE (DECL_NAME (*tp
));
2923 WALK_SUBTREE (USING_DECL_SCOPE (*tp
));
2924 WALK_SUBTREE (USING_DECL_DECLS (*tp
));
2925 *walk_subtrees_p
= 0;
2929 if (TYPE_PTRMEMFUNC_P (*tp
))
2930 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (*tp
));
2933 case TYPE_ARGUMENT_PACK
:
2934 case NONTYPE_ARGUMENT_PACK
:
2936 tree args
= ARGUMENT_PACK_ARGS (*tp
);
2937 int i
, len
= TREE_VEC_LENGTH (args
);
2938 for (i
= 0; i
< len
; i
++)
2939 WALK_SUBTREE (TREE_VEC_ELT (args
, i
));
2943 case TYPE_PACK_EXPANSION
:
2944 WALK_SUBTREE (TREE_TYPE (*tp
));
2945 *walk_subtrees_p
= 0;
2948 case EXPR_PACK_EXPANSION
:
2949 WALK_SUBTREE (TREE_OPERAND (*tp
, 0));
2950 *walk_subtrees_p
= 0;
2954 case REINTERPRET_CAST_EXPR
:
2955 case STATIC_CAST_EXPR
:
2956 case CONST_CAST_EXPR
:
2957 case DYNAMIC_CAST_EXPR
:
2958 if (TREE_TYPE (*tp
))
2959 WALK_SUBTREE (TREE_TYPE (*tp
));
2963 for (i
= 0; i
< TREE_CODE_LENGTH (TREE_CODE (*tp
)); ++i
)
2964 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
2966 *walk_subtrees_p
= 0;
2970 WALK_SUBTREE (TRAIT_EXPR_TYPE1 (*tp
));
2971 WALK_SUBTREE (TRAIT_EXPR_TYPE2 (*tp
));
2972 *walk_subtrees_p
= 0;
2976 WALK_SUBTREE (DECLTYPE_TYPE_EXPR (*tp
));
2977 *walk_subtrees_p
= 0;
2985 /* We didn't find what we were looking for. */
2992 /* Like save_expr, but for C++. */
2995 cp_save_expr (tree expr
)
2997 /* There is no reason to create a SAVE_EXPR within a template; if
2998 needed, we can create the SAVE_EXPR when instantiating the
2999 template. Furthermore, the middle-end cannot handle C++-specific
3001 if (processing_template_decl
)
3003 return save_expr (expr
);
3006 /* Initialize tree.c. */
3011 list_hash_table
= htab_create_ggc (31, list_hash
, list_hash_eq
, NULL
);
3014 /* Returns the kind of special function that DECL (a FUNCTION_DECL)
3015 is. Note that sfk_none is zero, so this function can be used as a
3016 predicate to test whether or not DECL is a special function. */
3018 special_function_kind
3019 special_function_p (const_tree decl
)
3021 /* Rather than doing all this stuff with magic names, we should
3022 probably have a field of type `special_function_kind' in
3023 DECL_LANG_SPECIFIC. */
3024 if (DECL_COPY_CONSTRUCTOR_P (decl
))
3025 return sfk_copy_constructor
;
3026 if (DECL_MOVE_CONSTRUCTOR_P (decl
))
3027 return sfk_move_constructor
;
3028 if (DECL_CONSTRUCTOR_P (decl
))
3029 return sfk_constructor
;
3030 if (DECL_OVERLOADED_OPERATOR_P (decl
) == NOP_EXPR
)
3032 if (copy_fn_p (decl
))
3033 return sfk_copy_assignment
;
3034 if (move_fn_p (decl
))
3035 return sfk_move_assignment
;
3037 if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl
))
3038 return sfk_destructor
;
3039 if (DECL_COMPLETE_DESTRUCTOR_P (decl
))
3040 return sfk_complete_destructor
;
3041 if (DECL_BASE_DESTRUCTOR_P (decl
))
3042 return sfk_base_destructor
;
3043 if (DECL_DELETING_DESTRUCTOR_P (decl
))
3044 return sfk_deleting_destructor
;
3045 if (DECL_CONV_FN_P (decl
))
3046 return sfk_conversion
;
3051 /* Returns nonzero if TYPE is a character type, including wchar_t. */
3054 char_type_p (tree type
)
3056 return (same_type_p (type
, char_type_node
)
3057 || same_type_p (type
, unsigned_char_type_node
)
3058 || same_type_p (type
, signed_char_type_node
)
3059 || same_type_p (type
, char16_type_node
)
3060 || same_type_p (type
, char32_type_node
)
3061 || same_type_p (type
, wchar_type_node
));
3064 /* Returns the kind of linkage associated with the indicated DECL. Th
3065 value returned is as specified by the language standard; it is
3066 independent of implementation details regarding template
3067 instantiation, etc. For example, it is possible that a declaration
3068 to which this function assigns external linkage would not show up
3069 as a global symbol when you run `nm' on the resulting object file. */
3072 decl_linkage (tree decl
)
3074 /* This function doesn't attempt to calculate the linkage from first
3075 principles as given in [basic.link]. Instead, it makes use of
3076 the fact that we have already set TREE_PUBLIC appropriately, and
3077 then handles a few special cases. Ideally, we would calculate
3078 linkage first, and then transform that into a concrete
3081 /* Things that don't have names have no linkage. */
3082 if (!DECL_NAME (decl
))
3085 /* Fields have no linkage. */
3086 if (TREE_CODE (decl
) == FIELD_DECL
)
3089 /* Things that are TREE_PUBLIC have external linkage. */
3090 if (TREE_PUBLIC (decl
))
3093 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
3096 /* Linkage of a CONST_DECL depends on the linkage of the enumeration
3098 if (TREE_CODE (decl
) == CONST_DECL
)
3099 return decl_linkage (TYPE_NAME (TREE_TYPE (decl
)));
3101 /* Some things that are not TREE_PUBLIC have external linkage, too.
3102 For example, on targets that don't have weak symbols, we make all
3103 template instantiations have internal linkage (in the object
3104 file), but the symbols should still be treated as having external
3105 linkage from the point of view of the language. */
3106 if ((TREE_CODE (decl
) == FUNCTION_DECL
3107 || TREE_CODE (decl
) == VAR_DECL
)
3108 && DECL_COMDAT (decl
))
3111 /* Things in local scope do not have linkage, if they don't have
3113 if (decl_function_context (decl
))
3116 /* Members of the anonymous namespace also have TREE_PUBLIC unset, but
3117 are considered to have external linkage for language purposes. DECLs
3118 really meant to have internal linkage have DECL_THIS_STATIC set. */
3119 if (TREE_CODE (decl
) == TYPE_DECL
)
3121 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
)
3123 if (!DECL_THIS_STATIC (decl
))
3126 /* Static data members and static member functions from classes
3127 in anonymous namespace also don't have TREE_PUBLIC set. */
3128 if (DECL_CLASS_CONTEXT (decl
))
3132 /* Everything else has internal linkage. */
3136 /* Returns the storage duration of the object or reference associated with
3137 the indicated DECL, which should be a VAR_DECL or PARM_DECL. */
3140 decl_storage_duration (tree decl
)
3142 if (TREE_CODE (decl
) == PARM_DECL
)
3144 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3146 gcc_assert (TREE_CODE (decl
) == VAR_DECL
);
3147 if (!TREE_STATIC (decl
)
3148 && !DECL_EXTERNAL (decl
))
3150 if (DECL_THREAD_LOCAL_P (decl
))
3155 /* EXP is an expression that we want to pre-evaluate. Returns (in
3156 *INITP) an expression that will perform the pre-evaluation. The
3157 value returned by this function is a side-effect free expression
3158 equivalent to the pre-evaluated expression. Callers must ensure
3159 that *INITP is evaluated before EXP. */
3162 stabilize_expr (tree exp
, tree
* initp
)
3166 if (!TREE_SIDE_EFFECTS (exp
))
3167 init_expr
= NULL_TREE
;
3168 else if (!TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (exp
))
3169 || !lvalue_or_rvalue_with_address_p (exp
))
3171 init_expr
= get_target_expr (exp
);
3172 exp
= TARGET_EXPR_SLOT (init_expr
);
3176 bool xval
= !real_lvalue_p (exp
);
3177 exp
= cp_build_addr_expr (exp
, tf_warning_or_error
);
3178 init_expr
= get_target_expr (exp
);
3179 exp
= TARGET_EXPR_SLOT (init_expr
);
3180 exp
= cp_build_indirect_ref (exp
, RO_NULL
, tf_warning_or_error
);
3186 gcc_assert (!TREE_SIDE_EFFECTS (exp
));
3190 /* Add NEW_EXPR, an expression whose value we don't care about, after the
3191 similar expression ORIG. */
3194 add_stmt_to_compound (tree orig
, tree new_expr
)
3196 if (!new_expr
|| !TREE_SIDE_EFFECTS (new_expr
))
3198 if (!orig
|| !TREE_SIDE_EFFECTS (orig
))
3200 return build2 (COMPOUND_EXPR
, void_type_node
, orig
, new_expr
);
3203 /* Like stabilize_expr, but for a call whose arguments we want to
3204 pre-evaluate. CALL is modified in place to use the pre-evaluated
3205 arguments, while, upon return, *INITP contains an expression to
3206 compute the arguments. */
3209 stabilize_call (tree call
, tree
*initp
)
3211 tree inits
= NULL_TREE
;
3213 int nargs
= call_expr_nargs (call
);
3215 if (call
== error_mark_node
|| processing_template_decl
)
3221 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
3223 for (i
= 0; i
< nargs
; i
++)
3226 CALL_EXPR_ARG (call
, i
) =
3227 stabilize_expr (CALL_EXPR_ARG (call
, i
), &init
);
3228 inits
= add_stmt_to_compound (inits
, init
);
3234 /* Like stabilize_expr, but for an AGGR_INIT_EXPR whose arguments we want
3235 to pre-evaluate. CALL is modified in place to use the pre-evaluated
3236 arguments, while, upon return, *INITP contains an expression to
3237 compute the arguments. */
3240 stabilize_aggr_init (tree call
, tree
*initp
)
3242 tree inits
= NULL_TREE
;
3244 int nargs
= aggr_init_expr_nargs (call
);
3246 if (call
== error_mark_node
)
3249 gcc_assert (TREE_CODE (call
) == AGGR_INIT_EXPR
);
3251 for (i
= 0; i
< nargs
; i
++)
3254 AGGR_INIT_EXPR_ARG (call
, i
) =
3255 stabilize_expr (AGGR_INIT_EXPR_ARG (call
, i
), &init
);
3256 inits
= add_stmt_to_compound (inits
, init
);
3262 /* Like stabilize_expr, but for an initialization.
3264 If the initialization is for an object of class type, this function
3265 takes care not to introduce additional temporaries.
3267 Returns TRUE iff the expression was successfully pre-evaluated,
3268 i.e., if INIT is now side-effect free, except for, possible, a
3269 single call to a constructor. */
3272 stabilize_init (tree init
, tree
*initp
)
3278 if (t
== error_mark_node
|| processing_template_decl
)
3281 if (TREE_CODE (t
) == INIT_EXPR
3282 && TREE_CODE (TREE_OPERAND (t
, 1)) != TARGET_EXPR
3283 && TREE_CODE (TREE_OPERAND (t
, 1)) != AGGR_INIT_EXPR
)
3285 TREE_OPERAND (t
, 1) = stabilize_expr (TREE_OPERAND (t
, 1), initp
);
3289 if (TREE_CODE (t
) == INIT_EXPR
)
3290 t
= TREE_OPERAND (t
, 1);
3291 if (TREE_CODE (t
) == TARGET_EXPR
)
3292 t
= TARGET_EXPR_INITIAL (t
);
3293 if (TREE_CODE (t
) == COMPOUND_EXPR
)
3295 if (TREE_CODE (t
) == CONSTRUCTOR
3296 && EMPTY_CONSTRUCTOR_P (t
))
3297 /* Default-initialization. */
3300 /* If the initializer is a COND_EXPR, we can't preevaluate
3302 if (TREE_CODE (t
) == COND_EXPR
)
3305 if (TREE_CODE (t
) == CALL_EXPR
)
3307 stabilize_call (t
, initp
);
3311 if (TREE_CODE (t
) == AGGR_INIT_EXPR
)
3313 stabilize_aggr_init (t
, initp
);
3317 /* The initialization is being performed via a bitwise copy -- and
3318 the item copied may have side effects. */
3319 return TREE_SIDE_EFFECTS (init
);
3322 /* Like "fold", but should be used whenever we might be processing the
3323 body of a template. */
3326 fold_if_not_in_template (tree expr
)
3328 /* In the body of a template, there is never any need to call
3329 "fold". We will call fold later when actually instantiating the
3330 template. Integral constant expressions in templates will be
3331 evaluated via fold_non_dependent_expr, as necessary. */
3332 if (processing_template_decl
)
3335 /* Fold C++ front-end specific tree codes. */
3336 if (TREE_CODE (expr
) == UNARY_PLUS_EXPR
)
3337 return fold_convert (TREE_TYPE (expr
), TREE_OPERAND (expr
, 0));
3342 /* Returns true if a cast to TYPE may appear in an integral constant
3346 cast_valid_in_integral_constant_expression_p (tree type
)
3348 return (INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
3349 || cxx_dialect
>= cxx0x
3350 || dependent_type_p (type
)
3351 || type
== error_mark_node
);
3354 /* Return true if we need to fix linkage information of DECL. */
3357 cp_fix_function_decl_p (tree decl
)
3359 /* Skip if DECL is not externally visible. */
3360 if (!TREE_PUBLIC (decl
))
3363 /* We need to fix DECL if it a appears to be exported but with no
3364 function body. Thunks do not have CFGs and we may need to
3365 handle them specially later. */
3366 if (!gimple_has_body_p (decl
)
3367 && !DECL_THUNK_P (decl
)
3368 && !DECL_EXTERNAL (decl
))
3370 struct cgraph_node
*node
= cgraph_get_node (decl
);
3372 /* Don't fix same_body aliases. Although they don't have their own
3373 CFG, they share it with what they alias to. */
3375 || node
->decl
== decl
3376 || !node
->same_body
)
3383 /* Clean the C++ specific parts of the tree T. */
3386 cp_free_lang_data (tree t
)
3388 if (TREE_CODE (t
) == METHOD_TYPE
3389 || TREE_CODE (t
) == FUNCTION_TYPE
)
3391 /* Default args are not interesting anymore. */
3392 tree argtypes
= TYPE_ARG_TYPES (t
);
3395 TREE_PURPOSE (argtypes
) = 0;
3396 argtypes
= TREE_CHAIN (argtypes
);
3399 else if (TREE_CODE (t
) == FUNCTION_DECL
3400 && cp_fix_function_decl_p (t
))
3402 /* If T is used in this translation unit at all, the definition
3403 must exist somewhere else since we have decided to not emit it
3404 in this TU. So make it an external reference. */
3405 DECL_EXTERNAL (t
) = 1;
3406 TREE_STATIC (t
) = 0;
3408 if (CP_AGGREGATE_TYPE_P (t
)
3411 tree name
= TYPE_NAME (t
);
3412 if (TREE_CODE (name
) == TYPE_DECL
)
3413 name
= DECL_NAME (name
);
3414 /* Drop anonymous names. */
3415 if (name
!= NULL_TREE
3416 && ANON_AGGRNAME_P (name
))
3417 TYPE_NAME (t
) = NULL_TREE
;
3419 if (TREE_CODE (t
) == NAMESPACE_DECL
)
3421 /* The list of users of a namespace isn't useful for the middle-end
3422 or debug generators. */
3423 DECL_NAMESPACE_USERS (t
) = NULL_TREE
;
3424 /* Neither do we need the leftover chaining of namespaces
3425 from the binding level. */
3426 DECL_CHAIN (t
) = NULL_TREE
;
3430 /* Stub for c-common. Please keep in sync with c-decl.c.
3431 FIXME: If address space support is target specific, then this
3432 should be a C target hook. But currently this is not possible,
3433 because this function is called via REGISTER_TARGET_PRAGMAS. */
3435 c_register_addr_space (const char *word ATTRIBUTE_UNUSED
,
3436 addr_space_t as ATTRIBUTE_UNUSED
)
3441 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3442 /* Complain that some language-specific thing hanging off a tree
3443 node has been accessed improperly. */
3446 lang_check_failed (const char* file
, int line
, const char* function
)
3448 internal_error ("lang_* check: failed in %s, at %s:%d",
3449 function
, trim_filename (file
), line
);
3451 #endif /* ENABLE_TREE_CHECKING */
3453 #include "gt-cp-tree.h"