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