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, 51 Franklin Street, Fifth Floor,
21 Boston, MA 02110-1301, USA. */
25 #include "coretypes.h"
33 #include "insn-config.h"
34 #include "integrate.h"
35 #include "tree-inline.h"
40 static tree bot_manip (tree *, int *, void *);
41 static tree bot_replace (tree *, int *, void *);
42 static tree build_cplus_array_type_1 (tree, tree);
43 static int list_hash_eq (const void *, const void *);
44 static hashval_t list_hash_pieces (tree, tree, tree);
45 static hashval_t list_hash (const void *);
46 static cp_lvalue_kind lvalue_p_1 (tree, int);
47 static tree build_target_expr (tree, tree);
48 static tree count_trees_r (tree *, int *, void *);
49 static tree verify_stmt_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 /* Look at the member designator. */
92 /* The "field" can be a FUNCTION_DECL or an OVERLOAD in some
94 || TREE_CODE (TREE_OPERAND (ref, 1)) != FIELD_DECL)
96 else if (DECL_C_BIT_FIELD (TREE_OPERAND (ref, 1)))
98 /* Clear the ordinary bit. If this object was a class
99 rvalue we want to preserve that information. */
100 op1_lvalue_kind &= ~clk_ordinary;
101 /* The lvalue is for a bitfield. */
102 op1_lvalue_kind |= clk_bitfield;
104 else if (DECL_PACKED (TREE_OPERAND (ref, 1)))
105 op1_lvalue_kind |= clk_packed;
107 return op1_lvalue_kind;
114 if (TREE_READONLY (ref) && ! TREE_STATIC (ref)
115 && DECL_LANG_SPECIFIC (ref)
116 && DECL_IN_AGGR_P (ref))
122 if (TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE)
126 /* A currently unresolved scope ref. */
131 /* Disallow <? and >? as lvalues if either argument side-effects. */
132 if (TREE_SIDE_EFFECTS (TREE_OPERAND (ref, 0))
133 || TREE_SIDE_EFFECTS (TREE_OPERAND (ref, 1)))
135 op1_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 0),
136 treat_class_rvalues_as_lvalues);
137 op2_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 1),
138 treat_class_rvalues_as_lvalues);
142 op1_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 1),
143 treat_class_rvalues_as_lvalues);
144 op2_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 2),
145 treat_class_rvalues_as_lvalues);
152 return lvalue_p_1 (TREE_OPERAND (ref, 1),
153 treat_class_rvalues_as_lvalues);
156 return treat_class_rvalues_as_lvalues ? clk_class : clk_none;
159 return (treat_class_rvalues_as_lvalues
160 && CLASS_TYPE_P (TREE_TYPE (ref))
161 ? clk_class : clk_none);
164 /* Any class-valued call would be wrapped in a TARGET_EXPR. */
168 /* All functions (except non-static-member functions) are
170 return (DECL_NONSTATIC_MEMBER_FUNCTION_P (ref)
171 ? clk_none : clk_ordinary);
173 case NON_DEPENDENT_EXPR:
174 /* We must consider NON_DEPENDENT_EXPRs to be lvalues so that
175 things like "&E" where "E" is an expression with a
176 non-dependent type work. It is safe to be lenient because an
177 error will be issued when the template is instantiated if "E"
185 /* If one operand is not an lvalue at all, then this expression is
187 if (!op1_lvalue_kind || !op2_lvalue_kind)
190 /* Otherwise, it's an lvalue, and it has all the odd properties
191 contributed by either operand. */
192 op1_lvalue_kind = op1_lvalue_kind | op2_lvalue_kind;
193 /* It's not an ordinary lvalue if it involves either a bit-field or
195 if ((op1_lvalue_kind & ~clk_ordinary) != clk_none)
196 op1_lvalue_kind &= ~clk_ordinary;
197 return op1_lvalue_kind;
200 /* Returns the kind of lvalue that REF is, in the sense of
201 [basic.lval]. This function should really be named lvalue_p; it
202 computes the C++ definition of lvalue. */
205 real_lvalue_p (tree ref)
207 return lvalue_p_1 (ref,
208 /*treat_class_rvalues_as_lvalues=*/0);
211 /* This differs from real_lvalue_p in that class rvalues are
212 considered lvalues. */
218 (lvalue_p_1 (ref, /*class rvalue ok*/ 1) != clk_none);
221 /* Test whether DECL is a builtin that may appear in a
222 constant-expression. */
225 builtin_valid_in_constant_expr_p (tree decl)
227 /* At present BUILT_IN_CONSTANT_P is the only builtin we're allowing
228 in constant-expressions. We may want to add other builtins later. */
229 return DECL_IS_BUILTIN_CONSTANT_P (decl);
232 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
235 build_target_expr (tree decl, tree value)
239 t = build4 (TARGET_EXPR, TREE_TYPE (decl), decl, value,
240 cxx_maybe_build_cleanup (decl), NULL_TREE);
241 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
242 ignore the TARGET_EXPR. If there really turn out to be no
243 side-effects, then the optimizer should be able to get rid of
244 whatever code is generated anyhow. */
245 TREE_SIDE_EFFECTS (t) = 1;
250 /* Return an undeclared local temporary of type TYPE for use in building a
254 build_local_temp (tree type)
256 tree slot = build_decl (VAR_DECL, NULL_TREE, type);
257 DECL_ARTIFICIAL (slot) = 1;
258 DECL_IGNORED_P (slot) = 1;
259 DECL_CONTEXT (slot) = current_function_decl;
260 layout_decl (slot, 0);
264 /* INIT is a CALL_EXPR which needs info about its target.
265 TYPE is the type that this initialization should appear to have.
267 Build an encapsulation of the initialization to perform
268 and return it so that it can be processed by language-independent
269 and language-specific expression expanders. */
272 build_cplus_new (tree type, tree init)
279 /* Make sure that we're not trying to create an instance of an
281 abstract_virtuals_error (NULL_TREE, type);
283 if (TREE_CODE (init) != CALL_EXPR && TREE_CODE (init) != AGGR_INIT_EXPR)
284 return convert (type, init);
286 fn = TREE_OPERAND (init, 0);
287 is_ctor = (TREE_CODE (fn) == ADDR_EXPR
288 && TREE_CODE (TREE_OPERAND (fn, 0)) == FUNCTION_DECL
289 && DECL_CONSTRUCTOR_P (TREE_OPERAND (fn, 0)));
291 slot = build_local_temp (type);
293 /* We split the CALL_EXPR into its function and its arguments here.
294 Then, in expand_expr, we put them back together. The reason for
295 this is that this expression might be a default argument
296 expression. In that case, we need a new temporary every time the
297 expression is used. That's what break_out_target_exprs does; it
298 replaces every AGGR_INIT_EXPR with a copy that uses a fresh
299 temporary slot. Then, expand_expr builds up a call-expression
300 using the new slot. */
302 /* If we don't need to use a constructor to create an object of this
303 type, don't mess with AGGR_INIT_EXPR. */
304 if (is_ctor || TREE_ADDRESSABLE (type))
306 rval = build3 (AGGR_INIT_EXPR, void_type_node, fn,
307 TREE_OPERAND (init, 1), slot);
308 TREE_SIDE_EFFECTS (rval) = 1;
309 AGGR_INIT_VIA_CTOR_P (rval) = is_ctor;
314 rval = build_target_expr (slot, rval);
315 TARGET_EXPR_IMPLICIT_P (rval) = 1;
320 /* Build a TARGET_EXPR using INIT to initialize a new temporary of the
324 build_target_expr_with_type (tree init, tree type)
326 gcc_assert (!VOID_TYPE_P (type));
328 if (TREE_CODE (init) == TARGET_EXPR)
330 else if (CLASS_TYPE_P (type) && !TYPE_HAS_TRIVIAL_INIT_REF (type)
331 && TREE_CODE (init) != COND_EXPR
332 && TREE_CODE (init) != CONSTRUCTOR
333 && TREE_CODE (init) != VA_ARG_EXPR)
334 /* We need to build up a copy constructor call. COND_EXPR is a special
335 case because we already have copies on the arms and we don't want
336 another one here. A CONSTRUCTOR is aggregate initialization, which
337 is handled separately. A VA_ARG_EXPR is magic creation of an
338 aggregate; there's no additional work to be done. */
339 return force_rvalue (init);
341 return force_target_expr (type, init);
344 /* Like the above function, but without the checking. This function should
345 only be used by code which is deliberately trying to subvert the type
346 system, such as call_builtin_trap. */
349 force_target_expr (tree type, tree init)
353 gcc_assert (!VOID_TYPE_P (type));
355 slot = build_local_temp (type);
356 return build_target_expr (slot, init);
359 /* Like build_target_expr_with_type, but use the type of INIT. */
362 get_target_expr (tree init)
364 return build_target_expr_with_type (init, TREE_TYPE (init));
367 /* If EXPR is a bitfield reference, convert it to the declared type of
368 the bitfield, and return the resulting expression. Otherwise,
369 return EXPR itself. */
372 convert_bitfield_to_declared_type (tree expr)
376 bitfield_type = is_bitfield_expr_with_lowered_type (expr);
378 expr = convert_to_integer (TYPE_MAIN_VARIANT (bitfield_type),
383 /* EXPR is being used in an rvalue context. Return a version of EXPR
384 that is marked as an rvalue. */
391 if (error_operand_p (expr))
396 Non-class rvalues always have cv-unqualified types. */
397 type = TREE_TYPE (expr);
398 if (!CLASS_TYPE_P (type) && cp_type_quals (type))
399 type = TYPE_MAIN_VARIANT (type);
401 if (!processing_template_decl && real_lvalue_p (expr))
402 expr = build1 (NON_LVALUE_EXPR, type, expr);
403 else if (type != TREE_TYPE (expr))
404 expr = build_nop (type, expr);
411 build_cplus_array_type_1 (tree elt_type, tree index_type)
415 if (elt_type == error_mark_node || index_type == error_mark_node)
416 return error_mark_node;
418 if (dependent_type_p (elt_type)
420 && value_dependent_expression_p (TYPE_MAX_VALUE (index_type))))
422 t = make_node (ARRAY_TYPE);
423 TREE_TYPE (t) = elt_type;
424 TYPE_DOMAIN (t) = index_type;
427 t = build_array_type (elt_type, index_type);
429 /* Push these needs up so that initialization takes place
431 TYPE_NEEDS_CONSTRUCTING (t)
432 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (elt_type));
433 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
434 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (elt_type));
439 build_cplus_array_type (tree elt_type, tree index_type)
442 int type_quals = cp_type_quals (elt_type);
444 if (type_quals != TYPE_UNQUALIFIED)
445 elt_type = cp_build_qualified_type (elt_type, TYPE_UNQUALIFIED);
447 t = build_cplus_array_type_1 (elt_type, index_type);
449 if (type_quals != TYPE_UNQUALIFIED)
450 t = cp_build_qualified_type (t, type_quals);
455 /* Make a variant of TYPE, qualified with the TYPE_QUALS. Handles
456 arrays correctly. In particular, if TYPE is an array of T's, and
457 TYPE_QUALS is non-empty, returns an array of qualified T's.
459 FLAGS determines how to deal with illformed qualifications. If
460 tf_ignore_bad_quals is set, then bad qualifications are dropped
461 (this is permitted if TYPE was introduced via a typedef or template
462 type parameter). If bad qualifications are dropped and tf_warning
463 is set, then a warning is issued for non-const qualifications. If
464 tf_ignore_bad_quals is not set and tf_error is not set, we
465 return error_mark_node. Otherwise, we issue an error, and ignore
468 Qualification of a reference type is valid when the reference came
469 via a typedef or template type argument. [dcl.ref] No such
470 dispensation is provided for qualifying a function type. [dcl.fct]
471 DR 295 queries this and the proposed resolution brings it into line
472 with qualifying a reference. We implement the DR. We also behave
473 in a similar manner for restricting non-pointer types. */
476 cp_build_qualified_type_real (tree type,
478 tsubst_flags_t complain)
481 int bad_quals = TYPE_UNQUALIFIED;
483 if (type == error_mark_node)
486 if (type_quals == cp_type_quals (type))
489 if (TREE_CODE (type) == ARRAY_TYPE)
491 /* In C++, the qualification really applies to the array element
492 type. Obtain the appropriately qualified element type. */
495 = cp_build_qualified_type_real (TREE_TYPE (type),
499 if (element_type == error_mark_node)
500 return error_mark_node;
502 /* See if we already have an identically qualified type. */
503 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
504 if (cp_type_quals (t) == type_quals
505 && TYPE_NAME (t) == TYPE_NAME (type)
506 && TYPE_CONTEXT (t) == TYPE_CONTEXT (type))
511 /* Make a new array type, just like the old one, but with the
512 appropriately qualified element type. */
513 t = build_variant_type_copy (type);
514 TREE_TYPE (t) = element_type;
517 /* Even if we already had this variant, we update
518 TYPE_NEEDS_CONSTRUCTING and TYPE_HAS_NONTRIVIAL_DESTRUCTOR in case
519 they changed since the variant was originally created.
521 This seems hokey; if there is some way to use a previous
522 variant *without* coming through here,
523 TYPE_NEEDS_CONSTRUCTING will never be updated. */
524 TYPE_NEEDS_CONSTRUCTING (t)
525 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (element_type));
526 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
527 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (element_type));
530 else if (TYPE_PTRMEMFUNC_P (type))
532 /* For a pointer-to-member type, we can't just return a
533 cv-qualified version of the RECORD_TYPE. If we do, we
534 haven't changed the field that contains the actual pointer to
535 a method, and so TYPE_PTRMEMFUNC_FN_TYPE will be wrong. */
538 t = TYPE_PTRMEMFUNC_FN_TYPE (type);
539 t = cp_build_qualified_type_real (t, type_quals, complain);
540 return build_ptrmemfunc_type (t);
543 /* A reference or method type shall not be cv qualified.
544 [dcl.ref], [dct.fct] */
545 if (type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE)
546 && (TREE_CODE (type) == REFERENCE_TYPE
547 || TREE_CODE (type) == METHOD_TYPE))
549 bad_quals |= type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
550 type_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
553 /* A restrict-qualified type must be a pointer (or reference)
554 to object or incomplete type, or a function type. */
555 if ((type_quals & TYPE_QUAL_RESTRICT)
556 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
557 && TREE_CODE (type) != TYPENAME_TYPE
558 && TREE_CODE (type) != FUNCTION_TYPE
559 && !POINTER_TYPE_P (type))
561 bad_quals |= TYPE_QUAL_RESTRICT;
562 type_quals &= ~TYPE_QUAL_RESTRICT;
565 if (bad_quals == TYPE_UNQUALIFIED)
567 else if (!(complain & (tf_error | tf_ignore_bad_quals)))
568 return error_mark_node;
571 if (complain & tf_ignore_bad_quals)
572 /* We're not going to warn about constifying things that can't
574 bad_quals &= ~TYPE_QUAL_CONST;
577 tree bad_type = build_qualified_type (ptr_type_node, bad_quals);
579 if (!(complain & tf_ignore_bad_quals))
580 error ("%qV qualifiers cannot be applied to %qT",
585 /* Retrieve (or create) the appropriately qualified variant. */
586 result = build_qualified_type (type, type_quals);
588 /* If this was a pointer-to-method type, and we just made a copy,
589 then we need to unshare the record that holds the cached
590 pointer-to-member-function type, because these will be distinct
591 between the unqualified and qualified types. */
593 && TREE_CODE (type) == POINTER_TYPE
594 && TREE_CODE (TREE_TYPE (type)) == METHOD_TYPE)
595 TYPE_LANG_SPECIFIC (result) = NULL;
600 /* Returns the canonical version of TYPE. In other words, if TYPE is
601 a typedef, returns the underlying type. The cv-qualification of
602 the type returned matches the type input; they will always be
606 canonical_type_variant (tree t)
608 return cp_build_qualified_type (TYPE_MAIN_VARIANT (t), cp_type_quals (t));
611 /* Makes a copy of BINFO and TYPE, which is to be inherited into a
612 graph dominated by T. If BINFO is NULL, TYPE is a dependent base,
613 and we do a shallow copy. If BINFO is non-NULL, we do a deep copy.
614 VIRT indicates whether TYPE is inherited virtually or not.
615 IGO_PREV points at the previous binfo of the inheritance graph
616 order chain. The newly copied binfo's TREE_CHAIN forms this
619 The CLASSTYPE_VBASECLASSES vector of T is constructed in the
620 correct order. That is in the order the bases themselves should be
623 The BINFO_INHERITANCE of a virtual base class points to the binfo
624 of the most derived type. ??? We could probably change this so that
625 BINFO_INHERITANCE becomes synonymous with BINFO_PRIMARY, and hence
626 remove a field. They currently can only differ for primary virtual
630 copy_binfo (tree binfo, tree type, tree t, tree *igo_prev, int virt)
636 /* See if we've already made this virtual base. */
637 new_binfo = binfo_for_vbase (type, t);
642 new_binfo = make_tree_binfo (binfo ? BINFO_N_BASE_BINFOS (binfo) : 0);
643 BINFO_TYPE (new_binfo) = type;
645 /* Chain it into the inheritance graph. */
646 TREE_CHAIN (*igo_prev) = new_binfo;
647 *igo_prev = new_binfo;
654 gcc_assert (!BINFO_DEPENDENT_BASE_P (binfo));
655 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), type));
657 BINFO_OFFSET (new_binfo) = BINFO_OFFSET (binfo);
658 BINFO_VIRTUALS (new_binfo) = BINFO_VIRTUALS (binfo);
660 /* We do not need to copy the accesses, as they are read only. */
661 BINFO_BASE_ACCESSES (new_binfo) = BINFO_BASE_ACCESSES (binfo);
663 /* Recursively copy base binfos of BINFO. */
664 for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++)
668 gcc_assert (!BINFO_DEPENDENT_BASE_P (base_binfo));
669 new_base_binfo = copy_binfo (base_binfo, BINFO_TYPE (base_binfo),
671 BINFO_VIRTUAL_P (base_binfo));
673 if (!BINFO_INHERITANCE_CHAIN (new_base_binfo))
674 BINFO_INHERITANCE_CHAIN (new_base_binfo) = new_binfo;
675 BINFO_BASE_APPEND (new_binfo, new_base_binfo);
679 BINFO_DEPENDENT_BASE_P (new_binfo) = 1;
683 /* Push it onto the list after any virtual bases it contains
684 will have been pushed. */
685 VEC_quick_push (tree, CLASSTYPE_VBASECLASSES (t), new_binfo);
686 BINFO_VIRTUAL_P (new_binfo) = 1;
687 BINFO_INHERITANCE_CHAIN (new_binfo) = TYPE_BINFO (t);
693 /* Hashing of lists so that we don't make duplicates.
694 The entry point is `list_hash_canon'. */
696 /* Now here is the hash table. When recording a list, it is added
697 to the slot whose index is the hash code mod the table size.
698 Note that the hash table is used for several kinds of lists.
699 While all these live in the same table, they are completely independent,
700 and the hash code is computed differently for each of these. */
702 static GTY ((param_is (union tree_node))) htab_t list_hash_table;
711 /* Compare ENTRY (an entry in the hash table) with DATA (a list_proxy
712 for a node we are thinking about adding). */
715 list_hash_eq (const void* entry, const void* data)
717 tree t = (tree) entry;
718 struct list_proxy *proxy = (struct list_proxy *) data;
720 return (TREE_VALUE (t) == proxy->value
721 && TREE_PURPOSE (t) == proxy->purpose
722 && TREE_CHAIN (t) == proxy->chain);
725 /* Compute a hash code for a list (chain of TREE_LIST nodes
726 with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the
727 TREE_COMMON slots), by adding the hash codes of the individual entries. */
730 list_hash_pieces (tree purpose, tree value, tree chain)
732 hashval_t hashcode = 0;
735 hashcode += TREE_HASH (chain);
738 hashcode += TREE_HASH (value);
742 hashcode += TREE_HASH (purpose);
748 /* Hash an already existing TREE_LIST. */
751 list_hash (const void* p)
754 return list_hash_pieces (TREE_PURPOSE (t),
759 /* Given list components PURPOSE, VALUE, AND CHAIN, return the canonical
760 object for an identical list if one already exists. Otherwise, build a
761 new one, and record it as the canonical object. */
764 hash_tree_cons (tree purpose, tree value, tree chain)
768 struct list_proxy proxy;
770 /* Hash the list node. */
771 hashcode = list_hash_pieces (purpose, value, chain);
772 /* Create a proxy for the TREE_LIST we would like to create. We
773 don't actually create it so as to avoid creating garbage. */
774 proxy.purpose = purpose;
777 /* See if it is already in the table. */
778 slot = htab_find_slot_with_hash (list_hash_table, &proxy, hashcode,
780 /* If not, create a new node. */
782 *slot = tree_cons (purpose, value, chain);
786 /* Constructor for hashed lists. */
789 hash_tree_chain (tree value, tree chain)
791 return hash_tree_cons (NULL_TREE, value, chain);
795 debug_binfo (tree elem)
800 fprintf (stderr, "type \"%s\", offset = " HOST_WIDE_INT_PRINT_DEC
802 TYPE_NAME_STRING (BINFO_TYPE (elem)),
803 TREE_INT_CST_LOW (BINFO_OFFSET (elem)));
804 debug_tree (BINFO_TYPE (elem));
805 if (BINFO_VTABLE (elem))
806 fprintf (stderr, "vtable decl \"%s\"\n",
807 IDENTIFIER_POINTER (DECL_NAME (get_vtbl_decl_for_binfo (elem))));
809 fprintf (stderr, "no vtable decl yet\n");
810 fprintf (stderr, "virtuals:\n");
811 virtuals = BINFO_VIRTUALS (elem);
816 tree fndecl = TREE_VALUE (virtuals);
817 fprintf (stderr, "%s [%ld =? %ld]\n",
818 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl)),
819 (long) n, (long) TREE_INT_CST_LOW (DECL_VINDEX (fndecl)));
821 virtuals = TREE_CHAIN (virtuals);
825 /* Build a representation for the qualified name SCOPE::NAME. TYPE is
826 the type of the result expression, if known, or NULL_TREE if the
827 resulting expression is type-dependent. If TEMPLATE_P is true,
828 NAME is known to be a template because the user explicitly used the
829 "template" keyword after the "::".
831 All SCOPE_REFs should be built by use of this function. */
834 build_qualified_name (tree type, tree scope, tree name, bool template_p)
837 if (type == error_mark_node
838 || scope == error_mark_node
839 || name == error_mark_node)
840 return error_mark_node;
841 t = build2 (SCOPE_REF, type, scope, name);
842 QUALIFIED_NAME_IS_TEMPLATE (t) = template_p;
846 /* Returns non-zero if X is an expression for a (possibly overloaded)
847 function. If "f" is a function or function template, "f", "c->f",
848 "c.f", "C::f", and "f<int>" will all be considered possibly
849 overloaded functions. Returns 2 if the function is actually
850 overloaded, i.e., if it is impossible to know the the type of the
851 function without performing overload resolution. */
854 is_overloaded_fn (tree x)
856 /* A baselink is also considered an overloaded function. */
857 if (TREE_CODE (x) == OFFSET_REF
858 || TREE_CODE (x) == COMPONENT_REF)
859 x = TREE_OPERAND (x, 1);
861 x = BASELINK_FUNCTIONS (x);
862 if (TREE_CODE (x) == TEMPLATE_ID_EXPR
863 || DECL_FUNCTION_TEMPLATE_P (OVL_CURRENT (x))
864 || (TREE_CODE (x) == OVERLOAD && OVL_CHAIN (x)))
866 return (TREE_CODE (x) == FUNCTION_DECL
867 || TREE_CODE (x) == OVERLOAD);
870 /* Returns true iff X is an expression for an overloaded function
871 whose type cannot be known without performing overload
875 really_overloaded_fn (tree x)
877 return is_overloaded_fn (x) == 2;
881 get_first_fn (tree from)
883 gcc_assert (is_overloaded_fn (from));
884 /* A baselink is also considered an overloaded function. */
885 if (TREE_CODE (from) == COMPONENT_REF)
886 from = TREE_OPERAND (from, 1);
887 if (BASELINK_P (from))
888 from = BASELINK_FUNCTIONS (from);
889 return OVL_CURRENT (from);
892 /* Return a new OVL node, concatenating it with the old one. */
895 ovl_cons (tree decl, tree chain)
897 tree result = make_node (OVERLOAD);
898 TREE_TYPE (result) = unknown_type_node;
899 OVL_FUNCTION (result) = decl;
900 TREE_CHAIN (result) = chain;
905 /* Build a new overloaded function. If this is the first one,
906 just return it; otherwise, ovl_cons the _DECLs */
909 build_overload (tree decl, tree chain)
911 if (! chain && TREE_CODE (decl) != TEMPLATE_DECL)
913 if (chain && TREE_CODE (chain) != OVERLOAD)
914 chain = ovl_cons (chain, NULL_TREE);
915 return ovl_cons (decl, chain);
919 #define PRINT_RING_SIZE 4
922 cxx_printable_name (tree decl, int v)
924 static tree decl_ring[PRINT_RING_SIZE];
925 static char *print_ring[PRINT_RING_SIZE];
926 static int ring_counter;
929 /* Only cache functions. */
931 || TREE_CODE (decl) != FUNCTION_DECL
932 || DECL_LANG_SPECIFIC (decl) == 0)
933 return lang_decl_name (decl, v);
935 /* See if this print name is lying around. */
936 for (i = 0; i < PRINT_RING_SIZE; i++)
937 if (decl_ring[i] == decl)
938 /* yes, so return it. */
939 return print_ring[i];
941 if (++ring_counter == PRINT_RING_SIZE)
944 if (current_function_decl != NULL_TREE)
946 if (decl_ring[ring_counter] == current_function_decl)
948 if (ring_counter == PRINT_RING_SIZE)
950 gcc_assert (decl_ring[ring_counter] != current_function_decl);
953 if (print_ring[ring_counter])
954 free (print_ring[ring_counter]);
956 print_ring[ring_counter] = xstrdup (lang_decl_name (decl, v));
957 decl_ring[ring_counter] = decl;
958 return print_ring[ring_counter];
961 /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions
965 build_exception_variant (tree type, tree raises)
967 tree v = TYPE_MAIN_VARIANT (type);
968 int type_quals = TYPE_QUALS (type);
970 for (; v; v = TYPE_NEXT_VARIANT (v))
971 if (check_qualified_type (v, type, type_quals)
972 && comp_except_specs (raises, TYPE_RAISES_EXCEPTIONS (v), 1))
975 /* Need to build a new variant. */
976 v = build_variant_type_copy (type);
977 TYPE_RAISES_EXCEPTIONS (v) = raises;
981 /* Given a TEMPLATE_TEMPLATE_PARM node T, create a new
982 BOUND_TEMPLATE_TEMPLATE_PARM bound with NEWARGS as its template
986 bind_template_template_parm (tree t, tree newargs)
988 tree decl = TYPE_NAME (t);
991 t2 = make_aggr_type (BOUND_TEMPLATE_TEMPLATE_PARM);
992 decl = build_decl (TYPE_DECL, DECL_NAME (decl), NULL_TREE);
994 /* These nodes have to be created to reflect new TYPE_DECL and template
996 TEMPLATE_TYPE_PARM_INDEX (t2) = copy_node (TEMPLATE_TYPE_PARM_INDEX (t));
997 TEMPLATE_PARM_DECL (TEMPLATE_TYPE_PARM_INDEX (t2)) = decl;
998 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2)
999 = tree_cons (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t),
1000 newargs, NULL_TREE);
1002 TREE_TYPE (decl) = t2;
1003 TYPE_NAME (t2) = decl;
1004 TYPE_STUB_DECL (t2) = decl;
1010 /* Called from count_trees via walk_tree. */
1013 count_trees_r (tree *tp, int *walk_subtrees, void *data)
1023 /* Debugging function for measuring the rough complexity of a tree
1027 count_trees (tree t)
1030 walk_tree_without_duplicates (&t, count_trees_r, &n_trees);
1034 /* Called from verify_stmt_tree via walk_tree. */
1037 verify_stmt_tree_r (tree* tp,
1038 int* walk_subtrees ATTRIBUTE_UNUSED ,
1042 htab_t *statements = (htab_t *) data;
1045 if (!STATEMENT_CODE_P (TREE_CODE (t)))
1048 /* If this statement is already present in the hash table, then
1049 there is a circularity in the statement tree. */
1050 gcc_assert (!htab_find (*statements, t));
1052 slot = htab_find_slot (*statements, t, INSERT);
1058 /* Debugging function to check that the statement T has not been
1059 corrupted. For now, this function simply checks that T contains no
1063 verify_stmt_tree (tree t)
1066 statements = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
1067 walk_tree (&t, verify_stmt_tree_r, &statements, NULL);
1068 htab_delete (statements);
1071 /* Check if the type T depends on a type with no linkage and if so, return
1072 it. If RELAXED_P then do not consider a class type declared within
1073 a TREE_PUBLIC function to have no linkage. */
1076 no_linkage_check (tree t, bool relaxed_p)
1080 /* There's no point in checking linkage on template functions; we
1081 can't know their complete types. */
1082 if (processing_template_decl)
1085 switch (TREE_CODE (t))
1090 if (TYPE_PTRMEMFUNC_P (t))
1094 if (!CLASS_TYPE_P (t))
1098 if (TYPE_ANONYMOUS_P (t))
1100 fn = decl_function_context (TYPE_MAIN_DECL (t));
1101 if (fn && (!relaxed_p || !TREE_PUBLIC (fn)))
1107 case REFERENCE_TYPE:
1108 return no_linkage_check (TREE_TYPE (t), relaxed_p);
1112 r = no_linkage_check (TYPE_PTRMEM_POINTED_TO_TYPE (t),
1116 return no_linkage_check (TYPE_PTRMEM_CLASS_TYPE (t), relaxed_p);
1119 r = no_linkage_check (TYPE_METHOD_BASETYPE (t), relaxed_p);
1126 for (parm = TYPE_ARG_TYPES (t);
1127 parm && parm != void_list_node;
1128 parm = TREE_CHAIN (parm))
1130 r = no_linkage_check (TREE_VALUE (parm), relaxed_p);
1134 return no_linkage_check (TREE_TYPE (t), relaxed_p);
1142 #ifdef GATHER_STATISTICS
1143 extern int depth_reached;
1147 cxx_print_statistics (void)
1149 print_search_statistics ();
1150 print_class_statistics ();
1151 #ifdef GATHER_STATISTICS
1152 fprintf (stderr, "maximum template instantiation depth reached: %d\n",
1157 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1158 (which is an ARRAY_TYPE). This counts only elements of the top
1162 array_type_nelts_top (tree type)
1164 return fold_build2 (PLUS_EXPR, sizetype,
1165 array_type_nelts (type),
1169 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1170 (which is an ARRAY_TYPE). This one is a recursive count of all
1171 ARRAY_TYPEs that are clumped together. */
1174 array_type_nelts_total (tree type)
1176 tree sz = array_type_nelts_top (type);
1177 type = TREE_TYPE (type);
1178 while (TREE_CODE (type) == ARRAY_TYPE)
1180 tree n = array_type_nelts_top (type);
1181 sz = fold_build2 (MULT_EXPR, sizetype, sz, n);
1182 type = TREE_TYPE (type);
1187 /* Called from break_out_target_exprs via mapcar. */
1190 bot_manip (tree* tp, int* walk_subtrees, void* data)
1192 splay_tree target_remap = ((splay_tree) data);
1195 if (!TYPE_P (t) && TREE_CONSTANT (t))
1197 /* There can't be any TARGET_EXPRs or their slot variables below
1198 this point. We used to check !TREE_SIDE_EFFECTS, but then we
1199 failed to copy an ADDR_EXPR of the slot VAR_DECL. */
1203 if (TREE_CODE (t) == TARGET_EXPR)
1207 if (TREE_CODE (TREE_OPERAND (t, 1)) == AGGR_INIT_EXPR)
1209 (TREE_TYPE (t), break_out_target_exprs (TREE_OPERAND (t, 1)));
1211 u = build_target_expr_with_type
1212 (break_out_target_exprs (TREE_OPERAND (t, 1)), TREE_TYPE (t));
1214 /* Map the old variable to the new one. */
1215 splay_tree_insert (target_remap,
1216 (splay_tree_key) TREE_OPERAND (t, 0),
1217 (splay_tree_value) TREE_OPERAND (u, 0));
1219 /* Replace the old expression with the new version. */
1221 /* We don't have to go below this point; the recursive call to
1222 break_out_target_exprs will have handled anything below this
1228 /* Make a copy of this node. */
1229 return copy_tree_r (tp, walk_subtrees, NULL);
1232 /* Replace all remapped VAR_DECLs in T with their new equivalents.
1233 DATA is really a splay-tree mapping old variables to new
1237 bot_replace (tree* t,
1238 int* walk_subtrees ATTRIBUTE_UNUSED ,
1241 splay_tree target_remap = ((splay_tree) data);
1243 if (TREE_CODE (*t) == VAR_DECL)
1245 splay_tree_node n = splay_tree_lookup (target_remap,
1246 (splay_tree_key) *t);
1248 *t = (tree) n->value;
1254 /* When we parse a default argument expression, we may create
1255 temporary variables via TARGET_EXPRs. When we actually use the
1256 default-argument expression, we make a copy of the expression, but
1257 we must replace the temporaries with appropriate local versions. */
1260 break_out_target_exprs (tree t)
1262 static int target_remap_count;
1263 static splay_tree target_remap;
1265 if (!target_remap_count++)
1266 target_remap = splay_tree_new (splay_tree_compare_pointers,
1267 /*splay_tree_delete_key_fn=*/NULL,
1268 /*splay_tree_delete_value_fn=*/NULL);
1269 walk_tree (&t, bot_manip, target_remap, NULL);
1270 walk_tree (&t, bot_replace, target_remap, NULL);
1272 if (!--target_remap_count)
1274 splay_tree_delete (target_remap);
1275 target_remap = NULL;
1281 /* Similar to `build_nt', but for template definitions of dependent
1285 build_min_nt (enum tree_code code, ...)
1294 t = make_node (code);
1295 length = TREE_CODE_LENGTH (code);
1297 for (i = 0; i < length; i++)
1299 tree x = va_arg (p, tree);
1300 TREE_OPERAND (t, i) = x;
1307 /* Similar to `build', but for template definitions. */
1310 build_min (enum tree_code code, tree tt, ...)
1319 t = make_node (code);
1320 length = TREE_CODE_LENGTH (code);
1323 for (i = 0; i < length; i++)
1325 tree x = va_arg (p, tree);
1326 TREE_OPERAND (t, i) = x;
1327 if (x && !TYPE_P (x) && TREE_SIDE_EFFECTS (x))
1328 TREE_SIDE_EFFECTS (t) = 1;
1335 /* Similar to `build', but for template definitions of non-dependent
1336 expressions. NON_DEP is the non-dependent expression that has been
1340 build_min_non_dep (enum tree_code code, tree non_dep, ...)
1347 va_start (p, non_dep);
1349 t = make_node (code);
1350 length = TREE_CODE_LENGTH (code);
1351 TREE_TYPE (t) = TREE_TYPE (non_dep);
1352 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (non_dep);
1354 for (i = 0; i < length; i++)
1356 tree x = va_arg (p, tree);
1357 TREE_OPERAND (t, i) = x;
1360 if (code == COMPOUND_EXPR && TREE_CODE (non_dep) != COMPOUND_EXPR)
1361 /* This should not be considered a COMPOUND_EXPR, because it
1362 resolves to an overload. */
1363 COMPOUND_EXPR_OVERLOADED (t) = 1;
1370 get_type_decl (tree t)
1372 if (TREE_CODE (t) == TYPE_DECL)
1375 return TYPE_STUB_DECL (t);
1376 gcc_assert (t == error_mark_node);
1380 /* Returns the namespace that contains DECL, whether directly or
1384 decl_namespace_context (tree decl)
1388 if (TREE_CODE (decl) == NAMESPACE_DECL)
1390 else if (TYPE_P (decl))
1391 decl = CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl));
1393 decl = CP_DECL_CONTEXT (decl);
1397 /* Returns true if decl is within an anonymous namespace, however deeply
1398 nested, or false otherwise. */
1401 decl_anon_ns_mem_p (tree decl)
1405 if (decl == NULL_TREE || decl == error_mark_node)
1407 if (TREE_CODE (decl) == NAMESPACE_DECL
1408 && DECL_NAME (decl) == NULL_TREE)
1410 /* Classes and namespaces inside anonymous namespaces have
1411 TREE_PUBLIC == 0, so we can shortcut the search. */
1412 else if (TYPE_P (decl))
1413 return (TREE_PUBLIC (TYPE_NAME (decl)) == 0);
1414 else if (TREE_CODE (decl) == NAMESPACE_DECL)
1415 return (TREE_PUBLIC (decl) == 0);
1417 decl = DECL_CONTEXT (decl);
1421 /* Return truthvalue of whether T1 is the same tree structure as T2.
1422 Return 1 if they are the same. Return 0 if they are different. */
1425 cp_tree_equal (tree t1, tree t2)
1427 enum tree_code code1, code2;
1434 for (code1 = TREE_CODE (t1);
1435 code1 == NOP_EXPR || code1 == CONVERT_EXPR
1436 || code1 == NON_LVALUE_EXPR;
1437 code1 = TREE_CODE (t1))
1438 t1 = TREE_OPERAND (t1, 0);
1439 for (code2 = TREE_CODE (t2);
1440 code2 == NOP_EXPR || code2 == CONVERT_EXPR
1441 || code1 == NON_LVALUE_EXPR;
1442 code2 = TREE_CODE (t2))
1443 t2 = TREE_OPERAND (t2, 0);
1445 /* They might have become equal now. */
1455 return TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
1456 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2);
1459 return REAL_VALUES_EQUAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
1462 return TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
1463 && !memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
1464 TREE_STRING_LENGTH (t1));
1467 /* We need to do this when determining whether or not two
1468 non-type pointer to member function template arguments
1470 if (!(same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
1471 /* The first operand is RTL. */
1472 && TREE_OPERAND (t1, 0) == TREE_OPERAND (t2, 0)))
1474 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1477 if (!cp_tree_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2)))
1479 if (!cp_tree_equal (TREE_VALUE (t1), TREE_VALUE (t2)))
1481 return cp_tree_equal (TREE_CHAIN (t1), TREE_CHAIN (t2));
1484 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1487 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1489 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1493 tree o1 = TREE_OPERAND (t1, 0);
1494 tree o2 = TREE_OPERAND (t2, 0);
1496 /* Special case: if either target is an unallocated VAR_DECL,
1497 it means that it's going to be unified with whatever the
1498 TARGET_EXPR is really supposed to initialize, so treat it
1499 as being equivalent to anything. */
1500 if (TREE_CODE (o1) == VAR_DECL && DECL_NAME (o1) == NULL_TREE
1501 && !DECL_RTL_SET_P (o1))
1503 else if (TREE_CODE (o2) == VAR_DECL && DECL_NAME (o2) == NULL_TREE
1504 && !DECL_RTL_SET_P (o2))
1506 else if (!cp_tree_equal (o1, o2))
1509 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1512 case WITH_CLEANUP_EXPR:
1513 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1515 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
1518 if (TREE_OPERAND (t1, 1) != TREE_OPERAND (t2, 1))
1520 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1527 case IDENTIFIER_NODE:
1532 return (BASELINK_BINFO (t1) == BASELINK_BINFO (t2)
1533 && BASELINK_ACCESS_BINFO (t1) == BASELINK_ACCESS_BINFO (t2)
1534 && cp_tree_equal (BASELINK_FUNCTIONS (t1),
1535 BASELINK_FUNCTIONS (t2)));
1537 case TEMPLATE_PARM_INDEX:
1538 return (TEMPLATE_PARM_IDX (t1) == TEMPLATE_PARM_IDX (t2)
1539 && TEMPLATE_PARM_LEVEL (t1) == TEMPLATE_PARM_LEVEL (t2)
1540 && same_type_p (TREE_TYPE (TEMPLATE_PARM_DECL (t1)),
1541 TREE_TYPE (TEMPLATE_PARM_DECL (t2))));
1543 case TEMPLATE_ID_EXPR:
1548 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1550 vec1 = TREE_OPERAND (t1, 1);
1551 vec2 = TREE_OPERAND (t2, 1);
1554 return !vec1 && !vec2;
1556 if (TREE_VEC_LENGTH (vec1) != TREE_VEC_LENGTH (vec2))
1559 for (ix = TREE_VEC_LENGTH (vec1); ix--;)
1560 if (!cp_tree_equal (TREE_VEC_ELT (vec1, ix),
1561 TREE_VEC_ELT (vec2, ix)))
1570 tree o1 = TREE_OPERAND (t1, 0);
1571 tree o2 = TREE_OPERAND (t2, 0);
1573 if (TREE_CODE (o1) != TREE_CODE (o2))
1576 return same_type_p (o1, o2);
1578 return cp_tree_equal (o1, o2);
1582 /* Two pointer-to-members are the same if they point to the same
1583 field or function in the same class. */
1584 if (PTRMEM_CST_MEMBER (t1) != PTRMEM_CST_MEMBER (t2))
1587 return same_type_p (PTRMEM_CST_CLASS (t1), PTRMEM_CST_CLASS (t2));
1590 if (OVL_FUNCTION (t1) != OVL_FUNCTION (t2))
1592 return cp_tree_equal (OVL_CHAIN (t1), OVL_CHAIN (t2));
1598 switch (TREE_CODE_CLASS (code1))
1602 case tcc_comparison:
1603 case tcc_expression:
1609 for (i = 0; i < TREE_CODE_LENGTH (code1); ++i)
1610 if (!cp_tree_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i)))
1617 return same_type_p (t1, t2);
1621 /* We can get here with --disable-checking. */
1625 /* The type of ARG when used as an lvalue. */
1628 lvalue_type (tree arg)
1630 tree type = TREE_TYPE (arg);
1634 /* The type of ARG for printing error messages; denote lvalues with
1638 error_type (tree arg)
1640 tree type = TREE_TYPE (arg);
1642 if (TREE_CODE (type) == ARRAY_TYPE)
1644 else if (TREE_CODE (type) == ERROR_MARK)
1646 else if (real_lvalue_p (arg))
1647 type = build_reference_type (lvalue_type (arg));
1648 else if (IS_AGGR_TYPE (type))
1649 type = lvalue_type (arg);
1654 /* Does FUNCTION use a variable-length argument list? */
1657 varargs_function_p (tree function)
1659 tree parm = TYPE_ARG_TYPES (TREE_TYPE (function));
1660 for (; parm; parm = TREE_CHAIN (parm))
1661 if (TREE_VALUE (parm) == void_type_node)
1666 /* Returns 1 if decl is a member of a class. */
1669 member_p (tree decl)
1671 const tree ctx = DECL_CONTEXT (decl);
1672 return (ctx && TYPE_P (ctx));
1675 /* Create a placeholder for member access where we don't actually have an
1676 object that the access is against. */
1679 build_dummy_object (tree type)
1681 tree decl = build1 (NOP_EXPR, build_pointer_type (type), void_zero_node);
1682 return build_indirect_ref (decl, NULL);
1685 /* We've gotten a reference to a member of TYPE. Return *this if appropriate,
1686 or a dummy object otherwise. If BINFOP is non-0, it is filled with the
1687 binfo path from current_class_type to TYPE, or 0. */
1690 maybe_dummy_object (tree type, tree* binfop)
1695 if (current_class_type
1696 && (binfo = lookup_base (current_class_type, type,
1697 ba_unique | ba_quiet, NULL)))
1698 context = current_class_type;
1701 /* Reference from a nested class member function. */
1703 binfo = TYPE_BINFO (type);
1709 if (current_class_ref && context == current_class_type
1710 /* Kludge: Make sure that current_class_type is actually
1711 correct. It might not be if we're in the middle of
1712 tsubst_default_argument. */
1713 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref)),
1714 current_class_type))
1715 decl = current_class_ref;
1717 decl = build_dummy_object (context);
1722 /* Returns 1 if OB is a placeholder object, or a pointer to one. */
1725 is_dummy_object (tree ob)
1727 if (TREE_CODE (ob) == INDIRECT_REF)
1728 ob = TREE_OPERAND (ob, 0);
1729 return (TREE_CODE (ob) == NOP_EXPR
1730 && TREE_OPERAND (ob, 0) == void_zero_node);
1733 /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */
1738 t = strip_array_types (t);
1740 if (t == error_mark_node)
1742 if (INTEGRAL_TYPE_P (t))
1743 return 1; /* integral, character or enumeral type */
1744 if (FLOAT_TYPE_P (t))
1747 return 1; /* pointer to non-member */
1748 if (TYPE_PTR_TO_MEMBER_P (t))
1749 return 1; /* pointer to member */
1751 if (TREE_CODE (t) == VECTOR_TYPE)
1752 return 1; /* vectors are (small) arrays of scalars */
1754 if (! CLASS_TYPE_P (t))
1755 return 0; /* other non-class type (reference or function) */
1756 if (CLASSTYPE_NON_POD_P (t))
1761 /* Returns 1 iff zero initialization of type T means actually storing
1765 zero_init_p (tree t)
1767 t = strip_array_types (t);
1769 if (t == error_mark_node)
1772 /* NULL pointers to data members are initialized with -1. */
1773 if (TYPE_PTRMEM_P (t))
1776 /* Classes that contain types that can't be zero-initialized, cannot
1777 be zero-initialized themselves. */
1778 if (CLASS_TYPE_P (t) && CLASSTYPE_NON_ZERO_INIT_P (t))
1784 /* Table of valid C++ attributes. */
1785 const struct attribute_spec cxx_attribute_table[] =
1787 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
1788 { "java_interface", 0, 0, false, false, false, handle_java_interface_attribute },
1789 { "com_interface", 0, 0, false, false, false, handle_com_interface_attribute },
1790 { "init_priority", 1, 1, true, false, false, handle_init_priority_attribute },
1791 { NULL, 0, 0, false, false, false, NULL }
1794 /* Handle a "java_interface" attribute; arguments as in
1795 struct attribute_spec.handler. */
1797 handle_java_interface_attribute (tree* node,
1799 tree args ATTRIBUTE_UNUSED ,
1804 || !CLASS_TYPE_P (*node)
1805 || !TYPE_FOR_JAVA (*node))
1807 error ("%qE attribute can only be applied to Java class definitions",
1809 *no_add_attrs = true;
1812 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
1813 *node = build_variant_type_copy (*node);
1814 TYPE_JAVA_INTERFACE (*node) = 1;
1819 /* Handle a "com_interface" attribute; arguments as in
1820 struct attribute_spec.handler. */
1822 handle_com_interface_attribute (tree* node,
1824 tree args ATTRIBUTE_UNUSED ,
1825 int flags ATTRIBUTE_UNUSED ,
1830 *no_add_attrs = true;
1833 || !CLASS_TYPE_P (*node)
1834 || *node != TYPE_MAIN_VARIANT (*node))
1836 warning (OPT_Wattributes, "%qE attribute can only be applied "
1837 "to class definitions", name);
1842 warning (0, "%qE is obsolete; g++ vtables are now COM-compatible by default",
1848 /* Handle an "init_priority" attribute; arguments as in
1849 struct attribute_spec.handler. */
1851 handle_init_priority_attribute (tree* node,
1854 int flags ATTRIBUTE_UNUSED ,
1857 tree initp_expr = TREE_VALUE (args);
1859 tree type = TREE_TYPE (decl);
1862 STRIP_NOPS (initp_expr);
1864 if (!initp_expr || TREE_CODE (initp_expr) != INTEGER_CST)
1866 error ("requested init_priority is not an integer constant");
1867 *no_add_attrs = true;
1871 pri = TREE_INT_CST_LOW (initp_expr);
1873 type = strip_array_types (type);
1875 if (decl == NULL_TREE
1876 || TREE_CODE (decl) != VAR_DECL
1877 || !TREE_STATIC (decl)
1878 || DECL_EXTERNAL (decl)
1879 || (TREE_CODE (type) != RECORD_TYPE
1880 && TREE_CODE (type) != UNION_TYPE)
1881 /* Static objects in functions are initialized the
1882 first time control passes through that
1883 function. This is not precise enough to pin down an
1884 init_priority value, so don't allow it. */
1885 || current_function_decl)
1887 error ("can only use %qE attribute on file-scope definitions "
1888 "of objects of class type", name);
1889 *no_add_attrs = true;
1893 if (pri > MAX_INIT_PRIORITY || pri <= 0)
1895 error ("requested init_priority is out of range");
1896 *no_add_attrs = true;
1900 /* Check for init_priorities that are reserved for
1901 language and runtime support implementations.*/
1902 if (pri <= MAX_RESERVED_INIT_PRIORITY)
1905 (0, "requested init_priority is reserved for internal use");
1908 if (SUPPORTS_INIT_PRIORITY)
1910 SET_DECL_INIT_PRIORITY (decl, pri);
1911 DECL_HAS_INIT_PRIORITY_P (decl) = 1;
1916 error ("%qE attribute is not supported on this platform", name);
1917 *no_add_attrs = true;
1922 /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the
1923 thing pointed to by the constant. */
1926 make_ptrmem_cst (tree type, tree member)
1928 tree ptrmem_cst = make_node (PTRMEM_CST);
1929 TREE_TYPE (ptrmem_cst) = type;
1930 PTRMEM_CST_MEMBER (ptrmem_cst) = member;
1934 /* Build a variant of TYPE that has the indicated ATTRIBUTES. May
1935 return an existing type of an appropriate type already exists. */
1938 cp_build_type_attribute_variant (tree type, tree attributes)
1942 new_type = build_type_attribute_variant (type, attributes);
1943 if (TREE_CODE (new_type) == FUNCTION_TYPE
1944 && (TYPE_RAISES_EXCEPTIONS (new_type)
1945 != TYPE_RAISES_EXCEPTIONS (type)))
1946 new_type = build_exception_variant (new_type,
1947 TYPE_RAISES_EXCEPTIONS (type));
1949 /* Making a new main variant of a class type is broken. */
1950 gcc_assert (!CLASS_TYPE_P (type) || new_type == type);
1955 /* Apply FUNC to all language-specific sub-trees of TP in a pre-order
1956 traversal. Called from walk_tree. */
1959 cp_walk_subtrees (tree *tp, int *walk_subtrees_p, walk_tree_fn func,
1960 void *data, struct pointer_set_t *pset)
1962 enum tree_code code = TREE_CODE (*tp);
1963 location_t save_locus;
1966 #define WALK_SUBTREE(NODE) \
1969 result = walk_tree (&(NODE), func, data, pset); \
1970 if (result) goto out; \
1974 /* Set input_location here so we get the right instantiation context
1975 if we call instantiate_decl from inlinable_function_p. */
1976 save_locus = input_location;
1977 if (EXPR_HAS_LOCATION (*tp))
1978 input_location = EXPR_LOCATION (*tp);
1980 /* Not one of the easy cases. We must explicitly go through the
1986 case TEMPLATE_TEMPLATE_PARM:
1987 case BOUND_TEMPLATE_TEMPLATE_PARM:
1988 case UNBOUND_CLASS_TEMPLATE:
1989 case TEMPLATE_PARM_INDEX:
1990 case TEMPLATE_TYPE_PARM:
1994 /* None of these have subtrees other than those already walked
1996 *walk_subtrees_p = 0;
2000 WALK_SUBTREE (TINST_DECL (*tp));
2001 *walk_subtrees_p = 0;
2005 WALK_SUBTREE (TREE_TYPE (*tp));
2006 *walk_subtrees_p = 0;
2010 WALK_SUBTREE (TREE_PURPOSE (*tp));
2014 WALK_SUBTREE (OVL_FUNCTION (*tp));
2015 WALK_SUBTREE (OVL_CHAIN (*tp));
2016 *walk_subtrees_p = 0;
2020 if (TYPE_PTRMEMFUNC_P (*tp))
2021 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (*tp));
2025 input_location = save_locus;
2029 /* We didn't find what we were looking for. */
2031 input_location = save_locus;
2037 /* Decide whether there are language-specific reasons to not inline a
2038 function as a tree. */
2041 cp_cannot_inline_tree_fn (tree* fnp)
2045 /* We can inline a template instantiation only if it's fully
2047 if (DECL_TEMPLATE_INFO (fn)
2048 && TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (fn)))
2050 /* Don't instantiate functions that are not going to be
2052 if (!DECL_INLINE (DECL_TEMPLATE_RESULT
2053 (template_for_substitution (fn))))
2056 fn = *fnp = instantiate_decl (fn, /*defer_ok=*/0, /*undefined_ok=*/0);
2058 if (TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (fn)))
2062 if (flag_really_no_inline
2063 && lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)) == NULL)
2066 /* Don't auto-inline anything that might not be bound within
2067 this unit of translation.
2068 Exclude comdat functions from this rule. While they can be bound
2069 to the other unit, they all must be the same. This is especially
2070 important so templates can inline. */
2071 if (!DECL_DECLARED_INLINE_P (fn) && !(*targetm.binds_local_p) (fn)
2072 && !DECL_COMDAT (fn))
2074 DECL_UNINLINABLE (fn) = 1;
2078 if (varargs_function_p (fn))
2080 DECL_UNINLINABLE (fn) = 1;
2084 if (! function_attribute_inlinable_p (fn))
2086 DECL_UNINLINABLE (fn) = 1;
2093 /* Add any pending functions other than the current function (already
2094 handled by the caller), that thus cannot be inlined, to FNS_P, then
2095 return the latest function added to the array, PREV_FN. */
2098 cp_add_pending_fn_decls (void* fns_p, tree prev_fn)
2100 varray_type *fnsp = (varray_type *)fns_p;
2101 struct saved_scope *s;
2103 for (s = scope_chain; s; s = s->prev)
2104 if (s->function_decl && s->function_decl != prev_fn)
2106 VARRAY_PUSH_TREE (*fnsp, s->function_decl);
2107 prev_fn = s->function_decl;
2113 /* Determine whether VAR is a declaration of an automatic variable in
2117 cp_auto_var_in_fn_p (tree var, tree fn)
2119 return (DECL_P (var) && DECL_CONTEXT (var) == fn
2120 && nonstatic_local_decl_p (var));
2123 /* Like save_expr, but for C++. */
2126 cp_save_expr (tree expr)
2128 /* There is no reason to create a SAVE_EXPR within a template; if
2129 needed, we can create the SAVE_EXPR when instantiating the
2130 template. Furthermore, the middle-end cannot handle C++-specific
2132 if (processing_template_decl)
2134 return save_expr (expr);
2137 /* Initialize tree.c. */
2142 list_hash_table = htab_create_ggc (31, list_hash, list_hash_eq, NULL);
2145 /* Returns the kind of special function that DECL (a FUNCTION_DECL)
2146 is. Note that sfk_none is zero, so this function can be used as a
2147 predicate to test whether or not DECL is a special function. */
2149 special_function_kind
2150 special_function_p (tree decl)
2152 /* Rather than doing all this stuff with magic names, we should
2153 probably have a field of type `special_function_kind' in
2154 DECL_LANG_SPECIFIC. */
2155 if (DECL_COPY_CONSTRUCTOR_P (decl))
2156 return sfk_copy_constructor;
2157 if (DECL_CONSTRUCTOR_P (decl))
2158 return sfk_constructor;
2159 if (DECL_OVERLOADED_OPERATOR_P (decl) == NOP_EXPR)
2160 return sfk_assignment_operator;
2161 if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl))
2162 return sfk_destructor;
2163 if (DECL_COMPLETE_DESTRUCTOR_P (decl))
2164 return sfk_complete_destructor;
2165 if (DECL_BASE_DESTRUCTOR_P (decl))
2166 return sfk_base_destructor;
2167 if (DECL_DELETING_DESTRUCTOR_P (decl))
2168 return sfk_deleting_destructor;
2169 if (DECL_CONV_FN_P (decl))
2170 return sfk_conversion;
2175 /* Returns nonzero if TYPE is a character type, including wchar_t. */
2178 char_type_p (tree type)
2180 return (same_type_p (type, char_type_node)
2181 || same_type_p (type, unsigned_char_type_node)
2182 || same_type_p (type, signed_char_type_node)
2183 || same_type_p (type, wchar_type_node));
2186 /* Returns the kind of linkage associated with the indicated DECL. Th
2187 value returned is as specified by the language standard; it is
2188 independent of implementation details regarding template
2189 instantiation, etc. For example, it is possible that a declaration
2190 to which this function assigns external linkage would not show up
2191 as a global symbol when you run `nm' on the resulting object file. */
2194 decl_linkage (tree decl)
2196 /* This function doesn't attempt to calculate the linkage from first
2197 principles as given in [basic.link]. Instead, it makes use of
2198 the fact that we have already set TREE_PUBLIC appropriately, and
2199 then handles a few special cases. Ideally, we would calculate
2200 linkage first, and then transform that into a concrete
2203 /* Things that don't have names have no linkage. */
2204 if (!DECL_NAME (decl))
2207 /* Things that are TREE_PUBLIC have external linkage. */
2208 if (TREE_PUBLIC (decl))
2211 if (TREE_CODE (decl) == NAMESPACE_DECL)
2214 /* Linkage of a CONST_DECL depends on the linkage of the enumeration
2216 if (TREE_CODE (decl) == CONST_DECL)
2217 return decl_linkage (TYPE_NAME (TREE_TYPE (decl)));
2219 /* Some things that are not TREE_PUBLIC have external linkage, too.
2220 For example, on targets that don't have weak symbols, we make all
2221 template instantiations have internal linkage (in the object
2222 file), but the symbols should still be treated as having external
2223 linkage from the point of view of the language. */
2224 if (TREE_CODE (decl) != TYPE_DECL && DECL_LANG_SPECIFIC (decl)
2225 && DECL_COMDAT (decl))
2228 /* Things in local scope do not have linkage, if they don't have
2230 if (decl_function_context (decl))
2233 /* Members of the anonymous namespace also have TREE_PUBLIC unset, but
2234 are considered to have external linkage for language purposes. DECLs
2235 really meant to have internal linkage have DECL_THIS_STATIC set. */
2236 if (TREE_CODE (decl) == TYPE_DECL
2237 || ((TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == FUNCTION_DECL)
2238 && !DECL_THIS_STATIC (decl)))
2241 /* Everything else has internal linkage. */
2245 /* EXP is an expression that we want to pre-evaluate. Returns (in
2246 *INITP) an expression that will perform the pre-evaluation. The
2247 value returned by this function is a side-effect free expression
2248 equivalent to the pre-evaluated expression. Callers must ensure
2249 that *INITP is evaluated before EXP. */
2252 stabilize_expr (tree exp, tree* initp)
2256 if (!TREE_SIDE_EFFECTS (exp))
2257 init_expr = NULL_TREE;
2258 else if (!real_lvalue_p (exp)
2259 || !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (exp)))
2261 init_expr = get_target_expr (exp);
2262 exp = TARGET_EXPR_SLOT (init_expr);
2266 exp = build_unary_op (ADDR_EXPR, exp, 1);
2267 init_expr = get_target_expr (exp);
2268 exp = TARGET_EXPR_SLOT (init_expr);
2269 exp = build_indirect_ref (exp, 0);
2273 gcc_assert (!TREE_SIDE_EFFECTS (exp));
2277 /* Add NEW, an expression whose value we don't care about, after the
2278 similar expression ORIG. */
2281 add_stmt_to_compound (tree orig, tree new)
2283 if (!new || !TREE_SIDE_EFFECTS (new))
2285 if (!orig || !TREE_SIDE_EFFECTS (orig))
2287 return build2 (COMPOUND_EXPR, void_type_node, orig, new);
2290 /* Like stabilize_expr, but for a call whose arguments we want to
2291 pre-evaluate. CALL is modified in place to use the pre-evaluated
2292 arguments, while, upon return, *INITP contains an expression to
2293 compute the arguments. */
2296 stabilize_call (tree call, tree *initp)
2298 tree inits = NULL_TREE;
2301 if (call == error_mark_node)
2304 gcc_assert (TREE_CODE (call) == CALL_EXPR
2305 || TREE_CODE (call) == AGGR_INIT_EXPR);
2307 for (t = TREE_OPERAND (call, 1); t; t = TREE_CHAIN (t))
2308 if (TREE_SIDE_EFFECTS (TREE_VALUE (t)))
2311 TREE_VALUE (t) = stabilize_expr (TREE_VALUE (t), &init);
2312 inits = add_stmt_to_compound (inits, init);
2318 /* Like stabilize_expr, but for an initialization.
2320 If the initialization is for an object of class type, this function
2321 takes care not to introduce additional temporaries.
2323 Returns TRUE iff the expression was successfully pre-evaluated,
2324 i.e., if INIT is now side-effect free, except for, possible, a
2325 single call to a constructor. */
2328 stabilize_init (tree init, tree *initp)
2334 if (t == error_mark_node)
2337 if (TREE_CODE (t) == INIT_EXPR
2338 && TREE_CODE (TREE_OPERAND (t, 1)) != TARGET_EXPR)
2340 TREE_OPERAND (t, 1) = stabilize_expr (TREE_OPERAND (t, 1), initp);
2344 if (TREE_CODE (t) == INIT_EXPR)
2345 t = TREE_OPERAND (t, 1);
2346 if (TREE_CODE (t) == TARGET_EXPR)
2347 t = TARGET_EXPR_INITIAL (t);
2348 if (TREE_CODE (t) == COMPOUND_EXPR)
2350 if (TREE_CODE (t) == CONSTRUCTOR
2351 && EMPTY_CONSTRUCTOR_P (t))
2352 /* Default-initialization. */
2355 /* If the initializer is a COND_EXPR, we can't preevaluate
2357 if (TREE_CODE (t) == COND_EXPR)
2360 if (TREE_CODE (t) == CALL_EXPR
2361 || TREE_CODE (t) == AGGR_INIT_EXPR)
2363 stabilize_call (t, initp);
2367 /* The initialization is being performed via a bitwise copy -- and
2368 the item copied may have side effects. */
2369 return TREE_SIDE_EFFECTS (init);
2372 /* Like "fold", but should be used whenever we might be processing the
2373 body of a template. */
2376 fold_if_not_in_template (tree expr)
2378 /* In the body of a template, there is never any need to call
2379 "fold". We will call fold later when actually instantiating the
2380 template. Integral constant expressions in templates will be
2381 evaluated via fold_non_dependent_expr, as necessary. */
2382 if (processing_template_decl)
2385 /* Fold C++ front-end specific tree codes. */
2386 if (TREE_CODE (expr) == UNARY_PLUS_EXPR)
2387 return fold_convert (TREE_TYPE (expr), TREE_OPERAND (expr, 0));
2392 /* Returns true if a cast to TYPE may appear in an integral constant
2396 cast_valid_in_integral_constant_expression_p (tree type)
2398 return (INTEGRAL_OR_ENUMERATION_TYPE_P (type)
2399 || dependent_type_p (type)
2400 || type == error_mark_node);
2404 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
2405 /* Complain that some language-specific thing hanging off a tree
2406 node has been accessed improperly. */
2409 lang_check_failed (const char* file, int line, const char* function)
2411 internal_error ("lang_* check: failed in %s, at %s:%d",
2412 function, trim_filename (file), line);
2414 #endif /* ENABLE_TREE_CHECKING */
2416 #include "gt-cp-tree.h"