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 Free Software Foundation, Inc.
4 Hacked by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
25 #include "coretypes.h"
33 #include "insn-config.h"
34 #include "integrate.h"
35 #include "tree-inline.h"
38 static tree
bot_manip (tree
*, int *, void *);
39 static tree
bot_replace (tree
*, int *, void *);
40 static tree
build_cplus_array_type_1 (tree
, tree
);
41 static int list_hash_eq (const void *, const void *);
42 static hashval_t
list_hash_pieces (tree
, tree
, tree
);
43 static hashval_t
list_hash (const void *);
44 static cp_lvalue_kind
lvalue_p_1 (tree
, int);
45 static tree
no_linkage_helper (tree
*, int *, void *);
46 static tree
mark_local_for_remap_r (tree
*, int *, void *);
47 static tree
cp_unsave_r (tree
*, int *, void *);
48 static tree
build_target_expr (tree
, tree
);
49 static tree
count_trees_r (tree
*, int *, void *);
50 static tree
verify_stmt_tree_r (tree
*, int *, void *);
51 static tree
find_tree_r (tree
*, int *, void *);
52 static tree
build_local_temp (tree
);
54 static tree
handle_java_interface_attribute (tree
*, tree
, tree
, int, bool *);
55 static tree
handle_com_interface_attribute (tree
*, tree
, tree
, int, bool *);
56 static tree
handle_init_priority_attribute (tree
*, tree
, tree
, int, bool *);
58 /* If REF is an lvalue, returns the kind of lvalue that REF is.
59 Otherwise, returns clk_none. If TREAT_CLASS_RVALUES_AS_LVALUES is
60 nonzero, rvalues of class type are considered lvalues. */
64 int treat_class_rvalues_as_lvalues
)
66 cp_lvalue_kind op1_lvalue_kind
= clk_none
;
67 cp_lvalue_kind op2_lvalue_kind
= clk_none
;
69 if (TREE_CODE (TREE_TYPE (ref
)) == REFERENCE_TYPE
)
72 if (ref
== current_class_ptr
)
75 switch (TREE_CODE (ref
))
77 /* preincrements and predecrements are valid lvals, provided
78 what they refer to are valid lvals. */
79 case PREINCREMENT_EXPR
:
80 case PREDECREMENT_EXPR
:
84 case WITH_CLEANUP_EXPR
:
87 return lvalue_p_1 (TREE_OPERAND (ref
, 0),
88 treat_class_rvalues_as_lvalues
);
91 op1_lvalue_kind
= lvalue_p_1 (TREE_OPERAND (ref
, 0),
92 treat_class_rvalues_as_lvalues
);
94 /* The "field" can be a FUNCTION_DECL or an OVERLOAD in some
96 || TREE_CODE (TREE_OPERAND (ref
, 1)) != FIELD_DECL
)
98 else if (DECL_C_BIT_FIELD (TREE_OPERAND (ref
, 1)))
100 /* Clear the ordinary bit. If this object was a class
101 rvalue we want to preserve that information. */
102 op1_lvalue_kind
&= ~clk_ordinary
;
103 /* The lvalue is for a bitfield. */
104 op1_lvalue_kind
|= clk_bitfield
;
106 else if (DECL_PACKED (TREE_OPERAND (ref
, 1)))
107 op1_lvalue_kind
|= clk_packed
;
109 return op1_lvalue_kind
;
115 if (TREE_READONLY (ref
) && ! TREE_STATIC (ref
)
116 && DECL_LANG_SPECIFIC (ref
)
117 && DECL_IN_AGGR_P (ref
))
123 if (TREE_CODE (TREE_TYPE (ref
)) != METHOD_TYPE
)
127 /* A currently unresolved scope ref. */
132 op1_lvalue_kind
= lvalue_p_1 (TREE_OPERAND (ref
, 0),
133 treat_class_rvalues_as_lvalues
);
134 op2_lvalue_kind
= lvalue_p_1 (TREE_OPERAND (ref
, 1),
135 treat_class_rvalues_as_lvalues
);
139 op1_lvalue_kind
= lvalue_p_1 (TREE_OPERAND (ref
, 1),
140 treat_class_rvalues_as_lvalues
);
141 op2_lvalue_kind
= lvalue_p_1 (TREE_OPERAND (ref
, 2),
142 treat_class_rvalues_as_lvalues
);
149 return lvalue_p_1 (TREE_OPERAND (ref
, 1),
150 treat_class_rvalues_as_lvalues
);
153 return treat_class_rvalues_as_lvalues
? clk_class
: clk_none
;
157 /* Any class-valued call would be wrapped in a TARGET_EXPR. */
161 /* All functions (except non-static-member functions) are
163 return (DECL_NONSTATIC_MEMBER_FUNCTION_P (ref
)
164 ? clk_none
: clk_ordinary
);
166 case NON_DEPENDENT_EXPR
:
167 /* We must consider NON_DEPENDENT_EXPRs to be lvalues so that
168 things like "&E" where "E" is an expression with a
169 non-dependent type work. It is safe to be lenient because an
170 error will be issued when the template is instantiated if "E"
178 /* If one operand is not an lvalue at all, then this expression is
180 if (!op1_lvalue_kind
|| !op2_lvalue_kind
)
183 /* Otherwise, it's an lvalue, and it has all the odd properties
184 contributed by either operand. */
185 op1_lvalue_kind
= op1_lvalue_kind
| op2_lvalue_kind
;
186 /* It's not an ordinary lvalue if it involves either a bit-field or
188 if ((op1_lvalue_kind
& ~clk_ordinary
) != clk_none
)
189 op1_lvalue_kind
&= ~clk_ordinary
;
190 return op1_lvalue_kind
;
193 /* Returns the kind of lvalue that REF is, in the sense of
194 [basic.lval]. This function should really be named lvalue_p; it
195 computes the C++ definition of lvalue. */
198 real_lvalue_p (tree ref
)
200 return lvalue_p_1 (ref
,
201 /*treat_class_rvalues_as_lvalues=*/0);
204 /* This differs from real_lvalue_p in that class rvalues are
205 considered lvalues. */
211 (lvalue_p_1 (ref
, /*class rvalue ok*/ 1) != clk_none
);
214 /* Return nonzero if REF is an lvalue valid for this language;
215 otherwise, print an error message and return zero. */
218 lvalue_or_else (tree ref
, const char* string
)
222 error ("non-lvalue in %s", string
);
228 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
231 build_target_expr (tree decl
, tree value
)
235 t
= build (TARGET_EXPR
, TREE_TYPE (decl
), decl
, value
,
236 cxx_maybe_build_cleanup (decl
), NULL_TREE
);
237 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
238 ignore the TARGET_EXPR. If there really turn out to be no
239 side-effects, then the optimizer should be able to get rid of
240 whatever code is generated anyhow. */
241 TREE_SIDE_EFFECTS (t
) = 1;
246 /* Return an undeclared local temporary of type TYPE for use in building a
250 build_local_temp (tree type
)
252 tree slot
= build_decl (VAR_DECL
, NULL_TREE
, type
);
253 DECL_ARTIFICIAL (slot
) = 1;
254 DECL_CONTEXT (slot
) = current_function_decl
;
255 layout_decl (slot
, 0);
259 /* INIT is a CALL_EXPR which needs info about its target.
260 TYPE is the type that this initialization should appear to have.
262 Build an encapsulation of the initialization to perform
263 and return it so that it can be processed by language-independent
264 and language-specific expression expanders. */
267 build_cplus_new (tree type
, tree init
)
274 /* Make sure that we're not trying to create an instance of an
276 abstract_virtuals_error (NULL_TREE
, type
);
278 if (TREE_CODE (init
) != CALL_EXPR
&& TREE_CODE (init
) != AGGR_INIT_EXPR
)
279 return convert (type
, init
);
281 fn
= TREE_OPERAND (init
, 0);
282 is_ctor
= (TREE_CODE (fn
) == ADDR_EXPR
283 && TREE_CODE (TREE_OPERAND (fn
, 0)) == FUNCTION_DECL
284 && DECL_CONSTRUCTOR_P (TREE_OPERAND (fn
, 0)));
286 slot
= build_local_temp (type
);
288 /* We split the CALL_EXPR into its function and its arguments here.
289 Then, in expand_expr, we put them back together. The reason for
290 this is that this expression might be a default argument
291 expression. In that case, we need a new temporary every time the
292 expression is used. That's what break_out_target_exprs does; it
293 replaces every AGGR_INIT_EXPR with a copy that uses a fresh
294 temporary slot. Then, expand_expr builds up a call-expression
295 using the new slot. */
297 /* If we don't need to use a constructor to create an object of this
298 type, don't mess with AGGR_INIT_EXPR. */
299 if (is_ctor
|| TREE_ADDRESSABLE (type
))
301 rval
= build (AGGR_INIT_EXPR
, type
, fn
, TREE_OPERAND (init
, 1), slot
);
302 TREE_SIDE_EFFECTS (rval
) = 1;
303 AGGR_INIT_VIA_CTOR_P (rval
) = is_ctor
;
308 rval
= build_target_expr (slot
, rval
);
313 /* Build a TARGET_EXPR using INIT to initialize a new temporary of the
317 build_target_expr_with_type (tree init
, tree type
)
321 my_friendly_assert (!VOID_TYPE_P (type
), 20040130);
323 if (TREE_CODE (init
) == TARGET_EXPR
)
325 else if (CLASS_TYPE_P (type
) && !TYPE_HAS_TRIVIAL_INIT_REF (type
)
326 && TREE_CODE (init
) != COND_EXPR
327 && TREE_CODE (init
) != CONSTRUCTOR
328 && TREE_CODE (init
) != VA_ARG_EXPR
)
329 /* We need to build up a copy constructor call. COND_EXPR is a special
330 case because we already have copies on the arms and we don't want
331 another one here. A CONSTRUCTOR is aggregate initialization, which
332 is handled separately. A VA_ARG_EXPR is magic creation of an
333 aggregate; there's no additional work to be done. */
334 return force_rvalue (init
);
336 slot
= build_local_temp (type
);
337 return build_target_expr (slot
, init
);
340 /* Like the above function, but without the checking. This function should
341 only be used by code which is deliberately trying to subvert the type
342 system, such as call_builtin_trap. */
345 force_target_expr (tree type
, tree init
)
349 my_friendly_assert (!VOID_TYPE_P (type
), 20040130);
351 slot
= build_local_temp (type
);
352 return build_target_expr (slot
, init
);
355 /* Like build_target_expr_with_type, but use the type of INIT. */
358 get_target_expr (tree init
)
360 return build_target_expr_with_type (init
, TREE_TYPE (init
));
365 build_cplus_array_type_1 (tree elt_type
, tree index_type
)
369 if (elt_type
== error_mark_node
|| index_type
== error_mark_node
)
370 return error_mark_node
;
372 if (dependent_type_p (elt_type
)
374 && value_dependent_expression_p (TYPE_MAX_VALUE (index_type
))))
376 t
= make_node (ARRAY_TYPE
);
377 TREE_TYPE (t
) = elt_type
;
378 TYPE_DOMAIN (t
) = index_type
;
381 t
= build_array_type (elt_type
, index_type
);
383 /* Push these needs up so that initialization takes place
385 TYPE_NEEDS_CONSTRUCTING (t
)
386 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (elt_type
));
387 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
388 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (elt_type
));
393 build_cplus_array_type (tree elt_type
, tree index_type
)
396 int type_quals
= cp_type_quals (elt_type
);
398 if (type_quals
!= TYPE_UNQUALIFIED
)
399 elt_type
= cp_build_qualified_type (elt_type
, TYPE_UNQUALIFIED
);
401 t
= build_cplus_array_type_1 (elt_type
, index_type
);
403 if (type_quals
!= TYPE_UNQUALIFIED
)
404 t
= cp_build_qualified_type (t
, type_quals
);
409 /* Make a variant of TYPE, qualified with the TYPE_QUALS. Handles
410 arrays correctly. In particular, if TYPE is an array of T's, and
411 TYPE_QUALS is non-empty, returns an array of qualified T's.
413 FLAGS determines how to deal with illformed qualifications. If
414 tf_ignore_bad_quals is set, then bad qualifications are dropped
415 (this is permitted if TYPE was introduced via a typedef or template
416 type parameter). If bad qualifications are dropped and tf_warning
417 is set, then a warning is issued for non-const qualifications. If
418 tf_ignore_bad_quals is not set and tf_error is not set, we
419 return error_mark_node. Otherwise, we issue an error, and ignore
422 Qualification of a reference type is valid when the reference came
423 via a typedef or template type argument. [dcl.ref] No such
424 dispensation is provided for qualifying a function type. [dcl.fct]
425 DR 295 queries this and the proposed resolution brings it into line
426 with qualifying a reference. We implement the DR. We also behave
427 in a similar manner for restricting non-pointer types. */
430 cp_build_qualified_type_real (tree type
,
432 tsubst_flags_t complain
)
435 int bad_quals
= TYPE_UNQUALIFIED
;
436 /* We keep bad function qualifiers separate, so that we can decide
437 whether to implement DR 295 or not. DR 295 break existing code,
438 unfortunately. Remove this variable to implement the defect
440 int bad_func_quals
= TYPE_UNQUALIFIED
;
442 if (type
== error_mark_node
)
445 if (type_quals
== cp_type_quals (type
))
448 if (TREE_CODE (type
) == ARRAY_TYPE
)
450 /* In C++, the qualification really applies to the array element
451 type. Obtain the appropriately qualified element type. */
454 = cp_build_qualified_type_real (TREE_TYPE (type
),
458 if (element_type
== error_mark_node
)
459 return error_mark_node
;
461 /* See if we already have an identically qualified type. */
462 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
463 if (cp_type_quals (t
) == type_quals
464 && TYPE_NAME (t
) == TYPE_NAME (type
)
465 && TYPE_CONTEXT (t
) == TYPE_CONTEXT (type
))
470 /* Make a new array type, just like the old one, but with the
471 appropriately qualified element type. */
472 t
= build_type_copy (type
);
473 TREE_TYPE (t
) = element_type
;
476 /* Even if we already had this variant, we update
477 TYPE_NEEDS_CONSTRUCTING and TYPE_HAS_NONTRIVIAL_DESTRUCTOR in case
478 they changed since the variant was originally created.
480 This seems hokey; if there is some way to use a previous
481 variant *without* coming through here,
482 TYPE_NEEDS_CONSTRUCTING will never be updated. */
483 TYPE_NEEDS_CONSTRUCTING (t
)
484 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (element_type
));
485 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
486 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (element_type
));
489 else if (TYPE_PTRMEMFUNC_P (type
))
491 /* For a pointer-to-member type, we can't just return a
492 cv-qualified version of the RECORD_TYPE. If we do, we
493 haven't changed the field that contains the actual pointer to
494 a method, and so TYPE_PTRMEMFUNC_FN_TYPE will be wrong. */
497 t
= TYPE_PTRMEMFUNC_FN_TYPE (type
);
498 t
= cp_build_qualified_type_real (t
, type_quals
, complain
);
499 return build_ptrmemfunc_type (t
);
502 /* A reference, function or method type shall not be cv qualified.
503 [dcl.ref], [dct.fct] */
504 if (type_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)
505 && (TREE_CODE (type
) == REFERENCE_TYPE
506 || TREE_CODE (type
) == FUNCTION_TYPE
507 || TREE_CODE (type
) == METHOD_TYPE
))
509 bad_quals
|= type_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
510 if (TREE_CODE (type
) != REFERENCE_TYPE
)
511 bad_func_quals
|= type_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
512 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
515 /* A restrict-qualified type must be a pointer (or reference)
516 to object or incomplete type. */
517 if ((type_quals
& TYPE_QUAL_RESTRICT
)
518 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
519 && TREE_CODE (type
) != TYPENAME_TYPE
520 && !POINTER_TYPE_P (type
))
522 bad_quals
|= TYPE_QUAL_RESTRICT
;
523 type_quals
&= ~TYPE_QUAL_RESTRICT
;
526 if (bad_quals
== TYPE_UNQUALIFIED
)
528 else if (!(complain
& (tf_error
| tf_ignore_bad_quals
)))
529 return error_mark_node
;
530 else if (bad_func_quals
&& !(complain
& tf_error
))
531 return error_mark_node
;
534 if (complain
& tf_ignore_bad_quals
)
535 /* We're not going to warn about constifying things that can't
537 bad_quals
&= ~TYPE_QUAL_CONST
;
538 bad_quals
|= bad_func_quals
;
541 tree bad_type
= build_qualified_type (ptr_type_node
, bad_quals
);
543 if (!(complain
& tf_ignore_bad_quals
)
545 error ("`%V' qualifiers cannot be applied to `%T'",
550 /* Retrieve (or create) the appropriately qualified variant. */
551 result
= build_qualified_type (type
, type_quals
);
553 /* If this was a pointer-to-method type, and we just made a copy,
554 then we need to unshare the record that holds the cached
555 pointer-to-member-function type, because these will be distinct
556 between the unqualified and qualified types. */
558 && TREE_CODE (type
) == POINTER_TYPE
559 && TREE_CODE (TREE_TYPE (type
)) == METHOD_TYPE
)
560 TYPE_LANG_SPECIFIC (result
) = NULL
;
565 /* Returns the canonical version of TYPE. In other words, if TYPE is
566 a typedef, returns the underlying type. The cv-qualification of
567 the type returned matches the type input; they will always be
571 canonical_type_variant (tree t
)
573 return cp_build_qualified_type (TYPE_MAIN_VARIANT (t
), cp_type_quals (t
));
576 /* Makes new binfos for the indirect bases under BINFO. T is the most
577 derived TYPE. PREV is the previous binfo, whose TREE_CHAIN we make
578 point to this binfo. We return the last BINFO created.
580 The CLASSTYPE_VBASECLASSES list of T is constructed in reverse
581 order (pre-order, depth-first, right-to-left). You must nreverse it.
583 The BINFO_INHERITANCE of a virtual base class points to the binfo
584 og the most derived type.
586 The binfo's TREE_CHAIN is set to inheritance graph order, but bases
587 for non-class types are not included (i.e. those which are
588 dependent bases in non-instantiated templates). */
591 copy_base_binfos (tree binfo
, tree t
, tree prev
)
593 tree binfos
= BINFO_BASETYPES (binfo
);
597 TREE_CHAIN (prev
) = binfo
;
600 if (binfos
== NULL_TREE
)
603 n
= TREE_VEC_LENGTH (binfos
);
605 /* Now copy the structure beneath BINFO. */
606 for (ix
= 0; ix
!= n
; ix
++)
608 tree base_binfo
= TREE_VEC_ELT (binfos
, ix
);
609 tree new_binfo
= NULL_TREE
;
611 if (!CLASS_TYPE_P (BINFO_TYPE (base_binfo
)))
613 my_friendly_assert (binfo
== TYPE_BINFO (t
), 20030204);
615 new_binfo
= base_binfo
;
616 TREE_CHAIN (prev
) = new_binfo
;
618 BINFO_INHERITANCE_CHAIN (new_binfo
) = binfo
;
619 BINFO_DEPENDENT_BASE_P (new_binfo
) = 1;
621 else if (TREE_VIA_VIRTUAL (base_binfo
))
623 new_binfo
= purpose_member (BINFO_TYPE (base_binfo
),
624 CLASSTYPE_VBASECLASSES (t
));
626 new_binfo
= TREE_VALUE (new_binfo
);
631 new_binfo
= make_binfo (BINFO_OFFSET (base_binfo
),
632 base_binfo
, NULL_TREE
,
633 BINFO_VIRTUALS (base_binfo
));
634 prev
= copy_base_binfos (new_binfo
, t
, prev
);
635 if (TREE_VIA_VIRTUAL (base_binfo
))
637 CLASSTYPE_VBASECLASSES (t
)
638 = tree_cons (BINFO_TYPE (new_binfo
), new_binfo
,
639 CLASSTYPE_VBASECLASSES (t
));
640 TREE_VIA_VIRTUAL (new_binfo
) = 1;
641 BINFO_INHERITANCE_CHAIN (new_binfo
) = TYPE_BINFO (t
);
644 BINFO_INHERITANCE_CHAIN (new_binfo
) = binfo
;
646 TREE_VEC_ELT (binfos
, ix
) = new_binfo
;
653 /* Hashing of lists so that we don't make duplicates.
654 The entry point is `list_hash_canon'. */
656 /* Now here is the hash table. When recording a list, it is added
657 to the slot whose index is the hash code mod the table size.
658 Note that the hash table is used for several kinds of lists.
659 While all these live in the same table, they are completely independent,
660 and the hash code is computed differently for each of these. */
662 static GTY ((param_is (union tree_node
))) htab_t list_hash_table
;
671 /* Compare ENTRY (an entry in the hash table) with DATA (a list_proxy
672 for a node we are thinking about adding). */
675 list_hash_eq (const void* entry
, const void* data
)
677 tree t
= (tree
) entry
;
678 struct list_proxy
*proxy
= (struct list_proxy
*) data
;
680 return (TREE_VALUE (t
) == proxy
->value
681 && TREE_PURPOSE (t
) == proxy
->purpose
682 && TREE_CHAIN (t
) == proxy
->chain
);
685 /* Compute a hash code for a list (chain of TREE_LIST nodes
686 with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the
687 TREE_COMMON slots), by adding the hash codes of the individual entries. */
690 list_hash_pieces (tree purpose
, tree value
, tree chain
)
692 hashval_t hashcode
= 0;
695 hashcode
+= TYPE_HASH (chain
);
698 hashcode
+= TYPE_HASH (value
);
702 hashcode
+= TYPE_HASH (purpose
);
708 /* Hash an already existing TREE_LIST. */
711 list_hash (const void* p
)
714 return list_hash_pieces (TREE_PURPOSE (t
),
719 /* Given list components PURPOSE, VALUE, AND CHAIN, return the canonical
720 object for an identical list if one already exists. Otherwise, build a
721 new one, and record it as the canonical object. */
724 hash_tree_cons (tree purpose
, tree value
, tree chain
)
728 struct list_proxy proxy
;
730 /* Hash the list node. */
731 hashcode
= list_hash_pieces (purpose
, value
, chain
);
732 /* Create a proxy for the TREE_LIST we would like to create. We
733 don't actually create it so as to avoid creating garbage. */
734 proxy
.purpose
= purpose
;
737 /* See if it is already in the table. */
738 slot
= htab_find_slot_with_hash (list_hash_table
, &proxy
, hashcode
,
740 /* If not, create a new node. */
742 *slot
= tree_cons (purpose
, value
, chain
);
746 /* Constructor for hashed lists. */
749 hash_tree_chain (tree value
, tree chain
)
751 return hash_tree_cons (NULL_TREE
, value
, chain
);
754 /* Similar, but used for concatenating two lists. */
757 hash_chainon (tree list1
, tree list2
)
763 if (TREE_CHAIN (list1
) == NULL_TREE
)
764 return hash_tree_chain (TREE_VALUE (list1
), list2
);
765 return hash_tree_chain (TREE_VALUE (list1
),
766 hash_chainon (TREE_CHAIN (list1
), list2
));
769 /* Build an association between TYPE and some parameters:
771 OFFSET is the offset added to `this' to convert it to a pointer
774 BINFO is the base binfo to use, if we are deriving from one. This
775 is necessary, as we want specialized parent binfos from base
776 classes, so that the VTABLE_NAMEs of bases are for the most derived
777 type, instead of the simple type.
779 VTABLE is the virtual function table with which to initialize
780 sub-objects of type TYPE.
782 VIRTUALS are the virtual functions sitting in VTABLE. */
785 make_binfo (tree offset
, tree binfo
, tree vtable
, tree virtuals
)
787 tree new_binfo
= make_tree_vec (BINFO_LANG_ELTS
);
790 if (TREE_CODE (binfo
) == TREE_VEC
)
792 type
= BINFO_TYPE (binfo
);
793 BINFO_DEPENDENT_BASE_P (new_binfo
) = BINFO_DEPENDENT_BASE_P (binfo
);
799 BINFO_DEPENDENT_BASE_P (new_binfo
) = 1;
802 TREE_TYPE (new_binfo
) = TYPE_MAIN_VARIANT (type
);
803 BINFO_OFFSET (new_binfo
) = offset
;
804 BINFO_VTABLE (new_binfo
) = vtable
;
805 BINFO_VIRTUALS (new_binfo
) = virtuals
;
807 if (binfo
&& !BINFO_DEPENDENT_BASE_P (binfo
)
808 && BINFO_BASETYPES (binfo
) != NULL_TREE
)
810 BINFO_BASETYPES (new_binfo
) = copy_node (BINFO_BASETYPES (binfo
));
811 /* We do not need to copy the accesses, as they are read only. */
812 BINFO_BASEACCESSES (new_binfo
) = BINFO_BASEACCESSES (binfo
);
818 debug_binfo (tree elem
)
823 fprintf (stderr
, "type \"%s\", offset = " HOST_WIDE_INT_PRINT_DEC
825 TYPE_NAME_STRING (BINFO_TYPE (elem
)),
826 TREE_INT_CST_LOW (BINFO_OFFSET (elem
)));
827 debug_tree (BINFO_TYPE (elem
));
828 if (BINFO_VTABLE (elem
))
829 fprintf (stderr
, "vtable decl \"%s\"\n",
830 IDENTIFIER_POINTER (DECL_NAME (get_vtbl_decl_for_binfo (elem
))));
832 fprintf (stderr
, "no vtable decl yet\n");
833 fprintf (stderr
, "virtuals:\n");
834 virtuals
= BINFO_VIRTUALS (elem
);
839 tree fndecl
= TREE_VALUE (virtuals
);
840 fprintf (stderr
, "%s [%ld =? %ld]\n",
841 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl
)),
842 (long) n
, (long) TREE_INT_CST_LOW (DECL_VINDEX (fndecl
)));
844 virtuals
= TREE_CHAIN (virtuals
);
849 count_functions (tree t
)
852 if (TREE_CODE (t
) == FUNCTION_DECL
)
854 else if (TREE_CODE (t
) == OVERLOAD
)
856 for (i
= 0; t
; t
= OVL_CHAIN (t
))
866 is_overloaded_fn (tree x
)
868 /* A baselink is also considered an overloaded function. */
869 if (TREE_CODE (x
) == OFFSET_REF
)
870 x
= TREE_OPERAND (x
, 1);
872 x
= BASELINK_FUNCTIONS (x
);
873 return (TREE_CODE (x
) == FUNCTION_DECL
874 || TREE_CODE (x
) == TEMPLATE_ID_EXPR
875 || DECL_FUNCTION_TEMPLATE_P (x
)
876 || TREE_CODE (x
) == OVERLOAD
);
880 really_overloaded_fn (tree x
)
882 /* A baselink is also considered an overloaded function. */
883 if (TREE_CODE (x
) == OFFSET_REF
)
884 x
= TREE_OPERAND (x
, 1);
886 x
= BASELINK_FUNCTIONS (x
);
888 return ((TREE_CODE (x
) == OVERLOAD
&& OVL_CHAIN (x
))
889 || DECL_FUNCTION_TEMPLATE_P (OVL_CURRENT (x
))
890 || TREE_CODE (x
) == TEMPLATE_ID_EXPR
);
894 get_first_fn (tree from
)
896 my_friendly_assert (is_overloaded_fn (from
), 9);
897 /* A baselink is also considered an overloaded function. */
898 if (BASELINK_P (from
))
899 from
= BASELINK_FUNCTIONS (from
);
900 return OVL_CURRENT (from
);
903 /* Returns nonzero if T is a ->* or .* expression that refers to a
909 return (TREE_CODE (t
) == OFFSET_REF
910 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (t
, 1))));
913 /* Return a new OVL node, concatenating it with the old one. */
916 ovl_cons (tree decl
, tree chain
)
918 tree result
= make_node (OVERLOAD
);
919 TREE_TYPE (result
) = unknown_type_node
;
920 OVL_FUNCTION (result
) = decl
;
921 TREE_CHAIN (result
) = chain
;
926 /* Build a new overloaded function. If this is the first one,
927 just return it; otherwise, ovl_cons the _DECLs */
930 build_overload (tree decl
, tree chain
)
932 if (! chain
&& TREE_CODE (decl
) != TEMPLATE_DECL
)
934 if (chain
&& TREE_CODE (chain
) != OVERLOAD
)
935 chain
= ovl_cons (chain
, NULL_TREE
);
936 return ovl_cons (decl
, chain
);
940 #define PRINT_RING_SIZE 4
943 cxx_printable_name (tree decl
, int v
)
945 static tree decl_ring
[PRINT_RING_SIZE
];
946 static char *print_ring
[PRINT_RING_SIZE
];
947 static int ring_counter
;
950 /* Only cache functions. */
952 || TREE_CODE (decl
) != FUNCTION_DECL
953 || DECL_LANG_SPECIFIC (decl
) == 0)
954 return lang_decl_name (decl
, v
);
956 /* See if this print name is lying around. */
957 for (i
= 0; i
< PRINT_RING_SIZE
; i
++)
958 if (decl_ring
[i
] == decl
)
959 /* yes, so return it. */
960 return print_ring
[i
];
962 if (++ring_counter
== PRINT_RING_SIZE
)
965 if (current_function_decl
!= NULL_TREE
)
967 if (decl_ring
[ring_counter
] == current_function_decl
)
969 if (ring_counter
== PRINT_RING_SIZE
)
971 if (decl_ring
[ring_counter
] == current_function_decl
)
975 if (print_ring
[ring_counter
])
976 free (print_ring
[ring_counter
]);
978 print_ring
[ring_counter
] = xstrdup (lang_decl_name (decl
, v
));
979 decl_ring
[ring_counter
] = decl
;
980 return print_ring
[ring_counter
];
983 /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions
987 build_exception_variant (tree type
, tree raises
)
989 tree v
= TYPE_MAIN_VARIANT (type
);
990 int type_quals
= TYPE_QUALS (type
);
992 for (; v
; v
= TYPE_NEXT_VARIANT (v
))
993 if (TYPE_QUALS (v
) == type_quals
994 && comp_except_specs (raises
, TYPE_RAISES_EXCEPTIONS (v
), 1))
997 /* Need to build a new variant. */
998 v
= build_type_copy (type
);
999 TYPE_RAISES_EXCEPTIONS (v
) = raises
;
1003 /* Given a TEMPLATE_TEMPLATE_PARM node T, create a new
1004 BOUND_TEMPLATE_TEMPLATE_PARM bound with NEWARGS as its template
1008 bind_template_template_parm (tree t
, tree newargs
)
1010 tree decl
= TYPE_NAME (t
);
1013 t2
= make_aggr_type (BOUND_TEMPLATE_TEMPLATE_PARM
);
1014 decl
= build_decl (TYPE_DECL
, DECL_NAME (decl
), NULL_TREE
);
1016 /* These nodes have to be created to reflect new TYPE_DECL and template
1018 TEMPLATE_TYPE_PARM_INDEX (t2
) = copy_node (TEMPLATE_TYPE_PARM_INDEX (t
));
1019 TEMPLATE_PARM_DECL (TEMPLATE_TYPE_PARM_INDEX (t2
)) = decl
;
1020 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2
)
1021 = tree_cons (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t
),
1022 newargs
, NULL_TREE
);
1024 TREE_TYPE (decl
) = t2
;
1025 TYPE_NAME (t2
) = decl
;
1026 TYPE_STUB_DECL (t2
) = decl
;
1032 /* Called from count_trees via walk_tree. */
1035 count_trees_r (tree
* tp ATTRIBUTE_UNUSED
,
1036 int* walk_subtrees ATTRIBUTE_UNUSED
,
1043 /* Debugging function for measuring the rough complexity of a tree
1047 count_trees (tree t
)
1050 walk_tree_without_duplicates (&t
, count_trees_r
, &n_trees
);
1054 /* Called from verify_stmt_tree via walk_tree. */
1057 verify_stmt_tree_r (tree
* tp
,
1058 int* walk_subtrees ATTRIBUTE_UNUSED
,
1062 htab_t
*statements
= (htab_t
*) data
;
1065 if (!STATEMENT_CODE_P (TREE_CODE (t
)))
1068 /* If this statement is already present in the hash table, then
1069 there is a circularity in the statement tree. */
1070 if (htab_find (*statements
, t
))
1073 slot
= htab_find_slot (*statements
, t
, INSERT
);
1079 /* Debugging function to check that the statement T has not been
1080 corrupted. For now, this function simply checks that T contains no
1084 verify_stmt_tree (tree t
)
1087 statements
= htab_create (37, htab_hash_pointer
, htab_eq_pointer
, NULL
);
1088 walk_tree (&t
, verify_stmt_tree_r
, &statements
, NULL
);
1089 htab_delete (statements
);
1092 /* Called from find_tree via walk_tree. */
1095 find_tree_r (tree
* tp
,
1096 int* walk_subtrees ATTRIBUTE_UNUSED
,
1099 if (*tp
== (tree
) data
)
1105 /* Returns X if X appears in the tree structure rooted at T. */
1108 find_tree (tree t
, tree x
)
1110 return walk_tree_without_duplicates (&t
, find_tree_r
, x
);
1113 /* Passed to walk_tree. Checks for the use of types with no linkage. */
1116 no_linkage_helper (tree
* tp
,
1117 int* walk_subtrees ATTRIBUTE_UNUSED
,
1118 void* data ATTRIBUTE_UNUSED
)
1123 && (CLASS_TYPE_P (t
) || TREE_CODE (t
) == ENUMERAL_TYPE
)
1124 && (decl_function_context (TYPE_MAIN_DECL (t
))
1125 || TYPE_ANONYMOUS_P (t
)))
1130 /* Check if the type T depends on a type with no linkage and if so, return
1134 no_linkage_check (tree t
)
1136 /* There's no point in checking linkage on template functions; we
1137 can't know their complete types. */
1138 if (processing_template_decl
)
1141 t
= walk_tree_without_duplicates (&t
, no_linkage_helper
, NULL
);
1142 if (t
!= error_mark_node
)
1147 #ifdef GATHER_STATISTICS
1148 extern int depth_reached
;
1152 cxx_print_statistics (void)
1154 print_search_statistics ();
1155 print_class_statistics ();
1156 #ifdef GATHER_STATISTICS
1157 fprintf (stderr
, "maximum template instantiation depth reached: %d\n",
1162 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1163 (which is an ARRAY_TYPE). This counts only elements of the top
1167 array_type_nelts_top (tree type
)
1169 return fold (build (PLUS_EXPR
, sizetype
,
1170 array_type_nelts (type
),
1174 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1175 (which is an ARRAY_TYPE). This one is a recursive count of all
1176 ARRAY_TYPEs that are clumped together. */
1179 array_type_nelts_total (tree type
)
1181 tree sz
= array_type_nelts_top (type
);
1182 type
= TREE_TYPE (type
);
1183 while (TREE_CODE (type
) == ARRAY_TYPE
)
1185 tree n
= array_type_nelts_top (type
);
1186 sz
= fold (build (MULT_EXPR
, sizetype
, sz
, n
));
1187 type
= TREE_TYPE (type
);
1192 /* Called from break_out_target_exprs via mapcar. */
1195 bot_manip (tree
* tp
, int* walk_subtrees
, void* data
)
1197 splay_tree target_remap
= ((splay_tree
) data
);
1200 if (TREE_CONSTANT (t
))
1202 /* There can't be any TARGET_EXPRs or their slot variables below
1203 this point. We used to check !TREE_SIDE_EFFECTS, but then we
1204 failed to copy an ADDR_EXPR of the slot VAR_DECL. */
1208 if (TREE_CODE (t
) == TARGET_EXPR
)
1212 if (TREE_CODE (TREE_OPERAND (t
, 1)) == AGGR_INIT_EXPR
)
1214 mark_used (TREE_OPERAND (TREE_OPERAND (TREE_OPERAND (t
, 1), 0), 0));
1216 (TREE_TYPE (t
), break_out_target_exprs (TREE_OPERAND (t
, 1)));
1220 u
= build_target_expr_with_type
1221 (break_out_target_exprs (TREE_OPERAND (t
, 1)), TREE_TYPE (t
));
1224 /* Map the old variable to the new one. */
1225 splay_tree_insert (target_remap
,
1226 (splay_tree_key
) TREE_OPERAND (t
, 0),
1227 (splay_tree_value
) TREE_OPERAND (u
, 0));
1229 /* Replace the old expression with the new version. */
1231 /* We don't have to go below this point; the recursive call to
1232 break_out_target_exprs will have handled anything below this
1237 else if (TREE_CODE (t
) == CALL_EXPR
)
1238 mark_used (TREE_OPERAND (TREE_OPERAND (t
, 0), 0));
1240 /* Make a copy of this node. */
1241 return copy_tree_r (tp
, walk_subtrees
, NULL
);
1244 /* Replace all remapped VAR_DECLs in T with their new equivalents.
1245 DATA is really a splay-tree mapping old variables to new
1249 bot_replace (tree
* t
,
1250 int* walk_subtrees ATTRIBUTE_UNUSED
,
1253 splay_tree target_remap
= ((splay_tree
) data
);
1255 if (TREE_CODE (*t
) == VAR_DECL
)
1257 splay_tree_node n
= splay_tree_lookup (target_remap
,
1258 (splay_tree_key
) *t
);
1260 *t
= (tree
) n
->value
;
1266 /* When we parse a default argument expression, we may create
1267 temporary variables via TARGET_EXPRs. When we actually use the
1268 default-argument expression, we make a copy of the expression, but
1269 we must replace the temporaries with appropriate local versions. */
1272 break_out_target_exprs (tree t
)
1274 static int target_remap_count
;
1275 static splay_tree target_remap
;
1277 if (!target_remap_count
++)
1278 target_remap
= splay_tree_new (splay_tree_compare_pointers
,
1279 /*splay_tree_delete_key_fn=*/NULL
,
1280 /*splay_tree_delete_value_fn=*/NULL
);
1281 walk_tree (&t
, bot_manip
, target_remap
, NULL
);
1282 walk_tree (&t
, bot_replace
, target_remap
, NULL
);
1284 if (!--target_remap_count
)
1286 splay_tree_delete (target_remap
);
1287 target_remap
= NULL
;
1293 /* Similar to `build_nt', but for template definitions of dependent
1297 build_min_nt (enum tree_code code
, ...)
1306 t
= make_node (code
);
1307 length
= TREE_CODE_LENGTH (code
);
1308 TREE_COMPLEXITY (t
) = input_line
;
1310 for (i
= 0; i
< length
; i
++)
1312 tree x
= va_arg (p
, tree
);
1313 TREE_OPERAND (t
, i
) = x
;
1320 /* Similar to `build', but for template definitions. */
1323 build_min (enum tree_code code
, tree tt
, ...)
1332 t
= make_node (code
);
1333 length
= TREE_CODE_LENGTH (code
);
1335 TREE_COMPLEXITY (t
) = input_line
;
1337 for (i
= 0; i
< length
; i
++)
1339 tree x
= va_arg (p
, tree
);
1340 TREE_OPERAND (t
, i
) = x
;
1341 if (x
&& TREE_SIDE_EFFECTS (x
))
1342 TREE_SIDE_EFFECTS (t
) = 1;
1349 /* Similar to `build', but for template definitions of non-dependent
1350 expressions. NON_DEP is the non-dependent expression that has been
1354 build_min_non_dep (enum tree_code code
, tree non_dep
, ...)
1361 va_start (p
, non_dep
);
1363 t
= make_node (code
);
1364 length
= TREE_CODE_LENGTH (code
);
1365 TREE_TYPE (t
) = TREE_TYPE (non_dep
);
1366 TREE_COMPLEXITY (t
) = input_line
;
1367 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (non_dep
);
1369 for (i
= 0; i
< length
; i
++)
1371 tree x
= va_arg (p
, tree
);
1372 TREE_OPERAND (t
, i
) = x
;
1375 if (code
== COMPOUND_EXPR
&& TREE_CODE (non_dep
) != COMPOUND_EXPR
)
1376 /* This should not be considered a COMPOUND_EXPR, because it
1377 resolves to an overload. */
1378 COMPOUND_EXPR_OVERLOADED (t
) = 1;
1384 /* Returns an INTEGER_CST (of type `int') corresponding to I.
1385 Multiple calls with the same value of I may or may not yield the
1386 same node; therefore, callers should never modify the node
1389 static GTY(()) tree shared_int_cache
[256];
1392 build_shared_int_cst (int i
)
1395 return build_int_2 (i
, 0);
1397 if (!shared_int_cache
[i
])
1398 shared_int_cache
[i
] = build_int_2 (i
, 0);
1400 return shared_int_cache
[i
];
1404 get_type_decl (tree t
)
1406 if (TREE_CODE (t
) == TYPE_DECL
)
1409 return TYPE_STUB_DECL (t
);
1410 if (t
== error_mark_node
)
1415 /* Stop compiler from complaining control reaches end of non-void function. */
1419 /* Return first vector element whose BINFO_TYPE is ELEM.
1420 Return 0 if ELEM is not in VEC. VEC may be NULL_TREE. */
1423 vec_binfo_member (tree elem
, tree vec
)
1428 for (i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
1429 if (same_type_p (elem
, BINFO_TYPE (TREE_VEC_ELT (vec
, i
))))
1430 return TREE_VEC_ELT (vec
, i
);
1435 /* Returns the namespace that contains DECL, whether directly or
1439 decl_namespace_context (tree decl
)
1443 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
1445 else if (TYPE_P (decl
))
1446 decl
= CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl
));
1448 decl
= CP_DECL_CONTEXT (decl
);
1452 /* Return truthvalue of whether T1 is the same tree structure as T2.
1453 Return 1 if they are the same. Return 0 if they are different. */
1456 cp_tree_equal (tree t1
, tree t2
)
1458 enum tree_code code1
, code2
;
1465 for (code1
= TREE_CODE (t1
);
1466 code1
== NOP_EXPR
|| code1
== CONVERT_EXPR
1467 || code1
== NON_LVALUE_EXPR
;
1468 code1
= TREE_CODE (t1
))
1469 t1
= TREE_OPERAND (t1
, 0);
1470 for (code2
= TREE_CODE (t2
);
1471 code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
1472 || code1
== NON_LVALUE_EXPR
;
1473 code2
= TREE_CODE (t2
))
1474 t2
= TREE_OPERAND (t2
, 0);
1476 /* They might have become equal now. */
1486 return TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
1487 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
);
1490 return REAL_VALUES_EQUAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
1493 return TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
1494 && !memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
1495 TREE_STRING_LENGTH (t1
));
1498 /* We need to do this when determining whether or not two
1499 non-type pointer to member function template arguments
1501 if (!(same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
1502 /* The first operand is RTL. */
1503 && TREE_OPERAND (t1
, 0) == TREE_OPERAND (t2
, 0)))
1505 return cp_tree_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
1508 if (!cp_tree_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
)))
1510 if (!cp_tree_equal (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1512 return cp_tree_equal (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
1515 return cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
1518 if (!cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0)))
1520 return cp_tree_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
1524 tree o1
= TREE_OPERAND (t1
, 0);
1525 tree o2
= TREE_OPERAND (t2
, 0);
1527 /* Special case: if either target is an unallocated VAR_DECL,
1528 it means that it's going to be unified with whatever the
1529 TARGET_EXPR is really supposed to initialize, so treat it
1530 as being equivalent to anything. */
1531 if (TREE_CODE (o1
) == VAR_DECL
&& DECL_NAME (o1
) == NULL_TREE
1532 && !DECL_RTL_SET_P (o1
))
1534 else if (TREE_CODE (o2
) == VAR_DECL
&& DECL_NAME (o2
) == NULL_TREE
1535 && !DECL_RTL_SET_P (o2
))
1537 else if (!cp_tree_equal (o1
, o2
))
1540 return cp_tree_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
1543 case WITH_CLEANUP_EXPR
:
1544 if (!cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0)))
1546 return cp_tree_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
1549 if (TREE_OPERAND (t1
, 1) != TREE_OPERAND (t2
, 1))
1551 return cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
1558 case IDENTIFIER_NODE
:
1561 case TEMPLATE_PARM_INDEX
:
1562 return (TEMPLATE_PARM_IDX (t1
) == TEMPLATE_PARM_IDX (t2
)
1563 && TEMPLATE_PARM_LEVEL (t1
) == TEMPLATE_PARM_LEVEL (t2
)
1564 && same_type_p (TREE_TYPE (TEMPLATE_PARM_DECL (t1
)),
1565 TREE_TYPE (TEMPLATE_PARM_DECL (t2
))));
1567 case TEMPLATE_ID_EXPR
:
1572 if (!cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0)))
1574 vec1
= TREE_OPERAND (t1
, 1);
1575 vec2
= TREE_OPERAND (t2
, 1);
1578 return !vec1
&& !vec2
;
1580 if (TREE_VEC_LENGTH (vec1
) != TREE_VEC_LENGTH (vec2
))
1583 for (ix
= TREE_VEC_LENGTH (vec1
); ix
--;)
1584 if (!cp_tree_equal (TREE_VEC_ELT (vec1
, ix
),
1585 TREE_VEC_ELT (vec2
, ix
)))
1594 tree o1
= TREE_OPERAND (t1
, 0);
1595 tree o2
= TREE_OPERAND (t2
, 0);
1597 if (TREE_CODE (o1
) != TREE_CODE (o2
))
1600 return same_type_p (o1
, o2
);
1602 return cp_tree_equal (o1
, o2
);
1606 /* Two pointer-to-members are the same if they point to the same
1607 field or function in the same class. */
1608 if (PTRMEM_CST_MEMBER (t1
) != PTRMEM_CST_MEMBER (t2
))
1611 return same_type_p (PTRMEM_CST_CLASS (t1
), PTRMEM_CST_CLASS (t2
));
1617 switch (TREE_CODE_CLASS (code1
))
1628 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); ++i
)
1629 if (!cp_tree_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
)))
1636 return same_type_p (t1
, t2
);
1639 my_friendly_assert (0, 20030617);
1643 /* Build a wrapper around a 'struct z_candidate' so we can use it as a
1647 build_zc_wrapper (struct z_candidate
* ptr
)
1649 tree t
= make_node (WRAPPER
);
1650 WRAPPER_ZC (t
) = ptr
;
1654 /* The type of ARG when used as an lvalue. */
1657 lvalue_type (tree arg
)
1659 tree type
= TREE_TYPE (arg
);
1660 if (TREE_CODE (arg
) == OVERLOAD
)
1661 type
= unknown_type_node
;
1665 /* The type of ARG for printing error messages; denote lvalues with
1669 error_type (tree arg
)
1671 tree type
= TREE_TYPE (arg
);
1673 if (TREE_CODE (type
) == ARRAY_TYPE
)
1675 else if (TREE_CODE (type
) == ERROR_MARK
)
1677 else if (real_lvalue_p (arg
))
1678 type
= build_reference_type (lvalue_type (arg
));
1679 else if (IS_AGGR_TYPE (type
))
1680 type
= lvalue_type (arg
);
1685 /* Does FUNCTION use a variable-length argument list? */
1688 varargs_function_p (tree function
)
1690 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (function
));
1691 for (; parm
; parm
= TREE_CHAIN (parm
))
1692 if (TREE_VALUE (parm
) == void_type_node
)
1697 /* Returns 1 if decl is a member of a class. */
1700 member_p (tree decl
)
1702 const tree ctx
= DECL_CONTEXT (decl
);
1703 return (ctx
&& TYPE_P (ctx
));
1706 /* Create a placeholder for member access where we don't actually have an
1707 object that the access is against. */
1710 build_dummy_object (tree type
)
1712 tree decl
= build1 (NOP_EXPR
, build_pointer_type (type
), void_zero_node
);
1713 return build_indirect_ref (decl
, NULL
);
1716 /* We've gotten a reference to a member of TYPE. Return *this if appropriate,
1717 or a dummy object otherwise. If BINFOP is non-0, it is filled with the
1718 binfo path from current_class_type to TYPE, or 0. */
1721 maybe_dummy_object (tree type
, tree
* binfop
)
1726 if (current_class_type
1727 && (binfo
= lookup_base (current_class_type
, type
,
1728 ba_ignore
| ba_quiet
, NULL
)))
1729 context
= current_class_type
;
1732 /* Reference from a nested class member function. */
1734 binfo
= TYPE_BINFO (type
);
1740 if (current_class_ref
&& context
== current_class_type
1741 /* Kludge: Make sure that current_class_type is actually
1742 correct. It might not be if we're in the middle of
1743 tsubst_default_argument. */
1744 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref
)),
1745 current_class_type
))
1746 decl
= current_class_ref
;
1748 decl
= build_dummy_object (context
);
1753 /* Returns 1 if OB is a placeholder object, or a pointer to one. */
1756 is_dummy_object (tree ob
)
1758 if (TREE_CODE (ob
) == INDIRECT_REF
)
1759 ob
= TREE_OPERAND (ob
, 0);
1760 return (TREE_CODE (ob
) == NOP_EXPR
1761 && TREE_OPERAND (ob
, 0) == void_zero_node
);
1764 /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */
1769 t
= strip_array_types (t
);
1771 if (t
== error_mark_node
)
1773 if (INTEGRAL_TYPE_P (t
))
1774 return 1; /* integral, character or enumeral type */
1775 if (FLOAT_TYPE_P (t
))
1778 return 1; /* pointer to non-member */
1779 if (TYPE_PTR_TO_MEMBER_P (t
))
1780 return 1; /* pointer to member */
1782 if (! CLASS_TYPE_P (t
))
1783 return 0; /* other non-class type (reference or function) */
1784 if (CLASSTYPE_NON_POD_P (t
))
1789 /* Returns 1 iff zero initialization of type T means actually storing
1793 zero_init_p (tree t
)
1795 t
= strip_array_types (t
);
1797 if (t
== error_mark_node
)
1800 /* NULL pointers to data members are initialized with -1. */
1801 if (TYPE_PTRMEM_P (t
))
1804 /* Classes that contain types that can't be zero-initialized, cannot
1805 be zero-initialized themselves. */
1806 if (CLASS_TYPE_P (t
) && CLASSTYPE_NON_ZERO_INIT_P (t
))
1812 /* Table of valid C++ attributes. */
1813 const struct attribute_spec cxx_attribute_table
[] =
1815 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
1816 { "java_interface", 0, 0, false, false, false, handle_java_interface_attribute
},
1817 { "com_interface", 0, 0, false, false, false, handle_com_interface_attribute
},
1818 { "init_priority", 1, 1, true, false, false, handle_init_priority_attribute
},
1819 { NULL
, 0, 0, false, false, false, NULL
}
1822 /* Handle a "java_interface" attribute; arguments as in
1823 struct attribute_spec.handler. */
1825 handle_java_interface_attribute (tree
* node
,
1827 tree args ATTRIBUTE_UNUSED
,
1832 || !CLASS_TYPE_P (*node
)
1833 || !TYPE_FOR_JAVA (*node
))
1835 error ("`%s' attribute can only be applied to Java class definitions",
1836 IDENTIFIER_POINTER (name
));
1837 *no_add_attrs
= true;
1840 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
1841 *node
= build_type_copy (*node
);
1842 TYPE_JAVA_INTERFACE (*node
) = 1;
1847 /* Handle a "com_interface" attribute; arguments as in
1848 struct attribute_spec.handler. */
1850 handle_com_interface_attribute (tree
* node
,
1852 tree args ATTRIBUTE_UNUSED
,
1853 int flags ATTRIBUTE_UNUSED
,
1858 *no_add_attrs
= true;
1861 || !CLASS_TYPE_P (*node
)
1862 || *node
!= TYPE_MAIN_VARIANT (*node
))
1864 warning ("`%s' attribute can only be applied to class definitions",
1865 IDENTIFIER_POINTER (name
));
1870 warning ("`%s' is obsolete; g++ vtables are now COM-compatible by default",
1871 IDENTIFIER_POINTER (name
));
1876 /* Handle an "init_priority" attribute; arguments as in
1877 struct attribute_spec.handler. */
1879 handle_init_priority_attribute (tree
* node
,
1882 int flags ATTRIBUTE_UNUSED
,
1885 tree initp_expr
= TREE_VALUE (args
);
1887 tree type
= TREE_TYPE (decl
);
1890 STRIP_NOPS (initp_expr
);
1892 if (!initp_expr
|| TREE_CODE (initp_expr
) != INTEGER_CST
)
1894 error ("requested init_priority is not an integer constant");
1895 *no_add_attrs
= true;
1899 pri
= TREE_INT_CST_LOW (initp_expr
);
1901 type
= strip_array_types (type
);
1903 if (decl
== NULL_TREE
1904 || TREE_CODE (decl
) != VAR_DECL
1905 || !TREE_STATIC (decl
)
1906 || DECL_EXTERNAL (decl
)
1907 || (TREE_CODE (type
) != RECORD_TYPE
1908 && TREE_CODE (type
) != UNION_TYPE
)
1909 /* Static objects in functions are initialized the
1910 first time control passes through that
1911 function. This is not precise enough to pin down an
1912 init_priority value, so don't allow it. */
1913 || current_function_decl
)
1915 error ("can only use `%s' attribute on file-scope definitions of objects of class type",
1916 IDENTIFIER_POINTER (name
));
1917 *no_add_attrs
= true;
1921 if (pri
> MAX_INIT_PRIORITY
|| pri
<= 0)
1923 error ("requested init_priority is out of range");
1924 *no_add_attrs
= true;
1928 /* Check for init_priorities that are reserved for
1929 language and runtime support implementations.*/
1930 if (pri
<= MAX_RESERVED_INIT_PRIORITY
)
1933 ("requested init_priority is reserved for internal use");
1936 if (SUPPORTS_INIT_PRIORITY
)
1938 DECL_INIT_PRIORITY (decl
) = pri
;
1943 error ("`%s' attribute is not supported on this platform",
1944 IDENTIFIER_POINTER (name
));
1945 *no_add_attrs
= true;
1950 /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the
1951 thing pointed to by the constant. */
1954 make_ptrmem_cst (tree type
, tree member
)
1956 tree ptrmem_cst
= make_node (PTRMEM_CST
);
1957 /* If would seem a great convenience if make_node would set
1958 TREE_CONSTANT for things of class `c', but it does not. */
1959 TREE_CONSTANT (ptrmem_cst
) = 1;
1960 TREE_TYPE (ptrmem_cst
) = type
;
1961 PTRMEM_CST_MEMBER (ptrmem_cst
) = member
;
1965 /* Apply FUNC to all language-specific sub-trees of TP in a pre-order
1966 traversal. Called from walk_tree(). */
1969 cp_walk_subtrees (tree
* tp
,
1970 int* walk_subtrees_p
,
1975 enum tree_code code
= TREE_CODE (*tp
);
1978 #define WALK_SUBTREE(NODE) \
1981 result = walk_tree (&(NODE), func, data, htab); \
1987 /* Not one of the easy cases. We must explicitly go through the
1992 case TEMPLATE_TEMPLATE_PARM
:
1993 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1994 case UNBOUND_CLASS_TEMPLATE
:
1995 case TEMPLATE_PARM_INDEX
:
1996 case TEMPLATE_TYPE_PARM
:
2000 /* None of these have subtrees other than those already walked
2002 *walk_subtrees_p
= 0;
2006 WALK_SUBTREE (TREE_TYPE (*tp
));
2007 *walk_subtrees_p
= 0;
2011 WALK_SUBTREE (TREE_PURPOSE (*tp
));
2015 WALK_SUBTREE (OVL_FUNCTION (*tp
));
2016 WALK_SUBTREE (OVL_CHAIN (*tp
));
2017 *walk_subtrees_p
= 0;
2021 if (TYPE_PTRMEMFUNC_P (*tp
))
2022 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (*tp
));
2029 /* We didn't find what we were looking for. */
2035 /* Decide whether there are language-specific reasons to not inline a
2036 function as a tree. */
2039 cp_cannot_inline_tree_fn (tree
* fnp
)
2043 /* We can inline a template instantiation only if it's fully
2045 if (DECL_TEMPLATE_INFO (fn
)
2046 && TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (fn
)))
2048 /* Don't instantiate functions that are not going to be
2050 if (!DECL_INLINE (DECL_TEMPLATE_RESULT
2051 (template_for_substitution (fn
))))
2054 fn
= *fnp
= instantiate_decl (fn
, /*defer_ok=*/0);
2056 if (TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (fn
)))
2060 if (flag_really_no_inline
2061 && lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)) == NULL
)
2064 /* Don't auto-inline anything that might not be bound within
2065 this unit of translation. */
2066 if (!DECL_DECLARED_INLINE_P (fn
) && !(*targetm
.binds_local_p
) (fn
))
2068 DECL_UNINLINABLE (fn
) = 1;
2072 if (varargs_function_p (fn
))
2074 DECL_UNINLINABLE (fn
) = 1;
2078 if (! function_attribute_inlinable_p (fn
))
2080 DECL_UNINLINABLE (fn
) = 1;
2087 /* Add any pending functions other than the current function (already
2088 handled by the caller), that thus cannot be inlined, to FNS_P, then
2089 return the latest function added to the array, PREV_FN. */
2092 cp_add_pending_fn_decls (void* fns_p
, tree prev_fn
)
2094 varray_type
*fnsp
= (varray_type
*)fns_p
;
2095 struct saved_scope
*s
;
2097 for (s
= scope_chain
; s
; s
= s
->prev
)
2098 if (s
->function_decl
&& s
->function_decl
!= prev_fn
)
2100 VARRAY_PUSH_TREE (*fnsp
, s
->function_decl
);
2101 prev_fn
= s
->function_decl
;
2107 /* Determine whether a tree node is an OVERLOAD node. Used to decide
2108 whether to copy a node or to preserve its chain when inlining a
2112 cp_is_overload_p (tree t
)
2114 return TREE_CODE (t
) == OVERLOAD
;
2117 /* Determine whether VAR is a declaration of an automatic variable in
2121 cp_auto_var_in_fn_p (tree var
, tree fn
)
2123 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
2124 && nonstatic_local_decl_p (var
));
2127 /* Tell whether a declaration is needed for the RESULT of a function
2128 FN being inlined into CALLER or if the top node of target_exprs is
2132 cp_copy_res_decl_for_inlining (tree result
,
2137 tree return_slot_addr
)
2139 splay_tree decl_map
= (splay_tree
)decl_map_
;
2142 /* If FN returns an aggregate then the caller will always pass the
2143 address of the return slot explicitly. If we were just to
2144 create a new VAR_DECL here, then the result of this function
2145 would be copied (bitwise) into the variable initialized by the
2146 TARGET_EXPR. That's incorrect, so we must transform any
2147 references to the RESULT into references to the target. */
2149 /* We should have an explicit return slot iff the return type is
2150 TREE_ADDRESSABLE. See simplify_aggr_init_expr. */
2151 if (TREE_ADDRESSABLE (TREE_TYPE (result
))
2152 != (return_slot_addr
!= NULL_TREE
))
2155 *need_decl
= !return_slot_addr
;
2156 if (return_slot_addr
)
2158 var
= build_indirect_ref (return_slot_addr
, "");
2159 if (! same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (var
),
2160 TREE_TYPE (result
)))
2163 /* Otherwise, make an appropriate copy. */
2165 var
= copy_decl_for_inlining (result
, fn
, caller
);
2167 if (DECL_SAVED_FUNCTION_DATA (fn
))
2169 tree nrv
= DECL_SAVED_FUNCTION_DATA (fn
)->x_return_value
;
2172 /* We have a named return value; copy the name and source
2173 position so we can get reasonable debugging information, and
2174 register the return variable as its equivalent. */
2175 if (TREE_CODE (var
) == VAR_DECL
2176 /* But not if we're initializing a variable from the
2177 enclosing function which already has its own name. */
2178 && DECL_NAME (var
) == NULL_TREE
)
2180 DECL_NAME (var
) = DECL_NAME (nrv
);
2181 DECL_SOURCE_LOCATION (var
) = DECL_SOURCE_LOCATION (nrv
);
2182 DECL_ABSTRACT_ORIGIN (var
) = DECL_ORIGIN (nrv
);
2183 /* Don't lose initialization info. */
2184 DECL_INITIAL (var
) = DECL_INITIAL (nrv
);
2185 /* Don't forget that it needs to go in the stack. */
2186 TREE_ADDRESSABLE (var
) = TREE_ADDRESSABLE (nrv
);
2189 splay_tree_insert (decl_map
,
2190 (splay_tree_key
) nrv
,
2191 (splay_tree_value
) var
);
2198 /* Initialize tree.c. */
2203 list_hash_table
= htab_create_ggc (31, list_hash
, list_hash_eq
, NULL
);
2206 /* Called via walk_tree. If *TP points to a DECL_STMT for a local
2207 declaration, copies the declaration and enters it in the splay_tree
2208 pointed to by DATA (which is really a `splay_tree *'). */
2211 mark_local_for_remap_r (tree
* tp
,
2212 int* walk_subtrees ATTRIBUTE_UNUSED
,
2216 splay_tree st
= (splay_tree
) data
;
2220 if (TREE_CODE (t
) == DECL_STMT
2221 && nonstatic_local_decl_p (DECL_STMT_DECL (t
)))
2222 decl
= DECL_STMT_DECL (t
);
2223 else if (TREE_CODE (t
) == LABEL_STMT
)
2224 decl
= LABEL_STMT_LABEL (t
);
2225 else if (TREE_CODE (t
) == TARGET_EXPR
2226 && nonstatic_local_decl_p (TREE_OPERAND (t
, 0)))
2227 decl
= TREE_OPERAND (t
, 0);
2228 else if (TREE_CODE (t
) == CASE_LABEL
)
2229 decl
= CASE_LABEL_DECL (t
);
2238 copy
= copy_decl_for_inlining (decl
,
2239 DECL_CONTEXT (decl
),
2240 DECL_CONTEXT (decl
));
2242 /* Remember the copy. */
2243 splay_tree_insert (st
,
2244 (splay_tree_key
) decl
,
2245 (splay_tree_value
) copy
);
2251 /* Called via walk_tree when an expression is unsaved. Using the
2252 splay_tree pointed to by ST (which is really a `splay_tree'),
2253 remaps all local declarations to appropriate replacements. */
2256 cp_unsave_r (tree
* tp
,
2260 splay_tree st
= (splay_tree
) data
;
2263 /* Only a local declaration (variable or label). */
2264 if (nonstatic_local_decl_p (*tp
))
2266 /* Lookup the declaration. */
2267 n
= splay_tree_lookup (st
, (splay_tree_key
) *tp
);
2269 /* If it's there, remap it. */
2271 *tp
= (tree
) n
->value
;
2273 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
2274 remap_save_expr (tp
, st
, current_function_decl
, walk_subtrees
);
2277 copy_tree_r (tp
, walk_subtrees
, NULL
);
2279 /* Do whatever unsaving is required. */
2280 unsave_expr_1 (*tp
);
2283 /* Keep iterating. */
2287 /* Called whenever an expression needs to be unsaved. */
2290 cxx_unsave_expr_now (tree tp
)
2294 /* Create a splay-tree to map old local variable declarations to new
2296 st
= splay_tree_new (splay_tree_compare_pointers
, NULL
, NULL
);
2298 /* Walk the tree once figuring out what needs to be remapped. */
2299 walk_tree (&tp
, mark_local_for_remap_r
, st
, NULL
);
2301 /* Walk the tree again, copying, remapping, and unsaving. */
2302 walk_tree (&tp
, cp_unsave_r
, st
, NULL
);
2305 splay_tree_delete (st
);
2310 /* Returns the kind of special function that DECL (a FUNCTION_DECL)
2311 is. Note that sfk_none is zero, so this function can be used as a
2312 predicate to test whether or not DECL is a special function. */
2314 special_function_kind
2315 special_function_p (tree decl
)
2317 /* Rather than doing all this stuff with magic names, we should
2318 probably have a field of type `special_function_kind' in
2319 DECL_LANG_SPECIFIC. */
2320 if (DECL_COPY_CONSTRUCTOR_P (decl
))
2321 return sfk_copy_constructor
;
2322 if (DECL_CONSTRUCTOR_P (decl
))
2323 return sfk_constructor
;
2324 if (DECL_OVERLOADED_OPERATOR_P (decl
) == NOP_EXPR
)
2325 return sfk_assignment_operator
;
2326 if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl
))
2327 return sfk_destructor
;
2328 if (DECL_COMPLETE_DESTRUCTOR_P (decl
))
2329 return sfk_complete_destructor
;
2330 if (DECL_BASE_DESTRUCTOR_P (decl
))
2331 return sfk_base_destructor
;
2332 if (DECL_DELETING_DESTRUCTOR_P (decl
))
2333 return sfk_deleting_destructor
;
2334 if (DECL_CONV_FN_P (decl
))
2335 return sfk_conversion
;
2340 /* Returns true if and only if NODE is a name, i.e., a node created
2341 by the parser when processing an id-expression. */
2346 if (TREE_CODE (node
) == TEMPLATE_ID_EXPR
)
2347 node
= TREE_OPERAND (node
, 0);
2348 return (/* An ordinary unqualified name. */
2349 TREE_CODE (node
) == IDENTIFIER_NODE
2350 /* A destructor name. */
2351 || TREE_CODE (node
) == BIT_NOT_EXPR
2352 /* A qualified name. */
2353 || TREE_CODE (node
) == SCOPE_REF
);
2356 /* Returns nonzero if TYPE is a character type, including wchar_t. */
2359 char_type_p (tree type
)
2361 return (same_type_p (type
, char_type_node
)
2362 || same_type_p (type
, unsigned_char_type_node
)
2363 || same_type_p (type
, signed_char_type_node
)
2364 || same_type_p (type
, wchar_type_node
));
2367 /* Returns the kind of linkage associated with the indicated DECL. Th
2368 value returned is as specified by the language standard; it is
2369 independent of implementation details regarding template
2370 instantiation, etc. For example, it is possible that a declaration
2371 to which this function assigns external linkage would not show up
2372 as a global symbol when you run `nm' on the resulting object file. */
2375 decl_linkage (tree decl
)
2377 /* This function doesn't attempt to calculate the linkage from first
2378 principles as given in [basic.link]. Instead, it makes use of
2379 the fact that we have already set TREE_PUBLIC appropriately, and
2380 then handles a few special cases. Ideally, we would calculate
2381 linkage first, and then transform that into a concrete
2384 /* Things that don't have names have no linkage. */
2385 if (!DECL_NAME (decl
))
2388 /* Things that are TREE_PUBLIC have external linkage. */
2389 if (TREE_PUBLIC (decl
))
2392 /* Some things that are not TREE_PUBLIC have external linkage, too.
2393 For example, on targets that don't have weak symbols, we make all
2394 template instantiations have internal linkage (in the object
2395 file), but the symbols should still be treated as having external
2396 linkage from the point of view of the language. */
2397 if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
2400 /* Things in local scope do not have linkage, if they don't have
2402 if (decl_function_context (decl
))
2405 /* Everything else has internal linkage. */
2409 /* EXP is an expression that we want to pre-evaluate. Returns via INITP an
2410 expression to perform the pre-evaluation, and returns directly an
2411 expression to use the precalculated result. */
2414 stabilize_expr (tree exp
, tree
* initp
)
2418 if (!TREE_SIDE_EFFECTS (exp
))
2420 init_expr
= void_zero_node
;
2422 else if (!real_lvalue_p (exp
)
2423 || !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (exp
)))
2425 init_expr
= get_target_expr (exp
);
2426 exp
= TARGET_EXPR_SLOT (init_expr
);
2430 exp
= build_unary_op (ADDR_EXPR
, exp
, 1);
2431 init_expr
= get_target_expr (exp
);
2432 exp
= TARGET_EXPR_SLOT (init_expr
);
2433 exp
= build_indirect_ref (exp
, 0);
2440 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
2441 /* Complain that some language-specific thing hanging off a tree
2442 node has been accessed improperly. */
2445 lang_check_failed (const char* file
, int line
, const char* function
)
2447 internal_error ("lang_* check: failed in %s, at %s:%d",
2448 function
, trim_filename (file
), line
);
2450 #endif /* ENABLE_TREE_CHECKING */
2452 #include "gt-cp-tree.h"