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_PRESERVE_P (node))
 357         fputs (" preserve", file);
 358
 359       if (DECL_LANG_FLAG_0 (node))
 360         fputs (" decl_0", file);
 361       if (DECL_LANG_FLAG_1 (node))
 362         fputs (" decl_1", file);
 363       if (DECL_LANG_FLAG_2 (node))
 364         fputs (" decl_2", file);
 365       if (DECL_LANG_FLAG_3 (node))
 366         fputs (" decl_3", file);
 367       if (DECL_LANG_FLAG_4 (node))
 368         fputs (" decl_4", file);
 369       if (DECL_LANG_FLAG_5 (node))
 370         fputs (" decl_5", file);
 371       if (DECL_LANG_FLAG_6 (node))
 372         fputs (" decl_6", file);
 373       if (DECL_LANG_FLAG_7 (node))
 374         fputs (" decl_7", file);
 375
 376       fprintf (file, " %s", GET_MODE_NAME (mode));
 377       xloc = expand_location (DECL_SOURCE_LOCATION (node));
 378       fprintf (file, " file %s line %d", xloc.file, xloc.line);
 379
 380       print_node (file, "size", DECL_SIZE (node), indent + 4);
 381       print_node (file, "unit size", DECL_SIZE_UNIT (node), indent + 4);
 382
 383       if (TREE_CODE (node) != FUNCTION_DECL
 384           || DECL_INLINE (node) || DECL_BUILT_IN (node))
 385         indent_to (file, indent + 3);
 386
 387       if (TREE_CODE (node) != FUNCTION_DECL)
 388         {
 389           if (DECL_USER_ALIGN (node))
 390             fprintf (file, " user");
 391
 392           fprintf (file, " align %d", DECL_ALIGN (node));
 393           if (TREE_CODE (node) == FIELD_DECL)
 394             fprintf (file, " offset_align " HOST_WIDE_INT_PRINT_UNSIGNED,
 395                      DECL_OFFSET_ALIGN (node));
 396         }
 397       else if (DECL_BUILT_IN (node))
 398         {
 399           if (DECL_BUILT_IN_CLASS (node) == BUILT_IN_MD)
 400             fprintf (file, " built-in BUILT_IN_MD %d", DECL_FUNCTION_CODE (node));
 401           else
 402             fprintf (file, " built-in %s:%s",
 403                      built_in_class_names[(int) DECL_BUILT_IN_CLASS (node)],
 404                      built_in_names[(int) DECL_FUNCTION_CODE (node)]);
 405         }
 406
 407       if (DECL_POINTER_ALIAS_SET_KNOWN_P (node))
 408         fprintf (file, " alias set " HOST_WIDE_INT_PRINT_DEC,
 409                  DECL_POINTER_ALIAS_SET (node));
 410
 411       if (TREE_CODE (node) == FIELD_DECL)
 412         {
 413           print_node (file, "offset", DECL_FIELD_OFFSET (node), indent + 4);
 414           print_node (file, "bit offset", DECL_FIELD_BIT_OFFSET (node),
 415                       indent + 4);
 416         }
 417
 418       print_node_brief (file, "context", DECL_CONTEXT (node), indent + 4);
 419       print_node_brief (file, "attributes",
 420                         DECL_ATTRIBUTES (node), indent + 4);
 421       print_node_brief (file, "abstract_origin",
 422                         DECL_ABSTRACT_ORIGIN (node), indent + 4);
 423
 424       print_node (file, "arguments", DECL_ARGUMENTS (node), indent + 4);
 425       print_node (file, "result", DECL_RESULT_FLD (node), indent + 4);
 426       print_node_brief (file, "initial", DECL_INITIAL (node), indent + 4);
 427
 428       lang_hooks.print_decl (file, node, indent);
 429
 430       if (DECL_RTL_SET_P (node))
 431         {
 432           indent_to (file, indent + 4);
 433           print_rtl (file, DECL_RTL (node));
 434         }
 435
 436       if (TREE_CODE (node) == PARM_DECL)
 437         {
 438           print_node (file, "arg-type", DECL_ARG_TYPE (node), indent + 4);
 439           print_node (file, "arg-type-as-written",
 440                       DECL_ARG_TYPE_AS_WRITTEN (node), indent + 4);
 441
 442           if (DECL_INCOMING_RTL (node) != 0)
 443             {
 444               indent_to (file, indent + 4);
 445               fprintf (file, "incoming-rtl ");
 446               print_rtl (file, DECL_INCOMING_RTL (node));
 447             }
 448         }
 449       else if (TREE_CODE (node) == FUNCTION_DECL
 450                && DECL_STRUCT_FUNCTION (node) != 0)
 451         {
 452           indent_to (file, indent + 4);
 453           fprintf (file, "saved-insns " HOST_PTR_PRINTF,
 454                    (void *) DECL_STRUCT_FUNCTION (node));
 455         }
 456
 457       /* Print the decl chain only if decl is at second level.  */
 458       if (indent == 4)
 459         print_node (file, "chain", TREE_CHAIN (node), indent + 4);
 460       else
 461         print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
 462       break;
 463
 464     case 't':
 465       if (TYPE_UNSIGNED (node))
 466         fputs (" unsigned", file);
 467
 468       /* The no-force-blk flag is used for different things in
 469          different types.  */
 470       if ((TREE_CODE (node) == RECORD_TYPE
 471            || TREE_CODE (node) == UNION_TYPE
 472            || TREE_CODE (node) == QUAL_UNION_TYPE)
 473           && TYPE_NO_FORCE_BLK (node))
 474         fputs (" no-force-blk", file);
 475       else if (TREE_CODE (node) == INTEGER_TYPE
 476                && TYPE_IS_SIZETYPE (node))
 477         fputs (" sizetype", file);
 478       else if (TREE_CODE (node) == FUNCTION_TYPE
 479                && TYPE_RETURNS_STACK_DEPRESSED (node))
 480         fputs (" returns-stack-depressed", file);
 481
 482       if (TYPE_STRING_FLAG (node))
 483         fputs (" string-flag", file);
 484       if (TYPE_NEEDS_CONSTRUCTING (node))
 485         fputs (" needs-constructing", file);
 486
 487       /* The transparent-union flag is used for different things in
 488          different nodes.  */
 489       if (TREE_CODE (node) == UNION_TYPE && TYPE_TRANSPARENT_UNION (node))
 490         fputs (" transparent-union", file);
 491       else if (TREE_CODE (node) == ARRAY_TYPE
 492                && TYPE_NONALIASED_COMPONENT (node))
 493         fputs (" nonaliased-component", file);
 494
 495       if (TYPE_PACKED (node))
 496         fputs (" packed", file);
 497
 498       if (TYPE_RESTRICT (node))
 499         fputs (" restrict", file);
 500
 501       if (TYPE_LANG_FLAG_0 (node))
 502         fputs (" type_0", file);
 503       if (TYPE_LANG_FLAG_1 (node))
 504         fputs (" type_1", file);
 505       if (TYPE_LANG_FLAG_2 (node))
 506         fputs (" type_2", file);
 507       if (TYPE_LANG_FLAG_3 (node))
 508         fputs (" type_3", file);
 509       if (TYPE_LANG_FLAG_4 (node))
 510         fputs (" type_4", file);
 511       if (TYPE_LANG_FLAG_5 (node))
 512         fputs (" type_5", file);
 513       if (TYPE_LANG_FLAG_6 (node))
 514         fputs (" type_6", file);
 515
 516       mode = TYPE_MODE (node);
 517       fprintf (file, " %s", GET_MODE_NAME (mode));
 518
 519       print_node (file, "size", TYPE_SIZE (node), indent + 4);
 520       print_node (file, "unit size", TYPE_SIZE_UNIT (node), indent + 4);
 521       indent_to (file, indent + 3);
 522
 523       if (TYPE_USER_ALIGN (node))
 524         fprintf (file, " user");
 525
 526       fprintf (file, " align %d symtab %d alias set " HOST_WIDE_INT_PRINT_DEC,
 527                TYPE_ALIGN (node), TYPE_SYMTAB_ADDRESS (node),
 528                TYPE_ALIAS_SET (node));
 529
 530       print_node (file, "attributes", TYPE_ATTRIBUTES (node), indent + 4);
 531
 532       if (INTEGRAL_TYPE_P (node) || TREE_CODE (node) == REAL_TYPE)
 533         {
 534           fprintf (file, " precision %d", TYPE_PRECISION (node));
 535           print_node_brief (file, "min", TYPE_MIN_VALUE (node), indent + 4);
 536           print_node_brief (file, "max", TYPE_MAX_VALUE (node), indent + 4);
 537         }
 538
 539       if (TREE_CODE (node) == ENUMERAL_TYPE)
 540         print_node (file, "values", TYPE_VALUES (node), indent + 4);
 541       else if (TREE_CODE (node) == ARRAY_TYPE || TREE_CODE (node) == SET_TYPE)
 542         print_node (file, "domain", TYPE_DOMAIN (node), indent + 4);
 543       else if (TREE_CODE (node) == VECTOR_TYPE)
 544         fprintf (file, " nunits %d", (int) TYPE_VECTOR_SUBPARTS (node));
 545       else if (TREE_CODE (node) == RECORD_TYPE
 546                || TREE_CODE (node) == UNION_TYPE
 547                || TREE_CODE (node) == QUAL_UNION_TYPE)
 548         print_node (file, "fields", TYPE_FIELDS (node), indent + 4);
 549       else if (TREE_CODE (node) == FUNCTION_TYPE
 550                || TREE_CODE (node) == METHOD_TYPE)
 551         {
 552           if (TYPE_METHOD_BASETYPE (node))
 553             print_node_brief (file, "method basetype",
 554                               TYPE_METHOD_BASETYPE (node), indent + 4);
 555           print_node (file, "arg-types", TYPE_ARG_TYPES (node), indent + 4);
 556         }
 557       else if (TREE_CODE (node) == OFFSET_TYPE)
 558         print_node_brief (file, "basetype", TYPE_OFFSET_BASETYPE (node),
 559                           indent + 4);
 560
 561       if (TYPE_CONTEXT (node))
 562         print_node_brief (file, "context", TYPE_CONTEXT (node), indent + 4);
 563
 564       lang_hooks.print_type (file, node, indent);
 565
 566       if (TYPE_POINTER_TO (node) || TREE_CHAIN (node))
 567         indent_to (file, indent + 3);
 568
 569       print_node_brief (file, "pointer_to_this", TYPE_POINTER_TO (node),
 570                         indent + 4);
 571       print_node_brief (file, "reference_to_this", TYPE_REFERENCE_TO (node),
 572                         indent + 4);
 573       print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
 574       break;
 575
 576     case 'e':
 577     case '<':
 578     case '1':
 579     case '2':
 580     case 'r':
 581     case 's':
 582       if (TREE_CODE (node) == BIT_FIELD_REF && BIT_FIELD_REF_UNSIGNED (node))
 583         fputs (" unsigned", file);
 584       if (TREE_CODE (node) == BIND_EXPR)
 585         {
 586           print_node (file, "vars", TREE_OPERAND (node, 0), indent + 4);
 587           print_node (file, "body", TREE_OPERAND (node, 1), indent + 4);
 588           print_node (file, "block", TREE_OPERAND (node, 2), indent + 4);
 589           break;
 590         }
 591
 592       len = TREE_CODE_LENGTH (TREE_CODE (node));
 593
 594       /* Some nodes contain rtx's, not trees,
 595          after a certain point.  Print the rtx's as rtx's.  */
 596       first_rtl = first_rtl_op (TREE_CODE (node));
 597
 598       for (i = 0; i < len; i++)
 599         {
 600           if (i >= first_rtl)
 601             {
 602               indent_to (file, indent + 4);
 603               fprintf (file, "rtl %d ", i);
 604               if (TREE_OPERAND (node, i))
 605                 print_rtl (file, (rtx) TREE_OPERAND (node, i));
 606               else
 607                 fprintf (file, "(nil)");
 608               fprintf (file, "\n");
 609             }
 610           else
 611             {
 612               char temp[10];
 613
 614               sprintf (temp, "arg %d", i);
 615               print_node (file, temp, TREE_OPERAND (node, i), indent + 4);
 616             }
 617         }
 618
 619       print_node (file, "chain", TREE_CHAIN (node), indent + 4);
 620       break;
 621
 622     case 'c':
 623     case 'x':
 624       switch (TREE_CODE (node))
 625         {
 626         case INTEGER_CST:
 627           if (TREE_CONSTANT_OVERFLOW (node))
 628             fprintf (file, " overflow");
 629
 630           fprintf (file, " ");
 631           if (TREE_INT_CST_HIGH (node) == 0)
 632             fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
 633                      TREE_INT_CST_LOW (node));
 634           else if (TREE_INT_CST_HIGH (node) == -1
 635                    && TREE_INT_CST_LOW (node) != 0)
 636             fprintf (file, "-" HOST_WIDE_INT_PRINT_UNSIGNED,
 637                      -TREE_INT_CST_LOW (node));
 638           else
 639             fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
 640                      TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
 641           break;
 642
 643         case REAL_CST:
 644           {
 645             REAL_VALUE_TYPE d;
 646
 647             if (TREE_OVERFLOW (node))
 648               fprintf (file, " overflow");
 649
 650             d = TREE_REAL_CST (node);
 651             if (REAL_VALUE_ISINF (d))
 652               fprintf (file, " Inf");
 653             else if (REAL_VALUE_ISNAN (d))
 654               fprintf (file, " Nan");
 655             else
 656               {
 657                 char string[64];
 658                 real_to_decimal (string, &d, sizeof (string), 0, 1);
 659                 fprintf (file, " %s", string);
 660               }
 661           }
 662           break;
 663
 664         case VECTOR_CST:
 665           {
 666             tree vals = TREE_VECTOR_CST_ELTS (node);
 667             char buf[10];
 668             tree link;
 669             int i;
 670
 671             i = 0;
 672             for (link = vals; link; link = TREE_CHAIN (link), ++i)
 673               {
 674                 sprintf (buf, "elt%d: ", i);
 675                 print_node (file, buf, TREE_VALUE (link), indent + 4);
 676               }
 677           }
 678           break;
 679
 680         case COMPLEX_CST:
 681           print_node (file, "real", TREE_REALPART (node), indent + 4);
 682           print_node (file, "imag", TREE_IMAGPART (node), indent + 4);
 683           break;
 684
 685         case STRING_CST:
 686           {
 687             const char *p = TREE_STRING_POINTER (node);
 688             int i = TREE_STRING_LENGTH (node);
 689             fputs (" \"", file);
 690             while (--i >= 0)
 691               {
 692                 char ch = *p++;
 693                 if (ch >= ' ' && ch < 127)
 694                   putc (ch, file);
 695                 else
 696                   fprintf(file, "\\%03o", ch & 0xFF);
 697               }
 698             fputc ('\"', file);
 699           }
 700           /* Print the chain at second level.  */
 701           if (indent == 4)
 702             print_node (file, "chain", TREE_CHAIN (node), indent + 4);
 703           else
 704             print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
 705           break;
 706
 707         case IDENTIFIER_NODE:
 708           lang_hooks.print_identifier (file, node, indent);
 709           break;
 710
 711         case TREE_LIST:
 712           print_node (file, "purpose", TREE_PURPOSE (node), indent + 4);
 713           print_node (file, "value", TREE_VALUE (node), indent + 4);
 714           print_node (file, "chain", TREE_CHAIN (node), indent + 4);
 715           break;
 716
 717         case TREE_VEC:
 718           len = TREE_VEC_LENGTH (node);
 719           for (i = 0; i < len; i++)
 720             if (TREE_VEC_ELT (node, i))
 721               {
 722                 char temp[10];
 723                 sprintf (temp, "elt %d", i);
 724                 indent_to (file, indent + 4);
 725                 print_node_brief (file, temp, TREE_VEC_ELT (node, i), 0);
 726               }
 727           break;
 728
 729         case BLOCK:
 730           print_node (file, "vars", BLOCK_VARS (node), indent + 4);
 731           print_node (file, "supercontext", BLOCK_SUPERCONTEXT (node),
 732                       indent + 4);
 733           print_node (file, "subblocks", BLOCK_SUBBLOCKS (node), indent + 4);
 734           print_node (file, "chain", BLOCK_CHAIN (node), indent + 4);
 735           print_node (file, "abstract_origin",
 736                       BLOCK_ABSTRACT_ORIGIN (node), indent + 4);
 737           break;
 738
 739         case SSA_NAME:
 740           print_node_brief (file, "var", SSA_NAME_VAR (node), indent + 4);
 741           print_node_brief (file, "def_stmt",
 742                             SSA_NAME_DEF_STMT (node), indent + 4);
 743
 744           indent_to (file, indent + 4);
 745           fprintf (file, "version %u", SSA_NAME_VERSION (node));
 746           if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (node))
 747             fprintf (file, " in-abnormal-phi");
 748           if (SSA_NAME_IN_FREE_LIST (node))
 749             fprintf (file, " in-free-list");
 750
 751           if (SSA_NAME_PTR_INFO (node)
 752               || SSA_NAME_VALUE (node)
 753               || SSA_NAME_AUX (node))
 754             {
 755               indent_to (file, indent + 3);
 756               if (SSA_NAME_PTR_INFO (node))
 757                 fprintf (file, " ptr-info %p",
 758                          (void *) SSA_NAME_PTR_INFO (node));
 759               if (SSA_NAME_VALUE (node))
 760                 fprintf (file, " value %p",
 761                          (void *) SSA_NAME_VALUE (node));
 762               if (SSA_NAME_AUX (node))
 763                 fprintf (file, " aux %p", SSA_NAME_AUX (node));
 764             }
 765           break;
 766
 767         default:
 768           if (TREE_CODE_CLASS (TREE_CODE (node)) == 'x')
 769             lang_hooks.print_xnode (file, node, indent);
 770           break;
 771         }
 772
 773       break;
 774     }
 775
 776   if (EXPR_HAS_LOCATION (node))
 777     {
 778       expanded_location xloc = expand_location (EXPR_LOCATION (node));
 779       indent_to (file, indent+4);
 780       fprintf (file, "%s:%d", xloc.file, xloc.line);
 781     }
 782
 783   fprintf (file, ">");
 784 }