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, 8 insertions, 8 deletions

diff --git a/gcc/gcse.c b/gcc/gcse.c
index 8de596d..a15b8bd 100644
--- a/gcc/gcse.c
+++ b/gcc/gcse.c
@@ -386,7 +386,7 @@ pre_ldst_expr_hasher::equal (const value_type *ptr1,
 }
 
 /* Hashtable for the load/store memory refs.  */
-static hash_table <pre_ldst_expr_hasher> pre_ldst_table;
+static hash_table<pre_ldst_expr_hasher> *pre_ldst_table;
 
 /* Bitmap containing one bit for each register in the program.
    Used when performing GCSE to track which registers have been set since
@@ -3762,7 +3762,7 @@ ldst_entry (rtx x)
 		   NULL,  /*have_reg_qty=*/false);
 
   e.pattern = x;
-  slot = pre_ldst_table.find_slot_with_hash (&e, hash, INSERT);
+  slot = pre_ldst_table->find_slot_with_hash (&e, hash, INSERT);
   if (*slot)
     return *slot;
 
@@ -3800,8 +3800,8 @@ free_ldst_entry (struct ls_expr * ptr)
 static void
 free_ld_motion_mems (void)
 {
-  if (pre_ldst_table.is_created ())
-    pre_ldst_table.dispose ();
+  delete pre_ldst_table;
+  pre_ldst_table = NULL;
 
   while (pre_ldst_mems)
     {
@@ -3857,10 +3857,10 @@ find_rtx_in_ldst (rtx x)
 {
   struct ls_expr e;
   ls_expr **slot;
-  if (!pre_ldst_table.is_created ())
+  if (!pre_ldst_table)
     return NULL;
   e.pattern = x;
-  slot = pre_ldst_table.find_slot (&e, NO_INSERT);
+  slot = pre_ldst_table->find_slot (&e, NO_INSERT);
   if (!slot || (*slot)->invalid)
     return NULL;
   return *slot;
@@ -3951,7 +3951,7 @@ compute_ld_motion_mems (void)
   rtx insn;
 
   pre_ldst_mems = NULL;
-  pre_ldst_table.create (13);
+  pre_ldst_table = new hash_table<pre_ldst_expr_hasher> (13);
 
   FOR_EACH_BB_FN (bb, cfun)
     {
@@ -4053,7 +4053,7 @@ trim_ld_motion_mems (void)
       else
 	{
 	  *last = ptr->next;
-	  pre_ldst_table.remove_elt_with_hash (ptr, ptr->hash_index);
+	  pre_ldst_table->remove_elt_with_hash (ptr, ptr->hash_index);
 	  free_ldst_entry (ptr);
 	  ptr = * last;
 	}