gcc/print-tree.c

   1 /* Prints out tree in human readable form - GCC
   2    Copyright (C) 1990, 1991, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
   3    2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
   4
   5 This file is part of GCC.
   6
   7 GCC is free software; you can redistribute it and/or modify it under
   8 the terms of the GNU General Public License as published by the Free
   9 Software Foundation; either version 2, or (at your option) any later
  10 version.
  11
  12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
  13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
  14 FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  15 for more details.
  16
  17 You should have received a copy of the GNU General Public License
  18 along with GCC; see the file COPYING.  If not, write to the Free
  19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
  20 02111-1307, USA.  */
  21
  22
  23 #include "config.h"
  24 #include "system.h"
  25 #include "coretypes.h"
  26 #include "tm.h"
  27 #include "tree.h"
  28 #include "real.h"
  29 #include "ggc.h"
  30 #include "langhooks.h"
  31
  32 /* Define the hash table of nodes already seen.
  33    Such nodes are not repeated; brief cross-references are used.  */
  34
  35 #define HASH_SIZE 37
  36
  37 struct bucket
  38 {
  39   tree node;
  40   struct bucket *next;
  41 };
  42
  43 static struct bucket **table;
  44
  45 /* Print the node NODE on standard error, for debugging.
  46    Most nodes referred to by this one are printed recursively
  47    down to a depth of six.  */
  48
  49 void
  50 debug_tree (tree node)
  51 {
  52   table = xcalloc (HASH_SIZE, sizeof (struct bucket *));
  53   print_node (stderr, "", node, 0);
  54   free (table);
  55   table = 0;
  56   putc ('\n', stderr);
  57 }
  58
  59 /* Print a node in brief fashion, with just the code, address and name.  */
  60
  61 void
  62 print_node_brief (FILE *file, const char *prefix, tree node, int indent)
  63 {
  64   enum tree_code_class class;
  65
  66   if (node == 0)
  67     return;
  68
  69   class = TREE_CODE_CLASS (TREE_CODE (node));
  70
  71   /* Always print the slot this node is in, and its code, address and
  72      name if any.  */
  73   if (indent > 0)
  74     fprintf (file, " ");
  75   fprintf (file, "%s <%s " HOST_PTR_PRINTF,
  76            prefix, tree_code_name[(int) TREE_CODE (node)], (char *) node);
  77
  78   if (class == tcc_declaration)
  79     {
  80       if (DECL_NAME (node))
  81         fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
  82       else if (TREE_CODE (node) == LABEL_DECL
  83                && LABEL_DECL_UID (node) != -1)
  84         fprintf (file, " L." HOST_WIDE_INT_PRINT_DEC, LABEL_DECL_UID (node));
  85       else
  86         fprintf (file, " %c.%u", TREE_CODE (node) == CONST_DECL ? 'C' : 'D',
  87                  DECL_UID (node));
  88     }
  89   else if (class == tcc_type)
  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
 104   /* We might as well always print the value of an integer or real.  */
 105   if (TREE_CODE (node) == INTEGER_CST)
 106     {
 107       if (TREE_CONSTANT_OVERFLOW (node))
 108         fprintf (file, " overflow");
 109
 110       fprintf (file, " ");
 111       if (TREE_INT_CST_HIGH (node) == 0)
 112         fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED, TREE_INT_CST_LOW (node));
 113       else if (TREE_INT_CST_HIGH (node) == -1
 114                && TREE_INT_CST_LOW (node) != 0)
 115         fprintf (file, "-" HOST_WIDE_INT_PRINT_UNSIGNED,
 116                  -TREE_INT_CST_LOW (node));
 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       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[60];
 136           real_to_decimal (string, &d, sizeof (string), 0, 1);
 137           fprintf (file, " %s", string);
 138         }
 139     }
 140
 141   fprintf (file, ">");
 142 }
 143
 144 void
 145 indent_to (FILE *file, int column)
 146 {
 147   int i;
 148
 149   /* Since this is the long way, indent to desired column.  */
 150   if (column > 0)
 151     fprintf (file, "\n");
 152   for (i = 0; i < column; i++)
 153     fprintf (file, " ");
 154 }
 155 \f
 156 /* Print the node NODE in full on file FILE, preceded by PREFIX,
 157    starting in column INDENT.  */
 158
 159 void
 160 print_node (FILE *file, const char *prefix, tree node, int indent)
 161 {
 162   int hash;
 163   struct bucket *b;
 164   enum machine_mode mode;
 165   enum tree_code_class class;
 166   int len;
 167   int i;
 168   expanded_location xloc;
 169
 170   if (node == 0)
 171     return;
 172
 173   class = TREE_CODE_CLASS (TREE_CODE (node));
 174
 175   /* Don't get too deep in nesting.  If the user wants to see deeper,
 176      it is easy to use the address of a lowest-level node
 177      as an argument in another call to debug_tree.  */
 178
 179   if (indent > 24)
 180     {
 181       print_node_brief (file, prefix, node, indent);
 182       return;
 183     }
 184
 185   if (indent > 8 && (class == tcc_type || class == tcc_declaration))
 186     {
 187       print_node_brief (file, prefix, node, indent);
 188       return;
 189     }
 190
 191   /* It is unsafe to look at any other fields of an ERROR_MARK node.  */
 192   if (TREE_CODE (node) == ERROR_MARK)
 193     {
 194       print_node_brief (file, prefix, node, indent);
 195       return;
 196     }
 197
 198   hash = ((unsigned long) node) % HASH_SIZE;
 199
 200   /* If node is in the table, just mention its address.  */
 201   for (b = table[hash]; b; b = b->next)
 202     if (b->node == node)
 203       {
 204         print_node_brief (file, prefix, node, indent);
 205         return;
 206       }
 207
 208   /* Add this node to the table.  */
 209   b = xmalloc (sizeof (struct bucket));
 210   b->node = node;
 211   b->next = table[hash];
 212   table[hash] = b;
 213
 214   /* Indent to the specified column, since this is the long form.  */
 215   indent_to (file, indent);
 216
 217   /* Print the slot this node is in, and its code, and address.  */
 218   fprintf (file, "%s <%s " HOST_PTR_PRINTF,
 219            prefix, tree_code_name[(int) TREE_CODE (node)], (void *) node);
 220
 221   /* Print the name, if any.  */
 222   if (class == tcc_declaration)
 223     {
 224       if (DECL_NAME (node))
 225         fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
 226       else if (TREE_CODE (node) == LABEL_DECL
 227                && LABEL_DECL_UID (node) != -1)
 228         fprintf (file, " L." HOST_WIDE_INT_PRINT_DEC, LABEL_DECL_UID (node));
 229       else
 230         fprintf (file, " %c.%u", TREE_CODE (node) == CONST_DECL ? 'C' : 'D',
 231                  DECL_UID (node));
 232     }
 233   else if (class == tcc_type)
 234     {
 235       if (TYPE_NAME (node))
 236         {
 237           if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
 238             fprintf (file, " %s", IDENTIFIER_POINTER (TYPE_NAME (node)));
 239           else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
 240                    && DECL_NAME (TYPE_NAME (node)))
 241             fprintf (file, " %s",
 242                      IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node))));
 243         }
 244     }
 245   if (TREE_CODE (node) == IDENTIFIER_NODE)
 246     fprintf (file, " %s", IDENTIFIER_POINTER (node));
 247
 248   if (TREE_CODE (node) == INTEGER_CST)
 249     {
 250       if (indent <= 4)
 251         print_node_brief (file, "type", TREE_TYPE (node), indent + 4);
 252     }
 253   else
 254     {
 255       print_node (file, "type", TREE_TYPE (node), indent + 4);
 256       if (TREE_TYPE (node))
 257         indent_to (file, indent + 3);
 258     }
 259
 260   if (!TYPE_P (node) && TREE_SIDE_EFFECTS (node))
 261     fputs (" side-effects", file);
 262
 263   if (TYPE_P (node) ? TYPE_READONLY (node) : TREE_READONLY (node))
 264     fputs (" readonly", file);
 265   if (!TYPE_P (node) && TREE_CONSTANT (node))
 266     fputs (" constant", file);
 267   else if (TYPE_P (node) && TYPE_SIZES_GIMPLIFIED (node))
 268     fputs (" sizes-gimplified", file);
 269
 270   if (TREE_INVARIANT (node))
 271     fputs (" invariant", file);
 272   if (TREE_ADDRESSABLE (node))
 273     fputs (" addressable", file);
 274   if (TREE_THIS_VOLATILE (node))
 275     fputs (" volatile", file);
 276   if (TREE_ASM_WRITTEN (node))
 277     fputs (" asm_written", file);
 278   if (TREE_USED (node))
 279     fputs (" used", file);
 280   if (TREE_NOTHROW (node))
 281     fputs (TYPE_P (node) ? " align-ok" : " nothrow", file);
 282   if (TREE_PUBLIC (node))
 283     fputs (" public", file);
 284   if (TREE_PRIVATE (node))
 285     fputs (" private", file);
 286   if (TREE_PROTECTED (node))
 287     fputs (" protected", file);
 288   if (TREE_STATIC (node))
 289     fputs (" static", file);
 290   if (TREE_DEPRECATED (node))
 291     fputs (" deprecated", file);
 292   if (TREE_VISITED (node))
 293     fputs (" visited", file);
 294   if (TREE_LANG_FLAG_0 (node))
 295     fputs (" tree_0", file);
 296   if (TREE_LANG_FLAG_1 (node))
 297     fputs (" tree_1", file);
 298   if (TREE_LANG_FLAG_2 (node))
 299     fputs (" tree_2", file);
 300   if (TREE_LANG_FLAG_3 (node))
 301     fputs (" tree_3", file);
 302   if (TREE_LANG_FLAG_4 (node))
 303     fputs (" tree_4", file);
 304   if (TREE_LANG_FLAG_5 (node))
 305     fputs (" tree_5", file);
 306   if (TREE_LANG_FLAG_6 (node))
 307     fputs (" tree_6", file);
 308
 309   /* DECL_ nodes have additional attributes.  */
 310
 311   switch (TREE_CODE_CLASS (TREE_CODE (node)))
 312     {
 313     case tcc_declaration:
 314       mode = DECL_MODE (node);
 315
 316       if (DECL_UNSIGNED (node))
 317         fputs (" unsigned", file);
 318       if (DECL_IGNORED_P (node))
 319         fputs (" ignored", file);
 320       if (DECL_ABSTRACT (node))
 321         fputs (" abstract", file);
 322       if (DECL_IN_SYSTEM_HEADER (node))
 323         fputs (" in_system_header", file);
 324       if (DECL_COMMON (node))
 325         fputs (" common", file);
 326       if (DECL_EXTERNAL (node))
 327         fputs (" external", file);
 328       if (DECL_WEAK (node))
 329         fputs (" weak", file);
 330       if (DECL_REGISTER (node) && TREE_CODE (node) != FIELD_DECL
 331           && TREE_CODE (node) != FUNCTION_DECL
 332           && TREE_CODE (node) != LABEL_DECL)
 333         fputs (" regdecl", file);
 334       if (DECL_NONLOCAL (node))
 335         fputs (" nonlocal", file);
 336
 337       if (TREE_CODE (node) == TYPE_DECL && TYPE_DECL_SUPPRESS_DEBUG (node))
 338         fputs (" suppress-debug", file);
 339
 340       if (TREE_CODE (node) == FUNCTION_DECL && DECL_INLINE (node))
 341         fputs (DECL_DECLARED_INLINE_P (node) ? " inline" : " autoinline", file);
 342       if (TREE_CODE (node) == FUNCTION_DECL && DECL_BUILT_IN (node))
 343         fputs (" built-in", file);
 344       if (TREE_CODE (node) == FUNCTION_DECL && DECL_NO_STATIC_CHAIN (node))
 345         fputs (" no-static-chain", file);
 346
 347       if (TREE_CODE (node) == FIELD_DECL && DECL_PACKED (node))
 348         fputs (" packed", file);
 349       if (TREE_CODE (node) == FIELD_DECL && DECL_BIT_FIELD (node))
 350         fputs (" bit-field", file);
 351       if (TREE_CODE (node) == FIELD_DECL && DECL_NONADDRESSABLE_P (node))
 352         fputs (" nonaddressable", file);
 353
 354       if (TREE_CODE (node) == LABEL_DECL && DECL_ERROR_ISSUED (node))
 355         fputs (" error-issued", file);
 356
 357       if (TREE_CODE (node) == VAR_DECL && DECL_IN_TEXT_SECTION (node))
 358         fputs (" in-text-section", file);
 359       if (TREE_CODE (node) == VAR_DECL && DECL_THREAD_LOCAL (node))
 360         fputs (" thread-local", file);
 361
 362       if (TREE_CODE (node) == PARM_DECL && DECL_TRANSPARENT_UNION (node))
 363         fputs (" transparent-union", file);
 364
 365       if (DECL_VIRTUAL_P (node))
 366         fputs (" virtual", file);
 367       if (DECL_DEFER_OUTPUT (node))
 368         fputs (" defer-output", file);
 369
 370       if (DECL_PRESERVE_P (node))
 371         fputs (" preserve", file);
 372
 373       if (DECL_LANG_FLAG_0 (node))
 374         fputs (" decl_0", file);
 375       if (DECL_LANG_FLAG_1 (node))
 376         fputs (" decl_1", file);
 377       if (DECL_LANG_FLAG_2 (node))
 378         fputs (" decl_2", file);
 379       if (DECL_LANG_FLAG_3 (node))
 380         fputs (" decl_3", file);
 381       if (DECL_LANG_FLAG_4 (node))
 382         fputs (" decl_4", file);
 383       if (DECL_LANG_FLAG_5 (node))
 384         fputs (" decl_5", file);
 385       if (DECL_LANG_FLAG_6 (node))
 386         fputs (" decl_6", file);
 387       if (DECL_LANG_FLAG_7 (node))
 388         fputs (" decl_7", file);
 389
 390       fprintf (file, " %s", GET_MODE_NAME (mode));
 391       xloc = expand_location (DECL_SOURCE_LOCATION (node));
 392       fprintf (file, " file %s line %d", xloc.file, xloc.line);
 393
 394       print_node (file, "size", DECL_SIZE (node), indent + 4);
 395       print_node (file, "unit size", DECL_SIZE_UNIT (node), indent + 4);
 396
 397       if (TREE_CODE (node) != FUNCTION_DECL
 398           || DECL_INLINE (node) || DECL_BUILT_IN (node))
 399         indent_to (file, indent + 3);
 400
 401       if (TREE_CODE (node) != FUNCTION_DECL)
 402         {
 403           if (DECL_USER_ALIGN (node))
 404             fprintf (file, " user");
 405
 406           fprintf (file, " align %d", DECL_ALIGN (node));
 407           if (TREE_CODE (node) == FIELD_DECL)
 408             fprintf (file, " offset_align " HOST_WIDE_INT_PRINT_UNSIGNED,
 409                      DECL_OFFSET_ALIGN (node));
 410         }
 411       else if (DECL_BUILT_IN (node))
 412         {
 413           if (DECL_BUILT_IN_CLASS (node) == BUILT_IN_MD)
 414             fprintf (file, " built-in BUILT_IN_MD %d", DECL_FUNCTION_CODE (node));
 415           else
 416             fprintf (file, " built-in %s:%s",
 417                      built_in_class_names[(int) DECL_BUILT_IN_CLASS (node)],
 418                      built_in_names[(int) DECL_FUNCTION_CODE (node)]);
 419         }
 420
 421       if (DECL_POINTER_ALIAS_SET_KNOWN_P (node))
 422         fprintf (file, " alias set " HOST_WIDE_INT_PRINT_DEC,
 423                  DECL_POINTER_ALIAS_SET (node));
 424
 425       if (TREE_CODE (node) == FIELD_DECL)
 426         {
 427           print_node (file, "offset", DECL_FIELD_OFFSET (node), indent + 4);
 428           print_node (file, "bit offset", DECL_FIELD_BIT_OFFSET (node),
 429                       indent + 4);
 430         }
 431
 432       print_node_brief (file, "context", DECL_CONTEXT (node), indent + 4);
 433       print_node_brief (file, "attributes",
 434                         DECL_ATTRIBUTES (node), indent + 4);
 435       print_node_brief (file, "abstract_origin",
 436                         DECL_ABSTRACT_ORIGIN (node), indent + 4);
 437
 438       print_node (file, "arguments", DECL_ARGUMENTS (node), indent + 4);
 439       print_node (file, "result", DECL_RESULT_FLD (node), indent + 4);
 440       print_node_brief (file, "initial", DECL_INITIAL (node), indent + 4);
 441
 442       lang_hooks.print_decl (file, node, indent);
 443
 444       if (DECL_RTL_SET_P (node))
 445         {
 446           indent_to (file, indent + 4);
 447           print_rtl (file, DECL_RTL (node));
 448         }
 449
 450       if (TREE_CODE (node) == PARM_DECL)
 451         {
 452           print_node (file, "arg-type", DECL_ARG_TYPE (node), indent + 4);
 453           print_node (file, "arg-type-as-written",
 454                       DECL_ARG_TYPE_AS_WRITTEN (node), indent + 4);
 455
 456           if (DECL_INCOMING_RTL (node) != 0)
 457             {
 458               indent_to (file, indent + 4);
 459               fprintf (file, "incoming-rtl ");
 460               print_rtl (file, DECL_INCOMING_RTL (node));
 461             }
 462         }
 463       else if (TREE_CODE (node) == FUNCTION_DECL
 464                && DECL_STRUCT_FUNCTION (node) != 0)
 465         {
 466           indent_to (file, indent + 4);
 467           fprintf (file, "saved-insns " HOST_PTR_PRINTF,
 468                    (void *) DECL_STRUCT_FUNCTION (node));
 469         }
 470
 471       /* Print the decl chain only if decl is at second level.  */
 472       if (indent == 4)
 473         print_node (file, "chain", TREE_CHAIN (node), indent + 4);
 474       else
 475         print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
 476       break;
 477
 478     case tcc_type:
 479       if (TYPE_UNSIGNED (node))
 480         fputs (" unsigned", file);
 481
 482       /* The no-force-blk flag is used for different things in
 483          different types.  */
 484       if ((TREE_CODE (node) == RECORD_TYPE
 485            || TREE_CODE (node) == UNION_TYPE
 486            || TREE_CODE (node) == QUAL_UNION_TYPE)
 487           && TYPE_NO_FORCE_BLK (node))
 488         fputs (" no-force-blk", file);
 489       else if (TREE_CODE (node) == INTEGER_TYPE
 490                && TYPE_IS_SIZETYPE (node))
 491         fputs (" sizetype", file);
 492       else if (TREE_CODE (node) == FUNCTION_TYPE
 493                && TYPE_RETURNS_STACK_DEPRESSED (node))
 494         fputs (" returns-stack-depressed", file);
 495
 496       if (TYPE_STRING_FLAG (node))
 497         fputs (" string-flag", file);
 498       if (TYPE_NEEDS_CONSTRUCTING (node))
 499         fputs (" needs-constructing", file);
 500
 501       /* The transparent-union flag is used for different things in
 502          different nodes.  */
 503       if (TREE_CODE (node) == UNION_TYPE && TYPE_TRANSPARENT_UNION (node))
 504         fputs (" transparent-union", file);
 505       else if (TREE_CODE (node) == ARRAY_TYPE
 506                && TYPE_NONALIASED_COMPONENT (node))
 507         fputs (" nonaliased-component", file);
 508
 509       if (TYPE_PACKED (node))
 510         fputs (" packed", file);
 511
 512       if (TYPE_RESTRICT (node))
 513         fputs (" restrict", file);
 514
 515       if (TYPE_LANG_FLAG_0 (node))
 516         fputs (" type_0", file);
 517       if (TYPE_LANG_FLAG_1 (node))
 518         fputs (" type_1", file);
 519       if (TYPE_LANG_FLAG_2 (node))
 520         fputs (" type_2", file);
 521       if (TYPE_LANG_FLAG_3 (node))
 522         fputs (" type_3", file);
 523       if (TYPE_LANG_FLAG_4 (node))
 524         fputs (" type_4", file);
 525       if (TYPE_LANG_FLAG_5 (node))
 526         fputs (" type_5", file);
 527       if (TYPE_LANG_FLAG_6 (node))
 528         fputs (" type_6", file);
 529
 530       mode = TYPE_MODE (node);
 531       fprintf (file, " %s", GET_MODE_NAME (mode));
 532
 533       print_node (file, "size", TYPE_SIZE (node), indent + 4);
 534       print_node (file, "unit size", TYPE_SIZE_UNIT (node), indent + 4);
 535       indent_to (file, indent + 3);
 536
 537       if (TYPE_USER_ALIGN (node))
 538         fprintf (file, " user");
 539
 540       fprintf (file, " align %d symtab %d alias set " HOST_WIDE_INT_PRINT_DEC,
 541                TYPE_ALIGN (node), TYPE_SYMTAB_ADDRESS (node),
 542                TYPE_ALIAS_SET (node));
 543
 544       print_node (file, "attributes", TYPE_ATTRIBUTES (node), indent + 4);
 545
 546       if (INTEGRAL_TYPE_P (node) || TREE_CODE (node) == REAL_TYPE)
 547         {
 548           fprintf (file, " precision %d", TYPE_PRECISION (node));
 549           print_node_brief (file, "min", TYPE_MIN_VALUE (node), indent + 4);
 550           print_node_brief (file, "max", TYPE_MAX_VALUE (node), indent + 4);
 551         }
 552
 553       if (TREE_CODE (node) == ENUMERAL_TYPE)
 554         print_node (file, "values", TYPE_VALUES (node), indent + 4);
 555       else if (TREE_CODE (node) == ARRAY_TYPE)
 556         print_node (file, "domain", TYPE_DOMAIN (node), indent + 4);
 557       else if (TREE_CODE (node) == VECTOR_TYPE)
 558         fprintf (file, " nunits %d", (int) TYPE_VECTOR_SUBPARTS (node));
 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 tcc_expression:
 591     case tcc_comparison:
 592     case tcc_unary:
 593     case tcc_binary:
 594     case tcc_reference:
 595     case tcc_statement:
 596       if (TREE_CODE (node) == BIT_FIELD_REF && BIT_FIELD_REF_UNSIGNED (node))
 597         fputs (" unsigned", file);
 598       if (TREE_CODE (node) == BIND_EXPR)
 599         {
 600           print_node (file, "vars", TREE_OPERAND (node, 0), indent + 4);
 601           print_node (file, "body", TREE_OPERAND (node, 1), indent + 4);
 602           print_node (file, "block", TREE_OPERAND (node, 2), indent + 4);
 603           break;
 604         }
 605
 606       len = TREE_CODE_LENGTH (TREE_CODE (node));
 607
 608       for (i = 0; i < len; i++)
 609         {
 610           char temp[10];
 611
 612           sprintf (temp, "arg %d", i);
 613           print_node (file, temp, TREE_OPERAND (node, i), indent + 4);
 614         }
 615
 616       print_node (file, "chain", TREE_CHAIN (node), indent + 4);
 617       break;
 618
 619     case tcc_constant:
 620     case tcc_exceptional:
 621       switch (TREE_CODE (node))
 622         {
 623         case INTEGER_CST:
 624           if (TREE_CONSTANT_OVERFLOW (node))
 625             fprintf (file, " overflow");
 626
 627           fprintf (file, " ");
 628           if (TREE_INT_CST_HIGH (node) == 0)
 629             fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED,
 630                      TREE_INT_CST_LOW (node));
 631           else if (TREE_INT_CST_HIGH (node) == -1
 632                    && TREE_INT_CST_LOW (node) != 0)
 633             fprintf (file, "-" HOST_WIDE_INT_PRINT_UNSIGNED,
 634                      -TREE_INT_CST_LOW (node));
 635           else
 636             fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
 637                      TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
 638           break;
 639
 640         case REAL_CST:
 641           {
 642             REAL_VALUE_TYPE d;
 643
 644             if (TREE_OVERFLOW (node))
 645               fprintf (file, " overflow");
 646
 647             d = TREE_REAL_CST (node);
 648             if (REAL_VALUE_ISINF (d))
 649               fprintf (file, " Inf");
 650             else if (REAL_VALUE_ISNAN (d))
 651               fprintf (file, " Nan");
 652             else
 653               {
 654                 char string[64];
 655                 real_to_decimal (string, &d, sizeof (string), 0, 1);
 656                 fprintf (file, " %s", string);
 657               }
 658           }
 659           break;
 660
 661         case VECTOR_CST:
 662           {
 663             tree vals = TREE_VECTOR_CST_ELTS (node);
 664             char buf[10];
 665             tree link;
 666             int i;
 667
 668             i = 0;
 669             for (link = vals; link; link = TREE_CHAIN (link), ++i)
 670               {
 671                 sprintf (buf, "elt%d: ", i);
 672                 print_node (file, buf, TREE_VALUE (link), indent + 4);
 673               }
 674           }
 675           break;
 676
 677         case COMPLEX_CST:
 678           print_node (file, "real", TREE_REALPART (node), indent + 4);
 679           print_node (file, "imag", TREE_IMAGPART (node), indent + 4);
 680           break;
 681
 682         case STRING_CST:
 683           {
 684             const char *p = TREE_STRING_POINTER (node);
 685             int i = TREE_STRING_LENGTH (node);
 686             fputs (" \"", file);
 687             while (--i >= 0)
 688               {
 689                 char ch = *p++;
 690                 if (ch >= ' ' && ch < 127)
 691                   putc (ch, file);
 692                 else
 693                   fprintf(file, "\\%03o", ch & 0xFF);
 694               }
 695             fputc ('\"', file);
 696           }
 697           /* Print the chain at second level.  */
 698           if (indent == 4)
 699             print_node (file, "chain", TREE_CHAIN (node), indent + 4);
 700           else
 701             print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
 702           break;
 703
 704         case IDENTIFIER_NODE:
 705           lang_hooks.print_identifier (file, node, indent);
 706           break;
 707
 708         case TREE_LIST:
 709           print_node (file, "purpose", TREE_PURPOSE (node), indent + 4);
 710           print_node (file, "value", TREE_VALUE (node), indent + 4);
 711           print_node (file, "chain", TREE_CHAIN (node), indent + 4);
 712           break;
 713
 714         case TREE_VEC:
 715           len = TREE_VEC_LENGTH (node);
 716           for (i = 0; i < len; i++)
 717             if (TREE_VEC_ELT (node, i))
 718               {
 719                 char temp[10];
 720                 sprintf (temp, "elt %d", i);
 721                 indent_to (file, indent + 4);
 722                 print_node_brief (file, temp, TREE_VEC_ELT (node, i), 0);
 723               }
 724           break;
 725
 726         case BLOCK:
 727           print_node (file, "vars", BLOCK_VARS (node), indent + 4);
 728           print_node (file, "supercontext", BLOCK_SUPERCONTEXT (node),
 729                       indent + 4);
 730           print_node (file, "subblocks", BLOCK_SUBBLOCKS (node), indent + 4);
 731           print_node (file, "chain", BLOCK_CHAIN (node), indent + 4);
 732           print_node (file, "abstract_origin",
 733                       BLOCK_ABSTRACT_ORIGIN (node), indent + 4);
 734           break;
 735
 736         case SSA_NAME:
 737           print_node_brief (file, "var", SSA_NAME_VAR (node), indent + 4);
 738           print_node_brief (file, "def_stmt",
 739                             SSA_NAME_DEF_STMT (node), indent + 4);
 740
 741           indent_to (file, indent + 4);
 742           fprintf (file, "version %u", SSA_NAME_VERSION (node));
 743           if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (node))
 744             fprintf (file, " in-abnormal-phi");
 745           if (SSA_NAME_IN_FREE_LIST (node))
 746             fprintf (file, " in-free-list");
 747
 748           if (SSA_NAME_PTR_INFO (node)
 749               || SSA_NAME_VALUE (node)
 750               || SSA_NAME_AUX (node))
 751             {
 752               indent_to (file, indent + 3);
 753               if (SSA_NAME_PTR_INFO (node))
 754                 fprintf (file, " ptr-info %p",
 755                          (void *) SSA_NAME_PTR_INFO (node));
 756               if (SSA_NAME_VALUE (node))
 757                 fprintf (file, " value %p",
 758                          (void *) SSA_NAME_VALUE (node));
 759               if (SSA_NAME_AUX (node))
 760                 fprintf (file, " aux %p", SSA_NAME_AUX (node));
 761             }
 762           break;
 763
 764         default:
 765           if (EXCEPTIONAL_CLASS_P (node))
 766             lang_hooks.print_xnode (file, node, indent);
 767           break;
 768         }
 769
 770       break;
 771     }
 772
 773   if (EXPR_HAS_LOCATION (node))
 774     {
 775       expanded_location xloc = expand_location (EXPR_LOCATION (node));
 776       indent_to (file, indent+4);
 777       fprintf (file, "%s:%d", xloc.file, xloc.line);
 778     }
 779
 780   fprintf (file, ">");
 781 }