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