mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2025-02-01 05:01:59 +01:00
e023b2c5fa
In the past while, I've committed a number of patches in the PowerPC back end aimed at eliminating comparison instructions. However, this causes some failures in proprietary source and these issues are not observed in SPEC or any open source packages I've been able to run. As a result, I'm pulling the entire series and will refactor it to: - Have a single entry point for easy control - Have fine-grained control over which patterns we transform A side-effect of this is that test cases for these patches (and modified by them) are XFAIL-ed. This is a temporary measure as it is counter-productive to remove/modify these test cases and then have to modify them again when the refactored patch is recommitted. The failure will be investigated in parallel to the refactoring effort and the recommit will either have a fix for it or will leave this transformation off by default until the problem is resolved. llvm-svn: 314244
140 lines
4.1 KiB
LLVM
140 lines
4.1 KiB
LLVM
; XFAIL: *
|
|
; NOTE: Assertions have been autogenerated by utils/update_llc_test_checks.py
|
|
; RUN: llc -verify-machineinstrs -mtriple=powerpc64-unknown-linux-gnu -O2 \
|
|
; RUN: -ppc-asm-full-reg-names -mcpu=pwr8 < %s | FileCheck %s \
|
|
; RUN: --implicit-check-not cmpw --implicit-check-not cmpd --implicit-check-not cmpl
|
|
; RUN: llc -verify-machineinstrs -mtriple=powerpc64le-unknown-linux-gnu -O2 \
|
|
; RUN: -ppc-asm-full-reg-names -mcpu=pwr8 < %s | FileCheck %s \
|
|
; RUN: --implicit-check-not cmpw --implicit-check-not cmpd --implicit-check-not cmpl
|
|
; ModuleID = 'ComparisonTestCases/testComparesieqss.c'
|
|
|
|
@glob = common local_unnamed_addr global i16 0, align 2
|
|
|
|
; Function Attrs: norecurse nounwind readnone
|
|
define signext i32 @test_ieqss(i16 signext %a, i16 signext %b) {
|
|
; CHECK-LABEL: test_ieqss:
|
|
; CHECK: # BB#0: # %entry
|
|
; CHECK-NEXT: xor r3, r3, r4
|
|
; CHECK-NEXT: cntlzw r3, r3
|
|
; CHECK-NEXT: srwi r3, r3, 5
|
|
; CHECK-NEXT: blr
|
|
entry:
|
|
%cmp = icmp eq i16 %a, %b
|
|
%conv2 = zext i1 %cmp to i32
|
|
ret i32 %conv2
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind readnone
|
|
define signext i32 @test_ieqss_sext(i16 signext %a, i16 signext %b) {
|
|
; CHECK-LABEL: test_ieqss_sext:
|
|
; CHECK: # BB#0: # %entry
|
|
; CHECK-NEXT: xor r3, r3, r4
|
|
; CHECK-NEXT: cntlzw r3, r3
|
|
; CHECK-NEXT: srwi r3, r3, 5
|
|
; CHECK-NEXT: neg r3, r3
|
|
; CHECK-NEXT: blr
|
|
entry:
|
|
%cmp = icmp eq i16 %a, %b
|
|
%sub = sext i1 %cmp to i32
|
|
ret i32 %sub
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind readnone
|
|
define signext i32 @test_ieqss_z(i16 signext %a) {
|
|
; CHECK-LABEL: test_ieqss_z:
|
|
; CHECK: # BB#0: # %entry
|
|
; CHECK-NEXT: cntlzw r3, r3
|
|
; CHECK-NEXT: srwi r3, r3, 5
|
|
; CHECK-NEXT: blr
|
|
entry:
|
|
%cmp = icmp eq i16 %a, 0
|
|
%conv1 = zext i1 %cmp to i32
|
|
ret i32 %conv1
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind readnone
|
|
define signext i32 @test_ieqss_sext_z(i16 signext %a) {
|
|
; CHECK-LABEL: test_ieqss_sext_z:
|
|
; CHECK: # BB#0: # %entry
|
|
; CHECK-NEXT: cntlzw r3, r3
|
|
; CHECK-NEXT: srwi r3, r3, 5
|
|
; CHECK-NEXT: neg r3, r3
|
|
; CHECK-NEXT: blr
|
|
entry:
|
|
%cmp = icmp eq i16 %a, 0
|
|
%sub = sext i1 %cmp to i32
|
|
ret i32 %sub
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind
|
|
define void @test_ieqss_store(i16 signext %a, i16 signext %b) {
|
|
; CHECK-LABEL: test_ieqss_store:
|
|
; CHECK: # BB#0: # %entry
|
|
; CHECK-NEXT: addis r5, r2, .LC0@toc@ha
|
|
; CHECK-NEXT: xor r3, r3, r4
|
|
; CHECK-NEXT: ld r12, .LC0@toc@l(r5)
|
|
; CHECK-NEXT: cntlzw r3, r3
|
|
; CHECK-NEXT: srwi r3, r3, 5
|
|
; CHECK-NEXT: sth r3, 0(r12)
|
|
; CHECK-NEXT: blr
|
|
entry:
|
|
%cmp = icmp eq i16 %a, %b
|
|
%conv3 = zext i1 %cmp to i16
|
|
store i16 %conv3, i16* @glob, align 2
|
|
ret void
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind
|
|
define void @test_ieqss_sext_store(i16 signext %a, i16 signext %b) {
|
|
; CHECK-LABEL: test_ieqss_sext_store:
|
|
; CHECK: # BB#0: # %entry
|
|
; CHECK-NEXT: xor r3, r3, r4
|
|
; CHECK-NEXT: addis r5, r2, .LC0@toc@ha
|
|
; CHECK-NEXT: cntlzw r3, r3
|
|
; CHECK-NEXT: ld r4, .LC0@toc@l(r5)
|
|
; CHECK-NEXT: srwi r3, r3, 5
|
|
; CHECK-NEXT: neg r3, r3
|
|
; CHECK-NEXT: sth r3, 0(r4)
|
|
; CHECK-NEXT: blr
|
|
entry:
|
|
%cmp = icmp eq i16 %a, %b
|
|
%conv3 = sext i1 %cmp to i16
|
|
store i16 %conv3, i16* @glob, align 2
|
|
ret void
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind
|
|
define void @test_ieqss_z_store(i16 signext %a) {
|
|
; CHECK-LABEL: test_ieqss_z_store:
|
|
; CHECK: # BB#0: # %entry
|
|
; CHECK-NEXT: addis r4, r2, .LC0@toc@ha
|
|
; CHECK-NEXT: cntlzw r3, r3
|
|
; CHECK-NEXT: ld r4, .LC0@toc@l(r4)
|
|
; CHECK-NEXT: srwi r3, r3, 5
|
|
; CHECK-NEXT: sth r3, 0(r4)
|
|
; CHECK-NEXT: blr
|
|
entry:
|
|
%cmp = icmp eq i16 %a, 0
|
|
%conv2 = zext i1 %cmp to i16
|
|
store i16 %conv2, i16* @glob, align 2
|
|
ret void
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind
|
|
define void @test_ieqss_sext_z_store(i16 signext %a) {
|
|
; CHECK-LABEL: test_ieqss_sext_z_store:
|
|
; CHECK: # BB#0: # %entry
|
|
; CHECK-NEXT: addis r4, r2, .LC0@toc@ha
|
|
; CHECK-NEXT: cntlzw r3, r3
|
|
; CHECK-NEXT: ld r4, .LC0@toc@l(r4)
|
|
; CHECK-NEXT: srwi r3, r3, 5
|
|
; CHECK-NEXT: neg r3, r3
|
|
; CHECK-NEXT: sth r3, 0(r4)
|
|
; CHECK-NEXT: blr
|
|
entry:
|
|
%cmp = icmp eq i16 %a, 0
|
|
%conv2 = sext i1 %cmp to i16
|
|
store i16 %conv2, i16* @glob, align 2
|
|
ret void
|
|
}
|