1 /* Language-dependent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001 Free Software Foundation, Inc.
4 Hacked by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GNU CC.
8 GNU CC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GNU CC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU CC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
32 #include "insn-config.h"
33 #include "integrate.h"
35 static tree bot_manip PARAMS ((tree *, int *, void *));
36 static tree bot_replace PARAMS ((tree *, int *, void *));
37 static tree build_cplus_array_type_1 PARAMS ((tree, tree));
38 static int list_hash_eq PARAMS ((const void *, const void *));
39 static hashval_t list_hash_pieces PARAMS ((tree, tree, tree));
40 static hashval_t list_hash PARAMS ((const void *));
41 static cp_lvalue_kind lvalue_p_1 PARAMS ((tree, int));
42 static tree no_linkage_helper PARAMS ((tree *, int *, void *));
43 static tree build_srcloc PARAMS ((const char *, int));
44 static tree mark_local_for_remap_r PARAMS ((tree *, int *, void *));
45 static tree cp_unsave_r PARAMS ((tree *, int *, void *));
46 static void cp_unsave PARAMS ((tree *));
47 static tree build_target_expr PARAMS ((tree, tree));
48 static tree count_trees_r PARAMS ((tree *, int *, void *));
49 static tree verify_stmt_tree_r PARAMS ((tree *, int *, void *));
50 static tree find_tree_r PARAMS ((tree *, int *, void *));
51 extern int cp_statement_code_p PARAMS ((enum tree_code));
53 /* If REF is an lvalue, returns the kind of lvalue that REF is.
54 Otherwise, returns clk_none. If TREAT_CLASS_RVALUES_AS_LVALUES is
55 non-zero, rvalues of class type are considered lvalues. */
58 lvalue_p_1 (ref, treat_class_rvalues_as_lvalues)
60 int treat_class_rvalues_as_lvalues;
62 cp_lvalue_kind op1_lvalue_kind = clk_none;
63 cp_lvalue_kind op2_lvalue_kind = clk_none;
65 if (TREE_CODE (TREE_TYPE (ref)) == REFERENCE_TYPE)
68 if (ref == current_class_ptr)
71 switch (TREE_CODE (ref))
73 /* preincrements and predecrements are valid lvals, provided
74 what they refer to are valid lvals. */
75 case PREINCREMENT_EXPR:
76 case PREDECREMENT_EXPR:
80 case WITH_CLEANUP_EXPR:
84 return lvalue_p_1 (TREE_OPERAND (ref, 0),
85 treat_class_rvalues_as_lvalues);
88 op1_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 0),
89 treat_class_rvalues_as_lvalues);
91 /* The "field" can be a FUNCTION_DECL or an OVERLOAD in some
93 && TREE_CODE (TREE_OPERAND (ref, 1)) == FIELD_DECL
94 && DECL_C_BIT_FIELD (TREE_OPERAND (ref, 1)))
96 /* Clear the ordinary bit. If this object was a class
97 rvalue we want to preserve that information. */
98 op1_lvalue_kind &= ~clk_ordinary;
99 /* The lvalue is for a btifield. */
100 op1_lvalue_kind |= clk_bitfield;
102 return op1_lvalue_kind;
108 if (TREE_READONLY (ref) && ! TREE_STATIC (ref)
109 && DECL_LANG_SPECIFIC (ref)
110 && DECL_IN_AGGR_P (ref))
116 if (TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE)
120 /* A currently unresolved scope ref. */
122 my_friendly_abort (103);
124 if (TREE_CODE (TREE_OPERAND (ref, 1)) == FUNCTION_DECL)
129 op1_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 0),
130 treat_class_rvalues_as_lvalues);
131 op2_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 1),
132 treat_class_rvalues_as_lvalues);
136 op1_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 1),
137 treat_class_rvalues_as_lvalues);
138 op2_lvalue_kind = lvalue_p_1 (TREE_OPERAND (ref, 2),
139 treat_class_rvalues_as_lvalues);
146 return lvalue_p_1 (TREE_OPERAND (ref, 1),
147 treat_class_rvalues_as_lvalues);
150 return treat_class_rvalues_as_lvalues ? clk_class : clk_none;
154 return ((treat_class_rvalues_as_lvalues
155 && IS_AGGR_TYPE (TREE_TYPE (ref)))
156 ? clk_class : clk_none);
159 /* All functions (except non-static-member functions) are
161 return (DECL_NONSTATIC_MEMBER_FUNCTION_P (ref)
162 ? clk_none : clk_ordinary);
168 /* If one operand is not an lvalue at all, then this expression is
170 if (!op1_lvalue_kind || !op2_lvalue_kind)
173 /* Otherwise, it's an lvalue, and it has all the odd properties
174 contributed by either operand. */
175 op1_lvalue_kind = op1_lvalue_kind | op2_lvalue_kind;
176 /* It's not an ordinary lvalue if it involves either a bit-field or
178 if ((op1_lvalue_kind & ~clk_ordinary) != clk_none)
179 op1_lvalue_kind &= ~clk_ordinary;
180 return op1_lvalue_kind;
183 /* If REF is an lvalue, returns the kind of lvalue that REF is.
184 Otherwise, returns clk_none. Lvalues can be assigned, unless they
185 have TREE_READONLY, or unless they are FUNCTION_DECLs. Lvalues can
186 have their address taken, unless they have DECL_REGISTER. */
192 return lvalue_p_1 (ref, /*treat_class_rvalues_as_lvalues=*/0);
195 /* This differs from real_lvalue_p in that class rvalues are
196 considered lvalues. */
203 (lvalue_p_1 (ref, /*treat_class_rvalues_as_lvalues=*/1) != clk_none);
206 /* Return nonzero if REF is an lvalue valid for this language;
207 otherwise, print an error message and return zero. */
210 lvalue_or_else (ref, string)
214 int win = lvalue_p (ref);
216 error ("non-lvalue in %s", string);
220 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
223 build_target_expr (decl, value)
229 t = build (TARGET_EXPR, TREE_TYPE (decl), decl, value,
230 maybe_build_cleanup (decl), NULL_TREE);
231 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
232 ignore the TARGET_EXPR. If there really turn out to be no
233 side-effects, then the optimizer should be able to get rid of
234 whatever code is generated anyhow. */
235 TREE_SIDE_EFFECTS (t) = 1;
240 /* INIT is a CALL_EXPR which needs info about its target.
241 TYPE is the type that this initialization should appear to have.
243 Build an encapsulation of the initialization to perform
244 and return it so that it can be processed by language-independent
245 and language-specific expression expanders. */
248 build_cplus_new (type, init)
256 /* Make sure that we're not trying to create an instance of an
258 abstract_virtuals_error (NULL_TREE, type);
260 if (TREE_CODE (init) != CALL_EXPR && TREE_CODE (init) != AGGR_INIT_EXPR)
261 return convert (type, init);
263 slot = build (VAR_DECL, type);
264 DECL_ARTIFICIAL (slot) = 1;
265 DECL_CONTEXT (slot) = current_function_decl;
266 layout_decl (slot, 0);
268 /* We split the CALL_EXPR into its function and its arguments here.
269 Then, in expand_expr, we put them back together. The reason for
270 this is that this expression might be a default argument
271 expression. In that case, we need a new temporary every time the
272 expression is used. That's what break_out_target_exprs does; it
273 replaces every AGGR_INIT_EXPR with a copy that uses a fresh
274 temporary slot. Then, expand_expr builds up a call-expression
275 using the new slot. */
276 fn = TREE_OPERAND (init, 0);
277 rval = build (AGGR_INIT_EXPR, type, fn, TREE_OPERAND (init, 1), slot);
278 TREE_SIDE_EFFECTS (rval) = 1;
279 AGGR_INIT_VIA_CTOR_P (rval)
280 = (TREE_CODE (fn) == ADDR_EXPR
281 && TREE_CODE (TREE_OPERAND (fn, 0)) == FUNCTION_DECL
282 && DECL_CONSTRUCTOR_P (TREE_OPERAND (fn, 0)));
283 rval = build_target_expr (slot, rval);
288 /* Buidl a TARGET_EXPR using INIT to initialize a new temporary of the
292 build_target_expr_with_type (init, type)
299 if (TREE_CODE (init) == TARGET_EXPR)
302 slot = build (VAR_DECL, type);
303 DECL_ARTIFICIAL (slot) = 1;
304 DECL_CONTEXT (slot) = current_function_decl;
305 layout_decl (slot, 0);
306 rval = build_target_expr (slot, init);
311 /* Like build_target_expr_with_type, but use the type of INIT. */
314 get_target_expr (init)
317 return build_target_expr_with_type (init, TREE_TYPE (init));
320 /* Recursively perform a preorder search EXP for CALL_EXPRs, making
321 copies where they are found. Returns a deep copy all nodes transitively
322 containing CALL_EXPRs. */
325 break_out_calls (exp)
328 register tree t1, t2 = NULL_TREE;
329 register enum tree_code code;
330 register int changed = 0;
333 if (exp == NULL_TREE)
336 code = TREE_CODE (exp);
338 if (code == CALL_EXPR)
339 return copy_node (exp);
341 /* Don't try and defeat a save_expr, as it should only be done once. */
342 if (code == SAVE_EXPR)
345 switch (TREE_CODE_CLASS (code))
350 case 'c': /* a constant */
351 case 't': /* a type node */
352 case 'x': /* something random, like an identifier or an ERROR_MARK. */
355 case 'd': /* A decl node */
356 #if 0 /* This is bogus. jason 9/21/94 */
358 t1 = break_out_calls (DECL_INITIAL (exp));
359 if (t1 != DECL_INITIAL (exp))
361 exp = copy_node (exp);
362 DECL_INITIAL (exp) = t1;
367 case 'b': /* A block node */
369 /* Don't know how to handle these correctly yet. Must do a
370 break_out_calls on all DECL_INITIAL values for local variables,
371 and also break_out_calls on all sub-blocks and sub-statements. */
376 case 'e': /* an expression */
377 case 'r': /* a reference */
378 case 's': /* an expression with side effects */
379 for (i = TREE_CODE_LENGTH (code) - 1; i >= 0; i--)
381 t1 = break_out_calls (TREE_OPERAND (exp, i));
382 if (t1 != TREE_OPERAND (exp, i))
384 exp = copy_node (exp);
385 TREE_OPERAND (exp, i) = t1;
390 case '<': /* a comparison expression */
391 case '2': /* a binary arithmetic expression */
392 t2 = break_out_calls (TREE_OPERAND (exp, 1));
393 if (t2 != TREE_OPERAND (exp, 1))
395 case '1': /* a unary arithmetic expression */
396 t1 = break_out_calls (TREE_OPERAND (exp, 0));
397 if (t1 != TREE_OPERAND (exp, 0))
401 if (TREE_CODE_LENGTH (code) == 1)
402 return build1 (code, TREE_TYPE (exp), t1);
404 return build (code, TREE_TYPE (exp), t1, t2);
411 /* Here is how primitive or already-canonicalized types' hash
412 codes are made. MUST BE CONSISTENT WITH tree.c !!! */
413 #define TYPE_HASH(TYPE) ((HOST_WIDE_INT) (TYPE) & 0777777)
415 /* Construct, lay out and return the type of methods belonging to class
416 BASETYPE and whose arguments are described by ARGTYPES and whose values
417 are described by RETTYPE. If each type exists already, reuse it. */
420 build_cplus_method_type (basetype, rettype, argtypes)
421 tree basetype, rettype, argtypes;
427 /* Make a node of the sort we want. */
428 t = make_node (METHOD_TYPE);
430 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
431 TREE_TYPE (t) = rettype;
432 ptype = build_pointer_type (basetype);
434 /* The actual arglist for this function includes a "hidden" argument
435 which is "this". Put it into the list of argument types. */
436 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
437 TYPE_ARG_TYPES (t) = argtypes;
438 TREE_SIDE_EFFECTS (argtypes) = 1; /* Mark first argtype as "artificial". */
440 /* If we already have such a type, use the old one and free this one.
441 Note that it also frees up the above cons cell if found. */
442 hashcode = TYPE_HASH (basetype) + TYPE_HASH (rettype) +
443 type_hash_list (argtypes);
445 t = type_hash_canon (hashcode, t);
447 if (!COMPLETE_TYPE_P (t))
454 build_cplus_array_type_1 (elt_type, index_type)
460 if (elt_type == error_mark_node || index_type == error_mark_node)
461 return error_mark_node;
463 if (processing_template_decl
464 || uses_template_parms (elt_type)
465 || uses_template_parms (index_type))
467 t = make_node (ARRAY_TYPE);
468 TREE_TYPE (t) = elt_type;
469 TYPE_DOMAIN (t) = index_type;
472 t = build_array_type (elt_type, index_type);
474 /* Push these needs up so that initialization takes place
476 TYPE_NEEDS_CONSTRUCTING (t)
477 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (elt_type));
478 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
479 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (elt_type));
484 build_cplus_array_type (elt_type, index_type)
489 int type_quals = CP_TYPE_QUALS (elt_type);
491 elt_type = TYPE_MAIN_VARIANT (elt_type);
493 t = build_cplus_array_type_1 (elt_type, index_type);
495 if (type_quals != TYPE_UNQUALIFIED)
496 t = cp_build_qualified_type (t, type_quals);
501 /* Make a variant of TYPE, qualified with the TYPE_QUALS. Handles
502 arrays correctly. In particular, if TYPE is an array of T's, and
503 TYPE_QUALS is non-empty, returns an array of qualified T's. If
504 at attempt is made to qualify a type illegally, and COMPLAIN is
505 non-zero, an error is issued. If COMPLAIN is zero, error_mark_node
509 cp_build_qualified_type_real (type, type_quals, complain)
516 if (type == error_mark_node)
519 if (type_quals == CP_TYPE_QUALS (type))
522 /* A restrict-qualified pointer type must be a pointer (or reference)
523 to object or incomplete type. */
524 if ((type_quals & TYPE_QUAL_RESTRICT)
525 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
526 && (!POINTER_TYPE_P (type)
527 || TYPE_PTRMEM_P (type)
528 || TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE))
531 cp_error ("`%T' cannot be `restrict'-qualified", type);
533 return error_mark_node;
535 type_quals &= ~TYPE_QUAL_RESTRICT;
538 if (type_quals != TYPE_UNQUALIFIED
539 && TREE_CODE (type) == FUNCTION_TYPE)
542 cp_error ("`%T' cannot be `const'-, `volatile'-, or `restrict'-qualified", type);
544 return error_mark_node;
545 type_quals = TYPE_UNQUALIFIED;
547 else if (TREE_CODE (type) == ARRAY_TYPE)
549 /* In C++, the qualification really applies to the array element
550 type. Obtain the appropriately qualified element type. */
553 = cp_build_qualified_type_real (TREE_TYPE (type),
557 if (element_type == error_mark_node)
558 return error_mark_node;
560 /* See if we already have an identically qualified type. */
561 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
562 if (CP_TYPE_QUALS (t) == type_quals)
565 /* If we didn't already have it, create it now. */
568 /* Make a new array type, just like the old one, but with the
569 appropriately qualified element type. */
570 t = build_type_copy (type);
571 TREE_TYPE (t) = element_type;
574 /* Even if we already had this variant, we update
575 TYPE_NEEDS_CONSTRUCTING and TYPE_HAS_NONTRIVIAL_DESTRUCTOR in case
576 they changed since the variant was originally created.
578 This seems hokey; if there is some way to use a previous
579 variant *without* coming through here,
580 TYPE_NEEDS_CONSTRUCTING will never be updated. */
581 TYPE_NEEDS_CONSTRUCTING (t)
582 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (element_type));
583 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
584 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (element_type));
587 else if (TYPE_PTRMEMFUNC_P (type))
589 /* For a pointer-to-member type, we can't just return a
590 cv-qualified version of the RECORD_TYPE. If we do, we
591 haven't change the field that contains the actual pointer to
592 a method, and so TYPE_PTRMEMFUNC_FN_TYPE will be wrong. */
595 t = TYPE_PTRMEMFUNC_FN_TYPE (type);
596 t = cp_build_qualified_type_real (t, type_quals, complain);
597 return build_ptrmemfunc_type (t);
600 /* Retrieve (or create) the appropriately qualified variant. */
601 result = build_qualified_type (type, type_quals);
603 /* If this was a pointer-to-method type, and we just made a copy,
604 then we need to clear the cached associated
605 pointer-to-member-function type; it is not valid for the new
608 && TREE_CODE (type) == POINTER_TYPE
609 && TREE_CODE (TREE_TYPE (type)) == METHOD_TYPE)
610 TYPE_SET_PTRMEMFUNC_TYPE (result, NULL_TREE);
615 /* Returns the canonical version of TYPE. In other words, if TYPE is
616 a typedef, returns the underlying type. The cv-qualification of
617 the type returned matches the type input; they will always be
621 canonical_type_variant (t)
624 return cp_build_qualified_type (TYPE_MAIN_VARIANT (t), CP_TYPE_QUALS (t));
627 /* Makes new binfos for the indirect bases under BINFO, and updates
628 BINFO_OFFSET for them and their bases. */
631 unshare_base_binfos (binfo)
634 tree binfos = BINFO_BASETYPES (binfo);
638 if (binfos == NULL_TREE)
641 /* Now unshare the structure beneath BINFO. */
642 for (j = TREE_VEC_LENGTH (binfos)-1;
645 tree base_binfo = TREE_VEC_ELT (binfos, j);
646 new_binfo = TREE_VEC_ELT (binfos, j)
647 = make_binfo (BINFO_OFFSET (base_binfo),
649 BINFO_VTABLE (base_binfo),
650 BINFO_VIRTUALS (base_binfo));
651 TREE_VIA_PUBLIC (new_binfo) = TREE_VIA_PUBLIC (base_binfo);
652 TREE_VIA_PROTECTED (new_binfo) = TREE_VIA_PROTECTED (base_binfo);
653 TREE_VIA_VIRTUAL (new_binfo) = TREE_VIA_VIRTUAL (base_binfo);
654 BINFO_INHERITANCE_CHAIN (new_binfo) = binfo;
655 BINFO_PRIMARY_BASE_OF (new_binfo) = NULL_TREE;
656 unshare_base_binfos (new_binfo);
661 /* Hashing of lists so that we don't make duplicates.
662 The entry point is `list_hash_canon'. */
664 /* Now here is the hash table. When recording a list, it is added
665 to the slot whose index is the hash code mod the table size.
666 Note that the hash table is used for several kinds of lists.
667 While all these live in the same table, they are completely independent,
668 and the hash code is computed differently for each of these. */
670 static htab_t list_hash_table;
679 /* Compare ENTRY (an entry in the hash table) with DATA (a list_proxy
680 for a node we are thinking about adding). */
683 list_hash_eq (entry, data)
687 tree t = (tree) entry;
688 struct list_proxy *proxy = (struct list_proxy *) data;
690 return (TREE_VALUE (t) == proxy->value
691 && TREE_PURPOSE (t) == proxy->purpose
692 && TREE_CHAIN (t) == proxy->chain);
695 /* Compute a hash code for a list (chain of TREE_LIST nodes
696 with goodies in the TREE_PURPOSE, TREE_VALUE, and bits of the
697 TREE_COMMON slots), by adding the hash codes of the individual entries. */
700 list_hash_pieces (purpose, value, chain)
705 hashval_t hashcode = 0;
708 hashcode += TYPE_HASH (chain);
711 hashcode += TYPE_HASH (value);
715 hashcode += TYPE_HASH (purpose);
721 /* Hash an already existing TREE_LIST. */
728 return list_hash_pieces (TREE_PURPOSE (t),
733 /* Given list components PURPOSE, VALUE, AND CHAIN, return the canonical
734 object for an identical list if one already exists. Otherwise, build a
735 new one, and record it as the canonical object. */
738 hash_tree_cons (purpose, value, chain)
739 tree purpose, value, chain;
743 struct list_proxy proxy;
745 /* Hash the list node. */
746 hashcode = list_hash_pieces (purpose, value, chain);
747 /* Create a proxy for the TREE_LIST we would like to create. We
748 don't actually create it so as to avoid creating garbage. */
749 proxy.purpose = purpose;
752 /* See if it is already in the table. */
753 slot = htab_find_slot_with_hash (list_hash_table, &proxy, hashcode,
755 /* If not, create a new node. */
757 *slot = (PTR) tree_cons (purpose, value, chain);
761 /* Constructor for hashed lists. */
764 hash_tree_chain (value, chain)
767 return hash_tree_cons (NULL_TREE, value, chain);
770 /* Similar, but used for concatenating two lists. */
773 hash_chainon (list1, list2)
780 if (TREE_CHAIN (list1) == NULL_TREE)
781 return hash_tree_chain (TREE_VALUE (list1), list2);
782 return hash_tree_chain (TREE_VALUE (list1),
783 hash_chainon (TREE_CHAIN (list1), list2));
786 /* Build an association between TYPE and some parameters:
788 OFFSET is the offset added to `this' to convert it to a pointer
791 BINFO is the base binfo to use, if we are deriving from one. This
792 is necessary, as we want specialized parent binfos from base
793 classes, so that the VTABLE_NAMEs of bases are for the most derived
794 type, instead of the simple type.
796 VTABLE is the virtual function table with which to initialize
797 sub-objects of type TYPE.
799 VIRTUALS are the virtual functions sitting in VTABLE. */
802 make_binfo (offset, binfo, vtable, virtuals)
804 tree vtable, virtuals;
806 tree new_binfo = make_tree_vec (11);
809 if (TREE_CODE (binfo) == TREE_VEC)
810 type = BINFO_TYPE (binfo);
814 binfo = CLASS_TYPE_P (type) ? TYPE_BINFO (binfo) : NULL_TREE;
817 TREE_TYPE (new_binfo) = TYPE_MAIN_VARIANT (type);
818 BINFO_OFFSET (new_binfo) = offset;
819 BINFO_VTABLE (new_binfo) = vtable;
820 BINFO_VIRTUALS (new_binfo) = virtuals;
822 if (binfo && BINFO_BASETYPES (binfo) != NULL_TREE)
823 BINFO_BASETYPES (new_binfo) = copy_node (BINFO_BASETYPES (binfo));
827 /* Return the binfo value for ELEM in TYPE. */
830 binfo_value (elem, type)
834 if (get_base_distance (elem, type, 0, (tree *)0) == -2)
835 compiler_error ("base class `%s' ambiguous in binfo_value",
836 TYPE_NAME_STRING (elem));
838 return TYPE_BINFO (type);
839 if (TREE_CODE (elem) == RECORD_TYPE && TYPE_BINFO (elem) == type)
841 return get_binfo (elem, type, 0);
844 /* Return a TREE_LIST whose TREE_VALUE nodes along the
845 BINFO_INHERITANCE_CHAIN for BINFO, but in the opposite order. In
846 other words, while the BINFO_INHERITANCE_CHAIN goes from base
847 classes to derived classes, the reversed path goes from derived
848 classes to base classes. */
856 reversed_path = NULL_TREE;
859 reversed_path = tree_cons (NULL_TREE, binfo, reversed_path);
860 binfo = BINFO_INHERITANCE_CHAIN (binfo);
863 return reversed_path;
873 fprintf (stderr, "type \"%s\", offset = ",
874 TYPE_NAME_STRING (BINFO_TYPE (elem)));
875 fprintf (stderr, HOST_WIDE_INT_PRINT_DEC,
876 TREE_INT_CST_LOW (BINFO_OFFSET (elem)));
877 fprintf (stderr, "\nvtable type:\n");
878 debug_tree (BINFO_TYPE (elem));
879 if (BINFO_VTABLE (elem))
880 fprintf (stderr, "vtable decl \"%s\"\n",
881 IDENTIFIER_POINTER (DECL_NAME (get_vtbl_decl_for_binfo (elem))));
883 fprintf (stderr, "no vtable decl yet\n");
884 fprintf (stderr, "virtuals:\n");
885 virtuals = BINFO_VIRTUALS (elem);
890 tree fndecl = TREE_VALUE (virtuals);
891 fprintf (stderr, "%s [%ld =? %ld]\n",
892 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fndecl)),
893 (long) n, (long) TREE_INT_CST_LOW (DECL_VINDEX (fndecl)));
895 virtuals = TREE_CHAIN (virtuals);
904 if (TREE_CODE (t) == FUNCTION_DECL)
906 else if (TREE_CODE (t) == OVERLOAD)
908 for (i=0; t; t = OVL_CHAIN (t))
913 my_friendly_abort (359);
921 /* A baselink is also considered an overloaded function. */
922 if (TREE_CODE (x) == OFFSET_REF)
923 x = TREE_OPERAND (x, 1);
926 return (TREE_CODE (x) == FUNCTION_DECL
927 || TREE_CODE (x) == TEMPLATE_ID_EXPR
928 || DECL_FUNCTION_TEMPLATE_P (x)
929 || TREE_CODE (x) == OVERLOAD);
933 really_overloaded_fn (x)
936 /* A baselink is also considered an overloaded function. */
937 if (TREE_CODE (x) == OFFSET_REF)
938 x = TREE_OPERAND (x, 1);
941 return (TREE_CODE (x) == OVERLOAD
942 && (TREE_CHAIN (x) != NULL_TREE
943 || DECL_FUNCTION_TEMPLATE_P (OVL_FUNCTION (x))));
950 my_friendly_assert (is_overloaded_fn (from), 9);
951 /* A baselink is also considered an overloaded function. */
952 if (BASELINK_P (from))
953 from = TREE_VALUE (from);
954 return OVL_CURRENT (from);
957 /* Returns nonzero if T is a ->* or .* expression that refers to a
964 return (TREE_CODE (t) == OFFSET_REF
965 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (t, 1))));
968 /* Return a new OVL node, concatenating it with the old one. */
971 ovl_cons (decl, chain)
975 tree result = make_node (OVERLOAD);
976 TREE_TYPE (result) = unknown_type_node;
977 OVL_FUNCTION (result) = decl;
978 TREE_CHAIN (result) = chain;
983 /* Build a new overloaded function. If this is the first one,
984 just return it; otherwise, ovl_cons the _DECLs */
987 build_overload (decl, chain)
991 if (! chain && TREE_CODE (decl) != TEMPLATE_DECL)
993 if (chain && TREE_CODE (chain) != OVERLOAD)
994 chain = ovl_cons (chain, NULL_TREE);
995 return ovl_cons (decl, chain);
998 /* True if fn is in ovl. */
1001 ovl_member (fn, ovl)
1005 if (ovl == NULL_TREE)
1007 if (TREE_CODE (ovl) != OVERLOAD)
1009 for (; ovl; ovl = OVL_CHAIN (ovl))
1010 if (OVL_FUNCTION (ovl) == fn)
1016 is_aggr_type_2 (t1, t2)
1019 if (TREE_CODE (t1) != TREE_CODE (t2))
1021 return IS_AGGR_TYPE (t1) && IS_AGGR_TYPE (t2);
1024 /* Returns non-zero if CODE is the code for a statement. */
1027 cp_statement_code_p (code)
1028 enum tree_code code;
1034 case START_CATCH_STMT:
1036 case CTOR_INITIALIZER:
1048 #define PRINT_RING_SIZE 4
1051 lang_printable_name (decl, v)
1055 static tree decl_ring[PRINT_RING_SIZE];
1056 static char *print_ring[PRINT_RING_SIZE];
1057 static int ring_counter;
1060 /* Only cache functions. */
1062 || TREE_CODE (decl) != FUNCTION_DECL
1063 || DECL_LANG_SPECIFIC (decl) == 0)
1064 return lang_decl_name (decl, v);
1066 /* See if this print name is lying around. */
1067 for (i = 0; i < PRINT_RING_SIZE; i++)
1068 if (decl_ring[i] == decl)
1069 /* yes, so return it. */
1070 return print_ring[i];
1072 if (++ring_counter == PRINT_RING_SIZE)
1075 if (current_function_decl != NULL_TREE)
1077 if (decl_ring[ring_counter] == current_function_decl)
1079 if (ring_counter == PRINT_RING_SIZE)
1081 if (decl_ring[ring_counter] == current_function_decl)
1082 my_friendly_abort (106);
1085 if (print_ring[ring_counter])
1086 free (print_ring[ring_counter]);
1088 print_ring[ring_counter] = xstrdup (lang_decl_name (decl, v));
1089 decl_ring[ring_counter] = decl;
1090 return print_ring[ring_counter];
1093 /* Build the FUNCTION_TYPE or METHOD_TYPE which may throw exceptions
1094 listed in RAISES. */
1097 build_exception_variant (type, raises)
1101 tree v = TYPE_MAIN_VARIANT (type);
1102 int type_quals = TYPE_QUALS (type);
1104 for (; v; v = TYPE_NEXT_VARIANT (v))
1105 if (TYPE_QUALS (v) == type_quals
1106 && comp_except_specs (raises, TYPE_RAISES_EXCEPTIONS (v), 1))
1109 /* Need to build a new variant. */
1110 v = build_type_copy (type);
1111 TYPE_RAISES_EXCEPTIONS (v) = raises;
1115 /* Given a TEMPLATE_TEMPLATE_PARM or BOUND_TEMPLATE_TEMPLATE_PARM
1116 node T, create a new one together with its
1117 lang_specific field and its corresponding *_DECL node.
1118 If NEWARGS is not NULL_TREE, this parameter is bound with new set of
1122 copy_template_template_parm (t, newargs)
1126 tree decl = TYPE_NAME (t);
1129 if (newargs == NULL_TREE)
1131 t2 = make_aggr_type (TREE_CODE (t));
1132 decl = copy_decl (decl);
1134 /* No need to copy these. */
1135 TEMPLATE_TYPE_PARM_INDEX (t2) = TEMPLATE_TYPE_PARM_INDEX (t);
1136 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2)
1137 = TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t);
1141 t2 = make_aggr_type (BOUND_TEMPLATE_TEMPLATE_PARM);
1142 decl = build_decl (TYPE_DECL, DECL_NAME (decl), NULL_TREE);
1144 /* These nodes have to be created to reflect new TYPE_DECL and template
1146 TEMPLATE_TYPE_PARM_INDEX (t2) = copy_node (TEMPLATE_TYPE_PARM_INDEX (t));
1147 TEMPLATE_PARM_DECL (TEMPLATE_TYPE_PARM_INDEX (t2)) = decl;
1148 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2)
1149 = tree_cons (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t),
1150 newargs, NULL_TREE);
1153 TREE_TYPE (decl) = t2;
1154 TYPE_NAME (t2) = decl;
1155 TYPE_STUB_DECL (t2) = decl;
1160 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal.
1161 FUNC is called with the DATA and the address of each sub-tree. If
1162 FUNC returns a non-NULL value, the traversal is aborted, and the
1163 value returned by FUNC is returned. If HTAB is non-NULL it is used
1164 to record the nodes visited, and to avoid visiting a node more than
1168 walk_tree (tp, func, data, htab)
1174 enum tree_code code;
1178 #define WALK_SUBTREE(NODE) \
1181 result = walk_tree (&(NODE), func, data, htab); \
1187 /* Skip empty subtrees. */
1193 /* Don't walk the same tree twice, if the user has requested that we
1195 if (htab_find (htab, *tp))
1197 /* If we haven't already seen this node, add it to the table. */
1198 slot = htab_find_slot (htab, *tp, INSERT);
1202 /* Call the function. */
1204 result = (*func) (tp, &walk_subtrees, data);
1206 /* If we found something, return it. */
1210 /* Even if we didn't, FUNC may have decided that there was nothing
1211 interesting below this point in the tree. */
1215 code = TREE_CODE (*tp);
1217 /* Handle common cases up front. */
1218 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code))
1219 || TREE_CODE_CLASS (code) == 'r'
1220 || TREE_CODE_CLASS (code) == 's')
1224 /* Set lineno here so we get the right instantiation context
1225 if we call instantiate_decl from inlinable_function_p. */
1226 if (statement_code_p (code) && !STMT_LINENO_FOR_FN_P (*tp))
1227 lineno = STMT_LINENO (*tp);
1229 /* Walk over all the sub-trees of this operand. */
1230 len = first_rtl_op (code);
1231 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
1232 But, we only want to walk once. */
1233 if (code == TARGET_EXPR
1234 && TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1))
1236 /* Go through the subtrees. We need to do this in forward order so
1237 that the scope of a FOR_EXPR is handled properly. */
1238 for (i = 0; i < len; ++i)
1239 WALK_SUBTREE (TREE_OPERAND (*tp, i));
1241 /* For statements, we also walk the chain so that we cover the
1242 entire statement tree. */
1243 if (statement_code_p (code))
1245 if (code == DECL_STMT
1246 && DECL_STMT_DECL (*tp)
1247 && DECL_P (DECL_STMT_DECL (*tp)))
1249 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
1250 into declarations that are just mentioned, rather than
1251 declared; they don't really belong to this part of the tree.
1252 And, we can see cycles: the initializer for a declaration can
1253 refer to the declaration itself. */
1254 WALK_SUBTREE (DECL_INITIAL (DECL_STMT_DECL (*tp)));
1255 WALK_SUBTREE (DECL_SIZE (DECL_STMT_DECL (*tp)));
1256 WALK_SUBTREE (DECL_SIZE_UNIT (DECL_STMT_DECL (*tp)));
1259 /* This can be tail-recursion optimized if we write it this way. */
1260 return walk_tree (&TREE_CHAIN (*tp), func, data, htab);
1263 /* We didn't find what we were looking for. */
1266 else if (TREE_CODE_CLASS (code) == 'd')
1268 WALK_SUBTREE (TREE_TYPE (*tp));
1270 /* We didn't find what we were looking for. */
1274 /* Not one of the easy cases. We must explicitly go through the
1279 case IDENTIFIER_NODE:
1284 case TEMPLATE_TEMPLATE_PARM:
1285 case BOUND_TEMPLATE_TEMPLATE_PARM:
1286 case TEMPLATE_PARM_INDEX:
1287 case TEMPLATE_TYPE_PARM:
1298 /* None of thse have subtrees other than those already walked
1303 WALK_SUBTREE (TREE_TYPE (*tp));
1307 case REFERENCE_TYPE:
1308 WALK_SUBTREE (TREE_TYPE (*tp));
1312 /* A BASELINK_P's TREE_PURPOSE is a BINFO, and hence circular. */
1313 if (!BASELINK_P (*tp))
1314 WALK_SUBTREE (TREE_PURPOSE (*tp));
1315 WALK_SUBTREE (TREE_VALUE (*tp));
1316 WALK_SUBTREE (TREE_CHAIN (*tp));
1320 WALK_SUBTREE (OVL_FUNCTION (*tp));
1321 WALK_SUBTREE (OVL_CHAIN (*tp));
1326 int len = TREE_VEC_LENGTH (*tp);
1328 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
1333 WALK_SUBTREE (TREE_REALPART (*tp));
1334 WALK_SUBTREE (TREE_IMAGPART (*tp));
1338 WALK_SUBTREE (CONSTRUCTOR_ELTS (*tp));
1342 WALK_SUBTREE (TYPE_METHOD_BASETYPE (*tp));
1346 WALK_SUBTREE (TREE_TYPE (*tp));
1348 tree arg = TYPE_ARG_TYPES (*tp);
1350 /* We never want to walk into default arguments. */
1351 for (; arg; arg = TREE_CHAIN (arg))
1352 WALK_SUBTREE (TREE_VALUE (arg));
1357 WALK_SUBTREE (TREE_TYPE (*tp));
1358 WALK_SUBTREE (TYPE_DOMAIN (*tp));
1362 WALK_SUBTREE (TYPE_MIN_VALUE (*tp));
1363 WALK_SUBTREE (TYPE_MAX_VALUE (*tp));
1367 WALK_SUBTREE (TREE_TYPE (*tp));
1368 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (*tp));
1372 if (TYPE_PTRMEMFUNC_P (*tp))
1373 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (*tp));
1377 my_friendly_abort (19990803);
1380 /* We didn't find what we were looking for. */
1386 /* Like walk_tree, but does not walk duplicate nodes more than
1390 walk_tree_without_duplicates (tp, func, data)
1398 htab = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
1399 result = walk_tree (tp, func, data, htab);
1404 /* Called from count_trees via walk_tree. */
1407 count_trees_r (tp, walk_subtrees, data)
1408 tree *tp ATTRIBUTE_UNUSED;
1409 int *walk_subtrees ATTRIBUTE_UNUSED;
1416 /* Debugging function for measuring the rough complexity of a tree
1424 walk_tree_without_duplicates (&t, count_trees_r, &n_trees);
1428 /* Called from verify_stmt_tree via walk_tree. */
1431 verify_stmt_tree_r (tp, walk_subtrees, data)
1433 int *walk_subtrees ATTRIBUTE_UNUSED;
1437 htab_t *statements = (htab_t *) data;
1440 if (!statement_code_p (TREE_CODE (t)))
1443 /* If this statement is already present in the hash table, then
1444 there is a circularity in the statement tree. */
1445 if (htab_find (*statements, t))
1446 my_friendly_abort (20000727);
1448 slot = htab_find_slot (*statements, t, INSERT);
1454 /* Debugging function to check that the statement T has not been
1455 corrupted. For now, this function simply checks that T contains no
1459 verify_stmt_tree (t)
1463 statements = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
1464 walk_tree (&t, verify_stmt_tree_r, &statements, NULL);
1465 htab_delete (statements);
1468 /* Called from find_tree via walk_tree. */
1471 find_tree_r (tp, walk_subtrees, data)
1473 int *walk_subtrees ATTRIBUTE_UNUSED;
1476 if (*tp == (tree) data)
1482 /* Returns X if X appears in the tree structure rooted at T. */
1489 return walk_tree_without_duplicates (&t, find_tree_r, x);
1492 /* Passed to walk_tree. Checks for the use of types with no linkage. */
1495 no_linkage_helper (tp, walk_subtrees, data)
1497 int *walk_subtrees ATTRIBUTE_UNUSED;
1498 void *data ATTRIBUTE_UNUSED;
1503 && (CLASS_TYPE_P (t) || TREE_CODE (t) == ENUMERAL_TYPE)
1504 && (decl_function_context (TYPE_MAIN_DECL (t))
1505 || ANON_AGGRNAME_P (TYPE_IDENTIFIER (t))))
1510 /* Check if the type T depends on a type with no linkage and if so, return
1514 no_linkage_check (t)
1517 /* There's no point in checking linkage on template functions; we
1518 can't know their complete types. */
1519 if (processing_template_decl)
1522 t = walk_tree_without_duplicates (&t, no_linkage_helper, NULL);
1523 if (t != error_mark_node)
1528 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
1531 copy_tree_r (tp, walk_subtrees, data)
1534 void *data ATTRIBUTE_UNUSED;
1536 enum tree_code code = TREE_CODE (*tp);
1538 /* We make copies of most nodes. */
1539 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code))
1540 || TREE_CODE_CLASS (code) == 'r'
1541 || TREE_CODE_CLASS (code) == 'c'
1542 || TREE_CODE_CLASS (code) == 's'
1543 || code == TREE_LIST
1545 || code == OVERLOAD)
1547 /* Because the chain gets clobbered when we make a copy, we save it
1549 tree chain = TREE_CHAIN (*tp);
1551 /* Copy the node. */
1552 *tp = copy_node (*tp);
1554 /* Now, restore the chain, if appropriate. That will cause
1555 walk_tree to walk into the chain as well. */
1556 if (code == PARM_DECL || code == TREE_LIST || code == OVERLOAD
1557 || statement_code_p (code))
1558 TREE_CHAIN (*tp) = chain;
1560 /* For now, we don't update BLOCKs when we make copies. So, we
1561 have to nullify all scope-statements. */
1562 if (TREE_CODE (*tp) == SCOPE_STMT)
1563 SCOPE_STMT_BLOCK (*tp) = NULL_TREE;
1565 else if (code == TEMPLATE_TEMPLATE_PARM
1566 || code == BOUND_TEMPLATE_TEMPLATE_PARM)
1567 /* These must be copied specially. */
1568 *tp = copy_template_template_parm (*tp, NULL_TREE);
1569 else if (TREE_CODE_CLASS (code) == 't')
1570 /* There's no need to copy types, or anything beneath them. */
1576 #ifdef GATHER_STATISTICS
1577 extern int depth_reached;
1581 print_lang_statistics ()
1583 print_search_statistics ();
1584 print_class_statistics ();
1585 #ifdef GATHER_STATISTICS
1586 fprintf (stderr, "maximum template instantiation depth reached: %d\n",
1591 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1592 (which is an ARRAY_TYPE). This counts only elements of the top
1596 array_type_nelts_top (type)
1599 return fold (build (PLUS_EXPR, sizetype,
1600 array_type_nelts (type),
1604 /* Return, as an INTEGER_CST node, the number of elements for TYPE
1605 (which is an ARRAY_TYPE). This one is a recursive count of all
1606 ARRAY_TYPEs that are clumped together. */
1609 array_type_nelts_total (type)
1612 tree sz = array_type_nelts_top (type);
1613 type = TREE_TYPE (type);
1614 while (TREE_CODE (type) == ARRAY_TYPE)
1616 tree n = array_type_nelts_top (type);
1617 sz = fold (build (MULT_EXPR, sizetype, sz, n));
1618 type = TREE_TYPE (type);
1623 /* Called from break_out_target_exprs via mapcar. */
1626 bot_manip (tp, walk_subtrees, data)
1631 splay_tree target_remap = ((splay_tree) data);
1634 if (TREE_CONSTANT (t))
1636 /* There can't be any TARGET_EXPRs or their slot variables below
1637 this point. We used to check !TREE_SIDE_EFFECTS, but then we
1638 failed to copy an ADDR_EXPR of the slot VAR_DECL. */
1642 if (TREE_CODE (t) == TARGET_EXPR)
1646 if (TREE_CODE (TREE_OPERAND (t, 1)) == AGGR_INIT_EXPR)
1648 mark_used (TREE_OPERAND (TREE_OPERAND (TREE_OPERAND (t, 1), 0), 0));
1650 (TREE_TYPE (t), break_out_target_exprs (TREE_OPERAND (t, 1)));
1654 u = build_target_expr_with_type
1655 (break_out_target_exprs (TREE_OPERAND (t, 1)), TREE_TYPE (t));
1658 /* Map the old variable to the new one. */
1659 splay_tree_insert (target_remap,
1660 (splay_tree_key) TREE_OPERAND (t, 0),
1661 (splay_tree_value) TREE_OPERAND (u, 0));
1663 /* Replace the old expression with the new version. */
1665 /* We don't have to go below this point; the recursive call to
1666 break_out_target_exprs will have handled anything below this
1671 else if (TREE_CODE (t) == CALL_EXPR)
1672 mark_used (TREE_OPERAND (TREE_OPERAND (t, 0), 0));
1674 /* Make a copy of this node. */
1675 return copy_tree_r (tp, walk_subtrees, NULL);
1678 /* Replace all remapped VAR_DECLs in T with their new equivalents.
1679 DATA is really a splay-tree mapping old variables to new
1683 bot_replace (t, walk_subtrees, data)
1685 int *walk_subtrees ATTRIBUTE_UNUSED;
1688 splay_tree target_remap = ((splay_tree) data);
1690 if (TREE_CODE (*t) == VAR_DECL)
1692 splay_tree_node n = splay_tree_lookup (target_remap,
1693 (splay_tree_key) *t);
1695 *t = (tree) n->value;
1701 /* When we parse a default argument expression, we may create
1702 temporary variables via TARGET_EXPRs. When we actually use the
1703 default-argument expression, we make a copy of the expression, but
1704 we must replace the temporaries with appropriate local versions. */
1707 break_out_target_exprs (t)
1710 static int target_remap_count;
1711 static splay_tree target_remap;
1713 if (!target_remap_count++)
1714 target_remap = splay_tree_new (splay_tree_compare_pointers,
1715 /*splay_tree_delete_key_fn=*/NULL,
1716 /*splay_tree_delete_value_fn=*/NULL);
1717 walk_tree (&t, bot_manip, target_remap, NULL);
1718 walk_tree (&t, bot_replace, target_remap, NULL);
1720 if (!--target_remap_count)
1722 splay_tree_delete (target_remap);
1723 target_remap = NULL;
1729 /* Obstack used for allocating nodes in template function and variable
1732 /* Similar to `build_nt', except that we set TREE_COMPLEXITY to be the
1733 current line number. */
1736 build_min_nt VPARAMS ((enum tree_code code, ...))
1738 #ifndef ANSI_PROTOTYPES
1739 enum tree_code code;
1743 register int length;
1748 #ifndef ANSI_PROTOTYPES
1749 code = va_arg (p, enum tree_code);
1752 t = make_node (code);
1753 length = TREE_CODE_LENGTH (code);
1754 TREE_COMPLEXITY (t) = lineno;
1756 for (i = 0; i < length; i++)
1758 tree x = va_arg (p, tree);
1759 TREE_OPERAND (t, i) = x;
1766 /* Similar to `build', except we set TREE_COMPLEXITY to the current
1770 build_min VPARAMS ((enum tree_code code, tree tt, ...))
1772 #ifndef ANSI_PROTOTYPES
1773 enum tree_code code;
1778 register int length;
1783 #ifndef ANSI_PROTOTYPES
1784 code = va_arg (p, enum tree_code);
1785 tt = va_arg (p, tree);
1788 t = make_node (code);
1789 length = TREE_CODE_LENGTH (code);
1791 TREE_COMPLEXITY (t) = lineno;
1793 for (i = 0; i < length; i++)
1795 tree x = va_arg (p, tree);
1796 TREE_OPERAND (t, i) = x;
1803 /* Returns an INTEGER_CST (of type `int') corresponding to I.
1804 Multiple calls with the same value of I may or may not yield the
1805 same node; therefore, callers should never modify the node
1809 build_shared_int_cst (i)
1812 static tree cache[256];
1815 return build_int_2 (i, 0);
1818 cache[i] = build_int_2 (i, 0);
1827 if (TREE_CODE (t) == TYPE_DECL)
1830 return TYPE_STUB_DECL (t);
1831 if (t == error_mark_node)
1834 my_friendly_abort (42);
1836 /* Stop compiler from complaining control reaches end of non-void function. */
1840 /* Return first vector element whose BINFO_TYPE is ELEM.
1841 Return 0 if ELEM is not in VEC. VEC may be NULL_TREE. */
1844 vec_binfo_member (elem, vec)
1850 for (i = 0; i < TREE_VEC_LENGTH (vec); ++i)
1851 if (same_type_p (elem, BINFO_TYPE (TREE_VEC_ELT (vec, i))))
1852 return TREE_VEC_ELT (vec, i);
1857 /* Returns the namespace that contains DECL, whether directly or
1861 decl_namespace_context (decl)
1866 if (TREE_CODE (decl) == NAMESPACE_DECL)
1868 else if (TYPE_P (decl))
1869 decl = CP_DECL_CONTEXT (TYPE_MAIN_DECL (decl));
1871 decl = CP_DECL_CONTEXT (decl);
1875 /* Return truthvalue of whether T1 is the same tree structure as T2.
1876 Return 1 if they are the same.
1877 Return 0 if they are understandably different.
1878 Return -1 if either contains tree structure not understood by
1882 cp_tree_equal (t1, t2)
1885 register enum tree_code code1, code2;
1890 if (t1 == 0 || t2 == 0)
1893 code1 = TREE_CODE (t1);
1894 code2 = TREE_CODE (t2);
1896 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
1898 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR || code2 == NON_LVALUE_EXPR)
1899 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1901 return cp_tree_equal (TREE_OPERAND (t1, 0), t2);
1903 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
1904 || code2 == NON_LVALUE_EXPR)
1905 return cp_tree_equal (t1, TREE_OPERAND (t2, 0));
1913 return TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
1914 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2);
1917 return REAL_VALUES_EQUAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
1920 return TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
1921 && !memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
1922 TREE_STRING_LENGTH (t1));
1925 /* We need to do this when determining whether or not two
1926 non-type pointer to member function template arguments
1928 if (!(same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
1929 /* The first operand is RTL. */
1930 && TREE_OPERAND (t1, 0) == TREE_OPERAND (t2, 0)))
1932 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1935 cmp = cp_tree_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2));
1938 cmp = cp_tree_equal (TREE_VALUE (t1), TREE_VALUE (t2));
1941 return cp_tree_equal (TREE_CHAIN (t1), TREE_CHAIN (t2));
1944 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1947 cmp = cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1950 return simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1953 /* Special case: if either target is an unallocated VAR_DECL,
1954 it means that it's going to be unified with whatever the
1955 TARGET_EXPR is really supposed to initialize, so treat it
1956 as being equivalent to anything. */
1957 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
1958 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
1959 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
1960 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
1961 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
1962 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
1965 cmp = cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1968 return cp_tree_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
1970 case WITH_CLEANUP_EXPR:
1971 cmp = cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1974 return cp_tree_equal (TREE_OPERAND (t1, 2), TREE_OPERAND (t1, 2));
1977 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
1978 return cp_tree_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
1987 case TEMPLATE_PARM_INDEX:
1988 return TEMPLATE_PARM_IDX (t1) == TEMPLATE_PARM_IDX (t2)
1989 && TEMPLATE_PARM_LEVEL (t1) == TEMPLATE_PARM_LEVEL (t2);
1993 if (TREE_CODE (TREE_OPERAND (t1, 0)) != TREE_CODE (TREE_OPERAND (t2, 0)))
1995 if (TYPE_P (TREE_OPERAND (t1, 0)))
1996 return same_type_p (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
2000 /* Two pointer-to-members are the same if they point to the same
2001 field or function in the same class. */
2002 return (PTRMEM_CST_MEMBER (t1) == PTRMEM_CST_MEMBER (t2)
2003 && same_type_p (PTRMEM_CST_CLASS (t1), PTRMEM_CST_CLASS (t2)));
2009 switch (TREE_CODE_CLASS (code1))
2019 for (i = 0; i < TREE_CODE_LENGTH (code1); ++i)
2021 cmp = cp_tree_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
2031 /* Build a wrapper around some pointer PTR so we can use it as a tree. */
2034 build_ptr_wrapper (ptr)
2037 tree t = make_node (WRAPPER);
2038 WRAPPER_PTR (t) = ptr;
2042 /* Build a wrapper around some integer I so we can use it as a tree. */
2045 build_int_wrapper (i)
2048 tree t = make_node (WRAPPER);
2049 WRAPPER_INT (t) = i;
2054 build_srcloc (file, line)
2060 t = make_node (SRCLOC);
2061 SRCLOC_FILE (t) = file;
2062 SRCLOC_LINE (t) = line;
2068 build_srcloc_here ()
2070 return build_srcloc (input_filename, lineno);
2073 /* The type of ARG when used as an lvalue. */
2079 tree type = TREE_TYPE (arg);
2080 if (TREE_CODE (arg) == OVERLOAD)
2081 type = unknown_type_node;
2085 /* The type of ARG for printing error messages; denote lvalues with
2092 tree type = TREE_TYPE (arg);
2093 if (TREE_CODE (type) == ARRAY_TYPE)
2095 else if (real_lvalue_p (arg))
2096 type = build_reference_type (lvalue_type (arg));
2097 else if (IS_AGGR_TYPE (type))
2098 type = lvalue_type (arg);
2103 /* Does FUNCTION use a variable-length argument list? */
2106 varargs_function_p (function)
2109 tree parm = TYPE_ARG_TYPES (TREE_TYPE (function));
2110 for (; parm; parm = TREE_CHAIN (parm))
2111 if (TREE_VALUE (parm) == void_type_node)
2116 /* Returns 1 if decl is a member of a class. */
2122 const tree ctx = DECL_CONTEXT (decl);
2123 return (ctx && TYPE_P (ctx));
2126 /* Create a placeholder for member access where we don't actually have an
2127 object that the access is against. */
2130 build_dummy_object (type)
2133 tree decl = build1 (NOP_EXPR, build_pointer_type (type), void_zero_node);
2134 return build_indirect_ref (decl, NULL_PTR);
2137 /* We've gotten a reference to a member of TYPE. Return *this if appropriate,
2138 or a dummy object otherwise. If BINFOP is non-0, it is filled with the
2139 binfo path from current_class_type to TYPE, or 0. */
2142 maybe_dummy_object (type, binfop)
2148 if (current_class_type
2149 && get_base_distance (type, current_class_type, 0, binfop) != -1)
2150 context = current_class_type;
2153 /* Reference from a nested class member function. */
2156 *binfop = TYPE_BINFO (type);
2159 if (current_class_ref && context == current_class_type)
2160 decl = current_class_ref;
2162 decl = build_dummy_object (context);
2167 /* Returns 1 if OB is a placeholder object, or a pointer to one. */
2170 is_dummy_object (ob)
2173 if (TREE_CODE (ob) == INDIRECT_REF)
2174 ob = TREE_OPERAND (ob, 0);
2175 return (TREE_CODE (ob) == NOP_EXPR
2176 && TREE_OPERAND (ob, 0) == void_zero_node);
2179 /* Returns 1 iff type T is a POD type, as defined in [basic.types]. */
2185 t = strip_array_types (t);
2187 if (INTEGRAL_TYPE_P (t))
2188 return 1; /* integral, character or enumeral type */
2189 if (FLOAT_TYPE_P (t))
2192 return 1; /* pointer to non-member */
2193 if (TYPE_PTRMEM_P (t))
2194 return 1; /* pointer to member object */
2195 if (TYPE_PTRMEMFUNC_P (t))
2196 return 1; /* pointer to member function */
2198 if (! CLASS_TYPE_P (t))
2199 return 0; /* other non-class type (reference or function) */
2200 if (CLASSTYPE_NON_POD_P (t))
2205 /* Return a 1 if ATTR_NAME and ATTR_ARGS denote a valid C++-specific
2206 attribute for either declaration DECL or type TYPE and 0 otherwise.
2207 Plugged into valid_lang_attribute. */
2210 cp_valid_lang_attribute (attr_name, attr_args, decl, type)
2212 tree attr_args ATTRIBUTE_UNUSED;
2213 tree decl ATTRIBUTE_UNUSED;
2214 tree type ATTRIBUTE_UNUSED;
2216 if (is_attribute_p ("java_interface", attr_name))
2218 if (attr_args != NULL_TREE
2219 || decl != NULL_TREE
2220 || ! CLASS_TYPE_P (type)
2221 || ! TYPE_FOR_JAVA (type))
2223 error ("`java_interface' attribute can only be applied to Java class definitions");
2226 TYPE_JAVA_INTERFACE (type) = 1;
2229 if (is_attribute_p ("com_interface", attr_name))
2231 if (! flag_vtable_thunks)
2233 error ("`com_interface' only supported with -fvtable-thunks");
2237 if (attr_args != NULL_TREE
2238 || decl != NULL_TREE
2239 || ! CLASS_TYPE_P (type)
2240 || type != TYPE_MAIN_VARIANT (type))
2242 warning ("`com_interface' attribute can only be applied to class definitions");
2248 else if (is_attribute_p ("init_priority", attr_name))
2250 tree initp_expr = (attr_args ? TREE_VALUE (attr_args): NULL_TREE);
2254 STRIP_NOPS (initp_expr);
2256 if (!initp_expr || TREE_CODE (initp_expr) != INTEGER_CST)
2258 error ("requested init_priority is not an integer constant");
2262 pri = TREE_INT_CST_LOW (initp_expr);
2264 type = strip_array_types (type);
2266 if (decl == NULL_TREE
2267 || TREE_CODE (decl) != VAR_DECL
2268 || ! TREE_STATIC (decl)
2269 || DECL_EXTERNAL (decl)
2270 || (TREE_CODE (type) != RECORD_TYPE
2271 && TREE_CODE (type) != UNION_TYPE)
2272 /* Static objects in functions are initialized the
2273 first time control passes through that
2274 function. This is not precise enough to pin down an
2275 init_priority value, so don't allow it. */
2276 || current_function_decl)
2278 error ("can only use init_priority attribute on file-scope definitions of objects of class type");
2282 if (pri > MAX_INIT_PRIORITY || pri <= 0)
2284 error ("requested init_priority is out of range");
2288 /* Check for init_priorities that are reserved for
2289 language and runtime support implementations.*/
2290 if (pri <= MAX_RESERVED_INIT_PRIORITY)
2293 ("requested init_priority is reserved for internal use");
2296 if (SUPPORTS_INIT_PRIORITY)
2298 DECL_INIT_PRIORITY (decl) = pri;
2303 error ("init_priority attribute is not supported on this platform");
2311 /* Return a new PTRMEM_CST of the indicated TYPE. The MEMBER is the
2312 thing pointed to by the constant. */
2315 make_ptrmem_cst (type, member)
2319 tree ptrmem_cst = make_node (PTRMEM_CST);
2320 /* If would seem a great convenience if make_node would set
2321 TREE_CONSTANT for things of class `c', but it does not. */
2322 TREE_CONSTANT (ptrmem_cst) = 1;
2323 TREE_TYPE (ptrmem_cst) = type;
2324 PTRMEM_CST_MEMBER (ptrmem_cst) = member;
2328 /* Initialize tree.c. */
2333 make_lang_type_fn = cp_make_lang_type;
2334 lang_unsave = cp_unsave;
2335 lang_statement_code_p = cp_statement_code_p;
2336 lang_set_decl_assembler_name = mangle_decl;
2337 list_hash_table = htab_create (31, list_hash, list_hash_eq, NULL);
2338 ggc_add_root (&list_hash_table, 1,
2339 sizeof (list_hash_table),
2340 mark_tree_hashtable);
2343 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
2344 information indicating to what new SAVE_EXPR this one should be
2345 mapped, use that one. Otherwise, create a new node and enter it in
2346 ST. FN is the function into which the copy will be placed. */
2349 remap_save_expr (tp, st, fn, walk_subtrees)
2357 /* See if we already encountered this SAVE_EXPR. */
2358 n = splay_tree_lookup (st, (splay_tree_key) *tp);
2360 /* If we didn't already remap this SAVE_EXPR, do so now. */
2363 tree t = copy_node (*tp);
2365 /* The SAVE_EXPR is now part of the function into which we
2366 are inlining this body. */
2367 SAVE_EXPR_CONTEXT (t) = fn;
2368 /* And we haven't evaluated it yet. */
2369 SAVE_EXPR_RTL (t) = NULL_RTX;
2370 /* Remember this SAVE_EXPR. */
2371 n = splay_tree_insert (st,
2372 (splay_tree_key) *tp,
2373 (splay_tree_value) t);
2376 /* We've already walked into this SAVE_EXPR, so we needn't do it
2380 /* Replace this SAVE_EXPR with the copy. */
2381 *tp = (tree) n->value;
2384 /* Called via walk_tree. If *TP points to a DECL_STMT for a local
2385 declaration, copies the declaration and enters it in the splay_tree
2386 pointed to by DATA (which is really a `splay_tree *'). */
2389 mark_local_for_remap_r (tp, walk_subtrees, data)
2391 int *walk_subtrees ATTRIBUTE_UNUSED;
2395 splay_tree st = (splay_tree) data;
2399 if (TREE_CODE (t) == DECL_STMT
2400 && nonstatic_local_decl_p (DECL_STMT_DECL (t)))
2401 decl = DECL_STMT_DECL (t);
2402 else if (TREE_CODE (t) == LABEL_STMT)
2403 decl = LABEL_STMT_LABEL (t);
2404 else if (TREE_CODE (t) == TARGET_EXPR
2405 && nonstatic_local_decl_p (TREE_OPERAND (t, 0)))
2406 decl = TREE_OPERAND (t, 0);
2407 else if (TREE_CODE (t) == CASE_LABEL)
2408 decl = CASE_LABEL_DECL (t);
2417 copy = copy_decl_for_inlining (decl,
2418 DECL_CONTEXT (decl),
2419 DECL_CONTEXT (decl));
2421 /* Remember the copy. */
2422 splay_tree_insert (st,
2423 (splay_tree_key) decl,
2424 (splay_tree_value) copy);
2430 /* Called via walk_tree when an expression is unsaved. Using the
2431 splay_tree pointed to by ST (which is really a `splay_tree'),
2432 remaps all local declarations to appropriate replacements. */
2435 cp_unsave_r (tp, walk_subtrees, data)
2440 splay_tree st = (splay_tree) data;
2443 /* Only a local declaration (variable or label). */
2444 if (nonstatic_local_decl_p (*tp))
2446 /* Lookup the declaration. */
2447 n = splay_tree_lookup (st, (splay_tree_key) *tp);
2449 /* If it's there, remap it. */
2451 *tp = (tree) n->value;
2453 else if (TREE_CODE (*tp) == SAVE_EXPR)
2454 remap_save_expr (tp, st, current_function_decl, walk_subtrees);
2457 copy_tree_r (tp, walk_subtrees, NULL);
2459 /* Do whatever unsaving is required. */
2460 unsave_expr_1 (*tp);
2463 /* Keep iterating. */
2467 /* Called by unsave_expr_now whenever an expression (*TP) needs to be
2476 /* Create a splay-tree to map old local variable declarations to new
2478 st = splay_tree_new (splay_tree_compare_pointers, NULL, NULL);
2480 /* Walk the tree once figuring out what needs to be remapped. */
2481 walk_tree (tp, mark_local_for_remap_r, st, NULL);
2483 /* Walk the tree again, copying, remapping, and unsaving. */
2484 walk_tree (tp, cp_unsave_r, st, NULL);
2487 splay_tree_delete (st);
2490 /* Returns the kind of special function that DECL (a FUNCTION_DECL)
2491 is. Note that this sfk_none is zero, so this function can be used
2492 as a predicate to test whether or not DECL is a special function. */
2494 special_function_kind
2495 special_function_p (decl)
2498 /* Rather than doing all this stuff with magic names, we should
2499 probably have a field of type `special_function_kind' in
2500 DECL_LANG_SPECIFIC. */
2501 if (DECL_COPY_CONSTRUCTOR_P (decl))
2502 return sfk_copy_constructor;
2503 if (DECL_CONSTRUCTOR_P (decl))
2504 return sfk_constructor;
2505 if (DECL_OVERLOADED_OPERATOR_P (decl) == NOP_EXPR)
2506 return sfk_assignment_operator;
2507 if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl))
2508 return sfk_destructor;
2509 if (DECL_COMPLETE_DESTRUCTOR_P (decl))
2510 return sfk_complete_destructor;
2511 if (DECL_BASE_DESTRUCTOR_P (decl))
2512 return sfk_base_destructor;
2513 if (DECL_DELETING_DESTRUCTOR_P (decl))
2514 return sfk_deleting_destructor;
2515 if (DECL_CONV_FN_P (decl))
2516 return sfk_conversion;
2521 /* Returns non-zero if TYPE is a character type, including wchar_t. */
2527 return (same_type_p (type, char_type_node)
2528 || same_type_p (type, unsigned_char_type_node)
2529 || same_type_p (type, signed_char_type_node)
2530 || same_type_p (type, wchar_type_node));
2533 /* Returns the kind of linkage associated with the indicated DECL. Th
2534 value returned is as specified by the language standard; it is
2535 independent of implementation details regarding template
2536 instantiation, etc. For example, it is possible that a declaration
2537 to which this function assigns external linkage would not show up
2538 as a global symbol when you run `nm' on the resulting object file. */
2544 /* This function doesn't attempt to calculate the linkage from first
2545 principles as given in [basic.link]. Instead, it makes use of
2546 the fact that we have already set TREE_PUBLIC appropriately, and
2547 then handles a few special cases. Ideally, we would calculate
2548 linkage first, and then transform that into a concrete
2551 /* Things that don't have names have no linkage. */
2552 if (!DECL_NAME (decl))
2555 /* Things that are TREE_PUBLIC have external linkage. */
2556 if (TREE_PUBLIC (decl))
2559 /* Some things that are not TREE_PUBLIC have external linkage, too.
2560 For example, on targets that don't have weak symbols, we make all
2561 template instantiations have internal linkage (in the object
2562 file), but the symbols should still be treated as having external
2563 linkage from the point of view of the language. */
2564 if (DECL_LANG_SPECIFIC (decl) && DECL_COMDAT (decl))
2567 /* Things in local scope do not have linkage, if they don't have
2569 if (decl_function_context (decl))
2572 /* Everything else has internal linkage. */