+2018-05-29 Richard Biener <rguenther@suse.de>
+
+ * tree-vectorizer.h (struct vec_info): Add stmt_vec_infos
+ member.
+ (stmt_vec_info_vec): Make pointer.
+ (init_stmt_vec_info_vec): Remove.
+ (free_stmt_vec_info_vec): Likewise.
+ (set_stmt_vec_info_vec): New function.
+ (free_stmt_vec_infos): Likewise.
+ (vinfo_for_stmt): Adjust for stmt_vec_info_vec indirection.
+ (set_vinfo_for_stmt): Likewise.
+ (get_earlier_stmt): Likewise.
+ (get_later_stmt): Likewise.
+ * tree-vectorizer.c (stmt_vec_info_vec): Make pointer.
+ (vec_info::vec_info): Allocate stmt_vec_infos and set the global.
+ (vec_info::~vec_info): Free stmt_vec_infos.
+ (vectorize_loops): Set the global stmt_vec_info_vec to NULL.
+ Remove old init_stmt_vec_info_vec/free_stmt_vec_info_vec calls.
+ (pass_slp_vectorize::execute): Likewise.
+ * tree-vect-stmts.c (init_stmt_vec_info_vec): Remove.
+ (free_stmt_vec_info_vec): Likewise.
+ (set_stmt_vec_info_vec): New function.
+ (free_stmt_vec_infos): Likewise.
+ * tree-vect-loop.c (_loop_vec_info::~_loop_vec_info): Set
+ the global stmt_vec_info_vec.
+ * tree-parloops.c (gather_scalar_reductions): Use
+ set_stmt_vec_info_vec/free_stmt_vec_infos and maintain a local
+ vector.
+
2018-05-29 Richard Biener <rguenther@suse.de>
* dominance.c (iterate_fix_dominators): Push/pop TV_DOMINANCE.
auto_vec<gphi *, 4> double_reduc_phis;
auto_vec<gimple *, 4> double_reduc_stmts;
- if (!stmt_vec_info_vec.exists ())
- init_stmt_vec_info_vec ();
+ vec<stmt_vec_info> stmt_vec_infos;
+ stmt_vec_infos.create (50);
+ set_stmt_vec_info_vec (&stmt_vec_infos);
simple_loop_info = vect_analyze_loop_form (loop);
if (simple_loop_info == NULL)
gather_done:
/* Release the claim on gimple_uid. */
- free_stmt_vec_info_vec ();
+ free_stmt_vec_infos (&stmt_vec_infos);
if (reduction_list->elements () == 0)
return;
gimple_stmt_iterator si;
int j;
+ /* ??? We're releasing loop_vinfos en-block. */
+ set_stmt_vec_info_vec (&stmt_vec_infos);
nbbs = loop->num_nodes;
for (j = 0; j < nbbs; j++)
{
}
-/* Create a hash table for stmt_vec_info. */
+/* Set the current stmt_vec_info vector to V. */
void
-init_stmt_vec_info_vec (void)
+set_stmt_vec_info_vec (vec<stmt_vec_info> *v)
{
- gcc_assert (!stmt_vec_info_vec.exists ());
- stmt_vec_info_vec.create (50);
+ stmt_vec_info_vec = v;
}
-
-/* Free hash table for stmt_vec_info. */
+/* Free the stmt_vec_info entries in V and release V. */
void
-free_stmt_vec_info_vec (void)
+free_stmt_vec_infos (vec<stmt_vec_info> *v)
{
unsigned int i;
stmt_vec_info info;
- FOR_EACH_VEC_ELT (stmt_vec_info_vec, i, info)
+ FOR_EACH_VEC_ELT (*v, i, info)
if (info != NULL)
free_stmt_vec_info (STMT_VINFO_STMT (info));
- gcc_assert (stmt_vec_info_vec.exists ());
- stmt_vec_info_vec.release ();
+ if (v == stmt_vec_info_vec)
+ stmt_vec_info_vec = NULL;
+ v->release ();
}
source_location vect_location;
/* Vector mapping GIMPLE stmt to stmt_vec_info. */
-vec<stmt_vec_info> stmt_vec_info_vec;
+vec<stmt_vec_info> *stmt_vec_info_vec;
/* Dump a cost entry according to args to F. */
ddrs (vNULL),
target_cost_data (target_cost_data_in)
{
+ stmt_vec_infos.create (50);
+ set_stmt_vec_info_vec (&stmt_vec_infos);
}
vec_info::~vec_info ()
free_data_refs (datarefs);
free_dependence_relations (ddrs);
destroy_cost_data (target_cost_data);
+ free_stmt_vec_infos (&stmt_vec_infos);
}
/* A helper function to free scev and LOOP niter information, as well as
if (cfun->has_simduid_loops)
note_simd_array_uses (&simd_array_to_simduid_htab);
- init_stmt_vec_info_vec ();
+ set_stmt_vec_info_vec (NULL);
/* ----------- Analyze loops. ----------- */
loop->aux = NULL;
}
- free_stmt_vec_info_vec ();
-
/* Fold IFN_GOMP_SIMD_{VF,LANE,LAST_LANE,ORDERED_{START,END}} builtins. */
if (cfun->has_simduid_loops)
adjust_simduid_builtins (simduid_to_vf_htab);
}
}
- init_stmt_vec_info_vec ();
-
FOR_EACH_BB_FN (bb, fun)
{
if (vect_slp_bb (bb))
"basic block vectorized\n");
}
- free_stmt_vec_info_vec ();
-
if (!in_loop_pipeline)
{
scev_finalize ();
/* The type of vectorization. */
vec_kind kind;
+ /* The mapping of GIMPLE UID to stmt_vec_info. */
+ vec<struct _stmt_vec_info *> stmt_vec_infos;
+
/* All SLP instances. */
auto_vec<slp_instance> slp_instances;
&& TYPE_PRECISION (TYPE) == 1 \
&& TYPE_UNSIGNED (TYPE)))
-extern vec<stmt_vec_info> stmt_vec_info_vec;
+extern vec<stmt_vec_info> *stmt_vec_info_vec;
-void init_stmt_vec_info_vec (void);
-void free_stmt_vec_info_vec (void);
+void set_stmt_vec_info_vec (vec<stmt_vec_info> *);
+void free_stmt_vec_infos (vec<stmt_vec_info> *);
/* Return a stmt_vec_info corresponding to STMT. */
if (uid <= 0)
return NULL;
- return stmt_vec_info_vec[uid - 1];
+ return (*stmt_vec_info_vec)[uid - 1];
}
/* Set vectorizer information INFO for STMT. */
if (uid == 0)
{
gcc_checking_assert (info);
- uid = stmt_vec_info_vec.length () + 1;
+ uid = stmt_vec_info_vec->length () + 1;
gimple_set_uid (stmt, uid);
- stmt_vec_info_vec.safe_push (info);
+ stmt_vec_info_vec->safe_push (info);
}
else
{
gcc_checking_assert (info == NULL);
- stmt_vec_info_vec[uid - 1] = info;
+ (*stmt_vec_info_vec)[uid - 1] = info;
}
}
if (uid1 == 0 || uid2 == 0)
return NULL;
- gcc_checking_assert (uid1 <= stmt_vec_info_vec.length ()
- && uid2 <= stmt_vec_info_vec.length ());
+ gcc_checking_assert (uid1 <= stmt_vec_info_vec->length ()
+ && uid2 <= stmt_vec_info_vec->length ());
if (uid1 < uid2)
return stmt1;
if (uid1 == 0 || uid2 == 0)
return NULL;
- gcc_assert (uid1 <= stmt_vec_info_vec.length ());
- gcc_assert (uid2 <= stmt_vec_info_vec.length ());
+ gcc_assert (uid1 <= stmt_vec_info_vec->length ());
+ gcc_assert (uid2 <= stmt_vec_info_vec->length ());
if (uid1 > uid2)
return stmt1;