+2011-11-24 Razya Ladelsky <razya@il.ibm.com>
+
+ * tree-data-ref.c (initialize_data_dependence_relation): Update
+ comment for the self dependence case.
+ (compute_self_dependence): Remove.
+ * tree-vect-data-refs.c (vect_analyze_data_refs): Remove call to
+ compute_self_dependenc.
2011-11-24 Alan Modra <amodra@gmail.com>
* c-decl.c (warn_if_shadowing): Don't warn if shadowed
return res;
}
- /* When the references are exactly the same, don't spend time doing
- the data dependence tests, just initialize the ddr and return. */
+ /* The case where the references are exactly the same. */
if (operand_equal_p (DR_REF (a), DR_REF (b), 0))
{
if (loop_nest
fprintf (dump_file, ")\n");
}
-/* This computes the dependence relation for the same data
- reference into DDR. */
-
-void
-compute_self_dependence (struct data_dependence_relation *ddr)
-{
- if (DDR_ARE_DEPENDENT (ddr) != NULL_TREE)
- return;
-
- if (DDR_LOOP_NEST (ddr))
- compute_affine_dependence (ddr, VEC_index (loop_p, DDR_LOOP_NEST (ddr), 0));
-}
-
/* Compute in DEPENDENCE_RELATIONS the data dependence graph for all
the data references in DATAREFS, in the LOOP_NEST. When
COMPUTE_SELF_AND_RR is FALSE, don't compute read-read and self
ddr = VEC_index (ddr_p, ddrs, k);
gcc_assert (DDR_A (ddr) == olddr && DDR_B (ddr) == olddr);
newddr = initialize_data_dependence_relation (dr, dr, nest);
- compute_self_dependence (newddr);
VEC_replace (ddr_p, ddrs, k, newddr);
free_dependence_relation (ddr);
VEC_replace (data_reference_p, datarefs, i, dr);