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