gcc/print-tree.c

   1 /* Prints out tree in human readable form - GCC
   2    Copyright (C) 1990-2016 Free Software Foundation, Inc.
   3
   4 This file is part of GCC.
   5
   6 GCC is free software; you can redistribute it and/or modify it under
   7 the terms of the GNU General Public License as published by the Free
   8 Software Foundation; either version 3, or (at your option) any later
   9 version.
  10
  11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
  12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
  13 FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  14 for more details.
  15
  16 You should have received a copy of the GNU General Public License
  17 along with GCC; see the file COPYING3.  If not see
  18 <http://www.gnu.org/licenses/>.  */
  19
  20
  21 #include "config.h"
  22 #include "system.h"
  23 #include "coretypes.h"
  24 #include "tm.h"
  25 #include "tree.h"
  26 #include "cgraph.h"
  27 #include "diagnostic.h"
  28 #include "varasm.h"
  29 #include "print-rtl.h"
  30 #include "stor-layout.h"
  31 #include "langhooks.h"
  32 #include "tree-iterator.h"
  33 #include "gimple-pretty-print.h" /* FIXME */
  34 #include "tree-cfg.h"
  35 #include "tree-dump.h"
  36
  37 /* Define the hash table of nodes already seen.
  38    Such nodes are not repeated; brief cross-references are used.  */
  39
  40 #define HASH_SIZE 37
  41
  42 struct bucket
  43 {
  44   tree node;
  45   struct bucket *next;
  46 };
  47
  48 static struct bucket **table;
  49
  50 /* Print PREFIX and ADDR to FILE.  */
  51 void
  52 dump_addr (FILE *file, const char *prefix, const void *addr)
  53 {
  54   if (flag_dump_noaddr || flag_dump_unnumbered)
  55     fprintf (file, "%s#", prefix);
  56   else
  57     fprintf (file, "%s" HOST_PTR_PRINTF, prefix, addr);
  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, const_tree node, int indent)
  64 {
  65   enum tree_code_class tclass;
  66
  67   if (node == 0)
  68     return;
  69
  70   tclass = 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", prefix, get_tree_code_name (TREE_CODE (node)));
  77   dump_addr (file, " ", node);
  78
  79   if (tclass == 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         {
  86           if (dump_flags & TDF_NOUID)
  87             fprintf (file, " L.xxxx");
  88           else
  89             fprintf (file, " L.%d", (int) LABEL_DECL_UID (node));
  90         }
  91       else
  92         {
  93           if (dump_flags & TDF_NOUID)
  94             fprintf (file, " %c.xxxx",
  95                      TREE_CODE (node) == CONST_DECL ? 'C' : 'D');
  96           else
  97             fprintf (file, " %c.%u",
  98                      TREE_CODE (node) == CONST_DECL ? 'C' : 'D',
  99                      DECL_UID (node));
 100         }
 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       if (!ADDR_SPACE_GENERIC_P (TYPE_ADDR_SPACE (node)))
 114         fprintf (file, " address-space-%d", TYPE_ADDR_SPACE (node));
 115     }
 116   if (TREE_CODE (node) == IDENTIFIER_NODE)
 117     fprintf (file, " %s", IDENTIFIER_POINTER (node));
 118
 119   /* We might as well always print the value of an integer or real.  */
 120   if (TREE_CODE (node) == INTEGER_CST)
 121     {
 122       if (TREE_OVERFLOW (node))
 123         fprintf (file, " overflow");
 124
 125       fprintf (file, " ");
 126       print_dec (node, file, TYPE_SIGN (TREE_TYPE (node)));
 127     }
 128   if (TREE_CODE (node) == REAL_CST)
 129     {
 130       REAL_VALUE_TYPE d;
 131
 132       if (TREE_OVERFLOW (node))
 133         fprintf (file, " overflow");
 134
 135       d = TREE_REAL_CST (node);
 136       if (REAL_VALUE_ISINF (d))
 137         fprintf (file,  REAL_VALUE_NEGATIVE (d) ? " -Inf" : " Inf");
 138       else if (REAL_VALUE_ISNAN (d))
 139         fprintf (file, " Nan");
 140       else
 141         {
 142           char string[60];
 143           real_to_decimal (string, &d, sizeof (string), 0, 1);
 144           fprintf (file, " %s", string);
 145         }
 146     }
 147   if (TREE_CODE (node) == FIXED_CST)
 148     {
 149       FIXED_VALUE_TYPE f;
 150       char string[60];
 151
 152       if (TREE_OVERFLOW (node))
 153         fprintf (file, " overflow");
 154
 155       f = TREE_FIXED_CST (node);
 156       fixed_to_decimal (string, &f, sizeof (string));
 157       fprintf (file, " %s", string);
 158     }
 159
 160   fprintf (file, ">");
 161 }
 162
 163 void
 164 indent_to (FILE *file, int column)
 165 {
 166   int i;
 167
 168   /* Since this is the long way, indent to desired column.  */
 169   if (column > 0)
 170     fprintf (file, "\n");
 171   for (i = 0; i < column; i++)
 172     fprintf (file, " ");
 173 }
 174 \f
 175 /* Print the node NODE in full on file FILE, preceded by PREFIX,
 176    starting in column INDENT.  */
 177
 178 void
 179 print_node (FILE *file, const char *prefix, tree node, int indent)
 180 {
 181   int hash;
 182   struct bucket *b;
 183   machine_mode mode;
 184   enum tree_code_class tclass;
 185   int len;
 186   int i;
 187   expanded_location xloc;
 188   enum tree_code code;
 189
 190   if (node == 0)
 191     return;
 192
 193   code = TREE_CODE (node);
 194   tclass = TREE_CODE_CLASS (code);
 195
 196   /* Don't get too deep in nesting.  If the user wants to see deeper,
 197      it is easy to use the address of a lowest-level node
 198      as an argument in another call to debug_tree.  */
 199
 200   if (indent > 24)
 201     {
 202       print_node_brief (file, prefix, node, indent);
 203       return;
 204     }
 205
 206   if (indent > 8 && (tclass == tcc_type || tclass == tcc_declaration))
 207     {
 208       print_node_brief (file, prefix, node, indent);
 209       return;
 210     }
 211
 212   /* It is unsafe to look at any other fields of an ERROR_MARK node.  */
 213   if (code == ERROR_MARK)
 214     {
 215       print_node_brief (file, prefix, node, indent);
 216       return;
 217     }
 218
 219   /* Allow this function to be called if the table is not there.  */
 220   if (table)
 221     {
 222       hash = ((uintptr_t) node) % HASH_SIZE;
 223
 224       /* If node is in the table, just mention its address.  */
 225       for (b = table[hash]; b; b = b->next)
 226         if (b->node == node)
 227           {
 228             print_node_brief (file, prefix, node, indent);
 229             return;
 230           }
 231
 232       /* Add this node to the table.  */
 233       b = XNEW (struct bucket);
 234       b->node = node;
 235       b->next = table[hash];
 236       table[hash] = b;
 237     }
 238
 239   /* Indent to the specified column, since this is the long form.  */
 240   indent_to (file, indent);
 241
 242   /* Print the slot this node is in, and its code, and address.  */
 243   fprintf (file, "%s <%s", prefix, get_tree_code_name (code));
 244   dump_addr (file, " ", node);
 245
 246   /* Print the name, if any.  */
 247   if (tclass == tcc_declaration)
 248     {
 249       if (DECL_NAME (node))
 250         fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
 251       else if (code == LABEL_DECL
 252                && LABEL_DECL_UID (node) != -1)
 253         {
 254           if (dump_flags & TDF_NOUID)
 255             fprintf (file, " L.xxxx");
 256           else
 257             fprintf (file, " L.%d", (int) LABEL_DECL_UID (node));
 258         }
 259       else
 260         {
 261           if (dump_flags & TDF_NOUID)
 262             fprintf (file, " %c.xxxx", code == CONST_DECL ? 'C' : 'D');
 263           else
 264             fprintf (file, " %c.%u", code == CONST_DECL ? 'C' : 'D',
 265                      DECL_UID (node));
 266         }
 267     }
 268   else if (tclass == tcc_type)
 269     {
 270       if (TYPE_NAME (node))
 271         {
 272           if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
 273             fprintf (file, " %s", IDENTIFIER_POINTER (TYPE_NAME (node)));
 274           else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
 275                    && DECL_NAME (TYPE_NAME (node)))
 276             fprintf (file, " %s",
 277                      IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node))));
 278         }
 279     }
 280   if (code == IDENTIFIER_NODE)
 281     fprintf (file, " %s", IDENTIFIER_POINTER (node));
 282
 283   if (code == INTEGER_CST)
 284     {
 285       if (indent <= 4)
 286         print_node_brief (file, "type", TREE_TYPE (node), indent + 4);
 287     }
 288   else if (CODE_CONTAINS_STRUCT (code, TS_TYPED))
 289     {
 290       print_node (file, "type", TREE_TYPE (node), indent + 4);
 291       if (TREE_TYPE (node))
 292         indent_to (file, indent + 3);
 293     }
 294
 295   if (!TYPE_P (node) && TREE_SIDE_EFFECTS (node))
 296     fputs (" side-effects", file);
 297
 298   if (TYPE_P (node) ? TYPE_READONLY (node) : TREE_READONLY (node))
 299     fputs (" readonly", file);
 300   if (TYPE_P (node) && TYPE_ATOMIC (node))
 301     fputs (" atomic", file);
 302   if (!TYPE_P (node) && TREE_CONSTANT (node))
 303     fputs (" constant", file);
 304   else if (TYPE_P (node) && TYPE_SIZES_GIMPLIFIED (node))
 305     fputs (" sizes-gimplified", file);
 306
 307   if (TYPE_P (node) && !ADDR_SPACE_GENERIC_P (TYPE_ADDR_SPACE (node)))
 308     fprintf (file, " address-space-%d", TYPE_ADDR_SPACE (node));
 309
 310   if (TREE_ADDRESSABLE (node))
 311     fputs (" addressable", file);
 312   if (TREE_THIS_VOLATILE (node))
 313     fputs (" volatile", file);
 314   if (TREE_ASM_WRITTEN (node))
 315     fputs (" asm_written", file);
 316   if (TREE_USED (node))
 317     fputs (" used", file);
 318   if (TREE_NOTHROW (node))
 319     fputs (" nothrow", file);
 320   if (TREE_PUBLIC (node))
 321     fputs (" public", file);
 322   if (TREE_PRIVATE (node))
 323     fputs (" private", file);
 324   if (TREE_PROTECTED (node))
 325     fputs (" protected", file);
 326   if (TREE_STATIC (node))
 327     fputs (code == CALL_EXPR ? " must-tail-call" : " static", file);
 328   if (TREE_DEPRECATED (node))
 329     fputs (" deprecated", file);
 330   if (TREE_VISITED (node))
 331     fputs (" visited", file);
 332
 333   if (code != TREE_VEC && code != INTEGER_CST && code != SSA_NAME)
 334     {
 335       if (TREE_LANG_FLAG_0 (node))
 336         fputs (" tree_0", file);
 337       if (TREE_LANG_FLAG_1 (node))
 338         fputs (" tree_1", file);
 339       if (TREE_LANG_FLAG_2 (node))
 340         fputs (" tree_2", file);
 341       if (TREE_LANG_FLAG_3 (node))
 342         fputs (" tree_3", file);
 343       if (TREE_LANG_FLAG_4 (node))
 344         fputs (" tree_4", file);
 345       if (TREE_LANG_FLAG_5 (node))
 346         fputs (" tree_5", file);
 347       if (TREE_LANG_FLAG_6 (node))
 348         fputs (" tree_6", file);
 349     }
 350
 351   /* DECL_ nodes have additional attributes.  */
 352
 353   switch (TREE_CODE_CLASS (code))
 354     {
 355     case tcc_declaration:
 356       if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
 357         {
 358           if (DECL_UNSIGNED (node))
 359             fputs (" unsigned", file);
 360           if (DECL_IGNORED_P (node))
 361             fputs (" ignored", file);
 362           if (DECL_ABSTRACT_P (node))
 363             fputs (" abstract", file);
 364           if (DECL_EXTERNAL (node))
 365             fputs (" external", file);
 366           if (DECL_NONLOCAL (node))
 367             fputs (" nonlocal", file);
 368         }
 369       if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
 370         {
 371           if (DECL_WEAK (node))
 372             fputs (" weak", file);
 373           if (DECL_IN_SYSTEM_HEADER (node))
 374             fputs (" in_system_header", file);
 375         }
 376       if (CODE_CONTAINS_STRUCT (code, TS_DECL_WRTL)
 377           && code != LABEL_DECL
 378           && code != FUNCTION_DECL
 379           && DECL_REGISTER (node))
 380         fputs (" regdecl", file);
 381
 382       if (code == TYPE_DECL && TYPE_DECL_SUPPRESS_DEBUG (node))
 383         fputs (" suppress-debug", file);
 384
 385       if (code == FUNCTION_DECL
 386           && DECL_FUNCTION_SPECIFIC_TARGET (node))
 387         fputs (" function-specific-target", file);
 388       if (code == FUNCTION_DECL
 389           && DECL_FUNCTION_SPECIFIC_OPTIMIZATION (node))
 390         fputs (" function-specific-opt", file);
 391       if (code == FUNCTION_DECL && DECL_DECLARED_INLINE_P (node))
 392         fputs (" autoinline", file);
 393       if (code == FUNCTION_DECL && DECL_BUILT_IN (node))
 394         fputs (" built-in", file);
 395       if (code == FUNCTION_DECL && DECL_STATIC_CHAIN (node))
 396         fputs (" static-chain", file);
 397       if (TREE_CODE (node) == FUNCTION_DECL && decl_is_tm_clone (node))
 398         fputs (" tm-clone", file);
 399
 400       if (code == FIELD_DECL && DECL_PACKED (node))
 401         fputs (" packed", file);
 402       if (code == FIELD_DECL && DECL_BIT_FIELD (node))
 403         fputs (" bit-field", file);
 404       if (code == FIELD_DECL && DECL_NONADDRESSABLE_P (node))
 405         fputs (" nonaddressable", file);
 406
 407       if (code == LABEL_DECL && EH_LANDING_PAD_NR (node))
 408         fprintf (file, " landing-pad:%d", EH_LANDING_PAD_NR (node));
 409
 410       if (code == VAR_DECL && DECL_IN_TEXT_SECTION (node))
 411         fputs (" in-text-section", file);
 412       if (code == VAR_DECL && DECL_IN_CONSTANT_POOL (node))
 413         fputs (" in-constant-pool", file);
 414       if (code == VAR_DECL && DECL_COMMON (node))
 415         fputs (" common", file);
 416       if (code == VAR_DECL && DECL_THREAD_LOCAL_P (node))
 417         {
 418           fputs (" ", file);
 419           fputs (tls_model_names[DECL_TLS_MODEL (node)], file);
 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_LANG_FLAG_0 (node))
 429             fputs (" decl_0", file);
 430           if (DECL_LANG_FLAG_1 (node))
 431             fputs (" decl_1", file);
 432           if (DECL_LANG_FLAG_2 (node))
 433             fputs (" decl_2", file);
 434           if (DECL_LANG_FLAG_3 (node))
 435             fputs (" decl_3", file);
 436           if (DECL_LANG_FLAG_4 (node))
 437             fputs (" decl_4", file);
 438           if (DECL_LANG_FLAG_5 (node))
 439             fputs (" decl_5", file);
 440           if (DECL_LANG_FLAG_6 (node))
 441             fputs (" decl_6", file);
 442           if (DECL_LANG_FLAG_7 (node))
 443             fputs (" decl_7", file);
 444
 445           mode = DECL_MODE (node);
 446           fprintf (file, " %s", GET_MODE_NAME (mode));
 447         }
 448
 449       if ((code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
 450           && DECL_BY_REFERENCE (node))
 451         fputs (" passed-by-reference", file);
 452
 453       if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS)  && DECL_DEFER_OUTPUT (node))
 454         fputs (" defer-output", file);
 455
 456
 457       xloc = expand_location (DECL_SOURCE_LOCATION (node));
 458       fprintf (file, " file %s line %d col %d", xloc.file, xloc.line,
 459                xloc.column);
 460
 461       if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
 462         {
 463           print_node (file, "size", DECL_SIZE (node), indent + 4);
 464           print_node (file, "unit size", DECL_SIZE_UNIT (node), indent + 4);
 465
 466           if (code != FUNCTION_DECL || DECL_BUILT_IN (node))
 467             indent_to (file, indent + 3);
 468
 469           if (DECL_USER_ALIGN (node))
 470             fprintf (file, " user");
 471
 472           fprintf (file, " align %d", DECL_ALIGN (node));
 473           if (code == FIELD_DECL)
 474             fprintf (file, " offset_align " HOST_WIDE_INT_PRINT_UNSIGNED,
 475                      DECL_OFFSET_ALIGN (node));
 476
 477           if (code == FUNCTION_DECL && DECL_BUILT_IN (node))
 478             {
 479               if (DECL_BUILT_IN_CLASS (node) == BUILT_IN_MD)
 480                 fprintf (file, " built-in BUILT_IN_MD %d", DECL_FUNCTION_CODE (node));
 481               else
 482                 fprintf (file, " built-in %s:%s",
 483                          built_in_class_names[(int) DECL_BUILT_IN_CLASS (node)],
 484                          built_in_names[(int) DECL_FUNCTION_CODE (node)]);
 485             }
 486         }
 487       if (code == FIELD_DECL)
 488         {
 489           print_node (file, "offset", DECL_FIELD_OFFSET (node), indent + 4);
 490           print_node (file, "bit offset", DECL_FIELD_BIT_OFFSET (node),
 491                       indent + 4);
 492           if (DECL_BIT_FIELD_TYPE (node))
 493             print_node (file, "bit_field_type", DECL_BIT_FIELD_TYPE (node),
 494                         indent + 4);
 495         }
 496
 497       print_node_brief (file, "context", DECL_CONTEXT (node), indent + 4);
 498
 499       if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
 500         {
 501           print_node_brief (file, "attributes",
 502                             DECL_ATTRIBUTES (node), indent + 4);
 503           if (code != PARM_DECL)
 504             print_node_brief (file, "initial", DECL_INITIAL (node),
 505                               indent + 4);
 506         }
 507       if (CODE_CONTAINS_STRUCT (code, TS_DECL_WRTL))
 508         {
 509           print_node_brief (file, "abstract_origin",
 510                             DECL_ABSTRACT_ORIGIN (node), indent + 4);
 511         }
 512       if (CODE_CONTAINS_STRUCT (code, TS_DECL_NON_COMMON))
 513         {
 514           print_node (file, "result", DECL_RESULT_FLD (node), indent + 4);
 515         }
 516
 517       lang_hooks.print_decl (file, node, indent);
 518
 519       if (DECL_RTL_SET_P (node))
 520         {
 521           indent_to (file, indent + 4);
 522           print_rtl (file, DECL_RTL (node));
 523         }
 524
 525       if (code == PARM_DECL)
 526         {
 527           print_node (file, "arg-type", DECL_ARG_TYPE (node), indent + 4);
 528
 529           if (DECL_INCOMING_RTL (node) != 0)
 530             {
 531               indent_to (file, indent + 4);
 532               fprintf (file, "incoming-rtl ");
 533               print_rtl (file, DECL_INCOMING_RTL (node));
 534             }
 535         }
 536       else if (code == FUNCTION_DECL
 537                && DECL_STRUCT_FUNCTION (node) != 0)
 538         {
 539           print_node (file, "arguments", DECL_ARGUMENTS (node), indent + 4);
 540           indent_to (file, indent + 4);
 541           dump_addr (file, "struct-function ", DECL_STRUCT_FUNCTION (node));
 542         }
 543
 544       if ((code == VAR_DECL || code == PARM_DECL)
 545           && DECL_HAS_VALUE_EXPR_P (node))
 546         print_node (file, "value-expr", DECL_VALUE_EXPR (node), indent + 4);
 547
 548       /* Print the decl chain only if decl is at second level.  */
 549       if (indent == 4)
 550         print_node (file, "chain", TREE_CHAIN (node), indent + 4);
 551       else
 552         print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
 553       break;
 554
 555     case tcc_type:
 556       if (TYPE_UNSIGNED (node))
 557         fputs (" unsigned", file);
 558
 559       if (TYPE_NO_FORCE_BLK (node))
 560         fputs (" no-force-blk", file);
 561
 562       if (TYPE_STRING_FLAG (node))
 563         fputs (" string-flag", file);
 564
 565       if (TYPE_NEEDS_CONSTRUCTING (node))
 566         fputs (" needs-constructing", file);
 567
 568       if ((code == RECORD_TYPE
 569            || code == UNION_TYPE
 570            || code == QUAL_UNION_TYPE
 571            || code == ARRAY_TYPE)
 572           && TYPE_REVERSE_STORAGE_ORDER (node))
 573         fputs (" reverse-storage-order", file);
 574
 575       /* The transparent-union flag is used for different things in
 576          different nodes.  */
 577       if ((code == UNION_TYPE || code == RECORD_TYPE)
 578           && TYPE_TRANSPARENT_AGGR (node))
 579         fputs (" transparent-aggr", file);
 580       else if (code == ARRAY_TYPE
 581                && TYPE_NONALIASED_COMPONENT (node))
 582         fputs (" nonaliased-component", file);
 583
 584       if (TYPE_PACKED (node))
 585         fputs (" packed", file);
 586
 587       if (TYPE_RESTRICT (node))
 588         fputs (" restrict", file);
 589
 590       if (TYPE_LANG_FLAG_0 (node))
 591         fputs (" type_0", file);
 592       if (TYPE_LANG_FLAG_1 (node))
 593         fputs (" type_1", file);
 594       if (TYPE_LANG_FLAG_2 (node))
 595         fputs (" type_2", file);
 596       if (TYPE_LANG_FLAG_3 (node))
 597         fputs (" type_3", file);
 598       if (TYPE_LANG_FLAG_4 (node))
 599         fputs (" type_4", file);
 600       if (TYPE_LANG_FLAG_5 (node))
 601         fputs (" type_5", file);
 602       if (TYPE_LANG_FLAG_6 (node))
 603         fputs (" type_6", file);
 604       if (TYPE_LANG_FLAG_7 (node))
 605         fputs (" type_7", file);
 606
 607       mode = TYPE_MODE (node);
 608       fprintf (file, " %s", GET_MODE_NAME (mode));
 609
 610       print_node (file, "size", TYPE_SIZE (node), indent + 4);
 611       print_node (file, "unit size", TYPE_SIZE_UNIT (node), indent + 4);
 612       indent_to (file, indent + 3);
 613
 614       if (TYPE_USER_ALIGN (node))
 615         fprintf (file, " user");
 616
 617       fprintf (file, " align %d symtab %d alias set " HOST_WIDE_INT_PRINT_DEC,
 618                TYPE_ALIGN (node), TYPE_SYMTAB_ADDRESS (node),
 619                (HOST_WIDE_INT) TYPE_ALIAS_SET (node));
 620
 621       if (TYPE_STRUCTURAL_EQUALITY_P (node))
 622         fprintf (file, " structural equality");
 623       else
 624         dump_addr (file, " canonical type ", TYPE_CANONICAL (node));
 625
 626       print_node (file, "attributes", TYPE_ATTRIBUTES (node), indent + 4);
 627
 628       if (INTEGRAL_TYPE_P (node) || code == REAL_TYPE
 629           || code == FIXED_POINT_TYPE)
 630         {
 631           fprintf (file, " precision %d", TYPE_PRECISION (node));
 632           print_node_brief (file, "min", TYPE_MIN_VALUE (node), indent + 4);
 633           print_node_brief (file, "max", TYPE_MAX_VALUE (node), indent + 4);
 634         }
 635
 636       if (code == ENUMERAL_TYPE)
 637         print_node (file, "values", TYPE_VALUES (node), indent + 4);
 638       else if (code == ARRAY_TYPE)
 639         print_node (file, "domain", TYPE_DOMAIN (node), indent + 4);
 640       else if (code == VECTOR_TYPE)
 641         fprintf (file, " nunits %d", (int) TYPE_VECTOR_SUBPARTS (node));
 642       else if (code == RECORD_TYPE
 643                || code == UNION_TYPE
 644                || code == QUAL_UNION_TYPE)
 645         print_node (file, "fields", TYPE_FIELDS (node), indent + 4);
 646       else if (code == FUNCTION_TYPE
 647                || code == METHOD_TYPE)
 648         {
 649           if (TYPE_METHOD_BASETYPE (node))
 650             print_node_brief (file, "method basetype",
 651                               TYPE_METHOD_BASETYPE (node), indent + 4);
 652           print_node (file, "arg-types", TYPE_ARG_TYPES (node), indent + 4);
 653         }
 654       else if (code == OFFSET_TYPE)
 655         print_node_brief (file, "basetype", TYPE_OFFSET_BASETYPE (node),
 656                           indent + 4);
 657
 658       if (TYPE_CONTEXT (node))
 659         print_node_brief (file, "context", TYPE_CONTEXT (node), indent + 4);
 660
 661       lang_hooks.print_type (file, node, indent);
 662
 663       if (TYPE_POINTER_TO (node) || TREE_CHAIN (node))
 664         indent_to (file, indent + 3);
 665
 666       print_node_brief (file, "pointer_to_this", TYPE_POINTER_TO (node),
 667                         indent + 4);
 668       print_node_brief (file, "reference_to_this", TYPE_REFERENCE_TO (node),
 669                         indent + 4);
 670       print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
 671       break;
 672
 673     case tcc_expression:
 674     case tcc_comparison:
 675     case tcc_unary:
 676     case tcc_binary:
 677     case tcc_reference:
 678     case tcc_statement:
 679     case tcc_vl_exp:
 680       if (code == BIND_EXPR)
 681         {
 682           print_node (file, "vars", TREE_OPERAND (node, 0), indent + 4);
 683           print_node (file, "body", TREE_OPERAND (node, 1), indent + 4);
 684           print_node (file, "block", TREE_OPERAND (node, 2), indent + 4);
 685           break;
 686         }
 687       if (code == CALL_EXPR)
 688         {
 689           call_expr_arg_iterator iter;
 690           tree arg;
 691           print_node (file, "fn", CALL_EXPR_FN (node), indent + 4);
 692           print_node (file, "static_chain", CALL_EXPR_STATIC_CHAIN (node),
 693                       indent + 4);
 694           i = 0;
 695           FOR_EACH_CALL_EXPR_ARG (arg, iter, node)
 696             {
 697               /* Buffer big enough to format a 32-bit UINT_MAX into, plus
 698                  the text.  */
 699               char temp[15];
 700               sprintf (temp, "arg %u", i);
 701               print_node (file, temp, arg, indent + 4);
 702               i++;
 703             }
 704         }
 705       else
 706         {
 707           len = TREE_OPERAND_LENGTH (node);
 708
 709           for (i = 0; i < len; i++)
 710             {
 711               /* Buffer big enough to format a 32-bit UINT_MAX into, plus
 712                  the text.  */
 713               char temp[15];
 714
 715               sprintf (temp, "arg %d", i);
 716               print_node (file, temp, TREE_OPERAND (node, i), indent + 4);
 717             }
 718         }
 719       if (CODE_CONTAINS_STRUCT (code, TS_COMMON))
 720         print_node (file, "chain", TREE_CHAIN (node), indent + 4);
 721       break;
 722
 723     case tcc_constant:
 724     case tcc_exceptional:
 725       switch (code)
 726         {
 727         case INTEGER_CST:
 728           if (TREE_OVERFLOW (node))
 729             fprintf (file, " overflow");
 730
 731           fprintf (file, " ");
 732           print_dec (node, file, TYPE_SIGN (TREE_TYPE (node)));
 733           break;
 734
 735         case REAL_CST:
 736           {
 737             REAL_VALUE_TYPE d;
 738
 739             if (TREE_OVERFLOW (node))
 740               fprintf (file, " overflow");
 741
 742             d = TREE_REAL_CST (node);
 743             if (REAL_VALUE_ISINF (d))
 744               fprintf (file,  REAL_VALUE_NEGATIVE (d) ? " -Inf" : " Inf");
 745             else if (REAL_VALUE_ISNAN (d))
 746               fprintf (file, " Nan");
 747             else
 748               {
 749                 char string[64];
 750                 real_to_decimal (string, &d, sizeof (string), 0, 1);
 751                 fprintf (file, " %s", string);
 752               }
 753           }
 754           break;
 755
 756         case FIXED_CST:
 757           {
 758             FIXED_VALUE_TYPE f;
 759             char string[64];
 760
 761             if (TREE_OVERFLOW (node))
 762               fprintf (file, " overflow");
 763
 764             f = TREE_FIXED_CST (node);
 765             fixed_to_decimal (string, &f, sizeof (string));
 766             fprintf (file, " %s", string);
 767           }
 768           break;
 769
 770         case VECTOR_CST:
 771           {
 772             char buf[10];
 773             unsigned i;
 774
 775             for (i = 0; i < VECTOR_CST_NELTS (node); ++i)
 776               {
 777                 unsigned j;
 778                 /* Coalesce the output of identical consecutive elements.  */
 779                 for (j = i + 1; j < VECTOR_CST_NELTS (node); j++)
 780                   if (VECTOR_CST_ELT (node, j) != VECTOR_CST_ELT (node, i))
 781                     break;
 782                 j--;
 783                 if (i == j)
 784                   sprintf (buf, "elt%u: ", i);
 785                 else
 786                   sprintf (buf, "elt%u...elt%u: ", i, j);
 787                 print_node (file, buf, VECTOR_CST_ELT (node, i), indent + 4);
 788                 i = j;
 789               }
 790           }
 791           break;
 792
 793         case COMPLEX_CST:
 794           print_node (file, "real", TREE_REALPART (node), indent + 4);
 795           print_node (file, "imag", TREE_IMAGPART (node), indent + 4);
 796           break;
 797
 798         case STRING_CST:
 799           {
 800             const char *p = TREE_STRING_POINTER (node);
 801             int i = TREE_STRING_LENGTH (node);
 802             fputs (" \"", file);
 803             while (--i >= 0)
 804               {
 805                 char ch = *p++;
 806                 if (ch >= ' ' && ch < 127)
 807                   putc (ch, file);
 808                 else
 809                   fprintf (file, "\\%03o", ch & 0xFF);
 810               }
 811             fputc ('\"', file);
 812           }
 813           break;
 814
 815         case IDENTIFIER_NODE:
 816           lang_hooks.print_identifier (file, node, indent);
 817           break;
 818
 819         case TREE_LIST:
 820           print_node (file, "purpose", TREE_PURPOSE (node), indent + 4);
 821           print_node (file, "value", TREE_VALUE (node), indent + 4);
 822           print_node (file, "chain", TREE_CHAIN (node), indent + 4);
 823           break;
 824
 825         case TREE_VEC:
 826           len = TREE_VEC_LENGTH (node);
 827           fprintf (file, " length %d", len);
 828           for (i = 0; i < len; i++)
 829             if (TREE_VEC_ELT (node, i))
 830               {
 831               /* Buffer big enough to format a 32-bit UINT_MAX into, plus
 832                  the text.  */
 833                 char temp[15];
 834                 sprintf (temp, "elt %d", i);
 835                 print_node (file, temp, TREE_VEC_ELT (node, i), indent + 4);
 836               }
 837           break;
 838
 839         case CONSTRUCTOR:
 840           {
 841             unsigned HOST_WIDE_INT cnt;
 842             tree index, value;
 843             len = vec_safe_length (CONSTRUCTOR_ELTS (node));
 844             fprintf (file, " lngt %d", len);
 845             FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (node),
 846                                       cnt, index, value)
 847               {
 848                 print_node (file, "idx", index, indent + 4);
 849                 print_node (file, "val", value, indent + 4);
 850               }
 851           }
 852           break;
 853
 854         case STATEMENT_LIST:
 855           dump_addr (file, " head ", node->stmt_list.head);
 856           dump_addr (file, " tail ", node->stmt_list.tail);
 857           fprintf (file, " stmts");
 858           {
 859             tree_stmt_iterator i;
 860             for (i = tsi_start (node); !tsi_end_p (i); tsi_next (&i))
 861               {
 862                 /* Not printing the addresses of the (not-a-tree)
 863                    'struct tree_stmt_list_node's.  */
 864                 dump_addr (file, " ", tsi_stmt (i));
 865               }
 866             fprintf (file, "\n");
 867             for (i = tsi_start (node); !tsi_end_p (i); tsi_next (&i))
 868               {
 869                 /* Not printing the addresses of the (not-a-tree)
 870                    'struct tree_stmt_list_node's.  */
 871                 print_node (file, "stmt", tsi_stmt (i), indent + 4);
 872               }
 873           }
 874           break;
 875
 876         case BLOCK:
 877           print_node (file, "vars", BLOCK_VARS (node), indent + 4);
 878           print_node (file, "supercontext", BLOCK_SUPERCONTEXT (node),
 879                       indent + 4);
 880           print_node (file, "subblocks", BLOCK_SUBBLOCKS (node), indent + 4);
 881           print_node (file, "chain", BLOCK_CHAIN (node), indent + 4);
 882           print_node (file, "abstract_origin",
 883                       BLOCK_ABSTRACT_ORIGIN (node), indent + 4);
 884           break;
 885
 886         case SSA_NAME:
 887           print_node_brief (file, "var", SSA_NAME_VAR (node), indent + 4);
 888           indent_to (file, indent + 4);
 889           fprintf (file, "def_stmt ");
 890           {
 891             pretty_printer buffer;
 892             buffer.buffer->stream = file;
 893             pp_gimple_stmt_1 (&buffer, SSA_NAME_DEF_STMT (node), indent + 4, 0);
 894             pp_flush (&buffer);
 895           }
 896
 897           indent_to (file, indent + 4);
 898           fprintf (file, "version %u", SSA_NAME_VERSION (node));
 899           if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (node))
 900             fprintf (file, " in-abnormal-phi");
 901           if (SSA_NAME_IN_FREE_LIST (node))
 902             fprintf (file, " in-free-list");
 903
 904           if (SSA_NAME_PTR_INFO (node))
 905             {
 906               indent_to (file, indent + 3);
 907               if (SSA_NAME_PTR_INFO (node))
 908                 dump_addr (file, " ptr-info ", SSA_NAME_PTR_INFO (node));
 909             }
 910           break;
 911
 912         case OMP_CLAUSE:
 913             {
 914               int i;
 915               fprintf (file, " %s",
 916                        omp_clause_code_name[OMP_CLAUSE_CODE (node)]);
 917               for (i = 0; i < omp_clause_num_ops[OMP_CLAUSE_CODE (node)]; i++)
 918                 {
 919                   indent_to (file, indent + 4);
 920                   fprintf (file, "op %d:", i);
 921                   print_node_brief (file, "", OMP_CLAUSE_OPERAND (node, i), 0);
 922                 }
 923             }
 924           break;
 925
 926         case OPTIMIZATION_NODE:
 927           cl_optimization_print (file, indent + 4, TREE_OPTIMIZATION (node));
 928           break;
 929
 930         case TARGET_OPTION_NODE:
 931           cl_target_option_print (file, indent + 4, TREE_TARGET_OPTION (node));
 932           break;
 933         case IMPORTED_DECL:
 934           fprintf (file, " imported declaration");
 935           print_node_brief (file, "associated declaration",
 936                             IMPORTED_DECL_ASSOCIATED_DECL (node),
 937                             indent + 4);
 938           break;
 939
 940         case TREE_BINFO:
 941           fprintf (file, " bases %d",
 942                    vec_safe_length (BINFO_BASE_BINFOS (node)));
 943           print_node_brief (file, "offset", BINFO_OFFSET (node), indent + 4);
 944           print_node_brief (file, "virtuals", BINFO_VIRTUALS (node),
 945                             indent + 4);
 946           print_node_brief (file, "inheritance chain",
 947                             BINFO_INHERITANCE_CHAIN (node),
 948                             indent + 4);
 949           break;
 950
 951         default:
 952           if (EXCEPTIONAL_CLASS_P (node))
 953             lang_hooks.print_xnode (file, node, indent);
 954           break;
 955         }
 956
 957       break;
 958     }
 959
 960   if (EXPR_HAS_LOCATION (node))
 961     {
 962       expanded_location xloc = expand_location (EXPR_LOCATION (node));
 963       indent_to (file, indent+4);
 964       fprintf (file, "%s:%d:%d", xloc.file, xloc.line, xloc.column);
 965
 966       /* Print the range, if any */
 967       source_range r = EXPR_LOCATION_RANGE (node);
 968       if (r.m_start)
 969         {
 970           xloc = expand_location (r.m_start);
 971           fprintf (file, " start: %s:%d:%d", xloc.file, xloc.line, xloc.column);
 972         }
 973       else
 974         {
 975           fprintf (file, " start: unknown");
 976         }
 977       if (r.m_finish)
 978         {
 979           xloc = expand_location (r.m_finish);
 980           fprintf (file, " finish: %s:%d:%d", xloc.file, xloc.line, xloc.column);
 981         }
 982       else
 983         {
 984           fprintf (file, " finish: unknown");
 985         }
 986     }
 987
 988   fprintf (file, ">");
 989 }
 990
 991
 992 /* Print the node NODE on standard error, for debugging.
 993    Most nodes referred to by this one are printed recursively
 994    down to a depth of six.  */
 995
 996 DEBUG_FUNCTION void
 997 debug_tree (tree node)
 998 {
 999   table = XCNEWVEC (struct bucket *, HASH_SIZE);
1000   print_node (stderr, "", node, 0);
1001   free (table);
1002   table = 0;
1003   putc ('\n', stderr);
1004 }
1005
1006 DEBUG_FUNCTION void
1007 debug_raw (const tree_node &ref)
1008 {
1009   debug_tree (const_cast <tree> (&ref));
1010 }
1011
1012 DEBUG_FUNCTION void
1013 debug_raw (const tree_node *ptr)
1014 {
1015   if (ptr)
1016     debug_raw (*ptr);
1017   else
1018     fprintf (stderr, "<nil>\n");
1019 }
1020
1021 static void
1022 dump_tree_via_hooks (const tree_node *ptr, int options)
1023 {
1024   if (DECL_P (ptr))
1025     lang_hooks.print_decl (stderr, const_cast <tree_node*> (ptr), 0);
1026   else if (TYPE_P (ptr))
1027     lang_hooks.print_type (stderr, const_cast <tree_node*> (ptr), 0);
1028   else if (TREE_CODE (ptr) == IDENTIFIER_NODE)
1029     lang_hooks.print_identifier (stderr, const_cast <tree_node*> (ptr), 0);
1030   else
1031     print_generic_expr (stderr, const_cast <tree_node*> (ptr), options);
1032   fprintf (stderr, "\n");
1033 }
1034
1035 DEBUG_FUNCTION void
1036 debug (const tree_node &ref)
1037 {
1038   dump_tree_via_hooks (&ref, 0);
1039 }
1040
1041 DEBUG_FUNCTION void
1042 debug (const tree_node *ptr)
1043 {
1044   if (ptr)
1045     debug (*ptr);
1046   else
1047     fprintf (stderr, "<nil>\n");
1048 }
1049
1050 DEBUG_FUNCTION void
1051 debug_verbose (const tree_node &ref)
1052 {
1053   dump_tree_via_hooks (&ref, TDF_VERBOSE);
1054 }
1055
1056 DEBUG_FUNCTION void
1057 debug_verbose (const tree_node *ptr)
1058 {
1059   if (ptr)
1060     debug_verbose (*ptr);
1061   else
1062     fprintf (stderr, "<nil>\n");
1063 }
1064
1065 DEBUG_FUNCTION void
1066 debug_head (const tree_node &ref)
1067 {
1068   debug (ref);
1069 }
1070
1071 DEBUG_FUNCTION void
1072 debug_head (const tree_node *ptr)
1073 {
1074   if (ptr)
1075     debug_head (*ptr);
1076   else
1077     fprintf (stderr, "<nil>\n");
1078 }
1079
1080 DEBUG_FUNCTION void
1081 debug_body (const tree_node &ref)
1082 {
1083   if (TREE_CODE (&ref) == FUNCTION_DECL)
1084     dump_function_to_file (const_cast <tree_node*> (&ref), stderr, 0);
1085   else
1086     debug (ref);
1087 }
1088
1089 DEBUG_FUNCTION void
1090 debug_body (const tree_node *ptr)
1091 {
1092   if (ptr)
1093     debug_body (*ptr);
1094   else
1095     fprintf (stderr, "<nil>\n");
1096 }
1097
1098 /* Print the vector of trees VEC on standard error, for debugging.
1099    Most nodes referred to by this one are printed recursively
1100    down to a depth of six.  */
1101
1102 DEBUG_FUNCTION void
1103 debug_raw (vec<tree, va_gc> &ref)
1104 {
1105   tree elt;
1106   unsigned ix;
1107
1108   /* Print the slot this node is in, and its code, and address.  */
1109   fprintf (stderr, "<VEC");
1110   dump_addr (stderr, " ", ref.address ());
1111
1112   FOR_EACH_VEC_ELT (ref, ix, elt)
1113     {
1114       fprintf (stderr, "elt %d ", ix);
1115       debug_raw (elt);
1116     }
1117 }
1118
1119 DEBUG_FUNCTION void
1120 debug (vec<tree, va_gc> &ref)
1121 {
1122   tree elt;
1123   unsigned ix;
1124
1125   /* Print the slot this node is in, and its code, and address.  */
1126   fprintf (stderr, "<VEC");
1127   dump_addr (stderr, " ", ref.address ());
1128
1129   FOR_EACH_VEC_ELT (ref, ix, elt)
1130     {
1131       fprintf (stderr, "elt %d ", ix);
1132       debug (elt);
1133     }
1134 }
1135
1136 DEBUG_FUNCTION void
1137 debug (vec<tree, va_gc> *ptr)
1138 {
1139   if (ptr)
1140     debug (*ptr);
1141   else
1142     fprintf (stderr, "<nil>\n");
1143 }
1144
1145 DEBUG_FUNCTION void
1146 debug_raw (vec<tree, va_gc> *ptr)
1147 {
1148   if (ptr)
1149     debug_raw (*ptr);
1150   else
1151     fprintf (stderr, "<nil>\n");
1152 }
1153
1154 DEBUG_FUNCTION void
1155 debug_vec_tree (vec<tree, va_gc> *vec)
1156 {
1157   debug_raw (vec);
1158 }