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,
5 Free Software Foundation, Inc.
6 Hacked by Michael Tiemann (tiemann@cygnus.com)
8 This file is part of GCC.
10 GCC is free software; you can redistribute it and/or modify
11 it under the terms of the GNU General Public License as published by
12 the Free Software Foundation; either version 3, or (at your option)
15 GCC is distributed in the hope that it will be useful,
16 but WITHOUT ANY WARRANTY; without even the implied warranty of
17 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 GNU General Public License for more details.
20 You should have received a copy of the GNU General Public License
21 along with GCC; see the file COPYING3. If not see
22 <http://www.gnu.org/licenses/>. */
26 #include "coretypes.h"
31 #include "tree-inline.h"
35 #include "splay-tree.h"
36 #include "gimple.h" /* gimple_has_body_p */
38 static tree
bot_manip (tree
*, int *, void *);
39 static tree
bot_replace (tree
*, int *, void *);
40 static int list_hash_eq (const void *, const void *);
41 static hashval_t
list_hash_pieces (tree
, tree
, tree
);
42 static hashval_t
list_hash (const void *);
43 static tree
build_target_expr (tree
, tree
, tsubst_flags_t
);
44 static tree
count_trees_r (tree
*, int *, void *);
45 static tree
verify_stmt_tree_r (tree
*, int *, void *);
46 static tree
build_local_temp (tree
);
48 static tree
handle_java_interface_attribute (tree
*, tree
, tree
, int, bool *);
49 static tree
handle_com_interface_attribute (tree
*, tree
, tree
, int, bool *);
50 static tree
handle_init_priority_attribute (tree
*, tree
, tree
, int, bool *);
52 /* If REF is an lvalue, returns the kind of lvalue that REF is.
53 Otherwise, returns clk_none. */
56 lvalue_kind (const_tree ref
)
58 cp_lvalue_kind op1_lvalue_kind
= clk_none
;
59 cp_lvalue_kind op2_lvalue_kind
= clk_none
;
61 /* Expressions of reference type are sometimes wrapped in
62 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
63 representation, not part of the language, so we have to look
65 if (REFERENCE_REF_P (ref
))
66 return lvalue_kind (TREE_OPERAND (ref
, 0));
69 && TREE_CODE (TREE_TYPE (ref
)) == REFERENCE_TYPE
)
71 /* unnamed rvalue references are rvalues */
72 if (TYPE_REF_IS_RVALUE (TREE_TYPE (ref
))
73 && TREE_CODE (ref
) != PARM_DECL
74 && TREE_CODE (ref
) != VAR_DECL
75 && TREE_CODE (ref
) != COMPONENT_REF
76 /* Functions are always lvalues. */
77 && TREE_CODE (TREE_TYPE (TREE_TYPE (ref
))) != FUNCTION_TYPE
)
80 /* lvalue references and named rvalue references are lvalues. */
84 if (ref
== current_class_ptr
)
87 switch (TREE_CODE (ref
))
91 /* preincrements and predecrements are valid lvals, provided
92 what they refer to are valid lvals. */
93 case PREINCREMENT_EXPR
:
94 case PREDECREMENT_EXPR
:
96 case WITH_CLEANUP_EXPR
:
99 return lvalue_kind (TREE_OPERAND (ref
, 0));
102 op1_lvalue_kind
= lvalue_kind (TREE_OPERAND (ref
, 0));
103 /* Look at the member designator. */
104 if (!op1_lvalue_kind
)
106 else if (is_overloaded_fn (TREE_OPERAND (ref
, 1)))
107 /* The "field" can be a FUNCTION_DECL or an OVERLOAD in some
108 situations. If we're seeing a COMPONENT_REF, it's a non-static
109 member, so it isn't an lvalue. */
110 op1_lvalue_kind
= clk_none
;
111 else if (TREE_CODE (TREE_OPERAND (ref
, 1)) != FIELD_DECL
)
112 /* This can be IDENTIFIER_NODE in a template. */;
113 else if (DECL_C_BIT_FIELD (TREE_OPERAND (ref
, 1)))
115 /* Clear the ordinary bit. If this object was a class
116 rvalue we want to preserve that information. */
117 op1_lvalue_kind
&= ~clk_ordinary
;
118 /* The lvalue is for a bitfield. */
119 op1_lvalue_kind
|= clk_bitfield
;
121 else if (DECL_PACKED (TREE_OPERAND (ref
, 1)))
122 op1_lvalue_kind
|= clk_packed
;
124 return op1_lvalue_kind
;
127 case COMPOUND_LITERAL_EXPR
:
131 /* CONST_DECL without TREE_STATIC are enumeration values and
132 thus not lvalues. With TREE_STATIC they are used by ObjC++
133 in objc_build_string_object and need to be considered as
135 if (! TREE_STATIC (ref
))
138 if (TREE_READONLY (ref
) && ! TREE_STATIC (ref
)
139 && DECL_LANG_SPECIFIC (ref
)
140 && 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
)));
156 tree op
= TREE_OPERAND (ref
, 1);
157 if (TREE_CODE (op
) == FIELD_DECL
)
158 return (DECL_C_BIT_FIELD (op
) ? clk_bitfield
: clk_ordinary
);
160 return lvalue_kind (op
);
165 /* Disallow <? and >? as lvalues if either argument side-effects. */
166 if (TREE_SIDE_EFFECTS (TREE_OPERAND (ref
, 0))
167 || TREE_SIDE_EFFECTS (TREE_OPERAND (ref
, 1)))
169 op1_lvalue_kind
= lvalue_kind (TREE_OPERAND (ref
, 0));
170 op2_lvalue_kind
= lvalue_kind (TREE_OPERAND (ref
, 1));
174 op1_lvalue_kind
= lvalue_kind (TREE_OPERAND (ref
, 1)
175 ? TREE_OPERAND (ref
, 1)
176 : TREE_OPERAND (ref
, 0));
177 op2_lvalue_kind
= lvalue_kind (TREE_OPERAND (ref
, 2));
185 return lvalue_kind (TREE_OPERAND (ref
, 1));
191 return (CLASS_TYPE_P (TREE_TYPE (ref
)) ? clk_class
: clk_none
);
194 /* We can see calls outside of TARGET_EXPR in templates. */
195 if (CLASS_TYPE_P (TREE_TYPE (ref
)))
200 /* All functions (except non-static-member functions) are
202 return (DECL_NONSTATIC_MEMBER_FUNCTION_P (ref
)
203 ? clk_none
: clk_ordinary
);
206 /* We now represent a reference to a single static member function
208 /* This CONST_CAST is okay because BASELINK_FUNCTIONS returns
209 its argument unmodified and we assign it to a const_tree. */
210 return lvalue_kind (BASELINK_FUNCTIONS (CONST_CAST_TREE (ref
)));
212 case NON_DEPENDENT_EXPR
:
213 /* We just return clk_ordinary for NON_DEPENDENT_EXPR in C++98, but
214 in C++11 lvalues don't bind to rvalue references, so we need to
215 work harder to avoid bogus errors (c++/44870). */
216 if (cxx_dialect
< cxx0x
)
219 return lvalue_kind (TREE_OPERAND (ref
, 0));
222 if (!TREE_TYPE (ref
))
224 if (CLASS_TYPE_P (TREE_TYPE (ref
)))
229 /* If one operand is not an lvalue at all, then this expression is
231 if (!op1_lvalue_kind
|| !op2_lvalue_kind
)
234 /* Otherwise, it's an lvalue, and it has all the odd properties
235 contributed by either operand. */
236 op1_lvalue_kind
= op1_lvalue_kind
| op2_lvalue_kind
;
237 /* It's not an ordinary lvalue if it involves any other kind. */
238 if ((op1_lvalue_kind
& ~clk_ordinary
) != clk_none
)
239 op1_lvalue_kind
&= ~clk_ordinary
;
240 /* It can't be both a pseudo-lvalue and a non-addressable lvalue.
241 A COND_EXPR of those should be wrapped in a TARGET_EXPR. */
242 if ((op1_lvalue_kind
& (clk_rvalueref
|clk_class
))
243 && (op1_lvalue_kind
& (clk_bitfield
|clk_packed
)))
244 op1_lvalue_kind
= clk_none
;
245 return op1_lvalue_kind
;
248 /* Returns the kind of lvalue that REF is, in the sense of
249 [basic.lval]. This function should really be named lvalue_p; it
250 computes the C++ definition of lvalue. */
253 real_lvalue_p (const_tree ref
)
255 cp_lvalue_kind kind
= lvalue_kind (ref
);
256 if (kind
& (clk_rvalueref
|clk_class
))
262 /* This differs from real_lvalue_p in that class rvalues are considered
266 lvalue_p (const_tree ref
)
268 return (lvalue_kind (ref
) != clk_none
);
271 /* This differs from real_lvalue_p in that rvalues formed by dereferencing
272 rvalue references are considered rvalues. */
275 lvalue_or_rvalue_with_address_p (const_tree ref
)
277 cp_lvalue_kind kind
= lvalue_kind (ref
);
278 if (kind
& clk_class
)
281 return (kind
!= clk_none
);
284 /* Returns true if REF is an xvalue, false otherwise. */
287 xvalue_p (const_tree ref
)
289 return (lvalue_kind (ref
) == clk_rvalueref
);
292 /* Test whether DECL is a builtin that may appear in a
293 constant-expression. */
296 builtin_valid_in_constant_expr_p (const_tree decl
)
298 /* At present BUILT_IN_CONSTANT_P is the only builtin we're allowing
299 in constant-expressions. We may want to add other builtins later. */
300 return DECL_IS_BUILTIN_CONSTANT_P (decl
);
303 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
306 build_target_expr (tree decl
, tree value
, tsubst_flags_t complain
)
309 tree type
= TREE_TYPE (decl
);
311 #ifdef ENABLE_CHECKING
312 gcc_assert (VOID_TYPE_P (TREE_TYPE (value
))
313 || TREE_TYPE (decl
) == TREE_TYPE (value
)
314 /* On ARM ctors return 'this'. */
315 || (TREE_CODE (TREE_TYPE (value
)) == POINTER_TYPE
316 && TREE_CODE (value
) == CALL_EXPR
)
317 || useless_type_conversion_p (TREE_TYPE (decl
),
321 t
= cxx_maybe_build_cleanup (decl
, complain
);
322 if (t
== error_mark_node
)
323 return error_mark_node
;
324 t
= build4 (TARGET_EXPR
, type
, decl
, value
, t
, NULL_TREE
);
325 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
326 ignore the TARGET_EXPR. If there really turn out to be no
327 side-effects, then the optimizer should be able to get rid of
328 whatever code is generated anyhow. */
329 TREE_SIDE_EFFECTS (t
) = 1;
330 if (literal_type_p (type
))
331 TREE_CONSTANT (t
) = TREE_CONSTANT (value
);
336 /* Return an undeclared local temporary of type TYPE for use in building a
340 build_local_temp (tree type
)
342 tree slot
= build_decl (input_location
,
343 VAR_DECL
, NULL_TREE
, type
);
344 DECL_ARTIFICIAL (slot
) = 1;
345 DECL_IGNORED_P (slot
) = 1;
346 DECL_CONTEXT (slot
) = current_function_decl
;
347 layout_decl (slot
, 0);
351 /* Set various status flags when building an AGGR_INIT_EXPR object T. */
354 process_aggr_init_operands (tree t
)
358 side_effects
= TREE_SIDE_EFFECTS (t
);
362 n
= TREE_OPERAND_LENGTH (t
);
363 for (i
= 1; i
< n
; i
++)
365 tree op
= TREE_OPERAND (t
, i
);
366 if (op
&& TREE_SIDE_EFFECTS (op
))
373 TREE_SIDE_EFFECTS (t
) = side_effects
;
376 /* Build an AGGR_INIT_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE,
377 FN, and SLOT. NARGS is the number of call arguments which are specified
378 as a tree array ARGS. */
381 build_aggr_init_array (tree return_type
, tree fn
, tree slot
, int nargs
,
387 t
= build_vl_exp (AGGR_INIT_EXPR
, nargs
+ 3);
388 TREE_TYPE (t
) = return_type
;
389 AGGR_INIT_EXPR_FN (t
) = fn
;
390 AGGR_INIT_EXPR_SLOT (t
) = slot
;
391 for (i
= 0; i
< nargs
; i
++)
392 AGGR_INIT_EXPR_ARG (t
, i
) = args
[i
];
393 process_aggr_init_operands (t
);
397 /* INIT is a CALL_EXPR or AGGR_INIT_EXPR which needs info about its
398 target. TYPE is the type to be initialized.
400 Build an AGGR_INIT_EXPR to represent the initialization. This function
401 differs from build_cplus_new in that an AGGR_INIT_EXPR can only be used
402 to initialize another object, whereas a TARGET_EXPR can either
403 initialize another object or create its own temporary object, and as a
404 result building up a TARGET_EXPR requires that the type's destructor be
408 build_aggr_init_expr (tree type
, tree init
, tsubst_flags_t complain
)
415 /* Make sure that we're not trying to create an instance of an
417 if (abstract_virtuals_error_sfinae (NULL_TREE
, type
, complain
))
418 return error_mark_node
;
420 if (TREE_CODE (init
) == CALL_EXPR
)
421 fn
= CALL_EXPR_FN (init
);
422 else if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
423 fn
= AGGR_INIT_EXPR_FN (init
);
425 return convert (type
, init
);
427 is_ctor
= (TREE_CODE (fn
) == ADDR_EXPR
428 && TREE_CODE (TREE_OPERAND (fn
, 0)) == FUNCTION_DECL
429 && DECL_CONSTRUCTOR_P (TREE_OPERAND (fn
, 0)));
431 /* We split the CALL_EXPR into its function and its arguments here.
432 Then, in expand_expr, we put them back together. The reason for
433 this is that this expression might be a default argument
434 expression. In that case, we need a new temporary every time the
435 expression is used. That's what break_out_target_exprs does; it
436 replaces every AGGR_INIT_EXPR with a copy that uses a fresh
437 temporary slot. Then, expand_expr builds up a call-expression
438 using the new slot. */
440 /* If we don't need to use a constructor to create an object of this
441 type, don't mess with AGGR_INIT_EXPR. */
442 if (is_ctor
|| TREE_ADDRESSABLE (type
))
444 slot
= build_local_temp (type
);
446 if (TREE_CODE(init
) == CALL_EXPR
)
447 rval
= build_aggr_init_array (void_type_node
, fn
, slot
,
448 call_expr_nargs (init
),
449 CALL_EXPR_ARGP (init
));
451 rval
= build_aggr_init_array (void_type_node
, fn
, slot
,
452 aggr_init_expr_nargs (init
),
453 AGGR_INIT_EXPR_ARGP (init
));
454 TREE_SIDE_EFFECTS (rval
) = 1;
455 AGGR_INIT_VIA_CTOR_P (rval
) = is_ctor
;
456 TREE_NOTHROW (rval
) = TREE_NOTHROW (init
);
464 /* INIT is a CALL_EXPR or AGGR_INIT_EXPR which needs info about its
465 target. TYPE is the type that this initialization should appear to
468 Build an encapsulation of the initialization to perform
469 and return it so that it can be processed by language-independent
470 and language-specific expression expanders. */
473 build_cplus_new (tree type
, tree init
, tsubst_flags_t complain
)
475 tree rval
= build_aggr_init_expr (type
, init
, complain
);
478 if (TREE_CODE (rval
) == AGGR_INIT_EXPR
)
479 slot
= AGGR_INIT_EXPR_SLOT (rval
);
480 else if (TREE_CODE (rval
) == CALL_EXPR
481 || TREE_CODE (rval
) == CONSTRUCTOR
)
482 slot
= build_local_temp (type
);
486 rval
= build_target_expr (slot
, rval
, complain
);
488 if (rval
!= error_mark_node
)
489 TARGET_EXPR_IMPLICIT_P (rval
) = 1;
494 /* Subroutine of build_vec_init_expr: Build up a single element
495 intialization as a proxy for the full array initialization to get things
496 marked as used and any appropriate diagnostics.
498 Since we're deferring building the actual constructor calls until
499 gimplification time, we need to build one now and throw it away so
500 that the relevant constructor gets mark_used before cgraph decides
501 what functions are needed. Here we assume that init is either
502 NULL_TREE, void_type_node (indicating value-initialization), or
503 another array to copy. */
506 build_vec_init_elt (tree type
, tree init
, tsubst_flags_t complain
)
508 tree inner_type
= strip_array_types (type
);
509 VEC(tree
,gc
) *argvec
;
511 if (integer_zerop (array_type_nelts_total (type
))
512 || !CLASS_TYPE_P (inner_type
))
513 /* No interesting initialization to do. */
514 return integer_zero_node
;
515 else if (init
== void_type_node
)
516 return build_value_init (inner_type
, complain
);
518 gcc_assert (init
== NULL_TREE
519 || (same_type_ignoring_top_level_qualifiers_p
520 (type
, TREE_TYPE (init
))));
522 argvec
= make_tree_vector ();
525 tree dummy
= build_dummy_object (inner_type
);
526 if (!real_lvalue_p (init
))
527 dummy
= move (dummy
);
528 VEC_quick_push (tree
, argvec
, dummy
);
530 init
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
531 &argvec
, inner_type
, LOOKUP_NORMAL
,
533 release_tree_vector (argvec
);
535 /* For a trivial constructor, build_over_call creates a TARGET_EXPR. But
536 we don't want one here because we aren't creating a temporary. */
537 if (TREE_CODE (init
) == TARGET_EXPR
)
538 init
= TARGET_EXPR_INITIAL (init
);
543 /* Return a TARGET_EXPR which expresses the initialization of an array to
544 be named later, either default-initialization or copy-initialization
545 from another array of the same type. */
548 build_vec_init_expr (tree type
, tree init
, tsubst_flags_t complain
)
551 bool value_init
= false;
552 tree elt_init
= build_vec_init_elt (type
, init
, complain
);
554 if (init
== void_type_node
)
560 slot
= build_local_temp (type
);
561 init
= build2 (VEC_INIT_EXPR
, type
, slot
, init
);
562 TREE_SIDE_EFFECTS (init
) = true;
563 SET_EXPR_LOCATION (init
, input_location
);
565 if (cxx_dialect
>= cxx0x
566 && potential_constant_expression (elt_init
))
567 VEC_INIT_EXPR_IS_CONSTEXPR (init
) = true;
568 VEC_INIT_EXPR_VALUE_INIT (init
) = value_init
;
573 /* Give a helpful diagnostic for a non-constexpr VEC_INIT_EXPR in a context
574 that requires a constant expression. */
577 diagnose_non_constexpr_vec_init (tree expr
)
579 tree type
= TREE_TYPE (VEC_INIT_EXPR_SLOT (expr
));
581 if (VEC_INIT_EXPR_VALUE_INIT (expr
))
582 init
= void_type_node
;
584 init
= VEC_INIT_EXPR_INIT (expr
);
586 elt_init
= build_vec_init_elt (type
, init
, tf_warning_or_error
);
587 require_potential_constant_expression (elt_init
);
591 build_array_copy (tree init
)
593 return build_vec_init_expr (TREE_TYPE (init
), init
, tf_warning_or_error
);
596 /* Build a TARGET_EXPR using INIT to initialize a new temporary of the
600 build_target_expr_with_type (tree init
, tree type
, tsubst_flags_t complain
)
602 gcc_assert (!VOID_TYPE_P (type
));
604 if (TREE_CODE (init
) == TARGET_EXPR
605 || init
== error_mark_node
)
607 else if (CLASS_TYPE_P (type
) && type_has_nontrivial_copy_init (type
)
608 && !VOID_TYPE_P (TREE_TYPE (init
))
609 && TREE_CODE (init
) != COND_EXPR
610 && TREE_CODE (init
) != CONSTRUCTOR
611 && TREE_CODE (init
) != VA_ARG_EXPR
)
612 /* We need to build up a copy constructor call. A void initializer
613 means we're being called from bot_manip. COND_EXPR is a special
614 case because we already have copies on the arms and we don't want
615 another one here. A CONSTRUCTOR is aggregate initialization, which
616 is handled separately. A VA_ARG_EXPR is magic creation of an
617 aggregate; there's no additional work to be done. */
618 return force_rvalue (init
, complain
);
620 return force_target_expr (type
, init
, complain
);
623 /* Like the above function, but without the checking. This function should
624 only be used by code which is deliberately trying to subvert the type
625 system, such as call_builtin_trap. Or build_over_call, to avoid
626 infinite recursion. */
629 force_target_expr (tree type
, tree init
, tsubst_flags_t complain
)
633 gcc_assert (!VOID_TYPE_P (type
));
635 slot
= build_local_temp (type
);
636 return build_target_expr (slot
, init
, complain
);
639 /* Like build_target_expr_with_type, but use the type of INIT. */
642 get_target_expr_sfinae (tree init
, tsubst_flags_t complain
)
644 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
645 return build_target_expr (AGGR_INIT_EXPR_SLOT (init
), init
, complain
);
646 else if (TREE_CODE (init
) == VEC_INIT_EXPR
)
647 return build_target_expr (VEC_INIT_EXPR_SLOT (init
), init
, complain
);
649 return build_target_expr_with_type (init
, TREE_TYPE (init
), complain
);
653 get_target_expr (tree init
)
655 return get_target_expr_sfinae (init
, tf_warning_or_error
);
658 /* If EXPR is a bitfield reference, convert it to the declared type of
659 the bitfield, and return the resulting expression. Otherwise,
660 return EXPR itself. */
663 convert_bitfield_to_declared_type (tree expr
)
667 bitfield_type
= is_bitfield_expr_with_lowered_type (expr
);
669 expr
= convert_to_integer (TYPE_MAIN_VARIANT (bitfield_type
),
674 /* EXPR is being used in an rvalue context. Return a version of EXPR
675 that is marked as an rvalue. */
682 if (error_operand_p (expr
))
685 expr
= mark_rvalue_use (expr
);
689 Non-class rvalues always have cv-unqualified types. */
690 type
= TREE_TYPE (expr
);
691 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
692 type
= cv_unqualified (type
);
694 /* We need to do this for rvalue refs as well to get the right answer
695 from decltype; see c++/36628. */
696 if (!processing_template_decl
&& lvalue_or_rvalue_with_address_p (expr
))
697 expr
= build1 (NON_LVALUE_EXPR
, type
, expr
);
698 else if (type
!= TREE_TYPE (expr
))
699 expr
= build_nop (type
, expr
);
705 /* Hash an ARRAY_TYPE. K is really of type `tree'. */
708 cplus_array_hash (const void* k
)
711 const_tree
const t
= (const_tree
) k
;
713 hash
= TYPE_UID (TREE_TYPE (t
));
715 hash
^= TYPE_UID (TYPE_DOMAIN (t
));
719 typedef struct cplus_array_info
{
724 /* Compare two ARRAY_TYPEs. K1 is really of type `tree', K2 is really
725 of type `cplus_array_info*'. */
728 cplus_array_compare (const void * k1
, const void * k2
)
730 const_tree
const t1
= (const_tree
) k1
;
731 const cplus_array_info
*const t2
= (const cplus_array_info
*) k2
;
733 return (TREE_TYPE (t1
) == t2
->type
&& TYPE_DOMAIN (t1
) == t2
->domain
);
736 /* Hash table containing dependent array types, which are unsuitable for
737 the language-independent type hash table. */
738 static GTY ((param_is (union tree_node
))) htab_t cplus_array_htab
;
740 /* Like build_array_type, but handle special C++ semantics. */
743 build_cplus_array_type (tree elt_type
, tree index_type
)
747 if (elt_type
== error_mark_node
|| index_type
== error_mark_node
)
748 return error_mark_node
;
750 if (processing_template_decl
751 && (dependent_type_p (elt_type
)
752 || (index_type
&& !TREE_CONSTANT (TYPE_MAX_VALUE (index_type
)))))
755 cplus_array_info cai
;
758 if (cplus_array_htab
== NULL
)
759 cplus_array_htab
= htab_create_ggc (61, &cplus_array_hash
,
760 &cplus_array_compare
, NULL
);
762 hash
= TYPE_UID (elt_type
);
764 hash
^= TYPE_UID (index_type
);
766 cai
.domain
= index_type
;
768 e
= htab_find_slot_with_hash (cplus_array_htab
, &cai
, hash
, INSERT
);
770 /* We have found the type: we're done. */
774 /* Build a new array type. */
775 t
= cxx_make_type (ARRAY_TYPE
);
776 TREE_TYPE (t
) = elt_type
;
777 TYPE_DOMAIN (t
) = index_type
;
779 /* Store it in the hash table. */
782 /* Set the canonical type for this new node. */
783 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
784 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
785 SET_TYPE_STRUCTURAL_EQUALITY (t
);
786 else if (TYPE_CANONICAL (elt_type
) != elt_type
788 && TYPE_CANONICAL (index_type
) != index_type
))
790 = build_cplus_array_type
791 (TYPE_CANONICAL (elt_type
),
792 index_type
? TYPE_CANONICAL (index_type
) : index_type
);
794 TYPE_CANONICAL (t
) = t
;
798 t
= build_array_type (elt_type
, index_type
);
800 /* We want TYPE_MAIN_VARIANT of an array to strip cv-quals from the
801 element type as well, so fix it up if needed. */
802 if (elt_type
!= TYPE_MAIN_VARIANT (elt_type
))
804 tree m
= build_cplus_array_type (TYPE_MAIN_VARIANT (elt_type
),
806 if (TYPE_MAIN_VARIANT (t
) != m
)
808 TYPE_MAIN_VARIANT (t
) = m
;
809 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
810 TYPE_NEXT_VARIANT (m
) = t
;
814 /* Push these needs up so that initialization takes place
816 TYPE_NEEDS_CONSTRUCTING (t
)
817 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (elt_type
));
818 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
819 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (elt_type
));
823 /* Return an ARRAY_TYPE with element type ELT and length N. */
826 build_array_of_n_type (tree elt
, int n
)
828 return build_cplus_array_type (elt
, build_index_type (size_int (n
- 1)));
831 /* Return a reference type node referring to TO_TYPE. If RVAL is
832 true, return an rvalue reference type, otherwise return an lvalue
833 reference type. If a type node exists, reuse it, otherwise create
836 cp_build_reference_type (tree to_type
, bool rval
)
839 lvalue_ref
= build_reference_type (to_type
);
843 /* This code to create rvalue reference types is based on and tied
844 to the code creating lvalue reference types in the middle-end
845 functions build_reference_type_for_mode and build_reference_type.
847 It works by putting the rvalue reference type nodes after the
848 lvalue reference nodes in the TYPE_NEXT_REF_TO linked list, so
849 they will effectively be ignored by the middle end. */
851 for (t
= lvalue_ref
; (t
= TYPE_NEXT_REF_TO (t
)); )
852 if (TYPE_REF_IS_RVALUE (t
))
855 t
= build_distinct_type_copy (lvalue_ref
);
857 TYPE_REF_IS_RVALUE (t
) = true;
858 TYPE_NEXT_REF_TO (t
) = TYPE_NEXT_REF_TO (lvalue_ref
);
859 TYPE_NEXT_REF_TO (lvalue_ref
) = t
;
861 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
862 SET_TYPE_STRUCTURAL_EQUALITY (t
);
863 else if (TYPE_CANONICAL (to_type
) != to_type
)
865 = cp_build_reference_type (TYPE_CANONICAL (to_type
), rval
);
867 TYPE_CANONICAL (t
) = t
;
875 /* Returns EXPR cast to rvalue reference type, like std::move. */
880 tree type
= TREE_TYPE (expr
);
881 gcc_assert (TREE_CODE (type
) != REFERENCE_TYPE
);
882 type
= cp_build_reference_type (type
, /*rval*/true);
883 return build_static_cast (type
, expr
, tf_warning_or_error
);
886 /* Used by the C++ front end to build qualified array types. However,
887 the C version of this function does not properly maintain canonical
888 types (which are not used in C). */
890 c_build_qualified_type (tree type
, int type_quals
)
892 return cp_build_qualified_type (type
, type_quals
);
896 /* Make a variant of TYPE, qualified with the TYPE_QUALS. Handles
897 arrays correctly. In particular, if TYPE is an array of T's, and
898 TYPE_QUALS is non-empty, returns an array of qualified T's.
900 FLAGS determines how to deal with ill-formed qualifications. If
901 tf_ignore_bad_quals is set, then bad qualifications are dropped
902 (this is permitted if TYPE was introduced via a typedef or template
903 type parameter). If bad qualifications are dropped and tf_warning
904 is set, then a warning is issued for non-const qualifications. If
905 tf_ignore_bad_quals is not set and tf_error is not set, we
906 return error_mark_node. Otherwise, we issue an error, and ignore
909 Qualification of a reference type is valid when the reference came
910 via a typedef or template type argument. [dcl.ref] No such
911 dispensation is provided for qualifying a function type. [dcl.fct]
912 DR 295 queries this and the proposed resolution brings it into line
913 with qualifying a reference. We implement the DR. We also behave
914 in a similar manner for restricting non-pointer types. */
917 cp_build_qualified_type_real (tree type
,
919 tsubst_flags_t complain
)
922 int bad_quals
= TYPE_UNQUALIFIED
;
924 if (type
== error_mark_node
)
927 if (type_quals
== cp_type_quals (type
))
930 if (TREE_CODE (type
) == ARRAY_TYPE
)
932 /* In C++, the qualification really applies to the array element
933 type. Obtain the appropriately qualified element type. */
936 = cp_build_qualified_type_real (TREE_TYPE (type
),
940 if (element_type
== error_mark_node
)
941 return error_mark_node
;
943 /* See if we already have an identically qualified type. Tests
944 should be equivalent to those in check_qualified_type. */
945 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
946 if (TREE_TYPE (t
) == element_type
947 && TYPE_NAME (t
) == TYPE_NAME (type
)
948 && TYPE_CONTEXT (t
) == TYPE_CONTEXT (type
)
949 && attribute_list_equal (TYPE_ATTRIBUTES (t
),
950 TYPE_ATTRIBUTES (type
)))
955 t
= build_cplus_array_type (element_type
, TYPE_DOMAIN (type
));
957 /* Keep the typedef name. */
958 if (TYPE_NAME (t
) != TYPE_NAME (type
))
960 t
= build_variant_type_copy (t
);
961 TYPE_NAME (t
) = TYPE_NAME (type
);
965 /* Even if we already had this variant, we update
966 TYPE_NEEDS_CONSTRUCTING and TYPE_HAS_NONTRIVIAL_DESTRUCTOR in case
967 they changed since the variant was originally created.
969 This seems hokey; if there is some way to use a previous
970 variant *without* coming through here,
971 TYPE_NEEDS_CONSTRUCTING will never be updated. */
972 TYPE_NEEDS_CONSTRUCTING (t
)
973 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (element_type
));
974 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
975 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (element_type
));
978 else if (TYPE_PTRMEMFUNC_P (type
))
980 /* For a pointer-to-member type, we can't just return a
981 cv-qualified version of the RECORD_TYPE. If we do, we
982 haven't changed the field that contains the actual pointer to
983 a method, and so TYPE_PTRMEMFUNC_FN_TYPE will be wrong. */
986 t
= TYPE_PTRMEMFUNC_FN_TYPE (type
);
987 t
= cp_build_qualified_type_real (t
, type_quals
, complain
);
988 return build_ptrmemfunc_type (t
);
990 else if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
992 tree t
= PACK_EXPANSION_PATTERN (type
);
994 t
= cp_build_qualified_type_real (t
, type_quals
, complain
);
995 return make_pack_expansion (t
);
998 /* A reference or method type shall not be cv-qualified.
999 [dcl.ref], [dcl.fct]. This used to be an error, but as of DR 295
1000 (in CD1) we always ignore extra cv-quals on functions. */
1001 if (type_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)
1002 && (TREE_CODE (type
) == REFERENCE_TYPE
1003 || TREE_CODE (type
) == FUNCTION_TYPE
1004 || TREE_CODE (type
) == METHOD_TYPE
))
1006 if (TREE_CODE (type
) == REFERENCE_TYPE
)
1007 bad_quals
|= type_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
1008 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
1011 /* But preserve any function-cv-quals on a FUNCTION_TYPE. */
1012 if (TREE_CODE (type
) == FUNCTION_TYPE
)
1013 type_quals
|= type_memfn_quals (type
);
1015 /* A restrict-qualified type must be a pointer (or reference)
1016 to object or incomplete type. */
1017 if ((type_quals
& TYPE_QUAL_RESTRICT
)
1018 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
1019 && TREE_CODE (type
) != TYPENAME_TYPE
1020 && !POINTER_TYPE_P (type
))
1022 bad_quals
|= TYPE_QUAL_RESTRICT
;
1023 type_quals
&= ~TYPE_QUAL_RESTRICT
;
1026 if (bad_quals
== TYPE_UNQUALIFIED
1027 || (complain
& tf_ignore_bad_quals
))
1029 else if (!(complain
& tf_error
))
1030 return error_mark_node
;
1033 tree bad_type
= build_qualified_type (ptr_type_node
, bad_quals
);
1034 error ("%qV qualifiers cannot be applied to %qT",
1038 /* Retrieve (or create) the appropriately qualified variant. */
1039 result
= build_qualified_type (type
, type_quals
);
1041 /* If this was a pointer-to-method type, and we just made a copy,
1042 then we need to unshare the record that holds the cached
1043 pointer-to-member-function type, because these will be distinct
1044 between the unqualified and qualified types. */
1046 && TREE_CODE (type
) == POINTER_TYPE
1047 && TREE_CODE (TREE_TYPE (type
)) == METHOD_TYPE
1048 && TYPE_LANG_SPECIFIC (result
) == TYPE_LANG_SPECIFIC (type
))
1049 TYPE_LANG_SPECIFIC (result
) = NULL
;
1051 /* We may also have ended up building a new copy of the canonical
1052 type of a pointer-to-method type, which could have the same
1053 sharing problem described above. */
1054 if (TYPE_CANONICAL (result
) != TYPE_CANONICAL (type
)
1055 && TREE_CODE (type
) == POINTER_TYPE
1056 && TREE_CODE (TREE_TYPE (type
)) == METHOD_TYPE
1057 && (TYPE_LANG_SPECIFIC (TYPE_CANONICAL (result
))
1058 == TYPE_LANG_SPECIFIC (TYPE_CANONICAL (type
))))
1059 TYPE_LANG_SPECIFIC (TYPE_CANONICAL (result
)) = NULL
;
1064 /* Return TYPE with const and volatile removed. */
1067 cv_unqualified (tree type
)
1071 if (type
== error_mark_node
)
1074 quals
= cp_type_quals (type
);
1075 quals
&= ~(TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
);
1076 return cp_build_qualified_type (type
, quals
);
1079 /* Builds a qualified variant of T that is not a typedef variant.
1080 E.g. consider the following declarations:
1081 typedef const int ConstInt;
1082 typedef ConstInt* PtrConstInt;
1083 If T is PtrConstInt, this function returns a type representing
1085 In other words, if T is a typedef, the function returns the underlying type.
1086 The cv-qualification and attributes of the type returned match the
1088 They will always be compatible types.
1089 The returned type is built so that all of its subtypes
1090 recursively have their typedefs stripped as well.
1092 This is different from just returning TYPE_CANONICAL (T)
1093 Because of several reasons:
1094 * If T is a type that needs structural equality
1095 its TYPE_CANONICAL (T) will be NULL.
1096 * TYPE_CANONICAL (T) desn't carry type attributes
1097 and looses template parameter names. */
1100 strip_typedefs (tree t
)
1102 tree result
= NULL
, type
= NULL
, t0
= NULL
;
1104 if (!t
|| t
== error_mark_node
|| t
== TYPE_CANONICAL (t
))
1107 gcc_assert (TYPE_P (t
));
1109 switch (TREE_CODE (t
))
1112 type
= strip_typedefs (TREE_TYPE (t
));
1113 result
= build_pointer_type (type
);
1115 case REFERENCE_TYPE
:
1116 type
= strip_typedefs (TREE_TYPE (t
));
1117 result
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
1120 t0
= strip_typedefs (TYPE_OFFSET_BASETYPE (t
));
1121 type
= strip_typedefs (TREE_TYPE (t
));
1122 result
= build_offset_type (t0
, type
);
1125 if (TYPE_PTRMEMFUNC_P (t
))
1127 t0
= strip_typedefs (TYPE_PTRMEMFUNC_FN_TYPE (t
));
1128 result
= build_ptrmemfunc_type (t0
);
1132 type
= strip_typedefs (TREE_TYPE (t
));
1133 t0
= strip_typedefs (TYPE_DOMAIN (t
));;
1134 result
= build_cplus_array_type (type
, t0
);
1139 tree arg_types
= NULL
, arg_node
, arg_type
;
1140 for (arg_node
= TYPE_ARG_TYPES (t
);
1142 arg_node
= TREE_CHAIN (arg_node
))
1144 if (arg_node
== void_list_node
)
1146 arg_type
= strip_typedefs (TREE_VALUE (arg_node
));
1147 gcc_assert (arg_type
);
1150 tree_cons (TREE_PURPOSE (arg_node
), arg_type
, arg_types
);
1154 arg_types
= nreverse (arg_types
);
1156 /* A list of parameters not ending with an ellipsis
1157 must end with void_list_node. */
1159 arg_types
= chainon (arg_types
, void_list_node
);
1161 type
= strip_typedefs (TREE_TYPE (t
));
1162 if (TREE_CODE (t
) == METHOD_TYPE
)
1164 tree class_type
= TREE_TYPE (TREE_VALUE (arg_types
));
1165 gcc_assert (class_type
);
1167 build_method_type_directly (class_type
, type
,
1168 TREE_CHAIN (arg_types
));
1172 result
= build_function_type (type
,
1174 result
= apply_memfn_quals (result
, type_memfn_quals (t
));
1177 if (TYPE_RAISES_EXCEPTIONS (t
))
1178 result
= build_exception_variant (result
,
1179 TYPE_RAISES_EXCEPTIONS (t
));
1183 result
= make_typename_type (strip_typedefs (TYPE_CONTEXT (t
)),
1184 TYPENAME_TYPE_FULLNAME (t
),
1185 typename_type
, tf_none
);
1192 result
= TYPE_MAIN_VARIANT (t
);
1193 if (TYPE_USER_ALIGN (t
) != TYPE_USER_ALIGN (result
)
1194 || TYPE_ALIGN (t
) != TYPE_ALIGN (result
))
1196 gcc_assert (TYPE_USER_ALIGN (t
));
1197 if (TYPE_ALIGN (t
) == TYPE_ALIGN (result
))
1198 result
= build_variant_type_copy (result
);
1200 result
= build_aligned_type (result
, TYPE_ALIGN (t
));
1201 TYPE_USER_ALIGN (result
) = true;
1203 if (TYPE_ATTRIBUTES (t
))
1204 result
= cp_build_type_attribute_variant (result
, TYPE_ATTRIBUTES (t
));
1205 return cp_build_qualified_type (result
, cp_type_quals (t
));
1208 /* Makes a copy of BINFO and TYPE, which is to be inherited into a
1209 graph dominated by T. If BINFO is NULL, TYPE is a dependent base,
1210 and we do a shallow copy. If BINFO is non-NULL, we do a deep copy.
1211 VIRT indicates whether TYPE is inherited virtually or not.
1212 IGO_PREV points at the previous binfo of the inheritance graph
1213 order chain. The newly copied binfo's TREE_CHAIN forms this
1216 The CLASSTYPE_VBASECLASSES vector of T is constructed in the
1217 correct order. That is in the order the bases themselves should be
1220 The BINFO_INHERITANCE of a virtual base class points to the binfo
1221 of the most derived type. ??? We could probably change this so that
1222 BINFO_INHERITANCE becomes synonymous with BINFO_PRIMARY, and hence
1223 remove a field. They currently can only differ for primary virtual
1227 copy_binfo (tree binfo
, tree type
, tree t
, tree
*igo_prev
, int virt
)
1233 /* See if we've already made this virtual base. */
1234 new_binfo
= binfo_for_vbase (type
, t
);
1239 new_binfo
= make_tree_binfo (binfo
? BINFO_N_BASE_BINFOS (binfo
) : 0);
1240 BINFO_TYPE (new_binfo
) = type
;
1242 /* Chain it into the inheritance graph. */
1243 TREE_CHAIN (*igo_prev
) = new_binfo
;
1244 *igo_prev
= new_binfo
;
1246 if (binfo
&& !BINFO_DEPENDENT_BASE_P (binfo
))
1251 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), type
));
1253 BINFO_OFFSET (new_binfo
) = BINFO_OFFSET (binfo
);
1254 BINFO_VIRTUALS (new_binfo
) = BINFO_VIRTUALS (binfo
);
1256 /* We do not need to copy the accesses, as they are read only. */
1257 BINFO_BASE_ACCESSES (new_binfo
) = BINFO_BASE_ACCESSES (binfo
);
1259 /* Recursively copy base binfos of BINFO. */
1260 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ix
++)
1262 tree new_base_binfo
;
1263 new_base_binfo
= copy_binfo (base_binfo
, BINFO_TYPE (base_binfo
),
1265 BINFO_VIRTUAL_P (base_binfo
));
1267 if (!BINFO_INHERITANCE_CHAIN (new_base_binfo
))
1268 BINFO_INHERITANCE_CHAIN (new_base_binfo
) = new_binfo
;
1269 BINFO_BASE_APPEND (new_binfo
, new_base_binfo
);
1273 BINFO_DEPENDENT_BASE_P (new_binfo
) = 1;
1277 /* Push it onto the list after any virtual bases it contains
1278 will have been pushed. */
1279 VEC_quick_push (tree
, CLASSTYPE_VBASECLASSES (t
), new_binfo
);
1280 BINFO_VIRTUAL_P (new_binfo
) = 1;
1281 BINFO_INHERITANCE_CHAIN (new_binfo
) = TYPE_BINFO (t
);
1287 /* Hashing of lists so that we don't make duplicates.
1288 The entry point is `list_hash_canon'. */
1290 /* Now here is the hash table. When recording a list, it is added
1291 to the slot whose index is the hash code mod the table size.
1292 Note that the hash table is used for several kinds of lists.
1293 While all these live in the same table, they are completely independent,
1294 and the hash code is computed differently for each of these. */
1296 static GTY ((param_is (union tree_node
))) htab_t list_hash_table
;
1305 /* Compare ENTRY (an entry in the hash table) with DATA (a list_proxy
1306 for a node we are thinking about adding). */
1309 list_hash_eq (const void* entry
, const void* data
)
1311 const_tree
const t
= (const_tree
) entry
;
1312 const struct list_proxy
*const proxy
= (const struct list_proxy
*) data
;
1314 return (TREE_VALUE (t
) == proxy
->value
1315 && TREE_PURPOSE (t
) == proxy
->purpose
1316 && TREE_CHAIN (t
) == proxy
->chain
);
1319 /* Compute a hash code for a list (chain of TREE_LIST nodes
1320 with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the
1321 TREE_COMMON slots), by adding the hash codes of the individual entries. */
1324 list_hash_pieces (tree purpose
, tree value
, tree chain
)
1326 hashval_t hashcode
= 0;
1329 hashcode
+= TREE_HASH (chain
);
1332 hashcode
+= TREE_HASH (value
);
1336 hashcode
+= TREE_HASH (purpose
);
1342 /* Hash an already existing TREE_LIST. */
1345 list_hash (const void* p
)
1347 const_tree
const t
= (const_tree
) p
;
1348 return list_hash_pieces (TREE_PURPOSE (t
),
1353 /* Given list components PURPOSE, VALUE, AND CHAIN, return the canonical
1354 object for an identical list if one already exists. Otherwise, build a
1355 new one, and record it as the canonical object. */
1358 hash_tree_cons (tree purpose
, tree value
, tree chain
)
1362 struct list_proxy proxy
;
1364 /* Hash the list node. */
1365 hashcode
= list_hash_pieces (purpose
, value
, chain
);
1366 /* Create a proxy for the TREE_LIST we would like to create. We
1367 don't actually create it so as to avoid creating garbage. */
1368 proxy
.purpose
= purpose
;
1369 proxy
.value
= value
;
1370 proxy
.chain
= chain
;
1371 /* See if it is already in the table. */
1372 slot
= htab_find_slot_with_hash (list_hash_table
, &proxy
, hashcode
,
1374 /* If not, create a new node. */
1376 *slot
= tree_cons (purpose
, value
, chain
);
1377 return (tree
) *slot
;
1380 /* Constructor for hashed lists. */
1383 hash_tree_chain (tree value
, tree chain
)
1385 return hash_tree_cons (NULL_TREE
, value
, chain
);
1389 debug_binfo (tree elem
)
1394 fprintf (stderr
, "type \"%s\", offset = " HOST_WIDE_INT_PRINT_DEC
1396 TYPE_NAME_STRING (BINFO_TYPE (elem
)),
1397 TREE_INT_CST_LOW (BINFO_OFFSET (elem
)));
1398 debug_tree (BINFO_TYPE (elem
));
1399 if (BINFO_VTABLE (elem
))
1400 fprintf (stderr
, "vtable decl \"%s\"\n",
1401 IDENTIFIER_POINTER (DECL_NAME (get_vtbl_decl_for_binfo (elem
))));
1403 fprintf (stderr
, "no vtable decl yet\n");
1404 fprintf (stderr
, "virtuals:\n");
1405 virtuals
= BINFO_VIRTUALS (elem
);
1410 tree fndecl
= TREE_VALUE (virtuals
);
1411 fprintf (stderr
, "%s [%ld =? %ld]\n",
1412 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl
)),
1413 (long) n
, (long) TREE_INT_CST_LOW (DECL_VINDEX (fndecl
)));
1415 virtuals
= TREE_CHAIN (virtuals
);
1419 /* Build a representation for the qualified name SCOPE::NAME. TYPE is
1420 the type of the result expression, if known, or NULL_TREE if the
1421 resulting expression is type-dependent. If TEMPLATE_P is true,
1422 NAME is known to be a template because the user explicitly used the
1423 "template" keyword after the "::".
1425 All SCOPE_REFs should be built by use of this function. */
1428 build_qualified_name (tree type
, tree scope
, tree name
, bool template_p
)
1431 if (type
== error_mark_node
1432 || scope
== error_mark_node
1433 || name
== error_mark_node
)
1434 return error_mark_node
;
1435 t
= build2 (SCOPE_REF
, type
, scope
, name
);
1436 QUALIFIED_NAME_IS_TEMPLATE (t
) = template_p
;
1437 PTRMEM_OK_P (t
) = true;
1439 t
= convert_from_reference (t
);
1443 /* Returns nonzero if X is an expression for a (possibly overloaded)
1444 function. If "f" is a function or function template, "f", "c->f",
1445 "c.f", "C::f", and "f<int>" will all be considered possibly
1446 overloaded functions. Returns 2 if the function is actually
1447 overloaded, i.e., if it is impossible to know the type of the
1448 function without performing overload resolution. */
1451 is_overloaded_fn (tree x
)
1453 /* A baselink is also considered an overloaded function. */
1454 if (TREE_CODE (x
) == OFFSET_REF
1455 || TREE_CODE (x
) == COMPONENT_REF
)
1456 x
= TREE_OPERAND (x
, 1);
1458 x
= BASELINK_FUNCTIONS (x
);
1459 if (TREE_CODE (x
) == TEMPLATE_ID_EXPR
)
1460 x
= TREE_OPERAND (x
, 0);
1461 if (DECL_FUNCTION_TEMPLATE_P (OVL_CURRENT (x
))
1462 || (TREE_CODE (x
) == OVERLOAD
&& OVL_CHAIN (x
)))
1464 return (TREE_CODE (x
) == FUNCTION_DECL
1465 || TREE_CODE (x
) == OVERLOAD
);
1468 /* X is the CALL_EXPR_FN of a CALL_EXPR. If X represents a dependent name
1469 (14.6.2), return the IDENTIFIER_NODE for that name. Otherwise, return
1473 dependent_name (tree x
)
1475 if (TREE_CODE (x
) == IDENTIFIER_NODE
)
1477 if (TREE_CODE (x
) != COMPONENT_REF
1478 && TREE_CODE (x
) != OFFSET_REF
1479 && TREE_CODE (x
) != BASELINK
1480 && is_overloaded_fn (x
))
1481 return DECL_NAME (get_first_fn (x
));
1485 /* Returns true iff X is an expression for an overloaded function
1486 whose type cannot be known without performing overload
1490 really_overloaded_fn (tree x
)
1492 return is_overloaded_fn (x
) == 2;
1498 gcc_assert (is_overloaded_fn (from
));
1499 /* A baselink is also considered an overloaded function. */
1500 if (TREE_CODE (from
) == OFFSET_REF
1501 || TREE_CODE (from
) == COMPONENT_REF
)
1502 from
= TREE_OPERAND (from
, 1);
1503 if (BASELINK_P (from
))
1504 from
= BASELINK_FUNCTIONS (from
);
1505 if (TREE_CODE (from
) == TEMPLATE_ID_EXPR
)
1506 from
= TREE_OPERAND (from
, 0);
1511 get_first_fn (tree from
)
1513 return OVL_CURRENT (get_fns (from
));
1516 /* Return a new OVL node, concatenating it with the old one. */
1519 ovl_cons (tree decl
, tree chain
)
1521 tree result
= make_node (OVERLOAD
);
1522 TREE_TYPE (result
) = unknown_type_node
;
1523 OVL_FUNCTION (result
) = decl
;
1524 TREE_CHAIN (result
) = chain
;
1529 /* Build a new overloaded function. If this is the first one,
1530 just return it; otherwise, ovl_cons the _DECLs */
1533 build_overload (tree decl
, tree chain
)
1535 if (! chain
&& TREE_CODE (decl
) != TEMPLATE_DECL
)
1537 return ovl_cons (decl
, chain
);
1540 /* Return the scope where the overloaded functions OVL were found. */
1543 ovl_scope (tree ovl
)
1545 if (TREE_CODE (ovl
) == OFFSET_REF
1546 || TREE_CODE (ovl
) == COMPONENT_REF
)
1547 ovl
= TREE_OPERAND (ovl
, 1);
1548 if (TREE_CODE (ovl
) == BASELINK
)
1549 return BINFO_TYPE (BASELINK_BINFO (ovl
));
1550 if (TREE_CODE (ovl
) == TEMPLATE_ID_EXPR
)
1551 ovl
= TREE_OPERAND (ovl
, 0);
1552 /* Skip using-declarations. */
1553 while (TREE_CODE (ovl
) == OVERLOAD
&& OVL_USED (ovl
) && OVL_CHAIN (ovl
))
1554 ovl
= OVL_CHAIN (ovl
);
1555 return CP_DECL_CONTEXT (OVL_CURRENT (ovl
));
1558 /* Return TRUE if FN is a non-static member function, FALSE otherwise.
1559 This function looks into BASELINK and OVERLOAD nodes. */
1562 non_static_member_function_p (tree fn
)
1564 if (fn
== NULL_TREE
)
1567 if (is_overloaded_fn (fn
))
1568 fn
= get_first_fn (fn
);
1571 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
));
1575 #define PRINT_RING_SIZE 4
1578 cxx_printable_name_internal (tree decl
, int v
, bool translate
)
1580 static unsigned int uid_ring
[PRINT_RING_SIZE
];
1581 static char *print_ring
[PRINT_RING_SIZE
];
1582 static bool trans_ring
[PRINT_RING_SIZE
];
1583 static int ring_counter
;
1586 /* Only cache functions. */
1588 || TREE_CODE (decl
) != FUNCTION_DECL
1589 || DECL_LANG_SPECIFIC (decl
) == 0)
1590 return lang_decl_name (decl
, v
, translate
);
1592 /* See if this print name is lying around. */
1593 for (i
= 0; i
< PRINT_RING_SIZE
; i
++)
1594 if (uid_ring
[i
] == DECL_UID (decl
) && translate
== trans_ring
[i
])
1595 /* yes, so return it. */
1596 return print_ring
[i
];
1598 if (++ring_counter
== PRINT_RING_SIZE
)
1601 if (current_function_decl
!= NULL_TREE
)
1603 /* There may be both translated and untranslated versions of the
1605 for (i
= 0; i
< 2; i
++)
1607 if (uid_ring
[ring_counter
] == DECL_UID (current_function_decl
))
1609 if (ring_counter
== PRINT_RING_SIZE
)
1612 gcc_assert (uid_ring
[ring_counter
] != DECL_UID (current_function_decl
));
1615 free (print_ring
[ring_counter
]);
1617 print_ring
[ring_counter
] = xstrdup (lang_decl_name (decl
, v
, translate
));
1618 uid_ring
[ring_counter
] = DECL_UID (decl
);
1619 trans_ring
[ring_counter
] = translate
;
1620 return print_ring
[ring_counter
];
1624 cxx_printable_name (tree decl
, int v
)
1626 return cxx_printable_name_internal (decl
, v
, false);
1630 cxx_printable_name_translate (tree decl
, int v
)
1632 return cxx_printable_name_internal (decl
, v
, true);
1635 /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions
1636 listed in RAISES. */
1639 build_exception_variant (tree type
, tree raises
)
1644 if (comp_except_specs (raises
, TYPE_RAISES_EXCEPTIONS (type
), ce_exact
))
1647 type_quals
= TYPE_QUALS (type
);
1648 for (v
= TYPE_MAIN_VARIANT (type
); v
; v
= TYPE_NEXT_VARIANT (v
))
1649 if (check_qualified_type (v
, type
, type_quals
)
1650 && comp_except_specs (raises
, TYPE_RAISES_EXCEPTIONS (v
), ce_exact
))
1653 /* Need to build a new variant. */
1654 v
= build_variant_type_copy (type
);
1655 TYPE_RAISES_EXCEPTIONS (v
) = raises
;
1659 /* Given a TEMPLATE_TEMPLATE_PARM node T, create a new
1660 BOUND_TEMPLATE_TEMPLATE_PARM bound with NEWARGS as its template
1664 bind_template_template_parm (tree t
, tree newargs
)
1666 tree decl
= TYPE_NAME (t
);
1669 t2
= cxx_make_type (BOUND_TEMPLATE_TEMPLATE_PARM
);
1670 decl
= build_decl (input_location
,
1671 TYPE_DECL
, DECL_NAME (decl
), NULL_TREE
);
1673 /* These nodes have to be created to reflect new TYPE_DECL and template
1675 TEMPLATE_TYPE_PARM_INDEX (t2
) = copy_node (TEMPLATE_TYPE_PARM_INDEX (t
));
1676 TEMPLATE_PARM_DECL (TEMPLATE_TYPE_PARM_INDEX (t2
)) = decl
;
1677 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2
)
1678 = build_template_info (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t
), newargs
);
1680 TREE_TYPE (decl
) = t2
;
1681 TYPE_NAME (t2
) = decl
;
1682 TYPE_STUB_DECL (t2
) = decl
;
1684 SET_TYPE_STRUCTURAL_EQUALITY (t2
);
1689 /* Called from count_trees via walk_tree. */
1692 count_trees_r (tree
*tp
, int *walk_subtrees
, void *data
)
1702 /* Debugging function for measuring the rough complexity of a tree
1706 count_trees (tree t
)
1709 cp_walk_tree_without_duplicates (&t
, count_trees_r
, &n_trees
);
1713 /* Called from verify_stmt_tree via walk_tree. */
1716 verify_stmt_tree_r (tree
* tp
,
1717 int* walk_subtrees ATTRIBUTE_UNUSED
,
1721 htab_t
*statements
= (htab_t
*) data
;
1724 if (!STATEMENT_CODE_P (TREE_CODE (t
)))
1727 /* If this statement is already present in the hash table, then
1728 there is a circularity in the statement tree. */
1729 gcc_assert (!htab_find (*statements
, t
));
1731 slot
= htab_find_slot (*statements
, t
, INSERT
);
1737 /* Debugging function to check that the statement T has not been
1738 corrupted. For now, this function simply checks that T contains no
1742 verify_stmt_tree (tree t
)
1745 statements
= htab_create (37, htab_hash_pointer
, htab_eq_pointer
, NULL
);
1746 cp_walk_tree (&t
, verify_stmt_tree_r
, &statements
, NULL
);
1747 htab_delete (statements
);
1750 /* Check if the type T depends on a type with no linkage and if so, return
1751 it. If RELAXED_P then do not consider a class type declared within
1752 a vague-linkage function to have no linkage. */
1755 no_linkage_check (tree t
, bool relaxed_p
)
1759 /* There's no point in checking linkage on template functions; we
1760 can't know their complete types. */
1761 if (processing_template_decl
)
1764 switch (TREE_CODE (t
))
1767 if (TYPE_PTRMEMFUNC_P (t
))
1769 /* Lambda types that don't have mangling scope have no linkage. We
1770 check CLASSTYPE_LAMBDA_EXPR here rather than LAMBDA_TYPE_P because
1771 when we get here from pushtag none of the lambda information is
1772 set up yet, so we want to assume that the lambda has linkage and
1773 fix it up later if not. */
1774 if (CLASSTYPE_LAMBDA_EXPR (t
)
1775 && LAMBDA_TYPE_EXTRA_SCOPE (t
) == NULL_TREE
)
1779 if (!CLASS_TYPE_P (t
))
1783 /* Only treat anonymous types as having no linkage if they're at
1784 namespace scope. This is core issue 966. */
1785 if (TYPE_ANONYMOUS_P (t
) && TYPE_NAMESPACE_SCOPE_P (t
))
1788 for (r
= CP_TYPE_CONTEXT (t
); ; )
1790 /* If we're a nested type of a !TREE_PUBLIC class, we might not
1791 have linkage, or we might just be in an anonymous namespace.
1792 If we're in a TREE_PUBLIC class, we have linkage. */
1793 if (TYPE_P (r
) && !TREE_PUBLIC (TYPE_NAME (r
)))
1794 return no_linkage_check (TYPE_CONTEXT (t
), relaxed_p
);
1795 else if (TREE_CODE (r
) == FUNCTION_DECL
)
1797 if (!relaxed_p
|| !vague_linkage_p (r
))
1800 r
= CP_DECL_CONTEXT (r
);
1810 case REFERENCE_TYPE
:
1811 return no_linkage_check (TREE_TYPE (t
), relaxed_p
);
1815 r
= no_linkage_check (TYPE_PTRMEM_POINTED_TO_TYPE (t
),
1819 return no_linkage_check (TYPE_PTRMEM_CLASS_TYPE (t
), relaxed_p
);
1822 r
= no_linkage_check (TYPE_METHOD_BASETYPE (t
), relaxed_p
);
1829 for (parm
= TYPE_ARG_TYPES (t
);
1830 parm
&& parm
!= void_list_node
;
1831 parm
= TREE_CHAIN (parm
))
1833 r
= no_linkage_check (TREE_VALUE (parm
), relaxed_p
);
1837 return no_linkage_check (TREE_TYPE (t
), relaxed_p
);
1845 #ifdef GATHER_STATISTICS
1846 extern int depth_reached
;
1850 cxx_print_statistics (void)
1852 print_search_statistics ();
1853 print_class_statistics ();
1854 print_template_statistics ();
1855 #ifdef GATHER_STATISTICS
1856 fprintf (stderr
, "maximum template instantiation depth reached: %d\n",
1861 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1862 (which is an ARRAY_TYPE). This counts only elements of the top
1866 array_type_nelts_top (tree type
)
1868 return fold_build2_loc (input_location
,
1869 PLUS_EXPR
, sizetype
,
1870 array_type_nelts (type
),
1874 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1875 (which is an ARRAY_TYPE). This one is a recursive count of all
1876 ARRAY_TYPEs that are clumped together. */
1879 array_type_nelts_total (tree type
)
1881 tree sz
= array_type_nelts_top (type
);
1882 type
= TREE_TYPE (type
);
1883 while (TREE_CODE (type
) == ARRAY_TYPE
)
1885 tree n
= array_type_nelts_top (type
);
1886 sz
= fold_build2_loc (input_location
,
1887 MULT_EXPR
, sizetype
, sz
, n
);
1888 type
= TREE_TYPE (type
);
1893 /* Called from break_out_target_exprs via mapcar. */
1896 bot_manip (tree
* tp
, int* walk_subtrees
, void* data
)
1898 splay_tree target_remap
= ((splay_tree
) data
);
1901 if (!TYPE_P (t
) && TREE_CONSTANT (t
) && !TREE_SIDE_EFFECTS (t
))
1903 /* There can't be any TARGET_EXPRs or their slot variables below this
1904 point. But we must make a copy, in case subsequent processing
1905 alters any part of it. For example, during gimplification a cast
1906 of the form (T) &X::f (where "f" is a member function) will lead
1907 to replacing the PTRMEM_CST for &X::f with a VAR_DECL. */
1909 *tp
= unshare_expr (t
);
1912 if (TREE_CODE (t
) == TARGET_EXPR
)
1916 if (TREE_CODE (TREE_OPERAND (t
, 1)) == AGGR_INIT_EXPR
)
1918 u
= build_cplus_new (TREE_TYPE (t
), TREE_OPERAND (t
, 1),
1919 tf_warning_or_error
);
1920 if (AGGR_INIT_ZERO_FIRST (TREE_OPERAND (t
, 1)))
1921 AGGR_INIT_ZERO_FIRST (TREE_OPERAND (u
, 1)) = true;
1924 u
= build_target_expr_with_type (TREE_OPERAND (t
, 1), TREE_TYPE (t
),
1925 tf_warning_or_error
);
1927 TARGET_EXPR_IMPLICIT_P (u
) = TARGET_EXPR_IMPLICIT_P (t
);
1928 TARGET_EXPR_LIST_INIT_P (u
) = TARGET_EXPR_LIST_INIT_P (t
);
1929 TARGET_EXPR_DIRECT_INIT_P (u
) = TARGET_EXPR_DIRECT_INIT_P (t
);
1931 /* Map the old variable to the new one. */
1932 splay_tree_insert (target_remap
,
1933 (splay_tree_key
) TREE_OPERAND (t
, 0),
1934 (splay_tree_value
) TREE_OPERAND (u
, 0));
1936 TREE_OPERAND (u
, 1) = break_out_target_exprs (TREE_OPERAND (u
, 1));
1938 /* Replace the old expression with the new version. */
1940 /* We don't have to go below this point; the recursive call to
1941 break_out_target_exprs will have handled anything below this
1947 /* Make a copy of this node. */
1948 t
= copy_tree_r (tp
, walk_subtrees
, NULL
);
1949 if (TREE_CODE (*tp
) == CALL_EXPR
)
1950 set_flags_from_callee (*tp
);
1954 /* Replace all remapped VAR_DECLs in T with their new equivalents.
1955 DATA is really a splay-tree mapping old variables to new
1959 bot_replace (tree
* t
,
1960 int* walk_subtrees ATTRIBUTE_UNUSED
,
1963 splay_tree target_remap
= ((splay_tree
) data
);
1965 if (TREE_CODE (*t
) == VAR_DECL
)
1967 splay_tree_node n
= splay_tree_lookup (target_remap
,
1968 (splay_tree_key
) *t
);
1970 *t
= (tree
) n
->value
;
1972 else if (TREE_CODE (*t
) == PARM_DECL
1973 && DECL_NAME (*t
) == this_identifier
)
1975 /* In an NSDMI we need to replace the 'this' parameter we used for
1976 parsing with the real one for this function. */
1977 *t
= current_class_ptr
;
1979 else if (TREE_CODE (*t
) == CONVERT_EXPR
1980 && CONVERT_EXPR_VBASE_PATH (*t
))
1982 /* In an NSDMI build_base_path defers building conversions to virtual
1983 bases, and we handle it here. */
1984 tree basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (*t
)));
1985 VEC(tree
,gc
) *vbases
= CLASSTYPE_VBASECLASSES (current_class_type
);
1987 FOR_EACH_VEC_ELT (tree
, vbases
, i
, binfo
)
1988 if (BINFO_TYPE (binfo
) == basetype
)
1990 *t
= build_base_path (PLUS_EXPR
, TREE_OPERAND (*t
, 0), binfo
, true,
1991 tf_warning_or_error
);
1997 /* When we parse a default argument expression, we may create
1998 temporary variables via TARGET_EXPRs. When we actually use the
1999 default-argument expression, we make a copy of the expression
2000 and replace the temporaries with appropriate local versions. */
2003 break_out_target_exprs (tree t
)
2005 static int target_remap_count
;
2006 static splay_tree target_remap
;
2008 if (!target_remap_count
++)
2009 target_remap
= splay_tree_new (splay_tree_compare_pointers
,
2010 /*splay_tree_delete_key_fn=*/NULL
,
2011 /*splay_tree_delete_value_fn=*/NULL
);
2012 cp_walk_tree (&t
, bot_manip
, target_remap
, NULL
);
2013 cp_walk_tree (&t
, bot_replace
, target_remap
, NULL
);
2015 if (!--target_remap_count
)
2017 splay_tree_delete (target_remap
);
2018 target_remap
= NULL
;
2024 /* Similar to `build_nt', but for template definitions of dependent
2028 build_min_nt (enum tree_code code
, ...)
2035 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
2039 t
= make_node (code
);
2040 length
= TREE_CODE_LENGTH (code
);
2042 for (i
= 0; i
< length
; i
++)
2044 tree x
= va_arg (p
, tree
);
2045 TREE_OPERAND (t
, i
) = x
;
2053 /* Similar to `build', but for template definitions. */
2056 build_min (enum tree_code code
, tree tt
, ...)
2063 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
2067 t
= make_node (code
);
2068 length
= TREE_CODE_LENGTH (code
);
2071 for (i
= 0; i
< length
; i
++)
2073 tree x
= va_arg (p
, tree
);
2074 TREE_OPERAND (t
, i
) = x
;
2075 if (x
&& !TYPE_P (x
) && TREE_SIDE_EFFECTS (x
))
2076 TREE_SIDE_EFFECTS (t
) = 1;
2083 /* Similar to `build', but for template definitions of non-dependent
2084 expressions. NON_DEP is the non-dependent expression that has been
2088 build_min_non_dep (enum tree_code code
, tree non_dep
, ...)
2095 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
2097 va_start (p
, non_dep
);
2099 if (REFERENCE_REF_P (non_dep
))
2100 non_dep
= TREE_OPERAND (non_dep
, 0);
2102 t
= make_node (code
);
2103 length
= TREE_CODE_LENGTH (code
);
2104 TREE_TYPE (t
) = TREE_TYPE (non_dep
);
2105 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (non_dep
);
2107 for (i
= 0; i
< length
; i
++)
2109 tree x
= va_arg (p
, tree
);
2110 TREE_OPERAND (t
, i
) = x
;
2113 if (code
== COMPOUND_EXPR
&& TREE_CODE (non_dep
) != COMPOUND_EXPR
)
2114 /* This should not be considered a COMPOUND_EXPR, because it
2115 resolves to an overload. */
2116 COMPOUND_EXPR_OVERLOADED (t
) = 1;
2119 return convert_from_reference (t
);
2122 /* Similar to `build_nt_call_vec', but for template definitions of
2123 non-dependent expressions. NON_DEP is the non-dependent expression
2124 that has been built. */
2127 build_min_non_dep_call_vec (tree non_dep
, tree fn
, VEC(tree
,gc
) *argvec
)
2129 tree t
= build_nt_call_vec (fn
, argvec
);
2130 if (REFERENCE_REF_P (non_dep
))
2131 non_dep
= TREE_OPERAND (non_dep
, 0);
2132 TREE_TYPE (t
) = TREE_TYPE (non_dep
);
2133 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (non_dep
);
2134 return convert_from_reference (t
);
2138 get_type_decl (tree t
)
2140 if (TREE_CODE (t
) == TYPE_DECL
)
2143 return TYPE_STUB_DECL (t
);
2144 gcc_assert (t
== error_mark_node
);
2148 /* Returns the namespace that contains DECL, whether directly or
2152 decl_namespace_context (tree decl
)
2156 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
2158 else if (TYPE_P (decl
))
2159 decl
= CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl
));
2161 decl
= CP_DECL_CONTEXT (decl
);
2165 /* Returns true if decl is within an anonymous namespace, however deeply
2166 nested, or false otherwise. */
2169 decl_anon_ns_mem_p (const_tree decl
)
2173 if (decl
== NULL_TREE
|| decl
== error_mark_node
)
2175 if (TREE_CODE (decl
) == NAMESPACE_DECL
2176 && DECL_NAME (decl
) == NULL_TREE
)
2178 /* Classes and namespaces inside anonymous namespaces have
2179 TREE_PUBLIC == 0, so we can shortcut the search. */
2180 else if (TYPE_P (decl
))
2181 return (TREE_PUBLIC (TYPE_NAME (decl
)) == 0);
2182 else if (TREE_CODE (decl
) == NAMESPACE_DECL
)
2183 return (TREE_PUBLIC (decl
) == 0);
2185 decl
= DECL_CONTEXT (decl
);
2189 /* Subroutine of cp_tree_equal: t1 and t2 are the CALL_EXPR_FNs of two
2190 CALL_EXPRS. Return whether they are equivalent. */
2193 called_fns_equal (tree t1
, tree t2
)
2195 /* Core 1321: dependent names are equivalent even if the overload sets
2196 are different. But do compare explicit template arguments. */
2197 tree name1
= dependent_name (t1
);
2198 tree name2
= dependent_name (t2
);
2201 tree targs1
= NULL_TREE
, targs2
= NULL_TREE
;
2206 if (TREE_CODE (t1
) == TEMPLATE_ID_EXPR
)
2207 targs1
= TREE_OPERAND (t1
, 1);
2208 if (TREE_CODE (t2
) == TEMPLATE_ID_EXPR
)
2209 targs2
= TREE_OPERAND (t2
, 1);
2210 return cp_tree_equal (targs1
, targs2
);
2213 return cp_tree_equal (t1
, t2
);
2216 /* Return truthvalue of whether T1 is the same tree structure as T2.
2217 Return 1 if they are the same. Return 0 if they are different. */
2220 cp_tree_equal (tree t1
, tree t2
)
2222 enum tree_code code1
, code2
;
2229 for (code1
= TREE_CODE (t1
);
2230 CONVERT_EXPR_CODE_P (code1
)
2231 || code1
== NON_LVALUE_EXPR
;
2232 code1
= TREE_CODE (t1
))
2233 t1
= TREE_OPERAND (t1
, 0);
2234 for (code2
= TREE_CODE (t2
);
2235 CONVERT_EXPR_CODE_P (code2
)
2236 || code1
== NON_LVALUE_EXPR
;
2237 code2
= TREE_CODE (t2
))
2238 t2
= TREE_OPERAND (t2
, 0);
2240 /* They might have become equal now. */
2250 return TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
2251 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
);
2254 return REAL_VALUES_EQUAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
2257 return TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
2258 && !memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
2259 TREE_STRING_LENGTH (t1
));
2262 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
),
2263 TREE_FIXED_CST (t2
));
2266 return cp_tree_equal (TREE_REALPART (t1
), TREE_REALPART (t2
))
2267 && cp_tree_equal (TREE_IMAGPART (t1
), TREE_IMAGPART (t2
));
2270 /* We need to do this when determining whether or not two
2271 non-type pointer to member function template arguments
2273 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
2274 || CONSTRUCTOR_NELTS (t1
) != CONSTRUCTOR_NELTS (t2
))
2279 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t1
), i
, field
, value
)
2281 constructor_elt
*elt2
= CONSTRUCTOR_ELT (t2
, i
);
2282 if (!cp_tree_equal (field
, elt2
->index
)
2283 || !cp_tree_equal (value
, elt2
->value
))
2290 if (!cp_tree_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
)))
2292 if (!cp_tree_equal (TREE_VALUE (t1
), TREE_VALUE (t2
)))
2294 return cp_tree_equal (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
2297 return cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2302 call_expr_arg_iterator iter1
, iter2
;
2303 if (!called_fns_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
)))
2305 for (arg1
= first_call_expr_arg (t1
, &iter1
),
2306 arg2
= first_call_expr_arg (t2
, &iter2
);
2308 arg1
= next_call_expr_arg (&iter1
),
2309 arg2
= next_call_expr_arg (&iter2
))
2310 if (!cp_tree_equal (arg1
, arg2
))
2319 tree o1
= TREE_OPERAND (t1
, 0);
2320 tree o2
= TREE_OPERAND (t2
, 0);
2322 /* Special case: if either target is an unallocated VAR_DECL,
2323 it means that it's going to be unified with whatever the
2324 TARGET_EXPR is really supposed to initialize, so treat it
2325 as being equivalent to anything. */
2326 if (TREE_CODE (o1
) == VAR_DECL
&& DECL_NAME (o1
) == NULL_TREE
2327 && !DECL_RTL_SET_P (o1
))
2329 else if (TREE_CODE (o2
) == VAR_DECL
&& DECL_NAME (o2
) == NULL_TREE
2330 && !DECL_RTL_SET_P (o2
))
2332 else if (!cp_tree_equal (o1
, o2
))
2335 return cp_tree_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
2338 case WITH_CLEANUP_EXPR
:
2339 if (!cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0)))
2341 return cp_tree_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
2344 if (TREE_OPERAND (t1
, 1) != TREE_OPERAND (t2
, 1))
2346 return cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2349 /* For comparing uses of parameters in late-specified return types
2350 with an out-of-class definition of the function, but can also come
2351 up for expressions that involve 'this' in a member function
2353 if (same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
2355 if (DECL_ARTIFICIAL (t1
) ^ DECL_ARTIFICIAL (t2
))
2357 if (DECL_ARTIFICIAL (t1
)
2358 || (DECL_PARM_LEVEL (t1
) == DECL_PARM_LEVEL (t2
)
2359 && DECL_PARM_INDEX (t1
) == DECL_PARM_INDEX (t2
)))
2368 case IDENTIFIER_NODE
:
2373 return (BASELINK_BINFO (t1
) == BASELINK_BINFO (t2
)
2374 && BASELINK_ACCESS_BINFO (t1
) == BASELINK_ACCESS_BINFO (t2
)
2375 && BASELINK_QUALIFIED_P (t1
) == BASELINK_QUALIFIED_P (t2
)
2376 && cp_tree_equal (BASELINK_FUNCTIONS (t1
),
2377 BASELINK_FUNCTIONS (t2
)));
2379 case TEMPLATE_PARM_INDEX
:
2380 if (TEMPLATE_PARM_NUM_SIBLINGS (t1
)
2381 != TEMPLATE_PARM_NUM_SIBLINGS (t2
))
2383 return (TEMPLATE_PARM_IDX (t1
) == TEMPLATE_PARM_IDX (t2
)
2384 && TEMPLATE_PARM_LEVEL (t1
) == TEMPLATE_PARM_LEVEL (t2
)
2385 && (TEMPLATE_PARM_PARAMETER_PACK (t1
)
2386 == TEMPLATE_PARM_PARAMETER_PACK (t2
))
2387 && same_type_p (TREE_TYPE (TEMPLATE_PARM_DECL (t1
)),
2388 TREE_TYPE (TEMPLATE_PARM_DECL (t2
))));
2390 case TEMPLATE_ID_EXPR
:
2391 return (cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0))
2392 && cp_tree_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1)));
2397 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
2399 for (ix
= TREE_VEC_LENGTH (t1
); ix
--;)
2400 if (!cp_tree_equal (TREE_VEC_ELT (t1
, ix
),
2401 TREE_VEC_ELT (t2
, ix
)))
2409 tree o1
= TREE_OPERAND (t1
, 0);
2410 tree o2
= TREE_OPERAND (t2
, 0);
2412 if (TREE_CODE (o1
) != TREE_CODE (o2
))
2415 return same_type_p (o1
, o2
);
2417 return cp_tree_equal (o1
, o2
);
2422 tree t1_op1
, t2_op1
;
2424 if (!cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0)))
2427 t1_op1
= TREE_OPERAND (t1
, 1);
2428 t2_op1
= TREE_OPERAND (t2
, 1);
2429 if (TREE_CODE (t1_op1
) != TREE_CODE (t2_op1
))
2432 return cp_tree_equal (TREE_OPERAND (t1
, 2), TREE_OPERAND (t2
, 2));
2436 /* Two pointer-to-members are the same if they point to the same
2437 field or function in the same class. */
2438 if (PTRMEM_CST_MEMBER (t1
) != PTRMEM_CST_MEMBER (t2
))
2441 return same_type_p (PTRMEM_CST_CLASS (t1
), PTRMEM_CST_CLASS (t2
));
2444 if (OVL_FUNCTION (t1
) != OVL_FUNCTION (t2
))
2446 return cp_tree_equal (OVL_CHAIN (t1
), OVL_CHAIN (t2
));
2449 if (TRAIT_EXPR_KIND (t1
) != TRAIT_EXPR_KIND (t2
))
2451 return same_type_p (TRAIT_EXPR_TYPE1 (t1
), TRAIT_EXPR_TYPE1 (t2
))
2452 && same_type_p (TRAIT_EXPR_TYPE2 (t1
), TRAIT_EXPR_TYPE2 (t2
));
2455 case STATIC_CAST_EXPR
:
2456 case REINTERPRET_CAST_EXPR
:
2457 case CONST_CAST_EXPR
:
2458 case DYNAMIC_CAST_EXPR
:
2459 case IMPLICIT_CONV_EXPR
:
2461 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
2463 /* Now compare operands as usual. */
2466 case DEFERRED_NOEXCEPT
:
2467 return (cp_tree_equal (DEFERRED_NOEXCEPT_PATTERN (t1
),
2468 DEFERRED_NOEXCEPT_PATTERN (t2
))
2469 && comp_template_args (DEFERRED_NOEXCEPT_ARGS (t1
),
2470 DEFERRED_NOEXCEPT_ARGS (t2
)));
2477 switch (TREE_CODE_CLASS (code1
))
2481 case tcc_comparison
:
2482 case tcc_expression
:
2489 n
= cp_tree_operand_length (t1
);
2490 if (TREE_CODE_CLASS (code1
) == tcc_vl_exp
2491 && n
!= TREE_OPERAND_LENGTH (t2
))
2494 for (i
= 0; i
< n
; ++i
)
2495 if (!cp_tree_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
)))
2502 return same_type_p (t1
, t2
);
2506 /* We can get here with --disable-checking. */
2510 /* The type of ARG when used as an lvalue. */
2513 lvalue_type (tree arg
)
2515 tree type
= TREE_TYPE (arg
);
2519 /* The type of ARG for printing error messages; denote lvalues with
2523 error_type (tree arg
)
2525 tree type
= TREE_TYPE (arg
);
2527 if (TREE_CODE (type
) == ARRAY_TYPE
)
2529 else if (TREE_CODE (type
) == ERROR_MARK
)
2531 else if (real_lvalue_p (arg
))
2532 type
= build_reference_type (lvalue_type (arg
));
2533 else if (MAYBE_CLASS_TYPE_P (type
))
2534 type
= lvalue_type (arg
);
2539 /* Does FUNCTION use a variable-length argument list? */
2542 varargs_function_p (const_tree function
)
2544 return stdarg_p (TREE_TYPE (function
));
2547 /* Returns 1 if decl is a member of a class. */
2550 member_p (const_tree decl
)
2552 const_tree
const ctx
= DECL_CONTEXT (decl
);
2553 return (ctx
&& TYPE_P (ctx
));
2556 /* Create a placeholder for member access where we don't actually have an
2557 object that the access is against. */
2560 build_dummy_object (tree type
)
2562 tree decl
= build1 (NOP_EXPR
, build_pointer_type (type
), void_zero_node
);
2563 return cp_build_indirect_ref (decl
, RO_NULL
, tf_warning_or_error
);
2566 /* We've gotten a reference to a member of TYPE. Return *this if appropriate,
2567 or a dummy object otherwise. If BINFOP is non-0, it is filled with the
2568 binfo path from current_class_type to TYPE, or 0. */
2571 maybe_dummy_object (tree type
, tree
* binfop
)
2575 tree current
= current_nonlambda_class_type ();
2578 && (binfo
= lookup_base (current
, type
, ba_any
, NULL
)))
2582 /* Reference from a nested class member function. */
2584 binfo
= TYPE_BINFO (type
);
2590 if (current_class_ref
2591 /* current_class_ref might not correspond to current_class_type if
2592 we're in tsubst_default_argument or a lambda-declarator; in either
2593 case, we want to use current_class_ref if it matches CONTEXT. */
2594 && (same_type_ignoring_top_level_qualifiers_p
2595 (TREE_TYPE (current_class_ref
), context
)))
2596 decl
= current_class_ref
;
2597 else if (current
!= current_class_type
2598 && context
== nonlambda_method_basetype ())
2599 /* In a lambda, need to go through 'this' capture. */
2600 decl
= (build_x_indirect_ref
2601 ((lambda_expr_this_capture
2602 (CLASSTYPE_LAMBDA_EXPR (current_class_type
))),
2603 RO_NULL
, tf_warning_or_error
));
2605 decl
= build_dummy_object (context
);
2610 /* Returns 1 if OB is a placeholder object, or a pointer to one. */
2613 is_dummy_object (const_tree ob
)
2615 if (TREE_CODE (ob
) == INDIRECT_REF
)
2616 ob
= TREE_OPERAND (ob
, 0);
2617 return (TREE_CODE (ob
) == NOP_EXPR
2618 && TREE_OPERAND (ob
, 0) == void_zero_node
);
2621 /* Returns 1 iff type T is something we want to treat as a scalar type for
2622 the purpose of deciding whether it is trivial/POD/standard-layout. */
2625 scalarish_type_p (const_tree t
)
2627 if (t
== error_mark_node
)
2630 return (SCALAR_TYPE_P (t
)
2631 || TREE_CODE (t
) == VECTOR_TYPE
);
2634 /* Returns true iff T requires non-trivial default initialization. */
2637 type_has_nontrivial_default_init (const_tree t
)
2639 t
= strip_array_types (CONST_CAST_TREE (t
));
2641 if (CLASS_TYPE_P (t
))
2642 return TYPE_HAS_COMPLEX_DFLT (t
);
2647 /* Returns true iff copying an object of type T (including via move
2648 constructor) is non-trivial. That is, T has no non-trivial copy
2649 constructors and no non-trivial move constructors. */
2652 type_has_nontrivial_copy_init (const_tree t
)
2654 t
= strip_array_types (CONST_CAST_TREE (t
));
2656 if (CLASS_TYPE_P (t
))
2658 gcc_assert (COMPLETE_TYPE_P (t
));
2659 return ((TYPE_HAS_COPY_CTOR (t
)
2660 && TYPE_HAS_COMPLEX_COPY_CTOR (t
))
2661 || TYPE_HAS_COMPLEX_MOVE_CTOR (t
));
2667 /* Returns 1 iff type T is a trivially copyable type, as defined in
2668 [basic.types] and [class]. */
2671 trivially_copyable_p (const_tree t
)
2673 t
= strip_array_types (CONST_CAST_TREE (t
));
2675 if (CLASS_TYPE_P (t
))
2676 return ((!TYPE_HAS_COPY_CTOR (t
)
2677 || !TYPE_HAS_COMPLEX_COPY_CTOR (t
))
2678 && !TYPE_HAS_COMPLEX_MOVE_CTOR (t
)
2679 && (!TYPE_HAS_COPY_ASSIGN (t
)
2680 || !TYPE_HAS_COMPLEX_COPY_ASSIGN (t
))
2681 && !TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
)
2682 && TYPE_HAS_TRIVIAL_DESTRUCTOR (t
));
2684 return scalarish_type_p (t
);
2687 /* Returns 1 iff type T is a trivial type, as defined in [basic.types] and
2691 trivial_type_p (const_tree t
)
2693 t
= strip_array_types (CONST_CAST_TREE (t
));
2695 if (CLASS_TYPE_P (t
))
2696 return (TYPE_HAS_TRIVIAL_DFLT (t
)
2697 && trivially_copyable_p (t
));
2699 return scalarish_type_p (t
);
2702 /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */
2705 pod_type_p (const_tree t
)
2707 /* This CONST_CAST is okay because strip_array_types returns its
2708 argument unmodified and we assign it to a const_tree. */
2709 t
= strip_array_types (CONST_CAST_TREE(t
));
2711 if (!CLASS_TYPE_P (t
))
2712 return scalarish_type_p (t
);
2713 else if (cxx_dialect
> cxx98
)
2714 /* [class]/10: A POD struct is a class that is both a trivial class and a
2715 standard-layout class, and has no non-static data members of type
2716 non-POD struct, non-POD union (or array of such types).
2718 We don't need to check individual members because if a member is
2719 non-std-layout or non-trivial, the class will be too. */
2720 return (std_layout_type_p (t
) && trivial_type_p (t
));
2722 /* The C++98 definition of POD is different. */
2723 return !CLASSTYPE_NON_LAYOUT_POD_P (t
);
2726 /* Returns true iff T is POD for the purpose of layout, as defined in the
2730 layout_pod_type_p (const_tree t
)
2732 t
= strip_array_types (CONST_CAST_TREE (t
));
2734 if (CLASS_TYPE_P (t
))
2735 return !CLASSTYPE_NON_LAYOUT_POD_P (t
);
2737 return scalarish_type_p (t
);
2740 /* Returns true iff T is a standard-layout type, as defined in
2744 std_layout_type_p (const_tree t
)
2746 t
= strip_array_types (CONST_CAST_TREE (t
));
2748 if (CLASS_TYPE_P (t
))
2749 return !CLASSTYPE_NON_STD_LAYOUT (t
);
2751 return scalarish_type_p (t
);
2754 /* Nonzero iff type T is a class template implicit specialization. */
2757 class_tmpl_impl_spec_p (const_tree t
)
2759 return CLASS_TYPE_P (t
) && CLASSTYPE_TEMPLATE_INSTANTIATION (t
);
2762 /* Returns 1 iff zero initialization of type T means actually storing
2766 zero_init_p (const_tree t
)
2768 /* This CONST_CAST is okay because strip_array_types returns its
2769 argument unmodified and we assign it to a const_tree. */
2770 t
= strip_array_types (CONST_CAST_TREE(t
));
2772 if (t
== error_mark_node
)
2775 /* NULL pointers to data members are initialized with -1. */
2776 if (TYPE_PTRMEM_P (t
))
2779 /* Classes that contain types that can't be zero-initialized, cannot
2780 be zero-initialized themselves. */
2781 if (CLASS_TYPE_P (t
) && CLASSTYPE_NON_ZERO_INIT_P (t
))
2787 /* Table of valid C++ attributes. */
2788 const struct attribute_spec cxx_attribute_table
[] =
2790 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
2791 affects_type_identity } */
2792 { "java_interface", 0, 0, false, false, false,
2793 handle_java_interface_attribute
, false },
2794 { "com_interface", 0, 0, false, false, false,
2795 handle_com_interface_attribute
, false },
2796 { "init_priority", 1, 1, true, false, false,
2797 handle_init_priority_attribute
, false },
2798 { NULL
, 0, 0, false, false, false, NULL
, false }
2801 /* Handle a "java_interface" attribute; arguments as in
2802 struct attribute_spec.handler. */
2804 handle_java_interface_attribute (tree
* node
,
2806 tree args ATTRIBUTE_UNUSED
,
2811 || !CLASS_TYPE_P (*node
)
2812 || !TYPE_FOR_JAVA (*node
))
2814 error ("%qE attribute can only be applied to Java class definitions",
2816 *no_add_attrs
= true;
2819 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
2820 *node
= build_variant_type_copy (*node
);
2821 TYPE_JAVA_INTERFACE (*node
) = 1;
2826 /* Handle a "com_interface" attribute; arguments as in
2827 struct attribute_spec.handler. */
2829 handle_com_interface_attribute (tree
* node
,
2831 tree args ATTRIBUTE_UNUSED
,
2832 int flags ATTRIBUTE_UNUSED
,
2837 *no_add_attrs
= true;
2840 || !CLASS_TYPE_P (*node
)
2841 || *node
!= TYPE_MAIN_VARIANT (*node
))
2843 warning (OPT_Wattributes
, "%qE attribute can only be applied "
2844 "to class definitions", name
);
2849 warning (0, "%qE is obsolete; g++ vtables are now COM-compatible by default",
2855 /* Handle an "init_priority" attribute; arguments as in
2856 struct attribute_spec.handler. */
2858 handle_init_priority_attribute (tree
* node
,
2861 int flags ATTRIBUTE_UNUSED
,
2864 tree initp_expr
= TREE_VALUE (args
);
2866 tree type
= TREE_TYPE (decl
);
2869 STRIP_NOPS (initp_expr
);
2871 if (!initp_expr
|| TREE_CODE (initp_expr
) != INTEGER_CST
)
2873 error ("requested init_priority is not an integer constant");
2874 *no_add_attrs
= true;
2878 pri
= TREE_INT_CST_LOW (initp_expr
);
2880 type
= strip_array_types (type
);
2882 if (decl
== NULL_TREE
2883 || TREE_CODE (decl
) != VAR_DECL
2884 || !TREE_STATIC (decl
)
2885 || DECL_EXTERNAL (decl
)
2886 || (TREE_CODE (type
) != RECORD_TYPE
2887 && TREE_CODE (type
) != UNION_TYPE
)
2888 /* Static objects in functions are initialized the
2889 first time control passes through that
2890 function. This is not precise enough to pin down an
2891 init_priority value, so don't allow it. */
2892 || current_function_decl
)
2894 error ("can only use %qE attribute on file-scope definitions "
2895 "of objects of class type", name
);
2896 *no_add_attrs
= true;
2900 if (pri
> MAX_INIT_PRIORITY
|| pri
<= 0)
2902 error ("requested init_priority is out of range");
2903 *no_add_attrs
= true;
2907 /* Check for init_priorities that are reserved for
2908 language and runtime support implementations.*/
2909 if (pri
<= MAX_RESERVED_INIT_PRIORITY
)
2912 (0, "requested init_priority is reserved for internal use");
2915 if (SUPPORTS_INIT_PRIORITY
)
2917 SET_DECL_INIT_PRIORITY (decl
, pri
);
2918 DECL_HAS_INIT_PRIORITY_P (decl
) = 1;
2923 error ("%qE attribute is not supported on this platform", name
);
2924 *no_add_attrs
= true;
2929 /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the
2930 thing pointed to by the constant. */
2933 make_ptrmem_cst (tree type
, tree member
)
2935 tree ptrmem_cst
= make_node (PTRMEM_CST
);
2936 TREE_TYPE (ptrmem_cst
) = type
;
2937 PTRMEM_CST_MEMBER (ptrmem_cst
) = member
;
2941 /* Build a variant of TYPE that has the indicated ATTRIBUTES. May
2942 return an existing type if an appropriate type already exists. */
2945 cp_build_type_attribute_variant (tree type
, tree attributes
)
2949 new_type
= build_type_attribute_variant (type
, attributes
);
2950 if (TREE_CODE (new_type
) == FUNCTION_TYPE
2951 || TREE_CODE (new_type
) == METHOD_TYPE
)
2952 new_type
= build_exception_variant (new_type
,
2953 TYPE_RAISES_EXCEPTIONS (type
));
2955 /* Making a new main variant of a class type is broken. */
2956 gcc_assert (!CLASS_TYPE_P (type
) || new_type
== type
);
2961 /* Return TRUE if TYPE1 and TYPE2 are identical for type hashing purposes.
2962 Called only after doing all language independent checks. Only
2963 to check TYPE_RAISES_EXCEPTIONS for FUNCTION_TYPE, the rest is already
2964 compared in type_hash_eq. */
2967 cxx_type_hash_eq (const_tree typea
, const_tree typeb
)
2969 gcc_assert (TREE_CODE (typea
) == FUNCTION_TYPE
2970 || TREE_CODE (typea
) == METHOD_TYPE
);
2972 return comp_except_specs (TYPE_RAISES_EXCEPTIONS (typea
),
2973 TYPE_RAISES_EXCEPTIONS (typeb
), ce_exact
);
2976 /* Apply FUNC to all language-specific sub-trees of TP in a pre-order
2977 traversal. Called from walk_tree. */
2980 cp_walk_subtrees (tree
*tp
, int *walk_subtrees_p
, walk_tree_fn func
,
2981 void *data
, struct pointer_set_t
*pset
)
2983 enum tree_code code
= TREE_CODE (*tp
);
2986 #define WALK_SUBTREE(NODE) \
2989 result = cp_walk_tree (&(NODE), func, data, pset); \
2990 if (result) goto out; \
2994 /* Not one of the easy cases. We must explicitly go through the
3000 case TEMPLATE_TEMPLATE_PARM
:
3001 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3002 case UNBOUND_CLASS_TEMPLATE
:
3003 case TEMPLATE_PARM_INDEX
:
3004 case TEMPLATE_TYPE_PARM
:
3007 case UNDERLYING_TYPE
:
3008 /* None of these have subtrees other than those already walked
3010 *walk_subtrees_p
= 0;
3014 WALK_SUBTREE (BASELINK_FUNCTIONS (*tp
));
3015 *walk_subtrees_p
= 0;
3019 WALK_SUBTREE (TREE_TYPE (*tp
));
3020 *walk_subtrees_p
= 0;
3024 WALK_SUBTREE (TREE_PURPOSE (*tp
));
3028 WALK_SUBTREE (OVL_FUNCTION (*tp
));
3029 WALK_SUBTREE (OVL_CHAIN (*tp
));
3030 *walk_subtrees_p
= 0;
3034 WALK_SUBTREE (DECL_NAME (*tp
));
3035 WALK_SUBTREE (USING_DECL_SCOPE (*tp
));
3036 WALK_SUBTREE (USING_DECL_DECLS (*tp
));
3037 *walk_subtrees_p
= 0;
3041 if (TYPE_PTRMEMFUNC_P (*tp
))
3042 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (*tp
));
3045 case TYPE_ARGUMENT_PACK
:
3046 case NONTYPE_ARGUMENT_PACK
:
3048 tree args
= ARGUMENT_PACK_ARGS (*tp
);
3049 int i
, len
= TREE_VEC_LENGTH (args
);
3050 for (i
= 0; i
< len
; i
++)
3051 WALK_SUBTREE (TREE_VEC_ELT (args
, i
));
3055 case TYPE_PACK_EXPANSION
:
3056 WALK_SUBTREE (TREE_TYPE (*tp
));
3057 WALK_SUBTREE (PACK_EXPANSION_EXTRA_ARGS (*tp
));
3058 *walk_subtrees_p
= 0;
3061 case EXPR_PACK_EXPANSION
:
3062 WALK_SUBTREE (TREE_OPERAND (*tp
, 0));
3063 WALK_SUBTREE (PACK_EXPANSION_EXTRA_ARGS (*tp
));
3064 *walk_subtrees_p
= 0;
3068 case REINTERPRET_CAST_EXPR
:
3069 case STATIC_CAST_EXPR
:
3070 case CONST_CAST_EXPR
:
3071 case DYNAMIC_CAST_EXPR
:
3072 case IMPLICIT_CONV_EXPR
:
3073 if (TREE_TYPE (*tp
))
3074 WALK_SUBTREE (TREE_TYPE (*tp
));
3078 for (i
= 0; i
< TREE_CODE_LENGTH (TREE_CODE (*tp
)); ++i
)
3079 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
3081 *walk_subtrees_p
= 0;
3085 WALK_SUBTREE (TRAIT_EXPR_TYPE1 (*tp
));
3086 WALK_SUBTREE (TRAIT_EXPR_TYPE2 (*tp
));
3087 *walk_subtrees_p
= 0;
3091 WALK_SUBTREE (DECLTYPE_TYPE_EXPR (*tp
));
3092 *walk_subtrees_p
= 0;
3100 /* We didn't find what we were looking for. */
3107 /* Like save_expr, but for C++. */
3110 cp_save_expr (tree expr
)
3112 /* There is no reason to create a SAVE_EXPR within a template; if
3113 needed, we can create the SAVE_EXPR when instantiating the
3114 template. Furthermore, the middle-end cannot handle C++-specific
3116 if (processing_template_decl
)
3118 return save_expr (expr
);
3121 /* Initialize tree.c. */
3126 list_hash_table
= htab_create_ggc (31, list_hash
, list_hash_eq
, NULL
);
3129 /* Returns the kind of special function that DECL (a FUNCTION_DECL)
3130 is. Note that sfk_none is zero, so this function can be used as a
3131 predicate to test whether or not DECL is a special function. */
3133 special_function_kind
3134 special_function_p (const_tree decl
)
3136 /* Rather than doing all this stuff with magic names, we should
3137 probably have a field of type `special_function_kind' in
3138 DECL_LANG_SPECIFIC. */
3139 if (DECL_COPY_CONSTRUCTOR_P (decl
))
3140 return sfk_copy_constructor
;
3141 if (DECL_MOVE_CONSTRUCTOR_P (decl
))
3142 return sfk_move_constructor
;
3143 if (DECL_CONSTRUCTOR_P (decl
))
3144 return sfk_constructor
;
3145 if (DECL_OVERLOADED_OPERATOR_P (decl
) == NOP_EXPR
)
3147 if (copy_fn_p (decl
))
3148 return sfk_copy_assignment
;
3149 if (move_fn_p (decl
))
3150 return sfk_move_assignment
;
3152 if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl
))
3153 return sfk_destructor
;
3154 if (DECL_COMPLETE_DESTRUCTOR_P (decl
))
3155 return sfk_complete_destructor
;
3156 if (DECL_BASE_DESTRUCTOR_P (decl
))
3157 return sfk_base_destructor
;
3158 if (DECL_DELETING_DESTRUCTOR_P (decl
))
3159 return sfk_deleting_destructor
;
3160 if (DECL_CONV_FN_P (decl
))
3161 return sfk_conversion
;
3166 /* Returns nonzero if TYPE is a character type, including wchar_t. */
3169 char_type_p (tree type
)
3171 return (same_type_p (type
, char_type_node
)
3172 || same_type_p (type
, unsigned_char_type_node
)
3173 || same_type_p (type
, signed_char_type_node
)
3174 || same_type_p (type
, char16_type_node
)
3175 || same_type_p (type
, char32_type_node
)
3176 || same_type_p (type
, wchar_type_node
));
3179 /* Returns the kind of linkage associated with the indicated DECL. Th
3180 value returned is as specified by the language standard; it is
3181 independent of implementation details regarding template
3182 instantiation, etc. For example, it is possible that a declaration
3183 to which this function assigns external linkage would not show up
3184 as a global symbol when you run `nm' on the resulting object file. */
3187 decl_linkage (tree decl
)
3189 /* This function doesn't attempt to calculate the linkage from first
3190 principles as given in [basic.link]. Instead, it makes use of
3191 the fact that we have already set TREE_PUBLIC appropriately, and
3192 then handles a few special cases. Ideally, we would calculate
3193 linkage first, and then transform that into a concrete
3196 /* Things that don't have names have no linkage. */
3197 if (!DECL_NAME (decl
))
3200 /* Fields have no linkage. */
3201 if (TREE_CODE (decl
) == FIELD_DECL
)
3204 /* Things that are TREE_PUBLIC have external linkage. */
3205 if (TREE_PUBLIC (decl
))
3208 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
3211 /* Linkage of a CONST_DECL depends on the linkage of the enumeration
3213 if (TREE_CODE (decl
) == CONST_DECL
)
3214 return decl_linkage (TYPE_NAME (TREE_TYPE (decl
)));
3216 /* Some things that are not TREE_PUBLIC have external linkage, too.
3217 For example, on targets that don't have weak symbols, we make all
3218 template instantiations have internal linkage (in the object
3219 file), but the symbols should still be treated as having external
3220 linkage from the point of view of the language. */
3221 if ((TREE_CODE (decl
) == FUNCTION_DECL
3222 || TREE_CODE (decl
) == VAR_DECL
)
3223 && DECL_COMDAT (decl
))
3226 /* Things in local scope do not have linkage, if they don't have
3228 if (decl_function_context (decl
))
3231 /* Members of the anonymous namespace also have TREE_PUBLIC unset, but
3232 are considered to have external linkage for language purposes. DECLs
3233 really meant to have internal linkage have DECL_THIS_STATIC set. */
3234 if (TREE_CODE (decl
) == TYPE_DECL
)
3236 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
)
3238 if (!DECL_THIS_STATIC (decl
))
3241 /* Static data members and static member functions from classes
3242 in anonymous namespace also don't have TREE_PUBLIC set. */
3243 if (DECL_CLASS_CONTEXT (decl
))
3247 /* Everything else has internal linkage. */
3251 /* Returns the storage duration of the object or reference associated with
3252 the indicated DECL, which should be a VAR_DECL or PARM_DECL. */
3255 decl_storage_duration (tree decl
)
3257 if (TREE_CODE (decl
) == PARM_DECL
)
3259 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3261 gcc_assert (TREE_CODE (decl
) == VAR_DECL
);
3262 if (!TREE_STATIC (decl
)
3263 && !DECL_EXTERNAL (decl
))
3265 if (DECL_THREAD_LOCAL_P (decl
))
3270 /* EXP is an expression that we want to pre-evaluate. Returns (in
3271 *INITP) an expression that will perform the pre-evaluation. The
3272 value returned by this function is a side-effect free expression
3273 equivalent to the pre-evaluated expression. Callers must ensure
3274 that *INITP is evaluated before EXP. */
3277 stabilize_expr (tree exp
, tree
* initp
)
3281 if (!TREE_SIDE_EFFECTS (exp
))
3282 init_expr
= NULL_TREE
;
3283 /* There are no expressions with REFERENCE_TYPE, but there can be call
3284 arguments with such a type; just treat it as a pointer. */
3285 else if (TREE_CODE (TREE_TYPE (exp
)) == REFERENCE_TYPE
3286 || SCALAR_TYPE_P (TREE_TYPE (exp
))
3287 || !lvalue_or_rvalue_with_address_p (exp
))
3289 init_expr
= get_target_expr (exp
);
3290 exp
= TARGET_EXPR_SLOT (init_expr
);
3294 bool xval
= !real_lvalue_p (exp
);
3295 exp
= cp_build_addr_expr (exp
, tf_warning_or_error
);
3296 init_expr
= get_target_expr (exp
);
3297 exp
= TARGET_EXPR_SLOT (init_expr
);
3298 exp
= cp_build_indirect_ref (exp
, RO_NULL
, tf_warning_or_error
);
3304 gcc_assert (!TREE_SIDE_EFFECTS (exp
));
3308 /* Add NEW_EXPR, an expression whose value we don't care about, after the
3309 similar expression ORIG. */
3312 add_stmt_to_compound (tree orig
, tree new_expr
)
3314 if (!new_expr
|| !TREE_SIDE_EFFECTS (new_expr
))
3316 if (!orig
|| !TREE_SIDE_EFFECTS (orig
))
3318 return build2 (COMPOUND_EXPR
, void_type_node
, orig
, new_expr
);
3321 /* Like stabilize_expr, but for a call whose arguments we want to
3322 pre-evaluate. CALL is modified in place to use the pre-evaluated
3323 arguments, while, upon return, *INITP contains an expression to
3324 compute the arguments. */
3327 stabilize_call (tree call
, tree
*initp
)
3329 tree inits
= NULL_TREE
;
3331 int nargs
= call_expr_nargs (call
);
3333 if (call
== error_mark_node
|| processing_template_decl
)
3339 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
3341 for (i
= 0; i
< nargs
; i
++)
3344 CALL_EXPR_ARG (call
, i
) =
3345 stabilize_expr (CALL_EXPR_ARG (call
, i
), &init
);
3346 inits
= add_stmt_to_compound (inits
, init
);
3352 /* Like stabilize_expr, but for an AGGR_INIT_EXPR whose arguments we want
3353 to pre-evaluate. CALL is modified in place to use the pre-evaluated
3354 arguments, while, upon return, *INITP contains an expression to
3355 compute the arguments. */
3358 stabilize_aggr_init (tree call
, tree
*initp
)
3360 tree inits
= NULL_TREE
;
3362 int nargs
= aggr_init_expr_nargs (call
);
3364 if (call
== error_mark_node
)
3367 gcc_assert (TREE_CODE (call
) == AGGR_INIT_EXPR
);
3369 for (i
= 0; i
< nargs
; i
++)
3372 AGGR_INIT_EXPR_ARG (call
, i
) =
3373 stabilize_expr (AGGR_INIT_EXPR_ARG (call
, i
), &init
);
3374 inits
= add_stmt_to_compound (inits
, init
);
3380 /* Like stabilize_expr, but for an initialization.
3382 If the initialization is for an object of class type, this function
3383 takes care not to introduce additional temporaries.
3385 Returns TRUE iff the expression was successfully pre-evaluated,
3386 i.e., if INIT is now side-effect free, except for, possible, a
3387 single call to a constructor. */
3390 stabilize_init (tree init
, tree
*initp
)
3396 if (t
== error_mark_node
|| processing_template_decl
)
3399 if (TREE_CODE (t
) == INIT_EXPR
3400 && TREE_CODE (TREE_OPERAND (t
, 1)) != TARGET_EXPR
3401 && TREE_CODE (TREE_OPERAND (t
, 1)) != CONSTRUCTOR
3402 && TREE_CODE (TREE_OPERAND (t
, 1)) != AGGR_INIT_EXPR
)
3404 TREE_OPERAND (t
, 1) = stabilize_expr (TREE_OPERAND (t
, 1), initp
);
3408 if (TREE_CODE (t
) == INIT_EXPR
)
3409 t
= TREE_OPERAND (t
, 1);
3410 if (TREE_CODE (t
) == TARGET_EXPR
)
3411 t
= TARGET_EXPR_INITIAL (t
);
3412 if (TREE_CODE (t
) == COMPOUND_EXPR
)
3414 if (TREE_CODE (t
) == CONSTRUCTOR
)
3416 /* Aggregate initialization: stabilize each of the field
3419 constructor_elt
*ce
;
3421 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (t
);
3422 for (i
= 0; VEC_iterate (constructor_elt
, v
, i
, ce
); ++i
)
3424 tree type
= TREE_TYPE (ce
->value
);
3426 if (TREE_CODE (type
) == REFERENCE_TYPE
3427 || SCALAR_TYPE_P (type
))
3428 ce
->value
= stabilize_expr (ce
->value
, &subinit
);
3429 else if (!stabilize_init (ce
->value
, &subinit
))
3431 *initp
= add_stmt_to_compound (*initp
, subinit
);
3436 /* If the initializer is a COND_EXPR, we can't preevaluate
3438 if (TREE_CODE (t
) == COND_EXPR
)
3441 if (TREE_CODE (t
) == CALL_EXPR
)
3443 stabilize_call (t
, initp
);
3447 if (TREE_CODE (t
) == AGGR_INIT_EXPR
)
3449 stabilize_aggr_init (t
, initp
);
3453 /* The initialization is being performed via a bitwise copy -- and
3454 the item copied may have side effects. */
3455 return TREE_SIDE_EFFECTS (init
);
3458 /* Like "fold", but should be used whenever we might be processing the
3459 body of a template. */
3462 fold_if_not_in_template (tree expr
)
3464 /* In the body of a template, there is never any need to call
3465 "fold". We will call fold later when actually instantiating the
3466 template. Integral constant expressions in templates will be
3467 evaluated via fold_non_dependent_expr, as necessary. */
3468 if (processing_template_decl
)
3471 /* Fold C++ front-end specific tree codes. */
3472 if (TREE_CODE (expr
) == UNARY_PLUS_EXPR
)
3473 return fold_convert (TREE_TYPE (expr
), TREE_OPERAND (expr
, 0));
3478 /* Returns true if a cast to TYPE may appear in an integral constant
3482 cast_valid_in_integral_constant_expression_p (tree type
)
3484 return (INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
3485 || cxx_dialect
>= cxx0x
3486 || dependent_type_p (type
)
3487 || type
== error_mark_node
);
3490 /* Return true if we need to fix linkage information of DECL. */
3493 cp_fix_function_decl_p (tree decl
)
3495 /* Skip if DECL is not externally visible. */
3496 if (!TREE_PUBLIC (decl
))
3499 /* We need to fix DECL if it a appears to be exported but with no
3500 function body. Thunks do not have CFGs and we may need to
3501 handle them specially later. */
3502 if (!gimple_has_body_p (decl
)
3503 && !DECL_THUNK_P (decl
)
3504 && !DECL_EXTERNAL (decl
))
3506 struct cgraph_node
*node
= cgraph_get_node (decl
);
3508 /* Don't fix same_body aliases. Although they don't have their own
3509 CFG, they share it with what they alias to. */
3510 if (!node
|| !node
->alias
3511 || !VEC_length (ipa_ref_t
, node
->symbol
.ref_list
.references
))
3518 /* Clean the C++ specific parts of the tree T. */
3521 cp_free_lang_data (tree t
)
3523 if (TREE_CODE (t
) == METHOD_TYPE
3524 || TREE_CODE (t
) == FUNCTION_TYPE
)
3526 /* Default args are not interesting anymore. */
3527 tree argtypes
= TYPE_ARG_TYPES (t
);
3530 TREE_PURPOSE (argtypes
) = 0;
3531 argtypes
= TREE_CHAIN (argtypes
);
3534 else if (TREE_CODE (t
) == FUNCTION_DECL
3535 && cp_fix_function_decl_p (t
))
3537 /* If T is used in this translation unit at all, the definition
3538 must exist somewhere else since we have decided to not emit it
3539 in this TU. So make it an external reference. */
3540 DECL_EXTERNAL (t
) = 1;
3541 TREE_STATIC (t
) = 0;
3543 if (TREE_CODE (t
) == NAMESPACE_DECL
)
3545 /* The list of users of a namespace isn't useful for the middle-end
3546 or debug generators. */
3547 DECL_NAMESPACE_USERS (t
) = NULL_TREE
;
3548 /* Neither do we need the leftover chaining of namespaces
3549 from the binding level. */
3550 DECL_CHAIN (t
) = NULL_TREE
;
3554 /* Stub for c-common. Please keep in sync with c-decl.c.
3555 FIXME: If address space support is target specific, then this
3556 should be a C target hook. But currently this is not possible,
3557 because this function is called via REGISTER_TARGET_PRAGMAS. */
3559 c_register_addr_space (const char *word ATTRIBUTE_UNUSED
,
3560 addr_space_t as ATTRIBUTE_UNUSED
)
3564 /* Return the number of operands in T that we care about for things like
3568 cp_tree_operand_length (const_tree t
)
3570 enum tree_code code
= TREE_CODE (t
);
3574 case PREINCREMENT_EXPR
:
3575 case PREDECREMENT_EXPR
:
3576 case POSTINCREMENT_EXPR
:
3577 case POSTDECREMENT_EXPR
:
3583 case EXPR_PACK_EXPANSION
:
3587 return TREE_OPERAND_LENGTH (t
);
3591 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3592 /* Complain that some language-specific thing hanging off a tree
3593 node has been accessed improperly. */
3596 lang_check_failed (const char* file
, int line
, const char* function
)
3598 internal_error ("lang_* check: failed in %s, at %s:%d",
3599 function
, trim_filename (file
), line
);
3601 #endif /* ENABLE_TREE_CHECKING */
3603 #include "gt-cp-tree.h"