2013-05-06 18:17:29 +02:00
|
|
|
; Test 16-bit compare and swap.
|
|
|
|
;
|
|
|
|
; RUN: llc < %s -mtriple=s390x-linux-gnu | FileCheck %s -check-prefix=CHECK-MAIN
|
|
|
|
; RUN: llc < %s -mtriple=s390x-linux-gnu | FileCheck %s -check-prefix=CHECK-SHIFT
|
|
|
|
|
|
|
|
; Check compare and swap with a variable.
|
|
|
|
; - CHECK is for the main loop.
|
|
|
|
; - CHECK-SHIFT makes sure that the negated shift count used by the second
|
|
|
|
; RLL is set up correctly. The negation is independent of the NILL and L
|
|
|
|
; tested in CHECK. CHECK-SHIFT also checks that %r3 is not modified before
|
|
|
|
; being used in the RISBG (in contrast to things like atomic addition,
|
|
|
|
; which shift %r3 left so that %b is at the high end of the word).
|
|
|
|
define i16 @f1(i16 %dummy, i16 *%src, i16 %cmp, i16 %swap) {
|
2013-07-14 08:24:09 +02:00
|
|
|
; CHECK-MAIN-LABEL: f1:
|
2016-04-29 21:53:16 +02:00
|
|
|
; CHECK-MAIN: risbg [[RISBG:%r[1-9]+]], %r3, 0, 189, 0{{$}}
|
2017-10-06 15:59:28 +02:00
|
|
|
; CHECK-MAIN-DAG: sll %r3, 3
|
|
|
|
; CHECK-MAIN-DAG: l [[OLD:%r[0-9]+]], 0([[RISBG]])
|
2013-05-06 18:17:29 +02:00
|
|
|
; CHECK-MAIN: [[LOOP:\.[^ ]*]]:
|
2016-04-29 21:53:16 +02:00
|
|
|
; CHECK-MAIN: rll %r2, [[OLD]], 16(%r3)
|
2013-05-06 18:17:29 +02:00
|
|
|
; CHECK-MAIN: risbg %r4, %r2, 32, 47, 0
|
2013-05-28 12:41:11 +02:00
|
|
|
; CHECK-MAIN: crjlh %r2, %r4, [[EXIT:\.[^ ]*]]
|
2013-05-06 18:17:29 +02:00
|
|
|
; CHECK-MAIN: risbg %r5, %r2, 32, 47, 0
|
|
|
|
; CHECK-MAIN: rll [[NEW:%r[0-9]+]], %r5, -16({{%r[1-9]+}})
|
2016-04-29 21:53:16 +02:00
|
|
|
; CHECK-MAIN: cs [[OLD]], [[NEW]], 0([[RISBG]])
|
[SystemZ] Be more careful about inverting CC masks
System z branches have a mask to select which of the 4 CC values should
cause the branch to be taken. We can invert a branch by inverting the mask.
However, not all instructions can produce all 4 CC values, so inverting
the branch like this can lead to some oddities. For example, integer
comparisons only produce a CC of 0 (equal), 1 (less) or 2 (greater).
If an integer EQ is reversed to NE before instruction selection,
the branch will test for 1 or 2. If instead the branch is reversed
after instruction selection (by inverting the mask), it will test for
1, 2 or 3. Both are correct, but the second isn't really canonical.
This patch therefore keeps track of which CC values are possible
and uses this when inverting a mask.
Although this is mostly cosmestic, it fixes undefined behavior
for the CIJNLH in branch-08.ll. Another fix would have been
to mask out bit 0 when generating the fused compare and branch,
but the point of this patch is that we shouldn't need to do that
in the first place.
The patch also makes it easier to reuse CC results from other instructions.
llvm-svn: 187495
2013-07-31 14:30:20 +02:00
|
|
|
; CHECK-MAIN: jl [[LOOP]]
|
2013-05-06 18:17:29 +02:00
|
|
|
; CHECK-MAIN: [[EXIT]]:
|
|
|
|
; CHECK-MAIN-NOT: %r2
|
|
|
|
; CHECK-MAIN: br %r14
|
|
|
|
;
|
2013-07-14 08:24:09 +02:00
|
|
|
; CHECK-SHIFT-LABEL: f1:
|
2016-04-29 21:53:16 +02:00
|
|
|
; CHECK-SHIFT: sll %r3, 3
|
|
|
|
; CHECK-SHIFT: lcr [[NEGSHIFT:%r[1-9]+]], %r3
|
2013-05-06 18:17:29 +02:00
|
|
|
; CHECK-SHIFT: rll
|
|
|
|
; CHECK-SHIFT: rll {{%r[0-9]+}}, %r5, -16([[NEGSHIFT]])
|
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 i16 *%src, i16 %cmp, i16 %swap seq_cst seq_cst
|
|
|
|
%res = extractvalue { i16, i1 } %pair, 0
|
2013-05-06 18:17:29 +02:00
|
|
|
ret i16 %res
|
|
|
|
}
|
|
|
|
|
|
|
|
; Check compare and swap with constants. We should force the constants into
|
|
|
|
; registers and use the sequence above.
|
|
|
|
define i16 @f2(i16 *%src) {
|
2013-07-14 08:24:09 +02:00
|
|
|
; CHECK-LABEL: f2:
|
2013-05-06 18:17:29 +02:00
|
|
|
; CHECK: lhi [[CMP:%r[0-9]+]], 42
|
|
|
|
; CHECK: risbg [[CMP]], {{%r[0-9]+}}, 32, 47, 0
|
|
|
|
; CHECK: risbg
|
|
|
|
; CHECK: br %r14
|
|
|
|
;
|
2013-07-14 08:24:09 +02:00
|
|
|
; CHECK-SHIFT-LABEL: f2:
|
2013-05-06 18:17:29 +02:00
|
|
|
; CHECK-SHIFT: lhi [[SWAP:%r[0-9]+]], 88
|
|
|
|
; CHECK-SHIFT: risbg
|
|
|
|
; CHECK-SHIFT: risbg [[SWAP]], {{%r[0-9]+}}, 32, 47, 0
|
|
|
|
; CHECK-SHIFT: br %r14
|
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 i16 *%src, i16 42, i16 88 seq_cst seq_cst
|
|
|
|
%res = extractvalue { i16, i1 } %pair, 0
|
2013-05-06 18:17:29 +02:00
|
|
|
ret i16 %res
|
|
|
|
}
|
2017-09-28 18:22:54 +02:00
|
|
|
|
|
|
|
; Check generating the comparison result.
|
|
|
|
define i32 @f3(i16 %dummy, i16 *%src, i16 %cmp, i16 %swap) {
|
|
|
|
; CHECK-MAIN-LABEL: f3:
|
|
|
|
; CHECK-MAIN: risbg [[RISBG:%r[1-9]+]], %r3, 0, 189, 0{{$}}
|
2017-10-06 15:59:28 +02:00
|
|
|
; CHECK-MAIN-DAG: sll %r3, 3
|
|
|
|
; CHECK-MAIN-DAG: l [[OLD:%r[0-9]+]], 0([[RISBG]])
|
2017-09-28 18:22:54 +02:00
|
|
|
; CHECK-MAIN: [[LOOP:\.[^ ]*]]:
|
|
|
|
; CHECK-MAIN: rll [[TMP:%r[0-9]+]], [[OLD]], 16(%r3)
|
|
|
|
; CHECK-MAIN: risbg %r4, [[TMP]], 32, 47, 0
|
2017-09-29 00:08:25 +02:00
|
|
|
; CHECK-MAIN: cr [[TMP]], %r4
|
|
|
|
; CHECK-MAIN: jlh [[EXIT:\.[^ ]*]]
|
2017-09-28 18:22:54 +02:00
|
|
|
; CHECK-MAIN: risbg %r5, [[TMP]], 32, 47, 0
|
|
|
|
; CHECK-MAIN: rll [[NEW:%r[0-9]+]], %r5, -16({{%r[1-9]+}})
|
|
|
|
; CHECK-MAIN: cs [[OLD]], [[NEW]], 0([[RISBG]])
|
|
|
|
; CHECK-MAIN: jl [[LOOP]]
|
|
|
|
; CHECK-MAIN: [[EXIT]]:
|
|
|
|
; CHECK-MAIN-NEXT: ipm %r2
|
|
|
|
; CHECK-MAIN-NEXT: afi %r2, -268435456
|
|
|
|
; CHECK-MAIN-NEXT: srl %r2, 31
|
|
|
|
; CHECK-MAIN-NOT: %r2
|
|
|
|
; CHECK-MAIN: br %r14
|
|
|
|
;
|
|
|
|
; CHECK-SHIFT-LABEL: f3:
|
|
|
|
; CHECK-SHIFT: sll %r3, 3
|
|
|
|
; CHECK-SHIFT: lcr [[NEGSHIFT:%r[1-9]+]], %r3
|
|
|
|
; CHECK-SHIFT: rll
|
|
|
|
; CHECK-SHIFT: rll {{%r[0-9]+}}, %r5, -16([[NEGSHIFT]])
|
|
|
|
%pair = cmpxchg i16 *%src, i16 %cmp, i16 %swap seq_cst seq_cst
|
|
|
|
%val = extractvalue { i16, i1 } %pair, 1
|
|
|
|
%res = zext i1 %val to i32
|
|
|
|
ret i32 %res
|
|
|
|
}
|
|
|
|
|
2018-01-19 21:54:18 +01:00
|
|
|
declare void @g()
|
|
|
|
|
|
|
|
; Check using the comparison result for a branch.
|
|
|
|
; CHECK-LABEL: f4
|
|
|
|
; CHECK-MAIN-LABEL: f4:
|
|
|
|
; CHECK-MAIN: risbg [[RISBG:%r[1-9]+]], %r2, 0, 189, 0{{$}}
|
|
|
|
; CHECK-MAIN-DAG: sll %r2, 3
|
|
|
|
; CHECK-MAIN-DAG: l [[OLD:%r[0-9]+]], 0([[RISBG]])
|
|
|
|
; CHECK-MAIN: [[LOOP:\.[^ ]*]]:
|
|
|
|
; CHECK-MAIN: rll [[TMP:%r[0-9]+]], [[OLD]], 16(%r2)
|
|
|
|
; CHECK-MAIN: risbg %r3, [[TMP]], 32, 47, 0
|
|
|
|
; CHECK-MAIN: cr [[TMP]], %r3
|
|
|
|
; CHECK-MAIN: jlh [[EXIT:\.[^ ]*]]
|
|
|
|
; CHECK-MAIN: risbg %r4, [[TMP]], 32, 47, 0
|
|
|
|
; CHECK-MAIN: rll [[NEW:%r[0-9]+]], %r4, -16({{%r[1-9]+}})
|
|
|
|
; CHECK-MAIN: cs [[OLD]], [[NEW]], 0([[RISBG]])
|
|
|
|
; CHECK-MAIN: jl [[LOOP]]
|
|
|
|
; CHECK-MAIN: [[EXIT]]:
|
|
|
|
; CHECK-MAIN-NEXT: jlh [[LABEL:\.[^ ]*]]
|
|
|
|
; CHECK-MAIN: jg g
|
|
|
|
; CHECK-MAIN: [[LABEL]]:
|
|
|
|
; CHECK-MAIN: br %r14
|
|
|
|
;
|
|
|
|
; CHECK-SHIFT-LABEL: f4:
|
|
|
|
; CHECK-SHIFT: sll %r2, 3
|
|
|
|
; CHECK-SHIFT: lcr [[NEGSHIFT:%r[1-9]+]], %r2
|
|
|
|
; CHECK-SHIFT: rll
|
|
|
|
; CHECK-SHIFT: rll {{%r[0-9]+}}, %r4, -16([[NEGSHIFT]])
|
|
|
|
define void @f4(i16 *%src, i16 %cmp, i16 %swap) {
|
|
|
|
%pair = cmpxchg i16 *%src, i16 %cmp, i16 %swap seq_cst seq_cst
|
|
|
|
%cond = extractvalue { i16, i1 } %pair, 1
|
|
|
|
br i1 %cond, label %call, label %exit
|
|
|
|
|
|
|
|
call:
|
|
|
|
tail call void @g()
|
|
|
|
br label %exit
|
|
|
|
|
|
|
|
exit:
|
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
|
|
|
; ... and the same with the inverted direction.
|
|
|
|
; CHECK-MAIN-LABEL: f5:
|
|
|
|
; CHECK-MAIN: risbg [[RISBG:%r[1-9]+]], %r2, 0, 189, 0{{$}}
|
|
|
|
; CHECK-MAIN-DAG: sll %r2, 3
|
|
|
|
; CHECK-MAIN-DAG: l [[OLD:%r[0-9]+]], 0([[RISBG]])
|
|
|
|
; CHECK-MAIN: [[LOOP:\.[^ ]*]]:
|
|
|
|
; CHECK-MAIN: rll [[TMP:%r[0-9]+]], [[OLD]], 16(%r2)
|
|
|
|
; CHECK-MAIN: risbg %r3, [[TMP]], 32, 47, 0
|
|
|
|
; CHECK-MAIN: cr [[TMP]], %r3
|
|
|
|
; CHECK-MAIN: jlh [[EXIT:\.[^ ]*]]
|
|
|
|
; CHECK-MAIN: risbg %r4, [[TMP]], 32, 47, 0
|
|
|
|
; CHECK-MAIN: rll [[NEW:%r[0-9]+]], %r4, -16({{%r[1-9]+}})
|
|
|
|
; CHECK-MAIN: cs [[OLD]], [[NEW]], 0([[RISBG]])
|
|
|
|
; CHECK-MAIN: jl [[LOOP]]
|
|
|
|
; CHECK-MAIN: [[EXIT]]:
|
|
|
|
; CHECK-MAIN-NEXT: jlh [[LABEL:\.[^ ]*]]
|
|
|
|
; CHECK-MAIN: br %r14
|
|
|
|
; CHECK-MAIN: [[LABEL]]:
|
|
|
|
; CHECK-MAIN: jg g
|
|
|
|
;
|
|
|
|
; CHECK-SHIFT-LABEL: f5:
|
|
|
|
; CHECK-SHIFT: sll %r2, 3
|
|
|
|
; CHECK-SHIFT: lcr [[NEGSHIFT:%r[1-9]+]], %r2
|
|
|
|
; CHECK-SHIFT: rll
|
|
|
|
; CHECK-SHIFT: rll {{%r[0-9]+}}, %r4, -16([[NEGSHIFT]])
|
|
|
|
define void @f5(i16 *%src, i16 %cmp, i16 %swap) {
|
|
|
|
%pair = cmpxchg i16 *%src, i16 %cmp, i16 %swap seq_cst seq_cst
|
|
|
|
%cond = extractvalue { i16, i1 } %pair, 1
|
|
|
|
br i1 %cond, label %exit, label %call
|
|
|
|
|
|
|
|
call:
|
|
|
|
tail call void @g()
|
|
|
|
br label %exit
|
|
|
|
|
|
|
|
exit:
|
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|