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, 2007, 2008, 2009
4 Free Software Foundation, Inc.
5 Hacked by Michael Tiemann (tiemann@cygnus.com)
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 3, or (at your option)
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
25 #include "coretypes.h"
33 #include "insn-config.h"
34 #include "integrate.h"
35 #include "tree-inline.h"
39 #include "tree-flow.h"
41 static tree bot_manip (tree *, int *, void *);
42 static tree bot_replace (tree *, int *, void *);
43 static tree build_cplus_array_type_1 (tree, tree);
44 static int list_hash_eq (const void *, const void *);
45 static hashval_t list_hash_pieces (tree, tree, tree);
46 static hashval_t list_hash (const void *);
47 static cp_lvalue_kind lvalue_p_1 (const_tree);
48 static tree build_target_expr (tree, tree);
49 static tree count_trees_r (tree *, int *, void *);
50 static tree verify_stmt_tree_r (tree *, int *, void *);
51 static tree build_local_temp (tree);
53 static tree handle_java_interface_attribute (tree *, tree, tree, int, bool *);
54 static tree handle_com_interface_attribute (tree *, tree, tree, int, bool *);
55 static tree handle_init_priority_attribute (tree *, tree, tree, int, bool *);
57 /* If REF is an lvalue, returns the kind of lvalue that REF is.
58 Otherwise, returns clk_none. */
61 lvalue_p_1 (const_tree ref)
63 cp_lvalue_kind op1_lvalue_kind = clk_none;
64 cp_lvalue_kind op2_lvalue_kind = clk_none;
66 /* Expressions of reference type are sometimes wrapped in
67 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
68 representation, not part of the language, so we have to look
70 if (TREE_CODE (ref) == INDIRECT_REF
71 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref, 0)))
73 return lvalue_p_1 (TREE_OPERAND (ref, 0));
75 if (TREE_CODE (TREE_TYPE (ref)) == REFERENCE_TYPE)
77 /* unnamed rvalue references are rvalues */
78 if (TYPE_REF_IS_RVALUE (TREE_TYPE (ref))
79 && TREE_CODE (ref) != PARM_DECL
80 && TREE_CODE (ref) != VAR_DECL
81 && TREE_CODE (ref) != COMPONENT_REF)
84 /* lvalue references and named rvalue references are lvalues. */
88 if (ref == current_class_ptr)
91 switch (TREE_CODE (ref))
95 /* preincrements and predecrements are valid lvals, provided
96 what they refer to are valid lvals. */
97 case PREINCREMENT_EXPR:
98 case PREDECREMENT_EXPR:
100 case WITH_CLEANUP_EXPR:
103 return lvalue_p_1 (TREE_OPERAND (ref, 0));
106 op1_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 0));
107 /* Look at the member designator. */
108 if (!op1_lvalue_kind)
110 else if (is_overloaded_fn (TREE_OPERAND (ref, 1)))
111 /* The "field" can be a FUNCTION_DECL or an OVERLOAD in some
112 situations. If we're seeing a COMPONENT_REF, it's a non-static
113 member, so it isn't an lvalue. */
114 op1_lvalue_kind = clk_none;
115 else if (TREE_CODE (TREE_OPERAND (ref, 1)) != FIELD_DECL)
116 /* This can be IDENTIFIER_NODE in a template. */;
117 else if (DECL_C_BIT_FIELD (TREE_OPERAND (ref, 1)))
119 /* Clear the ordinary bit. If this object was a class
120 rvalue we want to preserve that information. */
121 op1_lvalue_kind &= ~clk_ordinary;
122 /* The lvalue is for a bitfield. */
123 op1_lvalue_kind |= clk_bitfield;
125 else if (DECL_PACKED (TREE_OPERAND (ref, 1)))
126 op1_lvalue_kind |= clk_packed;
128 return op1_lvalue_kind;
131 case COMPOUND_LITERAL_EXPR:
135 /* CONST_DECL without TREE_STATIC are enumeration values and
136 thus not lvalues. With TREE_STATIC they are used by ObjC++
137 in objc_build_string_object and need to be considered as
139 if (! TREE_STATIC (ref))
142 if (TREE_READONLY (ref) && ! TREE_STATIC (ref)
143 && DECL_LANG_SPECIFIC (ref)
144 && DECL_IN_AGGR_P (ref))
150 if (TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE)
154 /* A currently unresolved scope ref. */
159 /* Disallow <? and >? as lvalues if either argument side-effects. */
160 if (TREE_SIDE_EFFECTS (TREE_OPERAND (ref, 0))
161 || TREE_SIDE_EFFECTS (TREE_OPERAND (ref, 1)))
163 op1_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 0));
164 op2_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 1));
168 op1_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 1)
169 ? TREE_OPERAND (ref, 1)
170 : TREE_OPERAND (ref, 0));
171 op2_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 2));
178 return lvalue_p_1 (TREE_OPERAND (ref, 1));
184 return (CLASS_TYPE_P (TREE_TYPE (ref)) ? clk_class : clk_none);
187 /* Any class-valued call would be wrapped in a TARGET_EXPR. */
191 /* All functions (except non-static-member functions) are
193 return (DECL_NONSTATIC_MEMBER_FUNCTION_P (ref)
194 ? clk_none : clk_ordinary);
197 /* We now represent a reference to a single static member function
199 /* This CONST_CAST is okay because BASELINK_FUNCTIONS returns
200 its argument unmodified and we assign it to a const_tree. */
201 return lvalue_p_1 (BASELINK_FUNCTIONS (CONST_CAST_TREE (ref)));
203 case NON_DEPENDENT_EXPR:
204 /* We must consider NON_DEPENDENT_EXPRs to be lvalues so that
205 things like "&E" where "E" is an expression with a
206 non-dependent type work. It is safe to be lenient because an
207 error will be issued when the template is instantiated if "E"
215 /* If one operand is not an lvalue at all, then this expression is
217 if (!op1_lvalue_kind || !op2_lvalue_kind)
220 /* Otherwise, it's an lvalue, and it has all the odd properties
221 contributed by either operand. */
222 op1_lvalue_kind = op1_lvalue_kind | op2_lvalue_kind;
223 /* It's not an ordinary lvalue if it involves any other kind. */
224 if ((op1_lvalue_kind & ~clk_ordinary) != clk_none)
225 op1_lvalue_kind &= ~clk_ordinary;
226 /* It can't be both a pseudo-lvalue and a non-addressable lvalue.
227 A COND_EXPR of those should be wrapped in a TARGET_EXPR. */
228 if ((op1_lvalue_kind & (clk_rvalueref|clk_class))
229 && (op1_lvalue_kind & (clk_bitfield|clk_packed)))
230 op1_lvalue_kind = clk_none;
231 return op1_lvalue_kind;
234 /* Returns the kind of lvalue that REF is, in the sense of
235 [basic.lval]. This function should really be named lvalue_p; it
236 computes the C++ definition of lvalue. */
239 real_lvalue_p (tree ref)
241 cp_lvalue_kind kind = lvalue_p_1 (ref);
242 if (kind & (clk_rvalueref|clk_class))
248 /* This differs from real_lvalue_p in that class rvalues are considered
252 lvalue_p (const_tree ref)
254 return (lvalue_p_1 (ref) != clk_none);
257 /* This differs from real_lvalue_p in that rvalues formed by dereferencing
258 rvalue references are considered rvalues. */
261 lvalue_or_rvalue_with_address_p (const_tree ref)
263 cp_lvalue_kind kind = lvalue_p_1 (ref);
264 if (kind & clk_class)
267 return (kind != clk_none);
270 /* Test whether DECL is a builtin that may appear in a
271 constant-expression. */
274 builtin_valid_in_constant_expr_p (const_tree decl)
276 /* At present BUILT_IN_CONSTANT_P is the only builtin we're allowing
277 in constant-expressions. We may want to add other builtins later. */
278 return DECL_IS_BUILTIN_CONSTANT_P (decl);
281 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
284 build_target_expr (tree decl, tree value)
288 #ifdef ENABLE_CHECKING
289 gcc_assert (VOID_TYPE_P (TREE_TYPE (value))
290 || TREE_TYPE (decl) == TREE_TYPE (value)
291 || useless_type_conversion_p (TREE_TYPE (decl),
295 t = build4 (TARGET_EXPR, TREE_TYPE (decl), decl, value,
296 cxx_maybe_build_cleanup (decl), NULL_TREE);
297 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
298 ignore the TARGET_EXPR. If there really turn out to be no
299 side-effects, then the optimizer should be able to get rid of
300 whatever code is generated anyhow. */
301 TREE_SIDE_EFFECTS (t) = 1;
306 /* Return an undeclared local temporary of type TYPE for use in building a
310 build_local_temp (tree type)
312 tree slot = build_decl (input_location,
313 VAR_DECL, NULL_TREE, type);
314 DECL_ARTIFICIAL (slot) = 1;
315 DECL_IGNORED_P (slot) = 1;
316 DECL_CONTEXT (slot) = current_function_decl;
317 layout_decl (slot, 0);
321 /* Set various status flags when building an AGGR_INIT_EXPR object T. */
324 process_aggr_init_operands (tree t)
328 side_effects = TREE_SIDE_EFFECTS (t);
332 n = TREE_OPERAND_LENGTH (t);
333 for (i = 1; i < n; i++)
335 tree op = TREE_OPERAND (t, i);
336 if (op && TREE_SIDE_EFFECTS (op))
343 TREE_SIDE_EFFECTS (t) = side_effects;
346 /* Build an AGGR_INIT_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE,
347 FN, and SLOT. NARGS is the number of call arguments which are specified
348 as a tree array ARGS. */
351 build_aggr_init_array (tree return_type, tree fn, tree slot, int nargs,
357 t = build_vl_exp (AGGR_INIT_EXPR, nargs + 3);
358 TREE_TYPE (t) = return_type;
359 AGGR_INIT_EXPR_FN (t) = fn;
360 AGGR_INIT_EXPR_SLOT (t) = slot;
361 for (i = 0; i < nargs; i++)
362 AGGR_INIT_EXPR_ARG (t, i) = args[i];
363 process_aggr_init_operands (t);
367 /* INIT is a CALL_EXPR or AGGR_INIT_EXPR which needs info about its
368 target. TYPE is the type to be initialized.
370 Build an AGGR_INIT_EXPR to represent the initialization. This function
371 differs from build_cplus_new in that an AGGR_INIT_EXPR can only be used
372 to initialize another object, whereas a TARGET_EXPR can either
373 initialize another object or create its own temporary object, and as a
374 result building up a TARGET_EXPR requires that the type's destructor be
378 build_aggr_init_expr (tree type, tree init)
385 /* Make sure that we're not trying to create an instance of an
387 abstract_virtuals_error (NULL_TREE, type);
389 if (TREE_CODE (init) == CALL_EXPR)
390 fn = CALL_EXPR_FN (init);
391 else if (TREE_CODE (init) == AGGR_INIT_EXPR)
392 fn = AGGR_INIT_EXPR_FN (init);
394 return convert (type, init);
396 is_ctor = (TREE_CODE (fn) == ADDR_EXPR
397 && TREE_CODE (TREE_OPERAND (fn, 0)) == FUNCTION_DECL
398 && DECL_CONSTRUCTOR_P (TREE_OPERAND (fn, 0)));
400 /* We split the CALL_EXPR into its function and its arguments here.
401 Then, in expand_expr, we put them back together. The reason for
402 this is that this expression might be a default argument
403 expression. In that case, we need a new temporary every time the
404 expression is used. That's what break_out_target_exprs does; it
405 replaces every AGGR_INIT_EXPR with a copy that uses a fresh
406 temporary slot. Then, expand_expr builds up a call-expression
407 using the new slot. */
409 /* If we don't need to use a constructor to create an object of this
410 type, don't mess with AGGR_INIT_EXPR. */
411 if (is_ctor || TREE_ADDRESSABLE (type))
413 slot = build_local_temp (type);
415 if (TREE_CODE(init) == CALL_EXPR)
416 rval = build_aggr_init_array (void_type_node, fn, slot,
417 call_expr_nargs (init),
418 CALL_EXPR_ARGP (init));
420 rval = build_aggr_init_array (void_type_node, fn, slot,
421 aggr_init_expr_nargs (init),
422 AGGR_INIT_EXPR_ARGP (init));
423 TREE_SIDE_EFFECTS (rval) = 1;
424 AGGR_INIT_VIA_CTOR_P (rval) = is_ctor;
432 /* INIT is a CALL_EXPR or AGGR_INIT_EXPR which needs info about its
433 target. TYPE is the type that this initialization should appear to
436 Build an encapsulation of the initialization to perform
437 and return it so that it can be processed by language-independent
438 and language-specific expression expanders. */
441 build_cplus_new (tree type, tree init)
443 tree rval = build_aggr_init_expr (type, init);
446 if (TREE_CODE (rval) == AGGR_INIT_EXPR)
447 slot = AGGR_INIT_EXPR_SLOT (rval);
448 else if (TREE_CODE (rval) == CALL_EXPR)
449 slot = build_local_temp (type);
453 rval = build_target_expr (slot, rval);
454 TARGET_EXPR_IMPLICIT_P (rval) = 1;
459 /* Build a TARGET_EXPR using INIT to initialize a new temporary of the
463 build_target_expr_with_type (tree init, tree type)
465 gcc_assert (!VOID_TYPE_P (type));
467 if (TREE_CODE (init) == TARGET_EXPR)
469 else if (CLASS_TYPE_P (type) && !TYPE_HAS_TRIVIAL_INIT_REF (type)
470 && !VOID_TYPE_P (TREE_TYPE (init))
471 && TREE_CODE (init) != COND_EXPR
472 && TREE_CODE (init) != CONSTRUCTOR
473 && TREE_CODE (init) != VA_ARG_EXPR)
474 /* We need to build up a copy constructor call. A void initializer
475 means we're being called from bot_manip. COND_EXPR is a special
476 case because we already have copies on the arms and we don't want
477 another one here. A CONSTRUCTOR is aggregate initialization, which
478 is handled separately. A VA_ARG_EXPR is magic creation of an
479 aggregate; there's no additional work to be done. */
480 return force_rvalue (init);
482 return force_target_expr (type, init);
485 /* Like the above function, but without the checking. This function should
486 only be used by code which is deliberately trying to subvert the type
487 system, such as call_builtin_trap. */
490 force_target_expr (tree type, tree init)
494 gcc_assert (!VOID_TYPE_P (type));
496 slot = build_local_temp (type);
497 return build_target_expr (slot, init);
500 /* Like build_target_expr_with_type, but use the type of INIT. */
503 get_target_expr (tree init)
505 if (TREE_CODE (init) == AGGR_INIT_EXPR)
506 return build_target_expr (AGGR_INIT_EXPR_SLOT (init), init);
508 return build_target_expr_with_type (init, TREE_TYPE (init));
511 /* If EXPR is a bitfield reference, convert it to the declared type of
512 the bitfield, and return the resulting expression. Otherwise,
513 return EXPR itself. */
516 convert_bitfield_to_declared_type (tree expr)
520 bitfield_type = is_bitfield_expr_with_lowered_type (expr);
522 expr = convert_to_integer (TYPE_MAIN_VARIANT (bitfield_type),
527 /* EXPR is being used in an rvalue context. Return a version of EXPR
528 that is marked as an rvalue. */
535 if (error_operand_p (expr))
540 Non-class rvalues always have cv-unqualified types. */
541 type = TREE_TYPE (expr);
542 if (!CLASS_TYPE_P (type) && cp_type_quals (type))
543 type = cp_build_qualified_type (type, TYPE_UNQUALIFIED);
545 /* We need to do this for rvalue refs as well to get the right answer
546 from decltype; see c++/36628. */
547 if (!processing_template_decl && lvalue_or_rvalue_with_address_p (expr))
548 expr = build1 (NON_LVALUE_EXPR, type, expr);
549 else if (type != TREE_TYPE (expr))
550 expr = build_nop (type, expr);
556 /* Hash an ARRAY_TYPE. K is really of type `tree'. */
559 cplus_array_hash (const void* k)
562 const_tree const t = (const_tree) k;
564 hash = TYPE_UID (TREE_TYPE (t));
566 hash ^= TYPE_UID (TYPE_DOMAIN (t));
570 typedef struct cplus_array_info {
575 /* Compare two ARRAY_TYPEs. K1 is really of type `tree', K2 is really
576 of type `cplus_array_info*'. */
579 cplus_array_compare (const void * k1, const void * k2)
581 const_tree const t1 = (const_tree) k1;
582 const cplus_array_info *const t2 = (const cplus_array_info*) k2;
584 return (TREE_TYPE (t1) == t2->type && TYPE_DOMAIN (t1) == t2->domain);
587 /* Hash table containing all of the C++ array types, including
588 dependent array types and array types whose element type is
590 static GTY ((param_is (union tree_node))) htab_t cplus_array_htab;
594 build_cplus_array_type_1 (tree elt_type, tree index_type)
598 if (elt_type == error_mark_node || index_type == error_mark_node)
599 return error_mark_node;
601 if (processing_template_decl
602 && (dependent_type_p (elt_type)
603 || (index_type && !TREE_CONSTANT (TYPE_MAX_VALUE (index_type)))))
606 cplus_array_info cai;
609 if (cplus_array_htab == NULL)
610 cplus_array_htab = htab_create_ggc (61, &cplus_array_hash,
611 &cplus_array_compare, NULL);
613 hash = TYPE_UID (elt_type);
615 hash ^= TYPE_UID (index_type);
617 cai.domain = index_type;
619 e = htab_find_slot_with_hash (cplus_array_htab, &cai, hash, INSERT);
621 /* We have found the type: we're done. */
625 /* Build a new array type. */
626 t = make_node (ARRAY_TYPE);
627 TREE_TYPE (t) = elt_type;
628 TYPE_DOMAIN (t) = index_type;
630 /* Store it in the hash table. */
633 /* Set the canonical type for this new node. */
634 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
635 || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type)))
636 SET_TYPE_STRUCTURAL_EQUALITY (t);
637 else if (TYPE_CANONICAL (elt_type) != elt_type
639 && TYPE_CANONICAL (index_type) != index_type))
641 = build_cplus_array_type
642 (TYPE_CANONICAL (elt_type),
643 index_type ? TYPE_CANONICAL (index_type) : index_type);
645 TYPE_CANONICAL (t) = t;
649 t = build_array_type (elt_type, index_type);
651 /* Push these needs up so that initialization takes place
653 TYPE_NEEDS_CONSTRUCTING (t)
654 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (elt_type));
655 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
656 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (elt_type));
661 build_cplus_array_type (tree elt_type, tree index_type)
664 int type_quals = cp_type_quals (elt_type);
666 if (type_quals != TYPE_UNQUALIFIED)
667 elt_type = cp_build_qualified_type (elt_type, TYPE_UNQUALIFIED);
669 t = build_cplus_array_type_1 (elt_type, index_type);
671 if (type_quals != TYPE_UNQUALIFIED)
672 t = cp_build_qualified_type (t, type_quals);
677 /* Return an ARRAY_TYPE with element type ELT and length N. */
680 build_array_of_n_type (tree elt, int n)
682 return build_cplus_array_type (elt, build_index_type (size_int (n - 1)));
685 /* Return a reference type node referring to TO_TYPE. If RVAL is
686 true, return an rvalue reference type, otherwise return an lvalue
687 reference type. If a type node exists, reuse it, otherwise create
690 cp_build_reference_type (tree to_type, bool rval)
693 lvalue_ref = build_reference_type (to_type);
697 /* This code to create rvalue reference types is based on and tied
698 to the code creating lvalue reference types in the middle-end
699 functions build_reference_type_for_mode and build_reference_type.
701 It works by putting the rvalue reference type nodes after the
702 lvalue reference nodes in the TYPE_NEXT_REF_TO linked list, so
703 they will effectively be ignored by the middle end. */
705 for (t = lvalue_ref; (t = TYPE_NEXT_REF_TO (t)); )
706 if (TYPE_REF_IS_RVALUE (t))
709 t = build_distinct_type_copy (lvalue_ref);
711 TYPE_REF_IS_RVALUE (t) = true;
712 TYPE_NEXT_REF_TO (t) = TYPE_NEXT_REF_TO (lvalue_ref);
713 TYPE_NEXT_REF_TO (lvalue_ref) = t;
715 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
716 SET_TYPE_STRUCTURAL_EQUALITY (t);
717 else if (TYPE_CANONICAL (to_type) != to_type)
719 = cp_build_reference_type (TYPE_CANONICAL (to_type), rval);
721 TYPE_CANONICAL (t) = t;
729 /* Used by the C++ front end to build qualified array types. However,
730 the C version of this function does not properly maintain canonical
731 types (which are not used in C). */
733 c_build_qualified_type (tree type, int type_quals)
735 return cp_build_qualified_type (type, type_quals);
739 /* Make a variant of TYPE, qualified with the TYPE_QUALS. Handles
740 arrays correctly. In particular, if TYPE is an array of T's, and
741 TYPE_QUALS is non-empty, returns an array of qualified T's.
743 FLAGS determines how to deal with ill-formed qualifications. If
744 tf_ignore_bad_quals is set, then bad qualifications are dropped
745 (this is permitted if TYPE was introduced via a typedef or template
746 type parameter). If bad qualifications are dropped and tf_warning
747 is set, then a warning is issued for non-const qualifications. If
748 tf_ignore_bad_quals is not set and tf_error is not set, we
749 return error_mark_node. Otherwise, we issue an error, and ignore
752 Qualification of a reference type is valid when the reference came
753 via a typedef or template type argument. [dcl.ref] No such
754 dispensation is provided for qualifying a function type. [dcl.fct]
755 DR 295 queries this and the proposed resolution brings it into line
756 with qualifying a reference. We implement the DR. We also behave
757 in a similar manner for restricting non-pointer types. */
760 cp_build_qualified_type_real (tree type,
762 tsubst_flags_t complain)
765 int bad_quals = TYPE_UNQUALIFIED;
767 if (type == error_mark_node)
770 if (type_quals == cp_type_quals (type))
773 if (TREE_CODE (type) == ARRAY_TYPE)
775 /* In C++, the qualification really applies to the array element
776 type. Obtain the appropriately qualified element type. */
779 = cp_build_qualified_type_real (TREE_TYPE (type),
783 if (element_type == error_mark_node)
784 return error_mark_node;
786 /* See if we already have an identically qualified type. */
787 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
788 if (cp_type_quals (t) == type_quals
789 && TYPE_NAME (t) == TYPE_NAME (type)
790 && TYPE_CONTEXT (t) == TYPE_CONTEXT (type))
795 t = build_cplus_array_type_1 (element_type, TYPE_DOMAIN (type));
797 if (TYPE_MAIN_VARIANT (t) != TYPE_MAIN_VARIANT (type))
799 /* Set the main variant of the newly-created ARRAY_TYPE
800 (with cv-qualified element type) to the main variant of
801 the unqualified ARRAY_TYPE we started with. */
802 tree last_variant = t;
803 tree m = TYPE_MAIN_VARIANT (type);
805 /* Find the last variant on the new ARRAY_TYPEs list of
806 variants, setting the main variant of each of the other
807 types to the main variant of our unqualified
809 while (TYPE_NEXT_VARIANT (last_variant))
811 TYPE_MAIN_VARIANT (last_variant) = m;
812 last_variant = TYPE_NEXT_VARIANT (last_variant);
815 /* Splice in the newly-created variants. */
816 TYPE_NEXT_VARIANT (last_variant) = TYPE_NEXT_VARIANT (m);
817 TYPE_NEXT_VARIANT (m) = t;
818 TYPE_MAIN_VARIANT (last_variant) = m;
822 /* Even if we already had this variant, we update
823 TYPE_NEEDS_CONSTRUCTING and TYPE_HAS_NONTRIVIAL_DESTRUCTOR in case
824 they changed since the variant was originally created.
826 This seems hokey; if there is some way to use a previous
827 variant *without* coming through here,
828 TYPE_NEEDS_CONSTRUCTING will never be updated. */
829 TYPE_NEEDS_CONSTRUCTING (t)
830 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (element_type));
831 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
832 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (element_type));
835 else if (TYPE_PTRMEMFUNC_P (type))
837 /* For a pointer-to-member type, we can't just return a
838 cv-qualified version of the RECORD_TYPE. If we do, we
839 haven't changed the field that contains the actual pointer to
840 a method, and so TYPE_PTRMEMFUNC_FN_TYPE will be wrong. */
843 t = TYPE_PTRMEMFUNC_FN_TYPE (type);
844 t = cp_build_qualified_type_real (t, type_quals, complain);
845 return build_ptrmemfunc_type (t);
847 else if (TREE_CODE (type) == TYPE_PACK_EXPANSION)
849 tree t = PACK_EXPANSION_PATTERN (type);
851 t = cp_build_qualified_type_real (t, type_quals, complain);
852 return make_pack_expansion (t);
855 /* A reference or method type shall not be cv-qualified.
856 [dcl.ref], [dcl.fct] */
857 if (type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE)
858 && (TREE_CODE (type) == REFERENCE_TYPE
859 || TREE_CODE (type) == METHOD_TYPE))
861 bad_quals |= type_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
862 type_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
865 /* A restrict-qualified type must be a pointer (or reference)
866 to object or incomplete type. */
867 if ((type_quals & TYPE_QUAL_RESTRICT)
868 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
869 && TREE_CODE (type) != TYPENAME_TYPE
870 && !POINTER_TYPE_P (type))
872 bad_quals |= TYPE_QUAL_RESTRICT;
873 type_quals &= ~TYPE_QUAL_RESTRICT;
876 if (bad_quals == TYPE_UNQUALIFIED)
878 else if (!(complain & (tf_error | tf_ignore_bad_quals)))
879 return error_mark_node;
882 if (complain & tf_ignore_bad_quals)
883 /* We're not going to warn about constifying things that can't
885 bad_quals &= ~TYPE_QUAL_CONST;
888 tree bad_type = build_qualified_type (ptr_type_node, bad_quals);
890 if (!(complain & tf_ignore_bad_quals))
891 error ("%qV qualifiers cannot be applied to %qT",
896 /* Retrieve (or create) the appropriately qualified variant. */
897 result = build_qualified_type (type, type_quals);
899 /* If this was a pointer-to-method type, and we just made a copy,
900 then we need to unshare the record that holds the cached
901 pointer-to-member-function type, because these will be distinct
902 between the unqualified and qualified types. */
904 && TREE_CODE (type) == POINTER_TYPE
905 && TREE_CODE (TREE_TYPE (type)) == METHOD_TYPE
906 && TYPE_LANG_SPECIFIC (result) == TYPE_LANG_SPECIFIC (type))
907 TYPE_LANG_SPECIFIC (result) = NULL;
909 /* We may also have ended up building a new copy of the canonical
910 type of a pointer-to-method type, which could have the same
911 sharing problem described above. */
912 if (TYPE_CANONICAL (result) != TYPE_CANONICAL (type)
913 && TREE_CODE (type) == POINTER_TYPE
914 && TREE_CODE (TREE_TYPE (type)) == METHOD_TYPE
915 && (TYPE_LANG_SPECIFIC (TYPE_CANONICAL (result))
916 == TYPE_LANG_SPECIFIC (TYPE_CANONICAL (type))))
917 TYPE_LANG_SPECIFIC (TYPE_CANONICAL (result)) = NULL;
923 /* Builds a qualified variant of T that is not a typedef variant.
924 E.g. consider the following declarations:
925 typedef const int ConstInt;
926 typedef ConstInt* PtrConstInt;
927 If T is PtrConstInt, this function returns a type representing
929 In other words, if T is a typedef, the function returns the underlying type.
930 The cv-qualification and attributes of the type returned match the
932 They will always be compatible types.
933 The returned type is built so that all of its subtypes
934 recursively have their typedefs stripped as well.
936 This is different from just returning TYPE_CANONICAL (T)
937 Because of several reasons:
938 * If T is a type that needs structural equality
939 its TYPE_CANONICAL (T) will be NULL.
940 * TYPE_CANONICAL (T) desn't carry type attributes
941 and looses template parameter names. */
944 strip_typedefs (tree t)
946 tree result = NULL, type = NULL, t0 = NULL;
948 if (!t || t == error_mark_node || t == TYPE_CANONICAL (t))
951 gcc_assert (TYPE_P (t));
953 switch (TREE_CODE (t))
956 type = strip_typedefs (TREE_TYPE (t));
957 result = build_pointer_type (type);
960 type = strip_typedefs (TREE_TYPE (t));
961 result = cp_build_reference_type (type, TYPE_REF_IS_RVALUE (t));
964 t0 = strip_typedefs (TYPE_OFFSET_BASETYPE (t));
965 type = strip_typedefs (TREE_TYPE (t));
966 result = build_offset_type (t0, type);
969 if (TYPE_PTRMEMFUNC_P (t))
971 t0 = strip_typedefs (TYPE_PTRMEMFUNC_FN_TYPE (t));
972 result = build_ptrmemfunc_type (t0);
976 type = strip_typedefs (TREE_TYPE (t));
977 t0 = strip_typedefs (TYPE_DOMAIN (t));;
978 result = build_cplus_array_type (type, t0);
983 tree arg_types = NULL, arg_node, arg_type;
984 for (arg_node = TYPE_ARG_TYPES (t);
986 arg_node = TREE_CHAIN (arg_node))
988 if (arg_node == void_list_node)
990 arg_type = strip_typedefs (TREE_VALUE (arg_node));
991 gcc_assert (arg_type);
994 tree_cons (TREE_PURPOSE (arg_node), arg_type, arg_types);
998 arg_types = nreverse (arg_types);
1000 /* A list of parameters not ending with an ellipsis
1001 must end with void_list_node. */
1003 arg_types = chainon (arg_types, void_list_node);
1005 type = strip_typedefs (TREE_TYPE (t));
1006 if (TREE_CODE (t) == METHOD_TYPE)
1008 tree class_type = TREE_TYPE (TREE_VALUE (arg_types));
1009 gcc_assert (class_type);
1011 build_method_type_directly (class_type, type,
1012 TREE_CHAIN (arg_types));
1015 result = build_function_type (type,
1024 result = TYPE_MAIN_VARIANT (t);
1025 return cp_build_qualified_type (result, cp_type_quals (t));
1029 /* Makes a copy of BINFO and TYPE, which is to be inherited into a
1030 graph dominated by T. If BINFO is NULL, TYPE is a dependent base,
1031 and we do a shallow copy. If BINFO is non-NULL, we do a deep copy.
1032 VIRT indicates whether TYPE is inherited virtually or not.
1033 IGO_PREV points at the previous binfo of the inheritance graph
1034 order chain. The newly copied binfo's TREE_CHAIN forms this
1037 The CLASSTYPE_VBASECLASSES vector of T is constructed in the
1038 correct order. That is in the order the bases themselves should be
1041 The BINFO_INHERITANCE of a virtual base class points to the binfo
1042 of the most derived type. ??? We could probably change this so that
1043 BINFO_INHERITANCE becomes synonymous with BINFO_PRIMARY, and hence
1044 remove a field. They currently can only differ for primary virtual
1048 copy_binfo (tree binfo, tree type, tree t, tree *igo_prev, int virt)
1054 /* See if we've already made this virtual base. */
1055 new_binfo = binfo_for_vbase (type, t);
1060 new_binfo = make_tree_binfo (binfo ? BINFO_N_BASE_BINFOS (binfo) : 0);
1061 BINFO_TYPE (new_binfo) = type;
1063 /* Chain it into the inheritance graph. */
1064 TREE_CHAIN (*igo_prev) = new_binfo;
1065 *igo_prev = new_binfo;
1072 gcc_assert (!BINFO_DEPENDENT_BASE_P (binfo));
1073 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), type));
1075 BINFO_OFFSET (new_binfo) = BINFO_OFFSET (binfo);
1076 BINFO_VIRTUALS (new_binfo) = BINFO_VIRTUALS (binfo);
1078 /* We do not need to copy the accesses, as they are read only. */
1079 BINFO_BASE_ACCESSES (new_binfo) = BINFO_BASE_ACCESSES (binfo);
1081 /* Recursively copy base binfos of BINFO. */
1082 for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++)
1084 tree new_base_binfo;
1086 gcc_assert (!BINFO_DEPENDENT_BASE_P (base_binfo));
1087 new_base_binfo = copy_binfo (base_binfo, BINFO_TYPE (base_binfo),
1089 BINFO_VIRTUAL_P (base_binfo));
1091 if (!BINFO_INHERITANCE_CHAIN (new_base_binfo))
1092 BINFO_INHERITANCE_CHAIN (new_base_binfo) = new_binfo;
1093 BINFO_BASE_APPEND (new_binfo, new_base_binfo);
1097 BINFO_DEPENDENT_BASE_P (new_binfo) = 1;
1101 /* Push it onto the list after any virtual bases it contains
1102 will have been pushed. */
1103 VEC_quick_push (tree, CLASSTYPE_VBASECLASSES (t), new_binfo);
1104 BINFO_VIRTUAL_P (new_binfo) = 1;
1105 BINFO_INHERITANCE_CHAIN (new_binfo) = TYPE_BINFO (t);
1111 /* Hashing of lists so that we don't make duplicates.
1112 The entry point is `list_hash_canon'. */
1114 /* Now here is the hash table. When recording a list, it is added
1115 to the slot whose index is the hash code mod the table size.
1116 Note that the hash table is used for several kinds of lists.
1117 While all these live in the same table, they are completely independent,
1118 and the hash code is computed differently for each of these. */
1120 static GTY ((param_is (union tree_node))) htab_t list_hash_table;
1129 /* Compare ENTRY (an entry in the hash table) with DATA (a list_proxy
1130 for a node we are thinking about adding). */
1133 list_hash_eq (const void* entry, const void* data)
1135 const_tree const t = (const_tree) entry;
1136 const struct list_proxy *const proxy = (const struct list_proxy *) data;
1138 return (TREE_VALUE (t) == proxy->value
1139 && TREE_PURPOSE (t) == proxy->purpose
1140 && TREE_CHAIN (t) == proxy->chain);
1143 /* Compute a hash code for a list (chain of TREE_LIST nodes
1144 with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the
1145 TREE_COMMON slots), by adding the hash codes of the individual entries. */
1148 list_hash_pieces (tree purpose, tree value, tree chain)
1150 hashval_t hashcode = 0;
1153 hashcode += TREE_HASH (chain);
1156 hashcode += TREE_HASH (value);
1160 hashcode += TREE_HASH (purpose);
1166 /* Hash an already existing TREE_LIST. */
1169 list_hash (const void* p)
1171 const_tree const t = (const_tree) p;
1172 return list_hash_pieces (TREE_PURPOSE (t),
1177 /* Given list components PURPOSE, VALUE, AND CHAIN, return the canonical
1178 object for an identical list if one already exists. Otherwise, build a
1179 new one, and record it as the canonical object. */
1182 hash_tree_cons (tree purpose, tree value, tree chain)
1186 struct list_proxy proxy;
1188 /* Hash the list node. */
1189 hashcode = list_hash_pieces (purpose, value, chain);
1190 /* Create a proxy for the TREE_LIST we would like to create. We
1191 don't actually create it so as to avoid creating garbage. */
1192 proxy.purpose = purpose;
1193 proxy.value = value;
1194 proxy.chain = chain;
1195 /* See if it is already in the table. */
1196 slot = htab_find_slot_with_hash (list_hash_table, &proxy, hashcode,
1198 /* If not, create a new node. */
1200 *slot = tree_cons (purpose, value, chain);
1201 return (tree) *slot;
1204 /* Constructor for hashed lists. */
1207 hash_tree_chain (tree value, tree chain)
1209 return hash_tree_cons (NULL_TREE, value, chain);
1213 debug_binfo (tree elem)
1218 fprintf (stderr, "type \"%s\", offset = " HOST_WIDE_INT_PRINT_DEC
1220 TYPE_NAME_STRING (BINFO_TYPE (elem)),
1221 TREE_INT_CST_LOW (BINFO_OFFSET (elem)));
1222 debug_tree (BINFO_TYPE (elem));
1223 if (BINFO_VTABLE (elem))
1224 fprintf (stderr, "vtable decl \"%s\"\n",
1225 IDENTIFIER_POINTER (DECL_NAME (get_vtbl_decl_for_binfo (elem))));
1227 fprintf (stderr, "no vtable decl yet\n");
1228 fprintf (stderr, "virtuals:\n");
1229 virtuals = BINFO_VIRTUALS (elem);
1234 tree fndecl = TREE_VALUE (virtuals);
1235 fprintf (stderr, "%s [%ld =? %ld]\n",
1236 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl)),
1237 (long) n, (long) TREE_INT_CST_LOW (DECL_VINDEX (fndecl)));
1239 virtuals = TREE_CHAIN (virtuals);
1243 /* Build a representation for the qualified name SCOPE::NAME. TYPE is
1244 the type of the result expression, if known, or NULL_TREE if the
1245 resulting expression is type-dependent. If TEMPLATE_P is true,
1246 NAME is known to be a template because the user explicitly used the
1247 "template" keyword after the "::".
1249 All SCOPE_REFs should be built by use of this function. */
1252 build_qualified_name (tree type, tree scope, tree name, bool template_p)
1255 if (type == error_mark_node
1256 || scope == error_mark_node
1257 || name == error_mark_node)
1258 return error_mark_node;
1259 t = build2 (SCOPE_REF, type, scope, name);
1260 QUALIFIED_NAME_IS_TEMPLATE (t) = template_p;
1264 /* Returns nonzero if X is an expression for a (possibly overloaded)
1265 function. If "f" is a function or function template, "f", "c->f",
1266 "c.f", "C::f", and "f<int>" will all be considered possibly
1267 overloaded functions. Returns 2 if the function is actually
1268 overloaded, i.e., if it is impossible to know the type of the
1269 function without performing overload resolution. */
1272 is_overloaded_fn (tree x)
1274 /* A baselink is also considered an overloaded function. */
1275 if (TREE_CODE (x) == OFFSET_REF
1276 || TREE_CODE (x) == COMPONENT_REF)
1277 x = TREE_OPERAND (x, 1);
1279 x = BASELINK_FUNCTIONS (x);
1280 if (TREE_CODE (x) == TEMPLATE_ID_EXPR)
1281 x = TREE_OPERAND (x, 0);
1282 if (DECL_FUNCTION_TEMPLATE_P (OVL_CURRENT (x))
1283 || (TREE_CODE (x) == OVERLOAD && OVL_CHAIN (x)))
1285 return (TREE_CODE (x) == FUNCTION_DECL
1286 || TREE_CODE (x) == OVERLOAD);
1289 /* Returns true iff X is an expression for an overloaded function
1290 whose type cannot be known without performing overload
1294 really_overloaded_fn (tree x)
1296 return is_overloaded_fn (x) == 2;
1300 get_first_fn (tree from)
1302 gcc_assert (is_overloaded_fn (from));
1303 /* A baselink is also considered an overloaded function. */
1304 if (TREE_CODE (from) == OFFSET_REF
1305 || TREE_CODE (from) == COMPONENT_REF)
1306 from = TREE_OPERAND (from, 1);
1307 if (BASELINK_P (from))
1308 from = BASELINK_FUNCTIONS (from);
1309 if (TREE_CODE (from) == TEMPLATE_ID_EXPR)
1310 from = TREE_OPERAND (from, 0);
1311 return OVL_CURRENT (from);
1314 /* Return a new OVL node, concatenating it with the old one. */
1317 ovl_cons (tree decl, tree chain)
1319 tree result = make_node (OVERLOAD);
1320 TREE_TYPE (result) = unknown_type_node;
1321 OVL_FUNCTION (result) = decl;
1322 TREE_CHAIN (result) = chain;
1327 /* Build a new overloaded function. If this is the first one,
1328 just return it; otherwise, ovl_cons the _DECLs */
1331 build_overload (tree decl, tree chain)
1333 if (! chain && TREE_CODE (decl) != TEMPLATE_DECL)
1335 if (chain && TREE_CODE (chain) != OVERLOAD)
1336 chain = ovl_cons (chain, NULL_TREE);
1337 return ovl_cons (decl, chain);
1341 #define PRINT_RING_SIZE 4
1344 cxx_printable_name_internal (tree decl, int v, bool translate)
1346 static unsigned int uid_ring[PRINT_RING_SIZE];
1347 static char *print_ring[PRINT_RING_SIZE];
1348 static bool trans_ring[PRINT_RING_SIZE];
1349 static int ring_counter;
1352 /* Only cache functions. */
1354 || TREE_CODE (decl) != FUNCTION_DECL
1355 || DECL_LANG_SPECIFIC (decl) == 0)
1356 return lang_decl_name (decl, v, translate);
1358 /* See if this print name is lying around. */
1359 for (i = 0; i < PRINT_RING_SIZE; i++)
1360 if (uid_ring[i] == DECL_UID (decl) && translate == trans_ring[i])
1361 /* yes, so return it. */
1362 return print_ring[i];
1364 if (++ring_counter == PRINT_RING_SIZE)
1367 if (current_function_decl != NULL_TREE)
1369 /* There may be both translated and untranslated versions of the
1371 for (i = 0; i < 2; i++)
1373 if (uid_ring[ring_counter] == DECL_UID (current_function_decl))
1375 if (ring_counter == PRINT_RING_SIZE)
1378 gcc_assert (uid_ring[ring_counter] != DECL_UID (current_function_decl));
1381 if (print_ring[ring_counter])
1382 free (print_ring[ring_counter]);
1384 print_ring[ring_counter] = xstrdup (lang_decl_name (decl, v, translate));
1385 uid_ring[ring_counter] = DECL_UID (decl);
1386 trans_ring[ring_counter] = translate;
1387 return print_ring[ring_counter];
1391 cxx_printable_name (tree decl, int v)
1393 return cxx_printable_name_internal (decl, v, false);
1397 cxx_printable_name_translate (tree decl, int v)
1399 return cxx_printable_name_internal (decl, v, true);
1402 /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions
1403 listed in RAISES. */
1406 build_exception_variant (tree type, tree raises)
1408 tree v = TYPE_MAIN_VARIANT (type);
1409 int type_quals = TYPE_QUALS (type);
1411 for (; v; v = TYPE_NEXT_VARIANT (v))
1412 if (check_qualified_type (v, type, type_quals)
1413 && comp_except_specs (raises, TYPE_RAISES_EXCEPTIONS (v), 1))
1416 /* Need to build a new variant. */
1417 v = build_variant_type_copy (type);
1418 TYPE_RAISES_EXCEPTIONS (v) = raises;
1422 /* Given a TEMPLATE_TEMPLATE_PARM node T, create a new
1423 BOUND_TEMPLATE_TEMPLATE_PARM bound with NEWARGS as its template
1427 bind_template_template_parm (tree t, tree newargs)
1429 tree decl = TYPE_NAME (t);
1432 t2 = cxx_make_type (BOUND_TEMPLATE_TEMPLATE_PARM);
1433 decl = build_decl (input_location,
1434 TYPE_DECL, DECL_NAME (decl), NULL_TREE);
1436 /* These nodes have to be created to reflect new TYPE_DECL and template
1438 TEMPLATE_TYPE_PARM_INDEX (t2) = copy_node (TEMPLATE_TYPE_PARM_INDEX (t));
1439 TEMPLATE_PARM_DECL (TEMPLATE_TYPE_PARM_INDEX (t2)) = decl;
1440 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2)
1441 = tree_cons (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t),
1442 newargs, NULL_TREE);
1444 TREE_TYPE (decl) = t2;
1445 TYPE_NAME (t2) = decl;
1446 TYPE_STUB_DECL (t2) = decl;
1448 SET_TYPE_STRUCTURAL_EQUALITY (t2);
1453 /* Called from count_trees via walk_tree. */
1456 count_trees_r (tree *tp, int *walk_subtrees, void *data)
1466 /* Debugging function for measuring the rough complexity of a tree
1470 count_trees (tree t)
1473 cp_walk_tree_without_duplicates (&t, count_trees_r, &n_trees);
1477 /* Called from verify_stmt_tree via walk_tree. */
1480 verify_stmt_tree_r (tree* tp,
1481 int* walk_subtrees ATTRIBUTE_UNUSED ,
1485 htab_t *statements = (htab_t *) data;
1488 if (!STATEMENT_CODE_P (TREE_CODE (t)))
1491 /* If this statement is already present in the hash table, then
1492 there is a circularity in the statement tree. */
1493 gcc_assert (!htab_find (*statements, t));
1495 slot = htab_find_slot (*statements, t, INSERT);
1501 /* Debugging function to check that the statement T has not been
1502 corrupted. For now, this function simply checks that T contains no
1506 verify_stmt_tree (tree t)
1509 statements = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
1510 cp_walk_tree (&t, verify_stmt_tree_r, &statements, NULL);
1511 htab_delete (statements);
1514 /* Check if the type T depends on a type with no linkage and if so, return
1515 it. If RELAXED_P then do not consider a class type declared within
1516 a TREE_PUBLIC function to have no linkage. */
1519 no_linkage_check (tree t, bool relaxed_p)
1523 /* There's no point in checking linkage on template functions; we
1524 can't know their complete types. */
1525 if (processing_template_decl)
1528 switch (TREE_CODE (t))
1533 if (TYPE_PTRMEMFUNC_P (t))
1537 if (!CLASS_TYPE_P (t))
1541 if (TYPE_ANONYMOUS_P (t))
1543 fn = decl_function_context (TYPE_MAIN_DECL (t));
1544 if (fn && (!relaxed_p || !TREE_PUBLIC (fn)))
1550 case REFERENCE_TYPE:
1551 return no_linkage_check (TREE_TYPE (t), relaxed_p);
1555 r = no_linkage_check (TYPE_PTRMEM_POINTED_TO_TYPE (t),
1559 return no_linkage_check (TYPE_PTRMEM_CLASS_TYPE (t), relaxed_p);
1562 r = no_linkage_check (TYPE_METHOD_BASETYPE (t), relaxed_p);
1569 for (parm = TYPE_ARG_TYPES (t);
1570 parm && parm != void_list_node;
1571 parm = TREE_CHAIN (parm))
1573 r = no_linkage_check (TREE_VALUE (parm), relaxed_p);
1577 return no_linkage_check (TREE_TYPE (t), relaxed_p);
1585 #ifdef GATHER_STATISTICS
1586 extern int depth_reached;
1590 cxx_print_statistics (void)
1592 print_search_statistics ();
1593 print_class_statistics ();
1594 #ifdef GATHER_STATISTICS
1595 fprintf (stderr, "maximum template instantiation depth reached: %d\n",
1600 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1601 (which is an ARRAY_TYPE). This counts only elements of the top
1605 array_type_nelts_top (tree type)
1607 return fold_build2_loc (input_location,
1608 PLUS_EXPR, sizetype,
1609 array_type_nelts (type),
1613 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1614 (which is an ARRAY_TYPE). This one is a recursive count of all
1615 ARRAY_TYPEs that are clumped together. */
1618 array_type_nelts_total (tree type)
1620 tree sz = array_type_nelts_top (type);
1621 type = TREE_TYPE (type);
1622 while (TREE_CODE (type) == ARRAY_TYPE)
1624 tree n = array_type_nelts_top (type);
1625 sz = fold_build2_loc (input_location,
1626 MULT_EXPR, sizetype, sz, n);
1627 type = TREE_TYPE (type);
1632 /* Called from break_out_target_exprs via mapcar. */
1635 bot_manip (tree* tp, int* walk_subtrees, void* data)
1637 splay_tree target_remap = ((splay_tree) data);
1640 if (!TYPE_P (t) && TREE_CONSTANT (t))
1642 /* There can't be any TARGET_EXPRs or their slot variables below
1643 this point. We used to check !TREE_SIDE_EFFECTS, but then we
1644 failed to copy an ADDR_EXPR of the slot VAR_DECL. */
1648 if (TREE_CODE (t) == TARGET_EXPR)
1652 if (TREE_CODE (TREE_OPERAND (t, 1)) == AGGR_INIT_EXPR)
1653 u = build_cplus_new (TREE_TYPE (t), TREE_OPERAND (t, 1));
1655 u = build_target_expr_with_type (TREE_OPERAND (t, 1), TREE_TYPE (t));
1657 /* Map the old variable to the new one. */
1658 splay_tree_insert (target_remap,
1659 (splay_tree_key) TREE_OPERAND (t, 0),
1660 (splay_tree_value) TREE_OPERAND (u, 0));
1662 TREE_OPERAND (u, 1) = break_out_target_exprs (TREE_OPERAND (u, 1));
1664 /* Replace the old expression with the new version. */
1666 /* We don't have to go below this point; the recursive call to
1667 break_out_target_exprs will have handled anything below this
1673 /* Make a copy of this node. */
1674 return copy_tree_r (tp, walk_subtrees, NULL);
1677 /* Replace all remapped VAR_DECLs in T with their new equivalents.
1678 DATA is really a splay-tree mapping old variables to new
1682 bot_replace (tree* t,
1683 int* walk_subtrees ATTRIBUTE_UNUSED ,
1686 splay_tree target_remap = ((splay_tree) data);
1688 if (TREE_CODE (*t) == VAR_DECL)
1690 splay_tree_node n = splay_tree_lookup (target_remap,
1691 (splay_tree_key) *t);
1693 *t = (tree) n->value;
1699 /* When we parse a default argument expression, we may create
1700 temporary variables via TARGET_EXPRs. When we actually use the
1701 default-argument expression, we make a copy of the expression, but
1702 we must replace the temporaries with appropriate local versions. */
1705 break_out_target_exprs (tree t)
1707 static int target_remap_count;
1708 static splay_tree target_remap;
1710 if (!target_remap_count++)
1711 target_remap = splay_tree_new (splay_tree_compare_pointers,
1712 /*splay_tree_delete_key_fn=*/NULL,
1713 /*splay_tree_delete_value_fn=*/NULL);
1714 cp_walk_tree (&t, bot_manip, target_remap, NULL);
1715 cp_walk_tree (&t, bot_replace, target_remap, NULL);
1717 if (!--target_remap_count)
1719 splay_tree_delete (target_remap);
1720 target_remap = NULL;
1726 /* Similar to `build_nt', but for template definitions of dependent
1730 build_min_nt (enum tree_code code, ...)
1737 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
1741 t = make_node (code);
1742 length = TREE_CODE_LENGTH (code);
1744 for (i = 0; i < length; i++)
1746 tree x = va_arg (p, tree);
1747 TREE_OPERAND (t, i) = x;
1755 /* Similar to `build', but for template definitions. */
1758 build_min (enum tree_code code, tree tt, ...)
1765 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
1769 t = make_node (code);
1770 length = TREE_CODE_LENGTH (code);
1773 for (i = 0; i < length; i++)
1775 tree x = va_arg (p, tree);
1776 TREE_OPERAND (t, i) = x;
1777 if (x && !TYPE_P (x) && TREE_SIDE_EFFECTS (x))
1778 TREE_SIDE_EFFECTS (t) = 1;
1785 /* Similar to `build', but for template definitions of non-dependent
1786 expressions. NON_DEP is the non-dependent expression that has been
1790 build_min_non_dep (enum tree_code code, tree non_dep, ...)
1797 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
1799 va_start (p, non_dep);
1801 t = make_node (code);
1802 length = TREE_CODE_LENGTH (code);
1803 TREE_TYPE (t) = TREE_TYPE (non_dep);
1804 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (non_dep);
1806 for (i = 0; i < length; i++)
1808 tree x = va_arg (p, tree);
1809 TREE_OPERAND (t, i) = x;
1812 if (code == COMPOUND_EXPR && TREE_CODE (non_dep) != COMPOUND_EXPR)
1813 /* This should not be considered a COMPOUND_EXPR, because it
1814 resolves to an overload. */
1815 COMPOUND_EXPR_OVERLOADED (t) = 1;
1821 /* Similar to `build_call_list', but for template definitions of non-dependent
1822 expressions. NON_DEP is the non-dependent expression that has been
1826 build_min_non_dep_call_vec (tree non_dep, tree fn, VEC(tree,gc) *argvec)
1828 tree t = build_nt_call_vec (fn, argvec);
1829 TREE_TYPE (t) = TREE_TYPE (non_dep);
1830 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (non_dep);
1835 get_type_decl (tree t)
1837 if (TREE_CODE (t) == TYPE_DECL)
1840 return TYPE_STUB_DECL (t);
1841 gcc_assert (t == error_mark_node);
1845 /* Returns the namespace that contains DECL, whether directly or
1849 decl_namespace_context (tree decl)
1853 if (TREE_CODE (decl) == NAMESPACE_DECL)
1855 else if (TYPE_P (decl))
1856 decl = CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl));
1858 decl = CP_DECL_CONTEXT (decl);
1862 /* Returns true if decl is within an anonymous namespace, however deeply
1863 nested, or false otherwise. */
1866 decl_anon_ns_mem_p (const_tree decl)
1870 if (decl == NULL_TREE || decl == error_mark_node)
1872 if (TREE_CODE (decl) == NAMESPACE_DECL
1873 && DECL_NAME (decl) == NULL_TREE)
1875 /* Classes and namespaces inside anonymous namespaces have
1876 TREE_PUBLIC == 0, so we can shortcut the search. */
1877 else if (TYPE_P (decl))
1878 return (TREE_PUBLIC (TYPE_NAME (decl)) == 0);
1879 else if (TREE_CODE (decl) == NAMESPACE_DECL)
1880 return (TREE_PUBLIC (decl) == 0);
1882 decl = DECL_CONTEXT (decl);
1886 /* Return truthvalue of whether T1 is the same tree structure as T2.
1887 Return 1 if they are the same. Return 0 if they are different. */
1890 cp_tree_equal (tree t1, tree t2)
1892 enum tree_code code1, code2;
1899 for (code1 = TREE_CODE (t1);
1900 CONVERT_EXPR_CODE_P (code1)
1901 || code1 == NON_LVALUE_EXPR;
1902 code1 = TREE_CODE (t1))
1903 t1 = TREE_OPERAND (t1, 0);
1904 for (code2 = TREE_CODE (t2);
1905 CONVERT_EXPR_CODE_P (code2)
1906 || code1 == NON_LVALUE_EXPR;
1907 code2 = TREE_CODE (t2))
1908 t2 = TREE_OPERAND (t2, 0);
1910 /* They might have become equal now. */
1920 return TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
1921 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2);
1924 return REAL_VALUES_EQUAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
1927 return TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
1928 && !memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
1929 TREE_STRING_LENGTH (t1));
1932 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1),
1933 TREE_FIXED_CST (t2));
1936 return cp_tree_equal (TREE_REALPART (t1), TREE_REALPART (t2))
1937 && cp_tree_equal (TREE_IMAGPART (t1), TREE_IMAGPART (t2));
1940 /* We need to do this when determining whether or not two
1941 non-type pointer to member function template arguments
1943 if (!(same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
1944 /* The first operand is RTL. */
1945 && TREE_OPERAND (t1, 0) == TREE_OPERAND (t2, 0)))
1947 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1950 if (!cp_tree_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2)))
1952 if (!cp_tree_equal (TREE_VALUE (t1), TREE_VALUE (t2)))
1954 return cp_tree_equal (TREE_CHAIN (t1), TREE_CHAIN (t2));
1957 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1962 call_expr_arg_iterator iter1, iter2;
1963 if (!cp_tree_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2)))
1965 for (arg1 = first_call_expr_arg (t1, &iter1),
1966 arg2 = first_call_expr_arg (t2, &iter2);
1968 arg1 = next_call_expr_arg (&iter1),
1969 arg2 = next_call_expr_arg (&iter2))
1970 if (!cp_tree_equal (arg1, arg2))
1972 return (arg1 || arg2);
1977 tree o1 = TREE_OPERAND (t1, 0);
1978 tree o2 = TREE_OPERAND (t2, 0);
1980 /* Special case: if either target is an unallocated VAR_DECL,
1981 it means that it's going to be unified with whatever the
1982 TARGET_EXPR is really supposed to initialize, so treat it
1983 as being equivalent to anything. */
1984 if (TREE_CODE (o1) == VAR_DECL && DECL_NAME (o1) == NULL_TREE
1985 && !DECL_RTL_SET_P (o1))
1987 else if (TREE_CODE (o2) == VAR_DECL && DECL_NAME (o2) == NULL_TREE
1988 && !DECL_RTL_SET_P (o2))
1990 else if (!cp_tree_equal (o1, o2))
1993 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1996 case WITH_CLEANUP_EXPR:
1997 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
1999 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
2002 if (TREE_OPERAND (t1, 1) != TREE_OPERAND (t2, 1))
2004 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
2007 /* For comparing uses of parameters in late-specified return types
2008 with an out-of-class definition of the function. */
2009 if (same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
2010 && DECL_PARM_INDEX (t1) == DECL_PARM_INDEX (t2))
2019 case IDENTIFIER_NODE:
2024 return (BASELINK_BINFO (t1) == BASELINK_BINFO (t2)
2025 && BASELINK_ACCESS_BINFO (t1) == BASELINK_ACCESS_BINFO (t2)
2026 && cp_tree_equal (BASELINK_FUNCTIONS (t1),
2027 BASELINK_FUNCTIONS (t2)));
2029 case TEMPLATE_PARM_INDEX:
2030 return (TEMPLATE_PARM_IDX (t1) == TEMPLATE_PARM_IDX (t2)
2031 && TEMPLATE_PARM_LEVEL (t1) == TEMPLATE_PARM_LEVEL (t2)
2032 && same_type_p (TREE_TYPE (TEMPLATE_PARM_DECL (t1)),
2033 TREE_TYPE (TEMPLATE_PARM_DECL (t2))));
2035 case TEMPLATE_ID_EXPR:
2040 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
2042 vec1 = TREE_OPERAND (t1, 1);
2043 vec2 = TREE_OPERAND (t2, 1);
2046 return !vec1 && !vec2;
2048 if (TREE_VEC_LENGTH (vec1) != TREE_VEC_LENGTH (vec2))
2051 for (ix = TREE_VEC_LENGTH (vec1); ix--;)
2052 if (!cp_tree_equal (TREE_VEC_ELT (vec1, ix),
2053 TREE_VEC_ELT (vec2, ix)))
2062 tree o1 = TREE_OPERAND (t1, 0);
2063 tree o2 = TREE_OPERAND (t2, 0);
2065 if (TREE_CODE (o1) != TREE_CODE (o2))
2068 return same_type_p (o1, o2);
2070 return cp_tree_equal (o1, o2);
2075 tree t1_op1, t2_op1;
2077 if (!cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)))
2080 t1_op1 = TREE_OPERAND (t1, 1);
2081 t2_op1 = TREE_OPERAND (t2, 1);
2082 if (TREE_CODE (t1_op1) != TREE_CODE (t2_op1))
2085 return cp_tree_equal (TREE_OPERAND (t1, 2), TREE_OPERAND (t2, 2));
2089 /* Two pointer-to-members are the same if they point to the same
2090 field or function in the same class. */
2091 if (PTRMEM_CST_MEMBER (t1) != PTRMEM_CST_MEMBER (t2))
2094 return same_type_p (PTRMEM_CST_CLASS (t1), PTRMEM_CST_CLASS (t2));
2097 if (OVL_FUNCTION (t1) != OVL_FUNCTION (t2))
2099 return cp_tree_equal (OVL_CHAIN (t1), OVL_CHAIN (t2));
2102 if (TRAIT_EXPR_KIND (t1) != TRAIT_EXPR_KIND (t2))
2104 return same_type_p (TRAIT_EXPR_TYPE1 (t1), TRAIT_EXPR_TYPE1 (t2))
2105 && same_type_p (TRAIT_EXPR_TYPE2 (t1), TRAIT_EXPR_TYPE2 (t2));
2111 switch (TREE_CODE_CLASS (code1))
2115 case tcc_comparison:
2116 case tcc_expression:
2123 n = TREE_OPERAND_LENGTH (t1);
2124 if (TREE_CODE_CLASS (code1) == tcc_vl_exp
2125 && n != TREE_OPERAND_LENGTH (t2))
2128 for (i = 0; i < n; ++i)
2129 if (!cp_tree_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i)))
2136 return same_type_p (t1, t2);
2140 /* We can get here with --disable-checking. */
2144 /* The type of ARG when used as an lvalue. */
2147 lvalue_type (tree arg)
2149 tree type = TREE_TYPE (arg);
2153 /* The type of ARG for printing error messages; denote lvalues with
2157 error_type (tree arg)
2159 tree type = TREE_TYPE (arg);
2161 if (TREE_CODE (type) == ARRAY_TYPE)
2163 else if (TREE_CODE (type) == ERROR_MARK)
2165 else if (real_lvalue_p (arg))
2166 type = build_reference_type (lvalue_type (arg));
2167 else if (MAYBE_CLASS_TYPE_P (type))
2168 type = lvalue_type (arg);
2173 /* Does FUNCTION use a variable-length argument list? */
2176 varargs_function_p (const_tree function)
2178 const_tree parm = TYPE_ARG_TYPES (TREE_TYPE (function));
2179 for (; parm; parm = TREE_CHAIN (parm))
2180 if (TREE_VALUE (parm) == void_type_node)
2185 /* Returns 1 if decl is a member of a class. */
2188 member_p (const_tree decl)
2190 const_tree const ctx = DECL_CONTEXT (decl);
2191 return (ctx && TYPE_P (ctx));
2194 /* Create a placeholder for member access where we don't actually have an
2195 object that the access is against. */
2198 build_dummy_object (tree type)
2200 tree decl = build1 (NOP_EXPR, build_pointer_type (type), void_zero_node);
2201 return cp_build_indirect_ref (decl, NULL, tf_warning_or_error);
2204 /* We've gotten a reference to a member of TYPE. Return *this if appropriate,
2205 or a dummy object otherwise. If BINFOP is non-0, it is filled with the
2206 binfo path from current_class_type to TYPE, or 0. */
2209 maybe_dummy_object (tree type, tree* binfop)
2214 if (current_class_type
2215 && (binfo = lookup_base (current_class_type, type,
2216 ba_unique | ba_quiet, NULL)))
2217 context = current_class_type;
2220 /* Reference from a nested class member function. */
2222 binfo = TYPE_BINFO (type);
2228 if (current_class_ref && context == current_class_type
2229 /* Kludge: Make sure that current_class_type is actually
2230 correct. It might not be if we're in the middle of
2231 tsubst_default_argument. */
2232 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref)),
2233 current_class_type))
2234 decl = current_class_ref;
2236 decl = build_dummy_object (context);
2241 /* Returns 1 if OB is a placeholder object, or a pointer to one. */
2244 is_dummy_object (const_tree ob)
2246 if (TREE_CODE (ob) == INDIRECT_REF)
2247 ob = TREE_OPERAND (ob, 0);
2248 return (TREE_CODE (ob) == NOP_EXPR
2249 && TREE_OPERAND (ob, 0) == void_zero_node);
2252 /* Returns 1 iff type T is something we want to treat as a scalar type for
2253 the purpose of deciding whether it is trivial/POD/standard-layout. */
2256 scalarish_type_p (const_tree t)
2258 if (t == error_mark_node)
2261 return (SCALAR_TYPE_P (t)
2262 || TREE_CODE (t) == VECTOR_TYPE);
2265 /* Returns true iff T requires non-trivial default initialization. */
2268 type_has_nontrivial_default_init (const_tree t)
2270 t = strip_array_types (CONST_CAST_TREE (t));
2272 if (CLASS_TYPE_P (t))
2273 return TYPE_HAS_COMPLEX_DFLT (t);
2278 /* Returns true iff copying an object of type T is non-trivial. */
2281 type_has_nontrivial_copy_init (const_tree t)
2283 t = strip_array_types (CONST_CAST_TREE (t));
2285 if (CLASS_TYPE_P (t))
2286 return TYPE_HAS_COMPLEX_INIT_REF (t);
2291 /* Returns 1 iff type T is a trivial type, as defined in [basic.types]. */
2294 trivial_type_p (const_tree t)
2296 t = strip_array_types (CONST_CAST_TREE (t));
2298 if (CLASS_TYPE_P (t))
2299 return !(TYPE_HAS_COMPLEX_DFLT (t)
2300 || TYPE_HAS_COMPLEX_INIT_REF (t)
2301 || TYPE_HAS_COMPLEX_ASSIGN_REF (t)
2302 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t));
2304 return scalarish_type_p (t);
2307 /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */
2310 pod_type_p (const_tree t)
2312 /* This CONST_CAST is okay because strip_array_types returns its
2313 argument unmodified and we assign it to a const_tree. */
2314 t = strip_array_types (CONST_CAST_TREE(t));
2316 if (CLASS_TYPE_P (t))
2317 /* [class]/10: A POD struct is a class that is both a trivial class and a
2318 standard-layout class, and has no non-static data members of type
2319 non-POD struct, non-POD union (or array of such types).
2321 We don't need to check individual members because if a member is
2322 non-std-layout or non-trivial, the class will be too. */
2323 return (std_layout_type_p (t) && trivial_type_p (t));
2325 return scalarish_type_p (t);
2328 /* Returns true iff T is POD for the purpose of layout, as defined in the
2332 layout_pod_type_p (const_tree t)
2334 t = strip_array_types (CONST_CAST_TREE (t));
2336 if (CLASS_TYPE_P (t))
2337 return !CLASSTYPE_NON_LAYOUT_POD_P (t);
2339 return scalarish_type_p (t);
2342 /* Returns true iff T is a standard-layout type, as defined in
2346 std_layout_type_p (const_tree t)
2348 t = strip_array_types (CONST_CAST_TREE (t));
2350 if (CLASS_TYPE_P (t))
2351 return !CLASSTYPE_NON_STD_LAYOUT (t);
2353 return scalarish_type_p (t);
2356 /* Nonzero iff type T is a class template implicit specialization. */
2359 class_tmpl_impl_spec_p (const_tree t)
2361 return CLASS_TYPE_P (t) && CLASSTYPE_TEMPLATE_INSTANTIATION (t);
2364 /* Returns 1 iff zero initialization of type T means actually storing
2368 zero_init_p (const_tree t)
2370 /* This CONST_CAST is okay because strip_array_types returns its
2371 argument unmodified and we assign it to a const_tree. */
2372 t = strip_array_types (CONST_CAST_TREE(t));
2374 if (t == error_mark_node)
2377 /* NULL pointers to data members are initialized with -1. */
2378 if (TYPE_PTRMEM_P (t))
2381 /* Classes that contain types that can't be zero-initialized, cannot
2382 be zero-initialized themselves. */
2383 if (CLASS_TYPE_P (t) && CLASSTYPE_NON_ZERO_INIT_P (t))
2389 /* Table of valid C++ attributes. */
2390 const struct attribute_spec cxx_attribute_table[] =
2392 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
2393 { "java_interface", 0, 0, false, false, false, handle_java_interface_attribute },
2394 { "com_interface", 0, 0, false, false, false, handle_com_interface_attribute },
2395 { "init_priority", 1, 1, true, false, false, handle_init_priority_attribute },
2396 { NULL, 0, 0, false, false, false, NULL }
2399 /* Handle a "java_interface" attribute; arguments as in
2400 struct attribute_spec.handler. */
2402 handle_java_interface_attribute (tree* node,
2404 tree args ATTRIBUTE_UNUSED ,
2409 || !CLASS_TYPE_P (*node)
2410 || !TYPE_FOR_JAVA (*node))
2412 error ("%qE attribute can only be applied to Java class definitions",
2414 *no_add_attrs = true;
2417 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
2418 *node = build_variant_type_copy (*node);
2419 TYPE_JAVA_INTERFACE (*node) = 1;
2424 /* Handle a "com_interface" attribute; arguments as in
2425 struct attribute_spec.handler. */
2427 handle_com_interface_attribute (tree* node,
2429 tree args ATTRIBUTE_UNUSED ,
2430 int flags ATTRIBUTE_UNUSED ,
2435 *no_add_attrs = true;
2438 || !CLASS_TYPE_P (*node)
2439 || *node != TYPE_MAIN_VARIANT (*node))
2441 warning (OPT_Wattributes, "%qE attribute can only be applied "
2442 "to class definitions", name);
2447 warning (0, "%qE is obsolete; g++ vtables are now COM-compatible by default",
2453 /* Handle an "init_priority" attribute; arguments as in
2454 struct attribute_spec.handler. */
2456 handle_init_priority_attribute (tree* node,
2459 int flags ATTRIBUTE_UNUSED ,
2462 tree initp_expr = TREE_VALUE (args);
2464 tree type = TREE_TYPE (decl);
2467 STRIP_NOPS (initp_expr);
2469 if (!initp_expr || TREE_CODE (initp_expr) != INTEGER_CST)
2471 error ("requested init_priority is not an integer constant");
2472 *no_add_attrs = true;
2476 pri = TREE_INT_CST_LOW (initp_expr);
2478 type = strip_array_types (type);
2480 if (decl == NULL_TREE
2481 || TREE_CODE (decl) != VAR_DECL
2482 || !TREE_STATIC (decl)
2483 || DECL_EXTERNAL (decl)
2484 || (TREE_CODE (type) != RECORD_TYPE
2485 && TREE_CODE (type) != UNION_TYPE)
2486 /* Static objects in functions are initialized the
2487 first time control passes through that
2488 function. This is not precise enough to pin down an
2489 init_priority value, so don't allow it. */
2490 || current_function_decl)
2492 error ("can only use %qE attribute on file-scope definitions "
2493 "of objects of class type", name);
2494 *no_add_attrs = true;
2498 if (pri > MAX_INIT_PRIORITY || pri <= 0)
2500 error ("requested init_priority is out of range");
2501 *no_add_attrs = true;
2505 /* Check for init_priorities that are reserved for
2506 language and runtime support implementations.*/
2507 if (pri <= MAX_RESERVED_INIT_PRIORITY)
2510 (0, "requested init_priority is reserved for internal use");
2513 if (SUPPORTS_INIT_PRIORITY)
2515 SET_DECL_INIT_PRIORITY (decl, pri);
2516 DECL_HAS_INIT_PRIORITY_P (decl) = 1;
2521 error ("%qE attribute is not supported on this platform", name);
2522 *no_add_attrs = true;
2527 /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the
2528 thing pointed to by the constant. */
2531 make_ptrmem_cst (tree type, tree member)
2533 tree ptrmem_cst = make_node (PTRMEM_CST);
2534 TREE_TYPE (ptrmem_cst) = type;
2535 PTRMEM_CST_MEMBER (ptrmem_cst) = member;
2539 /* Build a variant of TYPE that has the indicated ATTRIBUTES. May
2540 return an existing type if an appropriate type already exists. */
2543 cp_build_type_attribute_variant (tree type, tree attributes)
2547 new_type = build_type_attribute_variant (type, attributes);
2548 if (TREE_CODE (new_type) == FUNCTION_TYPE
2549 && (TYPE_RAISES_EXCEPTIONS (new_type)
2550 != TYPE_RAISES_EXCEPTIONS (type)))
2551 new_type = build_exception_variant (new_type,
2552 TYPE_RAISES_EXCEPTIONS (type));
2554 /* Making a new main variant of a class type is broken. */
2555 gcc_assert (!CLASS_TYPE_P (type) || new_type == type);
2560 /* Return TRUE if TYPE1 and TYPE2 are identical for type hashing purposes.
2561 Called only after doing all language independent checks. Only
2562 to check TYPE_RAISES_EXCEPTIONS for FUNCTION_TYPE, the rest is already
2563 compared in type_hash_eq. */
2566 cxx_type_hash_eq (const_tree typea, const_tree typeb)
2568 gcc_assert (TREE_CODE (typea) == FUNCTION_TYPE);
2570 return comp_except_specs (TYPE_RAISES_EXCEPTIONS (typea),
2571 TYPE_RAISES_EXCEPTIONS (typeb), 1);
2574 /* Apply FUNC to all language-specific sub-trees of TP in a pre-order
2575 traversal. Called from walk_tree. */
2578 cp_walk_subtrees (tree *tp, int *walk_subtrees_p, walk_tree_fn func,
2579 void *data, struct pointer_set_t *pset)
2581 enum tree_code code = TREE_CODE (*tp);
2584 #define WALK_SUBTREE(NODE) \
2587 result = cp_walk_tree (&(NODE), func, data, pset); \
2588 if (result) goto out; \
2592 /* Not one of the easy cases. We must explicitly go through the
2598 case TEMPLATE_TEMPLATE_PARM:
2599 case BOUND_TEMPLATE_TEMPLATE_PARM:
2600 case UNBOUND_CLASS_TEMPLATE:
2601 case TEMPLATE_PARM_INDEX:
2602 case TEMPLATE_TYPE_PARM:
2605 /* None of these have subtrees other than those already walked
2607 *walk_subtrees_p = 0;
2611 WALK_SUBTREE (BASELINK_FUNCTIONS (*tp));
2612 *walk_subtrees_p = 0;
2616 WALK_SUBTREE (TREE_TYPE (*tp));
2617 *walk_subtrees_p = 0;
2621 WALK_SUBTREE (TREE_PURPOSE (*tp));
2625 WALK_SUBTREE (OVL_FUNCTION (*tp));
2626 WALK_SUBTREE (OVL_CHAIN (*tp));
2627 *walk_subtrees_p = 0;
2631 WALK_SUBTREE (DECL_NAME (*tp));
2632 WALK_SUBTREE (USING_DECL_SCOPE (*tp));
2633 WALK_SUBTREE (USING_DECL_DECLS (*tp));
2634 *walk_subtrees_p = 0;
2638 if (TYPE_PTRMEMFUNC_P (*tp))
2639 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (*tp));
2642 case TYPE_ARGUMENT_PACK:
2643 case NONTYPE_ARGUMENT_PACK:
2645 tree args = ARGUMENT_PACK_ARGS (*tp);
2646 int i, len = TREE_VEC_LENGTH (args);
2647 for (i = 0; i < len; i++)
2648 WALK_SUBTREE (TREE_VEC_ELT (args, i));
2652 case TYPE_PACK_EXPANSION:
2653 WALK_SUBTREE (TREE_TYPE (*tp));
2654 *walk_subtrees_p = 0;
2657 case EXPR_PACK_EXPANSION:
2658 WALK_SUBTREE (TREE_OPERAND (*tp, 0));
2659 *walk_subtrees_p = 0;
2663 case REINTERPRET_CAST_EXPR:
2664 case STATIC_CAST_EXPR:
2665 case CONST_CAST_EXPR:
2666 case DYNAMIC_CAST_EXPR:
2667 if (TREE_TYPE (*tp))
2668 WALK_SUBTREE (TREE_TYPE (*tp));
2672 for (i = 0; i < TREE_CODE_LENGTH (TREE_CODE (*tp)); ++i)
2673 WALK_SUBTREE (TREE_OPERAND (*tp, i));
2675 *walk_subtrees_p = 0;
2679 WALK_SUBTREE (TRAIT_EXPR_TYPE1 (*tp));
2680 WALK_SUBTREE (TRAIT_EXPR_TYPE2 (*tp));
2681 *walk_subtrees_p = 0;
2685 WALK_SUBTREE (DECLTYPE_TYPE_EXPR (*tp));
2686 *walk_subtrees_p = 0;
2694 /* We didn't find what we were looking for. */
2701 /* Like save_expr, but for C++. */
2704 cp_save_expr (tree expr)
2706 /* There is no reason to create a SAVE_EXPR within a template; if
2707 needed, we can create the SAVE_EXPR when instantiating the
2708 template. Furthermore, the middle-end cannot handle C++-specific
2710 if (processing_template_decl)
2712 return save_expr (expr);
2715 /* Initialize tree.c. */
2720 list_hash_table = htab_create_ggc (31, list_hash, list_hash_eq, NULL);
2723 /* Returns the kind of special function that DECL (a FUNCTION_DECL)
2724 is. Note that sfk_none is zero, so this function can be used as a
2725 predicate to test whether or not DECL is a special function. */
2727 special_function_kind
2728 special_function_p (const_tree decl)
2730 /* Rather than doing all this stuff with magic names, we should
2731 probably have a field of type `special_function_kind' in
2732 DECL_LANG_SPECIFIC. */
2733 if (DECL_COPY_CONSTRUCTOR_P (decl))
2734 return sfk_copy_constructor;
2735 if (DECL_CONSTRUCTOR_P (decl))
2736 return sfk_constructor;
2737 if (DECL_OVERLOADED_OPERATOR_P (decl) == NOP_EXPR)
2738 return sfk_assignment_operator;
2739 if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl))
2740 return sfk_destructor;
2741 if (DECL_COMPLETE_DESTRUCTOR_P (decl))
2742 return sfk_complete_destructor;
2743 if (DECL_BASE_DESTRUCTOR_P (decl))
2744 return sfk_base_destructor;
2745 if (DECL_DELETING_DESTRUCTOR_P (decl))
2746 return sfk_deleting_destructor;
2747 if (DECL_CONV_FN_P (decl))
2748 return sfk_conversion;
2753 /* Returns nonzero if TYPE is a character type, including wchar_t. */
2756 char_type_p (tree type)
2758 return (same_type_p (type, char_type_node)
2759 || same_type_p (type, unsigned_char_type_node)
2760 || same_type_p (type, signed_char_type_node)
2761 || same_type_p (type, char16_type_node)
2762 || same_type_p (type, char32_type_node)
2763 || same_type_p (type, wchar_type_node));
2766 /* Returns the kind of linkage associated with the indicated DECL. Th
2767 value returned is as specified by the language standard; it is
2768 independent of implementation details regarding template
2769 instantiation, etc. For example, it is possible that a declaration
2770 to which this function assigns external linkage would not show up
2771 as a global symbol when you run `nm' on the resulting object file. */
2774 decl_linkage (tree decl)
2776 /* This function doesn't attempt to calculate the linkage from first
2777 principles as given in [basic.link]. Instead, it makes use of
2778 the fact that we have already set TREE_PUBLIC appropriately, and
2779 then handles a few special cases. Ideally, we would calculate
2780 linkage first, and then transform that into a concrete
2783 /* Things that don't have names have no linkage. */
2784 if (!DECL_NAME (decl))
2787 /* Fields have no linkage. */
2788 if (TREE_CODE (decl) == FIELD_DECL)
2791 /* Things that are TREE_PUBLIC have external linkage. */
2792 if (TREE_PUBLIC (decl))
2795 if (TREE_CODE (decl) == NAMESPACE_DECL)
2798 /* Linkage of a CONST_DECL depends on the linkage of the enumeration
2800 if (TREE_CODE (decl) == CONST_DECL)
2801 return decl_linkage (TYPE_NAME (TREE_TYPE (decl)));
2803 /* Some things that are not TREE_PUBLIC have external linkage, too.
2804 For example, on targets that don't have weak symbols, we make all
2805 template instantiations have internal linkage (in the object
2806 file), but the symbols should still be treated as having external
2807 linkage from the point of view of the language. */
2808 if ((TREE_CODE (decl) == FUNCTION_DECL
2809 || TREE_CODE (decl) == VAR_DECL)
2810 && DECL_COMDAT (decl))
2813 /* Things in local scope do not have linkage, if they don't have
2815 if (decl_function_context (decl))
2818 /* Members of the anonymous namespace also have TREE_PUBLIC unset, but
2819 are considered to have external linkage for language purposes. DECLs
2820 really meant to have internal linkage have DECL_THIS_STATIC set. */
2821 if (TREE_CODE (decl) == TYPE_DECL)
2823 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == FUNCTION_DECL)
2825 if (!DECL_THIS_STATIC (decl))
2828 /* Static data members and static member functions from classes
2829 in anonymous namespace also don't have TREE_PUBLIC set. */
2830 if (DECL_CLASS_CONTEXT (decl))
2834 /* Everything else has internal linkage. */
2838 /* EXP is an expression that we want to pre-evaluate. Returns (in
2839 *INITP) an expression that will perform the pre-evaluation. The
2840 value returned by this function is a side-effect free expression
2841 equivalent to the pre-evaluated expression. Callers must ensure
2842 that *INITP is evaluated before EXP. */
2845 stabilize_expr (tree exp, tree* initp)
2849 if (!TREE_SIDE_EFFECTS (exp))
2850 init_expr = NULL_TREE;
2851 else if (!real_lvalue_p (exp)
2852 || !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (exp)))
2854 init_expr = get_target_expr (exp);
2855 exp = TARGET_EXPR_SLOT (init_expr);
2859 exp = cp_build_unary_op (ADDR_EXPR, exp, 1, tf_warning_or_error);
2860 init_expr = get_target_expr (exp);
2861 exp = TARGET_EXPR_SLOT (init_expr);
2862 exp = cp_build_indirect_ref (exp, 0, tf_warning_or_error);
2866 gcc_assert (!TREE_SIDE_EFFECTS (exp));
2870 /* Add NEW_EXPR, an expression whose value we don't care about, after the
2871 similar expression ORIG. */
2874 add_stmt_to_compound (tree orig, tree new_expr)
2876 if (!new_expr || !TREE_SIDE_EFFECTS (new_expr))
2878 if (!orig || !TREE_SIDE_EFFECTS (orig))
2880 return build2 (COMPOUND_EXPR, void_type_node, orig, new_expr);
2883 /* Like stabilize_expr, but for a call whose arguments we want to
2884 pre-evaluate. CALL is modified in place to use the pre-evaluated
2885 arguments, while, upon return, *INITP contains an expression to
2886 compute the arguments. */
2889 stabilize_call (tree call, tree *initp)
2891 tree inits = NULL_TREE;
2893 int nargs = call_expr_nargs (call);
2895 if (call == error_mark_node || processing_template_decl)
2901 gcc_assert (TREE_CODE (call) == CALL_EXPR);
2903 for (i = 0; i < nargs; i++)
2906 CALL_EXPR_ARG (call, i) =
2907 stabilize_expr (CALL_EXPR_ARG (call, i), &init);
2908 inits = add_stmt_to_compound (inits, init);
2914 /* Like stabilize_expr, but for an AGGR_INIT_EXPR whose arguments we want
2915 to pre-evaluate. CALL is modified in place to use the pre-evaluated
2916 arguments, while, upon return, *INITP contains an expression to
2917 compute the arguments. */
2920 stabilize_aggr_init (tree call, tree *initp)
2922 tree inits = NULL_TREE;
2924 int nargs = aggr_init_expr_nargs (call);
2926 if (call == error_mark_node)
2929 gcc_assert (TREE_CODE (call) == AGGR_INIT_EXPR);
2931 for (i = 0; i < nargs; i++)
2934 AGGR_INIT_EXPR_ARG (call, i) =
2935 stabilize_expr (AGGR_INIT_EXPR_ARG (call, i), &init);
2936 inits = add_stmt_to_compound (inits, init);
2942 /* Like stabilize_expr, but for an initialization.
2944 If the initialization is for an object of class type, this function
2945 takes care not to introduce additional temporaries.
2947 Returns TRUE iff the expression was successfully pre-evaluated,
2948 i.e., if INIT is now side-effect free, except for, possible, a
2949 single call to a constructor. */
2952 stabilize_init (tree init, tree *initp)
2958 if (t == error_mark_node || processing_template_decl)
2961 if (TREE_CODE (t) == INIT_EXPR
2962 && TREE_CODE (TREE_OPERAND (t, 1)) != TARGET_EXPR
2963 && TREE_CODE (TREE_OPERAND (t, 1)) != AGGR_INIT_EXPR)
2965 TREE_OPERAND (t, 1) = stabilize_expr (TREE_OPERAND (t, 1), initp);
2969 if (TREE_CODE (t) == INIT_EXPR)
2970 t = TREE_OPERAND (t, 1);
2971 if (TREE_CODE (t) == TARGET_EXPR)
2972 t = TARGET_EXPR_INITIAL (t);
2973 if (TREE_CODE (t) == COMPOUND_EXPR)
2975 if (TREE_CODE (t) == CONSTRUCTOR
2976 && EMPTY_CONSTRUCTOR_P (t))
2977 /* Default-initialization. */
2980 /* If the initializer is a COND_EXPR, we can't preevaluate
2982 if (TREE_CODE (t) == COND_EXPR)
2985 if (TREE_CODE (t) == CALL_EXPR)
2987 stabilize_call (t, initp);
2991 if (TREE_CODE (t) == AGGR_INIT_EXPR)
2993 stabilize_aggr_init (t, initp);
2997 /* The initialization is being performed via a bitwise copy -- and
2998 the item copied may have side effects. */
2999 return TREE_SIDE_EFFECTS (init);
3002 /* Like "fold", but should be used whenever we might be processing the
3003 body of a template. */
3006 fold_if_not_in_template (tree expr)
3008 /* In the body of a template, there is never any need to call
3009 "fold". We will call fold later when actually instantiating the
3010 template. Integral constant expressions in templates will be
3011 evaluated via fold_non_dependent_expr, as necessary. */
3012 if (processing_template_decl)
3015 /* Fold C++ front-end specific tree codes. */
3016 if (TREE_CODE (expr) == UNARY_PLUS_EXPR)
3017 return fold_convert (TREE_TYPE (expr), TREE_OPERAND (expr, 0));
3022 /* Returns true if a cast to TYPE may appear in an integral constant
3026 cast_valid_in_integral_constant_expression_p (tree type)
3028 return (INTEGRAL_OR_ENUMERATION_TYPE_P (type)
3029 || dependent_type_p (type)
3030 || type == error_mark_node);
3034 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3035 /* Complain that some language-specific thing hanging off a tree
3036 node has been accessed improperly. */
3039 lang_check_failed (const char* file, int line, const char* function)
3041 internal_error ("lang_* check: failed in %s, at %s:%d",
3042 function, trim_filename (file), line);
3044 #endif /* ENABLE_TREE_CHECKING */
3046 #include "gt-cp-tree.h"