mirror of
https://github.com/RPCS3/llvm.git
synced 2026-01-31 01:25:19 +01:00
559fb26604
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. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@314244 91177308-0d34-0410-b5e6-96231b3b80d8
140 lines
4.0 KiB
LLVM
140 lines
4.0 KiB
LLVM
; XFAIL: *
|
|
; 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
|
|
; NOTE: Assertions have been autogenerated by utils/update_llc_test_checks.py
|
|
@glob = common local_unnamed_addr global i64 0, align 8
|
|
|
|
; Function Attrs: norecurse nounwind readnone
|
|
define i64 @test_lllesll(i64 %a, i64 %b) {
|
|
; CHECK-LABEL: test_lllesll:
|
|
; CHECK: # BB#0: # %entry
|
|
; CHECK-NEXT: sradi r5, r4, 63
|
|
; CHECK-NEXT: rldicl r6, r3, 1, 63
|
|
; CHECK-NEXT: subfc r12, r3, r4
|
|
; CHECK-NEXT: adde r3, r5, r6
|
|
; CHECK-NEXT: blr
|
|
entry:
|
|
%cmp = icmp sle i64 %a, %b
|
|
%conv1 = zext i1 %cmp to i64
|
|
ret i64 %conv1
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind readnone
|
|
define i64 @test_lllesll_sext(i64 %a, i64 %b) {
|
|
; CHECK-LABEL: test_lllesll_sext:
|
|
; CHECK: # BB#0: # %entry
|
|
; CHECK-NEXT: sradi r5, r4, 63
|
|
; CHECK-NEXT: rldicl r6, r3, 1, 63
|
|
; CHECK-NEXT: subfc r12, r3, r4
|
|
; CHECK-NEXT: adde r3, r5, r6
|
|
; CHECK-NEXT: neg r3, r3
|
|
; CHECK-NEXT: blr
|
|
entry:
|
|
%cmp = icmp sle i64 %a, %b
|
|
%conv1 = sext i1 %cmp to i64
|
|
ret i64 %conv1
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind readnone
|
|
define i64 @test_lllesll_z(i64 %a) {
|
|
; CHECK-LABEL: test_lllesll_z:
|
|
; CHECK: # BB#0: # %entry
|
|
; CHECK-NEXT: addi r4, r3, -1
|
|
; CHECK-NEXT: or r3, r4, r3
|
|
; CHECK-NEXT: rldicl r3, r3, 1, 63
|
|
; CHECK-NEXT: blr
|
|
entry:
|
|
%cmp = icmp slt i64 %a, 1
|
|
%conv1 = zext i1 %cmp to i64
|
|
ret i64 %conv1
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind readnone
|
|
define i64 @test_lllesll_sext_z(i64 %a) {
|
|
; CHECK-LABEL: test_lllesll_sext_z:
|
|
; CHECK: # BB#0: # %entry
|
|
; CHECK-NEXT: addi r4, r3, -1
|
|
; CHECK-NEXT: or r3, r4, r3
|
|
; CHECK-NEXT: sradi r3, r3, 63
|
|
; CHECK-NEXT: blr
|
|
entry:
|
|
%cmp = icmp slt i64 %a, 1
|
|
%conv1 = sext i1 %cmp to i64
|
|
ret i64 %conv1
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind
|
|
define void @test_lllesll_store(i64 %a, i64 %b) {
|
|
; CHECK-LABEL: test_lllesll_store:
|
|
; CHECK: # BB#0: # %entry
|
|
; CHECK: sradi r6, r4, 63
|
|
; CHECK: subfc r4, r3, r4
|
|
; CHECK: rldicl r3, r3, 1, 63
|
|
; CHECK: adde r3, r6, r3
|
|
; CHECK: std r3,
|
|
; CHECK-NEXT: blr
|
|
entry:
|
|
%cmp = icmp sle i64 %a, %b
|
|
%conv1 = zext i1 %cmp to i64
|
|
store i64 %conv1, i64* @glob, align 8
|
|
ret void
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind
|
|
define void @test_lllesll_sext_store(i64 %a, i64 %b) {
|
|
; CHECK-LABEL: test_lllesll_sext_store:
|
|
; CHECK: # BB#0: # %entry
|
|
; CHECK: sradi r6, r4, 63
|
|
; CHECK-DAG: rldicl r3, r3, 1, 63
|
|
; CHECK-DAG: subfc r4, r3, r4
|
|
; CHECK: adde r3, r6, r3
|
|
; CHECK: neg r3, r3
|
|
; CHECK: std r3, 0(r4)
|
|
; CHECK-NEXT: blr
|
|
entry:
|
|
%cmp = icmp sle i64 %a, %b
|
|
%conv1 = sext i1 %cmp to i64
|
|
store i64 %conv1, i64* @glob, align 8
|
|
ret void
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind
|
|
define void @test_lllesll_z_store(i64 %a) {
|
|
; CHECK-LABEL: test_lllesll_z_store:
|
|
; CHECK: # BB#0: # %entry
|
|
; CHECK-NEXT: addis r4, r2, .LC0@toc@ha
|
|
; CHECK-NEXT: addi r5, r3, -1
|
|
; CHECK-NEXT: ld r4, .LC0@toc@l(r4)
|
|
; CHECK-NEXT: or r3, r5, r3
|
|
; CHECK-NEXT: rldicl r3, r3, 1, 63
|
|
; CHECK-NEXT: std r3, 0(r4)
|
|
; CHECK-NEXT: blr
|
|
entry:
|
|
%cmp = icmp slt i64 %a, 1
|
|
%conv1 = zext i1 %cmp to i64
|
|
store i64 %conv1, i64* @glob, align 8
|
|
ret void
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind
|
|
define void @test_lllesll_sext_z_store(i64 %a) {
|
|
; CHECK-LABEL: test_lllesll_sext_z_store:
|
|
; CHECK: # BB#0: # %entry
|
|
; CHECK-NEXT: addis r4, r2, .LC0@toc@ha
|
|
; CHECK-NEXT: addi r5, r3, -1
|
|
; CHECK-NEXT: ld r4, .LC0@toc@l(r4)
|
|
; CHECK-NEXT: or r3, r5, r3
|
|
; CHECK-NEXT: sradi r3, r3, 63
|
|
; CHECK-NEXT: std r3, 0(r4)
|
|
; CHECK-NEXT: blr
|
|
entry:
|
|
%cmp = icmp slt i64 %a, 1
|
|
%conv1 = sext i1 %cmp to i64
|
|
store i64 %conv1, i64* @glob, align 8
|
|
ret void
|
|
}
|