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 if (TREE_CODE (init) == TARGET_EXPR)
323 else if (CLASS_TYPE_P (type) && !TYPE_HAS_TRIVIAL_INIT_REF (type)
324 && TREE_CODE (init) != COND_EXPR
325 && TREE_CODE (init) != CONSTRUCTOR
326 && TREE_CODE (init) != VA_ARG_EXPR)
327 /* We need to build up a copy constructor call. COND_EXPR is a special
328 case because we already have copies on the arms and we don't want
329 another one here. A CONSTRUCTOR is aggregate initialization, which
330 is handled separately. A VA_ARG_EXPR is magic creation of an
331 aggregate; there's no additional work to be done. */
332 return force_rvalue (init);
334 slot = build_local_temp (type);
335 return build_target_expr (slot, init);
338 /* Like the above function, but without the checking. This function should
339 only be used by code which is deliberately trying to subvert the type
340 system, such as call_builtin_trap. */
343 force_target_expr (tree type, tree init)
345 tree slot = build_local_temp (type);
346 return build_target_expr (slot, init);
349 /* Like build_target_expr_with_type, but use the type of INIT. */
352 get_target_expr (tree init)
354 return build_target_expr_with_type (init, TREE_TYPE (init));
359 build_cplus_array_type_1 (tree elt_type, tree index_type)
363 if (elt_type == error_mark_node || index_type == error_mark_node)
364 return error_mark_node;
366 if (dependent_type_p (elt_type)
368 && value_dependent_expression_p (TYPE_MAX_VALUE (index_type))))
370 t = make_node (ARRAY_TYPE);
371 TREE_TYPE (t) = elt_type;
372 TYPE_DOMAIN (t) = index_type;
375 t = build_array_type (elt_type, index_type);
377 /* Push these needs up so that initialization takes place
379 TYPE_NEEDS_CONSTRUCTING (t)
380 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (elt_type));
381 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
382 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (elt_type));
387 build_cplus_array_type (tree elt_type, tree index_type)
390 int type_quals = cp_type_quals (elt_type);
392 if (type_quals != TYPE_UNQUALIFIED)
393 elt_type = cp_build_qualified_type (elt_type, TYPE_UNQUALIFIED);
395 t = build_cplus_array_type_1 (elt_type, index_type);
397 if (type_quals != TYPE_UNQUALIFIED)
398 t = cp_build_qualified_type (t, type_quals);
403 /* Make a variant of TYPE, qualified with the TYPE_QUALS. Handles
404 arrays correctly. In particular, if TYPE is an array of T's, and
405 TYPE_QUALS is non-empty, returns an array of qualified T's.
407 FLAGS determines how to deal with illformed qualifications. If
408 tf_ignore_bad_quals is set, then bad qualifications are dropped
409 (this is permitted if TYPE was introduced via a typedef or template
410 type parameter). If bad qualifications are dropped and tf_warning
411 is set, then a warning is issued for non-const qualifications. If
412 tf_ignore_bad_quals is not set and tf_error is not set, we
413 return error_mark_node. Otherwise, we issue an error, and ignore
416 Qualification of a reference type is valid when the reference came
417 via a typedef or template type argument. [dcl.ref] No such
418 dispensation is provided for qualifying a function type. [dcl.fct]
419 DR 295 queries this and the proposed resolution brings it into line
420 with qualifying a reference. We implement the DR. We also behave
421 in a similar manner for restricting non-pointer types. */
424 cp_build_qualified_type_real (tree type,
426 tsubst_flags_t complain)
429 int bad_quals = TYPE_UNQUALIFIED;
430 /* We keep bad function qualifiers separate, so that we can decide
431 whether to implement DR 295 or not. DR 295 break existing code,
432 unfortunately. Remove this variable to implement the defect
434 int bad_func_quals = TYPE_UNQUALIFIED;
436 if (type == error_mark_node)
439 if (type_quals == cp_type_quals (type))
442 if (TREE_CODE (type) == ARRAY_TYPE)
444 /* In C++, the qualification really applies to the array element
445 type. Obtain the appropriately qualified element type. */
448 = cp_build_qualified_type_real (TREE_TYPE (type),
452 if (element_type == error_mark_node)
453 return error_mark_node;
455 /* See if we already have an identically qualified type. */
456 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
457 if (cp_type_quals (t) == type_quals
458 && TYPE_NAME (t) == TYPE_NAME (type)
459 && TYPE_CONTEXT (t) == TYPE_CONTEXT (type))
464 /* Make a new array type, just like the old one, but with the
465 appropriately qualified element type. */
466 t = build_type_copy (type);
467 TREE_TYPE (t) = element_type;
470 /* Even if we already had this variant, we update
471 TYPE_NEEDS_CONSTRUCTING and TYPE_HAS_NONTRIVIAL_DESTRUCTOR in case
472 they changed since the variant was originally created.
474 This seems hokey; if there is some way to use a previous
475 variant *without* coming through here,
476 TYPE_NEEDS_CONSTRUCTING will never be updated. */
477 TYPE_NEEDS_CONSTRUCTING (t)
478 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (element_type));
479 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
480 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (element_type));
483 else if (TYPE_PTRMEMFUNC_P (type))
485 /* For a pointer-to-member type, we can't just return a
486 cv-qualified version of the RECORD_TYPE. If we do, we
487 haven't changed the field that contains the actual pointer to
488 a method, and so TYPE_PTRMEMFUNC_FN_TYPE will be wrong. */
491 t = TYPE_PTRMEMFUNC_FN_TYPE (type);
492 t = cp_build_qualified_type_real (t, type_quals, complain);
493 return build_ptrmemfunc_type (t);
496 /* A reference, function or method type shall not be cv qualified.
497 [dcl.ref], [dct.fct] */
498 if (type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE)
499 && (TREE_CODE (type) == REFERENCE_TYPE
500 || TREE_CODE (type) == FUNCTION_TYPE
501 || TREE_CODE (type) == METHOD_TYPE))
503 bad_quals |= type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
504 if (TREE_CODE (type) != REFERENCE_TYPE)
505 bad_func_quals |= type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
506 type_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
509 /* A restrict-qualified type must be a pointer (or reference)
510 to object or incomplete type. */
511 if ((type_quals & TYPE_QUAL_RESTRICT)
512 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
513 && TREE_CODE (type) != TYPENAME_TYPE
514 && !POINTER_TYPE_P (type))
516 bad_quals |= TYPE_QUAL_RESTRICT;
517 type_quals &= ~TYPE_QUAL_RESTRICT;
520 if (bad_quals == TYPE_UNQUALIFIED)
522 else if (!(complain & (tf_error | tf_ignore_bad_quals)))
523 return error_mark_node;
524 else if (bad_func_quals && !(complain & tf_error))
525 return error_mark_node;
528 if (complain & tf_ignore_bad_quals)
529 /* We're not going to warn about constifying things that can't
531 bad_quals &= ~TYPE_QUAL_CONST;
532 bad_quals |= bad_func_quals;
535 tree bad_type = build_qualified_type (ptr_type_node, bad_quals);
537 if (!(complain & tf_ignore_bad_quals)
539 error ("`%V' qualifiers cannot be applied to `%T'",
544 /* Retrieve (or create) the appropriately qualified variant. */
545 result = build_qualified_type (type, type_quals);
547 /* If this was a pointer-to-method type, and we just made a copy,
548 then we need to unshare the record that holds the cached
549 pointer-to-member-function type, because these will be distinct
550 between the unqualified and qualified types. */
552 && TREE_CODE (type) == POINTER_TYPE
553 && TREE_CODE (TREE_TYPE (type)) == METHOD_TYPE)
554 TYPE_LANG_SPECIFIC (result) = NULL;
559 /* Returns the canonical version of TYPE. In other words, if TYPE is
560 a typedef, returns the underlying type. The cv-qualification of
561 the type returned matches the type input; they will always be
565 canonical_type_variant (tree t)
567 return cp_build_qualified_type (TYPE_MAIN_VARIANT (t), cp_type_quals (t));
570 /* Makes new binfos for the indirect bases under BINFO. T is the most
571 derived TYPE. PREV is the previous binfo, whose TREE_CHAIN we make
572 point to this binfo. We return the last BINFO created.
574 The CLASSTYPE_VBASECLASSES list of T is constructed in reverse
575 order (pre-order, depth-first, right-to-left). You must nreverse it.
577 The BINFO_INHERITANCE of a virtual base class points to the binfo
578 og the most derived type.
580 The binfo's TREE_CHAIN is set to inheritance graph order, but bases
581 for non-class types are not included (i.e. those which are
582 dependent bases in non-instantiated templates). */
585 copy_base_binfos (tree binfo, tree t, tree prev)
587 tree binfos = BINFO_BASETYPES (binfo);
591 TREE_CHAIN (prev) = binfo;
594 if (binfos == NULL_TREE)
597 n = TREE_VEC_LENGTH (binfos);
599 /* Now copy the structure beneath BINFO. */
600 for (ix = 0; ix != n; ix++)
602 tree base_binfo = TREE_VEC_ELT (binfos, ix);
603 tree new_binfo = NULL_TREE;
605 if (!CLASS_TYPE_P (BINFO_TYPE (base_binfo)))
607 my_friendly_assert (binfo == TYPE_BINFO (t), 20030204);
609 new_binfo = base_binfo;
610 TREE_CHAIN (prev) = new_binfo;
612 BINFO_INHERITANCE_CHAIN (new_binfo) = binfo;
613 BINFO_DEPENDENT_BASE_P (new_binfo) = 1;
615 else if (TREE_VIA_VIRTUAL (base_binfo))
617 new_binfo = purpose_member (BINFO_TYPE (base_binfo),
618 CLASSTYPE_VBASECLASSES (t));
620 new_binfo = TREE_VALUE (new_binfo);
625 new_binfo = make_binfo (BINFO_OFFSET (base_binfo),
626 base_binfo, NULL_TREE,
627 BINFO_VIRTUALS (base_binfo));
628 prev = copy_base_binfos (new_binfo, t, prev);
629 if (TREE_VIA_VIRTUAL (base_binfo))
631 CLASSTYPE_VBASECLASSES (t)
632 = tree_cons (BINFO_TYPE (new_binfo), new_binfo,
633 CLASSTYPE_VBASECLASSES (t));
634 TREE_VIA_VIRTUAL (new_binfo) = 1;
635 BINFO_INHERITANCE_CHAIN (new_binfo) = TYPE_BINFO (t);
638 BINFO_INHERITANCE_CHAIN (new_binfo) = binfo;
640 TREE_VEC_ELT (binfos, ix) = new_binfo;
647 /* Hashing of lists so that we don't make duplicates.
648 The entry point is `list_hash_canon'. */
650 /* Now here is the hash table. When recording a list, it is added
651 to the slot whose index is the hash code mod the table size.
652 Note that the hash table is used for several kinds of lists.
653 While all these live in the same table, they are completely independent,
654 and the hash code is computed differently for each of these. */
656 static GTY ((param_is (union tree_node))) htab_t list_hash_table;
665 /* Compare ENTRY (an entry in the hash table) with DATA (a list_proxy
666 for a node we are thinking about adding). */
669 list_hash_eq (const void* entry, const void* data)
671 tree t = (tree) entry;
672 struct list_proxy *proxy = (struct list_proxy *) data;
674 return (TREE_VALUE (t) == proxy->value
675 && TREE_PURPOSE (t) == proxy->purpose
676 && TREE_CHAIN (t) == proxy->chain);
679 /* Compute a hash code for a list (chain of TREE_LIST nodes
680 with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the
681 TREE_COMMON slots), by adding the hash codes of the individual entries. */
684 list_hash_pieces (tree purpose, tree value, tree chain)
686 hashval_t hashcode = 0;
689 hashcode += TYPE_HASH (chain);
692 hashcode += TYPE_HASH (value);
696 hashcode += TYPE_HASH (purpose);
702 /* Hash an already existing TREE_LIST. */
705 list_hash (const void* p)
708 return list_hash_pieces (TREE_PURPOSE (t),
713 /* Given list components PURPOSE, VALUE, AND CHAIN, return the canonical
714 object for an identical list if one already exists. Otherwise, build a
715 new one, and record it as the canonical object. */
718 hash_tree_cons (tree purpose, tree value, tree chain)
722 struct list_proxy proxy;
724 /* Hash the list node. */
725 hashcode = list_hash_pieces (purpose, value, chain);
726 /* Create a proxy for the TREE_LIST we would like to create. We
727 don't actually create it so as to avoid creating garbage. */
728 proxy.purpose = purpose;
731 /* See if it is already in the table. */
732 slot = htab_find_slot_with_hash (list_hash_table, &proxy, hashcode,
734 /* If not, create a new node. */
736 *slot = tree_cons (purpose, value, chain);
740 /* Constructor for hashed lists. */
743 hash_tree_chain (tree value, tree chain)
745 return hash_tree_cons (NULL_TREE, value, chain);
748 /* Similar, but used for concatenating two lists. */
751 hash_chainon (tree list1, tree list2)
757 if (TREE_CHAIN (list1) == NULL_TREE)
758 return hash_tree_chain (TREE_VALUE (list1), list2);
759 return hash_tree_chain (TREE_VALUE (list1),
760 hash_chainon (TREE_CHAIN (list1), list2));
763 /* Build an association between TYPE and some parameters:
765 OFFSET is the offset added to `this' to convert it to a pointer
768 BINFO is the base binfo to use, if we are deriving from one. This
769 is necessary, as we want specialized parent binfos from base
770 classes, so that the VTABLE_NAMEs of bases are for the most derived
771 type, instead of the simple type.
773 VTABLE is the virtual function table with which to initialize
774 sub-objects of type TYPE.
776 VIRTUALS are the virtual functions sitting in VTABLE. */
779 make_binfo (tree offset, tree binfo, tree vtable, tree virtuals)
781 tree new_binfo = make_tree_vec (BINFO_LANG_ELTS);
784 if (TREE_CODE (binfo) == TREE_VEC)
786 type = BINFO_TYPE (binfo);
787 BINFO_DEPENDENT_BASE_P (new_binfo) = BINFO_DEPENDENT_BASE_P (binfo);
793 BINFO_DEPENDENT_BASE_P (new_binfo) = 1;
796 TREE_TYPE (new_binfo) = TYPE_MAIN_VARIANT (type);
797 BINFO_OFFSET (new_binfo) = offset;
798 BINFO_VTABLE (new_binfo) = vtable;
799 BINFO_VIRTUALS (new_binfo) = virtuals;
801 if (binfo && !BINFO_DEPENDENT_BASE_P (binfo)
802 && BINFO_BASETYPES (binfo) != NULL_TREE)
804 BINFO_BASETYPES (new_binfo) = copy_node (BINFO_BASETYPES (binfo));
805 /* We do not need to copy the accesses, as they are read only. */
806 BINFO_BASEACCESSES (new_binfo) = BINFO_BASEACCESSES (binfo);
812 debug_binfo (tree elem)
817 fprintf (stderr, "type \"%s\", offset = " HOST_WIDE_INT_PRINT_DEC
819 TYPE_NAME_STRING (BINFO_TYPE (elem)),
820 TREE_INT_CST_LOW (BINFO_OFFSET (elem)));
821 debug_tree (BINFO_TYPE (elem));
822 if (BINFO_VTABLE (elem))
823 fprintf (stderr, "vtable decl \"%s\"\n",
824 IDENTIFIER_POINTER (DECL_NAME (get_vtbl_decl_for_binfo (elem))));
826 fprintf (stderr, "no vtable decl yet\n");
827 fprintf (stderr, "virtuals:\n");
828 virtuals = BINFO_VIRTUALS (elem);
833 tree fndecl = TREE_VALUE (virtuals);
834 fprintf (stderr, "%s [%ld =? %ld]\n",
835 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl)),
836 (long) n, (long) TREE_INT_CST_LOW (DECL_VINDEX (fndecl)));
838 virtuals = TREE_CHAIN (virtuals);
843 count_functions (tree t)
846 if (TREE_CODE (t) == FUNCTION_DECL)
848 else if (TREE_CODE (t) == OVERLOAD)
850 for (i = 0; t; t = OVL_CHAIN (t))
860 is_overloaded_fn (tree x)
862 /* A baselink is also considered an overloaded function. */
863 if (TREE_CODE (x) == OFFSET_REF)
864 x = TREE_OPERAND (x, 1);
866 x = BASELINK_FUNCTIONS (x);
867 return (TREE_CODE (x) == FUNCTION_DECL
868 || TREE_CODE (x) == TEMPLATE_ID_EXPR
869 || DECL_FUNCTION_TEMPLATE_P (x)
870 || TREE_CODE (x) == OVERLOAD);
874 really_overloaded_fn (tree x)
876 /* A baselink is also considered an overloaded function. */
877 if (TREE_CODE (x) == OFFSET_REF)
878 x = TREE_OPERAND (x, 1);
880 x = BASELINK_FUNCTIONS (x);
882 return ((TREE_CODE (x) == OVERLOAD && OVL_CHAIN (x))
883 || DECL_FUNCTION_TEMPLATE_P (OVL_CURRENT (x))
884 || TREE_CODE (x) == TEMPLATE_ID_EXPR);
888 get_first_fn (tree from)
890 my_friendly_assert (is_overloaded_fn (from), 9);
891 /* A baselink is also considered an overloaded function. */
892 if (BASELINK_P (from))
893 from = BASELINK_FUNCTIONS (from);
894 return OVL_CURRENT (from);
897 /* Returns nonzero if T is a ->* or .* expression that refers to a
903 return (TREE_CODE (t) == OFFSET_REF
904 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (t, 1))));
907 /* Return a new OVL node, concatenating it with the old one. */
910 ovl_cons (tree decl, tree chain)
912 tree result = make_node (OVERLOAD);
913 TREE_TYPE (result) = unknown_type_node;
914 OVL_FUNCTION (result) = decl;
915 TREE_CHAIN (result) = chain;
920 /* Build a new overloaded function. If this is the first one,
921 just return it; otherwise, ovl_cons the _DECLs */
924 build_overload (tree decl, tree chain)
926 if (! chain && TREE_CODE (decl) != TEMPLATE_DECL)
928 if (chain && TREE_CODE (chain) != OVERLOAD)
929 chain = ovl_cons (chain, NULL_TREE);
930 return ovl_cons (decl, chain);
934 #define PRINT_RING_SIZE 4
937 cxx_printable_name (tree decl, int v)
939 static tree decl_ring[PRINT_RING_SIZE];
940 static char *print_ring[PRINT_RING_SIZE];
941 static int ring_counter;
944 /* Only cache functions. */
946 || TREE_CODE (decl) != FUNCTION_DECL
947 || DECL_LANG_SPECIFIC (decl) == 0)
948 return lang_decl_name (decl, v);
950 /* See if this print name is lying around. */
951 for (i = 0; i < PRINT_RING_SIZE; i++)
952 if (decl_ring[i] == decl)
953 /* yes, so return it. */
954 return print_ring[i];
956 if (++ring_counter == PRINT_RING_SIZE)
959 if (current_function_decl != NULL_TREE)
961 if (decl_ring[ring_counter] == current_function_decl)
963 if (ring_counter == PRINT_RING_SIZE)
965 if (decl_ring[ring_counter] == current_function_decl)
969 if (print_ring[ring_counter])
970 free (print_ring[ring_counter]);
972 print_ring[ring_counter] = xstrdup (lang_decl_name (decl, v));
973 decl_ring[ring_counter] = decl;
974 return print_ring[ring_counter];
977 /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions
981 build_exception_variant (tree type, tree raises)
983 tree v = TYPE_MAIN_VARIANT (type);
984 int type_quals = TYPE_QUALS (type);
986 for (; v; v = TYPE_NEXT_VARIANT (v))
987 if (TYPE_QUALS (v) == type_quals
988 && comp_except_specs (raises, TYPE_RAISES_EXCEPTIONS (v), 1))
991 /* Need to build a new variant. */
992 v = build_type_copy (type);
993 TYPE_RAISES_EXCEPTIONS (v) = raises;
997 /* Given a TEMPLATE_TEMPLATE_PARM node T, create a new
998 BOUND_TEMPLATE_TEMPLATE_PARM bound with NEWARGS as its template
1002 bind_template_template_parm (tree t, tree newargs)
1004 tree decl = TYPE_NAME (t);
1007 t2 = make_aggr_type (BOUND_TEMPLATE_TEMPLATE_PARM);
1008 decl = build_decl (TYPE_DECL, DECL_NAME (decl), NULL_TREE);
1010 /* These nodes have to be created to reflect new TYPE_DECL and template
1012 TEMPLATE_TYPE_PARM_INDEX (t2) = copy_node (TEMPLATE_TYPE_PARM_INDEX (t));
1013 TEMPLATE_PARM_DECL (TEMPLATE_TYPE_PARM_INDEX (t2)) = decl;
1014 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2)
1015 = tree_cons (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t),
1016 newargs, NULL_TREE);
1018 TREE_TYPE (decl) = t2;
1019 TYPE_NAME (t2) = decl;
1020 TYPE_STUB_DECL (t2) = decl;
1026 /* Called from count_trees via walk_tree. */
1029 count_trees_r (tree* tp ATTRIBUTE_UNUSED ,
1030 int* walk_subtrees ATTRIBUTE_UNUSED ,
1037 /* Debugging function for measuring the rough complexity of a tree
1041 count_trees (tree t)
1044 walk_tree_without_duplicates (&t, count_trees_r, &n_trees);
1048 /* Called from verify_stmt_tree via walk_tree. */
1051 verify_stmt_tree_r (tree* tp,
1052 int* walk_subtrees ATTRIBUTE_UNUSED ,
1056 htab_t *statements = (htab_t *) data;
1059 if (!STATEMENT_CODE_P (TREE_CODE (t)))
1062 /* If this statement is already present in the hash table, then
1063 there is a circularity in the statement tree. */
1064 if (htab_find (*statements, t))
1067 slot = htab_find_slot (*statements, t, INSERT);
1073 /* Debugging function to check that the statement T has not been
1074 corrupted. For now, this function simply checks that T contains no
1078 verify_stmt_tree (tree t)
1081 statements = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
1082 walk_tree (&t, verify_stmt_tree_r, &statements, NULL);
1083 htab_delete (statements);
1086 /* Called from find_tree via walk_tree. */
1089 find_tree_r (tree* tp,
1090 int* walk_subtrees ATTRIBUTE_UNUSED ,
1093 if (*tp == (tree) data)
1099 /* Returns X if X appears in the tree structure rooted at T. */
1102 find_tree (tree t, tree x)
1104 return walk_tree_without_duplicates (&t, find_tree_r, x);
1107 /* Passed to walk_tree. Checks for the use of types with no linkage. */
1110 no_linkage_helper (tree* tp,
1111 int* walk_subtrees ATTRIBUTE_UNUSED ,
1112 void* data ATTRIBUTE_UNUSED )
1117 && (CLASS_TYPE_P (t) || TREE_CODE (t) == ENUMERAL_TYPE)
1118 && (decl_function_context (TYPE_MAIN_DECL (t))
1119 || TYPE_ANONYMOUS_P (t)))
1124 /* Check if the type T depends on a type with no linkage and if so, return
1128 no_linkage_check (tree t)
1130 /* There's no point in checking linkage on template functions; we
1131 can't know their complete types. */
1132 if (processing_template_decl)
1135 t = walk_tree_without_duplicates (&t, no_linkage_helper, NULL);
1136 if (t != error_mark_node)
1141 #ifdef GATHER_STATISTICS
1142 extern int depth_reached;
1146 cxx_print_statistics (void)
1148 print_search_statistics ();
1149 print_class_statistics ();
1150 #ifdef GATHER_STATISTICS
1151 fprintf (stderr, "maximum template instantiation depth reached: %d\n",
1156 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1157 (which is an ARRAY_TYPE). This counts only elements of the top
1161 array_type_nelts_top (tree type)
1163 return fold (build (PLUS_EXPR, sizetype,
1164 array_type_nelts (type),
1168 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1169 (which is an ARRAY_TYPE). This one is a recursive count of all
1170 ARRAY_TYPEs that are clumped together. */
1173 array_type_nelts_total (tree type)
1175 tree sz = array_type_nelts_top (type);
1176 type = TREE_TYPE (type);
1177 while (TREE_CODE (type) == ARRAY_TYPE)
1179 tree n = array_type_nelts_top (type);
1180 sz = fold (build (MULT_EXPR, sizetype, sz, n));
1181 type = TREE_TYPE (type);
1186 /* Called from break_out_target_exprs via mapcar. */
1189 bot_manip (tree* tp, int* walk_subtrees, void* data)
1191 splay_tree target_remap = ((splay_tree) data);
1194 if (TREE_CONSTANT (t))
1196 /* There can't be any TARGET_EXPRs or their slot variables below
1197 this point. We used to check !TREE_SIDE_EFFECTS, but then we
1198 failed to copy an ADDR_EXPR of the slot VAR_DECL. */
1202 if (TREE_CODE (t) == TARGET_EXPR)
1206 if (TREE_CODE (TREE_OPERAND (t, 1)) == AGGR_INIT_EXPR)
1208 mark_used (TREE_OPERAND (TREE_OPERAND (TREE_OPERAND (t, 1), 0), 0));
1210 (TREE_TYPE (t), break_out_target_exprs (TREE_OPERAND (t, 1)));
1214 u = build_target_expr_with_type
1215 (break_out_target_exprs (TREE_OPERAND (t, 1)), TREE_TYPE (t));
1218 /* Map the old variable to the new one. */
1219 splay_tree_insert (target_remap,
1220 (splay_tree_key) TREE_OPERAND (t, 0),
1221 (splay_tree_value) TREE_OPERAND (u, 0));
1223 /* Replace the old expression with the new version. */
1225 /* We don't have to go below this point; the recursive call to
1226 break_out_target_exprs will have handled anything below this
1231 else if (TREE_CODE (t) == CALL_EXPR)
1232 mark_used (TREE_OPERAND (TREE_OPERAND (t, 0), 0));
1234 /* Make a copy of this node. */
1235 return copy_tree_r (tp, walk_subtrees, NULL);
1238 /* Replace all remapped VAR_DECLs in T with their new equivalents.
1239 DATA is really a splay-tree mapping old variables to new
1243 bot_replace (tree* t,
1244 int* walk_subtrees ATTRIBUTE_UNUSED ,
1247 splay_tree target_remap = ((splay_tree) data);
1249 if (TREE_CODE (*t) == VAR_DECL)
1251 splay_tree_node n = splay_tree_lookup (target_remap,
1252 (splay_tree_key) *t);
1254 *t = (tree) n->value;
1260 /* When we parse a default argument expression, we may create
1261 temporary variables via TARGET_EXPRs. When we actually use the
1262 default-argument expression, we make a copy of the expression, but
1263 we must replace the temporaries with appropriate local versions. */
1266 break_out_target_exprs (tree t)
1268 static int target_remap_count;
1269 static splay_tree target_remap;
1271 if (!target_remap_count++)
1272 target_remap = splay_tree_new (splay_tree_compare_pointers,
1273 /*splay_tree_delete_key_fn=*/NULL,
1274 /*splay_tree_delete_value_fn=*/NULL);
1275 walk_tree (&t, bot_manip, target_remap, NULL);
1276 walk_tree (&t, bot_replace, target_remap, NULL);
1278 if (!--target_remap_count)
1280 splay_tree_delete (target_remap);
1281 target_remap = NULL;
1287 /* Similar to `build_nt', but for template definitions of dependent
1291 build_min_nt (enum tree_code code, ...)
1300 t = make_node (code);
1301 length = TREE_CODE_LENGTH (code);
1302 TREE_COMPLEXITY (t) = input_line;
1304 for (i = 0; i < length; i++)
1306 tree x = va_arg (p, tree);
1307 TREE_OPERAND (t, i) = x;
1314 /* Similar to `build', but for template definitions. */
1317 build_min (enum tree_code code, tree tt, ...)
1326 t = make_node (code);
1327 length = TREE_CODE_LENGTH (code);
1329 TREE_COMPLEXITY (t) = input_line;
1331 for (i = 0; i < length; i++)
1333 tree x = va_arg (p, tree);
1334 TREE_OPERAND (t, i) = x;
1335 if (x && TREE_SIDE_EFFECTS (x))
1336 TREE_SIDE_EFFECTS (t) = 1;
1343 /* Similar to `build', but for template definitions of non-dependent
1344 expressions. NON_DEP is the non-dependent expression that has been
1348 build_min_non_dep (enum tree_code code, tree non_dep, ...)
1355 va_start (p, non_dep);
1357 t = make_node (code);
1358 length = TREE_CODE_LENGTH (code);
1359 TREE_TYPE (t) = TREE_TYPE (non_dep);
1360 TREE_COMPLEXITY (t) = input_line;
1361 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (non_dep);
1363 for (i = 0; i < length; i++)
1365 tree x = va_arg (p, tree);
1366 TREE_OPERAND (t, i) = x;
1369 if (code == COMPOUND_EXPR && TREE_CODE (non_dep) != COMPOUND_EXPR)
1370 /* This should not be considered a COMPOUND_EXPR, because it
1371 resolves to an overload. */
1372 COMPOUND_EXPR_OVERLOADED (t) = 1;
1378 /* Returns an INTEGER_CST (of type `int') corresponding to I.
1379 Multiple calls with the same value of I may or may not yield the
1380 same node; therefore, callers should never modify the node
1383 static GTY(()) tree shared_int_cache[256];
1386 build_shared_int_cst (int i)
1389 return build_int_2 (i, 0);
1391 if (!shared_int_cache[i])
1392 shared_int_cache[i] = build_int_2 (i, 0);
1394 return shared_int_cache[i];
1398 get_type_decl (tree t)
1400 if (TREE_CODE (t) == TYPE_DECL)
1403 return TYPE_STUB_DECL (t);
1404 if (t == error_mark_node)
1409 /* Stop compiler from complaining control reaches end of non-void function. */
1413 /* Return first vector element whose BINFO_TYPE is ELEM.
1414 Return 0 if ELEM is not in VEC. VEC may be NULL_TREE. */
1417 vec_binfo_member (tree elem, tree vec)
1422 for (i = 0; i < TREE_VEC_LENGTH (vec); ++i)
1423 if (same_type_p (elem, BINFO_TYPE (TREE_VEC_ELT (vec, i))))
1424 return TREE_VEC_ELT (vec, i);
1429 /* Returns the namespace that contains DECL, whether directly or
1433 decl_namespace_context (tree decl)
1437 if (TREE_CODE (decl) == NAMESPACE_DECL)
1439 else if (TYPE_P (decl))
1440 decl = CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl));
1442 decl = CP_DECL_CONTEXT (decl);
1446 /* Return truthvalue of whether T1 is the same tree structure as T2.
1447 Return 1 if they are the same. Return 0 if they are different. */
1450 cp_tree_equal (tree t1, tree t2)
1452 enum tree_code code1, code2;
1459 for (code1 = TREE_CODE (t1);
1460 code1 == NOP_EXPR || code1 == CONVERT_EXPR
1461 || code1 == NON_LVALUE_EXPR;
1462 code1 = TREE_CODE (t1))
1463 t1 = TREE_OPERAND (t1, 0);
1464 for (code2 = TREE_CODE (t2);
1465 code2 == NOP_EXPR || code2 == CONVERT_EXPR
1466 || code1 == NON_LVALUE_EXPR;
1467 code2 = TREE_CODE (t2))
1468 t2 = TREE_OPERAND (t2, 0);
1470 /* They might have become equal now. */
1480 return TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
1481 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2);
1484 return REAL_VALUES_EQUAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
1487 return TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
1488 && !memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
1489 TREE_STRING_LENGTH (t1));
1492 /* We need to do this when determining whether or not two
1493 non-type pointer to member function template arguments
1495 if (!(same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
1496 /* The first operand is RTL. */
1497 && TREE_OPERAND (t1, 0) == TREE_OPERAND (t2, 0)))
1499 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1502 if (!cp_tree_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2)))
1504 if (!cp_tree_equal (TREE_VALUE (t1), TREE_VALUE (t2)))
1506 return cp_tree_equal (TREE_CHAIN (t1), TREE_CHAIN (t2));
1509 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1512 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1514 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1518 tree o1 = TREE_OPERAND (t1, 0);
1519 tree o2 = TREE_OPERAND (t2, 0);
1521 /* Special case: if either target is an unallocated VAR_DECL,
1522 it means that it's going to be unified with whatever the
1523 TARGET_EXPR is really supposed to initialize, so treat it
1524 as being equivalent to anything. */
1525 if (TREE_CODE (o1) == VAR_DECL && DECL_NAME (o1) == NULL_TREE
1526 && !DECL_RTL_SET_P (o1))
1528 else if (TREE_CODE (o2) == VAR_DECL && DECL_NAME (o2) == NULL_TREE
1529 && !DECL_RTL_SET_P (o2))
1531 else if (!cp_tree_equal (o1, o2))
1534 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1537 case WITH_CLEANUP_EXPR:
1538 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1540 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
1543 if (TREE_OPERAND (t1, 1) != TREE_OPERAND (t2, 1))
1545 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1552 case IDENTIFIER_NODE:
1555 case TEMPLATE_PARM_INDEX:
1556 return (TEMPLATE_PARM_IDX (t1) == TEMPLATE_PARM_IDX (t2)
1557 && TEMPLATE_PARM_LEVEL (t1) == TEMPLATE_PARM_LEVEL (t2)
1558 && same_type_p (TREE_TYPE (TEMPLATE_PARM_DECL (t1)),
1559 TREE_TYPE (TEMPLATE_PARM_DECL (t2))));
1561 case TEMPLATE_ID_EXPR:
1566 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1568 vec1 = TREE_OPERAND (t1, 1);
1569 vec2 = TREE_OPERAND (t2, 1);
1572 return !vec1 && !vec2;
1574 if (TREE_VEC_LENGTH (vec1) != TREE_VEC_LENGTH (vec2))
1577 for (ix = TREE_VEC_LENGTH (vec1); ix--;)
1578 if (!cp_tree_equal (TREE_VEC_ELT (vec1, ix),
1579 TREE_VEC_ELT (vec2, ix)))
1588 tree o1 = TREE_OPERAND (t1, 0);
1589 tree o2 = TREE_OPERAND (t2, 0);
1591 if (TREE_CODE (o1) != TREE_CODE (o2))
1594 return same_type_p (o1, o2);
1596 return cp_tree_equal (o1, o2);
1600 /* Two pointer-to-members are the same if they point to the same
1601 field or function in the same class. */
1602 if (PTRMEM_CST_MEMBER (t1) != PTRMEM_CST_MEMBER (t2))
1605 return same_type_p (PTRMEM_CST_CLASS (t1), PTRMEM_CST_CLASS (t2));
1611 switch (TREE_CODE_CLASS (code1))
1622 for (i = 0; i < TREE_CODE_LENGTH (code1); ++i)
1623 if (!cp_tree_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i)))
1630 return same_type_p (t1, t2);
1633 my_friendly_assert (0, 20030617);
1637 /* Build a wrapper around a 'struct z_candidate' so we can use it as a
1641 build_zc_wrapper (struct z_candidate* ptr)
1643 tree t = make_node (WRAPPER);
1644 WRAPPER_ZC (t) = ptr;
1648 /* The type of ARG when used as an lvalue. */
1651 lvalue_type (tree arg)
1653 tree type = TREE_TYPE (arg);
1654 if (TREE_CODE (arg) == OVERLOAD)
1655 type = unknown_type_node;
1659 /* The type of ARG for printing error messages; denote lvalues with
1663 error_type (tree arg)
1665 tree type = TREE_TYPE (arg);
1667 if (TREE_CODE (type) == ARRAY_TYPE)
1669 else if (TREE_CODE (type) == ERROR_MARK)
1671 else if (real_lvalue_p (arg))
1672 type = build_reference_type (lvalue_type (arg));
1673 else if (IS_AGGR_TYPE (type))
1674 type = lvalue_type (arg);
1679 /* Does FUNCTION use a variable-length argument list? */
1682 varargs_function_p (tree function)
1684 tree parm = TYPE_ARG_TYPES (TREE_TYPE (function));
1685 for (; parm; parm = TREE_CHAIN (parm))
1686 if (TREE_VALUE (parm) == void_type_node)
1691 /* Returns 1 if decl is a member of a class. */
1694 member_p (tree decl)
1696 const tree ctx = DECL_CONTEXT (decl);
1697 return (ctx && TYPE_P (ctx));
1700 /* Create a placeholder for member access where we don't actually have an
1701 object that the access is against. */
1704 build_dummy_object (tree type)
1706 tree decl = build1 (NOP_EXPR, build_pointer_type (type), void_zero_node);
1707 return build_indirect_ref (decl, NULL);
1710 /* We've gotten a reference to a member of TYPE. Return *this if appropriate,
1711 or a dummy object otherwise. If BINFOP is non-0, it is filled with the
1712 binfo path from current_class_type to TYPE, or 0. */
1715 maybe_dummy_object (tree type, tree* binfop)
1720 if (current_class_type
1721 && (binfo = lookup_base (current_class_type, type,
1722 ba_ignore | ba_quiet, NULL)))
1723 context = current_class_type;
1726 /* Reference from a nested class member function. */
1728 binfo = TYPE_BINFO (type);
1734 if (current_class_ref && context == current_class_type
1735 /* Kludge: Make sure that current_class_type is actually
1736 correct. It might not be if we're in the middle of
1737 tsubst_default_argument. */
1738 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref)),
1739 current_class_type))
1740 decl = current_class_ref;
1742 decl = build_dummy_object (context);
1747 /* Returns 1 if OB is a placeholder object, or a pointer to one. */
1750 is_dummy_object (tree ob)
1752 if (TREE_CODE (ob) == INDIRECT_REF)
1753 ob = TREE_OPERAND (ob, 0);
1754 return (TREE_CODE (ob) == NOP_EXPR
1755 && TREE_OPERAND (ob, 0) == void_zero_node);
1758 /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */
1763 t = strip_array_types (t);
1765 if (t == error_mark_node)
1767 if (INTEGRAL_TYPE_P (t))
1768 return 1; /* integral, character or enumeral type */
1769 if (FLOAT_TYPE_P (t))
1772 return 1; /* pointer to non-member */
1773 if (TYPE_PTR_TO_MEMBER_P (t))
1774 return 1; /* pointer to member */
1776 if (! CLASS_TYPE_P (t))
1777 return 0; /* other non-class type (reference or function) */
1778 if (CLASSTYPE_NON_POD_P (t))
1783 /* Returns 1 iff zero initialization of type T means actually storing
1787 zero_init_p (tree t)
1789 t = strip_array_types (t);
1791 if (t == error_mark_node)
1794 /* NULL pointers to data members are initialized with -1. */
1795 if (TYPE_PTRMEM_P (t))
1798 /* Classes that contain types that can't be zero-initialized, cannot
1799 be zero-initialized themselves. */
1800 if (CLASS_TYPE_P (t) && CLASSTYPE_NON_ZERO_INIT_P (t))
1806 /* Table of valid C++ attributes. */
1807 const struct attribute_spec cxx_attribute_table[] =
1809 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
1810 { "java_interface", 0, 0, false, false, false, handle_java_interface_attribute },
1811 { "com_interface", 0, 0, false, false, false, handle_com_interface_attribute },
1812 { "init_priority", 1, 1, true, false, false, handle_init_priority_attribute },
1813 { NULL, 0, 0, false, false, false, NULL }
1816 /* Handle a "java_interface" attribute; arguments as in
1817 struct attribute_spec.handler. */
1819 handle_java_interface_attribute (tree* node,
1821 tree args ATTRIBUTE_UNUSED ,
1826 || !CLASS_TYPE_P (*node)
1827 || !TYPE_FOR_JAVA (*node))
1829 error ("`%s' attribute can only be applied to Java class definitions",
1830 IDENTIFIER_POINTER (name));
1831 *no_add_attrs = true;
1834 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
1835 *node = build_type_copy (*node);
1836 TYPE_JAVA_INTERFACE (*node) = 1;
1841 /* Handle a "com_interface" attribute; arguments as in
1842 struct attribute_spec.handler. */
1844 handle_com_interface_attribute (tree* node,
1846 tree args ATTRIBUTE_UNUSED ,
1847 int flags ATTRIBUTE_UNUSED ,
1852 *no_add_attrs = true;
1855 || !CLASS_TYPE_P (*node)
1856 || *node != TYPE_MAIN_VARIANT (*node))
1858 warning ("`%s' attribute can only be applied to class definitions",
1859 IDENTIFIER_POINTER (name));
1864 warning ("`%s' is obsolete; g++ vtables are now COM-compatible by default",
1865 IDENTIFIER_POINTER (name));
1870 /* Handle an "init_priority" attribute; arguments as in
1871 struct attribute_spec.handler. */
1873 handle_init_priority_attribute (tree* node,
1876 int flags ATTRIBUTE_UNUSED ,
1879 tree initp_expr = TREE_VALUE (args);
1881 tree type = TREE_TYPE (decl);
1884 STRIP_NOPS (initp_expr);
1886 if (!initp_expr || TREE_CODE (initp_expr) != INTEGER_CST)
1888 error ("requested init_priority is not an integer constant");
1889 *no_add_attrs = true;
1893 pri = TREE_INT_CST_LOW (initp_expr);
1895 type = strip_array_types (type);
1897 if (decl == NULL_TREE
1898 || TREE_CODE (decl) != VAR_DECL
1899 || !TREE_STATIC (decl)
1900 || DECL_EXTERNAL (decl)
1901 || (TREE_CODE (type) != RECORD_TYPE
1902 && TREE_CODE (type) != UNION_TYPE)
1903 /* Static objects in functions are initialized the
1904 first time control passes through that
1905 function. This is not precise enough to pin down an
1906 init_priority value, so don't allow it. */
1907 || current_function_decl)
1909 error ("can only use `%s' attribute on file-scope definitions of objects of class type",
1910 IDENTIFIER_POINTER (name));
1911 *no_add_attrs = true;
1915 if (pri > MAX_INIT_PRIORITY || pri <= 0)
1917 error ("requested init_priority is out of range");
1918 *no_add_attrs = true;
1922 /* Check for init_priorities that are reserved for
1923 language and runtime support implementations.*/
1924 if (pri <= MAX_RESERVED_INIT_PRIORITY)
1927 ("requested init_priority is reserved for internal use");
1930 if (SUPPORTS_INIT_PRIORITY)
1932 DECL_INIT_PRIORITY (decl) = pri;
1937 error ("`%s' attribute is not supported on this platform",
1938 IDENTIFIER_POINTER (name));
1939 *no_add_attrs = true;
1944 /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the
1945 thing pointed to by the constant. */
1948 make_ptrmem_cst (tree type, tree member)
1950 tree ptrmem_cst = make_node (PTRMEM_CST);
1951 /* If would seem a great convenience if make_node would set
1952 TREE_CONSTANT for things of class `c', but it does not. */
1953 TREE_CONSTANT (ptrmem_cst) = 1;
1954 TREE_TYPE (ptrmem_cst) = type;
1955 PTRMEM_CST_MEMBER (ptrmem_cst) = member;
1959 /* Apply FUNC to all language-specific sub-trees of TP in a pre-order
1960 traversal. Called from walk_tree(). */
1963 cp_walk_subtrees (tree* tp,
1964 int* walk_subtrees_p,
1969 enum tree_code code = TREE_CODE (*tp);
1972 #define WALK_SUBTREE(NODE) \
1975 result = walk_tree (&(NODE), func, data, htab); \
1981 /* Not one of the easy cases. We must explicitly go through the
1986 case TEMPLATE_TEMPLATE_PARM:
1987 case BOUND_TEMPLATE_TEMPLATE_PARM:
1988 case UNBOUND_CLASS_TEMPLATE:
1989 case TEMPLATE_PARM_INDEX:
1990 case TEMPLATE_TYPE_PARM:
1994 /* None of these have subtrees other than those already walked
1996 *walk_subtrees_p = 0;
2000 WALK_SUBTREE (TREE_TYPE (*tp));
2001 *walk_subtrees_p = 0;
2005 WALK_SUBTREE (TREE_PURPOSE (*tp));
2009 WALK_SUBTREE (OVL_FUNCTION (*tp));
2010 WALK_SUBTREE (OVL_CHAIN (*tp));
2011 *walk_subtrees_p = 0;
2015 if (TYPE_PTRMEMFUNC_P (*tp))
2016 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (*tp));
2023 /* We didn't find what we were looking for. */
2029 /* Decide whether there are language-specific reasons to not inline a
2030 function as a tree. */
2033 cp_cannot_inline_tree_fn (tree* fnp)
2037 /* We can inline a template instantiation only if it's fully
2039 if (DECL_TEMPLATE_INFO (fn)
2040 && TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (fn)))
2042 /* Don't instantiate functions that are not going to be
2044 if (!DECL_INLINE (DECL_TEMPLATE_RESULT
2045 (template_for_substitution (fn))))
2048 fn = *fnp = instantiate_decl (fn, /*defer_ok=*/0);
2050 if (TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (fn)))
2054 if (flag_really_no_inline
2055 && lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)) == NULL)
2058 /* Don't auto-inline anything that might not be bound within
2059 this unit of translation. */
2060 if (!DECL_DECLARED_INLINE_P (fn) && !(*targetm.binds_local_p) (fn))
2062 DECL_UNINLINABLE (fn) = 1;
2066 if (varargs_function_p (fn))
2068 DECL_UNINLINABLE (fn) = 1;
2072 if (! function_attribute_inlinable_p (fn))
2074 DECL_UNINLINABLE (fn) = 1;
2081 /* Add any pending functions other than the current function (already
2082 handled by the caller), that thus cannot be inlined, to FNS_P, then
2083 return the latest function added to the array, PREV_FN. */
2086 cp_add_pending_fn_decls (void* fns_p, tree prev_fn)
2088 varray_type *fnsp = (varray_type *)fns_p;
2089 struct saved_scope *s;
2091 for (s = scope_chain; s; s = s->prev)
2092 if (s->function_decl && s->function_decl != prev_fn)
2094 VARRAY_PUSH_TREE (*fnsp, s->function_decl);
2095 prev_fn = s->function_decl;
2101 /* Determine whether a tree node is an OVERLOAD node. Used to decide
2102 whether to copy a node or to preserve its chain when inlining a
2106 cp_is_overload_p (tree t)
2108 return TREE_CODE (t) == OVERLOAD;
2111 /* Determine whether VAR is a declaration of an automatic variable in
2115 cp_auto_var_in_fn_p (tree var, tree fn)
2117 return (DECL_P (var) && DECL_CONTEXT (var) == fn
2118 && nonstatic_local_decl_p (var));
2121 /* Tell whether a declaration is needed for the RESULT of a function
2122 FN being inlined into CALLER or if the top node of target_exprs is
2126 cp_copy_res_decl_for_inlining (tree result,
2131 tree return_slot_addr)
2133 splay_tree decl_map = (splay_tree)decl_map_;
2136 /* If FN returns an aggregate then the caller will always pass the
2137 address of the return slot explicitly. If we were just to
2138 create a new VAR_DECL here, then the result of this function
2139 would be copied (bitwise) into the variable initialized by the
2140 TARGET_EXPR. That's incorrect, so we must transform any
2141 references to the RESULT into references to the target. */
2143 /* We should have an explicit return slot iff the return type is
2144 TREE_ADDRESSABLE. See simplify_aggr_init_expr. */
2145 if (TREE_ADDRESSABLE (TREE_TYPE (result))
2146 != (return_slot_addr != NULL_TREE))
2149 *need_decl = !return_slot_addr;
2150 if (return_slot_addr)
2152 var = build_indirect_ref (return_slot_addr, "");
2153 if (! same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (var),
2154 TREE_TYPE (result)))
2157 /* Otherwise, make an appropriate copy. */
2159 var = copy_decl_for_inlining (result, fn, caller);
2161 if (DECL_SAVED_FUNCTION_DATA (fn))
2163 tree nrv = DECL_SAVED_FUNCTION_DATA (fn)->x_return_value;
2166 /* We have a named return value; copy the name and source
2167 position so we can get reasonable debugging information, and
2168 register the return variable as its equivalent. */
2169 if (TREE_CODE (var) == VAR_DECL
2170 /* But not if we're initializing a variable from the
2171 enclosing function which already has its own name. */
2172 && DECL_NAME (var) == NULL_TREE)
2174 DECL_NAME (var) = DECL_NAME (nrv);
2175 DECL_SOURCE_LOCATION (var) = DECL_SOURCE_LOCATION (nrv);
2176 DECL_ABSTRACT_ORIGIN (var) = DECL_ORIGIN (nrv);
2177 /* Don't lose initialization info. */
2178 DECL_INITIAL (var) = DECL_INITIAL (nrv);
2179 /* Don't forget that it needs to go in the stack. */
2180 TREE_ADDRESSABLE (var) = TREE_ADDRESSABLE (nrv);
2183 splay_tree_insert (decl_map,
2184 (splay_tree_key) nrv,
2185 (splay_tree_value) var);
2192 /* Initialize tree.c. */
2197 list_hash_table = htab_create_ggc (31, list_hash, list_hash_eq, NULL);
2200 /* Called via walk_tree. If *TP points to a DECL_STMT for a local
2201 declaration, copies the declaration and enters it in the splay_tree
2202 pointed to by DATA (which is really a `splay_tree *'). */
2205 mark_local_for_remap_r (tree* tp,
2206 int* walk_subtrees ATTRIBUTE_UNUSED ,
2210 splay_tree st = (splay_tree) data;
2214 if (TREE_CODE (t) == DECL_STMT
2215 && nonstatic_local_decl_p (DECL_STMT_DECL (t)))
2216 decl = DECL_STMT_DECL (t);
2217 else if (TREE_CODE (t) == LABEL_STMT)
2218 decl = LABEL_STMT_LABEL (t);
2219 else if (TREE_CODE (t) == TARGET_EXPR
2220 && nonstatic_local_decl_p (TREE_OPERAND (t, 0)))
2221 decl = TREE_OPERAND (t, 0);
2222 else if (TREE_CODE (t) == CASE_LABEL)
2223 decl = CASE_LABEL_DECL (t);
2232 copy = copy_decl_for_inlining (decl,
2233 DECL_CONTEXT (decl),
2234 DECL_CONTEXT (decl));
2236 /* Remember the copy. */
2237 splay_tree_insert (st,
2238 (splay_tree_key) decl,
2239 (splay_tree_value) copy);
2245 /* Called via walk_tree when an expression is unsaved. Using the
2246 splay_tree pointed to by ST (which is really a `splay_tree'),
2247 remaps all local declarations to appropriate replacements. */
2250 cp_unsave_r (tree* tp,
2254 splay_tree st = (splay_tree) data;
2257 /* Only a local declaration (variable or label). */
2258 if (nonstatic_local_decl_p (*tp))
2260 /* Lookup the declaration. */
2261 n = splay_tree_lookup (st, (splay_tree_key) *tp);
2263 /* If it's there, remap it. */
2265 *tp = (tree) n->value;
2267 else if (TREE_CODE (*tp) == SAVE_EXPR)
2268 remap_save_expr (tp, st, current_function_decl, walk_subtrees);
2271 copy_tree_r (tp, walk_subtrees, NULL);
2273 /* Do whatever unsaving is required. */
2274 unsave_expr_1 (*tp);
2277 /* Keep iterating. */
2281 /* Called whenever an expression needs to be unsaved. */
2284 cxx_unsave_expr_now (tree tp)
2288 /* Create a splay-tree to map old local variable declarations to new
2290 st = splay_tree_new (splay_tree_compare_pointers, NULL, NULL);
2292 /* Walk the tree once figuring out what needs to be remapped. */
2293 walk_tree (&tp, mark_local_for_remap_r, st, NULL);
2295 /* Walk the tree again, copying, remapping, and unsaving. */
2296 walk_tree (&tp, cp_unsave_r, st, NULL);
2299 splay_tree_delete (st);
2304 /* Returns the kind of special function that DECL (a FUNCTION_DECL)
2305 is. Note that sfk_none is zero, so this function can be used as a
2306 predicate to test whether or not DECL is a special function. */
2308 special_function_kind
2309 special_function_p (tree decl)
2311 /* Rather than doing all this stuff with magic names, we should
2312 probably have a field of type `special_function_kind' in
2313 DECL_LANG_SPECIFIC. */
2314 if (DECL_COPY_CONSTRUCTOR_P (decl))
2315 return sfk_copy_constructor;
2316 if (DECL_CONSTRUCTOR_P (decl))
2317 return sfk_constructor;
2318 if (DECL_OVERLOADED_OPERATOR_P (decl) == NOP_EXPR)
2319 return sfk_assignment_operator;
2320 if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl))
2321 return sfk_destructor;
2322 if (DECL_COMPLETE_DESTRUCTOR_P (decl))
2323 return sfk_complete_destructor;
2324 if (DECL_BASE_DESTRUCTOR_P (decl))
2325 return sfk_base_destructor;
2326 if (DECL_DELETING_DESTRUCTOR_P (decl))
2327 return sfk_deleting_destructor;
2328 if (DECL_CONV_FN_P (decl))
2329 return sfk_conversion;
2334 /* Returns true if and only if NODE is a name, i.e., a node created
2335 by the parser when processing an id-expression. */
2340 if (TREE_CODE (node) == TEMPLATE_ID_EXPR)
2341 node = TREE_OPERAND (node, 0);
2342 return (/* An ordinary unqualified name. */
2343 TREE_CODE (node) == IDENTIFIER_NODE
2344 /* A destructor name. */
2345 || TREE_CODE (node) == BIT_NOT_EXPR
2346 /* A qualified name. */
2347 || TREE_CODE (node) == SCOPE_REF);
2350 /* Returns nonzero if TYPE is a character type, including wchar_t. */
2353 char_type_p (tree type)
2355 return (same_type_p (type, char_type_node)
2356 || same_type_p (type, unsigned_char_type_node)
2357 || same_type_p (type, signed_char_type_node)
2358 || same_type_p (type, wchar_type_node));
2361 /* Returns the kind of linkage associated with the indicated DECL. Th
2362 value returned is as specified by the language standard; it is
2363 independent of implementation details regarding template
2364 instantiation, etc. For example, it is possible that a declaration
2365 to which this function assigns external linkage would not show up
2366 as a global symbol when you run `nm' on the resulting object file. */
2369 decl_linkage (tree decl)
2371 /* This function doesn't attempt to calculate the linkage from first
2372 principles as given in [basic.link]. Instead, it makes use of
2373 the fact that we have already set TREE_PUBLIC appropriately, and
2374 then handles a few special cases. Ideally, we would calculate
2375 linkage first, and then transform that into a concrete
2378 /* Things that don't have names have no linkage. */
2379 if (!DECL_NAME (decl))
2382 /* Things that are TREE_PUBLIC have external linkage. */
2383 if (TREE_PUBLIC (decl))
2386 /* Some things that are not TREE_PUBLIC have external linkage, too.
2387 For example, on targets that don't have weak symbols, we make all
2388 template instantiations have internal linkage (in the object
2389 file), but the symbols should still be treated as having external
2390 linkage from the point of view of the language. */
2391 if (DECL_LANG_SPECIFIC (decl) && DECL_COMDAT (decl))
2394 /* Things in local scope do not have linkage, if they don't have
2396 if (decl_function_context (decl))
2399 /* Everything else has internal linkage. */
2403 /* EXP is an expression that we want to pre-evaluate. Returns via INITP an
2404 expression to perform the pre-evaluation, and returns directly an
2405 expression to use the precalculated result. */
2408 stabilize_expr (tree exp, tree* initp)
2412 if (!TREE_SIDE_EFFECTS (exp))
2414 init_expr = void_zero_node;
2416 else if (!real_lvalue_p (exp)
2417 || !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (exp)))
2419 init_expr = get_target_expr (exp);
2420 exp = TARGET_EXPR_SLOT (init_expr);
2424 exp = build_unary_op (ADDR_EXPR, exp, 1);
2425 init_expr = get_target_expr (exp);
2426 exp = TARGET_EXPR_SLOT (init_expr);
2427 exp = build_indirect_ref (exp, 0);
2434 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
2435 /* Complain that some language-specific thing hanging off a tree
2436 node has been accessed improperly. */
2439 lang_check_failed (const char* file, int line, const char* function)
2441 internal_error ("lang_* check: failed in %s, at %s:%d",
2442 function, trim_filename (file), line);
2444 #endif /* ENABLE_TREE_CHECKING */
2446 #include "gt-cp-tree.h"