diff options
| author | Trevor Saunders <tsaunders@mozilla.com> | 2014-01-12 23:07:57 -0500 |
|---|---|---|
| committer | Trevor Saunders <tsaunders@mozilla.com> | 2014-02-18 22:44:41 -0500 |
| commit | fb0f9802a1dd2a6d85b1c233a58b7de531bb3e96 (patch) | |
| tree | 2c5cbef90b486b6272cb2bc5db569f5f2047dd88 | |
| parent | cee1627be7f46359989d94998f4037b21fb2d688 (diff) | |
| download | gcc-fb0f9802a1dd2a6d85b1c233a58b7de531bb3e96.tar.gz | |
killa BITMAP_ALLOC in tree-ssa-structalias.c
| -rw-r--r-- | gcc/tree-ssa-structalias.c | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/gcc/tree-ssa-structalias.c b/gcc/tree-ssa-structalias.c index 231d492e81a..d6817e4ac1c 100644 --- a/gcc/tree-ssa-structalias.c +++ b/gcc/tree-ssa-structalias.c @@ -1424,26 +1424,26 @@ scc_visit (constraint_graph_t graph, struct scc_info *si, unsigned int n) if (si->scc_stack.length () > 0 && si->dfs[si->scc_stack.last ()] >= my_dfs) { - bitmap scc = BITMAP_ALLOC (NULL); + bitmap_head scc; unsigned int lowest_node; bitmap_iterator bi; - scc->set_bit (n); + scc.set_bit (n); while (si->scc_stack.length () != 0 && si->dfs[si->scc_stack.last ()] >= my_dfs) { unsigned int w = si->scc_stack.pop (); - scc->set_bit (w); + scc.set_bit (w); } - lowest_node = scc->first_set_bit (); + lowest_node = scc.first_set_bit (); gcc_assert (lowest_node < FIRST_REF_NODE); /* Collapse the SCC nodes into a single node, and mark the indirect cycles. */ - EXECUTE_IF_SET_IN_BITMAP (scc, 0, i, bi) + EXECUTE_IF_SET_IN_BITMAP (&scc, 0, i, bi) { if (i < FIRST_REF_NODE) { |