summaryrefslogtreecommitdiffstats
path: root/lldb/packages/Python/lldbsuite/test/python_api/process/main.cpp
diff options
context:
space:
mode:
authorRoman Lebedev <lebedev.ri@gmail.com>2019-07-19 08:26:13 +0000
committerRoman Lebedev <lebedev.ri@gmail.com>2019-07-19 08:26:13 +0000
commit4422a1657c661575f4ab22d43b243184f3db4461 (patch)
treebb0bd698f023fe19b0fc9af93d684efdc259b478 /lldb/packages/Python/lldbsuite/test/python_api/process/main.cpp
parenta5f0824eb518ba82e4395b11e4207eaf5197556d (diff)
downloadbcm5719-llvm-4422a1657c661575f4ab22d43b243184f3db4461.tar.gz
bcm5719-llvm-4422a1657c661575f4ab22d43b243184f3db4461.zip
[InstCombine] Dropping redundant masking before left-shift [1/5] (PR42563)
Summary: 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: b. `(x & (~(-1 << maskNbits))) << shiftNbits` All these patterns can be simplified to just: `x << ShiftShAmt` iff: b. `(MaskShAmt+ShiftShAmt) u>= bitwidth(x)` alive proof: b: https://rise4fun.com/Alive/y8M 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. https://bugs.llvm.org/show_bug.cgi?id=42563 Differential Revision: https://reviews.llvm.org/D64514 llvm-svn: 366536
Diffstat (limited to 'lldb/packages/Python/lldbsuite/test/python_api/process/main.cpp')
0 files changed, 0 insertions, 0 deletions
OpenPOWER on IntegriCloud