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 /* Define the hash table of nodes already seen.
  28    Such nodes are not repeated; brief cross-references are used.  */
  29
  30 #define HASH_SIZE 37
  31
  32 struct bucket
  33 {
  34   tree node;
  35   struct bucket *next;
  36 };
  37
  38 static struct bucket **table;
  39
  40 /* Print the node NODE on standard error, for debugging.
  41    Most nodes referred to by this one are printed recursively
  42    down to a depth of six.  */
  43
  44 void
  45 debug_tree (node)
  46      tree node;
  47 {
  48   char *object = (char *) oballoc (0);
  49
  50   table = (struct bucket **) oballoc (HASH_SIZE * sizeof (struct bucket *));
  51   bzero ((char *) table, HASH_SIZE * sizeof (struct bucket *));
  52   print_node (stderr, "", node, 0);
  53   table = 0;
  54   obfree (object);
  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   /* We might as well always print the value of an integer.  */
 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 *) oballoc (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       if (!ggc_p)
 271         print_obstack_name ((char *) node, file, "");
 272       indent_to (file, indent + 3);
 273     }
 274
 275   /* If a permanent object is in the wrong obstack, or the reverse, warn.  */
 276   if (!ggc_p && object_permanent_p (node) != TREE_PERMANENT (node))
 277     {
 278       if (TREE_PERMANENT (node))
 279         fputs (" !!permanent object in non-permanent obstack!!", file);
 280       else
 281         fputs (" !!non-permanent object in permanent obstack!!", file);
 282       indent_to (file, indent + 3);
 283     }
 284
 285   if (TREE_SIDE_EFFECTS (node))
 286     fputs (" side-effects", file);
 287   if (TREE_READONLY (node))
 288     fputs (" readonly", file);
 289   if (TREE_CONSTANT (node))
 290     fputs (" constant", file);
 291   if (TREE_ADDRESSABLE (node))
 292     fputs (" addressable", file);
 293   if (TREE_THIS_VOLATILE (node))
 294     fputs (" volatile", file);
 295   if (TREE_UNSIGNED (node))
 296     fputs (" unsigned", file);
 297   if (TREE_ASM_WRITTEN (node))
 298     fputs (" asm_written", file);
 299   if (TREE_USED (node))
 300     fputs (" used", file);
 301   if (TREE_RAISES (node))
 302     fputs (" raises", file);
 303   if (TREE_PERMANENT (node))
 304     fputs (" permanent", file);
 305   if (TREE_PUBLIC (node))
 306     fputs (" public", file);
 307   if (TREE_PRIVATE (node))
 308     fputs (" private", file);
 309   if (TREE_PROTECTED (node))
 310     fputs (" protected", file);
 311   if (TREE_STATIC (node))
 312     fputs (" static", file);
 313   if (TREE_LANG_FLAG_0 (node))
 314     fputs (" tree_0", file);
 315   if (TREE_LANG_FLAG_1 (node))
 316     fputs (" tree_1", file);
 317   if (TREE_LANG_FLAG_2 (node))
 318     fputs (" tree_2", file);
 319   if (TREE_LANG_FLAG_3 (node))
 320     fputs (" tree_3", file);
 321   if (TREE_LANG_FLAG_4 (node))
 322     fputs (" tree_4", file);
 323   if (TREE_LANG_FLAG_5 (node))
 324     fputs (" tree_5", file);
 325   if (TREE_LANG_FLAG_6 (node))
 326     fputs (" tree_6", file);
 327
 328   /* DECL_ nodes have additional attributes.  */
 329
 330   switch (TREE_CODE_CLASS (TREE_CODE (node)))
 331     {
 332     case 'd':
 333       mode = DECL_MODE (node);
 334
 335       if (DECL_IGNORED_P (node))
 336         fputs (" ignored", file);
 337       if (DECL_ABSTRACT (node))
 338         fputs (" abstract", file);
 339       if (DECL_IN_SYSTEM_HEADER (node))
 340         fputs (" in_system_header", file);
 341       if (DECL_COMMON (node))
 342         fputs (" common", file);
 343       if (DECL_EXTERNAL (node))
 344         fputs (" external", file);
 345       if (DECL_REGISTER (node))
 346         fputs (" regdecl", file);
 347       if (DECL_PACKED (node))
 348         fputs (" packed", file);
 349       if (DECL_NONLOCAL (node))
 350         fputs (" nonlocal", file);
 351       if (DECL_INLINE (node))
 352         fputs (" inline", file);
 353
 354       if (TREE_CODE (node) == TYPE_DECL && TYPE_DECL_SUPPRESS_DEBUG (node))
 355         fputs (" suppress-debug", file);
 356
 357       if (TREE_CODE (node) == FUNCTION_DECL && DECL_BUILT_IN (node))
 358         fputs (" built-in", file);
 359       if (TREE_CODE (node) == FUNCTION_DECL && DECL_BUILT_IN_NONANSI (node))
 360         fputs (" built-in-nonansi", file);
 361
 362       if (TREE_CODE (node) == FIELD_DECL && DECL_BIT_FIELD (node))
 363         fputs (" bit-field", file);
 364       if (TREE_CODE (node) == LABEL_DECL && DECL_TOO_LATE (node))
 365         fputs (" too-late", file);
 366       if (TREE_CODE (node) == VAR_DECL && DECL_IN_TEXT_SECTION (node))
 367         fputs (" in-text-section", file);
 368
 369       if (DECL_VIRTUAL_P (node))
 370         fputs (" virtual", file);
 371       if (DECL_DEFER_OUTPUT (node))
 372         fputs (" defer-output", file);
 373       if (DECL_TRANSPARENT_UNION (node))
 374         fputs (" transparent-union", file);
 375
 376       if (DECL_LANG_FLAG_0 (node))
 377         fputs (" decl_0", file);
 378       if (DECL_LANG_FLAG_1 (node))
 379         fputs (" decl_1", file);
 380       if (DECL_LANG_FLAG_2 (node))
 381         fputs (" decl_2", file);
 382       if (DECL_LANG_FLAG_3 (node))
 383         fputs (" decl_3", file);
 384       if (DECL_LANG_FLAG_4 (node))
 385         fputs (" decl_4", file);
 386       if (DECL_LANG_FLAG_5 (node))
 387         fputs (" decl_5", file);
 388       if (DECL_LANG_FLAG_6 (node))
 389         fputs (" decl_6", file);
 390       if (DECL_LANG_FLAG_7 (node))
 391         fputs (" decl_7", file);
 392
 393       fprintf (file, " %s", GET_MODE_NAME(mode));
 394
 395       fprintf (file, " file %s line %d",
 396                DECL_SOURCE_FILE (node), DECL_SOURCE_LINE (node));
 397
 398       print_node (file, "size", DECL_SIZE (node), indent + 4);
 399       indent_to (file, indent + 3);
 400       if (TREE_CODE (node) != FUNCTION_DECL)
 401         fprintf (file, " align %d", DECL_ALIGN (node));
 402       else if (DECL_INLINE (node))
 403         fprintf (file, " frame_size %d", DECL_FRAME_SIZE (node));
 404       else if (DECL_BUILT_IN (node))
 405         fprintf (file, " built-in code %d", DECL_FUNCTION_CODE (node));
 406       if (TREE_CODE (node) == FIELD_DECL)
 407         print_node (file, "bitpos", DECL_FIELD_BITPOS (node), indent + 4);
 408       if (DECL_POINTER_ALIAS_SET_KNOWN_P (node))
 409         fprintf (file, " alias set %d", DECL_POINTER_ALIAS_SET (node));
 410       print_node_brief (file, "context", DECL_CONTEXT (node), indent + 4);
 411       print_node_brief (file, "machine_attributes", DECL_MACHINE_ATTRIBUTES (node), indent + 4);
 412       print_node_brief (file, "abstract_origin",
 413                         DECL_ABSTRACT_ORIGIN (node), indent + 4);
 414
 415       print_node (file, "arguments", DECL_ARGUMENTS (node), indent + 4);
 416       print_node (file, "result", DECL_RESULT (node), indent + 4);
 417       print_node_brief (file, "initial", DECL_INITIAL (node), indent + 4);
 418
 419       print_lang_decl (file, node, indent);
 420
 421       if (DECL_RTL (node) != 0)
 422         {
 423           indent_to (file, indent + 4);
 424           print_rtl (file, DECL_RTL (node));
 425         }
 426
 427       if (DECL_SAVED_INSNS (node) != 0)
 428         {
 429           indent_to (file, indent + 4);
 430           if (TREE_CODE (node) == PARM_DECL)
 431             {
 432               fprintf (file, "incoming-rtl ");
 433               print_rtl (file, DECL_INCOMING_RTL (node));
 434             }
 435           else if (TREE_CODE (node) == FUNCTION_DECL)
 436             {
 437               fprintf (file, "saved-insns ");
 438               fprintf (file, HOST_PTR_PRINTF,
 439                        (char *) DECL_SAVED_INSNS (node));
 440             }
 441         }
 442
 443       /* Print the decl chain only if decl is at second level.  */
 444       if (indent == 4)
 445         print_node (file, "chain", TREE_CHAIN (node), indent + 4);
 446       else
 447         print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
 448       break;
 449
 450     case 't':
 451       if (TYPE_NO_FORCE_BLK (node))
 452         fputs (" no-force-blk", file);
 453       if (TYPE_STRING_FLAG (node))
 454         fputs (" string-flag", file);
 455       if (TYPE_NEEDS_CONSTRUCTING (node))
 456         fputs (" needs-constructing", file);
 457       if (TYPE_TRANSPARENT_UNION (node))
 458         fputs (" transparent-union", file);
 459       if (TYPE_PACKED (node))
 460         fputs (" packed", file);
 461
 462       if (TYPE_LANG_FLAG_0 (node))
 463         fputs (" type_0", file);
 464       if (TYPE_LANG_FLAG_1 (node))
 465         fputs (" type_1", file);
 466       if (TYPE_LANG_FLAG_2 (node))
 467         fputs (" type_2", file);
 468       if (TYPE_LANG_FLAG_3 (node))
 469         fputs (" type_3", file);
 470       if (TYPE_LANG_FLAG_4 (node))
 471         fputs (" type_4", file);
 472       if (TYPE_LANG_FLAG_5 (node))
 473         fputs (" type_5", file);
 474       if (TYPE_LANG_FLAG_6 (node))
 475         fputs (" type_6", file);
 476
 477       mode = TYPE_MODE (node);
 478       fprintf (file, " %s", GET_MODE_NAME(mode));
 479
 480       print_node (file, "size", TYPE_SIZE (node), indent + 4);
 481       indent_to (file, indent + 3);
 482
 483       fprintf (file, " align %d", TYPE_ALIGN (node));
 484       fprintf (file, " symtab %d", TYPE_SYMTAB_ADDRESS (node));
 485       fprintf (file, " alias set %d", TYPE_ALIAS_SET (node));
 486
 487       print_node (file, "attributes", TYPE_ATTRIBUTES (node), indent + 4);
 488
 489       if (TREE_CODE (node) == ARRAY_TYPE || TREE_CODE (node) == SET_TYPE)
 490         print_node (file, "domain", TYPE_DOMAIN (node), indent + 4);
 491       else if (TREE_CODE (node) == INTEGER_TYPE
 492                || TREE_CODE (node) == BOOLEAN_TYPE
 493                || TREE_CODE (node) == CHAR_TYPE)
 494         {
 495           fprintf (file, " precision %d", TYPE_PRECISION (node));
 496           print_node (file, "min", TYPE_MIN_VALUE (node), indent + 4);
 497           print_node (file, "max", TYPE_MAX_VALUE (node), indent + 4);
 498         }
 499       else if (TREE_CODE (node) == ENUMERAL_TYPE)
 500         {
 501           fprintf (file, " precision %d", TYPE_PRECISION (node));
 502           print_node (file, "min", TYPE_MIN_VALUE (node), indent + 4);
 503           print_node (file, "max", TYPE_MAX_VALUE (node), indent + 4);
 504           print_node (file, "values", TYPE_VALUES (node), indent + 4);
 505         }
 506       else if (TREE_CODE (node) == REAL_TYPE)
 507         fprintf (file, " precision %d", TYPE_PRECISION (node));
 508       else if (TREE_CODE (node) == RECORD_TYPE
 509                || TREE_CODE (node) == UNION_TYPE
 510                || TREE_CODE (node) == QUAL_UNION_TYPE)
 511         print_node (file, "fields", TYPE_FIELDS (node), indent + 4);
 512       else if (TREE_CODE (node) == FUNCTION_TYPE || TREE_CODE (node) == METHOD_TYPE)
 513         {
 514           if (TYPE_METHOD_BASETYPE (node))
 515             print_node_brief (file, "method basetype", TYPE_METHOD_BASETYPE (node), indent + 4);
 516           print_node (file, "arg-types", TYPE_ARG_TYPES (node), indent + 4);
 517         }
 518       else if (TREE_CODE (node) == OFFSET_TYPE)
 519         print_node_brief (file, "basetype", TYPE_OFFSET_BASETYPE (node),
 520                           indent + 4);
 521       if (TYPE_CONTEXT (node))
 522         print_node_brief (file, "context", TYPE_CONTEXT (node), indent + 4);
 523
 524       print_lang_type (file, node, indent);
 525
 526       if (TYPE_POINTER_TO (node) || TREE_CHAIN (node))
 527         indent_to (file, indent + 3);
 528       print_node_brief (file, "pointer_to_this", TYPE_POINTER_TO (node), indent + 4);
 529       print_node_brief (file, "reference_to_this", TYPE_REFERENCE_TO (node), indent + 4);
 530       print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
 531       break;
 532
 533     case 'b':
 534       print_node (file, "vars", BLOCK_VARS (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 }