OpenE2K/gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
4ffc8099a7
gcc/gcc/tree-ssa-threadedge.c
Patrick Palka 5c3e5002db Improve forward jump threading of switch statements (PR18046) 
gcc/ChangeLog:

	PR tree-optimization/18046
	* tree-ssa-threadedge.c: Include cfganal.h.
	(simplify_control_statement_condition): If simplifying a
	GIMPLE_SWITCH, replace the index operand of the GIMPLE_SWITCH
	with the dominating ASSERT_EXPR before handing it off to VRP.
	Mention that a CASE_LABEL_EXPR may be returned.
	(thread_around_empty_blocks): Adjust to handle
	simplify_control_statement_condition() returning a
	CASE_LABEL_EXPR.
	(thread_through_normal_block): Likewise.
	* tree-vrp.c (simplify_stmt_for_jump_threading): Simplify
	a switch statement by trying to determine which case label
	will be taken.

gcc/testsuite/ChangeLog:

	PR tree-optimization/18046
	* gcc.dg/tree-ssa/vrp105.c: New test.
	* gcc.dg/tree-ssa/vrp106.c: New test.

From-SVN: r239181
2016-08-05 23:29:53 +00:00

1317 lines
41 KiB
C
Raw Blame History

/* SSA Jump Threading
Copyright (C) 2005-2016 Free Software Foundation, Inc.
Contributed by Jeff Law <law@redhat.com>
This file is part of GCC.
GCC is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3, or (at your option)
any later version.
GCC is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with GCC; see the file COPYING3. If not see
<http://www.gnu.org/licenses/>. */
#include "config.h"
#include "system.h"
#include "coretypes.h"
#include "backend.h"
#include "tree.h"
#include "gimple.h"
#include "predict.h"
#include "ssa.h"
#include "fold-const.h"
#include "cfgloop.h"
#include "gimple-iterator.h"
#include "tree-cfg.h"
#include "tree-ssa-threadupdate.h"
#include "params.h"
#include "tree-ssa-scopedtables.h"
#include "tree-ssa-threadedge.h"
#include "tree-ssa-dom.h"
#include "gimple-fold.h"
#include "cfganal.h"
/* To avoid code explosion due to jump threading, we limit the
number of statements we are going to copy. This variable
holds the number of statements currently seen that we'll have
to copy as part of the jump threading process. */
static int stmt_count;
/* Array to record value-handles per SSA_NAME. */
vec<tree> ssa_name_values;
typedef tree (pfn_simplify) (gimple *, gimple *, class avail_exprs_stack *);
/* Set the value for the SSA name NAME to VALUE. */
void
set_ssa_name_value (tree name, tree value)
{
if (SSA_NAME_VERSION (name) >= ssa_name_values.length ())
ssa_name_values.safe_grow_cleared (SSA_NAME_VERSION (name) + 1);
if (value && TREE_OVERFLOW_P (value))
value = drop_tree_overflow (value);
ssa_name_values[SSA_NAME_VERSION (name)] = value;
}
/* Initialize the per SSA_NAME value-handles array. Returns it. */
void
threadedge_initialize_values (void)
{
gcc_assert (!ssa_name_values.exists ());
ssa_name_values.create (num_ssa_names);
}
/* Free the per SSA_NAME value-handle array. */
void
threadedge_finalize_values (void)
{
ssa_name_values.release ();
}
/* Return TRUE if we may be able to thread an incoming edge into
BB to an outgoing edge from BB. Return FALSE otherwise. */
bool
potentially_threadable_block (basic_block bb)
{
gimple_stmt_iterator gsi;
/* Special case. We can get blocks that are forwarders, but are
not optimized away because they forward from outside a loop
to the loop header. We want to thread through them as we can
sometimes thread to the loop exit, which is obviously profitable.
the interesting case here is when the block has PHIs. */
if (gsi_end_p (gsi_start_nondebug_bb (bb))
&& !gsi_end_p (gsi_start_phis (bb)))
return true;
/* If BB has a single successor or a single predecessor, then
there is no threading opportunity. */
if (single_succ_p (bb) || single_pred_p (bb))
return false;
/* If BB does not end with a conditional, switch or computed goto,
then there is no threading opportunity. */
gsi = gsi_last_bb (bb);
if (gsi_end_p (gsi)
|| ! gsi_stmt (gsi)
|| (gimple_code (gsi_stmt (gsi)) != GIMPLE_COND
&& gimple_code (gsi_stmt (gsi)) != GIMPLE_GOTO
&& gimple_code (gsi_stmt (gsi)) != GIMPLE_SWITCH))
return false;
return true;
}
/* Return the LHS of any ASSERT_EXPR where OP appears as the first
argument to the ASSERT_EXPR and in which the ASSERT_EXPR dominates
BB. If no such ASSERT_EXPR is found, return OP. */
static tree
lhs_of_dominating_assert (tree op, basic_block bb, gimple *stmt)
{
imm_use_iterator imm_iter;
gimple *use_stmt;
use_operand_p use_p;
FOR_EACH_IMM_USE_FAST (use_p, imm_iter, op)
{
use_stmt = USE_STMT (use_p);
if (use_stmt != stmt
&& gimple_assign_single_p (use_stmt)
&& TREE_CODE (gimple_assign_rhs1 (use_stmt)) == ASSERT_EXPR
&& TREE_OPERAND (gimple_assign_rhs1 (use_stmt), 0) == op
&& dominated_by_p (CDI_DOMINATORS, bb, gimple_bb (use_stmt)))
{
return gimple_assign_lhs (use_stmt);
}
}
return op;
}
/* Record temporary equivalences created by PHIs at the target of the
edge E. Record unwind information for the equivalences onto STACK.
If a PHI which prevents threading is encountered, then return FALSE
indicating we should not thread this edge, else return TRUE.
If SRC_MAP/DST_MAP exist, then mark the source and destination SSA_NAMEs
of any equivalences recorded. We use this to make invalidation after
traversing back edges less painful. */
static bool
record_temporary_equivalences_from_phis (edge e, const_and_copies *const_and_copies)
{
gphi_iterator gsi;
/* Each PHI creates a temporary equivalence, record them.
These are context sensitive equivalences and will be removed
later. */
for (gsi = gsi_start_phis (e->dest); !gsi_end_p (gsi); gsi_next (&gsi))
{
gphi *phi = gsi.phi ();
tree src = PHI_ARG_DEF_FROM_EDGE (phi, e);
tree dst = gimple_phi_result (phi);
/* If the desired argument is not the same as this PHI's result
and it is set by a PHI in E->dest, then we can not thread
through E->dest. */
if (src != dst
&& TREE_CODE (src) == SSA_NAME
&& gimple_code (SSA_NAME_DEF_STMT (src)) == GIMPLE_PHI
&& gimple_bb (SSA_NAME_DEF_STMT (src)) == e->dest)
return false;
/* We consider any non-virtual PHI as a statement since it
count result in a constant assignment or copy operation. */
if (!virtual_operand_p (dst))
stmt_count++;
const_and_copies->record_const_or_copy (dst, src);
}
return true;
}
/* Valueize hook for gimple_fold_stmt_to_constant_1. */
static tree
threadedge_valueize (tree t)
{
if (TREE_CODE (t) == SSA_NAME)
{
tree tem = SSA_NAME_VALUE (t);
if (tem)
return tem;
}
return t;
}
/* Try to simplify each statement in E->dest, ultimately leading to
a simplification of the COND_EXPR at the end of E->dest.
Record unwind information for temporary equivalences onto STACK.
Use SIMPLIFY (a pointer to a callback function) to further simplify
statements using pass specific information.
We might consider marking just those statements which ultimately
feed the COND_EXPR. It's not clear if the overhead of bookkeeping
would be recovered by trying to simplify fewer statements.
If we are able to simplify a statement into the form
SSA_NAME = (SSA_NAME | gimple invariant), then we can record
a context sensitive equivalence which may help us simplify
later statements in E->dest. */
static gimple *
record_temporary_equivalences_from_stmts_at_dest (edge e,
const_and_copies *const_and_copies,
avail_exprs_stack *avail_exprs_stack,
pfn_simplify simplify)
{
gimple *stmt = NULL;
gimple_stmt_iterator gsi;
int max_stmt_count;
max_stmt_count = PARAM_VALUE (PARAM_MAX_JUMP_THREAD_DUPLICATION_STMTS);
/* Walk through each statement in the block recording equivalences
we discover. Note any equivalences we discover are context
sensitive (ie, are dependent on traversing E) and must be unwound
when we're finished processing E. */
for (gsi = gsi_start_bb (e->dest); !gsi_end_p (gsi); gsi_next (&gsi))
{
tree cached_lhs = NULL;
stmt = gsi_stmt (gsi);
/* Ignore empty statements and labels. */
if (gimple_code (stmt) == GIMPLE_NOP
|| gimple_code (stmt) == GIMPLE_LABEL
|| is_gimple_debug (stmt))
continue;
/* If the statement has volatile operands, then we assume we
can not thread through this block. This is overly
conservative in some ways. */
if (gimple_code (stmt) == GIMPLE_ASM
&& gimple_asm_volatile_p (as_a <gasm *> (stmt)))
return NULL;
/* If the statement is a unique builtin, we can not thread
through here. */
if (gimple_code (stmt) == GIMPLE_CALL
&& gimple_call_internal_p (stmt)
&& gimple_call_internal_unique_p (stmt))
return NULL;
/* If duplicating this block is going to cause too much code
expansion, then do not thread through this block. */
stmt_count++;
if (stmt_count > max_stmt_count)
return NULL;
/* If this is not a statement that sets an SSA_NAME to a new
value, then do not try to simplify this statement as it will
not simplify in any way that is helpful for jump threading. */
if ((gimple_code (stmt) != GIMPLE_ASSIGN
|| TREE_CODE (gimple_assign_lhs (stmt)) != SSA_NAME)
&& (gimple_code (stmt) != GIMPLE_CALL
|| gimple_call_lhs (stmt) == NULL_TREE
|| TREE_CODE (gimple_call_lhs (stmt)) != SSA_NAME))
continue;
/* The result of __builtin_object_size depends on all the arguments
of a phi node. Temporarily using only one edge produces invalid
results. For example
if (x < 6)
goto l;
else
goto l;
l:
r = PHI <&w[2].a[1](2), &a.a[6](3)>
__builtin_object_size (r, 0)
The result of __builtin_object_size is defined to be the maximum of
remaining bytes. If we use only one edge on the phi, the result will
change to be the remaining bytes for the corresponding phi argument.
Similarly for __builtin_constant_p:
r = PHI <1(2), 2(3)>
__builtin_constant_p (r)
Both PHI arguments are constant, but x ? 1 : 2 is still not
constant. */
if (is_gimple_call (stmt))
{
tree fndecl = gimple_call_fndecl (stmt);
if (fndecl
&& (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_OBJECT_SIZE
|| DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CONSTANT_P))
continue;
}
/* At this point we have a statement which assigns an RHS to an
SSA_VAR on the LHS. We want to try and simplify this statement
to expose more context sensitive equivalences which in turn may
allow us to simplify the condition at the end of the loop.
Handle simple copy operations as well as implied copies from
ASSERT_EXPRs. */
if (gimple_assign_single_p (stmt)
&& TREE_CODE (gimple_assign_rhs1 (stmt)) == SSA_NAME)
cached_lhs = gimple_assign_rhs1 (stmt);
else if (gimple_assign_single_p (stmt)
&& TREE_CODE (gimple_assign_rhs1 (stmt)) == ASSERT_EXPR)
cached_lhs = TREE_OPERAND (gimple_assign_rhs1 (stmt), 0);
else
{
/* A statement that is not a trivial copy or ASSERT_EXPR.
Try to fold the new expression. Inserting the
expression into the hash table is unlikely to help. */
/* ??? The DOM callback below can be changed to setting
the mprts_hook around the call to thread_across_edge,
avoiding the use substitution. The VRP hook should be
changed to properly valueize operands itself using
SSA_NAME_VALUE in addition to its own lattice. */
cached_lhs = gimple_fold_stmt_to_constant_1 (stmt,
threadedge_valueize);
if (!cached_lhs
|| (TREE_CODE (cached_lhs) != SSA_NAME
&& !is_gimple_min_invariant (cached_lhs)))
{
/* We're going to temporarily copy propagate the operands
and see if that allows us to simplify this statement. */
tree *copy;
ssa_op_iter iter;
use_operand_p use_p;
unsigned int num, i = 0;
num = NUM_SSA_OPERANDS (stmt, SSA_OP_ALL_USES);
copy = XALLOCAVEC (tree, num);
/* Make a copy of the uses & vuses into USES_COPY, then cprop into
the operands. */
FOR_EACH_SSA_USE_OPERAND (use_p, stmt, iter, SSA_OP_ALL_USES)
{
tree tmp = NULL;
tree use = USE_FROM_PTR (use_p);
copy[i++] = use;
if (TREE_CODE (use) == SSA_NAME)
tmp = SSA_NAME_VALUE (use);
if (tmp)
SET_USE (use_p, tmp);
}
cached_lhs = (*simplify) (stmt, stmt, avail_exprs_stack);
/* Restore the statement's original uses/defs. */
i = 0;
FOR_EACH_SSA_USE_OPERAND (use_p, stmt, iter, SSA_OP_ALL_USES)
SET_USE (use_p, copy[i++]);
}
}
/* Record the context sensitive equivalence if we were able
to simplify this statement. */
if (cached_lhs
&& (TREE_CODE (cached_lhs) == SSA_NAME
|| is_gimple_min_invariant (cached_lhs)))
const_and_copies->record_const_or_copy (gimple_get_lhs (stmt),
cached_lhs);
}
return stmt;
}
static tree simplify_control_stmt_condition_1 (edge, gimple *,
class avail_exprs_stack *,
tree, enum tree_code, tree,
gcond *, pfn_simplify, bool,
unsigned);
/* Simplify the control statement at the end of the block E->dest.
To avoid allocating memory unnecessarily, a scratch GIMPLE_COND
is available to use/clobber in DUMMY_COND.
Use SIMPLIFY (a pointer to a callback function) to further simplify
a condition using pass specific information.
Return the simplified condition or NULL if simplification could
not be performed. When simplifying a GIMPLE_SWITCH, we may return
the CASE_LABEL_EXPR that will be taken.
The available expression table is referenced via AVAIL_EXPRS_STACK. */
static tree
simplify_control_stmt_condition (edge e,
gimple *stmt,
class avail_exprs_stack *avail_exprs_stack,
gcond *dummy_cond,
pfn_simplify simplify,
bool handle_dominating_asserts)
{
tree cond, cached_lhs;
enum gimple_code code = gimple_code (stmt);
/* For comparisons, we have to update both operands, then try
to simplify the comparison. */
if (code == GIMPLE_COND)
{
tree op0, op1;
enum tree_code cond_code;
op0 = gimple_cond_lhs (stmt);
op1 = gimple_cond_rhs (stmt);
cond_code = gimple_cond_code (stmt);
/* Get the current value of both operands. */
if (TREE_CODE (op0) == SSA_NAME)
{
for (int i = 0; i < 2; i++)
{
if (TREE_CODE (op0) == SSA_NAME
&& SSA_NAME_VALUE (op0))
op0 = SSA_NAME_VALUE (op0);
else
break;
}
}
if (TREE_CODE (op1) == SSA_NAME)
{
for (int i = 0; i < 2; i++)
{
if (TREE_CODE (op1) == SSA_NAME
&& SSA_NAME_VALUE (op1))
op1 = SSA_NAME_VALUE (op1);
else
break;
}
}
const unsigned recursion_limit = 4;
cached_lhs
= simplify_control_stmt_condition_1 (e, stmt, avail_exprs_stack,
op0, cond_code, op1,
dummy_cond, simplify,
handle_dominating_asserts,
recursion_limit);
/* If we were testing an integer/pointer against a constant, then
we can use the FSM code to trace the value of the SSA_NAME. If
a value is found, then the condition will collapse to a constant.
Return the SSA_NAME we want to trace back rather than the full
expression and give the FSM threader a chance to find its value. */
if (cached_lhs == NULL)
{
/* Recover the original operands. They may have been simplified
using context sensitive equivalences. Those context sensitive
equivalences may not be valid on paths found by the FSM optimizer. */
tree op0 = gimple_cond_lhs (stmt);
tree op1 = gimple_cond_rhs (stmt);
if ((INTEGRAL_TYPE_P (TREE_TYPE (op0))
|| POINTER_TYPE_P (TREE_TYPE (op0)))
&& TREE_CODE (op0) == SSA_NAME
&& TREE_CODE (op1) == INTEGER_CST)
return op0;
}
return cached_lhs;
}
if (code == GIMPLE_SWITCH)
cond = gimple_switch_index (as_a <gswitch *> (stmt));
else if (code == GIMPLE_GOTO)
cond = gimple_goto_dest (stmt);
else
gcc_unreachable ();
/* We can have conditionals which just test the state of a variable
rather than use a relational operator. These are simpler to handle. */
if (TREE_CODE (cond) == SSA_NAME)
{
tree original_lhs = cond;
cached_lhs = cond;
/* Get the variable's current value from the equivalence chains.
It is possible to get loops in the SSA_NAME_VALUE chains
(consider threading the backedge of a loop where we have
a loop invariant SSA_NAME used in the condition). */
if (cached_lhs)
{
for (int i = 0; i < 2; i++)
{
if (TREE_CODE (cached_lhs) == SSA_NAME
&& SSA_NAME_VALUE (cached_lhs))
cached_lhs = SSA_NAME_VALUE (cached_lhs);
else
break;
}
}
/* If we're dominated by a suitable ASSERT_EXPR, then
update CACHED_LHS appropriately. */
if (handle_dominating_asserts && TREE_CODE (cached_lhs) == SSA_NAME)
cached_lhs = lhs_of_dominating_assert (cached_lhs, e->src, stmt);
/* If we haven't simplified to an invariant yet, then use the
pass specific callback to try and simplify it further. */
if (cached_lhs && ! is_gimple_min_invariant (cached_lhs))
{
if (handle_dominating_asserts && code == GIMPLE_SWITCH)
{
/* Replace the index operand of the GIMPLE_SWITCH with the
dominating ASSERT_EXPR before handing it off to VRP. If
simplification is possible, the simplified value will be a
CASE_LABEL_EXPR of the label that is proven to be taken. */
gswitch *dummy_switch = as_a<gswitch *> (gimple_copy (stmt));
gimple_switch_set_index (dummy_switch, cached_lhs);
cached_lhs = (*simplify) (dummy_switch, stmt, avail_exprs_stack);
ggc_free (dummy_switch);
}
else
cached_lhs = (*simplify) (stmt, stmt, avail_exprs_stack);
}
/* We couldn't find an invariant. But, callers of this
function may be able to do something useful with the
unmodified destination. */
if (!cached_lhs)
cached_lhs = original_lhs;
}
else
cached_lhs = NULL;
return cached_lhs;
}
/* Recursive helper for simplify_control_stmt_condition. */
static tree
simplify_control_stmt_condition_1 (edge e,
gimple *stmt,
class avail_exprs_stack *avail_exprs_stack,
tree op0,
enum tree_code cond_code,
tree op1,
gcond *dummy_cond,
pfn_simplify simplify,
bool handle_dominating_asserts,
unsigned limit)
{
if (limit == 0)
return NULL_TREE;
/* We may need to canonicalize the comparison. For
example, op0 might be a constant while op1 is an
SSA_NAME. Failure to canonicalize will cause us to
miss threading opportunities. */
if (tree_swap_operands_p (op0, op1, false))
{
cond_code = swap_tree_comparison (cond_code);
std::swap (op0, op1);
}
/* If the condition has the form (A & B) CMP 0 or (A | B) CMP 0 then
recurse into the LHS to see if there is a dominating ASSERT_EXPR
of A or of B that makes this condition always true or always false
along the edge E. */
if (handle_dominating_asserts
&& (cond_code == EQ_EXPR || cond_code == NE_EXPR)
&& TREE_CODE (op0) == SSA_NAME
&& integer_zerop (op1))
{
gimple *def_stmt = SSA_NAME_DEF_STMT (op0);
if (gimple_code (def_stmt) != GIMPLE_ASSIGN)
;
else if (gimple_assign_rhs_code (def_stmt) == BIT_AND_EXPR
|| gimple_assign_rhs_code (def_stmt) == BIT_IOR_EXPR)
{
enum tree_code rhs_code = gimple_assign_rhs_code (def_stmt);
const tree rhs1 = gimple_assign_rhs1 (def_stmt);
const tree rhs2 = gimple_assign_rhs2 (def_stmt);
/* Is A != 0 ? */
const tree res1
= simplify_control_stmt_condition_1 (e, def_stmt, avail_exprs_stack,
rhs1, NE_EXPR, op1,
dummy_cond, simplify,
handle_dominating_asserts,
limit - 1);
if (res1 == NULL_TREE)
;
else if (rhs_code == BIT_AND_EXPR && integer_zerop (res1))
{
/* If A == 0 then (A & B) != 0 is always false. */
if (cond_code == NE_EXPR)
return boolean_false_node;
/* If A == 0 then (A & B) == 0 is always true. */
if (cond_code == EQ_EXPR)
return boolean_true_node;
}
else if (rhs_code == BIT_IOR_EXPR && integer_nonzerop (res1))
{
/* If A != 0 then (A | B) != 0 is always true. */
if (cond_code == NE_EXPR)
return boolean_true_node;
/* If A != 0 then (A | B) == 0 is always false. */
if (cond_code == EQ_EXPR)
return boolean_false_node;
}
/* Is B != 0 ? */
const tree res2
= simplify_control_stmt_condition_1 (e, def_stmt, avail_exprs_stack,
rhs2, NE_EXPR, op1,
dummy_cond, simplify,
handle_dominating_asserts,
limit - 1);
if (res2 == NULL_TREE)
;
else if (rhs_code == BIT_AND_EXPR && integer_zerop (res2))
{
/* If B == 0 then (A & B) != 0 is always false. */
if (cond_code == NE_EXPR)
return boolean_false_node;
/* If B == 0 then (A & B) == 0 is always true. */
if (cond_code == EQ_EXPR)
return boolean_true_node;
}
else if (rhs_code == BIT_IOR_EXPR && integer_nonzerop (res2))
{
/* If B != 0 then (A | B) != 0 is always true. */
if (cond_code == NE_EXPR)
return boolean_true_node;
/* If B != 0 then (A | B) == 0 is always false. */
if (cond_code == EQ_EXPR)
return boolean_false_node;
}
if (res1 != NULL_TREE && res2 != NULL_TREE)
{
if (rhs_code == BIT_AND_EXPR
&& TYPE_PRECISION (TREE_TYPE (op0)) == 1
&& integer_nonzerop (res1)
&& integer_nonzerop (res2))
{
/* If A != 0 and B != 0 then (bool)(A & B) != 0 is true. */
if (cond_code == NE_EXPR)
return boolean_true_node;
/* If A != 0 and B != 0 then (bool)(A & B) == 0 is false. */
if (cond_code == EQ_EXPR)
return boolean_false_node;
}
if (rhs_code == BIT_IOR_EXPR
&& integer_zerop (res1)
&& integer_zerop (res2))
{
/* If A == 0 and B == 0 then (A | B) != 0 is false. */
if (cond_code == NE_EXPR)
return boolean_false_node;
/* If A == 0 and B == 0 then (A | B) == 0 is true. */
if (cond_code == EQ_EXPR)
return boolean_true_node;
}
}
}
/* Handle (A CMP B) CMP 0. */
else if (TREE_CODE_CLASS (gimple_assign_rhs_code (def_stmt))
== tcc_comparison)
{
tree rhs1 = gimple_assign_rhs1 (def_stmt);
tree rhs2 = gimple_assign_rhs2 (def_stmt);
tree_code new_cond = gimple_assign_rhs_code (def_stmt);
if (cond_code == EQ_EXPR)
new_cond = invert_tree_comparison (new_cond, false);
tree res
= simplify_control_stmt_condition_1 (e, def_stmt, avail_exprs_stack,
rhs1, new_cond, rhs2,
dummy_cond, simplify,
handle_dominating_asserts,
limit - 1);
if (res != NULL_TREE && is_gimple_min_invariant (res))
return res;
}
}
if (handle_dominating_asserts)
{
/* Now see if the operand was consumed by an ASSERT_EXPR
which dominates E->src. If so, we want to replace the
operand with the LHS of the ASSERT_EXPR. */
if (TREE_CODE (op0) == SSA_NAME)
op0 = lhs_of_dominating_assert (op0, e->src, stmt);
if (TREE_CODE (op1) == SSA_NAME)
op1 = lhs_of_dominating_assert (op1, e->src, stmt);
}
gimple_cond_set_code (dummy_cond, cond_code);
gimple_cond_set_lhs (dummy_cond, op0);
gimple_cond_set_rhs (dummy_cond, op1);
/* We absolutely do not care about any type conversions
we only care about a zero/nonzero value. */
fold_defer_overflow_warnings ();
tree res = fold_binary (cond_code, boolean_type_node, op0, op1);
if (res)
while (CONVERT_EXPR_P (res))
res = TREE_OPERAND (res, 0);
fold_undefer_overflow_warnings ((res && is_gimple_min_invariant (res)),
stmt, WARN_STRICT_OVERFLOW_CONDITIONAL);
/* If we have not simplified the condition down to an invariant,
then use the pass specific callback to simplify the condition. */
if (!res
|| !is_gimple_min_invariant (res))
res = (*simplify) (dummy_cond, stmt, avail_exprs_stack);
return res;
}
/* Copy debug stmts from DEST's chain of single predecessors up to
SRC, so that we don't lose the bindings as PHI nodes are introduced
when DEST gains new predecessors. */
void
propagate_threaded_block_debug_into (basic_block dest, basic_block src)
{
if (!MAY_HAVE_DEBUG_STMTS)
return;
if (!single_pred_p (dest))
return;
gcc_checking_assert (dest != src);
gimple_stmt_iterator gsi = gsi_after_labels (dest);
int i = 0;
const int alloc_count = 16; // ?? Should this be a PARAM?
/* Estimate the number of debug vars overridden in the beginning of
DEST, to tell how many we're going to need to begin with. */
for (gimple_stmt_iterator si = gsi;
i * 4 <= alloc_count * 3 && !gsi_end_p (si); gsi_next (&si))
{
gimple *stmt = gsi_stmt (si);
if (!is_gimple_debug (stmt))
break;
i++;
}
auto_vec<tree, alloc_count> fewvars;
hash_set<tree> *vars = NULL;
/* If we're already starting with 3/4 of alloc_count, go for a
hash_set, otherwise start with an unordered stack-allocated
VEC. */
if (i * 4 > alloc_count * 3)
vars = new hash_set<tree>;
/* Now go through the initial debug stmts in DEST again, this time
actually inserting in VARS or FEWVARS. Don't bother checking for
duplicates in FEWVARS. */
for (gimple_stmt_iterator si = gsi; !gsi_end_p (si); gsi_next (&si))
{
gimple *stmt = gsi_stmt (si);
if (!is_gimple_debug (stmt))
break;
tree var;
if (gimple_debug_bind_p (stmt))
var = gimple_debug_bind_get_var (stmt);
else if (gimple_debug_source_bind_p (stmt))
var = gimple_debug_source_bind_get_var (stmt);
else
gcc_unreachable ();
if (vars)
vars->add (var);
else
fewvars.quick_push (var);
}
basic_block bb = dest;
do
{
bb = single_pred (bb);
for (gimple_stmt_iterator si = gsi_last_bb (bb);
!gsi_end_p (si); gsi_prev (&si))
{
gimple *stmt = gsi_stmt (si);
if (!is_gimple_debug (stmt))
continue;
tree var;
if (gimple_debug_bind_p (stmt))
var = gimple_debug_bind_get_var (stmt);
else if (gimple_debug_source_bind_p (stmt))
var = gimple_debug_source_bind_get_var (stmt);
else
gcc_unreachable ();
/* Discard debug bind overlaps. ??? Unlike stmts from src,
copied into a new block that will precede BB, debug bind
stmts in bypassed BBs may actually be discarded if
they're overwritten by subsequent debug bind stmts, which
might be a problem once we introduce stmt frontier notes
or somesuch. Adding `&& bb == src' to the condition
below will preserve all potentially relevant debug
notes. */
if (vars && vars->add (var))
continue;
else if (!vars)
{
int i = fewvars.length ();
while (i--)
if (fewvars[i] == var)
break;
if (i >= 0)
continue;
if (fewvars.length () < (unsigned) alloc_count)
fewvars.quick_push (var);
else
{
vars = new hash_set<tree>;
for (i = 0; i < alloc_count; i++)
vars->add (fewvars[i]);
fewvars.release ();
vars->add (var);
}
}
stmt = gimple_copy (stmt);
/* ??? Should we drop the location of the copy to denote
they're artificial bindings? */
gsi_insert_before (&gsi, stmt, GSI_NEW_STMT);
}
}
while (bb != src && single_pred_p (bb));
if (vars)
delete vars;
else if (fewvars.exists ())
fewvars.release ();
}
/* See if TAKEN_EDGE->dest is a threadable block with no side effecs (ie, it
need not be duplicated as part of the CFG/SSA updating process).
If it is threadable, add it to PATH and VISITED and recurse, ultimately
returning TRUE from the toplevel call. Otherwise do nothing and
return false.
DUMMY_COND, HANDLE_DOMINATING_ASSERTS and SIMPLIFY are used to
try and simplify the condition at the end of TAKEN_EDGE->dest.
The available expression table is referenced via AVAIL_EXPRS_STACK. */
static bool
thread_around_empty_blocks (edge taken_edge,
gcond *dummy_cond,
class avail_exprs_stack *avail_exprs_stack,
bool handle_dominating_asserts,
pfn_simplify simplify,
bitmap visited,
vec<jump_thread_edge *> *path)
{
basic_block bb = taken_edge->dest;
gimple_stmt_iterator gsi;
gimple *stmt;
tree cond;
/* The key property of these blocks is that they need not be duplicated
when threading. Thus they can not have visible side effects such
as PHI nodes. */
if (!gsi_end_p (gsi_start_phis (bb)))
return false;
/* Skip over DEBUG statements at the start of the block. */
gsi = gsi_start_nondebug_bb (bb);
/* If the block has no statements, but does have a single successor, then
it's just a forwarding block and we can thread through it trivially.
However, note that just threading through empty blocks with single
successors is not inherently profitable. For the jump thread to
be profitable, we must avoid a runtime conditional.
By taking the return value from the recursive call, we get the
desired effect of returning TRUE when we found a profitable jump
threading opportunity and FALSE otherwise.
This is particularly important when this routine is called after
processing a joiner block. Returning TRUE too aggressively in
that case results in pointless duplication of the joiner block. */
if (gsi_end_p (gsi))
{
if (single_succ_p (bb))
{
taken_edge = single_succ_edge (bb);
if ((taken_edge->flags & EDGE_DFS_BACK) != 0)
return false;
if (!bitmap_bit_p (visited, taken_edge->dest->index))
{
jump_thread_edge *x
= new jump_thread_edge (taken_edge, EDGE_NO_COPY_SRC_BLOCK);
path->safe_push (x);
bitmap_set_bit (visited, taken_edge->dest->index);
return thread_around_empty_blocks (taken_edge,
dummy_cond,
avail_exprs_stack,
handle_dominating_asserts,
simplify,
visited,
path);
}
}
/* We have a block with no statements, but multiple successors? */
return false;
}
/* The only real statements this block can have are a control
flow altering statement. Anything else stops the thread. */
stmt = gsi_stmt (gsi);
if (gimple_code (stmt) != GIMPLE_COND
&& gimple_code (stmt) != GIMPLE_GOTO
&& gimple_code (stmt) != GIMPLE_SWITCH)
return false;
/* Extract and simplify the condition. */
cond = simplify_control_stmt_condition (taken_edge, stmt,
avail_exprs_stack, dummy_cond,
simplify, handle_dominating_asserts);
/* If the condition can be statically computed and we have not already
visited the destination edge, then add the taken edge to our thread
path. */
if (cond != NULL_TREE
&& (is_gimple_min_invariant (cond)
|| TREE_CODE (cond) == CASE_LABEL_EXPR))
{
if (TREE_CODE (cond) == CASE_LABEL_EXPR)
taken_edge = find_edge (bb, label_to_block (CASE_LABEL (cond)));
else
taken_edge = find_taken_edge (bb, cond);
if ((taken_edge->flags & EDGE_DFS_BACK) != 0)
return false;
if (bitmap_bit_p (visited, taken_edge->dest->index))
return false;
bitmap_set_bit (visited, taken_edge->dest->index);
jump_thread_edge *x
= new jump_thread_edge (taken_edge, EDGE_NO_COPY_SRC_BLOCK);
path->safe_push (x);
thread_around_empty_blocks (taken_edge,
dummy_cond,
avail_exprs_stack,
handle_dominating_asserts,
simplify,
visited,
path);
return true;
}
return false;
}
/* We are exiting E->src, see if E->dest ends with a conditional
jump which has a known value when reached via E.
E->dest can have arbitrary side effects which, if threading is
successful, will be maintained.
Special care is necessary if E is a back edge in the CFG as we
may have already recorded equivalences for E->dest into our
various tables, including the result of the conditional at
the end of E->dest. Threading opportunities are severely
limited in that case to avoid short-circuiting the loop
incorrectly.
DUMMY_COND is a shared cond_expr used by condition simplification as scratch,
to avoid allocating memory.
HANDLE_DOMINATING_ASSERTS is true if we should try to replace operands of
the simplified condition with left-hand sides of ASSERT_EXPRs they are
used in.
STACK is used to undo temporary equivalences created during the walk of
E->dest.
SIMPLIFY is a pass-specific function used to simplify statements.
Our caller is responsible for restoring the state of the expression
and const_and_copies stacks.
Positive return value is success. Zero return value is failure, but
the block can still be duplicated as a joiner in a jump thread path,
negative indicates the block should not be duplicated and thus is not
suitable for a joiner in a jump threading path. */
static int
thread_through_normal_block (edge e,
gcond *dummy_cond,
bool handle_dominating_asserts,
const_and_copies *const_and_copies,
avail_exprs_stack *avail_exprs_stack,
pfn_simplify simplify,
vec<jump_thread_edge *> *path,
bitmap visited)
{
/* We want to record any equivalences created by traversing E. */
if (!handle_dominating_asserts)
record_temporary_equivalences (e, const_and_copies, avail_exprs_stack);
/* PHIs create temporary equivalences.
Note that if we found a PHI that made the block non-threadable, then
we need to bubble that up to our caller in the same manner we do
when we prematurely stop processing statements below. */
if (!record_temporary_equivalences_from_phis (e, const_and_copies))
return -1;
/* Now walk each statement recording any context sensitive
temporary equivalences we can detect. */
gimple *stmt
= record_temporary_equivalences_from_stmts_at_dest (e, const_and_copies,
avail_exprs_stack,
simplify);
/* There's two reasons STMT might be null, and distinguishing
between them is important.
First the block may not have had any statements. For example, it
might have some PHIs and unconditionally transfer control elsewhere.
Such blocks are suitable for jump threading, particularly as a
joiner block.
The second reason would be if we did not process all the statements
in the block (because there were too many to make duplicating the
block profitable. If we did not look at all the statements, then
we may not have invalidated everything needing invalidation. Thus
we must signal to our caller that this block is not suitable for
use as a joiner in a threading path. */
if (!stmt)
{
/* First case. The statement simply doesn't have any instructions, but
does have PHIs. */
if (gsi_end_p (gsi_start_nondebug_bb (e->dest))
&& !gsi_end_p (gsi_start_phis (e->dest)))
return 0;
/* Second case. */
return -1;
}
/* If we stopped at a COND_EXPR or SWITCH_EXPR, see if we know which arm
will be taken. */
if (gimple_code (stmt) == GIMPLE_COND
|| gimple_code (stmt) == GIMPLE_GOTO
|| gimple_code (stmt) == GIMPLE_SWITCH)
{
tree cond;
/* Extract and simplify the condition. */
cond = simplify_control_stmt_condition (e, stmt, avail_exprs_stack,
dummy_cond, simplify,
handle_dominating_asserts);
if (!cond)
return 0;
if (is_gimple_min_invariant (cond)
|| TREE_CODE (cond) == CASE_LABEL_EXPR)
{
edge taken_edge;
if (TREE_CODE (cond) == CASE_LABEL_EXPR)
taken_edge = find_edge (e->dest,
label_to_block (CASE_LABEL (cond)));
else
taken_edge = find_taken_edge (e->dest, cond);
basic_block dest = (taken_edge ? taken_edge->dest : NULL);
/* DEST could be NULL for a computed jump to an absolute
address. */
if (dest == NULL
|| dest == e->dest
|| (taken_edge->flags & EDGE_DFS_BACK) != 0
|| bitmap_bit_p (visited, dest->index))
return 0;
/* Only push the EDGE_START_JUMP_THREAD marker if this is
first edge on the path. */
if (path->length () == 0)
{
jump_thread_edge *x
= new jump_thread_edge (e, EDGE_START_JUMP_THREAD);
path->safe_push (x);
}
jump_thread_edge *x
= new jump_thread_edge (taken_edge, EDGE_COPY_SRC_BLOCK);
path->safe_push (x);
/* See if we can thread through DEST as well, this helps capture
secondary effects of threading without having to re-run DOM or
VRP.
We don't want to thread back to a block we have already
visited. This may be overly conservative. */
bitmap_set_bit (visited, dest->index);
bitmap_set_bit (visited, e->dest->index);
thread_around_empty_blocks (taken_edge,
dummy_cond,
avail_exprs_stack,
handle_dominating_asserts,
simplify,
visited,
path);
return 1;
}
}
return 0;
}
/* We are exiting E->src, see if E->dest ends with a conditional
jump which has a known value when reached via E.
DUMMY_COND is a shared cond_expr used by condition simplification as scratch,
to avoid allocating memory.
HANDLE_DOMINATING_ASSERTS is true if we should try to replace operands of
the simplified condition with left-hand sides of ASSERT_EXPRs they are
used in.
CONST_AND_COPIES is used to undo temporary equivalences created during the
walk of E->dest.
The available expression table is referenced vai AVAIL_EXPRS_STACK.
SIMPLIFY is a pass-specific function used to simplify statements. */
void
thread_across_edge (gcond *dummy_cond,
edge e,
bool handle_dominating_asserts,
class const_and_copies *const_and_copies,
class avail_exprs_stack *avail_exprs_stack,
tree (*simplify) (gimple *, gimple *,
class avail_exprs_stack *))
{
bitmap visited = BITMAP_ALLOC (NULL);
stmt_count = 0;
vec<jump_thread_edge *> *path = new vec<jump_thread_edge *> ();
bitmap_clear (visited);
bitmap_set_bit (visited, e->src->index);
bitmap_set_bit (visited, e->dest->index);
int threaded;
if ((e->flags & EDGE_DFS_BACK) == 0)
threaded = thread_through_normal_block (e, dummy_cond,
handle_dominating_asserts,
const_and_copies,
avail_exprs_stack,
simplify, path,
visited);
else
threaded = 0;
if (threaded > 0)
{
propagate_threaded_block_debug_into (path->last ()->e->dest,
e->dest);
const_and_copies->pop_to_marker ();
BITMAP_FREE (visited);
register_jump_thread (path);
return;
}
else
{
/* Negative and zero return values indicate no threading was possible,
thus there should be no edges on the thread path and no need to walk
through the vector entries. */
gcc_assert (path->length () == 0);
path->release ();
delete path;
/* A negative status indicates the target block was deemed too big to
duplicate. Just quit now rather than trying to use the block as
a joiner in a jump threading path.
This prevents unnecessary code growth, but more importantly if we
do not look at all the statements in the block, then we may have
missed some invalidations if we had traversed a backedge! */
if (threaded < 0)
{
BITMAP_FREE (visited);
const_and_copies->pop_to_marker ();
return;
}
}
/* We were unable to determine what out edge from E->dest is taken. However,
we might still be able to thread through successors of E->dest. This
often occurs when E->dest is a joiner block which then fans back out
based on redundant tests.
If so, we'll copy E->dest and redirect the appropriate predecessor to
the copy. Within the copy of E->dest, we'll thread one or more edges
to points deeper in the CFG.
This is a stopgap until we have a more structured approach to path
isolation. */
{
edge taken_edge;
edge_iterator ei;
bool found;
/* If E->dest has abnormal outgoing edges, then there's no guarantee
we can safely redirect any of the edges. Just punt those cases. */
FOR_EACH_EDGE (taken_edge, ei, e->dest->succs)
if (taken_edge->flags & EDGE_ABNORMAL)
{
const_and_copies->pop_to_marker ();
BITMAP_FREE (visited);
return;
}
/* Look at each successor of E->dest to see if we can thread through it. */
FOR_EACH_EDGE (taken_edge, ei, e->dest->succs)
{
if ((e->flags & EDGE_DFS_BACK) != 0
|| (taken_edge->flags & EDGE_DFS_BACK) != 0)
continue;
/* Push a fresh marker so we can unwind the equivalences created
for each of E->dest's successors. */
const_and_copies->push_marker ();
if (avail_exprs_stack)
avail_exprs_stack->push_marker ();
/* Avoid threading to any block we have already visited. */
bitmap_clear (visited);
bitmap_set_bit (visited, e->src->index);
bitmap_set_bit (visited, e->dest->index);
bitmap_set_bit (visited, taken_edge->dest->index);
vec<jump_thread_edge *> *path = new vec<jump_thread_edge *> ();
/* Record whether or not we were able to thread through a successor
of E->dest. */
jump_thread_edge *x = new jump_thread_edge (e, EDGE_START_JUMP_THREAD);
path->safe_push (x);
x = new jump_thread_edge (taken_edge, EDGE_COPY_SRC_JOINER_BLOCK);
path->safe_push (x);
found = false;
found = thread_around_empty_blocks (taken_edge,
dummy_cond,
avail_exprs_stack,
handle_dominating_asserts,
simplify,
visited,
path);
if (!found)
found = thread_through_normal_block (path->last ()->e, dummy_cond,
handle_dominating_asserts,
const_and_copies,
avail_exprs_stack,
simplify, path,
visited) > 0;
/* If we were able to thread through a successor of E->dest, then
record the jump threading opportunity. */
if (found)
{
propagate_threaded_block_debug_into (path->last ()->e->dest,
taken_edge->dest);
register_jump_thread (path);
}
else
delete_jump_thread_path (path);
/* And unwind the equivalence table. */
if (avail_exprs_stack)
avail_exprs_stack->pop_to_marker ();
const_and_copies->pop_to_marker ();
}
BITMAP_FREE (visited);
}
const_and_copies->pop_to_marker ();
}
Reference in New Issue View Git Blame Copy Permalink