[Bug tree-optimization/52267] a&~N where N has all the bits set up till a specific point can be folded to ((unsigned)a) < N

[amylaar at gcc dot gnu.org]

http://gcc.gnu.org/bugzilla/show_bug.cgi?id=52267

Jorn Wolfgang Rennecke <amylaar at gcc dot gnu.org> changed:

           What    |Removed                     |Added
----------------------------------------------------------------------------
                 CC|                            |amylaar at gcc dot gnu.org

--- Comment #8 from Jorn Wolfgang Rennecke <amylaar at gcc dot gnu.org> ---
(In reply to Georg-Johann Lay from comment #7)

> I just rediced the test case to find this thinko; I don't know if there are
> more because of the sheer amount of values in this program.

Here is a summary of the failing subtests / iteration counts:
f2,f1: i == 6,7
f4,f5,f3: i == 13,15,16,24,25,31
f7,f8,f6: i == 10..12,23
f11,f9: i == 11,13,15,24,25,31
f12,f10: i == 11,13,15,24,25,26,31
f17: i == 12,13
f21: i == 21,22,38..45