https://gcc.gnu.org/bugzilla/show_bug.cgi?id=100499
Richard Biener <rguenth at gcc dot gnu.org> changed: What |Removed |Added ---------------------------------------------------------------------------- CC| |aldyh at gcc dot gnu.org --- Comment #12 from Richard Biener <rguenth at gcc dot gnu.org> --- So in number_of_iterations_ne it looks like the step 's' is always constant which makes me wonder if we can somehow use ranger to tell multiple_of_p (type, c, s) or at least whether, if c is x * s, the multiplication could have overflowed?