[llvm] [RISCV] Add `2^N + 2^M` expanding pattern for mul (PR #137195)

[Craig Topper via llvm-commits]

topperc wrote:

Should we be solving the general case? What if there are more than 2 bits set in the multiplicand?

https://github.com/llvm/llvm-project/pull/137195