diff options
| author | Alex Bradbury <asb@lowrisc.org> | 2019-01-25 05:04:00 +0000 |
|---|---|---|
| committer | Alex Bradbury <asb@lowrisc.org> | 2019-01-25 05:04:00 +0000 |
| commit | 299d690a502b5a1d56e5e73b2bd7c137b82c20a6 (patch) | |
| tree | 359222f8403941be1ad126a665199b94c82ab0f2 /llvm/lib/CodeGen/StackProtector.cpp | |
| parent | 3b9a82ff2c798aff3eb48ab1220447bfd2d013e0 (diff) | |
| download | llvm-299d690a502b5a1d56e5e73b2bd7c137b82c20a6.zip llvm-299d690a502b5a1d56e5e73b2bd7c137b82c20a6.tar.gz llvm-299d690a502b5a1d56e5e73b2bd7c137b82c20a6.tar.bz2 | |
[RISCV] Custom-legalise 32-bit variable shifts on RV64
The previous DAG combiner-based approach had an issue with infinite loops
between the target-dependent and target-independent combiner logic (see
PR40333). Although this was worked around in rL351806, the combiner-based
approach is still potentially brittle and can fail to select the 32-bit shift
variant when profitable to do so, as demonstrated in the pr40333.ll test case.
This patch instead introduces target-specific SelectionDAG nodes for
SHLW/SRLW/SRAW and custom-lowers variable i32 shifts to them. pr40333.ll is a
good example of how this approach can improve codegen.
This adds DAG combine that does SimplifyDemandedBits on the operands (only
lower 32-bits of first operand and lower 5 bits of second operand are read).
This seems better than implementing SimplifyDemandedBitsForTargetNode as there
is no guarantee that would be called (and it's not for e.g. the anyext return
test cases). Also implements ComputeNumSignBitsForTargetNode.
There are codegen changes in atomic-rmw.ll and atomic-cmpxchg.ll but the new
instruction sequences are semantically equivalent.
Differential Revision: https://reviews.llvm.org/D57085
llvm-svn: 352169
Diffstat (limited to 'llvm/lib/CodeGen/StackProtector.cpp')
0 files changed, 0 insertions, 0 deletions
