gcc/cp/ptree.c

   1 /* Prints out trees in human readable form.
   2    Copyright (C) 1992, 93-96, 1998, 1999 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 (TREE_CODE (node) == FUNCTION_DECL
  52       && DECL_PENDING_INLINE_INFO (node))
  53     {
  54       fprintf (file, " pending-inline-info ");
  55       fprintf (file, HOST_PTR_PRINTF, DECL_PENDING_INLINE_INFO (node));
  56     }
  57   if (TREE_CODE (node) == TYPE_DECL
  58       && DECL_SORTED_FIELDS (node))
  59     {
  60       fprintf (file, " sorted-fields ");
  61       fprintf (file, HOST_PTR_PRINTF, DECL_SORTED_FIELDS (node));
  62     }
  63   if ((TREE_CODE (node) == FUNCTION_DECL || TREE_CODE (node) == VAR_DECL)
  64       && DECL_TEMPLATE_INFO (node))
  65     {
  66       fprintf (file, " template-info ");
  67       fprintf (file, HOST_PTR_PRINTF,  DECL_TEMPLATE_INFO (node));
  68     }
  69 }
  70
  71 void
  72 print_lang_type (file, node, indent)
  73      FILE *file;
  74      register tree node;
  75      int indent;
  76 {
  77   switch (TREE_CODE (node))
  78     {
  79     case TEMPLATE_TYPE_PARM:
  80     case TEMPLATE_TEMPLATE_PARM:
  81       indent_to (file, indent + 3);
  82       fputs ("index ", file);
  83       fprintf (file, HOST_WIDE_INT_PRINT_DEC, TEMPLATE_TYPE_IDX (node));
  84       fputs (" level ", file);
  85       fprintf (file, HOST_WIDE_INT_PRINT_DEC, TEMPLATE_TYPE_LEVEL (node));
  86       fputs (" orig_level ", file);
  87       fprintf (file, HOST_WIDE_INT_PRINT_DEC, TEMPLATE_TYPE_ORIG_LEVEL (node));
  88       return;
  89
  90     case FUNCTION_TYPE:
  91     case METHOD_TYPE:
  92       if (TYPE_RAISES_EXCEPTIONS (node))
  93         print_node (file, "throws", TYPE_RAISES_EXCEPTIONS (node), indent + 4);
  94       return;
  95
  96     case RECORD_TYPE:
  97     case UNION_TYPE:
  98       break;
  99
 100     default:
 101       return;
 102     }
 103
 104   if (TYPE_PTRMEMFUNC_P (node))
 105     print_node (file, "ptrmemfunc fn type", TYPE_PTRMEMFUNC_FN_TYPE (node),
 106                 indent + 4);
 107
 108   if (! CLASS_TYPE_P (node))
 109     return;
 110
 111   indent_to (file, indent + 3);
 112
 113   if (TYPE_NEEDS_CONSTRUCTING (node))
 114     fputs ( "needs-constructor", file);
 115   if (TYPE_NEEDS_DESTRUCTOR (node))
 116     fputs (" needs-destructor", file);
 117   if (TYPE_HAS_DESTRUCTOR (node))
 118     fputs (" ~X()", 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))
 124     {
 125       if (TYPE_HAS_CONST_INIT_REF (node))
 126         fputs (" X(constX&)", file);
 127       else
 128         fputs (" X(X&)", file);
 129     }
 130   if (TYPE_GETS_NEW (node) & 1)
 131     fputs (" new", file);
 132   if (TYPE_GETS_NEW (node) & 2)
 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 (TYPE_OVERLOADS_CALL_EXPR (node))
 141     fputs (" op()", file);
 142   if (TYPE_OVERLOADS_ARRAY_REF (node))
 143     fputs (" op[]", file);
 144   if (TYPE_OVERLOADS_ARROW (node))
 145     fputs (" op->", file);
 146   if (TYPE_USES_MULTIPLE_INHERITANCE (node))
 147     fputs (" uses-multiple-inheritance", file);
 148
 149   if (TREE_CODE (node) == RECORD_TYPE)
 150     {
 151       fprintf (file, " n_parents %d", CLASSTYPE_N_BASECLASSES (node));
 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");
 157       if (CLASSTYPE_VTABLE_NEEDS_WRITING (node))
 158         fprintf (file, " vtable-needs-writing");
 159       print_node (file, "member-functions", CLASSTYPE_METHOD_VEC (node),
 160                   indent + 4);
 161     }
 162 }
 163
 164 void
 165 print_lang_identifier (file, node, indent)
 166      FILE *file;
 167      tree node;
 168      int indent;
 169 {
 170   print_node (file, "bindings", IDENTIFIER_NAMESPACE_BINDINGS (node), indent + 4);
 171   print_node (file, "class", IDENTIFIER_CLASS_VALUE (node), indent + 4);
 172   print_node (file, "local bindings", IDENTIFIER_BINDING (node), indent + 4);
 173   print_node (file, "label", IDENTIFIER_LABEL_VALUE (node), indent + 4);
 174   print_node (file, "template", IDENTIFIER_TEMPLATE (node), indent + 4);
 175   print_node (file, "implicit", IDENTIFIER_IMPLICIT_DECL (node), indent + 4);
 176   print_node (file, "error locus", IDENTIFIER_ERROR_LOCUS (node), indent + 4);
 177 }
 178
 179 void
 180 lang_print_xnode (file, node, indent)
 181      FILE *file;
 182      tree node;
 183      int indent;
 184 {
 185   switch (TREE_CODE (node))
 186     {
 187     case CPLUS_BINDING:
 188       fprintf (file, " scope ");
 189       fprintf (file, HOST_PTR_PRINTF, BINDING_SCOPE (node));
 190       print_node (file, "value", BINDING_VALUE (node), indent+4);
 191       print_node (file, "chain", TREE_CHAIN (node), indent+4);
 192       break;
 193     case OVERLOAD:
 194       print_node (file, "function", OVL_FUNCTION (node), indent+4);
 195       print_node (file, "chain", TREE_CHAIN (node), indent+4);
 196       break;
 197     case TEMPLATE_PARM_INDEX:
 198       indent_to (file, indent + 3);
 199       fputs ("index ", file);
 200       fprintf (file, HOST_WIDE_INT_PRINT_DEC, TEMPLATE_PARM_IDX (node));
 201       fputs (" level ", file);
 202       fprintf (file, HOST_WIDE_INT_PRINT_DEC, TEMPLATE_PARM_LEVEL (node));
 203       fputs (" orig_level ", file);
 204       fprintf (file, HOST_WIDE_INT_PRINT_DEC, TEMPLATE_PARM_ORIG_LEVEL (node));
 205       break;
 206     default:
 207       break;
 208     }
 209 }