aboutsummaryrefslogtreecommitdiff
path: root/gcc/tree-vect-loop-manip.c
diff options
context:
space:
mode:
authorRichard Biener <rguenther@suse.de>2013-05-15 11:13:46 +0000
committerRichard Biener <rguenth@gcc.gnu.org>2013-05-15 11:13:46 +0000
commitccb3ad87d42e58bbd93e36f7c8787e9ae1c075a2 (patch)
treed431e8f0b553697cfb5021a7aa3390f85cbe87f9 /gcc/tree-vect-loop-manip.c
parent48b1474efb32b90b45e4d824f5c670e24e059f0c (diff)
downloadgcc-ccb3ad87d42e58bbd93e36f7c8787e9ae1c075a2.zip
gcc-ccb3ad87d42e58bbd93e36f7c8787e9ae1c075a2.tar.gz
gcc-ccb3ad87d42e58bbd93e36f7c8787e9ae1c075a2.tar.bz2
tree-vect-loop.c (vect_transform_loop): Use MSG_NOTE instead of MSG_OPTIMIZED_LOCATIONS.
2013-05-15 Richard Biener <rguenther@suse.de> * tree-vect-loop.c (vect_transform_loop): Use MSG_NOTE instead of MSG_OPTIMIZED_LOCATIONS. * tree-vect-slp.c (vect_make_slp_decision): Likewise. (vect_slp_transform_bb): Indicate location in MSG_OPTIMIZED_LOCATIONS message. * tree-vectorizer.c (vectorize_loops): Use MSG_NOTE instead of MSG_OPTIMIZED_LOCATIONS. (execute_vect_slp): Likewise. * tree-vect-loop-manip.c (vect_do_peeling_for_loop_bound): Likewise. (vect_create_cond_for_alias_checks): Likewise. * tree-vect-patterns.c (vect_recog_dot_prod_pattern): Likewise. (vect_recog_widen_mult_pattern): Likewise. (vect_recog_widen_sum_pattern): Likewise. (vect_recog_over_widening_pattern): Likewise. (vect_recog_widen_shift_pattern): Likewise. (vect_recog_vector_vector_shift_pattern): Likewise. (vect_recog_divmod_pattern): Likewise. (vect_recog_mixed_size_cond_pattern): Likewise. (vect_recog_bool_pattern): Likewise. (vect_pattern_recog_1): Likewise. From-SVN: r198927
Diffstat (limited to 'gcc/tree-vect-loop-manip.c')
-rw-r--r--gcc/tree-vect-loop-manip.c26
1 files changed, 13 insertions, 13 deletions
diff --git a/gcc/tree-vect-loop-manip.c b/gcc/tree-vect-loop-manip.c
index 82e724f..a0d6769 100644
--- a/gcc/tree-vect-loop-manip.c
+++ b/gcc/tree-vect-loop-manip.c
@@ -1761,7 +1761,7 @@ vect_do_peeling_for_loop_bound (loop_vec_info loop_vinfo, tree *ratio,
gimple_seq cond_expr_stmt_list = NULL;
if (dump_enabled_p ())
- dump_printf_loc (MSG_OPTIMIZED_LOCATIONS, vect_location,
+ dump_printf_loc (MSG_NOTE, vect_location,
"=== vect_do_peeling_for_loop_bound ===");
initialize_original_copy_tables ();
@@ -1815,7 +1815,7 @@ vect_do_peeling_for_loop_bound (loop_vec_info loop_vinfo, tree *ratio,
if (check_profitability)
max_iter = MAX (max_iter, (int) th - 1);
record_niter_bound (new_loop, double_int::from_shwi (max_iter), false, true);
- dump_printf (MSG_OPTIMIZED_LOCATIONS,
+ dump_printf (MSG_NOTE,
"Setting upper bound of nb iterations for epilogue "
"loop to %d\n", max_iter);
@@ -1880,7 +1880,7 @@ vect_gen_niters_for_prolog_loop (loop_vec_info loop_vinfo, tree loop_niters, int
int npeel = LOOP_PEELING_FOR_ALIGNMENT (loop_vinfo);
if (dump_enabled_p ())
- dump_printf_loc (MSG_OPTIMIZED_LOCATIONS, vect_location,
+ dump_printf_loc (MSG_NOTE, vect_location,
"known peeling = %d.", npeel);
iters = build_int_cst (niters_type, npeel);
@@ -1935,9 +1935,9 @@ vect_gen_niters_for_prolog_loop (loop_vec_info loop_vinfo, tree loop_niters, int
if (dump_enabled_p ())
{
- dump_printf_loc (MSG_OPTIMIZED_LOCATIONS, vect_location,
+ dump_printf_loc (MSG_NOTE, vect_location,
"niters for prolog loop: ");
- dump_generic_expr (MSG_OPTIMIZED_LOCATIONS, TDF_SLIM, iters);
+ dump_generic_expr (MSG_NOTE, TDF_SLIM, iters);
}
var = create_tmp_var (niters_type, "prolog_loop_niters");
@@ -1992,7 +1992,7 @@ vect_update_inits_of_drs (loop_vec_info loop_vinfo, tree niters)
struct data_reference *dr;
if (dump_enabled_p ())
- dump_printf_loc (MSG_OPTIMIZED_LOCATIONS, vect_location,
+ dump_printf_loc (MSG_NOTE, vect_location,
"=== vect_update_inits_of_dr ===");
FOR_EACH_VEC_ELT (datarefs, i, dr)
@@ -2021,7 +2021,7 @@ vect_do_peeling_for_alignment (loop_vec_info loop_vinfo,
int bound = 0;
if (dump_enabled_p ())
- dump_printf_loc (MSG_OPTIMIZED_LOCATIONS, vect_location,
+ dump_printf_loc (MSG_NOTE, vect_location,
"=== vect_do_peeling_for_alignment ===");
initialize_original_copy_tables ();
@@ -2049,7 +2049,7 @@ vect_do_peeling_for_alignment (loop_vec_info loop_vinfo,
if (check_profitability)
max_iter = MAX (max_iter, (int) th - 1);
record_niter_bound (new_loop, double_int::from_shwi (max_iter), false, true);
- dump_printf (MSG_OPTIMIZED_LOCATIONS,
+ dump_printf (MSG_NOTE,
"Setting upper bound of nb iterations for prologue "
"loop to %d\n", max_iter);
@@ -2332,11 +2332,11 @@ vect_create_cond_for_alias_checks (loop_vec_info loop_vinfo, tree * cond_expr)
if (dump_enabled_p ())
{
- dump_printf_loc (MSG_OPTIMIZED_LOCATIONS, vect_location,
+ dump_printf_loc (MSG_NOTE, vect_location,
"create runtime check for data references ");
- dump_generic_expr (MSG_OPTIMIZED_LOCATIONS, TDF_SLIM, DR_REF (dr_a));
- dump_printf (MSG_OPTIMIZED_LOCATIONS, " and ");
- dump_generic_expr (MSG_OPTIMIZED_LOCATIONS, TDF_SLIM, DR_REF (dr_b));
+ dump_generic_expr (MSG_NOTE, TDF_SLIM, DR_REF (dr_a));
+ dump_printf (MSG_NOTE, " and ");
+ dump_generic_expr (MSG_NOTE, TDF_SLIM, DR_REF (dr_b));
}
seg_a_min = addr_base_a;
@@ -2362,7 +2362,7 @@ vect_create_cond_for_alias_checks (loop_vec_info loop_vinfo, tree * cond_expr)
}
if (dump_enabled_p ())
- dump_printf_loc (MSG_OPTIMIZED_LOCATIONS, vect_location,
+ dump_printf_loc (MSG_NOTE, vect_location,
"created %u versioning for alias checks.\n",
may_alias_ddrs.length ());
}