/* Code sinking for trees
- Copyright (C) 2001, 2002, 2003, 2004, 2007, 2008, 2009
+ Copyright (C) 2001, 2002, 2003, 2004, 2007, 2008, 2009, 2010
Free Software Foundation, Inc.
Contributed by Daniel Berlin <dan@dberlin.org>
#include "system.h"
#include "coretypes.h"
#include "tm.h"
-#include "ggc.h"
#include "tree.h"
#include "basic-block.h"
-#include "diagnostic.h"
+#include "gimple-pretty-print.h"
#include "tree-inline.h"
#include "tree-flow.h"
#include "gimple.h"
#include "fibheap.h"
#include "hashtab.h"
#include "tree-iterator.h"
-#include "real.h"
#include "alloc-pool.h"
#include "tree-pass.h"
#include "flags.h"
return true;
}
- else if (INDIRECT_REF_P (lhs))
+ else if (INDIRECT_REF_P (lhs)
+ || TREE_CODE (lhs) == MEM_REF
+ || TREE_CODE (lhs) == TARGET_MEM_REF)
return ptr_deref_may_alias_global_p (TREE_OPERAND (lhs, 0));
+ else if (CONSTANT_CLASS_P (lhs))
+ return true;
else
gcc_unreachable ();
}
gimple_stmt_iterator *togsi)
{
gimple use;
- tree def;
use_operand_p one_use = NULL_USE_OPERAND_P;
basic_block sinkbb;
use_operand_p use_p;
def_operand_p def_p;
ssa_op_iter iter;
imm_use_iterator imm_iter;
- enum tree_code code;
- FOR_EACH_SSA_TREE_OPERAND (def, stmt, iter, SSA_OP_ALL_DEFS)
- {
- FOR_EACH_IMM_USE_FAST (one_use, imm_iter, def)
- {
- if (is_gimple_debug (USE_STMT (one_use)))
- continue;
-
- break;
- }
- if (one_use != NULL_USE_OPERAND_P)
- break;
- }
+ /* We only can sink assignments. */
+ if (!is_gimple_assign (stmt))
+ return false;
- /* Return if there are no immediate uses of this stmt. */
- if (one_use == NULL_USE_OPERAND_P)
+ /* We only can sink stmts with a single definition. */
+ def_p = single_ssa_def_operand (stmt, SSA_OP_ALL_DEFS);
+ if (def_p == NULL_DEF_OPERAND_P)
return false;
- if (gimple_code (stmt) != GIMPLE_ASSIGN)
+ /* Return if there are no immediate uses of this stmt. */
+ if (has_zero_uses (DEF_FROM_PTR (def_p)))
return false;
/* There are a few classes of things we can't or don't move, some because we
to use specific hard registers.
*/
- code = gimple_assign_rhs_code (stmt);
if (stmt_ends_bb_p (stmt)
|| gimple_has_side_effects (stmt)
- || is_hidden_global_store (stmt)
|| gimple_has_volatile_ops (stmt)
- || gimple_vuse (stmt)
+ || (gimple_vuse (stmt) && !gimple_vdef (stmt))
|| (cfun->has_local_explicit_reg_vars
&& TYPE_MODE (TREE_TYPE (gimple_assign_lhs (stmt))) == BLKmode))
return false;
- FOR_EACH_SSA_DEF_OPERAND (def_p, stmt, iter, SSA_OP_ALL_DEFS)
- {
- tree def = DEF_FROM_PTR (def_p);
- if (is_global_var (SSA_NAME_VAR (def))
- || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def))
- return false;
- }
+ if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (DEF_FROM_PTR (def_p)))
+ return false;
FOR_EACH_SSA_USE_OPERAND (use_p, stmt, iter, SSA_OP_ALL_USES)
{
return false;
}
+ use = NULL;
+
+ /* If stmt is a store the one and only use needs to be the VOP
+ merging PHI node. */
+ if (gimple_vdef (stmt))
+ {
+ FOR_EACH_IMM_USE_FAST (use_p, imm_iter, DEF_FROM_PTR (def_p))
+ {
+ gimple use_stmt = USE_STMT (use_p);
+
+ /* A killing definition is not a use. */
+ if (gimple_assign_single_p (use_stmt)
+ && gimple_vdef (use_stmt)
+ && operand_equal_p (gimple_assign_lhs (stmt),
+ gimple_assign_lhs (use_stmt), 0))
+ continue;
+
+ if (gimple_code (use_stmt) != GIMPLE_PHI)
+ return false;
+
+ if (use
+ && use != use_stmt)
+ return false;
+
+ use = use_stmt;
+ }
+ if (!use)
+ return false;
+ }
/* If all the immediate uses are not in the same place, find the nearest
common dominator of all the immediate uses. For PHI nodes, we have to
find the nearest common dominator of all of the predecessor blocks, since
that is where insertion would have to take place. */
- if (!all_immediate_uses_same_place (stmt))
+ else if (!all_immediate_uses_same_place (stmt))
{
bool debug_stmts = false;
basic_block commondom = nearest_common_dominator_of_uses (stmt,
return true;
}
-
- use = USE_STMT (one_use);
- if (gimple_code (use) != GIMPLE_PHI)
+ else
{
- sinkbb = gimple_bb (use);
- if (sinkbb == frombb || sinkbb->loop_depth > frombb->loop_depth
- || sinkbb->loop_father != frombb->loop_father)
- return false;
+ FOR_EACH_IMM_USE_FAST (one_use, imm_iter, DEF_FROM_PTR (def_p))
+ {
+ if (is_gimple_debug (USE_STMT (one_use)))
+ continue;
+ break;
+ }
+ use = USE_STMT (one_use);
- /* Move the expression to a post dominator can't reduce the number of
- executions. */
- if (dominated_by_p (CDI_POST_DOMINATORS, frombb, sinkbb))
- return false;
+ if (gimple_code (use) != GIMPLE_PHI)
+ {
+ sinkbb = gimple_bb (use);
+ if (sinkbb == frombb || sinkbb->loop_depth > frombb->loop_depth
+ || sinkbb->loop_father != frombb->loop_father)
+ return false;
- *togsi = gsi_for_stmt (use);
+ /* Move the expression to a post dominator can't reduce the number of
+ executions. */
+ if (dominated_by_p (CDI_POST_DOMINATORS, frombb, sinkbb))
+ return false;
- return true;
- }
+ *togsi = gsi_for_stmt (use);
- /* Note that at this point, all uses must be in the same statement, so it
- doesn't matter which def op we choose, pick the first one. */
- FOR_EACH_SSA_TREE_OPERAND (def, stmt, iter, SSA_OP_ALL_DEFS)
- break;
+ return true;
+ }
+ }
- sinkbb = find_bb_for_arg (use, def);
+ sinkbb = find_bb_for_arg (use, DEF_FROM_PTR (def_p));
if (!sinkbb)
return false;
|| sinkbb->loop_father != frombb->loop_father)
return false;
+ /* If the latch block is empty, don't make it non-empty by sinking
+ something into it. */
+ if (sinkbb == frombb->loop_father->latch
+ && empty_block_p (sinkbb))
+ return false;
+
/* Move the expression to a post dominator can't reduce the number of
executions. */
if (dominated_by_p (CDI_POST_DOMINATORS, frombb, sinkbb))
bb->index, (gsi_bb (togsi))->index);
}
+ /* Prepare for VOP update. */
+ if (gimple_vdef (stmt))
+ {
+ unlink_stmt_vdef (stmt);
+ gimple_set_vdef (stmt, gimple_vop (cfun));
+ mark_sym_for_renaming (gimple_vop (cfun));
+ }
+
/* If this is the end of the basic block, we need to insert at the end
of the basic block. */
if (gsi_end_p (togsi))
0, /* properties_destroyed */
0, /* todo_flags_start */
TODO_update_ssa
+ | TODO_verify_ssa
+ | TODO_verify_flow
| TODO_dump_func
- | TODO_ggc_collect
- | TODO_verify_ssa /* todo_flags_finish */
+ | TODO_ggc_collect /* todo_flags_finish */
}
};
OSDN Git Service
