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