Commit 1e485f89 by Martin Liska Committed by Martin Liska

Fix build of --enable-gather-detailed-mem-stats (PR bootstrap/81864).

2017-08-17  Martin Liska  <mliska@suse.cz>

	PR bootstrap/81864
	* tree-loop-distribution.c (ddrs_table): Change type to pointer
	type.
	(get_data_dependence): Use it as pointer type.
	(distribute_loop): Likewise.

From-SVN: r251165
parent 6ccd2ece
2017-08-17 Martin Liska <mliska@suse.cz>
PR bootstrap/81864
* tree-loop-distribution.c (ddrs_table): Change type to pointer
type.
(get_data_dependence): Use it as pointer type.
(distribute_loop): Likewise.
2017-08-17 Bill Schmidt <wschmidt@linux.vnet.ibm.com> 2017-08-17 Bill Schmidt <wschmidt@linux.vnet.ibm.com>
* config/rs6000/altivec.md (UNSPEC_VMRGOW_DIRECT): New constant. * config/rs6000/altivec.md (UNSPEC_VMRGOW_DIRECT): New constant.
......
...@@ -157,8 +157,7 @@ static vec<data_reference_p> datarefs_vec; ...@@ -157,8 +157,7 @@ static vec<data_reference_p> datarefs_vec;
#define DR_INDEX(dr) ((uintptr_t) (dr)->aux) #define DR_INDEX(dr) ((uintptr_t) (dr)->aux)
/* Hash table for data dependence relation in the loop to be distributed. */ /* Hash table for data dependence relation in the loop to be distributed. */
static hash_table<ddr_hasher> ddrs_table (389); static hash_table<ddr_hasher> *ddrs_table;
/* A Reduced Dependence Graph (RDG) vertex representing a statement. */ /* A Reduced Dependence Graph (RDG) vertex representing a statement. */
struct rdg_vertex struct rdg_vertex
...@@ -1183,7 +1182,7 @@ get_data_dependence (struct graph *rdg, data_reference_p a, data_reference_p b) ...@@ -1183,7 +1182,7 @@ get_data_dependence (struct graph *rdg, data_reference_p a, data_reference_p b)
<= rdg_vertex_for_stmt (rdg, DR_STMT (b))); <= rdg_vertex_for_stmt (rdg, DR_STMT (b)));
ent.a = a; ent.a = a;
ent.b = b; ent.b = b;
slot = ddrs_table.find_slot (&ent, INSERT); slot = ddrs_table->find_slot (&ent, INSERT);
if (*slot == NULL) if (*slot == NULL)
{ {
ddr = initialize_data_dependence_relation (a, b, loop_nest); ddr = initialize_data_dependence_relation (a, b, loop_nest);
...@@ -2366,6 +2365,7 @@ static int ...@@ -2366,6 +2365,7 @@ static int
distribute_loop (struct loop *loop, vec<gimple *> stmts, distribute_loop (struct loop *loop, vec<gimple *> stmts,
control_dependences *cd, int *nb_calls, bool *destroy_p) control_dependences *cd, int *nb_calls, bool *destroy_p)
{ {
ddrs_table = new hash_table<ddr_hasher> (389);
struct graph *rdg; struct graph *rdg;
partition *partition; partition *partition;
bool any_builtin; bool any_builtin;
...@@ -2377,6 +2377,7 @@ distribute_loop (struct loop *loop, vec<gimple *> stmts, ...@@ -2377,6 +2377,7 @@ distribute_loop (struct loop *loop, vec<gimple *> stmts,
if (!find_loop_nest (loop, &loop_nest)) if (!find_loop_nest (loop, &loop_nest))
{ {
loop_nest.release (); loop_nest.release ();
delete ddrs_table;
return 0; return 0;
} }
...@@ -2391,6 +2392,7 @@ distribute_loop (struct loop *loop, vec<gimple *> stmts, ...@@ -2391,6 +2392,7 @@ distribute_loop (struct loop *loop, vec<gimple *> stmts,
loop_nest.release (); loop_nest.release ();
free_data_refs (datarefs_vec); free_data_refs (datarefs_vec);
delete ddrs_table;
return 0; return 0;
} }
...@@ -2404,6 +2406,7 @@ distribute_loop (struct loop *loop, vec<gimple *> stmts, ...@@ -2404,6 +2406,7 @@ distribute_loop (struct loop *loop, vec<gimple *> stmts,
free_rdg (rdg); free_rdg (rdg);
loop_nest.release (); loop_nest.release ();
free_data_refs (datarefs_vec); free_data_refs (datarefs_vec);
delete ddrs_table;
return 0; return 0;
} }
...@@ -2542,13 +2545,13 @@ distribute_loop (struct loop *loop, vec<gimple *> stmts, ...@@ -2542,13 +2545,13 @@ distribute_loop (struct loop *loop, vec<gimple *> stmts,
ldist_done: ldist_done:
loop_nest.release (); loop_nest.release ();
free_data_refs (datarefs_vec); free_data_refs (datarefs_vec);
for (hash_table<ddr_hasher>::iterator iter = ddrs_table.begin (); for (hash_table<ddr_hasher>::iterator iter = ddrs_table->begin ();
iter != ddrs_table.end (); ++iter) iter != ddrs_table->end (); ++iter)
{ {
free_dependence_relation (*iter); free_dependence_relation (*iter);
*iter = NULL; *iter = NULL;
} }
ddrs_table.empty (); delete ddrs_table;
FOR_EACH_VEC_ELT (partitions, i, partition) FOR_EACH_VEC_ELT (partitions, i, partition)
partition_free (partition); partition_free (partition);
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment