Remove a layer of indirection from hash_table

gcc/

	* hash-table.h: Remove a layer of indirection from hash_table so that
	it contains the hash table's data instead of a pointer to the data.
	* alloc-pool.c, asan.c, attribs.c, bitmap.c, cfg.c,
	config/arm/arm.c, config/i386/winnt.c, config/ia64/ia64.c,
	config/mips/mips.c, config/sol2.c, coverage.c, cselib.c,
	data-streamer-out.c, dse.c, dwarf2cfi.c, dwarf2out.c, except.c,
	fold-const.c, gcse.c, ggc-common.c,
	gimple-ssa-strength-reduction.c, gimplify.c,
	graphite-clast-to-gimple.c, graphite-dependences.c,
	graphite-htab.h, graphite.c, haifa-sched.c, ipa-devirt.c,
	ipa-profile.c, ira-color.c, ira-costs.c, loop-invariant.c,
	loop-iv.c, loop-unroll.c, lto-streamer-in.c, lto-streamer-out.c,
	lto-streamer.c, lto-streamer.h, passes.c, plugin.c,
	postreload-gcse.c, sese.c, statistics.c, store-motion.c,
	trans-mem.c, tree-browser.c, tree-cfg.c, tree-complex.c,
	tree-eh.c, tree-into-ssa.c, tree-parloops.c, tree-sra.c,
	tree-ssa-ccp.c, tree-ssa-coalesce.c, tree-ssa-dom.c,
	tree-ssa-live.c, tree-ssa-loop-im.c,
	tree-ssa-loop-ivopts.c, tree-ssa-phiopt.c, tree-ssa-pre.c,
	tree-ssa-reassoc.c, tree-ssa-sccvn.c, tree-ssa-strlen.c,
	tree-ssa-structalias.c, tree-ssa-tail-merge.c,
	tree-ssa-threadupdate.c, tree-ssa-uncprop.c,
tree-vect-data-refs.c, tree-vect-loop.c, tree-vectorizer.c,
tree-vectorizer.h, valtrack.c, valtrack.h, var-tracking.c,
vtable-verify.c, vtable-verify.h: Adjust.

gcc/c/

	* c-decl.c: Adjust.

gcc/cp/

	* class.c, semantics.c, tree.c, vtable-class-hierarchy.c:
	Adjust.

gcc/java/

	* jcf-io.c: Adjust.

gcc/lto/

	* lto.c: Adjust.

gcc/objc/

	* objc-act.c: Adjust.

From-SVN: r211936

1 files changed, 7 insertions, 6 deletions

diff --git a/gcc/tree-ssa-uncprop.c b/gcc/tree-ssa-uncprop.c
index 7342c9d..81d3085 100644
--- a/gcc/tree-ssa-uncprop.c
+++ b/gcc/tree-ssa-uncprop.c
@@ -321,7 +321,7 @@ val_ssa_equiv_hasher::remove (value_type *elt)
 /* Global hash table implementing a mapping from invariant values
    to a list of SSA_NAMEs which have the same value.  We might be
    able to reuse tree-vn for this code.  */
-static hash_table <val_ssa_equiv_hasher> val_ssa_equiv;
+static hash_table<val_ssa_equiv_hasher> *val_ssa_equiv;
 
 static void uncprop_into_successor_phis (basic_block);
 
@@ -336,7 +336,7 @@ remove_equivalence (tree value)
   an_equiv_elt.value = value;
   an_equiv_elt.equivalences.create (0);
 
-  slot = val_ssa_equiv.find_slot (&an_equiv_elt, NO_INSERT);
+  slot = val_ssa_equiv->find_slot (&an_equiv_elt, NO_INSERT);
 
   an_equiv_elt_p = *slot;
   an_equiv_elt_p->equivalences.pop ();
@@ -354,7 +354,7 @@ record_equiv (tree value, tree equivalence)
   an_equiv_elt_p->value = value;
   an_equiv_elt_p->equivalences.create (0);
 
-  slot = val_ssa_equiv.find_slot (an_equiv_elt_p, INSERT);
+  slot = val_ssa_equiv->find_slot (an_equiv_elt_p, INSERT);
 
   if (*slot == NULL)
     *slot = an_equiv_elt_p;
@@ -446,7 +446,7 @@ uncprop_into_successor_phis (basic_block bb)
 	  /* Lookup this argument's value in the hash table.  */
 	  an_equiv_elt.value = arg;
 	  an_equiv_elt.equivalences.create (0);
-	  slot = val_ssa_equiv.find_slot (&an_equiv_elt, NO_INSERT);
+	  slot = val_ssa_equiv->find_slot (&an_equiv_elt, NO_INSERT);
 
 	  if (slot)
 	    {
@@ -578,7 +578,7 @@ pass_uncprop::execute (function *fun)
   associate_equivalences_with_edges ();
 
   /* Create our global data structures.  */
-  val_ssa_equiv.create (1024);
+  val_ssa_equiv = new hash_table<val_ssa_equiv_hasher> (1024);
 
   /* We're going to do a dominator walk, so ensure that we have
      dominance information.  */
@@ -590,7 +590,8 @@ pass_uncprop::execute (function *fun)
 
   /* we just need to empty elements out of the hash table, and cleanup the
     AUX field on the edges.  */
-  val_ssa_equiv.dispose ();
+  delete val_ssa_equiv;
+  val_ssa_equiv = NULL;
   FOR_EACH_BB_FN (bb, fun)
     {
       edge e;