diff options
Diffstat (limited to 'gcc/tree-vect-loop.c')
| -rw-r--r-- | gcc/tree-vect-loop.c | 317 |
1 files changed, 158 insertions, 159 deletions
diff --git a/gcc/tree-vect-loop.c b/gcc/tree-vect-loop.c index 6b8ba3f..908caed 100644 --- a/gcc/tree-vect-loop.c +++ b/gcc/tree-vect-loop.c @@ -187,7 +187,7 @@ vect_determine_vectorization_factor (loop_vec_info loop_vinfo) gimple_stmt_iterator pattern_def_si = gsi_none (); bool analyze_pattern_stmt = false; - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "=== vect_determine_vectorization_factor ==="); @@ -199,7 +199,7 @@ vect_determine_vectorization_factor (loop_vec_info loop_vinfo) { phi = gsi_stmt (si); stmt_info = vinfo_for_stmt (phi); - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_NOTE, vect_location, "==> examining phi: "); dump_gimple_stmt (MSG_NOTE, TDF_SLIM, phi, 0); @@ -212,7 +212,7 @@ vect_determine_vectorization_factor (loop_vec_info loop_vinfo) gcc_assert (!STMT_VINFO_VECTYPE (stmt_info)); scalar_type = TREE_TYPE (PHI_RESULT (phi)); - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_NOTE, vect_location, "get vectype for scalar type: "); @@ -222,7 +222,7 @@ vect_determine_vectorization_factor (loop_vec_info loop_vinfo) vectype = get_vectype_for_scalar_type (scalar_type); if (!vectype) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "not vectorized: unsupported " @@ -234,14 +234,14 @@ vect_determine_vectorization_factor (loop_vec_info loop_vinfo) } STMT_VINFO_VECTYPE (stmt_info) = vectype; - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_NOTE, vect_location, "vectype: "); dump_generic_expr (MSG_NOTE, TDF_SLIM, vectype); } nunits = TYPE_VECTOR_SUBPARTS (vectype); - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "nunits = %d", nunits); if (!vectorization_factor @@ -261,7 +261,7 @@ vect_determine_vectorization_factor (loop_vec_info loop_vinfo) stmt_info = vinfo_for_stmt (stmt); - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_NOTE, vect_location, "==> examining statement: "); @@ -281,7 +281,7 @@ vect_determine_vectorization_factor (loop_vec_info loop_vinfo) { stmt = pattern_stmt; stmt_info = vinfo_for_stmt (pattern_stmt); - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_NOTE, vect_location, "==> examining pattern statement: "); @@ -290,7 +290,7 @@ vect_determine_vectorization_factor (loop_vec_info loop_vinfo) } else { - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "skip."); gsi_next (&si); continue; @@ -330,7 +330,7 @@ vect_determine_vectorization_factor (loop_vec_info loop_vinfo) if (!gsi_end_p (pattern_def_si)) { - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_NOTE, vect_location, "==> examining pattern def stmt: "); @@ -353,7 +353,7 @@ vect_determine_vectorization_factor (loop_vec_info loop_vinfo) if (gimple_get_lhs (stmt) == NULL_TREE) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "not vectorized: irregular stmt."); @@ -365,7 +365,7 @@ vect_determine_vectorization_factor (loop_vec_info loop_vinfo) if (VECTOR_MODE_P (TYPE_MODE (gimple_expr_type (stmt)))) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "not vectorized: vector stmt in loop:"); @@ -389,7 +389,7 @@ vect_determine_vectorization_factor (loop_vec_info loop_vinfo) { gcc_assert (!STMT_VINFO_DATA_REF (stmt_info)); scalar_type = TREE_TYPE (gimple_get_lhs (stmt)); - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_NOTE, vect_location, "get vectype for scalar type: "); @@ -398,7 +398,7 @@ vect_determine_vectorization_factor (loop_vec_info loop_vinfo) vectype = get_vectype_for_scalar_type (scalar_type); if (!vectype) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "not vectorized: unsupported " @@ -417,7 +417,7 @@ vect_determine_vectorization_factor (loop_vec_info loop_vinfo) support one vector size per loop). */ scalar_type = vect_get_smallest_scalar_type (stmt, &dummy, &dummy); - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_NOTE, vect_location, "get vectype for scalar type: "); @@ -426,7 +426,7 @@ vect_determine_vectorization_factor (loop_vec_info loop_vinfo) vf_vectype = get_vectype_for_scalar_type (scalar_type); if (!vf_vectype) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "not vectorized: unsupported data-type "); @@ -439,7 +439,7 @@ vect_determine_vectorization_factor (loop_vec_info loop_vinfo) if ((GET_MODE_SIZE (TYPE_MODE (vectype)) != GET_MODE_SIZE (TYPE_MODE (vf_vectype)))) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "not vectorized: different sized vector " @@ -453,14 +453,14 @@ vect_determine_vectorization_factor (loop_vec_info loop_vinfo) return false; } - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_NOTE, vect_location, "vectype: "); dump_generic_expr (MSG_NOTE, TDF_SLIM, vf_vectype); } nunits = TYPE_VECTOR_SUBPARTS (vf_vectype); - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "nunits = %d", nunits); if (!vectorization_factor || (nunits > vectorization_factor)) @@ -475,12 +475,12 @@ vect_determine_vectorization_factor (loop_vec_info loop_vinfo) } /* TODO: Analyze cost. Decide if worth while to vectorize. */ - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "vectorization factor = %d", vectorization_factor); if (vectorization_factor <= 1) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "not vectorized: unsupported data-type"); return false; @@ -517,7 +517,7 @@ vect_is_simple_iv_evolution (unsigned loop_nb, tree access_fn, tree * init, step_expr = evolution_part; init_expr = unshare_expr (initial_condition_in_loop_num (access_fn, loop_nb)); - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_NOTE, vect_location, "step: "); dump_generic_expr (MSG_NOTE, TDF_SLIM, step_expr); @@ -530,7 +530,7 @@ vect_is_simple_iv_evolution (unsigned loop_nb, tree access_fn, tree * init, if (TREE_CODE (step_expr) != INTEGER_CST) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "step unknown."); return false; @@ -555,7 +555,7 @@ vect_analyze_scalar_cycles_1 (loop_vec_info loop_vinfo, struct loop *loop) gimple_stmt_iterator gsi; bool double_reduc; - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "=== vect_analyze_scalar_cycles ==="); @@ -569,7 +569,7 @@ vect_analyze_scalar_cycles_1 (loop_vec_info loop_vinfo, struct loop *loop) tree def = PHI_RESULT (phi); stmt_vec_info stmt_vinfo = vinfo_for_stmt (phi); - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_NOTE, vect_location, "Analyze phi: "); dump_gimple_stmt (MSG_NOTE, TDF_SLIM, phi, 0); @@ -587,7 +587,7 @@ vect_analyze_scalar_cycles_1 (loop_vec_info loop_vinfo, struct loop *loop) if (access_fn) { STRIP_NOPS (access_fn); - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_NOTE, vect_location, "Access function of PHI: "); @@ -606,7 +606,7 @@ vect_analyze_scalar_cycles_1 (loop_vec_info loop_vinfo, struct loop *loop) gcc_assert (STMT_VINFO_LOOP_PHI_EVOLUTION_PART (stmt_vinfo) != NULL_TREE); - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "Detected induction."); STMT_VINFO_DEF_TYPE (stmt_vinfo) = vect_induction_def; } @@ -621,7 +621,7 @@ vect_analyze_scalar_cycles_1 (loop_vec_info loop_vinfo, struct loop *loop) gimple reduc_stmt; bool nested_cycle; - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_NOTE, vect_location, "Analyze phi: "); dump_gimple_stmt (MSG_NOTE, TDF_SLIM, phi, 0); @@ -637,7 +637,7 @@ vect_analyze_scalar_cycles_1 (loop_vec_info loop_vinfo, struct loop *loop) { if (double_reduc) { - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "Detected double reduction."); @@ -649,7 +649,7 @@ vect_analyze_scalar_cycles_1 (loop_vec_info loop_vinfo, struct loop *loop) { if (nested_cycle) { - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "Detected vectorizable nested cycle."); @@ -659,7 +659,7 @@ vect_analyze_scalar_cycles_1 (loop_vec_info loop_vinfo, struct loop *loop) } else { - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "Detected reduction."); @@ -675,7 +675,7 @@ vect_analyze_scalar_cycles_1 (loop_vec_info loop_vinfo, struct loop *loop) } } else - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "Unknown def-use cycle pattern."); } @@ -737,7 +737,7 @@ vect_get_loop_niters (struct loop *loop, tree *number_of_iterations) { tree niters; - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "=== get_loop_niters ==="); niters = number_of_exit_cond_executions (loop); @@ -747,7 +747,7 @@ vect_get_loop_niters (struct loop *loop, tree *number_of_iterations) { *number_of_iterations = niters; - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_NOTE, vect_location, "==> get_loop_niters:"); dump_generic_expr (MSG_NOTE, TDF_SLIM, *number_of_iterations); @@ -995,7 +995,7 @@ vect_analyze_loop_1 (struct loop *loop) { loop_vec_info loop_vinfo; - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "===== analyze_loop_nest_1 ====="); @@ -1004,7 +1004,7 @@ vect_analyze_loop_1 (struct loop *loop) loop_vinfo = vect_analyze_loop_form (loop); if (!loop_vinfo) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "bad inner-loop form."); return NULL; @@ -1030,7 +1030,7 @@ vect_analyze_loop_form (struct loop *loop) tree number_of_iterations = NULL; loop_vec_info inner_loop_vinfo = NULL; - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "=== vect_analyze_loop_form ==="); @@ -1054,7 +1054,7 @@ vect_analyze_loop_form (struct loop *loop) if (loop->num_nodes != 2) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "not vectorized: control flow in loop."); return NULL; @@ -1062,7 +1062,7 @@ vect_analyze_loop_form (struct loop *loop) if (empty_block_p (loop->header)) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "not vectorized: empty loop."); return NULL; @@ -1092,7 +1092,7 @@ vect_analyze_loop_form (struct loop *loop) if ((loop->inner)->inner || (loop->inner)->next) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "not vectorized: multiple nested loops."); return NULL; @@ -1102,7 +1102,7 @@ vect_analyze_loop_form (struct loop *loop) inner_loop_vinfo = vect_analyze_loop_1 (loop->inner); if (!inner_loop_vinfo) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "not vectorized: Bad inner loop."); return NULL; @@ -1111,7 +1111,7 @@ vect_analyze_loop_form (struct loop *loop) if (!expr_invariant_in_loop_p (loop, LOOP_VINFO_NITERS (inner_loop_vinfo))) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "not vectorized: inner-loop count not invariant."); destroy_loop_vec_info (inner_loop_vinfo, true); @@ -1120,7 +1120,7 @@ vect_analyze_loop_form (struct loop *loop) if (loop->num_nodes != 5) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "not vectorized: control flow in loop."); destroy_loop_vec_info (inner_loop_vinfo, true); @@ -1136,14 +1136,14 @@ vect_analyze_loop_form (struct loop *loop) || !single_exit (innerloop) || single_exit (innerloop)->dest != EDGE_PRED (loop->latch, 0)->src) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "not vectorized: unsupported outerloop form."); destroy_loop_vec_info (inner_loop_vinfo, true); return NULL; } - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "Considering outer-loop vectorization."); } @@ -1151,7 +1151,7 @@ vect_analyze_loop_form (struct loop *loop) if (!single_exit (loop) || EDGE_COUNT (loop->header->preds) != 2) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) { if (!single_exit (loop)) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, @@ -1172,7 +1172,7 @@ vect_analyze_loop_form (struct loop *loop) if (!empty_block_p (loop->latch) || !gimple_seq_empty_p (phi_nodes (loop->latch))) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "not vectorized: unexpected loop form."); if (inner_loop_vinfo) @@ -1187,12 +1187,12 @@ vect_analyze_loop_form (struct loop *loop) if (!(e->flags & EDGE_ABNORMAL)) { split_loop_exit_edge (e); - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf (MSG_NOTE, "split exit edge."); } else { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "not vectorized: abnormal loop exit edge."); if (inner_loop_vinfo) @@ -1204,7 +1204,7 @@ vect_analyze_loop_form (struct loop *loop) loop_cond = vect_get_loop_niters (loop, &number_of_iterations); if (!loop_cond) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "not vectorized: complicated exit condition."); if (inner_loop_vinfo) @@ -1214,7 +1214,7 @@ vect_analyze_loop_form (struct loop *loop) if (!number_of_iterations) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "not vectorized: number of iterations cannot be " "computed."); @@ -1225,7 +1225,7 @@ vect_analyze_loop_form (struct loop *loop) if (chrec_contains_undetermined (number_of_iterations)) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "Infinite number of iterations."); if (inner_loop_vinfo) @@ -1235,7 +1235,7 @@ vect_analyze_loop_form (struct loop *loop) if (!NITERS_KNOWN_P (number_of_iterations)) { - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_NOTE, vect_location, "Symbolic number of iterations is "); @@ -1244,7 +1244,7 @@ vect_analyze_loop_form (struct loop *loop) } else if (TREE_INT_CST_LOW (number_of_iterations) == 0) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "not vectorized: number of iterations = 0."); if (inner_loop_vinfo) @@ -1292,7 +1292,7 @@ vect_analyze_loop_operations (loop_vec_info loop_vinfo, bool slp) HOST_WIDE_INT estimated_niter; int min_profitable_estimate; - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "=== vect_analyze_loop_operations ==="); @@ -1328,7 +1328,7 @@ vect_analyze_loop_operations (loop_vec_info loop_vinfo, bool slp) LOOP_VINFO_SLP_UNROLLING_FACTOR (loop_vinfo)); LOOP_VINFO_VECT_FACTOR (loop_vinfo) = vectorization_factor; - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "Updating vectorization factor to %d ", vectorization_factor); @@ -1344,7 +1344,7 @@ vect_analyze_loop_operations (loop_vec_info loop_vinfo, bool slp) ok = true; stmt_info = vinfo_for_stmt (phi); - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_NOTE, vect_location, "examining phi: "); dump_gimple_stmt (MSG_NOTE, TDF_SLIM, phi, 0); @@ -1363,7 +1363,7 @@ vect_analyze_loop_operations (loop_vec_info loop_vinfo, bool slp) && STMT_VINFO_DEF_TYPE (stmt_info) != vect_double_reduction_def) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "Unsupported loop-closed phi in " "outer-loop."); @@ -1405,7 +1405,7 @@ vect_analyze_loop_operations (loop_vec_info loop_vinfo, bool slp) if (STMT_VINFO_LIVE_P (stmt_info)) { /* FORNOW: not yet supported. */ - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "not vectorized: value used after loop."); return false; @@ -1415,7 +1415,7 @@ vect_analyze_loop_operations (loop_vec_info loop_vinfo, bool slp) && STMT_VINFO_DEF_TYPE (stmt_info) != vect_induction_def) { /* A scalar-dependence cycle that we don't support. */ - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "not vectorized: scalar dependence cycle."); return false; @@ -1430,7 +1430,7 @@ vect_analyze_loop_operations (loop_vec_info loop_vinfo, bool slp) if (!ok) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "not vectorized: relevant phi not " @@ -1456,18 +1456,17 @@ vect_analyze_loop_operations (loop_vec_info loop_vinfo, bool slp) touching this loop. */ if (!need_to_vectorize) { - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "All the computation can be taken out of the loop."); - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "not vectorized: redundant loop. no profit to " "vectorize."); return false; } - if (LOOP_VINFO_NITERS_KNOWN_P (loop_vinfo) - && dump_kind_p (MSG_NOTE)) + if (LOOP_VINFO_NITERS_KNOWN_P (loop_vinfo) && dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "vectorization_factor = %d, niters = " HOST_WIDE_INT_PRINT_DEC, vectorization_factor, @@ -1478,10 +1477,10 @@ vect_analyze_loop_operations (loop_vec_info loop_vinfo, bool slp) || ((max_niter = max_stmt_executions_int (loop)) != -1 && (unsigned HOST_WIDE_INT) max_niter < vectorization_factor)) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "not vectorized: iteration count too small."); - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "not vectorized: iteration count smaller than " "vectorization factor."); @@ -1500,10 +1499,10 @@ vect_analyze_loop_operations (loop_vec_info loop_vinfo, bool slp) if (min_profitable_iters < 0) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "not vectorized: vectorization not profitable."); - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "not vectorized: vector version will never be " "profitable."); @@ -1526,10 +1525,10 @@ vect_analyze_loop_operations (loop_vec_info loop_vinfo, bool slp) if (LOOP_VINFO_NITERS_KNOWN_P (loop_vinfo) && LOOP_VINFO_INT_NITERS (loop_vinfo) <= th) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "not vectorized: vectorization not profitable."); - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "not vectorized: iteration count smaller than user " "specified loop bound parameter or minimum profitable " @@ -1541,11 +1540,11 @@ vect_analyze_loop_operations (loop_vec_info loop_vinfo, bool slp) && ((unsigned HOST_WIDE_INT) estimated_niter <= MAX (th, (unsigned)min_profitable_estimate))) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "not vectorized: estimated iteration count too " "small."); - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "not vectorized: estimated iteration count smaller " "than specified loop bound parameter or minimum " @@ -1558,18 +1557,18 @@ vect_analyze_loop_operations (loop_vec_info loop_vinfo, bool slp) || LOOP_VINFO_INT_NITERS (loop_vinfo) % vectorization_factor != 0 || LOOP_PEELING_FOR_ALIGNMENT (loop_vinfo)) { - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "epilog loop required."); if (!vect_can_advance_ivs_p (loop_vinfo)) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "not vectorized: can't create epilog loop 1."); return false; } if (!slpeel_can_duplicate_loop_p (loop, single_exit (loop))) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "not vectorized: can't create epilog loop 2."); return false; @@ -1602,7 +1601,7 @@ vect_analyze_loop_2 (loop_vec_info loop_vinfo) ok = vect_analyze_data_refs (loop_vinfo, NULL, &min_vf); if (!ok) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "bad data references."); return false; @@ -1620,7 +1619,7 @@ vect_analyze_loop_2 (loop_vec_info loop_vinfo) ok = vect_mark_stmts_to_be_vectorized (loop_vinfo); if (!ok) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "unexpected pattern."); return false; @@ -1635,7 +1634,7 @@ vect_analyze_loop_2 (loop_vec_info loop_vinfo) if (!ok || max_vf < min_vf) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "bad data dependence."); return false; @@ -1644,14 +1643,14 @@ vect_analyze_loop_2 (loop_vec_info loop_vinfo) ok = vect_determine_vectorization_factor (loop_vinfo); if (!ok) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "can't determine vectorization factor."); return false; } if (max_vf < LOOP_VINFO_VECT_FACTOR (loop_vinfo)) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "bad data dependence."); return false; @@ -1663,7 +1662,7 @@ vect_analyze_loop_2 (loop_vec_info loop_vinfo) ok = vect_analyze_data_refs_alignment (loop_vinfo, NULL); if (!ok) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "bad data alignment."); return false; @@ -1675,7 +1674,7 @@ vect_analyze_loop_2 (loop_vec_info loop_vinfo) ok = vect_analyze_data_ref_accesses (loop_vinfo, NULL); if (!ok) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "bad data access."); return false; @@ -1687,7 +1686,7 @@ vect_analyze_loop_2 (loop_vec_info loop_vinfo) ok = vect_prune_runtime_alias_test_list (loop_vinfo); if (!ok) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "too long list of versioning for alias " "run-time tests."); @@ -1700,7 +1699,7 @@ vect_analyze_loop_2 (loop_vec_info loop_vinfo) ok = vect_enhance_data_refs_alignment (loop_vinfo); if (!ok) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "bad data alignment."); return false; @@ -1725,7 +1724,7 @@ vect_analyze_loop_2 (loop_vec_info loop_vinfo) ok = vect_analyze_loop_operations (loop_vinfo, slp); if (!ok) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "bad operation or unsupported loop bound."); return false; @@ -1749,7 +1748,7 @@ vect_analyze_loop (struct loop *loop) current_vector_size = 0; vector_sizes = targetm.vectorize.autovectorize_vector_sizes (); - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "===== analyze_loop_nest ====="); @@ -1757,7 +1756,7 @@ vect_analyze_loop (struct loop *loop) && loop_vec_info_for_loop (loop_outer (loop)) && LOOP_VINFO_VECTORIZABLE_P (loop_vec_info_for_loop (loop_outer (loop)))) { - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "outer-loop already vectorized."); return NULL; @@ -1769,7 +1768,7 @@ vect_analyze_loop (struct loop *loop) loop_vinfo = vect_analyze_loop_form (loop); if (!loop_vinfo) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "bad loop form."); return NULL; @@ -1791,7 +1790,7 @@ vect_analyze_loop (struct loop *loop) /* Try the next biggest vector size. */ current_vector_size = 1 << floor_log2 (vector_sizes); - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "***** Re-trying analysis with " "vector size %d\n", current_vector_size); @@ -2023,7 +2022,7 @@ vect_is_slp_reduction (loop_vec_info loop_info, gimple phi, gimple first_stmt) == vect_internal_def && !is_loop_header_bb_p (gimple_bb (def_stmt))))) { - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_NOTE, vect_location, "swapping oprnds: "); dump_gimple_stmt (MSG_NOTE, TDF_SLIM, next_stmt, 0); @@ -2125,7 +2124,7 @@ vect_is_simple_reduction_1 (loop_vec_info loop_info, gimple phi, if (!flow_bb_inside_loop_p (loop, gimple_bb (use_stmt))) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "intermediate value used outside loop."); @@ -2137,7 +2136,7 @@ vect_is_simple_reduction_1 (loop_vec_info loop_info, gimple phi, nloop_uses++; if (nloop_uses > 1) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "reduction used in loop."); return NULL; @@ -2146,7 +2145,7 @@ vect_is_simple_reduction_1 (loop_vec_info loop_info, gimple phi, if (TREE_CODE (loop_arg) != SSA_NAME) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "reduction: not ssa_name: "); @@ -2158,7 +2157,7 @@ vect_is_simple_reduction_1 (loop_vec_info loop_info, gimple phi, def_stmt = SSA_NAME_DEF_STMT (loop_arg); if (!def_stmt) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "reduction: no def_stmt."); return NULL; @@ -2166,7 +2165,7 @@ vect_is_simple_reduction_1 (loop_vec_info loop_info, gimple phi, if (!is_gimple_assign (def_stmt) && gimple_code (def_stmt) != GIMPLE_PHI) { - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_gimple_stmt (MSG_NOTE, TDF_SLIM, def_stmt, 0); return NULL; } @@ -2194,7 +2193,7 @@ vect_is_simple_reduction_1 (loop_vec_info loop_info, gimple phi, nloop_uses++; if (nloop_uses > 1) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "reduction used in loop."); return NULL; @@ -2210,7 +2209,7 @@ vect_is_simple_reduction_1 (loop_vec_info loop_info, gimple phi, if (gimple_phi_num_args (def_stmt) != 1 || TREE_CODE (op1) != SSA_NAME) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "unsupported phi node definition."); @@ -2223,7 +2222,7 @@ vect_is_simple_reduction_1 (loop_vec_info loop_info, gimple phi, && flow_bb_inside_loop_p (loop->inner, gimple_bb (def1)) && is_gimple_assign (def1)) { - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) report_vect_op (MSG_NOTE, def_stmt, "detected double reduction: "); @@ -2250,7 +2249,7 @@ vect_is_simple_reduction_1 (loop_vec_info loop_info, gimple phi, if (check_reduction && (!commutative_tree_code (code) || !associative_tree_code (code))) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) report_vect_op (MSG_MISSED_OPTIMIZATION, def_stmt, "reduction: not commutative/associative: "); return NULL; @@ -2260,7 +2259,7 @@ vect_is_simple_reduction_1 (loop_vec_info loop_info, gimple phi, { if (code != COND_EXPR) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) report_vect_op (MSG_MISSED_OPTIMIZATION, def_stmt, "reduction: not binary operation: "); @@ -2279,7 +2278,7 @@ vect_is_simple_reduction_1 (loop_vec_info loop_info, gimple phi, if (TREE_CODE (op1) != SSA_NAME && TREE_CODE (op2) != SSA_NAME) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) report_vect_op (MSG_MISSED_OPTIMIZATION, def_stmt, "reduction: uses not ssa_names: "); @@ -2293,7 +2292,7 @@ vect_is_simple_reduction_1 (loop_vec_info loop_info, gimple phi, if (TREE_CODE (op1) != SSA_NAME && TREE_CODE (op2) != SSA_NAME) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) report_vect_op (MSG_MISSED_OPTIMIZATION, def_stmt, "reduction: uses not ssa_names: "); @@ -2311,7 +2310,7 @@ vect_is_simple_reduction_1 (loop_vec_info loop_info, gimple phi, || (op4 && TREE_CODE (op4) == SSA_NAME && !types_compatible_p (type, TREE_TYPE (op4)))) { - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_NOTE, vect_location, "reduction: multiple types: operation type: "); @@ -2353,7 +2352,7 @@ vect_is_simple_reduction_1 (loop_vec_info loop_info, gimple phi, && check_reduction) { /* Changing the order of operations changes the semantics. */ - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) report_vect_op (MSG_MISSED_OPTIMIZATION, def_stmt, "reduction: unsafe fp math optimization: "); return NULL; @@ -2362,7 +2361,7 @@ vect_is_simple_reduction_1 (loop_vec_info loop_info, gimple phi, && check_reduction) { /* Changing the order of operations changes the semantics. */ - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) report_vect_op (MSG_MISSED_OPTIMIZATION, def_stmt, "reduction: unsafe int math optimization: "); return NULL; @@ -2370,7 +2369,7 @@ vect_is_simple_reduction_1 (loop_vec_info loop_info, gimple phi, else if (SAT_FIXED_POINT_TYPE_P (type) && check_reduction) { /* Changing the order of operations changes the semantics. */ - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) report_vect_op (MSG_MISSED_OPTIMIZATION, def_stmt, "reduction: unsafe fixed-point math optimization: "); return NULL; @@ -2407,7 +2406,7 @@ vect_is_simple_reduction_1 (loop_vec_info loop_info, gimple phi, if (code != COND_EXPR && ((!def1 || gimple_nop_p (def1)) && (!def2 || gimple_nop_p (def2)))) { - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) report_vect_op (MSG_NOTE, def_stmt, "reduction: no defs for operands: "); return NULL; } @@ -2429,7 +2428,7 @@ vect_is_simple_reduction_1 (loop_vec_info loop_info, gimple phi, == vect_internal_def && !is_loop_header_bb_p (gimple_bb (def1))))))) { - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) report_vect_op (MSG_NOTE, def_stmt, "detected reduction: "); return def_stmt; } @@ -2452,7 +2451,7 @@ vect_is_simple_reduction_1 (loop_vec_info loop_info, gimple phi, /* Swap operands (just for simplicity - so that the rest of the code can assume that the reduction variable is always the last (second) argument). */ - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) report_vect_op (MSG_NOTE, def_stmt, "detected reduction: need to swap operands: "); @@ -2464,7 +2463,7 @@ vect_is_simple_reduction_1 (loop_vec_info loop_info, gimple phi, } else { - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) report_vect_op (MSG_NOTE, def_stmt, "detected reduction: "); } @@ -2474,14 +2473,14 @@ vect_is_simple_reduction_1 (loop_vec_info loop_info, gimple phi, /* Try to find SLP reduction chain. */ if (check_reduction && vect_is_slp_reduction (loop_info, phi, def_stmt)) { - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) report_vect_op (MSG_NOTE, def_stmt, "reduction: detected reduction chain: "); return def_stmt; } - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) report_vect_op (MSG_MISSED_OPTIMIZATION, def_stmt, "reduction: unknown pattern: "); @@ -2589,7 +2588,7 @@ vect_get_known_peeling_cost (loop_vec_info loop_vinfo, int peel_iters_prologue, if (!LOOP_VINFO_NITERS_KNOWN_P (loop_vinfo)) { *peel_iters_epilogue = vf/2; - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "cost model: epilogue peel iters set to vf/2 " "because loop iterations are unknown ."); @@ -2882,7 +2881,7 @@ vect_estimate_min_profitable_iters (loop_vec_info loop_vinfo, /* vector version will never be profitable. */ else { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "cost model: the vector iteration cost = %d " "divided by the scalar iteration cost = %d " @@ -2893,7 +2892,7 @@ vect_estimate_min_profitable_iters (loop_vec_info loop_vinfo, return; } - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_NOTE, vect_location, "Cost model analysis: \n"); dump_printf (MSG_NOTE, " Vector inside of loop cost: %d\n", @@ -2925,7 +2924,7 @@ vect_estimate_min_profitable_iters (loop_vec_info loop_vinfo, then skip the vectorized loop. */ min_profitable_iters--; - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, " Runtime profitability threshold = %d\n", min_profitable_iters); @@ -2950,7 +2949,7 @@ vect_estimate_min_profitable_iters (loop_vec_info loop_vinfo, } min_profitable_estimate --; min_profitable_estimate = MAX (min_profitable_estimate, min_profitable_iters); - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, " Static estimate profitability threshold = %d\n", min_profitable_iters); @@ -3010,7 +3009,7 @@ vect_model_reduction_cost (stmt_vec_info stmt_info, enum tree_code reduc_code, vectype = get_vectype_for_scalar_type (TREE_TYPE (reduction_op)); if (!vectype) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "unsupported data-type "); @@ -3081,7 +3080,7 @@ vect_model_reduction_cost (stmt_vec_info stmt_info, enum tree_code reduc_code, } } - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf (MSG_NOTE, "vect_model_reduction_cost: inside_cost = %d, " "prologue_cost = %d, epilogue_cost = %d .", inside_cost, @@ -3110,7 +3109,7 @@ vect_model_induction_cost (stmt_vec_info stmt_info, int ncopies) prologue_cost = add_stmt_cost (target_cost_data, 2, scalar_to_vec, stmt_info, 0, vect_prologue); - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "vect_model_induction_cost: inside_cost = %d, " "prologue_cost = %d .", inside_cost, prologue_cost); @@ -3239,7 +3238,7 @@ get_initial_def_for_induction (gimple iv_phi) new_bb = gsi_insert_on_edge_immediate (pe, init_stmt); gcc_assert (!new_bb); - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_NOTE, vect_location, "created new init_stmt: "); @@ -3382,7 +3381,7 @@ get_initial_def_for_induction (gimple iv_phi) && !STMT_VINFO_LIVE_P (stmt_vinfo)); STMT_VINFO_VEC_STMT (stmt_vinfo) = new_stmt; - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_NOTE, vect_location, "vector of inductions after inner-loop:"); @@ -3392,7 +3391,7 @@ get_initial_def_for_induction (gimple iv_phi) } - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_NOTE, vect_location, "transform induction: created def-use cycle: "); @@ -3800,7 +3799,7 @@ vect_create_epilog_for_reduction (VEC (tree, heap) *vect_defs, gimple stmt, add_phi_arg (phi, def, loop_latch_edge (loop), UNKNOWN_LOCATION); - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_NOTE, vect_location, "transform reduction: created def-use cycle: "); @@ -4001,7 +4000,7 @@ vect_create_epilog_for_reduction (VEC (tree, heap) *vect_defs, gimple stmt, /*** Case 1: Create: v_out2 = reduc_expr <v_out1> */ - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "Reduce using direct vector reduction."); @@ -4052,7 +4051,7 @@ vect_create_epilog_for_reduction (VEC (tree, heap) *vect_defs, gimple stmt, Create: va = vop <va, va'> } */ - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "Reduce using vector shifts"); @@ -4093,7 +4092,7 @@ vect_create_epilog_for_reduction (VEC (tree, heap) *vect_defs, gimple stmt, Create: s = op <s, s'> // For non SLP cases } */ - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "Reduce using scalar code. "); @@ -4184,7 +4183,7 @@ vect_create_epilog_for_reduction (VEC (tree, heap) *vect_defs, gimple stmt, { tree rhs; - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "extract scalar result"); @@ -4423,7 +4422,7 @@ vect_finalize_reduction: UNKNOWN_LOCATION); add_phi_arg (vect_phi, PHI_RESULT (inner_phi), loop_latch_edge (outer_loop), UNKNOWN_LOCATION); - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_NOTE, vect_location, "created double reduction phi node: "); @@ -4773,7 +4772,7 @@ vectorizable_reduction (gimple stmt, gimple_stmt_iterator *gsi, { if (!vectorizable_condition (stmt, gsi, NULL, ops[reduc_index], 0, NULL)) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "unsupported condition in reduction"); @@ -4788,7 +4787,7 @@ vectorizable_reduction (gimple stmt, gimple_stmt_iterator *gsi, optab = optab_for_tree_code (code, vectype_in, optab_default); if (!optab) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "no optab."); @@ -4797,7 +4796,7 @@ vectorizable_reduction (gimple stmt, gimple_stmt_iterator *gsi, if (optab_handler (optab, vec_mode) == CODE_FOR_nothing) { - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf (MSG_NOTE, "op not supported by target."); if (GET_MODE_SIZE (vec_mode) != UNITS_PER_WORD @@ -4805,7 +4804,7 @@ vectorizable_reduction (gimple stmt, gimple_stmt_iterator *gsi, < vect_min_worthwhile_factor (code)) return false; - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf (MSG_NOTE, "proceeding using word mode."); } @@ -4814,7 +4813,7 @@ vectorizable_reduction (gimple stmt, gimple_stmt_iterator *gsi, && LOOP_VINFO_VECT_FACTOR (loop_vinfo) < vect_min_worthwhile_factor (code)) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "not worthwhile without SIMD support."); @@ -4895,7 +4894,7 @@ vectorizable_reduction (gimple stmt, gimple_stmt_iterator *gsi, optab_default); if (!reduc_optab) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "no optab for reduction."); @@ -4905,7 +4904,7 @@ vectorizable_reduction (gimple stmt, gimple_stmt_iterator *gsi, if (reduc_optab && optab_handler (reduc_optab, vec_mode) == CODE_FOR_nothing) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "reduc op not supported by target."); @@ -4916,7 +4915,7 @@ vectorizable_reduction (gimple stmt, gimple_stmt_iterator *gsi, { if (!nested_cycle || double_reduc) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "no reduc code for scalar code."); @@ -4926,7 +4925,7 @@ vectorizable_reduction (gimple stmt, gimple_stmt_iterator *gsi, if (double_reduc && ncopies > 1) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "multiple types in double reduction"); @@ -4945,7 +4944,7 @@ vectorizable_reduction (gimple stmt, gimple_stmt_iterator *gsi, ops[1] = fold_convert (TREE_TYPE (ops[0]), ops[1]); else { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "invalid types in dot-prod"); @@ -4963,7 +4962,7 @@ vectorizable_reduction (gimple stmt, gimple_stmt_iterator *gsi, /** Transform. **/ - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "transform reduction."); /* FORNOW: Multiple types are not supported for condition. */ @@ -5249,7 +5248,7 @@ vectorizable_induction (gimple phi, gimple_stmt_iterator *gsi ATTRIBUTE_UNUSED, if (ncopies > 1) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "multiple types in nested loop."); return false; @@ -5273,7 +5272,7 @@ vectorizable_induction (gimple phi, gimple_stmt_iterator *gsi ATTRIBUTE_UNUSED, if (!(STMT_VINFO_RELEVANT_P (exit_phi_vinfo) && !STMT_VINFO_LIVE_P (exit_phi_vinfo))) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "inner-loop induction only used outside " "of the outer vectorized loop."); @@ -5297,7 +5296,7 @@ vectorizable_induction (gimple phi, gimple_stmt_iterator *gsi ATTRIBUTE_UNUSED, if (!vec_stmt) /* transformation not required. */ { STMT_VINFO_TYPE (stmt_info) = induc_vec_info_type; - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "=== vectorizable_induction ==="); vect_model_induction_cost (stmt_info, ncopies); @@ -5306,7 +5305,7 @@ vectorizable_induction (gimple phi, gimple_stmt_iterator *gsi ATTRIBUTE_UNUSED, /** Transform. **/ - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "transform induction phi."); vec_def = get_initial_def_for_induction (phi); @@ -5371,7 +5370,7 @@ vectorizable_live_operation (gimple stmt, && !vect_is_simple_use (op, stmt, loop_vinfo, NULL, &def_stmt, &def, &dt)) { - if (dump_kind_p (MSG_MISSED_OPTIMIZATION)) + if (dump_enabled_p ()) dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, "use not simple."); return false; @@ -5410,7 +5409,7 @@ vect_loop_kill_debug_uses (struct loop *loop, gimple stmt) { if (gimple_debug_bind_p (ustmt)) { - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "killing debug use"); @@ -5450,7 +5449,7 @@ vect_transform_loop (loop_vec_info loop_vinfo) bool check_profitability = false; int th; - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "=== vec_transform_loop ==="); /* Use the more conservative vectorization threshold. If the number @@ -5464,7 +5463,7 @@ vect_transform_loop (loop_vec_info loop_vinfo) if (th >= LOOP_VINFO_VECT_FACTOR (loop_vinfo) - 1 && !LOOP_VINFO_NITERS_KNOWN_P (loop_vinfo)) { - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "Profitability threshold is %d loop iterations.", th); check_profitability = true; @@ -5525,7 +5524,7 @@ vect_transform_loop (loop_vec_info loop_vinfo) for (si = gsi_start_phis (bb); !gsi_end_p (si); gsi_next (&si)) { phi = gsi_stmt (si); - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_NOTE, vect_location, "------>vectorizing phi: "); @@ -5544,12 +5543,12 @@ vect_transform_loop (loop_vec_info loop_vinfo) if ((TYPE_VECTOR_SUBPARTS (STMT_VINFO_VECTYPE (stmt_info)) != (unsigned HOST_WIDE_INT) vectorization_factor) - && dump_kind_p (MSG_NOTE)) + && dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "multiple-types."); if (STMT_VINFO_DEF_TYPE (stmt_info) == vect_induction_def) { - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "transform phi."); vect_transform_stmt (phi, NULL, NULL, NULL, NULL); } @@ -5565,7 +5564,7 @@ vect_transform_loop (loop_vec_info loop_vinfo) else stmt = gsi_stmt (si); - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_NOTE, vect_location, "------>vectorizing statement: "); @@ -5637,7 +5636,7 @@ vect_transform_loop (loop_vec_info loop_vinfo) if (!gsi_end_p (pattern_def_si)) { - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) { dump_printf_loc (MSG_NOTE, vect_location, "==> vectorizing pattern def " @@ -5664,7 +5663,7 @@ vect_transform_loop (loop_vec_info loop_vinfo) STMT_VINFO_VECTYPE (stmt_info)); if (!STMT_SLP_TYPE (stmt_info) && nunits != (unsigned int) vectorization_factor - && dump_kind_p (MSG_NOTE)) + && dump_enabled_p ()) /* For SLP VF is set according to unrolling factor, and not to vector size, hence for SLP this print is not valid. */ dump_printf_loc (MSG_NOTE, vect_location, @@ -5678,7 +5677,7 @@ vect_transform_loop (loop_vec_info loop_vinfo) { slp_scheduled = true; - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "=== scheduling SLP instances ==="); @@ -5698,7 +5697,7 @@ vect_transform_loop (loop_vec_info loop_vinfo) } /* -------- vectorize statement ------------ */ - if (dump_kind_p (MSG_NOTE)) + if (dump_enabled_p ()) dump_printf_loc (MSG_NOTE, vect_location, "transform statement."); grouped_store = false; @@ -5741,9 +5740,9 @@ vect_transform_loop (loop_vec_info loop_vinfo) until all the loops have been transformed? */ update_ssa (TODO_update_ssa); - if (dump_kind_p (MSG_OPTIMIZED_LOCATIONS)) + if (dump_enabled_p ()) dump_printf_loc (MSG_OPTIMIZED_LOCATIONS, vect_location, "LOOP VECTORIZED."); - if (loop->inner && dump_kind_p (MSG_OPTIMIZED_LOCATIONS)) + if (loop->inner && dump_enabled_p ()) dump_printf_loc (MSG_OPTIMIZED_LOCATIONS, vect_location, "OUTER LOOP VECTORIZED."); } |