cp-tree.def (PTRMEM_CST): New tree node.
[gcc.git] / gcc / cp / ptree.c
1 /* Prints out trees in human readable form.
2 Copyright (C) 1992, 1993, 1994, 1995 Free Software Foundation, Inc.
3 Hacked by Michael Tiemann (tiemann@cygnus.com)
4
5 This file is part of GNU CC.
6
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)
10 any later version.
11
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.
16
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. */
21
22
23 #include "config.h"
24 #include "system.h"
25 #include "tree.h"
26 #include "cp-tree.h"
27
28 void
29 print_lang_decl (file, node, indent)
30 FILE *file;
31 tree node;
32 int indent;
33 {
34 if (!DECL_LANG_SPECIFIC (node))
35 return;
36 /* A FIELD_DECL only has the flags structure, which we aren't displaying
37 anyways. */
38 if (DECL_MUTABLE_P (node))
39 {
40 indent_to (file, indent + 3);
41 fprintf (file, " mutable ");
42 }
43 if (TREE_CODE (node) == FIELD_DECL)
44 return;
45 indent_to (file, indent + 3);
46 if (DECL_MAIN_VARIANT (node))
47 {
48 fprintf (file, " decl-main-variant ");
49 fprintf (file, HOST_PTR_PRINTF, DECL_MAIN_VARIANT (node));
50 }
51 if (DECL_PENDING_INLINE_INFO (node))
52 {
53 fprintf (file, " pending-inline-info ");
54 fprintf (file, HOST_PTR_PRINTF, DECL_PENDING_INLINE_INFO (node));
55 }
56 if (DECL_TEMPLATE_INFO (node))
57 {
58 fprintf (file, " template-info ");
59 fprintf (file, HOST_PTR_PRINTF, DECL_TEMPLATE_INFO (node));
60 }
61 }
62
63 void
64 print_lang_type (file, node, indent)
65 FILE *file;
66 register tree node;
67 int indent;
68 {
69 if (TREE_CODE (node) == TEMPLATE_TYPE_PARM
70 || TREE_CODE (node) == TEMPLATE_TEMPLATE_PARM)
71 {
72 indent_to (file, indent + 3);
73 fputs ("index ", file);
74 fprintf (file, HOST_WIDE_INT_PRINT_DEC, TEMPLATE_TYPE_IDX (node));
75 fputs (" level ", file);
76 fprintf (file, HOST_WIDE_INT_PRINT_DEC, TEMPLATE_TYPE_LEVEL (node));
77 fputs (" orig_level ", file);
78 fprintf (file, HOST_WIDE_INT_PRINT_DEC, TEMPLATE_TYPE_ORIG_LEVEL (node));
79 return;
80 }
81
82 if (! (TREE_CODE (node) == RECORD_TYPE
83 || TREE_CODE (node) == UNION_TYPE))
84 return;
85
86 if (!TYPE_LANG_SPECIFIC (node))
87 return;
88
89 indent_to (file, indent + 3);
90
91 if (TYPE_NEEDS_CONSTRUCTING (node))
92 fputs ( "needs-constructor", file);
93 if (TYPE_NEEDS_DESTRUCTOR (node))
94 fputs (" needs-destructor", file);
95 if (TYPE_HAS_DESTRUCTOR (node))
96 fputs (" ~X()", file);
97 if (TYPE_HAS_DEFAULT_CONSTRUCTOR (node))
98 fputs (" X()", file);
99 if (TYPE_HAS_CONVERSION (node))
100 fputs (" has-type-conversion", file);
101 if (TYPE_HAS_INIT_REF (node))
102 {
103 if (TYPE_HAS_CONST_INIT_REF (node))
104 fputs (" X(constX&)", file);
105 else
106 fputs (" X(X&)", file);
107 }
108 if (TYPE_GETS_NEW (node) & 1)
109 fputs (" new", file);
110 if (TYPE_GETS_NEW (node) & 2)
111 fputs (" new[]", file);
112 if (TYPE_GETS_DELETE (node) & 1)
113 fputs (" delete", file);
114 if (TYPE_GETS_DELETE (node) & 2)
115 fputs (" delete[]", file);
116 if (TYPE_HAS_ASSIGNMENT (node))
117 fputs (" has=", file);
118 if (TYPE_HAS_ASSIGN_REF (node))
119 fputs (" this=(X&)", file);
120 if (TYPE_OVERLOADS_CALL_EXPR (node))
121 fputs (" op()", file);
122 if (TYPE_OVERLOADS_ARRAY_REF (node))
123 fputs (" op[]", file);
124 if (TYPE_OVERLOADS_ARROW (node))
125 fputs (" op->", file);
126 if (TYPE_USES_MULTIPLE_INHERITANCE (node))
127 fputs (" uses-multiple-inheritance", file);
128
129 if (TREE_CODE (node) == RECORD_TYPE)
130 {
131 fprintf (file, " n_parents %d n_ancestors %d",
132 CLASSTYPE_N_BASECLASSES (node),
133 CLASSTYPE_N_SUPERCLASSES (node));
134 fprintf (file, " use_template=%d", CLASSTYPE_USE_TEMPLATE (node));
135 if (CLASSTYPE_INTERFACE_ONLY (node))
136 fprintf (file, " interface-only");
137 if (CLASSTYPE_INTERFACE_UNKNOWN (node))
138 fprintf (file, " interface-unknown");
139 print_node (file, "member-functions", CLASSTYPE_METHOD_VEC (node),
140 indent + 4);
141 print_node (file, "baselinks",
142 TYPE_BINFO_BASETYPES (node) ? CLASSTYPE_BASELINK_VEC (node) : NULL_TREE,
143 indent + 4);
144 }
145 }
146
147 void
148 print_lang_identifier (file, node, indent)
149 FILE *file;
150 tree node;
151 int indent;
152 {
153 print_node (file, "bindings", IDENTIFIER_NAMESPACE_BINDINGS (node), indent + 4);
154 print_node (file, "class", IDENTIFIER_CLASS_VALUE (node), indent + 4);
155 print_node (file, "local", IDENTIFIER_LOCAL_VALUE (node), indent + 4);
156 print_node (file, "label", IDENTIFIER_LABEL_VALUE (node), indent + 4);
157 print_node (file, "template", IDENTIFIER_TEMPLATE (node), indent + 4);
158 print_node (file, "implicit", IDENTIFIER_IMPLICIT_DECL (node), indent + 4);
159 print_node (file, "error locus", IDENTIFIER_ERROR_LOCUS (node), indent + 4);
160 }
161
162 void
163 lang_print_xnode (file, node, indent)
164 FILE *file;
165 tree node;
166 int indent;
167 {
168 switch (TREE_CODE (node))
169 {
170 case CPLUS_BINDING:
171 print_node (file, "scope", BINDING_SCOPE (node), indent+4);
172 print_node (file, "value", BINDING_VALUE (node), indent+4);
173 print_node (file, "chain", TREE_CHAIN (node), indent+4);
174 break;
175 case OVERLOAD:
176 print_node (file, "function", OVL_FUNCTION (node), indent+4);
177 print_node (file, "chain", TREE_CHAIN (node), indent+4);
178 break;
179 case TEMPLATE_PARM_INDEX:
180 indent_to (file, indent + 3);
181 fputs ("index ", file);
182 fprintf (file, HOST_WIDE_INT_PRINT_DEC, TEMPLATE_PARM_IDX (node));
183 fputs (" level ", file);
184 fprintf (file, HOST_WIDE_INT_PRINT_DEC, TEMPLATE_PARM_LEVEL (node));
185 fputs (" orig_level ", file);
186 fprintf (file, HOST_WIDE_INT_PRINT_DEC, TEMPLATE_PARM_ORIG_LEVEL (node));
187 break;
188 default:
189 break;
190 }
191 }