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/cgraphbuild.c | |
| parent | 2df06cec0a2fe611c5487bf54c4ef8e3b2b30543 (diff) | |
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/cgraphbuild.c')
| -rw-r--r-- | gcc/cgraphbuild.c | 7 |
1 files changed, 2 insertions, 5 deletions
diff --git a/gcc/cgraphbuild.c b/gcc/cgraphbuild.c index 91811d7c2fb..a04958f4d8c 100644 --- a/gcc/cgraphbuild.c +++ b/gcc/cgraphbuild.c @@ -322,7 +322,6 @@ pass_build_cgraph_edges::execute (function *fun) { basic_block bb; struct cgraph_node *node = cgraph_node::get (current_function_decl); - struct pointer_set_t *visited_nodes = pointer_set_create (); gimple_stmt_iterator gsi; tree decl; unsigned ix; @@ -386,7 +385,6 @@ pass_build_cgraph_edges::execute (function *fun) varpool_node::finalize_decl (decl); record_eh_tables (node, fun); - pointer_set_destroy (visited_nodes); return 0; } @@ -405,15 +403,14 @@ make_pass_build_cgraph_edges (gcc::context *ctxt) void record_references_in_initializer (tree decl, bool only_vars) { - struct pointer_set_t *visited_nodes = pointer_set_create (); varpool_node *node = varpool_node::get_create (decl); + hash_set<tree> visited_nodes; struct record_reference_ctx ctx = {false, NULL}; ctx.varpool_node = node; ctx.only_vars = only_vars; walk_tree (&DECL_INITIAL (decl), record_reference, - &ctx, visited_nodes); - pointer_set_destroy (visited_nodes); + &ctx, &visited_nodes); } /* Rebuild cgraph edges for current function node. This needs to be run after |