diff options
| author | Richard Biener <rguenther@suse.de> | 2025-01-23 13:10:17 +0100 |
|---|---|---|
| committer | Richard Biener <rguenth@gcc.gnu.org> | 2025-01-27 13:31:35 +0100 |
| commit | 04ba1300407f106a6dd10d346f58a51d87e6d43e (patch) | |
| tree | 6a7f8caf63aa61a084933ed89c755ad4f89f58be /gcc/expr.cc | |
| parent | 3600b1ff14a459e84bb40bdfea7cd8d2ffd73d8d (diff) | |
| download | gcc-04ba1300407f106a6dd10d346f58a51d87e6d43e.zip gcc-04ba1300407f106a6dd10d346f58a51d87e6d43e.tar.gz gcc-04ba1300407f106a6dd10d346f58a51d87e6d43e.tar.bz2 | |
tree-optimization/112859 - bogus loop distribution
When we get a zero distance vector we still have to check for the
situation of a common inner loop with zero distance. But we can
still allow a zero distance for the loop we distribute
(gcc.dg/tree-ssa/ldist-33.c is such a case). This is because
zero distances in non-outermost loops are a misrepresentation
of dependence by dependence analysis.
Note that test coverage of loop distribution of loop nests is
very low.
PR tree-optimization/112859
PR tree-optimization/115347
* tree-loop-distribution.cc
(loop_distribution::pg_add_dependence_edges): For a zero
distance vector still make sure to not have an inner
loop with zero distance.
* gcc.dg/torture/pr112859.c: New testcase.
* gcc.dg/torture/pr115347.c: Likewise.
Diffstat (limited to 'gcc/expr.cc')
0 files changed, 0 insertions, 0 deletions