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
 164   if (node == 0)
 165     return;
 166
 167   class = TREE_CODE_CLASS (TREE_CODE (node));
 168
 169   /* Don't get too deep in nesting.  If the user wants to see deeper,
 170      it is easy to use the address of a lowest-level node
 171      as an argument in another call to debug_tree.  */
 172
 173   if (indent > 24)
 174     {
 175       print_node_brief (file, prefix, node, indent);
 176       return;
 177     }
 178
 179   if (indent > 8 && (class == 't' || class == 'd'))
 180     {
 181       print_node_brief (file, prefix, node, indent);
 182       return;
 183     }
 184
 185   /* It is unsafe to look at any other fields of an ERROR_MARK node.  */
 186   if (TREE_CODE (node) == ERROR_MARK)
 187     {
 188       print_node_brief (file, prefix, node, indent);
 189       return;
 190     }
 191
 192   hash = ((unsigned long) node) % HASH_SIZE;
 193
 194   /* If node is in the table, just mention its address.  */
 195   for (b = table[hash]; b; b = b->next)
 196     if (b->node == node)
 197       {
 198         print_node_brief (file, prefix, node, indent);
 199         return;
 200       }
 201
 202   /* Add this node to the table.  */
 203   b = xmalloc (sizeof (struct bucket));
 204   b->node = node;
 205   b->next = table[hash];
 206   table[hash] = b;
 207
 208   /* Indent to the specified column, since this is the long form.  */
 209   indent_to (file, indent);
 210
 211   /* Print the slot this node is in, and its code, and address.  */
 212   fprintf (file, "%s <%s " HOST_PTR_PRINTF,
 213            prefix, tree_code_name[(int) TREE_CODE (node)], (void *) node);
 214
 215   /* Print the name, if any.  */
 216   if (class == 'd')
 217     {
 218       if (DECL_NAME (node))
 219         fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
 220     }
 221   else if (class == 't')
 222     {
 223       if (TYPE_NAME (node))
 224         {
 225           if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
 226             fprintf (file, " %s", IDENTIFIER_POINTER (TYPE_NAME (node)));
 227           else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
 228                    && DECL_NAME (TYPE_NAME (node)))
 229             fprintf (file, " %s",
 230                      IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node))));
 231         }
 232     }
 233   if (TREE_CODE (node) == IDENTIFIER_NODE)
 234     fprintf (file, " %s", IDENTIFIER_POINTER (node));
 235
 236   if (TREE_CODE (node) == INTEGER_CST)
 237     {
 238       if (indent <= 4)
 239         print_node_brief (file, "type", TREE_TYPE (node), indent + 4);
 240     }
 241   else
 242     {
 243       print_node (file, "type", TREE_TYPE (node), indent + 4);
 244       if (TREE_TYPE (node))
 245         indent_to (file, indent + 3);
 246     }
 247
 248   if (!TYPE_P (node) && TREE_SIDE_EFFECTS (node))
 249     fputs (" side-effects", file);
 250
 251   if (TYPE_P (node) ? TYPE_READONLY (node) : TREE_READONLY (node))
 252     fputs (" readonly", file);
 253   if (!TYPE_P (node) && TREE_CONSTANT (node))
 254     fputs (" constant", file);
 255   if (TREE_ADDRESSABLE (node))
 256     fputs (" addressable", file);
 257   if (TREE_THIS_VOLATILE (node))
 258     fputs (" volatile", file);
 259   if (TREE_ASM_WRITTEN (node))
 260     fputs (" asm_written", file);
 261   if (TREE_USED (node))
 262     fputs (" used", file);
 263   if (TREE_NOTHROW (node))
 264     fputs (TYPE_P (node) ? " align-ok" : " nothrow", file);
 265   if (TREE_PUBLIC (node))
 266     fputs (" public", file);
 267   if (TREE_PRIVATE (node))
 268     fputs (" private", file);
 269   if (TREE_PROTECTED (node))
 270     fputs (" protected", file);
 271   if (TREE_STATIC (node))
 272     fputs (" static", file);
 273   if (TREE_DEPRECATED (node))
 274     fputs (" deprecated", file);
 275   if (TREE_LANG_FLAG_0 (node))
 276     fputs (" tree_0", file);
 277   if (TREE_LANG_FLAG_1 (node))
 278     fputs (" tree_1", file);
 279   if (TREE_LANG_FLAG_2 (node))
 280     fputs (" tree_2", file);
 281   if (TREE_LANG_FLAG_3 (node))
 282     fputs (" tree_3", file);
 283   if (TREE_LANG_FLAG_4 (node))
 284     fputs (" tree_4", file);
 285   if (TREE_LANG_FLAG_5 (node))
 286     fputs (" tree_5", file);
 287   if (TREE_LANG_FLAG_6 (node))
 288     fputs (" tree_6", file);
 289
 290   /* DECL_ nodes have additional attributes.  */
 291
 292   switch (TREE_CODE_CLASS (TREE_CODE (node)))
 293     {
 294     case 'd':
 295       mode = DECL_MODE (node);
 296
 297       if (DECL_UNSIGNED (node))
 298         fputs (" unsigned", file);
 299       if (DECL_IGNORED_P (node))
 300         fputs (" ignored", file);
 301       if (DECL_ABSTRACT (node))
 302         fputs (" abstract", file);
 303       if (DECL_IN_SYSTEM_HEADER (node))
 304         fputs (" in_system_header", file);
 305       if (DECL_COMMON (node))
 306         fputs (" common", file);
 307       if (DECL_EXTERNAL (node))
 308         fputs (" external", file);
 309       if (DECL_WEAK (node))
 310         fputs (" weak", file);
 311       if (DECL_REGISTER (node) && TREE_CODE (node) != FIELD_DECL
 312           && TREE_CODE (node) != FUNCTION_DECL
 313           && TREE_CODE (node) != LABEL_DECL)
 314         fputs (" regdecl", file);
 315       if (DECL_NONLOCAL (node))
 316         fputs (" nonlocal", file);
 317
 318       if (TREE_CODE (node) == TYPE_DECL && TYPE_DECL_SUPPRESS_DEBUG (node))
 319         fputs (" suppress-debug", file);
 320
 321       if (TREE_CODE (node) == FUNCTION_DECL && DECL_INLINE (node))
 322         fputs (DECL_DECLARED_INLINE_P (node) ? " inline" : " autoinline", file);
 323       if (TREE_CODE (node) == FUNCTION_DECL && DECL_BUILT_IN (node))
 324         fputs (" built-in", file);
 325       if (TREE_CODE (node) == FUNCTION_DECL && DECL_NO_STATIC_CHAIN (node))
 326         fputs (" no-static-chain", file);
 327
 328       if (TREE_CODE (node) == FIELD_DECL && DECL_PACKED (node))
 329         fputs (" packed", file);
 330       if (TREE_CODE (node) == FIELD_DECL && DECL_BIT_FIELD (node))
 331         fputs (" bit-field", file);
 332       if (TREE_CODE (node) == FIELD_DECL && DECL_NONADDRESSABLE_P (node))
 333         fputs (" nonaddressable", file);
 334
 335       if (TREE_CODE (node) == LABEL_DECL && DECL_TOO_LATE (node))
 336         fputs (" too-late", file);
 337       if (TREE_CODE (node) == LABEL_DECL && DECL_ERROR_ISSUED (node))
 338         fputs (" error-issued", file);
 339
 340       if (TREE_CODE (node) == VAR_DECL && DECL_IN_TEXT_SECTION (node))
 341         fputs (" in-text-section", file);
 342       if (TREE_CODE (node) == VAR_DECL && DECL_THREAD_LOCAL (node))
 343         fputs (" thread-local", file);
 344
 345       if (TREE_CODE (node) == PARM_DECL && DECL_TRANSPARENT_UNION (node))
 346         fputs (" transparent-union", file);
 347
 348       if (DECL_VIRTUAL_P (node))
 349         fputs (" virtual", file);
 350       if (DECL_DEFER_OUTPUT (node))
 351         fputs (" defer-output", file);
 352
 353       if (DECL_LANG_FLAG_0 (node))
 354         fputs (" decl_0", file);
 355       if (DECL_LANG_FLAG_1 (node))
 356         fputs (" decl_1", file);
 357       if (DECL_LANG_FLAG_2 (node))
 358         fputs (" decl_2", file);
 359       if (DECL_LANG_FLAG_3 (node))
 360         fputs (" decl_3", file);
 361       if (DECL_LANG_FLAG_4 (node))
 362         fputs (" decl_4", file);
 363       if (DECL_LANG_FLAG_5 (node))
 364         fputs (" decl_5", file);
 365       if (DECL_LANG_FLAG_6 (node))
 366         fputs (" decl_6", file);
 367       if (DECL_LANG_FLAG_7 (node))
 368         fputs (" decl_7", file);
 369
 370       fprintf (file, " %s", GET_MODE_NAME (mode));
 371       fprintf (file, " file %s line %d",
 372                DECL_SOURCE_FILE (node), DECL_SOURCE_LINE (node));
 373
 374       print_node (file, "size", DECL_SIZE (node), indent + 4);
 375       print_node (file, "unit size", DECL_SIZE_UNIT (node), indent + 4);
 376
 377       if (TREE_CODE (node) != FUNCTION_DECL
 378           || DECL_INLINE (node) || DECL_BUILT_IN (node))
 379         indent_to (file, indent + 3);
 380
 381       if (TREE_CODE (node) != FUNCTION_DECL)
 382         {
 383           if (DECL_USER_ALIGN (node))
 384             fprintf (file, " user");
 385
 386           fprintf (file, " align %d", DECL_ALIGN (node));
 387           if (TREE_CODE (node) == FIELD_DECL)
 388             fprintf (file, " offset_align " HOST_WIDE_INT_PRINT_UNSIGNED,
 389                      DECL_OFFSET_ALIGN (node));
 390         }
 391       else if (DECL_BUILT_IN (node))
 392         {
 393           if (DECL_BUILT_IN_CLASS (node) == BUILT_IN_MD)
 394             fprintf (file, " built-in BUILT_IN_MD %d", DECL_FUNCTION_CODE (node));
 395           else
 396             fprintf (file, " built-in %s:%s",
 397                      built_in_class_names[(int) DECL_BUILT_IN_CLASS (node)],
 398                      built_in_names[(int) DECL_FUNCTION_CODE (node)]);
 399         }
 400
 401       if (DECL_POINTER_ALIAS_SET_KNOWN_P (node))
 402         fprintf (file, " alias set " HOST_WIDE_INT_PRINT_DEC,
 403                  DECL_POINTER_ALIAS_SET (node));
 404
 405       if (TREE_CODE (node) == FIELD_DECL)
 406         {
 407           print_node (file, "offset", DECL_FIELD_OFFSET (node), indent + 4);
 408           print_node (file, "bit offset", DECL_FIELD_BIT_OFFSET (node),
 409                       indent + 4);
 410         }
 411
 412       print_node_brief (file, "context", DECL_CONTEXT (node), indent + 4);
 413       print_node_brief (file, "attributes",
 414                         DECL_ATTRIBUTES (node), indent + 4);
 415       print_node_brief (file, "abstract_origin",
 416                         DECL_ABSTRACT_ORIGIN (node), indent + 4);
 417
 418       print_node (file, "arguments", DECL_ARGUMENTS (node), indent + 4);
 419       print_node (file, "result", DECL_RESULT_FLD (node), indent + 4);
 420       print_node_brief (file, "initial", DECL_INITIAL (node), indent + 4);
 421
 422       lang_hooks.print_decl (file, node, indent);
 423
 424       if (DECL_RTL_SET_P (node))
 425         {
 426           indent_to (file, indent + 4);
 427           print_rtl (file, DECL_RTL (node));
 428         }
 429
 430       if (TREE_CODE (node) == PARM_DECL)
 431         {
 432           print_node (file, "arg-type", DECL_ARG_TYPE (node), indent + 4);
 433           print_node (file, "arg-type-as-written",
 434                       DECL_ARG_TYPE_AS_WRITTEN (node), indent + 4);
 435
 436           if (DECL_INCOMING_RTL (node) != 0)
 437             {
 438               indent_to (file, indent + 4);
 439               fprintf (file, "incoming-rtl ");
 440               print_rtl (file, DECL_INCOMING_RTL (node));
 441             }
 442         }
 443       else if (TREE_CODE (node) == FUNCTION_DECL
 444                && DECL_STRUCT_FUNCTION (node) != 0)
 445         {
 446           indent_to (file, indent + 4);
 447           fprintf (file, "saved-insns " HOST_PTR_PRINTF,
 448                    (void *) DECL_STRUCT_FUNCTION (node));
 449         }
 450
 451       /* Print the decl chain only if decl is at second level.  */
 452       if (indent == 4)
 453         print_node (file, "chain", TREE_CHAIN (node), indent + 4);
 454       else
 455         print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
 456       break;
 457
 458     case 't':
 459       if (TYPE_UNSIGNED (node))
 460         fputs (" unsigned", file);
 461
 462       /* The no-force-blk flag is used for different things in
 463          different types.  */
 464       if ((TREE_CODE (node) == RECORD_TYPE
 465            || TREE_CODE (node) == UNION_TYPE
 466            || TREE_CODE (node) == QUAL_UNION_TYPE)
 467           && TYPE_NO_FORCE_BLK (node))
 468         fputs (" no-force-blk", file);
 469       else if (TREE_CODE (node) == INTEGER_TYPE
 470                && TYPE_IS_SIZETYPE (node))
 471         fputs (" sizetype", file);
 472       else if (TREE_CODE (node) == FUNCTION_TYPE
 473                && TYPE_RETURNS_STACK_DEPRESSED (node))
 474         fputs (" returns-stack-depressed", file);
 475
 476       if (TYPE_STRING_FLAG (node))
 477         fputs (" string-flag", file);
 478       if (TYPE_NEEDS_CONSTRUCTING (node))
 479         fputs (" needs-constructing", file);
 480
 481       /* The transparent-union flag is used for different things in
 482          different nodes.  */
 483       if (TREE_CODE (node) == UNION_TYPE && TYPE_TRANSPARENT_UNION (node))
 484         fputs (" transparent-union", file);
 485       else if (TREE_CODE (node) == ARRAY_TYPE
 486                && TYPE_NONALIASED_COMPONENT (node))
 487         fputs (" nonaliased-component", file);
 488
 489       if (TYPE_PACKED (node))
 490         fputs (" packed", file);
 491
 492       if (TYPE_RESTRICT (node))
 493         fputs (" restrict", file);
 494
 495       if (TYPE_LANG_FLAG_0 (node))
 496         fputs (" type_0", file);
 497       if (TYPE_LANG_FLAG_1 (node))
 498         fputs (" type_1", file);
 499       if (TYPE_LANG_FLAG_2 (node))
 500         fputs (" type_2", file);
 501       if (TYPE_LANG_FLAG_3 (node))
 502         fputs (" type_3", file);
 503       if (TYPE_LANG_FLAG_4 (node))
 504         fputs (" type_4", file);
 505       if (TYPE_LANG_FLAG_5 (node))
 506         fputs (" type_5", file);
 507       if (TYPE_LANG_FLAG_6 (node))
 508         fputs (" type_6", file);
 509
 510       mode = TYPE_MODE (node);
 511       fprintf (file, " %s", GET_MODE_NAME (mode));
 512
 513       print_node (file, "size", TYPE_SIZE (node), indent + 4);
 514       print_node (file, "unit size", TYPE_SIZE_UNIT (node), indent + 4);
 515       indent_to (file, indent + 3);
 516
 517       if (TYPE_USER_ALIGN (node))
 518         fprintf (file, " user");
 519
 520       fprintf (file, " align %d symtab %d alias set " HOST_WIDE_INT_PRINT_DEC,
 521                TYPE_ALIGN (node), TYPE_SYMTAB_ADDRESS (node),
 522                TYPE_ALIAS_SET (node));
 523
 524       print_node (file, "attributes", TYPE_ATTRIBUTES (node), indent + 4);
 525
 526       if (INTEGRAL_TYPE_P (node) || TREE_CODE (node) == REAL_TYPE)
 527         {
 528           fprintf (file, " precision %d", TYPE_PRECISION (node));
 529           print_node_brief (file, "min", TYPE_MIN_VALUE (node), indent + 4);
 530           print_node_brief (file, "max", TYPE_MAX_VALUE (node), indent + 4);
 531         }
 532
 533       if (TREE_CODE (node) == ENUMERAL_TYPE)
 534         print_node (file, "values", TYPE_VALUES (node), indent + 4);
 535       else if (TREE_CODE (node) == ARRAY_TYPE || TREE_CODE (node) == SET_TYPE)
 536         print_node (file, "domain", TYPE_DOMAIN (node), indent + 4);
 537       else if (TREE_CODE (node) == RECORD_TYPE
 538                || TREE_CODE (node) == UNION_TYPE
 539                || TREE_CODE (node) == QUAL_UNION_TYPE)
 540         print_node (file, "fields", TYPE_FIELDS (node), indent + 4);
 541       else if (TREE_CODE (node) == FUNCTION_TYPE
 542                || TREE_CODE (node) == METHOD_TYPE)
 543         {
 544           if (TYPE_METHOD_BASETYPE (node))
 545             print_node_brief (file, "method basetype",
 546                               TYPE_METHOD_BASETYPE (node), indent + 4);
 547           print_node (file, "arg-types", TYPE_ARG_TYPES (node), indent + 4);
 548         }
 549       else if (TREE_CODE (node) == OFFSET_TYPE)
 550         print_node_brief (file, "basetype", TYPE_OFFSET_BASETYPE (node),
 551                           indent + 4);
 552
 553       if (TYPE_CONTEXT (node))
 554         print_node_brief (file, "context", TYPE_CONTEXT (node), indent + 4);
 555
 556       lang_hooks.print_type (file, node, indent);
 557
 558       if (TYPE_POINTER_TO (node) || TREE_CHAIN (node))
 559         indent_to (file, indent + 3);
 560
 561       print_node_brief (file, "pointer_to_this", TYPE_POINTER_TO (node),
 562                         indent + 4);
 563       print_node_brief (file, "reference_to_this", TYPE_REFERENCE_TO (node),
 564                         indent + 4);
 565       print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
 566       break;
 567
 568     case 'b':
 569       print_node (file, "vars", BLOCK_VARS (node), indent + 4);
 570       print_node (file, "supercontext", BLOCK_SUPERCONTEXT (node), indent + 4);
 571       print_node (file, "subblocks", BLOCK_SUBBLOCKS (node), indent + 4);
 572       print_node (file, "chain", BLOCK_CHAIN (node), indent + 4);
 573       print_node (file, "abstract_origin",
 574                   BLOCK_ABSTRACT_ORIGIN (node), indent + 4);
 575       break;
 576
 577     case 'e':
 578     case '<':
 579     case '1':
 580     case '2':
 581     case 'r':
 582     case 's':
 583       if (TREE_CODE (node) == BIT_FIELD_REF && BIT_FIELD_REF_UNSIGNED (node))
 584         fputs (" unsigned", file);
 585       else if (TREE_CODE (node) == SAVE_EXPR && SAVE_EXPR_NOPLACEHOLDER (node))
 586         fputs (" noplaceholder", file);
 587       if (TREE_CODE (node) == BIND_EXPR)
 588         {
 589           print_node (file, "vars", TREE_OPERAND (node, 0), indent + 4);
 590           print_node (file, "body", TREE_OPERAND (node, 1), indent + 4);
 591           print_node (file, "block", TREE_OPERAND (node, 2), indent + 4);
 592           break;
 593         }
 594
 595       len = TREE_CODE_LENGTH (TREE_CODE (node));
 596
 597       /* Some nodes contain rtx's, not trees,
 598          after a certain point.  Print the rtx's as rtx's.  */
 599       first_rtl = first_rtl_op (TREE_CODE (node));
 600
 601       for (i = 0; i < len; i++)
 602         {
 603           if (i >= first_rtl)
 604             {
 605               indent_to (file, indent + 4);
 606               fprintf (file, "rtl %d ", i);
 607               if (TREE_OPERAND (node, i))
 608                 print_rtl (file, (rtx) TREE_OPERAND (node, i));
 609               else
 610                 fprintf (file, "(nil)");
 611               fprintf (file, "\n");
 612             }
 613           else
 614             {
 615               char temp[10];
 616
 617               sprintf (temp, "arg %d", i);
 618               print_node (file, temp, TREE_OPERAND (node, i), indent + 4);
 619             }
 620         }
 621
 622       if (TREE_CODE (node) == EXPR_WITH_FILE_LOCATION)
 623         {
 624           indent_to (file, indent+4);
 625           fprintf (file, "%s:%d:%d",
 626                    (EXPR_WFL_FILENAME_NODE (node ) ?
 627                     EXPR_WFL_FILENAME (node) : "(no file info)"),
 628                    EXPR_WFL_LINENO (node), EXPR_WFL_COLNO (node));
 629         }
 630       print_node (file, "chain", TREE_CHAIN (node), indent + 4);
 631       break;
 632
 633     case 'c':
 634     case 'x':
 635       switch (TREE_CODE (node))
 636         {
 637         case INTEGER_CST:
 638           if (TREE_CONSTANT_OVERFLOW (node))
 639             fprintf (file, " overflow");
 640
 641           fprintf (file, " ");
 642           if (TREE_INT_CST_HIGH (node) == 0)
 643             fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
 644                      TREE_INT_CST_LOW (node));
 645           else if (TREE_INT_CST_HIGH (node) == -1
 646                    && TREE_INT_CST_LOW (node) != 0)
 647             fprintf (file, "-" HOST_WIDE_INT_PRINT_UNSIGNED,
 648                      -TREE_INT_CST_LOW (node));
 649           else
 650             fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
 651                      TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
 652           break;
 653
 654         case REAL_CST:
 655           {
 656             REAL_VALUE_TYPE d;
 657
 658             if (TREE_OVERFLOW (node))
 659               fprintf (file, " overflow");
 660
 661             d = TREE_REAL_CST (node);
 662             if (REAL_VALUE_ISINF (d))
 663               fprintf (file, " Inf");
 664             else if (REAL_VALUE_ISNAN (d))
 665               fprintf (file, " Nan");
 666             else
 667               {
 668                 char string[64];
 669                 real_to_decimal (string, &d, sizeof (string), 0, 1);
 670                 fprintf (file, " %s", string);
 671               }
 672           }
 673           break;
 674
 675         case VECTOR_CST:
 676           {
 677             tree vals = TREE_VECTOR_CST_ELTS (node);
 678             char buf[10];
 679             tree link;
 680             int i;
 681
 682             i = 0;
 683             for (link = vals; link; link = TREE_CHAIN (link), ++i)
 684               {
 685                 sprintf (buf, "elt%d: ", i);
 686                 print_node (file, buf, TREE_VALUE (link), indent + 4);
 687               }
 688           }
 689           break;
 690
 691         case COMPLEX_CST:
 692           print_node (file, "real", TREE_REALPART (node), indent + 4);
 693           print_node (file, "imag", TREE_IMAGPART (node), indent + 4);
 694           break;
 695
 696         case STRING_CST:
 697           {
 698             const char *p = TREE_STRING_POINTER (node);
 699             int i = TREE_STRING_LENGTH (node);
 700             fputs (" \"", file);
 701             while (--i >= 0)
 702               {
 703                 char ch = *p++;
 704                 if (ch >= ' ' && ch < 127)
 705                   putc (ch, file);
 706                 else
 707                   fprintf(file, "\\%03o", ch & 0xFF);
 708               }
 709             fputc ('\"', file);
 710           }
 711           /* Print the chain at second level.  */
 712           if (indent == 4)
 713             print_node (file, "chain", TREE_CHAIN (node), indent + 4);
 714           else
 715             print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
 716           break;
 717
 718         case IDENTIFIER_NODE:
 719           lang_hooks.print_identifier (file, node, indent);
 720           break;
 721
 722         case TREE_LIST:
 723           print_node (file, "purpose", TREE_PURPOSE (node), indent + 4);
 724           print_node (file, "value", TREE_VALUE (node), indent + 4);
 725           print_node (file, "chain", TREE_CHAIN (node), indent + 4);
 726           break;
 727
 728         case TREE_VEC:
 729           len = TREE_VEC_LENGTH (node);
 730           for (i = 0; i < len; i++)
 731             if (TREE_VEC_ELT (node, i))
 732               {
 733                 char temp[10];
 734                 sprintf (temp, "elt %d", i);
 735                 indent_to (file, indent + 4);
 736                 print_node_brief (file, temp, TREE_VEC_ELT (node, i), 0);
 737               }
 738           break;
 739
 740         default:
 741           if (TREE_CODE_CLASS (TREE_CODE (node)) == 'x')
 742             lang_hooks.print_xnode (file, node, indent);
 743           break;
 744         }
 745
 746       break;
 747     }
 748
 749   fprintf (file, ">");
 750 }