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 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);
93 /* In an expression of the form "X.Y", the packed-ness of the
94 expression does not depend on "X". */
95 op1_lvalue_kind &= ~clk_packed;
96 /* Look at the member designator. */
98 /* The "field" can be a FUNCTION_DECL or an OVERLOAD in some
100 || TREE_CODE (TREE_OPERAND (ref, 1)) != FIELD_DECL)
102 else if (DECL_C_BIT_FIELD (TREE_OPERAND (ref, 1)))
104 /* Clear the ordinary bit. If this object was a class
105 rvalue we want to preserve that information. */
106 op1_lvalue_kind &= ~clk_ordinary;
107 /* The lvalue is for a bitfield. */
108 op1_lvalue_kind |= clk_bitfield;
110 else if (DECL_PACKED (TREE_OPERAND (ref, 1)))
111 op1_lvalue_kind |= clk_packed;
113 return op1_lvalue_kind;
119 if (TREE_READONLY (ref) && ! TREE_STATIC (ref)
120 && DECL_LANG_SPECIFIC (ref)
121 && DECL_IN_AGGR_P (ref))
127 if (TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE)
131 /* A currently unresolved scope ref. */
136 op1_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 0),
137 treat_class_rvalues_as_lvalues);
138 op2_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 1),
139 treat_class_rvalues_as_lvalues);
143 op1_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 1),
144 treat_class_rvalues_as_lvalues);
145 op2_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 2),
146 treat_class_rvalues_as_lvalues);
153 return lvalue_p_1 (TREE_OPERAND (ref, 1),
154 treat_class_rvalues_as_lvalues);
157 return treat_class_rvalues_as_lvalues ? clk_class : clk_none;
161 /* Any class-valued call would be wrapped in a TARGET_EXPR. */
165 /* All functions (except non-static-member functions) are
167 return (DECL_NONSTATIC_MEMBER_FUNCTION_P (ref)
168 ? clk_none : clk_ordinary);
170 case NON_DEPENDENT_EXPR:
171 /* We must consider NON_DEPENDENT_EXPRs to be lvalues so that
172 things like "&E" where "E" is an expression with a
173 non-dependent type work. It is safe to be lenient because an
174 error will be issued when the template is instantiated if "E"
182 /* If one operand is not an lvalue at all, then this expression is
184 if (!op1_lvalue_kind || !op2_lvalue_kind)
187 /* Otherwise, it's an lvalue, and it has all the odd properties
188 contributed by either operand. */
189 op1_lvalue_kind = op1_lvalue_kind | op2_lvalue_kind;
190 /* It's not an ordinary lvalue if it involves either a bit-field or
192 if ((op1_lvalue_kind & ~clk_ordinary) != clk_none)
193 op1_lvalue_kind &= ~clk_ordinary;
194 return op1_lvalue_kind;
197 /* Returns the kind of lvalue that REF is, in the sense of
198 [basic.lval]. This function should really be named lvalue_p; it
199 computes the C++ definition of lvalue. */
202 real_lvalue_p (tree ref)
204 return lvalue_p_1 (ref,
205 /*treat_class_rvalues_as_lvalues=*/0);
208 /* This differs from real_lvalue_p in that class rvalues are
209 considered lvalues. */
215 (lvalue_p_1 (ref, /*class rvalue ok*/ 1) != clk_none);
218 /* Return nonzero if REF is an lvalue valid for this language;
219 otherwise, print an error message and return zero. */
222 lvalue_or_else (tree ref, const char* string)
226 error ("non-lvalue in %s", string);
232 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
235 build_target_expr (tree decl, tree value)
239 t = build (TARGET_EXPR, TREE_TYPE (decl), decl, value,
240 cxx_maybe_build_cleanup (decl), NULL_TREE);
241 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
242 ignore the TARGET_EXPR. If there really turn out to be no
243 side-effects, then the optimizer should be able to get rid of
244 whatever code is generated anyhow. */
245 TREE_SIDE_EFFECTS (t) = 1;
250 /* Return an undeclared local temporary of type TYPE for use in building a
254 build_local_temp (tree type)
256 tree slot = build_decl (VAR_DECL, NULL_TREE, type);
257 DECL_ARTIFICIAL (slot) = 1;
258 DECL_CONTEXT (slot) = current_function_decl;
259 layout_decl (slot, 0);
263 /* INIT is a CALL_EXPR which needs info about its target.
264 TYPE is the type that this initialization should appear to have.
266 Build an encapsulation of the initialization to perform
267 and return it so that it can be processed by language-independent
268 and language-specific expression expanders. */
271 build_cplus_new (tree type, tree init)
278 /* Make sure that we're not trying to create an instance of an
280 abstract_virtuals_error (NULL_TREE, type);
282 if (TREE_CODE (init) != CALL_EXPR && TREE_CODE (init) != AGGR_INIT_EXPR)
283 return convert (type, init);
285 fn = TREE_OPERAND (init, 0);
286 is_ctor = (TREE_CODE (fn) == ADDR_EXPR
287 && TREE_CODE (TREE_OPERAND (fn, 0)) == FUNCTION_DECL
288 && DECL_CONSTRUCTOR_P (TREE_OPERAND (fn, 0)));
290 slot = build_local_temp (type);
292 /* We split the CALL_EXPR into its function and its arguments here.
293 Then, in expand_expr, we put them back together. The reason for
294 this is that this expression might be a default argument
295 expression. In that case, we need a new temporary every time the
296 expression is used. That's what break_out_target_exprs does; it
297 replaces every AGGR_INIT_EXPR with a copy that uses a fresh
298 temporary slot. Then, expand_expr builds up a call-expression
299 using the new slot. */
301 /* If we don't need to use a constructor to create an object of this
302 type, don't mess with AGGR_INIT_EXPR. */
303 if (is_ctor || TREE_ADDRESSABLE (type))
305 rval = build (AGGR_INIT_EXPR, type, fn, TREE_OPERAND (init, 1), slot);
306 TREE_SIDE_EFFECTS (rval) = 1;
307 AGGR_INIT_VIA_CTOR_P (rval) = is_ctor;
312 rval = build_target_expr (slot, rval);
317 /* Build a TARGET_EXPR using INIT to initialize a new temporary of the
321 build_target_expr_with_type (tree init, tree type)
325 if (TREE_CODE (init) == TARGET_EXPR)
327 else if (CLASS_TYPE_P (type) && !TYPE_HAS_TRIVIAL_INIT_REF (type)
328 && TREE_CODE (init) != COND_EXPR
329 && TREE_CODE (init) != CONSTRUCTOR
330 && TREE_CODE (init) != VA_ARG_EXPR)
331 /* We need to build up a copy constructor call. COND_EXPR is a special
332 case because we already have copies on the arms and we don't want
333 another one here. A CONSTRUCTOR is aggregate initialization, which
334 is handled separately. A VA_ARG_EXPR is magic creation of an
335 aggregate; there's no additional work to be done. */
336 return force_rvalue (init);
338 slot = build_local_temp (type);
339 return build_target_expr (slot, init);
342 /* Like the above function, but without the checking. This function should
343 only be used by code which is deliberately trying to subvert the type
344 system, such as call_builtin_trap. */
347 force_target_expr (tree type, tree init)
349 tree slot = build_local_temp (type);
350 return build_target_expr (slot, init);
353 /* Like build_target_expr_with_type, but use the type of INIT. */
356 get_target_expr (tree init)
358 return build_target_expr_with_type (init, TREE_TYPE (init));
363 build_cplus_array_type_1 (tree elt_type, tree index_type)
367 if (elt_type == error_mark_node || index_type == error_mark_node)
368 return error_mark_node;
370 if (dependent_type_p (elt_type)
372 && value_dependent_expression_p (TYPE_MAX_VALUE (index_type))))
374 t = make_node (ARRAY_TYPE);
375 TREE_TYPE (t) = elt_type;
376 TYPE_DOMAIN (t) = index_type;
379 t = build_array_type (elt_type, index_type);
381 /* Push these needs up so that initialization takes place
383 TYPE_NEEDS_CONSTRUCTING (t)
384 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (elt_type));
385 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
386 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (elt_type));
391 build_cplus_array_type (tree elt_type, tree index_type)
394 int type_quals = cp_type_quals (elt_type);
396 if (type_quals != TYPE_UNQUALIFIED)
397 elt_type = cp_build_qualified_type (elt_type, TYPE_UNQUALIFIED);
399 t = build_cplus_array_type_1 (elt_type, index_type);
401 if (type_quals != TYPE_UNQUALIFIED)
402 t = cp_build_qualified_type (t, type_quals);
407 /* Make a variant of TYPE, qualified with the TYPE_QUALS. Handles
408 arrays correctly. In particular, if TYPE is an array of T's, and
409 TYPE_QUALS is non-empty, returns an array of qualified T's.
411 FLAGS determines how to deal with illformed qualifications. If
412 tf_ignore_bad_quals is set, then bad qualifications are dropped
413 (this is permitted if TYPE was introduced via a typedef or template
414 type parameter). If bad qualifications are dropped and tf_warning
415 is set, then a warning is issued for non-const qualifications. If
416 tf_ignore_bad_quals is not set and tf_error is not set, we
417 return error_mark_node. Otherwise, we issue an error, and ignore
420 Qualification of a reference type is valid when the reference came
421 via a typedef or template type argument. [dcl.ref] No such
422 dispensation is provided for qualifying a function type. [dcl.fct]
423 DR 295 queries this and the proposed resolution brings it into line
424 with qualifying a reference. We implement the DR. We also behave
425 in a similar manner for restricting non-pointer types. */
428 cp_build_qualified_type_real (tree type,
430 tsubst_flags_t complain)
433 int bad_quals = TYPE_UNQUALIFIED;
434 /* We keep bad function qualifiers separate, so that we can decide
435 whether to implement DR 295 or not. DR 295 break existing code,
436 unfortunately. Remove this variable to implement the defect
438 int bad_func_quals = TYPE_UNQUALIFIED;
440 if (type == error_mark_node)
443 if (type_quals == cp_type_quals (type))
446 if (TREE_CODE (type) == ARRAY_TYPE)
448 /* In C++, the qualification really applies to the array element
449 type. Obtain the appropriately qualified element type. */
452 = cp_build_qualified_type_real (TREE_TYPE (type),
456 if (element_type == error_mark_node)
457 return error_mark_node;
459 /* See if we already have an identically qualified type. */
460 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
461 if (cp_type_quals (t) == type_quals
462 && TYPE_NAME (t) == TYPE_NAME (type)
463 && TYPE_CONTEXT (t) == TYPE_CONTEXT (type))
468 /* Make a new array type, just like the old one, but with the
469 appropriately qualified element type. */
470 t = build_type_copy (type);
471 TREE_TYPE (t) = element_type;
474 /* Even if we already had this variant, we update
475 TYPE_NEEDS_CONSTRUCTING and TYPE_HAS_NONTRIVIAL_DESTRUCTOR in case
476 they changed since the variant was originally created.
478 This seems hokey; if there is some way to use a previous
479 variant *without* coming through here,
480 TYPE_NEEDS_CONSTRUCTING will never be updated. */
481 TYPE_NEEDS_CONSTRUCTING (t)
482 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (element_type));
483 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
484 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (element_type));
487 else if (TYPE_PTRMEMFUNC_P (type))
489 /* For a pointer-to-member type, we can't just return a
490 cv-qualified version of the RECORD_TYPE. If we do, we
491 haven't changed the field that contains the actual pointer to
492 a method, and so TYPE_PTRMEMFUNC_FN_TYPE will be wrong. */
495 t = TYPE_PTRMEMFUNC_FN_TYPE (type);
496 t = cp_build_qualified_type_real (t, type_quals, complain);
497 return build_ptrmemfunc_type (t);
500 /* A reference, function or method type shall not be cv qualified.
501 [dcl.ref], [dct.fct] */
502 if (type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE)
503 && (TREE_CODE (type) == REFERENCE_TYPE
504 || TREE_CODE (type) == FUNCTION_TYPE
505 || TREE_CODE (type) == METHOD_TYPE))
507 bad_quals |= type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
508 if (TREE_CODE (type) != REFERENCE_TYPE)
509 bad_func_quals |= type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
510 type_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
513 /* A restrict-qualified type must be a pointer (or reference)
514 to object or incomplete type. */
515 if ((type_quals & TYPE_QUAL_RESTRICT)
516 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
517 && TREE_CODE (type) != TYPENAME_TYPE
518 && !POINTER_TYPE_P (type))
520 bad_quals |= TYPE_QUAL_RESTRICT;
521 type_quals &= ~TYPE_QUAL_RESTRICT;
524 if (bad_quals == TYPE_UNQUALIFIED)
526 else if (!(complain & (tf_error | tf_ignore_bad_quals)))
527 return error_mark_node;
528 else if (bad_func_quals && !(complain & tf_error))
529 return error_mark_node;
532 if (complain & tf_ignore_bad_quals)
533 /* We're not going to warn about constifying things that can't
535 bad_quals &= ~TYPE_QUAL_CONST;
536 bad_quals |= bad_func_quals;
539 tree bad_type = build_qualified_type (ptr_type_node, bad_quals);
541 if (!(complain & tf_ignore_bad_quals)
543 error ("`%V' qualifiers cannot be applied to `%T'",
548 /* Retrieve (or create) the appropriately qualified variant. */
549 result = build_qualified_type (type, type_quals);
551 /* If this was a pointer-to-method type, and we just made a copy,
552 then we need to unshare the record that holds the cached
553 pointer-to-member-function type, because these will be distinct
554 between the unqualified and qualified types. */
556 && TREE_CODE (type) == POINTER_TYPE
557 && TREE_CODE (TREE_TYPE (type)) == METHOD_TYPE)
558 TYPE_LANG_SPECIFIC (result) = NULL;
563 /* Returns the canonical version of TYPE. In other words, if TYPE is
564 a typedef, returns the underlying type. The cv-qualification of
565 the type returned matches the type input; they will always be
569 canonical_type_variant (tree t)
571 return cp_build_qualified_type (TYPE_MAIN_VARIANT (t), cp_type_quals (t));
574 /* Makes new binfos for the indirect bases under BINFO. T is the most
575 derived TYPE. PREV is the previous binfo, whose TREE_CHAIN we make
576 point to this binfo. We return the last BINFO created.
578 The CLASSTYPE_VBASECLASSES list of T is constructed in reverse
579 order (pre-order, depth-first, right-to-left). You must nreverse it.
581 The BINFO_INHERITANCE of a virtual base class points to the binfo
582 og the most derived type.
584 The binfo's TREE_CHAIN is set to inheritance graph order, but bases
585 for non-class types are not included (i.e. those which are
586 dependent bases in non-instantiated templates). */
589 copy_base_binfos (tree binfo, tree t, tree prev)
591 tree binfos = BINFO_BASETYPES (binfo);
595 TREE_CHAIN (prev) = binfo;
598 if (binfos == NULL_TREE)
601 n = TREE_VEC_LENGTH (binfos);
603 /* Now copy the structure beneath BINFO. */
604 for (ix = 0; ix != n; ix++)
606 tree base_binfo = TREE_VEC_ELT (binfos, ix);
607 tree new_binfo = NULL_TREE;
609 if (!CLASS_TYPE_P (BINFO_TYPE (base_binfo)))
611 my_friendly_assert (binfo == TYPE_BINFO (t), 20030204);
613 new_binfo = base_binfo;
614 TREE_CHAIN (prev) = new_binfo;
616 BINFO_INHERITANCE_CHAIN (new_binfo) = binfo;
617 BINFO_DEPENDENT_BASE_P (new_binfo) = 1;
619 else if (TREE_VIA_VIRTUAL (base_binfo))
621 new_binfo = purpose_member (BINFO_TYPE (base_binfo),
622 CLASSTYPE_VBASECLASSES (t));
624 new_binfo = TREE_VALUE (new_binfo);
629 new_binfo = make_binfo (BINFO_OFFSET (base_binfo),
630 base_binfo, NULL_TREE,
631 BINFO_VIRTUALS (base_binfo));
632 prev = copy_base_binfos (new_binfo, t, prev);
633 if (TREE_VIA_VIRTUAL (base_binfo))
635 CLASSTYPE_VBASECLASSES (t)
636 = tree_cons (BINFO_TYPE (new_binfo), new_binfo,
637 CLASSTYPE_VBASECLASSES (t));
638 TREE_VIA_VIRTUAL (new_binfo) = 1;
639 BINFO_INHERITANCE_CHAIN (new_binfo) = TYPE_BINFO (t);
642 BINFO_INHERITANCE_CHAIN (new_binfo) = binfo;
644 TREE_VEC_ELT (binfos, ix) = new_binfo;
651 /* Hashing of lists so that we don't make duplicates.
652 The entry point is `list_hash_canon'. */
654 /* Now here is the hash table. When recording a list, it is added
655 to the slot whose index is the hash code mod the table size.
656 Note that the hash table is used for several kinds of lists.
657 While all these live in the same table, they are completely independent,
658 and the hash code is computed differently for each of these. */
660 static GTY ((param_is (union tree_node))) htab_t list_hash_table;
669 /* Compare ENTRY (an entry in the hash table) with DATA (a list_proxy
670 for a node we are thinking about adding). */
673 list_hash_eq (const void* entry, const void* data)
675 tree t = (tree) entry;
676 struct list_proxy *proxy = (struct list_proxy *) data;
678 return (TREE_VALUE (t) == proxy->value
679 && TREE_PURPOSE (t) == proxy->purpose
680 && TREE_CHAIN (t) == proxy->chain);
683 /* Compute a hash code for a list (chain of TREE_LIST nodes
684 with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the
685 TREE_COMMON slots), by adding the hash codes of the individual entries. */
688 list_hash_pieces (tree purpose, tree value, tree chain)
690 hashval_t hashcode = 0;
693 hashcode += TYPE_HASH (chain);
696 hashcode += TYPE_HASH (value);
700 hashcode += TYPE_HASH (purpose);
706 /* Hash an already existing TREE_LIST. */
709 list_hash (const void* p)
712 return list_hash_pieces (TREE_PURPOSE (t),
717 /* Given list components PURPOSE, VALUE, AND CHAIN, return the canonical
718 object for an identical list if one already exists. Otherwise, build a
719 new one, and record it as the canonical object. */
722 hash_tree_cons (tree purpose, tree value, tree chain)
726 struct list_proxy proxy;
728 /* Hash the list node. */
729 hashcode = list_hash_pieces (purpose, value, chain);
730 /* Create a proxy for the TREE_LIST we would like to create. We
731 don't actually create it so as to avoid creating garbage. */
732 proxy.purpose = purpose;
735 /* See if it is already in the table. */
736 slot = htab_find_slot_with_hash (list_hash_table, &proxy, hashcode,
738 /* If not, create a new node. */
740 *slot = tree_cons (purpose, value, chain);
744 /* Constructor for hashed lists. */
747 hash_tree_chain (tree value, tree chain)
749 return hash_tree_cons (NULL_TREE, value, chain);
752 /* Similar, but used for concatenating two lists. */
755 hash_chainon (tree list1, tree list2)
761 if (TREE_CHAIN (list1) == NULL_TREE)
762 return hash_tree_chain (TREE_VALUE (list1), list2);
763 return hash_tree_chain (TREE_VALUE (list1),
764 hash_chainon (TREE_CHAIN (list1), list2));
767 /* Build an association between TYPE and some parameters:
769 OFFSET is the offset added to `this' to convert it to a pointer
772 BINFO is the base binfo to use, if we are deriving from one. This
773 is necessary, as we want specialized parent binfos from base
774 classes, so that the VTABLE_NAMEs of bases are for the most derived
775 type, instead of the simple type.
777 VTABLE is the virtual function table with which to initialize
778 sub-objects of type TYPE.
780 VIRTUALS are the virtual functions sitting in VTABLE. */
783 make_binfo (tree offset, tree binfo, tree vtable, tree virtuals)
785 tree new_binfo = make_tree_vec (BINFO_LANG_ELTS);
788 if (TREE_CODE (binfo) == TREE_VEC)
790 type = BINFO_TYPE (binfo);
791 BINFO_DEPENDENT_BASE_P (new_binfo) = BINFO_DEPENDENT_BASE_P (binfo);
797 BINFO_DEPENDENT_BASE_P (new_binfo) = 1;
800 TREE_TYPE (new_binfo) = TYPE_MAIN_VARIANT (type);
801 BINFO_OFFSET (new_binfo) = offset;
802 BINFO_VTABLE (new_binfo) = vtable;
803 BINFO_VIRTUALS (new_binfo) = virtuals;
805 if (binfo && !BINFO_DEPENDENT_BASE_P (binfo)
806 && BINFO_BASETYPES (binfo) != NULL_TREE)
808 BINFO_BASETYPES (new_binfo) = copy_node (BINFO_BASETYPES (binfo));
809 /* We do not need to copy the accesses, as they are read only. */
810 BINFO_BASEACCESSES (new_binfo) = BINFO_BASEACCESSES (binfo);
816 debug_binfo (tree elem)
821 fprintf (stderr, "type \"%s\", offset = " HOST_WIDE_INT_PRINT_DEC
823 TYPE_NAME_STRING (BINFO_TYPE (elem)),
824 TREE_INT_CST_LOW (BINFO_OFFSET (elem)));
825 debug_tree (BINFO_TYPE (elem));
826 if (BINFO_VTABLE (elem))
827 fprintf (stderr, "vtable decl \"%s\"\n",
828 IDENTIFIER_POINTER (DECL_NAME (get_vtbl_decl_for_binfo (elem))));
830 fprintf (stderr, "no vtable decl yet\n");
831 fprintf (stderr, "virtuals:\n");
832 virtuals = BINFO_VIRTUALS (elem);
837 tree fndecl = TREE_VALUE (virtuals);
838 fprintf (stderr, "%s [%ld =? %ld]\n",
839 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl)),
840 (long) n, (long) TREE_INT_CST_LOW (DECL_VINDEX (fndecl)));
842 virtuals = TREE_CHAIN (virtuals);
847 count_functions (tree t)
850 if (TREE_CODE (t) == FUNCTION_DECL)
852 else if (TREE_CODE (t) == OVERLOAD)
854 for (i = 0; t; t = OVL_CHAIN (t))
864 is_overloaded_fn (tree x)
866 /* A baselink is also considered an overloaded function. */
867 if (TREE_CODE (x) == OFFSET_REF)
868 x = TREE_OPERAND (x, 1);
870 x = BASELINK_FUNCTIONS (x);
871 return (TREE_CODE (x) == FUNCTION_DECL
872 || TREE_CODE (x) == TEMPLATE_ID_EXPR
873 || DECL_FUNCTION_TEMPLATE_P (x)
874 || TREE_CODE (x) == OVERLOAD);
878 really_overloaded_fn (tree x)
880 /* A baselink is also considered an overloaded function. */
881 if (TREE_CODE (x) == OFFSET_REF)
882 x = TREE_OPERAND (x, 1);
884 x = BASELINK_FUNCTIONS (x);
886 return ((TREE_CODE (x) == OVERLOAD && OVL_CHAIN (x))
887 || DECL_FUNCTION_TEMPLATE_P (OVL_CURRENT (x))
888 || TREE_CODE (x) == TEMPLATE_ID_EXPR);
892 get_first_fn (tree from)
894 my_friendly_assert (is_overloaded_fn (from), 9);
895 /* A baselink is also considered an overloaded function. */
896 if (BASELINK_P (from))
897 from = BASELINK_FUNCTIONS (from);
898 return OVL_CURRENT (from);
901 /* Returns nonzero if T is a ->* or .* expression that refers to a
907 return (TREE_CODE (t) == OFFSET_REF
908 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (t, 1))));
911 /* Return a new OVL node, concatenating it with the old one. */
914 ovl_cons (tree decl, tree chain)
916 tree result = make_node (OVERLOAD);
917 TREE_TYPE (result) = unknown_type_node;
918 OVL_FUNCTION (result) = decl;
919 TREE_CHAIN (result) = chain;
924 /* Build a new overloaded function. If this is the first one,
925 just return it; otherwise, ovl_cons the _DECLs */
928 build_overload (tree decl, tree chain)
930 if (! chain && TREE_CODE (decl) != TEMPLATE_DECL)
932 if (chain && TREE_CODE (chain) != OVERLOAD)
933 chain = ovl_cons (chain, NULL_TREE);
934 return ovl_cons (decl, chain);
938 #define PRINT_RING_SIZE 4
941 cxx_printable_name (tree decl, int v)
943 static tree decl_ring[PRINT_RING_SIZE];
944 static char *print_ring[PRINT_RING_SIZE];
945 static int ring_counter;
948 /* Only cache functions. */
950 || TREE_CODE (decl) != FUNCTION_DECL
951 || DECL_LANG_SPECIFIC (decl) == 0)
952 return lang_decl_name (decl, v);
954 /* See if this print name is lying around. */
955 for (i = 0; i < PRINT_RING_SIZE; i++)
956 if (decl_ring[i] == decl)
957 /* yes, so return it. */
958 return print_ring[i];
960 if (++ring_counter == PRINT_RING_SIZE)
963 if (current_function_decl != NULL_TREE)
965 if (decl_ring[ring_counter] == current_function_decl)
967 if (ring_counter == PRINT_RING_SIZE)
969 if (decl_ring[ring_counter] == current_function_decl)
973 if (print_ring[ring_counter])
974 free (print_ring[ring_counter]);
976 print_ring[ring_counter] = xstrdup (lang_decl_name (decl, v));
977 decl_ring[ring_counter] = decl;
978 return print_ring[ring_counter];
981 /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions
985 build_exception_variant (tree type, tree raises)
987 tree v = TYPE_MAIN_VARIANT (type);
988 int type_quals = TYPE_QUALS (type);
990 for (; v; v = TYPE_NEXT_VARIANT (v))
991 if (TYPE_QUALS (v) == type_quals
992 && comp_except_specs (raises, TYPE_RAISES_EXCEPTIONS (v), 1)
993 && (*targetm.comp_type_attributes) (type, v))
996 /* Need to build a new variant. */
997 v = build_type_copy (type);
998 TYPE_RAISES_EXCEPTIONS (v) = raises;
1002 /* Given a TEMPLATE_TEMPLATE_PARM node T, create a new
1003 BOUND_TEMPLATE_TEMPLATE_PARM bound with NEWARGS as its template
1007 bind_template_template_parm (tree t, tree newargs)
1009 tree decl = TYPE_NAME (t);
1012 t2 = make_aggr_type (BOUND_TEMPLATE_TEMPLATE_PARM);
1013 decl = build_decl (TYPE_DECL, DECL_NAME (decl), NULL_TREE);
1015 /* These nodes have to be created to reflect new TYPE_DECL and template
1017 TEMPLATE_TYPE_PARM_INDEX (t2) = copy_node (TEMPLATE_TYPE_PARM_INDEX (t));
1018 TEMPLATE_PARM_DECL (TEMPLATE_TYPE_PARM_INDEX (t2)) = decl;
1019 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2)
1020 = tree_cons (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t),
1021 newargs, NULL_TREE);
1023 TREE_TYPE (decl) = t2;
1024 TYPE_NAME (t2) = decl;
1025 TYPE_STUB_DECL (t2) = decl;
1031 /* Called from count_trees via walk_tree. */
1034 count_trees_r (tree* tp ATTRIBUTE_UNUSED ,
1035 int* walk_subtrees ATTRIBUTE_UNUSED ,
1042 /* Debugging function for measuring the rough complexity of a tree
1046 count_trees (tree t)
1049 walk_tree_without_duplicates (&t, count_trees_r, &n_trees);
1053 /* Called from verify_stmt_tree via walk_tree. */
1056 verify_stmt_tree_r (tree* tp,
1057 int* walk_subtrees ATTRIBUTE_UNUSED ,
1061 htab_t *statements = (htab_t *) data;
1064 if (!STATEMENT_CODE_P (TREE_CODE (t)))
1067 /* If this statement is already present in the hash table, then
1068 there is a circularity in the statement tree. */
1069 if (htab_find (*statements, t))
1072 slot = htab_find_slot (*statements, t, INSERT);
1078 /* Debugging function to check that the statement T has not been
1079 corrupted. For now, this function simply checks that T contains no
1083 verify_stmt_tree (tree t)
1086 statements = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
1087 walk_tree (&t, verify_stmt_tree_r, &statements, NULL);
1088 htab_delete (statements);
1091 /* Called from find_tree via walk_tree. */
1094 find_tree_r (tree* tp,
1095 int* walk_subtrees ATTRIBUTE_UNUSED ,
1098 if (*tp == (tree) data)
1104 /* Returns X if X appears in the tree structure rooted at T. */
1107 find_tree (tree t, tree x)
1109 return walk_tree_without_duplicates (&t, find_tree_r, x);
1112 /* Passed to walk_tree. Checks for the use of types with no linkage. */
1115 no_linkage_helper (tree* tp,
1116 int* walk_subtrees ATTRIBUTE_UNUSED ,
1117 void* data ATTRIBUTE_UNUSED )
1122 && (CLASS_TYPE_P (t) || TREE_CODE (t) == ENUMERAL_TYPE)
1123 && (decl_function_context (TYPE_MAIN_DECL (t))
1124 || TYPE_ANONYMOUS_P (t)))
1129 /* Check if the type T depends on a type with no linkage and if so, return
1133 no_linkage_check (tree t)
1135 /* There's no point in checking linkage on template functions; we
1136 can't know their complete types. */
1137 if (processing_template_decl)
1140 t = walk_tree_without_duplicates (&t, no_linkage_helper, NULL);
1141 if (t != error_mark_node)
1146 #ifdef GATHER_STATISTICS
1147 extern int depth_reached;
1151 cxx_print_statistics (void)
1153 print_search_statistics ();
1154 print_class_statistics ();
1155 #ifdef GATHER_STATISTICS
1156 fprintf (stderr, "maximum template instantiation depth reached: %d\n",
1161 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1162 (which is an ARRAY_TYPE). This counts only elements of the top
1166 array_type_nelts_top (tree type)
1168 return fold (build (PLUS_EXPR, sizetype,
1169 array_type_nelts (type),
1173 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1174 (which is an ARRAY_TYPE). This one is a recursive count of all
1175 ARRAY_TYPEs that are clumped together. */
1178 array_type_nelts_total (tree type)
1180 tree sz = array_type_nelts_top (type);
1181 type = TREE_TYPE (type);
1182 while (TREE_CODE (type) == ARRAY_TYPE)
1184 tree n = array_type_nelts_top (type);
1185 sz = fold (build (MULT_EXPR, sizetype, sz, n));
1186 type = TREE_TYPE (type);
1191 /* Called from break_out_target_exprs via mapcar. */
1194 bot_manip (tree* tp, int* walk_subtrees, void* data)
1196 splay_tree target_remap = ((splay_tree) data);
1199 if (TREE_CONSTANT (t))
1201 /* There can't be any TARGET_EXPRs or their slot variables below
1202 this point. We used to check !TREE_SIDE_EFFECTS, but then we
1203 failed to copy an ADDR_EXPR of the slot VAR_DECL. */
1207 if (TREE_CODE (t) == TARGET_EXPR)
1211 if (TREE_CODE (TREE_OPERAND (t, 1)) == AGGR_INIT_EXPR)
1213 mark_used (TREE_OPERAND (TREE_OPERAND (TREE_OPERAND (t, 1), 0), 0));
1215 (TREE_TYPE (t), break_out_target_exprs (TREE_OPERAND (t, 1)));
1219 u = build_target_expr_with_type
1220 (break_out_target_exprs (TREE_OPERAND (t, 1)), TREE_TYPE (t));
1223 /* Map the old variable to the new one. */
1224 splay_tree_insert (target_remap,
1225 (splay_tree_key) TREE_OPERAND (t, 0),
1226 (splay_tree_value) TREE_OPERAND (u, 0));
1228 /* Replace the old expression with the new version. */
1230 /* We don't have to go below this point; the recursive call to
1231 break_out_target_exprs will have handled anything below this
1236 else if (TREE_CODE (t) == CALL_EXPR)
1237 mark_used (TREE_OPERAND (TREE_OPERAND (t, 0), 0));
1239 /* Make a copy of this node. */
1240 return copy_tree_r (tp, walk_subtrees, NULL);
1243 /* Replace all remapped VAR_DECLs in T with their new equivalents.
1244 DATA is really a splay-tree mapping old variables to new
1248 bot_replace (tree* t,
1249 int* walk_subtrees ATTRIBUTE_UNUSED ,
1252 splay_tree target_remap = ((splay_tree) data);
1254 if (TREE_CODE (*t) == VAR_DECL)
1256 splay_tree_node n = splay_tree_lookup (target_remap,
1257 (splay_tree_key) *t);
1259 *t = (tree) n->value;
1265 /* When we parse a default argument expression, we may create
1266 temporary variables via TARGET_EXPRs. When we actually use the
1267 default-argument expression, we make a copy of the expression, but
1268 we must replace the temporaries with appropriate local versions. */
1271 break_out_target_exprs (tree t)
1273 static int target_remap_count;
1274 static splay_tree target_remap;
1276 if (!target_remap_count++)
1277 target_remap = splay_tree_new (splay_tree_compare_pointers,
1278 /*splay_tree_delete_key_fn=*/NULL,
1279 /*splay_tree_delete_value_fn=*/NULL);
1280 walk_tree (&t, bot_manip, target_remap, NULL);
1281 walk_tree (&t, bot_replace, target_remap, NULL);
1283 if (!--target_remap_count)
1285 splay_tree_delete (target_remap);
1286 target_remap = NULL;
1292 /* Similar to `build_nt', but for template definitions of dependent
1296 build_min_nt (enum tree_code code, ...)
1305 t = make_node (code);
1306 length = TREE_CODE_LENGTH (code);
1307 TREE_COMPLEXITY (t) = input_line;
1309 for (i = 0; i < length; i++)
1311 tree x = va_arg (p, tree);
1312 TREE_OPERAND (t, i) = x;
1319 /* Similar to `build', but for template definitions. */
1322 build_min (enum tree_code code, tree tt, ...)
1331 t = make_node (code);
1332 length = TREE_CODE_LENGTH (code);
1334 TREE_COMPLEXITY (t) = input_line;
1336 for (i = 0; i < length; i++)
1338 tree x = va_arg (p, tree);
1339 TREE_OPERAND (t, i) = x;
1340 if (x && TREE_SIDE_EFFECTS (x))
1341 TREE_SIDE_EFFECTS (t) = 1;
1348 /* Similar to `build', but for template definitions of non-dependent
1349 expressions. NON_DEP is the non-dependent expression that has been
1353 build_min_non_dep (enum tree_code code, tree non_dep, ...)
1360 va_start (p, non_dep);
1362 t = make_node (code);
1363 length = TREE_CODE_LENGTH (code);
1364 TREE_TYPE (t) = TREE_TYPE (non_dep);
1365 TREE_COMPLEXITY (t) = input_line;
1366 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (non_dep);
1368 for (i = 0; i < length; i++)
1370 tree x = va_arg (p, tree);
1371 TREE_OPERAND (t, i) = x;
1374 if (code == COMPOUND_EXPR && TREE_CODE (non_dep) != COMPOUND_EXPR)
1375 /* This should not be considered a COMPOUND_EXPR, because it
1376 resolves to an overload. */
1377 COMPOUND_EXPR_OVERLOADED (t) = 1;
1383 /* Returns an INTEGER_CST (of type `int') corresponding to I.
1384 Multiple calls with the same value of I may or may not yield the
1385 same node; therefore, callers should never modify the node
1388 static GTY(()) tree shared_int_cache[256];
1391 build_shared_int_cst (int i)
1394 return build_int_2 (i, 0);
1396 if (!shared_int_cache[i])
1397 shared_int_cache[i] = build_int_2 (i, 0);
1399 return shared_int_cache[i];
1403 get_type_decl (tree t)
1405 if (TREE_CODE (t) == TYPE_DECL)
1408 return TYPE_STUB_DECL (t);
1409 if (t == error_mark_node)
1414 /* Stop compiler from complaining control reaches end of non-void function. */
1418 /* Return first vector element whose BINFO_TYPE is ELEM.
1419 Return 0 if ELEM is not in VEC. VEC may be NULL_TREE. */
1422 vec_binfo_member (tree elem, tree vec)
1427 for (i = 0; i < TREE_VEC_LENGTH (vec); ++i)
1428 if (same_type_p (elem, BINFO_TYPE (TREE_VEC_ELT (vec, i))))
1429 return TREE_VEC_ELT (vec, i);
1434 /* Returns the namespace that contains DECL, whether directly or
1438 decl_namespace_context (tree decl)
1442 if (TREE_CODE (decl) == NAMESPACE_DECL)
1444 else if (TYPE_P (decl))
1445 decl = CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl));
1447 decl = CP_DECL_CONTEXT (decl);
1451 /* Return truthvalue of whether T1 is the same tree structure as T2.
1452 Return 1 if they are the same. Return 0 if they are different. */
1455 cp_tree_equal (tree t1, tree t2)
1457 enum tree_code code1, code2;
1464 for (code1 = TREE_CODE (t1);
1465 code1 == NOP_EXPR || code1 == CONVERT_EXPR
1466 || code1 == NON_LVALUE_EXPR;
1467 code1 = TREE_CODE (t1))
1468 t1 = TREE_OPERAND (t1, 0);
1469 for (code2 = TREE_CODE (t2);
1470 code2 == NOP_EXPR || code2 == CONVERT_EXPR
1471 || code1 == NON_LVALUE_EXPR;
1472 code2 = TREE_CODE (t2))
1473 t2 = TREE_OPERAND (t2, 0);
1475 /* They might have become equal now. */
1485 return TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
1486 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2);
1489 return REAL_VALUES_EQUAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
1492 return TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
1493 && !memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
1494 TREE_STRING_LENGTH (t1));
1497 /* We need to do this when determining whether or not two
1498 non-type pointer to member function template arguments
1500 if (!(same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
1501 /* The first operand is RTL. */
1502 && TREE_OPERAND (t1, 0) == TREE_OPERAND (t2, 0)))
1504 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1507 if (!cp_tree_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2)))
1509 if (!cp_tree_equal (TREE_VALUE (t1), TREE_VALUE (t2)))
1511 return cp_tree_equal (TREE_CHAIN (t1), TREE_CHAIN (t2));
1514 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1517 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1519 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1523 tree o1 = TREE_OPERAND (t1, 0);
1524 tree o2 = TREE_OPERAND (t2, 0);
1526 /* Special case: if either target is an unallocated VAR_DECL,
1527 it means that it's going to be unified with whatever the
1528 TARGET_EXPR is really supposed to initialize, so treat it
1529 as being equivalent to anything. */
1530 if (TREE_CODE (o1) == VAR_DECL && DECL_NAME (o1) == NULL_TREE
1531 && !DECL_RTL_SET_P (o1))
1533 else if (TREE_CODE (o2) == VAR_DECL && DECL_NAME (o2) == NULL_TREE
1534 && !DECL_RTL_SET_P (o2))
1536 else if (!cp_tree_equal (o1, o2))
1539 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1542 case WITH_CLEANUP_EXPR:
1543 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1545 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
1548 if (TREE_OPERAND (t1, 1) != TREE_OPERAND (t2, 1))
1550 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1557 case IDENTIFIER_NODE:
1560 case TEMPLATE_PARM_INDEX:
1561 return (TEMPLATE_PARM_IDX (t1) == TEMPLATE_PARM_IDX (t2)
1562 && TEMPLATE_PARM_LEVEL (t1) == TEMPLATE_PARM_LEVEL (t2)
1563 && same_type_p (TREE_TYPE (TEMPLATE_PARM_DECL (t1)),
1564 TREE_TYPE (TEMPLATE_PARM_DECL (t2))));
1566 case TEMPLATE_ID_EXPR:
1571 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1573 vec1 = TREE_OPERAND (t1, 1);
1574 vec2 = TREE_OPERAND (t2, 1);
1577 return !vec1 && !vec2;
1579 if (TREE_VEC_LENGTH (vec1) != TREE_VEC_LENGTH (vec2))
1582 for (ix = TREE_VEC_LENGTH (vec1); ix--;)
1583 if (!cp_tree_equal (TREE_VEC_ELT (vec1, ix),
1584 TREE_VEC_ELT (vec2, ix)))
1593 tree o1 = TREE_OPERAND (t1, 0);
1594 tree o2 = TREE_OPERAND (t2, 0);
1596 if (TREE_CODE (o1) != TREE_CODE (o2))
1599 return same_type_p (o1, o2);
1601 return cp_tree_equal (o1, o2);
1605 /* Two pointer-to-members are the same if they point to the same
1606 field or function in the same class. */
1607 if (PTRMEM_CST_MEMBER (t1) != PTRMEM_CST_MEMBER (t2))
1610 return same_type_p (PTRMEM_CST_CLASS (t1), PTRMEM_CST_CLASS (t2));
1616 switch (TREE_CODE_CLASS (code1))
1627 for (i = 0; i < TREE_CODE_LENGTH (code1); ++i)
1628 if (!cp_tree_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i)))
1635 return same_type_p (t1, t2);
1638 my_friendly_assert (0, 20030617);
1642 /* Build a wrapper around a 'struct z_candidate' so we can use it as a
1646 build_zc_wrapper (struct z_candidate* ptr)
1648 tree t = make_node (WRAPPER);
1649 WRAPPER_ZC (t) = ptr;
1653 /* The type of ARG when used as an lvalue. */
1656 lvalue_type (tree arg)
1658 tree type = TREE_TYPE (arg);
1662 /* The type of ARG for printing error messages; denote lvalues with
1666 error_type (tree arg)
1668 tree type = TREE_TYPE (arg);
1670 if (TREE_CODE (type) == ARRAY_TYPE)
1672 else if (TREE_CODE (type) == ERROR_MARK)
1674 else if (real_lvalue_p (arg))
1675 type = build_reference_type (lvalue_type (arg));
1676 else if (IS_AGGR_TYPE (type))
1677 type = lvalue_type (arg);
1682 /* Does FUNCTION use a variable-length argument list? */
1685 varargs_function_p (tree function)
1687 tree parm = TYPE_ARG_TYPES (TREE_TYPE (function));
1688 for (; parm; parm = TREE_CHAIN (parm))
1689 if (TREE_VALUE (parm) == void_type_node)
1694 /* Returns 1 if decl is a member of a class. */
1697 member_p (tree decl)
1699 const tree ctx = DECL_CONTEXT (decl);
1700 return (ctx && TYPE_P (ctx));
1703 /* Create a placeholder for member access where we don't actually have an
1704 object that the access is against. */
1707 build_dummy_object (tree type)
1709 tree decl = build1 (NOP_EXPR, build_pointer_type (type), void_zero_node);
1710 return build_indirect_ref (decl, NULL);
1713 /* We've gotten a reference to a member of TYPE. Return *this if appropriate,
1714 or a dummy object otherwise. If BINFOP is non-0, it is filled with the
1715 binfo path from current_class_type to TYPE, or 0. */
1718 maybe_dummy_object (tree type, tree* binfop)
1723 if (current_class_type
1724 && (binfo = lookup_base (current_class_type, type,
1725 ba_ignore | ba_quiet, NULL)))
1726 context = current_class_type;
1729 /* Reference from a nested class member function. */
1731 binfo = TYPE_BINFO (type);
1737 if (current_class_ref && context == current_class_type
1738 /* Kludge: Make sure that current_class_type is actually
1739 correct. It might not be if we're in the middle of
1740 tsubst_default_argument. */
1741 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref)),
1742 current_class_type))
1743 decl = current_class_ref;
1745 decl = build_dummy_object (context);
1750 /* Returns 1 if OB is a placeholder object, or a pointer to one. */
1753 is_dummy_object (tree ob)
1755 if (TREE_CODE (ob) == INDIRECT_REF)
1756 ob = TREE_OPERAND (ob, 0);
1757 return (TREE_CODE (ob) == NOP_EXPR
1758 && TREE_OPERAND (ob, 0) == void_zero_node);
1761 /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */
1766 t = strip_array_types (t);
1768 if (t == error_mark_node)
1770 if (INTEGRAL_TYPE_P (t))
1771 return 1; /* integral, character or enumeral type */
1772 if (FLOAT_TYPE_P (t))
1775 return 1; /* pointer to non-member */
1776 if (TYPE_PTR_TO_MEMBER_P (t))
1777 return 1; /* pointer to member */
1779 if (! CLASS_TYPE_P (t))
1780 return 0; /* other non-class type (reference or function) */
1781 if (CLASSTYPE_NON_POD_P (t))
1786 /* Returns 1 iff zero initialization of type T means actually storing
1790 zero_init_p (tree t)
1792 t = strip_array_types (t);
1794 if (t == error_mark_node)
1797 /* NULL pointers to data members are initialized with -1. */
1798 if (TYPE_PTRMEM_P (t))
1801 /* Classes that contain types that can't be zero-initialized, cannot
1802 be zero-initialized themselves. */
1803 if (CLASS_TYPE_P (t) && CLASSTYPE_NON_ZERO_INIT_P (t))
1809 /* Table of valid C++ attributes. */
1810 const struct attribute_spec cxx_attribute_table[] =
1812 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
1813 { "java_interface", 0, 0, false, false, false, handle_java_interface_attribute },
1814 { "com_interface", 0, 0, false, false, false, handle_com_interface_attribute },
1815 { "init_priority", 1, 1, true, false, false, handle_init_priority_attribute },
1816 { NULL, 0, 0, false, false, false, NULL }
1819 /* Handle a "java_interface" attribute; arguments as in
1820 struct attribute_spec.handler. */
1822 handle_java_interface_attribute (tree* node,
1824 tree args ATTRIBUTE_UNUSED ,
1829 || !CLASS_TYPE_P (*node)
1830 || !TYPE_FOR_JAVA (*node))
1832 error ("`%s' attribute can only be applied to Java class definitions",
1833 IDENTIFIER_POINTER (name));
1834 *no_add_attrs = true;
1837 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
1838 *node = build_type_copy (*node);
1839 TYPE_JAVA_INTERFACE (*node) = 1;
1844 /* Handle a "com_interface" attribute; arguments as in
1845 struct attribute_spec.handler. */
1847 handle_com_interface_attribute (tree* node,
1849 tree args ATTRIBUTE_UNUSED ,
1850 int flags ATTRIBUTE_UNUSED ,
1855 *no_add_attrs = true;
1858 || !CLASS_TYPE_P (*node)
1859 || *node != TYPE_MAIN_VARIANT (*node))
1861 warning ("`%s' attribute can only be applied to class definitions",
1862 IDENTIFIER_POINTER (name));
1867 warning ("`%s' is obsolete; g++ vtables are now COM-compatible by default",
1868 IDENTIFIER_POINTER (name));
1873 /* Handle an "init_priority" attribute; arguments as in
1874 struct attribute_spec.handler. */
1876 handle_init_priority_attribute (tree* node,
1879 int flags ATTRIBUTE_UNUSED ,
1882 tree initp_expr = TREE_VALUE (args);
1884 tree type = TREE_TYPE (decl);
1887 STRIP_NOPS (initp_expr);
1889 if (!initp_expr || TREE_CODE (initp_expr) != INTEGER_CST)
1891 error ("requested init_priority is not an integer constant");
1892 *no_add_attrs = true;
1896 pri = TREE_INT_CST_LOW (initp_expr);
1898 type = strip_array_types (type);
1900 if (decl == NULL_TREE
1901 || TREE_CODE (decl) != VAR_DECL
1902 || !TREE_STATIC (decl)
1903 || DECL_EXTERNAL (decl)
1904 || (TREE_CODE (type) != RECORD_TYPE
1905 && TREE_CODE (type) != UNION_TYPE)
1906 /* Static objects in functions are initialized the
1907 first time control passes through that
1908 function. This is not precise enough to pin down an
1909 init_priority value, so don't allow it. */
1910 || current_function_decl)
1912 error ("can only use `%s' attribute on file-scope definitions of objects of class type",
1913 IDENTIFIER_POINTER (name));
1914 *no_add_attrs = true;
1918 if (pri > MAX_INIT_PRIORITY || pri <= 0)
1920 error ("requested init_priority is out of range");
1921 *no_add_attrs = true;
1925 /* Check for init_priorities that are reserved for
1926 language and runtime support implementations.*/
1927 if (pri <= MAX_RESERVED_INIT_PRIORITY)
1930 ("requested init_priority is reserved for internal use");
1933 if (SUPPORTS_INIT_PRIORITY)
1935 DECL_INIT_PRIORITY (decl) = pri;
1940 error ("`%s' attribute is not supported on this platform",
1941 IDENTIFIER_POINTER (name));
1942 *no_add_attrs = true;
1947 /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the
1948 thing pointed to by the constant. */
1951 make_ptrmem_cst (tree type, tree member)
1953 tree ptrmem_cst = make_node (PTRMEM_CST);
1954 /* If would seem a great convenience if make_node would set
1955 TREE_CONSTANT for things of class `c', but it does not. */
1956 TREE_CONSTANT (ptrmem_cst) = 1;
1957 TREE_TYPE (ptrmem_cst) = type;
1958 PTRMEM_CST_MEMBER (ptrmem_cst) = member;
1962 /* Build a variant of TYPE that has the indicated ATTRIBUTES. May
1963 return an existing type of an appropriate type already exists. */
1966 cp_build_type_attribute_variant (tree type, tree attributes)
1970 new_type = build_type_attribute_variant (type, attributes);
1971 if (TREE_CODE (new_type) == FUNCTION_TYPE
1972 && (TYPE_RAISES_EXCEPTIONS (new_type)
1973 != TYPE_RAISES_EXCEPTIONS (type)))
1974 new_type = build_exception_variant (new_type,
1975 TYPE_RAISES_EXCEPTIONS (type));
1979 /* Apply FUNC to all language-specific sub-trees of TP in a pre-order
1980 traversal. Called from walk_tree(). */
1983 cp_walk_subtrees (tree* tp,
1984 int* walk_subtrees_p,
1989 enum tree_code code = TREE_CODE (*tp);
1992 #define WALK_SUBTREE(NODE) \
1995 result = walk_tree (&(NODE), func, data, htab); \
2001 /* Not one of the easy cases. We must explicitly go through the
2006 case TEMPLATE_TEMPLATE_PARM:
2007 case BOUND_TEMPLATE_TEMPLATE_PARM:
2008 case UNBOUND_CLASS_TEMPLATE:
2009 case TEMPLATE_PARM_INDEX:
2010 case TEMPLATE_TYPE_PARM:
2014 /* None of these have subtrees other than those already walked
2016 *walk_subtrees_p = 0;
2020 WALK_SUBTREE (TREE_TYPE (*tp));
2021 *walk_subtrees_p = 0;
2025 WALK_SUBTREE (TREE_PURPOSE (*tp));
2029 WALK_SUBTREE (OVL_FUNCTION (*tp));
2030 WALK_SUBTREE (OVL_CHAIN (*tp));
2031 *walk_subtrees_p = 0;
2035 if (TYPE_PTRMEMFUNC_P (*tp))
2036 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (*tp));
2043 /* We didn't find what we were looking for. */
2049 /* Decide whether there are language-specific reasons to not inline a
2050 function as a tree. */
2053 cp_cannot_inline_tree_fn (tree* fnp)
2057 /* We can inline a template instantiation only if it's fully
2059 if (DECL_TEMPLATE_INFO (fn)
2060 && TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (fn)))
2062 /* Don't instantiate functions that are not going to be
2064 if (!DECL_INLINE (DECL_TEMPLATE_RESULT
2065 (template_for_substitution (fn))))
2068 fn = *fnp = instantiate_decl (fn, /*defer_ok=*/0);
2070 if (TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (fn)))
2074 if (flag_really_no_inline
2075 && lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)) == NULL)
2078 /* Don't auto-inline anything that might not be bound within
2079 this unit of translation. */
2080 if (!DECL_DECLARED_INLINE_P (fn) && !(*targetm.binds_local_p) (fn))
2082 DECL_UNINLINABLE (fn) = 1;
2086 if (varargs_function_p (fn))
2088 DECL_UNINLINABLE (fn) = 1;
2092 if (! function_attribute_inlinable_p (fn))
2094 DECL_UNINLINABLE (fn) = 1;
2101 /* Add any pending functions other than the current function (already
2102 handled by the caller), that thus cannot be inlined, to FNS_P, then
2103 return the latest function added to the array, PREV_FN. */
2106 cp_add_pending_fn_decls (void* fns_p, tree prev_fn)
2108 varray_type *fnsp = (varray_type *)fns_p;
2109 struct saved_scope *s;
2111 for (s = scope_chain; s; s = s->prev)
2112 if (s->function_decl && s->function_decl != prev_fn)
2114 VARRAY_PUSH_TREE (*fnsp, s->function_decl);
2115 prev_fn = s->function_decl;
2121 /* Determine whether a tree node is an OVERLOAD node. Used to decide
2122 whether to copy a node or to preserve its chain when inlining a
2126 cp_is_overload_p (tree t)
2128 return TREE_CODE (t) == OVERLOAD;
2131 /* Determine whether VAR is a declaration of an automatic variable in
2135 cp_auto_var_in_fn_p (tree var, tree fn)
2137 return (DECL_P (var) && DECL_CONTEXT (var) == fn
2138 && nonstatic_local_decl_p (var));
2141 /* Tell whether a declaration is needed for the RESULT of a function
2142 FN being inlined into CALLER or if the top node of target_exprs is
2146 cp_copy_res_decl_for_inlining (tree result,
2151 tree return_slot_addr)
2153 splay_tree decl_map = (splay_tree)decl_map_;
2156 /* If FN returns an aggregate then the caller will always pass the
2157 address of the return slot explicitly. If we were just to
2158 create a new VAR_DECL here, then the result of this function
2159 would be copied (bitwise) into the variable initialized by the
2160 TARGET_EXPR. That's incorrect, so we must transform any
2161 references to the RESULT into references to the target. */
2163 /* We should have an explicit return slot iff the return type is
2164 TREE_ADDRESSABLE. See simplify_aggr_init_expr. */
2165 if (TREE_ADDRESSABLE (TREE_TYPE (result))
2166 != (return_slot_addr != NULL_TREE))
2169 *need_decl = !return_slot_addr;
2170 if (return_slot_addr)
2172 var = build_indirect_ref (return_slot_addr, "");
2173 if (! same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (var),
2174 TREE_TYPE (result)))
2177 /* Otherwise, make an appropriate copy. */
2179 var = copy_decl_for_inlining (result, fn, caller);
2181 if (DECL_SAVED_FUNCTION_DATA (fn))
2183 tree nrv = DECL_SAVED_FUNCTION_DATA (fn)->x_return_value;
2186 /* We have a named return value; copy the name and source
2187 position so we can get reasonable debugging information, and
2188 register the return variable as its equivalent. */
2189 if (TREE_CODE (var) == VAR_DECL
2190 /* But not if we're initializing a variable from the
2191 enclosing function which already has its own name. */
2192 && DECL_NAME (var) == NULL_TREE)
2194 DECL_NAME (var) = DECL_NAME (nrv);
2195 DECL_SOURCE_LOCATION (var) = DECL_SOURCE_LOCATION (nrv);
2196 DECL_ABSTRACT_ORIGIN (var) = DECL_ORIGIN (nrv);
2197 /* Don't lose initialization info. */
2198 DECL_INITIAL (var) = DECL_INITIAL (nrv);
2199 /* Don't forget that it needs to go in the stack. */
2200 TREE_ADDRESSABLE (var) = TREE_ADDRESSABLE (nrv);
2203 splay_tree_insert (decl_map,
2204 (splay_tree_key) nrv,
2205 (splay_tree_value) var);
2212 /* Initialize tree.c. */
2217 list_hash_table = htab_create_ggc (31, list_hash, list_hash_eq, NULL);
2220 /* Called via walk_tree. If *TP points to a DECL_STMT for a local
2221 declaration, copies the declaration and enters it in the splay_tree
2222 pointed to by DATA (which is really a `splay_tree *'). */
2225 mark_local_for_remap_r (tree* tp,
2226 int* walk_subtrees ATTRIBUTE_UNUSED ,
2230 splay_tree st = (splay_tree) data;
2234 if (TREE_CODE (t) == DECL_STMT
2235 && nonstatic_local_decl_p (DECL_STMT_DECL (t)))
2236 decl = DECL_STMT_DECL (t);
2237 else if (TREE_CODE (t) == LABEL_STMT)
2238 decl = LABEL_STMT_LABEL (t);
2239 else if (TREE_CODE (t) == TARGET_EXPR
2240 && nonstatic_local_decl_p (TREE_OPERAND (t, 0)))
2241 decl = TREE_OPERAND (t, 0);
2242 else if (TREE_CODE (t) == CASE_LABEL)
2243 decl = CASE_LABEL_DECL (t);
2252 copy = copy_decl_for_inlining (decl,
2253 DECL_CONTEXT (decl),
2254 DECL_CONTEXT (decl));
2256 /* Remember the copy. */
2257 splay_tree_insert (st,
2258 (splay_tree_key) decl,
2259 (splay_tree_value) copy);
2265 /* Called via walk_tree when an expression is unsaved. Using the
2266 splay_tree pointed to by ST (which is really a `splay_tree'),
2267 remaps all local declarations to appropriate replacements. */
2270 cp_unsave_r (tree* tp,
2274 splay_tree st = (splay_tree) data;
2277 /* Only a local declaration (variable or label). */
2278 if (nonstatic_local_decl_p (*tp))
2280 /* Lookup the declaration. */
2281 n = splay_tree_lookup (st, (splay_tree_key) *tp);
2283 /* If it's there, remap it. */
2285 *tp = (tree) n->value;
2287 else if (TREE_CODE (*tp) == SAVE_EXPR)
2288 remap_save_expr (tp, st, current_function_decl, walk_subtrees);
2291 copy_tree_r (tp, walk_subtrees, NULL);
2293 /* Do whatever unsaving is required. */
2294 unsave_expr_1 (*tp);
2297 /* Keep iterating. */
2301 /* Called whenever an expression needs to be unsaved. */
2304 cxx_unsave_expr_now (tree tp)
2308 /* Create a splay-tree to map old local variable declarations to new
2310 st = splay_tree_new (splay_tree_compare_pointers, NULL, NULL);
2312 /* Walk the tree once figuring out what needs to be remapped. */
2313 walk_tree (&tp, mark_local_for_remap_r, st, NULL);
2315 /* Walk the tree again, copying, remapping, and unsaving. */
2316 walk_tree (&tp, cp_unsave_r, st, NULL);
2319 splay_tree_delete (st);
2324 /* Returns the kind of special function that DECL (a FUNCTION_DECL)
2325 is. Note that sfk_none is zero, so this function can be used as a
2326 predicate to test whether or not DECL is a special function. */
2328 special_function_kind
2329 special_function_p (tree decl)
2331 /* Rather than doing all this stuff with magic names, we should
2332 probably have a field of type `special_function_kind' in
2333 DECL_LANG_SPECIFIC. */
2334 if (DECL_COPY_CONSTRUCTOR_P (decl))
2335 return sfk_copy_constructor;
2336 if (DECL_CONSTRUCTOR_P (decl))
2337 return sfk_constructor;
2338 if (DECL_OVERLOADED_OPERATOR_P (decl) == NOP_EXPR)
2339 return sfk_assignment_operator;
2340 if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl))
2341 return sfk_destructor;
2342 if (DECL_COMPLETE_DESTRUCTOR_P (decl))
2343 return sfk_complete_destructor;
2344 if (DECL_BASE_DESTRUCTOR_P (decl))
2345 return sfk_base_destructor;
2346 if (DECL_DELETING_DESTRUCTOR_P (decl))
2347 return sfk_deleting_destructor;
2348 if (DECL_CONV_FN_P (decl))
2349 return sfk_conversion;
2354 /* Returns true if and only if NODE is a name, i.e., a node created
2355 by the parser when processing an id-expression. */
2360 if (TREE_CODE (node) == TEMPLATE_ID_EXPR)
2361 node = TREE_OPERAND (node, 0);
2362 return (/* An ordinary unqualified name. */
2363 TREE_CODE (node) == IDENTIFIER_NODE
2364 /* A destructor name. */
2365 || TREE_CODE (node) == BIT_NOT_EXPR
2366 /* A qualified name. */
2367 || TREE_CODE (node) == SCOPE_REF);
2370 /* Returns nonzero if TYPE is a character type, including wchar_t. */
2373 char_type_p (tree type)
2375 return (same_type_p (type, char_type_node)
2376 || same_type_p (type, unsigned_char_type_node)
2377 || same_type_p (type, signed_char_type_node)
2378 || same_type_p (type, wchar_type_node));
2381 /* Returns the kind of linkage associated with the indicated DECL. Th
2382 value returned is as specified by the language standard; it is
2383 independent of implementation details regarding template
2384 instantiation, etc. For example, it is possible that a declaration
2385 to which this function assigns external linkage would not show up
2386 as a global symbol when you run `nm' on the resulting object file. */
2389 decl_linkage (tree decl)
2391 /* This function doesn't attempt to calculate the linkage from first
2392 principles as given in [basic.link]. Instead, it makes use of
2393 the fact that we have already set TREE_PUBLIC appropriately, and
2394 then handles a few special cases. Ideally, we would calculate
2395 linkage first, and then transform that into a concrete
2398 /* Things that don't have names have no linkage. */
2399 if (!DECL_NAME (decl))
2402 /* Things that are TREE_PUBLIC have external linkage. */
2403 if (TREE_PUBLIC (decl))
2406 /* Some things that are not TREE_PUBLIC have external linkage, too.
2407 For example, on targets that don't have weak symbols, we make all
2408 template instantiations have internal linkage (in the object
2409 file), but the symbols should still be treated as having external
2410 linkage from the point of view of the language. */
2411 if (DECL_LANG_SPECIFIC (decl) && DECL_COMDAT (decl))
2414 /* Things in local scope do not have linkage, if they don't have
2416 if (decl_function_context (decl))
2419 /* Everything else has internal linkage. */
2423 /* EXP is an expression that we want to pre-evaluate. Returns via INITP an
2424 expression to perform the pre-evaluation, and returns directly an
2425 expression to use the precalculated result. */
2428 stabilize_expr (tree exp, tree* initp)
2432 if (!TREE_SIDE_EFFECTS (exp))
2434 init_expr = NULL_TREE;
2436 else if (!real_lvalue_p (exp)
2437 || !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (exp)))
2439 init_expr = get_target_expr (exp);
2440 exp = TARGET_EXPR_SLOT (init_expr);
2444 exp = build_unary_op (ADDR_EXPR, exp, 1);
2445 init_expr = get_target_expr (exp);
2446 exp = TARGET_EXPR_SLOT (init_expr);
2447 exp = build_indirect_ref (exp, 0);
2454 /* Like stabilize_expr, but for a call whose args we want to
2458 stabilize_call (tree call, tree *initp)
2460 tree inits = NULL_TREE;
2463 if (call == error_mark_node)
2466 if (TREE_CODE (call) != CALL_EXPR
2467 && TREE_CODE (call) != AGGR_INIT_EXPR)
2470 for (t = TREE_OPERAND (call, 1); t; t = TREE_CHAIN (t))
2471 if (TREE_SIDE_EFFECTS (TREE_VALUE (t)))
2474 TREE_VALUE (t) = stabilize_expr (TREE_VALUE (t), &init);
2478 inits = build (COMPOUND_EXPR, void_type_node, inits, init);
2486 /* Like stabilize_expr, but for an initialization. If we are initializing
2487 an object of class type, we don't want to introduce an extra temporary,
2488 so we look past the TARGET_EXPR and stabilize the arguments of the call
2492 stabilize_init (tree init, tree *initp)
2496 if (t == error_mark_node)
2499 if (TREE_CODE (t) == INIT_EXPR
2500 && TREE_CODE (TREE_OPERAND (t, 1)) != TARGET_EXPR)
2501 TREE_OPERAND (t, 1) = stabilize_expr (TREE_OPERAND (t, 1), initp);
2504 if (TREE_CODE (t) == INIT_EXPR)
2505 t = TREE_OPERAND (t, 1);
2506 if (TREE_CODE (t) == TARGET_EXPR)
2507 t = TARGET_EXPR_INITIAL (t);
2508 if (TREE_CODE (t) == CONSTRUCTOR
2509 && CONSTRUCTOR_ELTS (t) == NULL_TREE)
2511 /* Default-initialization. */
2516 /* If the initializer is a COND_EXPR, we can't preevaluate
2518 if (TREE_CODE (t) == COND_EXPR)
2521 stabilize_call (t, initp);
2528 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
2529 /* Complain that some language-specific thing hanging off a tree
2530 node has been accessed improperly. */
2533 lang_check_failed (const char* file, int line, const char* function)
2535 internal_error ("lang_* check: failed in %s, at %s:%d",
2536 function, trim_filename (file), line);
2538 #endif /* ENABLE_TREE_CHECKING */
2540 #include "gt-cp-tree.h"