gcc/tree-dump.c

   1 /* Tree-dumping functionality for intermediate representation.
   2    Copyright (C) 1999, 2000, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
   3    Free Software Foundation, Inc.
   4    Written by Mark Mitchell <mark@codesourcery.com>
   5
   6 This file is part of GCC.
   7
   8 GCC is free software; you can redistribute it and/or modify it under
   9 the terms of the GNU General Public License as published by the Free
  10 Software Foundation; either version 3, or (at your option) any later
  11 version.
  12
  13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
  14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
  15 FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  16 for more details.
  17
  18 You should have received a copy of the GNU General Public License
  19 along with GCC; see the file COPYING3.  If not see
  20 <http://www.gnu.org/licenses/>.  */
  21
  22 #include "config.h"
  23 #include "system.h"
  24 #include "coretypes.h"
  25 #include "tm.h"
  26 #include "tree.h"
  27 #include "splay-tree.h"
  28 #include "diagnostic.h"
  29 #include "toplev.h"
  30 #include "tree-dump.h"
  31 #include "tree-pass.h"
  32 #include "langhooks.h"
  33 #include "tree-iterator.h"
  34 #include "real.h"
  35 #include "fixed-value.h"
  36
  37 static unsigned int queue (dump_info_p, const_tree, int);
  38 static void dump_index (dump_info_p, unsigned int);
  39 static void dequeue_and_dump (dump_info_p);
  40 static void dump_new_line (dump_info_p);
  41 static void dump_maybe_newline (dump_info_p);
  42
  43 /* Add T to the end of the queue of nodes to dump.  Returns the index
  44    assigned to T.  */
  45
  46 static unsigned int
  47 queue (dump_info_p di, const_tree t, int flags)
  48 {
  49   dump_queue_p dq;
  50   dump_node_info_p dni;
  51   unsigned int index;
  52
  53   /* Assign the next available index to T.  */
  54   index = ++di->index;
  55
  56   /* Obtain a new queue node.  */
  57   if (di->free_list)
  58     {
  59       dq = di->free_list;
  60       di->free_list = dq->next;
  61     }
  62   else
  63     dq = XNEW (struct dump_queue);
  64
  65   /* Create a new entry in the splay-tree.  */
  66   dni = XNEW (struct dump_node_info);
  67   dni->index = index;
  68   dni->binfo_p = ((flags & DUMP_BINFO) != 0);
  69   dq->node = splay_tree_insert (di->nodes, (splay_tree_key) t,
  70                                 (splay_tree_value) dni);
  71
  72   /* Add it to the end of the queue.  */
  73   dq->next = 0;
  74   if (!di->queue_end)
  75     di->queue = dq;
  76   else
  77     di->queue_end->next = dq;
  78   di->queue_end = dq;
  79
  80   /* Return the index.  */
  81   return index;
  82 }
  83
  84 static void
  85 dump_index (dump_info_p di, unsigned int index)
  86 {
  87   fprintf (di->stream, "@%-6u ", index);
  88   di->column += 8;
  89 }
  90
  91 /* If T has not already been output, queue it for subsequent output.
  92    FIELD is a string to print before printing the index.  Then, the
  93    index of T is printed.  */
  94
  95 void
  96 queue_and_dump_index (dump_info_p di, const char *field, const_tree t, int flags)
  97 {
  98   unsigned int index;
  99   splay_tree_node n;
 100
 101   /* If there's no node, just return.  This makes for fewer checks in
 102      our callers.  */
 103   if (!t)
 104     return;
 105
 106   /* See if we've already queued or dumped this node.  */
 107   n = splay_tree_lookup (di->nodes, (splay_tree_key) t);
 108   if (n)
 109     index = ((dump_node_info_p) n->value)->index;
 110   else
 111     /* If we haven't, add it to the queue.  */
 112     index = queue (di, t, flags);
 113
 114   /* Print the index of the node.  */
 115   dump_maybe_newline (di);
 116   fprintf (di->stream, "%-4s: ", field);
 117   di->column += 6;
 118   dump_index (di, index);
 119 }
 120
 121 /* Dump the type of T.  */
 122
 123 void
 124 queue_and_dump_type (dump_info_p di, const_tree t)
 125 {
 126   queue_and_dump_index (di, "type", TREE_TYPE (t), DUMP_NONE);
 127 }
 128
 129 /* Dump column control */
 130 #define SOL_COLUMN 25           /* Start of line column.  */
 131 #define EOL_COLUMN 55           /* End of line column.  */
 132 #define COLUMN_ALIGNMENT 15     /* Alignment.  */
 133
 134 /* Insert a new line in the dump output, and indent to an appropriate
 135    place to start printing more fields.  */
 136
 137 static void
 138 dump_new_line (dump_info_p di)
 139 {
 140   fprintf (di->stream, "\n%*s", SOL_COLUMN, "");
 141   di->column = SOL_COLUMN;
 142 }
 143
 144 /* If necessary, insert a new line.  */
 145
 146 static void
 147 dump_maybe_newline (dump_info_p di)
 148 {
 149   int extra;
 150
 151   /* See if we need a new line.  */
 152   if (di->column > EOL_COLUMN)
 153     dump_new_line (di);
 154   /* See if we need any padding.  */
 155   else if ((extra = (di->column - SOL_COLUMN) % COLUMN_ALIGNMENT) != 0)
 156     {
 157       fprintf (di->stream, "%*s", COLUMN_ALIGNMENT - extra, "");
 158       di->column += COLUMN_ALIGNMENT - extra;
 159     }
 160 }
 161
 162 /* Dump pointer PTR using FIELD to identify it.  */
 163
 164 void
 165 dump_pointer (dump_info_p di, const char *field, void *ptr)
 166 {
 167   dump_maybe_newline (di);
 168   fprintf (di->stream, "%-4s: %-8lx ", field, (unsigned long) ptr);
 169   di->column += 15;
 170 }
 171
 172 /* Dump integer I using FIELD to identify it.  */
 173
 174 void
 175 dump_int (dump_info_p di, const char *field, int i)
 176 {
 177   dump_maybe_newline (di);
 178   fprintf (di->stream, "%-4s: %-7d ", field, i);
 179   di->column += 14;
 180 }
 181
 182 /* Dump the floating point value R, using FIELD to identify it.  */
 183
 184 static void
 185 dump_real (dump_info_p di, const char *field, const REAL_VALUE_TYPE *r)
 186 {
 187   char buf[32];
 188   real_to_decimal (buf, r, sizeof (buf), 0, true);
 189   dump_maybe_newline (di);
 190   fprintf (di->stream, "%-4s: %s ", field, buf);
 191   di->column += strlen (buf) + 7;
 192 }
 193
 194 /* Dump the fixed-point value F, using FIELD to identify it.  */
 195
 196 static void
 197 dump_fixed (dump_info_p di, const char *field, const FIXED_VALUE_TYPE *f)
 198 {
 199   char buf[32];
 200   fixed_to_decimal (buf, f, sizeof (buf));
 201   dump_maybe_newline (di);
 202   fprintf (di->stream, "%-4s: %s ", field, buf);
 203   di->column += strlen (buf) + 7;
 204 }
 205
 206
 207 /* Dump the string S.  */
 208
 209 void
 210 dump_string (dump_info_p di, const char *string)
 211 {
 212   dump_maybe_newline (di);
 213   fprintf (di->stream, "%-13s ", string);
 214   if (strlen (string) > 13)
 215     di->column += strlen (string) + 1;
 216   else
 217     di->column += 14;
 218 }
 219
 220 /* Dump the string field S.  */
 221
 222 void
 223 dump_string_field (dump_info_p di, const char *field, const char *string)
 224 {
 225   dump_maybe_newline (di);
 226   fprintf (di->stream, "%-4s: %-7s ", field, string);
 227   if (strlen (string) > 7)
 228     di->column += 6 + strlen (string) + 1;
 229   else
 230     di->column += 14;
 231 }
 232
 233 /* Dump the next node in the queue.  */
 234
 235 static void
 236 dequeue_and_dump (dump_info_p di)
 237 {
 238   dump_queue_p dq;
 239   splay_tree_node stn;
 240   dump_node_info_p dni;
 241   tree t;
 242   unsigned int index;
 243   enum tree_code code;
 244   enum tree_code_class code_class;
 245   const char* code_name;
 246
 247   /* Get the next node from the queue.  */
 248   dq = di->queue;
 249   stn = dq->node;
 250   t = (tree) stn->key;
 251   dni = (dump_node_info_p) stn->value;
 252   index = dni->index;
 253
 254   /* Remove the node from the queue, and put it on the free list.  */
 255   di->queue = dq->next;
 256   if (!di->queue)
 257     di->queue_end = 0;
 258   dq->next = di->free_list;
 259   di->free_list = dq;
 260
 261   /* Print the node index.  */
 262   dump_index (di, index);
 263   /* And the type of node this is.  */
 264   if (dni->binfo_p)
 265     code_name = "binfo";
 266   else
 267     code_name = tree_code_name[(int) TREE_CODE (t)];
 268   fprintf (di->stream, "%-16s ", code_name);
 269   di->column = 25;
 270
 271   /* Figure out what kind of node this is.  */
 272   code = TREE_CODE (t);
 273   code_class = TREE_CODE_CLASS (code);
 274
 275   /* Although BINFOs are TREE_VECs, we dump them specially so as to be
 276      more informative.  */
 277   if (dni->binfo_p)
 278     {
 279       unsigned ix;
 280       tree base;
 281       VEC(tree,gc) *accesses = BINFO_BASE_ACCESSES (t);
 282
 283       dump_child ("type", BINFO_TYPE (t));
 284
 285       if (BINFO_VIRTUAL_P (t))
 286         dump_string_field (di, "spec", "virt");
 287
 288       dump_int (di, "bases", BINFO_N_BASE_BINFOS (t));
 289       for (ix = 0; BINFO_BASE_ITERATE (t, ix, base); ix++)
 290         {
 291           tree access = (accesses ? VEC_index (tree, accesses, ix)
 292                          : access_public_node);
 293           const char *string = NULL;
 294
 295           if (access == access_public_node)
 296             string = "pub";
 297           else if (access == access_protected_node)
 298             string = "prot";
 299           else if (access == access_private_node)
 300             string = "priv";
 301           else
 302             gcc_unreachable ();
 303
 304           dump_string_field (di, "accs", string);
 305           queue_and_dump_index (di, "binf", base, DUMP_BINFO);
 306         }
 307
 308       goto done;
 309     }
 310
 311   /* We can knock off a bunch of expression nodes in exactly the same
 312      way.  */
 313   if (IS_EXPR_CODE_CLASS (code_class))
 314     {
 315       /* If we're dumping children, dump them now.  */
 316       queue_and_dump_type (di, t);
 317
 318       switch (code_class)
 319         {
 320         case tcc_unary:
 321           dump_child ("op 0", TREE_OPERAND (t, 0));
 322           break;
 323
 324         case tcc_binary:
 325         case tcc_comparison:
 326           dump_child ("op 0", TREE_OPERAND (t, 0));
 327           dump_child ("op 1", TREE_OPERAND (t, 1));
 328           break;
 329
 330         case tcc_expression:
 331         case tcc_reference:
 332         case tcc_statement:
 333         case tcc_vl_exp:
 334           /* These nodes are handled explicitly below.  */
 335           break;
 336
 337         default:
 338           gcc_unreachable ();
 339         }
 340     }
 341   else if (DECL_P (t))
 342     {
 343       expanded_location xloc;
 344       /* All declarations have names.  */
 345       if (DECL_NAME (t))
 346         dump_child ("name", DECL_NAME (t));
 347       if (DECL_ASSEMBLER_NAME_SET_P (t)
 348           && DECL_ASSEMBLER_NAME (t) != DECL_NAME (t))
 349         dump_child ("mngl", DECL_ASSEMBLER_NAME (t));
 350       if (DECL_ABSTRACT_ORIGIN (t))
 351         dump_child ("orig", DECL_ABSTRACT_ORIGIN (t));
 352       /* And types.  */
 353       queue_and_dump_type (di, t);
 354       dump_child ("scpe", DECL_CONTEXT (t));
 355       /* And a source position.  */
 356       xloc = expand_location (DECL_SOURCE_LOCATION (t));
 357       if (xloc.file)
 358         {
 359           const char *filename = strrchr (xloc.file, '/');
 360           if (!filename)
 361             filename = xloc.file;
 362           else
 363             /* Skip the slash.  */
 364             ++filename;
 365
 366           dump_maybe_newline (di);
 367           fprintf (di->stream, "srcp: %s:%-6d ", filename,
 368                    xloc.line);
 369           di->column += 6 + strlen (filename) + 8;
 370         }
 371       /* And any declaration can be compiler-generated.  */
 372       if (CODE_CONTAINS_STRUCT (TREE_CODE (t), TS_DECL_COMMON)
 373           && DECL_ARTIFICIAL (t))
 374         dump_string_field (di, "note", "artificial");
 375       if (TREE_CHAIN (t) && !dump_flag (di, TDF_SLIM, NULL))
 376         dump_child ("chan", TREE_CHAIN (t));
 377     }
 378   else if (code_class == tcc_type)
 379     {
 380       /* All types have qualifiers.  */
 381       int quals = lang_hooks.tree_dump.type_quals (t);
 382
 383       if (quals != TYPE_UNQUALIFIED)
 384         {
 385           fprintf (di->stream, "qual: %c%c%c     ",
 386                    (quals & TYPE_QUAL_CONST) ? 'c' : ' ',
 387                    (quals & TYPE_QUAL_VOLATILE) ? 'v' : ' ',
 388                    (quals & TYPE_QUAL_RESTRICT) ? 'r' : ' ');
 389           di->column += 14;
 390         }
 391
 392       /* All types have associated declarations.  */
 393       dump_child ("name", TYPE_NAME (t));
 394
 395       /* All types have a main variant.  */
 396       if (TYPE_MAIN_VARIANT (t) != t)
 397         dump_child ("unql", TYPE_MAIN_VARIANT (t));
 398
 399       /* And sizes.  */
 400       dump_child ("size", TYPE_SIZE (t));
 401
 402       /* All types have alignments.  */
 403       dump_int (di, "algn", TYPE_ALIGN (t));
 404     }
 405   else if (code_class == tcc_constant)
 406     /* All constants can have types.  */
 407     queue_and_dump_type (di, t);
 408
 409   /* Give the language-specific code a chance to print something.  If
 410      it's completely taken care of things, don't bother printing
 411      anything more ourselves.  */
 412   if (lang_hooks.tree_dump.dump_tree (di, t))
 413     goto done;
 414
 415   /* Now handle the various kinds of nodes.  */
 416   switch (code)
 417     {
 418       int i;
 419
 420     case IDENTIFIER_NODE:
 421       dump_string_field (di, "strg", IDENTIFIER_POINTER (t));
 422       dump_int (di, "lngt", IDENTIFIER_LENGTH (t));
 423       break;
 424
 425     case TREE_LIST:
 426       dump_child ("purp", TREE_PURPOSE (t));
 427       dump_child ("valu", TREE_VALUE (t));
 428       dump_child ("chan", TREE_CHAIN (t));
 429       break;
 430
 431     case STATEMENT_LIST:
 432       {
 433         tree_stmt_iterator it;
 434         for (i = 0, it = tsi_start (t); !tsi_end_p (it); tsi_next (&it), i++)
 435           {
 436             char buffer[32];
 437             sprintf (buffer, "%u", i);
 438             dump_child (buffer, tsi_stmt (it));
 439           }
 440       }
 441       break;
 442
 443     case TREE_VEC:
 444       dump_int (di, "lngt", TREE_VEC_LENGTH (t));
 445       for (i = 0; i < TREE_VEC_LENGTH (t); ++i)
 446         {
 447           char buffer[32];
 448           sprintf (buffer, "%u", i);
 449           dump_child (buffer, TREE_VEC_ELT (t, i));
 450         }
 451       break;
 452
 453     case INTEGER_TYPE:
 454     case ENUMERAL_TYPE:
 455       dump_int (di, "prec", TYPE_PRECISION (t));
 456       dump_string_field (di, "sign", TYPE_UNSIGNED (t) ? "unsigned": "signed");
 457       dump_child ("min", TYPE_MIN_VALUE (t));
 458       dump_child ("max", TYPE_MAX_VALUE (t));
 459
 460       if (code == ENUMERAL_TYPE)
 461         dump_child ("csts", TYPE_VALUES (t));
 462       break;
 463
 464     case REAL_TYPE:
 465       dump_int (di, "prec", TYPE_PRECISION (t));
 466       break;
 467
 468     case FIXED_POINT_TYPE:
 469       dump_int (di, "prec", TYPE_PRECISION (t));
 470       dump_string_field (di, "sign", TYPE_UNSIGNED (t) ? "unsigned": "signed");
 471       dump_string_field (di, "saturating",
 472                          TYPE_SATURATING (t) ? "saturating": "non-saturating");
 473       break;
 474
 475     case POINTER_TYPE:
 476       dump_child ("ptd", TREE_TYPE (t));
 477       break;
 478
 479     case REFERENCE_TYPE:
 480       dump_child ("refd", TREE_TYPE (t));
 481       break;
 482
 483     case METHOD_TYPE:
 484       dump_child ("clas", TYPE_METHOD_BASETYPE (t));
 485       /* Fall through.  */
 486
 487     case FUNCTION_TYPE:
 488       dump_child ("retn", TREE_TYPE (t));
 489       dump_child ("prms", TYPE_ARG_TYPES (t));
 490       break;
 491
 492     case ARRAY_TYPE:
 493       dump_child ("elts", TREE_TYPE (t));
 494       dump_child ("domn", TYPE_DOMAIN (t));
 495       break;
 496
 497     case RECORD_TYPE:
 498     case UNION_TYPE:
 499       if (TREE_CODE (t) == RECORD_TYPE)
 500         dump_string_field (di, "tag", "struct");
 501       else
 502         dump_string_field (di, "tag", "union");
 503
 504       dump_child ("flds", TYPE_FIELDS (t));
 505       dump_child ("fncs", TYPE_METHODS (t));
 506       queue_and_dump_index (di, "binf", TYPE_BINFO (t),
 507                             DUMP_BINFO);
 508       break;
 509
 510     case CONST_DECL:
 511       dump_child ("cnst", DECL_INITIAL (t));
 512       break;
 513
 514     case VAR_DECL:
 515     case PARM_DECL:
 516     case FIELD_DECL:
 517     case RESULT_DECL:
 518       if (TREE_CODE (t) == PARM_DECL)
 519         dump_child ("argt", DECL_ARG_TYPE (t));
 520       else
 521         dump_child ("init", DECL_INITIAL (t));
 522       dump_child ("size", DECL_SIZE (t));
 523       dump_int (di, "algn", DECL_ALIGN (t));
 524
 525       if (TREE_CODE (t) == FIELD_DECL)
 526         {
 527           if (DECL_FIELD_OFFSET (t))
 528             dump_child ("bpos", bit_position (t));
 529         }
 530       else if (TREE_CODE (t) == VAR_DECL
 531                || TREE_CODE (t) == PARM_DECL)
 532         {
 533           dump_int (di, "used", TREE_USED (t));
 534           if (DECL_REGISTER (t))
 535             dump_string_field (di, "spec", "register");
 536         }
 537       break;
 538
 539     case FUNCTION_DECL:
 540       dump_child ("args", DECL_ARGUMENTS (t));
 541       if (DECL_EXTERNAL (t))
 542         dump_string_field (di, "body", "undefined");
 543       if (TREE_PUBLIC (t))
 544         dump_string_field (di, "link", "extern");
 545       else
 546         dump_string_field (di, "link", "static");
 547       if (DECL_SAVED_TREE (t) && !dump_flag (di, TDF_SLIM, t))
 548         dump_child ("body", DECL_SAVED_TREE (t));
 549       break;
 550
 551     case INTEGER_CST:
 552       if (TREE_INT_CST_HIGH (t))
 553         dump_int (di, "high", TREE_INT_CST_HIGH (t));
 554       dump_int (di, "low", TREE_INT_CST_LOW (t));
 555       break;
 556
 557     case STRING_CST:
 558       fprintf (di->stream, "strg: %-7s ", TREE_STRING_POINTER (t));
 559       dump_int (di, "lngt", TREE_STRING_LENGTH (t));
 560       break;
 561
 562     case REAL_CST:
 563       dump_real (di, "valu", TREE_REAL_CST_PTR (t));
 564       break;
 565
 566     case FIXED_CST:
 567       dump_fixed (di, "valu", TREE_FIXED_CST_PTR (t));
 568       break;
 569
 570     case TRUTH_NOT_EXPR:
 571     case ADDR_EXPR:
 572     case INDIRECT_REF:
 573     case ALIGN_INDIRECT_REF:
 574     case MISALIGNED_INDIRECT_REF:
 575     case CLEANUP_POINT_EXPR:
 576     case SAVE_EXPR:
 577     case REALPART_EXPR:
 578     case IMAGPART_EXPR:
 579       /* These nodes are unary, but do not have code class `1'.  */
 580       dump_child ("op 0", TREE_OPERAND (t, 0));
 581       break;
 582
 583     case TRUTH_ANDIF_EXPR:
 584     case TRUTH_ORIF_EXPR:
 585     case INIT_EXPR:
 586     case MODIFY_EXPR:
 587     case COMPOUND_EXPR:
 588     case PREDECREMENT_EXPR:
 589     case PREINCREMENT_EXPR:
 590     case POSTDECREMENT_EXPR:
 591     case POSTINCREMENT_EXPR:
 592       /* These nodes are binary, but do not have code class `2'.  */
 593       dump_child ("op 0", TREE_OPERAND (t, 0));
 594       dump_child ("op 1", TREE_OPERAND (t, 1));
 595       break;
 596
 597     case COMPONENT_REF:
 598       dump_child ("op 0", TREE_OPERAND (t, 0));
 599       dump_child ("op 1", TREE_OPERAND (t, 1));
 600       dump_child ("op 2", TREE_OPERAND (t, 2));
 601       break;
 602
 603     case ARRAY_REF:
 604     case ARRAY_RANGE_REF:
 605       dump_child ("op 0", TREE_OPERAND (t, 0));
 606       dump_child ("op 1", TREE_OPERAND (t, 1));
 607       dump_child ("op 2", TREE_OPERAND (t, 2));
 608       dump_child ("op 3", TREE_OPERAND (t, 3));
 609       break;
 610
 611     case COND_EXPR:
 612       dump_child ("op 0", TREE_OPERAND (t, 0));
 613       dump_child ("op 1", TREE_OPERAND (t, 1));
 614       dump_child ("op 2", TREE_OPERAND (t, 2));
 615       break;
 616
 617     case TRY_FINALLY_EXPR:
 618       dump_child ("op 0", TREE_OPERAND (t, 0));
 619       dump_child ("op 1", TREE_OPERAND (t, 1));
 620       break;
 621
 622     case CALL_EXPR:
 623       {
 624         int i = 0;
 625         tree arg;
 626         call_expr_arg_iterator iter;
 627         dump_child ("fn", CALL_EXPR_FN (t));
 628         FOR_EACH_CALL_EXPR_ARG (arg, iter, t)
 629           {
 630             char buffer[32];
 631             sprintf (buffer, "%u", i);
 632             dump_child (buffer, arg);
 633             i++;
 634           }
 635       }
 636       break;
 637
 638     case CONSTRUCTOR:
 639       {
 640         unsigned HOST_WIDE_INT cnt;
 641         tree index, value;
 642         dump_int (di, "lngt", VEC_length (constructor_elt,
 643                                           CONSTRUCTOR_ELTS (t)));
 644         FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), cnt, index, value)
 645           {
 646             dump_child ("idx", index);
 647             dump_child ("val", value);
 648           }
 649       }
 650       break;
 651
 652     case BIND_EXPR:
 653       dump_child ("vars", TREE_OPERAND (t, 0));
 654       dump_child ("body", TREE_OPERAND (t, 1));
 655       break;
 656
 657     case LOOP_EXPR:
 658       dump_child ("body", TREE_OPERAND (t, 0));
 659       break;
 660
 661     case EXIT_EXPR:
 662       dump_child ("cond", TREE_OPERAND (t, 0));
 663       break;
 664
 665     case RETURN_EXPR:
 666       dump_child ("expr", TREE_OPERAND (t, 0));
 667       break;
 668
 669     case TARGET_EXPR:
 670       dump_child ("decl", TREE_OPERAND (t, 0));
 671       dump_child ("init", TREE_OPERAND (t, 1));
 672       dump_child ("clnp", TREE_OPERAND (t, 2));
 673       /* There really are two possible places the initializer can be.
 674          After RTL expansion, the second operand is moved to the
 675          position of the fourth operand, and the second operand
 676          becomes NULL.  */
 677       dump_child ("init", TREE_OPERAND (t, 3));
 678       break;
 679
 680     case CASE_LABEL_EXPR:
 681       dump_child ("name", CASE_LABEL (t));
 682       if (CASE_LOW (t))
 683         {
 684           dump_child ("low ", CASE_LOW (t));
 685           if (CASE_HIGH (t))
 686             dump_child ("high", CASE_HIGH (t));
 687         }
 688       break;
 689     case LABEL_EXPR:
 690       dump_child ("name", TREE_OPERAND (t,0));
 691       break;
 692     case GOTO_EXPR:
 693       dump_child ("labl", TREE_OPERAND (t, 0));
 694       break;
 695     case SWITCH_EXPR:
 696       dump_child ("cond", TREE_OPERAND (t, 0));
 697       dump_child ("body", TREE_OPERAND (t, 1));
 698       if (TREE_OPERAND (t, 2))
 699         {
 700           dump_child ("labl", TREE_OPERAND (t,2));
 701         }
 702       break;
 703     case OMP_CLAUSE:
 704       {
 705         int i;
 706         fprintf (di->stream, "%s\n", omp_clause_code_name[OMP_CLAUSE_CODE (t)]);
 707         for (i = 0; i < omp_clause_num_ops[OMP_CLAUSE_CODE (t)]; i++)
 708           dump_child ("op: ", OMP_CLAUSE_OPERAND (t, i));
 709       }
 710       break;
 711     default:
 712       /* There are no additional fields to print.  */
 713       break;
 714     }
 715
 716  done:
 717   if (dump_flag (di, TDF_ADDRESS, NULL))
 718     dump_pointer (di, "addr", (void *)t);
 719
 720   /* Terminate the line.  */
 721   fprintf (di->stream, "\n");
 722 }
 723
 724 /* Return nonzero if FLAG has been specified for the dump, and NODE
 725    is not the root node of the dump.  */
 726
 727 int dump_flag (dump_info_p di, int flag, const_tree node)
 728 {
 729   return (di->flags & flag) && (node != di->node);
 730 }
 731
 732 /* Dump T, and all its children, on STREAM.  */
 733
 734 void
 735 dump_node (const_tree t, int flags, FILE *stream)
 736 {
 737   struct dump_info di;
 738   dump_queue_p dq;
 739   dump_queue_p next_dq;
 740
 741   /* Initialize the dump-information structure.  */
 742   di.stream = stream;
 743   di.index = 0;
 744   di.column = 0;
 745   di.queue = 0;
 746   di.queue_end = 0;
 747   di.free_list = 0;
 748   di.flags = flags;
 749   di.node = t;
 750   di.nodes = splay_tree_new (splay_tree_compare_pointers, 0,
 751                              (splay_tree_delete_value_fn) &free);
 752
 753   /* Queue up the first node.  */
 754   queue (&di, t, DUMP_NONE);
 755
 756   /* Until the queue is empty, keep dumping nodes.  */
 757   while (di.queue)
 758     dequeue_and_dump (&di);
 759
 760   /* Now, clean up.  */
 761   for (dq = di.free_list; dq; dq = next_dq)
 762     {
 763       next_dq = dq->next;
 764       free (dq);
 765     }
 766   splay_tree_delete (di.nodes);
 767 }
 768 \f
 769
 770 /* Table of tree dump switches. This must be consistent with the
 771    tree_dump_index enumeration in tree-pass.h.  */
 772 static struct dump_file_info dump_files[TDI_end] =
 773 {
 774   {NULL, NULL, NULL, 0, 0, 0},
 775   {".cgraph", "ipa-cgraph", NULL, TDF_IPA, 0,  0},
 776   {".tu", "translation-unit", NULL, TDF_TREE, 0, 1},
 777   {".class", "class-hierarchy", NULL, TDF_TREE, 0, 2},
 778   {".original", "tree-original", NULL, TDF_TREE, 0, 3},
 779   {".gimple", "tree-gimple", NULL, TDF_TREE, 0, 4},
 780   {".nested", "tree-nested", NULL, TDF_TREE, 0, 5},
 781   {".vcg", "tree-vcg", NULL, TDF_TREE, 0, 6},
 782 #define FIRST_AUTO_NUMBERED_DUMP 7
 783
 784   {NULL, "tree-all", NULL, TDF_TREE, 0, 0},
 785   {NULL, "rtl-all", NULL, TDF_RTL, 0, 0},
 786   {NULL, "ipa-all", NULL, TDF_IPA, 0, 0},
 787 };
 788
 789 /* Dynamically registered tree dump files and switches.  */
 790 static struct dump_file_info *extra_dump_files;
 791 static size_t extra_dump_files_in_use;
 792 static size_t extra_dump_files_alloced;
 793
 794 /* Define a name->number mapping for a dump flag value.  */
 795 struct dump_option_value_info
 796 {
 797   const char *const name;       /* the name of the value */
 798   const int value;              /* the value of the name */
 799 };
 800
 801 /* Table of dump options. This must be consistent with the TDF_* flags
 802    in tree.h */
 803 static const struct dump_option_value_info dump_options[] =
 804 {
 805   {"address", TDF_ADDRESS},
 806   {"slim", TDF_SLIM},
 807   {"raw", TDF_RAW},
 808   {"graph", TDF_GRAPH},
 809   {"details", TDF_DETAILS},
 810   {"stats", TDF_STATS},
 811   {"blocks", TDF_BLOCKS},
 812   {"vops", TDF_VOPS},
 813   {"lineno", TDF_LINENO},
 814   {"uid", TDF_UID},
 815   {"stmtaddr", TDF_STMTADDR},
 816   {"memsyms", TDF_MEMSYMS},
 817   {"verbose", TDF_VERBOSE},
 818   {"all", ~(TDF_RAW | TDF_SLIM | TDF_LINENO | TDF_TREE | TDF_RTL | TDF_IPA
 819             | TDF_STMTADDR | TDF_GRAPH | TDF_DIAGNOSTIC | TDF_VERBOSE
 820             | TDF_RHS_ONLY)},
 821   {NULL, 0}
 822 };
 823
 824 unsigned int
 825 dump_register (const char *suffix, const char *swtch, const char *glob,
 826                int flags)
 827 {
 828   static int next_dump = FIRST_AUTO_NUMBERED_DUMP;
 829   int num = next_dump++;
 830
 831   size_t count = extra_dump_files_in_use++;
 832
 833   if (count >= extra_dump_files_alloced)
 834     {
 835       if (extra_dump_files_alloced == 0)
 836         extra_dump_files_alloced = 32;
 837       else
 838         extra_dump_files_alloced *= 2;
 839       extra_dump_files = XRESIZEVEC (struct dump_file_info,
 840                                      extra_dump_files,
 841                                      extra_dump_files_alloced);
 842     }
 843
 844   memset (&extra_dump_files[count], 0, sizeof (struct dump_file_info));
 845   extra_dump_files[count].suffix = suffix;
 846   extra_dump_files[count].swtch = swtch;
 847   extra_dump_files[count].glob = glob;
 848   extra_dump_files[count].flags = flags;
 849   extra_dump_files[count].num = num;
 850
 851   return count + TDI_end;
 852 }
 853
 854
 855 /* Return the dump_file_info for the given phase.  */
 856
 857 struct dump_file_info *
 858 get_dump_file_info (int phase)
 859 {
 860   if (phase < TDI_end)
 861     return &dump_files[phase];
 862   else if ((size_t) (phase - TDI_end) >= extra_dump_files_in_use)
 863     return NULL;
 864   else
 865     return extra_dump_files + (phase - TDI_end);
 866 }
 867
 868
 869 /* Return the name of the dump file for the given phase.
 870    If the dump is not enabled, returns NULL.  */
 871
 872 char *
 873 get_dump_file_name (int phase)
 874 {
 875   char dump_id[10];
 876   struct dump_file_info *dfi;
 877
 878   if (phase == TDI_none)
 879     return NULL;
 880
 881   dfi = get_dump_file_info (phase);
 882   if (dfi->state == 0)
 883     return NULL;
 884
 885   if (dfi->num < 0)
 886     dump_id[0] = '\0';
 887   else
 888     {
 889       char suffix;
 890       if (dfi->flags & TDF_TREE)
 891         suffix = 't';
 892       else if (dfi->flags & TDF_IPA)
 893         suffix = 'i';
 894       else
 895         suffix = 'r';
 896
 897       if (snprintf (dump_id, sizeof (dump_id), ".%03d%c", dfi->num, suffix) < 0)
 898         dump_id[0] = '\0';
 899     }
 900
 901   return concat (dump_base_name, dump_id, dfi->suffix, NULL);
 902 }
 903
 904 /* Begin a tree dump for PHASE. Stores any user supplied flag in
 905    *FLAG_PTR and returns a stream to write to. If the dump is not
 906    enabled, returns NULL.
 907    Multiple calls will reopen and append to the dump file.  */
 908
 909 FILE *
 910 dump_begin (int phase, int *flag_ptr)
 911 {
 912   char *name;
 913   struct dump_file_info *dfi;
 914   FILE *stream;
 915
 916   if (phase == TDI_none || !dump_enabled_p (phase))
 917     return NULL;
 918
 919   name = get_dump_file_name (phase);
 920   dfi = get_dump_file_info (phase);
 921   stream = fopen (name, dfi->state < 0 ? "w" : "a");
 922   if (!stream)
 923     error ("could not open dump file %qs: %s", name, strerror (errno));
 924   else
 925     dfi->state = 1;
 926   free (name);
 927
 928   if (flag_ptr)
 929     *flag_ptr = dfi->flags;
 930
 931   return stream;
 932 }
 933
 934 /* Returns nonzero if tree dump PHASE is enabled.  If PHASE is
 935    TDI_tree_all, return nonzero if any dump is enabled.  */
 936
 937 int
 938 dump_enabled_p (int phase)
 939 {
 940   if (phase == TDI_tree_all)
 941     {
 942       size_t i;
 943       for (i = TDI_none + 1; i < (size_t) TDI_end; i++)
 944         if (dump_files[i].state)
 945           return 1;
 946       for (i = 0; i < extra_dump_files_in_use; i++)
 947         if (extra_dump_files[i].state)
 948           return 1;
 949       return 0;
 950     }
 951   else
 952     {
 953       struct dump_file_info *dfi = get_dump_file_info (phase);
 954       return dfi->state;
 955     }
 956 }
 957
 958 /* Returns nonzero if tree dump PHASE has been initialized.  */
 959
 960 int
 961 dump_initialized_p (int phase)
 962 {
 963   struct dump_file_info *dfi = get_dump_file_info (phase);
 964   return dfi->state > 0;
 965 }
 966
 967 /* Returns the switch name of PHASE.  */
 968
 969 const char *
 970 dump_flag_name (int phase)
 971 {
 972   struct dump_file_info *dfi = get_dump_file_info (phase);
 973   return dfi->swtch;
 974 }
 975
 976 /* Finish a tree dump for PHASE. STREAM is the stream created by
 977    dump_begin.  */
 978
 979 void
 980 dump_end (int phase ATTRIBUTE_UNUSED, FILE *stream)
 981 {
 982   fclose (stream);
 983 }
 984
 985 /* Enable all tree dumps.  Return number of enabled tree dumps.  */
 986
 987 static int
 988 dump_enable_all (int flags)
 989 {
 990   int ir_dump_type = (flags & (TDF_TREE | TDF_RTL | TDF_IPA));
 991   int n = 0;
 992   size_t i;
 993
 994   for (i = TDI_none + 1; i < (size_t) TDI_end; i++)
 995     if ((dump_files[i].flags & ir_dump_type))
 996       {
 997         dump_files[i].state = -1;
 998         dump_files[i].flags |= flags;
 999         n++;
1000       }
1001
1002   for (i = 0; i < extra_dump_files_in_use; i++)
1003     if ((extra_dump_files[i].flags & ir_dump_type))
1004       {
1005         extra_dump_files[i].state = -1;
1006         extra_dump_files[i].flags |= flags;
1007         n++;
1008       }
1009
1010   return n;
1011 }
1012
1013 /* Parse ARG as a dump switch. Return nonzero if it is, and store the
1014    relevant details in the dump_files array.  */
1015
1016 static int
1017 dump_switch_p_1 (const char *arg, struct dump_file_info *dfi, bool doglob)
1018 {
1019   const char *option_value;
1020   const char *ptr;
1021   int flags;
1022
1023   if (doglob && !dfi->glob)
1024     return 0;
1025
1026   option_value = skip_leading_substring (arg, doglob ? dfi->glob : dfi->swtch);
1027   if (!option_value)
1028     return 0;
1029
1030   if (*option_value && *option_value != '-')
1031     return 0;
1032
1033   ptr = option_value;
1034   flags = 0;
1035
1036   while (*ptr)
1037     {
1038       const struct dump_option_value_info *option_ptr;
1039       const char *end_ptr;
1040       unsigned length;
1041
1042       while (*ptr == '-')
1043         ptr++;
1044       end_ptr = strchr (ptr, '-');
1045       if (!end_ptr)
1046         end_ptr = ptr + strlen (ptr);
1047       length = end_ptr - ptr;
1048
1049       for (option_ptr = dump_options; option_ptr->name; option_ptr++)
1050         if (strlen (option_ptr->name) == length
1051             && !memcmp (option_ptr->name, ptr, length))
1052           {
1053             flags |= option_ptr->value;
1054             goto found;
1055           }
1056       warning (0, "ignoring unknown option %q.*s in %<-fdump-%s%>",
1057                length, ptr, dfi->swtch);
1058     found:;
1059       ptr = end_ptr;
1060     }
1061
1062   dfi->state = -1;
1063   dfi->flags |= flags;
1064
1065   /* Process -fdump-tree-all and -fdump-rtl-all, by enabling all the
1066      known dumps.  */
1067   if (dfi->suffix == NULL)
1068     dump_enable_all (dfi->flags);
1069
1070   return 1;
1071 }
1072
1073 int
1074 dump_switch_p (const char *arg)
1075 {
1076   size_t i;
1077   int any = 0;
1078
1079   for (i = TDI_none + 1; i != TDI_end; i++)
1080     any |= dump_switch_p_1 (arg, &dump_files[i], false);
1081
1082   /* Don't glob if we got a hit already */
1083   if (!any)
1084     for (i = TDI_none + 1; i != TDI_end; i++)
1085       any |= dump_switch_p_1 (arg, &dump_files[i], true);
1086
1087   for (i = 0; i < extra_dump_files_in_use; i++)
1088     any |= dump_switch_p_1 (arg, &extra_dump_files[i], false);
1089
1090   if (!any)
1091     for (i = 0; i < extra_dump_files_in_use; i++)
1092       any |= dump_switch_p_1 (arg, &extra_dump_files[i], true);
1093
1094
1095   return any;
1096 }
1097
1098 /* Dump FUNCTION_DECL FN as tree dump PHASE.  */
1099
1100 void
1101 dump_function (int phase, tree fn)
1102 {
1103   FILE *stream;
1104   int flags;
1105
1106   stream = dump_begin (phase, &flags);
1107   if (stream)
1108     {
1109       dump_function_to_file (fn, stream, flags);
1110       dump_end (phase, stream);
1111     }
1112 }
1113
1114 bool
1115 enable_rtl_dump_file (void)
1116 {
1117   return dump_enable_all (TDF_RTL | TDF_DETAILS | TDF_BLOCKS) > 0;
1118 }