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"
39 static tree bot_manip (tree *, int *, void *);
40 static tree bot_replace (tree *, int *, void *);
41 static tree build_cplus_array_type_1 (tree, tree);
42 static int list_hash_eq (const void *, const void *);
43 static hashval_t list_hash_pieces (tree, tree, tree);
44 static hashval_t list_hash (const void *);
45 static cp_lvalue_kind lvalue_p_1 (tree, int);
46 static tree build_target_expr (tree, tree);
47 static tree count_trees_r (tree *, int *, void *);
48 static tree verify_stmt_tree_r (tree *, int *, void *);
49 static tree find_tree_r (tree *, int *, void *);
50 static tree build_local_temp (tree);
52 static tree handle_java_interface_attribute (tree *, tree, tree, int, bool *);
53 static tree handle_com_interface_attribute (tree *, tree, tree, int, bool *);
54 static tree handle_init_priority_attribute (tree *, tree, tree, int, bool *);
56 /* If REF is an lvalue, returns the kind of lvalue that REF is.
57 Otherwise, returns clk_none. If TREAT_CLASS_RVALUES_AS_LVALUES is
58 nonzero, rvalues of class type are considered lvalues. */
62 int treat_class_rvalues_as_lvalues)
64 cp_lvalue_kind op1_lvalue_kind = clk_none;
65 cp_lvalue_kind op2_lvalue_kind = clk_none;
67 if (TREE_CODE (TREE_TYPE (ref)) == REFERENCE_TYPE)
70 if (ref == current_class_ptr)
73 switch (TREE_CODE (ref))
75 /* preincrements and predecrements are valid lvals, provided
76 what they refer to are valid lvals. */
77 case PREINCREMENT_EXPR:
78 case PREDECREMENT_EXPR:
81 case WITH_CLEANUP_EXPR:
84 return lvalue_p_1 (TREE_OPERAND (ref, 0),
85 treat_class_rvalues_as_lvalues);
88 op1_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 0),
89 treat_class_rvalues_as_lvalues);
90 /* In an expression of the form "X.Y", the packed-ness of the
91 expression does not depend on "X". */
92 op1_lvalue_kind &= ~clk_packed;
93 /* Look at the member designator. */
95 /* The "field" can be a FUNCTION_DECL or an OVERLOAD in some
97 || TREE_CODE (TREE_OPERAND (ref, 1)) != FIELD_DECL)
99 else if (DECL_C_BIT_FIELD (TREE_OPERAND (ref, 1)))
101 /* Clear the ordinary bit. If this object was a class
102 rvalue we want to preserve that information. */
103 op1_lvalue_kind &= ~clk_ordinary;
104 /* The lvalue is for a bitfield. */
105 op1_lvalue_kind |= clk_bitfield;
107 else if (DECL_PACKED (TREE_OPERAND (ref, 1)))
108 op1_lvalue_kind |= clk_packed;
110 return op1_lvalue_kind;
117 if (TREE_READONLY (ref) && ! TREE_STATIC (ref)
118 && DECL_LANG_SPECIFIC (ref)
119 && DECL_IN_AGGR_P (ref))
125 if (TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE)
129 /* A currently unresolved scope ref. */
134 /* Disallow <? and >? as lvalues if either argument side-effects. */
135 if (TREE_SIDE_EFFECTS (TREE_OPERAND (ref, 0))
136 || TREE_SIDE_EFFECTS (TREE_OPERAND (ref, 1)))
138 op1_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 0),
139 treat_class_rvalues_as_lvalues);
140 op2_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 1),
141 treat_class_rvalues_as_lvalues);
145 op1_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 1),
146 treat_class_rvalues_as_lvalues);
147 op2_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 2),
148 treat_class_rvalues_as_lvalues);
155 return lvalue_p_1 (TREE_OPERAND (ref, 1),
156 treat_class_rvalues_as_lvalues);
159 return treat_class_rvalues_as_lvalues ? clk_class : clk_none;
163 /* Any class-valued call would be wrapped in a TARGET_EXPR. */
167 /* All functions (except non-static-member functions) are
169 return (DECL_NONSTATIC_MEMBER_FUNCTION_P (ref)
170 ? clk_none : clk_ordinary);
172 case NON_DEPENDENT_EXPR:
173 /* We must consider NON_DEPENDENT_EXPRs to be lvalues so that
174 things like "&E" where "E" is an expression with a
175 non-dependent type work. It is safe to be lenient because an
176 error will be issued when the template is instantiated if "E"
184 /* If one operand is not an lvalue at all, then this expression is
186 if (!op1_lvalue_kind || !op2_lvalue_kind)
189 /* Otherwise, it's an lvalue, and it has all the odd properties
190 contributed by either operand. */
191 op1_lvalue_kind = op1_lvalue_kind | op2_lvalue_kind;
192 /* It's not an ordinary lvalue if it involves either a bit-field or
194 if ((op1_lvalue_kind & ~clk_ordinary) != clk_none)
195 op1_lvalue_kind &= ~clk_ordinary;
196 return op1_lvalue_kind;
199 /* Returns the kind of lvalue that REF is, in the sense of
200 [basic.lval]. This function should really be named lvalue_p; it
201 computes the C++ definition of lvalue. */
204 real_lvalue_p (tree ref)
206 return lvalue_p_1 (ref,
207 /*treat_class_rvalues_as_lvalues=*/0);
210 /* This differs from real_lvalue_p in that class rvalues are
211 considered lvalues. */
217 (lvalue_p_1 (ref, /*class rvalue ok*/ 1) != clk_none);
220 /* Test whether DECL is a builtin that may appear in a
221 constant-expression. */
224 builtin_valid_in_constant_expr_p (tree decl)
226 /* At present BUILT_IN_CONSTANT_P is the only builtin we're allowing
227 in constant-expressions. We may want to add other builtins later. */
228 return TREE_CODE (decl) == FUNCTION_DECL
229 && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
230 && DECL_FUNCTION_CODE (decl) == BUILT_IN_CONSTANT_P;
233 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
236 build_target_expr (tree decl, tree value)
240 t = build4 (TARGET_EXPR, TREE_TYPE (decl), decl, value,
241 cxx_maybe_build_cleanup (decl), NULL_TREE);
242 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
243 ignore the TARGET_EXPR. If there really turn out to be no
244 side-effects, then the optimizer should be able to get rid of
245 whatever code is generated anyhow. */
246 TREE_SIDE_EFFECTS (t) = 1;
251 /* Return an undeclared local temporary of type TYPE for use in building a
255 build_local_temp (tree type)
257 tree slot = build_decl (VAR_DECL, NULL_TREE, type);
258 DECL_ARTIFICIAL (slot) = 1;
259 DECL_IGNORED_P (slot) = 1;
260 DECL_CONTEXT (slot) = current_function_decl;
261 layout_decl (slot, 0);
265 /* INIT is a CALL_EXPR which needs info about its target.
266 TYPE is the type that this initialization should appear to have.
268 Build an encapsulation of the initialization to perform
269 and return it so that it can be processed by language-independent
270 and language-specific expression expanders. */
273 build_cplus_new (tree type, tree init)
280 /* Make sure that we're not trying to create an instance of an
282 abstract_virtuals_error (NULL_TREE, type);
284 if (TREE_CODE (init) != CALL_EXPR && TREE_CODE (init) != AGGR_INIT_EXPR)
285 return convert (type, init);
287 fn = TREE_OPERAND (init, 0);
288 is_ctor = (TREE_CODE (fn) == ADDR_EXPR
289 && TREE_CODE (TREE_OPERAND (fn, 0)) == FUNCTION_DECL
290 && DECL_CONSTRUCTOR_P (TREE_OPERAND (fn, 0)));
292 slot = build_local_temp (type);
294 /* We split the CALL_EXPR into its function and its arguments here.
295 Then, in expand_expr, we put them back together. The reason for
296 this is that this expression might be a default argument
297 expression. In that case, we need a new temporary every time the
298 expression is used. That's what break_out_target_exprs does; it
299 replaces every AGGR_INIT_EXPR with a copy that uses a fresh
300 temporary slot. Then, expand_expr builds up a call-expression
301 using the new slot. */
303 /* If we don't need to use a constructor to create an object of this
304 type, don't mess with AGGR_INIT_EXPR. */
305 if (is_ctor || TREE_ADDRESSABLE (type))
307 rval = build3 (AGGR_INIT_EXPR, void_type_node, fn,
308 TREE_OPERAND (init, 1), slot);
309 TREE_SIDE_EFFECTS (rval) = 1;
310 AGGR_INIT_VIA_CTOR_P (rval) = is_ctor;
315 rval = build_target_expr (slot, rval);
320 /* Build a TARGET_EXPR using INIT to initialize a new temporary of the
324 build_target_expr_with_type (tree init, tree type)
328 gcc_assert (!VOID_TYPE_P (type));
330 if (TREE_CODE (init) == TARGET_EXPR)
332 else if (CLASS_TYPE_P (type) && !TYPE_HAS_TRIVIAL_INIT_REF (type)
333 && TREE_CODE (init) != COND_EXPR
334 && TREE_CODE (init) != CONSTRUCTOR
335 && TREE_CODE (init) != VA_ARG_EXPR)
336 /* We need to build up a copy constructor call. COND_EXPR is a special
337 case because we already have copies on the arms and we don't want
338 another one here. A CONSTRUCTOR is aggregate initialization, which
339 is handled separately. A VA_ARG_EXPR is magic creation of an
340 aggregate; there's no additional work to be done. */
341 return force_rvalue (init);
343 slot = build_local_temp (type);
344 return build_target_expr (slot, init);
347 /* Like the above function, but without the checking. This function should
348 only be used by code which is deliberately trying to subvert the type
349 system, such as call_builtin_trap. */
352 force_target_expr (tree type, tree init)
356 gcc_assert (!VOID_TYPE_P (type));
358 slot = build_local_temp (type);
359 return build_target_expr (slot, init);
362 /* Like build_target_expr_with_type, but use the type of INIT. */
365 get_target_expr (tree init)
367 return build_target_expr_with_type (init, TREE_TYPE (init));
372 build_cplus_array_type_1 (tree elt_type, tree index_type)
376 if (elt_type == error_mark_node || index_type == error_mark_node)
377 return error_mark_node;
379 if (dependent_type_p (elt_type)
381 && value_dependent_expression_p (TYPE_MAX_VALUE (index_type))))
383 t = make_node (ARRAY_TYPE);
384 TREE_TYPE (t) = elt_type;
385 TYPE_DOMAIN (t) = index_type;
388 t = build_array_type (elt_type, index_type);
390 /* Push these needs up so that initialization takes place
392 TYPE_NEEDS_CONSTRUCTING (t)
393 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (elt_type));
394 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
395 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (elt_type));
400 build_cplus_array_type (tree elt_type, tree index_type)
403 int type_quals = cp_type_quals (elt_type);
405 if (type_quals != TYPE_UNQUALIFIED)
406 elt_type = cp_build_qualified_type (elt_type, TYPE_UNQUALIFIED);
408 t = build_cplus_array_type_1 (elt_type, index_type);
410 if (type_quals != TYPE_UNQUALIFIED)
411 t = cp_build_qualified_type (t, type_quals);
416 /* Make a variant of TYPE, qualified with the TYPE_QUALS. Handles
417 arrays correctly. In particular, if TYPE is an array of T's, and
418 TYPE_QUALS is non-empty, returns an array of qualified T's.
420 FLAGS determines how to deal with illformed qualifications. If
421 tf_ignore_bad_quals is set, then bad qualifications are dropped
422 (this is permitted if TYPE was introduced via a typedef or template
423 type parameter). If bad qualifications are dropped and tf_warning
424 is set, then a warning is issued for non-const qualifications. If
425 tf_ignore_bad_quals is not set and tf_error is not set, we
426 return error_mark_node. Otherwise, we issue an error, and ignore
429 Qualification of a reference type is valid when the reference came
430 via a typedef or template type argument. [dcl.ref] No such
431 dispensation is provided for qualifying a function type. [dcl.fct]
432 DR 295 queries this and the proposed resolution brings it into line
433 with qualifying a reference. We implement the DR. We also behave
434 in a similar manner for restricting non-pointer types. */
437 cp_build_qualified_type_real (tree type,
439 tsubst_flags_t complain)
442 int bad_quals = TYPE_UNQUALIFIED;
444 if (type == error_mark_node)
447 if (type_quals == cp_type_quals (type))
450 if (TREE_CODE (type) == ARRAY_TYPE)
452 /* In C++, the qualification really applies to the array element
453 type. Obtain the appropriately qualified element type. */
456 = cp_build_qualified_type_real (TREE_TYPE (type),
460 if (element_type == error_mark_node)
461 return error_mark_node;
463 /* See if we already have an identically qualified type. */
464 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
465 if (cp_type_quals (t) == type_quals
466 && TYPE_NAME (t) == TYPE_NAME (type)
467 && TYPE_CONTEXT (t) == TYPE_CONTEXT (type))
472 /* Make a new array type, just like the old one, but with the
473 appropriately qualified element type. */
474 t = build_variant_type_copy (type);
475 TREE_TYPE (t) = element_type;
478 /* Even if we already had this variant, we update
479 TYPE_NEEDS_CONSTRUCTING and TYPE_HAS_NONTRIVIAL_DESTRUCTOR in case
480 they changed since the variant was originally created.
482 This seems hokey; if there is some way to use a previous
483 variant *without* coming through here,
484 TYPE_NEEDS_CONSTRUCTING will never be updated. */
485 TYPE_NEEDS_CONSTRUCTING (t)
486 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (element_type));
487 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
488 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (element_type));
491 else if (TYPE_PTRMEMFUNC_P (type))
493 /* For a pointer-to-member type, we can't just return a
494 cv-qualified version of the RECORD_TYPE. If we do, we
495 haven't changed the field that contains the actual pointer to
496 a method, and so TYPE_PTRMEMFUNC_FN_TYPE will be wrong. */
499 t = TYPE_PTRMEMFUNC_FN_TYPE (type);
500 t = cp_build_qualified_type_real (t, type_quals, complain);
501 return build_ptrmemfunc_type (t);
504 /* A reference or method type shall not be cv qualified.
505 [dcl.ref], [dct.fct] */
506 if (type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE)
507 && (TREE_CODE (type) == REFERENCE_TYPE
508 || TREE_CODE (type) == METHOD_TYPE))
510 bad_quals |= type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
511 type_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
514 /* A restrict-qualified type must be a pointer (or reference)
515 to object or incomplete type, or a function type. */
516 if ((type_quals & TYPE_QUAL_RESTRICT)
517 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
518 && TREE_CODE (type) != TYPENAME_TYPE
519 && TREE_CODE (type) != FUNCTION_TYPE
520 && !POINTER_TYPE_P (type))
522 bad_quals |= TYPE_QUAL_RESTRICT;
523 type_quals &= ~TYPE_QUAL_RESTRICT;
526 if (bad_quals == TYPE_UNQUALIFIED)
528 else if (!(complain & (tf_error | tf_ignore_bad_quals)))
529 return error_mark_node;
532 if (complain & tf_ignore_bad_quals)
533 /* We're not going to warn about constifying things that can't
535 bad_quals &= ~TYPE_QUAL_CONST;
538 tree bad_type = build_qualified_type (ptr_type_node, bad_quals);
540 if (!(complain & tf_ignore_bad_quals))
541 error ("%qV qualifiers cannot be applied to %qT",
546 /* Retrieve (or create) the appropriately qualified variant. */
547 result = build_qualified_type (type, type_quals);
549 /* If this was a pointer-to-method type, and we just made a copy,
550 then we need to unshare the record that holds the cached
551 pointer-to-member-function type, because these will be distinct
552 between the unqualified and qualified types. */
554 && TREE_CODE (type) == POINTER_TYPE
555 && TREE_CODE (TREE_TYPE (type)) == METHOD_TYPE)
556 TYPE_LANG_SPECIFIC (result) = NULL;
561 /* Returns the canonical version of TYPE. In other words, if TYPE is
562 a typedef, returns the underlying type. The cv-qualification of
563 the type returned matches the type input; they will always be
567 canonical_type_variant (tree t)
569 return cp_build_qualified_type (TYPE_MAIN_VARIANT (t), cp_type_quals (t));
572 /* Makes a copy of BINFO and TYPE, which is to be inherited into a
573 graph dominated by T. If BINFO is NULL, TYPE is a dependent base,
574 and we do a shallow copy. If BINFO is non-NULL, we do a deep copy.
575 VIRT indicates whether TYPE is inherited virtually or not.
576 IGO_PREV points at the previous binfo of the inheritance graph
577 order chain. The newly copied binfo's TREE_CHAIN forms this
580 The CLASSTYPE_VBASECLASSES vector of T is constructed in the
581 correct order. That is in the order the bases themselves should be
584 The BINFO_INHERITANCE of a virtual base class points to the binfo
585 of the most derived type. ??? We could probably change this so that
586 BINFO_INHERITANCE becomes synonymous with BINFO_PRIMARY, and hence
587 remove a field. They currently can only differ for primary virtual
591 copy_binfo (tree binfo, tree type, tree t, tree *igo_prev, int virt)
597 /* See if we've already made this virtual base. */
598 new_binfo = binfo_for_vbase (type, t);
603 new_binfo = make_tree_binfo (binfo ? BINFO_N_BASE_BINFOS (binfo) : 0);
604 BINFO_TYPE (new_binfo) = type;
606 /* Chain it into the inheritance graph. */
607 TREE_CHAIN (*igo_prev) = new_binfo;
608 *igo_prev = new_binfo;
615 gcc_assert (!BINFO_DEPENDENT_BASE_P (binfo));
616 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), type));
618 BINFO_OFFSET (new_binfo) = BINFO_OFFSET (binfo);
619 BINFO_VIRTUALS (new_binfo) = BINFO_VIRTUALS (binfo);
621 /* We do not need to copy the accesses, as they are read only. */
622 BINFO_BASE_ACCESSES (new_binfo) = BINFO_BASE_ACCESSES (binfo);
624 /* Recursively copy base binfos of BINFO. */
625 for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++)
629 gcc_assert (!BINFO_DEPENDENT_BASE_P (base_binfo));
630 new_base_binfo = copy_binfo (base_binfo, BINFO_TYPE (base_binfo),
632 BINFO_VIRTUAL_P (base_binfo));
634 if (!BINFO_INHERITANCE_CHAIN (new_base_binfo))
635 BINFO_INHERITANCE_CHAIN (new_base_binfo) = new_binfo;
636 BINFO_BASE_APPEND (new_binfo, new_base_binfo);
640 BINFO_DEPENDENT_BASE_P (new_binfo) = 1;
644 /* Push it onto the list after any virtual bases it contains
645 will have been pushed. */
646 VEC_quick_push (tree, CLASSTYPE_VBASECLASSES (t), new_binfo);
647 BINFO_VIRTUAL_P (new_binfo) = 1;
648 BINFO_INHERITANCE_CHAIN (new_binfo) = TYPE_BINFO (t);
654 /* Hashing of lists so that we don't make duplicates.
655 The entry point is `list_hash_canon'. */
657 /* Now here is the hash table. When recording a list, it is added
658 to the slot whose index is the hash code mod the table size.
659 Note that the hash table is used for several kinds of lists.
660 While all these live in the same table, they are completely independent,
661 and the hash code is computed differently for each of these. */
663 static GTY ((param_is (union tree_node))) htab_t list_hash_table;
672 /* Compare ENTRY (an entry in the hash table) with DATA (a list_proxy
673 for a node we are thinking about adding). */
676 list_hash_eq (const void* entry, const void* data)
678 tree t = (tree) entry;
679 struct list_proxy *proxy = (struct list_proxy *) data;
681 return (TREE_VALUE (t) == proxy->value
682 && TREE_PURPOSE (t) == proxy->purpose
683 && TREE_CHAIN (t) == proxy->chain);
686 /* Compute a hash code for a list (chain of TREE_LIST nodes
687 with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the
688 TREE_COMMON slots), by adding the hash codes of the individual entries. */
691 list_hash_pieces (tree purpose, tree value, tree chain)
693 hashval_t hashcode = 0;
696 hashcode += TREE_HASH (chain);
699 hashcode += TREE_HASH (value);
703 hashcode += TREE_HASH (purpose);
709 /* Hash an already existing TREE_LIST. */
712 list_hash (const void* p)
715 return list_hash_pieces (TREE_PURPOSE (t),
720 /* Given list components PURPOSE, VALUE, AND CHAIN, return the canonical
721 object for an identical list if one already exists. Otherwise, build a
722 new one, and record it as the canonical object. */
725 hash_tree_cons (tree purpose, tree value, tree chain)
729 struct list_proxy proxy;
731 /* Hash the list node. */
732 hashcode = list_hash_pieces (purpose, value, chain);
733 /* Create a proxy for the TREE_LIST we would like to create. We
734 don't actually create it so as to avoid creating garbage. */
735 proxy.purpose = purpose;
738 /* See if it is already in the table. */
739 slot = htab_find_slot_with_hash (list_hash_table, &proxy, hashcode,
741 /* If not, create a new node. */
743 *slot = tree_cons (purpose, value, chain);
747 /* Constructor for hashed lists. */
750 hash_tree_chain (tree value, tree chain)
752 return hash_tree_cons (NULL_TREE, value, chain);
756 debug_binfo (tree elem)
761 fprintf (stderr, "type \"%s\", offset = " HOST_WIDE_INT_PRINT_DEC
763 TYPE_NAME_STRING (BINFO_TYPE (elem)),
764 TREE_INT_CST_LOW (BINFO_OFFSET (elem)));
765 debug_tree (BINFO_TYPE (elem));
766 if (BINFO_VTABLE (elem))
767 fprintf (stderr, "vtable decl \"%s\"\n",
768 IDENTIFIER_POINTER (DECL_NAME (get_vtbl_decl_for_binfo (elem))));
770 fprintf (stderr, "no vtable decl yet\n");
771 fprintf (stderr, "virtuals:\n");
772 virtuals = BINFO_VIRTUALS (elem);
777 tree fndecl = TREE_VALUE (virtuals);
778 fprintf (stderr, "%s [%ld =? %ld]\n",
779 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl)),
780 (long) n, (long) TREE_INT_CST_LOW (DECL_VINDEX (fndecl)));
782 virtuals = TREE_CHAIN (virtuals);
787 is_overloaded_fn (tree x)
789 /* A baselink is also considered an overloaded function. */
790 if (TREE_CODE (x) == OFFSET_REF)
791 x = TREE_OPERAND (x, 1);
793 x = BASELINK_FUNCTIONS (x);
794 return (TREE_CODE (x) == FUNCTION_DECL
795 || TREE_CODE (x) == TEMPLATE_ID_EXPR
796 || DECL_FUNCTION_TEMPLATE_P (x)
797 || TREE_CODE (x) == OVERLOAD);
801 really_overloaded_fn (tree x)
803 /* A baselink is also considered an overloaded function. */
804 if (TREE_CODE (x) == OFFSET_REF)
805 x = TREE_OPERAND (x, 1);
807 x = BASELINK_FUNCTIONS (x);
809 return ((TREE_CODE (x) == OVERLOAD && OVL_CHAIN (x))
810 || DECL_FUNCTION_TEMPLATE_P (OVL_CURRENT (x))
811 || TREE_CODE (x) == TEMPLATE_ID_EXPR);
815 get_first_fn (tree from)
817 gcc_assert (is_overloaded_fn (from));
818 /* A baselink is also considered an overloaded function. */
819 if (BASELINK_P (from))
820 from = BASELINK_FUNCTIONS (from);
821 return OVL_CURRENT (from);
824 /* Return a new OVL node, concatenating it with the old one. */
827 ovl_cons (tree decl, tree chain)
829 tree result = make_node (OVERLOAD);
830 TREE_TYPE (result) = unknown_type_node;
831 OVL_FUNCTION (result) = decl;
832 TREE_CHAIN (result) = chain;
837 /* Build a new overloaded function. If this is the first one,
838 just return it; otherwise, ovl_cons the _DECLs */
841 build_overload (tree decl, tree chain)
843 if (! chain && TREE_CODE (decl) != TEMPLATE_DECL)
845 if (chain && TREE_CODE (chain) != OVERLOAD)
846 chain = ovl_cons (chain, NULL_TREE);
847 return ovl_cons (decl, chain);
851 #define PRINT_RING_SIZE 4
854 cxx_printable_name (tree decl, int v)
856 static tree decl_ring[PRINT_RING_SIZE];
857 static char *print_ring[PRINT_RING_SIZE];
858 static int ring_counter;
861 /* Only cache functions. */
863 || TREE_CODE (decl) != FUNCTION_DECL
864 || DECL_LANG_SPECIFIC (decl) == 0)
865 return lang_decl_name (decl, v);
867 /* See if this print name is lying around. */
868 for (i = 0; i < PRINT_RING_SIZE; i++)
869 if (decl_ring[i] == decl)
870 /* yes, so return it. */
871 return print_ring[i];
873 if (++ring_counter == PRINT_RING_SIZE)
876 if (current_function_decl != NULL_TREE)
878 if (decl_ring[ring_counter] == current_function_decl)
880 if (ring_counter == PRINT_RING_SIZE)
882 gcc_assert (decl_ring[ring_counter] != current_function_decl);
885 if (print_ring[ring_counter])
886 free (print_ring[ring_counter]);
888 print_ring[ring_counter] = xstrdup (lang_decl_name (decl, v));
889 decl_ring[ring_counter] = decl;
890 return print_ring[ring_counter];
893 /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions
897 build_exception_variant (tree type, tree raises)
899 tree v = TYPE_MAIN_VARIANT (type);
900 int type_quals = TYPE_QUALS (type);
902 for (; v; v = TYPE_NEXT_VARIANT (v))
903 if (check_qualified_type (v, type, type_quals)
904 && comp_except_specs (raises, TYPE_RAISES_EXCEPTIONS (v), 1))
907 /* Need to build a new variant. */
908 v = build_variant_type_copy (type);
909 TYPE_RAISES_EXCEPTIONS (v) = raises;
913 /* Given a TEMPLATE_TEMPLATE_PARM node T, create a new
914 BOUND_TEMPLATE_TEMPLATE_PARM bound with NEWARGS as its template
918 bind_template_template_parm (tree t, tree newargs)
920 tree decl = TYPE_NAME (t);
923 t2 = make_aggr_type (BOUND_TEMPLATE_TEMPLATE_PARM);
924 decl = build_decl (TYPE_DECL, DECL_NAME (decl), NULL_TREE);
926 /* These nodes have to be created to reflect new TYPE_DECL and template
928 TEMPLATE_TYPE_PARM_INDEX (t2) = copy_node (TEMPLATE_TYPE_PARM_INDEX (t));
929 TEMPLATE_PARM_DECL (TEMPLATE_TYPE_PARM_INDEX (t2)) = decl;
930 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2)
931 = tree_cons (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t),
934 TREE_TYPE (decl) = t2;
935 TYPE_NAME (t2) = decl;
936 TYPE_STUB_DECL (t2) = decl;
942 /* Called from count_trees via walk_tree. */
945 count_trees_r (tree *tp, int *walk_subtrees, void *data)
955 /* Debugging function for measuring the rough complexity of a tree
962 walk_tree_without_duplicates (&t, count_trees_r, &n_trees);
966 /* Called from verify_stmt_tree via walk_tree. */
969 verify_stmt_tree_r (tree* tp,
970 int* walk_subtrees ATTRIBUTE_UNUSED ,
974 htab_t *statements = (htab_t *) data;
977 if (!STATEMENT_CODE_P (TREE_CODE (t)))
980 /* If this statement is already present in the hash table, then
981 there is a circularity in the statement tree. */
982 gcc_assert (!htab_find (*statements, t));
984 slot = htab_find_slot (*statements, t, INSERT);
990 /* Debugging function to check that the statement T has not been
991 corrupted. For now, this function simply checks that T contains no
995 verify_stmt_tree (tree t)
998 statements = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
999 walk_tree (&t, verify_stmt_tree_r, &statements, NULL);
1000 htab_delete (statements);
1003 /* Called from find_tree via walk_tree. */
1006 find_tree_r (tree* tp,
1007 int* walk_subtrees ATTRIBUTE_UNUSED ,
1010 if (*tp == (tree) data)
1016 /* Returns X if X appears in the tree structure rooted at T. */
1019 find_tree (tree t, tree x)
1021 return walk_tree_without_duplicates (&t, find_tree_r, x);
1024 /* Check if the type T depends on a type with no linkage and if so, return
1025 it. If RELAXED_P then do not consider a class type declared within
1026 a TREE_PUBLIC function to have no linkage. */
1029 no_linkage_check (tree t, bool relaxed_p)
1033 /* There's no point in checking linkage on template functions; we
1034 can't know their complete types. */
1035 if (processing_template_decl)
1038 switch (TREE_CODE (t))
1043 if (TYPE_PTRMEMFUNC_P (t))
1047 if (!CLASS_TYPE_P (t))
1051 if (TYPE_ANONYMOUS_P (t))
1053 fn = decl_function_context (TYPE_MAIN_DECL (t));
1054 if (fn && (!relaxed_p || !TREE_PUBLIC (fn)))
1060 case REFERENCE_TYPE:
1061 return no_linkage_check (TREE_TYPE (t), relaxed_p);
1065 r = no_linkage_check (TYPE_PTRMEM_POINTED_TO_TYPE (t),
1069 return no_linkage_check (TYPE_PTRMEM_CLASS_TYPE (t), relaxed_p);
1072 r = no_linkage_check (TYPE_METHOD_BASETYPE (t), relaxed_p);
1079 for (parm = TYPE_ARG_TYPES (t);
1080 parm && parm != void_list_node;
1081 parm = TREE_CHAIN (parm))
1083 r = no_linkage_check (TREE_VALUE (parm), relaxed_p);
1087 return no_linkage_check (TREE_TYPE (t), relaxed_p);
1095 #ifdef GATHER_STATISTICS
1096 extern int depth_reached;
1100 cxx_print_statistics (void)
1102 print_search_statistics ();
1103 print_class_statistics ();
1104 #ifdef GATHER_STATISTICS
1105 fprintf (stderr, "maximum template instantiation depth reached: %d\n",
1110 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1111 (which is an ARRAY_TYPE). This counts only elements of the top
1115 array_type_nelts_top (tree type)
1117 return fold_build2 (PLUS_EXPR, sizetype,
1118 array_type_nelts (type),
1122 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1123 (which is an ARRAY_TYPE). This one is a recursive count of all
1124 ARRAY_TYPEs that are clumped together. */
1127 array_type_nelts_total (tree type)
1129 tree sz = array_type_nelts_top (type);
1130 type = TREE_TYPE (type);
1131 while (TREE_CODE (type) == ARRAY_TYPE)
1133 tree n = array_type_nelts_top (type);
1134 sz = fold_build2 (MULT_EXPR, sizetype, sz, n);
1135 type = TREE_TYPE (type);
1140 /* Called from break_out_target_exprs via mapcar. */
1143 bot_manip (tree* tp, int* walk_subtrees, void* data)
1145 splay_tree target_remap = ((splay_tree) data);
1148 if (!TYPE_P (t) && TREE_CONSTANT (t))
1150 /* There can't be any TARGET_EXPRs or their slot variables below
1151 this point. We used to check !TREE_SIDE_EFFECTS, but then we
1152 failed to copy an ADDR_EXPR of the slot VAR_DECL. */
1156 if (TREE_CODE (t) == TARGET_EXPR)
1160 if (TREE_CODE (TREE_OPERAND (t, 1)) == AGGR_INIT_EXPR)
1162 mark_used (TREE_OPERAND (TREE_OPERAND (TREE_OPERAND (t, 1), 0), 0));
1164 (TREE_TYPE (t), break_out_target_exprs (TREE_OPERAND (t, 1)));
1168 u = build_target_expr_with_type
1169 (break_out_target_exprs (TREE_OPERAND (t, 1)), TREE_TYPE (t));
1172 /* Map the old variable to the new one. */
1173 splay_tree_insert (target_remap,
1174 (splay_tree_key) TREE_OPERAND (t, 0),
1175 (splay_tree_value) TREE_OPERAND (u, 0));
1177 /* Replace the old expression with the new version. */
1179 /* We don't have to go below this point; the recursive call to
1180 break_out_target_exprs will have handled anything below this
1185 else if (TREE_CODE (t) == CALL_EXPR)
1186 mark_used (TREE_OPERAND (TREE_OPERAND (t, 0), 0));
1188 /* Make a copy of this node. */
1189 return copy_tree_r (tp, walk_subtrees, NULL);
1192 /* Replace all remapped VAR_DECLs in T with their new equivalents.
1193 DATA is really a splay-tree mapping old variables to new
1197 bot_replace (tree* t,
1198 int* walk_subtrees ATTRIBUTE_UNUSED ,
1201 splay_tree target_remap = ((splay_tree) data);
1203 if (TREE_CODE (*t) == VAR_DECL)
1205 splay_tree_node n = splay_tree_lookup (target_remap,
1206 (splay_tree_key) *t);
1208 *t = (tree) n->value;
1214 /* When we parse a default argument expression, we may create
1215 temporary variables via TARGET_EXPRs. When we actually use the
1216 default-argument expression, we make a copy of the expression, but
1217 we must replace the temporaries with appropriate local versions. */
1220 break_out_target_exprs (tree t)
1222 static int target_remap_count;
1223 static splay_tree target_remap;
1225 if (!target_remap_count++)
1226 target_remap = splay_tree_new (splay_tree_compare_pointers,
1227 /*splay_tree_delete_key_fn=*/NULL,
1228 /*splay_tree_delete_value_fn=*/NULL);
1229 walk_tree (&t, bot_manip, target_remap, NULL);
1230 walk_tree (&t, bot_replace, target_remap, NULL);
1232 if (!--target_remap_count)
1234 splay_tree_delete (target_remap);
1235 target_remap = NULL;
1241 /* Similar to `build_nt', but for template definitions of dependent
1245 build_min_nt (enum tree_code code, ...)
1254 t = make_node (code);
1255 length = TREE_CODE_LENGTH (code);
1257 for (i = 0; i < length; i++)
1259 tree x = va_arg (p, tree);
1260 TREE_OPERAND (t, i) = x;
1267 /* Similar to `build', but for template definitions. */
1270 build_min (enum tree_code code, tree tt, ...)
1279 t = make_node (code);
1280 length = TREE_CODE_LENGTH (code);
1283 for (i = 0; i < length; i++)
1285 tree x = va_arg (p, tree);
1286 TREE_OPERAND (t, i) = x;
1287 if (x && !TYPE_P (x) && TREE_SIDE_EFFECTS (x))
1288 TREE_SIDE_EFFECTS (t) = 1;
1295 /* Similar to `build', but for template definitions of non-dependent
1296 expressions. NON_DEP is the non-dependent expression that has been
1300 build_min_non_dep (enum tree_code code, tree non_dep, ...)
1307 va_start (p, non_dep);
1309 t = make_node (code);
1310 length = TREE_CODE_LENGTH (code);
1311 TREE_TYPE (t) = TREE_TYPE (non_dep);
1312 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (non_dep);
1314 for (i = 0; i < length; i++)
1316 tree x = va_arg (p, tree);
1317 TREE_OPERAND (t, i) = x;
1320 if (code == COMPOUND_EXPR && TREE_CODE (non_dep) != COMPOUND_EXPR)
1321 /* This should not be considered a COMPOUND_EXPR, because it
1322 resolves to an overload. */
1323 COMPOUND_EXPR_OVERLOADED (t) = 1;
1330 get_type_decl (tree t)
1332 if (TREE_CODE (t) == TYPE_DECL)
1335 return TYPE_STUB_DECL (t);
1336 gcc_assert (t == error_mark_node);
1340 /* Returns the namespace that contains DECL, whether directly or
1344 decl_namespace_context (tree decl)
1348 if (TREE_CODE (decl) == NAMESPACE_DECL)
1350 else if (TYPE_P (decl))
1351 decl = CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl));
1353 decl = CP_DECL_CONTEXT (decl);
1357 /* Return truthvalue of whether T1 is the same tree structure as T2.
1358 Return 1 if they are the same. Return 0 if they are different. */
1361 cp_tree_equal (tree t1, tree t2)
1363 enum tree_code code1, code2;
1370 for (code1 = TREE_CODE (t1);
1371 code1 == NOP_EXPR || code1 == CONVERT_EXPR
1372 || code1 == NON_LVALUE_EXPR;
1373 code1 = TREE_CODE (t1))
1374 t1 = TREE_OPERAND (t1, 0);
1375 for (code2 = TREE_CODE (t2);
1376 code2 == NOP_EXPR || code2 == CONVERT_EXPR
1377 || code1 == NON_LVALUE_EXPR;
1378 code2 = TREE_CODE (t2))
1379 t2 = TREE_OPERAND (t2, 0);
1381 /* They might have become equal now. */
1391 return TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
1392 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2);
1395 return REAL_VALUES_EQUAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
1398 return TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
1399 && !memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
1400 TREE_STRING_LENGTH (t1));
1403 /* We need to do this when determining whether or not two
1404 non-type pointer to member function template arguments
1406 if (!(same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
1407 /* The first operand is RTL. */
1408 && TREE_OPERAND (t1, 0) == TREE_OPERAND (t2, 0)))
1410 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1413 if (!cp_tree_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2)))
1415 if (!cp_tree_equal (TREE_VALUE (t1), TREE_VALUE (t2)))
1417 return cp_tree_equal (TREE_CHAIN (t1), TREE_CHAIN (t2));
1420 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1423 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1425 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1429 tree o1 = TREE_OPERAND (t1, 0);
1430 tree o2 = TREE_OPERAND (t2, 0);
1432 /* Special case: if either target is an unallocated VAR_DECL,
1433 it means that it's going to be unified with whatever the
1434 TARGET_EXPR is really supposed to initialize, so treat it
1435 as being equivalent to anything. */
1436 if (TREE_CODE (o1) == VAR_DECL && DECL_NAME (o1) == NULL_TREE
1437 && !DECL_RTL_SET_P (o1))
1439 else if (TREE_CODE (o2) == VAR_DECL && DECL_NAME (o2) == NULL_TREE
1440 && !DECL_RTL_SET_P (o2))
1442 else if (!cp_tree_equal (o1, o2))
1445 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1448 case WITH_CLEANUP_EXPR:
1449 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1451 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
1454 if (TREE_OPERAND (t1, 1) != TREE_OPERAND (t2, 1))
1456 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1463 case IDENTIFIER_NODE:
1468 return (BASELINK_BINFO (t1) == BASELINK_BINFO (t2)
1469 && BASELINK_ACCESS_BINFO (t1) == BASELINK_ACCESS_BINFO (t2)
1470 && cp_tree_equal (BASELINK_FUNCTIONS (t1),
1471 BASELINK_FUNCTIONS (t2)));
1473 case TEMPLATE_PARM_INDEX:
1474 return (TEMPLATE_PARM_IDX (t1) == TEMPLATE_PARM_IDX (t2)
1475 && TEMPLATE_PARM_LEVEL (t1) == TEMPLATE_PARM_LEVEL (t2)
1476 && same_type_p (TREE_TYPE (TEMPLATE_PARM_DECL (t1)),
1477 TREE_TYPE (TEMPLATE_PARM_DECL (t2))));
1479 case TEMPLATE_ID_EXPR:
1484 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1486 vec1 = TREE_OPERAND (t1, 1);
1487 vec2 = TREE_OPERAND (t2, 1);
1490 return !vec1 && !vec2;
1492 if (TREE_VEC_LENGTH (vec1) != TREE_VEC_LENGTH (vec2))
1495 for (ix = TREE_VEC_LENGTH (vec1); ix--;)
1496 if (!cp_tree_equal (TREE_VEC_ELT (vec1, ix),
1497 TREE_VEC_ELT (vec2, ix)))
1506 tree o1 = TREE_OPERAND (t1, 0);
1507 tree o2 = TREE_OPERAND (t2, 0);
1509 if (TREE_CODE (o1) != TREE_CODE (o2))
1512 return same_type_p (o1, o2);
1514 return cp_tree_equal (o1, o2);
1518 /* Two pointer-to-members are the same if they point to the same
1519 field or function in the same class. */
1520 if (PTRMEM_CST_MEMBER (t1) != PTRMEM_CST_MEMBER (t2))
1523 return same_type_p (PTRMEM_CST_CLASS (t1), PTRMEM_CST_CLASS (t2));
1526 if (OVL_FUNCTION (t1) != OVL_FUNCTION (t2))
1528 return cp_tree_equal (OVL_CHAIN (t1), OVL_CHAIN (t2));
1534 switch (TREE_CODE_CLASS (code1))
1538 case tcc_comparison:
1539 case tcc_expression:
1545 for (i = 0; i < TREE_CODE_LENGTH (code1); ++i)
1546 if (!cp_tree_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i)))
1553 return same_type_p (t1, t2);
1557 /* We can get here with --disable-checking. */
1561 /* The type of ARG when used as an lvalue. */
1564 lvalue_type (tree arg)
1566 tree type = TREE_TYPE (arg);
1570 /* The type of ARG for printing error messages; denote lvalues with
1574 error_type (tree arg)
1576 tree type = TREE_TYPE (arg);
1578 if (TREE_CODE (type) == ARRAY_TYPE)
1580 else if (TREE_CODE (type) == ERROR_MARK)
1582 else if (real_lvalue_p (arg))
1583 type = build_reference_type (lvalue_type (arg));
1584 else if (IS_AGGR_TYPE (type))
1585 type = lvalue_type (arg);
1590 /* Does FUNCTION use a variable-length argument list? */
1593 varargs_function_p (tree function)
1595 tree parm = TYPE_ARG_TYPES (TREE_TYPE (function));
1596 for (; parm; parm = TREE_CHAIN (parm))
1597 if (TREE_VALUE (parm) == void_type_node)
1602 /* Returns 1 if decl is a member of a class. */
1605 member_p (tree decl)
1607 const tree ctx = DECL_CONTEXT (decl);
1608 return (ctx && TYPE_P (ctx));
1611 /* Create a placeholder for member access where we don't actually have an
1612 object that the access is against. */
1615 build_dummy_object (tree type)
1617 tree decl = build1 (NOP_EXPR, build_pointer_type (type), void_zero_node);
1618 return build_indirect_ref (decl, NULL);
1621 /* We've gotten a reference to a member of TYPE. Return *this if appropriate,
1622 or a dummy object otherwise. If BINFOP is non-0, it is filled with the
1623 binfo path from current_class_type to TYPE, or 0. */
1626 maybe_dummy_object (tree type, tree* binfop)
1631 if (current_class_type
1632 && (binfo = lookup_base (current_class_type, type,
1633 ba_unique | ba_quiet, NULL)))
1634 context = current_class_type;
1637 /* Reference from a nested class member function. */
1639 binfo = TYPE_BINFO (type);
1645 if (current_class_ref && context == current_class_type
1646 /* Kludge: Make sure that current_class_type is actually
1647 correct. It might not be if we're in the middle of
1648 tsubst_default_argument. */
1649 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref)),
1650 current_class_type))
1651 decl = current_class_ref;
1653 decl = build_dummy_object (context);
1658 /* Returns 1 if OB is a placeholder object, or a pointer to one. */
1661 is_dummy_object (tree ob)
1663 if (TREE_CODE (ob) == INDIRECT_REF)
1664 ob = TREE_OPERAND (ob, 0);
1665 return (TREE_CODE (ob) == NOP_EXPR
1666 && TREE_OPERAND (ob, 0) == void_zero_node);
1669 /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */
1674 t = strip_array_types (t);
1676 if (t == error_mark_node)
1678 if (INTEGRAL_TYPE_P (t))
1679 return 1; /* integral, character or enumeral type */
1680 if (FLOAT_TYPE_P (t))
1683 return 1; /* pointer to non-member */
1684 if (TYPE_PTR_TO_MEMBER_P (t))
1685 return 1; /* pointer to member */
1687 if (TREE_CODE (t) == VECTOR_TYPE)
1688 return 1; /* vectors are (small) arrays of scalars */
1690 if (! CLASS_TYPE_P (t))
1691 return 0; /* other non-class type (reference or function) */
1692 if (CLASSTYPE_NON_POD_P (t))
1697 /* Returns 1 iff zero initialization of type T means actually storing
1701 zero_init_p (tree t)
1703 t = strip_array_types (t);
1705 if (t == error_mark_node)
1708 /* NULL pointers to data members are initialized with -1. */
1709 if (TYPE_PTRMEM_P (t))
1712 /* Classes that contain types that can't be zero-initialized, cannot
1713 be zero-initialized themselves. */
1714 if (CLASS_TYPE_P (t) && CLASSTYPE_NON_ZERO_INIT_P (t))
1720 /* Table of valid C++ attributes. */
1721 const struct attribute_spec cxx_attribute_table[] =
1723 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
1724 { "java_interface", 0, 0, false, false, false, handle_java_interface_attribute },
1725 { "com_interface", 0, 0, false, false, false, handle_com_interface_attribute },
1726 { "init_priority", 1, 1, true, false, false, handle_init_priority_attribute },
1727 { NULL, 0, 0, false, false, false, NULL }
1730 /* Handle a "java_interface" attribute; arguments as in
1731 struct attribute_spec.handler. */
1733 handle_java_interface_attribute (tree* node,
1735 tree args ATTRIBUTE_UNUSED ,
1740 || !CLASS_TYPE_P (*node)
1741 || !TYPE_FOR_JAVA (*node))
1743 error ("%qE attribute can only be applied to Java class definitions",
1745 *no_add_attrs = true;
1748 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
1749 *node = build_variant_type_copy (*node);
1750 TYPE_JAVA_INTERFACE (*node) = 1;
1755 /* Handle a "com_interface" attribute; arguments as in
1756 struct attribute_spec.handler. */
1758 handle_com_interface_attribute (tree* node,
1760 tree args ATTRIBUTE_UNUSED ,
1761 int flags ATTRIBUTE_UNUSED ,
1766 *no_add_attrs = true;
1769 || !CLASS_TYPE_P (*node)
1770 || *node != TYPE_MAIN_VARIANT (*node))
1772 warning (OPT_Wattributes, "%qE attribute can only be applied "
1773 "to class definitions", name);
1778 warning (0, "%qE is obsolete; g++ vtables are now COM-compatible by default",
1784 /* Handle an "init_priority" attribute; arguments as in
1785 struct attribute_spec.handler. */
1787 handle_init_priority_attribute (tree* node,
1790 int flags ATTRIBUTE_UNUSED ,
1793 tree initp_expr = TREE_VALUE (args);
1795 tree type = TREE_TYPE (decl);
1798 STRIP_NOPS (initp_expr);
1800 if (!initp_expr || TREE_CODE (initp_expr) != INTEGER_CST)
1802 error ("requested init_priority is not an integer constant");
1803 *no_add_attrs = true;
1807 pri = TREE_INT_CST_LOW (initp_expr);
1809 type = strip_array_types (type);
1811 if (decl == NULL_TREE
1812 || TREE_CODE (decl) != VAR_DECL
1813 || !TREE_STATIC (decl)
1814 || DECL_EXTERNAL (decl)
1815 || (TREE_CODE (type) != RECORD_TYPE
1816 && TREE_CODE (type) != UNION_TYPE)
1817 /* Static objects in functions are initialized the
1818 first time control passes through that
1819 function. This is not precise enough to pin down an
1820 init_priority value, so don't allow it. */
1821 || current_function_decl)
1823 error ("can only use %qE attribute on file-scope definitions "
1824 "of objects of class type", name);
1825 *no_add_attrs = true;
1829 if (pri > MAX_INIT_PRIORITY || pri <= 0)
1831 error ("requested init_priority is out of range");
1832 *no_add_attrs = true;
1836 /* Check for init_priorities that are reserved for
1837 language and runtime support implementations.*/
1838 if (pri <= MAX_RESERVED_INIT_PRIORITY)
1841 (0, "requested init_priority is reserved for internal use");
1844 if (SUPPORTS_INIT_PRIORITY)
1846 DECL_INIT_PRIORITY (decl) = pri;
1851 error ("%qE attribute is not supported on this platform", name);
1852 *no_add_attrs = true;
1857 /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the
1858 thing pointed to by the constant. */
1861 make_ptrmem_cst (tree type, tree member)
1863 tree ptrmem_cst = make_node (PTRMEM_CST);
1864 TREE_TYPE (ptrmem_cst) = type;
1865 PTRMEM_CST_MEMBER (ptrmem_cst) = member;
1869 /* Build a variant of TYPE that has the indicated ATTRIBUTES. May
1870 return an existing type of an appropriate type already exists. */
1873 cp_build_type_attribute_variant (tree type, tree attributes)
1877 new_type = build_type_attribute_variant (type, attributes);
1878 if (TREE_CODE (new_type) == FUNCTION_TYPE
1879 && (TYPE_RAISES_EXCEPTIONS (new_type)
1880 != TYPE_RAISES_EXCEPTIONS (type)))
1881 new_type = build_exception_variant (new_type,
1882 TYPE_RAISES_EXCEPTIONS (type));
1886 /* Apply FUNC to all language-specific sub-trees of TP in a pre-order
1887 traversal. Called from walk_tree. */
1890 cp_walk_subtrees (tree *tp, int *walk_subtrees_p, walk_tree_fn func,
1891 void *data, struct pointer_set_t *pset)
1893 enum tree_code code = TREE_CODE (*tp);
1894 location_t save_locus;
1897 #define WALK_SUBTREE(NODE) \
1900 result = walk_tree (&(NODE), func, data, pset); \
1901 if (result) goto out; \
1905 /* Set input_location here so we get the right instantiation context
1906 if we call instantiate_decl from inlinable_function_p. */
1907 save_locus = input_location;
1908 if (EXPR_HAS_LOCATION (*tp))
1909 input_location = EXPR_LOCATION (*tp);
1911 /* Not one of the easy cases. We must explicitly go through the
1917 case TEMPLATE_TEMPLATE_PARM:
1918 case BOUND_TEMPLATE_TEMPLATE_PARM:
1919 case UNBOUND_CLASS_TEMPLATE:
1920 case TEMPLATE_PARM_INDEX:
1921 case TEMPLATE_TYPE_PARM:
1925 /* None of these have subtrees other than those already walked
1927 *walk_subtrees_p = 0;
1931 WALK_SUBTREE (TINST_DECL (*tp));
1932 *walk_subtrees_p = 0;
1936 WALK_SUBTREE (TREE_TYPE (*tp));
1937 *walk_subtrees_p = 0;
1941 WALK_SUBTREE (TREE_PURPOSE (*tp));
1945 WALK_SUBTREE (OVL_FUNCTION (*tp));
1946 WALK_SUBTREE (OVL_CHAIN (*tp));
1947 *walk_subtrees_p = 0;
1951 if (TYPE_PTRMEMFUNC_P (*tp))
1952 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (*tp));
1956 input_location = save_locus;
1960 /* We didn't find what we were looking for. */
1962 input_location = save_locus;
1968 /* Decide whether there are language-specific reasons to not inline a
1969 function as a tree. */
1972 cp_cannot_inline_tree_fn (tree* fnp)
1976 /* We can inline a template instantiation only if it's fully
1978 if (DECL_TEMPLATE_INFO (fn)
1979 && TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (fn)))
1981 /* Don't instantiate functions that are not going to be
1983 if (!DECL_INLINE (DECL_TEMPLATE_RESULT
1984 (template_for_substitution (fn))))
1987 fn = *fnp = instantiate_decl (fn, /*defer_ok=*/0, /*undefined_ok=*/0);
1989 if (TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (fn)))
1993 if (flag_really_no_inline
1994 && lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)) == NULL)
1997 /* Don't auto-inline anything that might not be bound within
1998 this unit of translation.
1999 Exclude comdat functions from this rule. While they can be bound
2000 to the other unit, they all must be the same. This is especially
2001 important so templates can inline. */
2002 if (!DECL_DECLARED_INLINE_P (fn) && !(*targetm.binds_local_p) (fn)
2003 && !DECL_COMDAT (fn))
2005 DECL_UNINLINABLE (fn) = 1;
2009 if (varargs_function_p (fn))
2011 DECL_UNINLINABLE (fn) = 1;
2015 if (! function_attribute_inlinable_p (fn))
2017 DECL_UNINLINABLE (fn) = 1;
2024 /* Add any pending functions other than the current function (already
2025 handled by the caller), that thus cannot be inlined, to FNS_P, then
2026 return the latest function added to the array, PREV_FN. */
2029 cp_add_pending_fn_decls (void* fns_p, tree prev_fn)
2031 varray_type *fnsp = (varray_type *)fns_p;
2032 struct saved_scope *s;
2034 for (s = scope_chain; s; s = s->prev)
2035 if (s->function_decl && s->function_decl != prev_fn)
2037 VARRAY_PUSH_TREE (*fnsp, s->function_decl);
2038 prev_fn = s->function_decl;
2044 /* Determine whether VAR is a declaration of an automatic variable in
2048 cp_auto_var_in_fn_p (tree var, tree fn)
2050 return (DECL_P (var) && DECL_CONTEXT (var) == fn
2051 && nonstatic_local_decl_p (var));
2054 /* Initialize tree.c. */
2059 list_hash_table = htab_create_ggc (31, list_hash, list_hash_eq, NULL);
2062 /* Returns the kind of special function that DECL (a FUNCTION_DECL)
2063 is. Note that sfk_none is zero, so this function can be used as a
2064 predicate to test whether or not DECL is a special function. */
2066 special_function_kind
2067 special_function_p (tree decl)
2069 /* Rather than doing all this stuff with magic names, we should
2070 probably have a field of type `special_function_kind' in
2071 DECL_LANG_SPECIFIC. */
2072 if (DECL_COPY_CONSTRUCTOR_P (decl))
2073 return sfk_copy_constructor;
2074 if (DECL_CONSTRUCTOR_P (decl))
2075 return sfk_constructor;
2076 if (DECL_OVERLOADED_OPERATOR_P (decl) == NOP_EXPR)
2077 return sfk_assignment_operator;
2078 if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl))
2079 return sfk_destructor;
2080 if (DECL_COMPLETE_DESTRUCTOR_P (decl))
2081 return sfk_complete_destructor;
2082 if (DECL_BASE_DESTRUCTOR_P (decl))
2083 return sfk_base_destructor;
2084 if (DECL_DELETING_DESTRUCTOR_P (decl))
2085 return sfk_deleting_destructor;
2086 if (DECL_CONV_FN_P (decl))
2087 return sfk_conversion;
2092 /* Returns nonzero if TYPE is a character type, including wchar_t. */
2095 char_type_p (tree type)
2097 return (same_type_p (type, char_type_node)
2098 || same_type_p (type, unsigned_char_type_node)
2099 || same_type_p (type, signed_char_type_node)
2100 || same_type_p (type, wchar_type_node));
2103 /* Returns the kind of linkage associated with the indicated DECL. Th
2104 value returned is as specified by the language standard; it is
2105 independent of implementation details regarding template
2106 instantiation, etc. For example, it is possible that a declaration
2107 to which this function assigns external linkage would not show up
2108 as a global symbol when you run `nm' on the resulting object file. */
2111 decl_linkage (tree decl)
2113 /* This function doesn't attempt to calculate the linkage from first
2114 principles as given in [basic.link]. Instead, it makes use of
2115 the fact that we have already set TREE_PUBLIC appropriately, and
2116 then handles a few special cases. Ideally, we would calculate
2117 linkage first, and then transform that into a concrete
2120 /* Things that don't have names have no linkage. */
2121 if (!DECL_NAME (decl))
2124 /* Things that are TREE_PUBLIC have external linkage. */
2125 if (TREE_PUBLIC (decl))
2128 /* Some things that are not TREE_PUBLIC have external linkage, too.
2129 For example, on targets that don't have weak symbols, we make all
2130 template instantiations have internal linkage (in the object
2131 file), but the symbols should still be treated as having external
2132 linkage from the point of view of the language. */
2133 if (DECL_LANG_SPECIFIC (decl) && DECL_COMDAT (decl))
2136 /* Things in local scope do not have linkage, if they don't have
2138 if (decl_function_context (decl))
2141 /* Everything else has internal linkage. */
2145 /* EXP is an expression that we want to pre-evaluate. Returns via INITP an
2146 expression to perform the pre-evaluation, and returns directly an
2147 expression to use the precalculated result. */
2150 stabilize_expr (tree exp, tree* initp)
2154 if (!TREE_SIDE_EFFECTS (exp))
2156 init_expr = NULL_TREE;
2158 else if (!real_lvalue_p (exp)
2159 || !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (exp)))
2161 init_expr = get_target_expr (exp);
2162 exp = TARGET_EXPR_SLOT (init_expr);
2166 exp = build_unary_op (ADDR_EXPR, exp, 1);
2167 init_expr = get_target_expr (exp);
2168 exp = TARGET_EXPR_SLOT (init_expr);
2169 exp = build_indirect_ref (exp, 0);
2176 /* Add NEW, an expression whose value we don't care about, after the
2177 similar expression ORIG. */
2180 add_stmt_to_compound (tree orig, tree new)
2182 if (!new || !TREE_SIDE_EFFECTS (new))
2184 if (!orig || !TREE_SIDE_EFFECTS (orig))
2186 return build2 (COMPOUND_EXPR, void_type_node, orig, new);
2189 /* Like stabilize_expr, but for a call whose args we want to
2193 stabilize_call (tree call, tree *initp)
2195 tree inits = NULL_TREE;
2198 if (call == error_mark_node)
2201 gcc_assert (TREE_CODE (call) == CALL_EXPR
2202 || TREE_CODE (call) == AGGR_INIT_EXPR);
2204 for (t = TREE_OPERAND (call, 1); t; t = TREE_CHAIN (t))
2205 if (TREE_SIDE_EFFECTS (TREE_VALUE (t)))
2208 TREE_VALUE (t) = stabilize_expr (TREE_VALUE (t), &init);
2209 inits = add_stmt_to_compound (inits, init);
2215 /* Like stabilize_expr, but for an initialization. If we are initializing
2216 an object of class type, we don't want to introduce an extra temporary,
2217 so we look past the TARGET_EXPR and stabilize the arguments of the call
2221 stabilize_init (tree init, tree *initp)
2225 if (t == error_mark_node)
2228 if (TREE_CODE (t) == INIT_EXPR
2229 && TREE_CODE (TREE_OPERAND (t, 1)) != TARGET_EXPR)
2230 TREE_OPERAND (t, 1) = stabilize_expr (TREE_OPERAND (t, 1), initp);
2233 if (TREE_CODE (t) == INIT_EXPR)
2234 t = TREE_OPERAND (t, 1);
2235 if (TREE_CODE (t) == TARGET_EXPR)
2236 t = TARGET_EXPR_INITIAL (t);
2237 if (TREE_CODE (t) == COMPOUND_EXPR)
2239 if (TREE_CODE (t) == CONSTRUCTOR
2240 && CONSTRUCTOR_ELTS (t) == NULL_TREE)
2242 /* Default-initialization. */
2247 /* If the initializer is a COND_EXPR, we can't preevaluate
2249 if (TREE_CODE (t) == COND_EXPR)
2252 /* The TARGET_EXPR might be initializing via bitwise copy from
2253 another variable; leave that alone. */
2254 if (TREE_SIDE_EFFECTS (t))
2255 stabilize_call (t, initp);
2261 /* Like "fold", but should be used whenever we might be processing the
2262 body of a template. */
2265 fold_if_not_in_template (tree expr)
2267 /* In the body of a template, there is never any need to call
2268 "fold". We will call fold later when actually instantiating the
2269 template. Integral constant expressions in templates will be
2270 evaluated via fold_non_dependent_expr, as necessary. */
2271 return (processing_template_decl ? expr : fold (expr));
2275 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
2276 /* Complain that some language-specific thing hanging off a tree
2277 node has been accessed improperly. */
2280 lang_check_failed (const char* file, int line, const char* function)
2282 internal_error ("lang_* check: failed in %s, at %s:%d",
2283 function, trim_filename (file), line);
2285 #endif /* ENABLE_TREE_CHECKING */
2287 #include "gt-cp-tree.h"