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