1 /* Language-dependent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 88, 92-98, 1999 Free Software Foundation, Inc.
3 Hacked by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
31 #include "insn-config.h"
32 #include "integrate.h"
34 static tree bot_manip
PROTO((tree
*, int *, void *));
35 static tree bot_replace
PROTO((tree
*, int *, void *));
36 static tree build_cplus_array_type_1
PROTO((tree
, tree
));
37 static void list_hash_add
PROTO((int, tree
));
38 static int list_hash
PROTO((tree
, tree
, tree
));
39 static tree list_hash_lookup
PROTO((int, tree
, tree
, tree
));
40 static void propagate_binfo_offsets
PROTO((tree
, tree
));
41 static cp_lvalue_kind lvalue_p_1
PROTO((tree
, int));
42 static tree no_linkage_helper
PROTO((tree
*, int *, void *));
43 static tree build_srcloc
PROTO((char *, int));
44 static void mark_list_hash
PROTO ((void *));
45 static int statement_code_p
PROTO((enum tree_code
));
46 static tree mark_local_for_remap_r
PROTO((tree
*, int *, void *));
47 static tree cp_unsave_r
PROTO ((tree
*, int *, void *));
48 static void cp_unsave
PROTO((tree
*));
49 static tree build_target_expr
PROTO((tree
, tree
));
51 #define CEIL(x,y) (((x) + (y) - 1) / (y))
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
&& flag_this_is_variable
<= 0)
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
:
84 return lvalue_p_1 (TREE_OPERAND (ref
, 0),
85 treat_class_rvalues_as_lvalues
);
88 op1_lvalue_kind
= lvalue_p_1 (TREE_OPERAND (ref
, 0),
89 treat_class_rvalues_as_lvalues
);
91 /* The "field" can be a FUNCTION_DECL or an OVERLOAD in some
93 && TREE_CODE (TREE_OPERAND (ref
, 1)) == FIELD_DECL
94 && DECL_C_BIT_FIELD (TREE_OPERAND (ref
, 1)))
96 /* Clear the ordinary bit. If this object was a class
97 rvalue we want to preserve that information. */
98 op1_lvalue_kind
&= ~clk_ordinary
;
99 /* The lvalue is for a btifield. */
100 op1_lvalue_kind
|= clk_bitfield
;
102 return op1_lvalue_kind
;
108 if (TREE_READONLY (ref
) && ! TREE_STATIC (ref
)
109 && DECL_LANG_SPECIFIC (ref
)
110 && DECL_IN_AGGR_P (ref
))
116 if (TREE_CODE (TREE_TYPE (ref
)) != METHOD_TYPE
)
120 /* A currently unresolved scope ref. */
122 my_friendly_abort (103);
124 if (TREE_CODE (TREE_OPERAND (ref
, 1)) == FUNCTION_DECL
)
129 op1_lvalue_kind
= lvalue_p_1 (TREE_OPERAND (ref
, 0),
130 treat_class_rvalues_as_lvalues
);
131 op2_lvalue_kind
= lvalue_p_1 (TREE_OPERAND (ref
, 1),
132 treat_class_rvalues_as_lvalues
);
136 op1_lvalue_kind
= lvalue_p_1 (TREE_OPERAND (ref
, 1),
137 treat_class_rvalues_as_lvalues
);
138 op2_lvalue_kind
= lvalue_p_1 (TREE_OPERAND (ref
, 2),
139 treat_class_rvalues_as_lvalues
);
146 return lvalue_p_1 (TREE_OPERAND (ref
, 1),
147 treat_class_rvalues_as_lvalues
);
150 return treat_class_rvalues_as_lvalues
? clk_class
: clk_none
;
154 return ((treat_class_rvalues_as_lvalues
155 && IS_AGGR_TYPE (TREE_TYPE (ref
)))
156 ? clk_class
: clk_none
);
159 /* All functions (except non-static-member functions) are
161 return (DECL_NONSTATIC_MEMBER_FUNCTION_P (ref
)
162 ? clk_none
: clk_ordinary
);
168 /* If one operand is not an lvalue at all, then this expression is
170 if (!op1_lvalue_kind
|| !op2_lvalue_kind
)
173 /* Otherwise, it's an lvalue, and it has all the odd properties
174 contributed by either operand. */
175 op1_lvalue_kind
= op1_lvalue_kind
| op2_lvalue_kind
;
176 /* It's not an ordinary lvalue if it involves either a bit-field or
178 if ((op1_lvalue_kind
& ~clk_ordinary
) != clk_none
)
179 op1_lvalue_kind
&= ~clk_ordinary
;
180 return op1_lvalue_kind
;
183 /* If REF is an lvalue, returns the kind of lvalue that REF is.
184 Otherwise, returns clk_none. Lvalues can be assigned, unless they
185 have TREE_READONLY, or unless they are FUNCTION_DECLs. Lvalues can
186 have their address taken, unless they have DECL_REGISTER. */
192 return lvalue_p_1 (ref
, /*treat_class_rvalues_as_lvalues=*/0);
195 /* This differs from real_lvalue_p in that class rvalues are
196 considered lvalues. */
203 (lvalue_p_1 (ref
, /*treat_class_rvalues_as_lvalues=*/1) != clk_none
);
206 /* Return nonzero if REF is an lvalue valid for this language;
207 otherwise, print an error message and return zero. */
210 lvalue_or_else (ref
, string
)
214 int win
= lvalue_p (ref
);
216 error ("non-lvalue in %s", string
);
220 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
223 build_target_expr (decl
, value
)
229 t
= build (TARGET_EXPR
, TREE_TYPE (decl
), decl
, value
,
230 maybe_build_cleanup (decl
), NULL_TREE
);
231 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
232 ignore the TARGET_EXPR. If there really turn out to be no
233 side-effects, then the optimizer should be able to get rid of
234 whatever code is generated anyhow. */
235 TREE_SIDE_EFFECTS (t
) = 1;
240 /* INIT is a CALL_EXPR which needs info about its target.
241 TYPE is the type that this initialization should appear to have.
243 Build an encapsulation of the initialization to perform
244 and return it so that it can be processed by language-independent
245 and language-specific expression expanders. */
248 build_cplus_new (type
, init
)
256 /* Make sure that we're not trying to create an instance of an
258 abstract_virtuals_error (NULL_TREE
, type
);
260 if (TREE_CODE (init
) != CALL_EXPR
&& TREE_CODE (init
) != AGGR_INIT_EXPR
)
261 return convert (type
, init
);
263 slot
= build (VAR_DECL
, type
);
264 DECL_ARTIFICIAL (slot
) = 1;
265 DECL_CONTEXT (slot
) = current_function_decl
;
266 layout_decl (slot
, 0);
268 /* We split the CALL_EXPR into its function and its arguments here.
269 Then, in expand_expr, we put them back together. The reason for
270 this is that this expression might be a default argument
271 expression. In that case, we need a new temporary every time the
272 expression is used. That's what break_out_target_exprs does; it
273 replaces every AGGR_INIT_EXPR with a copy that uses a fresh
274 temporary slot. Then, expand_expr builds up a call-expression
275 using the new slot. */
276 fn
= TREE_OPERAND (init
, 0);
277 rval
= build (AGGR_INIT_EXPR
, type
, fn
, TREE_OPERAND (init
, 1), slot
);
278 TREE_SIDE_EFFECTS (rval
) = 1;
279 AGGR_INIT_VIA_CTOR_P (rval
)
280 = (TREE_CODE (fn
) == ADDR_EXPR
281 && TREE_CODE (TREE_OPERAND (fn
, 0)) == FUNCTION_DECL
282 && DECL_CONSTRUCTOR_P (TREE_OPERAND (fn
, 0)));
283 rval
= build_target_expr (slot
, rval
);
288 /* Buidl a TARGET_EXPR using INIT to initialize a new temporary of the
292 build_target_expr_with_type (init
, type
)
299 slot
= build (VAR_DECL
, type
);
300 DECL_ARTIFICIAL (slot
) = 1;
301 DECL_CONTEXT (slot
) = current_function_decl
;
302 layout_decl (slot
, 0);
303 rval
= build_target_expr (slot
, init
);
308 /* Like build_target_expr_with_type, but use the type of INIT. */
311 get_target_expr (init
)
314 return build_target_expr_with_type (init
, TREE_TYPE (init
));
317 /* Recursively search EXP for CALL_EXPRs that need cleanups and replace
318 these CALL_EXPRs with tree nodes that will perform the cleanups. */
321 break_out_cleanups (exp
)
326 if (TREE_CODE (tmp
) == CALL_EXPR
327 && TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (tmp
)))
328 return build_cplus_new (TREE_TYPE (tmp
), tmp
);
330 while (TREE_CODE (tmp
) == NOP_EXPR
331 || TREE_CODE (tmp
) == CONVERT_EXPR
332 || TREE_CODE (tmp
) == NON_LVALUE_EXPR
)
334 if (TREE_CODE (TREE_OPERAND (tmp
, 0)) == CALL_EXPR
335 && TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (TREE_OPERAND (tmp
, 0))))
337 TREE_OPERAND (tmp
, 0)
338 = build_cplus_new (TREE_TYPE (TREE_OPERAND (tmp
, 0)),
339 TREE_OPERAND (tmp
, 0));
343 tmp
= TREE_OPERAND (tmp
, 0);
348 /* Recursively perform a preorder search EXP for CALL_EXPRs, making
349 copies where they are found. Returns a deep copy all nodes transitively
350 containing CALL_EXPRs. */
353 break_out_calls (exp
)
356 register tree t1
, t2
= NULL_TREE
;
357 register enum tree_code code
;
358 register int changed
= 0;
361 if (exp
== NULL_TREE
)
364 code
= TREE_CODE (exp
);
366 if (code
== CALL_EXPR
)
367 return copy_node (exp
);
369 /* Don't try and defeat a save_expr, as it should only be done once. */
370 if (code
== SAVE_EXPR
)
373 switch (TREE_CODE_CLASS (code
))
378 case 'c': /* a constant */
379 case 't': /* a type node */
380 case 'x': /* something random, like an identifier or an ERROR_MARK. */
383 case 'd': /* A decl node */
384 #if 0 /* This is bogus. jason 9/21/94 */
386 t1
= break_out_calls (DECL_INITIAL (exp
));
387 if (t1
!= DECL_INITIAL (exp
))
389 exp
= copy_node (exp
);
390 DECL_INITIAL (exp
) = t1
;
395 case 'b': /* A block node */
397 /* Don't know how to handle these correctly yet. Must do a
398 break_out_calls on all DECL_INITIAL values for local variables,
399 and also break_out_calls on all sub-blocks and sub-statements. */
404 case 'e': /* an expression */
405 case 'r': /* a reference */
406 case 's': /* an expression with side effects */
407 for (i
= tree_code_length
[(int) code
] - 1; i
>= 0; i
--)
409 t1
= break_out_calls (TREE_OPERAND (exp
, i
));
410 if (t1
!= TREE_OPERAND (exp
, i
))
412 exp
= copy_node (exp
);
413 TREE_OPERAND (exp
, i
) = t1
;
418 case '<': /* a comparison expression */
419 case '2': /* a binary arithmetic expression */
420 t2
= break_out_calls (TREE_OPERAND (exp
, 1));
421 if (t2
!= TREE_OPERAND (exp
, 1))
423 case '1': /* a unary arithmetic expression */
424 t1
= break_out_calls (TREE_OPERAND (exp
, 0));
425 if (t1
!= TREE_OPERAND (exp
, 0))
429 if (tree_code_length
[(int) code
] == 1)
430 return build1 (code
, TREE_TYPE (exp
), t1
);
432 return build (code
, TREE_TYPE (exp
), t1
, t2
);
439 extern struct obstack permanent_obstack
;
441 /* Here is how primitive or already-canonicalized types' hash
442 codes are made. MUST BE CONSISTENT WITH tree.c !!! */
443 #define TYPE_HASH(TYPE) ((HOST_WIDE_INT) (TYPE) & 0777777)
445 /* Construct, lay out and return the type of methods belonging to class
446 BASETYPE and whose arguments are described by ARGTYPES and whose values
447 are described by RETTYPE. If each type exists already, reuse it. */
450 build_cplus_method_type (basetype
, rettype
, argtypes
)
451 tree basetype
, rettype
, argtypes
;
457 /* Make a node of the sort we want. */
458 t
= make_node (METHOD_TYPE
);
460 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
461 TREE_TYPE (t
) = rettype
;
462 ptype
= build_pointer_type (basetype
);
464 /* The actual arglist for this function includes a "hidden" argument
465 which is "this". Put it into the list of argument types. Make
466 sure that the new argument list is allocated on the same obstack
468 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
469 TYPE_ARG_TYPES (t
) = argtypes
;
470 TREE_SIDE_EFFECTS (argtypes
) = 1; /* Mark first argtype as "artificial". */
472 /* If we already have such a type, use the old one and free this one.
473 Note that it also frees up the above cons cell if found. */
474 hashcode
= TYPE_HASH (basetype
) + TYPE_HASH (rettype
) +
475 type_hash_list (argtypes
);
477 t
= type_hash_canon (hashcode
, t
);
479 if (TYPE_SIZE (t
) == 0)
486 build_cplus_array_type_1 (elt_type
, index_type
)
492 if (elt_type
== error_mark_node
|| index_type
== error_mark_node
)
493 return error_mark_node
;
495 if (processing_template_decl
496 || uses_template_parms (elt_type
)
497 || uses_template_parms (index_type
))
499 t
= make_node (ARRAY_TYPE
);
500 TREE_TYPE (t
) = elt_type
;
501 TYPE_DOMAIN (t
) = index_type
;
504 t
= build_array_type (elt_type
, index_type
);
506 /* Push these needs up so that initialization takes place
508 TYPE_NEEDS_CONSTRUCTING (t
)
509 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (elt_type
));
510 TYPE_NEEDS_DESTRUCTOR (t
)
511 = TYPE_NEEDS_DESTRUCTOR (TYPE_MAIN_VARIANT (elt_type
));
516 build_cplus_array_type (elt_type
, index_type
)
521 int type_quals
= CP_TYPE_QUALS (elt_type
);
523 elt_type
= TYPE_MAIN_VARIANT (elt_type
);
525 t
= build_cplus_array_type_1 (elt_type
, index_type
);
527 if (type_quals
!= TYPE_UNQUALIFIED
)
528 t
= cp_build_qualified_type (t
, type_quals
);
533 /* Make a variant of TYPE, qualified with the TYPE_QUALS. Handles
534 arrays correctly. In particular, if TYPE is an array of T's, and
535 TYPE_QUALS is non-empty, returns an array of qualified T's. If
536 at attempt is made to qualify a type illegally, and COMPLAIN is
537 non-zero, an error is issued. If COMPLAIN is zero, error_mark_node
541 cp_build_qualified_type_real (type
, type_quals
, complain
)
548 if (type
== error_mark_node
)
551 if (type_quals
== TYPE_QUALS (type
))
554 /* A restrict-qualified pointer type must be a pointer (or reference)
555 to object or incomplete type. */
556 if ((type_quals
& TYPE_QUAL_RESTRICT
)
557 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
558 && (!POINTER_TYPE_P (type
)
559 || TYPE_PTRMEM_P (type
)
560 || TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
))
563 cp_error ("`%T' cannot be `restrict'-qualified", type
);
565 return error_mark_node
;
567 type_quals
&= ~TYPE_QUAL_RESTRICT
;
570 if (type_quals
!= TYPE_UNQUALIFIED
571 && TREE_CODE (type
) == FUNCTION_TYPE
)
574 cp_error ("`%T' cannot be `const'-, `volatile'-, or `restrict'-qualified", type
);
576 return error_mark_node
;
577 type_quals
= TYPE_UNQUALIFIED
;
579 else if (TREE_CODE (type
) == ARRAY_TYPE
)
581 /* In C++, the qualification really applies to the array element
582 type. Obtain the appropriately qualified element type. */
585 = cp_build_qualified_type_real (TREE_TYPE (type
),
589 if (element_type
== error_mark_node
)
590 return error_mark_node
;
592 /* See if we already have an identically qualified type. */
593 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
594 if (CP_TYPE_QUALS (t
) == type_quals
)
597 /* If we didn't already have it, create it now. */
600 /* Make a new array type, just like the old one, but with the
601 appropriately qualified element type. */
602 t
= build_type_copy (type
);
603 TREE_TYPE (t
) = element_type
;
606 /* Even if we already had this variant, we update
607 TYPE_NEEDS_CONSTRUCTING and TYPE_NEEDS_DESTRUCTOR in case
608 they changed since the variant was originally created.
610 This seems hokey; if there is some way to use a previous
611 variant *without* coming through here,
612 TYPE_NEEDS_CONSTRUCTING will never be updated. */
613 TYPE_NEEDS_CONSTRUCTING (t
)
614 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (element_type
));
615 TYPE_NEEDS_DESTRUCTOR (t
)
616 = TYPE_NEEDS_DESTRUCTOR (TYPE_MAIN_VARIANT (element_type
));
619 else if (TYPE_PTRMEMFUNC_P (type
))
621 /* For a pointer-to-member type, we can't just return a
622 cv-qualified version of the RECORD_TYPE. If we do, we
623 haven't change the field that contains the actual pointer to
624 a method, and so TYPE_PTRMEMFUNC_FN_TYPE will be wrong. */
627 t
= TYPE_PTRMEMFUNC_FN_TYPE (type
);
628 t
= cp_build_qualified_type_real (t
, type_quals
, complain
);
629 return build_ptrmemfunc_type (t
);
632 /* Retrieve (or create) the appropriately qualified variant. */
633 result
= build_qualified_type (type
, type_quals
);
635 /* If this was a pointer-to-method type, and we just made a copy,
636 then we need to clear the cached associated
637 pointer-to-member-function type; it is not valid for the new
640 && TREE_CODE (type
) == POINTER_TYPE
641 && TREE_CODE (TREE_TYPE (type
)) == METHOD_TYPE
)
642 TYPE_SET_PTRMEMFUNC_TYPE (result
, NULL_TREE
);
647 /* Returns the canonical version of TYPE. In other words, if TYPE is
648 a typedef, returns the underlying type. The cv-qualification of
649 the type returned matches the type input; they will always be
653 canonical_type_variant (t
)
656 return cp_build_qualified_type (TYPE_MAIN_VARIANT (t
), CP_TYPE_QUALS (t
));
659 /* Add OFFSET to all base types of T.
661 OFFSET, which is a type offset, is number of bytes.
663 Note that we don't have to worry about having two paths to the
664 same base type, since this type owns its association list. */
667 propagate_binfo_offsets (binfo
, offset
)
671 tree binfos
= BINFO_BASETYPES (binfo
);
672 int i
, n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
676 for (i
= 0; i
< n_baselinks
; ++i
)
680 /* Figure out which base we're looking at. */
681 base_binfo
= TREE_VEC_ELT (binfos
, i
);
683 /* Skip virtual bases. Their BINFO_OFFSET doesn't matter
684 since they are always reached by using offsets looked up
686 if (TREE_VIA_VIRTUAL (base_binfo
))
689 /* Whatever offset this class used to have in its immediate
690 derived class, it is now at OFFSET more bytes in its
691 final derived class, since the immediate derived class is
692 already at the indicated OFFSET. */
693 BINFO_OFFSET (base_binfo
)
694 = size_binop (PLUS_EXPR
, BINFO_OFFSET (base_binfo
), offset
);
696 propagate_binfo_offsets (base_binfo
, offset
);
701 /* This algorithm, used for the old ABI, is neither simple, nor
702 general. For example, it mishandles the case of:
708 if B is at offset zero in C, but A is not in offset zero in
709 B. In that case, it sets the BINFO_OFFSET for A to zero.
710 (This sitution arises in the new ABI if B has virtual
711 functions, but A does not.) Rather than change this
712 algorithm, and risking breaking the old ABI, it is preserved
714 for (i
= 0; i
< n_baselinks
; /* note increment is done in the
717 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
719 if (TREE_VIA_VIRTUAL (base_binfo
))
724 tree delta
= NULL_TREE
;
726 for (j
= i
+1; j
< n_baselinks
; j
++)
727 if (! TREE_VIA_VIRTUAL (TREE_VEC_ELT (binfos
, j
)))
729 /* The next basetype offset must take into account
730 the space between the classes, not just the
731 size of each class. */
732 delta
= size_binop (MINUS_EXPR
,
733 BINFO_OFFSET (TREE_VEC_ELT (binfos
,
735 BINFO_OFFSET (base_binfo
));
739 BINFO_OFFSET (base_binfo
) = offset
;
741 propagate_binfo_offsets (base_binfo
, offset
);
743 /* Go to our next class that counts for offset
747 offset
= size_binop (PLUS_EXPR
, offset
, delta
);
753 /* Makes new binfos for the indirect bases under BINFO, and updates
754 BINFO_OFFSET for them and their bases. */
757 unshare_base_binfos (binfo
)
760 tree binfos
= BINFO_BASETYPES (binfo
);
764 if (binfos
== NULL_TREE
)
767 /* Now unshare the structure beneath BINFO. */
768 for (j
= TREE_VEC_LENGTH (binfos
)-1;
771 tree base_binfo
= TREE_VEC_ELT (binfos
, j
);
772 new_binfo
= TREE_VEC_ELT (binfos
, j
)
773 = make_binfo (BINFO_OFFSET (base_binfo
),
775 BINFO_VTABLE (base_binfo
),
776 BINFO_VIRTUALS (base_binfo
));
777 TREE_VIA_PUBLIC (new_binfo
) = TREE_VIA_PUBLIC (base_binfo
);
778 TREE_VIA_PROTECTED (new_binfo
) = TREE_VIA_PROTECTED (base_binfo
);
779 TREE_VIA_VIRTUAL (new_binfo
) = TREE_VIA_VIRTUAL (base_binfo
);
780 BINFO_INHERITANCE_CHAIN (new_binfo
) = binfo
;
781 unshare_base_binfos (new_binfo
);
785 /* Finish the work of layout_record, now taking virtual bases into account.
786 Also compute the actual offsets that our base classes will have.
787 This must be performed after the fields are laid out, since virtual
788 baseclasses must lay down at the end of the record.
790 Returns the maximum number of virtual functions any of the
791 baseclasses provide. */
794 layout_basetypes (rec
, max
)
798 tree binfos
= TYPE_BINFO_BASETYPES (rec
);
799 int i
, n_baseclasses
= CLASSTYPE_N_BASECLASSES (rec
);
803 unsigned int record_align
= MAX (BITS_PER_UNIT
, TYPE_ALIGN (rec
));
804 unsigned int desired_align
;
806 /* Record size so far is CONST_SIZE bits, where CONST_SIZE is an integer. */
807 register unsigned int const_size
= 0;
808 unsigned int nonvirtual_const_size
;
810 #ifdef STRUCTURE_SIZE_BOUNDARY
811 /* Packed structures don't need to have minimum size. */
812 if (! TYPE_PACKED (rec
))
813 record_align
= MAX (record_align
, STRUCTURE_SIZE_BOUNDARY
);
816 /* Get all the virtual base types that this type uses. The
817 TREE_VALUE slot holds the virtual baseclass type. Note that
818 get_vbase_types makes copies of the virtual base BINFOs, so that
819 the vbase_types are unshared. */
820 vbase_types
= CLASSTYPE_VBASECLASSES (rec
);
822 my_friendly_assert (TREE_CODE (TYPE_SIZE (rec
)) == INTEGER_CST
, 19970302);
823 const_size
= TREE_INT_CST_LOW (TYPE_SIZE (rec
));
825 nonvirtual_const_size
= const_size
;
829 tree basetype
= BINFO_TYPE (vbase_types
);
832 desired_align
= TYPE_ALIGN (basetype
);
833 record_align
= MAX (record_align
, desired_align
);
836 offset
= integer_zero_node
;
839 /* Give each virtual base type the alignment it wants. */
840 const_size
= CEIL (const_size
, desired_align
) * desired_align
;
841 offset
= size_int (CEIL (const_size
, BITS_PER_UNIT
));
844 if (CLASSTYPE_VSIZE (basetype
) > max
)
845 max
= CLASSTYPE_VSIZE (basetype
);
846 BINFO_OFFSET (vbase_types
) = offset
;
848 /* Every virtual baseclass takes a least a UNIT, so that we can
849 take it's address and get something different for each base. */
850 const_size
+= MAX (BITS_PER_UNIT
,
851 TREE_INT_CST_LOW (CLASSTYPE_SIZE (basetype
)));
853 vbase_types
= TREE_CHAIN (vbase_types
);
858 /* Because a virtual base might take a single byte above,
859 we have to re-adjust the total size to make sure it is
860 a multiple of the alignment. */
861 /* Give the whole object the alignment it wants. */
862 const_size
= CEIL (const_size
, record_align
) * record_align
;
865 /* Set the alignment in the complete type. We don't set CLASSTYPE_ALIGN
866 here, as that is for this class, without any virtual base classes. */
867 TYPE_ALIGN (rec
) = record_align
;
868 if (const_size
!= nonvirtual_const_size
)
870 TYPE_SIZE (rec
) = size_int (const_size
);
871 TYPE_SIZE_UNIT (rec
) = size_binop (FLOOR_DIV_EXPR
, TYPE_SIZE (rec
),
872 size_int (BITS_PER_UNIT
));
875 /* Now propagate offset information throughout the lattice.
876 Simultaneously, remove the temporary FIELD_DECLS we created in
877 build_base_fields to refer to base types. */
878 field
= &TYPE_FIELDS (rec
);
879 if (TYPE_VFIELD (rec
) == *field
)
881 /* If this class did not have a primary base, we create a
882 virtual function table pointer. It will be the first thing
883 in the class, under the new ABI. Skip it; the base fields
885 my_friendly_assert (flag_new_abi
886 && !CLASSTYPE_HAS_PRIMARY_BASE_P (rec
),
888 field
= &TREE_CHAIN (*field
);
891 for (i
= 0; i
< n_baseclasses
; i
++)
893 register tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
894 register tree basetype
= BINFO_TYPE (base_binfo
);
896 if (TREE_VIA_VIRTUAL (base_binfo
))
899 my_friendly_assert (TREE_TYPE (*field
) == basetype
, 23897);
901 if (get_base_distance (basetype
, rec
, 0, (tree
*)0) == -2)
902 cp_warning ("direct base `%T' inaccessible in `%T' due to ambiguity",
905 BINFO_OFFSET (base_binfo
)
906 = size_int (CEIL (TREE_INT_CST_LOW (DECL_FIELD_BITPOS (*field
)),
908 propagate_binfo_offsets (base_binfo
, BINFO_OFFSET (base_binfo
));
910 /* Remove this field. */
911 *field
= TREE_CHAIN (*field
);
914 for (vbase_types
= CLASSTYPE_VBASECLASSES (rec
); vbase_types
;
915 vbase_types
= TREE_CHAIN (vbase_types
))
917 BINFO_INHERITANCE_CHAIN (vbase_types
) = TYPE_BINFO (rec
);
918 unshare_base_binfos (vbase_types
);
919 propagate_binfo_offsets (vbase_types
, BINFO_OFFSET (vbase_types
));
923 tree basetype
= BINFO_TYPE (vbase_types
);
924 if (get_base_distance (basetype
, rec
, 0, (tree
*)0) == -2)
925 cp_warning ("virtual base `%T' inaccessible in `%T' due to ambiguity",
934 /* Hashing of lists so that we don't make duplicates.
935 The entry point is `list_hash_canon'. */
937 /* Each hash table slot is a bucket containing a chain
938 of these structures. */
942 struct list_hash
*next
; /* Next structure in the bucket. */
943 int hashcode
; /* Hash code of this list. */
944 tree list
; /* The list recorded here. */
947 /* Now here is the hash table. When recording a list, it is added
948 to the slot whose index is the hash code mod the table size.
949 Note that the hash table is used for several kinds of lists.
950 While all these live in the same table, they are completely independent,
951 and the hash code is computed differently for each of these. */
953 #define TYPE_HASH_SIZE 59
954 static struct list_hash
*list_hash_table
[TYPE_HASH_SIZE
];
956 /* Compute a hash code for a list (chain of TREE_LIST nodes
957 with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the
958 TREE_COMMON slots), by adding the hash codes of the individual entries. */
961 list_hash (purpose
, value
, chain
)
962 tree purpose
, value
, chain
;
964 register int hashcode
= 0;
967 hashcode
+= TYPE_HASH (chain
);
970 hashcode
+= TYPE_HASH (value
);
974 hashcode
+= TYPE_HASH (purpose
);
980 /* Look in the type hash table for a type isomorphic to TYPE.
981 If one is found, return it. Otherwise return 0. */
984 list_hash_lookup (hashcode
, purpose
, value
, chain
)
986 tree purpose
, value
, chain
;
988 register struct list_hash
*h
;
990 for (h
= list_hash_table
[hashcode
% TYPE_HASH_SIZE
]; h
; h
= h
->next
)
991 if (h
->hashcode
== hashcode
992 && TREE_PURPOSE (h
->list
) == purpose
993 && TREE_VALUE (h
->list
) == value
994 && TREE_CHAIN (h
->list
) == chain
)
999 /* Add an entry to the list-hash-table
1000 for a list TYPE whose hash code is HASHCODE. */
1003 list_hash_add (hashcode
, list
)
1007 register struct list_hash
*h
;
1009 h
= (struct list_hash
*) obstack_alloc (&permanent_obstack
, sizeof (struct list_hash
));
1010 h
->hashcode
= hashcode
;
1012 h
->next
= list_hash_table
[hashcode
% TYPE_HASH_SIZE
];
1013 list_hash_table
[hashcode
% TYPE_HASH_SIZE
] = h
;
1016 /* Given list components PURPOSE, VALUE, AND CHAIN, return the canonical
1017 object for an identical list if one already exists. Otherwise, build a
1018 new one, and record it as the canonical object. */
1020 /* Set to 1 to debug without canonicalization. Never set by program. */
1022 static int debug_no_list_hash
= 0;
1025 hash_tree_cons (purpose
, value
, chain
)
1026 tree purpose
, value
, chain
;
1031 if (! debug_no_list_hash
)
1033 hashcode
= list_hash (purpose
, value
, chain
);
1034 t
= list_hash_lookup (hashcode
, purpose
, value
, chain
);
1039 t
= tree_cons (purpose
, value
, chain
);
1041 /* If this is a new list, record it for later reuse. */
1042 if (! debug_no_list_hash
)
1043 list_hash_add (hashcode
, t
);
1048 /* Constructor for hashed lists. */
1051 hash_tree_chain (value
, chain
)
1054 return hash_tree_cons (NULL_TREE
, value
, chain
);
1057 /* Similar, but used for concatenating two lists. */
1060 hash_chainon (list1
, list2
)
1067 if (TREE_CHAIN (list1
) == NULL_TREE
)
1068 return hash_tree_chain (TREE_VALUE (list1
), list2
);
1069 return hash_tree_chain (TREE_VALUE (list1
),
1070 hash_chainon (TREE_CHAIN (list1
), list2
));
1073 /* Build an association between TYPE and some parameters:
1075 OFFSET is the offset added to `this' to convert it to a pointer
1078 BINFO is the base binfo to use, if we are deriving from one. This
1079 is necessary, as we want specialized parent binfos from base
1080 classes, so that the VTABLE_NAMEs of bases are for the most derived
1081 type, instead of the simple type.
1083 VTABLE is the virtual function table with which to initialize
1084 sub-objects of type TYPE.
1086 VIRTUALS are the virtual functions sitting in VTABLE. */
1089 make_binfo (offset
, binfo
, vtable
, virtuals
)
1091 tree vtable
, virtuals
;
1093 tree new_binfo
= make_tree_vec (7);
1096 if (TREE_CODE (binfo
) == TREE_VEC
)
1097 type
= BINFO_TYPE (binfo
);
1101 binfo
= CLASS_TYPE_P (type
) ? TYPE_BINFO (binfo
) : NULL_TREE
;
1104 TREE_TYPE (new_binfo
) = TYPE_MAIN_VARIANT (type
);
1105 BINFO_OFFSET (new_binfo
) = offset
;
1106 BINFO_VTABLE (new_binfo
) = vtable
;
1107 BINFO_VIRTUALS (new_binfo
) = virtuals
;
1108 BINFO_VPTR_FIELD (new_binfo
) = NULL_TREE
;
1110 if (binfo
&& BINFO_BASETYPES (binfo
) != NULL_TREE
)
1111 BINFO_BASETYPES (new_binfo
) = copy_node (BINFO_BASETYPES (binfo
));
1115 /* Return the binfo value for ELEM in TYPE. */
1118 binfo_value (elem
, type
)
1122 if (get_base_distance (elem
, type
, 0, (tree
*)0) == -2)
1123 compiler_error ("base class `%s' ambiguous in binfo_value",
1124 TYPE_NAME_STRING (elem
));
1126 return TYPE_BINFO (type
);
1127 if (TREE_CODE (elem
) == RECORD_TYPE
&& TYPE_BINFO (elem
) == type
)
1129 return get_binfo (elem
, type
, 0);
1132 /* Return a reversed copy of the BINFO-chain given by PATH. (If the
1133 BINFO_INHERITANCE_CHAIN points from base classes to derived
1134 classes, it will instead point from derived classes to base
1135 classes.) Returns the first node in the reversed chain. */
1141 register tree prev
= NULL_TREE
, cur
;
1142 for (cur
= path
; cur
; cur
= BINFO_INHERITANCE_CHAIN (cur
))
1144 tree r
= copy_node (cur
);
1145 BINFO_INHERITANCE_CHAIN (r
) = prev
;
1155 unsigned HOST_WIDE_INT n
;
1158 fprintf (stderr
, "type \"%s\"; offset = %ld\n",
1159 TYPE_NAME_STRING (BINFO_TYPE (elem
)),
1160 (long) TREE_INT_CST_LOW (BINFO_OFFSET (elem
)));
1161 fprintf (stderr
, "vtable type:\n");
1162 debug_tree (BINFO_TYPE (elem
));
1163 if (BINFO_VTABLE (elem
))
1164 fprintf (stderr
, "vtable decl \"%s\"\n", IDENTIFIER_POINTER (DECL_NAME (BINFO_VTABLE (elem
))));
1166 fprintf (stderr
, "no vtable decl yet\n");
1167 fprintf (stderr
, "virtuals:\n");
1168 virtuals
= skip_rtti_stuff (elem
, BINFO_TYPE (elem
), &n
);
1172 tree fndecl
= TREE_VALUE (virtuals
);
1173 fprintf (stderr
, "%s [%ld =? %ld]\n",
1174 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl
)),
1175 (long) n
, (long) TREE_INT_CST_LOW (DECL_VINDEX (fndecl
)));
1177 virtuals
= TREE_CHAIN (virtuals
);
1186 if (TREE_CODE (t
) == FUNCTION_DECL
)
1188 else if (TREE_CODE (t
) == OVERLOAD
)
1190 for (i
=0; t
; t
= OVL_CHAIN (t
))
1195 my_friendly_abort (359);
1200 is_overloaded_fn (x
)
1203 /* A baselink is also considered an overloaded function. */
1204 if (TREE_CODE (x
) == OFFSET_REF
)
1205 x
= TREE_OPERAND (x
, 1);
1208 return (TREE_CODE (x
) == FUNCTION_DECL
1209 || TREE_CODE (x
) == TEMPLATE_ID_EXPR
1210 || DECL_FUNCTION_TEMPLATE_P (x
)
1211 || TREE_CODE (x
) == OVERLOAD
);
1215 really_overloaded_fn (x
)
1218 /* A baselink is also considered an overloaded function. */
1219 if (TREE_CODE (x
) == OFFSET_REF
)
1220 x
= TREE_OPERAND (x
, 1);
1223 return (TREE_CODE (x
) == OVERLOAD
1224 && (TREE_CHAIN (x
) != NULL_TREE
1225 || DECL_FUNCTION_TEMPLATE_P (OVL_FUNCTION (x
))));
1232 my_friendly_assert (is_overloaded_fn (from
), 9);
1233 /* A baselink is also considered an overloaded function. */
1234 if (BASELINK_P (from
))
1235 from
= TREE_VALUE (from
);
1236 return OVL_CURRENT (from
);
1239 /* Returns nonzero if T is a ->* or .* expression that refers to a
1246 return (TREE_CODE (t
) == OFFSET_REF
1247 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (t
, 1))));
1250 /* Return a new OVL node, concatenating it with the old one. */
1253 ovl_cons (decl
, chain
)
1257 tree result
= make_node (OVERLOAD
);
1258 TREE_TYPE (result
) = unknown_type_node
;
1259 OVL_FUNCTION (result
) = decl
;
1260 TREE_CHAIN (result
) = chain
;
1265 /* Build a new overloaded function. If this is the first one,
1266 just return it; otherwise, ovl_cons the _DECLs */
1269 build_overload (decl
, chain
)
1273 if (! chain
&& TREE_CODE (decl
) != TEMPLATE_DECL
)
1275 if (chain
&& TREE_CODE (chain
) != OVERLOAD
)
1276 chain
= ovl_cons (chain
, NULL_TREE
);
1277 return ovl_cons (decl
, chain
);
1280 /* True if fn is in ovl. */
1283 ovl_member (fn
, ovl
)
1287 if (ovl
== NULL_TREE
)
1289 if (TREE_CODE (ovl
) != OVERLOAD
)
1291 for (; ovl
; ovl
= OVL_CHAIN (ovl
))
1292 if (OVL_FUNCTION (ovl
) == fn
)
1298 is_aggr_type_2 (t1
, t2
)
1301 if (TREE_CODE (t1
) != TREE_CODE (t2
))
1303 return IS_AGGR_TYPE (t1
) && IS_AGGR_TYPE (t2
);
1306 /* Returns non-zero if CODE is the code for a statement. */
1309 statement_code_p (code
)
1310 enum tree_code code
;
1330 case START_CATCH_STMT
:
1333 case CTOR_INITIALIZER
:
1345 #define PRINT_RING_SIZE 4
1348 lang_printable_name (decl
, v
)
1352 static tree decl_ring
[PRINT_RING_SIZE
];
1353 static char *print_ring
[PRINT_RING_SIZE
];
1354 static int ring_counter
;
1357 /* Only cache functions. */
1359 || TREE_CODE (decl
) != FUNCTION_DECL
1360 || DECL_LANG_SPECIFIC (decl
) == 0)
1361 return lang_decl_name (decl
, v
);
1363 /* See if this print name is lying around. */
1364 for (i
= 0; i
< PRINT_RING_SIZE
; i
++)
1365 if (decl_ring
[i
] == decl
)
1366 /* yes, so return it. */
1367 return print_ring
[i
];
1369 if (++ring_counter
== PRINT_RING_SIZE
)
1372 if (current_function_decl
!= NULL_TREE
)
1374 if (decl_ring
[ring_counter
] == current_function_decl
)
1376 if (ring_counter
== PRINT_RING_SIZE
)
1378 if (decl_ring
[ring_counter
] == current_function_decl
)
1379 my_friendly_abort (106);
1382 if (print_ring
[ring_counter
])
1383 free (print_ring
[ring_counter
]);
1385 print_ring
[ring_counter
] = xstrdup (lang_decl_name (decl
, v
));
1386 decl_ring
[ring_counter
] = decl
;
1387 return print_ring
[ring_counter
];
1390 /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions
1391 listed in RAISES. */
1394 build_exception_variant (type
, raises
)
1398 tree v
= TYPE_MAIN_VARIANT (type
);
1399 int type_quals
= TYPE_QUALS (type
);
1401 for (; v
; v
= TYPE_NEXT_VARIANT (v
))
1402 if (TYPE_QUALS (v
) == type_quals
1403 && comp_except_specs (raises
, TYPE_RAISES_EXCEPTIONS (v
), 1))
1406 /* Need to build a new variant. */
1407 v
= build_type_copy (type
);
1408 TYPE_RAISES_EXCEPTIONS (v
) = raises
;
1412 /* Given a TEMPLATE_TEMPLATE_PARM node T, create a new one together with its
1413 lang_specific field and its corresponding TEMPLATE_DECL node */
1416 copy_template_template_parm (t
)
1419 tree
template = TYPE_NAME (t
);
1422 t2
= make_aggr_type (TEMPLATE_TEMPLATE_PARM
);
1423 template = copy_node (template);
1424 copy_lang_decl (template);
1426 TREE_TYPE (template) = t2
;
1427 TYPE_NAME (t2
) = template;
1428 TYPE_STUB_DECL (t2
) = template;
1430 /* No need to copy these */
1431 TYPE_FIELDS (t2
) = TYPE_FIELDS (t
);
1432 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2
)
1433 = TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
);
1437 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal.
1438 FUNC is called with the DATA and the address of each sub-tree. If
1439 FUNC returns a non-NULL value, the traversal is aborted, and the
1440 value returned by FUNC is returned. */
1443 walk_tree (tp
, func
, data
)
1448 enum tree_code code
;
1452 #define WALK_SUBTREE(NODE) \
1455 result = walk_tree (&(NODE), func, data); \
1461 /* Skip empty subtrees. */
1465 /* Call the function. */
1467 result
= (*func
) (tp
, &walk_subtrees
, data
);
1469 /* If we found something, return it. */
1473 /* Even if we didn't, FUNC may have decided that there was nothing
1474 interesting below this point in the tree. */
1478 code
= TREE_CODE (*tp
);
1480 /* Handle common cases up front. */
1481 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
))
1482 || TREE_CODE_CLASS (code
) == 'r'
1483 || TREE_CODE_CLASS (code
) == 's')
1487 /* Walk over all the sub-trees of this operand. */
1488 len
= first_rtl_op (code
);
1489 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
1490 But, we only want to walk once. */
1491 if (code
== TARGET_EXPR
1492 && TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1))
1494 /* Go through the subtrees. We need to do this in forward order so
1495 that the scope of a FOR_EXPR is handled properly. */
1496 for (i
= 0; i
< len
; ++i
)
1497 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
1499 /* For statements, we also walk the chain so that we cover the
1500 entire statement tree. */
1501 if (statement_code_p (code
))
1503 if (code
== DECL_STMT
1504 && DECL_STMT_DECL (*tp
)
1505 && TREE_CODE_CLASS (TREE_CODE (DECL_STMT_DECL (*tp
))) == 'd')
1507 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
1508 into declarations that are just mentioned, rather than
1509 declared; they don't really belong to this part of the tree.
1510 And, we can see cycles: the initializer for a declaration can
1511 refer to the declaration itself. */
1512 WALK_SUBTREE (DECL_INITIAL (DECL_STMT_DECL (*tp
)));
1513 WALK_SUBTREE (DECL_SIZE (DECL_STMT_DECL (*tp
)));
1516 WALK_SUBTREE (TREE_CHAIN (*tp
));
1519 /* We didn't find what we were looking for. */
1522 else if (TREE_CODE_CLASS (code
) == 'd')
1524 WALK_SUBTREE (TREE_TYPE (*tp
));
1526 /* We didn't find what we were looking for. */
1530 /* Not one of the easy cases. We must explicitly go through the
1535 case IDENTIFIER_NODE
:
1540 case TEMPLATE_TEMPLATE_PARM
:
1541 case TEMPLATE_PARM_INDEX
:
1542 case TEMPLATE_TYPE_PARM
:
1552 /* None of thse have subtrees other than those already walked
1557 WALK_SUBTREE (TREE_TYPE (*tp
));
1561 case REFERENCE_TYPE
:
1562 WALK_SUBTREE (TREE_TYPE (*tp
));
1566 WALK_SUBTREE (TREE_PURPOSE (*tp
));
1567 WALK_SUBTREE (TREE_VALUE (*tp
));
1568 WALK_SUBTREE (TREE_CHAIN (*tp
));
1572 WALK_SUBTREE (OVL_FUNCTION (*tp
));
1573 WALK_SUBTREE (OVL_CHAIN (*tp
));
1578 int len
= TREE_VEC_LENGTH (*tp
);
1580 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
1585 WALK_SUBTREE (TREE_REALPART (*tp
));
1586 WALK_SUBTREE (TREE_IMAGPART (*tp
));
1590 WALK_SUBTREE (CONSTRUCTOR_ELTS (*tp
));
1594 WALK_SUBTREE (TYPE_METHOD_BASETYPE (*tp
));
1598 WALK_SUBTREE (TREE_TYPE (*tp
));
1599 WALK_SUBTREE (TYPE_ARG_TYPES (*tp
));
1603 WALK_SUBTREE (TREE_TYPE (*tp
));
1604 WALK_SUBTREE (TYPE_DOMAIN (*tp
));
1608 WALK_SUBTREE (TYPE_MIN_VALUE (*tp
));
1609 WALK_SUBTREE (TYPE_MAX_VALUE (*tp
));
1613 WALK_SUBTREE (TREE_TYPE (*tp
));
1614 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (*tp
));
1618 if (TYPE_PTRMEMFUNC_P (*tp
))
1619 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (*tp
));
1623 my_friendly_abort (19990803);
1626 /* We didn't find what we were looking for. */
1632 /* Passed to walk_tree. Checks for the use of types with no linkage. */
1635 no_linkage_helper (tp
, walk_subtrees
, data
)
1637 int *walk_subtrees ATTRIBUTE_UNUSED
;
1638 void *data ATTRIBUTE_UNUSED
;
1643 && (IS_AGGR_TYPE (t
) || TREE_CODE (t
) == ENUMERAL_TYPE
)
1644 && (decl_function_context (TYPE_MAIN_DECL (t
))
1645 || ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
))))
1650 /* Check if the type T depends on a type with no linkage and if so, return
1654 no_linkage_check (t
)
1657 /* There's no point in checking linkage on template functions; we
1658 can't know their complete types. */
1659 if (processing_template_decl
)
1662 t
= walk_tree (&t
, no_linkage_helper
, NULL
);
1663 if (t
!= error_mark_node
)
1668 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
1671 copy_tree_r (tp
, walk_subtrees
, data
)
1674 void *data ATTRIBUTE_UNUSED
;
1676 enum tree_code code
= TREE_CODE (*tp
);
1678 /* We make copies of most nodes. */
1679 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
))
1680 || TREE_CODE_CLASS (code
) == 'r'
1681 || TREE_CODE_CLASS (code
) == 'c'
1682 || TREE_CODE_CLASS (code
) == 's'
1683 || code
== PARM_DECL
1684 || code
== TREE_LIST
1686 || code
== OVERLOAD
)
1688 /* Because the chain gets clobbered when we make a copy, we save it
1690 tree chain
= TREE_CHAIN (*tp
);
1692 /* Copy the node. */
1693 *tp
= copy_node (*tp
);
1695 /* Now, restore the chain, if appropriate. That will cause
1696 walk_tree to walk into the chain as well. */
1697 if (code
== PARM_DECL
|| code
== TREE_LIST
|| code
== OVERLOAD
1698 || statement_code_p (code
))
1699 TREE_CHAIN (*tp
) = chain
;
1701 /* For now, we don't update BLOCKs when we make copies. So, we
1702 have to nullify all scope-statements. */
1703 if (TREE_CODE (*tp
) == SCOPE_STMT
)
1704 SCOPE_STMT_BLOCK (*tp
) = NULL_TREE
;
1706 else if (code
== TEMPLATE_TEMPLATE_PARM
)
1707 /* These must be copied specially. */
1708 *tp
= copy_template_template_parm (*tp
);
1709 else if (TREE_CODE_CLASS (code
) == 't')
1710 /* There's no need to copy types, or anything beneath them. */
1716 #ifdef GATHER_STATISTICS
1717 extern int depth_reached
;
1721 print_lang_statistics ()
1723 print_search_statistics ();
1724 print_class_statistics ();
1725 #ifdef GATHER_STATISTICS
1726 fprintf (stderr
, "maximum template instantiation depth reached: %d\n",
1731 /* This is used by the `assert' macro. It is provided in libgcc.a,
1732 which `cc' doesn't know how to link. Note that the C++ front-end
1733 no longer actually uses the `assert' macro (instead, it calls
1734 my_friendly_assert). But all of the back-end files still need this. */
1737 __eprintf (string
, expression
, line
, filename
)
1739 const char *expression
;
1741 const char *filename
;
1743 fprintf (stderr
, string
, expression
, line
, filename
);
1748 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1749 (which is an ARRAY_TYPE). This counts only elements of the top
1753 array_type_nelts_top (type
)
1756 return fold (build (PLUS_EXPR
, sizetype
,
1757 array_type_nelts (type
),
1761 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1762 (which is an ARRAY_TYPE). This one is a recursive count of all
1763 ARRAY_TYPEs that are clumped together. */
1766 array_type_nelts_total (type
)
1769 tree sz
= array_type_nelts_top (type
);
1770 type
= TREE_TYPE (type
);
1771 while (TREE_CODE (type
) == ARRAY_TYPE
)
1773 tree n
= array_type_nelts_top (type
);
1774 sz
= fold (build (MULT_EXPR
, sizetype
, sz
, n
));
1775 type
= TREE_TYPE (type
);
1780 /* Called from break_out_target_exprs via mapcar. */
1783 bot_manip (tp
, walk_subtrees
, data
)
1788 splay_tree target_remap
= ((splay_tree
) data
);
1791 if (TREE_CODE (t
) != TREE_LIST
&& ! TREE_SIDE_EFFECTS (t
))
1793 /* There can't be any TARGET_EXPRs below this point. */
1797 else if (TREE_CODE (t
) == TARGET_EXPR
)
1801 if (TREE_CODE (TREE_OPERAND (t
, 1)) == AGGR_INIT_EXPR
)
1803 mark_used (TREE_OPERAND (TREE_OPERAND (TREE_OPERAND (t
, 1), 0), 0));
1805 (TREE_TYPE (t
), break_out_target_exprs (TREE_OPERAND (t
, 1)));
1810 TREE_OPERAND (u
, 0) = build (VAR_DECL
, TREE_TYPE (t
));
1811 layout_decl (TREE_OPERAND (u
, 0), 0);
1814 /* Map the old variable to the new one. */
1815 splay_tree_insert (target_remap
,
1816 (splay_tree_key
) TREE_OPERAND (t
, 0),
1817 (splay_tree_value
) TREE_OPERAND (u
, 0));
1819 /* Replace the old expression with the new version. */
1821 /* We don't have to go below this point; the recursive call to
1822 break_out_target_exprs will have handled anything below this
1827 else if (TREE_CODE (t
) == CALL_EXPR
)
1828 mark_used (TREE_OPERAND (TREE_OPERAND (t
, 0), 0));
1830 /* Make a copy of this node. */
1831 return copy_tree_r (tp
, walk_subtrees
, NULL
);
1834 /* Replace all remapped VAR_DECLs in T with their new equivalents.
1835 DATA is really a splay-tree mapping old variables to new
1839 bot_replace (t
, walk_subtrees
, data
)
1841 int *walk_subtrees ATTRIBUTE_UNUSED
;
1844 splay_tree target_remap
= ((splay_tree
) data
);
1846 if (TREE_CODE (*t
) == VAR_DECL
)
1848 splay_tree_node n
= splay_tree_lookup (target_remap
,
1849 (splay_tree_key
) *t
);
1851 *t
= (tree
) n
->value
;
1857 /* When we parse a default argument expression, we may create
1858 temporary variables via TARGET_EXPRs. When we actually use the
1859 default-argument expression, we make a copy of the expression, but
1860 we must replace the temporaries with appropriate local versions. */
1863 break_out_target_exprs (t
)
1866 static int target_remap_count
;
1867 static splay_tree target_remap
;
1869 if (!target_remap_count
++)
1870 target_remap
= splay_tree_new (splay_tree_compare_pointers
,
1871 /*splay_tree_delete_key_fn=*/NULL
,
1872 /*splay_tree_delete_value_fn=*/NULL
);
1873 walk_tree (&t
, bot_manip
, target_remap
);
1874 walk_tree (&t
, bot_replace
, target_remap
);
1876 if (!--target_remap_count
)
1878 splay_tree_delete (target_remap
);
1879 target_remap
= NULL
;
1885 /* Obstack used for allocating nodes in template function and variable
1888 /* Similar to `build_nt', except that we set TREE_COMPLEXITY to be the
1889 current line number. */
1892 build_min_nt
VPROTO((enum tree_code code
, ...))
1894 #ifndef ANSI_PROTOTYPES
1895 enum tree_code code
;
1899 register int length
;
1904 #ifndef ANSI_PROTOTYPES
1905 code
= va_arg (p
, enum tree_code
);
1908 t
= make_node (code
);
1909 length
= tree_code_length
[(int) code
];
1910 TREE_COMPLEXITY (t
) = lineno
;
1912 for (i
= 0; i
< length
; i
++)
1914 tree x
= va_arg (p
, tree
);
1915 TREE_OPERAND (t
, i
) = x
;
1922 /* Similar to `build', except we set TREE_COMPLEXITY to the current
1926 build_min
VPROTO((enum tree_code code
, tree tt
, ...))
1928 #ifndef ANSI_PROTOTYPES
1929 enum tree_code code
;
1934 register int length
;
1939 #ifndef ANSI_PROTOTYPES
1940 code
= va_arg (p
, enum tree_code
);
1941 tt
= va_arg (p
, tree
);
1944 t
= make_node (code
);
1945 length
= tree_code_length
[(int) code
];
1947 TREE_COMPLEXITY (t
) = lineno
;
1949 for (i
= 0; i
< length
; i
++)
1951 tree x
= va_arg (p
, tree
);
1952 TREE_OPERAND (t
, i
) = x
;
1963 if (TREE_CODE (t
) == TYPE_DECL
)
1965 if (TREE_CODE_CLASS (TREE_CODE (t
)) == 't')
1966 return TYPE_STUB_DECL (t
);
1968 my_friendly_abort (42);
1970 /* Stop compiler from complaining control reaches end of non-void function. */
1975 can_free (obstack
, t
)
1976 struct obstack
*obstack
;
1981 if (TREE_CODE (t
) == TREE_VEC
)
1982 size
= (TREE_VEC_LENGTH (t
)-1) * sizeof (tree
) + sizeof (struct tree_vec
);
1984 my_friendly_abort (42);
1986 #define ROUND(x) ((x + obstack_alignment_mask (obstack)) \
1987 & ~ obstack_alignment_mask (obstack))
1988 if ((char *)t
+ ROUND (size
) == obstack_next_free (obstack
))
1995 /* Return first vector element whose BINFO_TYPE is ELEM.
1996 Return 0 if ELEM is not in VEC. VEC may be NULL_TREE. */
1999 vec_binfo_member (elem
, vec
)
2005 for (i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
2006 if (same_type_p (elem
, BINFO_TYPE (TREE_VEC_ELT (vec
, i
))))
2007 return TREE_VEC_ELT (vec
, i
);
2012 /* Kludge around the fact that DECL_CONTEXT for virtual functions returns
2013 the wrong thing for decl_function_context. Hopefully the uses in the
2014 backend won't matter, since we don't need a static chain for local class
2018 hack_decl_function_context (decl
)
2021 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FUNCTION_MEMBER_P (decl
))
2022 return decl_function_context (TYPE_MAIN_DECL (DECL_CLASS_CONTEXT (decl
)));
2023 return decl_function_context (decl
);
2026 /* Returns the namespace that contains DECL, whether directly or
2030 decl_namespace_context (decl
)
2035 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
2037 else if (TYPE_P (decl
))
2038 decl
= CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl
));
2040 decl
= CP_DECL_CONTEXT (decl
);
2044 /* Return truthvalue of whether T1 is the same tree structure as T2.
2045 Return 1 if they are the same.
2046 Return 0 if they are understandably different.
2047 Return -1 if either contains tree structure not understood by
2051 cp_tree_equal (t1
, t2
)
2054 register enum tree_code code1
, code2
;
2059 if (t1
== 0 || t2
== 0)
2062 code1
= TREE_CODE (t1
);
2063 code2
= TREE_CODE (t2
);
2065 if (code1
== NOP_EXPR
|| code1
== CONVERT_EXPR
|| code1
== NON_LVALUE_EXPR
)
2067 if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
|| code2
== NON_LVALUE_EXPR
)
2068 return cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2070 return cp_tree_equal (TREE_OPERAND (t1
, 0), t2
);
2072 else if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
2073 || code2
== NON_LVALUE_EXPR
)
2074 return cp_tree_equal (t1
, TREE_OPERAND (t2
, 0));
2082 return TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
2083 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
);
2086 return REAL_VALUES_EQUAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
2089 return TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
2090 && !bcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
2091 TREE_STRING_LENGTH (t1
));
2094 /* We need to do this when determining whether or not two
2095 non-type pointer to member function template arguments
2097 if (!(same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
2098 /* The first operand is RTL. */
2099 && TREE_OPERAND (t1
, 0) == TREE_OPERAND (t2
, 0)))
2101 return cp_tree_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
2104 cmp
= cp_tree_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
));
2107 cmp
= cp_tree_equal (TREE_VALUE (t1
), TREE_VALUE (t2
));
2110 return cp_tree_equal (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
2113 return cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2116 cmp
= cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2119 return simple_cst_list_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
2122 /* Special case: if either target is an unallocated VAR_DECL,
2123 it means that it's going to be unified with whatever the
2124 TARGET_EXPR is really supposed to initialize, so treat it
2125 as being equivalent to anything. */
2126 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
2127 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
2128 && DECL_RTL (TREE_OPERAND (t1
, 0)) == 0)
2129 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
2130 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
2131 && DECL_RTL (TREE_OPERAND (t2
, 0)) == 0))
2134 cmp
= cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2137 return cp_tree_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
2139 case WITH_CLEANUP_EXPR
:
2140 cmp
= cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2143 return cp_tree_equal (TREE_OPERAND (t1
, 2), TREE_OPERAND (t1
, 2));
2146 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
2147 return cp_tree_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2156 case TEMPLATE_PARM_INDEX
:
2157 return TEMPLATE_PARM_IDX (t1
) == TEMPLATE_PARM_IDX (t2
)
2158 && TEMPLATE_PARM_LEVEL (t1
) == TEMPLATE_PARM_LEVEL (t2
);
2162 if (TREE_CODE (TREE_OPERAND (t1
, 0)) != TREE_CODE (TREE_OPERAND (t2
, 0)))
2164 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (t1
, 0))) == 't')
2165 return same_type_p (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2169 /* Two pointer-to-members are the same if they point to the same
2170 field or function in the same class. */
2171 return (PTRMEM_CST_MEMBER (t1
) == PTRMEM_CST_MEMBER (t2
)
2172 && same_type_p (PTRMEM_CST_CLASS (t1
), PTRMEM_CST_CLASS (t2
)));
2178 switch (TREE_CODE_CLASS (code1
))
2188 for (i
=0; i
<tree_code_length
[(int) code1
]; ++i
)
2190 cmp
= cp_tree_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
2200 /* Build a wrapper around some pointer PTR so we can use it as a tree. */
2203 build_ptr_wrapper (ptr
)
2206 tree t
= make_node (WRAPPER
);
2207 WRAPPER_PTR (t
) = ptr
;
2211 /* Same, but on the expression_obstack. */
2214 build_expr_ptr_wrapper (ptr
)
2217 return build_ptr_wrapper (ptr
);
2220 /* Build a wrapper around some integer I so we can use it as a tree. */
2223 build_int_wrapper (i
)
2226 tree t
= make_node (WRAPPER
);
2227 WRAPPER_INT (t
) = i
;
2232 build_srcloc (file
, line
)
2238 t
= make_node (SRCLOC
);
2239 SRCLOC_FILE (t
) = file
;
2240 SRCLOC_LINE (t
) = line
;
2246 build_srcloc_here ()
2248 return build_srcloc (input_filename
, lineno
);
2251 /* The type of ARG when used as an lvalue. */
2257 tree type
= TREE_TYPE (arg
);
2258 if (TREE_CODE (arg
) == OVERLOAD
)
2259 type
= unknown_type_node
;
2263 /* The type of ARG for printing error messages; denote lvalues with
2270 tree type
= TREE_TYPE (arg
);
2271 if (TREE_CODE (type
) == ARRAY_TYPE
)
2273 else if (real_lvalue_p (arg
))
2274 type
= build_reference_type (lvalue_type (arg
));
2275 else if (IS_AGGR_TYPE (type
))
2276 type
= lvalue_type (arg
);
2281 /* Does FUNCTION use a variable-length argument list? */
2284 varargs_function_p (function
)
2287 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (function
));
2288 for (; parm
; parm
= TREE_CHAIN (parm
))
2289 if (TREE_VALUE (parm
) == void_type_node
)
2294 /* Returns 1 if decl is a member of a class. */
2300 tree ctx
= DECL_CONTEXT (decl
);
2301 return (ctx
&& TREE_CODE_CLASS (TREE_CODE (ctx
)) == 't');
2304 /* Create a placeholder for member access where we don't actually have an
2305 object that the access is against. */
2308 build_dummy_object (type
)
2311 tree decl
= build1 (NOP_EXPR
, build_pointer_type (type
), void_zero_node
);
2312 return build_indirect_ref (decl
, NULL_PTR
);
2315 /* We've gotten a reference to a member of TYPE. Return *this if appropriate,
2316 or a dummy object otherwise. If BINFOP is non-0, it is filled with the
2317 binfo path from current_class_type to TYPE, or 0. */
2320 maybe_dummy_object (type
, binfop
)
2326 if (current_class_type
2327 && get_base_distance (type
, current_class_type
, 0, binfop
) != -1)
2328 context
= current_class_type
;
2331 /* Reference from a nested class member function. */
2334 *binfop
= TYPE_BINFO (type
);
2337 if (current_class_ref
&& context
== current_class_type
)
2338 decl
= current_class_ref
;
2340 decl
= build_dummy_object (context
);
2345 /* Returns 1 if OB is a placeholder object, or a pointer to one. */
2348 is_dummy_object (ob
)
2351 if (TREE_CODE (ob
) == INDIRECT_REF
)
2352 ob
= TREE_OPERAND (ob
, 0);
2353 return (TREE_CODE (ob
) == NOP_EXPR
2354 && TREE_OPERAND (ob
, 0) == void_zero_node
);
2357 /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */
2363 while (TREE_CODE (t
) == ARRAY_TYPE
)
2366 if (INTEGRAL_TYPE_P (t
))
2367 return 1; /* integral, character or enumeral type */
2368 if (FLOAT_TYPE_P (t
))
2371 return 1; /* pointer to non-member */
2372 if (TYPE_PTRMEM_P (t
))
2373 return 1; /* pointer to member object */
2374 if (TYPE_PTRMEMFUNC_P (t
))
2375 return 1; /* pointer to member function */
2377 if (! CLASS_TYPE_P (t
))
2378 return 0; /* other non-class type (reference or function) */
2379 if (CLASSTYPE_NON_POD_P (t
))
2384 /* Return a 1 if ATTR_NAME and ATTR_ARGS denote a valid C++-specific
2385 attribute for either declaration DECL or type TYPE and 0 otherwise.
2386 Plugged into valid_lang_attribute. */
2389 cp_valid_lang_attribute (attr_name
, attr_args
, decl
, type
)
2391 tree attr_args ATTRIBUTE_UNUSED
;
2392 tree decl ATTRIBUTE_UNUSED
;
2393 tree type ATTRIBUTE_UNUSED
;
2395 if (is_attribute_p ("com_interface", attr_name
))
2397 if (! flag_vtable_thunks
)
2399 error ("`com_interface' only supported with -fvtable-thunks");
2403 if (attr_args
!= NULL_TREE
2404 || decl
!= NULL_TREE
2405 || ! CLASS_TYPE_P (type
)
2406 || type
!= TYPE_MAIN_VARIANT (type
))
2408 warning ("`com_interface' attribute can only be applied to class definitions");
2412 CLASSTYPE_COM_INTERFACE (type
) = 1;
2415 else if (is_attribute_p ("init_priority", attr_name
))
2417 tree initp_expr
= (attr_args
? TREE_VALUE (attr_args
): NULL_TREE
);
2421 STRIP_NOPS (initp_expr
);
2423 if (!initp_expr
|| TREE_CODE (initp_expr
) != INTEGER_CST
)
2425 error ("requested init_priority is not an integer constant");
2429 pri
= TREE_INT_CST_LOW (initp_expr
);
2431 while (TREE_CODE (type
) == ARRAY_TYPE
)
2432 type
= TREE_TYPE (type
);
2434 if (decl
== NULL_TREE
2435 || TREE_CODE (decl
) != VAR_DECL
2436 || ! TREE_STATIC (decl
)
2437 || DECL_EXTERNAL (decl
)
2438 || (TREE_CODE (type
) != RECORD_TYPE
2439 && TREE_CODE (type
) != UNION_TYPE
)
2440 /* Static objects in functions are initialized the
2441 first time control passes through that
2442 function. This is not precise enough to pin down an
2443 init_priority value, so don't allow it. */
2444 || current_function_decl
)
2446 error ("can only use init_priority attribute on file-scope definitions of objects of class type");
2450 if (pri
> MAX_INIT_PRIORITY
|| pri
<= 0)
2452 error ("requested init_priority is out of range");
2456 /* Check for init_priorities that are reserved for
2457 language and runtime support implementations.*/
2458 if (pri
<= MAX_RESERVED_INIT_PRIORITY
)
2461 ("requested init_priority is reserved for internal use");
2464 DECL_INIT_PRIORITY (decl
) = pri
;
2471 /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the
2472 thing pointed to by the constant. */
2475 make_ptrmem_cst (type
, member
)
2479 tree ptrmem_cst
= make_node (PTRMEM_CST
);
2480 /* If would seem a great convenience if make_node would set
2481 TREE_CONSTANT for things of class `c', but it does not. */
2482 TREE_CONSTANT (ptrmem_cst
) = 1;
2483 TREE_TYPE (ptrmem_cst
) = type
;
2484 PTRMEM_CST_MEMBER (ptrmem_cst
) = member
;
2488 /* Mark ARG (which is really a list_hash_table **) for GC. */
2491 mark_list_hash (arg
)
2494 struct list_hash
*lh
;
2496 for (lh
= * ((struct list_hash
**) arg
); lh
; lh
= lh
->next
)
2497 ggc_mark_tree (lh
->list
);
2500 /* Initialize tree.c. */
2505 make_lang_type_fn
= cp_make_lang_type
;
2506 lang_unsave
= cp_unsave
;
2507 ggc_add_root (list_hash_table
,
2508 sizeof (list_hash_table
) / sizeof (struct list_hash
*),
2509 sizeof (struct list_hash
*),
2513 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
2514 information indicating to what new SAVE_EXPR this one should be
2515 mapped, use that one. Otherwise, create a new node and enter it in
2516 ST. FN is the function into which the copy will be placed. */
2519 remap_save_expr (tp
, st
, fn
, walk_subtrees
)
2527 /* See if we already encountered this SAVE_EXPR. */
2528 n
= splay_tree_lookup (st
, (splay_tree_key
) *tp
);
2530 /* If we didn't already remap this SAVE_EXPR, do so now. */
2533 tree t
= copy_node (*tp
);
2535 /* The SAVE_EXPR is now part of the function into which we
2536 are inlining this body. */
2537 SAVE_EXPR_CONTEXT (t
) = fn
;
2538 /* And we haven't evaluated it yet. */
2539 SAVE_EXPR_RTL (t
) = NULL_RTX
;
2540 /* Remember this SAVE_EXPR. */
2541 n
= splay_tree_insert (st
,
2542 (splay_tree_key
) *tp
,
2543 (splay_tree_value
) t
);
2546 /* We've already walked into this SAVE_EXPR, so we needn't do it
2550 /* Replace this SAVE_EXPR with the copy. */
2551 *tp
= (tree
) n
->value
;
2554 /* Called via walk_tree. If *TP points to a DECL_STMT for a local
2555 declaration, copies the declaration and enters it in the splay_tree
2556 pointed to by DATA (which is really a `splay_tree *'). */
2559 mark_local_for_remap_r (tp
, walk_subtrees
, data
)
2561 int *walk_subtrees ATTRIBUTE_UNUSED
;
2565 splay_tree st
= (splay_tree
) data
;
2567 if ((TREE_CODE (t
) == DECL_STMT
2568 && nonstatic_local_decl_p (DECL_STMT_DECL (t
)))
2569 || TREE_CODE (t
) == LABEL_STMT
)
2574 /* Figure out what's being declared. */
2575 decl
= (TREE_CODE (t
) == DECL_STMT
2576 ? DECL_STMT_DECL (t
) : LABEL_STMT_LABEL (t
));
2579 copy
= copy_decl_for_inlining (decl
,
2580 DECL_CONTEXT (decl
),
2581 DECL_CONTEXT (decl
));
2583 /* Remember the copy. */
2584 splay_tree_insert (st
,
2585 (splay_tree_key
) decl
,
2586 (splay_tree_value
) copy
);
2592 /* Called via walk_tree when an expression is unsaved. Using the
2593 splay_tree pointed to by ST (which is really a `splay_tree *'),
2594 remaps all local declarations to appropriate replacements. */
2597 cp_unsave_r (tp
, walk_subtrees
, data
)
2602 splay_tree st
= (splay_tree
) data
;
2605 /* Only a local declaration (variable or label). */
2606 if (nonstatic_local_decl_p (*tp
))
2608 /* Lookup the declaration. */
2609 n
= splay_tree_lookup (st
, (splay_tree_key
) *tp
);
2611 /* If it's there, remap it. */
2613 *tp
= (tree
) n
->value
;
2615 else if (TREE_CODE (*tp
) == SAVE_EXPR
)
2616 remap_save_expr (tp
, st
, current_function_decl
, walk_subtrees
);
2619 copy_tree_r (tp
, walk_subtrees
, NULL
);
2621 /* Do whatever unsaving is required. */
2622 unsave_expr_1 (*tp
);
2625 /* Keep iterating. */
2629 /* Called by unsave_expr_now whenever an expression (*TP) needs to be
2638 /* Create a splay-tree to map old local variable declarations to new
2640 st
= splay_tree_new (splay_tree_compare_pointers
, NULL
, NULL
);
2642 /* Walk the tree once figuring out what needs to be remapped. */
2643 walk_tree (tp
, mark_local_for_remap_r
, st
);
2645 /* Walk the tree again, copying, remapping, and unsaving. */
2646 walk_tree (tp
, cp_unsave_r
, st
);
2649 splay_tree_delete (st
);