If we have some pattern that leaves only some low bits set, and then performs

left-shift of those bits, if none of the bits that are left after the final

shift are modified by the mask, we can omit the mask.

There are many variants to this pattern:

a. `(x & ((1 << MaskShAmt) - 1)) << ShiftShAmt`

All these patterns can be simplified to just:

`x << ShiftShAmt`

iff:

a. `(MaskShAmt+ShiftShAmt) u>= bitwidth(x)`

alive proof:

a: https://rise4fun.com/Alive/wi9

Indeed, not all of these patterns are canonical.

But since this fold will only produce a single instruction

i'm really interested in handling even uncanonical patterns,

since i have this general kind of pattern in hotpaths,

and it is not totally outlandish for bit-twiddling code.

For now let's start with patterns where both shift amounts are variable,

with trivial constant "offset" between them, since i believe this is

both simplest to handle and i think this is most common.

But again, there are likely other variants where we could use

ValueTracking/ConstantRange to handle more cases.