diff options
| author | Craig Topper <craig.topper@sifive.com> | 2021-01-24 00:13:12 -0800 |
|---|---|---|
| committer | Craig Topper <craig.topper@sifive.com> | 2021-01-24 00:34:45 -0800 |
| commit | c50457f3e4209b0cd0d4a6baa881bac30a9d3016 (patch) | |
| tree | a9310d07e351d4536239d22e69863ded37d01949 /llvm/lib/Bitcode/Reader/BitReader.cpp | |
| parent | 45ad6fac6ad0dea2a1f7a1c6b65b64d230757667 (diff) | |
| download | llvm-c50457f3e4209b0cd0d4a6baa881bac30a9d3016.zip llvm-c50457f3e4209b0cd0d4a6baa881bac30a9d3016.tar.gz llvm-c50457f3e4209b0cd0d4a6baa881bac30a9d3016.tar.bz2 | |
[RISCV] Make the code in MatchSLLIUW ignore the lower bits of the AND mask where the shift has guaranteed zeros.
This avoids being dependent on SimplifyDemandedBits having cleared
those bits.
It could make sense to teach SimplifyDemandedBits to keep all
lower bits 1 in an AND mask when possible. This could be
implemented with slli+srli in the general case rather than
needing to materialize the constant.
Diffstat (limited to 'llvm/lib/Bitcode/Reader/BitReader.cpp')
0 files changed, 0 insertions, 0 deletions