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
  39 /* Define the hash table of nodes already seen.
  40    Such nodes are not repeated; brief cross-references are used.  */
  41
  42 #define HASH_SIZE 37
  43
  44 struct bucket
  45 {
  46   tree node;
  47   struct bucket *next;
  48 };
  49
  50 static struct bucket **table;
  51
  52 /* Print PREFIX and ADDR to FILE.  */
  53 void
  54 dump_addr (FILE *file, const char *prefix, const void *addr)
  55 {
  56   if (flag_dump_noaddr || flag_dump_unnumbered)
  57     fprintf (file, "%s#", prefix);
  58   else
  59     fprintf (file, "%s" HOST_PTR_PRINTF, prefix, addr);
  60 }
  61
  62 /* Print a node in brief fashion, with just the code, address and name.  */
  63
  64 void
  65 print_node_brief (FILE *file, const char *prefix, const_tree node, int indent)
  66 {
  67   enum tree_code_class tclass;
  68
  69   if (node == 0)
  70     return;
  71
  72   tclass = TREE_CODE_CLASS (TREE_CODE (node));
  73
  74   /* Always print the slot this node is in, and its code, address and
  75      name if any.  */
  76   if (indent > 0)
  77     fprintf (file, " ");
  78   fprintf (file, "%s <%s", prefix, get_tree_code_name (TREE_CODE (node)));
  79   dump_addr (file, " ", node);
  80
  81   if (tclass == tcc_declaration)
  82     {
  83       if (DECL_NAME (node))
  84         fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
  85       else if (TREE_CODE (node) == LABEL_DECL
  86                && LABEL_DECL_UID (node) != -1)
  87         {
  88           if (dump_flags & TDF_NOUID)
  89             fprintf (file, " L.xxxx");
  90           else
  91             fprintf (file, " L.%d", (int) LABEL_DECL_UID (node));
  92         }
  93       else
  94         {
  95           if (dump_flags & TDF_NOUID)
  96             fprintf (file, " %c.xxxx",
  97                      TREE_CODE (node) == CONST_DECL ? 'C' : 'D');
  98           else
  99             fprintf (file, " %c.%u",
 100                      TREE_CODE (node) == CONST_DECL ? 'C' : 'D',
 101                      DECL_UID (node));
 102         }
 103     }
 104   else if (tclass == tcc_type)
 105     {
 106       if (TYPE_NAME (node))
 107         {
 108           if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
 109             fprintf (file, " %s", IDENTIFIER_POINTER (TYPE_NAME (node)));
 110           else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
 111                    && DECL_NAME (TYPE_NAME (node)))
 112             fprintf (file, " %s",
 113                      IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node))));
 114         }
 115       if (!ADDR_SPACE_GENERIC_P (TYPE_ADDR_SPACE (node)))
 116         fprintf (file, " address-space-%d", TYPE_ADDR_SPACE (node));
 117     }
 118   if (TREE_CODE (node) == IDENTIFIER_NODE)
 119     fprintf (file, " %s", IDENTIFIER_POINTER (node));
 120
 121   /* We might as well always print the value of an integer or real.  */
 122   if (TREE_CODE (node) == INTEGER_CST)
 123     {
 124       if (TREE_OVERFLOW (node))
 125         fprintf (file, " overflow");
 126
 127       fprintf (file, " ");
 128       if (TREE_INT_CST_HIGH (node) == 0)
 129         fprintf (file, HOST_WIDE_INT_PRINT_UNSIGNED, TREE_INT_CST_LOW (node));
 130       else if (TREE_INT_CST_HIGH (node) == -1
 131                && TREE_INT_CST_LOW (node) != 0)
 132         fprintf (file, "-" HOST_WIDE_INT_PRINT_UNSIGNED,
 133                  -TREE_INT_CST_LOW (node));
 134       else
 135         fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
 136                  (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (node),
 137                  (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (node));
 138     }
 139   if (TREE_CODE (node) == REAL_CST)
 140     {
 141       REAL_VALUE_TYPE d;
 142
 143       if (TREE_OVERFLOW (node))
 144         fprintf (file, " overflow");
 145
 146       d = TREE_REAL_CST (node);
 147       if (REAL_VALUE_ISINF (d))
 148         fprintf (file,  REAL_VALUE_NEGATIVE (d) ? " -Inf" : " Inf");
 149       else if (REAL_VALUE_ISNAN (d))
 150         fprintf (file, " Nan");
 151       else
 152         {
 153           char string[60];
 154           real_to_decimal (string, &d, sizeof (string), 0, 1);
 155           fprintf (file, " %s", string);
 156         }
 157     }
 158   if (TREE_CODE (node) == FIXED_CST)
 159     {
 160       FIXED_VALUE_TYPE f;
 161       char string[60];
 162
 163       if (TREE_OVERFLOW (node))
 164         fprintf (file, " overflow");
 165
 166       f = TREE_FIXED_CST (node);
 167       fixed_to_decimal (string, &f, sizeof (string));
 168       fprintf (file, " %s", string);
 169     }
 170
 171   fprintf (file, ">");
 172 }
 173
 174 void
 175 indent_to (FILE *file, int column)
 176 {
 177   int i;
 178
 179   /* Since this is the long way, indent to desired column.  */
 180   if (column > 0)
 181     fprintf (file, "\n");
 182   for (i = 0; i < column; i++)
 183     fprintf (file, " ");
 184 }
 185 \f
 186 /* Print the node NODE in full on file FILE, preceded by PREFIX,
 187    starting in column INDENT.  */
 188
 189 void
 190 print_node (FILE *file, const char *prefix, tree node, int indent)
 191 {
 192   int hash;
 193   struct bucket *b;
 194   enum machine_mode mode;
 195   enum tree_code_class tclass;
 196   int len;
 197   int i;
 198   expanded_location xloc;
 199   enum tree_code code;
 200
 201   if (node == 0)
 202     return;
 203
 204   code = TREE_CODE (node);
 205   tclass = TREE_CODE_CLASS (code);
 206
 207   /* Don't get too deep in nesting.  If the user wants to see deeper,
 208      it is easy to use the address of a lowest-level node
 209      as an argument in another call to debug_tree.  */
 210
 211   if (indent > 24)
 212     {
 213       print_node_brief (file, prefix, node, indent);
 214       return;
 215     }
 216
 217   if (indent > 8 && (tclass == tcc_type || tclass == tcc_declaration))
 218     {
 219       print_node_brief (file, prefix, node, indent);
 220       return;
 221     }
 222
 223   /* It is unsafe to look at any other fields of an ERROR_MARK node.  */
 224   if (code == ERROR_MARK)
 225     {
 226       print_node_brief (file, prefix, node, indent);
 227       return;
 228     }
 229
 230   /* Allow this function to be called if the table is not there.  */
 231   if (table)
 232     {
 233       hash = ((uintptr_t) node) % HASH_SIZE;
 234
 235       /* If node is in the table, just mention its address.  */
 236       for (b = table[hash]; b; b = b->next)
 237         if (b->node == node)
 238           {
 239             print_node_brief (file, prefix, node, indent);
 240             return;
 241           }
 242
 243       /* Add this node to the table.  */
 244       b = XNEW (struct bucket);
 245       b->node = node;
 246       b->next = table[hash];
 247       table[hash] = b;
 248     }
 249
 250   /* Indent to the specified column, since this is the long form.  */
 251   indent_to (file, indent);
 252
 253   /* Print the slot this node is in, and its code, and address.  */
 254   fprintf (file, "%s <%s", prefix, get_tree_code_name (code));
 255   dump_addr (file, " ", node);
 256
 257   /* Print the name, if any.  */
 258   if (tclass == tcc_declaration)
 259     {
 260       if (DECL_NAME (node))
 261         fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
 262       else if (code == LABEL_DECL
 263                && LABEL_DECL_UID (node) != -1)
 264         {
 265           if (dump_flags & TDF_NOUID)
 266             fprintf (file, " L.xxxx");
 267           else
 268             fprintf (file, " L.%d", (int) LABEL_DECL_UID (node));
 269         }
 270       else
 271         {
 272           if (dump_flags & TDF_NOUID)
 273             fprintf (file, " %c.xxxx", code == CONST_DECL ? 'C' : 'D');
 274           else
 275             fprintf (file, " %c.%u", code == CONST_DECL ? 'C' : 'D',
 276                      DECL_UID (node));
 277         }
 278     }
 279   else if (tclass == tcc_type)
 280     {
 281       if (TYPE_NAME (node))
 282         {
 283           if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
 284             fprintf (file, " %s", IDENTIFIER_POINTER (TYPE_NAME (node)));
 285           else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
 286                    && DECL_NAME (TYPE_NAME (node)))
 287             fprintf (file, " %s",
 288                      IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node))));
 289         }
 290     }
 291   if (code == IDENTIFIER_NODE)
 292     fprintf (file, " %s", IDENTIFIER_POINTER (node));
 293
 294   if (code == INTEGER_CST)
 295     {
 296       if (indent <= 4)
 297         print_node_brief (file, "type", TREE_TYPE (node), indent + 4);
 298     }
 299   else if (CODE_CONTAINS_STRUCT (code, TS_TYPED))
 300     {
 301       print_node (file, "type", TREE_TYPE (node), indent + 4);
 302       if (TREE_TYPE (node))
 303         indent_to (file, indent + 3);
 304     }
 305
 306   if (!TYPE_P (node) && TREE_SIDE_EFFECTS (node))
 307     fputs (" side-effects", file);
 308
 309   if (TYPE_P (node) ? TYPE_READONLY (node) : TREE_READONLY (node))
 310     fputs (" readonly", file);
 311   if (TYPE_P (node) && TYPE_ATOMIC (node))
 312     fputs (" atomic", file);
 313   if (!TYPE_P (node) && TREE_CONSTANT (node))
 314     fputs (" constant", file);
 315   else if (TYPE_P (node) && TYPE_SIZES_GIMPLIFIED (node))
 316     fputs (" sizes-gimplified", file);
 317
 318   if (TYPE_P (node) && !ADDR_SPACE_GENERIC_P (TYPE_ADDR_SPACE (node)))
 319     fprintf (file, " address-space-%d", TYPE_ADDR_SPACE (node));
 320
 321   if (TREE_ADDRESSABLE (node))
 322     fputs (" addressable", file);
 323   if (TREE_THIS_VOLATILE (node))
 324     fputs (" volatile", file);
 325   if (TREE_ASM_WRITTEN (node))
 326     fputs (" asm_written", file);
 327   if (TREE_USED (node))
 328     fputs (" used", file);
 329   if (TREE_NOTHROW (node))
 330     fputs (TYPE_P (node) ? " align-ok" : " nothrow", file);
 331   if (TREE_PUBLIC (node))
 332     fputs (" public", file);
 333   if (TREE_PRIVATE (node))
 334     fputs (" private", file);
 335   if (TREE_PROTECTED (node))
 336     fputs (" protected", file);
 337   if (TREE_STATIC (node))
 338     fputs (" static", file);
 339   if (TREE_DEPRECATED (node))
 340     fputs (" deprecated", file);
 341   if (TREE_VISITED (node))
 342     fputs (" visited", file);
 343
 344   if (code != TREE_VEC && code != SSA_NAME)
 345     {
 346       if (TREE_LANG_FLAG_0 (node))
 347         fputs (" tree_0", file);
 348       if (TREE_LANG_FLAG_1 (node))
 349         fputs (" tree_1", file);
 350       if (TREE_LANG_FLAG_2 (node))
 351         fputs (" tree_2", file);
 352       if (TREE_LANG_FLAG_3 (node))
 353         fputs (" tree_3", file);
 354       if (TREE_LANG_FLAG_4 (node))
 355         fputs (" tree_4", file);
 356       if (TREE_LANG_FLAG_5 (node))
 357         fputs (" tree_5", file);
 358       if (TREE_LANG_FLAG_6 (node))
 359         fputs (" tree_6", file);
 360     }
 361
 362   /* DECL_ nodes have additional attributes.  */
 363
 364   switch (TREE_CODE_CLASS (code))
 365     {
 366     case tcc_declaration:
 367       if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
 368         {
 369           if (DECL_UNSIGNED (node))
 370             fputs (" unsigned", file);
 371           if (DECL_IGNORED_P (node))
 372             fputs (" ignored", file);
 373           if (DECL_ABSTRACT (node))
 374             fputs (" abstract", file);
 375           if (DECL_EXTERNAL (node))
 376             fputs (" external", file);
 377           if (DECL_NONLOCAL (node))
 378             fputs (" nonlocal", file);
 379         }
 380       if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
 381         {
 382           if (DECL_WEAK (node))
 383             fputs (" weak", file);
 384           if (DECL_IN_SYSTEM_HEADER (node))
 385             fputs (" in_system_header", file);
 386         }
 387       if (CODE_CONTAINS_STRUCT (code, TS_DECL_WRTL)
 388           && code != LABEL_DECL
 389           && code != FUNCTION_DECL
 390           && DECL_REGISTER (node))
 391         fputs (" regdecl", file);
 392
 393       if (code == TYPE_DECL && TYPE_DECL_SUPPRESS_DEBUG (node))
 394         fputs (" suppress-debug", file);
 395
 396       if (code == FUNCTION_DECL
 397           && DECL_FUNCTION_SPECIFIC_TARGET (node))
 398         fputs (" function-specific-target", file);
 399       if (code == FUNCTION_DECL
 400           && DECL_FUNCTION_SPECIFIC_OPTIMIZATION (node))
 401         fputs (" function-specific-opt", file);
 402       if (code == FUNCTION_DECL && DECL_DECLARED_INLINE_P (node))
 403         fputs (" autoinline", file);
 404       if (code == FUNCTION_DECL && DECL_BUILT_IN (node))
 405         fputs (" built-in", file);
 406       if (code == FUNCTION_DECL && DECL_STATIC_CHAIN (node))
 407         fputs (" static-chain", file);
 408       if (TREE_CODE (node) == FUNCTION_DECL && decl_is_tm_clone (node))
 409         fputs (" tm-clone", file);
 410
 411       if (code == FIELD_DECL && DECL_PACKED (node))
 412         fputs (" packed", file);
 413       if (code == FIELD_DECL && DECL_BIT_FIELD (node))
 414         fputs (" bit-field", file);
 415       if (code == FIELD_DECL && DECL_NONADDRESSABLE_P (node))
 416         fputs (" nonaddressable", file);
 417
 418       if (code == LABEL_DECL && EH_LANDING_PAD_NR (node))
 419         fprintf (file, " landing-pad:%d", EH_LANDING_PAD_NR (node));
 420
 421       if (code == VAR_DECL && DECL_IN_TEXT_SECTION (node))
 422         fputs (" in-text-section", file);
 423       if (code == VAR_DECL && DECL_IN_CONSTANT_POOL (node))
 424         fputs (" in-constant-pool", file);
 425       if (code == VAR_DECL && DECL_COMMON (node))
 426         fputs (" common", file);
 427       if (code == VAR_DECL && DECL_THREAD_LOCAL_P (node))
 428         {
 429           enum tls_model kind = DECL_TLS_MODEL (node);
 430           switch (kind)
 431             {
 432               case TLS_MODEL_GLOBAL_DYNAMIC:
 433                 fputs (" tls-global-dynamic", file);
 434                 break;
 435               case TLS_MODEL_LOCAL_DYNAMIC:
 436                 fputs (" tls-local-dynamic", file);
 437                 break;
 438               case TLS_MODEL_INITIAL_EXEC:
 439                 fputs (" tls-initial-exec", file);
 440                 break;
 441               case TLS_MODEL_LOCAL_EXEC:
 442                 fputs (" tls-local-exec", file);
 443                 break;
 444               default:
 445                 gcc_unreachable ();
 446             }
 447         }
 448
 449       if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
 450         {
 451           if (DECL_VIRTUAL_P (node))
 452             fputs (" virtual", file);
 453           if (DECL_PRESERVE_P (node))
 454             fputs (" preserve", file);
 455           if (DECL_LANG_FLAG_0 (node))
 456             fputs (" decl_0", file);
 457           if (DECL_LANG_FLAG_1 (node))
 458             fputs (" decl_1", file);
 459           if (DECL_LANG_FLAG_2 (node))
 460             fputs (" decl_2", file);
 461           if (DECL_LANG_FLAG_3 (node))
 462             fputs (" decl_3", file);
 463           if (DECL_LANG_FLAG_4 (node))
 464             fputs (" decl_4", file);
 465           if (DECL_LANG_FLAG_5 (node))
 466             fputs (" decl_5", file);
 467           if (DECL_LANG_FLAG_6 (node))
 468             fputs (" decl_6", file);
 469           if (DECL_LANG_FLAG_7 (node))
 470             fputs (" decl_7", file);
 471
 472           mode = DECL_MODE (node);
 473           fprintf (file, " %s", GET_MODE_NAME (mode));
 474         }
 475
 476       if ((code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
 477           && DECL_BY_REFERENCE (node))
 478         fputs (" passed-by-reference", file);
 479
 480       if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS)  && DECL_DEFER_OUTPUT (node))
 481         fputs (" defer-output", file);
 482
 483
 484       xloc = expand_location (DECL_SOURCE_LOCATION (node));
 485       fprintf (file, " file %s line %d col %d", xloc.file, xloc.line,
 486                xloc.column);
 487
 488       if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
 489         {
 490           print_node (file, "size", DECL_SIZE (node), indent + 4);
 491           print_node (file, "unit size", DECL_SIZE_UNIT (node), indent + 4);
 492
 493           if (code != FUNCTION_DECL || DECL_BUILT_IN (node))
 494             indent_to (file, indent + 3);
 495
 496           if (DECL_USER_ALIGN (node))
 497             fprintf (file, " user");
 498
 499           fprintf (file, " align %d", DECL_ALIGN (node));
 500           if (code == FIELD_DECL)
 501             fprintf (file, " offset_align " HOST_WIDE_INT_PRINT_UNSIGNED,
 502                      DECL_OFFSET_ALIGN (node));
 503
 504           if (code == FUNCTION_DECL && DECL_BUILT_IN (node))
 505             {
 506               if (DECL_BUILT_IN_CLASS (node) == BUILT_IN_MD)
 507                 fprintf (file, " built-in BUILT_IN_MD %d", DECL_FUNCTION_CODE (node));
 508               else
 509                 fprintf (file, " built-in %s:%s",
 510                          built_in_class_names[(int) DECL_BUILT_IN_CLASS (node)],
 511                          built_in_names[(int) DECL_FUNCTION_CODE (node)]);
 512             }
 513         }
 514       if (code == FIELD_DECL)
 515         {
 516           print_node (file, "offset", DECL_FIELD_OFFSET (node), indent + 4);
 517           print_node (file, "bit offset", DECL_FIELD_BIT_OFFSET (node),
 518                       indent + 4);
 519           if (DECL_BIT_FIELD_TYPE (node))
 520             print_node (file, "bit_field_type", DECL_BIT_FIELD_TYPE (node),
 521                         indent + 4);
 522         }
 523
 524       print_node_brief (file, "context", DECL_CONTEXT (node), indent + 4);
 525
 526       if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
 527         {
 528           print_node_brief (file, "attributes",
 529                             DECL_ATTRIBUTES (node), indent + 4);
 530           if (code != PARM_DECL)
 531             print_node_brief (file, "initial", DECL_INITIAL (node),
 532                               indent + 4);
 533         }
 534       if (CODE_CONTAINS_STRUCT (code, TS_DECL_WRTL))
 535         {
 536           print_node_brief (file, "abstract_origin",
 537                             DECL_ABSTRACT_ORIGIN (node), indent + 4);
 538         }
 539       if (CODE_CONTAINS_STRUCT (code, TS_DECL_NON_COMMON))
 540         {
 541           print_node (file, "arguments", DECL_ARGUMENT_FLD (node), indent + 4);
 542           print_node (file, "result", DECL_RESULT_FLD (node), indent + 4);
 543         }
 544
 545       lang_hooks.print_decl (file, node, indent);
 546
 547       if (DECL_RTL_SET_P (node))
 548         {
 549           indent_to (file, indent + 4);
 550           print_rtl (file, DECL_RTL (node));
 551         }
 552
 553       if (code == PARM_DECL)
 554         {
 555           print_node (file, "arg-type", DECL_ARG_TYPE (node), indent + 4);
 556
 557           if (DECL_INCOMING_RTL (node) != 0)
 558             {
 559               indent_to (file, indent + 4);
 560               fprintf (file, "incoming-rtl ");
 561               print_rtl (file, DECL_INCOMING_RTL (node));
 562             }
 563         }
 564       else if (code == FUNCTION_DECL
 565                && DECL_STRUCT_FUNCTION (node) != 0)
 566         {
 567           indent_to (file, indent + 4);
 568           dump_addr (file, "struct-function ", DECL_STRUCT_FUNCTION (node));
 569         }
 570
 571       if ((code == VAR_DECL || code == PARM_DECL)
 572           && DECL_HAS_VALUE_EXPR_P (node))
 573         print_node (file, "value-expr", DECL_VALUE_EXPR (node), indent + 4);
 574
 575       /* Print the decl chain only if decl is at second level.  */
 576       if (indent == 4)
 577         print_node (file, "chain", TREE_CHAIN (node), indent + 4);
 578       else
 579         print_node_brief (file, "chain", TREE_CHAIN (node), indent + 4);
 580       break;
 581
 582     case tcc_type:
 583       if (TYPE_UNSIGNED (node))
 584         fputs (" unsigned", file);
 585
 586       if (TYPE_NO_FORCE_BLK (node))
 587         fputs (" no-force-blk", file);
 588
 589       if (TYPE_STRING_FLAG (node))
 590         fputs (" string-flag", file);
 591
 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
 965 /* Print the node NODE on standard error, for debugging.
 966    Most nodes referred to by this one are printed recursively
 967    down to a depth of six.  */
 968
 969 DEBUG_FUNCTION void
 970 debug_tree (tree node)
 971 {
 972   table = XCNEWVEC (struct bucket *, HASH_SIZE);
 973   print_node (stderr, "", node, 0);
 974   free (table);
 975   table = 0;
 976   putc ('\n', stderr);
 977 }
 978
 979 DEBUG_FUNCTION void
 980 debug_raw (const tree_node &ref)
 981 {
 982   debug_tree (const_cast <tree> (&ref));
 983 }
 984
 985 DEBUG_FUNCTION void
 986 debug_raw (const tree_node *ptr)
 987 {
 988   if (ptr)
 989     debug_raw (*ptr);
 990   else
 991     fprintf (stderr, "<nil>\n");
 992 }
 993
 994 static void
 995 dump_tree_via_hooks (const tree_node *ptr, int options)
 996 {
 997   if (DECL_P (ptr))
 998     lang_hooks.print_decl (stderr, const_cast <tree_node*> (ptr), 0);
 999   else if (TYPE_P (ptr))
1000     lang_hooks.print_type (stderr, const_cast <tree_node*> (ptr), 0);
1001   else if (TREE_CODE (ptr) == IDENTIFIER_NODE)
1002     lang_hooks.print_identifier (stderr, const_cast <tree_node*> (ptr), 0);
1003   else
1004     print_generic_expr (stderr, const_cast <tree_node*> (ptr), options);
1005   fprintf (stderr, "\n");
1006 }
1007
1008 DEBUG_FUNCTION void
1009 debug (const tree_node &ref)
1010 {
1011   dump_tree_via_hooks (&ref, 0);
1012 }
1013
1014 DEBUG_FUNCTION void
1015 debug (const tree_node *ptr)
1016 {
1017   if (ptr)
1018     debug (*ptr);
1019   else
1020     fprintf (stderr, "<nil>\n");
1021 }
1022
1023 DEBUG_FUNCTION void
1024 debug_verbose (const tree_node &ref)
1025 {
1026   dump_tree_via_hooks (&ref, TDF_VERBOSE);
1027 }
1028
1029 DEBUG_FUNCTION void
1030 debug_verbose (const tree_node *ptr)
1031 {
1032   if (ptr)
1033     debug_verbose (*ptr);
1034   else
1035     fprintf (stderr, "<nil>\n");
1036 }
1037
1038 DEBUG_FUNCTION void
1039 debug_head (const tree_node &ref)
1040 {
1041   debug (ref);
1042 }
1043
1044 DEBUG_FUNCTION void
1045 debug_head (const tree_node *ptr)
1046 {
1047   if (ptr)
1048     debug_head (*ptr);
1049   else
1050     fprintf (stderr, "<nil>\n");
1051 }
1052
1053 DEBUG_FUNCTION void
1054 debug_body (const tree_node &ref)
1055 {
1056   if (TREE_CODE (&ref) == FUNCTION_DECL)
1057     dump_function_to_file (const_cast <tree_node*> (&ref), stderr, 0);
1058   else
1059     debug (ref);
1060 }
1061
1062 DEBUG_FUNCTION void
1063 debug_body (const tree_node *ptr)
1064 {
1065   if (ptr)
1066     debug_body (*ptr);
1067   else
1068     fprintf (stderr, "<nil>\n");
1069 }
1070
1071 /* Print the vector of trees VEC on standard error, for debugging.
1072    Most nodes referred to by this one are printed recursively
1073    down to a depth of six.  */
1074
1075 DEBUG_FUNCTION void
1076 debug_raw (vec<tree, va_gc> &ref)
1077 {
1078   tree elt;
1079   unsigned ix;
1080
1081   /* Print the slot this node is in, and its code, and address.  */
1082   fprintf (stderr, "<VEC");
1083   dump_addr (stderr, " ", ref.address ());
1084
1085   FOR_EACH_VEC_ELT (ref, ix, elt)
1086     {
1087       fprintf (stderr, "elt %d ", ix);
1088       debug_raw (elt);
1089     }
1090 }
1091
1092 DEBUG_FUNCTION void
1093 debug (vec<tree, va_gc> &ref)
1094 {
1095   tree elt;
1096   unsigned ix;
1097
1098   /* Print the slot this node is in, and its code, and address.  */
1099   fprintf (stderr, "<VEC");
1100   dump_addr (stderr, " ", ref.address ());
1101
1102   FOR_EACH_VEC_ELT (ref, ix, elt)
1103     {
1104       fprintf (stderr, "elt %d ", ix);
1105       debug (elt);
1106     }
1107 }
1108
1109 DEBUG_FUNCTION void
1110 debug (vec<tree, va_gc> *ptr)
1111 {
1112   if (ptr)
1113     debug (*ptr);
1114   else
1115     fprintf (stderr, "<nil>\n");
1116 }
1117
1118 DEBUG_FUNCTION void
1119 debug_raw (vec<tree, va_gc> *ptr)
1120 {
1121   if (ptr)
1122     debug_raw (*ptr);
1123   else
1124     fprintf (stderr, "<nil>\n");
1125 }
1126
1127 DEBUG_FUNCTION void
1128 debug_vec_tree (vec<tree, va_gc> *vec)
1129 {
1130   debug_raw (vec);
1131 }