2003-04-21 Aldy Hernandez <aldyh@redhat.com>
[official-gcc.git] / gcc / cp / ptree.c
blobaefc9613e7587168e2a8c94927d5717304f2d551
1 /* Prints out trees in human readable form.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1998,
3 1999, 2000, 2001, 2002, 2003 Free Software Foundation, Inc.
4 Hacked by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GCC.
8 GCC 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)
11 any later version.
13 GCC 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 GCC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
24 #include "config.h"
25 #include "system.h"
26 #include "coretypes.h"
27 #include "tm.h"
28 #include "tree.h"
29 #include "cp-tree.h"
31 void
32 cxx_print_decl (FILE *file, tree node, int indent)
34 if (TREE_CODE (node) == FIELD_DECL)
36 if (DECL_MUTABLE_P (node))
38 indent_to (file, indent + 3);
39 fprintf (file, " mutable ");
41 return;
44 if (!DECL_LANG_SPECIFIC (node))
45 return;
46 indent_to (file, indent + 3);
47 if (TREE_CODE (node) == FUNCTION_DECL
48 && DECL_PENDING_INLINE_INFO (node))
50 fprintf (file, " pending-inline-info ");
51 fprintf (file, HOST_PTR_PRINTF, (void *) DECL_PENDING_INLINE_INFO (node));
53 if (TREE_CODE (node) == TYPE_DECL
54 && DECL_SORTED_FIELDS (node))
56 fprintf (file, " sorted-fields ");
57 fprintf (file, HOST_PTR_PRINTF, (void *) DECL_SORTED_FIELDS (node));
59 if ((TREE_CODE (node) == FUNCTION_DECL || TREE_CODE (node) == VAR_DECL)
60 && DECL_TEMPLATE_INFO (node))
62 fprintf (file, " template-info ");
63 fprintf (file, HOST_PTR_PRINTF, (void *) DECL_TEMPLATE_INFO (node));
67 void
68 cxx_print_type (FILE *file, tree node, int indent)
70 switch (TREE_CODE (node))
72 case TEMPLATE_TYPE_PARM:
73 case TEMPLATE_TEMPLATE_PARM:
74 case BOUND_TEMPLATE_TEMPLATE_PARM:
75 indent_to (file, indent + 3);
76 fputs ("index ", file);
77 fprintf (file, HOST_WIDE_INT_PRINT_DEC, TEMPLATE_TYPE_IDX (node));
78 fputs (" level ", file);
79 fprintf (file, HOST_WIDE_INT_PRINT_DEC, TEMPLATE_TYPE_LEVEL (node));
80 fputs (" orig_level ", file);
81 fprintf (file, HOST_WIDE_INT_PRINT_DEC, TEMPLATE_TYPE_ORIG_LEVEL (node));
82 return;
84 case FUNCTION_TYPE:
85 case METHOD_TYPE:
86 if (TYPE_RAISES_EXCEPTIONS (node))
87 print_node (file, "throws", TYPE_RAISES_EXCEPTIONS (node), indent + 4);
88 return;
90 case RECORD_TYPE:
91 case UNION_TYPE:
92 break;
94 default:
95 return;
98 if (TYPE_PTRMEMFUNC_P (node))
99 print_node (file, "ptrmemfunc fn type", TYPE_PTRMEMFUNC_FN_TYPE (node),
100 indent + 4);
102 if (! CLASS_TYPE_P (node))
103 return;
105 indent_to (file, indent + 3);
107 if (TYPE_NEEDS_CONSTRUCTING (node))
108 fputs ( "needs-constructor", file);
109 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (node))
110 fputs (" needs-destructor", file);
111 if (TYPE_HAS_DESTRUCTOR (node))
112 fputs (" ~X()", file);
113 if (TYPE_HAS_DEFAULT_CONSTRUCTOR (node))
114 fputs (" X()", file);
115 if (TYPE_HAS_CONVERSION (node))
116 fputs (" has-type-conversion", file);
117 if (TYPE_HAS_INIT_REF (node))
119 if (TYPE_HAS_CONST_INIT_REF (node))
120 fputs (" X(constX&)", file);
121 else
122 fputs (" X(X&)", file);
124 if (TYPE_HAS_NEW_OPERATOR (node))
125 fputs (" new", file);
126 if (TYPE_HAS_ARRAY_NEW_OPERATOR (node))
127 fputs (" new[]", file);
128 if (TYPE_GETS_DELETE (node) & 1)
129 fputs (" delete", file);
130 if (TYPE_GETS_DELETE (node) & 2)
131 fputs (" delete[]", file);
132 if (TYPE_HAS_ASSIGN_REF (node))
133 fputs (" this=(X&)", file);
134 if (TYPE_OVERLOADS_CALL_EXPR (node))
135 fputs (" op()", file);
136 if (TYPE_OVERLOADS_ARRAY_REF (node))
137 fputs (" op[]", file);
138 if (TYPE_OVERLOADS_ARROW (node))
139 fputs (" op->", file);
140 if (TYPE_USES_MULTIPLE_INHERITANCE (node))
141 fputs (" uses-multiple-inheritance", file);
143 if (TREE_CODE (node) == RECORD_TYPE)
145 fprintf (file, " n_parents %d", CLASSTYPE_N_BASECLASSES (node));
146 fprintf (file, " use_template=%d", CLASSTYPE_USE_TEMPLATE (node));
147 if (CLASSTYPE_INTERFACE_ONLY (node))
148 fprintf (file, " interface-only");
149 if (CLASSTYPE_INTERFACE_UNKNOWN (node))
150 fprintf (file, " interface-unknown");
151 print_node (file, "member-functions", CLASSTYPE_METHOD_VEC (node),
152 indent + 4);
157 static void
158 cxx_print_binding (FILE *stream, cxx_binding *binding, const char *prefix)
160 fprintf (stream, "%s <", prefix);
161 fprintf (stream, HOST_PTR_PRINTF, (char *) binding);
162 fprintf (stream, ">");
165 void
166 cxx_print_identifier (FILE *file, tree node, int indent)
168 cxx_print_binding (file, IDENTIFIER_NAMESPACE_BINDINGS (node), "bindings");
169 print_node (file, "class", IDENTIFIER_CLASS_VALUE (node), indent + 4);
170 cxx_print_binding (file, IDENTIFIER_BINDING (node), "local bindings");
171 print_node (file, "label", IDENTIFIER_LABEL_VALUE (node), indent + 4);
172 print_node (file, "template", IDENTIFIER_TEMPLATE (node), indent + 4);
173 print_node (file, "implicit", IDENTIFIER_IMPLICIT_DECL (node), indent + 4);
174 print_node (file, "error locus", IDENTIFIER_ERROR_LOCUS (node), indent + 4);
177 void
178 cxx_print_xnode (FILE *file, tree node, int indent)
180 switch (TREE_CODE (node))
182 case OVERLOAD:
183 print_node (file, "function", OVL_FUNCTION (node), indent+4);
184 print_node (file, "chain", TREE_CHAIN (node), indent+4);
185 break;
186 case TEMPLATE_PARM_INDEX:
187 indent_to (file, indent + 3);
188 fputs ("index ", file);
189 fprintf (file, HOST_WIDE_INT_PRINT_DEC, TEMPLATE_PARM_IDX (node));
190 fputs (" level ", file);
191 fprintf (file, HOST_WIDE_INT_PRINT_DEC, TEMPLATE_PARM_LEVEL (node));
192 fputs (" orig_level ", file);
193 fprintf (file, HOST_WIDE_INT_PRINT_DEC, TEMPLATE_PARM_ORIG_LEVEL (node));
194 break;
195 default:
196 break;