diff options
author | Trevor Saunders <tsaunders@mozilla.com> | 2014-08-02 11:23:49 +0000 |
---|---|---|
committer | Trevor Saunders <tbsaunde@gcc.gnu.org> | 2014-08-02 11:23:49 +0000 |
commit | 6e2830c3dbe0d4972519ddd44bd1b15b2b274ba2 (patch) | |
tree | f0fb192e856fa98b7d91e225ff958dfcc1f602df /gcc/cfgloop.c | |
parent | 2df06cec0a2fe611c5487bf54c4ef8e3b2b30543 (diff) | |
download | gcc-6e2830c3dbe0d4972519ddd44bd1b15b2b274ba2.zip gcc-6e2830c3dbe0d4972519ddd44bd1b15b2b274ba2.tar.gz gcc-6e2830c3dbe0d4972519ddd44bd1b15b2b274ba2.tar.bz2 |
add a hash_set based on hash_table
This allows us to replace the usage of pointer_set outside of
pointer_map with a nicer interface.
gcc/ada/
* gcc-interface/trans.c: Use hash_set instead of pointer_set.
gcc/c-family/
* c-gimplify.c: Use hash_set instead of pointer_set.
gcc/c/
* c-decl.c: Use hash_set instead of pointer_set.
gcc/cp/
* class.c, cp-gimplify.c, cp-tree.h, decl.c, decl2.c, error.c,
method.c, name-lookup.c, pt.c, semantics.c, tree.c: Use hash_set
instead of pointer_set.
gcc/fortran/
* openmp.c, trans-decl.c: Use hash_set instead of pointer_set.
gcc/
* hash-set.h: new File.
* cfgexpand.c, cfgloop.c, cgraph.c, cgraphbuild.c, cgraphunit.c,
cprop.c, cse.c, gimple-walk.c, gimple-walk.h, gimplify.c, godump.c,
ipa-devirt.c, ipa-pure-const.c, ipa-visibility.c, ipa.c, lto-cgraph.c,
lto-streamer-out.c, stmt.c, tree-cfg.c, tree-core.h, tree-eh.c,
tree-inline.c, tree-inline.h, tree-nested.c, tree-pretty-print.c,
tree-ssa-loop-niter.c, tree-ssa-phiopt.c, tree-ssa-threadedge.c,
tree-ssa-uninit.c, tree.c, tree.h, value-prof.c, varasm.c,
varpool.c: Use hash_set instead of pointer_set.
gcc/lto/
* lto-partition.c, lto-partition.h: Use hash_set instead of
pointer_set.
From-SVN: r213516
Diffstat (limited to 'gcc/cfgloop.c')
-rw-r--r-- | gcc/cfgloop.c | 18 |
1 files changed, 9 insertions, 9 deletions
diff --git a/gcc/cfgloop.c b/gcc/cfgloop.c index 73f79ef..8f7e265 100644 --- a/gcc/cfgloop.c +++ b/gcc/cfgloop.c @@ -28,7 +28,7 @@ along with GCC; see the file COPYING3. If not see #include "diagnostic-core.h" #include "flags.h" #include "tree.h" -#include "pointer-set.h" +#include "hash-set.h" #include "tree-ssa-alias.h" #include "internal-fn.h" #include "gimple-expr.h" @@ -650,11 +650,11 @@ find_subloop_latch_edge (struct loop *loop) /* Callback for make_forwarder_block. Returns true if the edge E is marked in the set MFB_REIS_SET. */ -static struct pointer_set_t *mfb_reis_set; +static hash_set<edge> *mfb_reis_set; static bool mfb_redirect_edges_in_set (edge e) { - return pointer_set_contains (mfb_reis_set, e); + return mfb_reis_set->contains (e); } /* Creates a subloop of LOOP with latch edge LATCH. */ @@ -666,15 +666,15 @@ form_subloop (struct loop *loop, edge latch) edge e, new_entry; struct loop *new_loop; - mfb_reis_set = pointer_set_create (); + mfb_reis_set = new hash_set<edge>; FOR_EACH_EDGE (e, ei, loop->header->preds) { if (e != latch) - pointer_set_insert (mfb_reis_set, e); + mfb_reis_set->add (e); } new_entry = make_forwarder_block (loop->header, mfb_redirect_edges_in_set, NULL); - pointer_set_destroy (mfb_reis_set); + delete mfb_reis_set; loop->header = new_entry->src; @@ -705,12 +705,12 @@ merge_latch_edges (struct loop *loop) if (dump_file) fprintf (dump_file, "Merged latch edges of loop %d\n", loop->num); - mfb_reis_set = pointer_set_create (); + mfb_reis_set = new hash_set<edge>; FOR_EACH_VEC_ELT (latches, i, e) - pointer_set_insert (mfb_reis_set, e); + mfb_reis_set->add (e); latch = make_forwarder_block (loop->header, mfb_redirect_edges_in_set, NULL); - pointer_set_destroy (mfb_reis_set); + delete mfb_reis_set; loop->header = latch->dest; loop->latch = latch->src; |