1 /* Language-dependent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 88, 92-98, 1999 Free Software Foundation, Inc.
3 Hacked by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
31 #include "insn-config.h"
32 #include "integrate.h"
34 static tree bot_manip PROTO((tree *, int *, void *));
35 static tree bot_replace PROTO((tree *, int *, void *));
36 static tree build_cplus_array_type_1 PROTO((tree, tree));
37 static void list_hash_add PROTO((int, tree));
38 static int list_hash PROTO((tree, tree, tree));
39 static tree list_hash_lookup PROTO((int, tree, tree, tree));
40 static cp_lvalue_kind lvalue_p_1 PROTO((tree, int));
41 static tree no_linkage_helper PROTO((tree *, int *, void *));
42 static tree build_srcloc PROTO((char *, int));
43 static void mark_list_hash PROTO ((void *));
44 static int statement_code_p PROTO((enum tree_code));
45 static tree mark_local_for_remap_r PROTO((tree *, int *, void *));
46 static tree cp_unsave_r PROTO ((tree *, int *, void *));
47 static void cp_unsave PROTO((tree *));
48 static tree build_target_expr PROTO((tree, tree));
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 DECL_CONTEXT (slot) = current_function_decl;
263 layout_decl (slot, 0);
265 /* We split the CALL_EXPR into its function and its arguments here.
266 Then, in expand_expr, we put them back together. The reason for
267 this is that this expression might be a default argument
268 expression. In that case, we need a new temporary every time the
269 expression is used. That's what break_out_target_exprs does; it
270 replaces every AGGR_INIT_EXPR with a copy that uses a fresh
271 temporary slot. Then, expand_expr builds up a call-expression
272 using the new slot. */
273 fn = TREE_OPERAND (init, 0);
274 rval = build (AGGR_INIT_EXPR, type, fn, TREE_OPERAND (init, 1), slot);
275 TREE_SIDE_EFFECTS (rval) = 1;
276 AGGR_INIT_VIA_CTOR_P (rval)
277 = (TREE_CODE (fn) == ADDR_EXPR
278 && TREE_CODE (TREE_OPERAND (fn, 0)) == FUNCTION_DECL
279 && DECL_CONSTRUCTOR_P (TREE_OPERAND (fn, 0)));
280 rval = build_target_expr (slot, rval);
285 /* Buidl a TARGET_EXPR using INIT to initialize a new temporary of the
289 build_target_expr_with_type (init, type)
296 slot = build (VAR_DECL, type);
297 DECL_ARTIFICIAL (slot) = 1;
298 DECL_CONTEXT (slot) = current_function_decl;
299 layout_decl (slot, 0);
300 rval = build_target_expr (slot, init);
305 /* Like build_target_expr_with_type, but use the type of INIT. */
308 get_target_expr (init)
311 return build_target_expr_with_type (init, TREE_TYPE (init));
314 /* Recursively search EXP for CALL_EXPRs that need cleanups and replace
315 these CALL_EXPRs with tree nodes that will perform the cleanups. */
318 break_out_cleanups (exp)
323 if (TREE_CODE (tmp) == CALL_EXPR
324 && TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (tmp)))
325 return build_cplus_new (TREE_TYPE (tmp), tmp);
327 while (TREE_CODE (tmp) == NOP_EXPR
328 || TREE_CODE (tmp) == CONVERT_EXPR
329 || TREE_CODE (tmp) == NON_LVALUE_EXPR)
331 if (TREE_CODE (TREE_OPERAND (tmp, 0)) == CALL_EXPR
332 && TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (TREE_OPERAND (tmp, 0))))
334 TREE_OPERAND (tmp, 0)
335 = build_cplus_new (TREE_TYPE (TREE_OPERAND (tmp, 0)),
336 TREE_OPERAND (tmp, 0));
340 tmp = TREE_OPERAND (tmp, 0);
345 /* Recursively perform a preorder search EXP for CALL_EXPRs, making
346 copies where they are found. Returns a deep copy all nodes transitively
347 containing CALL_EXPRs. */
350 break_out_calls (exp)
353 register tree t1, t2 = NULL_TREE;
354 register enum tree_code code;
355 register int changed = 0;
358 if (exp == NULL_TREE)
361 code = TREE_CODE (exp);
363 if (code == CALL_EXPR)
364 return copy_node (exp);
366 /* Don't try and defeat a save_expr, as it should only be done once. */
367 if (code == SAVE_EXPR)
370 switch (TREE_CODE_CLASS (code))
375 case 'c': /* a constant */
376 case 't': /* a type node */
377 case 'x': /* something random, like an identifier or an ERROR_MARK. */
380 case 'd': /* A decl node */
381 #if 0 /* This is bogus. jason 9/21/94 */
383 t1 = break_out_calls (DECL_INITIAL (exp));
384 if (t1 != DECL_INITIAL (exp))
386 exp = copy_node (exp);
387 DECL_INITIAL (exp) = t1;
392 case 'b': /* A block node */
394 /* Don't know how to handle these correctly yet. Must do a
395 break_out_calls on all DECL_INITIAL values for local variables,
396 and also break_out_calls on all sub-blocks and sub-statements. */
401 case 'e': /* an expression */
402 case 'r': /* a reference */
403 case 's': /* an expression with side effects */
404 for (i = tree_code_length[(int) code] - 1; i >= 0; i--)
406 t1 = break_out_calls (TREE_OPERAND (exp, i));
407 if (t1 != TREE_OPERAND (exp, i))
409 exp = copy_node (exp);
410 TREE_OPERAND (exp, i) = t1;
415 case '<': /* a comparison expression */
416 case '2': /* a binary arithmetic expression */
417 t2 = break_out_calls (TREE_OPERAND (exp, 1));
418 if (t2 != TREE_OPERAND (exp, 1))
420 case '1': /* a unary arithmetic expression */
421 t1 = break_out_calls (TREE_OPERAND (exp, 0));
422 if (t1 != TREE_OPERAND (exp, 0))
426 if (tree_code_length[(int) code] == 1)
427 return build1 (code, TREE_TYPE (exp), t1);
429 return build (code, TREE_TYPE (exp), t1, t2);
436 extern struct obstack permanent_obstack;
438 /* Here is how primitive or already-canonicalized types' hash
439 codes are made. MUST BE CONSISTENT WITH tree.c !!! */
440 #define TYPE_HASH(TYPE) ((HOST_WIDE_INT) (TYPE) & 0777777)
442 /* Construct, lay out and return the type of methods belonging to class
443 BASETYPE and whose arguments are described by ARGTYPES and whose values
444 are described by RETTYPE. If each type exists already, reuse it. */
447 build_cplus_method_type (basetype, rettype, argtypes)
448 tree basetype, rettype, argtypes;
454 /* Make a node of the sort we want. */
455 t = make_node (METHOD_TYPE);
457 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
458 TREE_TYPE (t) = rettype;
459 ptype = build_pointer_type (basetype);
461 /* The actual arglist for this function includes a "hidden" argument
462 which is "this". Put it into the list of argument types. Make
463 sure that the new argument list is allocated on the same obstack
465 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
466 TYPE_ARG_TYPES (t) = argtypes;
467 TREE_SIDE_EFFECTS (argtypes) = 1; /* Mark first argtype as "artificial". */
469 /* If we already have such a type, use the old one and free this one.
470 Note that it also frees up the above cons cell if found. */
471 hashcode = TYPE_HASH (basetype) + TYPE_HASH (rettype) +
472 type_hash_list (argtypes);
474 t = type_hash_canon (hashcode, t);
476 if (TYPE_SIZE (t) == 0)
483 build_cplus_array_type_1 (elt_type, index_type)
489 if (elt_type == error_mark_node || index_type == error_mark_node)
490 return error_mark_node;
492 if (processing_template_decl
493 || uses_template_parms (elt_type)
494 || uses_template_parms (index_type))
496 t = make_node (ARRAY_TYPE);
497 TREE_TYPE (t) = elt_type;
498 TYPE_DOMAIN (t) = index_type;
501 t = build_array_type (elt_type, index_type);
503 /* Push these needs up so that initialization takes place
505 TYPE_NEEDS_CONSTRUCTING (t)
506 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (elt_type));
507 TYPE_NEEDS_DESTRUCTOR (t)
508 = TYPE_NEEDS_DESTRUCTOR (TYPE_MAIN_VARIANT (elt_type));
513 build_cplus_array_type (elt_type, index_type)
518 int type_quals = CP_TYPE_QUALS (elt_type);
520 elt_type = TYPE_MAIN_VARIANT (elt_type);
522 t = build_cplus_array_type_1 (elt_type, index_type);
524 if (type_quals != TYPE_UNQUALIFIED)
525 t = cp_build_qualified_type (t, type_quals);
530 /* Make a variant of TYPE, qualified with the TYPE_QUALS. Handles
531 arrays correctly. In particular, if TYPE is an array of T's, and
532 TYPE_QUALS is non-empty, returns an array of qualified T's. If
533 at attempt is made to qualify a type illegally, and COMPLAIN is
534 non-zero, an error is issued. If COMPLAIN is zero, error_mark_node
538 cp_build_qualified_type_real (type, type_quals, complain)
545 if (type == error_mark_node)
548 if (type_quals == TYPE_QUALS (type))
551 /* A restrict-qualified pointer type must be a pointer (or reference)
552 to object or incomplete type. */
553 if ((type_quals & TYPE_QUAL_RESTRICT)
554 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
555 && (!POINTER_TYPE_P (type)
556 || TYPE_PTRMEM_P (type)
557 || TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE))
560 cp_error ("`%T' cannot be `restrict'-qualified", type);
562 return error_mark_node;
564 type_quals &= ~TYPE_QUAL_RESTRICT;
567 if (type_quals != TYPE_UNQUALIFIED
568 && TREE_CODE (type) == FUNCTION_TYPE)
571 cp_error ("`%T' cannot be `const'-, `volatile'-, or `restrict'-qualified", type);
573 return error_mark_node;
574 type_quals = TYPE_UNQUALIFIED;
576 else if (TREE_CODE (type) == ARRAY_TYPE)
578 /* In C++, the qualification really applies to the array element
579 type. Obtain the appropriately qualified element type. */
582 = cp_build_qualified_type_real (TREE_TYPE (type),
586 if (element_type == error_mark_node)
587 return error_mark_node;
589 /* See if we already have an identically qualified type. */
590 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
591 if (CP_TYPE_QUALS (t) == type_quals)
594 /* If we didn't already have it, create it now. */
597 /* Make a new array type, just like the old one, but with the
598 appropriately qualified element type. */
599 t = build_type_copy (type);
600 TREE_TYPE (t) = element_type;
603 /* Even if we already had this variant, we update
604 TYPE_NEEDS_CONSTRUCTING and TYPE_NEEDS_DESTRUCTOR in case
605 they changed since the variant was originally created.
607 This seems hokey; if there is some way to use a previous
608 variant *without* coming through here,
609 TYPE_NEEDS_CONSTRUCTING will never be updated. */
610 TYPE_NEEDS_CONSTRUCTING (t)
611 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (element_type));
612 TYPE_NEEDS_DESTRUCTOR (t)
613 = TYPE_NEEDS_DESTRUCTOR (TYPE_MAIN_VARIANT (element_type));
616 else if (TYPE_PTRMEMFUNC_P (type))
618 /* For a pointer-to-member type, we can't just return a
619 cv-qualified version of the RECORD_TYPE. If we do, we
620 haven't change the field that contains the actual pointer to
621 a method, and so TYPE_PTRMEMFUNC_FN_TYPE will be wrong. */
624 t = TYPE_PTRMEMFUNC_FN_TYPE (type);
625 t = cp_build_qualified_type_real (t, type_quals, complain);
626 return build_ptrmemfunc_type (t);
629 /* Retrieve (or create) the appropriately qualified variant. */
630 result = build_qualified_type (type, type_quals);
632 /* If this was a pointer-to-method type, and we just made a copy,
633 then we need to clear the cached associated
634 pointer-to-member-function type; it is not valid for the new
637 && TREE_CODE (type) == POINTER_TYPE
638 && TREE_CODE (TREE_TYPE (type)) == METHOD_TYPE)
639 TYPE_SET_PTRMEMFUNC_TYPE (result, NULL_TREE);
644 /* Returns the canonical version of TYPE. In other words, if TYPE is
645 a typedef, returns the underlying type. The cv-qualification of
646 the type returned matches the type input; they will always be
650 canonical_type_variant (t)
653 return cp_build_qualified_type (TYPE_MAIN_VARIANT (t), CP_TYPE_QUALS (t));
656 /* Makes new binfos for the indirect bases under BINFO, and updates
657 BINFO_OFFSET for them and their bases. */
660 unshare_base_binfos (binfo)
663 tree binfos = BINFO_BASETYPES (binfo);
667 if (binfos == NULL_TREE)
670 /* Now unshare the structure beneath BINFO. */
671 for (j = TREE_VEC_LENGTH (binfos)-1;
674 tree base_binfo = TREE_VEC_ELT (binfos, j);
675 new_binfo = TREE_VEC_ELT (binfos, j)
676 = make_binfo (BINFO_OFFSET (base_binfo),
678 BINFO_VTABLE (base_binfo),
679 BINFO_VIRTUALS (base_binfo));
680 TREE_VIA_PUBLIC (new_binfo) = TREE_VIA_PUBLIC (base_binfo);
681 TREE_VIA_PROTECTED (new_binfo) = TREE_VIA_PROTECTED (base_binfo);
682 TREE_VIA_VIRTUAL (new_binfo) = TREE_VIA_VIRTUAL (base_binfo);
683 BINFO_INHERITANCE_CHAIN (new_binfo) = binfo;
684 unshare_base_binfos (new_binfo);
689 /* Hashing of lists so that we don't make duplicates.
690 The entry point is `list_hash_canon'. */
692 /* Each hash table slot is a bucket containing a chain
693 of these structures. */
697 struct list_hash *next; /* Next structure in the bucket. */
698 int hashcode; /* Hash code of this list. */
699 tree list; /* The list recorded here. */
702 /* Now here is the hash table. When recording a list, it is added
703 to the slot whose index is the hash code mod the table size.
704 Note that the hash table is used for several kinds of lists.
705 While all these live in the same table, they are completely independent,
706 and the hash code is computed differently for each of these. */
708 #define TYPE_HASH_SIZE 59
709 static struct list_hash *list_hash_table[TYPE_HASH_SIZE];
711 /* Compute a hash code for a list (chain of TREE_LIST nodes
712 with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the
713 TREE_COMMON slots), by adding the hash codes of the individual entries. */
716 list_hash (purpose, value, chain)
717 tree purpose, value, chain;
719 register int hashcode = 0;
722 hashcode += TYPE_HASH (chain);
725 hashcode += TYPE_HASH (value);
729 hashcode += TYPE_HASH (purpose);
735 /* Look in the type hash table for a type isomorphic to TYPE.
736 If one is found, return it. Otherwise return 0. */
739 list_hash_lookup (hashcode, purpose, value, chain)
741 tree purpose, value, chain;
743 register struct list_hash *h;
745 for (h = list_hash_table[hashcode % TYPE_HASH_SIZE]; h; h = h->next)
746 if (h->hashcode == hashcode
747 && TREE_PURPOSE (h->list) == purpose
748 && TREE_VALUE (h->list) == value
749 && TREE_CHAIN (h->list) == chain)
754 /* Add an entry to the list-hash-table
755 for a list TYPE whose hash code is HASHCODE. */
758 list_hash_add (hashcode, list)
762 register struct list_hash *h;
764 h = (struct list_hash *) obstack_alloc (&permanent_obstack, sizeof (struct list_hash));
765 h->hashcode = hashcode;
767 h->next = list_hash_table[hashcode % TYPE_HASH_SIZE];
768 list_hash_table[hashcode % TYPE_HASH_SIZE] = h;
771 /* Given list components PURPOSE, VALUE, AND CHAIN, return the canonical
772 object for an identical list if one already exists. Otherwise, build a
773 new one, and record it as the canonical object. */
775 /* Set to 1 to debug without canonicalization. Never set by program. */
777 static int debug_no_list_hash = 0;
780 hash_tree_cons (purpose, value, chain)
781 tree purpose, value, chain;
786 if (! debug_no_list_hash)
788 hashcode = list_hash (purpose, value, chain);
789 t = list_hash_lookup (hashcode, purpose, value, chain);
794 t = tree_cons (purpose, value, chain);
796 /* If this is a new list, record it for later reuse. */
797 if (! debug_no_list_hash)
798 list_hash_add (hashcode, t);
803 /* Constructor for hashed lists. */
806 hash_tree_chain (value, chain)
809 return hash_tree_cons (NULL_TREE, value, chain);
812 /* Similar, but used for concatenating two lists. */
815 hash_chainon (list1, list2)
822 if (TREE_CHAIN (list1) == NULL_TREE)
823 return hash_tree_chain (TREE_VALUE (list1), list2);
824 return hash_tree_chain (TREE_VALUE (list1),
825 hash_chainon (TREE_CHAIN (list1), list2));
828 /* Build an association between TYPE and some parameters:
830 OFFSET is the offset added to `this' to convert it to a pointer
833 BINFO is the base binfo to use, if we are deriving from one. This
834 is necessary, as we want specialized parent binfos from base
835 classes, so that the VTABLE_NAMEs of bases are for the most derived
836 type, instead of the simple type.
838 VTABLE is the virtual function table with which to initialize
839 sub-objects of type TYPE.
841 VIRTUALS are the virtual functions sitting in VTABLE. */
844 make_binfo (offset, binfo, vtable, virtuals)
846 tree vtable, virtuals;
848 tree new_binfo = make_tree_vec (7);
851 if (TREE_CODE (binfo) == TREE_VEC)
852 type = BINFO_TYPE (binfo);
856 binfo = CLASS_TYPE_P (type) ? TYPE_BINFO (binfo) : NULL_TREE;
859 TREE_TYPE (new_binfo) = TYPE_MAIN_VARIANT (type);
860 BINFO_OFFSET (new_binfo) = offset;
861 BINFO_VTABLE (new_binfo) = vtable;
862 BINFO_VIRTUALS (new_binfo) = virtuals;
863 BINFO_VPTR_FIELD (new_binfo) = NULL_TREE;
865 if (binfo && BINFO_BASETYPES (binfo) != NULL_TREE)
866 BINFO_BASETYPES (new_binfo) = copy_node (BINFO_BASETYPES (binfo));
870 /* Return the binfo value for ELEM in TYPE. */
873 binfo_value (elem, type)
877 if (get_base_distance (elem, type, 0, (tree *)0) == -2)
878 compiler_error ("base class `%s' ambiguous in binfo_value",
879 TYPE_NAME_STRING (elem));
881 return TYPE_BINFO (type);
882 if (TREE_CODE (elem) == RECORD_TYPE && TYPE_BINFO (elem) == type)
884 return get_binfo (elem, type, 0);
887 /* Return a reversed copy of the BINFO-chain given by PATH. (If the
888 BINFO_INHERITANCE_CHAIN points from base classes to derived
889 classes, it will instead point from derived classes to base
890 classes.) Returns the first node in the reversed chain. */
896 register tree prev = NULL_TREE, cur;
897 for (cur = path; cur; cur = BINFO_INHERITANCE_CHAIN (cur))
899 tree r = copy_node (cur);
900 BINFO_INHERITANCE_CHAIN (r) = prev;
910 unsigned HOST_WIDE_INT n;
913 fprintf (stderr, "type \"%s\"; offset = %ld\n",
914 TYPE_NAME_STRING (BINFO_TYPE (elem)),
915 (long) TREE_INT_CST_LOW (BINFO_OFFSET (elem)));
916 fprintf (stderr, "vtable type:\n");
917 debug_tree (BINFO_TYPE (elem));
918 if (BINFO_VTABLE (elem))
919 fprintf (stderr, "vtable decl \"%s\"\n", IDENTIFIER_POINTER (DECL_NAME (BINFO_VTABLE (elem))));
921 fprintf (stderr, "no vtable decl yet\n");
922 fprintf (stderr, "virtuals:\n");
923 virtuals = skip_rtti_stuff (elem, BINFO_TYPE (elem), &n);
927 tree fndecl = TREE_VALUE (virtuals);
928 fprintf (stderr, "%s [%ld =? %ld]\n",
929 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl)),
930 (long) n, (long) TREE_INT_CST_LOW (DECL_VINDEX (fndecl)));
932 virtuals = TREE_CHAIN (virtuals);
941 if (TREE_CODE (t) == FUNCTION_DECL)
943 else if (TREE_CODE (t) == OVERLOAD)
945 for (i=0; t; t = OVL_CHAIN (t))
950 my_friendly_abort (359);
958 /* A baselink is also considered an overloaded function. */
959 if (TREE_CODE (x) == OFFSET_REF)
960 x = TREE_OPERAND (x, 1);
963 return (TREE_CODE (x) == FUNCTION_DECL
964 || TREE_CODE (x) == TEMPLATE_ID_EXPR
965 || DECL_FUNCTION_TEMPLATE_P (x)
966 || TREE_CODE (x) == OVERLOAD);
970 really_overloaded_fn (x)
973 /* A baselink is also considered an overloaded function. */
974 if (TREE_CODE (x) == OFFSET_REF)
975 x = TREE_OPERAND (x, 1);
978 return (TREE_CODE (x) == OVERLOAD
979 && (TREE_CHAIN (x) != NULL_TREE
980 || DECL_FUNCTION_TEMPLATE_P (OVL_FUNCTION (x))));
987 my_friendly_assert (is_overloaded_fn (from), 9);
988 /* A baselink is also considered an overloaded function. */
989 if (BASELINK_P (from))
990 from = TREE_VALUE (from);
991 return OVL_CURRENT (from);
994 /* Returns nonzero if T is a ->* or .* expression that refers to a
1001 return (TREE_CODE (t) == OFFSET_REF
1002 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (t, 1))));
1005 /* Return a new OVL node, concatenating it with the old one. */
1008 ovl_cons (decl, chain)
1012 tree result = make_node (OVERLOAD);
1013 TREE_TYPE (result) = unknown_type_node;
1014 OVL_FUNCTION (result) = decl;
1015 TREE_CHAIN (result) = chain;
1020 /* Build a new overloaded function. If this is the first one,
1021 just return it; otherwise, ovl_cons the _DECLs */
1024 build_overload (decl, chain)
1028 if (! chain && TREE_CODE (decl) != TEMPLATE_DECL)
1030 if (chain && TREE_CODE (chain) != OVERLOAD)
1031 chain = ovl_cons (chain, NULL_TREE);
1032 return ovl_cons (decl, chain);
1035 /* True if fn is in ovl. */
1038 ovl_member (fn, ovl)
1042 if (ovl == NULL_TREE)
1044 if (TREE_CODE (ovl) != OVERLOAD)
1046 for (; ovl; ovl = OVL_CHAIN (ovl))
1047 if (OVL_FUNCTION (ovl) == fn)
1053 is_aggr_type_2 (t1, t2)
1056 if (TREE_CODE (t1) != TREE_CODE (t2))
1058 return IS_AGGR_TYPE (t1) && IS_AGGR_TYPE (t2);
1061 /* Returns non-zero if CODE is the code for a statement. */
1064 statement_code_p (code)
1065 enum tree_code code;
1085 case START_CATCH_STMT:
1088 case CTOR_INITIALIZER:
1100 #define PRINT_RING_SIZE 4
1103 lang_printable_name (decl, v)
1107 static tree decl_ring[PRINT_RING_SIZE];
1108 static char *print_ring[PRINT_RING_SIZE];
1109 static int ring_counter;
1112 /* Only cache functions. */
1114 || TREE_CODE (decl) != FUNCTION_DECL
1115 || DECL_LANG_SPECIFIC (decl) == 0)
1116 return lang_decl_name (decl, v);
1118 /* See if this print name is lying around. */
1119 for (i = 0; i < PRINT_RING_SIZE; i++)
1120 if (decl_ring[i] == decl)
1121 /* yes, so return it. */
1122 return print_ring[i];
1124 if (++ring_counter == PRINT_RING_SIZE)
1127 if (current_function_decl != NULL_TREE)
1129 if (decl_ring[ring_counter] == current_function_decl)
1131 if (ring_counter == PRINT_RING_SIZE)
1133 if (decl_ring[ring_counter] == current_function_decl)
1134 my_friendly_abort (106);
1137 if (print_ring[ring_counter])
1138 free (print_ring[ring_counter]);
1140 print_ring[ring_counter] = xstrdup (lang_decl_name (decl, v));
1141 decl_ring[ring_counter] = decl;
1142 return print_ring[ring_counter];
1145 /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions
1146 listed in RAISES. */
1149 build_exception_variant (type, raises)
1153 tree v = TYPE_MAIN_VARIANT (type);
1154 int type_quals = TYPE_QUALS (type);
1156 for (; v; v = TYPE_NEXT_VARIANT (v))
1157 if (TYPE_QUALS (v) == type_quals
1158 && comp_except_specs (raises, TYPE_RAISES_EXCEPTIONS (v), 1))
1161 /* Need to build a new variant. */
1162 v = build_type_copy (type);
1163 TYPE_RAISES_EXCEPTIONS (v) = raises;
1167 /* Given a TEMPLATE_TEMPLATE_PARM node T, create a new one together with its
1168 lang_specific field and its corresponding TEMPLATE_DECL node */
1171 copy_template_template_parm (t)
1174 tree template = TYPE_NAME (t);
1177 t2 = make_aggr_type (TEMPLATE_TEMPLATE_PARM);
1178 template = copy_node (template);
1179 copy_lang_decl (template);
1181 TREE_TYPE (template) = t2;
1182 TYPE_NAME (t2) = template;
1183 TYPE_STUB_DECL (t2) = template;
1185 /* No need to copy these */
1186 TYPE_FIELDS (t2) = TYPE_FIELDS (t);
1187 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2)
1188 = TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t);
1192 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal.
1193 FUNC is called with the DATA and the address of each sub-tree. If
1194 FUNC returns a non-NULL value, the traversal is aborted, and the
1195 value returned by FUNC is returned. */
1198 walk_tree (tp, func, data)
1203 enum tree_code code;
1207 #define WALK_SUBTREE(NODE) \
1210 result = walk_tree (&(NODE), func, data); \
1216 /* Skip empty subtrees. */
1220 /* Call the function. */
1222 result = (*func) (tp, &walk_subtrees, data);
1224 /* If we found something, return it. */
1228 /* Even if we didn't, FUNC may have decided that there was nothing
1229 interesting below this point in the tree. */
1233 code = TREE_CODE (*tp);
1235 /* Handle common cases up front. */
1236 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code))
1237 || TREE_CODE_CLASS (code) == 'r'
1238 || TREE_CODE_CLASS (code) == 's')
1242 /* Walk over all the sub-trees of this operand. */
1243 len = first_rtl_op (code);
1244 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
1245 But, we only want to walk once. */
1246 if (code == TARGET_EXPR
1247 && TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1))
1249 /* Go through the subtrees. We need to do this in forward order so
1250 that the scope of a FOR_EXPR is handled properly. */
1251 for (i = 0; i < len; ++i)
1252 WALK_SUBTREE (TREE_OPERAND (*tp, i));
1254 /* For statements, we also walk the chain so that we cover the
1255 entire statement tree. */
1256 if (statement_code_p (code))
1258 if (code == DECL_STMT
1259 && DECL_STMT_DECL (*tp)
1260 && TREE_CODE_CLASS (TREE_CODE (DECL_STMT_DECL (*tp))) == 'd')
1262 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
1263 into declarations that are just mentioned, rather than
1264 declared; they don't really belong to this part of the tree.
1265 And, we can see cycles: the initializer for a declaration can
1266 refer to the declaration itself. */
1267 WALK_SUBTREE (DECL_INITIAL (DECL_STMT_DECL (*tp)));
1268 WALK_SUBTREE (DECL_SIZE (DECL_STMT_DECL (*tp)));
1271 WALK_SUBTREE (TREE_CHAIN (*tp));
1274 /* We didn't find what we were looking for. */
1277 else if (TREE_CODE_CLASS (code) == 'd')
1279 WALK_SUBTREE (TREE_TYPE (*tp));
1281 /* We didn't find what we were looking for. */
1285 /* Not one of the easy cases. We must explicitly go through the
1290 case IDENTIFIER_NODE:
1295 case TEMPLATE_TEMPLATE_PARM:
1296 case TEMPLATE_PARM_INDEX:
1297 case TEMPLATE_TYPE_PARM:
1307 /* None of thse have subtrees other than those already walked
1312 WALK_SUBTREE (TREE_TYPE (*tp));
1316 case REFERENCE_TYPE:
1317 WALK_SUBTREE (TREE_TYPE (*tp));
1321 WALK_SUBTREE (TREE_PURPOSE (*tp));
1322 WALK_SUBTREE (TREE_VALUE (*tp));
1323 WALK_SUBTREE (TREE_CHAIN (*tp));
1327 WALK_SUBTREE (OVL_FUNCTION (*tp));
1328 WALK_SUBTREE (OVL_CHAIN (*tp));
1333 int len = TREE_VEC_LENGTH (*tp);
1335 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
1340 WALK_SUBTREE (TREE_REALPART (*tp));
1341 WALK_SUBTREE (TREE_IMAGPART (*tp));
1345 WALK_SUBTREE (CONSTRUCTOR_ELTS (*tp));
1349 WALK_SUBTREE (TYPE_METHOD_BASETYPE (*tp));
1353 WALK_SUBTREE (TREE_TYPE (*tp));
1354 WALK_SUBTREE (TYPE_ARG_TYPES (*tp));
1358 WALK_SUBTREE (TREE_TYPE (*tp));
1359 WALK_SUBTREE (TYPE_DOMAIN (*tp));
1363 WALK_SUBTREE (TYPE_MIN_VALUE (*tp));
1364 WALK_SUBTREE (TYPE_MAX_VALUE (*tp));
1368 WALK_SUBTREE (TREE_TYPE (*tp));
1369 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (*tp));
1373 if (TYPE_PTRMEMFUNC_P (*tp))
1374 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (*tp));
1378 my_friendly_abort (19990803);
1381 /* We didn't find what we were looking for. */
1387 /* Passed to walk_tree. Checks for the use of types with no linkage. */
1390 no_linkage_helper (tp, walk_subtrees, data)
1392 int *walk_subtrees ATTRIBUTE_UNUSED;
1393 void *data ATTRIBUTE_UNUSED;
1398 && (IS_AGGR_TYPE (t) || TREE_CODE (t) == ENUMERAL_TYPE)
1399 && (decl_function_context (TYPE_MAIN_DECL (t))
1400 || ANON_AGGRNAME_P (TYPE_IDENTIFIER (t))))
1405 /* Check if the type T depends on a type with no linkage and if so, return
1409 no_linkage_check (t)
1412 /* There's no point in checking linkage on template functions; we
1413 can't know their complete types. */
1414 if (processing_template_decl)
1417 t = walk_tree (&t, no_linkage_helper, NULL);
1418 if (t != error_mark_node)
1423 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
1426 copy_tree_r (tp, walk_subtrees, data)
1429 void *data ATTRIBUTE_UNUSED;
1431 enum tree_code code = TREE_CODE (*tp);
1433 /* We make copies of most nodes. */
1434 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code))
1435 || TREE_CODE_CLASS (code) == 'r'
1436 || TREE_CODE_CLASS (code) == 'c'
1437 || TREE_CODE_CLASS (code) == 's'
1438 || code == PARM_DECL
1439 || code == TREE_LIST
1441 || code == OVERLOAD)
1443 /* Because the chain gets clobbered when we make a copy, we save it
1445 tree chain = TREE_CHAIN (*tp);
1447 /* Copy the node. */
1448 *tp = copy_node (*tp);
1450 /* Now, restore the chain, if appropriate. That will cause
1451 walk_tree to walk into the chain as well. */
1452 if (code == PARM_DECL || code == TREE_LIST || code == OVERLOAD
1453 || statement_code_p (code))
1454 TREE_CHAIN (*tp) = chain;
1456 /* For now, we don't update BLOCKs when we make copies. So, we
1457 have to nullify all scope-statements. */
1458 if (TREE_CODE (*tp) == SCOPE_STMT)
1459 SCOPE_STMT_BLOCK (*tp) = NULL_TREE;
1461 else if (code == TEMPLATE_TEMPLATE_PARM)
1462 /* These must be copied specially. */
1463 *tp = copy_template_template_parm (*tp);
1464 else if (TREE_CODE_CLASS (code) == 't')
1465 /* There's no need to copy types, or anything beneath them. */
1471 #ifdef GATHER_STATISTICS
1472 extern int depth_reached;
1476 print_lang_statistics ()
1478 print_search_statistics ();
1479 print_class_statistics ();
1480 #ifdef GATHER_STATISTICS
1481 fprintf (stderr, "maximum template instantiation depth reached: %d\n",
1486 /* This is used by the `assert' macro. It is provided in libgcc.a,
1487 which `cc' doesn't know how to link. Note that the C++ front-end
1488 no longer actually uses the `assert' macro (instead, it calls
1489 my_friendly_assert). But all of the back-end files still need this. */
1492 __eprintf (string, expression, line, filename)
1494 const char *expression;
1496 const char *filename;
1498 fprintf (stderr, string, expression, line, filename);
1503 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1504 (which is an ARRAY_TYPE). This counts only elements of the top
1508 array_type_nelts_top (type)
1511 return fold (build (PLUS_EXPR, sizetype,
1512 array_type_nelts (type),
1516 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1517 (which is an ARRAY_TYPE). This one is a recursive count of all
1518 ARRAY_TYPEs that are clumped together. */
1521 array_type_nelts_total (type)
1524 tree sz = array_type_nelts_top (type);
1525 type = TREE_TYPE (type);
1526 while (TREE_CODE (type) == ARRAY_TYPE)
1528 tree n = array_type_nelts_top (type);
1529 sz = fold (build (MULT_EXPR, sizetype, sz, n));
1530 type = TREE_TYPE (type);
1535 /* Called from break_out_target_exprs via mapcar. */
1538 bot_manip (tp, walk_subtrees, data)
1543 splay_tree target_remap = ((splay_tree) data);
1546 if (TREE_CODE (t) != TREE_LIST && ! TREE_SIDE_EFFECTS (t))
1548 /* There can't be any TARGET_EXPRs below this point. */
1552 else if (TREE_CODE (t) == TARGET_EXPR)
1556 if (TREE_CODE (TREE_OPERAND (t, 1)) == AGGR_INIT_EXPR)
1558 mark_used (TREE_OPERAND (TREE_OPERAND (TREE_OPERAND (t, 1), 0), 0));
1560 (TREE_TYPE (t), break_out_target_exprs (TREE_OPERAND (t, 1)));
1565 TREE_OPERAND (u, 0) = build (VAR_DECL, TREE_TYPE (t));
1566 layout_decl (TREE_OPERAND (u, 0), 0);
1569 /* Map the old variable to the new one. */
1570 splay_tree_insert (target_remap,
1571 (splay_tree_key) TREE_OPERAND (t, 0),
1572 (splay_tree_value) TREE_OPERAND (u, 0));
1574 /* Replace the old expression with the new version. */
1576 /* We don't have to go below this point; the recursive call to
1577 break_out_target_exprs will have handled anything below this
1582 else if (TREE_CODE (t) == CALL_EXPR)
1583 mark_used (TREE_OPERAND (TREE_OPERAND (t, 0), 0));
1585 /* Make a copy of this node. */
1586 return copy_tree_r (tp, walk_subtrees, NULL);
1589 /* Replace all remapped VAR_DECLs in T with their new equivalents.
1590 DATA is really a splay-tree mapping old variables to new
1594 bot_replace (t, walk_subtrees, data)
1596 int *walk_subtrees ATTRIBUTE_UNUSED;
1599 splay_tree target_remap = ((splay_tree) data);
1601 if (TREE_CODE (*t) == VAR_DECL)
1603 splay_tree_node n = splay_tree_lookup (target_remap,
1604 (splay_tree_key) *t);
1606 *t = (tree) n->value;
1612 /* When we parse a default argument expression, we may create
1613 temporary variables via TARGET_EXPRs. When we actually use the
1614 default-argument expression, we make a copy of the expression, but
1615 we must replace the temporaries with appropriate local versions. */
1618 break_out_target_exprs (t)
1621 static int target_remap_count;
1622 static splay_tree target_remap;
1624 if (!target_remap_count++)
1625 target_remap = splay_tree_new (splay_tree_compare_pointers,
1626 /*splay_tree_delete_key_fn=*/NULL,
1627 /*splay_tree_delete_value_fn=*/NULL);
1628 walk_tree (&t, bot_manip, target_remap);
1629 walk_tree (&t, bot_replace, target_remap);
1631 if (!--target_remap_count)
1633 splay_tree_delete (target_remap);
1634 target_remap = NULL;
1640 /* Obstack used for allocating nodes in template function and variable
1643 /* Similar to `build_nt', except that we set TREE_COMPLEXITY to be the
1644 current line number. */
1647 build_min_nt VPROTO((enum tree_code code, ...))
1649 #ifndef ANSI_PROTOTYPES
1650 enum tree_code code;
1654 register int length;
1659 #ifndef ANSI_PROTOTYPES
1660 code = va_arg (p, enum tree_code);
1663 t = make_node (code);
1664 length = tree_code_length[(int) code];
1665 TREE_COMPLEXITY (t) = lineno;
1667 for (i = 0; i < length; i++)
1669 tree x = va_arg (p, tree);
1670 TREE_OPERAND (t, i) = x;
1677 /* Similar to `build', except we set TREE_COMPLEXITY to the current
1681 build_min VPROTO((enum tree_code code, tree tt, ...))
1683 #ifndef ANSI_PROTOTYPES
1684 enum tree_code code;
1689 register int length;
1694 #ifndef ANSI_PROTOTYPES
1695 code = va_arg (p, enum tree_code);
1696 tt = va_arg (p, tree);
1699 t = make_node (code);
1700 length = tree_code_length[(int) code];
1702 TREE_COMPLEXITY (t) = lineno;
1704 for (i = 0; i < length; i++)
1706 tree x = va_arg (p, tree);
1707 TREE_OPERAND (t, i) = x;
1718 if (TREE_CODE (t) == TYPE_DECL)
1720 if (TREE_CODE_CLASS (TREE_CODE (t)) == 't')
1721 return TYPE_STUB_DECL (t);
1723 my_friendly_abort (42);
1725 /* Stop compiler from complaining control reaches end of non-void function. */
1730 can_free (obstack, t)
1731 struct obstack *obstack;
1736 if (TREE_CODE (t) == TREE_VEC)
1737 size = (TREE_VEC_LENGTH (t)-1) * sizeof (tree) + sizeof (struct tree_vec);
1739 my_friendly_abort (42);
1741 #define ROUND(x) ((x + obstack_alignment_mask (obstack)) \
1742 & ~ obstack_alignment_mask (obstack))
1743 if ((char *)t + ROUND (size) == obstack_next_free (obstack))
1750 /* Return first vector element whose BINFO_TYPE is ELEM.
1751 Return 0 if ELEM is not in VEC. VEC may be NULL_TREE. */
1754 vec_binfo_member (elem, vec)
1760 for (i = 0; i < TREE_VEC_LENGTH (vec); ++i)
1761 if (same_type_p (elem, BINFO_TYPE (TREE_VEC_ELT (vec, i))))
1762 return TREE_VEC_ELT (vec, i);
1767 /* Kludge around the fact that DECL_CONTEXT for virtual functions returns
1768 the wrong thing for decl_function_context. Hopefully the uses in the
1769 backend won't matter, since we don't need a static chain for local class
1773 hack_decl_function_context (decl)
1776 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_FUNCTION_MEMBER_P (decl))
1777 return decl_function_context (TYPE_MAIN_DECL (DECL_CLASS_CONTEXT (decl)));
1778 return decl_function_context (decl);
1781 /* Returns the namespace that contains DECL, whether directly or
1785 decl_namespace_context (decl)
1790 if (TREE_CODE (decl) == NAMESPACE_DECL)
1792 else if (TYPE_P (decl))
1793 decl = CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl));
1795 decl = CP_DECL_CONTEXT (decl);
1799 /* Return truthvalue of whether T1 is the same tree structure as T2.
1800 Return 1 if they are the same.
1801 Return 0 if they are understandably different.
1802 Return -1 if either contains tree structure not understood by
1806 cp_tree_equal (t1, t2)
1809 register enum tree_code code1, code2;
1814 if (t1 == 0 || t2 == 0)
1817 code1 = TREE_CODE (t1);
1818 code2 = TREE_CODE (t2);
1820 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
1822 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR || code2 == NON_LVALUE_EXPR)
1823 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1825 return cp_tree_equal (TREE_OPERAND (t1, 0), t2);
1827 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
1828 || code2 == NON_LVALUE_EXPR)
1829 return cp_tree_equal (t1, TREE_OPERAND (t2, 0));
1837 return TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
1838 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2);
1841 return REAL_VALUES_EQUAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
1844 return TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
1845 && !bcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
1846 TREE_STRING_LENGTH (t1));
1849 /* We need to do this when determining whether or not two
1850 non-type pointer to member function template arguments
1852 if (!(same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
1853 /* The first operand is RTL. */
1854 && TREE_OPERAND (t1, 0) == TREE_OPERAND (t2, 0)))
1856 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1859 cmp = cp_tree_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2));
1862 cmp = cp_tree_equal (TREE_VALUE (t1), TREE_VALUE (t2));
1865 return cp_tree_equal (TREE_CHAIN (t1), TREE_CHAIN (t2));
1868 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1871 cmp = cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1874 return simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1877 /* Special case: if either target is an unallocated VAR_DECL,
1878 it means that it's going to be unified with whatever the
1879 TARGET_EXPR is really supposed to initialize, so treat it
1880 as being equivalent to anything. */
1881 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
1882 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
1883 && DECL_RTL (TREE_OPERAND (t1, 0)) == 0)
1884 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
1885 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
1886 && DECL_RTL (TREE_OPERAND (t2, 0)) == 0))
1889 cmp = cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1892 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1894 case WITH_CLEANUP_EXPR:
1895 cmp = cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1898 return cp_tree_equal (TREE_OPERAND (t1, 2), TREE_OPERAND (t1, 2));
1901 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
1902 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1911 case TEMPLATE_PARM_INDEX:
1912 return TEMPLATE_PARM_IDX (t1) == TEMPLATE_PARM_IDX (t2)
1913 && TEMPLATE_PARM_LEVEL (t1) == TEMPLATE_PARM_LEVEL (t2);
1917 if (TREE_CODE (TREE_OPERAND (t1, 0)) != TREE_CODE (TREE_OPERAND (t2, 0)))
1919 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (t1, 0))) == 't')
1920 return same_type_p (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1924 /* Two pointer-to-members are the same if they point to the same
1925 field or function in the same class. */
1926 return (PTRMEM_CST_MEMBER (t1) == PTRMEM_CST_MEMBER (t2)
1927 && same_type_p (PTRMEM_CST_CLASS (t1), PTRMEM_CST_CLASS (t2)));
1933 switch (TREE_CODE_CLASS (code1))
1943 for (i=0; i<tree_code_length[(int) code1]; ++i)
1945 cmp = cp_tree_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
1955 /* Build a wrapper around some pointer PTR so we can use it as a tree. */
1958 build_ptr_wrapper (ptr)
1961 tree t = make_node (WRAPPER);
1962 WRAPPER_PTR (t) = ptr;
1966 /* Same, but on the expression_obstack. */
1969 build_expr_ptr_wrapper (ptr)
1972 return build_ptr_wrapper (ptr);
1975 /* Build a wrapper around some integer I so we can use it as a tree. */
1978 build_int_wrapper (i)
1981 tree t = make_node (WRAPPER);
1982 WRAPPER_INT (t) = i;
1987 build_srcloc (file, line)
1993 t = make_node (SRCLOC);
1994 SRCLOC_FILE (t) = file;
1995 SRCLOC_LINE (t) = line;
2001 build_srcloc_here ()
2003 return build_srcloc (input_filename, lineno);
2006 /* The type of ARG when used as an lvalue. */
2012 tree type = TREE_TYPE (arg);
2013 if (TREE_CODE (arg) == OVERLOAD)
2014 type = unknown_type_node;
2018 /* The type of ARG for printing error messages; denote lvalues with
2025 tree type = TREE_TYPE (arg);
2026 if (TREE_CODE (type) == ARRAY_TYPE)
2028 else if (real_lvalue_p (arg))
2029 type = build_reference_type (lvalue_type (arg));
2030 else if (IS_AGGR_TYPE (type))
2031 type = lvalue_type (arg);
2036 /* Does FUNCTION use a variable-length argument list? */
2039 varargs_function_p (function)
2042 tree parm = TYPE_ARG_TYPES (TREE_TYPE (function));
2043 for (; parm; parm = TREE_CHAIN (parm))
2044 if (TREE_VALUE (parm) == void_type_node)
2049 /* Returns 1 if decl is a member of a class. */
2055 tree ctx = DECL_CONTEXT (decl);
2056 return (ctx && TREE_CODE_CLASS (TREE_CODE (ctx)) == 't');
2059 /* Create a placeholder for member access where we don't actually have an
2060 object that the access is against. */
2063 build_dummy_object (type)
2066 tree decl = build1 (NOP_EXPR, build_pointer_type (type), void_zero_node);
2067 return build_indirect_ref (decl, NULL_PTR);
2070 /* We've gotten a reference to a member of TYPE. Return *this if appropriate,
2071 or a dummy object otherwise. If BINFOP is non-0, it is filled with the
2072 binfo path from current_class_type to TYPE, or 0. */
2075 maybe_dummy_object (type, binfop)
2081 if (current_class_type
2082 && get_base_distance (type, current_class_type, 0, binfop) != -1)
2083 context = current_class_type;
2086 /* Reference from a nested class member function. */
2089 *binfop = TYPE_BINFO (type);
2092 if (current_class_ref && context == current_class_type)
2093 decl = current_class_ref;
2095 decl = build_dummy_object (context);
2100 /* Returns 1 if OB is a placeholder object, or a pointer to one. */
2103 is_dummy_object (ob)
2106 if (TREE_CODE (ob) == INDIRECT_REF)
2107 ob = TREE_OPERAND (ob, 0);
2108 return (TREE_CODE (ob) == NOP_EXPR
2109 && TREE_OPERAND (ob, 0) == void_zero_node);
2112 /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */
2118 while (TREE_CODE (t) == ARRAY_TYPE)
2121 if (INTEGRAL_TYPE_P (t))
2122 return 1; /* integral, character or enumeral type */
2123 if (FLOAT_TYPE_P (t))
2126 return 1; /* pointer to non-member */
2127 if (TYPE_PTRMEM_P (t))
2128 return 1; /* pointer to member object */
2129 if (TYPE_PTRMEMFUNC_P (t))
2130 return 1; /* pointer to member function */
2132 if (! CLASS_TYPE_P (t))
2133 return 0; /* other non-class type (reference or function) */
2134 if (CLASSTYPE_NON_POD_P (t))
2139 /* Return a 1 if ATTR_NAME and ATTR_ARGS denote a valid C++-specific
2140 attribute for either declaration DECL or type TYPE and 0 otherwise.
2141 Plugged into valid_lang_attribute. */
2144 cp_valid_lang_attribute (attr_name, attr_args, decl, type)
2146 tree attr_args ATTRIBUTE_UNUSED;
2147 tree decl ATTRIBUTE_UNUSED;
2148 tree type ATTRIBUTE_UNUSED;
2150 if (is_attribute_p ("com_interface", attr_name))
2152 if (! flag_vtable_thunks)
2154 error ("`com_interface' only supported with -fvtable-thunks");
2158 if (attr_args != NULL_TREE
2159 || decl != NULL_TREE
2160 || ! CLASS_TYPE_P (type)
2161 || type != TYPE_MAIN_VARIANT (type))
2163 warning ("`com_interface' attribute can only be applied to class definitions");
2167 CLASSTYPE_COM_INTERFACE (type) = 1;
2170 else if (is_attribute_p ("init_priority", attr_name))
2172 tree initp_expr = (attr_args ? TREE_VALUE (attr_args): NULL_TREE);
2176 STRIP_NOPS (initp_expr);
2178 if (!initp_expr || TREE_CODE (initp_expr) != INTEGER_CST)
2180 error ("requested init_priority is not an integer constant");
2184 pri = TREE_INT_CST_LOW (initp_expr);
2186 while (TREE_CODE (type) == ARRAY_TYPE)
2187 type = TREE_TYPE (type);
2189 if (decl == NULL_TREE
2190 || TREE_CODE (decl) != VAR_DECL
2191 || ! TREE_STATIC (decl)
2192 || DECL_EXTERNAL (decl)
2193 || (TREE_CODE (type) != RECORD_TYPE
2194 && TREE_CODE (type) != UNION_TYPE)
2195 /* Static objects in functions are initialized the
2196 first time control passes through that
2197 function. This is not precise enough to pin down an
2198 init_priority value, so don't allow it. */
2199 || current_function_decl)
2201 error ("can only use init_priority attribute on file-scope definitions of objects of class type");
2205 if (pri > MAX_INIT_PRIORITY || pri <= 0)
2207 error ("requested init_priority is out of range");
2211 /* Check for init_priorities that are reserved for
2212 language and runtime support implementations.*/
2213 if (pri <= MAX_RESERVED_INIT_PRIORITY)
2216 ("requested init_priority is reserved for internal use");
2219 DECL_INIT_PRIORITY (decl) = pri;
2226 /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the
2227 thing pointed to by the constant. */
2230 make_ptrmem_cst (type, member)
2234 tree ptrmem_cst = make_node (PTRMEM_CST);
2235 /* If would seem a great convenience if make_node would set
2236 TREE_CONSTANT for things of class `c', but it does not. */
2237 TREE_CONSTANT (ptrmem_cst) = 1;
2238 TREE_TYPE (ptrmem_cst) = type;
2239 PTRMEM_CST_MEMBER (ptrmem_cst) = member;
2243 /* Mark ARG (which is really a list_hash_table **) for GC. */
2246 mark_list_hash (arg)
2249 struct list_hash *lh;
2251 for (lh = * ((struct list_hash **) arg); lh; lh = lh->next)
2252 ggc_mark_tree (lh->list);
2255 /* Initialize tree.c. */
2260 make_lang_type_fn = cp_make_lang_type;
2261 lang_unsave = cp_unsave;
2262 ggc_add_root (list_hash_table,
2263 sizeof (list_hash_table) / sizeof (struct list_hash *),
2264 sizeof (struct list_hash *),
2268 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
2269 information indicating to what new SAVE_EXPR this one should be
2270 mapped, use that one. Otherwise, create a new node and enter it in
2271 ST. FN is the function into which the copy will be placed. */
2274 remap_save_expr (tp, st, fn, walk_subtrees)
2282 /* See if we already encountered this SAVE_EXPR. */
2283 n = splay_tree_lookup (st, (splay_tree_key) *tp);
2285 /* If we didn't already remap this SAVE_EXPR, do so now. */
2288 tree t = copy_node (*tp);
2290 /* The SAVE_EXPR is now part of the function into which we
2291 are inlining this body. */
2292 SAVE_EXPR_CONTEXT (t) = fn;
2293 /* And we haven't evaluated it yet. */
2294 SAVE_EXPR_RTL (t) = NULL_RTX;
2295 /* Remember this SAVE_EXPR. */
2296 n = splay_tree_insert (st,
2297 (splay_tree_key) *tp,
2298 (splay_tree_value) t);
2301 /* We've already walked into this SAVE_EXPR, so we needn't do it
2305 /* Replace this SAVE_EXPR with the copy. */
2306 *tp = (tree) n->value;
2309 /* Called via walk_tree. If *TP points to a DECL_STMT for a local
2310 declaration, copies the declaration and enters it in the splay_tree
2311 pointed to by DATA (which is really a `splay_tree *'). */
2314 mark_local_for_remap_r (tp, walk_subtrees, data)
2316 int *walk_subtrees ATTRIBUTE_UNUSED;
2320 splay_tree st = (splay_tree) data;
2322 if ((TREE_CODE (t) == DECL_STMT
2323 && nonstatic_local_decl_p (DECL_STMT_DECL (t)))
2324 || TREE_CODE (t) == LABEL_STMT)
2329 /* Figure out what's being declared. */
2330 decl = (TREE_CODE (t) == DECL_STMT
2331 ? DECL_STMT_DECL (t) : LABEL_STMT_LABEL (t));
2334 copy = copy_decl_for_inlining (decl,
2335 DECL_CONTEXT (decl),
2336 DECL_CONTEXT (decl));
2338 /* Remember the copy. */
2339 splay_tree_insert (st,
2340 (splay_tree_key) decl,
2341 (splay_tree_value) copy);
2347 /* Called via walk_tree when an expression is unsaved. Using the
2348 splay_tree pointed to by ST (which is really a `splay_tree *'),
2349 remaps all local declarations to appropriate replacements. */
2352 cp_unsave_r (tp, walk_subtrees, data)
2357 splay_tree st = (splay_tree) data;
2360 /* Only a local declaration (variable or label). */
2361 if (nonstatic_local_decl_p (*tp))
2363 /* Lookup the declaration. */
2364 n = splay_tree_lookup (st, (splay_tree_key) *tp);
2366 /* If it's there, remap it. */
2368 *tp = (tree) n->value;
2370 else if (TREE_CODE (*tp) == SAVE_EXPR)
2371 remap_save_expr (tp, st, current_function_decl, walk_subtrees);
2374 copy_tree_r (tp, walk_subtrees, NULL);
2376 /* Do whatever unsaving is required. */
2377 unsave_expr_1 (*tp);
2380 /* Keep iterating. */
2384 /* Called by unsave_expr_now whenever an expression (*TP) needs to be
2393 /* Create a splay-tree to map old local variable declarations to new
2395 st = splay_tree_new (splay_tree_compare_pointers, NULL, NULL);
2397 /* Walk the tree once figuring out what needs to be remapped. */
2398 walk_tree (tp, mark_local_for_remap_r, st);
2400 /* Walk the tree again, copying, remapping, and unsaving. */
2401 walk_tree (tp, cp_unsave_r, st);
2404 splay_tree_delete (st);