This patch normalizes more bitmap function names.

  sbitmap.h

    TEST_BIT -> bitmap_bit_p
    SET_BIT -> bitmap_set_bit
    SET_BIT_WITH_POPCOUNT -> bitmap_set_bit_with_popcount
    RESET_BIT -> bitmap_clear_bit
    RESET_BIT_WITH_POPCOUNT -> bitmap_clear_bit_with_popcount

  basic-block.h

    sbitmap_intersection_of_succs -> bitmap_intersection_of_succs
    sbitmap_intersection_of_preds -> bitmap_intersection_of_preds
    sbitmap_union_of_succs -> bitmap_union_of_succs
    sbitmap_union_of_preds -> bitmap_union_of_preds

The sbitmap.h functions also needed their numeric paramter changed
from unsigned int to int to match the bitmap functions.

Callers updated to match.

Tested on x86-64, config-list.mk testing.


Index: gcc/ChangeLog

2012-11-01  Lawrence Crowl  <crowl@google.com>

	* sbitmap.h (TEST_BIT): Rename bitmap_bit_p, normalizing parameter
	type. Update callers to match.
	(SET_BIT): Rename bitmap_set_bit, normalizing parameter type. Update
	callers to match.
	(SET_BIT_WITH_POPCOUNT): Rename bitmap_set_bit_with_popcount,
	normalizing parameter type. Update callers to match.
	(RESET_BIT): Rename bitmap_clear_bit, normalizing parameter type.
	Update callers to match.
	(RESET_BIT_WITH_POPCOUNT): Rename bitmap_clear_bit_with_popcount,
	normalizing parameter type. Update callers to match.
	* basic-block.h (sbitmap_intersection_of_succs): Rename
	bitmap_intersection_of_succs. Update callers to match.
	* basic-block.h (sbitmap_intersection_of_preds): Rename
	bitmap_intersection_of_preds. Update callers to match.
	* basic-block.h (sbitmap_union_of_succs): Rename
	bitmap_union_of_succs. Update callers to match.
	* basic-block.h (sbitmap_union_of_preds): Rename
	bitmap_union_of_preds. Update callers to match.

From-SVN: r193066

1 files changed, 7 insertions, 7 deletions

diff --git a/gcc/tree-ssa-propagate.c b/gcc/tree-ssa-propagate.c
index 380cda3..ca6fc33 100644
--- a/gcc/tree-ssa-propagate.c
+++ b/gcc/tree-ssa-propagate.c
@@ -177,7 +177,7 @@ cfg_blocks_add (basic_block bb)
   bool head = false;
 
   gcc_assert (bb != ENTRY_BLOCK_PTR && bb != EXIT_BLOCK_PTR);
-  gcc_assert (!TEST_BIT (bb_in_list, bb->index));
+  gcc_assert (!bitmap_bit_p (bb_in_list, bb->index));
 
   if (cfg_blocks_empty_p ())
     {
@@ -218,7 +218,7 @@ cfg_blocks_add (basic_block bb)
   VEC_replace (basic_block, cfg_blocks,
 	       head ? cfg_blocks_head : cfg_blocks_tail,
 	       bb);
-  SET_BIT (bb_in_list, bb->index);
+  bitmap_set_bit (bb_in_list, bb->index);
 }
 
 
@@ -237,7 +237,7 @@ cfg_blocks_get (void)
   cfg_blocks_head = ((cfg_blocks_head + 1)
 		     % VEC_length (basic_block, cfg_blocks));
   --cfg_blocks_num;
-  RESET_BIT (bb_in_list, bb->index);
+  bitmap_clear_bit (bb_in_list, bb->index);
 
   return bb;
 }
@@ -286,7 +286,7 @@ add_control_edge (edge e)
   e->flags |= EDGE_EXECUTABLE;
 
   /* If the block is already in the list, we're done.  */
-  if (TEST_BIT (bb_in_list, bb->index))
+  if (bitmap_bit_p (bb_in_list, bb->index))
     return;
 
   cfg_blocks_add (bb);
@@ -390,7 +390,7 @@ process_ssa_edge_worklist (VEC(gimple,gc) **worklist)
 	 the destination block is executable.  Otherwise, visit the
 	 statement only if its block is marked executable.  */
       if (gimple_code (stmt) == GIMPLE_PHI
-	  || TEST_BIT (executable_blocks, bb->index))
+	  || bitmap_bit_p (executable_blocks, bb->index))
 	simulate_stmt (stmt);
     }
 }
@@ -418,7 +418,7 @@ simulate_block (basic_block block)
 
   /* If this is the first time we've simulated this block, then we
      must simulate each of its statements.  */
-  if (!TEST_BIT (executable_blocks, block->index))
+  if (!bitmap_bit_p (executable_blocks, block->index))
     {
       gimple_stmt_iterator j;
       unsigned int normal_edge_count;
@@ -426,7 +426,7 @@ simulate_block (basic_block block)
       edge_iterator ei;
 
       /* Note that we have simulated this block.  */
-      SET_BIT (executable_blocks, block->index);
+      bitmap_set_bit (executable_blocks, block->index);
 
       for (j = gsi_start_bb (block); !gsi_end_p (j); gsi_next (&j))
 	{