gcc/print-tree.c

   1 /* Prints out tree in human readable form - GCC
   2    Copyright (C) 1990, 1991, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
   3    2001, 2002, 2003, 2004 Free Software Foundation, Inc.
   4
   5 This file is part of GCC.
   6
   7 GCC is free software; you can redistribute it and/or modify it under
   8 the terms of the GNU General Public License as published by the Free
   9 Software Foundation; either version 2, or (at your option) any later
  10 version.
  11
  12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
  13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
  14 FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  15 for more details.
  16
  17 You should have received a copy of the GNU General Public License
  18 along with GCC; see the file COPYING.  If not, write to the Free
  19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
  20 02111-1307, USA.  */
  21
  22
  23 #include "config.h"
  24 #include "system.h"
  25 #include "coretypes.h"
  26 #include "tm.h"
  27 #include "tree.h"
  28 #include "real.h"
  29 #include "ggc.h"
  30 #include "langhooks.h"
  31
  32 /* Define the hash table of nodes already seen.
  33    Such nodes are not repeated; brief cross-references are used.  */
  34
  35 #define HASH_SIZE 37
  36
  37 struct bucket
  38 {
  39   tree node;
  40   struct bucket *next;
  41 };
  42
  43 static struct bucket **table;
  44
  45 /* Print the node NODE on standard error, for debugging.
  46    Most nodes referred to by this one are printed recursively
  47    down to a depth of six.  */
  48
  49 void
  50 debug_tree (tree node)
  51 {
  52   table = xcalloc (HASH_SIZE, sizeof (struct bucket *));
  53   print_node (stderr, "", node, 0);
  54   free (table);
  55   table = 0;
  56   putc ('\n', stderr);
  57 }
  58
  59 /* Print a node in brief fashion, with just the code, address and name.  */
  60
  61 void
  62 print_node_brief (FILE *file, const char *prefix, tree node, int indent)
  63 {
  64   char class;
  65
  66   if (node == 0)
  67     return;
  68
  69   class = TREE_CODE_CLASS (TREE_CODE (node));
  70
  71   /* Always print the slot this node is in, and its code, address and
  72      name if any.  */
  73   if (indent > 0)
  74     fprintf (file, " ");
  75   fprintf (file, "%s <%s " HOST_PTR_PRINTF,
  76            prefix, tree_code_name[(int) TREE_CODE (node)], (char *) node);
  77
  78   if (class == 'd')
  79     {
  80       if (DECL_NAME (node))
  81         fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
  82     }
  83   else if (class == 't')
  84     {
  85       if (TYPE_NAME (node))
  86         {
  87           if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
  88             fprintf (file, " %s", IDENTIFIER_POINTER (TYPE_NAME (node)));
  89           else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
  90                    && DECL_NAME (TYPE_NAME (node)))
  91             fprintf (file, " %s",
  92                      IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node))));
  93         }
  94     }
  95   if (TREE_CODE (node) == IDENTIFIER_NODE)
  96     fprintf (file, " %s", IDENTIFIER_POINTER (node));
  97
  98   /* We might as well always print the value of an integer or real.  */
  99   if (TREE_CODE (node) == INTEGER_CST)
 100     {
 101       if (TREE_CONSTANT_OVERFLOW (node))
 102         fprintf (file, " overflow");
 103
 104       fprintf (file, " ");
 105       if (TREE_INT_CST_HIGH (node) == 0)
 106         fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED, TREE_INT_CST_LOW (node));
 107       else if (TREE_INT_CST_HIGH (node) == -1
 108                && TREE_INT_CST_LOW (node) != 0)
 109         fprintf (file, "-" HOST_WIDE_INT_PRINT_UNSIGNED,
 110                  -TREE_INT_CST_LOW (node));
 111       else
 112         fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
 113                  TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
 114     }
 115   if (TREE_CODE (node) == REAL_CST)
 116     {
 117       REAL_VALUE_TYPE d;
 118
 119       if (TREE_OVERFLOW (node))
 120         fprintf (file, " overflow");
 121
 122       d = TREE_REAL_CST (node);
 123       if (REAL_VALUE_ISINF (d))
 124         fprintf (file, " Inf");
 125       else if (REAL_VALUE_ISNAN (d))
 126         fprintf (file, " Nan");
 127       else
 128         {
 129           char string[60];
 130           real_to_decimal (string, &d, sizeof (string), 0, 1);
 131           fprintf (file, " %s", string);
 132         }
 133     }
 134
 135   fprintf (file, ">");
 136 }
 137
 138 void
 139 indent_to (FILE *file, int column)
 140 {
 141   int i;
 142
 143   /* Since this is the long way, indent to desired column.  */
 144   if (column > 0)
 145     fprintf (file, "\n");
 146   for (i = 0; i < column; i++)
 147     fprintf (file, " ");
 148 }
 149 \f
 150 /* Print the node NODE in full on file FILE, preceded by PREFIX,
 151    starting in column INDENT.  */
 152
 153 void
 154 print_node (FILE *file, const char *prefix, tree node, int indent)
 155 {
 156   int hash;
 157   struct bucket *b;
 158   enum machine_mode mode;
 159   char class;
 160   int len;
 161   int first_rtl;
 162   int i;
 163   expanded_location xloc;
 164
 165   if (node == 0)
 166     return;
 167
 168   class = TREE_CODE_CLASS (TREE_CODE (node));
 169
 170   /* Don't get too deep in nesting.  If the user wants to see deeper,
 171      it is easy to use the address of a lowest-level node
 172      as an argument in another call to debug_tree.  */
 173
 174   if (indent > 24)
 175     {
 176       print_node_brief (file, prefix, node, indent);
 177       return;
 178     }
 179
 180   if (indent > 8 && (class == 't' || class == 'd'))
 181     {
 182       print_node_brief (file, prefix, node, indent);
 183       return;
 184     }
 185
 186   /* It is unsafe to look at any other fields of an ERROR_MARK node.  */
 187   if (TREE_CODE (node) == ERROR_MARK)
 188     {
 189       print_node_brief (file, prefix, node, indent);
 190       return;
 191     }
 192
 193   hash = ((unsigned long) node) % HASH_SIZE;
 194
 195   /* If node is in the table, just mention its address.  */
 196   for (b = table[hash]; b; b = b->next)
 197     if (b->node == node)
 198       {
 199         print_node_brief (file, prefix, node, indent);
 200         return;
 201       }
 202
 203   /* Add this node to the table.  */
 204   b = xmalloc (sizeof (struct bucket));
 205   b->node = node;
 206   b->next = table[hash];
 207   table[hash] = b;
 208
 209   /* Indent to the specified column, since this is the long form.  */
 210   indent_to (file, indent);
 211
 212   /* Print the slot this node is in, and its code, and address.  */
 213   fprintf (file, "%s <%s " HOST_PTR_PRINTF,
 214            prefix, tree_code_name[(int) TREE_CODE (node)], (void *) node);
 215
 216   /* Print the name, if any.  */
 217   if (class == 'd')
 218     {
 219       if (DECL_NAME (node))
 220         fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
 221     }
 222   else if (class == 't')
 223     {
 224       if (TYPE_NAME (node))
 225         {
 226           if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
 227             fprintf (file, " %s", IDENTIFIER_POINTER (TYPE_NAME (node)));
 228           else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
 229                    && DECL_NAME (TYPE_NAME (node)))
 230             fprintf (file, " %s",
 231                      IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node))));
 232         }
 233     }
 234   if (TREE_CODE (node) == IDENTIFIER_NODE)
 235     fprintf (file, " %s", IDENTIFIER_POINTER (node));
 236
 237   if (TREE_CODE (node) == INTEGER_CST)
 238     {
 239       if (indent <= 4)
 240         print_node_brief (file, "type", TREE_TYPE (node), indent + 4);
 241     }
 242   else
 243     {
 244       print_node (file, "type", TREE_TYPE (node), indent + 4);
 245       if (TREE_TYPE (node))
 246         indent_to (file, indent + 3);
 247     }
 248
 249   if (!TYPE_P (node) && TREE_SIDE_EFFECTS (node))
 250     fputs (" side-effects", file);
 251
 252   if (TYPE_P (node) ? TYPE_READONLY (node) : TREE_READONLY (node))
 253     fputs (" readonly", file);
 254   if (!TYPE_P (node) && TREE_CONSTANT (node))
 255     fputs (" constant", file);
 256   if (TREE_INVARIANT (node))
 257     fputs (" invariant", file);
 258   if (TREE_ADDRESSABLE (node))
 259     fputs (" addressable", file);
 260   if (TREE_THIS_VOLATILE (node))
 261     fputs (" volatile", file);
 262   if (TREE_ASM_WRITTEN (node))
 263     fputs (" asm_written", file);
 264   if (TREE_USED (node))
 265     fputs (" used", file);
 266   if (TREE_NOTHROW (node))
 267     fputs (TYPE_P (node) ? " align-ok" : " nothrow", file);
 268   if (TREE_PUBLIC (node))
 269     fputs (" public", file);
 270   if (TREE_PRIVATE (node))
 271     fputs (" private", file);
 272   if (TREE_PROTECTED (node))
 273     fputs (" protected", file);
 274   if (TREE_STATIC (node))
 275     fputs (" static", file);
 276   if (TREE_DEPRECATED (node))
 277     fputs (" deprecated", file);
 278   if (TREE_VISITED (node))
 279     fputs (" visited", file);
 280   if (TREE_LANG_FLAG_0 (node))
 281     fputs (" tree_0", file);
 282   if (TREE_LANG_FLAG_1 (node))
 283     fputs (" tree_1", file);
 284   if (TREE_LANG_FLAG_2 (node))
 285     fputs (" tree_2", file);
 286   if (TREE_LANG_FLAG_3 (node))
 287     fputs (" tree_3", file);
 288   if (TREE_LANG_FLAG_4 (node))
 289     fputs (" tree_4", file);
 290   if (TREE_LANG_FLAG_5 (node))
 291     fputs (" tree_5", file);
 292   if (TREE_LANG_FLAG_6 (node))
 293     fputs (" tree_6", file);
 294
 295   /* DECL_ nodes have additional attributes.  */
 296
 297   switch (TREE_CODE_CLASS (TREE_CODE (node)))
 298     {
 299     case 'd':
 300       mode = DECL_MODE (node);
 301
 302       if (DECL_UNSIGNED (node))
 303         fputs (" unsigned", file);
 304       if (DECL_IGNORED_P (node))
 305         fputs (" ignored", file);
 306       if (DECL_ABSTRACT (node))
 307         fputs (" abstract", file);
 308       if (DECL_IN_SYSTEM_HEADER (node))
 309         fputs (" in_system_header", file);
 310       if (DECL_COMMON (node))
 311         fputs (" common", file);
 312       if (DECL_EXTERNAL (node))
 313         fputs (" external", file);
 314       if (DECL_WEAK (node))
 315         fputs (" weak", file);
 316       if (DECL_REGISTER (node) && TREE_CODE (node) != FIELD_DECL
 317           && TREE_CODE (node) != FUNCTION_DECL
 318           && TREE_CODE (node) != LABEL_DECL)
 319         fputs (" regdecl", file);
 320       if (DECL_NONLOCAL (node))
 321         fputs (" nonlocal", file);
 322
 323       if (TREE_CODE (node) == TYPE_DECL && TYPE_DECL_SUPPRESS_DEBUG (node))
 324         fputs (" suppress-debug", file);
 325
 326       if (TREE_CODE (node) == FUNCTION_DECL && DECL_INLINE (node))
 327         fputs (DECL_DECLARED_INLINE_P (node) ? " inline" : " autoinline", file);
 328       if (TREE_CODE (node) == FUNCTION_DECL && DECL_BUILT_IN (node))
 329         fputs (" built-in", file);
 330       if (TREE_CODE (node) == FUNCTION_DECL && DECL_NO_STATIC_CHAIN (node))
 331         fputs (" no-static-chain", file);
 332
 333       if (TREE_CODE (node) == FIELD_DECL && DECL_PACKED (node))
 334         fputs (" packed", file);
 335       if (TREE_CODE (node) == FIELD_DECL && DECL_BIT_FIELD (node))
 336         fputs (" bit-field", file);
 337       if (TREE_CODE (node) == FIELD_DECL && DECL_NONADDRESSABLE_P (node))
 338         fputs (" nonaddressable", file);
 339
 340       if (TREE_CODE (node) == LABEL_DECL && DECL_ERROR_ISSUED (node))
 341         fputs (" error-issued", file);
 342
 343       if (TREE_CODE (node) == VAR_DECL && DECL_IN_TEXT_SECTION (node))
 344         fputs (" in-text-section", file);
 345       if (TREE_CODE (node) == VAR_DECL && DECL_THREAD_LOCAL (node))
 346         fputs (" thread-local", file);
 347
 348       if (TREE_CODE (node) == PARM_DECL && DECL_TRANSPARENT_UNION (node))
 349         fputs (" transparent-union", file);
 350
 351       if (DECL_VIRTUAL_P (node))
 352         fputs (" virtual", file);
 353       if (DECL_DEFER_OUTPUT (node))
 354         fputs (" defer-output", file);
 355
 356       if (DECL_LANG_FLAG_0 (node))
 357         fputs (" decl_0", file);
 358       if (DECL_LANG_FLAG_1 (node))
 359         fputs (" decl_1", file);
 360       if (DECL_LANG_FLAG_2 (node))
 361         fputs (" decl_2", file);
 362       if (DECL_LANG_FLAG_3 (node))
 363         fputs (" decl_3", file);
 364       if (DECL_LANG_FLAG_4 (node))
 365         fputs (" decl_4", file);
 366       if (DECL_LANG_FLAG_5 (node))
 367         fputs (" decl_5", file);
 368       if (DECL_LANG_FLAG_6 (node))
 369         fputs (" decl_6", file);
 370       if (DECL_LANG_FLAG_7 (node))
 371         fputs (" decl_7", file);
 372
 373       fprintf (file, " %s", GET_MODE_NAME (mode));
 374       xloc = expand_location (DECL_SOURCE_LOCATION (node));
 375       fprintf (file, " file %s line %d", xloc.file, xloc.line);
 376
 377       print_node (file, "size", DECL_SIZE (node), indent + 4);
 378       print_node (file, "unit size", DECL_SIZE_UNIT (node), indent + 4);
 379
 380       if (TREE_CODE (node) != FUNCTION_DECL
 381           || DECL_INLINE (node) || DECL_BUILT_IN (node))
 382         indent_to (file, indent + 3);
 383
 384       if (TREE_CODE (node) != FUNCTION_DECL)
 385         {
 386           if (DECL_USER_ALIGN (node))
 387             fprintf (file, " user");
 388
 389           fprintf (file, " align %d", DECL_ALIGN (node));
 390           if (TREE_CODE (node) == FIELD_DECL)
 391             fprintf (file, " offset_align " HOST_WIDE_INT_PRINT_UNSIGNED,
 392                      DECL_OFFSET_ALIGN (node));
 393         }
 394       else if (DECL_BUILT_IN (node))
 395         {
 396           if (DECL_BUILT_IN_CLASS (node) == BUILT_IN_MD)
 397             fprintf (file, " built-in BUILT_IN_MD %d", DECL_FUNCTION_CODE (node));
 398           else
 399             fprintf (file, " built-in %s:%s",
 400                      built_in_class_names[(int) DECL_BUILT_IN_CLASS (node)],
 401                      built_in_names[(int) DECL_FUNCTION_CODE (node)]);
 402         }
 403
 404       if (DECL_POINTER_ALIAS_SET_KNOWN_P (node))
 405         fprintf (file, " alias set " HOST_WIDE_INT_PRINT_DEC,
 406                  DECL_POINTER_ALIAS_SET (node));
 407
 408       if (TREE_CODE (node) == FIELD_DECL)
 409         {
 410           print_node (file, "offset", DECL_FIELD_OFFSET (node), indent + 4);
 411           print_node (file, "bit offset", DECL_FIELD_BIT_OFFSET (node),
 412                       indent + 4);
 413         }
 414
 415       print_node_brief (file, "context", DECL_CONTEXT (node), indent + 4);
 416       print_node_brief (file, "attributes",
 417                         DECL_ATTRIBUTES (node), indent + 4);
 418       print_node_brief (file, "abstract_origin",
 419                         DECL_ABSTRACT_ORIGIN (node), indent + 4);
 420
 421       print_node (file, "arguments", DECL_ARGUMENTS (node), indent + 4);
 422       print_node (file, "result", DECL_RESULT_FLD (node), indent + 4);
 423       print_node_brief (file, "initial", DECL_INITIAL (node), indent + 4);
 424
 425       lang_hooks.print_decl (file, node, indent);
 426
 427       if (DECL_RTL_SET_P (node))
 428         {
 429           indent_to (file, indent + 4);
 430           print_rtl (file, DECL_RTL (node));
 431         }
 432
 433       if (TREE_CODE (node) == PARM_DECL)
 434         {
 435           print_node (file, "arg-type", DECL_ARG_TYPE (node), indent + 4);
 436           print_node (file, "arg-type-as-written",
 437                       DECL_ARG_TYPE_AS_WRITTEN (node), indent + 4);
 438
 439           if (DECL_INCOMING_RTL (node) != 0)
 440             {
 441               indent_to (file, indent + 4);
 442               fprintf (file, "incoming-rtl ");
 443               print_rtl (file, DECL_INCOMING_RTL (node));
 444             }
 445         }
 446       else if (TREE_CODE (node) == FUNCTION_DECL
 447                && DECL_STRUCT_FUNCTION (node) != 0)
 448         {
 449           indent_to (file, indent + 4);
 450           fprintf (file, "saved-insns " HOST_PTR_PRINTF,
 451                    (void *) DECL_STRUCT_FUNCTION (node));
 452         }
 453
 454       /* Print the decl chain only if decl is at second level.  */
 455       if (indent == 4)
 456         print_node (file, "chain", TREE_CHAIN (node), indent + 4);
 457       else
 458         print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
 459       break;
 460
 461     case 't':
 462       if (TYPE_UNSIGNED (node))
 463         fputs (" unsigned", file);
 464
 465       /* The no-force-blk flag is used for different things in
 466          different types.  */
 467       if ((TREE_CODE (node) == RECORD_TYPE
 468            || TREE_CODE (node) == UNION_TYPE
 469            || TREE_CODE (node) == QUAL_UNION_TYPE)
 470           && TYPE_NO_FORCE_BLK (node))
 471         fputs (" no-force-blk", file);
 472       else if (TREE_CODE (node) == INTEGER_TYPE
 473                && TYPE_IS_SIZETYPE (node))
 474         fputs (" sizetype", file);
 475       else if (TREE_CODE (node) == FUNCTION_TYPE
 476                && TYPE_RETURNS_STACK_DEPRESSED (node))
 477         fputs (" returns-stack-depressed", file);
 478
 479       if (TYPE_STRING_FLAG (node))
 480         fputs (" string-flag", file);
 481       if (TYPE_NEEDS_CONSTRUCTING (node))
 482         fputs (" needs-constructing", file);
 483
 484       /* The transparent-union flag is used for different things in
 485          different nodes.  */
 486       if (TREE_CODE (node) == UNION_TYPE && TYPE_TRANSPARENT_UNION (node))
 487         fputs (" transparent-union", file);
 488       else if (TREE_CODE (node) == ARRAY_TYPE
 489                && TYPE_NONALIASED_COMPONENT (node))
 490         fputs (" nonaliased-component", file);
 491
 492       if (TYPE_PACKED (node))
 493         fputs (" packed", file);
 494
 495       if (TYPE_RESTRICT (node))
 496         fputs (" restrict", file);
 497
 498       if (TYPE_LANG_FLAG_0 (node))
 499         fputs (" type_0", file);
 500       if (TYPE_LANG_FLAG_1 (node))
 501         fputs (" type_1", file);
 502       if (TYPE_LANG_FLAG_2 (node))
 503         fputs (" type_2", file);
 504       if (TYPE_LANG_FLAG_3 (node))
 505         fputs (" type_3", file);
 506       if (TYPE_LANG_FLAG_4 (node))
 507         fputs (" type_4", file);
 508       if (TYPE_LANG_FLAG_5 (node))
 509         fputs (" type_5", file);
 510       if (TYPE_LANG_FLAG_6 (node))
 511         fputs (" type_6", file);
 512
 513       mode = TYPE_MODE (node);
 514       fprintf (file, " %s", GET_MODE_NAME (mode));
 515
 516       print_node (file, "size", TYPE_SIZE (node), indent + 4);
 517       print_node (file, "unit size", TYPE_SIZE_UNIT (node), indent + 4);
 518       indent_to (file, indent + 3);
 519
 520       if (TYPE_USER_ALIGN (node))
 521         fprintf (file, " user");
 522
 523       fprintf (file, " align %d symtab %d alias set " HOST_WIDE_INT_PRINT_DEC,
 524                TYPE_ALIGN (node), TYPE_SYMTAB_ADDRESS (node),
 525                TYPE_ALIAS_SET (node));
 526
 527       print_node (file, "attributes", TYPE_ATTRIBUTES (node), indent + 4);
 528
 529       if (INTEGRAL_TYPE_P (node) || TREE_CODE (node) == REAL_TYPE)
 530         {
 531           fprintf (file, " precision %d", TYPE_PRECISION (node));
 532           print_node_brief (file, "min", TYPE_MIN_VALUE (node), indent + 4);
 533           print_node_brief (file, "max", TYPE_MAX_VALUE (node), indent + 4);
 534         }
 535
 536       if (TREE_CODE (node) == ENUMERAL_TYPE)
 537         print_node (file, "values", TYPE_VALUES (node), indent + 4);
 538       else if (TREE_CODE (node) == ARRAY_TYPE || TREE_CODE (node) == SET_TYPE)
 539         print_node (file, "domain", TYPE_DOMAIN (node), indent + 4);
 540       else if (TREE_CODE (node) == RECORD_TYPE
 541                || TREE_CODE (node) == UNION_TYPE
 542                || TREE_CODE (node) == QUAL_UNION_TYPE)
 543         print_node (file, "fields", TYPE_FIELDS (node), indent + 4);
 544       else if (TREE_CODE (node) == FUNCTION_TYPE
 545                || TREE_CODE (node) == METHOD_TYPE)
 546         {
 547           if (TYPE_METHOD_BASETYPE (node))
 548             print_node_brief (file, "method basetype",
 549                               TYPE_METHOD_BASETYPE (node), indent + 4);
 550           print_node (file, "arg-types", TYPE_ARG_TYPES (node), indent + 4);
 551         }
 552       else if (TREE_CODE (node) == OFFSET_TYPE)
 553         print_node_brief (file, "basetype", TYPE_OFFSET_BASETYPE (node),
 554                           indent + 4);
 555
 556       if (TYPE_CONTEXT (node))
 557         print_node_brief (file, "context", TYPE_CONTEXT (node), indent + 4);
 558
 559       lang_hooks.print_type (file, node, indent);
 560
 561       if (TYPE_POINTER_TO (node) || TREE_CHAIN (node))
 562         indent_to (file, indent + 3);
 563
 564       print_node_brief (file, "pointer_to_this", TYPE_POINTER_TO (node),
 565                         indent + 4);
 566       print_node_brief (file, "reference_to_this", TYPE_REFERENCE_TO (node),
 567                         indent + 4);
 568       print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
 569       break;
 570
 571     case 'e':
 572     case '<':
 573     case '1':
 574     case '2':
 575     case 'r':
 576     case 's':
 577       if (TREE_CODE (node) == BIT_FIELD_REF && BIT_FIELD_REF_UNSIGNED (node))
 578         fputs (" unsigned", file);
 579       if (TREE_CODE (node) == BIND_EXPR)
 580         {
 581           print_node (file, "vars", TREE_OPERAND (node, 0), indent + 4);
 582           print_node (file, "body", TREE_OPERAND (node, 1), indent + 4);
 583           print_node (file, "block", TREE_OPERAND (node, 2), indent + 4);
 584           break;
 585         }
 586
 587       len = TREE_CODE_LENGTH (TREE_CODE (node));
 588
 589       /* Some nodes contain rtx's, not trees,
 590          after a certain point.  Print the rtx's as rtx's.  */
 591       first_rtl = first_rtl_op (TREE_CODE (node));
 592
 593       for (i = 0; i < len; i++)
 594         {
 595           if (i >= first_rtl)
 596             {
 597               indent_to (file, indent + 4);
 598               fprintf (file, "rtl %d ", i);
 599               if (TREE_OPERAND (node, i))
 600                 print_rtl (file, (rtx) TREE_OPERAND (node, i));
 601               else
 602                 fprintf (file, "(nil)");
 603               fprintf (file, "\n");
 604             }
 605           else
 606             {
 607               char temp[10];
 608
 609               sprintf (temp, "arg %d", i);
 610               print_node (file, temp, TREE_OPERAND (node, i), indent + 4);
 611             }
 612         }
 613
 614       print_node (file, "chain", TREE_CHAIN (node), indent + 4);
 615       break;
 616
 617     case 'c':
 618     case 'x':
 619       switch (TREE_CODE (node))
 620         {
 621         case INTEGER_CST:
 622           if (TREE_CONSTANT_OVERFLOW (node))
 623             fprintf (file, " overflow");
 624
 625           fprintf (file, " ");
 626           if (TREE_INT_CST_HIGH (node) == 0)
 627             fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
 628                      TREE_INT_CST_LOW (node));
 629           else if (TREE_INT_CST_HIGH (node) == -1
 630                    && TREE_INT_CST_LOW (node) != 0)
 631             fprintf (file, "-" HOST_WIDE_INT_PRINT_UNSIGNED,
 632                      -TREE_INT_CST_LOW (node));
 633           else
 634             fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
 635                      TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
 636           break;
 637
 638         case REAL_CST:
 639           {
 640             REAL_VALUE_TYPE d;
 641
 642             if (TREE_OVERFLOW (node))
 643               fprintf (file, " overflow");
 644
 645             d = TREE_REAL_CST (node);
 646             if (REAL_VALUE_ISINF (d))
 647               fprintf (file, " Inf");
 648             else if (REAL_VALUE_ISNAN (d))
 649               fprintf (file, " Nan");
 650             else
 651               {
 652                 char string[64];
 653                 real_to_decimal (string, &d, sizeof (string), 0, 1);
 654                 fprintf (file, " %s", string);
 655               }
 656           }
 657           break;
 658
 659         case VECTOR_CST:
 660           {
 661             tree vals = TREE_VECTOR_CST_ELTS (node);
 662             char buf[10];
 663             tree link;
 664             int i;
 665
 666             i = 0;
 667             for (link = vals; link; link = TREE_CHAIN (link), ++i)
 668               {
 669                 sprintf (buf, "elt%d: ", i);
 670                 print_node (file, buf, TREE_VALUE (link), indent + 4);
 671               }
 672           }
 673           break;
 674
 675         case COMPLEX_CST:
 676           print_node (file, "real", TREE_REALPART (node), indent + 4);
 677           print_node (file, "imag", TREE_IMAGPART (node), indent + 4);
 678           break;
 679
 680         case STRING_CST:
 681           {
 682             const char *p = TREE_STRING_POINTER (node);
 683             int i = TREE_STRING_LENGTH (node);
 684             fputs (" \"", file);
 685             while (--i >= 0)
 686               {
 687                 char ch = *p++;
 688                 if (ch >= ' ' && ch < 127)
 689                   putc (ch, file);
 690                 else
 691                   fprintf(file, "\\%03o", ch & 0xFF);
 692               }
 693             fputc ('\"', file);
 694           }
 695           /* Print the chain at second level.  */
 696           if (indent == 4)
 697             print_node (file, "chain", TREE_CHAIN (node), indent + 4);
 698           else
 699             print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
 700           break;
 701
 702         case IDENTIFIER_NODE:
 703           lang_hooks.print_identifier (file, node, indent);
 704           break;
 705
 706         case TREE_LIST:
 707           print_node (file, "purpose", TREE_PURPOSE (node), indent + 4);
 708           print_node (file, "value", TREE_VALUE (node), indent + 4);
 709           print_node (file, "chain", TREE_CHAIN (node), indent + 4);
 710           break;
 711
 712         case TREE_VEC:
 713           len = TREE_VEC_LENGTH (node);
 714           for (i = 0; i < len; i++)
 715             if (TREE_VEC_ELT (node, i))
 716               {
 717                 char temp[10];
 718                 sprintf (temp, "elt %d", i);
 719                 indent_to (file, indent + 4);
 720                 print_node_brief (file, temp, TREE_VEC_ELT (node, i), 0);
 721               }
 722           break;
 723
 724         case BLOCK:
 725           print_node (file, "vars", BLOCK_VARS (node), indent + 4);
 726           print_node (file, "supercontext", BLOCK_SUPERCONTEXT (node),
 727                       indent + 4);
 728           print_node (file, "subblocks", BLOCK_SUBBLOCKS (node), indent + 4);
 729           print_node (file, "chain", BLOCK_CHAIN (node), indent + 4);
 730           print_node (file, "abstract_origin",
 731                       BLOCK_ABSTRACT_ORIGIN (node), indent + 4);
 732           break;
 733
 734         case SSA_NAME:
 735           print_node_brief (file, "var", SSA_NAME_VAR (node), indent + 4);
 736           print_node_brief (file, "def_stmt",
 737                             SSA_NAME_DEF_STMT (node), indent + 4);
 738
 739           indent_to (file, indent + 4);
 740           fprintf (file, "version %u", SSA_NAME_VERSION (node));
 741           if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (node))
 742             fprintf (file, " in-abnormal-phi");
 743           if (SSA_NAME_IN_FREE_LIST (node))
 744             fprintf (file, " in-free-list");
 745
 746           if (SSA_NAME_PTR_INFO (node)
 747               || SSA_NAME_VALUE (node)
 748               || SSA_NAME_AUX (node))
 749             {
 750               indent_to (file, indent + 3);
 751               if (SSA_NAME_PTR_INFO (node))
 752                 fprintf (file, " ptr-info %p",
 753                          (void *) SSA_NAME_PTR_INFO (node));
 754               if (SSA_NAME_VALUE (node))
 755                 fprintf (file, " value %p",
 756                          (void *) SSA_NAME_VALUE (node));
 757               if (SSA_NAME_AUX (node))
 758                 fprintf (file, " aux %p", SSA_NAME_AUX (node));
 759             }
 760           break;
 761
 762         default:
 763           if (TREE_CODE_CLASS (TREE_CODE (node)) == 'x')
 764             lang_hooks.print_xnode (file, node, indent);
 765           break;
 766         }
 767
 768       break;
 769     }
 770
 771   if (EXPR_HAS_LOCATION (node))
 772     {
 773       expanded_location xloc = expand_location (EXPR_LOCATION (node));
 774       indent_to (file, indent+4);
 775       fprintf (file, "%s:%d", xloc.file, xloc.line);
 776     }
 777
 778   fprintf (file, ">");
 779 }