gcc/tree-ssa-phiprop.c

   1 /* Backward propagation of indirect loads through PHIs.
   2    Copyright (C) 2007, 2008, 2009, 2010, 2011, 2012
   3    Free Software Foundation, Inc.
   4    Contributed by Richard Guenther <rguenther@suse.de>
   5
   6 This file is part of GCC.
   7
   8 GCC is free software; you can redistribute it and/or modify
   9 it 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,
  14 but WITHOUT ANY WARRANTY; without even the implied warranty of
  15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  16 GNU General Public 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 #include "config.h"
  23 #include "system.h"
  24 #include "coretypes.h"
  25 #include "tm.h"
  26 #include "tree.h"
  27 #include "tm_p.h"
  28 #include "basic-block.h"
  29 #include "gimple-pretty-print.h"
  30 #include "tree-flow.h"
  31 #include "tree-pass.h"
  32 #include "langhooks.h"
  33 #include "flags.h"
  34
  35 /* This pass propagates indirect loads through the PHI node for its
  36    address to make the load source possibly non-addressable and to
  37    allow for PHI optimization to trigger.
  38
  39    For example the pass changes
  40
  41      # addr_1 = PHI <&a, &b>
  42      tmp_1 = *addr_1;
  43
  44    to
  45
  46      # tmp_1 = PHI <a, b>
  47
  48    but also handles more complex scenarios like
  49
  50      D.2077_2 = &this_1(D)->a1;
  51      ...
  52
  53      # b_12 = PHI <&c(2), D.2077_2(3)>
  54      D.2114_13 = *b_12;
  55      ...
  56
  57      # b_15 = PHI <b_12(4), &b(5)>
  58      D.2080_5 = &this_1(D)->a0;
  59      ...
  60
  61      # b_18 = PHI <D.2080_5(6), &c(7)>
  62      ...
  63
  64      # b_21 = PHI <b_15(8), b_18(9)>
  65      D.2076_8 = *b_21;
  66
  67    where the addresses loaded are defined by PHIs itself.
  68    The above happens for
  69
  70      std::max(std::min(a0, c), std::min(std::max(a1, c), b))
  71
  72    where this pass transforms it to a form later PHI optimization
  73    recognizes and transforms it to the simple
  74
  75      D.2109_10 = this_1(D)->a1;
  76      D.2110_11 = c;
  77      D.2114_31 = MAX_EXPR <D.2109_10, D.2110_11>;
  78      D.2115_14 = b;
  79      D.2125_17 = MIN_EXPR <D.2115_14, D.2114_31>;
  80      D.2119_16 = this_1(D)->a0;
  81      D.2124_32 = MIN_EXPR <D.2110_11, D.2119_16>;
  82      D.2076_33 = MAX_EXPR <D.2125_17, D.2124_32>;
  83
  84    The pass does a dominator walk processing loads using a basic-block
  85    local analysis and stores the result for use by transformations on
  86    dominated basic-blocks.  */
  87
  88
  89 /* Structure to keep track of the value of a dereferenced PHI result
  90    and the virtual operand used for that dereference.  */
  91
  92 struct phiprop_d
  93 {
  94   tree value;
  95   tree vuse;
  96 };
  97
  98 /* Verify if the value recorded for NAME in PHIVN is still valid at
  99    the start of basic block BB.  */
 100
 101 static bool
 102 phivn_valid_p (struct phiprop_d *phivn, tree name, basic_block bb)
 103 {
 104   tree vuse = phivn[SSA_NAME_VERSION (name)].vuse;
 105   gimple use_stmt;
 106   imm_use_iterator ui2;
 107   bool ok = true;
 108
 109   /* The def stmts of the virtual uses need to be dominated by bb.  */
 110   gcc_assert (vuse != NULL_TREE);
 111
 112   FOR_EACH_IMM_USE_STMT (use_stmt, ui2, vuse)
 113     {
 114       /* If BB does not dominate a VDEF, the value is invalid.  */
 115       if ((gimple_vdef (use_stmt) != NULL_TREE
 116            || gimple_code (use_stmt) == GIMPLE_PHI)
 117           && !dominated_by_p (CDI_DOMINATORS, gimple_bb (use_stmt), bb))
 118         {
 119           ok = false;
 120           BREAK_FROM_IMM_USE_STMT (ui2);
 121         }
 122     }
 123
 124   return ok;
 125 }
 126
 127 /* Insert a new phi node for the dereference of PHI at basic_block
 128    BB with the virtual operands from USE_STMT.  */
 129
 130 static tree
 131 phiprop_insert_phi (basic_block bb, gimple phi, gimple use_stmt,
 132                     struct phiprop_d *phivn, size_t n)
 133 {
 134   tree res;
 135   gimple new_phi;
 136   edge_iterator ei;
 137   edge e;
 138
 139   gcc_assert (is_gimple_assign (use_stmt)
 140               && gimple_assign_rhs_code (use_stmt) == MEM_REF);
 141
 142   /* Build a new PHI node to replace the definition of
 143      the indirect reference lhs.  */
 144   res = gimple_assign_lhs (use_stmt);
 145   new_phi = create_phi_node (res, bb);
 146
 147   if (dump_file && (dump_flags & TDF_DETAILS))
 148     {
 149       fprintf (dump_file, "Inserting PHI for result of load ");
 150       print_gimple_stmt (dump_file, use_stmt, 0, 0);
 151     }
 152
 153   /* Add PHI arguments for each edge inserting loads of the
 154      addressable operands.  */
 155   FOR_EACH_EDGE (e, ei, bb->preds)
 156     {
 157       tree old_arg, new_var;
 158       gimple tmp;
 159       source_location locus;
 160
 161       old_arg = PHI_ARG_DEF_FROM_EDGE (phi, e);
 162       locus = gimple_phi_arg_location_from_edge (phi, e);
 163       while (TREE_CODE (old_arg) == SSA_NAME
 164              && (SSA_NAME_VERSION (old_arg) >= n
 165                  || phivn[SSA_NAME_VERSION (old_arg)].value == NULL_TREE))
 166         {
 167           gimple def_stmt = SSA_NAME_DEF_STMT (old_arg);
 168           old_arg = gimple_assign_rhs1 (def_stmt);
 169           locus = gimple_location (def_stmt);
 170         }
 171
 172       if (TREE_CODE (old_arg) == SSA_NAME)
 173         {
 174           if (dump_file && (dump_flags & TDF_DETAILS))
 175             {
 176               fprintf (dump_file, "  for edge defining ");
 177               print_generic_expr (dump_file, PHI_ARG_DEF_FROM_EDGE (phi, e), 0);
 178               fprintf (dump_file, " reusing PHI result ");
 179               print_generic_expr (dump_file,
 180                                   phivn[SSA_NAME_VERSION (old_arg)].value, 0);
 181               fprintf (dump_file, "\n");
 182             }
 183           /* Reuse a formerly created dereference.  */
 184           new_var = phivn[SSA_NAME_VERSION (old_arg)].value;
 185         }
 186       else
 187         {
 188           tree rhs = gimple_assign_rhs1 (use_stmt);
 189           gcc_assert (TREE_CODE (old_arg) == ADDR_EXPR);
 190           new_var = make_ssa_name (TREE_TYPE (rhs), NULL);
 191           if (!is_gimple_min_invariant (old_arg))
 192             old_arg = PHI_ARG_DEF_FROM_EDGE (phi, e);
 193           else
 194             old_arg = unshare_expr (old_arg);
 195           tmp = gimple_build_assign (new_var,
 196                                      fold_build2 (MEM_REF, TREE_TYPE (rhs),
 197                                                   old_arg,
 198                                                   TREE_OPERAND (rhs, 1)));
 199           gimple_set_location (tmp, locus);
 200
 201           gsi_insert_on_edge (e, tmp);
 202           update_stmt (tmp);
 203
 204           if (dump_file && (dump_flags & TDF_DETAILS))
 205             {
 206               fprintf (dump_file, "  for edge defining ");
 207               print_generic_expr (dump_file, PHI_ARG_DEF_FROM_EDGE (phi, e), 0);
 208               fprintf (dump_file, " inserting load ");
 209               print_gimple_stmt (dump_file, tmp, 0, 0);
 210             }
 211         }
 212
 213       add_phi_arg (new_phi, new_var, e, locus);
 214     }
 215
 216   update_stmt (new_phi);
 217
 218   if (dump_file && (dump_flags & TDF_DETAILS))
 219     print_gimple_stmt (dump_file, new_phi, 0, 0);
 220
 221   return res;
 222 }
 223
 224 /* Propagate between the phi node arguments of PHI in BB and phi result
 225    users.  For now this matches
 226         # p_2 = PHI <&x, &y>
 227       <Lx>:;
 228         p_3 = p_2;
 229         z_2 = *p_3;
 230    and converts it to
 231         # z_2 = PHI <x, y>
 232       <Lx>:;
 233    Returns true if a transformation was done and edge insertions
 234    need to be committed.  Global data PHIVN and N is used to track
 235    past transformation results.  We need to be especially careful here
 236    with aliasing issues as we are moving memory reads.  */
 237
 238 static bool
 239 propagate_with_phi (basic_block bb, gimple phi, struct phiprop_d *phivn,
 240                     size_t n)
 241 {
 242   tree ptr = PHI_RESULT (phi);
 243   gimple use_stmt;
 244   tree res = NULL_TREE;
 245   gimple_stmt_iterator gsi;
 246   imm_use_iterator ui;
 247   use_operand_p arg_p, use;
 248   ssa_op_iter i;
 249   bool phi_inserted;
 250   tree type = NULL_TREE;
 251   bool one_invariant = false;
 252
 253   if (!POINTER_TYPE_P (TREE_TYPE (ptr))
 254       || !is_gimple_reg_type (TREE_TYPE (TREE_TYPE (ptr))))
 255     return false;
 256
 257   /* Check if we can "cheaply" dereference all phi arguments.  */
 258   FOR_EACH_PHI_ARG (arg_p, phi, i, SSA_OP_USE)
 259     {
 260       tree arg = USE_FROM_PTR (arg_p);
 261       /* Walk the ssa chain until we reach a ssa name we already
 262          created a value for or we reach a definition of the form
 263          ssa_name_n = &var;  */
 264       while (TREE_CODE (arg) == SSA_NAME
 265              && !SSA_NAME_IS_DEFAULT_DEF (arg)
 266              && (SSA_NAME_VERSION (arg) >= n
 267                  || phivn[SSA_NAME_VERSION (arg)].value == NULL_TREE))
 268         {
 269           gimple def_stmt = SSA_NAME_DEF_STMT (arg);
 270           if (!gimple_assign_single_p (def_stmt))
 271             return false;
 272           arg = gimple_assign_rhs1 (def_stmt);
 273         }
 274       if (TREE_CODE (arg) != ADDR_EXPR
 275           && !(TREE_CODE (arg) == SSA_NAME
 276                && SSA_NAME_VERSION (arg) < n
 277                && phivn[SSA_NAME_VERSION (arg)].value != NULL_TREE
 278                && (!type
 279                    || types_compatible_p
 280                        (type, TREE_TYPE (phivn[SSA_NAME_VERSION (arg)].value)))
 281                && phivn_valid_p (phivn, arg, bb)))
 282         return false;
 283       if (!type
 284           && TREE_CODE (arg) == SSA_NAME)
 285         type = TREE_TYPE (phivn[SSA_NAME_VERSION (arg)].value);
 286       if (TREE_CODE (arg) == ADDR_EXPR
 287           && is_gimple_min_invariant (arg))
 288         one_invariant = true;
 289     }
 290
 291   /* If we neither have an address of a decl nor can reuse a previously
 292      inserted load, do not hoist anything.  */
 293   if (!one_invariant
 294       && !type)
 295     return false;
 296
 297   /* Find a dereferencing use.  First follow (single use) ssa
 298      copy chains for ptr.  */
 299   while (single_imm_use (ptr, &use, &use_stmt)
 300          && gimple_assign_ssa_name_copy_p (use_stmt))
 301     ptr = gimple_assign_lhs (use_stmt);
 302
 303   /* Replace the first dereference of *ptr if there is one and if we
 304      can move the loads to the place of the ptr phi node.  */
 305   phi_inserted = false;
 306   FOR_EACH_IMM_USE_STMT (use_stmt, ui, ptr)
 307     {
 308       gimple def_stmt;
 309       tree vuse;
 310
 311       /* Check whether this is a load of *ptr.  */
 312       if (!(is_gimple_assign (use_stmt)
 313             && TREE_CODE (gimple_assign_lhs (use_stmt)) == SSA_NAME
 314             && gimple_assign_rhs_code (use_stmt) == MEM_REF
 315             && TREE_OPERAND (gimple_assign_rhs1 (use_stmt), 0) == ptr
 316             && integer_zerop (TREE_OPERAND (gimple_assign_rhs1 (use_stmt), 1))
 317             && (!type
 318                 || types_compatible_p
 319                      (TREE_TYPE (gimple_assign_lhs (use_stmt)), type))
 320             /* We cannot replace a load that may throw or is volatile.  */
 321             && !stmt_can_throw_internal (use_stmt)))
 322         continue;
 323
 324       /* Check if we can move the loads.  The def stmt of the virtual use
 325          needs to be in a different basic block dominating bb.  */
 326       vuse = gimple_vuse (use_stmt);
 327       def_stmt = SSA_NAME_DEF_STMT (vuse);
 328       if (!SSA_NAME_IS_DEFAULT_DEF (vuse)
 329           && (gimple_bb (def_stmt) == bb
 330               || !dominated_by_p (CDI_DOMINATORS,
 331                                   bb, gimple_bb (def_stmt))))
 332         goto next;
 333
 334       /* Found a proper dereference.  Insert a phi node if this
 335          is the first load transformation.  */
 336       if (!phi_inserted)
 337         {
 338           res = phiprop_insert_phi (bb, phi, use_stmt, phivn, n);
 339           type = TREE_TYPE (res);
 340
 341           /* Remember the value we created for *ptr.  */
 342           phivn[SSA_NAME_VERSION (ptr)].value = res;
 343           phivn[SSA_NAME_VERSION (ptr)].vuse = vuse;
 344
 345           /* Remove old stmt.  The phi is taken care of by DCE, if we
 346              want to delete it here we also have to delete all intermediate
 347              copies.  */
 348           gsi = gsi_for_stmt (use_stmt);
 349           gsi_remove (&gsi, true);
 350
 351           phi_inserted = true;
 352         }
 353       else
 354         {
 355           /* Further replacements are easy, just make a copy out of the
 356              load.  */
 357           gimple_assign_set_rhs1 (use_stmt, res);
 358           update_stmt (use_stmt);
 359         }
 360
 361 next:;
 362       /* Continue searching for a proper dereference.  */
 363     }
 364
 365   return phi_inserted;
 366 }
 367
 368 /* Main entry for phiprop pass.  */
 369
 370 static unsigned int
 371 tree_ssa_phiprop (void)
 372 {
 373   vec<basic_block> bbs;
 374   struct phiprop_d *phivn;
 375   bool did_something = false;
 376   basic_block bb;
 377   gimple_stmt_iterator gsi;
 378   unsigned i;
 379   size_t n;
 380
 381   calculate_dominance_info (CDI_DOMINATORS);
 382
 383   n = num_ssa_names;
 384   phivn = XCNEWVEC (struct phiprop_d, n);
 385
 386   /* Walk the dominator tree in preorder.  */
 387   bbs = get_all_dominated_blocks (CDI_DOMINATORS,
 388                                   single_succ (ENTRY_BLOCK_PTR));
 389   FOR_EACH_VEC_ELT (bbs, i, bb)
 390     for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi))
 391       did_something |= propagate_with_phi (bb, gsi_stmt (gsi), phivn, n);
 392
 393   if (did_something)
 394     gsi_commit_edge_inserts ();
 395
 396   bbs.release ();
 397   free (phivn);
 398
 399   return 0;
 400 }
 401
 402 static bool
 403 gate_phiprop (void)
 404 {
 405   return flag_tree_phiprop;
 406 }
 407
 408 struct gimple_opt_pass pass_phiprop =
 409 {
 410  {
 411   GIMPLE_PASS,
 412   "phiprop",                    /* name */
 413   OPTGROUP_NONE,                        /* optinfo_flags */
 414   gate_phiprop,                 /* gate */
 415   tree_ssa_phiprop,             /* execute */
 416   NULL,                         /* sub */
 417   NULL,                         /* next */
 418   0,                            /* static_pass_number */
 419   TV_TREE_PHIPROP,              /* tv_id */
 420   PROP_cfg | PROP_ssa,          /* properties_required */
 421   0,                            /* properties_provided */
 422   0,                            /* properties_destroyed */
 423   0,                            /* todo_flags_start */
 424   TODO_ggc_collect
 425   | TODO_update_ssa
 426   | TODO_verify_ssa             /* todo_flags_finish */
 427  }
 428 };