mirror of
https://github.com/RPCS3/llvm.git
synced 2024-12-13 23:18:58 +00:00
775c174b7b
Summary: This fixes http://llvm.org/bugs/show_bug.cgi?id=16439. This is one possible way to approach this. The other would be to split InL>>(nbits-Amt) into (InL>>(nbits-1-Amt))>>1, which is also valid since since we only need to care about Amt up nbits-1. It's hard to tell which one is better since the shift might be expensive if this stage of expansion is not yet a legal machine integer, whereas comparisons with zero are relatively cheap at all sizes, but more expensive than a shift if the shift is on a legal machine type. Patch by Keno Fischer! Test Plan: regression test from http://reviews.llvm.org/D7752 Reviewers: chfast, resistor Reviewed By: chfast, resistor Subscribers: sanjoy, resistor, chfast, llvm-commits Differential Revision: http://reviews.llvm.org/D4978 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@235370 91177308-0d34-0410-b5e6-96231b3b80d8
22 lines
601 B
LLVM
22 lines
601 B
LLVM
; RUN: llc < %s -march=x86 | FileCheck %s
|
|
; RUN: llc < %s -march=x86-64 -O0 | FileCheck %s -check-prefix=CHECK-X64
|
|
; RUN: llc < %s -march=x86-64 -O2 | FileCheck %s -check-prefix=CHECK-X64
|
|
|
|
; CHECK-LABEL: shift1
|
|
define void @shift1(i256 %x, i256 %a, i256* nocapture %r) nounwind readnone {
|
|
entry:
|
|
%0 = ashr i256 %x, %a
|
|
store i256 %0, i256* %r
|
|
ret void
|
|
}
|
|
|
|
; CHECK-LABEL: shift2
|
|
define i256 @shift2(i256 %c) nounwind
|
|
{
|
|
%b = shl i256 1, %c ; %c must not be a constant
|
|
; Special case when %c is 0:
|
|
; CHECK-X64: testb [[REG:%r[0-9]+b]], [[REG]]
|
|
; CHECK-X64: cmoveq
|
|
ret i256 %b
|
|
}
|