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