gcc/print-tree.c

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