https://gcc.gnu.org/bugzilla/show_bug.cgi?id=97445
--- Comment #55 from Martin Liška <marxin at gcc dot gnu.org> --- (In reply to Jan Hubicka from comment #54) > > > It goes from 1 to 1<<63, so each of tests translates to a range. > > > > Yes, but these ranges are very large, nothing for a jump table or a > > bit-test. > Yep, but theoretically you can recover the decision table and pattern > match it is a bit builtin. Not sure how many open coded bit builtins > are there. Such a pattern matching is a bit similar to PR90838. Anyway, not planning to implement it now.
