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)
5
6This file is part of GCC.
7
8GCC is free software; you can redistribute it and/or modify
9it under the terms of the GNU General Public License as published by
10the Free Software Foundation; either version 2, or (at your option)
11any later version.
12
13GCC is distributed in the hope that it will be useful,
14but WITHOUT ANY WARRANTY; without even the implied warranty of
15MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
16GNU General Public License for more details.
17
18You should have received a copy of the GNU General Public License
19along with GCC; see the file COPYING.  If not, write to
20the Free Software Foundation, 51 Franklin Street, Fifth Floor,
21Boston, MA 02110-1301, USA.  */
22
23/* $FreeBSD$ */
24
25#include "config.h"
26#include "system.h"
27#include "coretypes.h"
28#include "tm.h"
29#include "tree.h"
30#include "cp-tree.h"
31
32void
33cxx_print_decl (FILE *file, tree node, int indent)
34{
35  if (TREE_CODE (node) == FIELD_DECL)
36    {
37      if (DECL_MUTABLE_P (node))
38	{
39	  indent_to (file, indent + 3);
40	  fprintf (file, " mutable ");
41	}
42      return;
43    }
44
45  if (!CODE_CONTAINS_STRUCT (TREE_CODE (node), TS_DECL_COMMON)
46      || !DECL_LANG_SPECIFIC (node))
47    return;
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));
61}
62
63void
64cxx_print_type (FILE *file, tree node, int indent)
65{
66  switch (TREE_CODE (node))
67    {
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));
76      return;
77
78    case FUNCTION_TYPE:
79    case METHOD_TYPE:
80      if (TYPE_RAISES_EXCEPTIONS (node))
81	print_node (file, "throws", TYPE_RAISES_EXCEPTIONS (node), indent + 4);
82      return;
83
84    case RECORD_TYPE:
85    case UNION_TYPE:
86      break;
87
88    default:
89      return;
90    }
91
92  if (TYPE_PTRMEMFUNC_P (node))
93    print_node (file, "ptrmemfunc fn type", TYPE_PTRMEMFUNC_FN_TYPE (node),
94		indent + 4);
95
96  if (! CLASS_TYPE_P (node))
97    return;
98
99  indent_to (file, indent + 3);
100
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))
110    {
111      if (TYPE_HAS_CONST_INIT_REF (node))
112	fputs (" X(constX&)", file);
113      else
114	fputs (" X(X&)", file);
115    }
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);
126
127  if (TREE_CODE (node) == RECORD_TYPE)
128    {
129      if (TYPE_BINFO (node))
130	fprintf (file, " n_parents=%d",
131		 BINFO_N_BASE_BINFOS (TYPE_BINFO (node)));
132      else
133	fprintf (file, " no-binfo");
134
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");
140    }
141}
142
143
144static void
145cxx_print_binding (FILE *stream, cxx_binding *binding, const char *prefix)
146{
147  fprintf (stream, "%s <%p>",
148	   prefix, (void *) binding);
149}
150
151void
152cxx_print_identifier (FILE *file, tree node, int indent)
153{
154  if (indent == 0)
155    fprintf (file, " ");
156  else
157    indent_to (file, indent);
158  cxx_print_binding (file, IDENTIFIER_NAMESPACE_BINDINGS (node), "bindings");
159  if (indent == 0)
160    fprintf (file, " ");
161  else
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);
166}
167
168void
169cxx_print_xnode (FILE *file, tree node, int indent)
170{
171  switch (TREE_CODE (node))
172    {
173    case BASELINK:
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),
177		  indent + 4);
178      break;
179    case OVERLOAD:
180      print_node (file, "function", OVL_FUNCTION (node), indent+4);
181      print_node (file, "chain", TREE_CHAIN (node), indent+4);
182      break;
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));
189      break;
190    default:
191      break;
192    }
193}
194