gcc/print-tree.c

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