aboutsummaryrefslogtreecommitdiff
path: root/gcc/tree-loop-distribution.c
diff options
context:
space:
mode:
authorRichard Guenther <rguenther@suse.de>2012-07-24 08:37:43 +0000
committerRichard Biener <rguenth@gcc.gnu.org>2012-07-24 08:37:43 +0000
commit38ad2d079800cafd77f35c32a335697f643fa1a3 (patch)
tree1a4b1ee8eb1c68d15f5bb386c2d00ad7f53cf040 /gcc/tree-loop-distribution.c
parentd32d6b75cabf6f0856c3998a71e9dc1f4a301ce7 (diff)
downloadgcc-38ad2d079800cafd77f35c32a335697f643fa1a3.zip
gcc-38ad2d079800cafd77f35c32a335697f643fa1a3.tar.gz
gcc-38ad2d079800cafd77f35c32a335697f643fa1a3.tar.bz2
re PR middle-end/53616 (416.gamess in SPEC CPU 2006 miscompiled)
2012-07-24 Richard Guenther <rguenther@suse.de> PR tree-optimization/53616 * tree-loop-distribution.c (ldist_gen): Do not change partition ordering when merging partitions. From-SVN: r189802
Diffstat (limited to 'gcc/tree-loop-distribution.c')
-rw-r--r--gcc/tree-loop-distribution.c29
1 files changed, 19 insertions, 10 deletions
diff --git a/gcc/tree-loop-distribution.c b/gcc/tree-loop-distribution.c
index 58ed12b..18df9fb 100644
--- a/gcc/tree-loop-distribution.c
+++ b/gcc/tree-loop-distribution.c
@@ -1289,16 +1289,25 @@ ldist_gen (struct loop *loop, struct graph *rdg,
nbp = 0;
goto ldist_done;
}
- for (i = 0; VEC_iterate (partition_t, partitions, i, into); ++i)
- if (!partition_builtin_p (into))
- break;
- for (++i; VEC_iterate (partition_t, partitions, i, partition); ++i)
- if (!partition_builtin_p (partition))
- {
- bitmap_ior_into (into->stmts, partition->stmts);
- VEC_ordered_remove (partition_t, partitions, i);
- i--;
- }
+ /* Only fuse adjacent non-builtin partitions, see PR53616.
+ ??? Use dependence information to improve partition ordering. */
+ i = 0;
+ do
+ {
+ for (; VEC_iterate (partition_t, partitions, i, into); ++i)
+ if (!partition_builtin_p (into))
+ break;
+ for (++i; VEC_iterate (partition_t, partitions, i, partition); ++i)
+ if (!partition_builtin_p (partition))
+ {
+ bitmap_ior_into (into->stmts, partition->stmts);
+ VEC_ordered_remove (partition_t, partitions, i);
+ i--;
+ }
+ else
+ break;
+ }
+ while ((unsigned) i < VEC_length (partition_t, partitions));
}
else
{