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