#include "tree-chrec.h"
#include "tree-data-ref.h"
#include "tree-scalar-evolution.h"
+#include "input.h"
#include "tree-vectorizer.h"
#include "tree-pass.h"
#include "langhooks.h"
#ifdef ENABLE_CHECKING
static void slpeel_verify_cfg_after_peeling (struct loop *, struct loop *);
#endif
+static LOC find_loop_location (struct loop *);
/*************************************************************************
void destroy_loop_vec_info (loop_vec_info);
stmt_vec_info new_stmt_vec_info (tree, loop_vec_info);
-static bool vect_debug_stats (struct loop *loop);
-static bool vect_debug_details (struct loop *loop);
+/*************************************************************************
+ Vectorization Debug Information.
+ *************************************************************************/
+
+/* Utilities for output formatting. */
+static bool vect_debug_stats (LOC);
+static bool vect_debug_details (LOC);
\f
/*************************************************************************
tree step = build_int_cst (TREE_TYPE (niters), 1);
tree then_label;
tree else_label;
+ LOC loop_loc;
orig_cond = get_loop_exit_condition (loop);
#ifdef ENABLE_CHECKING
/* Remove old loop exit test: */
bsi_remove (&loop_cond_bsi);
- if (vect_debug_stats (loop) || vect_debug_details (loop))
+ loop_loc = find_loop_location (loop);
+ if (vect_debug_details (loop_loc))
print_generic_expr (dump_file, cond_stmt, TDF_SLIM);
loop->nb_iterations = niters;
basic_block bb_before_first_loop;
basic_block bb_between_loops;
edge exit_e = loop->exit_edges [0];
+ LOC loop_loc;
if (!slpeel_can_duplicate_loop_p (loop, e))
return NULL;
if (!(new_loop = slpeel_tree_duplicate_loop_to_edge_cfg (loop, loops, e)))
{
- if (vect_debug_stats (loop) || vect_debug_details (loop))
+ loop_loc = find_loop_location (loop);
+ if (vect_debug_stats (loop_loc)
+ || vect_debug_details (loop_loc))
fprintf (dump_file, "tree_duplicate_loop_to_edge_cfg failed.\n");
return NULL;
}
return new_loop;
}
+/* Function vect_get_loop_location.
+
+ Extract the location of the loop in the source code.
+ If the loop is not well formed for vectorization, an estimated
+ location is calculated.
+ Return the loop location if succeed and NULL if not. */
+
+static LOC
+find_loop_location (struct loop *loop)
+{
+ tree node = NULL_TREE;
+ basic_block bb;
+ block_stmt_iterator si;
+
+ if (!loop)
+ return UNKNOWN_LOC;
+
+ node = get_loop_exit_condition (loop);
+
+ if (node && EXPR_P (node) && EXPR_HAS_LOCATION (node)
+ && EXPR_FILENAME (node) && EXPR_LINENO (node))
+ return EXPR_LOC (node);
+
+ /* If we got here the loop is probably not "well formed",
+ try to estimate the loop location */
+
+ if (!loop->header)
+ return UNKNOWN_LOC;
+
+ bb = loop->header;
+
+ for (si = bsi_start (bb); !bsi_end_p (si); bsi_next (&si))
+ {
+ node = bsi_stmt (si);
+ if (node && EXPR_P (node) && EXPR_HAS_LOCATION (node))
+ return EXPR_LOC (node);
+ }
+
+ return UNKNOWN_LOC;
+}
+
+
\f
/* Here the proper Vectorizer starts. */
VARRAY_GENERIC_PTR_INIT (LOOP_VINFO_DATAREF_READS (res), 20,
"loop_read_datarefs");
LOOP_VINFO_UNALIGNED_DR (res) = NULL;
+ LOOP_VINFO_LOC (res) = UNKNOWN_LOC;
return res;
}
For vectorization statistics dumps. */
static bool
-vect_debug_stats (struct loop *loop)
+vect_debug_stats (LOC loc)
{
- basic_block bb;
- block_stmt_iterator si;
- tree node = NULL_TREE;
-
if (!dump_file || !(dump_flags & TDF_STATS))
return false;
- if (!loop)
- {
- fprintf (dump_file, "\n");
- return true;
- }
-
- if (!loop->header)
- return false;
-
- bb = loop->header;
-
- for (si = bsi_start (bb); !bsi_end_p (si); bsi_next (&si))
- {
- node = bsi_stmt (si);
- if (node && EXPR_P (node) && EXPR_LOCUS (node))
- break;
- }
-
- if (node && EXPR_P (node) && EXPR_LOCUS (node)
- && EXPR_FILENAME (node) && EXPR_LINENO (node))
- {
- fprintf (dump_file, "\nloop at %s:%d: ",
- EXPR_FILENAME (node), EXPR_LINENO (node));
- return true;
- }
+ if (loc == UNKNOWN_LOC)
+ fprintf (dump_file, "\n");
+ else
+ fprintf (dump_file, "\nloop at %s:%d: ",
+ LOC_FILE (loc), LOC_LINE (loc));
- return false;
+ return true;
}
For vectorization debug dumps. */
static bool
-vect_debug_details (struct loop *loop)
+vect_debug_details (LOC loc)
{
- basic_block bb;
- block_stmt_iterator si;
- tree node = NULL_TREE;
-
if (!dump_file || !(dump_flags & TDF_DETAILS))
return false;
-
- if (!loop)
- {
- fprintf (dump_file, "\n");
- return true;
- }
-
- if (!loop->header)
- return false;
-
- bb = loop->header;
-
- for (si = bsi_start (bb); !bsi_end_p (si); bsi_next (&si))
- {
- node = bsi_stmt (si);
- if (node && EXPR_P (node) && EXPR_LOCUS (node))
- break;
- }
-
- if (node && EXPR_P (node) && EXPR_LOCUS (node)
- && EXPR_FILENAME (node) && EXPR_LINENO (node))
- {
- fprintf (dump_file, "\nloop at %s:%d: ",
- EXPR_FILENAME (node), EXPR_LINENO (node));
- return true;
- }
-
- return false;
+
+ if (loc == UNKNOWN_LOC)
+ fprintf (dump_file, "\n");
+ else
+ fprintf (dump_file, "\nloop at %s:%d: ",
+ LOC_FILE (loc), LOC_LINE (loc));
+
+ return true;
}
if (!BINARY_CLASS_P (expr))
{
/* We expect to get binary expressions (PLUS/MINUS and MULT). */
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
fprintf (dump_file, "Not binary expression ");
print_generic_expr (dump_file, expr, TDF_SLIM);
/* Check that there is no remainder in bits. */
if (pbitpos%BITS_PER_UNIT)
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "bit offset alignment.");
return NULL_TREE;
}
*initial_offset = size_binop (PLUS_EXPR, *initial_offset, this_offset);
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
print_generic_expr (dump_file, expr, TDF_SLIM);
fprintf (dump_file, "\n --> total offset for ref: ");
TREE_OPERAND (vec_stmt, 0) = new_temp;
append_to_statement_list_force (vec_stmt, new_stmt_list);
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
fprintf (dump_file, "created ");
print_generic_expr (dump_file, vec_stmt, TDF_SLIM);
nunits = UNITS_PER_SIMD_WORD / nbytes;
vectype = build_vector_type (scalar_type, nunits);
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
fprintf (dump_file, "get vectype with %d units of type ", nunits);
print_generic_expr (dump_file, scalar_type, TDF_SLIM);
if (!vectype)
return NULL_TREE;
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
fprintf (dump_file, "vectype: ");
print_generic_expr (dump_file, vectype, TDF_SLIM);
/* TODO: tree-complex.c sometimes can parallelize operations
on generic vectors. We can vectorize the loop in that case,
but then we should re-run the lowering pass. */
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "mode not supported by target.");
return NULL_TREE;
}
tree type, tmp, size;
base_name = unshare_expr (DR_BASE_NAME (dr));
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
tree data_ref_base = base_name;
fprintf (dump_file, "create array_ref of type: ");
new_bb = bsi_insert_on_edge_immediate (pe, init_stmt);
gcc_assert (!new_bb);
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
fprintf (dump_file, "created new init_stmt: ");
print_generic_expr (dump_file, init_stmt, TDF_SLIM);
tree def;
int i;
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
fprintf (dump_file, "vect_get_vec_def_for_operand: ");
print_generic_expr (dump_file, op, TDF_SLIM);
tree vec_cst;
/* Build a tree with vector elements. */
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "Create vector_cst. nunits = %d", nunits);
for (i = nunits - 1; i >= 0; --i)
def_stmt = SSA_NAME_DEF_STMT (op);
def_stmt_info = vinfo_for_stmt (def_stmt);
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
fprintf (dump_file, "vect_get_vec_def_for_operand: def_stmt: ");
print_generic_expr (dump_file, def_stmt, TDF_SLIM);
bb = bb_for_stmt (def_stmt);
if (TREE_CODE (def_stmt) == PHI_NODE && flow_bb_inside_loop_p (loop, bb))
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "reduction/induction - unsupported.");
internal_error ("no support for reduction/induction"); /* FORNOW */
}
def = op;
break;
default:
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
fprintf (dump_file, "unsupported defining stmt: ");
print_generic_expr (dump_file, def_stmt, TDF_SLIM);
/* Build a tree with vector elements. Create 'vec_inv = {inv,inv,..,inv}' */
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "Create vector_inv.");
for (i = nunits - 1; i >= 0; --i)
{
bsi_insert_before (bsi, vec_stmt, BSI_SAME_STMT);
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
fprintf (dump_file, "add new stmt: ");
print_generic_expr (dump_file, vec_stmt, TDF_SLIM);
op = TREE_OPERAND (stmt, 1);
if (!vect_is_simple_use (op, loop_vinfo, NULL))
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "use not simple.");
return false;
}
}
/** Transform. **/
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "transform assignment.");
/* Handle def. */
op_type = TREE_CODE_LENGTH (code);
if (op_type != unary_op && op_type != binary_op)
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "num. args = %d (not unary/binary op).", op_type);
return false;
}
op = TREE_OPERAND (operation, i);
if (!vect_is_simple_use (op, loop_vinfo, NULL))
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "use not simple.");
return false;
}
/* Supportable by target? */
if (!optab)
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "no optab.");
return false;
}
vec_mode = TYPE_MODE (vectype);
if (optab->handlers[(int) vec_mode].insn_code == CODE_FOR_nothing)
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "op not supported by target.");
return false;
}
/** Transform. **/
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "transform binary/unary operation.");
/* Handle def. */
op = TREE_OPERAND (stmt, 1);
if (!vect_is_simple_use (op, loop_vinfo, NULL))
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "use not simple.");
return false;
}
/** Transform. **/
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "transform store");
alignment_support_cheme = vect_supportable_dr_alignment (dr);
(e.g. - data copies). */
if (mov_optab->handlers[mode].insn_code == CODE_FOR_nothing)
{
- if (vect_debug_details (loop))
+ if (vect_debug_details (LOOP_LOC (loop_vinfo)))
fprintf (dump_file, "Aligned load, but unsupported type.");
return false;
}
/** Transform. **/
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "transform load.");
alignment_support_cheme = vect_supportable_dr_alignment (dr);
is_store = true;
break;
default:
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "stmt not supported.");
gcc_unreachable ();
}
/* Skip virtual phi's. */
if (!is_gimple_reg (SSA_NAME_VAR (PHI_RESULT (phi))))
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "virtual phi. skip.");
continue;
}
int loop_num;
#endif
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "\n<<vect_transtorm_for_unknown_loop_bound>>\n");
/* Generate the following variables on the preheader of original loop:
tree n_iters;
struct loop *new_loop;
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "\n<<vect_do_peeling_for_alignment>>\n");
ni_name = vect_build_loop_niters (loop_vinfo);
tree ratio = NULL;
int vectorization_factor = LOOP_VINFO_VECT_FACTOR (loop_vinfo);
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "\n<<vec_transform_loop>>\n");
stmt_vec_info stmt_info;
bool is_store;
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
fprintf (dump_file, "------>vectorizing statement: ");
print_generic_expr (dump_file, stmt, TDF_SLIM);
== vectorization_factor);
#endif
/* -------- vectorize statement ------------ */
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "transform statement.");
is_store = vect_transform_stmt (stmt, &si);
slpeel_make_loop_iterate_ntimes (loop, ratio);
- if (vect_debug_details (loop))
+ if (vect_debug_details (LOOP_LOC (loop_vinfo)))
fprintf (dump_file,"Success! loop vectorized.");
- if (vect_debug_stats (loop))
+ if (vect_debug_stats (LOOP_LOC (loop_vinfo)))
fprintf (dump_file, "LOOP VECTORIZED.");
}
def_stmt = SSA_NAME_DEF_STMT (operand);
if (def_stmt == NULL_TREE )
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "no def_stmt.");
return false;
}
tree arg = TREE_OPERAND (def_stmt, 0);
if (TREE_CODE (arg) == INTEGER_CST || TREE_CODE (arg) == REAL_CST)
return true;
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
fprintf (dump_file, "Unexpected empty stmt: ");
print_generic_expr (dump_file, def_stmt, TDF_SLIM);
bb = bb_for_stmt (def_stmt);
if (TREE_CODE (def_stmt) == PHI_NODE && flow_bb_inside_loop_p (loop, bb))
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "reduction/induction - unsupported.");
return false; /* FORNOW: not supported yet. */
}
bool ok;
tree scalar_type;
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "\n<<vect_analyze_operations>>\n");
for (i = 0; i < nbbs; i++)
stmt_vec_info stmt_info = vinfo_for_stmt (stmt);
tree vectype;
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
fprintf (dump_file, "==> examining statement: ");
print_generic_expr (dump_file, stmt, TDF_SLIM);
if (!STMT_VINFO_RELEVANT_P (stmt_info))
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "irrelevant.");
continue;
}
if (VECTOR_MODE_P (TYPE_MODE (TREE_TYPE (stmt))))
{
- if (vect_debug_stats (loop) || vect_debug_details (loop))
+ if (vect_debug_stats (LOOP_LOC (loop_vinfo))
+ || vect_debug_details (LOOP_LOC (loop_vinfo)))
{
fprintf (dump_file, "not vectorized: vector stmt in loop:");
print_generic_expr (dump_file, stmt, TDF_SLIM);
else
scalar_type = TREE_TYPE (stmt);
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
fprintf (dump_file, "get vectype for scalar type: ");
print_generic_expr (dump_file, scalar_type, TDF_SLIM);
vectype = get_vectype_for_scalar_type (scalar_type);
if (!vectype)
{
- if (vect_debug_stats (loop) || vect_debug_details (loop))
+ if (vect_debug_stats (LOOP_LOC (loop_vinfo))
+ || vect_debug_details (LOOP_LOC (loop_vinfo)))
{
fprintf (dump_file, "not vectorized: unsupported data-type ");
print_generic_expr (dump_file, scalar_type, TDF_SLIM);
return false;
}
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
fprintf (dump_file, "vectype: ");
print_generic_expr (dump_file, vectype, TDF_SLIM);
if (!ok)
{
- if (vect_debug_stats (loop) || vect_debug_details (loop))
+ if (vect_debug_stats (LOOP_LOC (loop_vinfo))
+ || vect_debug_details (LOOP_LOC (loop_vinfo)))
{
fprintf (dump_file, "not vectorized: stmt not supported: ");
print_generic_expr (dump_file, stmt, TDF_SLIM);
}
nunits = GET_MODE_NUNITS (TYPE_MODE (vectype));
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "nunits = %d", nunits);
if (vectorization_factor)
This restriction will be relaxed in the future. */
if (nunits != vectorization_factor)
{
- if (vect_debug_stats (loop) || vect_debug_details (loop))
+ if (vect_debug_stats (LOOP_LOC (loop_vinfo))
+ || vect_debug_details (LOOP_LOC (loop_vinfo)))
fprintf (dump_file, "not vectorized: mixed data-types");
return false;
}
if (vectorization_factor <= 1)
{
- if (vect_debug_stats (loop) || vect_debug_details (loop))
+ if (vect_debug_stats (LOOP_LOC (loop_vinfo))
+ || vect_debug_details (LOOP_LOC (loop_vinfo)))
fprintf (dump_file, "not vectorized: unsupported data-type");
return false;
}
LOOP_VINFO_VECT_FACTOR (loop_vinfo) = vectorization_factor;
- if (LOOP_VINFO_NITERS_KNOWN_P (loop_vinfo) && vect_debug_details (NULL))
+ if (LOOP_VINFO_NITERS_KNOWN_P (loop_vinfo)
+ && vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file,
"vectorization_factor = %d, niters = " HOST_WIDE_INT_PRINT_DEC,
vectorization_factor, LOOP_VINFO_INT_NITERS (loop_vinfo));
if (LOOP_VINFO_NITERS_KNOWN_P (loop_vinfo)
&& LOOP_VINFO_INT_NITERS (loop_vinfo) < vectorization_factor)
{
- if (vect_debug_stats (loop) || vect_debug_details (loop))
+ if (vect_debug_stats (LOOP_LOC (loop_vinfo))
+ || vect_debug_details (LOOP_LOC (loop_vinfo)))
fprintf (dump_file, "not vectorized: iteration count too small.");
return false;
}
if (!LOOP_VINFO_NITERS_KNOWN_P (loop_vinfo)
|| LOOP_VINFO_INT_NITERS (loop_vinfo) % vectorization_factor != 0)
{
- if (vect_debug_stats (loop) || vect_debug_details (loop))
+ if (vect_debug_stats (LOOP_LOC (loop_vinfo))
+ || vect_debug_details (LOOP_LOC (loop_vinfo)))
fprintf (dump_file, "epilog loop required.");
if (!vect_can_advance_ivs_p (loop_vinfo))
{
- if (vect_debug_stats (loop) || vect_debug_details (loop))
+ if (vect_debug_stats (LOOP_LOC (loop_vinfo))
+ || vect_debug_details (LOOP_LOC (loop_vinfo)))
fprintf (dump_file, "not vectorized: can't create epilog loop 1.");
return false;
}
if (!slpeel_can_duplicate_loop_p (loop, loop->exit_edges[0]))
{
- if (vect_debug_stats (loop) || vect_debug_details (loop))
+ if (vect_debug_stats (LOOP_LOC (loop_vinfo))
+ || vect_debug_details (LOOP_LOC (loop_vinfo)))
fprintf (dump_file, "not vectorized: can't create epilog loop 2.");
return false;
}
step_expr = evolution_part;
init_expr = unshare_expr (initial_condition_in_loop_num (access_fn, loop_nb));
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
fprintf (dump_file, "step: ");
print_generic_expr (dump_file, step_expr, TDF_SLIM);
if (TREE_CODE (step_expr) != INTEGER_CST)
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "step unknown.");
return false;
}
if (strict)
if (!integer_onep (step_expr))
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
print_generic_expr (dump_file, step_expr, TDF_SLIM);
return false;
}
basic_block bb = loop->header;
tree dummy;
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "\n<<vect_analyze_scalar_cycles>>\n");
for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
{
tree access_fn = NULL;
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
fprintf (dump_file, "Analyze phi: ");
print_generic_expr (dump_file, phi, TDF_SLIM);
if (!is_gimple_reg (SSA_NAME_VAR (PHI_RESULT (phi))))
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "virtual phi. skip.");
continue;
}
if (!access_fn)
{
- if (vect_debug_stats (loop) || vect_debug_details (loop))
+ if (vect_debug_stats (LOOP_LOC (loop_vinfo))
+ || vect_debug_details (LOOP_LOC (loop_vinfo)))
fprintf (dump_file, "not vectorized: unsupported scalar cycle.");
return false;
}
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
fprintf (dump_file, "Access function of PHI: ");
print_generic_expr (dump_file, access_fn, TDF_SLIM);
if (!vect_is_simple_iv_evolution (loop->num, access_fn, &dummy,
&dummy, false))
{
- if (vect_debug_stats (loop) || vect_debug_details (loop))
+ if (vect_debug_stats (LOOP_LOC (loop_vinfo))
+ || vect_debug_details (LOOP_LOC (loop_vinfo)))
fprintf (dump_file, "not vectorized: unsupported scalar cycle.");
return false;
}
{
bool differ_p;
struct data_dependence_relation *ddr;
- struct loop *loop = LOOP_VINFO_LOOP (loop_vinfo);
if (!array_base_name_differ_p (dra, drb, &differ_p))
{
- if (vect_debug_stats (loop) || vect_debug_details (loop))
+ if (vect_debug_stats (LOOP_LOC (loop_vinfo))
+ || vect_debug_details (LOOP_LOC (loop_vinfo)))
{
fprintf (dump_file,
"not vectorized: can't determine dependence between: ");
if (DDR_ARE_DEPENDENT (ddr) == chrec_known)
return false;
- if (vect_debug_stats (loop) || vect_debug_details (loop))
+ if (vect_debug_stats (LOOP_LOC (loop_vinfo))
+ || vect_debug_details (LOOP_LOC (loop_vinfo)))
{
fprintf (dump_file,
"not vectorized: possible dependence between data-refs ");
/* Examine store-store (output) dependences. */
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "\n<<vect_analyze_dependences>>\n");
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "compare all store-store pairs.");
for (i = 0; i < VARRAY_ACTIVE_SIZE (loop_write_refs); i++)
/* Examine load-store (true/anti) dependences. */
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "compare all load-store pairs.");
for (i = 0; i < VARRAY_ACTIVE_SIZE (loop_read_refs); i++)
bool base_aligned_p;
tree misalign;
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "vect_compute_data_ref_alignment:");
/* Initialize misalignment to unknown. */
if (!misalign)
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
fprintf (dump_file, "Unknown alignment for access: ");
print_generic_expr (dump_file, base, TDF_SLIM);
{
if (!vect_can_force_dr_alignment_p (base, TYPE_ALIGN (vectype)))
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
fprintf (dump_file, "can't force alignment of ref: ");
print_generic_expr (dump_file, ref, TDF_SLIM);
/* Force the alignment of the decl.
NOTE: This is the only change to the code we make during
the analysis phase, before deciding to vectorize the loop. */
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "force alignment");
DECL_ALIGN (base) = TYPE_ALIGN (vectype);
DECL_USER_ALIGN (base) = 1;
if (tree_int_cst_sgn (misalign) < 0)
{
/* Negative misalignment value. */
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "unexpected misalign value");
return false;
}
DR_MISALIGNMENT (dr) = tree_low_cst (misalign, 1);
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "misalign = %d", DR_MISALIGNMENT (dr));
return true;
{
varray_type loop_read_datarefs = LOOP_VINFO_DATAREF_READS (loop_vinfo);
varray_type loop_write_datarefs = LOOP_VINFO_DATAREF_WRITES (loop_vinfo);
- struct loop *loop = LOOP_VINFO_LOOP (loop_vinfo);
unsigned int i;
/*
if (!LOOP_VINFO_UNALIGNED_DR (loop_vinfo))
{
- if (vect_debug_details (loop))
+ if (vect_debug_details (LOOP_LOC (loop_vinfo)))
fprintf (dump_file, "Peeling for alignment will not be applied.");
return;
}
else
- if (vect_debug_details (loop))
+ if (vect_debug_details (LOOP_LOC (loop_vinfo)))
fprintf (dump_file, "Peeling for alignment will be applied.");
if (dr == LOOP_VINFO_UNALIGNED_DR (loop_vinfo))
{
DR_MISALIGNMENT (dr) = 0;
- if (vect_debug_details (loop) || vect_debug_stats (loop))
+ if (vect_debug_details (LOOP_LOC (loop_vinfo))
+ || vect_debug_stats (LOOP_LOC (loop_vinfo)))
fprintf (dump_file, "Alignment of access forced using peeling.");
}
else
if (dr == LOOP_VINFO_UNALIGNED_DR (loop_vinfo))
{
DR_MISALIGNMENT (dr) = 0;
- if (vect_debug_details (loop) || vect_debug_stats (loop))
+ if (vect_debug_details (LOOP_LOC (loop_vinfo))
+ || vect_debug_stats (LOOP_LOC (loop_vinfo)))
fprintf (dump_file, "Alignment of access forced using peeling.");
}
else
{
varray_type loop_read_datarefs = LOOP_VINFO_DATAREF_READS (loop_vinfo);
varray_type loop_write_datarefs = LOOP_VINFO_DATAREF_WRITES (loop_vinfo);
- struct loop *loop = LOOP_VINFO_LOOP (loop_vinfo);
enum dr_alignment_support supportable_dr_alignment;
unsigned int i;
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "\n<<vect_analyze_data_refs_alignment>>\n");
if (!vect_compute_data_refs_alignment (loop_vinfo))
{
- if (vect_debug_details (loop) || vect_debug_stats (loop))
+ if (vect_debug_details (LOOP_LOC (loop_vinfo))
+ || vect_debug_stats (LOOP_LOC (loop_vinfo)))
fprintf (dump_file,
"not vectorized: can't calculate alignment for data ref.");
return false;
supportable_dr_alignment = vect_supportable_dr_alignment (dr);
if (!supportable_dr_alignment)
{
- if (vect_debug_details (loop) || vect_debug_stats (loop))
+ if (vect_debug_details (LOOP_LOC (loop_vinfo))
+ || vect_debug_stats (LOOP_LOC (loop_vinfo)))
fprintf (dump_file, "not vectorized: unsupported unaligned load.");
return false;
}
if (supportable_dr_alignment != dr_aligned
- && (vect_debug_details (loop) || vect_debug_stats (loop)))
+ && (vect_debug_details (LOOP_LOC (loop_vinfo))
+ || vect_debug_stats (LOOP_LOC (loop_vinfo))))
fprintf (dump_file, "Vectorizing an unaligned access.");
}
for (i = 0; i < VARRAY_ACTIVE_SIZE (loop_write_datarefs); i++)
supportable_dr_alignment = vect_supportable_dr_alignment (dr);
if (!supportable_dr_alignment)
{
- if (vect_debug_details (loop) || vect_debug_stats (loop))
+ if (vect_debug_details (LOOP_LOC (loop_vinfo))
+ || vect_debug_stats (LOOP_LOC (loop_vinfo)))
fprintf (dump_file, "not vectorized: unsupported unaligned store.");
return false;
}
if (supportable_dr_alignment != dr_aligned
- && (vect_debug_details (loop) || vect_debug_stats (loop)))
+ && (vect_debug_details (LOOP_LOC (loop_vinfo))
+ || vect_debug_stats (LOOP_LOC (loop_vinfo))))
fprintf (dump_file, "Vectorizing an unaligned access.");
}
if (!step || tree_int_cst_compare (step, TYPE_SIZE_UNIT (scalar_type)))
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "not consecutive access");
return false;
}
varray_type loop_write_datarefs = LOOP_VINFO_DATAREF_WRITES (loop_vinfo);
varray_type loop_read_datarefs = LOOP_VINFO_DATAREF_READS (loop_vinfo);
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "\n<<vect_analyze_data_ref_accesses>>\n");
for (i = 0; i < VARRAY_ACTIVE_SIZE (loop_write_datarefs); i++)
bool ok = vect_analyze_data_ref_access (dr);
if (!ok)
{
- if (vect_debug_stats (LOOP_VINFO_LOOP (loop_vinfo))
- || vect_debug_details (LOOP_VINFO_LOOP (loop_vinfo)))
+ if (vect_debug_stats (LOOP_LOC (loop_vinfo))
+ || vect_debug_details (LOOP_LOC (loop_vinfo)))
fprintf (dump_file, "not vectorized: complicated access pattern.");
return false;
}
bool ok = vect_analyze_data_ref_access (dr);
if (!ok)
{
- if (vect_debug_stats (LOOP_VINFO_LOOP (loop_vinfo))
- || vect_debug_details (LOOP_VINFO_LOOP (loop_vinfo)))
+ if (vect_debug_stats (LOOP_LOC (loop_vinfo))
+ || vect_debug_details (LOOP_LOC (loop_vinfo)))
fprintf (dump_file, "not vectorized: complicated access pattern.");
return false;
}
if (!access_fn)
{
- if (vect_debug_stats (loop) || vect_debug_details (loop))
+ if (vect_debug_stats (LOOP_LOC (loop_vinfo))
+ || vect_debug_details (LOOP_LOC (loop_vinfo)))
fprintf (dump_file, "not vectorized: complicated pointer access.");
return NULL;
}
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
fprintf (dump_file, "Access function of ptr: ");
print_generic_expr (dump_file, access_fn, TDF_SLIM);
if (!vect_is_simple_iv_evolution (loopnum, access_fn, &init, &step, false))
{
- if (vect_debug_stats (loop) || vect_debug_details (loop))
+ if (vect_debug_stats (LOOP_LOC (loop_vinfo))
+ || vect_debug_details (LOOP_LOC (loop_vinfo)))
fprintf (dump_file, "not vectorized: pointer access is not simple.");
return NULL;
}
if (!expr_invariant_in_loop_p (loop, init))
{
- if (vect_debug_stats (loop) || vect_debug_details (loop))
+ if (vect_debug_stats (LOOP_LOC (loop_vinfo))
+ || vect_debug_details (LOOP_LOC (loop_vinfo)))
fprintf (dump_file,
"not vectorized: initial condition is not loop invariant.");
return NULL;
if (TREE_CODE (step) != INTEGER_CST)
{
- if (vect_debug_stats (loop) || vect_debug_details (loop))
+ if (vect_debug_stats (LOOP_LOC (loop_vinfo))
+ || vect_debug_details (LOOP_LOC (loop_vinfo)))
fprintf (dump_file,
"not vectorized: non constant step for pointer access.");
return NULL;
reftype = TREE_TYPE (TREE_OPERAND (memref, 0));
if (TREE_CODE (reftype) != POINTER_TYPE)
{
- if (vect_debug_stats (loop) || vect_debug_details (loop))
+ if (vect_debug_stats (LOOP_LOC (loop_vinfo))
+ || vect_debug_details (LOOP_LOC (loop_vinfo)))
fprintf (dump_file, "not vectorized: unexpected pointer access form.");
return NULL;
}
reftype = TREE_TYPE (init);
if (TREE_CODE (reftype) != POINTER_TYPE)
{
- if (vect_debug_stats (loop) || vect_debug_details (loop))
+ if (vect_debug_stats (LOOP_LOC (loop_vinfo))
+ || vect_debug_details (LOOP_LOC (loop_vinfo)))
fprintf (dump_file, "not vectorized: unexpected pointer access form.");
return NULL;
}
if (tree_int_cst_compare (TYPE_SIZE_UNIT (innertype), step))
{
/* FORNOW: support only consecutive access */
- if (vect_debug_stats (loop) || vect_debug_details (loop))
+ if (vect_debug_stats (LOOP_LOC (loop_vinfo))
+ || vect_debug_details (LOOP_LOC (loop_vinfo)))
fprintf (dump_file, "not vectorized: non consecutive access.");
return NULL;
}
indx_access_fn =
build_polynomial_chrec (loopnum, integer_zero_node, integer_one_node);
- if (vect_debug_details (NULL))
+ if (vect_debug_details (LOOP_LOC (loop_vinfo)))
{
fprintf (dump_file, "Access function of ptr indx: ");
print_generic_expr (dump_file, indx_access_fn, TDF_SLIM);
}
if (!tag)
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "not vectorized: no memtag for ref.");
return NULL_TREE;
}
int j;
struct data_reference *dr;
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "\n<<vect_analyze_data_refs>>\n");
for (j = 0; j < nbbs; j++)
if (nvuses && (nv_may_defs || nv_must_defs))
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
fprintf (dump_file, "unexpected vdefs and vuses in stmt: ");
print_generic_expr (dump_file, stmt, TDF_SLIM);
if (TREE_CODE (stmt) != MODIFY_EXPR)
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
fprintf (dump_file, "unexpected vops in stmt: ");
print_generic_expr (dump_file, stmt, TDF_SLIM);
vectype = get_vectype_for_scalar_type (scalar_type);
if (!vectype)
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
fprintf (dump_file, "no vectype for stmt: ");
print_generic_expr (dump_file, stmt, TDF_SLIM);
vectype, &dr);
if (!symbl)
{
- if (vect_debug_stats (loop) || vect_debug_details (loop))
+ if (vect_debug_stats (LOOP_LOC (loop_vinfo))
+ || vect_debug_details (LOOP_LOC (loop_vinfo)))
{
fprintf (dump_file, "not vectorized: unhandled data ref: ");
print_generic_expr (dump_file, stmt, TDF_SLIM);
{
stmt_vec_info stmt_info;
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "mark relevant.");
if (TREE_CODE (stmt) == PHI_NODE)
if (!stmt_info)
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
fprintf (dump_file, "mark relevant: no stmt info!!.");
print_generic_expr (dump_file, stmt, TDF_SLIM);
if (STMT_VINFO_RELEVANT_P (stmt_info))
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "already marked relevant.");
return;
}
v_must_defs = STMT_V_MUST_DEF_OPS (stmt);
if (v_may_defs || v_must_defs)
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "vec_stmt_relevant_p: stmt has vdefs.");
return true;
}
basic_block bb = bb_for_stmt (use);
if (!flow_bb_inside_loop_p (loop, bb))
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "vec_stmt_relevant_p: used out of loop.");
return true;
}
basic_block bb;
tree phi;
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "\n<<vect_mark_stmts_to_be_vectorized>>\n");
bb = loop->header;
for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
fprintf (dump_file, "init: phi relevant? ");
print_generic_expr (dump_file, phi, TDF_SLIM);
if (vect_stmt_relevant_p (phi, loop_vinfo))
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "unsupported reduction/induction.");
return false;
}
{
stmt = bsi_stmt (si);
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
fprintf (dump_file, "init: stmt relevant? ");
print_generic_expr (dump_file, stmt, TDF_SLIM);
stmt = VARRAY_TOP_TREE (worklist);
VARRAY_POP (worklist);
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
fprintf (dump_file, "worklist: examine stmt: ");
print_generic_expr (dump_file, stmt, TDF_SLIM);
basic_block bb;
if (!vect_is_simple_use (arg, loop_vinfo, &def_stmt))
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "worklist: unsupported use.");
varray_clear (worklist);
return false;
if (!def_stmt)
continue;
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
fprintf (dump_file, "worklist: def_stmt: ");
print_generic_expr (dump_file, def_stmt, TDF_SLIM);
basic_block bb;
if (!vect_is_simple_use (use, loop_vinfo, &def_stmt))
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "worklist: unsupported use.");
varray_clear (worklist);
return false;
if (!def_stmt)
continue;
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
fprintf (dump_file, "worklist: examine use %d: ", i);
print_generic_expr (dump_file, use, TDF_SLIM);
tree access_fn = NULL;
tree evolution_part;
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
fprintf (dump_file, "Analyze phi: ");
print_generic_expr (dump_file, phi, TDF_SLIM);
if (!is_gimple_reg (SSA_NAME_VAR (PHI_RESULT (phi))))
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "virtual phi. skip.");
continue;
}
if (!access_fn)
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "No Access function.");
return false;
}
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
fprintf (dump_file, "Access function of PHI: ");
print_generic_expr (dump_file, access_fn, TDF_SLIM);
{
tree niters;
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "\n<<get_loop_niters>>\n");
niters = number_of_iterations_in_loop (loop);
{
*number_of_iterations = niters;
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
{
fprintf (dump_file, "==> get_loop_niters:" );
print_generic_expr (dump_file, *number_of_iterations, TDF_SLIM);
tree loop_cond;
tree number_of_iterations = NULL;
bool rescan = false;
+ LOC loop_loc;
+
+ loop_loc = find_loop_location (loop);
- if (vect_debug_details (loop))
+ if (vect_debug_details (loop_loc))
fprintf (dump_file, "\n<<vect_analyze_loop_form>>\n");
if (loop->inner
|| EDGE_COUNT (loop->header->preds) != 2
|| loop->num_entries != 1)
{
- if (vect_debug_stats (loop) || vect_debug_details (loop))
+ if (vect_debug_stats (loop_loc) || vect_debug_details (loop_loc))
{
fprintf (dump_file, "not vectorized: bad loop form. ");
if (loop->inner)
executable statements, and the latch is empty. */
if (!empty_block_p (loop->latch))
{
- if (vect_debug_stats (loop) || vect_debug_details (loop))
+ if (vect_debug_stats (loop_loc) || vect_debug_details (loop_loc))
fprintf (dump_file, "not vectorized: unexpectd loop form.");
return NULL;
}
if (empty_block_p (loop->header))
{
- if (vect_debug_stats (loop) || vect_debug_details (loop))
+ if (vect_debug_stats (loop_loc) || vect_debug_details (loop_loc))
fprintf (dump_file, "not vectorized: empty loop.");
return NULL;
}
loop_cond = vect_get_loop_niters (loop, &number_of_iterations);
if (!loop_cond)
{
- if (vect_debug_stats (loop) || vect_debug_details (loop))
+ if (vect_debug_stats (loop_loc) || vect_debug_details (loop_loc))
fprintf (dump_file, "not vectorized: complicated exit condition.");
return NULL;
}
if (!number_of_iterations)
{
- if (vect_debug_stats (loop) || vect_debug_details (loop))
+ if (vect_debug_stats (loop_loc) || vect_debug_details (loop_loc))
fprintf (dump_file,
"not vectorized: number of iterations cannot be computed.");
return NULL;
if (chrec_contains_undetermined (number_of_iterations))
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (loop_loc))
fprintf (dump_file, "Infinite number of iterations.");
return false;
}
if (!LOOP_VINFO_NITERS_KNOWN_P (loop_vinfo))
{
- if (vect_debug_details (loop))
+ if (vect_debug_details (loop_loc))
{
fprintf (dump_file, "loop bound unknown.\n");
fprintf (dump_file, "Symbolic number of iterations is ");
else
if (LOOP_VINFO_INT_NITERS (loop_vinfo) == 0)
{
- if (vect_debug_stats (loop) || vect_debug_details (loop))
- fprintf (dump_file, "not vectorized: number of iterations = 0.");
+ if (vect_debug_stats (loop_loc) || vect_debug_details (loop_loc))
+ fprintf (dump_file, "not vectorized: number of iterations = 0.");
return NULL;
}
LOOP_VINFO_EXIT_COND (loop_vinfo) = loop_cond;
+ LOOP_VINFO_LOC (loop_vinfo) = loop_loc;
return loop_vinfo;
}
bool ok;
loop_vec_info loop_vinfo;
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "\n<<<<<<< analyze_loop_nest >>>>>>>\n");
/* Check the CFG characteristics of the loop (nesting, entry/exit, etc. */
loop_vinfo = vect_analyze_loop_form (loop);
if (!loop_vinfo)
{
- if (vect_debug_details (loop))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "bad loop form.");
return NULL;
}
ok = vect_analyze_data_refs (loop_vinfo);
if (!ok)
{
- if (vect_debug_details (loop))
+ if (vect_debug_details (LOOP_LOC (loop_vinfo)))
fprintf (dump_file, "bad data references.");
destroy_loop_vec_info (loop_vinfo);
return NULL;
ok = vect_mark_stmts_to_be_vectorized (loop_vinfo);
if (!ok)
{
- if (vect_debug_details (loop))
+ if (vect_debug_details (LOOP_LOC (loop_vinfo)))
fprintf (dump_file, "unexpected pattern.");
- if (vect_debug_details (loop))
+ if (vect_debug_stats (LOOP_LOC (loop_vinfo)))
fprintf (dump_file, "not vectorized: unexpected pattern.");
destroy_loop_vec_info (loop_vinfo);
return NULL;
ok = vect_analyze_scalar_cycles (loop_vinfo);
if (!ok)
{
- if (vect_debug_details (loop))
+ if (vect_debug_details (LOOP_LOC (loop_vinfo)))
fprintf (dump_file, "bad scalar cycle.");
destroy_loop_vec_info (loop_vinfo);
return NULL;
ok = vect_analyze_data_ref_dependences (loop_vinfo);
if (!ok)
{
- if (vect_debug_details (loop))
+ if (vect_debug_details (LOOP_LOC (loop_vinfo)))
fprintf (dump_file, "bad data dependence.");
destroy_loop_vec_info (loop_vinfo);
return NULL;
ok = vect_analyze_data_ref_accesses (loop_vinfo);
if (!ok)
{
- if (vect_debug_details (loop))
+ if (vect_debug_details (LOOP_LOC (loop_vinfo)))
fprintf (dump_file, "bad data access.");
destroy_loop_vec_info (loop_vinfo);
return NULL;
ok = vect_analyze_data_refs_alignment (loop_vinfo);
if (!ok)
{
- if (vect_debug_details (loop))
+ if (vect_debug_details (LOOP_LOC (loop_vinfo)))
fprintf (dump_file, "bad data alignment.");
destroy_loop_vec_info (loop_vinfo);
return NULL;
ok = vect_analyze_operations (loop_vinfo);
if (!ok)
{
- if (vect_debug_details (loop))
+ if (vect_debug_details (LOOP_LOC (loop_vinfo)))
fprintf (dump_file, "bad operation or unsupported loop bound.");
destroy_loop_vec_info (loop_vinfo);
return NULL;
/* FORNOW: until more sophisticated machine modelling is in place. */
if (!UNITS_PER_SIMD_WORD)
{
- if (vect_debug_details (NULL))
+ if (vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "vectorizer: target vector size is not defined.");
return;
}
num_vectorized_loops++;
}
- if (vect_debug_stats (NULL) || vect_debug_details (NULL))
+ if (vect_debug_stats (UNKNOWN_LOC) || vect_debug_details (UNKNOWN_LOC))
fprintf (dump_file, "\nvectorized %u loops in function.\n",
num_vectorized_loops);