re PR target/41081 (redundant ZERO_EXTENDs)
[official-gcc.git] / gcc / cp / ptree.c
blob69279cd4883917c6882e662678981c993f15b9ac
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, 2007
4 Free Software Foundation, Inc.
5 Hacked by Michael Tiemann (tiemann@cygnus.com)
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 3, or (at your option)
12 any later version.
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
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 (!CODE_CONTAINS_STRUCT (TREE_CODE (node), TS_DECL_COMMON)
45 || !DECL_LANG_SPECIFIC (node))
46 return;
47 if (TREE_CODE (node) == FUNCTION_DECL)
49 int flags = TFF_DECL_SPECIFIERS|TFF_RETURN_TYPE
50 |TFF_FUNCTION_DEFAULT_ARGUMENTS|TFF_EXCEPTION_SPECIFICATION ;
51 indent_to (file, indent + 3);
52 fprintf (file, " full-name \"%s\"", decl_as_string (node, flags));
54 else if (TREE_CODE (node) == TEMPLATE_DECL)
56 indent_to (file, indent + 3);
57 fprintf (file, " full-name \"%s\"",
58 decl_as_string (node, TFF_TEMPLATE_HEADER));
61 indent_to (file, indent + 3);
62 if (DECL_EXTERNAL (node) && DECL_NOT_REALLY_EXTERN (node))
63 fprintf (file, " not-really-extern");
64 if (TREE_CODE (node) == FUNCTION_DECL
65 && DECL_PENDING_INLINE_INFO (node))
66 fprintf (file, " pending-inline-info %p",
67 (void *) DECL_PENDING_INLINE_INFO (node));
68 if ((TREE_CODE (node) == FUNCTION_DECL || TREE_CODE (node) == VAR_DECL)
69 && DECL_TEMPLATE_INFO (node))
70 fprintf (file, " template-info %p",
71 (void *) DECL_TEMPLATE_INFO (node));
74 void
75 cxx_print_type (FILE *file, tree node, int indent)
77 switch (TREE_CODE (node))
79 case TEMPLATE_TYPE_PARM:
80 case TEMPLATE_TEMPLATE_PARM:
81 case BOUND_TEMPLATE_TEMPLATE_PARM:
82 indent_to (file, indent + 3);
83 fprintf (file, "index %d level %d orig_level %d",
84 TEMPLATE_TYPE_IDX (node), TEMPLATE_TYPE_LEVEL (node),
85 TEMPLATE_TYPE_ORIG_LEVEL (node));
86 return;
88 case FUNCTION_TYPE:
89 case METHOD_TYPE:
90 if (TYPE_RAISES_EXCEPTIONS (node))
91 print_node (file, "throws", TYPE_RAISES_EXCEPTIONS (node), indent + 4);
92 return;
94 case RECORD_TYPE:
95 case UNION_TYPE:
96 break;
98 default:
99 return;
102 if (TYPE_PTRMEMFUNC_P (node))
103 print_node (file, "ptrmemfunc fn type", TYPE_PTRMEMFUNC_FN_TYPE (node),
104 indent + 4);
106 if (! CLASS_TYPE_P (node))
107 return;
109 indent_to (file, indent + 4);
110 fprintf (file, "full-name \"%s\"",
111 type_as_string (node, TFF_CLASS_KEY_OR_ENUM));
113 indent_to (file, indent + 3);
115 if (TYPE_NEEDS_CONSTRUCTING (node))
116 fputs ( " needs-constructor", file);
117 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (node))
118 fputs (" needs-destructor", file);
119 if (TYPE_HAS_DEFAULT_CONSTRUCTOR (node))
120 fputs (" X()", file);
121 if (TYPE_HAS_CONVERSION (node))
122 fputs (" has-type-conversion", file);
123 if (TYPE_HAS_INIT_REF (node))
125 if (TYPE_HAS_CONST_INIT_REF (node))
126 fputs (" X(constX&)", file);
127 else
128 fputs (" X(X&)", file);
130 if (TYPE_HAS_NEW_OPERATOR (node))
131 fputs (" new", file);
132 if (TYPE_HAS_ARRAY_NEW_OPERATOR (node))
133 fputs (" new[]", file);
134 if (TYPE_GETS_DELETE (node) & 1)
135 fputs (" delete", file);
136 if (TYPE_GETS_DELETE (node) & 2)
137 fputs (" delete[]", file);
138 if (TYPE_HAS_ASSIGN_REF (node))
139 fputs (" this=(X&)", file);
140 if (CLASSTYPE_SORTED_FIELDS (node))
141 fprintf (file, " sorted-fields %p",
142 (void *) CLASSTYPE_SORTED_FIELDS (node));
144 if (TREE_CODE (node) == RECORD_TYPE)
146 if (TYPE_BINFO (node))
147 fprintf (file, " n_parents=%d",
148 BINFO_N_BASE_BINFOS (TYPE_BINFO (node)));
149 else
150 fprintf (file, " no-binfo");
152 fprintf (file, " use_template=%d", CLASSTYPE_USE_TEMPLATE (node));
153 if (CLASSTYPE_INTERFACE_ONLY (node))
154 fprintf (file, " interface-only");
155 if (CLASSTYPE_INTERFACE_UNKNOWN (node))
156 fprintf (file, " interface-unknown");
161 static void
162 cxx_print_binding (FILE *stream, cxx_binding *binding, const char *prefix)
164 fprintf (stream, "%s <%p>",
165 prefix, (void *) binding);
168 void
169 cxx_print_identifier (FILE *file, tree node, int indent)
171 if (indent == 0)
172 fprintf (file, " ");
173 else
174 indent_to (file, indent);
175 cxx_print_binding (file, IDENTIFIER_NAMESPACE_BINDINGS (node), "bindings");
176 if (indent == 0)
177 fprintf (file, " ");
178 else
179 indent_to (file, indent);
180 cxx_print_binding (file, IDENTIFIER_BINDING (node), "local bindings");
181 print_node (file, "label", IDENTIFIER_LABEL_VALUE (node), indent + 4);
182 print_node (file, "template", IDENTIFIER_TEMPLATE (node), indent + 4);
185 void
186 cxx_print_xnode (FILE *file, tree node, int indent)
188 switch (TREE_CODE (node))
190 case BASELINK:
191 print_node (file, "functions", BASELINK_FUNCTIONS (node), indent + 4);
192 print_node (file, "binfo", BASELINK_BINFO (node), indent + 4);
193 print_node (file, "access_binfo", BASELINK_ACCESS_BINFO (node),
194 indent + 4);
195 break;
196 case OVERLOAD:
197 print_node (file, "function", OVL_FUNCTION (node), indent+4);
198 print_node (file, "chain", TREE_CHAIN (node), indent+4);
199 break;
200 case TEMPLATE_PARM_INDEX:
201 indent_to (file, indent + 3);
202 fprintf (file, "index %d level %d orig_level %d",
203 TEMPLATE_PARM_IDX (node), TEMPLATE_PARM_LEVEL (node),
204 TEMPLATE_PARM_ORIG_LEVEL (node));
205 break;
206 default:
207 break;