diff options
Diffstat (limited to 'gcc/cfganal.c')
| -rw-r--r-- | gcc/cfganal.c | 30 |
1 files changed, 15 insertions, 15 deletions
diff --git a/gcc/cfganal.c b/gcc/cfganal.c index 7cf9ca85606..58c763f8454 100644 --- a/gcc/cfganal.c +++ b/gcc/cfganal.c @@ -84,7 +84,7 @@ mark_dfs_back_edges (void) visited = sbitmap_alloc (last_basic_block); /* None of the nodes in the CFG have been visited yet. */ - sbitmap_zero (visited); + bitmap_clear (visited); /* Push the first edge on to the stack. */ stack[sp++] = ei_start (ENTRY_BLOCK_PTR->succs); @@ -501,7 +501,7 @@ post_order_compute (int *post_order, bool include_entry_exit, visited = sbitmap_alloc (last_basic_block); /* None of the nodes in the CFG have been visited yet. */ - sbitmap_zero (visited); + bitmap_clear (visited); /* Push the first edge on to the stack. */ stack[sp++] = ei_start (ENTRY_BLOCK_PTR->succs); @@ -597,7 +597,7 @@ static basic_block dfs_find_deadend (basic_block bb) { sbitmap visited = sbitmap_alloc (last_basic_block); - sbitmap_zero (visited); + bitmap_clear (visited); for (;;) { @@ -654,7 +654,7 @@ inverted_post_order_compute (int *post_order) visited = sbitmap_alloc (last_basic_block); /* None of the nodes in the CFG have been visited yet. */ - sbitmap_zero (visited); + bitmap_clear (visited); /* Put all blocks that have no successor into the initial work list. */ FOR_ALL_BB (bb) @@ -803,7 +803,7 @@ pre_and_rev_post_order_compute (int *pre_order, int *rev_post_order, visited = sbitmap_alloc (last_basic_block); /* None of the nodes in the CFG have been visited yet. */ - sbitmap_zero (visited); + bitmap_clear (visited); /* Push the first edge on to the stack. */ stack[sp++] = ei_start (ENTRY_BLOCK_PTR->succs); @@ -916,7 +916,7 @@ flow_dfs_compute_reverse_init (depth_first_search_ds data) data->visited_blocks = sbitmap_alloc (last_basic_block); /* None of the nodes in the CFG have been visited yet. */ - sbitmap_zero (data->visited_blocks); + bitmap_clear (data->visited_blocks); return; } @@ -1006,7 +1006,7 @@ dfs_enumerate_from (basic_block bb, int reverse, { visited = sbitmap_alloc (size); - sbitmap_zero (visited); + bitmap_clear (visited); v_size = size; } else if (v_size < size) @@ -1208,12 +1208,12 @@ sbitmap_intersection_of_succs (sbitmap dst, sbitmap *src, if (e->dest == EXIT_BLOCK_PTR) continue; - sbitmap_copy (dst, src[e->dest->index]); + bitmap_copy (dst, src[e->dest->index]); break; } if (e == 0) - sbitmap_ones (dst); + bitmap_ones (dst); else for (++ix; ix < EDGE_COUNT (b->succs); ix++) { @@ -1250,12 +1250,12 @@ sbitmap_intersection_of_preds (sbitmap dst, sbitmap *src, if (e->src == ENTRY_BLOCK_PTR) continue; - sbitmap_copy (dst, src[e->src->index]); + bitmap_copy (dst, src[e->src->index]); break; } if (e == 0) - sbitmap_ones (dst); + bitmap_ones (dst); else for (++ix; ix < EDGE_COUNT (b->preds); ix++) { @@ -1292,12 +1292,12 @@ sbitmap_union_of_succs (sbitmap dst, sbitmap *src, if (e->dest == EXIT_BLOCK_PTR) continue; - sbitmap_copy (dst, src[e->dest->index]); + bitmap_copy (dst, src[e->dest->index]); break; } if (ix == EDGE_COUNT (b->succs)) - sbitmap_zero (dst); + bitmap_clear (dst); else for (ix++; ix < EDGE_COUNT (b->succs); ix++) { @@ -1334,12 +1334,12 @@ sbitmap_union_of_preds (sbitmap dst, sbitmap *src, if (e->src== ENTRY_BLOCK_PTR) continue; - sbitmap_copy (dst, src[e->src->index]); + bitmap_copy (dst, src[e->src->index]); break; } if (ix == EDGE_COUNT (b->preds)) - sbitmap_zero (dst); + bitmap_clear (dst); else for (ix++; ix < EDGE_COUNT (b->preds); ix++) { |