The following fixes an omission in dependence testing for loop
distribution. When the overall dependence distance is not zero but
the dependence direction in the innermost common loop is = there is
a conflict between the partitions and we have to merge them.
Bootstrapped and tested on x86_64-unkn
We currently distribute
for (c = 2; c; c--)
for (e = 0; e < 2; e++) {
d[c] = b = d[c + 1];
d[c + 1].a = 0;
}
in a wrong way where the inner loop zero dependence distance should
make us preserve stmt execution order. We fail to do so since we
only look for a fully zero dista
