gcc/passes.c

   1 /* Top level of GCC compilers (cc1, cc1plus, etc.)
   2    Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
   3    1999, 2000, 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
   4
   5 This file is part of GCC.
   6
   7 GCC is free software; you can redistribute it and/or modify it under
   8 the terms of the GNU General Public License as published by the Free
   9 Software Foundation; either version 2, or (at your option) any later
  10 version.
  11
  12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
  13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
  14 FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  15 for more details.
  16
  17 You should have received a copy of the GNU General Public License
  18 along with GCC; see the file COPYING.  If not, write to the Free
  19 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
  20 02110-1301, USA.  */
  21
  22 /* This is the top level of cc1/c++.
  23    It parses command args, opens files, invokes the various passes
  24    in the proper order, and counts the time used by each.
  25    Error messages and low-level interface to malloc also handled here.  */
  26
  27 #include "config.h"
  28 #undef FLOAT /* This is for hpux. They should change hpux.  */
  29 #undef FFS  /* Some systems define this in param.h.  */
  30 #include "system.h"
  31 #include "coretypes.h"
  32 #include "tm.h"
  33 #include <signal.h>
  34
  35 #ifdef HAVE_SYS_RESOURCE_H
  36 # include <sys/resource.h>
  37 #endif
  38
  39 #ifdef HAVE_SYS_TIMES_H
  40 # include <sys/times.h>
  41 #endif
  42
  43 #include "line-map.h"
  44 #include "input.h"
  45 #include "tree.h"
  46 #include "rtl.h"
  47 #include "tm_p.h"
  48 #include "flags.h"
  49 #include "insn-attr.h"
  50 #include "insn-config.h"
  51 #include "insn-flags.h"
  52 #include "hard-reg-set.h"
  53 #include "recog.h"
  54 #include "output.h"
  55 #include "except.h"
  56 #include "function.h"
  57 #include "toplev.h"
  58 #include "expr.h"
  59 #include "basic-block.h"
  60 #include "intl.h"
  61 #include "ggc.h"
  62 #include "graph.h"
  63 #include "regs.h"
  64 #include "timevar.h"
  65 #include "diagnostic.h"
  66 #include "params.h"
  67 #include "reload.h"
  68 #include "dwarf2asm.h"
  69 #include "integrate.h"
  70 #include "real.h"
  71 #include "debug.h"
  72 #include "target.h"
  73 #include "langhooks.h"
  74 #include "cfglayout.h"
  75 #include "cfgloop.h"
  76 #include "hosthooks.h"
  77 #include "cgraph.h"
  78 #include "opts.h"
  79 #include "coverage.h"
  80 #include "value-prof.h"
  81 #include "tree-inline.h"
  82 #include "tree-flow.h"
  83 #include "tree-pass.h"
  84 #include "tree-dump.h"
  85
  86 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
  87 #include "dwarf2out.h"
  88 #endif
  89
  90 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
  91 #include "dbxout.h"
  92 #endif
  93
  94 #ifdef SDB_DEBUGGING_INFO
  95 #include "sdbout.h"
  96 #endif
  97
  98 #ifdef XCOFF_DEBUGGING_INFO
  99 #include "xcoffout.h"           /* Needed for external data
 100                                    declarations for e.g. AIX 4.x.  */
 101 #endif
 102
 103 /* Global variables used to communicate with passes.  */
 104 int dump_flags;
 105 bool in_gimple_form;
 106
 107
 108 /* This is called from various places for FUNCTION_DECL, VAR_DECL,
 109    and TYPE_DECL nodes.
 110
 111    This does nothing for local (non-static) variables, unless the
 112    variable is a register variable with DECL_ASSEMBLER_NAME set.  In
 113    that case, or if the variable is not an automatic, it sets up the
 114    RTL and outputs any assembler code (label definition, storage
 115    allocation and initialization).
 116
 117    DECL is the declaration.  TOP_LEVEL is nonzero
 118    if this declaration is not within a function.  */
 119
 120 void
 121 rest_of_decl_compilation (tree decl,
 122                           int top_level,
 123                           int at_end)
 124 {
 125   /* We deferred calling assemble_alias so that we could collect
 126      other attributes such as visibility.  Emit the alias now.  */
 127   {
 128     tree alias;
 129     alias = lookup_attribute ("alias", DECL_ATTRIBUTES (decl));
 130     if (alias)
 131       {
 132         alias = TREE_VALUE (TREE_VALUE (alias));
 133         alias = get_identifier (TREE_STRING_POINTER (alias));
 134         assemble_alias (decl, alias);
 135       }
 136   }
 137
 138   /* Can't defer this, because it needs to happen before any
 139      later function definitions are processed.  */
 140   if (DECL_ASSEMBLER_NAME_SET_P (decl) && DECL_REGISTER (decl))
 141     make_decl_rtl (decl);
 142
 143   /* Forward declarations for nested functions are not "external",
 144      but we need to treat them as if they were.  */
 145   if (TREE_STATIC (decl) || DECL_EXTERNAL (decl)
 146       || TREE_CODE (decl) == FUNCTION_DECL)
 147     {
 148       timevar_push (TV_VARCONST);
 149
 150       /* Don't output anything when a tentative file-scope definition
 151          is seen.  But at end of compilation, do output code for them.
 152
 153          We do output all variables when unit-at-a-time is active and rely on
 154          callgraph code to defer them except for forward declarations
 155          (see gcc.c-torture/compile/920624-1.c) */
 156       if ((at_end
 157            || !DECL_DEFER_OUTPUT (decl)
 158            || DECL_INITIAL (decl))
 159           && !DECL_EXTERNAL (decl))
 160         {
 161           if (TREE_CODE (decl) != FUNCTION_DECL)
 162             cgraph_varpool_finalize_decl (decl);
 163           else
 164             assemble_variable (decl, top_level, at_end, 0);
 165         }
 166
 167 #ifdef ASM_FINISH_DECLARE_OBJECT
 168       if (decl == last_assemble_variable_decl)
 169         {
 170           ASM_FINISH_DECLARE_OBJECT (asm_out_file, decl,
 171                                      top_level, at_end);
 172         }
 173 #endif
 174
 175       timevar_pop (TV_VARCONST);
 176     }
 177   else if (TREE_CODE (decl) == TYPE_DECL
 178            /* Like in rest_of_type_compilation, avoid confusing the debug
 179               information machinery when there are errors.  */
 180            && !(sorrycount || errorcount))
 181     {
 182       timevar_push (TV_SYMOUT);
 183       debug_hooks->type_decl (decl, !top_level);
 184       timevar_pop (TV_SYMOUT);
 185     }
 186
 187   /* Let cgraph know about the existence of variables.  */
 188   if (TREE_CODE (decl) == VAR_DECL && !DECL_EXTERNAL (decl))
 189     cgraph_varpool_node (decl);
 190 }
 191
 192 /* Called after finishing a record, union or enumeral type.  */
 193
 194 void
 195 rest_of_type_compilation (tree type, int toplev)
 196 {
 197   /* Avoid confusing the debug information machinery when there are
 198      errors.  */
 199   if (errorcount != 0 || sorrycount != 0)
 200     return;
 201
 202   timevar_push (TV_SYMOUT);
 203   debug_hooks->type_decl (TYPE_STUB_DECL (type), !toplev);
 204   timevar_pop (TV_SYMOUT);
 205 }
 206
 207 \f
 208
 209 void
 210 finish_optimization_passes (void)
 211 {
 212   enum tree_dump_index i;
 213   struct dump_file_info *dfi;
 214   char *name;
 215
 216   timevar_push (TV_DUMP);
 217   if (profile_arc_flag || flag_test_coverage || flag_branch_probabilities)
 218     {
 219       dump_file = dump_begin (pass_branch_prob.static_pass_number, NULL);
 220       end_branch_prob ();
 221       if (dump_file)
 222         dump_end (pass_branch_prob.static_pass_number, dump_file);
 223     }
 224
 225   if (optimize > 0)
 226     {
 227       dump_file = dump_begin (pass_combine.static_pass_number, NULL);
 228       if (dump_file)
 229         {
 230           dump_combine_total_stats (dump_file);
 231           dump_end (pass_combine.static_pass_number, dump_file);
 232         }
 233     }
 234
 235   /* Do whatever is necessary to finish printing the graphs.  */
 236   if (graph_dump_format != no_graph)
 237     for (i = TDI_end; (dfi = get_dump_file_info (i)) != NULL; ++i)
 238       if (dump_initialized_p (i)
 239           && (dfi->flags & TDF_GRAPH) != 0
 240           && (name = get_dump_file_name (i)) != NULL)
 241         {
 242           finish_graph_dump_file (name);
 243           free (name);
 244         }
 245
 246   timevar_pop (TV_DUMP);
 247 }
 248
 249 static bool
 250 gate_rest_of_compilation (void)
 251 {
 252   /* Early return if there were errors.  We can run afoul of our
 253      consistency checks, and there's not really much point in fixing them.  */
 254   return !(rtl_dump_and_exit || flag_syntax_only || errorcount || sorrycount);
 255 }
 256
 257 struct tree_opt_pass pass_rest_of_compilation =
 258 {
 259   NULL,                                 /* name */
 260   gate_rest_of_compilation,             /* gate */
 261   NULL,                                 /* execute */
 262   NULL,                                 /* sub */
 263   NULL,                                 /* next */
 264   0,                                    /* static_pass_number */
 265   TV_REST_OF_COMPILATION,               /* tv_id */
 266   PROP_rtl,                             /* properties_required */
 267   0,                                    /* properties_provided */
 268   0,                                    /* properties_destroyed */
 269   0,                                    /* todo_flags_start */
 270   TODO_ggc_collect,                     /* todo_flags_finish */
 271   0                                     /* letter */
 272 };
 273
 274 static bool
 275 gate_postreload (void)
 276 {
 277   return reload_completed;
 278 }
 279
 280 struct tree_opt_pass pass_postreload =
 281 {
 282   NULL,                                 /* name */
 283   gate_postreload,                      /* gate */
 284   NULL,                                 /* execute */
 285   NULL,                                 /* sub */
 286   NULL,                                 /* next */
 287   0,                                    /* static_pass_number */
 288   0,                                    /* tv_id */
 289   PROP_rtl,                             /* properties_required */
 290   0,                                    /* properties_provided */
 291   0,                                    /* properties_destroyed */
 292   0,                                    /* todo_flags_start */
 293   TODO_ggc_collect,                     /* todo_flags_finish */
 294   0                                     /* letter */
 295 };
 296
 297
 298
 299 /* The root of the compilation pass tree, once constructed.  */
 300 struct tree_opt_pass *all_passes, *all_ipa_passes, *all_lowering_passes;
 301
 302 /* Iterate over the pass tree allocating dump file numbers.  We want
 303    to do this depth first, and independent of whether the pass is
 304    enabled or not.  */
 305
 306 static void
 307 register_one_dump_file (struct tree_opt_pass *pass, bool ipa, int n)
 308 {
 309   char *dot_name, *flag_name, *glob_name;
 310   char num[10];
 311
 312   /* See below in next_pass_1.  */
 313   num[0] = '\0';
 314   if (pass->static_pass_number != -1)
 315     sprintf (num, "%d", ((int) pass->static_pass_number < 0
 316                          ? 1 : pass->static_pass_number));
 317
 318   dot_name = concat (".", pass->name, num, NULL);
 319   if (ipa)
 320     {
 321       flag_name = concat ("ipa-", pass->name, num, NULL);
 322       glob_name = concat ("ipa-", pass->name, NULL);
 323       /* First IPA dump is cgraph that is dumped via separate channels.  */
 324       pass->static_pass_number = dump_register (dot_name, flag_name, glob_name,
 325                                                 TDF_IPA, n + 1, 0);
 326     }
 327   else if (pass->properties_provided & PROP_trees)
 328     {
 329       flag_name = concat ("tree-", pass->name, num, NULL);
 330       glob_name = concat ("tree-", pass->name, NULL);
 331       pass->static_pass_number = dump_register (dot_name, flag_name, glob_name,
 332                                                 TDF_TREE, n + TDI_tree_all, 0);
 333     }
 334   else
 335     {
 336       flag_name = concat ("rtl-", pass->name, num, NULL);
 337       glob_name = concat ("rtl-", pass->name, NULL);
 338       pass->static_pass_number = dump_register (dot_name, flag_name, glob_name,
 339                                                 TDF_RTL, n, pass->letter);
 340     }
 341 }
 342
 343 static int
 344 register_dump_files (struct tree_opt_pass *pass, bool ipa, int properties)
 345 {
 346   static int n = 0;
 347   do
 348     {
 349       int new_properties;
 350       int pass_number;
 351
 352       pass->properties_required = properties;
 353       new_properties =
 354         (properties | pass->properties_provided) & ~pass->properties_destroyed;
 355
 356       /* Reset the counter when we reach RTL-based passes.  */
 357       if ((new_properties ^ pass->properties_required) & PROP_rtl)
 358         n = 0;
 359
 360       pass_number = n;
 361       if (pass->name)
 362         n++;
 363
 364       if (pass->sub)
 365         new_properties = register_dump_files (pass->sub, false, new_properties);
 366
 367       /* If we have a gate, combine the properties that we could have with
 368          and without the pass being examined.  */
 369       if (pass->gate)
 370         properties &= new_properties;
 371       else
 372         properties = new_properties;
 373
 374       pass->properties_provided = properties;
 375       if (pass->name)
 376         register_one_dump_file (pass, ipa, pass_number);
 377
 378       pass = pass->next;
 379     }
 380   while (pass);
 381
 382   return properties;
 383 }
 384
 385 /* Add a pass to the pass list. Duplicate the pass if it's already
 386    in the list.  */
 387
 388 static struct tree_opt_pass **
 389 next_pass_1 (struct tree_opt_pass **list, struct tree_opt_pass *pass)
 390 {
 391
 392   /* A nonzero static_pass_number indicates that the
 393      pass is already in the list.  */
 394   if (pass->static_pass_number)
 395     {
 396       struct tree_opt_pass *new;
 397
 398       new = xmalloc (sizeof (*new));
 399       memcpy (new, pass, sizeof (*new));
 400
 401       /* Indicate to register_dump_files that this pass has duplicates,
 402          and so it should rename the dump file.  The first instance will
 403          be -1, and be number of duplicates = -static_pass_number - 1.
 404          Subsequent instances will be > 0 and just the duplicate number.  */
 405       if (pass->name)
 406         {
 407           pass->static_pass_number -= 1;
 408           new->static_pass_number = -pass->static_pass_number;
 409         }
 410
 411       *list = new;
 412     }
 413   else
 414     {
 415       pass->static_pass_number = -1;
 416       *list = pass;
 417     }
 418
 419   return &(*list)->next;
 420
 421 }
 422
 423 /* Construct the pass tree.  */
 424
 425 void
 426 init_optimization_passes (void)
 427 {
 428   struct tree_opt_pass **p;
 429
 430 #define NEXT_PASS(PASS)  (p = next_pass_1 (p, &PASS))
 431   /* Interprocedural optimization passes.  */
 432   p = &all_ipa_passes;
 433   NEXT_PASS (pass_early_ipa_inline);
 434   NEXT_PASS (pass_early_local_passes);
 435   /*NEXT_PASS (pass_ipa_cp);*/
 436   NEXT_PASS (pass_ipa_inline);
 437   NEXT_PASS (pass_ipa_alias);
 438   NEXT_PASS (pass_ipa_reference);
 439   NEXT_PASS (pass_ipa_pure_const);
 440   NEXT_PASS (pass_ipa_type_escape);
 441   *p = NULL;
 442
 443   /* All passes needed to lower the function into shape optimizers can operate
 444      on.  These passes are performed before interprocedural passes, unlike rest
 445      of local passes (all_passes).  */
 446   p = &all_lowering_passes;
 447   NEXT_PASS (pass_remove_useless_stmts);
 448   NEXT_PASS (pass_mudflap_1);
 449   NEXT_PASS (pass_lower_cf);
 450   NEXT_PASS (pass_lower_eh);
 451   NEXT_PASS (pass_build_cfg);
 452   NEXT_PASS (pass_lower_complex_O0);
 453   NEXT_PASS (pass_lower_vector);
 454   NEXT_PASS (pass_warn_function_return);
 455   NEXT_PASS (pass_early_tree_profile);
 456   *p = NULL;
 457
 458   p = &pass_early_local_passes.sub;
 459   NEXT_PASS (pass_tree_profile);
 460   NEXT_PASS (pass_cleanup_cfg);
 461   NEXT_PASS (pass_all_early_optimizations);
 462   NEXT_PASS (pass_rebuild_cgraph_edges);
 463   *p = NULL;
 464
 465   p = &pass_all_early_optimizations.sub;
 466   NEXT_PASS (pass_init_datastructures);
 467   NEXT_PASS (pass_referenced_vars);
 468   NEXT_PASS (pass_create_structure_vars);
 469   NEXT_PASS (pass_build_ssa);
 470   NEXT_PASS (pass_early_warn_uninitialized);
 471
 472   NEXT_PASS (pass_ccp);
 473   NEXT_PASS (pass_vrp);
 474   NEXT_PASS (pass_dce);
 475
 476   *p = NULL;
 477
 478   p = &all_passes;
 479   NEXT_PASS (pass_fixup_cfg);
 480   NEXT_PASS (pass_all_optimizations);
 481   NEXT_PASS (pass_warn_function_noreturn);
 482   NEXT_PASS (pass_mudflap_2);
 483   NEXT_PASS (pass_free_datastructures);
 484   NEXT_PASS (pass_free_cfg_annotations);
 485   NEXT_PASS (pass_expand);
 486   NEXT_PASS (pass_rest_of_compilation);
 487   NEXT_PASS (pass_clean_state);
 488   *p = NULL;
 489
 490   p = &pass_all_optimizations.sub;
 491   NEXT_PASS (pass_all_early_optimizations);
 492   NEXT_PASS (pass_may_alias);
 493   NEXT_PASS (pass_return_slot);
 494   NEXT_PASS (pass_eliminate_useless_stores);
 495
 496   /* Initial scalar cleanups.  */
 497   NEXT_PASS (pass_ccp);
 498   NEXT_PASS (pass_fre);
 499   NEXT_PASS (pass_dce);
 500   NEXT_PASS (pass_forwprop);
 501   NEXT_PASS (pass_copy_prop);
 502   NEXT_PASS (pass_vrp);
 503   NEXT_PASS (pass_dce);
 504   NEXT_PASS (pass_merge_phi);
 505   NEXT_PASS (pass_dominator);
 506
 507   /* The only copy propagation opportunities left after DOM
 508      should be due to degenerate PHI nodes.  So rather than
 509      run the full copy propagator, just discover and copy
 510      propagate away the degenerate PHI nodes.  */
 511   NEXT_PASS (pass_phi_only_copy_prop);
 512
 513   NEXT_PASS (pass_phiopt);
 514   NEXT_PASS (pass_may_alias);
 515   NEXT_PASS (pass_tail_recursion);
 516   NEXT_PASS (pass_profile);
 517   NEXT_PASS (pass_ch);
 518   NEXT_PASS (pass_stdarg);
 519   NEXT_PASS (pass_lower_complex);
 520   NEXT_PASS (pass_sra);
 521   /* FIXME: SRA may generate arbitrary gimple code, exposing new
 522      aliased and call-clobbered variables.  As mentioned below,
 523      pass_may_alias should be a TODO item.  */
 524   NEXT_PASS (pass_may_alias);
 525   NEXT_PASS (pass_rename_ssa_copies);
 526   NEXT_PASS (pass_dominator);
 527
 528   /* The only copy propagation opportunities left after DOM
 529      should be due to degenerate PHI nodes.  So rather than
 530      run the full copy propagator, just discover and copy
 531      propagate away the degenerate PHI nodes.  */
 532   NEXT_PASS (pass_phi_only_copy_prop);
 533
 534   NEXT_PASS (pass_dce);
 535   NEXT_PASS (pass_dse);
 536   NEXT_PASS (pass_may_alias);
 537   NEXT_PASS (pass_forwprop);
 538   NEXT_PASS (pass_phiopt);
 539   NEXT_PASS (pass_object_sizes);
 540   NEXT_PASS (pass_store_ccp);
 541   NEXT_PASS (pass_store_copy_prop);
 542   NEXT_PASS (pass_fold_builtins);
 543   /* FIXME: May alias should a TODO but for 4.0.0,
 544      we add may_alias right after fold builtins
 545      which can create arbitrary GIMPLE.  */
 546   NEXT_PASS (pass_may_alias);
 547   NEXT_PASS (pass_cse_reciprocals);
 548   NEXT_PASS (pass_split_crit_edges);
 549   NEXT_PASS (pass_reassoc);
 550   NEXT_PASS (pass_pre);
 551   NEXT_PASS (pass_sink_code);
 552   NEXT_PASS (pass_tree_loop);
 553   NEXT_PASS (pass_dominator);
 554
 555   /* The only copy propagation opportunities left after DOM
 556      should be due to degenerate PHI nodes.  So rather than
 557      run the full copy propagator, just discover and copy
 558      propagate away the degenerate PHI nodes.  */
 559   NEXT_PASS (pass_phi_only_copy_prop);
 560
 561   NEXT_PASS (pass_cd_dce);
 562
 563   /* FIXME: If DCE is not run before checking for uninitialized uses,
 564      we may get false warnings (e.g., testsuite/gcc.dg/uninit-5.c).
 565      However, this also causes us to misdiagnose cases that should be
 566      real warnings (e.g., testsuite/gcc.dg/pr18501.c).
 567
 568      To fix the false positives in uninit-5.c, we would have to
 569      account for the predicates protecting the set and the use of each
 570      variable.  Using a representation like Gated Single Assignment
 571      may help.  */
 572   NEXT_PASS (pass_late_warn_uninitialized);
 573   NEXT_PASS (pass_dse);
 574   NEXT_PASS (pass_forwprop);
 575   NEXT_PASS (pass_phiopt);
 576   NEXT_PASS (pass_tail_calls);
 577   NEXT_PASS (pass_rename_ssa_copies);
 578   NEXT_PASS (pass_uncprop);
 579   NEXT_PASS (pass_del_ssa);
 580   NEXT_PASS (pass_nrv);
 581   NEXT_PASS (pass_remove_useless_vars);
 582   NEXT_PASS (pass_mark_used_blocks);
 583   NEXT_PASS (pass_cleanup_cfg_post_optimizing);
 584   *p = NULL;
 585
 586   p = &pass_tree_loop.sub;
 587   NEXT_PASS (pass_tree_loop_init);
 588   NEXT_PASS (pass_copy_prop);
 589   NEXT_PASS (pass_lim);
 590   NEXT_PASS (pass_tree_unswitch);
 591   NEXT_PASS (pass_scev_cprop);
 592   NEXT_PASS (pass_empty_loop);
 593   NEXT_PASS (pass_record_bounds);
 594   NEXT_PASS (pass_linear_transform);
 595   NEXT_PASS (pass_iv_canon);
 596   NEXT_PASS (pass_if_conversion);
 597   NEXT_PASS (pass_vectorize);
 598   /* NEXT_PASS (pass_may_alias) cannot be done again because the
 599      vectorizer creates alias relations that are not supported by
 600      pass_may_alias.  */
 601   NEXT_PASS (pass_complete_unroll);
 602   NEXT_PASS (pass_iv_optimize);
 603   NEXT_PASS (pass_tree_loop_done);
 604   *p = NULL;
 605
 606   p = &pass_vectorize.sub;
 607   NEXT_PASS (pass_lower_vector_ssa);
 608   NEXT_PASS (pass_dce_loop);
 609   *p = NULL;
 610
 611   p = &pass_loop2.sub;
 612   NEXT_PASS (pass_rtl_loop_init);
 613   NEXT_PASS (pass_rtl_move_loop_invariants);
 614   NEXT_PASS (pass_rtl_unswitch);
 615   NEXT_PASS (pass_rtl_unroll_and_peel_loops);
 616   NEXT_PASS (pass_rtl_doloop);
 617   NEXT_PASS (pass_rtl_loop_done);
 618   *p = NULL;
 619
 620   p = &pass_rest_of_compilation.sub;
 621   NEXT_PASS (pass_remove_unnecessary_notes);
 622   NEXT_PASS (pass_init_function);
 623   NEXT_PASS (pass_jump);
 624   NEXT_PASS (pass_insn_locators_initialize);
 625   NEXT_PASS (pass_rtl_eh);
 626   NEXT_PASS (pass_initial_value_sets);
 627   NEXT_PASS (pass_unshare_all_rtl);
 628   NEXT_PASS (pass_instantiate_virtual_regs);
 629   NEXT_PASS (pass_jump2);
 630   NEXT_PASS (pass_cse);
 631   NEXT_PASS (pass_gcse);
 632   NEXT_PASS (pass_loop_optimize);
 633   NEXT_PASS (pass_jump_bypass);
 634   NEXT_PASS (pass_cfg);
 635   NEXT_PASS (pass_branch_prob);
 636   NEXT_PASS (pass_rtl_ifcvt);
 637   NEXT_PASS (pass_tracer);
 638   /* Perform loop optimizations.  It might be better to do them a bit
 639      sooner, but we want the profile feedback to work more
 640      efficiently.  */
 641   NEXT_PASS (pass_loop2);
 642   NEXT_PASS (pass_web);
 643   NEXT_PASS (pass_cse2);
 644   NEXT_PASS (pass_life);
 645   NEXT_PASS (pass_combine);
 646   NEXT_PASS (pass_if_after_combine);
 647   NEXT_PASS (pass_partition_blocks);
 648   NEXT_PASS (pass_regmove);
 649   NEXT_PASS (pass_split_all_insns);
 650   NEXT_PASS (pass_mode_switching);
 651   NEXT_PASS (pass_recompute_reg_usage);
 652   NEXT_PASS (pass_sms);
 653   NEXT_PASS (pass_sched);
 654   NEXT_PASS (pass_local_alloc);
 655   NEXT_PASS (pass_global_alloc);
 656   NEXT_PASS (pass_postreload);
 657   *p = NULL;
 658
 659   p = &pass_postreload.sub;
 660   NEXT_PASS (pass_postreload_cse);
 661   NEXT_PASS (pass_gcse2);
 662   NEXT_PASS (pass_flow2);
 663   NEXT_PASS (pass_stack_adjustments);
 664   NEXT_PASS (pass_peephole2);
 665   NEXT_PASS (pass_if_after_reload);
 666   NEXT_PASS (pass_regrename);
 667   NEXT_PASS (pass_reorder_blocks);
 668   NEXT_PASS (pass_branch_target_load_optimize);
 669   NEXT_PASS (pass_leaf_regs);
 670   NEXT_PASS (pass_sched2);
 671   NEXT_PASS (pass_split_before_regstack);
 672   NEXT_PASS (pass_stack_regs);
 673   NEXT_PASS (pass_compute_alignments);
 674   NEXT_PASS (pass_duplicate_computed_gotos);
 675   NEXT_PASS (pass_variable_tracking);
 676   NEXT_PASS (pass_free_cfg);
 677   NEXT_PASS (pass_machine_reorg);
 678   NEXT_PASS (pass_purge_lineno_notes);
 679   NEXT_PASS (pass_cleanup_barriers);
 680   NEXT_PASS (pass_delay_slots);
 681   NEXT_PASS (pass_split_for_shorten_branches);
 682   NEXT_PASS (pass_convert_to_eh_region_ranges);
 683   NEXT_PASS (pass_shorten_branches);
 684   NEXT_PASS (pass_set_nothrow_function_flags);
 685   NEXT_PASS (pass_final);
 686   *p = NULL;
 687
 688 #undef NEXT_PASS
 689
 690   /* Register the passes with the tree dump code.  */
 691   register_dump_files (all_ipa_passes, true, PROP_gimple_leh | PROP_cfg);
 692   register_dump_files (all_lowering_passes, false, PROP_gimple_any);
 693   register_dump_files (all_passes, false, PROP_gimple_leh | PROP_cfg);
 694 }
 695
 696 static unsigned int last_verified;
 697
 698 static void
 699 execute_todo (struct tree_opt_pass *pass, unsigned int flags, bool use_required)
 700 {
 701   int properties
 702     = use_required ? pass->properties_required : pass->properties_provided;
 703
 704 #if defined ENABLE_CHECKING
 705   if (need_ssa_update_p ())
 706     gcc_assert (flags & TODO_update_ssa_any);
 707 #endif
 708
 709   /* Always cleanup the CFG before doing anything else.  */
 710   if (flags & TODO_cleanup_cfg)
 711     {
 712       if (current_loops)
 713         cleanup_tree_cfg_loop ();
 714       else
 715         cleanup_tree_cfg ();
 716
 717       /* When cleanup_tree_cfg merges consecutive blocks, it may
 718          perform some simplistic propagation when removing single
 719          valued PHI nodes.  This propagation may, in turn, cause the
 720          SSA form to become out-of-date (see PR 22037).  So, even
 721          if the parent pass had not scheduled an SSA update, we may
 722          still need to do one.  */
 723       if (!(flags & TODO_update_ssa_any) && need_ssa_update_p ())
 724         flags |= TODO_update_ssa;
 725     }
 726
 727   if (flags & TODO_update_ssa_any)
 728     {
 729       unsigned update_flags = flags & TODO_update_ssa_any;
 730       update_ssa (update_flags);
 731     }
 732
 733   if ((flags & TODO_dump_func)
 734       && dump_file && current_function_decl)
 735     {
 736       if (properties & PROP_trees)
 737         dump_function_to_file (current_function_decl,
 738                                dump_file, dump_flags);
 739       else if (properties & PROP_cfg)
 740         {
 741           print_rtl_with_bb (dump_file, get_insns ());
 742
 743           if (graph_dump_format != no_graph
 744               && (dump_flags & TDF_GRAPH))
 745             print_rtl_graph_with_bb (dump_file_name, get_insns ());
 746         }
 747       else
 748         print_rtl (dump_file, get_insns ());
 749
 750       /* Flush the file.  If verification fails, we won't be able to
 751          close the file before aborting.  */
 752       fflush (dump_file);
 753     }
 754   if ((flags & TODO_dump_cgraph)
 755       && dump_file && !current_function_decl)
 756     {
 757       dump_cgraph (dump_file);
 758       /* Flush the file.  If verification fails, we won't be able to
 759          close the file before aborting.  */
 760       fflush (dump_file);
 761     }
 762
 763   if (flags & TODO_ggc_collect)
 764     {
 765       ggc_collect ();
 766     }
 767
 768 #if defined ENABLE_CHECKING
 769   if ((pass->properties_required & PROP_ssa)
 770       && !(pass->properties_destroyed & PROP_ssa))
 771     verify_ssa (true);
 772   if (flags & TODO_verify_flow)
 773     verify_flow_info ();
 774   if (flags & TODO_verify_stmts)
 775     verify_stmts ();
 776   if (flags & TODO_verify_loops)
 777     verify_loop_closed_ssa ();
 778 #endif
 779 }
 780
 781 static bool
 782 execute_one_pass (struct tree_opt_pass *pass, bool announce)
 783 {
 784   unsigned int todo;
 785
 786   /* See if we're supposed to run this pass.  */
 787   if (pass->gate && !pass->gate ())
 788     return false;
 789
 790   if (!quiet_flag && announce)
 791     {
 792       fprintf (stderr, ", %s", pass->name);
 793       fflush (stderr);
 794     }
 795
 796   /* Note that the folders should only create gimple expressions.
 797      This is a hack until the new folder is ready.  */
 798   in_gimple_form = (pass->properties_provided & PROP_trees) != 0;
 799
 800   /* Run pre-pass verification.  */
 801   todo = pass->todo_flags_start & ~last_verified;
 802   if (todo)
 803     execute_todo (pass, todo, true);
 804
 805   /* If a dump file name is present, open it if enabled.  */
 806   if (pass->static_pass_number != -1)
 807     {
 808       bool initializing_dump = !dump_initialized_p (pass->static_pass_number);
 809       dump_file_name = get_dump_file_name (pass->static_pass_number);
 810       dump_file = dump_begin (pass->static_pass_number, &dump_flags);
 811       if (dump_file && current_function_decl)
 812         {
 813           const char *dname, *aname;
 814           dname = lang_hooks.decl_printable_name (current_function_decl, 2);
 815           aname = (IDENTIFIER_POINTER
 816                    (DECL_ASSEMBLER_NAME (current_function_decl)));
 817           fprintf (dump_file, "\n;; Function %s (%s)%s\n\n", dname, aname,
 818              cfun->function_frequency == FUNCTION_FREQUENCY_HOT
 819              ? " (hot)"
 820              : cfun->function_frequency == FUNCTION_FREQUENCY_UNLIKELY_EXECUTED
 821              ? " (unlikely executed)"
 822              : "");
 823         }
 824
 825       if (initializing_dump
 826           && dump_file
 827           && graph_dump_format != no_graph
 828           && (pass->properties_provided & (PROP_cfg | PROP_rtl))
 829               == (PROP_cfg | PROP_rtl))
 830         {
 831           get_dump_file_info (pass->static_pass_number)->flags |= TDF_GRAPH;
 832           dump_flags |= TDF_GRAPH;
 833           clean_graph_dump_file (dump_file_name);
 834         }
 835     }
 836
 837   /* If a timevar is present, start it.  */
 838   if (pass->tv_id)
 839     timevar_push (pass->tv_id);
 840
 841   /* Do it!  */
 842   if (pass->execute)
 843     pass->execute ();
 844
 845   /* Stop timevar.  */
 846   if (pass->tv_id)
 847     timevar_pop (pass->tv_id);
 848
 849   /* Run post-pass cleanup and verification.  */
 850   todo = pass->todo_flags_finish;
 851   last_verified = todo & TODO_verify_all;
 852   if (todo)
 853     execute_todo (pass, todo, false);
 854
 855   /* Flush and close dump file.  */
 856   if (dump_file_name)
 857     {
 858       free ((char *) dump_file_name);
 859       dump_file_name = NULL;
 860     }
 861   if (dump_file)
 862     {
 863       dump_end (pass->static_pass_number, dump_file);
 864       dump_file = NULL;
 865     }
 866
 867   return true;
 868 }
 869
 870 void
 871 execute_pass_list (struct tree_opt_pass *pass)
 872 {
 873   do
 874     {
 875       if (execute_one_pass (pass, false) && pass->sub)
 876         execute_pass_list (pass->sub);
 877       pass = pass->next;
 878     }
 879   while (pass);
 880 }
 881
 882 /* Same as execute_pass_list but assume that subpasses of IPA passes
 883    are local passes.  */
 884 void
 885 execute_ipa_pass_list (struct tree_opt_pass *pass)
 886 {
 887   do
 888     {
 889       if (execute_one_pass (pass, true) && pass->sub)
 890         {
 891           struct cgraph_node *node;
 892           for (node = cgraph_nodes; node; node = node->next)
 893             if (node->analyzed)
 894               {
 895                 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
 896                 current_function_decl = node->decl;
 897                 execute_pass_list (pass->sub);
 898                 free_dominance_info (CDI_DOMINATORS);
 899                 free_dominance_info (CDI_POST_DOMINATORS);
 900                 current_function_decl = NULL;
 901                 pop_cfun ();
 902                 ggc_collect ();
 903               }
 904         }
 905       pass = pass->next;
 906     }
 907   while (pass);
 908 }