gcc/print-tree.c

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