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 "splay-tree.h"
33 static tree bot_manip PROTO((tree *, int *, void *));
34 static tree bot_replace PROTO((tree *, int *, void *));
35 static tree build_cplus_array_type_1 PROTO((tree, tree));
36 static void list_hash_add PROTO((int, tree));
37 static int list_hash PROTO((tree, tree, tree));
38 static tree list_hash_lookup PROTO((int, tree, tree, tree));
39 static void propagate_binfo_offsets PROTO((tree, tree));
40 static int avoid_overlap 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 tree copy_tree_r PROTO ((tree *, int *, void *));
46 static tree build_target_expr PROTO((tree, tree));
48 #define CEIL(x,y) (((x) + (y) - 1) / (y))
50 /* If REF is an lvalue, returns the kind of lvalue that REF is.
51 Otherwise, returns clk_none. If TREAT_CLASS_RVALUES_AS_LVALUES is
52 non-zero, rvalues of class type are considered lvalues. */
55 lvalue_p_1 (ref, treat_class_rvalues_as_lvalues)
57 int treat_class_rvalues_as_lvalues;
59 cp_lvalue_kind op1_lvalue_kind = clk_none;
60 cp_lvalue_kind op2_lvalue_kind = clk_none;
62 if (TREE_CODE (TREE_TYPE (ref)) == REFERENCE_TYPE)
65 if (ref == current_class_ptr && flag_this_is_variable <= 0)
68 switch (TREE_CODE (ref))
70 /* preincrements and predecrements are valid lvals, provided
71 what they refer to are valid lvals. */
72 case PREINCREMENT_EXPR:
73 case PREDECREMENT_EXPR:
77 case WITH_CLEANUP_EXPR:
81 return lvalue_p_1 (TREE_OPERAND (ref, 0),
82 treat_class_rvalues_as_lvalues);
85 op1_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 0),
86 treat_class_rvalues_as_lvalues);
88 /* The "field" can be a FUNCTION_DECL or an OVERLOAD in some
90 && TREE_CODE (TREE_OPERAND (ref, 1)) == FIELD_DECL
91 && DECL_C_BIT_FIELD (TREE_OPERAND (ref, 1)))
93 /* Clear the ordinary bit. If this object was a class
94 rvalue we want to preserve that information. */
95 op1_lvalue_kind &= ~clk_ordinary;
96 /* The lvalue is for a btifield. */
97 op1_lvalue_kind |= clk_bitfield;
99 return op1_lvalue_kind;
105 if (TREE_READONLY (ref) && ! TREE_STATIC (ref)
106 && DECL_LANG_SPECIFIC (ref)
107 && DECL_IN_AGGR_P (ref))
113 if (TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE)
117 /* A currently unresolved scope ref. */
119 my_friendly_abort (103);
121 if (TREE_CODE (TREE_OPERAND (ref, 1)) == FUNCTION_DECL)
126 op1_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 0),
127 treat_class_rvalues_as_lvalues);
128 op2_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 1),
129 treat_class_rvalues_as_lvalues);
133 op1_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 1),
134 treat_class_rvalues_as_lvalues);
135 op2_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 2),
136 treat_class_rvalues_as_lvalues);
143 return lvalue_p_1 (TREE_OPERAND (ref, 1),
144 treat_class_rvalues_as_lvalues);
147 return treat_class_rvalues_as_lvalues ? clk_class : clk_none;
151 return ((treat_class_rvalues_as_lvalues
152 && IS_AGGR_TYPE (TREE_TYPE (ref)))
153 ? clk_class : clk_none);
156 /* All functions (except non-static-member functions) are
158 return (DECL_NONSTATIC_MEMBER_FUNCTION_P (ref)
159 ? clk_none : clk_ordinary);
165 /* If one operand is not an lvalue at all, then this expression is
167 if (!op1_lvalue_kind || !op2_lvalue_kind)
170 /* Otherwise, it's an lvalue, and it has all the odd properties
171 contributed by either operand. */
172 op1_lvalue_kind = op1_lvalue_kind | op2_lvalue_kind;
173 /* It's not an ordinary lvalue if it involves either a bit-field or
175 if ((op1_lvalue_kind & ~clk_ordinary) != clk_none)
176 op1_lvalue_kind &= ~clk_ordinary;
177 return op1_lvalue_kind;
180 /* If REF is an lvalue, returns the kind of lvalue that REF is.
181 Otherwise, returns clk_none. Lvalues can be assigned, unless they
182 have TREE_READONLY, or unless they are FUNCTION_DECLs. Lvalues can
183 have their address taken, unless they have DECL_REGISTER. */
189 return lvalue_p_1 (ref, /*treat_class_rvalues_as_lvalues=*/0);
192 /* This differs from real_lvalue_p in that class rvalues are
193 considered lvalues. */
200 (lvalue_p_1 (ref, /*treat_class_rvalues_as_lvalues=*/1) != clk_none);
203 /* Return nonzero if REF is an lvalue valid for this language;
204 otherwise, print an error message and return zero. */
207 lvalue_or_else (ref, string)
211 int win = lvalue_p (ref);
213 error ("non-lvalue in %s", string);
217 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
220 build_target_expr (decl, value)
226 t = build (TARGET_EXPR, TREE_TYPE (decl), decl, value,
227 maybe_build_cleanup (decl), NULL_TREE);
228 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
229 ignore the TARGET_EXPR. If there really turn out to be no
230 side-effects, then the optimizer should be able to get rid of
231 whatever code is generated anyhow. */
232 TREE_SIDE_EFFECTS (t) = 1;
237 /* INIT is a CALL_EXPR which needs info about its target.
238 TYPE is the type that this initialization should appear to have.
240 Build an encapsulation of the initialization to perform
241 and return it so that it can be processed by language-independent
242 and language-specific expression expanders. */
245 build_cplus_new (type, init)
253 /* Make sure that we're not trying to create an instance of an
255 abstract_virtuals_error (NULL_TREE, type);
257 if (TREE_CODE (init) != CALL_EXPR && TREE_CODE (init) != AGGR_INIT_EXPR)
258 return convert (type, init);
260 slot = build (VAR_DECL, type);
261 DECL_ARTIFICIAL (slot) = 1;
262 layout_decl (slot, 0);
264 /* We split the CALL_EXPR into its function and its arguments here.
265 Then, in expand_expr, we put them back together. The reason for
266 this is that this expression might be a default argument
267 expression. In that case, we need a new temporary every time the
268 expression is used. That's what break_out_target_exprs does; it
269 replaces every AGGR_INIT_EXPR with a copy that uses a fresh
270 temporary slot. Then, expand_expr builds up a call-expression
271 using the new slot. */
272 fn = TREE_OPERAND (init, 0);
273 rval = build (AGGR_INIT_EXPR, type, fn, TREE_OPERAND (init, 1), slot);
274 TREE_SIDE_EFFECTS (rval) = 1;
275 AGGR_INIT_VIA_CTOR_P (rval)
276 = (TREE_CODE (fn) == ADDR_EXPR
277 && TREE_CODE (TREE_OPERAND (fn, 0)) == FUNCTION_DECL
278 && DECL_CONSTRUCTOR_P (TREE_OPERAND (fn, 0)));
279 rval = build_target_expr (slot, rval);
284 /* Buidl a TARGET_EXPR using INIT to initialize a new temporary of the
288 build_target_expr_with_type (init, type)
295 slot = build (VAR_DECL, type);
296 DECL_ARTIFICIAL (slot) = 1;
297 DECL_CONTEXT (slot) = current_function_decl;
298 layout_decl (slot, 0);
299 rval = build_target_expr (slot, init);
304 /* Like build_target_expr_with_type, but use the type of INIT. */
307 get_target_expr (init)
310 return build_target_expr_with_type (init, TREE_TYPE (init));
313 /* Recursively search EXP for CALL_EXPRs that need cleanups and replace
314 these CALL_EXPRs with tree nodes that will perform the cleanups. */
317 break_out_cleanups (exp)
322 if (TREE_CODE (tmp) == CALL_EXPR
323 && TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (tmp)))
324 return build_cplus_new (TREE_TYPE (tmp), tmp);
326 while (TREE_CODE (tmp) == NOP_EXPR
327 || TREE_CODE (tmp) == CONVERT_EXPR
328 || TREE_CODE (tmp) == NON_LVALUE_EXPR)
330 if (TREE_CODE (TREE_OPERAND (tmp, 0)) == CALL_EXPR
331 && TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (TREE_OPERAND (tmp, 0))))
333 TREE_OPERAND (tmp, 0)
334 = build_cplus_new (TREE_TYPE (TREE_OPERAND (tmp, 0)),
335 TREE_OPERAND (tmp, 0));
339 tmp = TREE_OPERAND (tmp, 0);
344 /* Recursively perform a preorder search EXP for CALL_EXPRs, making
345 copies where they are found. Returns a deep copy all nodes transitively
346 containing CALL_EXPRs. */
349 break_out_calls (exp)
352 register tree t1, t2 = NULL_TREE;
353 register enum tree_code code;
354 register int changed = 0;
357 if (exp == NULL_TREE)
360 code = TREE_CODE (exp);
362 if (code == CALL_EXPR)
363 return copy_node (exp);
365 /* Don't try and defeat a save_expr, as it should only be done once. */
366 if (code == SAVE_EXPR)
369 switch (TREE_CODE_CLASS (code))
374 case 'c': /* a constant */
375 case 't': /* a type node */
376 case 'x': /* something random, like an identifier or an ERROR_MARK. */
379 case 'd': /* A decl node */
380 #if 0 /* This is bogus. jason 9/21/94 */
382 t1 = break_out_calls (DECL_INITIAL (exp));
383 if (t1 != DECL_INITIAL (exp))
385 exp = copy_node (exp);
386 DECL_INITIAL (exp) = t1;
391 case 'b': /* A block node */
393 /* Don't know how to handle these correctly yet. Must do a
394 break_out_calls on all DECL_INITIAL values for local variables,
395 and also break_out_calls on all sub-blocks and sub-statements. */
400 case 'e': /* an expression */
401 case 'r': /* a reference */
402 case 's': /* an expression with side effects */
403 for (i = tree_code_length[(int) code] - 1; i >= 0; i--)
405 t1 = break_out_calls (TREE_OPERAND (exp, i));
406 if (t1 != TREE_OPERAND (exp, i))
408 exp = copy_node (exp);
409 TREE_OPERAND (exp, i) = t1;
414 case '<': /* a comparison expression */
415 case '2': /* a binary arithmetic expression */
416 t2 = break_out_calls (TREE_OPERAND (exp, 1));
417 if (t2 != TREE_OPERAND (exp, 1))
419 case '1': /* a unary arithmetic expression */
420 t1 = break_out_calls (TREE_OPERAND (exp, 0));
421 if (t1 != TREE_OPERAND (exp, 0))
425 if (tree_code_length[(int) code] == 1)
426 return build1 (code, TREE_TYPE (exp), t1);
428 return build (code, TREE_TYPE (exp), t1, t2);
435 extern struct obstack *current_obstack;
436 extern struct obstack permanent_obstack;
437 extern struct obstack *saveable_obstack;
438 extern struct obstack *expression_obstack;
440 /* Here is how primitive or already-canonicalized types' hash
441 codes are made. MUST BE CONSISTENT WITH tree.c !!! */
442 #define TYPE_HASH(TYPE) ((HOST_WIDE_INT) (TYPE) & 0777777)
444 /* Construct, lay out and return the type of methods belonging to class
445 BASETYPE and whose arguments are described by ARGTYPES and whose values
446 are described by RETTYPE. If each type exists already, reuse it. */
449 build_cplus_method_type (basetype, rettype, argtypes)
450 tree basetype, rettype, argtypes;
456 /* Make a node of the sort we want. */
457 t = make_node (METHOD_TYPE);
459 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
460 TREE_TYPE (t) = rettype;
461 ptype = build_pointer_type (basetype);
463 /* The actual arglist for this function includes a "hidden" argument
464 which is "this". Put it into the list of argument types. Make
465 sure that the new argument list is allocated on the same obstack
467 push_obstacks (TYPE_OBSTACK (t), TYPE_OBSTACK (t));
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". */
473 /* If we already have such a type, use the old one and free this one.
474 Note that it also frees up the above cons cell if found. */
475 hashcode = TYPE_HASH (basetype) + TYPE_HASH (rettype) +
476 type_hash_list (argtypes);
478 t = type_hash_canon (hashcode, t);
480 if (TYPE_SIZE (t) == 0)
487 build_cplus_array_type_1 (elt_type, index_type)
493 if (elt_type == error_mark_node || index_type == error_mark_node)
494 return error_mark_node;
496 if (processing_template_decl
497 || uses_template_parms (elt_type)
498 || uses_template_parms (index_type))
500 t = make_node (ARRAY_TYPE);
501 TREE_TYPE (t) = elt_type;
502 TYPE_DOMAIN (t) = index_type;
505 t = build_array_type (elt_type, index_type);
507 /* Push these needs up so that initialization takes place
509 TYPE_NEEDS_CONSTRUCTING (t)
510 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (elt_type));
511 TYPE_NEEDS_DESTRUCTOR (t)
512 = TYPE_NEEDS_DESTRUCTOR (TYPE_MAIN_VARIANT (elt_type));
517 build_cplus_array_type (elt_type, index_type)
522 int type_quals = CP_TYPE_QUALS (elt_type);
524 elt_type = TYPE_MAIN_VARIANT (elt_type);
526 t = build_cplus_array_type_1 (elt_type, index_type);
528 if (type_quals != TYPE_UNQUALIFIED)
529 t = cp_build_qualified_type (t, type_quals);
534 /* Make a variant of TYPE, qualified with the TYPE_QUALS. Handles
535 arrays correctly. In particular, if TYPE is an array of T's, and
536 TYPE_QUALS is non-empty, returns an array of qualified T's. If
537 at attempt is made to qualify a type illegally, and COMPLAIN is
538 non-zero, an error is issued. If COMPLAIN is zero, error_mark_node
542 cp_build_qualified_type_real (type, type_quals, complain)
549 if (type == error_mark_node)
552 if (type_quals == TYPE_QUALS (type))
555 /* A restrict-qualified pointer type must be a pointer (or reference)
556 to object or incomplete type. */
557 if ((type_quals & TYPE_QUAL_RESTRICT)
558 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
559 && (!POINTER_TYPE_P (type)
560 || TYPE_PTRMEM_P (type)
561 || TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE))
564 cp_error ("`%T' cannot be `restrict'-qualified", type);
566 return error_mark_node;
568 type_quals &= ~TYPE_QUAL_RESTRICT;
571 if (type_quals != TYPE_UNQUALIFIED
572 && TREE_CODE (type) == FUNCTION_TYPE)
575 cp_error ("`%T' cannot be `const'-, `volatile'-, or `restrict'-qualified", type);
577 return error_mark_node;
578 type_quals = TYPE_UNQUALIFIED;
580 else if (TREE_CODE (type) == ARRAY_TYPE)
582 /* In C++, the qualification really applies to the array element
583 type. Obtain the appropriately qualified element type. */
586 = cp_build_qualified_type_real (TREE_TYPE (type),
590 if (element_type == error_mark_node)
591 return error_mark_node;
593 /* See if we already have an identically qualified type. */
594 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
595 if (CP_TYPE_QUALS (t) == type_quals)
598 /* If we didn't already have it, create it now. */
601 /* Make a new array type, just like the old one, but with the
602 appropriately qualified element type. */
603 t = build_type_copy (type);
604 TREE_TYPE (t) = element_type;
607 /* Even if we already had this variant, we update
608 TYPE_NEEDS_CONSTRUCTING and TYPE_NEEDS_DESTRUCTOR in case
609 they changed since the variant was originally created.
611 This seems hokey; if there is some way to use a previous
612 variant *without* coming through here,
613 TYPE_NEEDS_CONSTRUCTING will never be updated. */
614 TYPE_NEEDS_CONSTRUCTING (t)
615 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (element_type));
616 TYPE_NEEDS_DESTRUCTOR (t)
617 = TYPE_NEEDS_DESTRUCTOR (TYPE_MAIN_VARIANT (element_type));
620 else if (TYPE_PTRMEMFUNC_P (type))
622 /* For a pointer-to-member type, we can't just return a
623 cv-qualified version of the RECORD_TYPE. If we do, we
624 haven't change the field that contains the actual pointer to
625 a method, and so TYPE_PTRMEMFUNC_FN_TYPE will be wrong. */
628 t = TYPE_PTRMEMFUNC_FN_TYPE (type);
629 t = cp_build_qualified_type_real (t, type_quals, complain);
630 return build_ptrmemfunc_type (t);
633 /* Retrieve (or create) the appropriately qualified variant. */
634 result = build_qualified_type (type, type_quals);
636 /* If this was a pointer-to-method type, and we just made a copy,
637 then we need to clear the cached associated
638 pointer-to-member-function type; it is not valid for the new
641 && TREE_CODE (type) == POINTER_TYPE
642 && TREE_CODE (TREE_TYPE (type)) == METHOD_TYPE)
643 TYPE_SET_PTRMEMFUNC_TYPE (result, NULL_TREE);
648 /* Returns the canonical version of TYPE. In other words, if TYPE is
649 a typedef, returns the underlying type. The cv-qualification of
650 the type returned matches the type input; they will always be
654 canonical_type_variant (t)
657 return cp_build_qualified_type (TYPE_MAIN_VARIANT (t), CP_TYPE_QUALS (t));
660 /* Add OFFSET to all base types of T.
662 OFFSET, which is a type offset, is number of bytes.
664 Note that we don't have to worry about having two paths to the
665 same base type, since this type owns its association list. */
668 propagate_binfo_offsets (binfo, offset)
672 tree binfos = BINFO_BASETYPES (binfo);
673 int i, n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0;
675 for (i = 0; i < n_baselinks; /* note increment is done in the loop. */)
677 tree base_binfo = TREE_VEC_ELT (binfos, i);
679 if (TREE_VIA_VIRTUAL (base_binfo))
684 tree delta = NULL_TREE;
686 for (j = i+1; j < n_baselinks; j++)
687 if (! TREE_VIA_VIRTUAL (TREE_VEC_ELT (binfos, j)))
689 /* The next basetype offset must take into account the space
690 between the classes, not just the size of each class. */
691 delta = size_binop (MINUS_EXPR,
692 BINFO_OFFSET (TREE_VEC_ELT (binfos, j)),
693 BINFO_OFFSET (base_binfo));
698 if (BINFO_OFFSET_ZEROP (base_binfo))
699 BINFO_OFFSET (base_binfo) = offset;
701 BINFO_OFFSET (base_binfo)
702 = size_binop (PLUS_EXPR, BINFO_OFFSET (base_binfo), offset);
704 BINFO_OFFSET (base_binfo) = offset;
707 propagate_binfo_offsets (base_binfo, offset);
709 /* Go to our next class that counts for offset propagation. */
712 offset = size_binop (PLUS_EXPR, offset, delta);
717 /* Makes new binfos for the indirect bases under BINFO, and updates
718 BINFO_OFFSET for them and their bases. */
721 unshare_base_binfos (binfo)
724 tree binfos = BINFO_BASETYPES (binfo);
728 if (binfos == NULL_TREE)
731 /* Now unshare the structure beneath BINFO. */
732 for (j = TREE_VEC_LENGTH (binfos)-1;
735 tree base_binfo = TREE_VEC_ELT (binfos, j);
736 new_binfo = TREE_VEC_ELT (binfos, j)
737 = make_binfo (BINFO_OFFSET (base_binfo),
739 BINFO_VTABLE (base_binfo),
740 BINFO_VIRTUALS (base_binfo));
741 TREE_VIA_PUBLIC (new_binfo) = TREE_VIA_PUBLIC (base_binfo);
742 TREE_VIA_PROTECTED (new_binfo) = TREE_VIA_PROTECTED (base_binfo);
743 TREE_VIA_VIRTUAL (new_binfo) = TREE_VIA_VIRTUAL (base_binfo);
744 BINFO_INHERITANCE_CHAIN (new_binfo) = binfo;
745 unshare_base_binfos (new_binfo);
749 /* Finish the work of layout_record, now taking virtual bases into account.
750 Also compute the actual offsets that our base classes will have.
751 This must be performed after the fields are laid out, since virtual
752 baseclasses must lay down at the end of the record.
754 Returns the maximum number of virtual functions any of the
755 baseclasses provide. */
758 layout_basetypes (rec, max)
762 tree binfos = TYPE_BINFO_BASETYPES (rec);
763 int i, n_baseclasses = binfos ? TREE_VEC_LENGTH (binfos) : 0;
767 unsigned int record_align = MAX (BITS_PER_UNIT, TYPE_ALIGN (rec));
768 unsigned int desired_align;
770 /* Record size so far is CONST_SIZE bits, where CONST_SIZE is an integer. */
771 register unsigned int const_size = 0;
772 unsigned int nonvirtual_const_size;
774 #ifdef STRUCTURE_SIZE_BOUNDARY
775 /* Packed structures don't need to have minimum size. */
776 if (! TYPE_PACKED (rec))
777 record_align = MAX (record_align, STRUCTURE_SIZE_BOUNDARY);
780 /* Get all the virtual base types that this type uses. The
781 TREE_VALUE slot holds the virtual baseclass type. Note that
782 get_vbase_types makes copies of the virtual base BINFOs, so that
783 the vbase_types are unshared. */
784 vbase_types = CLASSTYPE_VBASECLASSES (rec);
786 my_friendly_assert (TREE_CODE (TYPE_SIZE (rec)) == INTEGER_CST, 19970302);
787 const_size = TREE_INT_CST_LOW (TYPE_SIZE (rec));
789 nonvirtual_const_size = const_size;
793 tree basetype = BINFO_TYPE (vbase_types);
796 desired_align = TYPE_ALIGN (basetype);
797 record_align = MAX (record_align, desired_align);
800 offset = integer_zero_node;
803 /* Give each virtual base type the alignment it wants. */
804 const_size = CEIL (const_size, desired_align) * desired_align;
805 offset = size_int (CEIL (const_size, BITS_PER_UNIT));
808 if (CLASSTYPE_VSIZE (basetype) > max)
809 max = CLASSTYPE_VSIZE (basetype);
810 BINFO_OFFSET (vbase_types) = offset;
812 /* Every virtual baseclass takes a least a UNIT, so that we can
813 take it's address and get something different for each base. */
814 const_size += MAX (BITS_PER_UNIT,
815 TREE_INT_CST_LOW (CLASSTYPE_SIZE (basetype)));
817 vbase_types = TREE_CHAIN (vbase_types);
822 /* Because a virtual base might take a single byte above,
823 we have to re-adjust the total size to make sure it is
824 a multiple of the alignment. */
825 /* Give the whole object the alignment it wants. */
826 const_size = CEIL (const_size, record_align) * record_align;
829 /* Set the alignment in the complete type. We don't set CLASSTYPE_ALIGN
830 here, as that is for this class, without any virtual base classes. */
831 TYPE_ALIGN (rec) = record_align;
832 if (const_size != nonvirtual_const_size)
834 TYPE_SIZE (rec) = size_int (const_size);
835 TYPE_SIZE_UNIT (rec) = size_binop (FLOOR_DIV_EXPR, TYPE_SIZE (rec),
836 size_int (BITS_PER_UNIT));
839 /* Now propagate offset information throughout the lattice. */
840 for (i = 0; i < n_baseclasses; i++)
842 register tree base_binfo = TREE_VEC_ELT (binfos, i);
843 register tree basetype = BINFO_TYPE (base_binfo);
844 tree field = TYPE_FIELDS (rec);
846 if (TREE_VIA_VIRTUAL (base_binfo))
849 my_friendly_assert (TREE_TYPE (field) == basetype, 23897);
851 if (get_base_distance (basetype, rec, 0, (tree*)0) == -2)
852 cp_warning ("direct base `%T' inaccessible in `%T' due to ambiguity",
855 BINFO_OFFSET (base_binfo)
856 = size_int (CEIL (TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field)),
858 propagate_binfo_offsets (base_binfo, BINFO_OFFSET (base_binfo));
859 TYPE_FIELDS (rec) = TREE_CHAIN (field);
862 for (vbase_types = CLASSTYPE_VBASECLASSES (rec); vbase_types;
863 vbase_types = TREE_CHAIN (vbase_types))
865 BINFO_INHERITANCE_CHAIN (vbase_types) = TYPE_BINFO (rec);
866 unshare_base_binfos (vbase_types);
867 propagate_binfo_offsets (vbase_types, BINFO_OFFSET (vbase_types));
871 tree basetype = BINFO_TYPE (vbase_types);
872 if (get_base_distance (basetype, rec, 0, (tree*)0) == -2)
873 cp_warning ("virtual base `%T' inaccessible in `%T' due to ambiguity",
881 /* If the empty base field in DECL overlaps with a base of the same type in
882 NEWDECL, which is either another base field or the first data field of
883 the class, pad the base just before NEWDECL and return 1. Otherwise,
887 avoid_overlap (decl, newdecl)
892 if (newdecl == NULL_TREE
893 || ! types_overlap_p (TREE_TYPE (decl), TREE_TYPE (newdecl)))
896 for (field = decl; TREE_CHAIN (field) && TREE_CHAIN (field) != newdecl;
897 field = TREE_CHAIN (field))
900 DECL_SIZE (field) = integer_one_node;
905 /* Returns a list of fields to stand in for the base class subobjects
906 of REC. These fields are later removed by layout_basetypes. */
909 build_base_fields (rec)
912 /* Chain to hold all the new FIELD_DECLs which stand in for base class
914 tree base_decls = NULL_TREE;
915 tree binfos = TYPE_BINFO_BASETYPES (rec);
916 int n_baseclasses = binfos ? TREE_VEC_LENGTH (binfos) : 0;
918 int i, saw_empty = 0;
919 unsigned int base_align = 0;
921 for (i = 0; i < n_baseclasses; ++i)
923 register tree base_binfo = TREE_VEC_ELT (binfos, i);
924 register tree basetype = BINFO_TYPE (base_binfo);
926 if (TYPE_SIZE (basetype) == 0)
927 /* This error is now reported in xref_tag, thus giving better
928 location information. */
931 if (TREE_VIA_VIRTUAL (base_binfo))
934 decl = build_lang_decl (FIELD_DECL, NULL_TREE, basetype);
935 DECL_ARTIFICIAL (decl) = 1;
936 DECL_FIELD_CONTEXT (decl) = DECL_CLASS_CONTEXT (decl) = rec;
937 DECL_SIZE (decl) = CLASSTYPE_SIZE (basetype);
938 DECL_ALIGN (decl) = CLASSTYPE_ALIGN (basetype);
939 TREE_CHAIN (decl) = base_decls;
944 /* Brain damage for backwards compatibility. For no good reason,
945 the old layout_basetypes made every base at least as large as
946 the alignment for the bases up to that point, gratuitously
947 wasting space. So we do the same thing here. */
948 base_align = MAX (base_align, DECL_ALIGN (decl));
950 = size_int (MAX (TREE_INT_CST_LOW (DECL_SIZE (decl)),
953 else if (DECL_SIZE (decl) == integer_zero_node)
957 /* Reverse the list of fields so we allocate the bases in the proper
959 base_decls = nreverse (base_decls);
961 /* In the presence of empty base classes, we run the risk of allocating
962 two objects of the same class on top of one another. Avoid that. */
963 if (flag_new_abi && saw_empty)
964 for (decl = base_decls; decl; decl = TREE_CHAIN (decl))
966 if (DECL_SIZE (decl) == integer_zero_node)
968 /* First step through the following bases until we find
969 an overlap or a non-empty base. */
970 for (nextdecl = TREE_CHAIN (decl); nextdecl;
971 nextdecl = TREE_CHAIN (nextdecl))
973 if (avoid_overlap (decl, nextdecl)
974 || DECL_SIZE (nextdecl) != integer_zero_node)
978 /* If we're still looking, also check against the first
980 for (nextdecl = TYPE_FIELDS (rec);
981 nextdecl && TREE_CODE (nextdecl) != FIELD_DECL;
982 nextdecl = TREE_CHAIN (nextdecl))
984 avoid_overlap (decl, nextdecl);
992 /* Returns list of virtual base class pointers in a FIELD_DECL chain. */
995 build_vbase_pointer_fields (rec)
998 /* Chain to hold all the new FIELD_DECLs which point at virtual
1000 tree vbase_decls = NULL_TREE;
1001 tree binfos = TYPE_BINFO_BASETYPES (rec);
1002 int n_baseclasses = binfos ? TREE_VEC_LENGTH (binfos) : 0;
1006 /* Handle basetypes almost like fields, but record their
1007 offsets differently. */
1009 for (i = 0; i < n_baseclasses; i++)
1011 register tree base_binfo = TREE_VEC_ELT (binfos, i);
1012 register tree basetype = BINFO_TYPE (base_binfo);
1014 if (TYPE_SIZE (basetype) == 0)
1015 /* This error is now reported in xref_tag, thus giving better
1016 location information. */
1019 /* All basetypes are recorded in the association list of the
1022 if (TREE_VIA_VIRTUAL (base_binfo))
1027 /* The offset for a virtual base class is only used in computing
1028 virtual function tables and for initializing virtual base
1029 pointers. It is built once `get_vbase_types' is called. */
1031 /* If this basetype can come from another vbase pointer
1032 without an additional indirection, we will share
1033 that pointer. If an indirection is involved, we
1034 make our own pointer. */
1035 for (j = 0; j < n_baseclasses; j++)
1037 tree other_base_binfo = TREE_VEC_ELT (binfos, j);
1038 if (! TREE_VIA_VIRTUAL (other_base_binfo)
1039 && binfo_member (basetype,
1040 CLASSTYPE_VBASECLASSES (BINFO_TYPE
1045 FORMAT_VBASE_NAME (name, basetype);
1046 decl = build_lang_decl (FIELD_DECL, get_identifier (name),
1047 build_pointer_type (basetype));
1048 /* If you change any of the below, take a look at all the
1049 other VFIELD_BASEs and VTABLE_BASEs in the code, and change
1051 DECL_ASSEMBLER_NAME (decl) = get_identifier (VTABLE_BASE);
1052 DECL_VIRTUAL_P (decl) = 1;
1053 DECL_ARTIFICIAL (decl) = 1;
1054 DECL_FIELD_CONTEXT (decl) = rec;
1055 DECL_CLASS_CONTEXT (decl) = rec;
1056 DECL_FCONTEXT (decl) = basetype;
1057 DECL_SAVED_INSNS (decl) = 0;
1058 DECL_FIELD_SIZE (decl) = 0;
1059 DECL_ALIGN (decl) = TYPE_ALIGN (ptr_type_node);
1060 TREE_CHAIN (decl) = vbase_decls;
1061 BINFO_VPTR_FIELD (base_binfo) = decl;
1065 /* The space this decl occupies has already been accounted for. */
1073 /* Hashing of lists so that we don't make duplicates.
1074 The entry point is `list_hash_canon'. */
1076 /* Each hash table slot is a bucket containing a chain
1077 of these structures. */
1081 struct list_hash *next; /* Next structure in the bucket. */
1082 int hashcode; /* Hash code of this list. */
1083 tree list; /* The list recorded here. */
1086 /* Now here is the hash table. When recording a list, it is added
1087 to the slot whose index is the hash code mod the table size.
1088 Note that the hash table is used for several kinds of lists.
1089 While all these live in the same table, they are completely independent,
1090 and the hash code is computed differently for each of these. */
1092 #define TYPE_HASH_SIZE 59
1093 static struct list_hash *list_hash_table[TYPE_HASH_SIZE];
1095 /* Compute a hash code for a list (chain of TREE_LIST nodes
1096 with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the
1097 TREE_COMMON slots), by adding the hash codes of the individual entries. */
1100 list_hash (purpose, value, chain)
1101 tree purpose, value, chain;
1103 register int hashcode = 0;
1106 hashcode += TYPE_HASH (chain);
1109 hashcode += TYPE_HASH (value);
1113 hashcode += TYPE_HASH (purpose);
1119 /* Look in the type hash table for a type isomorphic to TYPE.
1120 If one is found, return it. Otherwise return 0. */
1123 list_hash_lookup (hashcode, purpose, value, chain)
1125 tree purpose, value, chain;
1127 register struct list_hash *h;
1129 for (h = list_hash_table[hashcode % TYPE_HASH_SIZE]; h; h = h->next)
1130 if (h->hashcode == hashcode
1131 && TREE_PURPOSE (h->list) == purpose
1132 && TREE_VALUE (h->list) == value
1133 && TREE_CHAIN (h->list) == chain)
1138 /* Add an entry to the list-hash-table
1139 for a list TYPE whose hash code is HASHCODE. */
1142 list_hash_add (hashcode, list)
1146 register struct list_hash *h;
1148 h = (struct list_hash *) obstack_alloc (&permanent_obstack, sizeof (struct list_hash));
1149 h->hashcode = hashcode;
1151 h->next = list_hash_table[hashcode % TYPE_HASH_SIZE];
1152 list_hash_table[hashcode % TYPE_HASH_SIZE] = h;
1155 /* Given list components PURPOSE, VALUE, AND CHAIN, return the canonical
1156 object for an identical list if one already exists. Otherwise, build a
1157 new one, and record it as the canonical object. */
1159 /* Set to 1 to debug without canonicalization. Never set by program. */
1161 static int debug_no_list_hash = 0;
1164 hash_tree_cons (purpose, value, chain)
1165 tree purpose, value, chain;
1170 if (! debug_no_list_hash)
1172 hashcode = list_hash (purpose, value, chain);
1173 t = list_hash_lookup (hashcode, purpose, value, chain);
1178 t = tree_cons (purpose, value, chain);
1180 /* If this is a new list, record it for later reuse. */
1181 if (! debug_no_list_hash)
1182 list_hash_add (hashcode, t);
1187 /* Constructor for hashed lists. */
1190 hash_tree_chain (value, chain)
1193 return hash_tree_cons (NULL_TREE, value, chain);
1196 /* Similar, but used for concatenating two lists. */
1199 hash_chainon (list1, list2)
1206 if (TREE_CHAIN (list1) == NULL_TREE)
1207 return hash_tree_chain (TREE_VALUE (list1), list2);
1208 return hash_tree_chain (TREE_VALUE (list1),
1209 hash_chainon (TREE_CHAIN (list1), list2));
1212 /* Build an association between TYPE and some parameters:
1214 OFFSET is the offset added to `this' to convert it to a pointer
1217 BINFO is the base binfo to use, if we are deriving from one. This
1218 is necessary, as we want specialized parent binfos from base
1219 classes, so that the VTABLE_NAMEs of bases are for the most derived
1220 type, instead of the simple type.
1222 VTABLE is the virtual function table with which to initialize
1223 sub-objects of type TYPE.
1225 VIRTUALS are the virtual functions sitting in VTABLE. */
1228 make_binfo (offset, binfo, vtable, virtuals)
1230 tree vtable, virtuals;
1232 tree new_binfo = make_tree_vec (7);
1235 if (TREE_CODE (binfo) == TREE_VEC)
1236 type = BINFO_TYPE (binfo);
1240 binfo = CLASS_TYPE_P (type) ? TYPE_BINFO (binfo) : NULL_TREE;
1243 TREE_TYPE (new_binfo) = TYPE_MAIN_VARIANT (type);
1244 BINFO_OFFSET (new_binfo) = offset;
1245 BINFO_VTABLE (new_binfo) = vtable;
1246 BINFO_VIRTUALS (new_binfo) = virtuals;
1247 BINFO_VPTR_FIELD (new_binfo) = NULL_TREE;
1249 if (binfo && BINFO_BASETYPES (binfo) != NULL_TREE)
1250 BINFO_BASETYPES (new_binfo) = copy_node (BINFO_BASETYPES (binfo));
1254 /* Return the binfo value for ELEM in TYPE. */
1257 binfo_value (elem, type)
1261 if (get_base_distance (elem, type, 0, (tree *)0) == -2)
1262 compiler_error ("base class `%s' ambiguous in binfo_value",
1263 TYPE_NAME_STRING (elem));
1265 return TYPE_BINFO (type);
1266 if (TREE_CODE (elem) == RECORD_TYPE && TYPE_BINFO (elem) == type)
1268 return get_binfo (elem, type, 0);
1271 /* Return a reversed copy of the BINFO-chain given by PATH. (If the
1272 BINFO_INHERITANCE_CHAIN points from base classes to derived
1273 classes, it will instead point from derived classes to base
1274 classes.) Returns the first node in the reversed chain. */
1280 register tree prev = NULL_TREE, cur;
1281 push_expression_obstack ();
1282 for (cur = path; cur; cur = BINFO_INHERITANCE_CHAIN (cur))
1284 tree r = copy_node (cur);
1285 BINFO_INHERITANCE_CHAIN (r) = prev;
1296 unsigned HOST_WIDE_INT n;
1299 fprintf (stderr, "type \"%s\"; offset = %ld\n",
1300 TYPE_NAME_STRING (BINFO_TYPE (elem)),
1301 (long) TREE_INT_CST_LOW (BINFO_OFFSET (elem)));
1302 fprintf (stderr, "vtable type:\n");
1303 debug_tree (BINFO_TYPE (elem));
1304 if (BINFO_VTABLE (elem))
1305 fprintf (stderr, "vtable decl \"%s\"\n", IDENTIFIER_POINTER (DECL_NAME (BINFO_VTABLE (elem))));
1307 fprintf (stderr, "no vtable decl yet\n");
1308 fprintf (stderr, "virtuals:\n");
1309 virtuals = BINFO_VIRTUALS (elem);
1311 n = skip_rtti_stuff (&virtuals, BINFO_TYPE (elem));
1315 tree fndecl = TREE_VALUE (virtuals);
1316 fprintf (stderr, "%s [%ld =? %ld]\n",
1317 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl)),
1318 (long) n, (long) TREE_INT_CST_LOW (DECL_VINDEX (fndecl)));
1320 virtuals = TREE_CHAIN (virtuals);
1329 if (TREE_CODE (t) == FUNCTION_DECL)
1331 else if (TREE_CODE (t) == OVERLOAD)
1333 for (i=0; t; t = OVL_CHAIN (t))
1338 my_friendly_abort (359);
1343 is_overloaded_fn (x)
1346 /* A baselink is also considered an overloaded function. */
1347 if (TREE_CODE (x) == OFFSET_REF)
1348 x = TREE_OPERAND (x, 1);
1351 return (TREE_CODE (x) == FUNCTION_DECL
1352 || TREE_CODE (x) == TEMPLATE_ID_EXPR
1353 || DECL_FUNCTION_TEMPLATE_P (x)
1354 || TREE_CODE (x) == OVERLOAD);
1358 really_overloaded_fn (x)
1361 /* A baselink is also considered an overloaded function. */
1362 if (TREE_CODE (x) == OFFSET_REF)
1363 x = TREE_OPERAND (x, 1);
1366 return (TREE_CODE (x) == OVERLOAD
1367 && (TREE_CHAIN (x) != NULL_TREE
1368 || DECL_FUNCTION_TEMPLATE_P (OVL_FUNCTION (x))));
1375 my_friendly_assert (is_overloaded_fn (from), 9);
1376 /* A baselink is also considered an overloaded function. */
1377 if (BASELINK_P (from))
1378 from = TREE_VALUE (from);
1379 return OVL_CURRENT (from);
1382 /* Returns nonzero if T is a ->* or .* expression that refers to a
1389 return (TREE_CODE (t) == OFFSET_REF
1390 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (t, 1))));
1393 /* Return a new OVL node, concatenating it with the old one. */
1396 ovl_cons (decl, chain)
1400 tree result = make_node (OVERLOAD);
1401 TREE_TYPE (result) = unknown_type_node;
1402 OVL_FUNCTION (result) = decl;
1403 TREE_CHAIN (result) = chain;
1408 /* Same as ovl_cons, but on the scratch_obstack. */
1411 scratch_ovl_cons (value, chain)
1415 register struct obstack *ambient_obstack = current_obstack;
1416 extern struct obstack *expression_obstack;
1417 current_obstack = expression_obstack;
1418 node = ovl_cons (value, chain);
1419 current_obstack = ambient_obstack;
1423 /* Build a new overloaded function. If this is the first one,
1424 just return it; otherwise, ovl_cons the _DECLs */
1427 build_overload (decl, chain)
1431 if (! chain && TREE_CODE (decl) != TEMPLATE_DECL)
1433 if (chain && TREE_CODE (chain) != OVERLOAD)
1434 chain = ovl_cons (chain, NULL_TREE);
1435 return ovl_cons (decl, chain);
1438 /* True if fn is in ovl. */
1441 ovl_member (fn, ovl)
1445 if (ovl == NULL_TREE)
1447 if (TREE_CODE (ovl) != OVERLOAD)
1449 for (; ovl; ovl = OVL_CHAIN (ovl))
1450 if (OVL_FUNCTION (ovl) == fn)
1456 is_aggr_type_2 (t1, t2)
1459 if (TREE_CODE (t1) != TREE_CODE (t2))
1461 return IS_AGGR_TYPE (t1) && IS_AGGR_TYPE (t2);
1464 #define PRINT_RING_SIZE 4
1467 lang_printable_name (decl, v)
1471 static tree decl_ring[PRINT_RING_SIZE];
1472 static char *print_ring[PRINT_RING_SIZE];
1473 static int ring_counter;
1476 /* Only cache functions. */
1478 || TREE_CODE (decl) != FUNCTION_DECL
1479 || DECL_LANG_SPECIFIC (decl) == 0)
1480 return lang_decl_name (decl, v);
1482 /* See if this print name is lying around. */
1483 for (i = 0; i < PRINT_RING_SIZE; i++)
1484 if (decl_ring[i] == decl)
1485 /* yes, so return it. */
1486 return print_ring[i];
1488 if (++ring_counter == PRINT_RING_SIZE)
1491 if (current_function_decl != NULL_TREE)
1493 if (decl_ring[ring_counter] == current_function_decl)
1495 if (ring_counter == PRINT_RING_SIZE)
1497 if (decl_ring[ring_counter] == current_function_decl)
1498 my_friendly_abort (106);
1501 if (print_ring[ring_counter])
1502 free (print_ring[ring_counter]);
1504 print_ring[ring_counter] = xstrdup (lang_decl_name (decl, v));
1505 decl_ring[ring_counter] = decl;
1506 return print_ring[ring_counter];
1509 /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions
1510 listed in RAISES. */
1513 build_exception_variant (type, raises)
1517 tree v = TYPE_MAIN_VARIANT (type);
1518 int type_quals = TYPE_QUALS (type);
1520 for (; v; v = TYPE_NEXT_VARIANT (v))
1521 if (TYPE_QUALS (v) == type_quals
1522 && comp_except_specs (raises, TYPE_RAISES_EXCEPTIONS (v), 1))
1525 /* Need to build a new variant. */
1526 v = build_type_copy (type);
1527 TYPE_RAISES_EXCEPTIONS (v) = raises;
1531 /* Given a TEMPLATE_TEMPLATE_PARM node T, create a new one together with its
1532 lang_specific field and its corresponding TEMPLATE_DECL node */
1535 copy_template_template_parm (t)
1538 tree template = TYPE_NAME (t);
1541 /* Make sure these end up on the permanent_obstack. */
1542 push_permanent_obstack ();
1544 t2 = make_lang_type (TEMPLATE_TEMPLATE_PARM);
1545 template = copy_node (template);
1546 copy_lang_decl (template);
1550 TREE_TYPE (template) = t2;
1551 TYPE_NAME (t2) = template;
1552 TYPE_STUB_DECL (t2) = template;
1554 /* No need to copy these */
1555 TYPE_FIELDS (t2) = TYPE_FIELDS (t);
1556 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2)
1557 = TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t);
1561 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal.
1562 FUNC is called with the DATA and the address of each sub-tree. If
1563 FUNC returns a non-NULL value, the traversal is aborted, and the
1564 value returned by FUNC is returned. */
1567 walk_tree (tp, func, data)
1572 enum tree_code code;
1576 #define WALK_SUBTREE(NODE) \
1579 result = walk_tree (&(NODE), func, data); \
1585 /* Skip empty subtrees. */
1589 /* Call the function. */
1591 result = (*func) (tp, &walk_subtrees, data);
1593 /* If we found something, return it. */
1597 /* Even if we didn't, FUNC may have decided that there was nothing
1598 interesting below this point in the tree. */
1602 code = TREE_CODE (*tp);
1604 /* Handle commmon cases up front. */
1605 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code))
1606 || TREE_CODE_CLASS (code) == 'r')
1610 /* Walk over all the sub-trees of this operand. */
1611 for (i = first_rtl_op (code) - 1; i >= 0; --i)
1612 WALK_SUBTREE (TREE_OPERAND (*tp, i));
1614 /* We didn't find what we were looking for. */
1617 else if (TREE_CODE_CLASS (code) == 'd')
1619 WALK_SUBTREE (TREE_TYPE (*tp));
1620 WALK_SUBTREE (DECL_INITIAL (*tp));
1621 WALK_SUBTREE (DECL_SIZE (*tp));
1623 /* We didn't find what we were looking for. */
1627 /* Not one of the easy cases. We must explicitly go through the
1632 case IDENTIFIER_NODE:
1637 case TEMPLATE_TEMPLATE_PARM:
1638 case TEMPLATE_PARM_INDEX:
1639 case TEMPLATE_TYPE_PARM:
1649 /* None of thse have subtrees other than those already walked
1654 WALK_SUBTREE (TREE_TYPE (*tp));
1658 case REFERENCE_TYPE:
1659 WALK_SUBTREE (TREE_TYPE (*tp));
1663 WALK_SUBTREE (TREE_PURPOSE (*tp));
1664 WALK_SUBTREE (TREE_VALUE (*tp));
1665 WALK_SUBTREE (TREE_CHAIN (*tp));
1669 WALK_SUBTREE (OVL_FUNCTION (*tp));
1670 WALK_SUBTREE (OVL_CHAIN (*tp));
1675 int len = TREE_VEC_LENGTH (*tp);
1677 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
1682 WALK_SUBTREE (TREE_REALPART (*tp));
1683 WALK_SUBTREE (TREE_IMAGPART (*tp));
1687 WALK_SUBTREE (CONSTRUCTOR_ELTS (*tp));
1691 WALK_SUBTREE (TYPE_METHOD_BASETYPE (*tp));
1695 WALK_SUBTREE (TREE_TYPE (*tp));
1696 WALK_SUBTREE (TYPE_ARG_TYPES (*tp));
1700 WALK_SUBTREE (TREE_TYPE (*tp));
1701 WALK_SUBTREE (TYPE_DOMAIN (*tp));
1705 WALK_SUBTREE (TYPE_MIN_VALUE (*tp));
1706 WALK_SUBTREE (TYPE_MAX_VALUE (*tp));
1710 WALK_SUBTREE (TREE_TYPE (*tp));
1711 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (*tp));
1715 if (TYPE_PTRMEMFUNC_P (*tp))
1716 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (*tp));
1720 my_friendly_abort (19990803);
1723 /* We didn't find what we were looking for. */
1729 /* Passed to walk_tree. Checks for the use of types with no linkage. */
1732 no_linkage_helper (tp, walk_subtrees, data)
1734 int *walk_subtrees ATTRIBUTE_UNUSED;
1735 void *data ATTRIBUTE_UNUSED;
1740 && (IS_AGGR_TYPE (t) || TREE_CODE (t) == ENUMERAL_TYPE)
1741 && (decl_function_context (TYPE_MAIN_DECL (t))
1742 || ANON_AGGRNAME_P (TYPE_IDENTIFIER (t))))
1747 /* Check if the type T depends on a type with no linkage and if so, return
1751 no_linkage_check (t)
1754 /* There's no point in checking linkage on template functions; we
1755 can't know their complete types. */
1756 if (processing_template_decl)
1759 t = walk_tree (&t, no_linkage_helper, NULL);
1760 if (t != error_mark_node)
1765 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
1768 copy_tree_r (tp, walk_subtrees, data)
1770 int *walk_subtrees ATTRIBUTE_UNUSED;
1771 void *data ATTRIBUTE_UNUSED;
1773 enum tree_code code = TREE_CODE (*tp);
1775 /* We make copies of most nodes. */
1776 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code))
1777 || TREE_CODE_CLASS (code) == 'r'
1778 || TREE_CODE_CLASS (code) == 'c'
1779 || code == PARM_DECL
1780 || code == TREE_LIST
1782 || code == OVERLOAD)
1784 /* Because the chain gets clobbered when we make a copy, we save it
1786 tree chain = TREE_CHAIN (*tp);
1788 /* Copy the node. */
1789 *tp = copy_node (*tp);
1791 /* Now, restore the chain, if appropriate. That will cause
1792 walk_tree to walk into the chain as well. */
1793 if (code == PARM_DECL || code == TREE_LIST || code == OVERLOAD)
1794 TREE_CHAIN (*tp) = chain;
1796 else if (code == TEMPLATE_TEMPLATE_PARM)
1797 /* These must be copied specially. */
1798 *tp = copy_template_template_parm (*tp);
1803 #ifdef GATHER_STATISTICS
1804 extern int depth_reached;
1808 print_lang_statistics ()
1810 print_search_statistics ();
1811 print_class_statistics ();
1812 #ifdef GATHER_STATISTICS
1813 fprintf (stderr, "maximum template instantiation depth reached: %d\n",
1818 /* This is used by the `assert' macro. It is provided in libgcc.a,
1819 which `cc' doesn't know how to link. Note that the C++ front-end
1820 no longer actually uses the `assert' macro (instead, it calls
1821 my_friendly_assert). But all of the back-end files still need this. */
1824 __eprintf (string, expression, line, filename)
1826 const char *expression;
1828 const char *filename;
1830 fprintf (stderr, string, expression, line, filename);
1835 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1836 (which is an ARRAY_TYPE). This counts only elements of the top
1840 array_type_nelts_top (type)
1843 return fold (build (PLUS_EXPR, sizetype,
1844 array_type_nelts (type),
1848 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1849 (which is an ARRAY_TYPE). This one is a recursive count of all
1850 ARRAY_TYPEs that are clumped together. */
1853 array_type_nelts_total (type)
1856 tree sz = array_type_nelts_top (type);
1857 type = TREE_TYPE (type);
1858 while (TREE_CODE (type) == ARRAY_TYPE)
1860 tree n = array_type_nelts_top (type);
1861 sz = fold (build (MULT_EXPR, sizetype, sz, n));
1862 type = TREE_TYPE (type);
1867 /* Called from break_out_target_exprs via mapcar. */
1870 bot_manip (tp, walk_subtrees, data)
1875 splay_tree target_remap = ((splay_tree) data);
1878 if (TREE_CODE (t) != TREE_LIST && ! TREE_SIDE_EFFECTS (t))
1880 /* There can't be any TARGET_EXPRs below this point. */
1884 else if (TREE_CODE (t) == TARGET_EXPR)
1888 if (TREE_CODE (TREE_OPERAND (t, 1)) == AGGR_INIT_EXPR)
1890 mark_used (TREE_OPERAND (TREE_OPERAND (TREE_OPERAND (t, 1), 0), 0));
1892 (TREE_TYPE (t), break_out_target_exprs (TREE_OPERAND (t, 1)));
1897 TREE_OPERAND (u, 0) = build (VAR_DECL, TREE_TYPE (t));
1898 layout_decl (TREE_OPERAND (u, 0), 0);
1901 /* Map the old variable to the new one. */
1902 splay_tree_insert (target_remap,
1903 (splay_tree_key) TREE_OPERAND (t, 0),
1904 (splay_tree_value) TREE_OPERAND (u, 0));
1906 /* Replace the old expression with the new version. */
1908 /* We don't have to go below this point; the recursive call to
1909 break_out_target_exprs will have handled anything below this
1914 else if (TREE_CODE (t) == CALL_EXPR)
1915 mark_used (TREE_OPERAND (TREE_OPERAND (t, 0), 0));
1917 /* Make a copy of this node. */
1918 return copy_tree_r (tp, walk_subtrees, NULL);
1921 /* Replace all remapped VAR_DECLs in T with their new equivalents.
1922 DATA is really a splay-tree mapping old variables to new
1926 bot_replace (t, walk_subtrees, data)
1928 int *walk_subtrees ATTRIBUTE_UNUSED;
1931 splay_tree target_remap = ((splay_tree) data);
1933 if (TREE_CODE (*t) == VAR_DECL)
1935 splay_tree_node n = splay_tree_lookup (target_remap,
1936 (splay_tree_key) *t);
1938 *t = (tree) n->value;
1944 /* When we parse a default argument expression, we may create
1945 temporary variables via TARGET_EXPRs. When we actually use the
1946 default-argument expression, we make a copy of the expression, but
1947 we must replace the temporaries with appropriate local versions. */
1950 break_out_target_exprs (t)
1953 static int target_remap_count;
1954 static splay_tree target_remap;
1956 if (!target_remap_count++)
1957 target_remap = splay_tree_new (splay_tree_compare_pointers,
1958 /*splay_tree_delete_key_fn=*/NULL,
1959 /*splay_tree_delete_value_fn=*/NULL);
1960 walk_tree (&t, bot_manip, target_remap);
1961 walk_tree (&t, bot_replace, target_remap);
1963 if (!--target_remap_count)
1965 splay_tree_delete (target_remap);
1966 target_remap = NULL;
1972 /* Obstack used for allocating nodes in template function and variable
1975 /* Similar to `build_nt', except we build
1976 on the permanent_obstack, regardless. */
1979 build_min_nt VPROTO((enum tree_code code, ...))
1981 #ifndef ANSI_PROTOTYPES
1982 enum tree_code code;
1984 register struct obstack *ambient_obstack = expression_obstack;
1987 register int length;
1992 #ifndef ANSI_PROTOTYPES
1993 code = va_arg (p, enum tree_code);
1996 expression_obstack = &permanent_obstack;
1998 t = make_node (code);
1999 length = tree_code_length[(int) code];
2000 TREE_COMPLEXITY (t) = lineno;
2002 for (i = 0; i < length; i++)
2004 tree x = va_arg (p, tree);
2005 TREE_OPERAND (t, i) = x;
2009 expression_obstack = ambient_obstack;
2013 /* Similar to `build', except we build
2014 on the permanent_obstack, regardless. */
2017 build_min VPROTO((enum tree_code code, tree tt, ...))
2019 #ifndef ANSI_PROTOTYPES
2020 enum tree_code code;
2023 register struct obstack *ambient_obstack = expression_obstack;
2026 register int length;
2031 #ifndef ANSI_PROTOTYPES
2032 code = va_arg (p, enum tree_code);
2033 tt = va_arg (p, tree);
2036 expression_obstack = &permanent_obstack;
2038 t = make_node (code);
2039 length = tree_code_length[(int) code];
2041 TREE_COMPLEXITY (t) = lineno;
2043 for (i = 0; i < length; i++)
2045 tree x = va_arg (p, tree);
2046 TREE_OPERAND (t, i) = x;
2050 expression_obstack = ambient_obstack;
2054 /* Same as `tree_cons' but make a permanent object. */
2057 min_tree_cons (purpose, value, chain)
2058 tree purpose, value, chain;
2061 register struct obstack *ambient_obstack = current_obstack;
2062 current_obstack = &permanent_obstack;
2064 node = tree_cons (purpose, value, chain);
2066 current_obstack = ambient_obstack;
2074 if (TREE_CODE (t) == TYPE_DECL)
2076 if (TREE_CODE_CLASS (TREE_CODE (t)) == 't')
2077 return TYPE_STUB_DECL (t);
2079 my_friendly_abort (42);
2081 /* Stop compiler from complaining control reaches end of non-void function. */
2086 can_free (obstack, t)
2087 struct obstack *obstack;
2092 if (TREE_CODE (t) == TREE_VEC)
2093 size = (TREE_VEC_LENGTH (t)-1) * sizeof (tree) + sizeof (struct tree_vec);
2095 my_friendly_abort (42);
2097 #define ROUND(x) ((x + obstack_alignment_mask (obstack)) \
2098 & ~ obstack_alignment_mask (obstack))
2099 if ((char *)t + ROUND (size) == obstack_next_free (obstack))
2106 /* Return first vector element whose BINFO_TYPE is ELEM.
2107 Return 0 if ELEM is not in VEC. VEC may be NULL_TREE. */
2110 vec_binfo_member (elem, vec)
2116 for (i = 0; i < TREE_VEC_LENGTH (vec); ++i)
2117 if (same_type_p (elem, BINFO_TYPE (TREE_VEC_ELT (vec, i))))
2118 return TREE_VEC_ELT (vec, i);
2123 /* Kludge around the fact that DECL_CONTEXT for virtual functions returns
2124 the wrong thing for decl_function_context. Hopefully the uses in the
2125 backend won't matter, since we don't need a static chain for local class
2129 hack_decl_function_context (decl)
2132 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_FUNCTION_MEMBER_P (decl))
2133 return decl_function_context (TYPE_MAIN_DECL (DECL_CLASS_CONTEXT (decl)));
2134 return decl_function_context (decl);
2137 /* Returns the namespace that contains DECL, whether directly or
2141 decl_namespace_context (decl)
2146 if (TREE_CODE (decl) == NAMESPACE_DECL)
2148 else if (TYPE_P (decl))
2149 decl = CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl));
2151 decl = CP_DECL_CONTEXT (decl);
2155 /* Return truthvalue of whether T1 is the same tree structure as T2.
2156 Return 1 if they are the same.
2157 Return 0 if they are understandably different.
2158 Return -1 if either contains tree structure not understood by
2162 cp_tree_equal (t1, t2)
2165 register enum tree_code code1, code2;
2170 if (t1 == 0 || t2 == 0)
2173 code1 = TREE_CODE (t1);
2174 code2 = TREE_CODE (t2);
2176 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
2178 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR || code2 == NON_LVALUE_EXPR)
2179 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
2181 return cp_tree_equal (TREE_OPERAND (t1, 0), t2);
2183 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
2184 || code2 == NON_LVALUE_EXPR)
2185 return cp_tree_equal (t1, TREE_OPERAND (t2, 0));
2193 return TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
2194 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2);
2197 return REAL_VALUES_EQUAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
2200 return TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
2201 && !bcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
2202 TREE_STRING_LENGTH (t1));
2205 /* We need to do this when determining whether or not two
2206 non-type pointer to member function template arguments
2208 if (!(same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
2209 /* The first operand is RTL. */
2210 && TREE_OPERAND (t1, 0) == TREE_OPERAND (t2, 0)))
2212 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
2215 cmp = cp_tree_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2));
2218 cmp = cp_tree_equal (TREE_VALUE (t1), TREE_VALUE (t2));
2221 return cp_tree_equal (TREE_CHAIN (t1), TREE_CHAIN (t2));
2224 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
2227 cmp = cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
2230 return simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
2233 /* Special case: if either target is an unallocated VAR_DECL,
2234 it means that it's going to be unified with whatever the
2235 TARGET_EXPR is really supposed to initialize, so treat it
2236 as being equivalent to anything. */
2237 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
2238 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
2239 && DECL_RTL (TREE_OPERAND (t1, 0)) == 0)
2240 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
2241 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
2242 && DECL_RTL (TREE_OPERAND (t2, 0)) == 0))
2245 cmp = cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
2248 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
2250 case WITH_CLEANUP_EXPR:
2251 cmp = cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
2254 return cp_tree_equal (TREE_OPERAND (t1, 2), TREE_OPERAND (t1, 2));
2257 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
2258 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
2267 case TEMPLATE_PARM_INDEX:
2268 return TEMPLATE_PARM_IDX (t1) == TEMPLATE_PARM_IDX (t2)
2269 && TEMPLATE_PARM_LEVEL (t1) == TEMPLATE_PARM_LEVEL (t2);
2273 if (TREE_CODE (TREE_OPERAND (t1, 0)) != TREE_CODE (TREE_OPERAND (t2, 0)))
2275 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (t1, 0))) == 't')
2276 return same_type_p (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
2280 /* Two pointer-to-members are the same if they point to the same
2281 field or function in the same class. */
2282 return (PTRMEM_CST_MEMBER (t1) == PTRMEM_CST_MEMBER (t2)
2283 && same_type_p (PTRMEM_CST_CLASS (t1), PTRMEM_CST_CLASS (t2)));
2289 switch (TREE_CODE_CLASS (code1))
2299 for (i=0; i<tree_code_length[(int) code1]; ++i)
2301 cmp = cp_tree_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
2311 /* Build a wrapper around some pointer PTR so we can use it as a tree. */
2314 build_ptr_wrapper (ptr)
2317 tree t = make_node (WRAPPER);
2318 WRAPPER_PTR (t) = ptr;
2322 /* Same, but on the expression_obstack. */
2325 build_expr_ptr_wrapper (ptr)
2329 push_expression_obstack ();
2330 t = build_ptr_wrapper (ptr);
2335 /* Build a wrapper around some integer I so we can use it as a tree. */
2338 build_int_wrapper (i)
2341 tree t = make_node (WRAPPER);
2342 WRAPPER_INT (t) = i;
2347 build_srcloc (file, line)
2353 t = make_node (SRCLOC);
2354 SRCLOC_FILE (t) = file;
2355 SRCLOC_LINE (t) = line;
2361 build_srcloc_here ()
2363 return build_srcloc (input_filename, lineno);
2367 push_expression_obstack ()
2369 push_obstacks_nochange ();
2370 current_obstack = expression_obstack;
2373 /* Begin allocating on the permanent obstack. When you're done
2374 allocating there, call pop_obstacks to return to the previous set
2378 push_permanent_obstack ()
2380 push_obstacks_nochange ();
2381 end_temporary_allocation ();
2384 /* The type of ARG when used as an lvalue. */
2390 tree type = TREE_TYPE (arg);
2391 if (TREE_CODE (arg) == OVERLOAD)
2392 type = unknown_type_node;
2396 /* The type of ARG for printing error messages; denote lvalues with
2403 tree type = TREE_TYPE (arg);
2404 if (TREE_CODE (type) == ARRAY_TYPE)
2406 else if (real_lvalue_p (arg))
2407 type = build_reference_type (lvalue_type (arg));
2408 else if (IS_AGGR_TYPE (type))
2409 type = lvalue_type (arg);
2414 /* Does FUNCTION use a variable-length argument list? */
2417 varargs_function_p (function)
2420 tree parm = TYPE_ARG_TYPES (TREE_TYPE (function));
2421 for (; parm; parm = TREE_CHAIN (parm))
2422 if (TREE_VALUE (parm) == void_type_node)
2427 /* Returns 1 if decl is a member of a class. */
2433 tree ctx = DECL_CONTEXT (decl);
2434 return (ctx && TREE_CODE_CLASS (TREE_CODE (ctx)) == 't');
2437 /* Create a placeholder for member access where we don't actually have an
2438 object that the access is against. */
2441 build_dummy_object (type)
2444 tree decl = build1 (NOP_EXPR, build_pointer_type (type), void_zero_node);
2445 return build_indirect_ref (decl, NULL_PTR);
2448 /* We've gotten a reference to a member of TYPE. Return *this if appropriate,
2449 or a dummy object otherwise. If BINFOP is non-0, it is filled with the
2450 binfo path from current_class_type to TYPE, or 0. */
2453 maybe_dummy_object (type, binfop)
2459 if (current_class_type
2460 && get_base_distance (type, current_class_type, 0, binfop) != -1)
2461 context = current_class_type;
2464 /* Reference from a nested class member function. */
2467 *binfop = TYPE_BINFO (type);
2470 if (current_class_ref && context == current_class_type)
2471 decl = current_class_ref;
2473 decl = build_dummy_object (context);
2478 /* Returns 1 if OB is a placeholder object, or a pointer to one. */
2481 is_dummy_object (ob)
2484 if (TREE_CODE (ob) == INDIRECT_REF)
2485 ob = TREE_OPERAND (ob, 0);
2486 return (TREE_CODE (ob) == NOP_EXPR
2487 && TREE_OPERAND (ob, 0) == void_zero_node);
2490 /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */
2496 while (TREE_CODE (t) == ARRAY_TYPE)
2499 if (INTEGRAL_TYPE_P (t))
2500 return 1; /* integral, character or enumeral type */
2501 if (FLOAT_TYPE_P (t))
2504 return 1; /* pointer to non-member */
2505 if (TYPE_PTRMEM_P (t))
2506 return 1; /* pointer to member object */
2507 if (TYPE_PTRMEMFUNC_P (t))
2508 return 1; /* pointer to member function */
2510 if (! CLASS_TYPE_P (t))
2511 return 0; /* other non-class type (reference or function) */
2512 if (CLASSTYPE_NON_POD_P (t))
2517 /* Return a 1 if ATTR_NAME and ATTR_ARGS denote a valid C++-specific
2518 attribute for either declaration DECL or type TYPE and 0 otherwise.
2519 Plugged into valid_lang_attribute. */
2522 cp_valid_lang_attribute (attr_name, attr_args, decl, type)
2524 tree attr_args ATTRIBUTE_UNUSED;
2525 tree decl ATTRIBUTE_UNUSED;
2526 tree type ATTRIBUTE_UNUSED;
2528 if (is_attribute_p ("com_interface", attr_name))
2530 if (! flag_vtable_thunks)
2532 error ("`com_interface' only supported with -fvtable-thunks");
2536 if (attr_args != NULL_TREE
2537 || decl != NULL_TREE
2538 || ! CLASS_TYPE_P (type)
2539 || type != TYPE_MAIN_VARIANT (type))
2541 warning ("`com_interface' attribute can only be applied to class definitions");
2545 CLASSTYPE_COM_INTERFACE (type) = 1;
2548 else if (is_attribute_p ("init_priority", attr_name))
2550 tree initp_expr = (attr_args ? TREE_VALUE (attr_args): NULL_TREE);
2554 STRIP_NOPS (initp_expr);
2556 if (!initp_expr || TREE_CODE (initp_expr) != INTEGER_CST)
2558 error ("requested init_priority is not an integer constant");
2562 pri = TREE_INT_CST_LOW (initp_expr);
2564 while (TREE_CODE (type) == ARRAY_TYPE)
2565 type = TREE_TYPE (type);
2567 if (decl == NULL_TREE
2568 || TREE_CODE (decl) != VAR_DECL
2569 || ! TREE_STATIC (decl)
2570 || DECL_EXTERNAL (decl)
2571 || (TREE_CODE (type) != RECORD_TYPE
2572 && TREE_CODE (type) != UNION_TYPE)
2573 /* Static objects in functions are initialized the
2574 first time control passes through that
2575 function. This is not precise enough to pin down an
2576 init_priority value, so don't allow it. */
2577 || current_function_decl)
2579 error ("can only use init_priority attribute on file-scope definitions of objects of class type");
2583 if (pri > MAX_INIT_PRIORITY || pri <= 0)
2585 error ("requested init_priority is out of range");
2589 /* Check for init_priorities that are reserved for
2590 language and runtime support implementations.*/
2591 if (pri <= MAX_RESERVED_INIT_PRIORITY)
2594 ("requested init_priority is reserved for internal use");
2597 DECL_INIT_PRIORITY (decl) = pri;
2604 /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the
2605 thing pointed to by the constant. */
2608 make_ptrmem_cst (type, member)
2612 tree ptrmem_cst = make_node (PTRMEM_CST);
2613 /* If would seem a great convenience if make_node would set
2614 TREE_CONSTANT for things of class `c', but it does not. */
2615 TREE_CONSTANT (ptrmem_cst) = 1;
2616 TREE_TYPE (ptrmem_cst) = type;
2617 PTRMEM_CST_MEMBER (ptrmem_cst) = member;
2621 /* Mark ARG (which is really a list_hash_table **) for GC. */
2624 mark_list_hash (arg)
2627 struct list_hash *lh;
2629 for (lh = * ((struct list_hash **) arg); lh; lh = lh->next)
2630 ggc_mark_tree (lh->list);
2633 /* Initialize tree.c. */
2638 make_lang_type_fn = cp_make_lang_type;
2639 lang_unsave_expr_now = cplus_unsave_expr_now;
2640 ggc_add_root (list_hash_table,
2641 sizeof (list_hash_table) / sizeof (struct list_hash *),
2642 sizeof (struct list_hash *),
2646 /* The C++ version of unsave_expr_now.
2647 See gcc/tree.c:unsave_expr_now for comments. */
2650 cplus_unsave_expr_now (expr)
2656 else if (TREE_CODE (expr) == AGGR_INIT_EXPR)
2658 unsave_expr_now (TREE_OPERAND (expr,0));
2659 if (TREE_OPERAND (expr, 1)
2660 && TREE_CODE (TREE_OPERAND (expr, 1)) == TREE_LIST)
2662 tree exp = TREE_OPERAND (expr, 1);
2665 unsave_expr_now (TREE_VALUE (exp));
2666 exp = TREE_CHAIN (exp);
2669 unsave_expr_now (TREE_OPERAND (expr,2));