On Fri, 2025-07-04 at 14:13 -0700, Eduard Zingerman wrote: [...] > I think the mask can be computed as in or_range() function at the > bottom of the email. This gives the following algorithm, if only > unsigned range is considered: > > - assume prediction is needed for "if a & b goto ..." > - bits that may be set in 'a' are or_range(a_min, a_max) > - bits that may be set in 'b' are or_range(b_min, b_max) > - if computed bit masks intersect: both branches are possible > - otherwise only false branch is possible. > > Wdyt? This does not help with problem at hand, however. Possible bits set for range [0x1, 0xff] are 0xff, so there would be no prediction.
