gcc/tracer.c

   1 /* The tracer pass for the GNU compiler.
   2    Contributed by Jan Hubicka, SuSE Labs.
   3    Adapted to work on GIMPLE instead of RTL by Robert Kidd, UIUC.
   4    Copyright (C) 2001-2018 Free Software Foundation, Inc.
   5
   6    This file is part of GCC.
   7
   8    GCC is free software; you can redistribute it and/or modify it
   9    under the terms of the GNU General Public License as published by
  10    the Free Software Foundation; either version 3, or (at your option)
  11    any later version.
  12
  13    GCC is distributed in the hope that it will be useful, but WITHOUT
  14    ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
  15    or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public
  16    License 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 /* This pass performs the tail duplication needed for superblock formation.
  23    For more information see:
  24
  25      Design and Analysis of Profile-Based Optimization in Compaq's
  26      Compilation Tools for Alpha; Journal of Instruction-Level
  27      Parallelism 3 (2000) 1-25
  28
  29    Unlike Compaq's implementation we don't do the loop peeling as most
  30    probably a better job can be done by a special pass and we don't
  31    need to worry too much about the code size implications as the tail
  32    duplicates are crossjumped again if optimizations are not
  33    performed.  */
  34
  35
  36 #include "config.h"
  37 #include "system.h"
  38 #include "coretypes.h"
  39 #include "backend.h"
  40 #include "rtl.h"
  41 #include "tree.h"
  42 #include "gimple.h"
  43 #include "cfghooks.h"
  44 #include "tree-pass.h"
  45 #include "profile.h"
  46 #include "cfganal.h"
  47 #include "params.h"
  48 #include "gimple-iterator.h"
  49 #include "tree-cfg.h"
  50 #include "tree-ssa.h"
  51 #include "tree-inline.h"
  52 #include "cfgloop.h"
  53 #include "fibonacci_heap.h"
  54 #include "tracer.h"
  55
  56 static int count_insns (basic_block);
  57 static bool better_p (const_edge, const_edge);
  58 static edge find_best_successor (basic_block);
  59 static edge find_best_predecessor (basic_block);
  60 static int find_trace (basic_block, basic_block *);
  61
  62 /* Minimal outgoing edge probability considered for superblock formation.  */
  63 static int probability_cutoff;
  64 static int branch_ratio_cutoff;
  65
  66 /* A bit BB->index is set if BB has already been seen, i.e. it is
  67    connected to some trace already.  */
  68 static sbitmap bb_seen;
  69
  70 static inline void
  71 mark_bb_seen (basic_block bb)
  72 {
  73   unsigned int size = SBITMAP_SIZE (bb_seen);
  74
  75   if ((unsigned int)bb->index >= size)
  76     bb_seen = sbitmap_resize (bb_seen, size * 2, 0);
  77
  78   bitmap_set_bit (bb_seen, bb->index);
  79 }
  80
  81 static inline bool
  82 bb_seen_p (basic_block bb)
  83 {
  84   return bitmap_bit_p (bb_seen, bb->index);
  85 }
  86
  87 /* Return true if we should ignore the basic block for purposes of tracing.  */
  88 bool
  89 ignore_bb_p (const_basic_block bb)
  90 {
  91   if (bb->index < NUM_FIXED_BLOCKS)
  92     return true;
  93   if (optimize_bb_for_size_p (bb))
  94     return true;
  95
  96   if (gimple *g = last_stmt (CONST_CAST_BB (bb)))
  97     {
  98       /* A transaction is a single entry multiple exit region.  It
  99          must be duplicated in its entirety or not at all.  */
 100       if (gimple_code (g) == GIMPLE_TRANSACTION)
 101         return true;
 102
 103       /* An IFN_UNIQUE call must be duplicated as part of its group,
 104          or not at all.  */
 105       if (is_gimple_call (g)
 106           && gimple_call_internal_p (g)
 107           && gimple_call_internal_unique_p (g))
 108         return true;
 109     }
 110
 111   return false;
 112 }
 113
 114 /* Return number of instructions in the block.  */
 115
 116 static int
 117 count_insns (basic_block bb)
 118 {
 119   gimple_stmt_iterator gsi;
 120   gimple *stmt;
 121   int n = 0;
 122
 123   for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
 124     {
 125       stmt = gsi_stmt (gsi);
 126       n += estimate_num_insns (stmt, &eni_size_weights);
 127     }
 128   return n;
 129 }
 130
 131 /* Return true if E1 is more frequent than E2.  */
 132 static bool
 133 better_p (const_edge e1, const_edge e2)
 134 {
 135   if ((e1->count () > e2->count ()) || (e1->count () < e2->count ()))
 136     return e1->count () > e2->count ();
 137   /* This is needed to avoid changes in the decision after
 138      CFG is modified.  */
 139   if (e1->src != e2->src)
 140     return e1->src->index > e2->src->index;
 141   return e1->dest->index > e2->dest->index;
 142 }
 143
 144 /* Return most frequent successor of basic block BB.  */
 145
 146 static edge
 147 find_best_successor (basic_block bb)
 148 {
 149   edge e;
 150   edge best = NULL;
 151   edge_iterator ei;
 152
 153   FOR_EACH_EDGE (e, ei, bb->succs)
 154     {
 155       if (!e->count ().initialized_p ())
 156         return NULL;
 157       if (!best || better_p (e, best))
 158         best = e;
 159     }
 160   if (!best || ignore_bb_p (best->dest))
 161     return NULL;
 162   if (best->probability.to_reg_br_prob_base () <= probability_cutoff)
 163     return NULL;
 164   return best;
 165 }
 166
 167 /* Return most frequent predecessor of basic block BB.  */
 168
 169 static edge
 170 find_best_predecessor (basic_block bb)
 171 {
 172   edge e;
 173   edge best = NULL;
 174   edge_iterator ei;
 175
 176   FOR_EACH_EDGE (e, ei, bb->preds)
 177     {
 178       if (!e->count ().initialized_p ())
 179         return NULL;
 180       if (!best || better_p (e, best))
 181         best = e;
 182     }
 183   if (!best || ignore_bb_p (best->src))
 184     return NULL;
 185   if (bb->count.initialized_p ()
 186       && (best->count ().to_frequency (cfun) * REG_BR_PROB_BASE
 187           < bb->count.to_frequency (cfun) * branch_ratio_cutoff))
 188     return NULL;
 189   return best;
 190 }
 191
 192 /* Find the trace using bb and record it in the TRACE array.
 193    Return number of basic blocks recorded.  */
 194
 195 static int
 196 find_trace (basic_block bb, basic_block *trace)
 197 {
 198   int i = 0;
 199   edge e;
 200
 201   if (dump_file)
 202     fprintf (dump_file, "Trace seed %i [%i]", bb->index, bb->count.to_frequency (cfun));
 203
 204   while ((e = find_best_predecessor (bb)) != NULL)
 205     {
 206       basic_block bb2 = e->src;
 207       if (bb_seen_p (bb2) || (e->flags & (EDGE_DFS_BACK | EDGE_COMPLEX))
 208           || find_best_successor (bb2) != e)
 209         break;
 210       if (dump_file)
 211         fprintf (dump_file, ",%i [%i]", bb->index, bb->count.to_frequency (cfun));
 212       bb = bb2;
 213     }
 214   if (dump_file)
 215     fprintf (dump_file, " forward %i [%i]", bb->index, bb->count.to_frequency (cfun));
 216   trace[i++] = bb;
 217
 218   /* Follow the trace in forward direction.  */
 219   while ((e = find_best_successor (bb)) != NULL)
 220     {
 221       bb = e->dest;
 222       if (bb_seen_p (bb) || (e->flags & (EDGE_DFS_BACK | EDGE_COMPLEX))
 223           || find_best_predecessor (bb) != e)
 224         break;
 225       if (dump_file)
 226         fprintf (dump_file, ",%i [%i]", bb->index, bb->count.to_frequency (cfun));
 227       trace[i++] = bb;
 228     }
 229   if (dump_file)
 230     fprintf (dump_file, "\n");
 231   return i;
 232 }
 233
 234 /* Duplicate block BB2, placing it after BB in the CFG.  Return the
 235    newly created block.  */
 236 basic_block
 237 transform_duplicate (basic_block bb, basic_block bb2)
 238 {
 239   edge e;
 240   basic_block copy;
 241
 242   e = find_edge (bb, bb2);
 243
 244   copy = duplicate_block (bb2, e, bb);
 245   flush_pending_stmts (e);
 246
 247   add_phi_args_after_copy (&copy, 1, NULL);
 248
 249   return (copy);
 250 }
 251
 252 /* Look for basic blocks in frequency order, construct traces and tail duplicate
 253    if profitable.  */
 254
 255 static bool
 256 tail_duplicate (void)
 257 {
 258   auto_vec<fibonacci_node<long, basic_block_def>*> blocks;
 259   blocks.safe_grow_cleared (last_basic_block_for_fn (cfun));
 260
 261   basic_block *trace = XNEWVEC (basic_block, n_basic_blocks_for_fn (cfun));
 262   int *counts = XNEWVEC (int, last_basic_block_for_fn (cfun));
 263   int ninsns = 0, nduplicated = 0;
 264   gcov_type weighted_insns = 0, traced_insns = 0;
 265   fibonacci_heap<long, basic_block_def> heap (LONG_MIN);
 266   gcov_type cover_insns;
 267   int max_dup_insns;
 268   basic_block bb;
 269   bool changed = false;
 270
 271   /* Create an oversized sbitmap to reduce the chance that we need to
 272      resize it.  */
 273   bb_seen = sbitmap_alloc (last_basic_block_for_fn (cfun) * 2);
 274   bitmap_clear (bb_seen);
 275   initialize_original_copy_tables ();
 276
 277   if (profile_info && profile_status_for_fn (cfun) == PROFILE_READ)
 278     probability_cutoff = PARAM_VALUE (TRACER_MIN_BRANCH_PROBABILITY_FEEDBACK);
 279   else
 280     probability_cutoff = PARAM_VALUE (TRACER_MIN_BRANCH_PROBABILITY);
 281   probability_cutoff = REG_BR_PROB_BASE / 100 * probability_cutoff;
 282
 283   branch_ratio_cutoff =
 284     (REG_BR_PROB_BASE / 100 * PARAM_VALUE (TRACER_MIN_BRANCH_RATIO));
 285
 286   FOR_EACH_BB_FN (bb, cfun)
 287     {
 288       int n = count_insns (bb);
 289       if (!ignore_bb_p (bb))
 290         blocks[bb->index] = heap.insert (-bb->count.to_frequency (cfun), bb);
 291
 292       counts [bb->index] = n;
 293       ninsns += n;
 294       weighted_insns += n * bb->count.to_frequency (cfun);
 295     }
 296
 297   if (profile_info && profile_status_for_fn (cfun) == PROFILE_READ)
 298     cover_insns = PARAM_VALUE (TRACER_DYNAMIC_COVERAGE_FEEDBACK);
 299   else
 300     cover_insns = PARAM_VALUE (TRACER_DYNAMIC_COVERAGE);
 301   cover_insns = (weighted_insns * cover_insns + 50) / 100;
 302   max_dup_insns = (ninsns * PARAM_VALUE (TRACER_MAX_CODE_GROWTH) + 50) / 100;
 303
 304   while (traced_insns < cover_insns && nduplicated < max_dup_insns
 305          && !heap.empty ())
 306     {
 307       basic_block bb = heap.extract_min ();
 308       int n, pos;
 309
 310       if (!bb)
 311         break;
 312
 313       blocks[bb->index] = NULL;
 314
 315       if (ignore_bb_p (bb))
 316         continue;
 317       gcc_assert (!bb_seen_p (bb));
 318
 319       n = find_trace (bb, trace);
 320
 321       bb = trace[0];
 322       traced_insns += bb->count.to_frequency (cfun) * counts [bb->index];
 323       if (blocks[bb->index])
 324         {
 325           heap.delete_node (blocks[bb->index]);
 326           blocks[bb->index] = NULL;
 327         }
 328
 329       for (pos = 1; pos < n; pos++)
 330         {
 331           basic_block bb2 = trace[pos];
 332
 333           if (blocks[bb2->index])
 334             {
 335               heap.delete_node (blocks[bb2->index]);
 336               blocks[bb2->index] = NULL;
 337             }
 338           traced_insns += bb2->count.to_frequency (cfun) * counts [bb2->index];
 339           if (EDGE_COUNT (bb2->preds) > 1
 340               && can_duplicate_block_p (bb2)
 341               /* We have the tendency to duplicate the loop header
 342                  of all do { } while loops.  Do not do that - it is
 343                  not profitable and it might create a loop with multiple
 344                  entries or at least rotate the loop.  */
 345               && bb2->loop_father->header != bb2)
 346             {
 347               nduplicated += counts [bb2->index];
 348               basic_block copy = transform_duplicate (bb, bb2);
 349
 350               /* Reconsider the original copy of block we've duplicated.
 351                  Removing the most common predecessor may make it to be
 352                  head.  */
 353               blocks[bb2->index] = heap.insert (-bb2->count.to_frequency (cfun), bb2);
 354
 355               if (dump_file)
 356                 fprintf (dump_file, "Duplicated %i as %i [%i]\n",
 357                          bb2->index, copy->index, copy->count.to_frequency (cfun));
 358
 359               bb2 = copy;
 360               changed = true;
 361             }
 362           mark_bb_seen (bb2);
 363           bb = bb2;
 364           /* In case the trace became infrequent, stop duplicating.  */
 365           if (ignore_bb_p (bb))
 366             break;
 367         }
 368       if (dump_file)
 369         fprintf (dump_file, " covered now %.1f\n\n",
 370                  traced_insns * 100.0 / weighted_insns);
 371     }
 372   if (dump_file)
 373     fprintf (dump_file, "Duplicated %i insns (%i%%)\n", nduplicated,
 374              nduplicated * 100 / ninsns);
 375
 376   free_original_copy_tables ();
 377   sbitmap_free (bb_seen);
 378   free (trace);
 379   free (counts);
 380
 381   return changed;
 382 }
 383 \f
 384 namespace {
 385
 386 const pass_data pass_data_tracer =
 387 {
 388   GIMPLE_PASS, /* type */
 389   "tracer", /* name */
 390   OPTGROUP_NONE, /* optinfo_flags */
 391   TV_TRACER, /* tv_id */
 392   0, /* properties_required */
 393   0, /* properties_provided */
 394   0, /* properties_destroyed */
 395   0, /* todo_flags_start */
 396   TODO_update_ssa, /* todo_flags_finish */
 397 };
 398
 399 class pass_tracer : public gimple_opt_pass
 400 {
 401 public:
 402   pass_tracer (gcc::context *ctxt)
 403     : gimple_opt_pass (pass_data_tracer, ctxt)
 404   {}
 405
 406   /* opt_pass methods: */
 407   virtual bool gate (function *)
 408     {
 409       return (optimize > 0 && flag_tracer && flag_reorder_blocks);
 410     }
 411
 412   virtual unsigned int execute (function *);
 413
 414 }; // class pass_tracer
 415
 416 unsigned int
 417 pass_tracer::execute (function *fun)
 418 {
 419   bool changed;
 420
 421   if (n_basic_blocks_for_fn (fun) <= NUM_FIXED_BLOCKS + 1)
 422     return 0;
 423
 424   mark_dfs_back_edges ();
 425   if (dump_file)
 426     brief_dump_cfg (dump_file, dump_flags);
 427
 428   /* Trace formation is done on the fly inside tail_duplicate */
 429   changed = tail_duplicate ();
 430   if (changed)
 431     {
 432       free_dominance_info (CDI_DOMINATORS);
 433       /* If we changed the CFG schedule loops for fixup by cleanup_cfg.  */
 434       loops_state_set (LOOPS_NEED_FIXUP);
 435     }
 436
 437   if (dump_file)
 438     brief_dump_cfg (dump_file, dump_flags);
 439
 440   return changed ? TODO_cleanup_cfg : 0;
 441 }
 442 } // anon namespace
 443
 444 gimple_opt_pass *
 445 make_pass_tracer (gcc::context *ctxt)
 446 {
 447   return new pass_tracer (ctxt);
 448 }