mirror of
https://github.com/RPCSX/llvm.git
synced 2024-12-13 14:46:53 +00:00
e1af5f6ad1
Utilizing the 8 and 16 bit comparison instructions, even when an input can be folded into the comparison instruction itself, is typically not worth it. There are too many partial register stalls as a result, leading to significant slowdowns. By always performing comparisons on at least 32-bit registers, performance of the calculation chain leading to the comparison improves. Continue to use the smaller comparisons when minimizing size, as that allows better folding of loads into the comparison instructions. rdar://15386341 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@195496 91177308-0d34-0410-b5e6-96231b3b80d8
97 lines
2.8 KiB
LLVM
97 lines
2.8 KiB
LLVM
; RUN: llc < %s -mtriple=x86_64-apple-darwin -asm-verbose=false | FileCheck %s -check-prefix=64BIT
|
|
; rdar://7329206
|
|
|
|
; In 32-bit the partial register stall would degrade performance.
|
|
|
|
define zeroext i16 @t1(i16 zeroext %c, i16 zeroext %k) nounwind ssp {
|
|
entry:
|
|
; 32BIT-LABEL: t1:
|
|
; 32BIT: movw 20(%esp), %ax
|
|
; 32BIT-NOT: movw %ax, %cx
|
|
; 32BIT: leal 1(%eax), %ecx
|
|
|
|
; 64BIT-LABEL: t1:
|
|
; 64BIT-NOT: movw %si, %ax
|
|
; 64BIT: leal 1(%rsi), %eax
|
|
%0 = icmp eq i16 %k, %c ; <i1> [#uses=1]
|
|
%1 = add i16 %k, 1 ; <i16> [#uses=3]
|
|
br i1 %0, label %bb, label %bb1
|
|
|
|
bb: ; preds = %entry
|
|
tail call void @foo(i16 zeroext %1) nounwind
|
|
ret i16 %1
|
|
|
|
bb1: ; preds = %entry
|
|
ret i16 %1
|
|
}
|
|
|
|
define zeroext i16 @t2(i16 zeroext %c, i16 zeroext %k) nounwind ssp {
|
|
entry:
|
|
; 32BIT-LABEL: t2:
|
|
; 32BIT: movw 20(%esp), %ax
|
|
; 32BIT-NOT: movw %ax, %cx
|
|
; 32BIT: leal -1(%eax), %ecx
|
|
|
|
; 64BIT-LABEL: t2:
|
|
; 64BIT-NOT: movw %si, %ax
|
|
; 64BIT: leal -1(%rsi), %eax
|
|
; 64BIT: movzwl %ax
|
|
%0 = icmp eq i16 %k, %c ; <i1> [#uses=1]
|
|
%1 = add i16 %k, -1 ; <i16> [#uses=3]
|
|
br i1 %0, label %bb, label %bb1
|
|
|
|
bb: ; preds = %entry
|
|
tail call void @foo(i16 zeroext %1) nounwind
|
|
ret i16 %1
|
|
|
|
bb1: ; preds = %entry
|
|
ret i16 %1
|
|
}
|
|
|
|
declare void @foo(i16 zeroext)
|
|
|
|
define zeroext i16 @t3(i16 zeroext %c, i16 zeroext %k) nounwind ssp {
|
|
entry:
|
|
; 32BIT-LABEL: t3:
|
|
; 32BIT: movw 20(%esp), %ax
|
|
; 32BIT-NOT: movw %ax, %cx
|
|
; 32BIT: leal 2(%eax), %ecx
|
|
|
|
; 64BIT-LABEL: t3:
|
|
; 64BIT-NOT: movw %si, %ax
|
|
; 64BIT: leal 2(%rsi), %eax
|
|
%0 = add i16 %k, 2 ; <i16> [#uses=3]
|
|
%1 = icmp eq i16 %k, %c ; <i1> [#uses=1]
|
|
br i1 %1, label %bb, label %bb1
|
|
|
|
bb: ; preds = %entry
|
|
tail call void @foo(i16 zeroext %0) nounwind
|
|
ret i16 %0
|
|
|
|
bb1: ; preds = %entry
|
|
ret i16 %0
|
|
}
|
|
|
|
define zeroext i16 @t4(i16 zeroext %c, i16 zeroext %k) nounwind ssp {
|
|
entry:
|
|
; 32BIT-LABEL: t4:
|
|
; 32BIT: movw 16(%esp), %ax
|
|
; 32BIT: movw 20(%esp), %cx
|
|
; 32BIT-NOT: movw %cx, %dx
|
|
; 32BIT: leal (%ecx,%eax), %edx
|
|
|
|
; 64BIT-LABEL: t4:
|
|
; 64BIT-NOT: movw %si, %ax
|
|
; 64BIT: leal (%rsi,%rdi), %eax
|
|
%0 = add i16 %k, %c ; <i16> [#uses=3]
|
|
%1 = icmp eq i16 %k, %c ; <i1> [#uses=1]
|
|
br i1 %1, label %bb, label %bb1
|
|
|
|
bb: ; preds = %entry
|
|
tail call void @foo(i16 zeroext %0) nounwind
|
|
ret i16 %0
|
|
|
|
bb1: ; preds = %entry
|
|
ret i16 %0
|
|
}
|