gcc/print-tree.c

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