diff options
author | tbsaunde <tbsaunde@138bc75d-0d04-0410-961f-82ee72b054a4> | 2014-08-02 11:23:49 +0000 |
---|---|---|
committer | tbsaunde <tbsaunde@138bc75d-0d04-0410-961f-82ee72b054a4> | 2014-08-02 11:23:49 +0000 |
commit | 431205b753bfa26d1711e40ce478d9e92fd157da (patch) | |
tree | f0fb192e856fa98b7d91e225ff958dfcc1f602df /gcc/cprop.c | |
parent | 69d7692e60d4a7c61b4d3581f3285a866ec3abb1 (diff) | |
download | gcc-431205b753bfa26d1711e40ce478d9e92fd157da.tar.gz |
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.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@213516 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/cprop.c')
-rw-r--r-- | gcc/cprop.c | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/gcc/cprop.c b/gcc/cprop.c index 6291c911e8e..4234afabe5e 100644 --- a/gcc/cprop.c +++ b/gcc/cprop.c @@ -167,7 +167,7 @@ reg_available_p (const_rtx x, const_rtx insn ATTRIBUTE_UNUSED) ??? May need to make things more elaborate. Later, as necessary. */ static unsigned int -hash_set (int regno, int hash_table_size) +hash_mod (int regno, int hash_table_size) { return (unsigned) regno % hash_table_size; } @@ -187,7 +187,7 @@ insert_set_in_table (rtx dest, rtx src, rtx insn, struct hash_table_d *table, struct expr *cur_expr, *last_expr = NULL; struct occr *cur_occr; - hash = hash_set (REGNO (dest), table->size); + hash = hash_mod (REGNO (dest), table->size); for (cur_expr = table->table[hash]; cur_expr; cur_expr = cur_expr->next_same_hash) @@ -483,7 +483,7 @@ compute_hash_table (struct hash_table_d *table) static struct expr * lookup_set (unsigned int regno, struct hash_table_d *table) { - unsigned int hash = hash_set (regno, table->size); + unsigned int hash = hash_mod (regno, table->size); struct expr *expr; expr = table->table[hash]; |