Commit 232b2c6e by Richard Biener Committed by Richard Biener

tree-ssa-pre.c (bitmap_insert_into_set_1): Remove and inline into ...

2017-08-02  Richard Biener  <rguenther@suse.de>

	* tree-ssa-pre.c (bitmap_insert_into_set_1): Remove and inline
	into ...
	(bitmap_insert_into_set): ... this.

From-SVN: r250812
parent 77eefb71
2017-08-02 Richard Biener <rguenther@suse.de> 2017-08-02 Richard Biener <rguenther@suse.de>
* tree-ssa-pre.c (bitmap_insert_into_set_1): Remove and inline
into ...
(bitmap_insert_into_set): ... this.
2017-08-02 Richard Biener <rguenther@suse.de>
PR tree-optimization/81633 PR tree-optimization/81633
Revert Revert
2015-08-17 Alan Hayward <alan.hayward@arm.com> 2015-08-17 Alan Hayward <alan.hayward@arm.com>
......
...@@ -540,8 +540,6 @@ static void bitmap_set_copy (bitmap_set_t, bitmap_set_t); ...@@ -540,8 +540,6 @@ static void bitmap_set_copy (bitmap_set_t, bitmap_set_t);
static void bitmap_set_and (bitmap_set_t, bitmap_set_t); static void bitmap_set_and (bitmap_set_t, bitmap_set_t);
static bool bitmap_set_contains_value (bitmap_set_t, unsigned int); static bool bitmap_set_contains_value (bitmap_set_t, unsigned int);
static void bitmap_insert_into_set (bitmap_set_t, pre_expr); static void bitmap_insert_into_set (bitmap_set_t, pre_expr);
static void bitmap_insert_into_set_1 (bitmap_set_t, pre_expr,
unsigned int, bool);
static bitmap_set_t bitmap_set_new (void); static bitmap_set_t bitmap_set_new (void);
static tree create_expression_by_pieces (basic_block, pre_expr, gimple_seq *, static tree create_expression_by_pieces (basic_block, pre_expr, gimple_seq *,
tree); tree);
...@@ -732,27 +730,22 @@ bitmap_remove_from_set (bitmap_set_t set, pre_expr expr) ...@@ -732,27 +730,22 @@ bitmap_remove_from_set (bitmap_set_t set, pre_expr expr)
} }
} }
/* Insert an expression EXPR into a bitmapped set. */
static void static void
bitmap_insert_into_set_1 (bitmap_set_t set, pre_expr expr, bitmap_insert_into_set (bitmap_set_t set, pre_expr expr)
unsigned int val, bool allow_constants)
{ {
if (allow_constants || !value_id_constant_p (val)) unsigned int val = get_expr_value_id (expr);
if (! value_id_constant_p (val))
{ {
/* We specifically expect this and only this function to be able to /* Note this is the only function causing multiple expressions
insert constants into a set. */ for the same value to appear in a set. This is needed for
TMP_GEN, PHI_GEN and NEW_SETs. */
bitmap_set_bit (&set->values, val); bitmap_set_bit (&set->values, val);
bitmap_set_bit (&set->expressions, get_or_alloc_expression_id (expr)); bitmap_set_bit (&set->expressions, get_or_alloc_expression_id (expr));
} }
} }
/* Insert an expression EXPR into a bitmapped set. */
static void
bitmap_insert_into_set (bitmap_set_t set, pre_expr expr)
{
bitmap_insert_into_set_1 (set, expr, get_expr_value_id (expr), false);
}
/* Copy a bitmapped set ORIG, into bitmapped set DEST. */ /* Copy a bitmapped set ORIG, into bitmapped set DEST. */
static void static void
...@@ -2471,7 +2464,8 @@ compute_antic (void) ...@@ -2471,7 +2464,8 @@ compute_antic (void)
{ {
/* For partial antic we ignore backedges and thus we do not need /* For partial antic we ignore backedges and thus we do not need
to perform any iteration when we process blocks in postorder. */ to perform any iteration when we process blocks in postorder. */
int postorder_num = pre_and_rev_post_order_compute (NULL, postorder.address (), false); int postorder_num
= pre_and_rev_post_order_compute (NULL, postorder.address (), false);
for (i = postorder_num - 1 ; i >= 0; i--) for (i = postorder_num - 1 ; i >= 0; i--)
{ {
basic_block block = BASIC_BLOCK_FOR_FN (cfun, postorder[i]); basic_block block = BASIC_BLOCK_FOR_FN (cfun, postorder[i]);
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment