2014-01-24 07:23:31 +01:00
|
|
|
; RUN: llc < %s -march=sparcv9 -verify-machineinstrs | FileCheck %s
|
2014-01-01 23:11:54 +01:00
|
|
|
|
|
|
|
|
; CHECK-LABEL: test_atomic_i32
|
|
|
|
|
; CHECK: ld [%o0]
|
|
|
|
|
; CHECK: membar
|
|
|
|
|
; CHECK: ld [%o1]
|
|
|
|
|
; CHECK: membar
|
|
|
|
|
; CHECK: membar
|
|
|
|
|
; CHECK: st {{.+}}, [%o2]
|
|
|
|
|
define i32 @test_atomic_i32(i32* %ptr1, i32* %ptr2, i32* %ptr3) {
|
|
|
|
|
entry:
|
|
|
|
|
%0 = load atomic i32* %ptr1 acquire, align 8
|
|
|
|
|
%1 = load atomic i32* %ptr2 acquire, align 8
|
|
|
|
|
%2 = add i32 %0, %1
|
|
|
|
|
store atomic i32 %2, i32* %ptr3 release, align 8
|
|
|
|
|
ret i32 %2
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: test_atomic_i64
|
|
|
|
|
; CHECK: ldx [%o0]
|
|
|
|
|
; CHECK: membar
|
|
|
|
|
; CHECK: ldx [%o1]
|
|
|
|
|
; CHECK: membar
|
|
|
|
|
; CHECK: membar
|
|
|
|
|
; CHECK: stx {{.+}}, [%o2]
|
|
|
|
|
define i64 @test_atomic_i64(i64* %ptr1, i64* %ptr2, i64* %ptr3) {
|
|
|
|
|
entry:
|
|
|
|
|
%0 = load atomic i64* %ptr1 acquire, align 8
|
|
|
|
|
%1 = load atomic i64* %ptr2 acquire, align 8
|
|
|
|
|
%2 = add i64 %0, %1
|
|
|
|
|
store atomic i64 %2, i64* %ptr3 release, align 8
|
|
|
|
|
ret i64 %2
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: test_cmpxchg_i32
|
TableGen: fix operand counting for aliases
TableGen has a fairly dubious heuristic to decide whether an alias should be
printed: does the alias have lest operands than the real instruction. This is
bad enough (particularly with no way to override it), but it should at least be
calculated consistently for both strings.
This patch implements that logic: first get the *correct* string for the
variant, in the same way as the Matcher, without guessing; then count the
number of whitespace chars.
There are basically 4 changes this brings about after the previous
commits; all of these appear to be good, so I have changed the tests:
+ ARM64: we print "neg X, Y" instead of "sub X, xzr, Y".
+ ARM64: we skip implicit "uxtx" and "uxtw" modifiers.
+ Sparc: we print "mov A, B" instead of "or %g0, A, B".
+ Sparc: we print "fcmpX A, B" instead of "fcmpX %fcc0, A, B"
llvm-svn: 208969
2014-05-16 11:42:04 +02:00
|
|
|
; CHECK: mov 123, [[R:%[gilo][0-7]]]
|
2014-01-01 23:11:54 +01:00
|
|
|
; CHECK: cas [%o1], %o0, [[R]]
|
|
|
|
|
|
|
|
|
|
define i32 @test_cmpxchg_i32(i32 %a, i32* %ptr) {
|
|
|
|
|
entry:
|
IR: add "cmpxchg weak" variant to support permitted failure.
This commit adds a weak variant of the cmpxchg operation, as described
in C++11. A cmpxchg instruction with this modifier is permitted to
fail to store, even if the comparison indicated it should.
As a result, cmpxchg instructions must return a flag indicating
success in addition to their original iN value loaded. Thus, for
uniformity *all* cmpxchg instructions now return "{ iN, i1 }". The
second flag is 1 when the store succeeded.
At the DAG level, a new ATOMIC_CMP_SWAP_WITH_SUCCESS node has been
added as the natural representation for the new cmpxchg instructions.
It is a strong cmpxchg.
By default this gets Expanded to the existing ATOMIC_CMP_SWAP during
Legalization, so existing backends should see no change in behaviour.
If they wish to deal with the enhanced node instead, they can call
setOperationAction on it. Beware: as a node with 2 results, it cannot
be selected from TableGen.
Currently, no use is made of the extra information provided in this
patch. Test updates are almost entirely adapting the input IR to the
new scheme.
Summary for out of tree users:
------------------------------
+ Legacy Bitcode files are upgraded during read.
+ Legacy assembly IR files will be invalid.
+ Front-ends must adapt to different type for "cmpxchg".
+ Backends should be unaffected by default.
llvm-svn: 210903
2014-06-13 16:24:07 +02:00
|
|
|
%pair = cmpxchg i32* %ptr, i32 %a, i32 123 monotonic monotonic
|
|
|
|
|
%b = extractvalue { i32, i1 } %pair, 0
|
2014-01-01 23:11:54 +01:00
|
|
|
ret i32 %b
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: test_cmpxchg_i64
|
TableGen: fix operand counting for aliases
TableGen has a fairly dubious heuristic to decide whether an alias should be
printed: does the alias have lest operands than the real instruction. This is
bad enough (particularly with no way to override it), but it should at least be
calculated consistently for both strings.
This patch implements that logic: first get the *correct* string for the
variant, in the same way as the Matcher, without guessing; then count the
number of whitespace chars.
There are basically 4 changes this brings about after the previous
commits; all of these appear to be good, so I have changed the tests:
+ ARM64: we print "neg X, Y" instead of "sub X, xzr, Y".
+ ARM64: we skip implicit "uxtx" and "uxtw" modifiers.
+ Sparc: we print "mov A, B" instead of "or %g0, A, B".
+ Sparc: we print "fcmpX A, B" instead of "fcmpX %fcc0, A, B"
llvm-svn: 208969
2014-05-16 11:42:04 +02:00
|
|
|
; CHECK: mov 123, [[R:%[gilo][0-7]]]
|
2014-01-01 23:11:54 +01:00
|
|
|
; CHECK: casx [%o1], %o0, [[R]]
|
|
|
|
|
|
|
|
|
|
define i64 @test_cmpxchg_i64(i64 %a, i64* %ptr) {
|
|
|
|
|
entry:
|
IR: add "cmpxchg weak" variant to support permitted failure.
This commit adds a weak variant of the cmpxchg operation, as described
in C++11. A cmpxchg instruction with this modifier is permitted to
fail to store, even if the comparison indicated it should.
As a result, cmpxchg instructions must return a flag indicating
success in addition to their original iN value loaded. Thus, for
uniformity *all* cmpxchg instructions now return "{ iN, i1 }". The
second flag is 1 when the store succeeded.
At the DAG level, a new ATOMIC_CMP_SWAP_WITH_SUCCESS node has been
added as the natural representation for the new cmpxchg instructions.
It is a strong cmpxchg.
By default this gets Expanded to the existing ATOMIC_CMP_SWAP during
Legalization, so existing backends should see no change in behaviour.
If they wish to deal with the enhanced node instead, they can call
setOperationAction on it. Beware: as a node with 2 results, it cannot
be selected from TableGen.
Currently, no use is made of the extra information provided in this
patch. Test updates are almost entirely adapting the input IR to the
new scheme.
Summary for out of tree users:
------------------------------
+ Legacy Bitcode files are upgraded during read.
+ Legacy assembly IR files will be invalid.
+ Front-ends must adapt to different type for "cmpxchg".
+ Backends should be unaffected by default.
llvm-svn: 210903
2014-06-13 16:24:07 +02:00
|
|
|
%pair = cmpxchg i64* %ptr, i64 %a, i64 123 monotonic monotonic
|
|
|
|
|
%b = extractvalue { i64, i1 } %pair, 0
|
2014-01-01 23:11:54 +01:00
|
|
|
ret i64 %b
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: test_swap_i32
|
TableGen: fix operand counting for aliases
TableGen has a fairly dubious heuristic to decide whether an alias should be
printed: does the alias have lest operands than the real instruction. This is
bad enough (particularly with no way to override it), but it should at least be
calculated consistently for both strings.
This patch implements that logic: first get the *correct* string for the
variant, in the same way as the Matcher, without guessing; then count the
number of whitespace chars.
There are basically 4 changes this brings about after the previous
commits; all of these appear to be good, so I have changed the tests:
+ ARM64: we print "neg X, Y" instead of "sub X, xzr, Y".
+ ARM64: we skip implicit "uxtx" and "uxtw" modifiers.
+ Sparc: we print "mov A, B" instead of "or %g0, A, B".
+ Sparc: we print "fcmpX A, B" instead of "fcmpX %fcc0, A, B"
llvm-svn: 208969
2014-05-16 11:42:04 +02:00
|
|
|
; CHECK: mov 42, [[R:%[gilo][0-7]]]
|
2014-01-01 23:11:54 +01:00
|
|
|
; CHECK: swap [%o1], [[R]]
|
|
|
|
|
|
|
|
|
|
define i32 @test_swap_i32(i32 %a, i32* %ptr) {
|
|
|
|
|
entry:
|
|
|
|
|
%b = atomicrmw xchg i32* %ptr, i32 42 monotonic
|
|
|
|
|
ret i32 %b
|
|
|
|
|
}
|
2014-01-24 07:23:31 +01:00
|
|
|
|
2014-01-30 05:48:46 +01:00
|
|
|
; CHECK-LABEL: test_swap_i64
|
|
|
|
|
; CHECK: casx [%o1],
|
|
|
|
|
|
|
|
|
|
define i64 @test_swap_i64(i64 %a, i64* %ptr) {
|
|
|
|
|
entry:
|
|
|
|
|
%b = atomicrmw xchg i64* %ptr, i64 42 monotonic
|
|
|
|
|
ret i64 %b
|
|
|
|
|
}
|
|
|
|
|
|
2014-01-24 07:23:31 +01:00
|
|
|
; CHECK-LABEL: test_load_add_32
|
|
|
|
|
; CHECK: membar
|
2014-01-26 07:09:54 +01:00
|
|
|
; CHECK: add [[V:%[gilo][0-7]]], %o1, [[U:%[gilo][0-7]]]
|
|
|
|
|
; CHECK: cas [%o0], [[V]], [[U]]
|
2014-01-24 07:23:31 +01:00
|
|
|
; CHECK: membar
|
|
|
|
|
define zeroext i32 @test_load_add_32(i32* %p, i32 zeroext %v) {
|
|
|
|
|
entry:
|
|
|
|
|
%0 = atomicrmw add i32* %p, i32 %v seq_cst
|
|
|
|
|
ret i32 %0
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: test_load_sub_64
|
|
|
|
|
; CHECK: membar
|
|
|
|
|
; CHECK: sub
|
|
|
|
|
; CHECK: casx [%o0]
|
|
|
|
|
; CHECK: membar
|
|
|
|
|
define zeroext i64 @test_load_sub_64(i64* %p, i64 zeroext %v) {
|
|
|
|
|
entry:
|
|
|
|
|
%0 = atomicrmw sub i64* %p, i64 %v seq_cst
|
|
|
|
|
ret i64 %0
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: test_load_xor_32
|
|
|
|
|
; CHECK: membar
|
|
|
|
|
; CHECK: xor
|
|
|
|
|
; CHECK: cas [%o0]
|
|
|
|
|
; CHECK: membar
|
|
|
|
|
define zeroext i32 @test_load_xor_32(i32* %p, i32 zeroext %v) {
|
|
|
|
|
entry:
|
|
|
|
|
%0 = atomicrmw xor i32* %p, i32 %v seq_cst
|
|
|
|
|
ret i32 %0
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: test_load_and_32
|
|
|
|
|
; CHECK: membar
|
|
|
|
|
; CHECK: and
|
|
|
|
|
; CHECK-NOT: xor
|
|
|
|
|
; CHECK: cas [%o0]
|
|
|
|
|
; CHECK: membar
|
|
|
|
|
define zeroext i32 @test_load_and_32(i32* %p, i32 zeroext %v) {
|
|
|
|
|
entry:
|
|
|
|
|
%0 = atomicrmw and i32* %p, i32 %v seq_cst
|
|
|
|
|
ret i32 %0
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: test_load_nand_32
|
|
|
|
|
; CHECK: membar
|
|
|
|
|
; CHECK: and
|
|
|
|
|
; CHECK: xor
|
|
|
|
|
; CHECK: cas [%o0]
|
|
|
|
|
; CHECK: membar
|
|
|
|
|
define zeroext i32 @test_load_nand_32(i32* %p, i32 zeroext %v) {
|
|
|
|
|
entry:
|
|
|
|
|
%0 = atomicrmw nand i32* %p, i32 %v seq_cst
|
|
|
|
|
ret i32 %0
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: test_load_max_64
|
|
|
|
|
; CHECK: membar
|
|
|
|
|
; CHECK: cmp
|
|
|
|
|
; CHECK: movg %xcc
|
|
|
|
|
; CHECK: casx [%o0]
|
|
|
|
|
; CHECK: membar
|
|
|
|
|
define zeroext i64 @test_load_max_64(i64* %p, i64 zeroext %v) {
|
|
|
|
|
entry:
|
|
|
|
|
%0 = atomicrmw max i64* %p, i64 %v seq_cst
|
|
|
|
|
ret i64 %0
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: test_load_umin_32
|
|
|
|
|
; CHECK: membar
|
|
|
|
|
; CHECK: cmp
|
|
|
|
|
; CHECK: movleu %icc
|
|
|
|
|
; CHECK: cas [%o0]
|
|
|
|
|
; CHECK: membar
|
|
|
|
|
define zeroext i32 @test_load_umin_32(i32* %p, i32 zeroext %v) {
|
|
|
|
|
entry:
|
|
|
|
|
%0 = atomicrmw umin i32* %p, i32 %v seq_cst
|
|
|
|
|
ret i32 %0
|
|
|
|
|
}
|
