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