From e0cf06e1bf07470375705fb2809bea842c7a36fa Mon Sep 17 00:00:00 2001 From: spop Date: Wed, 17 May 2006 12:47:43 +0000 Subject: [PATCH] PR middle-end/27332 * tree-loop-linear.c (try_interchange_loops): Test for no data dependences. git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@113856 138bc75d-0d04-0410-961f-82ee72b054a4 --- gcc/ChangeLog | 6 ++++++ gcc/tree-loop-linear.c | 3 +++ 2 files changed, 9 insertions(+) diff --git a/gcc/ChangeLog b/gcc/ChangeLog index ca43a0e6eaf..4ecc27a6513 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,9 @@ +2006-05-17 Sebastian Pop + + PR middle-end/27332 + * tree-loop-linear.c (try_interchange_loops): Test for + no data dependences. + 2006-05-17 Zdenek Dvorak PR tree-optimization/27548 diff --git a/gcc/tree-loop-linear.c b/gcc/tree-loop-linear.c index bf353e59f5b..c648ef77c0d 100644 --- a/gcc/tree-loop-linear.c +++ b/gcc/tree-loop-linear.c @@ -178,6 +178,9 @@ try_interchange_loops (lambda_trans_matrix trans, unsigned int nb_deps_not_carried_by_i, nb_deps_not_carried_by_j; struct data_dependence_relation *ddr; + if (VEC_length (ddr_p, dependence_relations) == 0) + return trans; + /* When there is an unknown relation in the dependence_relations, we know that it is no worth looking at this loop nest: give up. */ ddr = VEC_index (ddr_p, dependence_relations, 0); -- 2.11.0