1 /* Prints out trees in human readable form.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005 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)
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, 51 Franklin Street, Fifth Floor,
21 Boston, MA 02110-1301, USA. */
27 #include "coretypes.h"
33 cxx_print_decl (FILE *file, tree node, int indent)
35 if (TREE_CODE (node) == FIELD_DECL)
37 if (DECL_MUTABLE_P (node))
39 indent_to (file, indent + 3);
40 fprintf (file, " mutable ");
45 if (!CODE_CONTAINS_STRUCT (TREE_CODE (node), TS_DECL_COMMON)
46 || !DECL_LANG_SPECIFIC (node))
48 indent_to (file, indent + 3);
49 if (TREE_CODE (node) == FUNCTION_DECL
50 && DECL_PENDING_INLINE_INFO (node))
51 fprintf (file, " pending-inline-info %p",
52 (void *) DECL_PENDING_INLINE_INFO (node));
53 if (TREE_CODE (node) == TYPE_DECL
54 && DECL_SORTED_FIELDS (node))
55 fprintf (file, " sorted-fields %p",
56 (void *) DECL_SORTED_FIELDS (node));
57 if ((TREE_CODE (node) == FUNCTION_DECL || TREE_CODE (node) == VAR_DECL)
58 && DECL_TEMPLATE_INFO (node))
59 fprintf (file, " template-info %p",
60 (void *) DECL_TEMPLATE_INFO (node));
64 cxx_print_type (FILE *file, tree node, int indent)
66 switch (TREE_CODE (node))
68 case TEMPLATE_TYPE_PARM:
69 case TEMPLATE_TEMPLATE_PARM:
70 case BOUND_TEMPLATE_TEMPLATE_PARM:
71 indent_to (file, indent + 3);
72 fprintf (file, "index " HOST_WIDE_INT_PRINT_DEC " level "
73 HOST_WIDE_INT_PRINT_DEC " orig_level " HOST_WIDE_INT_PRINT_DEC,
74 TEMPLATE_TYPE_IDX (node), TEMPLATE_TYPE_LEVEL (node),
75 TEMPLATE_TYPE_ORIG_LEVEL (node));
80 if (TYPE_RAISES_EXCEPTIONS (node))
81 print_node (file, "throws", TYPE_RAISES_EXCEPTIONS (node), indent + 4);
92 if (TYPE_PTRMEMFUNC_P (node))
93 print_node (file, "ptrmemfunc fn type", TYPE_PTRMEMFUNC_FN_TYPE (node),
96 if (! CLASS_TYPE_P (node))
99 indent_to (file, indent + 3);
101 if (TYPE_NEEDS_CONSTRUCTING (node))
102 fputs ( "needs-constructor", file);
103 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (node))
104 fputs (" needs-destructor", file);
105 if (TYPE_HAS_DEFAULT_CONSTRUCTOR (node))
106 fputs (" X()", file);
107 if (TYPE_HAS_CONVERSION (node))
108 fputs (" has-type-conversion", file);
109 if (TYPE_HAS_INIT_REF (node))
111 if (TYPE_HAS_CONST_INIT_REF (node))
112 fputs (" X(constX&)", file);
114 fputs (" X(X&)", file);
116 if (TYPE_HAS_NEW_OPERATOR (node))
117 fputs (" new", file);
118 if (TYPE_HAS_ARRAY_NEW_OPERATOR (node))
119 fputs (" new[]", file);
120 if (TYPE_GETS_DELETE (node) & 1)
121 fputs (" delete", file);
122 if (TYPE_GETS_DELETE (node) & 2)
123 fputs (" delete[]", file);
124 if (TYPE_HAS_ASSIGN_REF (node))
125 fputs (" this=(X&)", file);
127 if (TREE_CODE (node) == RECORD_TYPE)
129 if (TYPE_BINFO (node))
130 fprintf (file, " n_parents=%d",
131 BINFO_N_BASE_BINFOS (TYPE_BINFO (node)));
133 fprintf (file, " no-binfo");
135 fprintf (file, " use_template=%d", CLASSTYPE_USE_TEMPLATE (node));
136 if (CLASSTYPE_INTERFACE_ONLY (node))
137 fprintf (file, " interface-only");
138 if (CLASSTYPE_INTERFACE_UNKNOWN (node))
139 fprintf (file, " interface-unknown");
145 cxx_print_binding (FILE *stream, cxx_binding *binding, const char *prefix)
147 fprintf (stream, "%s <%p>",
148 prefix, (void *) binding);
152 cxx_print_identifier (FILE *file, tree node, int indent)
157 indent_to (file, indent);
158 cxx_print_binding (file, IDENTIFIER_NAMESPACE_BINDINGS (node), "bindings");
162 indent_to (file, indent);
163 cxx_print_binding (file, IDENTIFIER_BINDING (node), "local bindings");
164 print_node (file, "label", IDENTIFIER_LABEL_VALUE (node), indent + 4);
165 print_node (file, "template", IDENTIFIER_TEMPLATE (node), indent + 4);
169 cxx_print_xnode (FILE *file, tree node, int indent)
171 switch (TREE_CODE (node))
174 print_node (file, "functions", BASELINK_FUNCTIONS (node), indent + 4);
175 print_node (file, "binfo", BASELINK_BINFO (node), indent + 4);
176 print_node (file, "access_binfo", BASELINK_ACCESS_BINFO (node),
180 print_node (file, "function", OVL_FUNCTION (node), indent+4);
181 print_node (file, "chain", TREE_CHAIN (node), indent+4);
183 case TEMPLATE_PARM_INDEX:
184 indent_to (file, indent + 3);
185 fprintf (file, "index " HOST_WIDE_INT_PRINT_DEC " level "
186 HOST_WIDE_INT_PRINT_DEC " orig_level " HOST_WIDE_INT_PRINT_DEC,
187 TEMPLATE_PARM_IDX (node), TEMPLATE_PARM_LEVEL (node),
188 TEMPLATE_PARM_ORIG_LEVEL (node));