mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-30 15:32:52 +01:00
f4f67cacd7
The atomic tests assume the two-operand forms, so I've restricted them to z10. Running and-01.ll, or-01.ll and xor-01.ll for z196 as well as z10 shows why using convertToThreeAddress() is better than exposing the three-operand forms first and then converting back to two operands where possible (which is what I'd originally tried). Using the three-operand form first stops us from taking advantage of NG, OG and XG for spills. llvm-svn: 186683
50 lines
1.1 KiB
LLVM
50 lines
1.1 KiB
LLVM
; Test 32-bit atomic XORs.
|
|
;
|
|
; RUN: llc < %s -mtriple=s390x-linux-gnu -mcpu=z10 | FileCheck %s
|
|
|
|
; Check XORs of a variable.
|
|
define i32 @f1(i32 %dummy, i32 *%src, i32 %b) {
|
|
; CHECK-LABEL: f1:
|
|
; CHECK: l %r2, 0(%r3)
|
|
; CHECK: [[LABEL:\.[^ ]*]]:
|
|
; CHECK: lr %r0, %r2
|
|
; CHECK: xr %r0, %r4
|
|
; CHECK: cs %r2, %r0, 0(%r3)
|
|
; CHECK: jlh [[LABEL]]
|
|
; CHECK: br %r14
|
|
%res = atomicrmw xor i32 *%src, i32 %b seq_cst
|
|
ret i32 %res
|
|
}
|
|
|
|
; Check the lowest useful constant.
|
|
define i32 @f2(i32 %dummy, i32 *%src) {
|
|
; CHECK-LABEL: f2:
|
|
; CHECK: l %r2, 0(%r3)
|
|
; CHECK: [[LABEL:\.[^ ]*]]:
|
|
; CHECK: lr %r0, %r2
|
|
; CHECK: xilf %r0, 1
|
|
; CHECK: cs %r2, %r0, 0(%r3)
|
|
; CHECK: jlh [[LABEL]]
|
|
; CHECK: br %r14
|
|
%res = atomicrmw xor i32 *%src, i32 1 seq_cst
|
|
ret i32 %res
|
|
}
|
|
|
|
; Check an arbitrary constant.
|
|
define i32 @f3(i32 %dummy, i32 *%src) {
|
|
; CHECK-LABEL: f3:
|
|
; CHECK: xilf %r0, 3000000000
|
|
; CHECK: br %r14
|
|
%res = atomicrmw xor i32 *%src, i32 3000000000 seq_cst
|
|
ret i32 %res
|
|
}
|
|
|
|
; Check bitwise negation.
|
|
define i32 @f4(i32 %dummy, i32 *%src) {
|
|
; CHECK-LABEL: f4:
|
|
; CHECK: xilf %r0, 4294967295
|
|
; CHECK: br %r14
|
|
%res = atomicrmw xor i32 *%src, i32 -1 seq_cst
|
|
ret i32 %res
|
|
}
|