2018-12-05 04:14:57 +08:00
|
|
|
; NOTE: Assertions have been autogenerated by utils/update_llc_test_checks.py
|
2017-09-24 13:48:11 +08:00
|
|
|
; RUN: llc -verify-machineinstrs -mtriple=powerpc64-unknown-linux-gnu -O2 \
|
2018-12-05 04:14:57 +08:00
|
|
|
; RUN: -ppc-gpr-icmps=all -ppc-asm-full-reg-names -mcpu=pwr8 < %s | FileCheck %s --check-prefix=CHECK-BE \
|
2017-09-24 13:48:11 +08:00
|
|
|
; RUN: --implicit-check-not cmpw --implicit-check-not cmpd --implicit-check-not cmpl
|
|
|
|
; RUN: llc -verify-machineinstrs -mtriple=powerpc64le-unknown-linux-gnu -O2 \
|
2018-12-05 04:14:57 +08:00
|
|
|
; RUN: -ppc-gpr-icmps=all -ppc-asm-full-reg-names -mcpu=pwr8 < %s | FileCheck %s --check-prefix=CHECK-LE \
|
2017-09-24 13:48:11 +08:00
|
|
|
; RUN: --implicit-check-not cmpw --implicit-check-not cmpd --implicit-check-not cmpl
|
|
|
|
@glob = common local_unnamed_addr global i64 0, align 8
|
|
|
|
|
|
|
|
define i64 @test_llgesll(i64 %a, i64 %b) {
|
|
|
|
; CHECK-LABEL: test_llgesll:
|
2017-12-05 01:18:51 +08:00
|
|
|
; CHECK: # %bb.0: # %entry
|
2017-09-24 13:48:11 +08:00
|
|
|
; CHECK-NEXT: sradi r5, r3, 63
|
|
|
|
; CHECK-NEXT: rldicl r6, r4, 1, 63
|
|
|
|
; CHECK-NEXT: subfc r3, r4, r3
|
|
|
|
; CHECK-NEXT: adde r3, r5, r6
|
|
|
|
; CHECK-NEXT: blr
|
2018-12-05 04:14:57 +08:00
|
|
|
; CHECK-BE-LABEL: test_llgesll:
|
|
|
|
; CHECK-BE: # %bb.0: # %entry
|
|
|
|
; CHECK-BE-NEXT: sradi r5, r3, 63
|
|
|
|
; CHECK-BE-NEXT: rldicl r6, r4, 1, 63
|
|
|
|
; CHECK-BE-NEXT: subfc r3, r4, r3
|
|
|
|
; CHECK-BE-NEXT: adde r3, r5, r6
|
|
|
|
; CHECK-BE-NEXT: blr
|
|
|
|
;
|
|
|
|
; CHECK-LE-LABEL: test_llgesll:
|
|
|
|
; CHECK-LE: # %bb.0: # %entry
|
|
|
|
; CHECK-LE-NEXT: sradi r5, r3, 63
|
|
|
|
; CHECK-LE-NEXT: rldicl r6, r4, 1, 63
|
|
|
|
; CHECK-LE-NEXT: subfc r3, r4, r3
|
|
|
|
; CHECK-LE-NEXT: adde r3, r5, r6
|
|
|
|
; CHECK-LE-NEXT: blr
|
2017-09-24 13:48:11 +08:00
|
|
|
entry:
|
|
|
|
%cmp = icmp sge i64 %a, %b
|
|
|
|
%conv1 = zext i1 %cmp to i64
|
|
|
|
ret i64 %conv1
|
|
|
|
}
|
|
|
|
|
|
|
|
define i64 @test_llgesll_sext(i64 %a, i64 %b) {
|
|
|
|
; CHECK-LABEL: test_llgesll_sext:
|
2017-12-05 01:18:51 +08:00
|
|
|
; CHECK: # %bb.0: # %entry
|
2017-09-24 13:48:11 +08:00
|
|
|
; CHECK-NEXT: sradi r5, r3, 63
|
|
|
|
; CHECK-NEXT: rldicl r6, r4, 1, 63
|
|
|
|
; CHECK-NEXT: subfc r3, r4, r3
|
|
|
|
; CHECK-NEXT: adde r3, r5, r6
|
|
|
|
; CHECK-NEXT: neg r3, r3
|
|
|
|
; CHECK-NEXT: blr
|
2018-12-05 04:14:57 +08:00
|
|
|
; CHECK-BE-LABEL: test_llgesll_sext:
|
|
|
|
; CHECK-BE: # %bb.0: # %entry
|
|
|
|
; CHECK-BE-NEXT: sradi r5, r3, 63
|
|
|
|
; CHECK-BE-NEXT: rldicl r6, r4, 1, 63
|
|
|
|
; CHECK-BE-NEXT: subfc r3, r4, r3
|
|
|
|
; CHECK-BE-NEXT: adde r3, r5, r6
|
|
|
|
; CHECK-BE-NEXT: neg r3, r3
|
|
|
|
; CHECK-BE-NEXT: blr
|
|
|
|
;
|
|
|
|
; CHECK-LE-LABEL: test_llgesll_sext:
|
|
|
|
; CHECK-LE: # %bb.0: # %entry
|
|
|
|
; CHECK-LE-NEXT: sradi r5, r3, 63
|
|
|
|
; CHECK-LE-NEXT: rldicl r6, r4, 1, 63
|
|
|
|
; CHECK-LE-NEXT: subfc r3, r4, r3
|
|
|
|
; CHECK-LE-NEXT: adde r3, r5, r6
|
|
|
|
; CHECK-LE-NEXT: neg r3, r3
|
|
|
|
; CHECK-LE-NEXT: blr
|
2017-09-24 13:48:11 +08:00
|
|
|
entry:
|
|
|
|
%cmp = icmp sge i64 %a, %b
|
|
|
|
%conv1 = sext i1 %cmp to i64
|
|
|
|
ret i64 %conv1
|
|
|
|
}
|
|
|
|
|
|
|
|
define i64 @test_llgesll_z(i64 %a) {
|
|
|
|
; CHECK-LABEL: test_llgesll_z:
|
2017-12-05 01:18:51 +08:00
|
|
|
; CHECK: # %bb.0: # %entry
|
[DAGCombiner] extend(ifpositive(X)) -> shift-right (not X)
This is almost the same as an existing IR canonicalization in instcombine,
so I'm assuming this is a good early generic DAG combine too.
The motivation comes from reduced bit-hacking for select-of-constants in IR
after rL331486. We want to restore that functionality in the DAG as noted in
the commit comments for that change and the llvm-dev discussion here:
http://lists.llvm.org/pipermail/llvm-dev/2018-July/124433.html
The PPC and AArch tests show that those targets are already doing something
similar. x86 will be neutral in the minimal case and generally better when
this pattern is extended with other ops as shown in the signbit-shift.ll tests.
Note the asymmetry: we don't include the (extend (ifneg X)) transform because
it already exists in SimplifySelectCC(), and that is verified in the later
unchanged tests in the signbit-shift.ll files. Without the 'not' op, the
general transform to use a shift is always a win because that's a single
instruction.
Alive proofs:
https://rise4fun.com/Alive/ysli
Name: if pos, get -1
%c = icmp sgt i16 %x, -1
%r = sext i1 %c to i16
=>
%n = xor i16 %x, -1
%r = ashr i16 %n, 15
Name: if pos, get 1
%c = icmp sgt i16 %x, -1
%r = zext i1 %c to i16
=>
%n = xor i16 %x, -1
%r = lshr i16 %n, 15
Differential Revision: https://reviews.llvm.org/D48970
llvm-svn: 337130
2018-07-16 00:27:07 +08:00
|
|
|
; CHECK-NEXT: not r3, r3
|
2017-09-24 13:48:11 +08:00
|
|
|
; CHECK-NEXT: rldicl r3, r3, 1, 63
|
|
|
|
; CHECK-NEXT: blr
|
2018-12-05 04:14:57 +08:00
|
|
|
; CHECK-BE-LABEL: test_llgesll_z:
|
|
|
|
; CHECK-BE: # %bb.0: # %entry
|
|
|
|
; CHECK-BE-NEXT: not r3, r3
|
|
|
|
; CHECK-BE-NEXT: rldicl r3, r3, 1, 63
|
|
|
|
; CHECK-BE-NEXT: blr
|
|
|
|
;
|
|
|
|
; CHECK-LE-LABEL: test_llgesll_z:
|
|
|
|
; CHECK-LE: # %bb.0: # %entry
|
|
|
|
; CHECK-LE-NEXT: not r3, r3
|
|
|
|
; CHECK-LE-NEXT: rldicl r3, r3, 1, 63
|
|
|
|
; CHECK-LE-NEXT: blr
|
2017-09-24 13:48:11 +08:00
|
|
|
entry:
|
|
|
|
%cmp = icmp sgt i64 %a, -1
|
|
|
|
%conv1 = zext i1 %cmp to i64
|
|
|
|
ret i64 %conv1
|
|
|
|
}
|
|
|
|
|
|
|
|
define i64 @test_llgesll_sext_z(i64 %a) {
|
|
|
|
; CHECK-LABEL: test_llgesll_sext_z:
|
2017-12-05 01:18:51 +08:00
|
|
|
; CHECK: # %bb.0: # %entry
|
2017-09-24 13:48:11 +08:00
|
|
|
; CHECK-NEXT: not r3, r3
|
[DAGCombiner] extend(ifpositive(X)) -> shift-right (not X)
This is almost the same as an existing IR canonicalization in instcombine,
so I'm assuming this is a good early generic DAG combine too.
The motivation comes from reduced bit-hacking for select-of-constants in IR
after rL331486. We want to restore that functionality in the DAG as noted in
the commit comments for that change and the llvm-dev discussion here:
http://lists.llvm.org/pipermail/llvm-dev/2018-July/124433.html
The PPC and AArch tests show that those targets are already doing something
similar. x86 will be neutral in the minimal case and generally better when
this pattern is extended with other ops as shown in the signbit-shift.ll tests.
Note the asymmetry: we don't include the (extend (ifneg X)) transform because
it already exists in SimplifySelectCC(), and that is verified in the later
unchanged tests in the signbit-shift.ll files. Without the 'not' op, the
general transform to use a shift is always a win because that's a single
instruction.
Alive proofs:
https://rise4fun.com/Alive/ysli
Name: if pos, get -1
%c = icmp sgt i16 %x, -1
%r = sext i1 %c to i16
=>
%n = xor i16 %x, -1
%r = ashr i16 %n, 15
Name: if pos, get 1
%c = icmp sgt i16 %x, -1
%r = zext i1 %c to i16
=>
%n = xor i16 %x, -1
%r = lshr i16 %n, 15
Differential Revision: https://reviews.llvm.org/D48970
llvm-svn: 337130
2018-07-16 00:27:07 +08:00
|
|
|
; CHECK-NEXT: sradi r3, r3, 63
|
2017-09-24 13:48:11 +08:00
|
|
|
; CHECK-NEXT: blr
|
2018-12-05 04:14:57 +08:00
|
|
|
; CHECK-BE-LABEL: test_llgesll_sext_z:
|
|
|
|
; CHECK-BE: # %bb.0: # %entry
|
|
|
|
; CHECK-BE-NEXT: not r3, r3
|
|
|
|
; CHECK-BE-NEXT: sradi r3, r3, 63
|
|
|
|
; CHECK-BE-NEXT: blr
|
|
|
|
;
|
|
|
|
; CHECK-LE-LABEL: test_llgesll_sext_z:
|
|
|
|
; CHECK-LE: # %bb.0: # %entry
|
|
|
|
; CHECK-LE-NEXT: not r3, r3
|
|
|
|
; CHECK-LE-NEXT: sradi r3, r3, 63
|
|
|
|
; CHECK-LE-NEXT: blr
|
2017-09-24 13:48:11 +08:00
|
|
|
entry:
|
|
|
|
%cmp = icmp sgt i64 %a, -1
|
|
|
|
%conv1 = sext i1 %cmp to i64
|
|
|
|
ret i64 %conv1
|
|
|
|
}
|
|
|
|
|
|
|
|
define void @test_llgesll_store(i64 %a, i64 %b) {
|
|
|
|
; CHECK-LABEL: test_llgesll_store:
|
2017-12-05 01:18:51 +08:00
|
|
|
; CHECK: # %bb.0: # %entry
|
2018-12-05 04:14:57 +08:00
|
|
|
; CHECK-NEXT: sradi r6, r3, 63
|
|
|
|
; CHECK-NEXT: addis r5, r2, glob@toc@ha
|
|
|
|
; CHECK-NEXT: subfc r3, r4, r3
|
|
|
|
; CHECK-NEXT: rldicl r3, r4, 1, 63
|
|
|
|
; CHECK-NEXT: adde r3, r6, r3
|
|
|
|
; CHECK-NEXT: std r3, glob@toc@l(r5)
|
2017-09-24 13:48:11 +08:00
|
|
|
; CHECK-NEXT: blr
|
2018-12-05 04:14:57 +08:00
|
|
|
; CHECK-BE-LABEL: test_llgesll_store:
|
|
|
|
; CHECK-BE: # %bb.0: # %entry
|
|
|
|
; CHECK-BE-NEXT: addis r5, r2, .LC0@toc@ha
|
|
|
|
; CHECK-BE-NEXT: sradi r6, r3, 63
|
|
|
|
; CHECK-BE-NEXT: ld r5, .LC0@toc@l(r5)
|
|
|
|
; CHECK-BE-NEXT: subfc r3, r4, r3
|
|
|
|
; CHECK-BE-NEXT: rldicl r3, r4, 1, 63
|
|
|
|
; CHECK-BE-NEXT: adde r3, r6, r3
|
|
|
|
; CHECK-BE-NEXT: std r3, 0(r5)
|
|
|
|
; CHECK-BE-NEXT: blr
|
|
|
|
;
|
|
|
|
; CHECK-LE-LABEL: test_llgesll_store:
|
|
|
|
; CHECK-LE: # %bb.0: # %entry
|
|
|
|
; CHECK-LE-NEXT: sradi r6, r3, 63
|
|
|
|
; CHECK-LE-NEXT: addis r5, r2, glob@toc@ha
|
|
|
|
; CHECK-LE-NEXT: subfc r3, r4, r3
|
|
|
|
; CHECK-LE-NEXT: rldicl r3, r4, 1, 63
|
|
|
|
; CHECK-LE-NEXT: adde r3, r6, r3
|
|
|
|
; CHECK-LE-NEXT: std r3, glob@toc@l(r5)
|
|
|
|
; CHECK-LE-NEXT: blr
|
2017-09-24 13:48:11 +08:00
|
|
|
entry:
|
|
|
|
%cmp = icmp sge i64 %a, %b
|
|
|
|
%conv1 = zext i1 %cmp to i64
|
|
|
|
store i64 %conv1, i64* @glob, align 8
|
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
|
|
|
define void @test_llgesll_sext_store(i64 %a, i64 %b) {
|
|
|
|
; CHECK-LABEL: test_llgesll_sext_store:
|
2017-12-05 01:18:51 +08:00
|
|
|
; CHECK: # %bb.0: # %entry
|
2017-09-24 13:48:11 +08:00
|
|
|
; CHECK-NEXT: sradi r6, r3, 63
|
2018-12-05 04:14:57 +08:00
|
|
|
; CHECK-NEXT: addis r5, r2, glob@toc@ha
|
2017-09-24 13:48:11 +08:00
|
|
|
; CHECK-NEXT: subfc r3, r4, r3
|
|
|
|
; CHECK-NEXT: rldicl r3, r4, 1, 63
|
|
|
|
; CHECK-NEXT: adde r3, r6, r3
|
|
|
|
; CHECK-NEXT: neg r3, r3
|
2018-12-05 04:14:57 +08:00
|
|
|
; CHECK-NEXT: std r3, glob@toc@l(r5)
|
2017-09-24 13:48:11 +08:00
|
|
|
; CHECK-NEXT: blr
|
2018-12-05 04:14:57 +08:00
|
|
|
; CHECK-BE-LABEL: test_llgesll_sext_store:
|
|
|
|
; CHECK-BE: # %bb.0: # %entry
|
|
|
|
; CHECK-BE-NEXT: sradi r6, r3, 63
|
|
|
|
; CHECK-BE-NEXT: addis r5, r2, .LC0@toc@ha
|
|
|
|
; CHECK-BE-NEXT: subfc r3, r4, r3
|
|
|
|
; CHECK-BE-NEXT: rldicl r3, r4, 1, 63
|
|
|
|
; CHECK-BE-NEXT: ld r4, .LC0@toc@l(r5)
|
|
|
|
; CHECK-BE-NEXT: adde r3, r6, r3
|
|
|
|
; CHECK-BE-NEXT: neg r3, r3
|
|
|
|
; CHECK-BE-NEXT: std r3, 0(r4)
|
|
|
|
; CHECK-BE-NEXT: blr
|
|
|
|
;
|
|
|
|
; CHECK-LE-LABEL: test_llgesll_sext_store:
|
|
|
|
; CHECK-LE: # %bb.0: # %entry
|
|
|
|
; CHECK-LE-NEXT: sradi r6, r3, 63
|
|
|
|
; CHECK-LE-NEXT: addis r5, r2, glob@toc@ha
|
|
|
|
; CHECK-LE-NEXT: subfc r3, r4, r3
|
|
|
|
; CHECK-LE-NEXT: rldicl r3, r4, 1, 63
|
|
|
|
; CHECK-LE-NEXT: adde r3, r6, r3
|
|
|
|
; CHECK-LE-NEXT: neg r3, r3
|
|
|
|
; CHECK-LE-NEXT: std r3, glob@toc@l(r5)
|
|
|
|
; CHECK-LE-NEXT: blr
|
2017-09-24 13:48:11 +08:00
|
|
|
entry:
|
|
|
|
%cmp = icmp sge i64 %a, %b
|
|
|
|
%conv1 = sext i1 %cmp to i64
|
|
|
|
store i64 %conv1, i64* @glob, align 8
|
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
|
|
|
define void @test_llgesll_z_store(i64 %a) {
|
|
|
|
; CHECK-LABEL: test_llgesll_z_store:
|
2017-12-05 01:18:51 +08:00
|
|
|
; CHECK: # %bb.0: # %entry
|
[DAGCombiner] extend(ifpositive(X)) -> shift-right (not X)
This is almost the same as an existing IR canonicalization in instcombine,
so I'm assuming this is a good early generic DAG combine too.
The motivation comes from reduced bit-hacking for select-of-constants in IR
after rL331486. We want to restore that functionality in the DAG as noted in
the commit comments for that change and the llvm-dev discussion here:
http://lists.llvm.org/pipermail/llvm-dev/2018-July/124433.html
The PPC and AArch tests show that those targets are already doing something
similar. x86 will be neutral in the minimal case and generally better when
this pattern is extended with other ops as shown in the signbit-shift.ll tests.
Note the asymmetry: we don't include the (extend (ifneg X)) transform because
it already exists in SimplifySelectCC(), and that is verified in the later
unchanged tests in the signbit-shift.ll files. Without the 'not' op, the
general transform to use a shift is always a win because that's a single
instruction.
Alive proofs:
https://rise4fun.com/Alive/ysli
Name: if pos, get -1
%c = icmp sgt i16 %x, -1
%r = sext i1 %c to i16
=>
%n = xor i16 %x, -1
%r = ashr i16 %n, 15
Name: if pos, get 1
%c = icmp sgt i16 %x, -1
%r = zext i1 %c to i16
=>
%n = xor i16 %x, -1
%r = lshr i16 %n, 15
Differential Revision: https://reviews.llvm.org/D48970
llvm-svn: 337130
2018-07-16 00:27:07 +08:00
|
|
|
; CHECK-NEXT: not r3, r3
|
2018-12-05 04:14:57 +08:00
|
|
|
; CHECK-NEXT: addis r4, r2, glob@toc@ha
|
[DAGCombiner] extend(ifpositive(X)) -> shift-right (not X)
This is almost the same as an existing IR canonicalization in instcombine,
so I'm assuming this is a good early generic DAG combine too.
The motivation comes from reduced bit-hacking for select-of-constants in IR
after rL331486. We want to restore that functionality in the DAG as noted in
the commit comments for that change and the llvm-dev discussion here:
http://lists.llvm.org/pipermail/llvm-dev/2018-July/124433.html
The PPC and AArch tests show that those targets are already doing something
similar. x86 will be neutral in the minimal case and generally better when
this pattern is extended with other ops as shown in the signbit-shift.ll tests.
Note the asymmetry: we don't include the (extend (ifneg X)) transform because
it already exists in SimplifySelectCC(), and that is verified in the later
unchanged tests in the signbit-shift.ll files. Without the 'not' op, the
general transform to use a shift is always a win because that's a single
instruction.
Alive proofs:
https://rise4fun.com/Alive/ysli
Name: if pos, get -1
%c = icmp sgt i16 %x, -1
%r = sext i1 %c to i16
=>
%n = xor i16 %x, -1
%r = ashr i16 %n, 15
Name: if pos, get 1
%c = icmp sgt i16 %x, -1
%r = zext i1 %c to i16
=>
%n = xor i16 %x, -1
%r = lshr i16 %n, 15
Differential Revision: https://reviews.llvm.org/D48970
llvm-svn: 337130
2018-07-16 00:27:07 +08:00
|
|
|
; CHECK-NEXT: rldicl r3, r3, 1, 63
|
2018-12-05 04:14:57 +08:00
|
|
|
; CHECK-NEXT: std r3, glob@toc@l(r4)
|
2017-09-24 13:48:11 +08:00
|
|
|
; CHECK-NEXT: blr
|
2018-12-05 04:14:57 +08:00
|
|
|
; CHECK-BE-LABEL: test_llgesll_z_store:
|
|
|
|
; CHECK-BE: # %bb.0: # %entry
|
|
|
|
; CHECK-BE-NEXT: addis r4, r2, .LC0@toc@ha
|
|
|
|
; CHECK-BE-NEXT: not r3, r3
|
|
|
|
; CHECK-BE-NEXT: ld r4, .LC0@toc@l(r4)
|
|
|
|
; CHECK-BE-NEXT: rldicl r3, r3, 1, 63
|
|
|
|
; CHECK-BE-NEXT: std r3, 0(r4)
|
|
|
|
; CHECK-BE-NEXT: blr
|
|
|
|
;
|
|
|
|
; CHECK-LE-LABEL: test_llgesll_z_store:
|
|
|
|
; CHECK-LE: # %bb.0: # %entry
|
|
|
|
; CHECK-LE-NEXT: not r3, r3
|
|
|
|
; CHECK-LE-NEXT: addis r4, r2, glob@toc@ha
|
|
|
|
; CHECK-LE-NEXT: rldicl r3, r3, 1, 63
|
|
|
|
; CHECK-LE-NEXT: std r3, glob@toc@l(r4)
|
|
|
|
; CHECK-LE-NEXT: blr
|
2017-09-24 13:48:11 +08:00
|
|
|
entry:
|
|
|
|
%cmp = icmp sgt i64 %a, -1
|
|
|
|
%conv1 = zext i1 %cmp to i64
|
|
|
|
store i64 %conv1, i64* @glob, align 8
|
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
|
|
|
define void @test_llgesll_sext_z_store(i64 %a) {
|
|
|
|
; CHECK-LABEL: test_llgesll_sext_z_store:
|
2017-12-05 01:18:51 +08:00
|
|
|
; CHECK: # %bb.0: # %entry
|
2017-09-24 13:48:11 +08:00
|
|
|
; CHECK-NEXT: not r3, r3
|
2018-12-05 04:14:57 +08:00
|
|
|
; CHECK-NEXT: addis r4, r2, glob@toc@ha
|
[DAGCombiner] extend(ifpositive(X)) -> shift-right (not X)
This is almost the same as an existing IR canonicalization in instcombine,
so I'm assuming this is a good early generic DAG combine too.
The motivation comes from reduced bit-hacking for select-of-constants in IR
after rL331486. We want to restore that functionality in the DAG as noted in
the commit comments for that change and the llvm-dev discussion here:
http://lists.llvm.org/pipermail/llvm-dev/2018-July/124433.html
The PPC and AArch tests show that those targets are already doing something
similar. x86 will be neutral in the minimal case and generally better when
this pattern is extended with other ops as shown in the signbit-shift.ll tests.
Note the asymmetry: we don't include the (extend (ifneg X)) transform because
it already exists in SimplifySelectCC(), and that is verified in the later
unchanged tests in the signbit-shift.ll files. Without the 'not' op, the
general transform to use a shift is always a win because that's a single
instruction.
Alive proofs:
https://rise4fun.com/Alive/ysli
Name: if pos, get -1
%c = icmp sgt i16 %x, -1
%r = sext i1 %c to i16
=>
%n = xor i16 %x, -1
%r = ashr i16 %n, 15
Name: if pos, get 1
%c = icmp sgt i16 %x, -1
%r = zext i1 %c to i16
=>
%n = xor i16 %x, -1
%r = lshr i16 %n, 15
Differential Revision: https://reviews.llvm.org/D48970
llvm-svn: 337130
2018-07-16 00:27:07 +08:00
|
|
|
; CHECK-NEXT: sradi r3, r3, 63
|
2018-12-05 04:14:57 +08:00
|
|
|
; CHECK-NEXT: std r3, glob@toc@l(r4)
|
2017-09-24 13:48:11 +08:00
|
|
|
; CHECK-NEXT: blr
|
2018-12-05 04:14:57 +08:00
|
|
|
; CHECK-BE-LABEL: test_llgesll_sext_z_store:
|
|
|
|
; CHECK-BE: # %bb.0: # %entry
|
|
|
|
; CHECK-BE-NEXT: addis r4, r2, .LC0@toc@ha
|
|
|
|
; CHECK-BE-NEXT: not r3, r3
|
|
|
|
; CHECK-BE-NEXT: ld r4, .LC0@toc@l(r4)
|
|
|
|
; CHECK-BE-NEXT: sradi r3, r3, 63
|
|
|
|
; CHECK-BE-NEXT: std r3, 0(r4)
|
|
|
|
; CHECK-BE-NEXT: blr
|
|
|
|
;
|
|
|
|
; CHECK-LE-LABEL: test_llgesll_sext_z_store:
|
|
|
|
; CHECK-LE: # %bb.0: # %entry
|
|
|
|
; CHECK-LE-NEXT: not r3, r3
|
|
|
|
; CHECK-LE-NEXT: addis r4, r2, glob@toc@ha
|
|
|
|
; CHECK-LE-NEXT: sradi r3, r3, 63
|
|
|
|
; CHECK-LE-NEXT: std r3, glob@toc@l(r4)
|
|
|
|
; CHECK-LE-NEXT: blr
|
2017-09-24 13:48:11 +08:00
|
|
|
entry:
|
|
|
|
%cmp = icmp sgt i64 %a, -1
|
|
|
|
%conv1 = sext i1 %cmp to i64
|
|
|
|
store i64 %conv1, i64* @glob, align 8
|
|
|
|
ret void
|
|
|
|
}
|