aboutsummaryrefslogtreecommitdiff
path: root/llvm/lib/Bitcode
diff options
context:
space:
mode:
authorCraig Topper <craig.topper@sifive.com>2023-11-24 08:39:38 -0800
committerGitHub <noreply@github.com>2023-11-24 08:39:38 -0800
commit5d501b1091ce3632b885c60a8fc9f74ed9c95ae3 (patch)
tree30dca1745cedd675c36b71545ac9d4ddc6a84583 /llvm/lib/Bitcode
parent233e7c5de2d2abda024577e79dcd195562de68c8 (diff)
downloadllvm-5d501b1091ce3632b885c60a8fc9f74ed9c95ae3.zip
llvm-5d501b1091ce3632b885c60a8fc9f74ed9c95ae3.tar.gz
llvm-5d501b1091ce3632b885c60a8fc9f74ed9c95ae3.tar.bz2
[GISel][RISCV] Fix several boundary cases in narrow G_SEXT_INREG. (#72719)
This fixes cases when SizeInBits is a multiple of the narrow size. If SizeBits is equal to NarrowTy size, the first block would create an illegal G_SEXT_INREG where the the extension size is equal to the type. I tried to turn it into G_TRUNC+G_SEXT, but that just turned back into G_SEXT_INREG causing an infinite loop. So punt to the splitting case. In the for loop we should copy when the part ends on SizeInBits. In that case there is no G_SEXT_INREG needed for partial. But we should note that register in PartialExtensionReg for the first full part to use. If the part starts on SizeInBits then we should do an AShr of PartialExtensionReg. We should only get to the G_SEXT_INREG case if the SizeInBits is in the middle of the part.
Diffstat (limited to 'llvm/lib/Bitcode')
0 files changed, 0 insertions, 0 deletions