------- Comment #10 from tkoenig at gcc dot gnu dot org 2010-05-22 10:11 ------- I've gotten a bit further with this.
For x(la:ua:sa) = x(lb,ub,sb), there can be no collision if abs(la-lb) mod gcd(sa, sb) == 0 where gcd is the greatest common divisor. This will at least fix the test case from comment #1, and also cases like a(2:x:2) = a(1:y:4). but will not work in the cases where there is partial overlap only. Also, it would be nice to have complete simplification so that cases like a(2*n**2+3*n+1:x:2) = a(2*n**2+3*n:x:2) can be caught. -- http://gcc.gnu.org/bugzilla/show_bug.cgi?id=36928
