1 /* Language-dependent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003 Free Software Foundation, Inc.
4 Hacked by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
25 #include "coretypes.h"
33 #include "insn-config.h"
34 #include "integrate.h"
35 #include "tree-inline.h"
38 static tree
bot_manip (tree
*, int *, void *);
39 static tree
bot_replace (tree
*, int *, void *);
40 static tree
build_cplus_array_type_1 (tree
, tree
);
41 static int list_hash_eq (const void *, const void *);
42 static hashval_t
list_hash_pieces (tree
, tree
, tree
);
43 static hashval_t
list_hash (const void *);
44 static cp_lvalue_kind
lvalue_p_1 (tree
, int);
45 static tree
build_target_expr (tree
, tree
);
46 static tree
count_trees_r (tree
*, int *, void *);
47 static tree
verify_stmt_tree_r (tree
*, int *, void *);
48 static tree
find_tree_r (tree
*, int *, void *);
49 static tree
build_local_temp (tree
);
51 static tree
handle_java_interface_attribute (tree
*, tree
, tree
, int, bool *);
52 static tree
handle_com_interface_attribute (tree
*, tree
, tree
, int, bool *);
53 static tree
handle_init_priority_attribute (tree
*, tree
, tree
, int, bool *);
55 /* If REF is an lvalue, returns the kind of lvalue that REF is.
56 Otherwise, returns clk_none. If TREAT_CLASS_RVALUES_AS_LVALUES is
57 nonzero, rvalues of class type are considered lvalues. */
61 int treat_class_rvalues_as_lvalues
)
63 cp_lvalue_kind op1_lvalue_kind
= clk_none
;
64 cp_lvalue_kind op2_lvalue_kind
= clk_none
;
66 if (TREE_CODE (TREE_TYPE (ref
)) == REFERENCE_TYPE
)
69 if (ref
== current_class_ptr
)
72 switch (TREE_CODE (ref
))
74 /* preincrements and predecrements are valid lvals, provided
75 what they refer to are valid lvals. */
76 case PREINCREMENT_EXPR
:
77 case PREDECREMENT_EXPR
:
80 case WITH_CLEANUP_EXPR
:
83 return lvalue_p_1 (TREE_OPERAND (ref
, 0),
84 treat_class_rvalues_as_lvalues
);
87 op1_lvalue_kind
= lvalue_p_1 (TREE_OPERAND (ref
, 0),
88 treat_class_rvalues_as_lvalues
);
89 /* In an expression of the form "X.Y", the packed-ness of the
90 expression does not depend on "X". */
91 op1_lvalue_kind
&= ~clk_packed
;
92 /* Look at the member designator. */
94 /* The "field" can be a FUNCTION_DECL or an OVERLOAD in some
96 || TREE_CODE (TREE_OPERAND (ref
, 1)) != FIELD_DECL
)
98 else if (DECL_C_BIT_FIELD (TREE_OPERAND (ref
, 1)))
100 /* Clear the ordinary bit. If this object was a class
101 rvalue we want to preserve that information. */
102 op1_lvalue_kind
&= ~clk_ordinary
;
103 /* The lvalue is for a bitfield. */
104 op1_lvalue_kind
|= clk_bitfield
;
106 else if (DECL_PACKED (TREE_OPERAND (ref
, 1)))
107 op1_lvalue_kind
|= clk_packed
;
109 return op1_lvalue_kind
;
115 if (TREE_READONLY (ref
) && ! TREE_STATIC (ref
)
116 && DECL_LANG_SPECIFIC (ref
)
117 && DECL_IN_AGGR_P (ref
))
123 if (TREE_CODE (TREE_TYPE (ref
)) != METHOD_TYPE
)
127 /* A currently unresolved scope ref. */
132 op1_lvalue_kind
= lvalue_p_1 (TREE_OPERAND (ref
, 0),
133 treat_class_rvalues_as_lvalues
);
134 op2_lvalue_kind
= lvalue_p_1 (TREE_OPERAND (ref
, 1),
135 treat_class_rvalues_as_lvalues
);
139 op1_lvalue_kind
= lvalue_p_1 (TREE_OPERAND (ref
, 1),
140 treat_class_rvalues_as_lvalues
);
141 op2_lvalue_kind
= lvalue_p_1 (TREE_OPERAND (ref
, 2),
142 treat_class_rvalues_as_lvalues
);
149 return lvalue_p_1 (TREE_OPERAND (ref
, 1),
150 treat_class_rvalues_as_lvalues
);
153 return treat_class_rvalues_as_lvalues
? clk_class
: clk_none
;
157 /* Any class-valued call would be wrapped in a TARGET_EXPR. */
161 /* All functions (except non-static-member functions) are
163 return (DECL_NONSTATIC_MEMBER_FUNCTION_P (ref
)
164 ? clk_none
: clk_ordinary
);
166 case NON_DEPENDENT_EXPR
:
167 /* We must consider NON_DEPENDENT_EXPRs to be lvalues so that
168 things like "&E" where "E" is an expression with a
169 non-dependent type work. It is safe to be lenient because an
170 error will be issued when the template is instantiated if "E"
178 /* If one operand is not an lvalue at all, then this expression is
180 if (!op1_lvalue_kind
|| !op2_lvalue_kind
)
183 /* Otherwise, it's an lvalue, and it has all the odd properties
184 contributed by either operand. */
185 op1_lvalue_kind
= op1_lvalue_kind
| op2_lvalue_kind
;
186 /* It's not an ordinary lvalue if it involves either a bit-field or
188 if ((op1_lvalue_kind
& ~clk_ordinary
) != clk_none
)
189 op1_lvalue_kind
&= ~clk_ordinary
;
190 return op1_lvalue_kind
;
193 /* Returns the kind of lvalue that REF is, in the sense of
194 [basic.lval]. This function should really be named lvalue_p; it
195 computes the C++ definition of lvalue. */
198 real_lvalue_p (tree ref
)
200 return lvalue_p_1 (ref
,
201 /*treat_class_rvalues_as_lvalues=*/0);
204 /* This differs from real_lvalue_p in that class rvalues are
205 considered lvalues. */
211 (lvalue_p_1 (ref
, /*class rvalue ok*/ 1) != clk_none
);
214 /* Return nonzero if REF is an lvalue valid for this language;
215 otherwise, print an error message and return zero. */
218 lvalue_or_else (tree ref
, const char* string
)
222 error ("non-lvalue in %s", string
);
228 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
231 build_target_expr (tree decl
, tree value
)
235 t
= build4 (TARGET_EXPR
, TREE_TYPE (decl
), decl
, value
,
236 cxx_maybe_build_cleanup (decl
), NULL_TREE
);
237 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
238 ignore the TARGET_EXPR. If there really turn out to be no
239 side-effects, then the optimizer should be able to get rid of
240 whatever code is generated anyhow. */
241 TREE_SIDE_EFFECTS (t
) = 1;
246 /* Return an undeclared local temporary of type TYPE for use in building a
250 build_local_temp (tree type
)
252 tree slot
= build_decl (VAR_DECL
, NULL_TREE
, type
);
253 DECL_ARTIFICIAL (slot
) = 1;
254 DECL_CONTEXT (slot
) = current_function_decl
;
255 layout_decl (slot
, 0);
259 /* INIT is a CALL_EXPR which needs info about its target.
260 TYPE is the type that this initialization should appear to have.
262 Build an encapsulation of the initialization to perform
263 and return it so that it can be processed by language-independent
264 and language-specific expression expanders. */
267 build_cplus_new (tree type
, tree init
)
274 /* Make sure that we're not trying to create an instance of an
276 abstract_virtuals_error (NULL_TREE
, type
);
278 if (TREE_CODE (init
) != CALL_EXPR
&& TREE_CODE (init
) != AGGR_INIT_EXPR
)
279 return convert (type
, init
);
281 fn
= TREE_OPERAND (init
, 0);
282 is_ctor
= (TREE_CODE (fn
) == ADDR_EXPR
283 && TREE_CODE (TREE_OPERAND (fn
, 0)) == FUNCTION_DECL
284 && DECL_CONSTRUCTOR_P (TREE_OPERAND (fn
, 0)));
286 slot
= build_local_temp (type
);
288 /* We split the CALL_EXPR into its function and its arguments here.
289 Then, in expand_expr, we put them back together. The reason for
290 this is that this expression might be a default argument
291 expression. In that case, we need a new temporary every time the
292 expression is used. That's what break_out_target_exprs does; it
293 replaces every AGGR_INIT_EXPR with a copy that uses a fresh
294 temporary slot. Then, expand_expr builds up a call-expression
295 using the new slot. */
297 /* If we don't need to use a constructor to create an object of this
298 type, don't mess with AGGR_INIT_EXPR. */
299 if (is_ctor
|| TREE_ADDRESSABLE (type
))
301 rval
= build3 (AGGR_INIT_EXPR
, void_type_node
, fn
,
302 TREE_OPERAND (init
, 1), slot
);
303 TREE_SIDE_EFFECTS (rval
) = 1;
304 AGGR_INIT_VIA_CTOR_P (rval
) = is_ctor
;
309 rval
= build_target_expr (slot
, rval
);
314 /* Build a TARGET_EXPR using INIT to initialize a new temporary of the
318 build_target_expr_with_type (tree init
, tree type
)
322 gcc_assert (!VOID_TYPE_P (type
));
324 if (TREE_CODE (init
) == TARGET_EXPR
)
326 else if (CLASS_TYPE_P (type
) && !TYPE_HAS_TRIVIAL_INIT_REF (type
)
327 && TREE_CODE (init
) != COND_EXPR
328 && TREE_CODE (init
) != CONSTRUCTOR
329 && TREE_CODE (init
) != VA_ARG_EXPR
)
330 /* We need to build up a copy constructor call. COND_EXPR is a special
331 case because we already have copies on the arms and we don't want
332 another one here. A CONSTRUCTOR is aggregate initialization, which
333 is handled separately. A VA_ARG_EXPR is magic creation of an
334 aggregate; there's no additional work to be done. */
335 return force_rvalue (init
);
337 slot
= build_local_temp (type
);
338 return build_target_expr (slot
, init
);
341 /* Like the above function, but without the checking. This function should
342 only be used by code which is deliberately trying to subvert the type
343 system, such as call_builtin_trap. */
346 force_target_expr (tree type
, tree init
)
350 gcc_assert (!VOID_TYPE_P (type
));
352 slot
= build_local_temp (type
);
353 return build_target_expr (slot
, init
);
356 /* Like build_target_expr_with_type, but use the type of INIT. */
359 get_target_expr (tree init
)
361 return build_target_expr_with_type (init
, TREE_TYPE (init
));
366 build_cplus_array_type_1 (tree elt_type
, tree index_type
)
370 if (elt_type
== error_mark_node
|| index_type
== error_mark_node
)
371 return error_mark_node
;
373 if (dependent_type_p (elt_type
)
375 && value_dependent_expression_p (TYPE_MAX_VALUE (index_type
))))
377 t
= make_node (ARRAY_TYPE
);
378 TREE_TYPE (t
) = elt_type
;
379 TYPE_DOMAIN (t
) = index_type
;
382 t
= build_array_type (elt_type
, index_type
);
384 /* Push these needs up so that initialization takes place
386 TYPE_NEEDS_CONSTRUCTING (t
)
387 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (elt_type
));
388 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
389 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (elt_type
));
394 build_cplus_array_type (tree elt_type
, tree index_type
)
397 int type_quals
= cp_type_quals (elt_type
);
399 if (type_quals
!= TYPE_UNQUALIFIED
)
400 elt_type
= cp_build_qualified_type (elt_type
, TYPE_UNQUALIFIED
);
402 t
= build_cplus_array_type_1 (elt_type
, index_type
);
404 if (type_quals
!= TYPE_UNQUALIFIED
)
405 t
= cp_build_qualified_type (t
, type_quals
);
410 /* Make a variant of TYPE, qualified with the TYPE_QUALS. Handles
411 arrays correctly. In particular, if TYPE is an array of T's, and
412 TYPE_QUALS is non-empty, returns an array of qualified T's.
414 FLAGS determines how to deal with illformed qualifications. If
415 tf_ignore_bad_quals is set, then bad qualifications are dropped
416 (this is permitted if TYPE was introduced via a typedef or template
417 type parameter). If bad qualifications are dropped and tf_warning
418 is set, then a warning is issued for non-const qualifications. If
419 tf_ignore_bad_quals is not set and tf_error is not set, we
420 return error_mark_node. Otherwise, we issue an error, and ignore
423 Qualification of a reference type is valid when the reference came
424 via a typedef or template type argument. [dcl.ref] No such
425 dispensation is provided for qualifying a function type. [dcl.fct]
426 DR 295 queries this and the proposed resolution brings it into line
427 with qualifying a reference. We implement the DR. We also behave
428 in a similar manner for restricting non-pointer types. */
431 cp_build_qualified_type_real (tree type
,
433 tsubst_flags_t complain
)
436 int bad_quals
= TYPE_UNQUALIFIED
;
438 if (type
== error_mark_node
)
441 if (type_quals
== cp_type_quals (type
))
444 if (TREE_CODE (type
) == ARRAY_TYPE
)
446 /* In C++, the qualification really applies to the array element
447 type. Obtain the appropriately qualified element type. */
450 = cp_build_qualified_type_real (TREE_TYPE (type
),
454 if (element_type
== error_mark_node
)
455 return error_mark_node
;
457 /* See if we already have an identically qualified type. */
458 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
459 if (cp_type_quals (t
) == type_quals
460 && TYPE_NAME (t
) == TYPE_NAME (type
)
461 && TYPE_CONTEXT (t
) == TYPE_CONTEXT (type
))
466 /* Make a new array type, just like the old one, but with the
467 appropriately qualified element type. */
468 t
= build_variant_type_copy (type
);
469 TREE_TYPE (t
) = element_type
;
472 /* Even if we already had this variant, we update
473 TYPE_NEEDS_CONSTRUCTING and TYPE_HAS_NONTRIVIAL_DESTRUCTOR in case
474 they changed since the variant was originally created.
476 This seems hokey; if there is some way to use a previous
477 variant *without* coming through here,
478 TYPE_NEEDS_CONSTRUCTING will never be updated. */
479 TYPE_NEEDS_CONSTRUCTING (t
)
480 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (element_type
));
481 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
482 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (element_type
));
485 else if (TYPE_PTRMEMFUNC_P (type
))
487 /* For a pointer-to-member type, we can't just return a
488 cv-qualified version of the RECORD_TYPE. If we do, we
489 haven't changed the field that contains the actual pointer to
490 a method, and so TYPE_PTRMEMFUNC_FN_TYPE will be wrong. */
493 t
= TYPE_PTRMEMFUNC_FN_TYPE (type
);
494 t
= cp_build_qualified_type_real (t
, type_quals
, complain
);
495 return build_ptrmemfunc_type (t
);
498 /* A reference, function or method type shall not be cv qualified.
499 [dcl.ref], [dct.fct] */
500 if (type_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)
501 && (TREE_CODE (type
) == REFERENCE_TYPE
502 || TREE_CODE (type
) == FUNCTION_TYPE
503 || TREE_CODE (type
) == METHOD_TYPE
))
505 bad_quals
|= type_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
506 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
509 /* A restrict-qualified type must be a pointer (or reference)
510 to object or incomplete type. */
511 if ((type_quals
& TYPE_QUAL_RESTRICT
)
512 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
513 && TREE_CODE (type
) != TYPENAME_TYPE
514 && !POINTER_TYPE_P (type
))
516 bad_quals
|= TYPE_QUAL_RESTRICT
;
517 type_quals
&= ~TYPE_QUAL_RESTRICT
;
520 if (bad_quals
== TYPE_UNQUALIFIED
)
522 else if (!(complain
& (tf_error
| tf_ignore_bad_quals
)))
523 return error_mark_node
;
526 if (complain
& tf_ignore_bad_quals
)
527 /* We're not going to warn about constifying things that can't
529 bad_quals
&= ~TYPE_QUAL_CONST
;
532 tree bad_type
= build_qualified_type (ptr_type_node
, bad_quals
);
534 if (!(complain
& tf_ignore_bad_quals
))
535 error ("`%V' qualifiers cannot be applied to `%T'",
540 /* Retrieve (or create) the appropriately qualified variant. */
541 result
= build_qualified_type (type
, type_quals
);
543 /* If this was a pointer-to-method type, and we just made a copy,
544 then we need to unshare the record that holds the cached
545 pointer-to-member-function type, because these will be distinct
546 between the unqualified and qualified types. */
548 && TREE_CODE (type
) == POINTER_TYPE
549 && TREE_CODE (TREE_TYPE (type
)) == METHOD_TYPE
)
550 TYPE_LANG_SPECIFIC (result
) = NULL
;
555 /* Returns the canonical version of TYPE. In other words, if TYPE is
556 a typedef, returns the underlying type. The cv-qualification of
557 the type returned matches the type input; they will always be
561 canonical_type_variant (tree t
)
563 return cp_build_qualified_type (TYPE_MAIN_VARIANT (t
), cp_type_quals (t
));
566 /* Makes a copy of BINFO and TYPE, which is to be inherited into a
567 graph dominated by T. If BINFO is NULL, TYPE is a dependent base,
568 and we do a shallow copy. If BINFO is non-NULL, we do a deep copy.
569 VIRT indicates whether TYPE is inherited virtually or not.
570 IGO_PREV points at the previous binfo of the inheritance graph
571 order chain. The newly copied binfo's TREE_CHAIN forms this
574 The CLASSTYPE_VBASECLASSES vector of T is constructed in the
575 correct order. That is in the order the bases themselves should be
578 The BINFO_INHERITANCE of a virtual base class points to the binfo
579 of the most derived type. ??? We could probably change this so that
580 BINFO_INHERITANCE becomes synonymous with BINFO_PRIMARY, and hence
581 remove a field. They currently can only differ for primary virtual
585 copy_binfo (tree binfo
, tree type
, tree t
, tree
*igo_prev
, int virt
)
591 /* See if we've already made this virtual base. */
592 new_binfo
= binfo_for_vbase (type
, t
);
597 new_binfo
= make_tree_binfo (binfo
? BINFO_N_BASE_BINFOS (binfo
) : 0);
598 BINFO_TYPE (new_binfo
) = type
;
600 /* Chain it into the inheritance graph. */
601 TREE_CHAIN (*igo_prev
) = new_binfo
;
602 *igo_prev
= new_binfo
;
609 gcc_assert (!BINFO_DEPENDENT_BASE_P (binfo
));
610 gcc_assert (type
== BINFO_TYPE (binfo
));
612 BINFO_OFFSET (new_binfo
) = BINFO_OFFSET (binfo
);
613 BINFO_VIRTUALS (new_binfo
) = BINFO_VIRTUALS (binfo
);
615 /* We do not need to copy the accesses, as they are read only. */
616 BINFO_BASE_ACCESSES (new_binfo
) = BINFO_BASE_ACCESSES (binfo
);
618 /* Recursively copy base binfos of BINFO. */
619 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ix
++)
623 gcc_assert (!BINFO_DEPENDENT_BASE_P (base_binfo
));
624 new_base_binfo
= copy_binfo (base_binfo
, BINFO_TYPE (base_binfo
),
626 BINFO_VIRTUAL_P (base_binfo
));
628 if (!BINFO_INHERITANCE_CHAIN (new_base_binfo
))
629 BINFO_INHERITANCE_CHAIN (new_base_binfo
) = new_binfo
;
630 BINFO_BASE_APPEND (new_binfo
, new_base_binfo
);
634 BINFO_DEPENDENT_BASE_P (new_binfo
) = 1;
638 /* Push it onto the list after any virtual bases it contains
639 will have been pushed. */
640 VEC_quick_push (tree
, CLASSTYPE_VBASECLASSES (t
), new_binfo
);
641 BINFO_VIRTUAL_P (new_binfo
) = 1;
642 BINFO_INHERITANCE_CHAIN (new_binfo
) = TYPE_BINFO (t
);
648 /* Hashing of lists so that we don't make duplicates.
649 The entry point is `list_hash_canon'. */
651 /* Now here is the hash table. When recording a list, it is added
652 to the slot whose index is the hash code mod the table size.
653 Note that the hash table is used for several kinds of lists.
654 While all these live in the same table, they are completely independent,
655 and the hash code is computed differently for each of these. */
657 static GTY ((param_is (union tree_node
))) htab_t list_hash_table
;
666 /* Compare ENTRY (an entry in the hash table) with DATA (a list_proxy
667 for a node we are thinking about adding). */
670 list_hash_eq (const void* entry
, const void* data
)
672 tree t
= (tree
) entry
;
673 struct list_proxy
*proxy
= (struct list_proxy
*) data
;
675 return (TREE_VALUE (t
) == proxy
->value
676 && TREE_PURPOSE (t
) == proxy
->purpose
677 && TREE_CHAIN (t
) == proxy
->chain
);
680 /* Compute a hash code for a list (chain of TREE_LIST nodes
681 with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the
682 TREE_COMMON slots), by adding the hash codes of the individual entries. */
685 list_hash_pieces (tree purpose
, tree value
, tree chain
)
687 hashval_t hashcode
= 0;
690 hashcode
+= TREE_HASH (chain
);
693 hashcode
+= TREE_HASH (value
);
697 hashcode
+= TREE_HASH (purpose
);
703 /* Hash an already existing TREE_LIST. */
706 list_hash (const void* p
)
709 return list_hash_pieces (TREE_PURPOSE (t
),
714 /* Given list components PURPOSE, VALUE, AND CHAIN, return the canonical
715 object for an identical list if one already exists. Otherwise, build a
716 new one, and record it as the canonical object. */
719 hash_tree_cons (tree purpose
, tree value
, tree chain
)
723 struct list_proxy proxy
;
725 /* Hash the list node. */
726 hashcode
= list_hash_pieces (purpose
, value
, chain
);
727 /* Create a proxy for the TREE_LIST we would like to create. We
728 don't actually create it so as to avoid creating garbage. */
729 proxy
.purpose
= purpose
;
732 /* See if it is already in the table. */
733 slot
= htab_find_slot_with_hash (list_hash_table
, &proxy
, hashcode
,
735 /* If not, create a new node. */
737 *slot
= tree_cons (purpose
, value
, chain
);
741 /* Constructor for hashed lists. */
744 hash_tree_chain (tree value
, tree chain
)
746 return hash_tree_cons (NULL_TREE
, value
, chain
);
749 /* Similar, but used for concatenating two lists. */
752 hash_chainon (tree list1
, tree list2
)
758 if (TREE_CHAIN (list1
) == NULL_TREE
)
759 return hash_tree_chain (TREE_VALUE (list1
), list2
);
760 return hash_tree_chain (TREE_VALUE (list1
),
761 hash_chainon (TREE_CHAIN (list1
), list2
));
765 debug_binfo (tree elem
)
770 fprintf (stderr
, "type \"%s\", offset = " HOST_WIDE_INT_PRINT_DEC
772 TYPE_NAME_STRING (BINFO_TYPE (elem
)),
773 TREE_INT_CST_LOW (BINFO_OFFSET (elem
)));
774 debug_tree (BINFO_TYPE (elem
));
775 if (BINFO_VTABLE (elem
))
776 fprintf (stderr
, "vtable decl \"%s\"\n",
777 IDENTIFIER_POINTER (DECL_NAME (get_vtbl_decl_for_binfo (elem
))));
779 fprintf (stderr
, "no vtable decl yet\n");
780 fprintf (stderr
, "virtuals:\n");
781 virtuals
= BINFO_VIRTUALS (elem
);
786 tree fndecl
= TREE_VALUE (virtuals
);
787 fprintf (stderr
, "%s [%ld =? %ld]\n",
788 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl
)),
789 (long) n
, (long) TREE_INT_CST_LOW (DECL_VINDEX (fndecl
)));
791 virtuals
= TREE_CHAIN (virtuals
);
796 count_functions (tree t
)
799 if (TREE_CODE (t
) == FUNCTION_DECL
)
801 else if (TREE_CODE (t
) == OVERLOAD
)
803 for (i
= 0; t
; t
= OVL_CHAIN (t
))
813 is_overloaded_fn (tree x
)
815 /* A baselink is also considered an overloaded function. */
816 if (TREE_CODE (x
) == OFFSET_REF
)
817 x
= TREE_OPERAND (x
, 1);
819 x
= BASELINK_FUNCTIONS (x
);
820 return (TREE_CODE (x
) == FUNCTION_DECL
821 || TREE_CODE (x
) == TEMPLATE_ID_EXPR
822 || DECL_FUNCTION_TEMPLATE_P (x
)
823 || TREE_CODE (x
) == OVERLOAD
);
827 really_overloaded_fn (tree x
)
829 /* A baselink is also considered an overloaded function. */
830 if (TREE_CODE (x
) == OFFSET_REF
)
831 x
= TREE_OPERAND (x
, 1);
833 x
= BASELINK_FUNCTIONS (x
);
835 return ((TREE_CODE (x
) == OVERLOAD
&& OVL_CHAIN (x
))
836 || DECL_FUNCTION_TEMPLATE_P (OVL_CURRENT (x
))
837 || TREE_CODE (x
) == TEMPLATE_ID_EXPR
);
841 get_first_fn (tree from
)
843 gcc_assert (is_overloaded_fn (from
));
844 /* A baselink is also considered an overloaded function. */
845 if (BASELINK_P (from
))
846 from
= BASELINK_FUNCTIONS (from
);
847 return OVL_CURRENT (from
);
850 /* Returns nonzero if T is a ->* or .* expression that refers to a
856 return (TREE_CODE (t
) == OFFSET_REF
857 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (t
, 1))));
860 /* Return a new OVL node, concatenating it with the old one. */
863 ovl_cons (tree decl
, tree chain
)
865 tree result
= make_node (OVERLOAD
);
866 TREE_TYPE (result
) = unknown_type_node
;
867 OVL_FUNCTION (result
) = decl
;
868 TREE_CHAIN (result
) = chain
;
873 /* Build a new overloaded function. If this is the first one,
874 just return it; otherwise, ovl_cons the _DECLs */
877 build_overload (tree decl
, tree chain
)
879 if (! chain
&& TREE_CODE (decl
) != TEMPLATE_DECL
)
881 if (chain
&& TREE_CODE (chain
) != OVERLOAD
)
882 chain
= ovl_cons (chain
, NULL_TREE
);
883 return ovl_cons (decl
, chain
);
887 #define PRINT_RING_SIZE 4
890 cxx_printable_name (tree decl
, int v
)
892 static tree decl_ring
[PRINT_RING_SIZE
];
893 static char *print_ring
[PRINT_RING_SIZE
];
894 static int ring_counter
;
897 /* Only cache functions. */
899 || TREE_CODE (decl
) != FUNCTION_DECL
900 || DECL_LANG_SPECIFIC (decl
) == 0)
901 return lang_decl_name (decl
, v
);
903 /* See if this print name is lying around. */
904 for (i
= 0; i
< PRINT_RING_SIZE
; i
++)
905 if (decl_ring
[i
] == decl
)
906 /* yes, so return it. */
907 return print_ring
[i
];
909 if (++ring_counter
== PRINT_RING_SIZE
)
912 if (current_function_decl
!= NULL_TREE
)
914 if (decl_ring
[ring_counter
] == current_function_decl
)
916 if (ring_counter
== PRINT_RING_SIZE
)
918 if (decl_ring
[ring_counter
] == current_function_decl
)
922 if (print_ring
[ring_counter
])
923 free (print_ring
[ring_counter
]);
925 print_ring
[ring_counter
] = xstrdup (lang_decl_name (decl
, v
));
926 decl_ring
[ring_counter
] = decl
;
927 return print_ring
[ring_counter
];
930 /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions
934 build_exception_variant (tree type
, tree raises
)
936 tree v
= TYPE_MAIN_VARIANT (type
);
937 int type_quals
= TYPE_QUALS (type
);
939 for (; v
; v
= TYPE_NEXT_VARIANT (v
))
940 if (check_qualified_type (v
, type
, type_quals
)
941 && comp_except_specs (raises
, TYPE_RAISES_EXCEPTIONS (v
), 1))
944 /* Need to build a new variant. */
945 v
= build_variant_type_copy (type
);
946 TYPE_RAISES_EXCEPTIONS (v
) = raises
;
950 /* Given a TEMPLATE_TEMPLATE_PARM node T, create a new
951 BOUND_TEMPLATE_TEMPLATE_PARM bound with NEWARGS as its template
955 bind_template_template_parm (tree t
, tree newargs
)
957 tree decl
= TYPE_NAME (t
);
960 t2
= make_aggr_type (BOUND_TEMPLATE_TEMPLATE_PARM
);
961 decl
= build_decl (TYPE_DECL
, DECL_NAME (decl
), NULL_TREE
);
963 /* These nodes have to be created to reflect new TYPE_DECL and template
965 TEMPLATE_TYPE_PARM_INDEX (t2
) = copy_node (TEMPLATE_TYPE_PARM_INDEX (t
));
966 TEMPLATE_PARM_DECL (TEMPLATE_TYPE_PARM_INDEX (t2
)) = decl
;
967 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2
)
968 = tree_cons (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t
),
971 TREE_TYPE (decl
) = t2
;
972 TYPE_NAME (t2
) = decl
;
973 TYPE_STUB_DECL (t2
) = decl
;
979 /* Called from count_trees via walk_tree. */
982 count_trees_r (tree
*tp
, int *walk_subtrees
, void *data
)
992 /* Debugging function for measuring the rough complexity of a tree
999 walk_tree_without_duplicates (&t
, count_trees_r
, &n_trees
);
1003 /* Called from verify_stmt_tree via walk_tree. */
1006 verify_stmt_tree_r (tree
* tp
,
1007 int* walk_subtrees ATTRIBUTE_UNUSED
,
1011 htab_t
*statements
= (htab_t
*) data
;
1014 if (!STATEMENT_CODE_P (TREE_CODE (t
)))
1017 /* If this statement is already present in the hash table, then
1018 there is a circularity in the statement tree. */
1019 if (htab_find (*statements
, t
))
1022 slot
= htab_find_slot (*statements
, t
, INSERT
);
1028 /* Debugging function to check that the statement T has not been
1029 corrupted. For now, this function simply checks that T contains no
1033 verify_stmt_tree (tree t
)
1036 statements
= htab_create (37, htab_hash_pointer
, htab_eq_pointer
, NULL
);
1037 walk_tree (&t
, verify_stmt_tree_r
, &statements
, NULL
);
1038 htab_delete (statements
);
1041 /* Called from find_tree via walk_tree. */
1044 find_tree_r (tree
* tp
,
1045 int* walk_subtrees ATTRIBUTE_UNUSED
,
1048 if (*tp
== (tree
) data
)
1054 /* Returns X if X appears in the tree structure rooted at T. */
1057 find_tree (tree t
, tree x
)
1059 return walk_tree_without_duplicates (&t
, find_tree_r
, x
);
1062 /* Check if the type T depends on a type with no linkage and if so, return
1063 it. If RELAXED_P then do not consider a class type declared within
1064 a TREE_PUBLIC function to have no linkage. */
1067 no_linkage_check (tree t
, bool relaxed_p
)
1071 /* There's no point in checking linkage on template functions; we
1072 can't know their complete types. */
1073 if (processing_template_decl
)
1076 switch (TREE_CODE (t
))
1081 if (TYPE_PTRMEMFUNC_P (t
))
1085 if (!CLASS_TYPE_P (t
))
1089 if (TYPE_ANONYMOUS_P (t
))
1091 fn
= decl_function_context (TYPE_MAIN_DECL (t
));
1092 if (fn
&& (!relaxed_p
|| !TREE_PUBLIC (fn
)))
1098 case REFERENCE_TYPE
:
1099 return no_linkage_check (TREE_TYPE (t
), relaxed_p
);
1103 r
= no_linkage_check (TYPE_PTRMEM_POINTED_TO_TYPE (t
),
1107 return no_linkage_check (TYPE_PTRMEM_CLASS_TYPE (t
), relaxed_p
);
1110 r
= no_linkage_check (TYPE_METHOD_BASETYPE (t
), relaxed_p
);
1117 for (parm
= TYPE_ARG_TYPES (t
);
1118 parm
&& parm
!= void_list_node
;
1119 parm
= TREE_CHAIN (parm
))
1121 r
= no_linkage_check (TREE_VALUE (parm
), relaxed_p
);
1125 return no_linkage_check (TREE_TYPE (t
), relaxed_p
);
1133 #ifdef GATHER_STATISTICS
1134 extern int depth_reached
;
1138 cxx_print_statistics (void)
1140 print_search_statistics ();
1141 print_class_statistics ();
1142 #ifdef GATHER_STATISTICS
1143 fprintf (stderr
, "maximum template instantiation depth reached: %d\n",
1148 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1149 (which is an ARRAY_TYPE). This counts only elements of the top
1153 array_type_nelts_top (tree type
)
1155 return fold (build2 (PLUS_EXPR
, sizetype
,
1156 array_type_nelts (type
),
1160 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1161 (which is an ARRAY_TYPE). This one is a recursive count of all
1162 ARRAY_TYPEs that are clumped together. */
1165 array_type_nelts_total (tree type
)
1167 tree sz
= array_type_nelts_top (type
);
1168 type
= TREE_TYPE (type
);
1169 while (TREE_CODE (type
) == ARRAY_TYPE
)
1171 tree n
= array_type_nelts_top (type
);
1172 sz
= fold (build2 (MULT_EXPR
, sizetype
, sz
, n
));
1173 type
= TREE_TYPE (type
);
1178 /* Called from break_out_target_exprs via mapcar. */
1181 bot_manip (tree
* tp
, int* walk_subtrees
, void* data
)
1183 splay_tree target_remap
= ((splay_tree
) data
);
1186 if (!TYPE_P (t
) && TREE_CONSTANT (t
))
1188 /* There can't be any TARGET_EXPRs or their slot variables below
1189 this point. We used to check !TREE_SIDE_EFFECTS, but then we
1190 failed to copy an ADDR_EXPR of the slot VAR_DECL. */
1194 if (TREE_CODE (t
) == TARGET_EXPR
)
1198 if (TREE_CODE (TREE_OPERAND (t
, 1)) == AGGR_INIT_EXPR
)
1200 mark_used (TREE_OPERAND (TREE_OPERAND (TREE_OPERAND (t
, 1), 0), 0));
1202 (TREE_TYPE (t
), break_out_target_exprs (TREE_OPERAND (t
, 1)));
1206 u
= build_target_expr_with_type
1207 (break_out_target_exprs (TREE_OPERAND (t
, 1)), TREE_TYPE (t
));
1210 /* Map the old variable to the new one. */
1211 splay_tree_insert (target_remap
,
1212 (splay_tree_key
) TREE_OPERAND (t
, 0),
1213 (splay_tree_value
) TREE_OPERAND (u
, 0));
1215 /* Replace the old expression with the new version. */
1217 /* We don't have to go below this point; the recursive call to
1218 break_out_target_exprs will have handled anything below this
1223 else if (TREE_CODE (t
) == CALL_EXPR
)
1224 mark_used (TREE_OPERAND (TREE_OPERAND (t
, 0), 0));
1226 /* Make a copy of this node. */
1227 return copy_tree_r (tp
, walk_subtrees
, NULL
);
1230 /* Replace all remapped VAR_DECLs in T with their new equivalents.
1231 DATA is really a splay-tree mapping old variables to new
1235 bot_replace (tree
* t
,
1236 int* walk_subtrees ATTRIBUTE_UNUSED
,
1239 splay_tree target_remap
= ((splay_tree
) data
);
1241 if (TREE_CODE (*t
) == VAR_DECL
)
1243 splay_tree_node n
= splay_tree_lookup (target_remap
,
1244 (splay_tree_key
) *t
);
1246 *t
= (tree
) n
->value
;
1252 /* When we parse a default argument expression, we may create
1253 temporary variables via TARGET_EXPRs. When we actually use the
1254 default-argument expression, we make a copy of the expression, but
1255 we must replace the temporaries with appropriate local versions. */
1258 break_out_target_exprs (tree t
)
1260 static int target_remap_count
;
1261 static splay_tree target_remap
;
1263 if (!target_remap_count
++)
1264 target_remap
= splay_tree_new (splay_tree_compare_pointers
,
1265 /*splay_tree_delete_key_fn=*/NULL
,
1266 /*splay_tree_delete_value_fn=*/NULL
);
1267 walk_tree (&t
, bot_manip
, target_remap
, NULL
);
1268 walk_tree (&t
, bot_replace
, target_remap
, NULL
);
1270 if (!--target_remap_count
)
1272 splay_tree_delete (target_remap
);
1273 target_remap
= NULL
;
1279 /* Similar to `build_nt', but for template definitions of dependent
1283 build_min_nt (enum tree_code code
, ...)
1292 t
= make_node (code
);
1293 length
= TREE_CODE_LENGTH (code
);
1295 for (i
= 0; i
< length
; i
++)
1297 tree x
= va_arg (p
, tree
);
1298 TREE_OPERAND (t
, i
) = x
;
1305 /* Similar to `build', but for template definitions. */
1308 build_min (enum tree_code code
, tree tt
, ...)
1317 t
= make_node (code
);
1318 length
= TREE_CODE_LENGTH (code
);
1321 for (i
= 0; i
< length
; i
++)
1323 tree x
= va_arg (p
, tree
);
1324 TREE_OPERAND (t
, i
) = x
;
1325 if (x
&& !TYPE_P (x
) && TREE_SIDE_EFFECTS (x
))
1326 TREE_SIDE_EFFECTS (t
) = 1;
1333 /* Similar to `build', but for template definitions of non-dependent
1334 expressions. NON_DEP is the non-dependent expression that has been
1338 build_min_non_dep (enum tree_code code
, tree non_dep
, ...)
1345 va_start (p
, non_dep
);
1347 t
= make_node (code
);
1348 length
= TREE_CODE_LENGTH (code
);
1349 TREE_TYPE (t
) = TREE_TYPE (non_dep
);
1350 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (non_dep
);
1352 for (i
= 0; i
< length
; i
++)
1354 tree x
= va_arg (p
, tree
);
1355 TREE_OPERAND (t
, i
) = x
;
1358 if (code
== COMPOUND_EXPR
&& TREE_CODE (non_dep
) != COMPOUND_EXPR
)
1359 /* This should not be considered a COMPOUND_EXPR, because it
1360 resolves to an overload. */
1361 COMPOUND_EXPR_OVERLOADED (t
) = 1;
1368 get_type_decl (tree t
)
1370 if (TREE_CODE (t
) == TYPE_DECL
)
1373 return TYPE_STUB_DECL (t
);
1374 if (t
== error_mark_node
)
1379 /* Stop compiler from complaining control reaches end of non-void function. */
1383 /* Returns the namespace that contains DECL, whether directly or
1387 decl_namespace_context (tree decl
)
1391 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
1393 else if (TYPE_P (decl
))
1394 decl
= CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl
));
1396 decl
= CP_DECL_CONTEXT (decl
);
1400 /* Return truthvalue of whether T1 is the same tree structure as T2.
1401 Return 1 if they are the same. Return 0 if they are different. */
1404 cp_tree_equal (tree t1
, tree t2
)
1406 enum tree_code code1
, code2
;
1413 for (code1
= TREE_CODE (t1
);
1414 code1
== NOP_EXPR
|| code1
== CONVERT_EXPR
1415 || code1
== NON_LVALUE_EXPR
;
1416 code1
= TREE_CODE (t1
))
1417 t1
= TREE_OPERAND (t1
, 0);
1418 for (code2
= TREE_CODE (t2
);
1419 code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
1420 || code1
== NON_LVALUE_EXPR
;
1421 code2
= TREE_CODE (t2
))
1422 t2
= TREE_OPERAND (t2
, 0);
1424 /* They might have become equal now. */
1434 return TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
1435 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
);
1438 return REAL_VALUES_EQUAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
1441 return TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
1442 && !memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
1443 TREE_STRING_LENGTH (t1
));
1446 /* We need to do this when determining whether or not two
1447 non-type pointer to member function template arguments
1449 if (!(same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
1450 /* The first operand is RTL. */
1451 && TREE_OPERAND (t1
, 0) == TREE_OPERAND (t2
, 0)))
1453 return cp_tree_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
1456 if (!cp_tree_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
)))
1458 if (!cp_tree_equal (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1460 return cp_tree_equal (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
1463 return cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
1466 if (!cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0)))
1468 return cp_tree_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
1472 tree o1
= TREE_OPERAND (t1
, 0);
1473 tree o2
= TREE_OPERAND (t2
, 0);
1475 /* Special case: if either target is an unallocated VAR_DECL,
1476 it means that it's going to be unified with whatever the
1477 TARGET_EXPR is really supposed to initialize, so treat it
1478 as being equivalent to anything. */
1479 if (TREE_CODE (o1
) == VAR_DECL
&& DECL_NAME (o1
) == NULL_TREE
1480 && !DECL_RTL_SET_P (o1
))
1482 else if (TREE_CODE (o2
) == VAR_DECL
&& DECL_NAME (o2
) == NULL_TREE
1483 && !DECL_RTL_SET_P (o2
))
1485 else if (!cp_tree_equal (o1
, o2
))
1488 return cp_tree_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
1491 case WITH_CLEANUP_EXPR
:
1492 if (!cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0)))
1494 return cp_tree_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
1497 if (TREE_OPERAND (t1
, 1) != TREE_OPERAND (t2
, 1))
1499 return cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
1506 case IDENTIFIER_NODE
:
1509 case TEMPLATE_PARM_INDEX
:
1510 return (TEMPLATE_PARM_IDX (t1
) == TEMPLATE_PARM_IDX (t2
)
1511 && TEMPLATE_PARM_LEVEL (t1
) == TEMPLATE_PARM_LEVEL (t2
)
1512 && same_type_p (TREE_TYPE (TEMPLATE_PARM_DECL (t1
)),
1513 TREE_TYPE (TEMPLATE_PARM_DECL (t2
))));
1515 case TEMPLATE_ID_EXPR
:
1520 if (!cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0)))
1522 vec1
= TREE_OPERAND (t1
, 1);
1523 vec2
= TREE_OPERAND (t2
, 1);
1526 return !vec1
&& !vec2
;
1528 if (TREE_VEC_LENGTH (vec1
) != TREE_VEC_LENGTH (vec2
))
1531 for (ix
= TREE_VEC_LENGTH (vec1
); ix
--;)
1532 if (!cp_tree_equal (TREE_VEC_ELT (vec1
, ix
),
1533 TREE_VEC_ELT (vec2
, ix
)))
1542 tree o1
= TREE_OPERAND (t1
, 0);
1543 tree o2
= TREE_OPERAND (t2
, 0);
1545 if (TREE_CODE (o1
) != TREE_CODE (o2
))
1548 return same_type_p (o1
, o2
);
1550 return cp_tree_equal (o1
, o2
);
1554 /* Two pointer-to-members are the same if they point to the same
1555 field or function in the same class. */
1556 if (PTRMEM_CST_MEMBER (t1
) != PTRMEM_CST_MEMBER (t2
))
1559 return same_type_p (PTRMEM_CST_CLASS (t1
), PTRMEM_CST_CLASS (t2
));
1565 switch (TREE_CODE_CLASS (code1
))
1576 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); ++i
)
1577 if (!cp_tree_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
)))
1584 return same_type_p (t1
, t2
);
1591 /* The type of ARG when used as an lvalue. */
1594 lvalue_type (tree arg
)
1596 tree type
= TREE_TYPE (arg
);
1600 /* The type of ARG for printing error messages; denote lvalues with
1604 error_type (tree arg
)
1606 tree type
= TREE_TYPE (arg
);
1608 if (TREE_CODE (type
) == ARRAY_TYPE
)
1610 else if (TREE_CODE (type
) == ERROR_MARK
)
1612 else if (real_lvalue_p (arg
))
1613 type
= build_reference_type (lvalue_type (arg
));
1614 else if (IS_AGGR_TYPE (type
))
1615 type
= lvalue_type (arg
);
1620 /* Does FUNCTION use a variable-length argument list? */
1623 varargs_function_p (tree function
)
1625 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (function
));
1626 for (; parm
; parm
= TREE_CHAIN (parm
))
1627 if (TREE_VALUE (parm
) == void_type_node
)
1632 /* Returns 1 if decl is a member of a class. */
1635 member_p (tree decl
)
1637 const tree ctx
= DECL_CONTEXT (decl
);
1638 return (ctx
&& TYPE_P (ctx
));
1641 /* Create a placeholder for member access where we don't actually have an
1642 object that the access is against. */
1645 build_dummy_object (tree type
)
1647 tree decl
= build1 (NOP_EXPR
, build_pointer_type (type
), void_zero_node
);
1648 return build_indirect_ref (decl
, NULL
);
1651 /* We've gotten a reference to a member of TYPE. Return *this if appropriate,
1652 or a dummy object otherwise. If BINFOP is non-0, it is filled with the
1653 binfo path from current_class_type to TYPE, or 0. */
1656 maybe_dummy_object (tree type
, tree
* binfop
)
1661 if (current_class_type
1662 && (binfo
= lookup_base (current_class_type
, type
,
1663 ba_ignore
| ba_quiet
, NULL
)))
1664 context
= current_class_type
;
1667 /* Reference from a nested class member function. */
1669 binfo
= TYPE_BINFO (type
);
1675 if (current_class_ref
&& context
== current_class_type
1676 /* Kludge: Make sure that current_class_type is actually
1677 correct. It might not be if we're in the middle of
1678 tsubst_default_argument. */
1679 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref
)),
1680 current_class_type
))
1681 decl
= current_class_ref
;
1683 decl
= build_dummy_object (context
);
1688 /* Returns 1 if OB is a placeholder object, or a pointer to one. */
1691 is_dummy_object (tree ob
)
1693 if (TREE_CODE (ob
) == INDIRECT_REF
)
1694 ob
= TREE_OPERAND (ob
, 0);
1695 return (TREE_CODE (ob
) == NOP_EXPR
1696 && TREE_OPERAND (ob
, 0) == void_zero_node
);
1699 /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */
1704 t
= strip_array_types (t
);
1706 if (t
== error_mark_node
)
1708 if (INTEGRAL_TYPE_P (t
))
1709 return 1; /* integral, character or enumeral type */
1710 if (FLOAT_TYPE_P (t
))
1713 return 1; /* pointer to non-member */
1714 if (TYPE_PTR_TO_MEMBER_P (t
))
1715 return 1; /* pointer to member */
1717 if (TREE_CODE (t
) == VECTOR_TYPE
)
1718 return 1; /* vectors are (small) arrays if scalars */
1720 if (! CLASS_TYPE_P (t
))
1721 return 0; /* other non-class type (reference or function) */
1722 if (CLASSTYPE_NON_POD_P (t
))
1727 /* Returns 1 iff zero initialization of type T means actually storing
1731 zero_init_p (tree t
)
1733 t
= strip_array_types (t
);
1735 if (t
== error_mark_node
)
1738 /* NULL pointers to data members are initialized with -1. */
1739 if (TYPE_PTRMEM_P (t
))
1742 /* Classes that contain types that can't be zero-initialized, cannot
1743 be zero-initialized themselves. */
1744 if (CLASS_TYPE_P (t
) && CLASSTYPE_NON_ZERO_INIT_P (t
))
1750 /* Table of valid C++ attributes. */
1751 const struct attribute_spec cxx_attribute_table
[] =
1753 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
1754 { "java_interface", 0, 0, false, false, false, handle_java_interface_attribute
},
1755 { "com_interface", 0, 0, false, false, false, handle_com_interface_attribute
},
1756 { "init_priority", 1, 1, true, false, false, handle_init_priority_attribute
},
1757 { NULL
, 0, 0, false, false, false, NULL
}
1760 /* Handle a "java_interface" attribute; arguments as in
1761 struct attribute_spec.handler. */
1763 handle_java_interface_attribute (tree
* node
,
1765 tree args ATTRIBUTE_UNUSED
,
1770 || !CLASS_TYPE_P (*node
)
1771 || !TYPE_FOR_JAVA (*node
))
1773 error ("`%E' attribute can only be applied to Java class definitions",
1775 *no_add_attrs
= true;
1778 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
1779 *node
= build_variant_type_copy (*node
);
1780 TYPE_JAVA_INTERFACE (*node
) = 1;
1785 /* Handle a "com_interface" attribute; arguments as in
1786 struct attribute_spec.handler. */
1788 handle_com_interface_attribute (tree
* node
,
1790 tree args ATTRIBUTE_UNUSED
,
1791 int flags ATTRIBUTE_UNUSED
,
1796 *no_add_attrs
= true;
1799 || !CLASS_TYPE_P (*node
)
1800 || *node
!= TYPE_MAIN_VARIANT (*node
))
1802 warning ("`%E' attribute can only be applied to class definitions",
1808 warning ("`%E' is obsolete; g++ vtables are now COM-compatible by default",
1814 /* Handle an "init_priority" attribute; arguments as in
1815 struct attribute_spec.handler. */
1817 handle_init_priority_attribute (tree
* node
,
1820 int flags ATTRIBUTE_UNUSED
,
1823 tree initp_expr
= TREE_VALUE (args
);
1825 tree type
= TREE_TYPE (decl
);
1828 STRIP_NOPS (initp_expr
);
1830 if (!initp_expr
|| TREE_CODE (initp_expr
) != INTEGER_CST
)
1832 error ("requested init_priority is not an integer constant");
1833 *no_add_attrs
= true;
1837 pri
= TREE_INT_CST_LOW (initp_expr
);
1839 type
= strip_array_types (type
);
1841 if (decl
== NULL_TREE
1842 || TREE_CODE (decl
) != VAR_DECL
1843 || !TREE_STATIC (decl
)
1844 || DECL_EXTERNAL (decl
)
1845 || (TREE_CODE (type
) != RECORD_TYPE
1846 && TREE_CODE (type
) != UNION_TYPE
)
1847 /* Static objects in functions are initialized the
1848 first time control passes through that
1849 function. This is not precise enough to pin down an
1850 init_priority value, so don't allow it. */
1851 || current_function_decl
)
1853 error ("can only use `%E' attribute on file-scope definitions "
1854 "of objects of class type", name
);
1855 *no_add_attrs
= true;
1859 if (pri
> MAX_INIT_PRIORITY
|| pri
<= 0)
1861 error ("requested init_priority is out of range");
1862 *no_add_attrs
= true;
1866 /* Check for init_priorities that are reserved for
1867 language and runtime support implementations.*/
1868 if (pri
<= MAX_RESERVED_INIT_PRIORITY
)
1871 ("requested init_priority is reserved for internal use");
1874 if (SUPPORTS_INIT_PRIORITY
)
1876 DECL_INIT_PRIORITY (decl
) = pri
;
1881 error ("`%E' attribute is not supported on this platform", name
);
1882 *no_add_attrs
= true;
1887 /* Return a new TINST_LEVEL for DECL at location locus. */
1889 make_tinst_level (tree decl
, location_t locus
)
1891 tree tinst_level
= make_node (TINST_LEVEL
);
1892 TREE_CHAIN (tinst_level
) = NULL_TREE
;
1893 TINST_DECL (tinst_level
) = decl
;
1894 TINST_LOCATION (tinst_level
) = locus
;
1898 /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the
1899 thing pointed to by the constant. */
1902 make_ptrmem_cst (tree type
, tree member
)
1904 tree ptrmem_cst
= make_node (PTRMEM_CST
);
1905 TREE_TYPE (ptrmem_cst
) = type
;
1906 PTRMEM_CST_MEMBER (ptrmem_cst
) = member
;
1910 /* Build a variant of TYPE that has the indicated ATTRIBUTES. May
1911 return an existing type of an appropriate type already exists. */
1914 cp_build_type_attribute_variant (tree type
, tree attributes
)
1918 new_type
= build_type_attribute_variant (type
, attributes
);
1919 if (TREE_CODE (new_type
) == FUNCTION_TYPE
1920 && (TYPE_RAISES_EXCEPTIONS (new_type
)
1921 != TYPE_RAISES_EXCEPTIONS (type
)))
1922 new_type
= build_exception_variant (new_type
,
1923 TYPE_RAISES_EXCEPTIONS (type
));
1927 /* Apply FUNC to all language-specific sub-trees of TP in a pre-order
1928 traversal. Called from walk_tree. */
1931 cp_walk_subtrees (tree
*tp
, int *walk_subtrees_p
, walk_tree_fn func
,
1932 void *data
, void *htab
)
1934 enum tree_code code
= TREE_CODE (*tp
);
1935 location_t save_locus
;
1938 #define WALK_SUBTREE(NODE) \
1941 result = walk_tree (&(NODE), func, data, htab); \
1942 if (result) goto out; \
1946 /* Set input_location here so we get the right instantiation context
1947 if we call instantiate_decl from inlinable_function_p. */
1948 save_locus
= input_location
;
1949 if (EXPR_HAS_LOCATION (*tp
))
1950 input_location
= EXPR_LOCATION (*tp
);
1952 /* Not one of the easy cases. We must explicitly go through the
1958 case TEMPLATE_TEMPLATE_PARM
:
1959 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1960 case UNBOUND_CLASS_TEMPLATE
:
1961 case TEMPLATE_PARM_INDEX
:
1962 case TEMPLATE_TYPE_PARM
:
1966 /* None of these have subtrees other than those already walked
1968 *walk_subtrees_p
= 0;
1972 WALK_SUBTREE (TINST_DECL (*tp
));
1973 *walk_subtrees_p
= 0;
1977 WALK_SUBTREE (TREE_TYPE (*tp
));
1978 *walk_subtrees_p
= 0;
1982 WALK_SUBTREE (TREE_PURPOSE (*tp
));
1986 WALK_SUBTREE (OVL_FUNCTION (*tp
));
1987 WALK_SUBTREE (OVL_CHAIN (*tp
));
1988 *walk_subtrees_p
= 0;
1992 if (TYPE_PTRMEMFUNC_P (*tp
))
1993 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (*tp
));
1997 input_location
= save_locus
;
2001 /* We didn't find what we were looking for. */
2003 input_location
= save_locus
;
2009 /* Decide whether there are language-specific reasons to not inline a
2010 function as a tree. */
2013 cp_cannot_inline_tree_fn (tree
* fnp
)
2017 /* We can inline a template instantiation only if it's fully
2019 if (DECL_TEMPLATE_INFO (fn
)
2020 && TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (fn
)))
2022 /* Don't instantiate functions that are not going to be
2024 if (!DECL_INLINE (DECL_TEMPLATE_RESULT
2025 (template_for_substitution (fn
))))
2028 fn
= *fnp
= instantiate_decl (fn
, /*defer_ok=*/0, /*undefined_ok=*/0);
2030 if (TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (fn
)))
2034 if (flag_really_no_inline
2035 && lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn
)) == NULL
)
2038 /* Don't auto-inline anything that might not be bound within
2039 this unit of translation.
2040 Exclude comdat functions from this rule. While they can be bound
2041 to the other unit, they all must be the same. This is especially
2042 important so templates can inline. */
2043 if (!DECL_DECLARED_INLINE_P (fn
) && !(*targetm
.binds_local_p
) (fn
)
2044 && !DECL_COMDAT (fn
))
2046 DECL_UNINLINABLE (fn
) = 1;
2050 if (varargs_function_p (fn
))
2052 DECL_UNINLINABLE (fn
) = 1;
2056 if (! function_attribute_inlinable_p (fn
))
2058 DECL_UNINLINABLE (fn
) = 1;
2065 /* Add any pending functions other than the current function (already
2066 handled by the caller), that thus cannot be inlined, to FNS_P, then
2067 return the latest function added to the array, PREV_FN. */
2070 cp_add_pending_fn_decls (void* fns_p
, tree prev_fn
)
2072 varray_type
*fnsp
= (varray_type
*)fns_p
;
2073 struct saved_scope
*s
;
2075 for (s
= scope_chain
; s
; s
= s
->prev
)
2076 if (s
->function_decl
&& s
->function_decl
!= prev_fn
)
2078 VARRAY_PUSH_TREE (*fnsp
, s
->function_decl
);
2079 prev_fn
= s
->function_decl
;
2085 /* Determine whether a tree node is an OVERLOAD node. Used to decide
2086 whether to copy a node or to preserve its chain when inlining a
2090 cp_is_overload_p (tree t
)
2092 return TREE_CODE (t
) == OVERLOAD
;
2095 /* Determine whether VAR is a declaration of an automatic variable in
2099 cp_auto_var_in_fn_p (tree var
, tree fn
)
2101 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
2102 && nonstatic_local_decl_p (var
));
2105 /* FN body has been duplicated. Update language specific fields. */
2108 cp_update_decl_after_saving (tree fn
,
2111 splay_tree decl_map
= (splay_tree
)decl_map_
;
2112 tree nrv
= DECL_SAVED_FUNCTION_DATA (fn
)->x_return_value
;
2115 DECL_SAVED_FUNCTION_DATA (fn
)->x_return_value
2116 = (tree
) splay_tree_lookup (decl_map
, (splay_tree_key
) nrv
)->value
;
2119 /* Initialize tree.c. */
2124 list_hash_table
= htab_create_ggc (31, list_hash
, list_hash_eq
, NULL
);
2127 /* Returns the kind of special function that DECL (a FUNCTION_DECL)
2128 is. Note that sfk_none is zero, so this function can be used as a
2129 predicate to test whether or not DECL is a special function. */
2131 special_function_kind
2132 special_function_p (tree decl
)
2134 /* Rather than doing all this stuff with magic names, we should
2135 probably have a field of type `special_function_kind' in
2136 DECL_LANG_SPECIFIC. */
2137 if (DECL_COPY_CONSTRUCTOR_P (decl
))
2138 return sfk_copy_constructor
;
2139 if (DECL_CONSTRUCTOR_P (decl
))
2140 return sfk_constructor
;
2141 if (DECL_OVERLOADED_OPERATOR_P (decl
) == NOP_EXPR
)
2142 return sfk_assignment_operator
;
2143 if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl
))
2144 return sfk_destructor
;
2145 if (DECL_COMPLETE_DESTRUCTOR_P (decl
))
2146 return sfk_complete_destructor
;
2147 if (DECL_BASE_DESTRUCTOR_P (decl
))
2148 return sfk_base_destructor
;
2149 if (DECL_DELETING_DESTRUCTOR_P (decl
))
2150 return sfk_deleting_destructor
;
2151 if (DECL_CONV_FN_P (decl
))
2152 return sfk_conversion
;
2157 /* Returns true if and only if NODE is a name, i.e., a node created
2158 by the parser when processing an id-expression. */
2163 if (TREE_CODE (node
) == TEMPLATE_ID_EXPR
)
2164 node
= TREE_OPERAND (node
, 0);
2165 return (/* An ordinary unqualified name. */
2166 TREE_CODE (node
) == IDENTIFIER_NODE
2167 /* A destructor name. */
2168 || TREE_CODE (node
) == BIT_NOT_EXPR
2169 /* A qualified name. */
2170 || TREE_CODE (node
) == SCOPE_REF
);
2173 /* Returns nonzero if TYPE is a character type, including wchar_t. */
2176 char_type_p (tree type
)
2178 return (same_type_p (type
, char_type_node
)
2179 || same_type_p (type
, unsigned_char_type_node
)
2180 || same_type_p (type
, signed_char_type_node
)
2181 || same_type_p (type
, wchar_type_node
));
2184 /* Returns the kind of linkage associated with the indicated DECL. Th
2185 value returned is as specified by the language standard; it is
2186 independent of implementation details regarding template
2187 instantiation, etc. For example, it is possible that a declaration
2188 to which this function assigns external linkage would not show up
2189 as a global symbol when you run `nm' on the resulting object file. */
2192 decl_linkage (tree decl
)
2194 /* This function doesn't attempt to calculate the linkage from first
2195 principles as given in [basic.link]. Instead, it makes use of
2196 the fact that we have already set TREE_PUBLIC appropriately, and
2197 then handles a few special cases. Ideally, we would calculate
2198 linkage first, and then transform that into a concrete
2201 /* Things that don't have names have no linkage. */
2202 if (!DECL_NAME (decl
))
2205 /* Things that are TREE_PUBLIC have external linkage. */
2206 if (TREE_PUBLIC (decl
))
2209 /* Some things that are not TREE_PUBLIC have external linkage, too.
2210 For example, on targets that don't have weak symbols, we make all
2211 template instantiations have internal linkage (in the object
2212 file), but the symbols should still be treated as having external
2213 linkage from the point of view of the language. */
2214 if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
2217 /* Things in local scope do not have linkage, if they don't have
2219 if (decl_function_context (decl
))
2222 /* Everything else has internal linkage. */
2226 /* EXP is an expression that we want to pre-evaluate. Returns via INITP an
2227 expression to perform the pre-evaluation, and returns directly an
2228 expression to use the precalculated result. */
2231 stabilize_expr (tree exp
, tree
* initp
)
2235 if (!TREE_SIDE_EFFECTS (exp
))
2237 init_expr
= NULL_TREE
;
2239 else if (!real_lvalue_p (exp
)
2240 || !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (exp
)))
2242 init_expr
= get_target_expr (exp
);
2243 exp
= TARGET_EXPR_SLOT (init_expr
);
2247 exp
= build_unary_op (ADDR_EXPR
, exp
, 1);
2248 init_expr
= get_target_expr (exp
);
2249 exp
= TARGET_EXPR_SLOT (init_expr
);
2250 exp
= build_indirect_ref (exp
, 0);
2257 /* Like stabilize_expr, but for a call whose args we want to
2261 stabilize_call (tree call
, tree
*initp
)
2263 tree inits
= NULL_TREE
;
2266 if (call
== error_mark_node
)
2269 if (TREE_CODE (call
) != CALL_EXPR
2270 && TREE_CODE (call
) != AGGR_INIT_EXPR
)
2273 for (t
= TREE_OPERAND (call
, 1); t
; t
= TREE_CHAIN (t
))
2274 if (TREE_SIDE_EFFECTS (TREE_VALUE (t
)))
2277 TREE_VALUE (t
) = stabilize_expr (TREE_VALUE (t
), &init
);
2281 inits
= build2 (COMPOUND_EXPR
, void_type_node
, inits
, init
);
2289 /* Like stabilize_expr, but for an initialization. If we are initializing
2290 an object of class type, we don't want to introduce an extra temporary,
2291 so we look past the TARGET_EXPR and stabilize the arguments of the call
2295 stabilize_init (tree init
, tree
*initp
)
2299 if (t
== error_mark_node
)
2302 if (TREE_CODE (t
) == INIT_EXPR
2303 && TREE_CODE (TREE_OPERAND (t
, 1)) != TARGET_EXPR
)
2304 TREE_OPERAND (t
, 1) = stabilize_expr (TREE_OPERAND (t
, 1), initp
);
2307 if (TREE_CODE (t
) == INIT_EXPR
)
2308 t
= TREE_OPERAND (t
, 1);
2309 if (TREE_CODE (t
) == TARGET_EXPR
)
2310 t
= TARGET_EXPR_INITIAL (t
);
2311 if (TREE_CODE (t
) == CONSTRUCTOR
2312 && CONSTRUCTOR_ELTS (t
) == NULL_TREE
)
2314 /* Default-initialization. */
2319 /* If the initializer is a COND_EXPR, we can't preevaluate
2321 if (TREE_CODE (t
) == COND_EXPR
)
2324 stabilize_call (t
, initp
);
2331 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
2332 /* Complain that some language-specific thing hanging off a tree
2333 node has been accessed improperly. */
2336 lang_check_failed (const char* file
, int line
, const char* function
)
2338 internal_error ("lang_* check: failed in %s, at %s:%d",
2339 function
, trim_filename (file
), line
);
2341 #endif /* ENABLE_TREE_CHECKING */
2343 #include "gt-cp-tree.h"