|
|
1.1 root 1: /* Prints out trees in human readable form.
2: Copyright (C) 1992, 1993 Free Software Foundation, Inc.
3: Hacked by Michael Tiemann ([email protected])
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, 675 Mass Ave, Cambridge, MA 02139, USA. */
20:
21:
22: #include "config.h"
23: #include "tree.h"
24: #include <stdio.h>
25: #include "cp-tree.h"
26:
27: void
28: print_lang_decl (file, node, indent)
29: FILE *file;
30: tree node;
31: int indent;
32: {
33: if (!DECL_LANG_SPECIFIC (node))
34: return;
35: /* A FIELD_DECL only has the flags structure, which we aren't displaying
36: anyways. */
37: if (DECL_MUTABLE_P (node))
38: {
39: indent_to (file, indent + 3);
40: fprintf (file, " mutable ");
41: }
42: if (TREE_CODE (node) == FIELD_DECL)
43: return;
44: indent_to (file, indent + 3);
45: if (DECL_MAIN_VARIANT (node))
46: {
47: fprintf (file, " decl-main-variant ");
48: fprintf (file, HOST_PTR_PRINTF, DECL_MAIN_VARIANT (node));
49: }
50: if (DECL_PENDING_INLINE_INFO (node))
51: {
52: fprintf (file, " pending-inline-info ");
53: fprintf (file, HOST_PTR_PRINTF, DECL_PENDING_INLINE_INFO (node));
54: }
55: if (DECL_TEMPLATE_INFO (node))
56: {
57: fprintf (file, " template-info ");
58: fprintf (file, HOST_PTR_PRINTF, DECL_TEMPLATE_INFO (node));
59: }
60: }
61:
62: void
63: print_lang_type (file, node, indent)
64: FILE *file;
65: register tree node;
66: int indent;
67: {
68: if (TREE_CODE (node) == TEMPLATE_TYPE_PARM)
69: {
70: print_node (file, "tinfo", TYPE_VALUES (node), indent + 4);
71: return;
72: }
73:
74: if (TREE_CODE (node) == UNINSTANTIATED_P_TYPE)
75: {
76: print_node (file, "template", UPT_TEMPLATE (node), indent + 4);
77: print_node (file, "parameters", UPT_PARMS (node), indent + 4);
78: return;
79: }
80:
81: if (! (TREE_CODE (node) == RECORD_TYPE
82: || TREE_CODE (node) == UNION_TYPE))
83: return;
84:
85: if (!TYPE_LANG_SPECIFIC (node))
86: return;
87:
88: indent_to (file, indent + 3);
89:
90: if (TYPE_NEEDS_CONSTRUCTOR (node))
91: fputs ( "needs-constructor", file);
92: if (TYPE_NEEDS_DESTRUCTOR (node))
93: fputs (" needs-destructor", file);
94: if (TYPE_HAS_DEFAULT_CONSTRUCTOR (node))
95: fputs (" has-default-ctor", file);
96: if (TYPE_HAS_CONVERSION (node))
97: fputs (" has-type-conversion", file);
98: if (TYPE_HAS_INT_CONVERSION (node))
99: fputs (" has-int-conversion", file);
100: if (TYPE_HAS_REAL_CONVERSION (node))
101: fputs (" has-float-conversion", file);
102: if (TYPE_HAS_INIT_REF (node))
103: {
104: if (TYPE_GETS_CONST_INIT_REF (node))
105: fputs (" X(constX&)", file);
106: else
107: fputs ("X(X&)", file);
108: }
109: if (TREE_GETS_NEW (node))
110: fputs (" gets-new", file);
111: if (TREE_GETS_DELETE (node))
112: fputs (" gets-delete", file);
113: if (TYPE_HAS_ASSIGNMENT (node))
114: fputs (" has=", file);
115: if (TYPE_GETS_ASSIGNMENT (node))
116: fputs (" gets=", file);
117: if (TYPE_HAS_ASSIGN_REF (node))
118: fputs (" this=(X&)", file);
119: if (TYPE_GETS_ASSIGN_REF (node))
120: fputs (" gets=(X&)", file);
121: if (TYPE_OVERLOADS_METHOD_CALL_EXPR (node))
122: fputs (" op->()", file);
123: if (TYPE_GETS_INIT_AGGR (node))
124: fputs (" gets X(X, ...)", file);
125: if (TYPE_OVERLOADS_CALL_EXPR (node))
126: fputs (" op()", file);
127: if (TYPE_OVERLOADS_ARRAY_REF (node))
128: fputs (" op[]", file);
129: if (TYPE_OVERLOADS_ARROW (node))
130: fputs (" op->", file);
131: if (TYPE_USES_MULTIPLE_INHERITANCE (node))
132: fputs (" uses-multiple-inheritance", file);
133:
134: if (TREE_CODE (node) == RECORD_TYPE)
135: {
136: fprintf (file, " n_parents %d n_ancestors %d",
137: CLASSTYPE_N_BASECLASSES (node),
138: CLASSTYPE_N_SUPERCLASSES (node));
139: fprintf (file, " use_template=%d", CLASSTYPE_USE_TEMPLATE (node));
140: if (CLASSTYPE_INTERFACE_ONLY (node))
141: fprintf (file, " interface-only");
142: if (CLASSTYPE_INTERFACE_UNKNOWN (node))
143: fprintf (file, " interface-unknown");
144: print_node (file, "member-functions", CLASSTYPE_METHOD_VEC (node),
145: indent + 4);
146: print_node (file, "baselinks",
147: TYPE_BINFO_BASETYPES (node) ? CLASSTYPE_BASELINK_VEC (node) : NULL_TREE,
148: indent + 4);
149: }
150: }
151:
152: void
153: print_lang_identifier (file, node, indent)
154: FILE *file;
155: tree node;
156: int indent;
157: {
158: print_node (file, "global", IDENTIFIER_GLOBAL_VALUE (node), indent + 4);
159: print_node (file, "class", IDENTIFIER_CLASS_VALUE (node), indent + 4);
160: print_node (file, "local", IDENTIFIER_LOCAL_VALUE (node), indent + 4);
161: print_node (file, "label", IDENTIFIER_LABEL_VALUE (node), indent + 4);
162: print_node (file, "template", IDENTIFIER_TEMPLATE (node), indent + 4);
163: print_node (file, "implicit", IDENTIFIER_IMPLICIT_DECL (node), indent + 4);
164: print_node (file, "error locus", IDENTIFIER_ERROR_LOCUS (node), indent + 4);
165: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.