1 /* Language-dependent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005 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 build_target_expr (tree, tree);
46 static tree count_trees_r (tree *, int *, void *);
47 static tree verify_stmt_tree_r (tree *, int *, void *);
48 static tree find_tree_r (tree *, int *, void *);
49 static tree build_local_temp (tree);
51 static tree handle_java_interface_attribute (tree *, tree, tree, int, bool *);
52 static tree handle_com_interface_attribute (tree *, tree, tree, int, bool *);
53 static tree handle_init_priority_attribute (tree *, tree, tree, int, bool *);
55 /* If REF is an lvalue, returns the kind of lvalue that REF is.
56 Otherwise, returns clk_none. If TREAT_CLASS_RVALUES_AS_LVALUES is
57 nonzero, rvalues of class type are considered lvalues. */
61 int treat_class_rvalues_as_lvalues)
63 cp_lvalue_kind op1_lvalue_kind = clk_none;
64 cp_lvalue_kind op2_lvalue_kind = clk_none;
66 if (TREE_CODE (TREE_TYPE (ref)) == REFERENCE_TYPE)
69 if (ref == current_class_ptr)
72 switch (TREE_CODE (ref))
74 /* preincrements and predecrements are valid lvals, provided
75 what they refer to are valid lvals. */
76 case PREINCREMENT_EXPR:
77 case PREDECREMENT_EXPR:
80 case WITH_CLEANUP_EXPR:
83 return lvalue_p_1 (TREE_OPERAND (ref, 0),
84 treat_class_rvalues_as_lvalues);
87 op1_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 0),
88 treat_class_rvalues_as_lvalues);
89 /* In an expression of the form "X.Y", the packed-ness of the
90 expression does not depend on "X". */
91 op1_lvalue_kind &= ~clk_packed;
92 /* Look at the member designator. */
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 /* Disallow <? and >? as lvalues if either argument side-effects. */
133 if (TREE_SIDE_EFFECTS (TREE_OPERAND (ref, 0))
134 || TREE_SIDE_EFFECTS (TREE_OPERAND (ref, 1)))
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 /* Test whether DECL is a builtin that may appear in a
219 constant-expression. */
222 builtin_valid_in_constant_expr_p (tree decl)
224 /* At present BUILT_IN_CONSTANT_P is the only builtin we're allowing
225 in constant-expressions. We may want to add other builtins later. */
226 return DECL_IS_BUILTIN_CONSTANT_P (decl);
229 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
232 build_target_expr (tree decl, tree value)
236 t = build4 (TARGET_EXPR, TREE_TYPE (decl), decl, value,
237 cxx_maybe_build_cleanup (decl), NULL_TREE);
238 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
239 ignore the TARGET_EXPR. If there really turn out to be no
240 side-effects, then the optimizer should be able to get rid of
241 whatever code is generated anyhow. */
242 TREE_SIDE_EFFECTS (t) = 1;
247 /* Return an undeclared local temporary of type TYPE for use in building a
251 build_local_temp (tree type)
253 tree slot = build_decl (VAR_DECL, NULL_TREE, type);
254 DECL_ARTIFICIAL (slot) = 1;
255 DECL_IGNORED_P (slot) = 1;
256 DECL_CONTEXT (slot) = current_function_decl;
257 layout_decl (slot, 0);
261 /* INIT is a CALL_EXPR which needs info about its target.
262 TYPE is the type that this initialization should appear to have.
264 Build an encapsulation of the initialization to perform
265 and return it so that it can be processed by language-independent
266 and language-specific expression expanders. */
269 build_cplus_new (tree type, tree init)
276 /* Make sure that we're not trying to create an instance of an
278 abstract_virtuals_error (NULL_TREE, type);
280 if (TREE_CODE (init) != CALL_EXPR && TREE_CODE (init) != AGGR_INIT_EXPR)
281 return convert (type, init);
283 fn = TREE_OPERAND (init, 0);
284 is_ctor = (TREE_CODE (fn) == ADDR_EXPR
285 && TREE_CODE (TREE_OPERAND (fn, 0)) == FUNCTION_DECL
286 && DECL_CONSTRUCTOR_P (TREE_OPERAND (fn, 0)));
288 slot = build_local_temp (type);
290 /* We split the CALL_EXPR into its function and its arguments here.
291 Then, in expand_expr, we put them back together. The reason for
292 this is that this expression might be a default argument
293 expression. In that case, we need a new temporary every time the
294 expression is used. That's what break_out_target_exprs does; it
295 replaces every AGGR_INIT_EXPR with a copy that uses a fresh
296 temporary slot. Then, expand_expr builds up a call-expression
297 using the new slot. */
299 /* If we don't need to use a constructor to create an object of this
300 type, don't mess with AGGR_INIT_EXPR. */
301 if (is_ctor || TREE_ADDRESSABLE (type))
303 rval = build3 (AGGR_INIT_EXPR, void_type_node, fn,
304 TREE_OPERAND (init, 1), slot);
305 TREE_SIDE_EFFECTS (rval) = 1;
306 AGGR_INIT_VIA_CTOR_P (rval) = is_ctor;
311 rval = build_target_expr (slot, rval);
316 /* Build a TARGET_EXPR using INIT to initialize a new temporary of the
320 build_target_expr_with_type (tree init, tree type)
324 gcc_assert (!VOID_TYPE_P (type));
326 if (TREE_CODE (init) == TARGET_EXPR)
328 else if (CLASS_TYPE_P (type) && !TYPE_HAS_TRIVIAL_INIT_REF (type)
329 && TREE_CODE (init) != COND_EXPR
330 && TREE_CODE (init) != CONSTRUCTOR
331 && TREE_CODE (init) != VA_ARG_EXPR)
332 /* We need to build up a copy constructor call. COND_EXPR is a special
333 case because we already have copies on the arms and we don't want
334 another one here. A CONSTRUCTOR is aggregate initialization, which
335 is handled separately. A VA_ARG_EXPR is magic creation of an
336 aggregate; there's no additional work to be done. */
337 return force_rvalue (init);
339 slot = build_local_temp (type);
340 return build_target_expr (slot, init);
343 /* Like the above function, but without the checking. This function should
344 only be used by code which is deliberately trying to subvert the type
345 system, such as call_builtin_trap. */
348 force_target_expr (tree type, tree init)
352 gcc_assert (!VOID_TYPE_P (type));
354 slot = build_local_temp (type);
355 return build_target_expr (slot, init);
358 /* Like build_target_expr_with_type, but use the type of INIT. */
361 get_target_expr (tree init)
363 return build_target_expr_with_type (init, TREE_TYPE (init));
368 build_cplus_array_type_1 (tree elt_type, tree index_type)
372 if (elt_type == error_mark_node || index_type == error_mark_node)
373 return error_mark_node;
375 if (dependent_type_p (elt_type)
377 && value_dependent_expression_p (TYPE_MAX_VALUE (index_type))))
379 t = make_node (ARRAY_TYPE);
380 TREE_TYPE (t) = elt_type;
381 TYPE_DOMAIN (t) = index_type;
384 t = build_array_type (elt_type, index_type);
386 /* Push these needs up so that initialization takes place
388 TYPE_NEEDS_CONSTRUCTING (t)
389 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (elt_type));
390 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
391 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (elt_type));
396 build_cplus_array_type (tree elt_type, tree index_type)
399 int type_quals = cp_type_quals (elt_type);
401 if (type_quals != TYPE_UNQUALIFIED)
402 elt_type = cp_build_qualified_type (elt_type, TYPE_UNQUALIFIED);
404 t = build_cplus_array_type_1 (elt_type, index_type);
406 if (type_quals != TYPE_UNQUALIFIED)
407 t = cp_build_qualified_type (t, type_quals);
412 /* Make a variant of TYPE, qualified with the TYPE_QUALS. Handles
413 arrays correctly. In particular, if TYPE is an array of T's, and
414 TYPE_QUALS is non-empty, returns an array of qualified T's.
416 FLAGS determines how to deal with illformed qualifications. If
417 tf_ignore_bad_quals is set, then bad qualifications are dropped
418 (this is permitted if TYPE was introduced via a typedef or template
419 type parameter). If bad qualifications are dropped and tf_warning
420 is set, then a warning is issued for non-const qualifications. If
421 tf_ignore_bad_quals is not set and tf_error is not set, we
422 return error_mark_node. Otherwise, we issue an error, and ignore
425 Qualification of a reference type is valid when the reference came
426 via a typedef or template type argument. [dcl.ref] No such
427 dispensation is provided for qualifying a function type. [dcl.fct]
428 DR 295 queries this and the proposed resolution brings it into line
429 with qualifying a reference. We implement the DR. We also behave
430 in a similar manner for restricting non-pointer types. */
433 cp_build_qualified_type_real (tree type,
435 tsubst_flags_t complain)
438 int bad_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_variant_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 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) == METHOD_TYPE))
506 bad_quals |= type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
507 type_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
510 /* A restrict-qualified type must be a pointer (or reference)
511 to object or incomplete type, or a function type. */
512 if ((type_quals & TYPE_QUAL_RESTRICT)
513 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
514 && TREE_CODE (type) != TYPENAME_TYPE
515 && TREE_CODE (type) != FUNCTION_TYPE
516 && !POINTER_TYPE_P (type))
518 bad_quals |= TYPE_QUAL_RESTRICT;
519 type_quals &= ~TYPE_QUAL_RESTRICT;
522 if (bad_quals == TYPE_UNQUALIFIED)
524 else if (!(complain & (tf_error | tf_ignore_bad_quals)))
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;
534 tree bad_type = build_qualified_type (ptr_type_node, bad_quals);
536 if (!(complain & tf_ignore_bad_quals))
537 error ("%qV qualifiers cannot be applied to %qT",
542 /* Retrieve (or create) the appropriately qualified variant. */
543 result = build_qualified_type (type, type_quals);
545 /* If this was a pointer-to-method type, and we just made a copy,
546 then we need to unshare the record that holds the cached
547 pointer-to-member-function type, because these will be distinct
548 between the unqualified and qualified types. */
550 && TREE_CODE (type) == POINTER_TYPE
551 && TREE_CODE (TREE_TYPE (type)) == METHOD_TYPE)
552 TYPE_LANG_SPECIFIC (result) = NULL;
557 /* Returns the canonical version of TYPE. In other words, if TYPE is
558 a typedef, returns the underlying type. The cv-qualification of
559 the type returned matches the type input; they will always be
563 canonical_type_variant (tree t)
565 return cp_build_qualified_type (TYPE_MAIN_VARIANT (t), cp_type_quals (t));
568 /* Makes a copy of BINFO and TYPE, which is to be inherited into a
569 graph dominated by T. If BINFO is NULL, TYPE is a dependent base,
570 and we do a shallow copy. If BINFO is non-NULL, we do a deep copy.
571 VIRT indicates whether TYPE is inherited virtually or not.
572 IGO_PREV points at the previous binfo of the inheritance graph
573 order chain. The newly copied binfo's TREE_CHAIN forms this
576 The CLASSTYPE_VBASECLASSES vector of T is constructed in the
577 correct order. That is in the order the bases themselves should be
580 The BINFO_INHERITANCE of a virtual base class points to the binfo
581 of the most derived type. ??? We could probably change this so that
582 BINFO_INHERITANCE becomes synonymous with BINFO_PRIMARY, and hence
583 remove a field. They currently can only differ for primary virtual
587 copy_binfo (tree binfo, tree type, tree t, tree *igo_prev, int virt)
593 /* See if we've already made this virtual base. */
594 new_binfo = binfo_for_vbase (type, t);
599 new_binfo = make_tree_binfo (binfo ? BINFO_N_BASE_BINFOS (binfo) : 0);
600 BINFO_TYPE (new_binfo) = type;
602 /* Chain it into the inheritance graph. */
603 TREE_CHAIN (*igo_prev) = new_binfo;
604 *igo_prev = new_binfo;
611 gcc_assert (!BINFO_DEPENDENT_BASE_P (binfo));
612 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), type));
614 BINFO_OFFSET (new_binfo) = BINFO_OFFSET (binfo);
615 BINFO_VIRTUALS (new_binfo) = BINFO_VIRTUALS (binfo);
617 /* We do not need to copy the accesses, as they are read only. */
618 BINFO_BASE_ACCESSES (new_binfo) = BINFO_BASE_ACCESSES (binfo);
620 /* Recursively copy base binfos of BINFO. */
621 for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++)
625 gcc_assert (!BINFO_DEPENDENT_BASE_P (base_binfo));
626 new_base_binfo = copy_binfo (base_binfo, BINFO_TYPE (base_binfo),
628 BINFO_VIRTUAL_P (base_binfo));
630 if (!BINFO_INHERITANCE_CHAIN (new_base_binfo))
631 BINFO_INHERITANCE_CHAIN (new_base_binfo) = new_binfo;
632 BINFO_BASE_APPEND (new_binfo, new_base_binfo);
636 BINFO_DEPENDENT_BASE_P (new_binfo) = 1;
640 /* Push it onto the list after any virtual bases it contains
641 will have been pushed. */
642 VEC_quick_push (tree, CLASSTYPE_VBASECLASSES (t), new_binfo);
643 BINFO_VIRTUAL_P (new_binfo) = 1;
644 BINFO_INHERITANCE_CHAIN (new_binfo) = TYPE_BINFO (t);
650 /* Hashing of lists so that we don't make duplicates.
651 The entry point is `list_hash_canon'. */
653 /* Now here is the hash table. When recording a list, it is added
654 to the slot whose index is the hash code mod the table size.
655 Note that the hash table is used for several kinds of lists.
656 While all these live in the same table, they are completely independent,
657 and the hash code is computed differently for each of these. */
659 static GTY ((param_is (union tree_node))) htab_t list_hash_table;
668 /* Compare ENTRY (an entry in the hash table) with DATA (a list_proxy
669 for a node we are thinking about adding). */
672 list_hash_eq (const void* entry, const void* data)
674 tree t = (tree) entry;
675 struct list_proxy *proxy = (struct list_proxy *) data;
677 return (TREE_VALUE (t) == proxy->value
678 && TREE_PURPOSE (t) == proxy->purpose
679 && TREE_CHAIN (t) == proxy->chain);
682 /* Compute a hash code for a list (chain of TREE_LIST nodes
683 with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the
684 TREE_COMMON slots), by adding the hash codes of the individual entries. */
687 list_hash_pieces (tree purpose, tree value, tree chain)
689 hashval_t hashcode = 0;
692 hashcode += TREE_HASH (chain);
695 hashcode += TREE_HASH (value);
699 hashcode += TREE_HASH (purpose);
705 /* Hash an already existing TREE_LIST. */
708 list_hash (const void* p)
711 return list_hash_pieces (TREE_PURPOSE (t),
716 /* Given list components PURPOSE, VALUE, AND CHAIN, return the canonical
717 object for an identical list if one already exists. Otherwise, build a
718 new one, and record it as the canonical object. */
721 hash_tree_cons (tree purpose, tree value, tree chain)
725 struct list_proxy proxy;
727 /* Hash the list node. */
728 hashcode = list_hash_pieces (purpose, value, chain);
729 /* Create a proxy for the TREE_LIST we would like to create. We
730 don't actually create it so as to avoid creating garbage. */
731 proxy.purpose = purpose;
734 /* See if it is already in the table. */
735 slot = htab_find_slot_with_hash (list_hash_table, &proxy, hashcode,
737 /* If not, create a new node. */
739 *slot = tree_cons (purpose, value, chain);
743 /* Constructor for hashed lists. */
746 hash_tree_chain (tree value, tree chain)
748 return hash_tree_cons (NULL_TREE, value, chain);
752 debug_binfo (tree elem)
757 fprintf (stderr, "type \"%s\", offset = " HOST_WIDE_INT_PRINT_DEC
759 TYPE_NAME_STRING (BINFO_TYPE (elem)),
760 TREE_INT_CST_LOW (BINFO_OFFSET (elem)));
761 debug_tree (BINFO_TYPE (elem));
762 if (BINFO_VTABLE (elem))
763 fprintf (stderr, "vtable decl \"%s\"\n",
764 IDENTIFIER_POINTER (DECL_NAME (get_vtbl_decl_for_binfo (elem))));
766 fprintf (stderr, "no vtable decl yet\n");
767 fprintf (stderr, "virtuals:\n");
768 virtuals = BINFO_VIRTUALS (elem);
773 tree fndecl = TREE_VALUE (virtuals);
774 fprintf (stderr, "%s [%ld =? %ld]\n",
775 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl)),
776 (long) n, (long) TREE_INT_CST_LOW (DECL_VINDEX (fndecl)));
778 virtuals = TREE_CHAIN (virtuals);
783 is_overloaded_fn (tree x)
785 /* A baselink is also considered an overloaded function. */
786 if (TREE_CODE (x) == OFFSET_REF)
787 x = TREE_OPERAND (x, 1);
789 x = BASELINK_FUNCTIONS (x);
790 return (TREE_CODE (x) == FUNCTION_DECL
791 || TREE_CODE (x) == TEMPLATE_ID_EXPR
792 || DECL_FUNCTION_TEMPLATE_P (x)
793 || TREE_CODE (x) == OVERLOAD);
797 really_overloaded_fn (tree x)
799 /* A baselink is also considered an overloaded function. */
800 if (TREE_CODE (x) == OFFSET_REF)
801 x = TREE_OPERAND (x, 1);
803 x = BASELINK_FUNCTIONS (x);
805 return ((TREE_CODE (x) == OVERLOAD && OVL_CHAIN (x))
806 || DECL_FUNCTION_TEMPLATE_P (OVL_CURRENT (x))
807 || TREE_CODE (x) == TEMPLATE_ID_EXPR);
811 get_first_fn (tree from)
813 gcc_assert (is_overloaded_fn (from));
814 /* A baselink is also considered an overloaded function. */
815 if (BASELINK_P (from))
816 from = BASELINK_FUNCTIONS (from);
817 return OVL_CURRENT (from);
820 /* Return a new OVL node, concatenating it with the old one. */
823 ovl_cons (tree decl, tree chain)
825 tree result = make_node (OVERLOAD);
826 TREE_TYPE (result) = unknown_type_node;
827 OVL_FUNCTION (result) = decl;
828 TREE_CHAIN (result) = chain;
833 /* Build a new overloaded function. If this is the first one,
834 just return it; otherwise, ovl_cons the _DECLs */
837 build_overload (tree decl, tree chain)
839 if (! chain && TREE_CODE (decl) != TEMPLATE_DECL)
841 if (chain && TREE_CODE (chain) != OVERLOAD)
842 chain = ovl_cons (chain, NULL_TREE);
843 return ovl_cons (decl, chain);
847 #define PRINT_RING_SIZE 4
850 cxx_printable_name (tree decl, int v)
852 static tree decl_ring[PRINT_RING_SIZE];
853 static char *print_ring[PRINT_RING_SIZE];
854 static int ring_counter;
857 /* Only cache functions. */
859 || TREE_CODE (decl) != FUNCTION_DECL
860 || DECL_LANG_SPECIFIC (decl) == 0)
861 return lang_decl_name (decl, v);
863 /* See if this print name is lying around. */
864 for (i = 0; i < PRINT_RING_SIZE; i++)
865 if (decl_ring[i] == decl)
866 /* yes, so return it. */
867 return print_ring[i];
869 if (++ring_counter == PRINT_RING_SIZE)
872 if (current_function_decl != NULL_TREE)
874 if (decl_ring[ring_counter] == current_function_decl)
876 if (ring_counter == PRINT_RING_SIZE)
878 gcc_assert (decl_ring[ring_counter] != current_function_decl);
881 if (print_ring[ring_counter])
882 free (print_ring[ring_counter]);
884 print_ring[ring_counter] = xstrdup (lang_decl_name (decl, v));
885 decl_ring[ring_counter] = decl;
886 return print_ring[ring_counter];
889 /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions
893 build_exception_variant (tree type, tree raises)
895 tree v = TYPE_MAIN_VARIANT (type);
896 int type_quals = TYPE_QUALS (type);
898 for (; v; v = TYPE_NEXT_VARIANT (v))
899 if (check_qualified_type (v, type, type_quals)
900 && comp_except_specs (raises, TYPE_RAISES_EXCEPTIONS (v), 1))
903 /* Need to build a new variant. */
904 v = build_variant_type_copy (type);
905 TYPE_RAISES_EXCEPTIONS (v) = raises;
909 /* Given a TEMPLATE_TEMPLATE_PARM node T, create a new
910 BOUND_TEMPLATE_TEMPLATE_PARM bound with NEWARGS as its template
914 bind_template_template_parm (tree t, tree newargs)
916 tree decl = TYPE_NAME (t);
919 t2 = make_aggr_type (BOUND_TEMPLATE_TEMPLATE_PARM);
920 decl = build_decl (TYPE_DECL, DECL_NAME (decl), NULL_TREE);
922 /* These nodes have to be created to reflect new TYPE_DECL and template
924 TEMPLATE_TYPE_PARM_INDEX (t2) = copy_node (TEMPLATE_TYPE_PARM_INDEX (t));
925 TEMPLATE_PARM_DECL (TEMPLATE_TYPE_PARM_INDEX (t2)) = decl;
926 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2)
927 = tree_cons (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t),
930 TREE_TYPE (decl) = t2;
931 TYPE_NAME (t2) = decl;
932 TYPE_STUB_DECL (t2) = decl;
938 /* Called from count_trees via walk_tree. */
941 count_trees_r (tree *tp, int *walk_subtrees, void *data)
951 /* Debugging function for measuring the rough complexity of a tree
958 walk_tree_without_duplicates (&t, count_trees_r, &n_trees);
962 /* Called from verify_stmt_tree via walk_tree. */
965 verify_stmt_tree_r (tree* tp,
966 int* walk_subtrees ATTRIBUTE_UNUSED ,
970 htab_t *statements = (htab_t *) data;
973 if (!STATEMENT_CODE_P (TREE_CODE (t)))
976 /* If this statement is already present in the hash table, then
977 there is a circularity in the statement tree. */
978 gcc_assert (!htab_find (*statements, t));
980 slot = htab_find_slot (*statements, t, INSERT);
986 /* Debugging function to check that the statement T has not been
987 corrupted. For now, this function simply checks that T contains no
991 verify_stmt_tree (tree t)
994 statements = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
995 walk_tree (&t, verify_stmt_tree_r, &statements, NULL);
996 htab_delete (statements);
999 /* Called from find_tree via walk_tree. */
1002 find_tree_r (tree* tp,
1003 int* walk_subtrees ATTRIBUTE_UNUSED ,
1006 if (*tp == (tree) data)
1012 /* Returns X if X appears in the tree structure rooted at T. */
1015 find_tree (tree t, tree x)
1017 return walk_tree_without_duplicates (&t, find_tree_r, x);
1020 /* Check if the type T depends on a type with no linkage and if so, return
1021 it. If RELAXED_P then do not consider a class type declared within
1022 a TREE_PUBLIC function to have no linkage. */
1025 no_linkage_check (tree t, bool relaxed_p)
1029 /* There's no point in checking linkage on template functions; we
1030 can't know their complete types. */
1031 if (processing_template_decl)
1034 switch (TREE_CODE (t))
1039 if (TYPE_PTRMEMFUNC_P (t))
1043 if (!CLASS_TYPE_P (t))
1047 if (TYPE_ANONYMOUS_P (t))
1049 fn = decl_function_context (TYPE_MAIN_DECL (t));
1050 if (fn && (!relaxed_p || !TREE_PUBLIC (fn)))
1056 case REFERENCE_TYPE:
1057 return no_linkage_check (TREE_TYPE (t), relaxed_p);
1061 r = no_linkage_check (TYPE_PTRMEM_POINTED_TO_TYPE (t),
1065 return no_linkage_check (TYPE_PTRMEM_CLASS_TYPE (t), relaxed_p);
1068 r = no_linkage_check (TYPE_METHOD_BASETYPE (t), relaxed_p);
1075 for (parm = TYPE_ARG_TYPES (t);
1076 parm && parm != void_list_node;
1077 parm = TREE_CHAIN (parm))
1079 r = no_linkage_check (TREE_VALUE (parm), relaxed_p);
1083 return no_linkage_check (TREE_TYPE (t), relaxed_p);
1091 #ifdef GATHER_STATISTICS
1092 extern int depth_reached;
1096 cxx_print_statistics (void)
1098 print_search_statistics ();
1099 print_class_statistics ();
1100 #ifdef GATHER_STATISTICS
1101 fprintf (stderr, "maximum template instantiation depth reached: %d\n",
1106 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1107 (which is an ARRAY_TYPE). This counts only elements of the top
1111 array_type_nelts_top (tree type)
1113 return fold (build2 (PLUS_EXPR, sizetype,
1114 array_type_nelts (type),
1118 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1119 (which is an ARRAY_TYPE). This one is a recursive count of all
1120 ARRAY_TYPEs that are clumped together. */
1123 array_type_nelts_total (tree type)
1125 tree sz = array_type_nelts_top (type);
1126 type = TREE_TYPE (type);
1127 while (TREE_CODE (type) == ARRAY_TYPE)
1129 tree n = array_type_nelts_top (type);
1130 sz = fold (build2 (MULT_EXPR, sizetype, sz, n));
1131 type = TREE_TYPE (type);
1136 /* Called from break_out_target_exprs via mapcar. */
1139 bot_manip (tree* tp, int* walk_subtrees, void* data)
1141 splay_tree target_remap = ((splay_tree) data);
1144 if (!TYPE_P (t) && TREE_CONSTANT (t))
1146 /* There can't be any TARGET_EXPRs or their slot variables below
1147 this point. We used to check !TREE_SIDE_EFFECTS, but then we
1148 failed to copy an ADDR_EXPR of the slot VAR_DECL. */
1152 if (TREE_CODE (t) == TARGET_EXPR)
1156 if (TREE_CODE (TREE_OPERAND (t, 1)) == AGGR_INIT_EXPR)
1158 mark_used (TREE_OPERAND (TREE_OPERAND (TREE_OPERAND (t, 1), 0), 0));
1160 (TREE_TYPE (t), break_out_target_exprs (TREE_OPERAND (t, 1)));
1164 u = build_target_expr_with_type
1165 (break_out_target_exprs (TREE_OPERAND (t, 1)), TREE_TYPE (t));
1168 /* Map the old variable to the new one. */
1169 splay_tree_insert (target_remap,
1170 (splay_tree_key) TREE_OPERAND (t, 0),
1171 (splay_tree_value) TREE_OPERAND (u, 0));
1173 /* Replace the old expression with the new version. */
1175 /* We don't have to go below this point; the recursive call to
1176 break_out_target_exprs will have handled anything below this
1181 else if (TREE_CODE (t) == CALL_EXPR)
1182 mark_used (TREE_OPERAND (TREE_OPERAND (t, 0), 0));
1184 /* Make a copy of this node. */
1185 return copy_tree_r (tp, walk_subtrees, NULL);
1188 /* Replace all remapped VAR_DECLs in T with their new equivalents.
1189 DATA is really a splay-tree mapping old variables to new
1193 bot_replace (tree* t,
1194 int* walk_subtrees ATTRIBUTE_UNUSED ,
1197 splay_tree target_remap = ((splay_tree) data);
1199 if (TREE_CODE (*t) == VAR_DECL)
1201 splay_tree_node n = splay_tree_lookup (target_remap,
1202 (splay_tree_key) *t);
1204 *t = (tree) n->value;
1210 /* When we parse a default argument expression, we may create
1211 temporary variables via TARGET_EXPRs. When we actually use the
1212 default-argument expression, we make a copy of the expression, but
1213 we must replace the temporaries with appropriate local versions. */
1216 break_out_target_exprs (tree t)
1218 static int target_remap_count;
1219 static splay_tree target_remap;
1221 if (!target_remap_count++)
1222 target_remap = splay_tree_new (splay_tree_compare_pointers,
1223 /*splay_tree_delete_key_fn=*/NULL,
1224 /*splay_tree_delete_value_fn=*/NULL);
1225 walk_tree (&t, bot_manip, target_remap, NULL);
1226 walk_tree (&t, bot_replace, target_remap, NULL);
1228 if (!--target_remap_count)
1230 splay_tree_delete (target_remap);
1231 target_remap = NULL;
1237 /* Similar to `build_nt', but for template definitions of dependent
1241 build_min_nt (enum tree_code code, ...)
1250 t = make_node (code);
1251 length = TREE_CODE_LENGTH (code);
1253 for (i = 0; i < length; i++)
1255 tree x = va_arg (p, tree);
1256 TREE_OPERAND (t, i) = x;
1263 /* Similar to `build', but for template definitions. */
1266 build_min (enum tree_code code, tree tt, ...)
1275 t = make_node (code);
1276 length = TREE_CODE_LENGTH (code);
1279 for (i = 0; i < length; i++)
1281 tree x = va_arg (p, tree);
1282 TREE_OPERAND (t, i) = x;
1283 if (x && !TYPE_P (x) && TREE_SIDE_EFFECTS (x))
1284 TREE_SIDE_EFFECTS (t) = 1;
1291 /* Similar to `build', but for template definitions of non-dependent
1292 expressions. NON_DEP is the non-dependent expression that has been
1296 build_min_non_dep (enum tree_code code, tree non_dep, ...)
1303 va_start (p, non_dep);
1305 t = make_node (code);
1306 length = TREE_CODE_LENGTH (code);
1307 TREE_TYPE (t) = TREE_TYPE (non_dep);
1308 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (non_dep);
1310 for (i = 0; i < length; i++)
1312 tree x = va_arg (p, tree);
1313 TREE_OPERAND (t, i) = x;
1316 if (code == COMPOUND_EXPR && TREE_CODE (non_dep) != COMPOUND_EXPR)
1317 /* This should not be considered a COMPOUND_EXPR, because it
1318 resolves to an overload. */
1319 COMPOUND_EXPR_OVERLOADED (t) = 1;
1326 get_type_decl (tree t)
1328 if (TREE_CODE (t) == TYPE_DECL)
1331 return TYPE_STUB_DECL (t);
1332 gcc_assert (t == error_mark_node);
1336 /* Returns the namespace that contains DECL, whether directly or
1340 decl_namespace_context (tree decl)
1344 if (TREE_CODE (decl) == NAMESPACE_DECL)
1346 else if (TYPE_P (decl))
1347 decl = CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl));
1349 decl = CP_DECL_CONTEXT (decl);
1353 /* Return truthvalue of whether T1 is the same tree structure as T2.
1354 Return 1 if they are the same. Return 0 if they are different. */
1357 cp_tree_equal (tree t1, tree t2)
1359 enum tree_code code1, code2;
1366 for (code1 = TREE_CODE (t1);
1367 code1 == NOP_EXPR || code1 == CONVERT_EXPR
1368 || code1 == NON_LVALUE_EXPR;
1369 code1 = TREE_CODE (t1))
1370 t1 = TREE_OPERAND (t1, 0);
1371 for (code2 = TREE_CODE (t2);
1372 code2 == NOP_EXPR || code2 == CONVERT_EXPR
1373 || code1 == NON_LVALUE_EXPR;
1374 code2 = TREE_CODE (t2))
1375 t2 = TREE_OPERAND (t2, 0);
1377 /* They might have become equal now. */
1387 return TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
1388 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2);
1391 return REAL_VALUES_EQUAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
1394 return TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
1395 && !memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
1396 TREE_STRING_LENGTH (t1));
1399 /* We need to do this when determining whether or not two
1400 non-type pointer to member function template arguments
1402 if (!(same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
1403 /* The first operand is RTL. */
1404 && TREE_OPERAND (t1, 0) == TREE_OPERAND (t2, 0)))
1406 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1409 if (!cp_tree_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2)))
1411 if (!cp_tree_equal (TREE_VALUE (t1), TREE_VALUE (t2)))
1413 return cp_tree_equal (TREE_CHAIN (t1), TREE_CHAIN (t2));
1416 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1419 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1421 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1425 tree o1 = TREE_OPERAND (t1, 0);
1426 tree o2 = TREE_OPERAND (t2, 0);
1428 /* Special case: if either target is an unallocated VAR_DECL,
1429 it means that it's going to be unified with whatever the
1430 TARGET_EXPR is really supposed to initialize, so treat it
1431 as being equivalent to anything. */
1432 if (TREE_CODE (o1) == VAR_DECL && DECL_NAME (o1) == NULL_TREE
1433 && !DECL_RTL_SET_P (o1))
1435 else if (TREE_CODE (o2) == VAR_DECL && DECL_NAME (o2) == NULL_TREE
1436 && !DECL_RTL_SET_P (o2))
1438 else if (!cp_tree_equal (o1, o2))
1441 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1444 case WITH_CLEANUP_EXPR:
1445 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1447 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
1450 if (TREE_OPERAND (t1, 1) != TREE_OPERAND (t2, 1))
1452 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1459 case IDENTIFIER_NODE:
1464 return (BASELINK_BINFO (t1) == BASELINK_BINFO (t2)
1465 && BASELINK_ACCESS_BINFO (t1) == BASELINK_ACCESS_BINFO (t2)
1466 && cp_tree_equal (BASELINK_FUNCTIONS (t1),
1467 BASELINK_FUNCTIONS (t2)));
1469 case TEMPLATE_PARM_INDEX:
1470 return (TEMPLATE_PARM_IDX (t1) == TEMPLATE_PARM_IDX (t2)
1471 && TEMPLATE_PARM_LEVEL (t1) == TEMPLATE_PARM_LEVEL (t2)
1472 && same_type_p (TREE_TYPE (TEMPLATE_PARM_DECL (t1)),
1473 TREE_TYPE (TEMPLATE_PARM_DECL (t2))));
1475 case TEMPLATE_ID_EXPR:
1480 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1482 vec1 = TREE_OPERAND (t1, 1);
1483 vec2 = TREE_OPERAND (t2, 1);
1486 return !vec1 && !vec2;
1488 if (TREE_VEC_LENGTH (vec1) != TREE_VEC_LENGTH (vec2))
1491 for (ix = TREE_VEC_LENGTH (vec1); ix--;)
1492 if (!cp_tree_equal (TREE_VEC_ELT (vec1, ix),
1493 TREE_VEC_ELT (vec2, ix)))
1502 tree o1 = TREE_OPERAND (t1, 0);
1503 tree o2 = TREE_OPERAND (t2, 0);
1505 if (TREE_CODE (o1) != TREE_CODE (o2))
1508 return same_type_p (o1, o2);
1510 return cp_tree_equal (o1, o2);
1514 /* Two pointer-to-members are the same if they point to the same
1515 field or function in the same class. */
1516 if (PTRMEM_CST_MEMBER (t1) != PTRMEM_CST_MEMBER (t2))
1519 return same_type_p (PTRMEM_CST_CLASS (t1), PTRMEM_CST_CLASS (t2));
1522 if (OVL_FUNCTION (t1) != OVL_FUNCTION (t2))
1524 return cp_tree_equal (OVL_CHAIN (t1), OVL_CHAIN (t2));
1530 switch (TREE_CODE_CLASS (code1))
1534 case tcc_comparison:
1535 case tcc_expression:
1541 for (i = 0; i < TREE_CODE_LENGTH (code1); ++i)
1542 if (!cp_tree_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i)))
1549 return same_type_p (t1, t2);
1553 /* We can get here with --disable-checking. */
1557 /* The type of ARG when used as an lvalue. */
1560 lvalue_type (tree arg)
1562 tree type = TREE_TYPE (arg);
1566 /* The type of ARG for printing error messages; denote lvalues with
1570 error_type (tree arg)
1572 tree type = TREE_TYPE (arg);
1574 if (TREE_CODE (type) == ARRAY_TYPE)
1576 else if (TREE_CODE (type) == ERROR_MARK)
1578 else if (real_lvalue_p (arg))
1579 type = build_reference_type (lvalue_type (arg));
1580 else if (IS_AGGR_TYPE (type))
1581 type = lvalue_type (arg);
1586 /* Does FUNCTION use a variable-length argument list? */
1589 varargs_function_p (tree function)
1591 tree parm = TYPE_ARG_TYPES (TREE_TYPE (function));
1592 for (; parm; parm = TREE_CHAIN (parm))
1593 if (TREE_VALUE (parm) == void_type_node)
1598 /* Returns 1 if decl is a member of a class. */
1601 member_p (tree decl)
1603 const tree ctx = DECL_CONTEXT (decl);
1604 return (ctx && TYPE_P (ctx));
1607 /* Create a placeholder for member access where we don't actually have an
1608 object that the access is against. */
1611 build_dummy_object (tree type)
1613 tree decl = build1 (NOP_EXPR, build_pointer_type (type), void_zero_node);
1614 return build_indirect_ref (decl, NULL);
1617 /* We've gotten a reference to a member of TYPE. Return *this if appropriate,
1618 or a dummy object otherwise. If BINFOP is non-0, it is filled with the
1619 binfo path from current_class_type to TYPE, or 0. */
1622 maybe_dummy_object (tree type, tree* binfop)
1627 if (current_class_type
1628 && (binfo = lookup_base (current_class_type, type,
1629 ba_unique | ba_quiet, NULL)))
1630 context = current_class_type;
1633 /* Reference from a nested class member function. */
1635 binfo = TYPE_BINFO (type);
1641 if (current_class_ref && context == current_class_type
1642 /* Kludge: Make sure that current_class_type is actually
1643 correct. It might not be if we're in the middle of
1644 tsubst_default_argument. */
1645 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref)),
1646 current_class_type))
1647 decl = current_class_ref;
1649 decl = build_dummy_object (context);
1654 /* Returns 1 if OB is a placeholder object, or a pointer to one. */
1657 is_dummy_object (tree ob)
1659 if (TREE_CODE (ob) == INDIRECT_REF)
1660 ob = TREE_OPERAND (ob, 0);
1661 return (TREE_CODE (ob) == NOP_EXPR
1662 && TREE_OPERAND (ob, 0) == void_zero_node);
1665 /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */
1670 t = strip_array_types (t);
1672 if (t == error_mark_node)
1674 if (INTEGRAL_TYPE_P (t))
1675 return 1; /* integral, character or enumeral type */
1676 if (FLOAT_TYPE_P (t))
1679 return 1; /* pointer to non-member */
1680 if (TYPE_PTR_TO_MEMBER_P (t))
1681 return 1; /* pointer to member */
1683 if (TREE_CODE (t) == VECTOR_TYPE)
1684 return 1; /* vectors are (small) arrays of scalars */
1686 if (! CLASS_TYPE_P (t))
1687 return 0; /* other non-class type (reference or function) */
1688 if (CLASSTYPE_NON_POD_P (t))
1693 /* Returns 1 iff zero initialization of type T means actually storing
1697 zero_init_p (tree t)
1699 t = strip_array_types (t);
1701 if (t == error_mark_node)
1704 /* NULL pointers to data members are initialized with -1. */
1705 if (TYPE_PTRMEM_P (t))
1708 /* Classes that contain types that can't be zero-initialized, cannot
1709 be zero-initialized themselves. */
1710 if (CLASS_TYPE_P (t) && CLASSTYPE_NON_ZERO_INIT_P (t))
1716 /* Table of valid C++ attributes. */
1717 const struct attribute_spec cxx_attribute_table[] =
1719 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
1720 { "java_interface", 0, 0, false, false, false, handle_java_interface_attribute },
1721 { "com_interface", 0, 0, false, false, false, handle_com_interface_attribute },
1722 { "init_priority", 1, 1, true, false, false, handle_init_priority_attribute },
1723 { NULL, 0, 0, false, false, false, NULL }
1726 /* Handle a "java_interface" attribute; arguments as in
1727 struct attribute_spec.handler. */
1729 handle_java_interface_attribute (tree* node,
1731 tree args ATTRIBUTE_UNUSED ,
1736 || !CLASS_TYPE_P (*node)
1737 || !TYPE_FOR_JAVA (*node))
1739 error ("%qE attribute can only be applied to Java class definitions",
1741 *no_add_attrs = true;
1744 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
1745 *node = build_variant_type_copy (*node);
1746 TYPE_JAVA_INTERFACE (*node) = 1;
1751 /* Handle a "com_interface" attribute; arguments as in
1752 struct attribute_spec.handler. */
1754 handle_com_interface_attribute (tree* node,
1756 tree args ATTRIBUTE_UNUSED ,
1757 int flags ATTRIBUTE_UNUSED ,
1762 *no_add_attrs = true;
1765 || !CLASS_TYPE_P (*node)
1766 || *node != TYPE_MAIN_VARIANT (*node))
1768 warning ("%qE attribute can only be applied to class definitions", name);
1773 warning ("%qE is obsolete; g++ vtables are now COM-compatible by default",
1779 /* Handle an "init_priority" attribute; arguments as in
1780 struct attribute_spec.handler. */
1782 handle_init_priority_attribute (tree* node,
1785 int flags ATTRIBUTE_UNUSED ,
1788 tree initp_expr = TREE_VALUE (args);
1790 tree type = TREE_TYPE (decl);
1793 STRIP_NOPS (initp_expr);
1795 if (!initp_expr || TREE_CODE (initp_expr) != INTEGER_CST)
1797 error ("requested init_priority is not an integer constant");
1798 *no_add_attrs = true;
1802 pri = TREE_INT_CST_LOW (initp_expr);
1804 type = strip_array_types (type);
1806 if (decl == NULL_TREE
1807 || TREE_CODE (decl) != VAR_DECL
1808 || !TREE_STATIC (decl)
1809 || DECL_EXTERNAL (decl)
1810 || (TREE_CODE (type) != RECORD_TYPE
1811 && TREE_CODE (type) != UNION_TYPE)
1812 /* Static objects in functions are initialized the
1813 first time control passes through that
1814 function. This is not precise enough to pin down an
1815 init_priority value, so don't allow it. */
1816 || current_function_decl)
1818 error ("can only use %qE attribute on file-scope definitions "
1819 "of objects of class type", name);
1820 *no_add_attrs = true;
1824 if (pri > MAX_INIT_PRIORITY || pri <= 0)
1826 error ("requested init_priority is out of range");
1827 *no_add_attrs = true;
1831 /* Check for init_priorities that are reserved for
1832 language and runtime support implementations.*/
1833 if (pri <= MAX_RESERVED_INIT_PRIORITY)
1836 ("requested init_priority is reserved for internal use");
1839 if (SUPPORTS_INIT_PRIORITY)
1841 DECL_INIT_PRIORITY (decl) = pri;
1846 error ("%qE attribute is not supported on this platform", name);
1847 *no_add_attrs = true;
1852 /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the
1853 thing pointed to by the constant. */
1856 make_ptrmem_cst (tree type, tree member)
1858 tree ptrmem_cst = make_node (PTRMEM_CST);
1859 TREE_TYPE (ptrmem_cst) = type;
1860 PTRMEM_CST_MEMBER (ptrmem_cst) = member;
1864 /* Build a variant of TYPE that has the indicated ATTRIBUTES. May
1865 return an existing type of an appropriate type already exists. */
1868 cp_build_type_attribute_variant (tree type, tree attributes)
1872 new_type = build_type_attribute_variant (type, attributes);
1873 if (TREE_CODE (new_type) == FUNCTION_TYPE
1874 && (TYPE_RAISES_EXCEPTIONS (new_type)
1875 != TYPE_RAISES_EXCEPTIONS (type)))
1876 new_type = build_exception_variant (new_type,
1877 TYPE_RAISES_EXCEPTIONS (type));
1881 /* Apply FUNC to all language-specific sub-trees of TP in a pre-order
1882 traversal. Called from walk_tree. */
1885 cp_walk_subtrees (tree *tp, int *walk_subtrees_p, walk_tree_fn func,
1886 void *data, struct pointer_set_t *pset)
1888 enum tree_code code = TREE_CODE (*tp);
1889 location_t save_locus;
1892 #define WALK_SUBTREE(NODE) \
1895 result = walk_tree (&(NODE), func, data, pset); \
1896 if (result) goto out; \
1900 /* Set input_location here so we get the right instantiation context
1901 if we call instantiate_decl from inlinable_function_p. */
1902 save_locus = input_location;
1903 if (EXPR_HAS_LOCATION (*tp))
1904 input_location = EXPR_LOCATION (*tp);
1906 /* Not one of the easy cases. We must explicitly go through the
1912 case TEMPLATE_TEMPLATE_PARM:
1913 case BOUND_TEMPLATE_TEMPLATE_PARM:
1914 case UNBOUND_CLASS_TEMPLATE:
1915 case TEMPLATE_PARM_INDEX:
1916 case TEMPLATE_TYPE_PARM:
1920 /* None of these have subtrees other than those already walked
1922 *walk_subtrees_p = 0;
1926 WALK_SUBTREE (TINST_DECL (*tp));
1927 *walk_subtrees_p = 0;
1931 WALK_SUBTREE (TREE_TYPE (*tp));
1932 *walk_subtrees_p = 0;
1936 WALK_SUBTREE (TREE_PURPOSE (*tp));
1940 WALK_SUBTREE (OVL_FUNCTION (*tp));
1941 WALK_SUBTREE (OVL_CHAIN (*tp));
1942 *walk_subtrees_p = 0;
1946 if (TYPE_PTRMEMFUNC_P (*tp))
1947 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (*tp));
1951 input_location = save_locus;
1955 /* We didn't find what we were looking for. */
1957 input_location = save_locus;
1963 /* Decide whether there are language-specific reasons to not inline a
1964 function as a tree. */
1967 cp_cannot_inline_tree_fn (tree* fnp)
1971 /* We can inline a template instantiation only if it's fully
1973 if (DECL_TEMPLATE_INFO (fn)
1974 && TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (fn)))
1976 /* Don't instantiate functions that are not going to be
1978 if (!DECL_INLINE (DECL_TEMPLATE_RESULT
1979 (template_for_substitution (fn))))
1982 fn = *fnp = instantiate_decl (fn, /*defer_ok=*/0, /*undefined_ok=*/0);
1984 if (TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (fn)))
1988 if (flag_really_no_inline
1989 && lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)) == NULL)
1992 /* Don't auto-inline anything that might not be bound within
1993 this unit of translation.
1994 Exclude comdat functions from this rule. While they can be bound
1995 to the other unit, they all must be the same. This is especially
1996 important so templates can inline. */
1997 if (!DECL_DECLARED_INLINE_P (fn) && !(*targetm.binds_local_p) (fn)
1998 && !DECL_COMDAT (fn))
2000 DECL_UNINLINABLE (fn) = 1;
2004 if (varargs_function_p (fn))
2006 DECL_UNINLINABLE (fn) = 1;
2010 if (! function_attribute_inlinable_p (fn))
2012 DECL_UNINLINABLE (fn) = 1;
2019 /* Add any pending functions other than the current function (already
2020 handled by the caller), that thus cannot be inlined, to FNS_P, then
2021 return the latest function added to the array, PREV_FN. */
2024 cp_add_pending_fn_decls (void* fns_p, tree prev_fn)
2026 varray_type *fnsp = (varray_type *)fns_p;
2027 struct saved_scope *s;
2029 for (s = scope_chain; s; s = s->prev)
2030 if (s->function_decl && s->function_decl != prev_fn)
2032 VARRAY_PUSH_TREE (*fnsp, s->function_decl);
2033 prev_fn = s->function_decl;
2039 /* Determine whether VAR is a declaration of an automatic variable in
2043 cp_auto_var_in_fn_p (tree var, tree fn)
2045 return (DECL_P (var) && DECL_CONTEXT (var) == fn
2046 && nonstatic_local_decl_p (var));
2049 /* Initialize tree.c. */
2054 list_hash_table = htab_create_ggc (31, list_hash, list_hash_eq, NULL);
2057 /* Returns the kind of special function that DECL (a FUNCTION_DECL)
2058 is. Note that sfk_none is zero, so this function can be used as a
2059 predicate to test whether or not DECL is a special function. */
2061 special_function_kind
2062 special_function_p (tree decl)
2064 /* Rather than doing all this stuff with magic names, we should
2065 probably have a field of type `special_function_kind' in
2066 DECL_LANG_SPECIFIC. */
2067 if (DECL_COPY_CONSTRUCTOR_P (decl))
2068 return sfk_copy_constructor;
2069 if (DECL_CONSTRUCTOR_P (decl))
2070 return sfk_constructor;
2071 if (DECL_OVERLOADED_OPERATOR_P (decl) == NOP_EXPR)
2072 return sfk_assignment_operator;
2073 if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl))
2074 return sfk_destructor;
2075 if (DECL_COMPLETE_DESTRUCTOR_P (decl))
2076 return sfk_complete_destructor;
2077 if (DECL_BASE_DESTRUCTOR_P (decl))
2078 return sfk_base_destructor;
2079 if (DECL_DELETING_DESTRUCTOR_P (decl))
2080 return sfk_deleting_destructor;
2081 if (DECL_CONV_FN_P (decl))
2082 return sfk_conversion;
2087 /* Returns nonzero if TYPE is a character type, including wchar_t. */
2090 char_type_p (tree type)
2092 return (same_type_p (type, char_type_node)
2093 || same_type_p (type, unsigned_char_type_node)
2094 || same_type_p (type, signed_char_type_node)
2095 || same_type_p (type, wchar_type_node));
2098 /* Returns the kind of linkage associated with the indicated DECL. Th
2099 value returned is as specified by the language standard; it is
2100 independent of implementation details regarding template
2101 instantiation, etc. For example, it is possible that a declaration
2102 to which this function assigns external linkage would not show up
2103 as a global symbol when you run `nm' on the resulting object file. */
2106 decl_linkage (tree decl)
2108 /* This function doesn't attempt to calculate the linkage from first
2109 principles as given in [basic.link]. Instead, it makes use of
2110 the fact that we have already set TREE_PUBLIC appropriately, and
2111 then handles a few special cases. Ideally, we would calculate
2112 linkage first, and then transform that into a concrete
2115 /* Things that don't have names have no linkage. */
2116 if (!DECL_NAME (decl))
2119 /* Things that are TREE_PUBLIC have external linkage. */
2120 if (TREE_PUBLIC (decl))
2123 /* Some things that are not TREE_PUBLIC have external linkage, too.
2124 For example, on targets that don't have weak symbols, we make all
2125 template instantiations have internal linkage (in the object
2126 file), but the symbols should still be treated as having external
2127 linkage from the point of view of the language. */
2128 if (DECL_LANG_SPECIFIC (decl) && DECL_COMDAT (decl))
2131 /* Things in local scope do not have linkage, if they don't have
2133 if (decl_function_context (decl))
2136 /* Everything else has internal linkage. */
2140 /* EXP is an expression that we want to pre-evaluate. Returns via INITP an
2141 expression to perform the pre-evaluation, and returns directly an
2142 expression to use the precalculated result. */
2145 stabilize_expr (tree exp, tree* initp)
2149 if (!TREE_SIDE_EFFECTS (exp))
2151 init_expr = NULL_TREE;
2153 else if (!real_lvalue_p (exp)
2154 || !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (exp)))
2156 init_expr = get_target_expr (exp);
2157 exp = TARGET_EXPR_SLOT (init_expr);
2161 exp = build_unary_op (ADDR_EXPR, exp, 1);
2162 init_expr = get_target_expr (exp);
2163 exp = TARGET_EXPR_SLOT (init_expr);
2164 exp = build_indirect_ref (exp, 0);
2171 /* Add NEW, an expression whose value we don't care about, after the
2172 similar expression ORIG. */
2175 add_stmt_to_compound (tree orig, tree new)
2177 if (!new || !TREE_SIDE_EFFECTS (new))
2179 if (!orig || !TREE_SIDE_EFFECTS (orig))
2181 return build2 (COMPOUND_EXPR, void_type_node, orig, new);
2184 /* Like stabilize_expr, but for a call whose args we want to
2188 stabilize_call (tree call, tree *initp)
2190 tree inits = NULL_TREE;
2193 if (call == error_mark_node)
2196 gcc_assert (TREE_CODE (call) == CALL_EXPR
2197 || TREE_CODE (call) == AGGR_INIT_EXPR);
2199 for (t = TREE_OPERAND (call, 1); t; t = TREE_CHAIN (t))
2200 if (TREE_SIDE_EFFECTS (TREE_VALUE (t)))
2203 TREE_VALUE (t) = stabilize_expr (TREE_VALUE (t), &init);
2204 inits = add_stmt_to_compound (inits, init);
2210 /* Like stabilize_expr, but for an initialization. If we are initializing
2211 an object of class type, we don't want to introduce an extra temporary,
2212 so we look past the TARGET_EXPR and stabilize the arguments of the call
2216 stabilize_init (tree init, tree *initp)
2220 if (t == error_mark_node)
2223 if (TREE_CODE (t) == INIT_EXPR
2224 && TREE_CODE (TREE_OPERAND (t, 1)) != TARGET_EXPR)
2225 TREE_OPERAND (t, 1) = stabilize_expr (TREE_OPERAND (t, 1), initp);
2228 if (TREE_CODE (t) == INIT_EXPR)
2229 t = TREE_OPERAND (t, 1);
2230 if (TREE_CODE (t) == TARGET_EXPR)
2231 t = TARGET_EXPR_INITIAL (t);
2232 if (TREE_CODE (t) == COMPOUND_EXPR)
2234 if (TREE_CODE (t) == CONSTRUCTOR
2235 && CONSTRUCTOR_ELTS (t) == NULL_TREE)
2237 /* Default-initialization. */
2242 /* If the initializer is a COND_EXPR, we can't preevaluate
2244 if (TREE_CODE (t) == COND_EXPR)
2247 /* The TARGET_EXPR might be initializing via bitwise copy from
2248 another variable; leave that alone. */
2249 if (TREE_SIDE_EFFECTS (t))
2250 stabilize_call (t, initp);
2256 /* Like "fold", but should be used whenever we might be processing the
2257 body of a template. */
2260 fold_if_not_in_template (tree expr)
2262 /* In the body of a template, there is never any need to call
2263 "fold". We will call fold later when actually instantiating the
2264 template. Integral constant expressions in templates will be
2265 evaluated via fold_non_dependent_expr, as necessary. */
2266 return (processing_template_decl ? expr : fold (expr));
2270 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
2271 /* Complain that some language-specific thing hanging off a tree
2272 node has been accessed improperly. */
2275 lang_check_failed (const char* file, int line, const char* function)
2277 internal_error ("lang_* check: failed in %s, at %s:%d",
2278 function, trim_filename (file), line);
2280 #endif /* ENABLE_TREE_CHECKING */
2282 #include "gt-cp-tree.h"