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 "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 (node)
  51      tree node;
  52 {
  53   table = (struct bucket **) xcalloc (HASH_SIZE, sizeof (struct bucket *));
  54   print_node (stderr, "", node, 0);
  55   table = 0;
  56   fprintf (stderr, "\n");
  57 }
  58
  59 /* Print a node in brief fashion, with just the code, address and name.  */
  60
  61 void
  62 print_node_brief (file, prefix, node, indent)
  63      FILE *file;
  64      const char *prefix;
  65      tree node;
  66      int indent;
  67 {
  68   char class;
  69
  70   if (node == 0)
  71     return;
  72
  73   class = TREE_CODE_CLASS (TREE_CODE (node));
  74
  75   /* Always print the slot this node is in, and its code, address and
  76      name if any.  */
  77   if (indent > 0)
  78     fprintf (file, " ");
  79   fprintf (file, "%s <%s ", prefix, tree_code_name[(int) TREE_CODE (node)]);
  80   fprintf (file, HOST_PTR_PRINTF, (char *) node);
  81
  82   if (class == 'd')
  83     {
  84       if (DECL_NAME (node))
  85         fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
  86     }
  87   else if (class == 't')
  88     {
  89       if (TYPE_NAME (node))
  90         {
  91           if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
  92             fprintf (file, " %s", IDENTIFIER_POINTER (TYPE_NAME (node)));
  93           else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
  94                    && DECL_NAME (TYPE_NAME (node)))
  95             fprintf (file, " %s",
  96                      IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node))));
  97         }
  98     }
  99   if (TREE_CODE (node) == IDENTIFIER_NODE)
 100     fprintf (file, " %s", IDENTIFIER_POINTER (node));
 101
 102   /* We might as well always print the value of an integer or real.  */
 103   if (TREE_CODE (node) == INTEGER_CST)
 104     {
 105       if (TREE_CONSTANT_OVERFLOW (node))
 106         fprintf (file, " overflow");
 107
 108       fprintf (file, " ");
 109       if (TREE_INT_CST_HIGH (node) == 0)
 110         fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED, TREE_INT_CST_LOW (node));
 111       else if (TREE_INT_CST_HIGH (node) == -1
 112                && TREE_INT_CST_LOW (node) != 0)
 113         {
 114           fprintf (file, "-");
 115           fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
 116                    -TREE_INT_CST_LOW (node));
 117         }
 118       else
 119         fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
 120                  TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
 121     }
 122   if (TREE_CODE (node) == REAL_CST)
 123     {
 124       REAL_VALUE_TYPE d;
 125
 126       if (TREE_OVERFLOW (node))
 127         fprintf (file, " overflow");
 128
 129       d = TREE_REAL_CST (node);
 130       if (REAL_VALUE_ISINF (d))
 131         fprintf (file, " Inf");
 132       else if (REAL_VALUE_ISNAN (d))
 133         fprintf (file, " Nan");
 134       else
 135         {
 136           char string[60];
 137           real_to_decimal (string, &d, sizeof (string), 0, 1);
 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 fields 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 *) xmalloc (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 && DID_INLINE_FUNC (node))
 334         fputs (" autoinline", file);
 335       else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INLINE (node))
 336         fputs (" inline", file);
 337       if (TREE_CODE (node) == FUNCTION_DECL && DECL_BUILT_IN (node))
 338         fputs (" built-in", file);
 339       if (TREE_CODE (node) == FUNCTION_DECL && DECL_BUILT_IN_NONANSI (node))
 340         fputs (" built-in-nonansi", file);
 341       if (TREE_CODE (node) == FUNCTION_DECL && DECL_NO_STATIC_CHAIN (node))
 342         fputs (" no-static-chain", file);
 343
 344       if (TREE_CODE (node) == FIELD_DECL && DECL_PACKED (node))
 345         fputs (" packed", file);
 346       if (TREE_CODE (node) == FIELD_DECL && DECL_BIT_FIELD (node))
 347         fputs (" bit-field", file);
 348       if (TREE_CODE (node) == FIELD_DECL && DECL_NONADDRESSABLE_P (node))
 349         fputs (" nonaddressable", file);
 350
 351       if (TREE_CODE (node) == LABEL_DECL && DECL_TOO_LATE (node))
 352         fputs (" too-late", file);
 353       if (TREE_CODE (node) == LABEL_DECL && DECL_ERROR_ISSUED (node))
 354         fputs (" error-issued", file);
 355
 356       if (TREE_CODE (node) == VAR_DECL && DECL_IN_TEXT_SECTION (node))
 357         fputs (" in-text-section", file);
 358       if (TREE_CODE (node) == VAR_DECL && DECL_THREAD_LOCAL (node))
 359         fputs (" thread-local", file);
 360
 361       if (TREE_CODE (node) == PARM_DECL && DECL_TRANSPARENT_UNION (node))
 362         fputs (" transparent-union", file);
 363
 364       if (DECL_VIRTUAL_P (node))
 365         fputs (" virtual", file);
 366       if (DECL_DEFER_OUTPUT (node))
 367         fputs (" defer-output", file);
 368
 369       if (DECL_LANG_FLAG_0 (node))
 370         fputs (" decl_0", file);
 371       if (DECL_LANG_FLAG_1 (node))
 372         fputs (" decl_1", file);
 373       if (DECL_LANG_FLAG_2 (node))
 374         fputs (" decl_2", file);
 375       if (DECL_LANG_FLAG_3 (node))
 376         fputs (" decl_3", file);
 377       if (DECL_LANG_FLAG_4 (node))
 378         fputs (" decl_4", file);
 379       if (DECL_LANG_FLAG_5 (node))
 380         fputs (" decl_5", file);
 381       if (DECL_LANG_FLAG_6 (node))
 382         fputs (" decl_6", file);
 383       if (DECL_LANG_FLAG_7 (node))
 384         fputs (" decl_7", file);
 385
 386       fprintf (file, " %s", GET_MODE_NAME (mode));
 387       fprintf (file, " file %s line %d",
 388                DECL_SOURCE_FILE (node), DECL_SOURCE_LINE (node));
 389
 390       print_node (file, "size", DECL_SIZE (node), indent + 4);
 391       print_node (file, "unit size", DECL_SIZE_UNIT (node), indent + 4);
 392
 393       if (TREE_CODE (node) != FUNCTION_DECL
 394           || DECL_INLINE (node) || DECL_BUILT_IN (node))
 395         indent_to (file, indent + 3);
 396
 397       if (TREE_CODE (node) != FUNCTION_DECL)
 398         {
 399           if (DECL_USER_ALIGN (node))
 400             fprintf (file, " user");
 401
 402           fprintf (file, " align %d", DECL_ALIGN (node));
 403           if (TREE_CODE (node) == FIELD_DECL)
 404             {
 405               fprintf (file, " offset_align ");
 406               fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
 407                        DECL_OFFSET_ALIGN (node));
 408             }
 409         }
 410       else if (DECL_BUILT_IN (node))
 411         {
 412           if (DECL_BUILT_IN_CLASS (node) == BUILT_IN_MD)
 413             fprintf (file, " built-in BUILT_IN_MD %d", DECL_FUNCTION_CODE (node));
 414           else
 415             fprintf (file, " built-in %s:%s",
 416                      built_in_class_names[(int) DECL_BUILT_IN_CLASS (node)],
 417                      built_in_names[(int) DECL_FUNCTION_CODE (node)]);
 418         }
 419
 420       if (DECL_POINTER_ALIAS_SET_KNOWN_P (node))
 421         {
 422           fprintf (file, " alias set ");
 423           fprintf (file, HOST_WIDE_INT_PRINT_DEC,
 424                    DECL_POINTER_ALIAS_SET (node));
 425         }
 426
 427       if (TREE_CODE (node) == FIELD_DECL)
 428         {
 429           print_node (file, "offset", DECL_FIELD_OFFSET (node), indent + 4);
 430           print_node (file, "bit offset", DECL_FIELD_BIT_OFFSET (node),
 431                       indent + 4);
 432         }
 433
 434       print_node_brief (file, "context", DECL_CONTEXT (node), indent + 4);
 435       print_node_brief (file, "attributes",
 436                         DECL_ATTRIBUTES (node), indent + 4);
 437       print_node_brief (file, "abstract_origin",
 438                         DECL_ABSTRACT_ORIGIN (node), indent + 4);
 439
 440       print_node (file, "arguments", DECL_ARGUMENTS (node), indent + 4);
 441       print_node (file, "result", DECL_RESULT_FLD (node), indent + 4);
 442       print_node_brief (file, "initial", DECL_INITIAL (node), indent + 4);
 443
 444       (*lang_hooks.print_decl) (file, node, indent);
 445
 446       if (DECL_RTL_SET_P (node))
 447         {
 448           indent_to (file, indent + 4);
 449           print_rtl (file, DECL_RTL (node));
 450         }
 451
 452       if (TREE_CODE (node) == PARM_DECL)
 453         {
 454           print_node (file, "arg-type", DECL_ARG_TYPE (node), indent + 4);
 455           print_node (file, "arg-type-as-written",
 456                       DECL_ARG_TYPE_AS_WRITTEN (node), indent + 4);
 457
 458           if (DECL_INCOMING_RTL (node) != 0)
 459             {
 460               indent_to (file, indent + 4);
 461               fprintf (file, "incoming-rtl ");
 462               print_rtl (file, DECL_INCOMING_RTL (node));
 463             }
 464         }
 465       else if (TREE_CODE (node) == FUNCTION_DECL
 466                && DECL_SAVED_INSNS (node) != 0)
 467         {
 468           indent_to (file, indent + 4);
 469           fprintf (file, "saved-insns ");
 470           fprintf (file, HOST_PTR_PRINTF, (char *) DECL_SAVED_INSNS (node));
 471         }
 472
 473       /* Print the decl chain only if decl is at second level.  */
 474       if (indent == 4)
 475         print_node (file, "chain", TREE_CHAIN (node), indent + 4);
 476       else
 477         print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
 478       break;
 479
 480     case 't':
 481       /* The no-force-blk flag is used for different things in
 482          different types.  */
 483       if ((TREE_CODE (node) == RECORD_TYPE
 484            || TREE_CODE (node) == UNION_TYPE
 485            || TREE_CODE (node) == QUAL_UNION_TYPE)
 486           && TYPE_NO_FORCE_BLK (node))
 487         fputs (" no-force-blk", file);
 488       else if (TREE_CODE (node) == INTEGER_TYPE
 489                && TYPE_IS_SIZETYPE (node))
 490         fputs (" sizetype", file);
 491       else if (TREE_CODE (node) == FUNCTION_TYPE
 492                && TYPE_RETURNS_STACK_DEPRESSED (node))
 493         fputs (" returns-stack-depressed", file);
 494
 495       if (TYPE_STRING_FLAG (node))
 496         fputs (" string-flag", file);
 497       if (TYPE_NEEDS_CONSTRUCTING (node))
 498         fputs (" needs-constructing", file);
 499
 500       /* The transparent-union flag is used for different things in
 501          different nodes.  */
 502       if (TREE_CODE (node) == UNION_TYPE && TYPE_TRANSPARENT_UNION (node))
 503         fputs (" transparent-union", file);
 504       else if (TREE_CODE (node) == ARRAY_TYPE
 505                && TYPE_NONALIASED_COMPONENT (node))
 506         fputs (" nonaliased-component", file);
 507       else if (TREE_CODE (node) == FUNCTION_TYPE
 508                && TYPE_AMBIENT_BOUNDEDNESS (node))
 509         fputs (" ambient-boundedness", file);
 510
 511       if (TYPE_PACKED (node))
 512         fputs (" packed", file);
 513
 514       if (TYPE_RESTRICT (node))
 515         fputs (" restrict", file);
 516
 517       if (TYPE_LANG_FLAG_0 (node))
 518         fputs (" type_0", file);
 519       if (TYPE_LANG_FLAG_1 (node))
 520         fputs (" type_1", file);
 521       if (TYPE_LANG_FLAG_2 (node))
 522         fputs (" type_2", file);
 523       if (TYPE_LANG_FLAG_3 (node))
 524         fputs (" type_3", file);
 525       if (TYPE_LANG_FLAG_4 (node))
 526         fputs (" type_4", file);
 527       if (TYPE_LANG_FLAG_5 (node))
 528         fputs (" type_5", file);
 529       if (TYPE_LANG_FLAG_6 (node))
 530         fputs (" type_6", file);
 531
 532       mode = TYPE_MODE (node);
 533       fprintf (file, " %s", GET_MODE_NAME (mode));
 534
 535       print_node (file, "size", TYPE_SIZE (node), indent + 4);
 536       print_node (file, "unit size", TYPE_SIZE_UNIT (node), indent + 4);
 537       indent_to (file, indent + 3);
 538
 539       if (TYPE_USER_ALIGN (node))
 540         fprintf (file, " user");
 541
 542       fprintf (file, " align %d", TYPE_ALIGN (node));
 543       fprintf (file, " symtab %d", TYPE_SYMTAB_ADDRESS (node));
 544       fprintf (file, " alias set ");
 545       fprintf (file, HOST_WIDE_INT_PRINT_DEC, TYPE_ALIAS_SET (node));
 546
 547       print_node (file, "attributes", TYPE_ATTRIBUTES (node), indent + 4);
 548
 549       if (INTEGRAL_TYPE_P (node) || TREE_CODE (node) == REAL_TYPE)
 550         {
 551           fprintf (file, " precision %d", TYPE_PRECISION (node));
 552           print_node_brief (file, "min", TYPE_MIN_VALUE (node), indent + 4);
 553           print_node_brief (file, "max", TYPE_MAX_VALUE (node), indent + 4);
 554         }
 555
 556       if (TREE_CODE (node) == ENUMERAL_TYPE)
 557         print_node (file, "values", TYPE_VALUES (node), indent + 4);
 558       else if (TREE_CODE (node) == ARRAY_TYPE || TREE_CODE (node) == SET_TYPE)
 559         print_node (file, "domain", TYPE_DOMAIN (node), indent + 4);
 560       else if (TREE_CODE (node) == RECORD_TYPE
 561                || TREE_CODE (node) == UNION_TYPE
 562                || TREE_CODE (node) == QUAL_UNION_TYPE)
 563         print_node (file, "fields", TYPE_FIELDS (node), indent + 4);
 564       else if (TREE_CODE (node) == FUNCTION_TYPE
 565                || TREE_CODE (node) == METHOD_TYPE)
 566         {
 567           if (TYPE_METHOD_BASETYPE (node))
 568             print_node_brief (file, "method basetype",
 569                               TYPE_METHOD_BASETYPE (node), indent + 4);
 570           print_node (file, "arg-types", TYPE_ARG_TYPES (node), indent + 4);
 571         }
 572       else if (TREE_CODE (node) == OFFSET_TYPE)
 573         print_node_brief (file, "basetype", TYPE_OFFSET_BASETYPE (node),
 574                           indent + 4);
 575
 576       if (TYPE_CONTEXT (node))
 577         print_node_brief (file, "context", TYPE_CONTEXT (node), indent + 4);
 578
 579       (*lang_hooks.print_type) (file, node, indent);
 580
 581       if (TYPE_POINTER_TO (node) || TREE_CHAIN (node))
 582         indent_to (file, indent + 3);
 583
 584       print_node_brief (file, "pointer_to_this", TYPE_POINTER_TO (node),
 585                         indent + 4);
 586       print_node_brief (file, "reference_to_this", TYPE_REFERENCE_TO (node),
 587                         indent + 4);
 588       print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
 589       break;
 590
 591     case 'b':
 592       print_node (file, "vars", BLOCK_VARS (node), indent + 4);
 593       print_node (file, "supercontext", BLOCK_SUPERCONTEXT (node), indent + 4);
 594       print_node (file, "subblocks", BLOCK_SUBBLOCKS (node), indent + 4);
 595       print_node (file, "chain", BLOCK_CHAIN (node), indent + 4);
 596       print_node (file, "abstract_origin",
 597                   BLOCK_ABSTRACT_ORIGIN (node), indent + 4);
 598       break;
 599
 600     case 'e':
 601     case '<':
 602     case '1':
 603     case '2':
 604     case 'r':
 605     case 's':
 606       if (TREE_CODE (node) == BIND_EXPR)
 607         {
 608           print_node (file, "vars", TREE_OPERAND (node, 0), indent + 4);
 609           print_node (file, "body", TREE_OPERAND (node, 1), indent + 4);
 610           print_node (file, "block", TREE_OPERAND (node, 2), indent + 4);
 611           break;
 612         }
 613
 614       len = TREE_CODE_LENGTH (TREE_CODE (node));
 615
 616       /* Some nodes contain rtx's, not trees,
 617          after a certain point.  Print the rtx's as rtx's.  */
 618       first_rtl = first_rtl_op (TREE_CODE (node));
 619
 620       for (i = 0; i < len; i++)
 621         {
 622           if (i >= first_rtl)
 623             {
 624               indent_to (file, indent + 4);
 625               fprintf (file, "rtl %d ", i);
 626               if (TREE_OPERAND (node, i))
 627                 print_rtl (file, (struct rtx_def *) TREE_OPERAND (node, i));
 628               else
 629                 fprintf (file, "(nil)");
 630               fprintf (file, "\n");
 631             }
 632           else
 633             {
 634               char temp[10];
 635
 636               sprintf (temp, "arg %d", i);
 637               print_node (file, temp, TREE_OPERAND (node, i), indent + 4);
 638             }
 639         }
 640
 641       if (TREE_CODE (node) == EXPR_WITH_FILE_LOCATION)
 642         {
 643           indent_to (file, indent+4);
 644           fprintf (file, "%s:%d:%d",
 645                    (EXPR_WFL_FILENAME_NODE (node ) ?
 646                     EXPR_WFL_FILENAME (node) : "(no file info)"),
 647                    EXPR_WFL_LINENO (node), EXPR_WFL_COLNO (node));
 648         }
 649       print_node (file, "chain", TREE_CHAIN (node), indent + 4);
 650       break;
 651
 652     case 'c':
 653     case 'x':
 654       switch (TREE_CODE (node))
 655         {
 656         case INTEGER_CST:
 657           if (TREE_CONSTANT_OVERFLOW (node))
 658             fprintf (file, " overflow");
 659
 660           fprintf (file, " ");
 661           if (TREE_INT_CST_HIGH (node) == 0)
 662             fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
 663                      TREE_INT_CST_LOW (node));
 664           else if (TREE_INT_CST_HIGH (node) == -1
 665                    && TREE_INT_CST_LOW (node) != 0)
 666             {
 667               fprintf (file, "-");
 668               fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
 669                        -TREE_INT_CST_LOW (node));
 670             }
 671           else
 672             fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
 673                      TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
 674           break;
 675
 676         case REAL_CST:
 677           {
 678             REAL_VALUE_TYPE d;
 679
 680             if (TREE_OVERFLOW (node))
 681               fprintf (file, " overflow");
 682
 683             d = TREE_REAL_CST (node);
 684             if (REAL_VALUE_ISINF (d))
 685               fprintf (file, " Inf");
 686             else if (REAL_VALUE_ISNAN (d))
 687               fprintf (file, " Nan");
 688             else
 689               {
 690                 char string[64];
 691                 real_to_decimal (string, &d, sizeof (string), 0, 1);
 692                 fprintf (file, " %s", string);
 693               }
 694           }
 695           break;
 696
 697         case VECTOR_CST:
 698           {
 699             tree vals = TREE_VECTOR_CST_ELTS (node);
 700             char buf[10];
 701             tree link;
 702             int i;
 703
 704             i = 0;
 705             for (link = vals; link; link = TREE_CHAIN (link), ++i)
 706               {
 707                 sprintf (buf, "elt%d: ", i);
 708                 print_node (file, buf, TREE_VALUE (link), indent + 4);
 709               }
 710           }
 711           break;
 712
 713         case COMPLEX_CST:
 714           print_node (file, "real", TREE_REALPART (node), indent + 4);
 715           print_node (file, "imag", TREE_IMAGPART (node), indent + 4);
 716           break;
 717
 718         case STRING_CST:
 719           {
 720             const char *p = TREE_STRING_POINTER (node);
 721             int i = TREE_STRING_LENGTH (node);
 722             fputs (" \"", file);
 723             while (--i >= 0)
 724               {
 725                 char ch = *p++;
 726                 if (ch >= ' ' && ch < 127)
 727                   putc (ch, file);
 728                 else
 729                   fprintf(file, "\\%03o", ch & 0xFF);
 730               }
 731             fputc ('\"', file);
 732           }
 733           /* Print the chain at second level.  */
 734           if (indent == 4)
 735             print_node (file, "chain", TREE_CHAIN (node), indent + 4);
 736           else
 737             print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
 738           break;
 739
 740         case IDENTIFIER_NODE:
 741           (*lang_hooks.print_identifier) (file, node, indent);
 742           break;
 743
 744         case TREE_LIST:
 745           print_node (file, "purpose", TREE_PURPOSE (node), indent + 4);
 746           print_node (file, "value", TREE_VALUE (node), indent + 4);
 747           print_node (file, "chain", TREE_CHAIN (node), indent + 4);
 748           break;
 749
 750         case TREE_VEC:
 751           len = TREE_VEC_LENGTH (node);
 752           for (i = 0; i < len; i++)
 753             if (TREE_VEC_ELT (node, i))
 754               {
 755                 char temp[10];
 756                 sprintf (temp, "elt %d", i);
 757                 indent_to (file, indent + 4);
 758                 print_node_brief (file, temp, TREE_VEC_ELT (node, i), 0);
 759               }
 760           break;
 761
 762         default:
 763           if (TREE_CODE_CLASS (TREE_CODE (node)) == 'x')
 764             (*lang_hooks.print_xnode) (file, node, indent);
 765           break;
 766         }
 767
 768       break;
 769     }
 770
 771   fprintf (file, ">");
 772 }