1 /* Language-dependent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 88, 92, 93, 94, 95, 1996 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. */
35 #define CEIL(x,y) (((x) + (y) - 1) / (y))
37 /* Return nonzero if REF is an lvalue valid for this language.
38 Lvalues can be assigned, unless they have TREE_READONLY.
39 Lvalues can have their address taken, unless they have DECL_REGISTER. */
45 if (! language_lvalue_valid (ref))
48 if (TREE_CODE (TREE_TYPE (ref)) == REFERENCE_TYPE)
51 if (ref == current_class_ptr && flag_this_is_variable <= 0)
54 switch (TREE_CODE (ref))
56 /* preincrements and predecrements are valid lvals, provided
57 what they refer to are valid lvals. */
58 case PREINCREMENT_EXPR:
59 case PREDECREMENT_EXPR:
62 return real_lvalue_p (TREE_OPERAND (ref, 0));
68 if (TREE_READONLY (ref) && ! TREE_STATIC (ref)
69 && DECL_LANG_SPECIFIC (ref)
70 && DECL_IN_AGGR_P (ref))
77 if (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE
78 && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE)
82 /* A currently unresolved scope ref. */
84 my_friendly_abort (103);
86 if (TREE_CODE (TREE_OPERAND (ref, 1)) == FUNCTION_DECL)
88 return real_lvalue_p (TREE_OPERAND (ref, 0))
89 && real_lvalue_p (TREE_OPERAND (ref, 1));
93 return (real_lvalue_p (TREE_OPERAND (ref, 1))
94 && real_lvalue_p (TREE_OPERAND (ref, 2)));
100 return real_lvalue_p (TREE_OPERAND (ref, 1));
104 return (real_lvalue_p (TREE_OPERAND (ref, 0))
105 && real_lvalue_p (TREE_OPERAND (ref, 1)));
115 if (! language_lvalue_valid (ref))
118 if (TREE_CODE (TREE_TYPE (ref)) == REFERENCE_TYPE)
121 if (ref == current_class_ptr && flag_this_is_variable <= 0)
124 switch (TREE_CODE (ref))
126 /* preincrements and predecrements are valid lvals, provided
127 what they refer to are valid lvals. */
128 case PREINCREMENT_EXPR:
129 case PREDECREMENT_EXPR:
132 return lvalue_p (TREE_OPERAND (ref, 0));
138 if (TREE_READONLY (ref) && ! TREE_STATIC (ref)
139 && DECL_LANG_SPECIFIC (ref)
140 && DECL_IN_AGGR_P (ref))
147 if (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE
148 && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE)
156 if (IS_AGGR_TYPE (TREE_TYPE (ref)))
160 /* A currently unresolved scope ref. */
162 my_friendly_abort (103);
164 if (TREE_CODE (TREE_OPERAND (ref, 1)) == FUNCTION_DECL)
166 return lvalue_p (TREE_OPERAND (ref, 0))
167 && lvalue_p (TREE_OPERAND (ref, 1));
171 return (lvalue_p (TREE_OPERAND (ref, 1))
172 && lvalue_p (TREE_OPERAND (ref, 2)));
178 return lvalue_p (TREE_OPERAND (ref, 1));
182 return (lvalue_p (TREE_OPERAND (ref, 0))
183 && lvalue_p (TREE_OPERAND (ref, 1)));
189 /* Return nonzero if REF is an lvalue valid for this language;
190 otherwise, print an error message and return zero. */
193 lvalue_or_else (ref, string)
197 int win = lvalue_p (ref);
199 error ("non-lvalue in %s", string);
203 /* INIT is a CALL_EXPR which needs info about its target.
204 TYPE is the type that this initialization should appear to have.
206 Build an encapsulation of the initialization to perform
207 and return it so that it can be processed by language-independent
208 and language-specific expression expanders. */
211 build_cplus_new (type, init)
218 if (TREE_CODE (init) == TARGET_EXPR || init == error_mark_node)
221 slot = build (VAR_DECL, type);
222 layout_decl (slot, 0);
223 rval = build (NEW_EXPR, type,
224 TREE_OPERAND (init, 0), TREE_OPERAND (init, 1), slot);
225 TREE_SIDE_EFFECTS (rval) = 1;
226 TREE_ADDRESSABLE (rval) = 1;
227 rval = build (TARGET_EXPR, type, slot, rval, NULL_TREE, NULL_TREE);
228 TREE_SIDE_EFFECTS (rval) = 1;
229 TREE_ADDRESSABLE (rval) = 1;
234 /* Recursively search EXP for CALL_EXPRs that need cleanups and replace
235 these CALL_EXPRs with tree nodes that will perform the cleanups. */
238 break_out_cleanups (exp)
243 if (TREE_CODE (tmp) == CALL_EXPR
244 && TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (tmp)))
245 return build_cplus_new (TREE_TYPE (tmp), tmp);
247 while (TREE_CODE (tmp) == NOP_EXPR
248 || TREE_CODE (tmp) == CONVERT_EXPR
249 || TREE_CODE (tmp) == NON_LVALUE_EXPR)
251 if (TREE_CODE (TREE_OPERAND (tmp, 0)) == CALL_EXPR
252 && TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (TREE_OPERAND (tmp, 0))))
254 TREE_OPERAND (tmp, 0)
255 = build_cplus_new (TREE_TYPE (TREE_OPERAND (tmp, 0)),
256 TREE_OPERAND (tmp, 0));
260 tmp = TREE_OPERAND (tmp, 0);
265 /* Recursively perform a preorder search EXP for CALL_EXPRs, making
266 copies where they are found. Returns a deep copy all nodes transitively
267 containing CALL_EXPRs. */
270 break_out_calls (exp)
273 register tree t1, t2;
274 register enum tree_code code;
275 register int changed = 0;
278 if (exp == NULL_TREE)
281 code = TREE_CODE (exp);
283 if (code == CALL_EXPR)
284 return copy_node (exp);
286 /* Don't try and defeat a save_expr, as it should only be done once. */
287 if (code == SAVE_EXPR)
290 switch (TREE_CODE_CLASS (code))
295 case 'c': /* a constant */
296 case 't': /* a type node */
297 case 'x': /* something random, like an identifier or an ERROR_MARK. */
300 case 'd': /* A decl node */
301 #if 0 /* This is bogus. jason 9/21/94 */
303 t1 = break_out_calls (DECL_INITIAL (exp));
304 if (t1 != DECL_INITIAL (exp))
306 exp = copy_node (exp);
307 DECL_INITIAL (exp) = t1;
312 case 'b': /* A block node */
314 /* Don't know how to handle these correctly yet. Must do a
315 break_out_calls on all DECL_INITIAL values for local variables,
316 and also break_out_calls on all sub-blocks and sub-statements. */
321 case 'e': /* an expression */
322 case 'r': /* a reference */
323 case 's': /* an expression with side effects */
324 for (i = tree_code_length[(int) code] - 1; i >= 0; i--)
326 t1 = break_out_calls (TREE_OPERAND (exp, i));
327 if (t1 != TREE_OPERAND (exp, i))
329 exp = copy_node (exp);
330 TREE_OPERAND (exp, i) = t1;
335 case '<': /* a comparison expression */
336 case '2': /* a binary arithmetic expression */
337 t2 = break_out_calls (TREE_OPERAND (exp, 1));
338 if (t2 != TREE_OPERAND (exp, 1))
340 case '1': /* a unary arithmetic expression */
341 t1 = break_out_calls (TREE_OPERAND (exp, 0));
342 if (t1 != TREE_OPERAND (exp, 0))
346 if (tree_code_length[(int) code] == 1)
347 return build1 (code, TREE_TYPE (exp), t1);
349 return build (code, TREE_TYPE (exp), t1, t2);
356 extern struct obstack *current_obstack;
357 extern struct obstack permanent_obstack, class_obstack;
358 extern struct obstack *saveable_obstack;
359 extern struct obstack *expression_obstack;
361 /* Here is how primitive or already-canonicalized types' hash
362 codes are made. MUST BE CONSISTENT WITH tree.c !!! */
363 #define TYPE_HASH(TYPE) ((HOST_WIDE_INT) (TYPE) & 0777777)
365 /* Construct, lay out and return the type of methods belonging to class
366 BASETYPE and whose arguments are described by ARGTYPES and whose values
367 are described by RETTYPE. If each type exists already, reuse it. */
370 build_cplus_method_type (basetype, rettype, argtypes)
371 tree basetype, rettype, argtypes;
377 /* Make a node of the sort we want. */
378 t = make_node (METHOD_TYPE);
380 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
381 TREE_TYPE (t) = rettype;
382 if (IS_SIGNATURE (basetype))
383 ptype = build_signature_pointer_type (TYPE_MAIN_VARIANT (basetype),
384 TYPE_READONLY (basetype),
385 TYPE_VOLATILE (basetype));
387 ptype = build_pointer_type (basetype);
389 /* The actual arglist for this function includes a "hidden" argument
390 which is "this". Put it into the list of argument types. */
392 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
393 TYPE_ARG_TYPES (t) = argtypes;
394 TREE_SIDE_EFFECTS (argtypes) = 1; /* Mark first argtype as "artificial". */
396 /* If we already have such a type, use the old one and free this one.
397 Note that it also frees up the above cons cell if found. */
398 hashcode = TYPE_HASH (basetype) + TYPE_HASH (rettype) + type_hash_list (argtypes);
399 t = type_hash_canon (hashcode, t);
401 if (TYPE_SIZE (t) == 0)
408 build_cplus_array_type_1 (elt_type, index_type)
412 register struct obstack *ambient_obstack = current_obstack;
413 register struct obstack *ambient_saveable_obstack = saveable_obstack;
416 /* We need a new one. If both ELT_TYPE and INDEX_TYPE are permanent,
417 make this permanent too. */
418 if (TREE_PERMANENT (elt_type)
419 && (index_type == 0 || TREE_PERMANENT (index_type)))
421 current_obstack = &permanent_obstack;
422 saveable_obstack = &permanent_obstack;
425 if (processing_template_decl)
427 t = make_node (ARRAY_TYPE);
428 TREE_TYPE (t) = elt_type;
429 TYPE_DOMAIN (t) = index_type;
432 t = build_array_type (elt_type, index_type);
434 /* Push these needs up so that initialization takes place
436 TYPE_NEEDS_CONSTRUCTING (t) = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (elt_type));
437 TYPE_NEEDS_DESTRUCTOR (t) = TYPE_NEEDS_DESTRUCTOR (TYPE_MAIN_VARIANT (elt_type));
438 current_obstack = ambient_obstack;
439 saveable_obstack = ambient_saveable_obstack;
444 build_cplus_array_type (elt_type, index_type)
449 int constp = TYPE_READONLY (elt_type);
450 int volatilep = TYPE_VOLATILE (elt_type);
451 elt_type = TYPE_MAIN_VARIANT (elt_type);
453 t = build_cplus_array_type_1 (elt_type, index_type);
455 if (constp || volatilep)
456 t = cp_build_type_variant (t, constp, volatilep);
461 /* Make a variant type in the proper way for C/C++, propagating qualifiers
462 down to the element type of an array. */
465 cp_build_type_variant (type, constp, volatilep)
467 int constp, volatilep;
469 if (type == error_mark_node)
472 if (TREE_CODE (type) == ARRAY_TYPE)
474 tree real_main_variant = TYPE_MAIN_VARIANT (type);
476 push_obstacks (TYPE_OBSTACK (real_main_variant),
477 TYPE_OBSTACK (real_main_variant));
478 type = build_cplus_array_type_1 (cp_build_type_variant
479 (TREE_TYPE (type), constp, volatilep),
482 /* TYPE must be on same obstack as REAL_MAIN_VARIANT. If not,
483 make a copy. (TYPE might have come from the hash table and
484 REAL_MAIN_VARIANT might be in some function's obstack.) */
486 if (TYPE_OBSTACK (type) != TYPE_OBSTACK (real_main_variant))
488 type = copy_node (type);
489 TYPE_POINTER_TO (type) = TYPE_REFERENCE_TO (type) = 0;
492 TYPE_MAIN_VARIANT (type) = real_main_variant;
496 return build_type_variant (type, constp, volatilep);
499 /* Add OFFSET to all base types of T.
501 OFFSET, which is a type offset, is number of bytes.
503 Note that we don't have to worry about having two paths to the
504 same base type, since this type owns its association list. */
507 propagate_binfo_offsets (binfo, offset)
511 tree binfos = BINFO_BASETYPES (binfo);
512 int i, n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0;
514 for (i = 0; i < n_baselinks; /* note increment is done in the loop. */)
516 tree base_binfo = TREE_VEC_ELT (binfos, i);
518 if (TREE_VIA_VIRTUAL (base_binfo))
523 tree base_binfos = BINFO_BASETYPES (base_binfo);
526 for (j = i+1; j < n_baselinks; j++)
527 if (! TREE_VIA_VIRTUAL (TREE_VEC_ELT (binfos, j)))
529 /* The next basetype offset must take into account the space
530 between the classes, not just the size of each class. */
531 delta = size_binop (MINUS_EXPR,
532 BINFO_OFFSET (TREE_VEC_ELT (binfos, j)),
533 BINFO_OFFSET (base_binfo));
538 if (BINFO_OFFSET_ZEROP (base_binfo))
539 BINFO_OFFSET (base_binfo) = offset;
541 BINFO_OFFSET (base_binfo)
542 = size_binop (PLUS_EXPR, BINFO_OFFSET (base_binfo), offset);
544 BINFO_OFFSET (base_binfo) = offset;
549 tree chain = NULL_TREE;
551 /* Now unshare the structure beneath BASE_BINFO. */
552 for (k = TREE_VEC_LENGTH (base_binfos)-1;
555 tree base_base_binfo = TREE_VEC_ELT (base_binfos, k);
556 if (! TREE_VIA_VIRTUAL (base_base_binfo))
557 TREE_VEC_ELT (base_binfos, k)
558 = make_binfo (BINFO_OFFSET (base_base_binfo),
560 BINFO_VTABLE (base_base_binfo),
561 BINFO_VIRTUALS (base_base_binfo),
563 chain = TREE_VEC_ELT (base_binfos, k);
564 TREE_VIA_PUBLIC (chain) = TREE_VIA_PUBLIC (base_base_binfo);
565 TREE_VIA_PROTECTED (chain) = TREE_VIA_PROTECTED (base_base_binfo);
566 BINFO_INHERITANCE_CHAIN (chain) = base_binfo;
568 /* Now propagate the offset to the base types. */
569 propagate_binfo_offsets (base_binfo, offset);
572 /* Go to our next class that counts for offset propagation. */
575 offset = size_binop (PLUS_EXPR, offset, delta);
580 /* Compute the actual offsets that our virtual base classes
581 will have *for this type*. This must be performed after
582 the fields are laid out, since virtual baseclasses must
583 lay down at the end of the record.
585 Returns the maximum number of virtual functions any of the virtual
586 baseclasses provide. */
589 layout_vbasetypes (rec, max)
593 /* Get all the virtual base types that this type uses.
594 The TREE_VALUE slot holds the virtual baseclass type. */
595 tree vbase_types = get_vbase_types (rec);
597 #ifdef STRUCTURE_SIZE_BOUNDARY
598 unsigned record_align = MAX (STRUCTURE_SIZE_BOUNDARY, TYPE_ALIGN (rec));
600 unsigned record_align = MAX (BITS_PER_UNIT, TYPE_ALIGN (rec));
604 /* Record size so far is CONST_SIZE + VAR_SIZE bits,
605 where CONST_SIZE is an integer
606 and VAR_SIZE is a tree expression.
607 If VAR_SIZE is null, the size is just CONST_SIZE.
608 Naturally we try to avoid using VAR_SIZE. */
609 register unsigned const_size = 0;
610 register tree var_size = 0;
611 int nonvirtual_const_size;
613 CLASSTYPE_VBASECLASSES (rec) = vbase_types;
615 if (TREE_CODE (TYPE_SIZE (rec)) == INTEGER_CST)
616 const_size = TREE_INT_CST_LOW (TYPE_SIZE (rec));
618 var_size = TYPE_SIZE (rec);
620 nonvirtual_const_size = const_size;
624 tree basetype = BINFO_TYPE (vbase_types);
627 desired_align = TYPE_ALIGN (basetype);
628 record_align = MAX (record_align, desired_align);
631 offset = integer_zero_node;
634 /* Give each virtual base type the alignment it wants. */
635 const_size = CEIL (const_size, TYPE_ALIGN (basetype))
636 * TYPE_ALIGN (basetype);
637 offset = size_int (CEIL (const_size, BITS_PER_UNIT));
640 if (CLASSTYPE_VSIZE (basetype) > max)
641 max = CLASSTYPE_VSIZE (basetype);
642 BINFO_OFFSET (vbase_types) = offset;
644 if (TREE_CODE (TYPE_SIZE (basetype)) == INTEGER_CST)
646 /* Every virtual baseclass takes a least a UNIT, so that we can
647 take it's address and get something different for each base. */
648 const_size += MAX (BITS_PER_UNIT,
649 TREE_INT_CST_LOW (TYPE_SIZE (basetype))
650 - TREE_INT_CST_LOW (CLASSTYPE_VBASE_SIZE (basetype)));
652 else if (var_size == 0)
653 var_size = TYPE_SIZE (basetype);
655 var_size = size_binop (PLUS_EXPR, var_size, TYPE_SIZE (basetype));
657 vbase_types = TREE_CHAIN (vbase_types);
662 /* Because a virtual base might take a single byte above,
663 we have to re-adjust the total size to make sure it it
664 a multiple of the alignment. */
665 /* Give the whole object the alignment it wants. */
666 const_size = CEIL (const_size, record_align) * record_align;
669 /* Set the alignment in the complete type. We don't set CLASSTYPE_ALIGN
670 here, as that is for this class, without any virtual base classes. */
671 TYPE_ALIGN (rec) = record_align;
672 if (const_size != nonvirtual_const_size)
674 CLASSTYPE_VBASE_SIZE (rec)
675 = size_int (const_size - nonvirtual_const_size);
676 TYPE_SIZE (rec) = size_int (const_size);
679 /* Now propagate offset information throughout the lattice
680 under the vbase type. */
681 for (vbase_types = CLASSTYPE_VBASECLASSES (rec); vbase_types;
682 vbase_types = TREE_CHAIN (vbase_types))
684 tree base_binfos = BINFO_BASETYPES (vbase_types);
686 BINFO_INHERITANCE_CHAIN (vbase_types) = TYPE_BINFO (rec);
690 tree chain = NULL_TREE;
692 /* Now unshare the structure beneath BASE_BINFO. */
694 for (j = TREE_VEC_LENGTH (base_binfos)-1;
697 tree base_base_binfo = TREE_VEC_ELT (base_binfos, j);
698 if (! TREE_VIA_VIRTUAL (base_base_binfo))
699 TREE_VEC_ELT (base_binfos, j)
700 = make_binfo (BINFO_OFFSET (base_base_binfo),
702 BINFO_VTABLE (base_base_binfo),
703 BINFO_VIRTUALS (base_base_binfo),
705 chain = TREE_VEC_ELT (base_binfos, j);
706 TREE_VIA_PUBLIC (chain) = TREE_VIA_PUBLIC (base_base_binfo);
707 TREE_VIA_PROTECTED (chain) = TREE_VIA_PROTECTED (base_base_binfo);
708 BINFO_INHERITANCE_CHAIN (chain) = vbase_types;
711 propagate_binfo_offsets (vbase_types, BINFO_OFFSET (vbase_types));
718 /* Lay out the base types of a record type, REC.
719 Tentatively set the size and alignment of REC
720 according to the base types alone.
722 Offsets for immediate nonvirtual baseclasses are also computed here.
724 TYPE_BINFO (REC) should be NULL_TREE on entry, and this routine
725 creates a list of base_binfos in TYPE_BINFO (REC) from BINFOS.
727 Returns list of virtual base classes in a FIELD_DECL chain. */
730 layout_basetypes (rec, binfos)
733 /* Chain to hold all the new FIELD_DECLs which point at virtual
735 tree vbase_decls = NULL_TREE;
737 #ifdef STRUCTURE_SIZE_BOUNDARY
738 unsigned record_align = MAX (STRUCTURE_SIZE_BOUNDARY, TYPE_ALIGN (rec));
740 unsigned record_align = MAX (BITS_PER_UNIT, TYPE_ALIGN (rec));
743 /* Record size so far is CONST_SIZE + VAR_SIZE bits, where CONST_SIZE is
744 an integer and VAR_SIZE is a tree expression. If VAR_SIZE is null,
745 the size is just CONST_SIZE. Naturally we try to avoid using
746 VAR_SIZE. And so far, we've been successful. */
748 register tree var_size = 0;
751 register unsigned const_size = 0;
752 int i, n_baseclasses = binfos ? TREE_VEC_LENGTH (binfos) : 0;
754 /* Handle basetypes almost like fields, but record their
755 offsets differently. */
757 for (i = 0; i < n_baseclasses; i++)
759 int inc, desired_align, int_vbase_size;
760 register tree base_binfo = TREE_VEC_ELT (binfos, i);
761 register tree basetype = BINFO_TYPE (base_binfo);
764 if (TYPE_SIZE (basetype) == 0)
767 /* This error is now reported in xref_tag, thus giving better
768 location information. */
769 error_with_aggr_type (base_binfo,
770 "base class `%s' has incomplete type");
772 TREE_VIA_PUBLIC (base_binfo) = 1;
773 TREE_VIA_PROTECTED (base_binfo) = 0;
774 TREE_VIA_VIRTUAL (base_binfo) = 0;
776 /* Should handle this better so that
779 class B: private A { virtual void F(); };
781 does not dump core when compiled. */
782 my_friendly_abort (121);
787 /* All basetypes are recorded in the association list of the
790 if (TREE_VIA_VIRTUAL (base_binfo))
793 char *name = (char *)alloca (TYPE_NAME_LENGTH (basetype)
794 + sizeof (VBASE_NAME) + 1);
796 /* The offset for a virtual base class is only used in computing
797 virtual function tables and for initializing virtual base
798 pointers. It is built once `get_vbase_types' is called. */
800 /* If this basetype can come from another vbase pointer
801 without an additional indirection, we will share
802 that pointer. If an indirection is involved, we
803 make our own pointer. */
804 for (j = 0; j < n_baseclasses; j++)
806 tree other_base_binfo = TREE_VEC_ELT (binfos, j);
807 if (! TREE_VIA_VIRTUAL (other_base_binfo)
808 && binfo_member (basetype,
809 CLASSTYPE_VBASECLASSES (BINFO_TYPE (other_base_binfo))))
812 sprintf (name, VBASE_NAME_FORMAT, TYPE_NAME_STRING (basetype));
813 decl = build_lang_field_decl (FIELD_DECL, get_identifier (name),
814 build_pointer_type (basetype));
815 /* If you change any of the below, take a look at all the
816 other VFIELD_BASEs and VTABLE_BASEs in the code, and change
818 DECL_ASSEMBLER_NAME (decl) = get_identifier (VTABLE_BASE);
819 DECL_VIRTUAL_P (decl) = 1;
820 DECL_ARTIFICIAL (decl) = 1;
821 DECL_FIELD_CONTEXT (decl) = rec;
822 DECL_CLASS_CONTEXT (decl) = rec;
823 DECL_FCONTEXT (decl) = basetype;
824 DECL_SAVED_INSNS (decl) = NULL_RTX;
825 DECL_FIELD_SIZE (decl) = 0;
826 DECL_ALIGN (decl) = TYPE_ALIGN (ptr_type_node);
827 TREE_CHAIN (decl) = vbase_decls;
828 BINFO_VPTR_FIELD (base_binfo) = decl;
831 if (warn_nonvdtor && TYPE_HAS_DESTRUCTOR (basetype)
832 && DECL_VINDEX (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (basetype), 1)) == NULL_TREE)
834 warning_with_decl (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (basetype), 1),
835 "destructor `%s' non-virtual");
836 warning ("in inheritance relationship `%s: virtual %s'",
837 TYPE_NAME_STRING (rec),
838 TYPE_NAME_STRING (basetype));
841 /* The space this decl occupies has already been accounted for. */
846 offset = integer_zero_node;
849 /* Give each base type the alignment it wants. */
850 const_size = CEIL (const_size, TYPE_ALIGN (basetype))
851 * TYPE_ALIGN (basetype);
852 offset = size_int ((const_size + BITS_PER_UNIT - 1) / BITS_PER_UNIT);
855 /* bpk: Disabled this check until someone is willing to
856 claim it as theirs and explain exactly what circumstances
857 warrant the warning. */
858 if (warn_nonvdtor && TYPE_HAS_DESTRUCTOR (basetype)
859 && DECL_VINDEX (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (basetype), 1)) == NULL_TREE)
861 warning_with_decl (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (basetype), 1),
862 "destructor `%s' non-virtual");
863 warning ("in inheritance relationship `%s:%s %s'",
864 TYPE_NAME_STRING (rec),
865 TREE_VIA_VIRTUAL (base_binfo) ? " virtual" : "",
866 TYPE_NAME_STRING (basetype));
870 BINFO_OFFSET (base_binfo) = offset;
871 if (CLASSTYPE_VSIZE (basetype))
873 BINFO_VTABLE (base_binfo) = TYPE_BINFO_VTABLE (basetype);
874 BINFO_VIRTUALS (base_binfo) = TYPE_BINFO_VIRTUALS (basetype);
876 TREE_CHAIN (base_binfo) = TYPE_BINFO (rec);
877 TYPE_BINFO (rec) = base_binfo;
879 /* Add only the amount of storage not present in
880 the virtual baseclasses. */
882 int_vbase_size = TREE_INT_CST_LOW (CLASSTYPE_VBASE_SIZE (basetype));
883 if (TREE_INT_CST_LOW (TYPE_SIZE (basetype)) > int_vbase_size)
885 inc = MAX (record_align,
886 (TREE_INT_CST_LOW (TYPE_SIZE (basetype))
889 /* Record must have at least as much alignment as any field. */
890 desired_align = TYPE_ALIGN (basetype);
891 record_align = MAX (record_align, desired_align);
898 CLASSTYPE_SIZE (rec) = size_int (const_size);
900 CLASSTYPE_SIZE (rec) = integer_zero_node;
901 CLASSTYPE_ALIGN (rec) = record_align;
906 /* Hashing of lists so that we don't make duplicates.
907 The entry point is `list_hash_canon'. */
909 /* Each hash table slot is a bucket containing a chain
910 of these structures. */
914 struct list_hash *next; /* Next structure in the bucket. */
915 int hashcode; /* Hash code of this list. */
916 tree list; /* The list recorded here. */
919 /* Now here is the hash table. When recording a list, it is added
920 to the slot whose index is the hash code mod the table size.
921 Note that the hash table is used for several kinds of lists.
922 While all these live in the same table, they are completely independent,
923 and the hash code is computed differently for each of these. */
925 #define TYPE_HASH_SIZE 59
926 struct list_hash *list_hash_table[TYPE_HASH_SIZE];
928 /* Compute a hash code for a list (chain of TREE_LIST nodes
929 with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the
930 TREE_COMMON slots), by adding the hash codes of the individual entries. */
936 register int hashcode = 0;
938 if (TREE_CHAIN (list))
939 hashcode += TYPE_HASH (TREE_CHAIN (list));
941 if (TREE_VALUE (list))
942 hashcode += TYPE_HASH (TREE_VALUE (list));
945 if (TREE_PURPOSE (list))
946 hashcode += TYPE_HASH (TREE_PURPOSE (list));
952 /* Look in the type hash table for a type isomorphic to TYPE.
953 If one is found, return it. Otherwise return 0. */
956 list_hash_lookup (hashcode, list)
960 register struct list_hash *h;
961 for (h = list_hash_table[hashcode % TYPE_HASH_SIZE]; h; h = h->next)
962 if (h->hashcode == hashcode
963 && TREE_VIA_VIRTUAL (h->list) == TREE_VIA_VIRTUAL (list)
964 && TREE_VIA_PUBLIC (h->list) == TREE_VIA_PUBLIC (list)
965 && TREE_VIA_PROTECTED (h->list) == TREE_VIA_PROTECTED (list)
966 && TREE_PURPOSE (h->list) == TREE_PURPOSE (list)
967 && TREE_VALUE (h->list) == TREE_VALUE (list)
968 && TREE_CHAIN (h->list) == TREE_CHAIN (list))
970 my_friendly_assert (TREE_TYPE (h->list) == TREE_TYPE (list), 299);
976 /* Add an entry to the list-hash-table
977 for a list TYPE whose hash code is HASHCODE. */
980 list_hash_add (hashcode, list)
984 register struct list_hash *h;
986 h = (struct list_hash *) obstack_alloc (&class_obstack, sizeof (struct list_hash));
987 h->hashcode = hashcode;
989 h->next = list_hash_table[hashcode % TYPE_HASH_SIZE];
990 list_hash_table[hashcode % TYPE_HASH_SIZE] = h;
993 /* Given TYPE, and HASHCODE its hash code, return the canonical
994 object for an identical list if one already exists.
995 Otherwise, return TYPE, and record it as the canonical object
996 if it is a permanent object.
998 To use this function, first create a list of the sort you want.
999 Then compute its hash code from the fields of the list that
1000 make it different from other similar lists.
1001 Then call this function and use the value.
1002 This function frees the list you pass in if it is a duplicate. */
1004 /* Set to 1 to debug without canonicalization. Never set by program. */
1006 static int debug_no_list_hash = 0;
1009 list_hash_canon (hashcode, list)
1015 if (debug_no_list_hash)
1018 t1 = list_hash_lookup (hashcode, list);
1021 obstack_free (&class_obstack, list);
1025 /* If this is a new list, record it for later reuse. */
1026 list_hash_add (hashcode, list);
1032 hash_tree_cons (via_public, via_virtual, via_protected, purpose, value, chain)
1033 int via_public, via_virtual, via_protected;
1034 tree purpose, value, chain;
1036 struct obstack *ambient_obstack = current_obstack;
1040 current_obstack = &class_obstack;
1041 t = tree_cons (purpose, value, chain);
1042 TREE_VIA_PUBLIC (t) = via_public;
1043 TREE_VIA_PROTECTED (t) = via_protected;
1044 TREE_VIA_VIRTUAL (t) = via_virtual;
1045 hashcode = list_hash (t);
1046 t = list_hash_canon (hashcode, t);
1047 current_obstack = ambient_obstack;
1051 /* Constructor for hashed lists. */
1054 hash_tree_chain (value, chain)
1057 struct obstack *ambient_obstack = current_obstack;
1061 current_obstack = &class_obstack;
1062 t = tree_cons (NULL_TREE, value, chain);
1063 hashcode = list_hash (t);
1064 t = list_hash_canon (hashcode, t);
1065 current_obstack = ambient_obstack;
1069 /* Similar, but used for concatenating two lists. */
1072 hash_chainon (list1, list2)
1079 if (TREE_CHAIN (list1) == NULL_TREE)
1080 return hash_tree_chain (TREE_VALUE (list1), list2);
1081 return hash_tree_chain (TREE_VALUE (list1),
1082 hash_chainon (TREE_CHAIN (list1), list2));
1086 get_identifier_list (value)
1089 tree list = IDENTIFIER_AS_LIST (value);
1090 if (list != NULL_TREE
1091 && (TREE_CODE (list) != TREE_LIST
1092 || TREE_VALUE (list) != value))
1094 else if (IDENTIFIER_HAS_TYPE_VALUE (value)
1095 && TREE_CODE (IDENTIFIER_TYPE_VALUE (value)) == RECORD_TYPE
1096 && IDENTIFIER_TYPE_VALUE (value)
1097 == TYPE_MAIN_VARIANT (IDENTIFIER_TYPE_VALUE (value)))
1099 tree type = IDENTIFIER_TYPE_VALUE (value);
1101 if (TYPE_PTRMEMFUNC_P (type))
1103 else if (type == current_class_type)
1104 /* Don't mess up the constructor name. */
1105 list = tree_cons (NULL_TREE, value, NULL_TREE);
1108 if (! CLASSTYPE_ID_AS_LIST (type))
1109 CLASSTYPE_ID_AS_LIST (type)
1110 = perm_tree_cons (NULL_TREE, TYPE_IDENTIFIER (type), NULL_TREE);
1111 list = CLASSTYPE_ID_AS_LIST (type);
1118 get_decl_list (value)
1121 tree list = NULL_TREE;
1123 if (TREE_CODE (value) == IDENTIFIER_NODE)
1124 list = get_identifier_list (value);
1125 else if (TREE_CODE (value) == RECORD_TYPE
1126 && TYPE_LANG_SPECIFIC (value)
1127 && value == TYPE_MAIN_VARIANT (value))
1128 list = CLASSTYPE_AS_LIST (value);
1130 if (list != NULL_TREE)
1132 my_friendly_assert (TREE_CHAIN (list) == NULL_TREE, 301);
1136 return build_decl_list (NULL_TREE, value);
1139 /* Build an association between TYPE and some parameters:
1141 OFFSET is the offset added to `this' to convert it to a pointer
1144 BINFO is the base binfo to use, if we are deriving from one. This
1145 is necessary, as we want specialized parent binfos from base
1146 classes, so that the VTABLE_NAMEs of bases are for the most derived
1147 type, instead of of the simple type.
1149 VTABLE is the virtual function table with which to initialize
1150 sub-objects of type TYPE.
1152 VIRTUALS are the virtual functions sitting in VTABLE.
1154 CHAIN are more associations we must retain. */
1157 make_binfo (offset, binfo, vtable, virtuals, chain)
1159 tree vtable, virtuals;
1162 tree new_binfo = make_tree_vec (6);
1165 if (TREE_CODE (binfo) == TREE_VEC)
1166 type = BINFO_TYPE (binfo);
1170 binfo = TYPE_BINFO (binfo);
1173 TREE_CHAIN (new_binfo) = chain;
1175 TREE_USED (new_binfo) = TREE_USED (chain);
1177 TREE_TYPE (new_binfo) = TYPE_MAIN_VARIANT (type);
1178 BINFO_OFFSET (new_binfo) = offset;
1179 BINFO_VTABLE (new_binfo) = vtable;
1180 BINFO_VIRTUALS (new_binfo) = virtuals;
1181 BINFO_VPTR_FIELD (new_binfo) = NULL_TREE;
1183 if (binfo && BINFO_BASETYPES (binfo) != NULL_TREE)
1184 BINFO_BASETYPES (new_binfo) = copy_node (BINFO_BASETYPES (binfo));
1188 /* Return the binfo value for ELEM in TYPE. */
1191 binfo_value (elem, type)
1195 if (get_base_distance (elem, type, 0, (tree *)0) == -2)
1196 compiler_error ("base class `%s' ambiguous in binfo_value",
1197 TYPE_NAME_STRING (elem));
1199 return TYPE_BINFO (type);
1200 if (TREE_CODE (elem) == RECORD_TYPE && TYPE_BINFO (elem) == type)
1202 return get_binfo (elem, type, 0);
1209 register tree prev = 0, tmp, next;
1210 for (tmp = path; tmp; tmp = next)
1212 next = BINFO_INHERITANCE_CHAIN (tmp);
1213 BINFO_INHERITANCE_CHAIN (tmp) = prev;
1223 unsigned HOST_WIDE_INT n;
1226 fprintf (stderr, "type \"%s\"; offset = %d\n",
1227 TYPE_NAME_STRING (BINFO_TYPE (elem)),
1228 TREE_INT_CST_LOW (BINFO_OFFSET (elem)));
1229 fprintf (stderr, "vtable type:\n");
1230 debug_tree (BINFO_TYPE (elem));
1231 if (BINFO_VTABLE (elem))
1232 fprintf (stderr, "vtable decl \"%s\"\n", IDENTIFIER_POINTER (DECL_NAME (BINFO_VTABLE (elem))));
1234 fprintf (stderr, "no vtable decl yet\n");
1235 fprintf (stderr, "virtuals:\n");
1236 virtuals = BINFO_VIRTUALS (elem);
1238 n = skip_rtti_stuff (&virtuals);
1242 tree fndecl = TREE_OPERAND (FNADDR_FROM_VTABLE_ENTRY (TREE_VALUE (virtuals)), 0);
1243 fprintf (stderr, "%s [%d =? %d]\n",
1244 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl)),
1245 n, TREE_INT_CST_LOW (DECL_VINDEX (fndecl)));
1247 virtuals = TREE_CHAIN (virtuals);
1251 /* Return the length of a chain of nodes chained through DECL_CHAIN.
1252 We expect a null pointer to mark the end of the chain.
1253 This is the Lisp primitive `length'. */
1256 decl_list_length (t)
1260 register int len = 0;
1262 my_friendly_assert (TREE_CODE (t) == FUNCTION_DECL
1263 || TREE_CODE (t) == TEMPLATE_DECL, 300);
1264 for (tail = t; tail; tail = DECL_CHAIN (tail))
1274 if (TREE_CODE (t) == FUNCTION_DECL)
1276 else if (TREE_CODE (t) == TREE_LIST)
1277 return decl_list_length (TREE_VALUE (t));
1279 my_friendly_abort (359);
1284 is_overloaded_fn (x)
1287 if (TREE_CODE (x) == FUNCTION_DECL)
1290 if (TREE_CODE (x) == TREE_LIST
1291 && (TREE_CODE (TREE_VALUE (x)) == FUNCTION_DECL
1292 || TREE_CODE (TREE_VALUE (x)) == TEMPLATE_DECL))
1299 really_overloaded_fn (x)
1302 if (TREE_CODE (x) == TREE_LIST
1303 && (TREE_CODE (TREE_VALUE (x)) == FUNCTION_DECL
1304 || TREE_CODE (TREE_VALUE (x)) == TEMPLATE_DECL))
1314 if (TREE_CODE (from) == FUNCTION_DECL)
1317 my_friendly_assert (TREE_CODE (from) == TREE_LIST, 9);
1319 return TREE_VALUE (from);
1323 is_aggr_type_2 (t1, t2)
1326 if (TREE_CODE (t1) != TREE_CODE (t2))
1328 return IS_AGGR_TYPE (t1) && IS_AGGR_TYPE (t2);
1331 /* Give message using types TYPE1 and TYPE2 as arguments.
1332 PFN is the function which will print the message;
1333 S is the format string for PFN to use. */
1336 message_2_types (pfn, s, type1, type2)
1341 tree name1 = TYPE_NAME (type1);
1342 tree name2 = TYPE_NAME (type2);
1343 if (TREE_CODE (name1) == TYPE_DECL)
1344 name1 = DECL_NAME (name1);
1345 if (TREE_CODE (name2) == TYPE_DECL)
1346 name2 = DECL_NAME (name2);
1347 (*pfn) (s, IDENTIFIER_POINTER (name1), IDENTIFIER_POINTER (name2));
1350 #define PRINT_RING_SIZE 4
1353 lang_printable_name (decl, v)
1357 static tree decl_ring[PRINT_RING_SIZE];
1358 static char *print_ring[PRINT_RING_SIZE];
1359 static int ring_counter;
1362 /* Only cache functions. */
1364 || TREE_CODE (decl) != FUNCTION_DECL
1365 || DECL_LANG_SPECIFIC (decl) == 0)
1366 return lang_decl_name (decl, v);
1368 /* See if this print name is lying around. */
1369 for (i = 0; i < PRINT_RING_SIZE; i++)
1370 if (decl_ring[i] == decl)
1371 /* yes, so return it. */
1372 return print_ring[i];
1374 if (++ring_counter == PRINT_RING_SIZE)
1377 if (current_function_decl != NULL_TREE)
1379 if (decl_ring[ring_counter] == current_function_decl)
1381 if (ring_counter == PRINT_RING_SIZE)
1383 if (decl_ring[ring_counter] == current_function_decl)
1384 my_friendly_abort (106);
1387 if (print_ring[ring_counter])
1388 free (print_ring[ring_counter]);
1390 print_ring[ring_counter] = xstrdup (lang_decl_name (decl, v));
1391 decl_ring[ring_counter] = decl;
1392 return print_ring[ring_counter];
1395 /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions
1396 listed in RAISES. */
1399 build_exception_variant (type, raises)
1403 tree v = TYPE_MAIN_VARIANT (type);
1404 int constp = TYPE_READONLY (type);
1405 int volatilep = TYPE_VOLATILE (type);
1407 for (; v; v = TYPE_NEXT_VARIANT (v))
1409 if (TYPE_READONLY (v) != constp
1410 || TYPE_VOLATILE (v) != volatilep)
1413 /* @@ This should do set equality, not exact match. */
1414 if (simple_cst_list_equal (TYPE_RAISES_EXCEPTIONS (v), raises))
1415 /* List of exceptions raised matches previously found list.
1417 @@ Nice to free up storage used in consing up the
1418 @@ list of exceptions raised. */
1422 /* Need to build a new variant. */
1423 v = build_type_copy (type);
1425 if (raises && ! TREE_PERMANENT (raises))
1427 push_obstacks_nochange ();
1428 end_temporary_allocation ();
1429 raises = copy_list (raises);
1433 TYPE_RAISES_EXCEPTIONS (v) = raises;
1437 /* Subroutine of copy_to_permanent
1439 Assuming T is a node build bottom-up, make it all exist on
1440 permanent obstack, if it is not permanent already. */
1452 if (tmp = func (t), tmp != NULL_TREE)
1455 switch (TREE_CODE (t))
1458 return error_mark_node;
1467 tree chain = TREE_CHAIN (t);
1469 TREE_CHAIN (t) = mapcar (chain, func);
1470 TREE_TYPE (t) = mapcar (TREE_TYPE (t), func);
1471 DECL_INITIAL (t) = mapcar (DECL_INITIAL (t), func);
1472 DECL_SIZE (t) = mapcar (DECL_SIZE (t), func);
1478 tree chain = TREE_CHAIN (t);
1480 TREE_PURPOSE (t) = mapcar (TREE_PURPOSE (t), func);
1481 TREE_VALUE (t) = mapcar (TREE_VALUE (t), func);
1482 TREE_CHAIN (t) = mapcar (chain, func);
1488 int len = TREE_VEC_LENGTH (t);
1492 TREE_VEC_ELT (t, len) = mapcar (TREE_VEC_ELT (t, len), func);
1499 return copy_node (t);
1505 TREE_OPERAND (t, 0) = mapcar (TREE_OPERAND (t, 0), func);
1506 TREE_OPERAND (t, 1) = mapcar (TREE_OPERAND (t, 1), func);
1507 TREE_OPERAND (t, 2) = mapcar (TREE_OPERAND (t, 2), func);
1512 TREE_OPERAND (t, 0) = mapcar (TREE_OPERAND (t, 0), func);
1519 case TRUNC_DIV_EXPR:
1520 case TRUNC_MOD_EXPR:
1528 case BIT_ANDTC_EXPR:
1529 case TRUTH_ANDIF_EXPR:
1530 case TRUTH_ORIF_EXPR:
1538 case FLOOR_DIV_EXPR:
1539 case ROUND_DIV_EXPR:
1541 case FLOOR_MOD_EXPR:
1542 case ROUND_MOD_EXPR:
1544 case PREDECREMENT_EXPR:
1545 case PREINCREMENT_EXPR:
1546 case POSTDECREMENT_EXPR:
1547 case POSTINCREMENT_EXPR:
1552 TREE_OPERAND (t, 0) = mapcar (TREE_OPERAND (t, 0), func);
1553 TREE_OPERAND (t, 1) = mapcar (TREE_OPERAND (t, 1), func);
1561 case TRUTH_NOT_EXPR:
1565 TREE_OPERAND (t, 0) = mapcar (TREE_OPERAND (t, 0), func);
1569 tmp = build_pointer_type (mapcar (TREE_TYPE (t), func));
1570 return cp_build_type_variant (tmp, TYPE_READONLY (t), TYPE_VOLATILE (t));
1571 case REFERENCE_TYPE:
1572 tmp = build_reference_type (mapcar (TREE_TYPE (t), func));
1573 return cp_build_type_variant (tmp, TYPE_READONLY (t), TYPE_VOLATILE (t));
1575 tmp = build_function_type (mapcar (TREE_TYPE (t), func),
1576 mapcar (TYPE_ARG_TYPES (t), func));
1577 return cp_build_type_variant (tmp, TYPE_READONLY (t), TYPE_VOLATILE (t));
1579 tmp = build_cplus_array_type (mapcar (TREE_TYPE (t), func),
1580 mapcar (TYPE_DOMAIN (t), func));
1581 return cp_build_type_variant (tmp, TYPE_READONLY (t), TYPE_VOLATILE (t));
1583 tmp = build_index_type (mapcar (TYPE_MAX_VALUE (t), func));
1584 return cp_build_type_variant (tmp, TYPE_READONLY (t), TYPE_VOLATILE (t));
1586 tmp = build_offset_type (mapcar (TYPE_OFFSET_BASETYPE (t), func),
1587 mapcar (TREE_TYPE (t), func));
1588 return cp_build_type_variant (tmp, TYPE_READONLY (t), TYPE_VOLATILE (t));
1590 tmp = build_cplus_method_type
1591 (mapcar (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t))), func),
1592 mapcar (TREE_TYPE (t), func),
1593 mapcar (TREE_CHAIN (TYPE_ARG_TYPES (t)), func));
1594 return cp_build_type_variant (tmp, TYPE_READONLY (t), TYPE_VOLATILE (t));
1598 CONSTRUCTOR_ELTS (t) = mapcar (CONSTRUCTOR_ELTS (t), func);
1602 if (TYPE_PTRMEMFUNC_P (t))
1603 return build_ptrmemfunc_type
1604 (mapcar (TYPE_PTRMEMFUNC_FN_TYPE (t), func));
1605 /* else fall through */
1607 /* This list is incomplete, but should suffice for now.
1608 It is very important that `sorry' not call
1609 `report_error_function'. That could cause an infinite loop. */
1611 sorry ("initializer contains unrecognized tree code");
1612 return error_mark_node;
1615 my_friendly_abort (107);
1624 if (TREE_PERMANENT (t))
1626 /* Support `void f () { extern int i; A<&i> a; }' */
1627 if ((TREE_CODE (t) == VAR_DECL || TREE_CODE (t) == FUNCTION_DECL)
1629 return copy_node (t);
1633 /* Assuming T is a node built bottom-up, make it all exist on
1634 permanent obstack, if it is not permanent already. */
1637 copy_to_permanent (t)
1640 register struct obstack *ambient_obstack = current_obstack;
1641 register struct obstack *ambient_saveable_obstack = saveable_obstack;
1642 register struct obstack *ambient_expression_obstack = expression_obstack;
1644 if (t == NULL_TREE || TREE_PERMANENT (t))
1647 saveable_obstack = &permanent_obstack;
1648 current_obstack = saveable_obstack;
1649 expression_obstack = saveable_obstack;
1651 t = mapcar (t, perm_manip);
1653 current_obstack = ambient_obstack;
1654 saveable_obstack = ambient_saveable_obstack;
1655 expression_obstack = ambient_expression_obstack;
1660 #ifdef GATHER_STATISTICS
1661 extern int depth_reached;
1665 print_lang_statistics ()
1667 extern struct obstack maybepermanent_obstack, decl_obstack;
1668 print_obstack_statistics ("class_obstack", &class_obstack);
1669 print_obstack_statistics ("decl_obstack", &decl_obstack);
1670 print_obstack_statistics ("permanent_obstack", &permanent_obstack);
1671 print_obstack_statistics ("maybepermanent_obstack", &maybepermanent_obstack);
1672 print_search_statistics ();
1673 print_class_statistics ();
1674 #ifdef GATHER_STATISTICS
1675 fprintf (stderr, "maximum template instantiation depth reached: %d\n",
1680 /* This is used by the `assert' macro. It is provided in libgcc.a,
1681 which `cc' doesn't know how to link. Note that the C++ front-end
1682 no longer actually uses the `assert' macro (instead, it calls
1683 my_friendly_assert). But all of the back-end files still need this. */
1686 __eprintf (string, expression, line, filename)
1689 const char *expression;
1691 const char *filename;
1699 fprintf (stderr, string, expression, line, filename);
1704 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1705 (which is an ARRAY_TYPE). This counts only elements of the top
1709 array_type_nelts_top (type)
1712 return fold (build (PLUS_EXPR, sizetype,
1713 array_type_nelts (type),
1717 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1718 (which is an ARRAY_TYPE). This one is a recursive count of all
1719 ARRAY_TYPEs that are clumped together. */
1722 array_type_nelts_total (type)
1725 tree sz = array_type_nelts_top (type);
1726 type = TREE_TYPE (type);
1727 while (TREE_CODE (type) == ARRAY_TYPE)
1729 tree n = array_type_nelts_top (type);
1730 sz = fold (build (MULT_EXPR, sizetype, sz, n));
1731 type = TREE_TYPE (type);
1741 if (TREE_CODE (t) != TREE_LIST && ! TREE_SIDE_EFFECTS (t))
1743 else if (TREE_CODE (t) == TARGET_EXPR)
1745 if (TREE_CODE (TREE_OPERAND (t, 1)) == NEW_EXPR)
1747 mark_used (TREE_OPERAND (TREE_OPERAND (TREE_OPERAND (t, 1), 0), 0));
1748 return build_cplus_new
1749 (TREE_TYPE (t), break_out_target_exprs (TREE_OPERAND (t, 1)));
1752 TREE_OPERAND (t, 0) = build (VAR_DECL, TREE_TYPE (t));
1753 layout_decl (TREE_OPERAND (t, 0), 0);
1756 else if (TREE_CODE (t) == CALL_EXPR)
1757 mark_used (TREE_OPERAND (TREE_OPERAND (t, 0), 0));
1762 /* Actually, we'll just clean out the target exprs for the moment. */
1765 break_out_target_exprs (t)
1768 return mapcar (t, bot_manip);
1771 /* Obstack used for allocating nodes in template function and variable
1774 extern struct obstack *expression_obstack;
1776 /* Similar to `build_nt', except we build
1777 on the permanent_obstack, regardless. */
1780 build_min_nt VPROTO((enum tree_code code, ...))
1783 enum tree_code code;
1785 register struct obstack *ambient_obstack = expression_obstack;
1788 register int length;
1794 code = va_arg (p, enum tree_code);
1797 expression_obstack = &permanent_obstack;
1799 t = make_node (code);
1800 length = tree_code_length[(int) code];
1801 TREE_COMPLEXITY (t) = lineno;
1803 for (i = 0; i < length; i++)
1805 tree x = va_arg (p, tree);
1806 TREE_OPERAND (t, i) = copy_to_permanent (x);
1810 expression_obstack = ambient_obstack;
1814 /* Similar to `build', except we build
1815 on the permanent_obstack, regardless. */
1818 build_min VPROTO((enum tree_code code, tree tt, ...))
1821 enum tree_code code;
1824 register struct obstack *ambient_obstack = expression_obstack;
1827 register int length;
1833 code = va_arg (p, enum tree_code);
1834 tt = va_arg (p, tree);
1837 expression_obstack = &permanent_obstack;
1839 t = make_node (code);
1840 length = tree_code_length[(int) code];
1842 TREE_COMPLEXITY (t) = lineno;
1844 for (i = 0; i < length; i++)
1846 tree x = va_arg (p, tree);
1847 TREE_OPERAND (t, i) = copy_to_permanent (x);
1851 expression_obstack = ambient_obstack;
1855 /* Same as `tree_cons' but make a permanent object. */
1858 min_tree_cons (purpose, value, chain)
1859 tree purpose, value, chain;
1862 register struct obstack *ambient_obstack = current_obstack;
1863 current_obstack = &permanent_obstack;
1865 node = tree_cons (copy_to_permanent (purpose),
1866 copy_to_permanent (value), chain);
1867 current_obstack = ambient_obstack;
1875 if (TREE_CODE (t) == IDENTIFIER_NODE)
1876 return identifier_typedecl_value (t);
1877 if (TREE_CODE (t) == TYPE_DECL)
1879 if (TREE_CODE_CLASS (TREE_CODE (t)) == 't')
1880 return TYPE_STUB_DECL (t);
1882 my_friendly_abort (42);
1886 can_free (obstack, t)
1887 struct obstack *obstack;
1892 if (TREE_CODE (t) == TREE_VEC)
1893 size = (TREE_VEC_LENGTH (t)-1) * sizeof (tree) + sizeof (struct tree_vec);
1895 my_friendly_abort (42);
1897 #define ROUND(x) ((x + obstack_alignment_mask (obstack)) \
1898 & ~ obstack_alignment_mask (obstack))
1899 if ((char *)t + ROUND (size) == obstack_next_free (obstack))
1906 /* Return first vector element whose BINFO_TYPE is ELEM.
1907 Return 0 if ELEM is not in VEC. VEC may be NULL_TREE. */
1910 vec_binfo_member (elem, vec)
1916 for (i = 0; i < TREE_VEC_LENGTH (vec); ++i)
1917 if (comptypes (elem, BINFO_TYPE (TREE_VEC_ELT (vec, i)), 1))
1918 return TREE_VEC_ELT (vec, i);
1923 /* Kludge around the fact that DECL_CONTEXT for virtual functions returns
1924 the wrong thing for decl_function_context. Hopefully the uses in the
1925 backend won't matter, since we don't need a static chain for local class
1929 hack_decl_function_context (decl)
1932 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_FUNCTION_MEMBER_P (decl))
1933 return decl_function_context (TYPE_MAIN_DECL (DECL_CLASS_CONTEXT (decl)));
1934 return decl_function_context (decl);
1937 /* Return truthvalue of whether T1 is the same tree structure as T2.
1938 Return 1 if they are the same.
1939 Return 0 if they are understandably different.
1940 Return -1 if either contains tree structure not understood by
1944 cp_tree_equal (t1, t2)
1947 register enum tree_code code1, code2;
1952 if (t1 == 0 || t2 == 0)
1955 code1 = TREE_CODE (t1);
1956 code2 = TREE_CODE (t2);
1958 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
1959 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR || code2 == NON_LVALUE_EXPR)
1960 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1962 return cp_tree_equal (TREE_OPERAND (t1, 0), t2);
1963 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
1964 || code2 == NON_LVALUE_EXPR)
1965 return cp_tree_equal (t1, TREE_OPERAND (t2, 0));
1973 return TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
1974 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2);
1977 return REAL_VALUES_EQUAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
1980 return TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
1981 && !bcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
1982 TREE_STRING_LENGTH (t1));
1988 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1991 cmp = cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1994 return simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1997 /* Special case: if either target is an unallocated VAR_DECL,
1998 it means that it's going to be unified with whatever the
1999 TARGET_EXPR is really supposed to initialize, so treat it
2000 as being equivalent to anything. */
2001 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
2002 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
2003 && DECL_RTL (TREE_OPERAND (t1, 0)) == 0)
2004 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
2005 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
2006 && DECL_RTL (TREE_OPERAND (t2, 0)) == 0))
2009 cmp = cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
2012 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
2014 case WITH_CLEANUP_EXPR:
2015 cmp = cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
2018 return cp_tree_equal (TREE_OPERAND (t1, 2), TREE_OPERAND (t1, 2));
2021 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
2022 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
2031 case TEMPLATE_CONST_PARM:
2032 return TEMPLATE_CONST_IDX (t1) == TEMPLATE_CONST_IDX (t2);
2035 if (TREE_CODE (TREE_OPERAND (t1, 0)) != TREE_CODE (TREE_OPERAND (t2, 0)))
2037 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (t1, 0))) == 't')
2038 return comptypes (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0), 1);
2042 switch (TREE_CODE_CLASS (code1))
2052 for (i=0; i<tree_code_length[(int) code1]; ++i)
2054 cmp = cp_tree_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
2064 /* Similar to make_tree_vec, but build on a temporary obstack. */
2071 push_obstacks_nochange ();
2072 resume_temporary_allocation ();
2073 node = make_tree_vec (len);
2078 /* The type of ARG when used as an lvalue. */
2084 return cp_build_type_variant
2085 (TREE_TYPE (arg), TREE_READONLY (arg), TREE_THIS_VOLATILE (arg));
2088 /* The type of ARG for printing error messages; denote lvalues with
2095 tree type = TREE_TYPE (arg);
2096 if (TREE_CODE (type) == ARRAY_TYPE)
2098 else if (real_lvalue_p (arg))
2099 type = build_reference_type (lvalue_type (arg));
2100 else if (IS_AGGR_TYPE (type))
2101 type = lvalue_type (arg);