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
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
);
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
)
79 /* lvalue references and named rvalue references are lvalues. */
83 if (ref
== current_class_ptr
)
86 switch (TREE_CODE (ref
))
90 /* preincrements and predecrements are valid lvals, provided
91 what they refer to are valid lvals. */
92 case PREINCREMENT_EXPR
:
93 case PREDECREMENT_EXPR
:
95 case WITH_CLEANUP_EXPR
:
98 return lvalue_kind (TREE_OPERAND (ref
, 0));
101 op1_lvalue_kind
= lvalue_kind (TREE_OPERAND (ref
, 0));
102 /* Look at the member designator. */
103 if (!op1_lvalue_kind
)
105 else if (is_overloaded_fn (TREE_OPERAND (ref
, 1)))
106 /* The "field" can be a FUNCTION_DECL or an OVERLOAD in some
107 situations. If we're seeing a COMPONENT_REF, it's a non-static
108 member, so it isn't an lvalue. */
109 op1_lvalue_kind
= clk_none
;
110 else if (TREE_CODE (TREE_OPERAND (ref
, 1)) != FIELD_DECL
)
111 /* This can be IDENTIFIER_NODE in a template. */;
112 else if (DECL_C_BIT_FIELD (TREE_OPERAND (ref
, 1)))
114 /* Clear the ordinary bit. If this object was a class
115 rvalue we want to preserve that information. */
116 op1_lvalue_kind
&= ~clk_ordinary
;
117 /* The lvalue is for a bitfield. */
118 op1_lvalue_kind
|= clk_bitfield
;
120 else if (DECL_PACKED (TREE_OPERAND (ref
, 1)))
121 op1_lvalue_kind
|= clk_packed
;
123 return op1_lvalue_kind
;
126 case COMPOUND_LITERAL_EXPR
:
130 /* CONST_DECL without TREE_STATIC are enumeration values and
131 thus not lvalues. With TREE_STATIC they are used by ObjC++
132 in objc_build_string_object and need to be considered as
134 if (! TREE_STATIC (ref
))
137 if (TREE_READONLY (ref
) && ! TREE_STATIC (ref
)
138 && DECL_LANG_SPECIFIC (ref
)
139 && DECL_IN_AGGR_P (ref
))
145 if (TREE_CODE (TREE_TYPE (ref
)) != METHOD_TYPE
)
149 /* A scope ref in a template, left as SCOPE_REF to support later
152 gcc_assert (!type_dependent_expression_p (CONST_CAST_TREE(ref
)));
153 return lvalue_kind (TREE_OPERAND (ref
, 1));
157 /* Disallow <? and >? as lvalues if either argument side-effects. */
158 if (TREE_SIDE_EFFECTS (TREE_OPERAND (ref
, 0))
159 || TREE_SIDE_EFFECTS (TREE_OPERAND (ref
, 1)))
161 op1_lvalue_kind
= lvalue_kind (TREE_OPERAND (ref
, 0));
162 op2_lvalue_kind
= lvalue_kind (TREE_OPERAND (ref
, 1));
166 op1_lvalue_kind
= lvalue_kind (TREE_OPERAND (ref
, 1)
167 ? TREE_OPERAND (ref
, 1)
168 : TREE_OPERAND (ref
, 0));
169 op2_lvalue_kind
= lvalue_kind (TREE_OPERAND (ref
, 2));
176 return lvalue_kind (TREE_OPERAND (ref
, 1));
182 return (CLASS_TYPE_P (TREE_TYPE (ref
)) ? clk_class
: clk_none
);
185 /* Any class-valued call would be wrapped in a TARGET_EXPR. */
189 /* All functions (except non-static-member functions) are
191 return (DECL_NONSTATIC_MEMBER_FUNCTION_P (ref
)
192 ? clk_none
: clk_ordinary
);
195 /* We now represent a reference to a single static member function
197 /* This CONST_CAST is okay because BASELINK_FUNCTIONS returns
198 its argument unmodified and we assign it to a const_tree. */
199 return lvalue_kind (BASELINK_FUNCTIONS (CONST_CAST_TREE (ref
)));
201 case NON_DEPENDENT_EXPR
:
202 /* We must consider NON_DEPENDENT_EXPRs to be lvalues so that
203 things like "&E" where "E" is an expression with a
204 non-dependent type work. It is safe to be lenient because an
205 error will be issued when the template is instantiated if "E"
213 /* If one operand is not an lvalue at all, then this expression is
215 if (!op1_lvalue_kind
|| !op2_lvalue_kind
)
218 /* Otherwise, it's an lvalue, and it has all the odd properties
219 contributed by either operand. */
220 op1_lvalue_kind
= op1_lvalue_kind
| op2_lvalue_kind
;
221 /* It's not an ordinary lvalue if it involves any other kind. */
222 if ((op1_lvalue_kind
& ~clk_ordinary
) != clk_none
)
223 op1_lvalue_kind
&= ~clk_ordinary
;
224 /* It can't be both a pseudo-lvalue and a non-addressable lvalue.
225 A COND_EXPR of those should be wrapped in a TARGET_EXPR. */
226 if ((op1_lvalue_kind
& (clk_rvalueref
|clk_class
))
227 && (op1_lvalue_kind
& (clk_bitfield
|clk_packed
)))
228 op1_lvalue_kind
= clk_none
;
229 return op1_lvalue_kind
;
232 /* Returns the kind of lvalue that REF is, in the sense of
233 [basic.lval]. This function should really be named lvalue_p; it
234 computes the C++ definition of lvalue. */
237 real_lvalue_p (const_tree ref
)
239 cp_lvalue_kind kind
= lvalue_kind (ref
);
240 if (kind
& (clk_rvalueref
|clk_class
))
246 /* This differs from real_lvalue_p in that class rvalues are considered
250 lvalue_p (const_tree ref
)
252 return (lvalue_kind (ref
) != clk_none
);
255 /* This differs from real_lvalue_p in that rvalues formed by dereferencing
256 rvalue references are considered rvalues. */
259 lvalue_or_rvalue_with_address_p (const_tree ref
)
261 cp_lvalue_kind kind
= lvalue_kind (ref
);
262 if (kind
& clk_class
)
265 return (kind
!= clk_none
);
268 /* Test whether DECL is a builtin that may appear in a
269 constant-expression. */
272 builtin_valid_in_constant_expr_p (const_tree decl
)
274 /* At present BUILT_IN_CONSTANT_P is the only builtin we're allowing
275 in constant-expressions. We may want to add other builtins later. */
276 return DECL_IS_BUILTIN_CONSTANT_P (decl
);
279 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
282 build_target_expr (tree decl
, tree value
)
286 #ifdef ENABLE_CHECKING
287 gcc_assert (VOID_TYPE_P (TREE_TYPE (value
))
288 || TREE_TYPE (decl
) == TREE_TYPE (value
)
289 || useless_type_conversion_p (TREE_TYPE (decl
),
293 t
= build4 (TARGET_EXPR
, TREE_TYPE (decl
), decl
, value
,
294 cxx_maybe_build_cleanup (decl
), NULL_TREE
);
295 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
296 ignore the TARGET_EXPR. If there really turn out to be no
297 side-effects, then the optimizer should be able to get rid of
298 whatever code is generated anyhow. */
299 TREE_SIDE_EFFECTS (t
) = 1;
304 /* Return an undeclared local temporary of type TYPE for use in building a
308 build_local_temp (tree type
)
310 tree slot
= build_decl (input_location
,
311 VAR_DECL
, NULL_TREE
, type
);
312 DECL_ARTIFICIAL (slot
) = 1;
313 DECL_IGNORED_P (slot
) = 1;
314 DECL_CONTEXT (slot
) = current_function_decl
;
315 layout_decl (slot
, 0);
319 /* Set various status flags when building an AGGR_INIT_EXPR object T. */
322 process_aggr_init_operands (tree t
)
326 side_effects
= TREE_SIDE_EFFECTS (t
);
330 n
= TREE_OPERAND_LENGTH (t
);
331 for (i
= 1; i
< n
; i
++)
333 tree op
= TREE_OPERAND (t
, i
);
334 if (op
&& TREE_SIDE_EFFECTS (op
))
341 TREE_SIDE_EFFECTS (t
) = side_effects
;
344 /* Build an AGGR_INIT_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE,
345 FN, and SLOT. NARGS is the number of call arguments which are specified
346 as a tree array ARGS. */
349 build_aggr_init_array (tree return_type
, tree fn
, tree slot
, int nargs
,
355 t
= build_vl_exp (AGGR_INIT_EXPR
, nargs
+ 3);
356 TREE_TYPE (t
) = return_type
;
357 AGGR_INIT_EXPR_FN (t
) = fn
;
358 AGGR_INIT_EXPR_SLOT (t
) = slot
;
359 for (i
= 0; i
< nargs
; i
++)
360 AGGR_INIT_EXPR_ARG (t
, i
) = args
[i
];
361 process_aggr_init_operands (t
);
365 /* INIT is a CALL_EXPR or AGGR_INIT_EXPR which needs info about its
366 target. TYPE is the type to be initialized.
368 Build an AGGR_INIT_EXPR to represent the initialization. This function
369 differs from build_cplus_new in that an AGGR_INIT_EXPR can only be used
370 to initialize another object, whereas a TARGET_EXPR can either
371 initialize another object or create its own temporary object, and as a
372 result building up a TARGET_EXPR requires that the type's destructor be
376 build_aggr_init_expr (tree type
, tree init
)
383 /* Make sure that we're not trying to create an instance of an
385 abstract_virtuals_error (NULL_TREE
, type
);
387 if (TREE_CODE (init
) == CALL_EXPR
)
388 fn
= CALL_EXPR_FN (init
);
389 else if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
390 fn
= AGGR_INIT_EXPR_FN (init
);
392 return convert (type
, init
);
394 is_ctor
= (TREE_CODE (fn
) == ADDR_EXPR
395 && TREE_CODE (TREE_OPERAND (fn
, 0)) == FUNCTION_DECL
396 && DECL_CONSTRUCTOR_P (TREE_OPERAND (fn
, 0)));
398 /* We split the CALL_EXPR into its function and its arguments here.
399 Then, in expand_expr, we put them back together. The reason for
400 this is that this expression might be a default argument
401 expression. In that case, we need a new temporary every time the
402 expression is used. That's what break_out_target_exprs does; it
403 replaces every AGGR_INIT_EXPR with a copy that uses a fresh
404 temporary slot. Then, expand_expr builds up a call-expression
405 using the new slot. */
407 /* If we don't need to use a constructor to create an object of this
408 type, don't mess with AGGR_INIT_EXPR. */
409 if (is_ctor
|| TREE_ADDRESSABLE (type
))
411 slot
= build_local_temp (type
);
413 if (TREE_CODE(init
) == CALL_EXPR
)
414 rval
= build_aggr_init_array (void_type_node
, fn
, slot
,
415 call_expr_nargs (init
),
416 CALL_EXPR_ARGP (init
));
418 rval
= build_aggr_init_array (void_type_node
, fn
, slot
,
419 aggr_init_expr_nargs (init
),
420 AGGR_INIT_EXPR_ARGP (init
));
421 TREE_SIDE_EFFECTS (rval
) = 1;
422 AGGR_INIT_VIA_CTOR_P (rval
) = is_ctor
;
423 TREE_NOTHROW (rval
) = TREE_NOTHROW (init
);
431 /* INIT is a CALL_EXPR or AGGR_INIT_EXPR which needs info about its
432 target. TYPE is the type that this initialization should appear to
435 Build an encapsulation of the initialization to perform
436 and return it so that it can be processed by language-independent
437 and language-specific expression expanders. */
440 build_cplus_new (tree type
, tree init
)
442 tree rval
= build_aggr_init_expr (type
, init
);
445 if (TREE_CODE (rval
) == AGGR_INIT_EXPR
)
446 slot
= AGGR_INIT_EXPR_SLOT (rval
);
447 else if (TREE_CODE (rval
) == CALL_EXPR
448 || TREE_CODE (rval
) == CONSTRUCTOR
)
449 slot
= build_local_temp (type
);
453 rval
= build_target_expr (slot
, rval
);
454 TARGET_EXPR_IMPLICIT_P (rval
) = 1;
459 /* Subroutine of build_vec_init_expr: Build up a single element
460 intialization as a proxy for the full array initialization to get things
461 marked as used and any appropriate diagnostics.
463 Since we're deferring building the actual constructor calls until
464 gimplification time, we need to build one now and throw it away so
465 that the relevant constructor gets mark_used before cgraph decides
466 what functions are needed. Here we assume that init is either
467 NULL_TREE, void_type_node (indicating value-initialization), or
468 another array to copy. */
471 build_vec_init_elt (tree type
, tree init
)
473 tree inner_type
= strip_array_types (type
);
474 VEC(tree
,gc
) *argvec
;
476 if (integer_zerop (array_type_nelts_total (type
))
477 || !CLASS_TYPE_P (inner_type
))
478 /* No interesting initialization to do. */
479 return integer_zero_node
;
480 else if (init
== void_type_node
)
481 return build_value_init (inner_type
, tf_warning_or_error
);
483 gcc_assert (init
== NULL_TREE
484 || (same_type_ignoring_top_level_qualifiers_p
485 (type
, TREE_TYPE (init
))));
487 argvec
= make_tree_vector ();
490 tree dummy
= build_dummy_object (inner_type
);
491 if (!real_lvalue_p (init
))
492 dummy
= move (dummy
);
493 VEC_quick_push (tree
, argvec
, dummy
);
495 return build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
496 &argvec
, inner_type
, LOOKUP_NORMAL
,
497 tf_warning_or_error
);
500 /* Return a TARGET_EXPR which expresses the initialization of an array to
501 be named later, either default-initialization or copy-initialization
502 from another array of the same type. */
505 build_vec_init_expr (tree type
, tree init
)
508 bool value_init
= false;
509 tree elt_init
= build_vec_init_elt (type
, init
);
511 if (init
== void_type_node
)
517 slot
= build_local_temp (type
);
518 init
= build2 (VEC_INIT_EXPR
, type
, slot
, init
);
519 SET_EXPR_LOCATION (init
, input_location
);
521 if (cxx_dialect
>= cxx0x
522 && potential_constant_expression (elt_init
))
523 VEC_INIT_EXPR_IS_CONSTEXPR (init
) = true;
524 VEC_INIT_EXPR_VALUE_INIT (init
) = value_init
;
526 init
= build_target_expr (slot
, init
);
527 TARGET_EXPR_IMPLICIT_P (init
) = 1;
532 /* Give a helpful diagnostic for a non-constexpr VEC_INIT_EXPR in a context
533 that requires a constant expression. */
536 diagnose_non_constexpr_vec_init (tree expr
)
538 tree type
= TREE_TYPE (VEC_INIT_EXPR_SLOT (expr
));
540 if (VEC_INIT_EXPR_VALUE_INIT (expr
))
541 init
= void_zero_node
;
543 init
= VEC_INIT_EXPR_INIT (expr
);
545 elt_init
= build_vec_init_elt (type
, init
);
546 require_potential_constant_expression (elt_init
);
550 build_array_copy (tree init
)
552 return build_vec_init_expr (TREE_TYPE (init
), init
);
555 /* Build a TARGET_EXPR using INIT to initialize a new temporary of the
559 build_target_expr_with_type (tree init
, tree type
)
561 gcc_assert (!VOID_TYPE_P (type
));
563 if (TREE_CODE (init
) == TARGET_EXPR
564 || init
== error_mark_node
)
566 else if (CLASS_TYPE_P (type
) && type_has_nontrivial_copy_init (type
)
567 && !VOID_TYPE_P (TREE_TYPE (init
))
568 && TREE_CODE (init
) != COND_EXPR
569 && TREE_CODE (init
) != CONSTRUCTOR
570 && TREE_CODE (init
) != VA_ARG_EXPR
)
571 /* We need to build up a copy constructor call. A void initializer
572 means we're being called from bot_manip. COND_EXPR is a special
573 case because we already have copies on the arms and we don't want
574 another one here. A CONSTRUCTOR is aggregate initialization, which
575 is handled separately. A VA_ARG_EXPR is magic creation of an
576 aggregate; there's no additional work to be done. */
577 return force_rvalue (init
);
579 return force_target_expr (type
, init
);
582 /* Like the above function, but without the checking. This function should
583 only be used by code which is deliberately trying to subvert the type
584 system, such as call_builtin_trap. Or build_over_call, to avoid
585 infinite recursion. */
588 force_target_expr (tree type
, tree init
)
592 gcc_assert (!VOID_TYPE_P (type
));
594 slot
= build_local_temp (type
);
595 return build_target_expr (slot
, init
);
598 /* Like build_target_expr_with_type, but use the type of INIT. */
601 get_target_expr (tree init
)
603 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
604 return build_target_expr (AGGR_INIT_EXPR_SLOT (init
), init
);
606 return build_target_expr_with_type (init
, TREE_TYPE (init
));
609 /* If EXPR is a bitfield reference, convert it to the declared type of
610 the bitfield, and return the resulting expression. Otherwise,
611 return EXPR itself. */
614 convert_bitfield_to_declared_type (tree expr
)
618 bitfield_type
= is_bitfield_expr_with_lowered_type (expr
);
620 expr
= convert_to_integer (TYPE_MAIN_VARIANT (bitfield_type
),
625 /* EXPR is being used in an rvalue context. Return a version of EXPR
626 that is marked as an rvalue. */
633 if (error_operand_p (expr
))
636 expr
= mark_rvalue_use (expr
);
640 Non-class rvalues always have cv-unqualified types. */
641 type
= TREE_TYPE (expr
);
642 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
643 type
= cv_unqualified (type
);
645 /* We need to do this for rvalue refs as well to get the right answer
646 from decltype; see c++/36628. */
647 if (!processing_template_decl
&& lvalue_or_rvalue_with_address_p (expr
))
648 expr
= build1 (NON_LVALUE_EXPR
, type
, expr
);
649 else if (type
!= TREE_TYPE (expr
))
650 expr
= build_nop (type
, expr
);
656 /* Hash an ARRAY_TYPE. K is really of type `tree'. */
659 cplus_array_hash (const void* k
)
662 const_tree
const t
= (const_tree
) k
;
664 hash
= TYPE_UID (TREE_TYPE (t
));
666 hash
^= TYPE_UID (TYPE_DOMAIN (t
));
670 typedef struct cplus_array_info
{
675 /* Compare two ARRAY_TYPEs. K1 is really of type `tree', K2 is really
676 of type `cplus_array_info*'. */
679 cplus_array_compare (const void * k1
, const void * k2
)
681 const_tree
const t1
= (const_tree
) k1
;
682 const cplus_array_info
*const t2
= (const cplus_array_info
*) k2
;
684 return (TREE_TYPE (t1
) == t2
->type
&& TYPE_DOMAIN (t1
) == t2
->domain
);
687 /* Hash table containing dependent array types, which are unsuitable for
688 the language-independent type hash table. */
689 static GTY ((param_is (union tree_node
))) htab_t cplus_array_htab
;
691 /* Like build_array_type, but handle special C++ semantics. */
694 build_cplus_array_type (tree elt_type
, tree index_type
)
698 if (elt_type
== error_mark_node
|| index_type
== error_mark_node
)
699 return error_mark_node
;
701 if (processing_template_decl
702 && (dependent_type_p (elt_type
)
703 || (index_type
&& !TREE_CONSTANT (TYPE_MAX_VALUE (index_type
)))))
706 cplus_array_info cai
;
709 if (cplus_array_htab
== NULL
)
710 cplus_array_htab
= htab_create_ggc (61, &cplus_array_hash
,
711 &cplus_array_compare
, NULL
);
713 hash
= TYPE_UID (elt_type
);
715 hash
^= TYPE_UID (index_type
);
717 cai
.domain
= index_type
;
719 e
= htab_find_slot_with_hash (cplus_array_htab
, &cai
, hash
, INSERT
);
721 /* We have found the type: we're done. */
725 /* Build a new array type. */
726 t
= cxx_make_type (ARRAY_TYPE
);
727 TREE_TYPE (t
) = elt_type
;
728 TYPE_DOMAIN (t
) = index_type
;
730 /* Store it in the hash table. */
733 /* Set the canonical type for this new node. */
734 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
735 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
736 SET_TYPE_STRUCTURAL_EQUALITY (t
);
737 else if (TYPE_CANONICAL (elt_type
) != elt_type
739 && TYPE_CANONICAL (index_type
) != index_type
))
741 = build_cplus_array_type
742 (TYPE_CANONICAL (elt_type
),
743 index_type
? TYPE_CANONICAL (index_type
) : index_type
);
745 TYPE_CANONICAL (t
) = t
;
749 t
= build_array_type (elt_type
, index_type
);
751 /* We want TYPE_MAIN_VARIANT of an array to strip cv-quals from the
752 element type as well, so fix it up if needed. */
753 if (elt_type
!= TYPE_MAIN_VARIANT (elt_type
))
755 tree m
= build_cplus_array_type (TYPE_MAIN_VARIANT (elt_type
),
757 if (TYPE_MAIN_VARIANT (t
) != m
)
759 TYPE_MAIN_VARIANT (t
) = m
;
760 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
761 TYPE_NEXT_VARIANT (m
) = t
;
765 /* Push these needs up so that initialization takes place
767 TYPE_NEEDS_CONSTRUCTING (t
)
768 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (elt_type
));
769 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
770 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (elt_type
));
774 /* Return an ARRAY_TYPE with element type ELT and length N. */
777 build_array_of_n_type (tree elt
, int n
)
779 return build_cplus_array_type (elt
, build_index_type (size_int (n
- 1)));
782 /* Return a reference type node referring to TO_TYPE. If RVAL is
783 true, return an rvalue reference type, otherwise return an lvalue
784 reference type. If a type node exists, reuse it, otherwise create
787 cp_build_reference_type (tree to_type
, bool rval
)
790 lvalue_ref
= build_reference_type (to_type
);
794 /* This code to create rvalue reference types is based on and tied
795 to the code creating lvalue reference types in the middle-end
796 functions build_reference_type_for_mode and build_reference_type.
798 It works by putting the rvalue reference type nodes after the
799 lvalue reference nodes in the TYPE_NEXT_REF_TO linked list, so
800 they will effectively be ignored by the middle end. */
802 for (t
= lvalue_ref
; (t
= TYPE_NEXT_REF_TO (t
)); )
803 if (TYPE_REF_IS_RVALUE (t
))
806 t
= build_distinct_type_copy (lvalue_ref
);
808 TYPE_REF_IS_RVALUE (t
) = true;
809 TYPE_NEXT_REF_TO (t
) = TYPE_NEXT_REF_TO (lvalue_ref
);
810 TYPE_NEXT_REF_TO (lvalue_ref
) = t
;
812 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
813 SET_TYPE_STRUCTURAL_EQUALITY (t
);
814 else if (TYPE_CANONICAL (to_type
) != to_type
)
816 = cp_build_reference_type (TYPE_CANONICAL (to_type
), rval
);
818 TYPE_CANONICAL (t
) = t
;
826 /* Returns EXPR cast to rvalue reference type, like std::move. */
831 tree type
= TREE_TYPE (expr
);
832 gcc_assert (TREE_CODE (type
) != REFERENCE_TYPE
);
833 type
= cp_build_reference_type (type
, /*rval*/true);
834 return build_static_cast (type
, expr
, tf_warning_or_error
);
837 /* Used by the C++ front end to build qualified array types. However,
838 the C version of this function does not properly maintain canonical
839 types (which are not used in C). */
841 c_build_qualified_type (tree type
, int type_quals
)
843 return cp_build_qualified_type (type
, type_quals
);
847 /* Make a variant of TYPE, qualified with the TYPE_QUALS. Handles
848 arrays correctly. In particular, if TYPE is an array of T's, and
849 TYPE_QUALS is non-empty, returns an array of qualified T's.
851 FLAGS determines how to deal with ill-formed qualifications. If
852 tf_ignore_bad_quals is set, then bad qualifications are dropped
853 (this is permitted if TYPE was introduced via a typedef or template
854 type parameter). If bad qualifications are dropped and tf_warning
855 is set, then a warning is issued for non-const qualifications. If
856 tf_ignore_bad_quals is not set and tf_error is not set, we
857 return error_mark_node. Otherwise, we issue an error, and ignore
860 Qualification of a reference type is valid when the reference came
861 via a typedef or template type argument. [dcl.ref] No such
862 dispensation is provided for qualifying a function type. [dcl.fct]
863 DR 295 queries this and the proposed resolution brings it into line
864 with qualifying a reference. We implement the DR. We also behave
865 in a similar manner for restricting non-pointer types. */
868 cp_build_qualified_type_real (tree type
,
870 tsubst_flags_t complain
)
873 int bad_quals
= TYPE_UNQUALIFIED
;
875 if (type
== error_mark_node
)
878 if (type_quals
== cp_type_quals (type
))
881 if (TREE_CODE (type
) == ARRAY_TYPE
)
883 /* In C++, the qualification really applies to the array element
884 type. Obtain the appropriately qualified element type. */
887 = cp_build_qualified_type_real (TREE_TYPE (type
),
891 if (element_type
== error_mark_node
)
892 return error_mark_node
;
894 /* See if we already have an identically qualified type. Tests
895 should be equivalent to those in check_qualified_type. */
896 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
897 if (TREE_TYPE (t
) == element_type
898 && TYPE_NAME (t
) == TYPE_NAME (type
)
899 && TYPE_CONTEXT (t
) == TYPE_CONTEXT (type
)
900 && attribute_list_equal (TYPE_ATTRIBUTES (t
),
901 TYPE_ATTRIBUTES (type
)))
906 t
= build_cplus_array_type (element_type
, TYPE_DOMAIN (type
));
908 /* Keep the typedef name. */
909 if (TYPE_NAME (t
) != TYPE_NAME (type
))
911 t
= build_variant_type_copy (t
);
912 TYPE_NAME (t
) = TYPE_NAME (type
);
916 /* Even if we already had this variant, we update
917 TYPE_NEEDS_CONSTRUCTING and TYPE_HAS_NONTRIVIAL_DESTRUCTOR in case
918 they changed since the variant was originally created.
920 This seems hokey; if there is some way to use a previous
921 variant *without* coming through here,
922 TYPE_NEEDS_CONSTRUCTING will never be updated. */
923 TYPE_NEEDS_CONSTRUCTING (t
)
924 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (element_type
));
925 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
926 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (element_type
));
929 else if (TYPE_PTRMEMFUNC_P (type
))
931 /* For a pointer-to-member type, we can't just return a
932 cv-qualified version of the RECORD_TYPE. If we do, we
933 haven't changed the field that contains the actual pointer to
934 a method, and so TYPE_PTRMEMFUNC_FN_TYPE will be wrong. */
937 t
= TYPE_PTRMEMFUNC_FN_TYPE (type
);
938 t
= cp_build_qualified_type_real (t
, type_quals
, complain
);
939 return build_ptrmemfunc_type (t
);
941 else if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
943 tree t
= PACK_EXPANSION_PATTERN (type
);
945 t
= cp_build_qualified_type_real (t
, type_quals
, complain
);
946 return make_pack_expansion (t
);
949 /* A reference or method type shall not be cv-qualified.
950 [dcl.ref], [dcl.fct]. This used to be an error, but as of DR 295
951 (in CD1) we always ignore extra cv-quals on functions. */
952 if (type_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)
953 && (TREE_CODE (type
) == REFERENCE_TYPE
954 || TREE_CODE (type
) == FUNCTION_TYPE
955 || TREE_CODE (type
) == METHOD_TYPE
))
957 if (TREE_CODE (type
) == REFERENCE_TYPE
)
958 bad_quals
|= type_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
959 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
962 /* But preserve any function-cv-quals on a FUNCTION_TYPE. */
963 if (TREE_CODE (type
) == FUNCTION_TYPE
)
964 type_quals
|= type_memfn_quals (type
);
966 /* A restrict-qualified type must be a pointer (or reference)
967 to object or incomplete type. */
968 if ((type_quals
& TYPE_QUAL_RESTRICT
)
969 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
970 && TREE_CODE (type
) != TYPENAME_TYPE
971 && !POINTER_TYPE_P (type
))
973 bad_quals
|= TYPE_QUAL_RESTRICT
;
974 type_quals
&= ~TYPE_QUAL_RESTRICT
;
977 if (bad_quals
== TYPE_UNQUALIFIED
978 || (complain
& tf_ignore_bad_quals
))
980 else if (!(complain
& tf_error
))
981 return error_mark_node
;
984 tree bad_type
= build_qualified_type (ptr_type_node
, bad_quals
);
985 error ("%qV qualifiers cannot be applied to %qT",
989 /* Retrieve (or create) the appropriately qualified variant. */
990 result
= build_qualified_type (type
, type_quals
);
992 /* If this was a pointer-to-method type, and we just made a copy,
993 then we need to unshare the record that holds the cached
994 pointer-to-member-function type, because these will be distinct
995 between the unqualified and qualified types. */
997 && TREE_CODE (type
) == POINTER_TYPE
998 && TREE_CODE (TREE_TYPE (type
)) == METHOD_TYPE
999 && TYPE_LANG_SPECIFIC (result
) == TYPE_LANG_SPECIFIC (type
))
1000 TYPE_LANG_SPECIFIC (result
) = NULL
;
1002 /* We may also have ended up building a new copy of the canonical
1003 type of a pointer-to-method type, which could have the same
1004 sharing problem described above. */
1005 if (TYPE_CANONICAL (result
) != TYPE_CANONICAL (type
)
1006 && TREE_CODE (type
) == POINTER_TYPE
1007 && TREE_CODE (TREE_TYPE (type
)) == METHOD_TYPE
1008 && (TYPE_LANG_SPECIFIC (TYPE_CANONICAL (result
))
1009 == TYPE_LANG_SPECIFIC (TYPE_CANONICAL (type
))))
1010 TYPE_LANG_SPECIFIC (TYPE_CANONICAL (result
)) = NULL
;
1015 /* Return TYPE with const and volatile removed. */
1018 cv_unqualified (tree type
)
1022 if (type
== error_mark_node
)
1025 quals
= cp_type_quals (type
);
1026 quals
&= ~(TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
);
1027 return cp_build_qualified_type (type
, quals
);
1030 /* Builds a qualified variant of T that is not a typedef variant.
1031 E.g. consider the following declarations:
1032 typedef const int ConstInt;
1033 typedef ConstInt* PtrConstInt;
1034 If T is PtrConstInt, this function returns a type representing
1036 In other words, if T is a typedef, the function returns the underlying type.
1037 The cv-qualification and attributes of the type returned match the
1039 They will always be compatible types.
1040 The returned type is built so that all of its subtypes
1041 recursively have their typedefs stripped as well.
1043 This is different from just returning TYPE_CANONICAL (T)
1044 Because of several reasons:
1045 * If T is a type that needs structural equality
1046 its TYPE_CANONICAL (T) will be NULL.
1047 * TYPE_CANONICAL (T) desn't carry type attributes
1048 and looses template parameter names. */
1051 strip_typedefs (tree t
)
1053 tree result
= NULL
, type
= NULL
, t0
= NULL
;
1055 if (!t
|| t
== error_mark_node
|| t
== TYPE_CANONICAL (t
))
1058 gcc_assert (TYPE_P (t
));
1060 switch (TREE_CODE (t
))
1063 type
= strip_typedefs (TREE_TYPE (t
));
1064 result
= build_pointer_type (type
);
1066 case REFERENCE_TYPE
:
1067 type
= strip_typedefs (TREE_TYPE (t
));
1068 result
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
1071 t0
= strip_typedefs (TYPE_OFFSET_BASETYPE (t
));
1072 type
= strip_typedefs (TREE_TYPE (t
));
1073 result
= build_offset_type (t0
, type
);
1076 if (TYPE_PTRMEMFUNC_P (t
))
1078 t0
= strip_typedefs (TYPE_PTRMEMFUNC_FN_TYPE (t
));
1079 result
= build_ptrmemfunc_type (t0
);
1083 type
= strip_typedefs (TREE_TYPE (t
));
1084 t0
= strip_typedefs (TYPE_DOMAIN (t
));;
1085 result
= build_cplus_array_type (type
, t0
);
1090 tree arg_types
= NULL
, arg_node
, arg_type
;
1091 for (arg_node
= TYPE_ARG_TYPES (t
);
1093 arg_node
= TREE_CHAIN (arg_node
))
1095 if (arg_node
== void_list_node
)
1097 arg_type
= strip_typedefs (TREE_VALUE (arg_node
));
1098 gcc_assert (arg_type
);
1101 tree_cons (TREE_PURPOSE (arg_node
), arg_type
, arg_types
);
1105 arg_types
= nreverse (arg_types
);
1107 /* A list of parameters not ending with an ellipsis
1108 must end with void_list_node. */
1110 arg_types
= chainon (arg_types
, void_list_node
);
1112 type
= strip_typedefs (TREE_TYPE (t
));
1113 if (TREE_CODE (t
) == METHOD_TYPE
)
1115 tree class_type
= TREE_TYPE (TREE_VALUE (arg_types
));
1116 gcc_assert (class_type
);
1118 build_method_type_directly (class_type
, type
,
1119 TREE_CHAIN (arg_types
));
1123 result
= build_function_type (type
,
1125 result
= apply_memfn_quals (result
, type_memfn_quals (t
));
1128 if (TYPE_RAISES_EXCEPTIONS (t
))
1129 result
= build_exception_variant (result
,
1130 TYPE_RAISES_EXCEPTIONS (t
));
1134 result
= make_typename_type (strip_typedefs (TYPE_CONTEXT (t
)),
1135 TYPENAME_TYPE_FULLNAME (t
),
1136 typename_type
, tf_none
);
1143 result
= TYPE_MAIN_VARIANT (t
);
1144 if (TYPE_ATTRIBUTES (t
))
1145 result
= cp_build_type_attribute_variant (result
, TYPE_ATTRIBUTES (t
));
1146 return cp_build_qualified_type (result
, cp_type_quals (t
));
1149 /* Makes a copy of BINFO and TYPE, which is to be inherited into a
1150 graph dominated by T. If BINFO is NULL, TYPE is a dependent base,
1151 and we do a shallow copy. If BINFO is non-NULL, we do a deep copy.
1152 VIRT indicates whether TYPE is inherited virtually or not.
1153 IGO_PREV points at the previous binfo of the inheritance graph
1154 order chain. The newly copied binfo's TREE_CHAIN forms this
1157 The CLASSTYPE_VBASECLASSES vector of T is constructed in the
1158 correct order. That is in the order the bases themselves should be
1161 The BINFO_INHERITANCE of a virtual base class points to the binfo
1162 of the most derived type. ??? We could probably change this so that
1163 BINFO_INHERITANCE becomes synonymous with BINFO_PRIMARY, and hence
1164 remove a field. They currently can only differ for primary virtual
1168 copy_binfo (tree binfo
, tree type
, tree t
, tree
*igo_prev
, int virt
)
1174 /* See if we've already made this virtual base. */
1175 new_binfo
= binfo_for_vbase (type
, t
);
1180 new_binfo
= make_tree_binfo (binfo
? BINFO_N_BASE_BINFOS (binfo
) : 0);
1181 BINFO_TYPE (new_binfo
) = type
;
1183 /* Chain it into the inheritance graph. */
1184 TREE_CHAIN (*igo_prev
) = new_binfo
;
1185 *igo_prev
= new_binfo
;
1192 gcc_assert (!BINFO_DEPENDENT_BASE_P (binfo
));
1193 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), type
));
1195 BINFO_OFFSET (new_binfo
) = BINFO_OFFSET (binfo
);
1196 BINFO_VIRTUALS (new_binfo
) = BINFO_VIRTUALS (binfo
);
1198 /* We do not need to copy the accesses, as they are read only. */
1199 BINFO_BASE_ACCESSES (new_binfo
) = BINFO_BASE_ACCESSES (binfo
);
1201 /* Recursively copy base binfos of BINFO. */
1202 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ix
++)
1204 tree new_base_binfo
;
1206 gcc_assert (!BINFO_DEPENDENT_BASE_P (base_binfo
));
1207 new_base_binfo
= copy_binfo (base_binfo
, BINFO_TYPE (base_binfo
),
1209 BINFO_VIRTUAL_P (base_binfo
));
1211 if (!BINFO_INHERITANCE_CHAIN (new_base_binfo
))
1212 BINFO_INHERITANCE_CHAIN (new_base_binfo
) = new_binfo
;
1213 BINFO_BASE_APPEND (new_binfo
, new_base_binfo
);
1217 BINFO_DEPENDENT_BASE_P (new_binfo
) = 1;
1221 /* Push it onto the list after any virtual bases it contains
1222 will have been pushed. */
1223 VEC_quick_push (tree
, CLASSTYPE_VBASECLASSES (t
), new_binfo
);
1224 BINFO_VIRTUAL_P (new_binfo
) = 1;
1225 BINFO_INHERITANCE_CHAIN (new_binfo
) = TYPE_BINFO (t
);
1231 /* Hashing of lists so that we don't make duplicates.
1232 The entry point is `list_hash_canon'. */
1234 /* Now here is the hash table. When recording a list, it is added
1235 to the slot whose index is the hash code mod the table size.
1236 Note that the hash table is used for several kinds of lists.
1237 While all these live in the same table, they are completely independent,
1238 and the hash code is computed differently for each of these. */
1240 static GTY ((param_is (union tree_node
))) htab_t list_hash_table
;
1249 /* Compare ENTRY (an entry in the hash table) with DATA (a list_proxy
1250 for a node we are thinking about adding). */
1253 list_hash_eq (const void* entry
, const void* data
)
1255 const_tree
const t
= (const_tree
) entry
;
1256 const struct list_proxy
*const proxy
= (const struct list_proxy
*) data
;
1258 return (TREE_VALUE (t
) == proxy
->value
1259 && TREE_PURPOSE (t
) == proxy
->purpose
1260 && TREE_CHAIN (t
) == proxy
->chain
);
1263 /* Compute a hash code for a list (chain of TREE_LIST nodes
1264 with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the
1265 TREE_COMMON slots), by adding the hash codes of the individual entries. */
1268 list_hash_pieces (tree purpose
, tree value
, tree chain
)
1270 hashval_t hashcode
= 0;
1273 hashcode
+= TREE_HASH (chain
);
1276 hashcode
+= TREE_HASH (value
);
1280 hashcode
+= TREE_HASH (purpose
);
1286 /* Hash an already existing TREE_LIST. */
1289 list_hash (const void* p
)
1291 const_tree
const t
= (const_tree
) p
;
1292 return list_hash_pieces (TREE_PURPOSE (t
),
1297 /* Given list components PURPOSE, VALUE, AND CHAIN, return the canonical
1298 object for an identical list if one already exists. Otherwise, build a
1299 new one, and record it as the canonical object. */
1302 hash_tree_cons (tree purpose
, tree value
, tree chain
)
1306 struct list_proxy proxy
;
1308 /* Hash the list node. */
1309 hashcode
= list_hash_pieces (purpose
, value
, chain
);
1310 /* Create a proxy for the TREE_LIST we would like to create. We
1311 don't actually create it so as to avoid creating garbage. */
1312 proxy
.purpose
= purpose
;
1313 proxy
.value
= value
;
1314 proxy
.chain
= chain
;
1315 /* See if it is already in the table. */
1316 slot
= htab_find_slot_with_hash (list_hash_table
, &proxy
, hashcode
,
1318 /* If not, create a new node. */
1320 *slot
= tree_cons (purpose
, value
, chain
);
1321 return (tree
) *slot
;
1324 /* Constructor for hashed lists. */
1327 hash_tree_chain (tree value
, tree chain
)
1329 return hash_tree_cons (NULL_TREE
, value
, chain
);
1333 debug_binfo (tree elem
)
1338 fprintf (stderr
, "type \"%s\", offset = " HOST_WIDE_INT_PRINT_DEC
1340 TYPE_NAME_STRING (BINFO_TYPE (elem
)),
1341 TREE_INT_CST_LOW (BINFO_OFFSET (elem
)));
1342 debug_tree (BINFO_TYPE (elem
));
1343 if (BINFO_VTABLE (elem
))
1344 fprintf (stderr
, "vtable decl \"%s\"\n",
1345 IDENTIFIER_POINTER (DECL_NAME (get_vtbl_decl_for_binfo (elem
))));
1347 fprintf (stderr
, "no vtable decl yet\n");
1348 fprintf (stderr
, "virtuals:\n");
1349 virtuals
= BINFO_VIRTUALS (elem
);
1354 tree fndecl
= TREE_VALUE (virtuals
);
1355 fprintf (stderr
, "%s [%ld =? %ld]\n",
1356 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl
)),
1357 (long) n
, (long) TREE_INT_CST_LOW (DECL_VINDEX (fndecl
)));
1359 virtuals
= TREE_CHAIN (virtuals
);
1363 /* Build a representation for the qualified name SCOPE::NAME. TYPE is
1364 the type of the result expression, if known, or NULL_TREE if the
1365 resulting expression is type-dependent. If TEMPLATE_P is true,
1366 NAME is known to be a template because the user explicitly used the
1367 "template" keyword after the "::".
1369 All SCOPE_REFs should be built by use of this function. */
1372 build_qualified_name (tree type
, tree scope
, tree name
, bool template_p
)
1375 if (type
== error_mark_node
1376 || scope
== error_mark_node
1377 || name
== error_mark_node
)
1378 return error_mark_node
;
1379 t
= build2 (SCOPE_REF
, type
, scope
, name
);
1380 QUALIFIED_NAME_IS_TEMPLATE (t
) = template_p
;
1382 t
= convert_from_reference (t
);
1386 /* Returns nonzero if X is an expression for a (possibly overloaded)
1387 function. If "f" is a function or function template, "f", "c->f",
1388 "c.f", "C::f", and "f<int>" will all be considered possibly
1389 overloaded functions. Returns 2 if the function is actually
1390 overloaded, i.e., if it is impossible to know the type of the
1391 function without performing overload resolution. */
1394 is_overloaded_fn (tree x
)
1396 /* A baselink is also considered an overloaded function. */
1397 if (TREE_CODE (x
) == OFFSET_REF
1398 || TREE_CODE (x
) == COMPONENT_REF
)
1399 x
= TREE_OPERAND (x
, 1);
1401 x
= BASELINK_FUNCTIONS (x
);
1402 if (TREE_CODE (x
) == TEMPLATE_ID_EXPR
)
1403 x
= TREE_OPERAND (x
, 0);
1404 if (DECL_FUNCTION_TEMPLATE_P (OVL_CURRENT (x
))
1405 || (TREE_CODE (x
) == OVERLOAD
&& OVL_CHAIN (x
)))
1407 return (TREE_CODE (x
) == FUNCTION_DECL
1408 || TREE_CODE (x
) == OVERLOAD
);
1411 /* Returns true iff X is an expression for an overloaded function
1412 whose type cannot be known without performing overload
1416 really_overloaded_fn (tree x
)
1418 return is_overloaded_fn (x
) == 2;
1424 gcc_assert (is_overloaded_fn (from
));
1425 /* A baselink is also considered an overloaded function. */
1426 if (TREE_CODE (from
) == OFFSET_REF
1427 || TREE_CODE (from
) == COMPONENT_REF
)
1428 from
= TREE_OPERAND (from
, 1);
1429 if (BASELINK_P (from
))
1430 from
= BASELINK_FUNCTIONS (from
);
1431 if (TREE_CODE (from
) == TEMPLATE_ID_EXPR
)
1432 from
= TREE_OPERAND (from
, 0);
1437 get_first_fn (tree from
)
1439 return OVL_CURRENT (get_fns (from
));
1442 /* Return a new OVL node, concatenating it with the old one. */
1445 ovl_cons (tree decl
, tree chain
)
1447 tree result
= make_node (OVERLOAD
);
1448 TREE_TYPE (result
) = unknown_type_node
;
1449 OVL_FUNCTION (result
) = decl
;
1450 TREE_CHAIN (result
) = chain
;
1455 /* Build a new overloaded function. If this is the first one,
1456 just return it; otherwise, ovl_cons the _DECLs */
1459 build_overload (tree decl
, tree chain
)
1461 if (! chain
&& TREE_CODE (decl
) != TEMPLATE_DECL
)
1463 if (chain
&& TREE_CODE (chain
) != OVERLOAD
)
1464 chain
= ovl_cons (chain
, NULL_TREE
);
1465 return ovl_cons (decl
, chain
);
1469 #define PRINT_RING_SIZE 4
1472 cxx_printable_name_internal (tree decl
, int v
, bool translate
)
1474 static unsigned int uid_ring
[PRINT_RING_SIZE
];
1475 static char *print_ring
[PRINT_RING_SIZE
];
1476 static bool trans_ring
[PRINT_RING_SIZE
];
1477 static int ring_counter
;
1480 /* Only cache functions. */
1482 || TREE_CODE (decl
) != FUNCTION_DECL
1483 || DECL_LANG_SPECIFIC (decl
) == 0)
1484 return lang_decl_name (decl
, v
, translate
);
1486 /* See if this print name is lying around. */
1487 for (i
= 0; i
< PRINT_RING_SIZE
; i
++)
1488 if (uid_ring
[i
] == DECL_UID (decl
) && translate
== trans_ring
[i
])
1489 /* yes, so return it. */
1490 return print_ring
[i
];
1492 if (++ring_counter
== PRINT_RING_SIZE
)
1495 if (current_function_decl
!= NULL_TREE
)
1497 /* There may be both translated and untranslated versions of the
1499 for (i
= 0; i
< 2; i
++)
1501 if (uid_ring
[ring_counter
] == DECL_UID (current_function_decl
))
1503 if (ring_counter
== PRINT_RING_SIZE
)
1506 gcc_assert (uid_ring
[ring_counter
] != DECL_UID (current_function_decl
));
1509 if (print_ring
[ring_counter
])
1510 free (print_ring
[ring_counter
]);
1512 print_ring
[ring_counter
] = xstrdup (lang_decl_name (decl
, v
, translate
));
1513 uid_ring
[ring_counter
] = DECL_UID (decl
);
1514 trans_ring
[ring_counter
] = translate
;
1515 return print_ring
[ring_counter
];
1519 cxx_printable_name (tree decl
, int v
)
1521 return cxx_printable_name_internal (decl
, v
, false);
1525 cxx_printable_name_translate (tree decl
, int v
)
1527 return cxx_printable_name_internal (decl
, v
, true);
1530 /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions
1531 listed in RAISES. */
1534 build_exception_variant (tree type
, tree raises
)
1539 if (comp_except_specs (raises
, TYPE_RAISES_EXCEPTIONS (type
), ce_exact
))
1542 type_quals
= TYPE_QUALS (type
);
1543 for (v
= TYPE_MAIN_VARIANT (type
); v
; v
= TYPE_NEXT_VARIANT (v
))
1544 if (check_qualified_type (v
, type
, type_quals
)
1545 && comp_except_specs (raises
, TYPE_RAISES_EXCEPTIONS (v
), ce_exact
))
1548 /* Need to build a new variant. */
1549 v
= build_variant_type_copy (type
);
1550 TYPE_RAISES_EXCEPTIONS (v
) = raises
;
1554 /* Given a TEMPLATE_TEMPLATE_PARM node T, create a new
1555 BOUND_TEMPLATE_TEMPLATE_PARM bound with NEWARGS as its template
1559 bind_template_template_parm (tree t
, tree newargs
)
1561 tree decl
= TYPE_NAME (t
);
1564 t2
= cxx_make_type (BOUND_TEMPLATE_TEMPLATE_PARM
);
1565 decl
= build_decl (input_location
,
1566 TYPE_DECL
, DECL_NAME (decl
), NULL_TREE
);
1568 /* These nodes have to be created to reflect new TYPE_DECL and template
1570 TEMPLATE_TYPE_PARM_INDEX (t2
) = copy_node (TEMPLATE_TYPE_PARM_INDEX (t
));
1571 TEMPLATE_PARM_DECL (TEMPLATE_TYPE_PARM_INDEX (t2
)) = decl
;
1572 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2
)
1573 = build_template_info (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t
), newargs
);
1575 TREE_TYPE (decl
) = t2
;
1576 TYPE_NAME (t2
) = decl
;
1577 TYPE_STUB_DECL (t2
) = decl
;
1579 SET_TYPE_STRUCTURAL_EQUALITY (t2
);
1584 /* Called from count_trees via walk_tree. */
1587 count_trees_r (tree
*tp
, int *walk_subtrees
, void *data
)
1597 /* Debugging function for measuring the rough complexity of a tree
1601 count_trees (tree t
)
1604 cp_walk_tree_without_duplicates (&t
, count_trees_r
, &n_trees
);
1608 /* Called from verify_stmt_tree via walk_tree. */
1611 verify_stmt_tree_r (tree
* tp
,
1612 int* walk_subtrees ATTRIBUTE_UNUSED
,
1616 htab_t
*statements
= (htab_t
*) data
;
1619 if (!STATEMENT_CODE_P (TREE_CODE (t
)))
1622 /* If this statement is already present in the hash table, then
1623 there is a circularity in the statement tree. */
1624 gcc_assert (!htab_find (*statements
, t
));
1626 slot
= htab_find_slot (*statements
, t
, INSERT
);
1632 /* Debugging function to check that the statement T has not been
1633 corrupted. For now, this function simply checks that T contains no
1637 verify_stmt_tree (tree t
)
1640 statements
= htab_create (37, htab_hash_pointer
, htab_eq_pointer
, NULL
);
1641 cp_walk_tree (&t
, verify_stmt_tree_r
, &statements
, NULL
);
1642 htab_delete (statements
);
1645 /* Check if the type T depends on a type with no linkage and if so, return
1646 it. If RELAXED_P then do not consider a class type declared within
1647 a vague-linkage function to have no linkage. */
1650 no_linkage_check (tree t
, bool relaxed_p
)
1654 /* There's no point in checking linkage on template functions; we
1655 can't know their complete types. */
1656 if (processing_template_decl
)
1659 switch (TREE_CODE (t
))
1662 if (TYPE_PTRMEMFUNC_P (t
))
1664 /* Lambda types that don't have mangling scope have no linkage. We
1665 check CLASSTYPE_LAMBDA_EXPR here rather than LAMBDA_TYPE_P because
1666 when we get here from pushtag none of the lambda information is
1667 set up yet, so we want to assume that the lambda has linkage and
1668 fix it up later if not. */
1669 if (CLASSTYPE_LAMBDA_EXPR (t
)
1670 && LAMBDA_TYPE_EXTRA_SCOPE (t
) == NULL_TREE
)
1674 if (!CLASS_TYPE_P (t
))
1678 /* Only treat anonymous types as having no linkage if they're at
1679 namespace scope. This is core issue 966. */
1680 if (TYPE_ANONYMOUS_P (t
) && TYPE_NAMESPACE_SCOPE_P (t
))
1683 for (r
= CP_TYPE_CONTEXT (t
); ; )
1685 /* If we're a nested type of a !TREE_PUBLIC class, we might not
1686 have linkage, or we might just be in an anonymous namespace.
1687 If we're in a TREE_PUBLIC class, we have linkage. */
1688 if (TYPE_P (r
) && !TREE_PUBLIC (TYPE_NAME (r
)))
1689 return no_linkage_check (TYPE_CONTEXT (t
), relaxed_p
);
1690 else if (TREE_CODE (r
) == FUNCTION_DECL
)
1692 if (!relaxed_p
|| !vague_linkage_p (r
))
1695 r
= CP_DECL_CONTEXT (r
);
1705 case REFERENCE_TYPE
:
1706 return no_linkage_check (TREE_TYPE (t
), relaxed_p
);
1710 r
= no_linkage_check (TYPE_PTRMEM_POINTED_TO_TYPE (t
),
1714 return no_linkage_check (TYPE_PTRMEM_CLASS_TYPE (t
), relaxed_p
);
1717 r
= no_linkage_check (TYPE_METHOD_BASETYPE (t
), relaxed_p
);
1724 for (parm
= TYPE_ARG_TYPES (t
);
1725 parm
&& parm
!= void_list_node
;
1726 parm
= TREE_CHAIN (parm
))
1728 r
= no_linkage_check (TREE_VALUE (parm
), relaxed_p
);
1732 return no_linkage_check (TREE_TYPE (t
), relaxed_p
);
1740 #ifdef GATHER_STATISTICS
1741 extern int depth_reached
;
1745 cxx_print_statistics (void)
1747 print_search_statistics ();
1748 print_class_statistics ();
1749 print_template_statistics ();
1750 #ifdef GATHER_STATISTICS
1751 fprintf (stderr
, "maximum template instantiation depth reached: %d\n",
1756 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1757 (which is an ARRAY_TYPE). This counts only elements of the top
1761 array_type_nelts_top (tree type
)
1763 return fold_build2_loc (input_location
,
1764 PLUS_EXPR
, sizetype
,
1765 array_type_nelts (type
),
1769 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1770 (which is an ARRAY_TYPE). This one is a recursive count of all
1771 ARRAY_TYPEs that are clumped together. */
1774 array_type_nelts_total (tree type
)
1776 tree sz
= array_type_nelts_top (type
);
1777 type
= TREE_TYPE (type
);
1778 while (TREE_CODE (type
) == ARRAY_TYPE
)
1780 tree n
= array_type_nelts_top (type
);
1781 sz
= fold_build2_loc (input_location
,
1782 MULT_EXPR
, sizetype
, sz
, n
);
1783 type
= TREE_TYPE (type
);
1788 /* Called from break_out_target_exprs via mapcar. */
1791 bot_manip (tree
* tp
, int* walk_subtrees
, void* data
)
1793 splay_tree target_remap
= ((splay_tree
) data
);
1796 if (!TYPE_P (t
) && TREE_CONSTANT (t
) && !TREE_SIDE_EFFECTS (t
))
1798 /* There can't be any TARGET_EXPRs or their slot variables below
1803 if (TREE_CODE (t
) == TARGET_EXPR
)
1807 if (TREE_CODE (TREE_OPERAND (t
, 1)) == AGGR_INIT_EXPR
)
1808 u
= build_cplus_new (TREE_TYPE (t
), TREE_OPERAND (t
, 1));
1810 u
= build_target_expr_with_type (TREE_OPERAND (t
, 1), TREE_TYPE (t
));
1812 /* Map the old variable to the new one. */
1813 splay_tree_insert (target_remap
,
1814 (splay_tree_key
) TREE_OPERAND (t
, 0),
1815 (splay_tree_value
) TREE_OPERAND (u
, 0));
1817 TREE_OPERAND (u
, 1) = break_out_target_exprs (TREE_OPERAND (u
, 1));
1819 /* Replace the old expression with the new version. */
1821 /* We don't have to go below this point; the recursive call to
1822 break_out_target_exprs will have handled anything below this
1828 /* Make a copy of this node. */
1829 return copy_tree_r (tp
, walk_subtrees
, NULL
);
1832 /* Replace all remapped VAR_DECLs in T with their new equivalents.
1833 DATA is really a splay-tree mapping old variables to new
1837 bot_replace (tree
* t
,
1838 int* walk_subtrees ATTRIBUTE_UNUSED
,
1841 splay_tree target_remap
= ((splay_tree
) data
);
1843 if (TREE_CODE (*t
) == VAR_DECL
)
1845 splay_tree_node n
= splay_tree_lookup (target_remap
,
1846 (splay_tree_key
) *t
);
1848 *t
= (tree
) n
->value
;
1854 /* When we parse a default argument expression, we may create
1855 temporary variables via TARGET_EXPRs. When we actually use the
1856 default-argument expression, we make a copy of the expression, but
1857 we must replace the temporaries with appropriate local versions. */
1860 break_out_target_exprs (tree t
)
1862 static int target_remap_count
;
1863 static splay_tree target_remap
;
1865 if (!target_remap_count
++)
1866 target_remap
= splay_tree_new (splay_tree_compare_pointers
,
1867 /*splay_tree_delete_key_fn=*/NULL
,
1868 /*splay_tree_delete_value_fn=*/NULL
);
1869 cp_walk_tree (&t
, bot_manip
, target_remap
, NULL
);
1870 cp_walk_tree (&t
, bot_replace
, target_remap
, NULL
);
1872 if (!--target_remap_count
)
1874 splay_tree_delete (target_remap
);
1875 target_remap
= NULL
;
1881 /* Similar to `build_nt', but for template definitions of dependent
1885 build_min_nt (enum tree_code code
, ...)
1892 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
1896 t
= make_node (code
);
1897 length
= TREE_CODE_LENGTH (code
);
1899 for (i
= 0; i
< length
; i
++)
1901 tree x
= va_arg (p
, tree
);
1902 TREE_OPERAND (t
, i
) = x
;
1910 /* Similar to `build', but for template definitions. */
1913 build_min (enum tree_code code
, tree tt
, ...)
1920 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
1924 t
= make_node (code
);
1925 length
= TREE_CODE_LENGTH (code
);
1928 for (i
= 0; i
< length
; i
++)
1930 tree x
= va_arg (p
, tree
);
1931 TREE_OPERAND (t
, i
) = x
;
1932 if (x
&& !TYPE_P (x
) && TREE_SIDE_EFFECTS (x
))
1933 TREE_SIDE_EFFECTS (t
) = 1;
1940 /* Similar to `build', but for template definitions of non-dependent
1941 expressions. NON_DEP is the non-dependent expression that has been
1945 build_min_non_dep (enum tree_code code
, tree non_dep
, ...)
1952 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
1954 va_start (p
, non_dep
);
1956 t
= make_node (code
);
1957 length
= TREE_CODE_LENGTH (code
);
1958 TREE_TYPE (t
) = TREE_TYPE (non_dep
);
1959 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (non_dep
);
1961 for (i
= 0; i
< length
; i
++)
1963 tree x
= va_arg (p
, tree
);
1964 TREE_OPERAND (t
, i
) = x
;
1967 if (code
== COMPOUND_EXPR
&& TREE_CODE (non_dep
) != COMPOUND_EXPR
)
1968 /* This should not be considered a COMPOUND_EXPR, because it
1969 resolves to an overload. */
1970 COMPOUND_EXPR_OVERLOADED (t
) = 1;
1976 /* Similar to `build_nt_call_vec', but for template definitions of
1977 non-dependent expressions. NON_DEP is the non-dependent expression
1978 that has been built. */
1981 build_min_non_dep_call_vec (tree non_dep
, tree fn
, VEC(tree
,gc
) *argvec
)
1983 tree t
= build_nt_call_vec (fn
, argvec
);
1984 TREE_TYPE (t
) = TREE_TYPE (non_dep
);
1985 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (non_dep
);
1990 get_type_decl (tree t
)
1992 if (TREE_CODE (t
) == TYPE_DECL
)
1995 return TYPE_STUB_DECL (t
);
1996 gcc_assert (t
== error_mark_node
);
2000 /* Returns the namespace that contains DECL, whether directly or
2004 decl_namespace_context (tree decl
)
2008 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
2010 else if (TYPE_P (decl
))
2011 decl
= CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl
));
2013 decl
= CP_DECL_CONTEXT (decl
);
2017 /* Returns true if decl is within an anonymous namespace, however deeply
2018 nested, or false otherwise. */
2021 decl_anon_ns_mem_p (const_tree decl
)
2025 if (decl
== NULL_TREE
|| decl
== error_mark_node
)
2027 if (TREE_CODE (decl
) == NAMESPACE_DECL
2028 && DECL_NAME (decl
) == NULL_TREE
)
2030 /* Classes and namespaces inside anonymous namespaces have
2031 TREE_PUBLIC == 0, so we can shortcut the search. */
2032 else if (TYPE_P (decl
))
2033 return (TREE_PUBLIC (TYPE_NAME (decl
)) == 0);
2034 else if (TREE_CODE (decl
) == NAMESPACE_DECL
)
2035 return (TREE_PUBLIC (decl
) == 0);
2037 decl
= DECL_CONTEXT (decl
);
2041 /* Return truthvalue of whether T1 is the same tree structure as T2.
2042 Return 1 if they are the same. Return 0 if they are different. */
2045 cp_tree_equal (tree t1
, tree t2
)
2047 enum tree_code code1
, code2
;
2054 for (code1
= TREE_CODE (t1
);
2055 CONVERT_EXPR_CODE_P (code1
)
2056 || code1
== NON_LVALUE_EXPR
;
2057 code1
= TREE_CODE (t1
))
2058 t1
= TREE_OPERAND (t1
, 0);
2059 for (code2
= TREE_CODE (t2
);
2060 CONVERT_EXPR_CODE_P (code2
)
2061 || code1
== NON_LVALUE_EXPR
;
2062 code2
= TREE_CODE (t2
))
2063 t2
= TREE_OPERAND (t2
, 0);
2065 /* They might have become equal now. */
2075 return TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
2076 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
);
2079 return REAL_VALUES_EQUAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
2082 return TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
2083 && !memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
2084 TREE_STRING_LENGTH (t1
));
2087 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
),
2088 TREE_FIXED_CST (t2
));
2091 return cp_tree_equal (TREE_REALPART (t1
), TREE_REALPART (t2
))
2092 && cp_tree_equal (TREE_IMAGPART (t1
), TREE_IMAGPART (t2
));
2095 /* We need to do this when determining whether or not two
2096 non-type pointer to member function template arguments
2098 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
2099 || CONSTRUCTOR_NELTS (t1
) != CONSTRUCTOR_NELTS (t2
))
2104 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t1
), i
, field
, value
)
2106 constructor_elt
*elt2
= CONSTRUCTOR_ELT (t2
, i
);
2107 if (!cp_tree_equal (field
, elt2
->index
)
2108 || !cp_tree_equal (value
, elt2
->value
))
2115 if (!cp_tree_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
)))
2117 if (!cp_tree_equal (TREE_VALUE (t1
), TREE_VALUE (t2
)))
2119 return cp_tree_equal (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
2122 return cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2127 call_expr_arg_iterator iter1
, iter2
;
2128 if (!cp_tree_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
)))
2130 for (arg1
= first_call_expr_arg (t1
, &iter1
),
2131 arg2
= first_call_expr_arg (t2
, &iter2
);
2133 arg1
= next_call_expr_arg (&iter1
),
2134 arg2
= next_call_expr_arg (&iter2
))
2135 if (!cp_tree_equal (arg1
, arg2
))
2144 tree o1
= TREE_OPERAND (t1
, 0);
2145 tree o2
= TREE_OPERAND (t2
, 0);
2147 /* Special case: if either target is an unallocated VAR_DECL,
2148 it means that it's going to be unified with whatever the
2149 TARGET_EXPR is really supposed to initialize, so treat it
2150 as being equivalent to anything. */
2151 if (TREE_CODE (o1
) == VAR_DECL
&& DECL_NAME (o1
) == NULL_TREE
2152 && !DECL_RTL_SET_P (o1
))
2154 else if (TREE_CODE (o2
) == VAR_DECL
&& DECL_NAME (o2
) == NULL_TREE
2155 && !DECL_RTL_SET_P (o2
))
2157 else if (!cp_tree_equal (o1
, o2
))
2160 return cp_tree_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
2163 case WITH_CLEANUP_EXPR
:
2164 if (!cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0)))
2166 return cp_tree_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
2169 if (TREE_OPERAND (t1
, 1) != TREE_OPERAND (t2
, 1))
2171 return cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2174 /* For comparing uses of parameters in late-specified return types
2175 with an out-of-class definition of the function, but can also come
2176 up for expressions that involve 'this' in a member function
2178 if (same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
2180 if (DECL_ARTIFICIAL (t1
) ^ DECL_ARTIFICIAL (t2
))
2182 if (DECL_ARTIFICIAL (t1
)
2183 || (DECL_PARM_LEVEL (t1
) == DECL_PARM_LEVEL (t2
)
2184 && DECL_PARM_INDEX (t1
) == DECL_PARM_INDEX (t2
)))
2193 case IDENTIFIER_NODE
:
2198 return (BASELINK_BINFO (t1
) == BASELINK_BINFO (t2
)
2199 && BASELINK_ACCESS_BINFO (t1
) == BASELINK_ACCESS_BINFO (t2
)
2200 && cp_tree_equal (BASELINK_FUNCTIONS (t1
),
2201 BASELINK_FUNCTIONS (t2
)));
2203 case TEMPLATE_PARM_INDEX
:
2204 if (TEMPLATE_PARM_NUM_SIBLINGS (t1
)
2205 != TEMPLATE_PARM_NUM_SIBLINGS (t2
))
2207 return (TEMPLATE_PARM_IDX (t1
) == TEMPLATE_PARM_IDX (t2
)
2208 && TEMPLATE_PARM_LEVEL (t1
) == TEMPLATE_PARM_LEVEL (t2
)
2209 && (TEMPLATE_PARM_PARAMETER_PACK (t1
)
2210 == TEMPLATE_PARM_PARAMETER_PACK (t2
))
2211 && same_type_p (TREE_TYPE (TEMPLATE_PARM_DECL (t1
)),
2212 TREE_TYPE (TEMPLATE_PARM_DECL (t2
))));
2214 case TEMPLATE_ID_EXPR
:
2219 if (!cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0)))
2221 vec1
= TREE_OPERAND (t1
, 1);
2222 vec2
= TREE_OPERAND (t2
, 1);
2225 return !vec1
&& !vec2
;
2227 if (TREE_VEC_LENGTH (vec1
) != TREE_VEC_LENGTH (vec2
))
2230 for (ix
= TREE_VEC_LENGTH (vec1
); ix
--;)
2231 if (!cp_tree_equal (TREE_VEC_ELT (vec1
, ix
),
2232 TREE_VEC_ELT (vec2
, ix
)))
2241 tree o1
= TREE_OPERAND (t1
, 0);
2242 tree o2
= TREE_OPERAND (t2
, 0);
2244 if (TREE_CODE (o1
) != TREE_CODE (o2
))
2247 return same_type_p (o1
, o2
);
2249 return cp_tree_equal (o1
, o2
);
2254 tree t1_op1
, t2_op1
;
2256 if (!cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0)))
2259 t1_op1
= TREE_OPERAND (t1
, 1);
2260 t2_op1
= TREE_OPERAND (t2
, 1);
2261 if (TREE_CODE (t1_op1
) != TREE_CODE (t2_op1
))
2264 return cp_tree_equal (TREE_OPERAND (t1
, 2), TREE_OPERAND (t2
, 2));
2268 /* Two pointer-to-members are the same if they point to the same
2269 field or function in the same class. */
2270 if (PTRMEM_CST_MEMBER (t1
) != PTRMEM_CST_MEMBER (t2
))
2273 return same_type_p (PTRMEM_CST_CLASS (t1
), PTRMEM_CST_CLASS (t2
));
2276 if (OVL_FUNCTION (t1
) != OVL_FUNCTION (t2
))
2278 return cp_tree_equal (OVL_CHAIN (t1
), OVL_CHAIN (t2
));
2281 if (TRAIT_EXPR_KIND (t1
) != TRAIT_EXPR_KIND (t2
))
2283 return same_type_p (TRAIT_EXPR_TYPE1 (t1
), TRAIT_EXPR_TYPE1 (t2
))
2284 && same_type_p (TRAIT_EXPR_TYPE2 (t1
), TRAIT_EXPR_TYPE2 (t2
));
2287 case STATIC_CAST_EXPR
:
2288 case REINTERPRET_CAST_EXPR
:
2289 case CONST_CAST_EXPR
:
2290 case DYNAMIC_CAST_EXPR
:
2292 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
2294 /* Now compare operands as usual. */
2301 switch (TREE_CODE_CLASS (code1
))
2305 case tcc_comparison
:
2306 case tcc_expression
:
2313 n
= TREE_OPERAND_LENGTH (t1
);
2314 if (TREE_CODE_CLASS (code1
) == tcc_vl_exp
2315 && n
!= TREE_OPERAND_LENGTH (t2
))
2318 for (i
= 0; i
< n
; ++i
)
2319 if (!cp_tree_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
)))
2326 return same_type_p (t1
, t2
);
2330 /* We can get here with --disable-checking. */
2334 /* The type of ARG when used as an lvalue. */
2337 lvalue_type (tree arg
)
2339 tree type
= TREE_TYPE (arg
);
2343 /* The type of ARG for printing error messages; denote lvalues with
2347 error_type (tree arg
)
2349 tree type
= TREE_TYPE (arg
);
2351 if (TREE_CODE (type
) == ARRAY_TYPE
)
2353 else if (TREE_CODE (type
) == ERROR_MARK
)
2355 else if (real_lvalue_p (arg
))
2356 type
= build_reference_type (lvalue_type (arg
));
2357 else if (MAYBE_CLASS_TYPE_P (type
))
2358 type
= lvalue_type (arg
);
2363 /* Does FUNCTION use a variable-length argument list? */
2366 varargs_function_p (const_tree function
)
2368 return stdarg_p (TREE_TYPE (function
));
2371 /* Returns 1 if decl is a member of a class. */
2374 member_p (const_tree decl
)
2376 const_tree
const ctx
= DECL_CONTEXT (decl
);
2377 return (ctx
&& TYPE_P (ctx
));
2380 /* Create a placeholder for member access where we don't actually have an
2381 object that the access is against. */
2384 build_dummy_object (tree type
)
2386 tree decl
= build1 (NOP_EXPR
, build_pointer_type (type
), void_zero_node
);
2387 return cp_build_indirect_ref (decl
, RO_NULL
, tf_warning_or_error
);
2390 /* We've gotten a reference to a member of TYPE. Return *this if appropriate,
2391 or a dummy object otherwise. If BINFOP is non-0, it is filled with the
2392 binfo path from current_class_type to TYPE, or 0. */
2395 maybe_dummy_object (tree type
, tree
* binfop
)
2399 tree current
= current_nonlambda_class_type ();
2402 && (binfo
= lookup_base (current
, type
, ba_any
, NULL
)))
2406 /* Reference from a nested class member function. */
2408 binfo
= TYPE_BINFO (type
);
2414 if (current_class_ref
2415 /* current_class_ref might not correspond to current_class_type if
2416 we're in tsubst_default_argument or a lambda-declarator; in either
2417 case, we want to use current_class_ref if it matches CONTEXT. */
2418 && (same_type_ignoring_top_level_qualifiers_p
2419 (TREE_TYPE (current_class_ref
), context
)))
2420 decl
= current_class_ref
;
2421 else if (current
!= current_class_type
2422 && context
== nonlambda_method_basetype ())
2423 /* In a lambda, need to go through 'this' capture. */
2424 decl
= (cp_build_indirect_ref
2425 ((lambda_expr_this_capture
2426 (CLASSTYPE_LAMBDA_EXPR (current_class_type
))),
2427 RO_NULL
, tf_warning_or_error
));
2429 decl
= build_dummy_object (context
);
2434 /* Returns 1 if OB is a placeholder object, or a pointer to one. */
2437 is_dummy_object (const_tree ob
)
2439 if (TREE_CODE (ob
) == INDIRECT_REF
)
2440 ob
= TREE_OPERAND (ob
, 0);
2441 return (TREE_CODE (ob
) == NOP_EXPR
2442 && TREE_OPERAND (ob
, 0) == void_zero_node
);
2445 /* Returns 1 iff type T is something we want to treat as a scalar type for
2446 the purpose of deciding whether it is trivial/POD/standard-layout. */
2449 scalarish_type_p (const_tree t
)
2451 if (t
== error_mark_node
)
2454 return (SCALAR_TYPE_P (t
)
2455 || TREE_CODE (t
) == VECTOR_TYPE
);
2458 /* Returns true iff T requires non-trivial default initialization. */
2461 type_has_nontrivial_default_init (const_tree t
)
2463 t
= strip_array_types (CONST_CAST_TREE (t
));
2465 if (CLASS_TYPE_P (t
))
2466 return TYPE_HAS_COMPLEX_DFLT (t
);
2471 /* Returns true iff copying an object of type T (including via move
2472 constructor) is non-trivial. That is, T has no non-trivial copy
2473 constructors and no non-trivial move constructors. */
2476 type_has_nontrivial_copy_init (const_tree t
)
2478 t
= strip_array_types (CONST_CAST_TREE (t
));
2480 if (CLASS_TYPE_P (t
))
2482 gcc_assert (COMPLETE_TYPE_P (t
));
2483 return ((TYPE_HAS_COPY_CTOR (t
)
2484 && TYPE_HAS_COMPLEX_COPY_CTOR (t
))
2485 || TYPE_HAS_COMPLEX_MOVE_CTOR (t
));
2491 /* Returns 1 iff type T is a trivially copyable type, as defined in
2492 [basic.types] and [class]. */
2495 trivially_copyable_p (const_tree t
)
2497 t
= strip_array_types (CONST_CAST_TREE (t
));
2499 if (CLASS_TYPE_P (t
))
2500 return ((!TYPE_HAS_COPY_CTOR (t
)
2501 || !TYPE_HAS_COMPLEX_COPY_CTOR (t
))
2502 && !TYPE_HAS_COMPLEX_MOVE_CTOR (t
)
2503 && (!TYPE_HAS_COPY_ASSIGN (t
)
2504 || !TYPE_HAS_COMPLEX_COPY_ASSIGN (t
))
2505 && !TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
)
2506 && TYPE_HAS_TRIVIAL_DESTRUCTOR (t
));
2508 return scalarish_type_p (t
);
2511 /* Returns 1 iff type T is a trivial type, as defined in [basic.types] and
2515 trivial_type_p (const_tree t
)
2517 t
= strip_array_types (CONST_CAST_TREE (t
));
2519 if (CLASS_TYPE_P (t
))
2520 return (TYPE_HAS_TRIVIAL_DFLT (t
)
2521 && trivially_copyable_p (t
));
2523 return scalarish_type_p (t
);
2526 /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */
2529 pod_type_p (const_tree t
)
2531 /* This CONST_CAST is okay because strip_array_types returns its
2532 argument unmodified and we assign it to a const_tree. */
2533 t
= strip_array_types (CONST_CAST_TREE(t
));
2535 if (!CLASS_TYPE_P (t
))
2536 return scalarish_type_p (t
);
2537 else if (cxx_dialect
> cxx98
)
2538 /* [class]/10: A POD struct is a class that is both a trivial class and a
2539 standard-layout class, and has no non-static data members of type
2540 non-POD struct, non-POD union (or array of such types).
2542 We don't need to check individual members because if a member is
2543 non-std-layout or non-trivial, the class will be too. */
2544 return (std_layout_type_p (t
) && trivial_type_p (t
));
2546 /* The C++98 definition of POD is different. */
2547 return !CLASSTYPE_NON_LAYOUT_POD_P (t
);
2550 /* Returns true iff T is POD for the purpose of layout, as defined in the
2554 layout_pod_type_p (const_tree t
)
2556 t
= strip_array_types (CONST_CAST_TREE (t
));
2558 if (CLASS_TYPE_P (t
))
2559 return !CLASSTYPE_NON_LAYOUT_POD_P (t
);
2561 return scalarish_type_p (t
);
2564 /* Returns true iff T is a standard-layout type, as defined in
2568 std_layout_type_p (const_tree t
)
2570 t
= strip_array_types (CONST_CAST_TREE (t
));
2572 if (CLASS_TYPE_P (t
))
2573 return !CLASSTYPE_NON_STD_LAYOUT (t
);
2575 return scalarish_type_p (t
);
2578 /* Nonzero iff type T is a class template implicit specialization. */
2581 class_tmpl_impl_spec_p (const_tree t
)
2583 return CLASS_TYPE_P (t
) && CLASSTYPE_TEMPLATE_INSTANTIATION (t
);
2586 /* Returns 1 iff zero initialization of type T means actually storing
2590 zero_init_p (const_tree t
)
2592 /* This CONST_CAST is okay because strip_array_types returns its
2593 argument unmodified and we assign it to a const_tree. */
2594 t
= strip_array_types (CONST_CAST_TREE(t
));
2596 if (t
== error_mark_node
)
2599 /* NULL pointers to data members are initialized with -1. */
2600 if (TYPE_PTRMEM_P (t
))
2603 /* Classes that contain types that can't be zero-initialized, cannot
2604 be zero-initialized themselves. */
2605 if (CLASS_TYPE_P (t
) && CLASSTYPE_NON_ZERO_INIT_P (t
))
2611 /* Table of valid C++ attributes. */
2612 const struct attribute_spec cxx_attribute_table
[] =
2614 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
2615 affects_type_identity } */
2616 { "java_interface", 0, 0, false, false, false,
2617 handle_java_interface_attribute
, false },
2618 { "com_interface", 0, 0, false, false, false,
2619 handle_com_interface_attribute
, false },
2620 { "init_priority", 1, 1, true, false, false,
2621 handle_init_priority_attribute
, false },
2622 { NULL
, 0, 0, false, false, false, NULL
, false }
2625 /* Handle a "java_interface" attribute; arguments as in
2626 struct attribute_spec.handler. */
2628 handle_java_interface_attribute (tree
* node
,
2630 tree args ATTRIBUTE_UNUSED
,
2635 || !CLASS_TYPE_P (*node
)
2636 || !TYPE_FOR_JAVA (*node
))
2638 error ("%qE attribute can only be applied to Java class definitions",
2640 *no_add_attrs
= true;
2643 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
2644 *node
= build_variant_type_copy (*node
);
2645 TYPE_JAVA_INTERFACE (*node
) = 1;
2650 /* Handle a "com_interface" attribute; arguments as in
2651 struct attribute_spec.handler. */
2653 handle_com_interface_attribute (tree
* node
,
2655 tree args ATTRIBUTE_UNUSED
,
2656 int flags ATTRIBUTE_UNUSED
,
2661 *no_add_attrs
= true;
2664 || !CLASS_TYPE_P (*node
)
2665 || *node
!= TYPE_MAIN_VARIANT (*node
))
2667 warning (OPT_Wattributes
, "%qE attribute can only be applied "
2668 "to class definitions", name
);
2673 warning (0, "%qE is obsolete; g++ vtables are now COM-compatible by default",
2679 /* Handle an "init_priority" attribute; arguments as in
2680 struct attribute_spec.handler. */
2682 handle_init_priority_attribute (tree
* node
,
2685 int flags ATTRIBUTE_UNUSED
,
2688 tree initp_expr
= TREE_VALUE (args
);
2690 tree type
= TREE_TYPE (decl
);
2693 STRIP_NOPS (initp_expr
);
2695 if (!initp_expr
|| TREE_CODE (initp_expr
) != INTEGER_CST
)
2697 error ("requested init_priority is not an integer constant");
2698 *no_add_attrs
= true;
2702 pri
= TREE_INT_CST_LOW (initp_expr
);
2704 type
= strip_array_types (type
);
2706 if (decl
== NULL_TREE
2707 || TREE_CODE (decl
) != VAR_DECL
2708 || !TREE_STATIC (decl
)
2709 || DECL_EXTERNAL (decl
)
2710 || (TREE_CODE (type
) != RECORD_TYPE
2711 && TREE_CODE (type
) != UNION_TYPE
)
2712 /* Static objects in functions are initialized the
2713 first time control passes through that
2714 function. This is not precise enough to pin down an
2715 init_priority value, so don't allow it. */
2716 || current_function_decl
)
2718 error ("can only use %qE attribute on file-scope definitions "
2719 "of objects of class type", name
);
2720 *no_add_attrs
= true;
2724 if (pri
> MAX_INIT_PRIORITY
|| pri
<= 0)
2726 error ("requested init_priority is out of range");
2727 *no_add_attrs
= true;
2731 /* Check for init_priorities that are reserved for
2732 language and runtime support implementations.*/
2733 if (pri
<= MAX_RESERVED_INIT_PRIORITY
)
2736 (0, "requested init_priority is reserved for internal use");
2739 if (SUPPORTS_INIT_PRIORITY
)
2741 SET_DECL_INIT_PRIORITY (decl
, pri
);
2742 DECL_HAS_INIT_PRIORITY_P (decl
) = 1;
2747 error ("%qE attribute is not supported on this platform", name
);
2748 *no_add_attrs
= true;
2753 /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the
2754 thing pointed to by the constant. */
2757 make_ptrmem_cst (tree type
, tree member
)
2759 tree ptrmem_cst
= make_node (PTRMEM_CST
);
2760 TREE_TYPE (ptrmem_cst
) = type
;
2761 PTRMEM_CST_MEMBER (ptrmem_cst
) = member
;
2765 /* Build a variant of TYPE that has the indicated ATTRIBUTES. May
2766 return an existing type if an appropriate type already exists. */
2769 cp_build_type_attribute_variant (tree type
, tree attributes
)
2773 new_type
= build_type_attribute_variant (type
, attributes
);
2774 if (TREE_CODE (new_type
) == FUNCTION_TYPE
2775 || TREE_CODE (new_type
) == METHOD_TYPE
)
2776 new_type
= build_exception_variant (new_type
,
2777 TYPE_RAISES_EXCEPTIONS (type
));
2779 /* Making a new main variant of a class type is broken. */
2780 gcc_assert (!CLASS_TYPE_P (type
) || new_type
== type
);
2785 /* Return TRUE if TYPE1 and TYPE2 are identical for type hashing purposes.
2786 Called only after doing all language independent checks. Only
2787 to check TYPE_RAISES_EXCEPTIONS for FUNCTION_TYPE, the rest is already
2788 compared in type_hash_eq. */
2791 cxx_type_hash_eq (const_tree typea
, const_tree typeb
)
2793 gcc_assert (TREE_CODE (typea
) == FUNCTION_TYPE
2794 || TREE_CODE (typea
) == METHOD_TYPE
);
2796 return comp_except_specs (TYPE_RAISES_EXCEPTIONS (typea
),
2797 TYPE_RAISES_EXCEPTIONS (typeb
), ce_exact
);
2800 /* Apply FUNC to all language-specific sub-trees of TP in a pre-order
2801 traversal. Called from walk_tree. */
2804 cp_walk_subtrees (tree
*tp
, int *walk_subtrees_p
, walk_tree_fn func
,
2805 void *data
, struct pointer_set_t
*pset
)
2807 enum tree_code code
= TREE_CODE (*tp
);
2810 #define WALK_SUBTREE(NODE) \
2813 result = cp_walk_tree (&(NODE), func, data, pset); \
2814 if (result) goto out; \
2818 /* Not one of the easy cases. We must explicitly go through the
2824 case TEMPLATE_TEMPLATE_PARM
:
2825 case BOUND_TEMPLATE_TEMPLATE_PARM
:
2826 case UNBOUND_CLASS_TEMPLATE
:
2827 case TEMPLATE_PARM_INDEX
:
2828 case TEMPLATE_TYPE_PARM
:
2831 /* None of these have subtrees other than those already walked
2833 *walk_subtrees_p
= 0;
2837 WALK_SUBTREE (BASELINK_FUNCTIONS (*tp
));
2838 *walk_subtrees_p
= 0;
2842 WALK_SUBTREE (TREE_TYPE (*tp
));
2843 *walk_subtrees_p
= 0;
2847 WALK_SUBTREE (TREE_PURPOSE (*tp
));
2851 WALK_SUBTREE (OVL_FUNCTION (*tp
));
2852 WALK_SUBTREE (OVL_CHAIN (*tp
));
2853 *walk_subtrees_p
= 0;
2857 WALK_SUBTREE (DECL_NAME (*tp
));
2858 WALK_SUBTREE (USING_DECL_SCOPE (*tp
));
2859 WALK_SUBTREE (USING_DECL_DECLS (*tp
));
2860 *walk_subtrees_p
= 0;
2864 if (TYPE_PTRMEMFUNC_P (*tp
))
2865 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (*tp
));
2868 case TYPE_ARGUMENT_PACK
:
2869 case NONTYPE_ARGUMENT_PACK
:
2871 tree args
= ARGUMENT_PACK_ARGS (*tp
);
2872 int i
, len
= TREE_VEC_LENGTH (args
);
2873 for (i
= 0; i
< len
; i
++)
2874 WALK_SUBTREE (TREE_VEC_ELT (args
, i
));
2878 case TYPE_PACK_EXPANSION
:
2879 WALK_SUBTREE (TREE_TYPE (*tp
));
2880 *walk_subtrees_p
= 0;
2883 case EXPR_PACK_EXPANSION
:
2884 WALK_SUBTREE (TREE_OPERAND (*tp
, 0));
2885 *walk_subtrees_p
= 0;
2889 case REINTERPRET_CAST_EXPR
:
2890 case STATIC_CAST_EXPR
:
2891 case CONST_CAST_EXPR
:
2892 case DYNAMIC_CAST_EXPR
:
2893 if (TREE_TYPE (*tp
))
2894 WALK_SUBTREE (TREE_TYPE (*tp
));
2898 for (i
= 0; i
< TREE_CODE_LENGTH (TREE_CODE (*tp
)); ++i
)
2899 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
2901 *walk_subtrees_p
= 0;
2905 WALK_SUBTREE (TRAIT_EXPR_TYPE1 (*tp
));
2906 WALK_SUBTREE (TRAIT_EXPR_TYPE2 (*tp
));
2907 *walk_subtrees_p
= 0;
2911 WALK_SUBTREE (DECLTYPE_TYPE_EXPR (*tp
));
2912 *walk_subtrees_p
= 0;
2920 /* We didn't find what we were looking for. */
2927 /* Like save_expr, but for C++. */
2930 cp_save_expr (tree expr
)
2932 /* There is no reason to create a SAVE_EXPR within a template; if
2933 needed, we can create the SAVE_EXPR when instantiating the
2934 template. Furthermore, the middle-end cannot handle C++-specific
2936 if (processing_template_decl
)
2938 return save_expr (expr
);
2941 /* Initialize tree.c. */
2946 list_hash_table
= htab_create_ggc (31, list_hash
, list_hash_eq
, NULL
);
2949 /* Returns the kind of special function that DECL (a FUNCTION_DECL)
2950 is. Note that sfk_none is zero, so this function can be used as a
2951 predicate to test whether or not DECL is a special function. */
2953 special_function_kind
2954 special_function_p (const_tree decl
)
2956 /* Rather than doing all this stuff with magic names, we should
2957 probably have a field of type `special_function_kind' in
2958 DECL_LANG_SPECIFIC. */
2959 if (DECL_COPY_CONSTRUCTOR_P (decl
))
2960 return sfk_copy_constructor
;
2961 if (DECL_MOVE_CONSTRUCTOR_P (decl
))
2962 return sfk_move_constructor
;
2963 if (DECL_CONSTRUCTOR_P (decl
))
2964 return sfk_constructor
;
2965 if (DECL_OVERLOADED_OPERATOR_P (decl
) == NOP_EXPR
)
2967 if (copy_fn_p (decl
))
2968 return sfk_copy_assignment
;
2969 if (move_fn_p (decl
))
2970 return sfk_move_assignment
;
2972 if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl
))
2973 return sfk_destructor
;
2974 if (DECL_COMPLETE_DESTRUCTOR_P (decl
))
2975 return sfk_complete_destructor
;
2976 if (DECL_BASE_DESTRUCTOR_P (decl
))
2977 return sfk_base_destructor
;
2978 if (DECL_DELETING_DESTRUCTOR_P (decl
))
2979 return sfk_deleting_destructor
;
2980 if (DECL_CONV_FN_P (decl
))
2981 return sfk_conversion
;
2986 /* Returns nonzero if TYPE is a character type, including wchar_t. */
2989 char_type_p (tree type
)
2991 return (same_type_p (type
, char_type_node
)
2992 || same_type_p (type
, unsigned_char_type_node
)
2993 || same_type_p (type
, signed_char_type_node
)
2994 || same_type_p (type
, char16_type_node
)
2995 || same_type_p (type
, char32_type_node
)
2996 || same_type_p (type
, wchar_type_node
));
2999 /* Returns the kind of linkage associated with the indicated DECL. Th
3000 value returned is as specified by the language standard; it is
3001 independent of implementation details regarding template
3002 instantiation, etc. For example, it is possible that a declaration
3003 to which this function assigns external linkage would not show up
3004 as a global symbol when you run `nm' on the resulting object file. */
3007 decl_linkage (tree decl
)
3009 /* This function doesn't attempt to calculate the linkage from first
3010 principles as given in [basic.link]. Instead, it makes use of
3011 the fact that we have already set TREE_PUBLIC appropriately, and
3012 then handles a few special cases. Ideally, we would calculate
3013 linkage first, and then transform that into a concrete
3016 /* Things that don't have names have no linkage. */
3017 if (!DECL_NAME (decl
))
3020 /* Fields have no linkage. */
3021 if (TREE_CODE (decl
) == FIELD_DECL
)
3024 /* Things that are TREE_PUBLIC have external linkage. */
3025 if (TREE_PUBLIC (decl
))
3028 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
3031 /* Linkage of a CONST_DECL depends on the linkage of the enumeration
3033 if (TREE_CODE (decl
) == CONST_DECL
)
3034 return decl_linkage (TYPE_NAME (TREE_TYPE (decl
)));
3036 /* Some things that are not TREE_PUBLIC have external linkage, too.
3037 For example, on targets that don't have weak symbols, we make all
3038 template instantiations have internal linkage (in the object
3039 file), but the symbols should still be treated as having external
3040 linkage from the point of view of the language. */
3041 if ((TREE_CODE (decl
) == FUNCTION_DECL
3042 || TREE_CODE (decl
) == VAR_DECL
)
3043 && DECL_COMDAT (decl
))
3046 /* Things in local scope do not have linkage, if they don't have
3048 if (decl_function_context (decl
))
3051 /* Members of the anonymous namespace also have TREE_PUBLIC unset, but
3052 are considered to have external linkage for language purposes. DECLs
3053 really meant to have internal linkage have DECL_THIS_STATIC set. */
3054 if (TREE_CODE (decl
) == TYPE_DECL
)
3056 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
)
3058 if (!DECL_THIS_STATIC (decl
))
3061 /* Static data members and static member functions from classes
3062 in anonymous namespace also don't have TREE_PUBLIC set. */
3063 if (DECL_CLASS_CONTEXT (decl
))
3067 /* Everything else has internal linkage. */
3071 /* Returns the storage duration of the object or reference associated with
3072 the indicated DECL, which should be a VAR_DECL or PARM_DECL. */
3075 decl_storage_duration (tree decl
)
3077 if (TREE_CODE (decl
) == PARM_DECL
)
3079 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3081 gcc_assert (TREE_CODE (decl
) == VAR_DECL
);
3082 if (!TREE_STATIC (decl
)
3083 && !DECL_EXTERNAL (decl
))
3085 if (DECL_THREAD_LOCAL_P (decl
))
3090 /* EXP is an expression that we want to pre-evaluate. Returns (in
3091 *INITP) an expression that will perform the pre-evaluation. The
3092 value returned by this function is a side-effect free expression
3093 equivalent to the pre-evaluated expression. Callers must ensure
3094 that *INITP is evaluated before EXP. */
3097 stabilize_expr (tree exp
, tree
* initp
)
3101 if (!TREE_SIDE_EFFECTS (exp
))
3102 init_expr
= NULL_TREE
;
3103 else if (!TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (exp
))
3104 || !lvalue_or_rvalue_with_address_p (exp
))
3106 init_expr
= get_target_expr (exp
);
3107 exp
= TARGET_EXPR_SLOT (init_expr
);
3111 bool xval
= !real_lvalue_p (exp
);
3112 exp
= cp_build_addr_expr (exp
, tf_warning_or_error
);
3113 init_expr
= get_target_expr (exp
);
3114 exp
= TARGET_EXPR_SLOT (init_expr
);
3115 exp
= cp_build_indirect_ref (exp
, RO_NULL
, tf_warning_or_error
);
3121 gcc_assert (!TREE_SIDE_EFFECTS (exp
));
3125 /* Add NEW_EXPR, an expression whose value we don't care about, after the
3126 similar expression ORIG. */
3129 add_stmt_to_compound (tree orig
, tree new_expr
)
3131 if (!new_expr
|| !TREE_SIDE_EFFECTS (new_expr
))
3133 if (!orig
|| !TREE_SIDE_EFFECTS (orig
))
3135 return build2 (COMPOUND_EXPR
, void_type_node
, orig
, new_expr
);
3138 /* Like stabilize_expr, but for a call whose arguments we want to
3139 pre-evaluate. CALL is modified in place to use the pre-evaluated
3140 arguments, while, upon return, *INITP contains an expression to
3141 compute the arguments. */
3144 stabilize_call (tree call
, tree
*initp
)
3146 tree inits
= NULL_TREE
;
3148 int nargs
= call_expr_nargs (call
);
3150 if (call
== error_mark_node
|| processing_template_decl
)
3156 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
3158 for (i
= 0; i
< nargs
; i
++)
3161 CALL_EXPR_ARG (call
, i
) =
3162 stabilize_expr (CALL_EXPR_ARG (call
, i
), &init
);
3163 inits
= add_stmt_to_compound (inits
, init
);
3169 /* Like stabilize_expr, but for an AGGR_INIT_EXPR whose arguments we want
3170 to pre-evaluate. CALL is modified in place to use the pre-evaluated
3171 arguments, while, upon return, *INITP contains an expression to
3172 compute the arguments. */
3175 stabilize_aggr_init (tree call
, tree
*initp
)
3177 tree inits
= NULL_TREE
;
3179 int nargs
= aggr_init_expr_nargs (call
);
3181 if (call
== error_mark_node
)
3184 gcc_assert (TREE_CODE (call
) == AGGR_INIT_EXPR
);
3186 for (i
= 0; i
< nargs
; i
++)
3189 AGGR_INIT_EXPR_ARG (call
, i
) =
3190 stabilize_expr (AGGR_INIT_EXPR_ARG (call
, i
), &init
);
3191 inits
= add_stmt_to_compound (inits
, init
);
3197 /* Like stabilize_expr, but for an initialization.
3199 If the initialization is for an object of class type, this function
3200 takes care not to introduce additional temporaries.
3202 Returns TRUE iff the expression was successfully pre-evaluated,
3203 i.e., if INIT is now side-effect free, except for, possible, a
3204 single call to a constructor. */
3207 stabilize_init (tree init
, tree
*initp
)
3213 if (t
== error_mark_node
|| processing_template_decl
)
3216 if (TREE_CODE (t
) == INIT_EXPR
3217 && TREE_CODE (TREE_OPERAND (t
, 1)) != TARGET_EXPR
3218 && TREE_CODE (TREE_OPERAND (t
, 1)) != AGGR_INIT_EXPR
)
3220 TREE_OPERAND (t
, 1) = stabilize_expr (TREE_OPERAND (t
, 1), initp
);
3224 if (TREE_CODE (t
) == INIT_EXPR
)
3225 t
= TREE_OPERAND (t
, 1);
3226 if (TREE_CODE (t
) == TARGET_EXPR
)
3227 t
= TARGET_EXPR_INITIAL (t
);
3228 if (TREE_CODE (t
) == COMPOUND_EXPR
)
3230 if (TREE_CODE (t
) == CONSTRUCTOR
3231 && EMPTY_CONSTRUCTOR_P (t
))
3232 /* Default-initialization. */
3235 /* If the initializer is a COND_EXPR, we can't preevaluate
3237 if (TREE_CODE (t
) == COND_EXPR
)
3240 if (TREE_CODE (t
) == CALL_EXPR
)
3242 stabilize_call (t
, initp
);
3246 if (TREE_CODE (t
) == AGGR_INIT_EXPR
)
3248 stabilize_aggr_init (t
, initp
);
3252 /* The initialization is being performed via a bitwise copy -- and
3253 the item copied may have side effects. */
3254 return TREE_SIDE_EFFECTS (init
);
3257 /* Like "fold", but should be used whenever we might be processing the
3258 body of a template. */
3261 fold_if_not_in_template (tree expr
)
3263 /* In the body of a template, there is never any need to call
3264 "fold". We will call fold later when actually instantiating the
3265 template. Integral constant expressions in templates will be
3266 evaluated via fold_non_dependent_expr, as necessary. */
3267 if (processing_template_decl
)
3270 /* Fold C++ front-end specific tree codes. */
3271 if (TREE_CODE (expr
) == UNARY_PLUS_EXPR
)
3272 return fold_convert (TREE_TYPE (expr
), TREE_OPERAND (expr
, 0));
3277 /* Returns true if a cast to TYPE may appear in an integral constant
3281 cast_valid_in_integral_constant_expression_p (tree type
)
3283 return (INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
3284 || cxx_dialect
>= cxx0x
3285 || dependent_type_p (type
)
3286 || type
== error_mark_node
);
3289 /* Return true if we need to fix linkage information of DECL. */
3292 cp_fix_function_decl_p (tree decl
)
3294 /* Skip if DECL is not externally visible. */
3295 if (!TREE_PUBLIC (decl
))
3298 /* We need to fix DECL if it a appears to be exported but with no
3299 function body. Thunks do not have CFGs and we may need to
3300 handle them specially later. */
3301 if (!gimple_has_body_p (decl
)
3302 && !DECL_THUNK_P (decl
)
3303 && !DECL_EXTERNAL (decl
))
3305 struct cgraph_node
*node
= cgraph_get_node (decl
);
3307 /* Don't fix same_body aliases. Although they don't have their own
3308 CFG, they share it with what they alias to. */
3310 || node
->decl
== decl
3311 || !node
->same_body
)
3318 /* Clean the C++ specific parts of the tree T. */
3321 cp_free_lang_data (tree t
)
3323 if (TREE_CODE (t
) == METHOD_TYPE
3324 || TREE_CODE (t
) == FUNCTION_TYPE
)
3326 /* Default args are not interesting anymore. */
3327 tree argtypes
= TYPE_ARG_TYPES (t
);
3330 TREE_PURPOSE (argtypes
) = 0;
3331 argtypes
= TREE_CHAIN (argtypes
);
3334 else if (TREE_CODE (t
) == FUNCTION_DECL
3335 && cp_fix_function_decl_p (t
))
3337 /* If T is used in this translation unit at all, the definition
3338 must exist somewhere else since we have decided to not emit it
3339 in this TU. So make it an external reference. */
3340 DECL_EXTERNAL (t
) = 1;
3341 TREE_STATIC (t
) = 0;
3343 if (CP_AGGREGATE_TYPE_P (t
)
3346 tree name
= TYPE_NAME (t
);
3347 if (TREE_CODE (name
) == TYPE_DECL
)
3348 name
= DECL_NAME (name
);
3349 /* Drop anonymous names. */
3350 if (name
!= NULL_TREE
3351 && ANON_AGGRNAME_P (name
))
3352 TYPE_NAME (t
) = NULL_TREE
;
3354 if (TREE_CODE (t
) == NAMESPACE_DECL
)
3356 /* The list of users of a namespace isn't useful for the middle-end
3357 or debug generators. */
3358 DECL_NAMESPACE_USERS (t
) = NULL_TREE
;
3359 /* Neither do we need the leftover chaining of namespaces
3360 from the binding level. */
3361 DECL_CHAIN (t
) = NULL_TREE
;
3365 /* Stub for c-common. Please keep in sync with c-decl.c.
3366 FIXME: If address space support is target specific, then this
3367 should be a C target hook. But currently this is not possible,
3368 because this function is called via REGISTER_TARGET_PRAGMAS. */
3370 c_register_addr_space (const char *word ATTRIBUTE_UNUSED
,
3371 addr_space_t as ATTRIBUTE_UNUSED
)
3376 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3377 /* Complain that some language-specific thing hanging off a tree
3378 node has been accessed improperly. */
3381 lang_check_failed (const char* file
, int line
, const char* function
)
3383 internal_error ("lang_* check: failed in %s, at %s:%d",
3384 function
, trim_filename (file
), line
);
3386 #endif /* ENABLE_TREE_CHECKING */
3388 #include "gt-cp-tree.h"