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 Free Software Foundation, Inc.
4 Hacked by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GNU CC.
8 GNU CC 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 GNU CC 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 GNU CC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
32 #include "insn-config.h"
33 #include "integrate.h"
35 static tree bot_manip
PARAMS ((tree
*, int *, void *));
36 static tree bot_replace
PARAMS ((tree
*, int *, void *));
37 static tree build_cplus_array_type_1
PARAMS ((tree
, tree
));
38 static int list_hash_eq
PARAMS ((const void *, const void *));
39 static hashval_t list_hash_pieces
PARAMS ((tree
, tree
, tree
));
40 static hashval_t list_hash
PARAMS ((const void *));
41 static cp_lvalue_kind lvalue_p_1
PARAMS ((tree
, int));
42 static tree no_linkage_helper
PARAMS ((tree
*, int *, void *));
43 static tree build_srcloc
PARAMS ((const char *, int));
44 static tree mark_local_for_remap_r
PARAMS ((tree
*, int *, void *));
45 static tree cp_unsave_r
PARAMS ((tree
*, int *, void *));
46 static void cp_unsave
PARAMS ((tree
*));
47 static tree build_target_expr
PARAMS ((tree
, tree
));
48 static tree count_trees_r
PARAMS ((tree
*, int *, void *));
49 static tree verify_stmt_tree_r
PARAMS ((tree
*, int *, void *));
50 static tree find_tree_r
PARAMS ((tree
*, int *, void *));
51 extern int cp_statement_code_p
PARAMS ((enum tree_code
));
53 /* If REF is an lvalue, returns the kind of lvalue that REF is.
54 Otherwise, returns clk_none. If TREAT_CLASS_RVALUES_AS_LVALUES is
55 non-zero, rvalues of class type are considered lvalues. */
58 lvalue_p_1 (ref
, treat_class_rvalues_as_lvalues
)
60 int treat_class_rvalues_as_lvalues
;
62 cp_lvalue_kind op1_lvalue_kind
= clk_none
;
63 cp_lvalue_kind op2_lvalue_kind
= clk_none
;
65 if (TREE_CODE (TREE_TYPE (ref
)) == REFERENCE_TYPE
)
68 if (ref
== current_class_ptr
)
71 switch (TREE_CODE (ref
))
73 /* preincrements and predecrements are valid lvals, provided
74 what they refer to are valid lvals. */
75 case PREINCREMENT_EXPR
:
76 case PREDECREMENT_EXPR
:
80 case WITH_CLEANUP_EXPR
:
83 /* This shouldn't be here, but there are lots of places in the compiler
84 that are sloppy about tacking on NOP_EXPRs to the same type when
85 no actual conversion is happening. */
87 return lvalue_p_1 (TREE_OPERAND (ref
, 0),
88 treat_class_rvalues_as_lvalues
);
91 op1_lvalue_kind
= lvalue_p_1 (TREE_OPERAND (ref
, 0),
92 treat_class_rvalues_as_lvalues
);
94 /* The "field" can be a FUNCTION_DECL or an OVERLOAD in some
96 && TREE_CODE (TREE_OPERAND (ref
, 1)) == FIELD_DECL
97 && DECL_C_BIT_FIELD (TREE_OPERAND (ref
, 1)))
99 /* Clear the ordinary bit. If this object was a class
100 rvalue we want to preserve that information. */
101 op1_lvalue_kind
&= ~clk_ordinary
;
102 /* The lvalue is for a btifield. */
103 op1_lvalue_kind
|= clk_bitfield
;
105 return op1_lvalue_kind
;
111 if (TREE_READONLY (ref
) && ! TREE_STATIC (ref
)
112 && DECL_LANG_SPECIFIC (ref
)
113 && DECL_IN_AGGR_P (ref
))
119 if (TREE_CODE (TREE_TYPE (ref
)) != METHOD_TYPE
)
123 /* A currently unresolved scope ref. */
125 my_friendly_abort (103);
127 if (TREE_CODE (TREE_OPERAND (ref
, 1)) == FUNCTION_DECL
)
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 return ((treat_class_rvalues_as_lvalues
158 && IS_AGGR_TYPE (TREE_TYPE (ref
)))
159 ? clk_class
: clk_none
);
162 /* All functions (except non-static-member functions) are
164 return (DECL_NONSTATIC_MEMBER_FUNCTION_P (ref
)
165 ? clk_none
: clk_ordinary
);
171 /* If one operand is not an lvalue at all, then this expression is
173 if (!op1_lvalue_kind
|| !op2_lvalue_kind
)
176 /* Otherwise, it's an lvalue, and it has all the odd properties
177 contributed by either operand. */
178 op1_lvalue_kind
= op1_lvalue_kind
| op2_lvalue_kind
;
179 /* It's not an ordinary lvalue if it involves either a bit-field or
181 if ((op1_lvalue_kind
& ~clk_ordinary
) != clk_none
)
182 op1_lvalue_kind
&= ~clk_ordinary
;
183 return op1_lvalue_kind
;
186 /* If REF is an lvalue, returns the kind of lvalue that REF is.
187 Otherwise, returns clk_none. Lvalues can be assigned, unless they
188 have TREE_READONLY, or unless they are FUNCTION_DECLs. Lvalues can
189 have their address taken, unless they have DECL_REGISTER. */
195 return lvalue_p_1 (ref
, /*treat_class_rvalues_as_lvalues=*/0);
198 /* This differs from real_lvalue_p in that class rvalues are
199 considered lvalues. */
206 (lvalue_p_1 (ref
, /*treat_class_rvalues_as_lvalues=*/1) != clk_none
);
209 /* Return nonzero if REF is an lvalue valid for this language;
210 otherwise, print an error message and return zero. */
213 lvalue_or_else (ref
, string
)
217 int win
= lvalue_p (ref
);
219 error ("non-lvalue in %s", string
);
223 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
226 build_target_expr (decl
, value
)
232 t
= build (TARGET_EXPR
, TREE_TYPE (decl
), decl
, value
,
233 maybe_build_cleanup (decl
), NULL_TREE
);
234 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
235 ignore the TARGET_EXPR. If there really turn out to be no
236 side-effects, then the optimizer should be able to get rid of
237 whatever code is generated anyhow. */
238 TREE_SIDE_EFFECTS (t
) = 1;
243 /* INIT is a CALL_EXPR which needs info about its target.
244 TYPE is the type that this initialization should appear to have.
246 Build an encapsulation of the initialization to perform
247 and return it so that it can be processed by language-independent
248 and language-specific expression expanders. */
251 build_cplus_new (type
, init
)
259 /* Make sure that we're not trying to create an instance of an
261 abstract_virtuals_error (NULL_TREE
, type
);
263 if (TREE_CODE (init
) != CALL_EXPR
&& TREE_CODE (init
) != AGGR_INIT_EXPR
)
264 return convert (type
, init
);
266 slot
= build (VAR_DECL
, type
);
267 DECL_ARTIFICIAL (slot
) = 1;
268 DECL_CONTEXT (slot
) = current_function_decl
;
269 layout_decl (slot
, 0);
271 /* We split the CALL_EXPR into its function and its arguments here.
272 Then, in expand_expr, we put them back together. The reason for
273 this is that this expression might be a default argument
274 expression. In that case, we need a new temporary every time the
275 expression is used. That's what break_out_target_exprs does; it
276 replaces every AGGR_INIT_EXPR with a copy that uses a fresh
277 temporary slot. Then, expand_expr builds up a call-expression
278 using the new slot. */
279 fn
= TREE_OPERAND (init
, 0);
280 rval
= build (AGGR_INIT_EXPR
, type
, fn
, TREE_OPERAND (init
, 1), slot
);
281 TREE_SIDE_EFFECTS (rval
) = 1;
282 AGGR_INIT_VIA_CTOR_P (rval
)
283 = (TREE_CODE (fn
) == ADDR_EXPR
284 && TREE_CODE (TREE_OPERAND (fn
, 0)) == FUNCTION_DECL
285 && DECL_CONSTRUCTOR_P (TREE_OPERAND (fn
, 0)));
286 rval
= build_target_expr (slot
, rval
);
291 /* Buidl a TARGET_EXPR using INIT to initialize a new temporary of the
295 build_target_expr_with_type (init
, type
)
302 if (TREE_CODE (init
) == TARGET_EXPR
)
305 slot
= build (VAR_DECL
, type
);
306 DECL_ARTIFICIAL (slot
) = 1;
307 DECL_CONTEXT (slot
) = current_function_decl
;
308 layout_decl (slot
, 0);
309 rval
= build_target_expr (slot
, init
);
314 /* Like build_target_expr_with_type, but use the type of INIT. */
317 get_target_expr (init
)
320 return build_target_expr_with_type (init
, TREE_TYPE (init
));
323 /* Recursively perform a preorder search EXP for CALL_EXPRs, making
324 copies where they are found. Returns a deep copy all nodes transitively
325 containing CALL_EXPRs. */
328 break_out_calls (exp
)
331 register tree t1
, t2
= NULL_TREE
;
332 register enum tree_code code
;
333 register int changed
= 0;
336 if (exp
== NULL_TREE
)
339 code
= TREE_CODE (exp
);
341 if (code
== CALL_EXPR
)
342 return copy_node (exp
);
344 /* Don't try and defeat a save_expr, as it should only be done once. */
345 if (code
== SAVE_EXPR
)
348 switch (TREE_CODE_CLASS (code
))
353 case 'c': /* a constant */
354 case 't': /* a type node */
355 case 'x': /* something random, like an identifier or an ERROR_MARK. */
358 case 'd': /* A decl node */
359 #if 0 /* This is bogus. jason 9/21/94 */
361 t1
= break_out_calls (DECL_INITIAL (exp
));
362 if (t1
!= DECL_INITIAL (exp
))
364 exp
= copy_node (exp
);
365 DECL_INITIAL (exp
) = t1
;
370 case 'b': /* A block node */
372 /* Don't know how to handle these correctly yet. Must do a
373 break_out_calls on all DECL_INITIAL values for local variables,
374 and also break_out_calls on all sub-blocks and sub-statements. */
379 case 'e': /* an expression */
380 case 'r': /* a reference */
381 case 's': /* an expression with side effects */
382 for (i
= TREE_CODE_LENGTH (code
) - 1; i
>= 0; i
--)
384 t1
= break_out_calls (TREE_OPERAND (exp
, i
));
385 if (t1
!= TREE_OPERAND (exp
, i
))
387 exp
= copy_node (exp
);
388 TREE_OPERAND (exp
, i
) = t1
;
393 case '<': /* a comparison expression */
394 case '2': /* a binary arithmetic expression */
395 t2
= break_out_calls (TREE_OPERAND (exp
, 1));
396 if (t2
!= TREE_OPERAND (exp
, 1))
398 case '1': /* a unary arithmetic expression */
399 t1
= break_out_calls (TREE_OPERAND (exp
, 0));
400 if (t1
!= TREE_OPERAND (exp
, 0))
404 if (TREE_CODE_LENGTH (code
) == 1)
405 return build1 (code
, TREE_TYPE (exp
), t1
);
407 return build (code
, TREE_TYPE (exp
), t1
, t2
);
414 /* Construct, lay out and return the type of methods belonging to class
415 BASETYPE and whose arguments are described by ARGTYPES and whose values
416 are described by RETTYPE. If each type exists already, reuse it. */
419 build_cplus_method_type (basetype
, rettype
, argtypes
)
420 tree basetype
, rettype
, argtypes
;
426 /* Make a node of the sort we want. */
427 t
= make_node (METHOD_TYPE
);
429 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
430 TREE_TYPE (t
) = rettype
;
431 ptype
= build_pointer_type (basetype
);
433 /* The actual arglist for this function includes a "hidden" argument
434 which is "this". Put it into the list of argument types. */
435 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
436 TYPE_ARG_TYPES (t
) = argtypes
;
437 TREE_SIDE_EFFECTS (argtypes
) = 1; /* Mark first argtype as "artificial". */
439 /* If we already have such a type, use the old one and free this one.
440 Note that it also frees up the above cons cell if found. */
441 hashcode
= TYPE_HASH (basetype
) + TYPE_HASH (rettype
) +
442 type_hash_list (argtypes
);
444 t
= type_hash_canon (hashcode
, t
);
446 if (!COMPLETE_TYPE_P (t
))
453 build_cplus_array_type_1 (elt_type
, index_type
)
459 if (elt_type
== error_mark_node
|| index_type
== error_mark_node
)
460 return error_mark_node
;
462 if (processing_template_decl
463 || uses_template_parms (elt_type
)
464 || uses_template_parms (index_type
))
466 t
= make_node (ARRAY_TYPE
);
467 TREE_TYPE (t
) = elt_type
;
468 TYPE_DOMAIN (t
) = index_type
;
471 t
= build_array_type (elt_type
, index_type
);
473 /* Push these needs up so that initialization takes place
475 TYPE_NEEDS_CONSTRUCTING (t
)
476 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (elt_type
));
477 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
478 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (elt_type
));
483 build_cplus_array_type (elt_type
, index_type
)
488 int type_quals
= CP_TYPE_QUALS (elt_type
);
490 elt_type
= TYPE_MAIN_VARIANT (elt_type
);
492 t
= build_cplus_array_type_1 (elt_type
, index_type
);
494 if (type_quals
!= TYPE_UNQUALIFIED
)
495 t
= cp_build_qualified_type (t
, type_quals
);
500 /* Make a variant of TYPE, qualified with the TYPE_QUALS. Handles
501 arrays correctly. In particular, if TYPE is an array of T's, and
502 TYPE_QUALS is non-empty, returns an array of qualified T's. If
503 at attempt is made to qualify a type illegally, and COMPLAIN is
504 non-zero, an error is issued. If COMPLAIN is zero, error_mark_node
508 cp_build_qualified_type_real (type
, type_quals
, complain
)
515 if (type
== error_mark_node
)
518 if (type_quals
== CP_TYPE_QUALS (type
))
521 /* A restrict-qualified pointer type must be a pointer (or reference)
522 to object or incomplete type. */
523 if ((type_quals
& TYPE_QUAL_RESTRICT
)
524 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
525 && (!POINTER_TYPE_P (type
)
526 || TYPE_PTRMEM_P (type
)
527 || TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
))
530 cp_error ("`%T' cannot be `restrict'-qualified", type
);
532 return error_mark_node
;
534 type_quals
&= ~TYPE_QUAL_RESTRICT
;
537 if (type_quals
!= TYPE_UNQUALIFIED
538 && TREE_CODE (type
) == FUNCTION_TYPE
)
541 cp_error ("`%T' cannot be `const'-, `volatile'-, or `restrict'-qualified", type
);
543 return error_mark_node
;
544 type_quals
= TYPE_UNQUALIFIED
;
546 else if (TREE_CODE (type
) == ARRAY_TYPE
)
548 /* In C++, the qualification really applies to the array element
549 type. Obtain the appropriately qualified element type. */
552 = cp_build_qualified_type_real (TREE_TYPE (type
),
556 if (element_type
== error_mark_node
)
557 return error_mark_node
;
559 /* See if we already have an identically qualified type. */
560 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
561 if (CP_TYPE_QUALS (t
) == type_quals
)
564 /* If we didn't already have it, create it now. */
567 /* Make a new array type, just like the old one, but with the
568 appropriately qualified element type. */
569 t
= build_type_copy (type
);
570 TREE_TYPE (t
) = element_type
;
573 /* Even if we already had this variant, we update
574 TYPE_NEEDS_CONSTRUCTING and TYPE_HAS_NONTRIVIAL_DESTRUCTOR in case
575 they changed since the variant was originally created.
577 This seems hokey; if there is some way to use a previous
578 variant *without* coming through here,
579 TYPE_NEEDS_CONSTRUCTING will never be updated. */
580 TYPE_NEEDS_CONSTRUCTING (t
)
581 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (element_type
));
582 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
583 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (element_type
));
586 else if (TYPE_PTRMEMFUNC_P (type
))
588 /* For a pointer-to-member type, we can't just return a
589 cv-qualified version of the RECORD_TYPE. If we do, we
590 haven't change the field that contains the actual pointer to
591 a method, and so TYPE_PTRMEMFUNC_FN_TYPE will be wrong. */
594 t
= TYPE_PTRMEMFUNC_FN_TYPE (type
);
595 t
= cp_build_qualified_type_real (t
, type_quals
, complain
);
596 return build_ptrmemfunc_type (t
);
599 /* Retrieve (or create) the appropriately qualified variant. */
600 result
= build_qualified_type (type
, type_quals
);
602 /* If this was a pointer-to-method type, and we just made a copy,
603 then we need to clear the cached associated
604 pointer-to-member-function type; it is not valid for the new
607 && TREE_CODE (type
) == POINTER_TYPE
608 && TREE_CODE (TREE_TYPE (type
)) == METHOD_TYPE
)
609 TYPE_SET_PTRMEMFUNC_TYPE (result
, NULL_TREE
);
614 /* Returns the canonical version of TYPE. In other words, if TYPE is
615 a typedef, returns the underlying type. The cv-qualification of
616 the type returned matches the type input; they will always be
620 canonical_type_variant (t
)
623 return cp_build_qualified_type (TYPE_MAIN_VARIANT (t
), CP_TYPE_QUALS (t
));
626 /* Makes new binfos for the indirect bases under BINFO, and updates
627 BINFO_OFFSET for them and their bases. */
630 unshare_base_binfos (binfo
)
633 tree binfos
= BINFO_BASETYPES (binfo
);
637 if (binfos
== NULL_TREE
)
640 /* Now unshare the structure beneath BINFO. */
641 for (j
= TREE_VEC_LENGTH (binfos
)-1;
644 tree base_binfo
= TREE_VEC_ELT (binfos
, j
);
645 new_binfo
= TREE_VEC_ELT (binfos
, j
)
646 = make_binfo (BINFO_OFFSET (base_binfo
),
648 BINFO_VTABLE (base_binfo
),
649 BINFO_VIRTUALS (base_binfo
));
650 TREE_VIA_PUBLIC (new_binfo
) = TREE_VIA_PUBLIC (base_binfo
);
651 TREE_VIA_PROTECTED (new_binfo
) = TREE_VIA_PROTECTED (base_binfo
);
652 TREE_VIA_VIRTUAL (new_binfo
) = TREE_VIA_VIRTUAL (base_binfo
);
653 BINFO_INHERITANCE_CHAIN (new_binfo
) = binfo
;
654 BINFO_PRIMARY_BASE_OF (new_binfo
) = NULL_TREE
;
655 unshare_base_binfos (new_binfo
);
660 /* Hashing of lists so that we don't make duplicates.
661 The entry point is `list_hash_canon'. */
663 /* Now here is the hash table. When recording a list, it is added
664 to the slot whose index is the hash code mod the table size.
665 Note that the hash table is used for several kinds of lists.
666 While all these live in the same table, they are completely independent,
667 and the hash code is computed differently for each of these. */
669 static htab_t list_hash_table
;
678 /* Compare ENTRY (an entry in the hash table) with DATA (a list_proxy
679 for a node we are thinking about adding). */
682 list_hash_eq (entry
, data
)
686 tree t
= (tree
) entry
;
687 struct list_proxy
*proxy
= (struct list_proxy
*) data
;
689 return (TREE_VALUE (t
) == proxy
->value
690 && TREE_PURPOSE (t
) == proxy
->purpose
691 && TREE_CHAIN (t
) == proxy
->chain
);
694 /* Compute a hash code for a list (chain of TREE_LIST nodes
695 with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the
696 TREE_COMMON slots), by adding the hash codes of the individual entries. */
699 list_hash_pieces (purpose
, value
, chain
)
704 hashval_t hashcode
= 0;
707 hashcode
+= TYPE_HASH (chain
);
710 hashcode
+= TYPE_HASH (value
);
714 hashcode
+= TYPE_HASH (purpose
);
720 /* Hash an already existing TREE_LIST. */
727 return list_hash_pieces (TREE_PURPOSE (t
),
732 /* Given list components PURPOSE, VALUE, AND CHAIN, return the canonical
733 object for an identical list if one already exists. Otherwise, build a
734 new one, and record it as the canonical object. */
737 hash_tree_cons (purpose
, value
, chain
)
738 tree purpose
, value
, chain
;
742 struct list_proxy proxy
;
744 /* Hash the list node. */
745 hashcode
= list_hash_pieces (purpose
, value
, chain
);
746 /* Create a proxy for the TREE_LIST we would like to create. We
747 don't actually create it so as to avoid creating garbage. */
748 proxy
.purpose
= purpose
;
751 /* See if it is already in the table. */
752 slot
= htab_find_slot_with_hash (list_hash_table
, &proxy
, hashcode
,
754 /* If not, create a new node. */
756 *slot
= (PTR
) tree_cons (purpose
, value
, chain
);
760 /* Constructor for hashed lists. */
763 hash_tree_chain (value
, chain
)
766 return hash_tree_cons (NULL_TREE
, value
, chain
);
769 /* Similar, but used for concatenating two lists. */
772 hash_chainon (list1
, list2
)
779 if (TREE_CHAIN (list1
) == NULL_TREE
)
780 return hash_tree_chain (TREE_VALUE (list1
), list2
);
781 return hash_tree_chain (TREE_VALUE (list1
),
782 hash_chainon (TREE_CHAIN (list1
), list2
));
785 /* Build an association between TYPE and some parameters:
787 OFFSET is the offset added to `this' to convert it to a pointer
790 BINFO is the base binfo to use, if we are deriving from one. This
791 is necessary, as we want specialized parent binfos from base
792 classes, so that the VTABLE_NAMEs of bases are for the most derived
793 type, instead of the simple type.
795 VTABLE is the virtual function table with which to initialize
796 sub-objects of type TYPE.
798 VIRTUALS are the virtual functions sitting in VTABLE. */
801 make_binfo (offset
, binfo
, vtable
, virtuals
)
803 tree vtable
, virtuals
;
805 tree new_binfo
= make_tree_vec (11);
808 if (TREE_CODE (binfo
) == TREE_VEC
)
809 type
= BINFO_TYPE (binfo
);
813 binfo
= CLASS_TYPE_P (type
) ? TYPE_BINFO (binfo
) : NULL_TREE
;
816 TREE_TYPE (new_binfo
) = TYPE_MAIN_VARIANT (type
);
817 BINFO_OFFSET (new_binfo
) = offset
;
818 BINFO_VTABLE (new_binfo
) = vtable
;
819 BINFO_VIRTUALS (new_binfo
) = virtuals
;
821 if (binfo
&& BINFO_BASETYPES (binfo
) != NULL_TREE
)
822 BINFO_BASETYPES (new_binfo
) = copy_node (BINFO_BASETYPES (binfo
));
826 /* Return the binfo value for ELEM in TYPE. */
829 binfo_value (elem
, type
)
833 if (get_base_distance (elem
, type
, 0, (tree
*)0) == -2)
834 compiler_error ("base class `%s' ambiguous in binfo_value",
835 TYPE_NAME_STRING (elem
));
837 return TYPE_BINFO (type
);
838 if (TREE_CODE (elem
) == RECORD_TYPE
&& TYPE_BINFO (elem
) == type
)
840 return get_binfo (elem
, type
, 0);
843 /* Return a TREE_LIST whose TREE_VALUE nodes along the
844 BINFO_INHERITANCE_CHAIN for BINFO, but in the opposite order. In
845 other words, while the BINFO_INHERITANCE_CHAIN goes from base
846 classes to derived classes, the reversed path goes from derived
847 classes to base classes. */
855 reversed_path
= NULL_TREE
;
858 reversed_path
= tree_cons (NULL_TREE
, binfo
, reversed_path
);
859 binfo
= BINFO_INHERITANCE_CHAIN (binfo
);
862 return reversed_path
;
872 fprintf (stderr
, "type \"%s\", offset = ",
873 TYPE_NAME_STRING (BINFO_TYPE (elem
)));
874 fprintf (stderr
, HOST_WIDE_INT_PRINT_DEC
,
875 TREE_INT_CST_LOW (BINFO_OFFSET (elem
)));
876 fprintf (stderr
, "\nvtable type:\n");
877 debug_tree (BINFO_TYPE (elem
));
878 if (BINFO_VTABLE (elem
))
879 fprintf (stderr
, "vtable decl \"%s\"\n",
880 IDENTIFIER_POINTER (DECL_NAME (get_vtbl_decl_for_binfo (elem
))));
882 fprintf (stderr
, "no vtable decl yet\n");
883 fprintf (stderr
, "virtuals:\n");
884 virtuals
= BINFO_VIRTUALS (elem
);
889 tree fndecl
= TREE_VALUE (virtuals
);
890 fprintf (stderr
, "%s [%ld =? %ld]\n",
891 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl
)),
892 (long) n
, (long) TREE_INT_CST_LOW (DECL_VINDEX (fndecl
)));
894 virtuals
= TREE_CHAIN (virtuals
);
903 if (TREE_CODE (t
) == FUNCTION_DECL
)
905 else if (TREE_CODE (t
) == OVERLOAD
)
907 for (i
=0; t
; t
= OVL_CHAIN (t
))
912 my_friendly_abort (359);
920 /* A baselink is also considered an overloaded function. */
921 if (TREE_CODE (x
) == OFFSET_REF
)
922 x
= TREE_OPERAND (x
, 1);
925 return (TREE_CODE (x
) == FUNCTION_DECL
926 || TREE_CODE (x
) == TEMPLATE_ID_EXPR
927 || DECL_FUNCTION_TEMPLATE_P (x
)
928 || TREE_CODE (x
) == OVERLOAD
);
932 really_overloaded_fn (x
)
935 /* A baselink is also considered an overloaded function. */
936 if (TREE_CODE (x
) == OFFSET_REF
)
937 x
= TREE_OPERAND (x
, 1);
940 return (TREE_CODE (x
) == OVERLOAD
941 && (TREE_CHAIN (x
) != NULL_TREE
942 || DECL_FUNCTION_TEMPLATE_P (OVL_FUNCTION (x
))));
949 my_friendly_assert (is_overloaded_fn (from
), 9);
950 /* A baselink is also considered an overloaded function. */
951 if (BASELINK_P (from
))
952 from
= TREE_VALUE (from
);
953 return OVL_CURRENT (from
);
956 /* Returns nonzero if T is a ->* or .* expression that refers to a
963 return (TREE_CODE (t
) == OFFSET_REF
964 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (t
, 1))));
967 /* Return a new OVL node, concatenating it with the old one. */
970 ovl_cons (decl
, chain
)
974 tree result
= make_node (OVERLOAD
);
975 TREE_TYPE (result
) = unknown_type_node
;
976 OVL_FUNCTION (result
) = decl
;
977 TREE_CHAIN (result
) = chain
;
982 /* Build a new overloaded function. If this is the first one,
983 just return it; otherwise, ovl_cons the _DECLs */
986 build_overload (decl
, chain
)
990 if (! chain
&& TREE_CODE (decl
) != TEMPLATE_DECL
)
992 if (chain
&& TREE_CODE (chain
) != OVERLOAD
)
993 chain
= ovl_cons (chain
, NULL_TREE
);
994 return ovl_cons (decl
, chain
);
997 /* True if fn is in ovl. */
1000 ovl_member (fn
, ovl
)
1004 if (ovl
== NULL_TREE
)
1006 if (TREE_CODE (ovl
) != OVERLOAD
)
1008 for (; ovl
; ovl
= OVL_CHAIN (ovl
))
1009 if (OVL_FUNCTION (ovl
) == fn
)
1015 is_aggr_type_2 (t1
, t2
)
1018 if (TREE_CODE (t1
) != TREE_CODE (t2
))
1020 return IS_AGGR_TYPE (t1
) && IS_AGGR_TYPE (t2
);
1023 /* Returns non-zero if CODE is the code for a statement. */
1026 cp_statement_code_p (code
)
1027 enum tree_code code
;
1034 case CTOR_INITIALIZER
:
1048 #define PRINT_RING_SIZE 4
1051 lang_printable_name (decl
, v
)
1055 static tree decl_ring
[PRINT_RING_SIZE
];
1056 static char *print_ring
[PRINT_RING_SIZE
];
1057 static int ring_counter
;
1060 /* Only cache functions. */
1062 || TREE_CODE (decl
) != FUNCTION_DECL
1063 || DECL_LANG_SPECIFIC (decl
) == 0)
1064 return lang_decl_name (decl
, v
);
1066 /* See if this print name is lying around. */
1067 for (i
= 0; i
< PRINT_RING_SIZE
; i
++)
1068 if (decl_ring
[i
] == decl
)
1069 /* yes, so return it. */
1070 return print_ring
[i
];
1072 if (++ring_counter
== PRINT_RING_SIZE
)
1075 if (current_function_decl
!= NULL_TREE
)
1077 if (decl_ring
[ring_counter
] == current_function_decl
)
1079 if (ring_counter
== PRINT_RING_SIZE
)
1081 if (decl_ring
[ring_counter
] == current_function_decl
)
1082 my_friendly_abort (106);
1085 if (print_ring
[ring_counter
])
1086 free (print_ring
[ring_counter
]);
1088 print_ring
[ring_counter
] = xstrdup (lang_decl_name (decl
, v
));
1089 decl_ring
[ring_counter
] = decl
;
1090 return print_ring
[ring_counter
];
1093 /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions
1094 listed in RAISES. */
1097 build_exception_variant (type
, raises
)
1101 tree v
= TYPE_MAIN_VARIANT (type
);
1102 int type_quals
= TYPE_QUALS (type
);
1104 for (; v
; v
= TYPE_NEXT_VARIANT (v
))
1105 if (TYPE_QUALS (v
) == type_quals
1106 && comp_except_specs (raises
, TYPE_RAISES_EXCEPTIONS (v
), 1))
1109 /* Need to build a new variant. */
1110 v
= build_type_copy (type
);
1111 TYPE_RAISES_EXCEPTIONS (v
) = raises
;
1115 /* Given a TEMPLATE_TEMPLATE_PARM node T, create a new
1116 BOUND_TEMPLATE_TEMPLATE_PARM bound with NEWARGS as its template
1120 bind_template_template_parm (t
, newargs
)
1124 tree decl
= TYPE_NAME (t
);
1127 t2
= make_aggr_type (BOUND_TEMPLATE_TEMPLATE_PARM
);
1128 decl
= build_decl (TYPE_DECL
, DECL_NAME (decl
), NULL_TREE
);
1130 /* These nodes have to be created to reflect new TYPE_DECL and template
1132 TEMPLATE_TYPE_PARM_INDEX (t2
) = copy_node (TEMPLATE_TYPE_PARM_INDEX (t
));
1133 TEMPLATE_PARM_DECL (TEMPLATE_TYPE_PARM_INDEX (t2
)) = decl
;
1134 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2
)
1135 = tree_cons (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t
),
1136 newargs
, NULL_TREE
);
1138 TREE_TYPE (decl
) = t2
;
1139 TYPE_NAME (t2
) = decl
;
1140 TYPE_STUB_DECL (t2
) = decl
;
1146 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal.
1147 FUNC is called with the DATA and the address of each sub-tree. If
1148 FUNC returns a non-NULL value, the traversal is aborted, and the
1149 value returned by FUNC is returned. If HTAB is non-NULL it is used
1150 to record the nodes visited, and to avoid visiting a node more than
1154 walk_tree (tp
, func
, data
, htab
)
1160 enum tree_code code
;
1164 #define WALK_SUBTREE(NODE) \
1167 result = walk_tree (&(NODE), func, data, htab); \
1173 /* Skip empty subtrees. */
1181 /* Don't walk the same tree twice, if the user has requested
1182 that we avoid doing so. */
1183 if (htab_find (htab
, *tp
))
1185 /* If we haven't already seen this node, add it to the table. */
1186 slot
= htab_find_slot (htab
, *tp
, INSERT
);
1190 /* Call the function. */
1192 result
= (*func
) (tp
, &walk_subtrees
, data
);
1194 /* If we found something, return it. */
1198 code
= TREE_CODE (*tp
);
1200 /* Even if we didn't, FUNC may have decided that there was nothing
1201 interesting below this point in the tree. */
1204 if (statement_code_p (code
) || code
== TREE_LIST
|| code
== OVERLOAD
)
1205 /* But we still need to check our siblings. */
1206 return walk_tree (&TREE_CHAIN (*tp
), func
, data
, htab
);
1211 /* Handle common cases up front. */
1212 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
))
1213 || TREE_CODE_CLASS (code
) == 'r'
1214 || TREE_CODE_CLASS (code
) == 's')
1218 /* Set lineno here so we get the right instantiation context
1219 if we call instantiate_decl from inlinable_function_p. */
1220 if (statement_code_p (code
) && !STMT_LINENO_FOR_FN_P (*tp
))
1221 lineno
= STMT_LINENO (*tp
);
1223 /* Walk over all the sub-trees of this operand. */
1224 len
= first_rtl_op (code
);
1225 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
1226 But, we only want to walk once. */
1227 if (code
== TARGET_EXPR
1228 && TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1))
1230 /* Go through the subtrees. We need to do this in forward order so
1231 that the scope of a FOR_EXPR is handled properly. */
1232 for (i
= 0; i
< len
; ++i
)
1233 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
1235 /* For statements, we also walk the chain so that we cover the
1236 entire statement tree. */
1237 if (statement_code_p (code
))
1239 if (code
== DECL_STMT
1240 && DECL_STMT_DECL (*tp
)
1241 && DECL_P (DECL_STMT_DECL (*tp
)))
1243 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
1244 into declarations that are just mentioned, rather than
1245 declared; they don't really belong to this part of the tree.
1246 And, we can see cycles: the initializer for a declaration can
1247 refer to the declaration itself. */
1248 WALK_SUBTREE (DECL_INITIAL (DECL_STMT_DECL (*tp
)));
1249 WALK_SUBTREE (DECL_SIZE (DECL_STMT_DECL (*tp
)));
1250 WALK_SUBTREE (DECL_SIZE_UNIT (DECL_STMT_DECL (*tp
)));
1253 /* This can be tail-recursion optimized if we write it this way. */
1254 return walk_tree (&TREE_CHAIN (*tp
), func
, data
, htab
);
1257 /* We didn't find what we were looking for. */
1260 else if (TREE_CODE_CLASS (code
) == 'd')
1262 WALK_SUBTREE (TREE_TYPE (*tp
));
1264 /* We didn't find what we were looking for. */
1268 /* Not one of the easy cases. We must explicitly go through the
1273 case IDENTIFIER_NODE
:
1278 case TEMPLATE_TEMPLATE_PARM
:
1279 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1280 case TEMPLATE_PARM_INDEX
:
1281 case TEMPLATE_TYPE_PARM
:
1292 /* None of thse have subtrees other than those already walked
1297 WALK_SUBTREE (TREE_TYPE (*tp
));
1301 case REFERENCE_TYPE
:
1302 WALK_SUBTREE (TREE_TYPE (*tp
));
1306 /* A BASELINK_P's TREE_PURPOSE is a BINFO, and hence circular. */
1307 if (!BASELINK_P (*tp
))
1308 WALK_SUBTREE (TREE_PURPOSE (*tp
));
1309 WALK_SUBTREE (TREE_VALUE (*tp
));
1310 WALK_SUBTREE (TREE_CHAIN (*tp
));
1314 WALK_SUBTREE (OVL_FUNCTION (*tp
));
1315 WALK_SUBTREE (OVL_CHAIN (*tp
));
1320 int len
= TREE_VEC_LENGTH (*tp
);
1322 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
1327 WALK_SUBTREE (TREE_REALPART (*tp
));
1328 WALK_SUBTREE (TREE_IMAGPART (*tp
));
1332 WALK_SUBTREE (CONSTRUCTOR_ELTS (*tp
));
1336 WALK_SUBTREE (TYPE_METHOD_BASETYPE (*tp
));
1340 WALK_SUBTREE (TREE_TYPE (*tp
));
1342 tree arg
= TYPE_ARG_TYPES (*tp
);
1344 /* We never want to walk into default arguments. */
1345 for (; arg
; arg
= TREE_CHAIN (arg
))
1346 WALK_SUBTREE (TREE_VALUE (arg
));
1351 WALK_SUBTREE (TREE_TYPE (*tp
));
1352 WALK_SUBTREE (TYPE_DOMAIN (*tp
));
1356 WALK_SUBTREE (TYPE_MIN_VALUE (*tp
));
1357 WALK_SUBTREE (TYPE_MAX_VALUE (*tp
));
1361 WALK_SUBTREE (TREE_TYPE (*tp
));
1362 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (*tp
));
1366 if (TYPE_PTRMEMFUNC_P (*tp
))
1367 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (*tp
));
1371 my_friendly_abort (19990803);
1374 /* We didn't find what we were looking for. */
1380 /* Like walk_tree, but does not walk duplicate nodes more than
1384 walk_tree_without_duplicates (tp
, func
, data
)
1392 htab
= htab_create (37, htab_hash_pointer
, htab_eq_pointer
, NULL
);
1393 result
= walk_tree (tp
, func
, data
, htab
);
1398 /* Called from count_trees via walk_tree. */
1401 count_trees_r (tp
, walk_subtrees
, data
)
1402 tree
*tp ATTRIBUTE_UNUSED
;
1403 int *walk_subtrees ATTRIBUTE_UNUSED
;
1410 /* Debugging function for measuring the rough complexity of a tree
1418 walk_tree_without_duplicates (&t
, count_trees_r
, &n_trees
);
1422 /* Called from verify_stmt_tree via walk_tree. */
1425 verify_stmt_tree_r (tp
, walk_subtrees
, data
)
1427 int *walk_subtrees ATTRIBUTE_UNUSED
;
1431 htab_t
*statements
= (htab_t
*) data
;
1434 if (!statement_code_p (TREE_CODE (t
)))
1437 /* If this statement is already present in the hash table, then
1438 there is a circularity in the statement tree. */
1439 if (htab_find (*statements
, t
))
1440 my_friendly_abort (20000727);
1442 slot
= htab_find_slot (*statements
, t
, INSERT
);
1448 /* Debugging function to check that the statement T has not been
1449 corrupted. For now, this function simply checks that T contains no
1453 verify_stmt_tree (t
)
1457 statements
= htab_create (37, htab_hash_pointer
, htab_eq_pointer
, NULL
);
1458 walk_tree (&t
, verify_stmt_tree_r
, &statements
, NULL
);
1459 htab_delete (statements
);
1462 /* Called from find_tree via walk_tree. */
1465 find_tree_r (tp
, walk_subtrees
, data
)
1467 int *walk_subtrees ATTRIBUTE_UNUSED
;
1470 if (*tp
== (tree
) data
)
1476 /* Returns X if X appears in the tree structure rooted at T. */
1483 return walk_tree_without_duplicates (&t
, find_tree_r
, x
);
1486 /* Passed to walk_tree. Checks for the use of types with no linkage. */
1489 no_linkage_helper (tp
, walk_subtrees
, data
)
1491 int *walk_subtrees ATTRIBUTE_UNUSED
;
1492 void *data ATTRIBUTE_UNUSED
;
1497 && (CLASS_TYPE_P (t
) || TREE_CODE (t
) == ENUMERAL_TYPE
)
1498 && (decl_function_context (TYPE_MAIN_DECL (t
))
1499 || TYPE_ANONYMOUS_P (t
)))
1504 /* Check if the type T depends on a type with no linkage and if so, return
1508 no_linkage_check (t
)
1511 /* There's no point in checking linkage on template functions; we
1512 can't know their complete types. */
1513 if (processing_template_decl
)
1516 t
= walk_tree_without_duplicates (&t
, no_linkage_helper
, NULL
);
1517 if (t
!= error_mark_node
)
1522 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
1525 copy_tree_r (tp
, walk_subtrees
, data
)
1528 void *data ATTRIBUTE_UNUSED
;
1530 enum tree_code code
= TREE_CODE (*tp
);
1532 /* We make copies of most nodes. */
1533 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
))
1534 || TREE_CODE_CLASS (code
) == 'r'
1535 || TREE_CODE_CLASS (code
) == 'c'
1536 || TREE_CODE_CLASS (code
) == 's'
1537 || code
== TREE_LIST
1539 || code
== OVERLOAD
)
1541 /* Because the chain gets clobbered when we make a copy, we save it
1543 tree chain
= TREE_CHAIN (*tp
);
1545 /* Copy the node. */
1546 *tp
= copy_node (*tp
);
1548 /* Now, restore the chain, if appropriate. That will cause
1549 walk_tree to walk into the chain as well. */
1550 if (code
== PARM_DECL
|| code
== TREE_LIST
|| code
== OVERLOAD
1551 || statement_code_p (code
))
1552 TREE_CHAIN (*tp
) = chain
;
1554 /* For now, we don't update BLOCKs when we make copies. So, we
1555 have to nullify all scope-statements. */
1556 if (TREE_CODE (*tp
) == SCOPE_STMT
)
1557 SCOPE_STMT_BLOCK (*tp
) = NULL_TREE
;
1559 else if (TREE_CODE_CLASS (code
) == 't')
1560 /* There's no need to copy types, or anything beneath them. */
1566 #ifdef GATHER_STATISTICS
1567 extern int depth_reached
;
1571 print_lang_statistics ()
1573 print_search_statistics ();
1574 print_class_statistics ();
1575 #ifdef GATHER_STATISTICS
1576 fprintf (stderr
, "maximum template instantiation depth reached: %d\n",
1581 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1582 (which is an ARRAY_TYPE). This counts only elements of the top
1586 array_type_nelts_top (type
)
1589 return fold (build (PLUS_EXPR
, sizetype
,
1590 array_type_nelts (type
),
1594 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1595 (which is an ARRAY_TYPE). This one is a recursive count of all
1596 ARRAY_TYPEs that are clumped together. */
1599 array_type_nelts_total (type
)
1602 tree sz
= array_type_nelts_top (type
);
1603 type
= TREE_TYPE (type
);
1604 while (TREE_CODE (type
) == ARRAY_TYPE
)
1606 tree n
= array_type_nelts_top (type
);
1607 sz
= fold (build (MULT_EXPR
, sizetype
, sz
, n
));
1608 type
= TREE_TYPE (type
);
1613 /* Called from break_out_target_exprs via mapcar. */
1616 bot_manip (tp
, walk_subtrees
, data
)
1621 splay_tree target_remap
= ((splay_tree
) data
);
1624 if (TREE_CONSTANT (t
))
1626 /* There can't be any TARGET_EXPRs or their slot variables below
1627 this point. We used to check !TREE_SIDE_EFFECTS, but then we
1628 failed to copy an ADDR_EXPR of the slot VAR_DECL. */
1632 if (TREE_CODE (t
) == TARGET_EXPR
)
1636 if (TREE_CODE (TREE_OPERAND (t
, 1)) == AGGR_INIT_EXPR
)
1638 mark_used (TREE_OPERAND (TREE_OPERAND (TREE_OPERAND (t
, 1), 0), 0));
1640 (TREE_TYPE (t
), break_out_target_exprs (TREE_OPERAND (t
, 1)));
1644 u
= build_target_expr_with_type
1645 (break_out_target_exprs (TREE_OPERAND (t
, 1)), TREE_TYPE (t
));
1648 /* Map the old variable to the new one. */
1649 splay_tree_insert (target_remap
,
1650 (splay_tree_key
) TREE_OPERAND (t
, 0),
1651 (splay_tree_value
) TREE_OPERAND (u
, 0));
1653 /* Replace the old expression with the new version. */
1655 /* We don't have to go below this point; the recursive call to
1656 break_out_target_exprs will have handled anything below this
1661 else if (TREE_CODE (t
) == CALL_EXPR
)
1662 mark_used (TREE_OPERAND (TREE_OPERAND (t
, 0), 0));
1664 /* Make a copy of this node. */
1665 return copy_tree_r (tp
, walk_subtrees
, NULL
);
1668 /* Replace all remapped VAR_DECLs in T with their new equivalents.
1669 DATA is really a splay-tree mapping old variables to new
1673 bot_replace (t
, walk_subtrees
, data
)
1675 int *walk_subtrees ATTRIBUTE_UNUSED
;
1678 splay_tree target_remap
= ((splay_tree
) data
);
1680 if (TREE_CODE (*t
) == VAR_DECL
)
1682 splay_tree_node n
= splay_tree_lookup (target_remap
,
1683 (splay_tree_key
) *t
);
1685 *t
= (tree
) n
->value
;
1691 /* When we parse a default argument expression, we may create
1692 temporary variables via TARGET_EXPRs. When we actually use the
1693 default-argument expression, we make a copy of the expression, but
1694 we must replace the temporaries with appropriate local versions. */
1697 break_out_target_exprs (t
)
1700 static int target_remap_count
;
1701 static splay_tree target_remap
;
1703 if (!target_remap_count
++)
1704 target_remap
= splay_tree_new (splay_tree_compare_pointers
,
1705 /*splay_tree_delete_key_fn=*/NULL
,
1706 /*splay_tree_delete_value_fn=*/NULL
);
1707 walk_tree (&t
, bot_manip
, target_remap
, NULL
);
1708 walk_tree (&t
, bot_replace
, target_remap
, NULL
);
1710 if (!--target_remap_count
)
1712 splay_tree_delete (target_remap
);
1713 target_remap
= NULL
;
1719 /* Obstack used for allocating nodes in template function and variable
1722 /* Similar to `build_nt', except that we set TREE_COMPLEXITY to be the
1723 current line number. */
1726 build_min_nt
VPARAMS ((enum tree_code code
, ...))
1728 #ifndef ANSI_PROTOTYPES
1729 enum tree_code code
;
1733 register int length
;
1738 #ifndef ANSI_PROTOTYPES
1739 code
= va_arg (p
, enum tree_code
);
1742 t
= make_node (code
);
1743 length
= TREE_CODE_LENGTH (code
);
1744 TREE_COMPLEXITY (t
) = lineno
;
1746 for (i
= 0; i
< length
; i
++)
1748 tree x
= va_arg (p
, tree
);
1749 TREE_OPERAND (t
, i
) = x
;
1756 /* Similar to `build', except we set TREE_COMPLEXITY to the current
1760 build_min
VPARAMS ((enum tree_code code
, tree tt
, ...))
1762 #ifndef ANSI_PROTOTYPES
1763 enum tree_code code
;
1768 register int length
;
1773 #ifndef ANSI_PROTOTYPES
1774 code
= va_arg (p
, enum tree_code
);
1775 tt
= va_arg (p
, tree
);
1778 t
= make_node (code
);
1779 length
= TREE_CODE_LENGTH (code
);
1781 TREE_COMPLEXITY (t
) = lineno
;
1783 for (i
= 0; i
< length
; i
++)
1785 tree x
= va_arg (p
, tree
);
1786 TREE_OPERAND (t
, i
) = x
;
1793 /* Returns an INTEGER_CST (of type `int') corresponding to I.
1794 Multiple calls with the same value of I may or may not yield the
1795 same node; therefore, callers should never modify the node
1799 build_shared_int_cst (i
)
1802 static tree cache
[256];
1805 return build_int_2 (i
, 0);
1808 cache
[i
] = build_int_2 (i
, 0);
1817 if (TREE_CODE (t
) == TYPE_DECL
)
1820 return TYPE_STUB_DECL (t
);
1821 if (t
== error_mark_node
)
1824 my_friendly_abort (42);
1826 /* Stop compiler from complaining control reaches end of non-void function. */
1830 /* Return first vector element whose BINFO_TYPE is ELEM.
1831 Return 0 if ELEM is not in VEC. VEC may be NULL_TREE. */
1834 vec_binfo_member (elem
, vec
)
1840 for (i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
1841 if (same_type_p (elem
, BINFO_TYPE (TREE_VEC_ELT (vec
, i
))))
1842 return TREE_VEC_ELT (vec
, i
);
1847 /* Returns the namespace that contains DECL, whether directly or
1851 decl_namespace_context (decl
)
1856 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
1858 else if (TYPE_P (decl
))
1859 decl
= CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl
));
1861 decl
= CP_DECL_CONTEXT (decl
);
1865 /* Return truthvalue of whether T1 is the same tree structure as T2.
1866 Return 1 if they are the same.
1867 Return 0 if they are understandably different.
1868 Return -1 if either contains tree structure not understood by
1872 cp_tree_equal (t1
, t2
)
1875 register enum tree_code code1
, code2
;
1880 if (t1
== 0 || t2
== 0)
1883 code1
= TREE_CODE (t1
);
1884 code2
= TREE_CODE (t2
);
1886 if (code1
== NOP_EXPR
|| code1
== CONVERT_EXPR
|| code1
== NON_LVALUE_EXPR
)
1888 if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
|| code2
== NON_LVALUE_EXPR
)
1889 return cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
1891 return cp_tree_equal (TREE_OPERAND (t1
, 0), t2
);
1893 else if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
1894 || code2
== NON_LVALUE_EXPR
)
1895 return cp_tree_equal (t1
, TREE_OPERAND (t2
, 0));
1903 return TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
1904 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
);
1907 return REAL_VALUES_EQUAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
1910 return TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
1911 && !memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
1912 TREE_STRING_LENGTH (t1
));
1915 /* We need to do this when determining whether or not two
1916 non-type pointer to member function template arguments
1918 if (!(same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
1919 /* The first operand is RTL. */
1920 && TREE_OPERAND (t1
, 0) == TREE_OPERAND (t2
, 0)))
1922 return cp_tree_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
1925 cmp
= cp_tree_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
));
1928 cmp
= cp_tree_equal (TREE_VALUE (t1
), TREE_VALUE (t2
));
1931 return cp_tree_equal (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
1934 return cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
1937 cmp
= cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
1940 return simple_cst_list_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
1943 /* Special case: if either target is an unallocated VAR_DECL,
1944 it means that it's going to be unified with whatever the
1945 TARGET_EXPR is really supposed to initialize, so treat it
1946 as being equivalent to anything. */
1947 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
1948 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
1949 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
1950 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
1951 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
1952 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
1955 cmp
= cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
1958 return cp_tree_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
1960 case WITH_CLEANUP_EXPR
:
1961 cmp
= cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
1964 return cp_tree_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
1967 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
1968 return cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
1977 case TEMPLATE_PARM_INDEX
:
1978 return TEMPLATE_PARM_IDX (t1
) == TEMPLATE_PARM_IDX (t2
)
1979 && TEMPLATE_PARM_LEVEL (t1
) == TEMPLATE_PARM_LEVEL (t2
);
1983 if (TREE_CODE (TREE_OPERAND (t1
, 0)) != TREE_CODE (TREE_OPERAND (t2
, 0)))
1985 if (TYPE_P (TREE_OPERAND (t1
, 0)))
1986 return same_type_p (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
1990 /* Two pointer-to-members are the same if they point to the same
1991 field or function in the same class. */
1992 return (PTRMEM_CST_MEMBER (t1
) == PTRMEM_CST_MEMBER (t2
)
1993 && same_type_p (PTRMEM_CST_CLASS (t1
), PTRMEM_CST_CLASS (t2
)));
1999 switch (TREE_CODE_CLASS (code1
))
2011 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); ++i
)
2013 cmp
= cp_tree_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
2021 return same_type_p (t1
, t2
) ? 1 : 0;
2027 /* Build a wrapper around some pointer PTR so we can use it as a tree. */
2030 build_ptr_wrapper (ptr
)
2033 tree t
= make_node (WRAPPER
);
2034 WRAPPER_PTR (t
) = ptr
;
2038 /* Build a wrapper around some integer I so we can use it as a tree. */
2041 build_int_wrapper (i
)
2044 tree t
= make_node (WRAPPER
);
2045 WRAPPER_INT (t
) = i
;
2050 build_srcloc (file
, line
)
2056 t
= make_node (SRCLOC
);
2057 SRCLOC_FILE (t
) = file
;
2058 SRCLOC_LINE (t
) = line
;
2064 build_srcloc_here ()
2066 return build_srcloc (input_filename
, lineno
);
2069 /* The type of ARG when used as an lvalue. */
2075 tree type
= TREE_TYPE (arg
);
2076 if (TREE_CODE (arg
) == OVERLOAD
)
2077 type
= unknown_type_node
;
2081 /* The type of ARG for printing error messages; denote lvalues with
2088 tree type
= TREE_TYPE (arg
);
2089 if (TREE_CODE (type
) == ARRAY_TYPE
)
2091 else if (real_lvalue_p (arg
))
2092 type
= build_reference_type (lvalue_type (arg
));
2093 else if (IS_AGGR_TYPE (type
))
2094 type
= lvalue_type (arg
);
2099 /* Does FUNCTION use a variable-length argument list? */
2102 varargs_function_p (function
)
2105 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (function
));
2106 for (; parm
; parm
= TREE_CHAIN (parm
))
2107 if (TREE_VALUE (parm
) == void_type_node
)
2112 /* Returns 1 if decl is a member of a class. */
2118 const tree ctx
= DECL_CONTEXT (decl
);
2119 return (ctx
&& TYPE_P (ctx
));
2122 /* Create a placeholder for member access where we don't actually have an
2123 object that the access is against. */
2126 build_dummy_object (type
)
2129 tree decl
= build1 (NOP_EXPR
, build_pointer_type (type
), void_zero_node
);
2130 return build_indirect_ref (decl
, NULL
);
2133 /* We've gotten a reference to a member of TYPE. Return *this if appropriate,
2134 or a dummy object otherwise. If BINFOP is non-0, it is filled with the
2135 binfo path from current_class_type to TYPE, or 0. */
2138 maybe_dummy_object (type
, binfop
)
2144 if (current_class_type
2145 && get_base_distance (type
, current_class_type
, 0, binfop
) != -1)
2146 context
= current_class_type
;
2149 /* Reference from a nested class member function. */
2152 *binfop
= TYPE_BINFO (type
);
2155 if (current_class_ref
&& context
== current_class_type
)
2156 decl
= current_class_ref
;
2158 decl
= build_dummy_object (context
);
2163 /* Returns 1 if OB is a placeholder object, or a pointer to one. */
2166 is_dummy_object (ob
)
2169 if (TREE_CODE (ob
) == INDIRECT_REF
)
2170 ob
= TREE_OPERAND (ob
, 0);
2171 return (TREE_CODE (ob
) == NOP_EXPR
2172 && TREE_OPERAND (ob
, 0) == void_zero_node
);
2175 /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */
2181 t
= strip_array_types (t
);
2183 if (INTEGRAL_TYPE_P (t
))
2184 return 1; /* integral, character or enumeral type */
2185 if (FLOAT_TYPE_P (t
))
2188 return 1; /* pointer to non-member */
2189 if (TYPE_PTRMEM_P (t
))
2190 return 1; /* pointer to member object */
2191 if (TYPE_PTRMEMFUNC_P (t
))
2192 return 1; /* pointer to member function */
2194 if (! CLASS_TYPE_P (t
))
2195 return 0; /* other non-class type (reference or function) */
2196 if (CLASSTYPE_NON_POD_P (t
))
2201 /* Return a 1 if ATTR_NAME and ATTR_ARGS denote a valid C++-specific
2202 attribute for either declaration DECL or type TYPE and 0 otherwise.
2203 Plugged into valid_lang_attribute. */
2206 cp_valid_lang_attribute (attr_name
, attr_args
, decl
, type
)
2208 tree attr_args ATTRIBUTE_UNUSED
;
2209 tree decl ATTRIBUTE_UNUSED
;
2210 tree type ATTRIBUTE_UNUSED
;
2212 if (is_attribute_p ("java_interface", attr_name
))
2214 if (attr_args
!= NULL_TREE
2215 || decl
!= NULL_TREE
2216 || ! CLASS_TYPE_P (type
)
2217 || ! TYPE_FOR_JAVA (type
))
2219 error ("`java_interface' attribute can only be applied to Java class definitions");
2222 TYPE_JAVA_INTERFACE (type
) = 1;
2225 if (is_attribute_p ("com_interface", attr_name
))
2228 if (attr_args
!= NULL_TREE
2229 || decl
!= NULL_TREE
2230 || ! CLASS_TYPE_P (type
)
2231 || type
!= TYPE_MAIN_VARIANT (type
))
2233 warning ("`com_interface' attribute can only be applied to class definitions");
2239 `com_interface' is obsolete; g++ vtables are now COM-compatible by default");
2242 else if (is_attribute_p ("init_priority", attr_name
))
2244 tree initp_expr
= (attr_args
? TREE_VALUE (attr_args
): NULL_TREE
);
2248 STRIP_NOPS (initp_expr
);
2250 if (!initp_expr
|| TREE_CODE (initp_expr
) != INTEGER_CST
)
2252 error ("requested init_priority is not an integer constant");
2256 pri
= TREE_INT_CST_LOW (initp_expr
);
2258 type
= strip_array_types (type
);
2260 if (decl
== NULL_TREE
2261 || TREE_CODE (decl
) != VAR_DECL
2262 || ! TREE_STATIC (decl
)
2263 || DECL_EXTERNAL (decl
)
2264 || (TREE_CODE (type
) != RECORD_TYPE
2265 && TREE_CODE (type
) != UNION_TYPE
)
2266 /* Static objects in functions are initialized the
2267 first time control passes through that
2268 function. This is not precise enough to pin down an
2269 init_priority value, so don't allow it. */
2270 || current_function_decl
)
2272 error ("can only use init_priority attribute on file-scope definitions of objects of class type");
2276 if (pri
> MAX_INIT_PRIORITY
|| pri
<= 0)
2278 error ("requested init_priority is out of range");
2282 /* Check for init_priorities that are reserved for
2283 language and runtime support implementations.*/
2284 if (pri
<= MAX_RESERVED_INIT_PRIORITY
)
2287 ("requested init_priority is reserved for internal use");
2290 if (SUPPORTS_INIT_PRIORITY
)
2292 DECL_INIT_PRIORITY (decl
) = pri
;
2297 error ("init_priority attribute is not supported on this platform");
2305 /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the
2306 thing pointed to by the constant. */
2309 make_ptrmem_cst (type
, member
)
2313 tree ptrmem_cst
= make_node (PTRMEM_CST
);
2314 /* If would seem a great convenience if make_node would set
2315 TREE_CONSTANT for things of class `c', but it does not. */
2316 TREE_CONSTANT (ptrmem_cst
) = 1;
2317 TREE_TYPE (ptrmem_cst
) = type
;
2318 PTRMEM_CST_MEMBER (ptrmem_cst
) = member
;
2322 /* Initialize tree.c. */
2327 make_lang_type_fn
= cp_make_lang_type
;
2328 lang_unsave
= cp_unsave
;
2329 lang_statement_code_p
= cp_statement_code_p
;
2330 lang_set_decl_assembler_name
= mangle_decl
;
2331 list_hash_table
= htab_create (31, list_hash
, list_hash_eq
, NULL
);
2332 ggc_add_root (&list_hash_table
, 1,
2333 sizeof (list_hash_table
),
2334 mark_tree_hashtable
);
2337 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
2338 information indicating to what new SAVE_EXPR this one should be
2339 mapped, use that one. Otherwise, create a new node and enter it in
2340 ST. FN is the function into which the copy will be placed. */
2343 remap_save_expr (tp
, st
, fn
, walk_subtrees
)
2351 /* See if we already encountered this SAVE_EXPR. */
2352 n
= splay_tree_lookup (st
, (splay_tree_key
) *tp
);
2354 /* If we didn't already remap this SAVE_EXPR, do so now. */
2357 tree t
= copy_node (*tp
);
2359 /* The SAVE_EXPR is now part of the function into which we
2360 are inlining this body. */
2361 SAVE_EXPR_CONTEXT (t
) = fn
;
2362 /* And we haven't evaluated it yet. */
2363 SAVE_EXPR_RTL (t
) = NULL_RTX
;
2364 /* Remember this SAVE_EXPR. */
2365 n
= splay_tree_insert (st
,
2366 (splay_tree_key
) *tp
,
2367 (splay_tree_value
) t
);
2370 /* We've already walked into this SAVE_EXPR, so we needn't do it
2374 /* Replace this SAVE_EXPR with the copy. */
2375 *tp
= (tree
) n
->value
;
2378 /* Called via walk_tree. If *TP points to a DECL_STMT for a local
2379 declaration, copies the declaration and enters it in the splay_tree
2380 pointed to by DATA (which is really a `splay_tree *'). */
2383 mark_local_for_remap_r (tp
, walk_subtrees
, data
)
2385 int *walk_subtrees ATTRIBUTE_UNUSED
;
2389 splay_tree st
= (splay_tree
) data
;
2393 if (TREE_CODE (t
) == DECL_STMT
2394 && nonstatic_local_decl_p (DECL_STMT_DECL (t
)))
2395 decl
= DECL_STMT_DECL (t
);
2396 else if (TREE_CODE (t
) == LABEL_STMT
)
2397 decl
= LABEL_STMT_LABEL (t
);
2398 else if (TREE_CODE (t
) == TARGET_EXPR
2399 && nonstatic_local_decl_p (TREE_OPERAND (t
, 0)))
2400 decl
= TREE_OPERAND (t
, 0);
2401 else if (TREE_CODE (t
) == CASE_LABEL
)
2402 decl
= CASE_LABEL_DECL (t
);
2411 copy
= copy_decl_for_inlining (decl
,
2412 DECL_CONTEXT (decl
),
2413 DECL_CONTEXT (decl
));
2415 /* Remember the copy. */
2416 splay_tree_insert (st
,
2417 (splay_tree_key
) decl
,
2418 (splay_tree_value
) copy
);
2424 /* Called via walk_tree when an expression is unsaved. Using the
2425 splay_tree pointed to by ST (which is really a `splay_tree'),
2426 remaps all local declarations to appropriate replacements. */
2429 cp_unsave_r (tp
, walk_subtrees
, data
)
2434 splay_tree st
= (splay_tree
) data
;
2437 /* Only a local declaration (variable or label). */
2438 if (nonstatic_local_decl_p (*tp
))
2440 /* Lookup the declaration. */
2441 n
= splay_tree_lookup (st
, (splay_tree_key
) *tp
);
2443 /* If it's there, remap it. */
2445 *tp
= (tree
) n
->value
;
2447 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
2448 remap_save_expr (tp
, st
, current_function_decl
, walk_subtrees
);
2451 copy_tree_r (tp
, walk_subtrees
, NULL
);
2453 /* Do whatever unsaving is required. */
2454 unsave_expr_1 (*tp
);
2457 /* Keep iterating. */
2461 /* Called by unsave_expr_now whenever an expression (*TP) needs to be
2470 /* Create a splay-tree to map old local variable declarations to new
2472 st
= splay_tree_new (splay_tree_compare_pointers
, NULL
, NULL
);
2474 /* Walk the tree once figuring out what needs to be remapped. */
2475 walk_tree (tp
, mark_local_for_remap_r
, st
, NULL
);
2477 /* Walk the tree again, copying, remapping, and unsaving. */
2478 walk_tree (tp
, cp_unsave_r
, st
, NULL
);
2481 splay_tree_delete (st
);
2484 /* Returns the kind of special function that DECL (a FUNCTION_DECL)
2485 is. Note that this sfk_none is zero, so this function can be used
2486 as a predicate to test whether or not DECL is a special function. */
2488 special_function_kind
2489 special_function_p (decl
)
2492 /* Rather than doing all this stuff with magic names, we should
2493 probably have a field of type `special_function_kind' in
2494 DECL_LANG_SPECIFIC. */
2495 if (DECL_COPY_CONSTRUCTOR_P (decl
))
2496 return sfk_copy_constructor
;
2497 if (DECL_CONSTRUCTOR_P (decl
))
2498 return sfk_constructor
;
2499 if (DECL_OVERLOADED_OPERATOR_P (decl
) == NOP_EXPR
)
2500 return sfk_assignment_operator
;
2501 if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl
))
2502 return sfk_destructor
;
2503 if (DECL_COMPLETE_DESTRUCTOR_P (decl
))
2504 return sfk_complete_destructor
;
2505 if (DECL_BASE_DESTRUCTOR_P (decl
))
2506 return sfk_base_destructor
;
2507 if (DECL_DELETING_DESTRUCTOR_P (decl
))
2508 return sfk_deleting_destructor
;
2509 if (DECL_CONV_FN_P (decl
))
2510 return sfk_conversion
;
2515 /* Returns non-zero if TYPE is a character type, including wchar_t. */
2521 return (same_type_p (type
, char_type_node
)
2522 || same_type_p (type
, unsigned_char_type_node
)
2523 || same_type_p (type
, signed_char_type_node
)
2524 || same_type_p (type
, wchar_type_node
));
2527 /* Returns the kind of linkage associated with the indicated DECL. Th
2528 value returned is as specified by the language standard; it is
2529 independent of implementation details regarding template
2530 instantiation, etc. For example, it is possible that a declaration
2531 to which this function assigns external linkage would not show up
2532 as a global symbol when you run `nm' on the resulting object file. */
2538 /* This function doesn't attempt to calculate the linkage from first
2539 principles as given in [basic.link]. Instead, it makes use of
2540 the fact that we have already set TREE_PUBLIC appropriately, and
2541 then handles a few special cases. Ideally, we would calculate
2542 linkage first, and then transform that into a concrete
2545 /* Things that don't have names have no linkage. */
2546 if (!DECL_NAME (decl
))
2549 /* Things that are TREE_PUBLIC have external linkage. */
2550 if (TREE_PUBLIC (decl
))
2553 /* Some things that are not TREE_PUBLIC have external linkage, too.
2554 For example, on targets that don't have weak symbols, we make all
2555 template instantiations have internal linkage (in the object
2556 file), but the symbols should still be treated as having external
2557 linkage from the point of view of the language. */
2558 if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
2561 /* Things in local scope do not have linkage, if they don't have
2563 if (decl_function_context (decl
))
2566 /* Everything else has internal linkage. */