> For instance > for (i=0; i<max; i+=anystride) > can be optimized out for signed counter relying that overflow can jump > in between max...INT_MAX > > togehter with loops of style > for (i=0; i<max; i++) > in unsigned, and for MAX known and safely away from end of type we > should prove finiteness in most common cases.
Please handle also i!=max conditions. I have a patch to derive precise value ranges for simple induction variables instead of punting to [0,INT_MAX). With the patch VRP likes to turn i<max loops into i!=max loops. Paolo
