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