Commit 31de92e3 by Richard Biener Committed by Richard Biener

tree-parloops.c (report_ploop_op): Copy from report_vect_op.

2019-09-18  Richard Biener  <rguenther@suse.de>

	* tree-parloops.c (report_ploop_op): Copy from report_vect_op.
	(parloops_valid_reduction_input_p): Copy from
	valid_reduction_input_p.
	(parloops_is_slp_reduction): Copy from vect_is_slp_reduction.
	(parloops_needs_fold_left_reduction_p): Copy from
	needs_fold_left_reduction_p.
	(parloops_is_simple_reduction): Copy from
	vect_is_simple_reduction.
	(parloops_force_simple_reduction): Copy from
	vect_force_simple_reduction.
	(gather_scalar_reductions): Adjust.
	* tree-vect-loop.c (vect_force_simple_reduction): Make static.
	* tree-vectorizer.h (vect_force_simple_reduction): Remove.

From-SVN: r275896
parent ba7c8cb5
2019-09-18 Richard Biener <rguenther@suse.de> 2019-09-18 Richard Biener <rguenther@suse.de>
* tree-parloops.c (report_ploop_op): Copy from report_vect_op.
(parloops_valid_reduction_input_p): Copy from
valid_reduction_input_p.
(parloops_is_slp_reduction): Copy from vect_is_slp_reduction.
(parloops_needs_fold_left_reduction_p): Copy from
needs_fold_left_reduction_p.
(parloops_is_simple_reduction): Copy from
vect_is_simple_reduction.
(parloops_force_simple_reduction): Copy from
vect_force_simple_reduction.
(gather_scalar_reductions): Adjust.
* tree-vect-loop.c (vect_force_simple_reduction): Make static.
* tree-vectorizer.h (vect_force_simple_reduction): Remove.
2019-09-18 Richard Biener <rguenther@suse.de>
* tree-vectorizer.h (get_initial_def_for_reduction): Remove. * tree-vectorizer.h (get_initial_def_for_reduction): Remove.
* tree-vect-loop.c (get_initial_def_for_reduction): Make * tree-vect-loop.c (get_initial_def_for_reduction): Make
static. static.
......
...@@ -154,6 +154,8 @@ along with GCC; see the file COPYING3. If not see ...@@ -154,6 +154,8 @@ along with GCC; see the file COPYING3. If not see
*/ */
static void vect_estimate_min_profitable_iters (loop_vec_info, int *, int *); static void vect_estimate_min_profitable_iters (loop_vec_info, int *, int *);
static stmt_vec_info vect_force_simple_reduction (loop_vec_info, stmt_vec_info,
bool *, bool);
/* Subroutine of vect_determine_vf_for_stmt that handles only one /* Subroutine of vect_determine_vf_for_stmt that handles only one
statement. VECTYPE_MAYBE_SET_P is true if STMT_VINFO_VECTYPE statement. VECTYPE_MAYBE_SET_P is true if STMT_VINFO_VECTYPE
...@@ -3361,7 +3363,7 @@ vect_is_simple_reduction (loop_vec_info loop_info, stmt_vec_info phi_info, ...@@ -3361,7 +3363,7 @@ vect_is_simple_reduction (loop_vec_info loop_info, stmt_vec_info phi_info,
in-place if it enables detection of more reductions. Arguments in-place if it enables detection of more reductions. Arguments
as there. */ as there. */
stmt_vec_info static stmt_vec_info
vect_force_simple_reduction (loop_vec_info loop_info, stmt_vec_info phi_info, vect_force_simple_reduction (loop_vec_info loop_info, stmt_vec_info phi_info,
bool *double_reduc, bool *double_reduc,
bool need_wrapping_integral_overflow) bool need_wrapping_integral_overflow)
......
...@@ -1611,11 +1611,8 @@ extern tree vect_create_addr_base_for_vector_ref (stmt_vec_info, gimple_seq *, ...@@ -1611,11 +1611,8 @@ extern tree vect_create_addr_base_for_vector_ref (stmt_vec_info, gimple_seq *,
tree, tree = NULL_TREE); tree, tree = NULL_TREE);
/* In tree-vect-loop.c. */ /* In tree-vect-loop.c. */
/* FORNOW: Used in tree-parloops.c. */
extern stmt_vec_info vect_force_simple_reduction (loop_vec_info, stmt_vec_info,
bool *, bool);
extern widest_int vect_iv_limit_for_full_masking (loop_vec_info loop_vinfo); extern widest_int vect_iv_limit_for_full_masking (loop_vec_info loop_vinfo);
/* Used in gimple-loop-interchange.c. */ /* Used in gimple-loop-interchange.c and tree-parloops.c. */
extern bool check_reduction_path (dump_user_location_t, loop_p, gphi *, tree, extern bool check_reduction_path (dump_user_location_t, loop_p, gphi *, tree,
enum tree_code); enum tree_code);
/* Drive for loop analysis stage. */ /* Drive for loop analysis stage. */
......
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