2019-05-09 20:26:39 +08:00
|
|
|
; NOTE: Assertions have been autogenerated by utils/update_llc_test_checks.py
|
2019-10-07 13:29:11 +08:00
|
|
|
; RUN: llc -mcpu=pwr9 -mtriple=powerpc64le-unknown-linux-gnu -O3 -ppc-asm-full-reg-names -verify-machineinstrs < %s | FileCheck %s
|
2019-05-09 20:26:39 +08:00
|
|
|
|
|
|
|
|
; Test cases are generated from:
|
|
|
|
|
; long long NAME(PARAM a, PARAM b) {
|
|
|
|
|
; if (LHS > RHS)
|
|
|
|
|
; return b;
|
|
|
|
|
; if (LHS < RHS)
|
|
|
|
|
; return a;\
|
|
|
|
|
; return a * b;
|
|
|
|
|
; }
|
|
|
|
|
; Please note funtion name is defined as <PARAM>_<LHS>_<RHS>. Take ll_a_op_b__1
|
|
|
|
|
; for example. ll is PARAM, a_op_b (i.e., a << b) is LHS, _1 (i.e., -1) is RHS.
|
|
|
|
|
|
|
|
|
|
target datalayout = "e-m:e-i64:64-n32:64"
|
|
|
|
|
|
|
|
|
|
define i64 @ll_a_op_b__2(i64 %a, i64 %b) {
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-LABEL: ll_a_op_b__2:
|
|
|
|
|
; CHECK: # %bb.0: # %entry
|
|
|
|
|
; CHECK-NEXT: sld r5, r3, r4
|
|
|
|
|
; CHECK-NEXT: cmpdi r5, -2
|
|
|
|
|
; CHECK-NEXT: ble cr0, .LBB0_2
|
|
|
|
|
; CHECK-NEXT: # %bb.1: # %return
|
|
|
|
|
; CHECK-NEXT: mr r3, r4
|
|
|
|
|
; CHECK-NEXT: blr
|
|
|
|
|
; CHECK-NEXT: .LBB0_2: # %if.end
|
|
|
|
|
; CHECK-NEXT: li r5, 1
|
[CGP] Make ICMP_EQ use CR result of ICMP_S(L|G)T dominators
For example:
long long test(long long a, long long b) {
if (a << b > 0)
return b;
if (a << b < 0)
return a;
return a*b;
}
Produces:
sld. 5, 3, 4
ble 0, .LBB0_2
mr 3, 4
blr
.LBB0_2: # %if.end
cmpldi 5, 0
li 5, 1
isel 4, 4, 5, 2
mulld 3, 4, 3
blr
But the compare (cmpldi 5, 0) is redundant and can be removed (CR0 already
contains the result of that comparison).
The root cause of this is that LLVM converts signed comparisons into equality
comparison based on dominance. Equality comparisons are unsigned by default, so
we get either a record-form or cmp (without the l for logical) feeding a cmpl.
That is the situation we want to avoid here.
Differential Revision: https://reviews.llvm.org/D60506
2019-11-12 00:15:52 +08:00
|
|
|
; CHECK-NEXT: isel r4, r5, r4, lt
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-NEXT: mulld r3, r4, r3
|
|
|
|
|
; CHECK-NEXT: blr
|
2019-05-09 20:26:39 +08:00
|
|
|
entry:
|
|
|
|
|
%shl = shl i64 %a, %b
|
|
|
|
|
%cmp = icmp sgt i64 %shl, -2
|
|
|
|
|
br i1 %cmp, label %return, label %if.end
|
|
|
|
|
|
|
|
|
|
if.end: ; preds = %entry
|
|
|
|
|
%cmp2 = icmp eq i64 %shl, -2
|
|
|
|
|
%mul = select i1 %cmp2, i64 %b, i64 1
|
|
|
|
|
%spec.select = mul nsw i64 %mul, %a
|
|
|
|
|
ret i64 %spec.select
|
|
|
|
|
|
|
|
|
|
return: ; preds = %entry
|
|
|
|
|
ret i64 %b
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i64 @ll_a_op_b__1(i64 %a, i64 %b) {
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-LABEL: ll_a_op_b__1:
|
|
|
|
|
; CHECK: # %bb.0: # %entry
|
|
|
|
|
; CHECK-NEXT: sld r5, r3, r4
|
|
|
|
|
; CHECK-NEXT: cmpdi r5, -1
|
|
|
|
|
; CHECK-NEXT: ble cr0, .LBB1_2
|
|
|
|
|
; CHECK-NEXT: # %bb.1: # %return
|
|
|
|
|
; CHECK-NEXT: mr r3, r4
|
|
|
|
|
; CHECK-NEXT: blr
|
|
|
|
|
; CHECK-NEXT: .LBB1_2: # %if.end
|
|
|
|
|
; CHECK-NEXT: li r5, 1
|
[CGP] Make ICMP_EQ use CR result of ICMP_S(L|G)T dominators
For example:
long long test(long long a, long long b) {
if (a << b > 0)
return b;
if (a << b < 0)
return a;
return a*b;
}
Produces:
sld. 5, 3, 4
ble 0, .LBB0_2
mr 3, 4
blr
.LBB0_2: # %if.end
cmpldi 5, 0
li 5, 1
isel 4, 4, 5, 2
mulld 3, 4, 3
blr
But the compare (cmpldi 5, 0) is redundant and can be removed (CR0 already
contains the result of that comparison).
The root cause of this is that LLVM converts signed comparisons into equality
comparison based on dominance. Equality comparisons are unsigned by default, so
we get either a record-form or cmp (without the l for logical) feeding a cmpl.
That is the situation we want to avoid here.
Differential Revision: https://reviews.llvm.org/D60506
2019-11-12 00:15:52 +08:00
|
|
|
; CHECK-NEXT: isel r4, r5, r4, lt
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-NEXT: mulld r3, r4, r3
|
|
|
|
|
; CHECK-NEXT: blr
|
2019-05-09 20:26:39 +08:00
|
|
|
entry:
|
|
|
|
|
%shl = shl i64 %a, %b
|
|
|
|
|
%cmp = icmp sgt i64 %shl, -1
|
|
|
|
|
br i1 %cmp, label %return, label %if.end
|
|
|
|
|
|
|
|
|
|
if.end: ; preds = %entry
|
|
|
|
|
%cmp2 = icmp eq i64 %shl, -1
|
|
|
|
|
%mul = select i1 %cmp2, i64 %b, i64 1
|
|
|
|
|
%spec.select = mul nsw i64 %mul, %a
|
|
|
|
|
ret i64 %spec.select
|
|
|
|
|
|
|
|
|
|
return: ; preds = %entry
|
|
|
|
|
ret i64 %b
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i64 @ll_a_op_b_0(i64 %a, i64 %b) {
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-LABEL: ll_a_op_b_0:
|
|
|
|
|
; CHECK: # %bb.0: # %entry
|
|
|
|
|
; CHECK-NEXT: sld. r5, r3, r4
|
|
|
|
|
; CHECK-NEXT: ble cr0, .LBB2_2
|
|
|
|
|
; CHECK-NEXT: # %bb.1: # %return
|
|
|
|
|
; CHECK-NEXT: mr r3, r4
|
|
|
|
|
; CHECK-NEXT: blr
|
|
|
|
|
; CHECK-NEXT: .LBB2_2: # %if.end
|
|
|
|
|
; CHECK-NEXT: li r5, 1
|
[CGP] Make ICMP_EQ use CR result of ICMP_S(L|G)T dominators
For example:
long long test(long long a, long long b) {
if (a << b > 0)
return b;
if (a << b < 0)
return a;
return a*b;
}
Produces:
sld. 5, 3, 4
ble 0, .LBB0_2
mr 3, 4
blr
.LBB0_2: # %if.end
cmpldi 5, 0
li 5, 1
isel 4, 4, 5, 2
mulld 3, 4, 3
blr
But the compare (cmpldi 5, 0) is redundant and can be removed (CR0 already
contains the result of that comparison).
The root cause of this is that LLVM converts signed comparisons into equality
comparison based on dominance. Equality comparisons are unsigned by default, so
we get either a record-form or cmp (without the l for logical) feeding a cmpl.
That is the situation we want to avoid here.
Differential Revision: https://reviews.llvm.org/D60506
2019-11-12 00:15:52 +08:00
|
|
|
; CHECK-NEXT: isel r4, r5, r4, lt
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-NEXT: mulld r3, r4, r3
|
|
|
|
|
; CHECK-NEXT: blr
|
2019-05-09 20:26:39 +08:00
|
|
|
entry:
|
|
|
|
|
%shl = shl i64 %a, %b
|
|
|
|
|
%cmp = icmp sgt i64 %shl, 0
|
|
|
|
|
br i1 %cmp, label %return, label %if.end
|
|
|
|
|
|
|
|
|
|
if.end: ; preds = %entry
|
|
|
|
|
%cmp2 = icmp eq i64 %shl, 0
|
|
|
|
|
%mul = select i1 %cmp2, i64 %b, i64 1
|
|
|
|
|
%spec.select = mul nsw i64 %mul, %a
|
|
|
|
|
ret i64 %spec.select
|
|
|
|
|
|
|
|
|
|
return: ; preds = %entry
|
|
|
|
|
ret i64 %b
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i64 @ll_a_op_b_1(i64 %a, i64 %b) {
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-LABEL: ll_a_op_b_1:
|
|
|
|
|
; CHECK: # %bb.0: # %entry
|
|
|
|
|
; CHECK-NEXT: sld r5, r3, r4
|
|
|
|
|
; CHECK-NEXT: cmpdi r5, 1
|
|
|
|
|
; CHECK-NEXT: ble cr0, .LBB3_2
|
|
|
|
|
; CHECK-NEXT: # %bb.1: # %return
|
|
|
|
|
; CHECK-NEXT: mr r3, r4
|
|
|
|
|
; CHECK-NEXT: blr
|
|
|
|
|
; CHECK-NEXT: .LBB3_2: # %if.end
|
|
|
|
|
; CHECK-NEXT: li r5, 1
|
[CGP] Make ICMP_EQ use CR result of ICMP_S(L|G)T dominators
For example:
long long test(long long a, long long b) {
if (a << b > 0)
return b;
if (a << b < 0)
return a;
return a*b;
}
Produces:
sld. 5, 3, 4
ble 0, .LBB0_2
mr 3, 4
blr
.LBB0_2: # %if.end
cmpldi 5, 0
li 5, 1
isel 4, 4, 5, 2
mulld 3, 4, 3
blr
But the compare (cmpldi 5, 0) is redundant and can be removed (CR0 already
contains the result of that comparison).
The root cause of this is that LLVM converts signed comparisons into equality
comparison based on dominance. Equality comparisons are unsigned by default, so
we get either a record-form or cmp (without the l for logical) feeding a cmpl.
That is the situation we want to avoid here.
Differential Revision: https://reviews.llvm.org/D60506
2019-11-12 00:15:52 +08:00
|
|
|
; CHECK-NEXT: isel r4, r5, r4, lt
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-NEXT: mulld r3, r4, r3
|
|
|
|
|
; CHECK-NEXT: blr
|
2019-05-09 20:26:39 +08:00
|
|
|
entry:
|
|
|
|
|
%shl = shl i64 %a, %b
|
|
|
|
|
%cmp = icmp sgt i64 %shl, 1
|
|
|
|
|
br i1 %cmp, label %return, label %if.end
|
|
|
|
|
|
|
|
|
|
if.end: ; preds = %entry
|
|
|
|
|
%cmp2 = icmp eq i64 %shl, 1
|
|
|
|
|
%mul = select i1 %cmp2, i64 %b, i64 1
|
|
|
|
|
%spec.select = mul nsw i64 %mul, %a
|
|
|
|
|
ret i64 %spec.select
|
|
|
|
|
|
|
|
|
|
return: ; preds = %entry
|
|
|
|
|
ret i64 %b
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i64 @ll_a_op_b_2(i64 %a, i64 %b) {
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-LABEL: ll_a_op_b_2:
|
|
|
|
|
; CHECK: # %bb.0: # %entry
|
|
|
|
|
; CHECK-NEXT: sld r5, r3, r4
|
|
|
|
|
; CHECK-NEXT: cmpdi r5, 2
|
|
|
|
|
; CHECK-NEXT: ble cr0, .LBB4_2
|
|
|
|
|
; CHECK-NEXT: # %bb.1: # %return
|
|
|
|
|
; CHECK-NEXT: mr r3, r4
|
|
|
|
|
; CHECK-NEXT: blr
|
|
|
|
|
; CHECK-NEXT: .LBB4_2: # %if.end
|
|
|
|
|
; CHECK-NEXT: li r5, 1
|
[CGP] Make ICMP_EQ use CR result of ICMP_S(L|G)T dominators
For example:
long long test(long long a, long long b) {
if (a << b > 0)
return b;
if (a << b < 0)
return a;
return a*b;
}
Produces:
sld. 5, 3, 4
ble 0, .LBB0_2
mr 3, 4
blr
.LBB0_2: # %if.end
cmpldi 5, 0
li 5, 1
isel 4, 4, 5, 2
mulld 3, 4, 3
blr
But the compare (cmpldi 5, 0) is redundant and can be removed (CR0 already
contains the result of that comparison).
The root cause of this is that LLVM converts signed comparisons into equality
comparison based on dominance. Equality comparisons are unsigned by default, so
we get either a record-form or cmp (without the l for logical) feeding a cmpl.
That is the situation we want to avoid here.
Differential Revision: https://reviews.llvm.org/D60506
2019-11-12 00:15:52 +08:00
|
|
|
; CHECK-NEXT: isel r4, r5, r4, lt
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-NEXT: mulld r3, r4, r3
|
|
|
|
|
; CHECK-NEXT: blr
|
2019-05-09 20:26:39 +08:00
|
|
|
entry:
|
|
|
|
|
%shl = shl i64 %a, %b
|
|
|
|
|
%cmp = icmp sgt i64 %shl, 2
|
|
|
|
|
br i1 %cmp, label %return, label %if.end
|
|
|
|
|
|
|
|
|
|
if.end: ; preds = %entry
|
|
|
|
|
%cmp2 = icmp eq i64 %shl, 2
|
|
|
|
|
%mul = select i1 %cmp2, i64 %b, i64 1
|
|
|
|
|
%spec.select = mul nsw i64 %mul, %a
|
|
|
|
|
ret i64 %spec.select
|
|
|
|
|
|
|
|
|
|
return: ; preds = %entry
|
|
|
|
|
ret i64 %b
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i64 @ll_a__2(i64 %a, i64 %b) {
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-LABEL: ll_a__2:
|
|
|
|
|
; CHECK: # %bb.0: # %entry
|
|
|
|
|
; CHECK-NEXT: cmpdi r3, -2
|
|
|
|
|
; CHECK-NEXT: ble cr0, .LBB5_2
|
|
|
|
|
; CHECK-NEXT: # %bb.1: # %return
|
|
|
|
|
; CHECK-NEXT: mr r3, r4
|
|
|
|
|
; CHECK-NEXT: blr
|
|
|
|
|
; CHECK-NEXT: .LBB5_2: # %if.end
|
|
|
|
|
; CHECK-NEXT: li r5, 1
|
[CGP] Make ICMP_EQ use CR result of ICMP_S(L|G)T dominators
For example:
long long test(long long a, long long b) {
if (a << b > 0)
return b;
if (a << b < 0)
return a;
return a*b;
}
Produces:
sld. 5, 3, 4
ble 0, .LBB0_2
mr 3, 4
blr
.LBB0_2: # %if.end
cmpldi 5, 0
li 5, 1
isel 4, 4, 5, 2
mulld 3, 4, 3
blr
But the compare (cmpldi 5, 0) is redundant and can be removed (CR0 already
contains the result of that comparison).
The root cause of this is that LLVM converts signed comparisons into equality
comparison based on dominance. Equality comparisons are unsigned by default, so
we get either a record-form or cmp (without the l for logical) feeding a cmpl.
That is the situation we want to avoid here.
Differential Revision: https://reviews.llvm.org/D60506
2019-11-12 00:15:52 +08:00
|
|
|
; CHECK-NEXT: isel r4, r5, r4, lt
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-NEXT: mulld r3, r4, r3
|
|
|
|
|
; CHECK-NEXT: blr
|
2019-05-09 20:26:39 +08:00
|
|
|
entry:
|
|
|
|
|
%cmp = icmp sgt i64 %a, -2
|
|
|
|
|
br i1 %cmp, label %return, label %if.end
|
|
|
|
|
|
|
|
|
|
if.end: ; preds = %entry
|
|
|
|
|
%cmp1 = icmp eq i64 %a, -2
|
|
|
|
|
%mul = select i1 %cmp1, i64 %b, i64 1
|
|
|
|
|
%spec.select = mul nsw i64 %mul, %a
|
|
|
|
|
ret i64 %spec.select
|
|
|
|
|
|
|
|
|
|
return: ; preds = %entry
|
|
|
|
|
ret i64 %b
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i64 @ll_a__1(i64 %a, i64 %b) {
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-LABEL: ll_a__1:
|
|
|
|
|
; CHECK: # %bb.0: # %entry
|
|
|
|
|
; CHECK-NEXT: cmpdi r3, -1
|
|
|
|
|
; CHECK-NEXT: ble cr0, .LBB6_2
|
|
|
|
|
; CHECK-NEXT: # %bb.1: # %return
|
|
|
|
|
; CHECK-NEXT: mr r3, r4
|
|
|
|
|
; CHECK-NEXT: blr
|
|
|
|
|
; CHECK-NEXT: .LBB6_2: # %if.end
|
|
|
|
|
; CHECK-NEXT: li r5, 1
|
[CGP] Make ICMP_EQ use CR result of ICMP_S(L|G)T dominators
For example:
long long test(long long a, long long b) {
if (a << b > 0)
return b;
if (a << b < 0)
return a;
return a*b;
}
Produces:
sld. 5, 3, 4
ble 0, .LBB0_2
mr 3, 4
blr
.LBB0_2: # %if.end
cmpldi 5, 0
li 5, 1
isel 4, 4, 5, 2
mulld 3, 4, 3
blr
But the compare (cmpldi 5, 0) is redundant and can be removed (CR0 already
contains the result of that comparison).
The root cause of this is that LLVM converts signed comparisons into equality
comparison based on dominance. Equality comparisons are unsigned by default, so
we get either a record-form or cmp (without the l for logical) feeding a cmpl.
That is the situation we want to avoid here.
Differential Revision: https://reviews.llvm.org/D60506
2019-11-12 00:15:52 +08:00
|
|
|
; CHECK-NEXT: isel r4, r5, r4, lt
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-NEXT: mulld r3, r4, r3
|
|
|
|
|
; CHECK-NEXT: blr
|
2019-05-09 20:26:39 +08:00
|
|
|
entry:
|
|
|
|
|
%cmp = icmp sgt i64 %a, -1
|
|
|
|
|
br i1 %cmp, label %return, label %if.end
|
|
|
|
|
|
|
|
|
|
if.end: ; preds = %entry
|
|
|
|
|
%cmp1 = icmp eq i64 %a, -1
|
|
|
|
|
%mul = select i1 %cmp1, i64 %b, i64 1
|
|
|
|
|
%spec.select = mul nsw i64 %mul, %a
|
|
|
|
|
ret i64 %spec.select
|
|
|
|
|
|
|
|
|
|
return: ; preds = %entry
|
|
|
|
|
ret i64 %b
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i64 @ll_a_0(i64 %a, i64 %b) {
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-LABEL: ll_a_0:
|
|
|
|
|
; CHECK: # %bb.0: # %entry
|
|
|
|
|
; CHECK-NEXT: cmpdi r3, 0
|
|
|
|
|
; CHECK-NEXT: ble cr0, .LBB7_2
|
|
|
|
|
; CHECK-NEXT: # %bb.1: # %return
|
|
|
|
|
; CHECK-NEXT: mr r3, r4
|
|
|
|
|
; CHECK-NEXT: blr
|
|
|
|
|
; CHECK-NEXT: .LBB7_2: # %if.end
|
|
|
|
|
; CHECK-NEXT: li r5, 1
|
[CGP] Make ICMP_EQ use CR result of ICMP_S(L|G)T dominators
For example:
long long test(long long a, long long b) {
if (a << b > 0)
return b;
if (a << b < 0)
return a;
return a*b;
}
Produces:
sld. 5, 3, 4
ble 0, .LBB0_2
mr 3, 4
blr
.LBB0_2: # %if.end
cmpldi 5, 0
li 5, 1
isel 4, 4, 5, 2
mulld 3, 4, 3
blr
But the compare (cmpldi 5, 0) is redundant and can be removed (CR0 already
contains the result of that comparison).
The root cause of this is that LLVM converts signed comparisons into equality
comparison based on dominance. Equality comparisons are unsigned by default, so
we get either a record-form or cmp (without the l for logical) feeding a cmpl.
That is the situation we want to avoid here.
Differential Revision: https://reviews.llvm.org/D60506
2019-11-12 00:15:52 +08:00
|
|
|
; CHECK-NEXT: isel r4, r5, r4, lt
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-NEXT: mulld r3, r4, r3
|
|
|
|
|
; CHECK-NEXT: blr
|
2019-05-09 20:26:39 +08:00
|
|
|
entry:
|
|
|
|
|
%cmp = icmp sgt i64 %a, 0
|
|
|
|
|
br i1 %cmp, label %return, label %if.end
|
|
|
|
|
|
|
|
|
|
if.end: ; preds = %entry
|
|
|
|
|
%cmp1 = icmp eq i64 %a, 0
|
|
|
|
|
%mul = select i1 %cmp1, i64 %b, i64 1
|
|
|
|
|
%spec.select = mul nsw i64 %mul, %a
|
|
|
|
|
ret i64 %spec.select
|
|
|
|
|
|
|
|
|
|
return: ; preds = %entry
|
|
|
|
|
ret i64 %b
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i64 @ll_a_1(i64 %a, i64 %b) {
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-LABEL: ll_a_1:
|
|
|
|
|
; CHECK: # %bb.0: # %entry
|
|
|
|
|
; CHECK-NEXT: cmpdi r3, 1
|
|
|
|
|
; CHECK-NEXT: ble cr0, .LBB8_2
|
|
|
|
|
; CHECK-NEXT: # %bb.1: # %return
|
|
|
|
|
; CHECK-NEXT: mr r3, r4
|
|
|
|
|
; CHECK-NEXT: blr
|
|
|
|
|
; CHECK-NEXT: .LBB8_2: # %if.end
|
|
|
|
|
; CHECK-NEXT: li r5, 1
|
[CGP] Make ICMP_EQ use CR result of ICMP_S(L|G)T dominators
For example:
long long test(long long a, long long b) {
if (a << b > 0)
return b;
if (a << b < 0)
return a;
return a*b;
}
Produces:
sld. 5, 3, 4
ble 0, .LBB0_2
mr 3, 4
blr
.LBB0_2: # %if.end
cmpldi 5, 0
li 5, 1
isel 4, 4, 5, 2
mulld 3, 4, 3
blr
But the compare (cmpldi 5, 0) is redundant and can be removed (CR0 already
contains the result of that comparison).
The root cause of this is that LLVM converts signed comparisons into equality
comparison based on dominance. Equality comparisons are unsigned by default, so
we get either a record-form or cmp (without the l for logical) feeding a cmpl.
That is the situation we want to avoid here.
Differential Revision: https://reviews.llvm.org/D60506
2019-11-12 00:15:52 +08:00
|
|
|
; CHECK-NEXT: isel r4, r5, r4, lt
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-NEXT: mulld r3, r4, r3
|
|
|
|
|
; CHECK-NEXT: blr
|
2019-05-09 20:26:39 +08:00
|
|
|
entry:
|
|
|
|
|
%cmp = icmp sgt i64 %a, 1
|
|
|
|
|
br i1 %cmp, label %return, label %if.end
|
|
|
|
|
|
|
|
|
|
if.end: ; preds = %entry
|
|
|
|
|
%cmp1 = icmp eq i64 %a, 1
|
|
|
|
|
%mul = select i1 %cmp1, i64 %b, i64 1
|
|
|
|
|
%spec.select = mul nsw i64 %mul, %a
|
|
|
|
|
ret i64 %spec.select
|
|
|
|
|
|
|
|
|
|
return: ; preds = %entry
|
|
|
|
|
ret i64 %b
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i64 @ll_a_2(i64 %a, i64 %b) {
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-LABEL: ll_a_2:
|
|
|
|
|
; CHECK: # %bb.0: # %entry
|
|
|
|
|
; CHECK-NEXT: cmpdi r3, 2
|
|
|
|
|
; CHECK-NEXT: ble cr0, .LBB9_2
|
|
|
|
|
; CHECK-NEXT: # %bb.1: # %return
|
|
|
|
|
; CHECK-NEXT: mr r3, r4
|
|
|
|
|
; CHECK-NEXT: blr
|
|
|
|
|
; CHECK-NEXT: .LBB9_2: # %if.end
|
|
|
|
|
; CHECK-NEXT: li r5, 1
|
[CGP] Make ICMP_EQ use CR result of ICMP_S(L|G)T dominators
For example:
long long test(long long a, long long b) {
if (a << b > 0)
return b;
if (a << b < 0)
return a;
return a*b;
}
Produces:
sld. 5, 3, 4
ble 0, .LBB0_2
mr 3, 4
blr
.LBB0_2: # %if.end
cmpldi 5, 0
li 5, 1
isel 4, 4, 5, 2
mulld 3, 4, 3
blr
But the compare (cmpldi 5, 0) is redundant and can be removed (CR0 already
contains the result of that comparison).
The root cause of this is that LLVM converts signed comparisons into equality
comparison based on dominance. Equality comparisons are unsigned by default, so
we get either a record-form or cmp (without the l for logical) feeding a cmpl.
That is the situation we want to avoid here.
Differential Revision: https://reviews.llvm.org/D60506
2019-11-12 00:15:52 +08:00
|
|
|
; CHECK-NEXT: isel r4, r5, r4, lt
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-NEXT: mulld r3, r4, r3
|
|
|
|
|
; CHECK-NEXT: blr
|
2019-05-09 20:26:39 +08:00
|
|
|
entry:
|
|
|
|
|
%cmp = icmp sgt i64 %a, 2
|
|
|
|
|
br i1 %cmp, label %return, label %if.end
|
|
|
|
|
|
|
|
|
|
if.end: ; preds = %entry
|
|
|
|
|
%cmp1 = icmp eq i64 %a, 2
|
|
|
|
|
%mul = select i1 %cmp1, i64 %b, i64 1
|
|
|
|
|
%spec.select = mul nsw i64 %mul, %a
|
|
|
|
|
ret i64 %spec.select
|
|
|
|
|
|
|
|
|
|
return: ; preds = %entry
|
|
|
|
|
ret i64 %b
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i64 @i_a_op_b__2(i32 signext %a, i32 signext %b) {
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-LABEL: i_a_op_b__2:
|
|
|
|
|
; CHECK: # %bb.0: # %entry
|
|
|
|
|
; CHECK-NEXT: slw r5, r3, r4
|
|
|
|
|
; CHECK-NEXT: cmpwi r5, -2
|
|
|
|
|
; CHECK-NEXT: bgt cr0, .LBB10_2
|
|
|
|
|
; CHECK-NEXT: # %bb.1: # %if.end
|
|
|
|
|
; CHECK-NEXT: li r5, 1
|
[CGP] Make ICMP_EQ use CR result of ICMP_S(L|G)T dominators
For example:
long long test(long long a, long long b) {
if (a << b > 0)
return b;
if (a << b < 0)
return a;
return a*b;
}
Produces:
sld. 5, 3, 4
ble 0, .LBB0_2
mr 3, 4
blr
.LBB0_2: # %if.end
cmpldi 5, 0
li 5, 1
isel 4, 4, 5, 2
mulld 3, 4, 3
blr
But the compare (cmpldi 5, 0) is redundant and can be removed (CR0 already
contains the result of that comparison).
The root cause of this is that LLVM converts signed comparisons into equality
comparison based on dominance. Equality comparisons are unsigned by default, so
we get either a record-form or cmp (without the l for logical) feeding a cmpl.
That is the situation we want to avoid here.
Differential Revision: https://reviews.llvm.org/D60506
2019-11-12 00:15:52 +08:00
|
|
|
; CHECK-NEXT: isel r4, r5, r4, lt
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-NEXT: mullw r4, r4, r3
|
|
|
|
|
; CHECK-NEXT: .LBB10_2: # %return
|
|
|
|
|
; CHECK-NEXT: extsw r3, r4
|
|
|
|
|
; CHECK-NEXT: blr
|
2019-05-09 20:26:39 +08:00
|
|
|
entry:
|
|
|
|
|
%shl = shl i32 %a, %b
|
|
|
|
|
%cmp = icmp sgt i32 %shl, -2
|
|
|
|
|
br i1 %cmp, label %return, label %if.end
|
|
|
|
|
|
|
|
|
|
if.end: ; preds = %entry
|
|
|
|
|
%cmp2 = icmp eq i32 %shl, -2
|
|
|
|
|
%mul = select i1 %cmp2, i32 %b, i32 1
|
|
|
|
|
%spec.select = mul nsw i32 %mul, %a
|
|
|
|
|
br label %return
|
|
|
|
|
|
|
|
|
|
return: ; preds = %if.end, %entry
|
|
|
|
|
%retval.0.in = phi i32 [ %b, %entry ], [ %spec.select, %if.end ]
|
|
|
|
|
%retval.0 = sext i32 %retval.0.in to i64
|
|
|
|
|
ret i64 %retval.0
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i64 @i_a_op_b__1(i32 signext %a, i32 signext %b) {
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-LABEL: i_a_op_b__1:
|
|
|
|
|
; CHECK: # %bb.0: # %entry
|
|
|
|
|
; CHECK-NEXT: slw r5, r3, r4
|
|
|
|
|
; CHECK-NEXT: cmpwi r5, -1
|
|
|
|
|
; CHECK-NEXT: ble cr0, .LBB11_2
|
|
|
|
|
; CHECK-NEXT: # %bb.1: # %return
|
|
|
|
|
; CHECK-NEXT: extsw r3, r4
|
|
|
|
|
; CHECK-NEXT: blr
|
|
|
|
|
; CHECK-NEXT: .LBB11_2: # %if.end
|
|
|
|
|
; CHECK-NEXT: li r5, 1
|
[CGP] Make ICMP_EQ use CR result of ICMP_S(L|G)T dominators
For example:
long long test(long long a, long long b) {
if (a << b > 0)
return b;
if (a << b < 0)
return a;
return a*b;
}
Produces:
sld. 5, 3, 4
ble 0, .LBB0_2
mr 3, 4
blr
.LBB0_2: # %if.end
cmpldi 5, 0
li 5, 1
isel 4, 4, 5, 2
mulld 3, 4, 3
blr
But the compare (cmpldi 5, 0) is redundant and can be removed (CR0 already
contains the result of that comparison).
The root cause of this is that LLVM converts signed comparisons into equality
comparison based on dominance. Equality comparisons are unsigned by default, so
we get either a record-form or cmp (without the l for logical) feeding a cmpl.
That is the situation we want to avoid here.
Differential Revision: https://reviews.llvm.org/D60506
2019-11-12 00:15:52 +08:00
|
|
|
; CHECK-NEXT: isel r4, r5, r4, lt
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-NEXT: mullw r4, r4, r3
|
|
|
|
|
; CHECK-NEXT: extsw r3, r4
|
|
|
|
|
; CHECK-NEXT: blr
|
2019-05-09 20:26:39 +08:00
|
|
|
entry:
|
|
|
|
|
%shl = shl i32 %a, %b
|
|
|
|
|
%cmp = icmp sgt i32 %shl, -1
|
|
|
|
|
br i1 %cmp, label %return, label %if.end
|
|
|
|
|
|
|
|
|
|
if.end: ; preds = %entry
|
|
|
|
|
%cmp2 = icmp eq i32 %shl, -1
|
|
|
|
|
%mul = select i1 %cmp2, i32 %b, i32 1
|
|
|
|
|
%spec.select = mul nsw i32 %mul, %a
|
|
|
|
|
br label %return
|
|
|
|
|
|
|
|
|
|
return: ; preds = %if.end, %entry
|
|
|
|
|
%retval.0.in = phi i32 [ %b, %entry ], [ %spec.select, %if.end ]
|
|
|
|
|
%retval.0 = sext i32 %retval.0.in to i64
|
|
|
|
|
ret i64 %retval.0
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i64 @i_a_op_b_0(i32 signext %a, i32 signext %b) {
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-LABEL: i_a_op_b_0:
|
|
|
|
|
; CHECK: # %bb.0: # %entry
|
|
|
|
|
; CHECK-NEXT: slw r5, r3, r4
|
|
|
|
|
; CHECK-NEXT: cmpwi r5, 0
|
|
|
|
|
; CHECK-NEXT: ble cr0, .LBB12_2
|
|
|
|
|
; CHECK-NEXT: # %bb.1: # %return
|
|
|
|
|
; CHECK-NEXT: extsw r3, r4
|
|
|
|
|
; CHECK-NEXT: blr
|
|
|
|
|
; CHECK-NEXT: .LBB12_2: # %if.end
|
|
|
|
|
; CHECK-NEXT: li r5, 1
|
[CGP] Make ICMP_EQ use CR result of ICMP_S(L|G)T dominators
For example:
long long test(long long a, long long b) {
if (a << b > 0)
return b;
if (a << b < 0)
return a;
return a*b;
}
Produces:
sld. 5, 3, 4
ble 0, .LBB0_2
mr 3, 4
blr
.LBB0_2: # %if.end
cmpldi 5, 0
li 5, 1
isel 4, 4, 5, 2
mulld 3, 4, 3
blr
But the compare (cmpldi 5, 0) is redundant and can be removed (CR0 already
contains the result of that comparison).
The root cause of this is that LLVM converts signed comparisons into equality
comparison based on dominance. Equality comparisons are unsigned by default, so
we get either a record-form or cmp (without the l for logical) feeding a cmpl.
That is the situation we want to avoid here.
Differential Revision: https://reviews.llvm.org/D60506
2019-11-12 00:15:52 +08:00
|
|
|
; CHECK-NEXT: isel r4, r5, r4, lt
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-NEXT: mullw r4, r4, r3
|
|
|
|
|
; CHECK-NEXT: extsw r3, r4
|
|
|
|
|
; CHECK-NEXT: blr
|
2019-05-09 20:26:39 +08:00
|
|
|
entry:
|
|
|
|
|
%shl = shl i32 %a, %b
|
|
|
|
|
%cmp = icmp sgt i32 %shl, 0
|
|
|
|
|
br i1 %cmp, label %return, label %if.end
|
|
|
|
|
|
|
|
|
|
if.end: ; preds = %entry
|
|
|
|
|
%cmp2 = icmp eq i32 %shl, 0
|
|
|
|
|
%mul = select i1 %cmp2, i32 %b, i32 1
|
|
|
|
|
%spec.select = mul nsw i32 %mul, %a
|
|
|
|
|
br label %return
|
|
|
|
|
|
|
|
|
|
return: ; preds = %if.end, %entry
|
|
|
|
|
%retval.0.in = phi i32 [ %b, %entry ], [ %spec.select, %if.end ]
|
|
|
|
|
%retval.0 = sext i32 %retval.0.in to i64
|
|
|
|
|
ret i64 %retval.0
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i64 @i_a_op_b_1(i32 signext %a, i32 signext %b) {
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-LABEL: i_a_op_b_1:
|
|
|
|
|
; CHECK: # %bb.0: # %entry
|
|
|
|
|
; CHECK-NEXT: slw r5, r3, r4
|
|
|
|
|
; CHECK-NEXT: cmpwi r5, 1
|
|
|
|
|
; CHECK-NEXT: bgt cr0, .LBB13_2
|
|
|
|
|
; CHECK-NEXT: # %bb.1: # %if.end
|
|
|
|
|
; CHECK-NEXT: li r5, 1
|
[CGP] Make ICMP_EQ use CR result of ICMP_S(L|G)T dominators
For example:
long long test(long long a, long long b) {
if (a << b > 0)
return b;
if (a << b < 0)
return a;
return a*b;
}
Produces:
sld. 5, 3, 4
ble 0, .LBB0_2
mr 3, 4
blr
.LBB0_2: # %if.end
cmpldi 5, 0
li 5, 1
isel 4, 4, 5, 2
mulld 3, 4, 3
blr
But the compare (cmpldi 5, 0) is redundant and can be removed (CR0 already
contains the result of that comparison).
The root cause of this is that LLVM converts signed comparisons into equality
comparison based on dominance. Equality comparisons are unsigned by default, so
we get either a record-form or cmp (without the l for logical) feeding a cmpl.
That is the situation we want to avoid here.
Differential Revision: https://reviews.llvm.org/D60506
2019-11-12 00:15:52 +08:00
|
|
|
; CHECK-NEXT: isel r4, r5, r4, lt
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-NEXT: mullw r4, r4, r3
|
|
|
|
|
; CHECK-NEXT: .LBB13_2: # %return
|
|
|
|
|
; CHECK-NEXT: extsw r3, r4
|
|
|
|
|
; CHECK-NEXT: blr
|
2019-05-09 20:26:39 +08:00
|
|
|
entry:
|
|
|
|
|
%shl = shl i32 %a, %b
|
|
|
|
|
%cmp = icmp sgt i32 %shl, 1
|
|
|
|
|
br i1 %cmp, label %return, label %if.end
|
|
|
|
|
|
|
|
|
|
if.end: ; preds = %entry
|
|
|
|
|
%cmp2 = icmp eq i32 %shl, 1
|
|
|
|
|
%mul = select i1 %cmp2, i32 %b, i32 1
|
|
|
|
|
%spec.select = mul nsw i32 %mul, %a
|
|
|
|
|
br label %return
|
|
|
|
|
|
|
|
|
|
return: ; preds = %if.end, %entry
|
|
|
|
|
%retval.0.in = phi i32 [ %b, %entry ], [ %spec.select, %if.end ]
|
|
|
|
|
%retval.0 = sext i32 %retval.0.in to i64
|
|
|
|
|
ret i64 %retval.0
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i64 @i_a_op_b_2(i32 signext %a, i32 signext %b) {
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-LABEL: i_a_op_b_2:
|
|
|
|
|
; CHECK: # %bb.0: # %entry
|
|
|
|
|
; CHECK-NEXT: slw r5, r3, r4
|
|
|
|
|
; CHECK-NEXT: cmpwi r5, 2
|
|
|
|
|
; CHECK-NEXT: bgt cr0, .LBB14_2
|
|
|
|
|
; CHECK-NEXT: # %bb.1: # %if.end
|
|
|
|
|
; CHECK-NEXT: li r5, 1
|
[CGP] Make ICMP_EQ use CR result of ICMP_S(L|G)T dominators
For example:
long long test(long long a, long long b) {
if (a << b > 0)
return b;
if (a << b < 0)
return a;
return a*b;
}
Produces:
sld. 5, 3, 4
ble 0, .LBB0_2
mr 3, 4
blr
.LBB0_2: # %if.end
cmpldi 5, 0
li 5, 1
isel 4, 4, 5, 2
mulld 3, 4, 3
blr
But the compare (cmpldi 5, 0) is redundant and can be removed (CR0 already
contains the result of that comparison).
The root cause of this is that LLVM converts signed comparisons into equality
comparison based on dominance. Equality comparisons are unsigned by default, so
we get either a record-form or cmp (without the l for logical) feeding a cmpl.
That is the situation we want to avoid here.
Differential Revision: https://reviews.llvm.org/D60506
2019-11-12 00:15:52 +08:00
|
|
|
; CHECK-NEXT: isel r4, r5, r4, lt
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-NEXT: mullw r4, r4, r3
|
|
|
|
|
; CHECK-NEXT: .LBB14_2: # %return
|
|
|
|
|
; CHECK-NEXT: extsw r3, r4
|
|
|
|
|
; CHECK-NEXT: blr
|
2019-05-09 20:26:39 +08:00
|
|
|
entry:
|
|
|
|
|
%shl = shl i32 %a, %b
|
|
|
|
|
%cmp = icmp sgt i32 %shl, 2
|
|
|
|
|
br i1 %cmp, label %return, label %if.end
|
|
|
|
|
|
|
|
|
|
if.end: ; preds = %entry
|
|
|
|
|
%cmp2 = icmp eq i32 %shl, 2
|
|
|
|
|
%mul = select i1 %cmp2, i32 %b, i32 1
|
|
|
|
|
%spec.select = mul nsw i32 %mul, %a
|
|
|
|
|
br label %return
|
|
|
|
|
|
|
|
|
|
return: ; preds = %if.end, %entry
|
|
|
|
|
%retval.0.in = phi i32 [ %b, %entry ], [ %spec.select, %if.end ]
|
|
|
|
|
%retval.0 = sext i32 %retval.0.in to i64
|
|
|
|
|
ret i64 %retval.0
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i64 @i_a__2(i32 signext %a, i32 signext %b) {
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-LABEL: i_a__2:
|
|
|
|
|
; CHECK: # %bb.0: # %entry
|
|
|
|
|
; CHECK-NEXT: cmpwi r3, -2
|
|
|
|
|
; CHECK-NEXT: bgt cr0, .LBB15_2
|
|
|
|
|
; CHECK-NEXT: # %bb.1: # %if.end
|
|
|
|
|
; CHECK-NEXT: li r5, 1
|
[CGP] Make ICMP_EQ use CR result of ICMP_S(L|G)T dominators
For example:
long long test(long long a, long long b) {
if (a << b > 0)
return b;
if (a << b < 0)
return a;
return a*b;
}
Produces:
sld. 5, 3, 4
ble 0, .LBB0_2
mr 3, 4
blr
.LBB0_2: # %if.end
cmpldi 5, 0
li 5, 1
isel 4, 4, 5, 2
mulld 3, 4, 3
blr
But the compare (cmpldi 5, 0) is redundant and can be removed (CR0 already
contains the result of that comparison).
The root cause of this is that LLVM converts signed comparisons into equality
comparison based on dominance. Equality comparisons are unsigned by default, so
we get either a record-form or cmp (without the l for logical) feeding a cmpl.
That is the situation we want to avoid here.
Differential Revision: https://reviews.llvm.org/D60506
2019-11-12 00:15:52 +08:00
|
|
|
; CHECK-NEXT: isel r4, r5, r4, lt
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-NEXT: mullw r4, r4, r3
|
|
|
|
|
; CHECK-NEXT: .LBB15_2: # %return
|
|
|
|
|
; CHECK-NEXT: extsw r3, r4
|
|
|
|
|
; CHECK-NEXT: blr
|
2019-05-09 20:26:39 +08:00
|
|
|
entry:
|
|
|
|
|
%cmp = icmp sgt i32 %a, -2
|
|
|
|
|
br i1 %cmp, label %return, label %if.end
|
|
|
|
|
|
|
|
|
|
if.end: ; preds = %entry
|
|
|
|
|
%cmp1 = icmp eq i32 %a, -2
|
|
|
|
|
%mul = select i1 %cmp1, i32 %b, i32 1
|
|
|
|
|
%spec.select = mul nsw i32 %mul, %a
|
|
|
|
|
br label %return
|
|
|
|
|
|
|
|
|
|
return: ; preds = %if.end, %entry
|
|
|
|
|
%retval.0.in = phi i32 [ %b, %entry ], [ %spec.select, %if.end ]
|
|
|
|
|
%retval.0 = sext i32 %retval.0.in to i64
|
|
|
|
|
ret i64 %retval.0
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i64 @i_a__1(i32 signext %a, i32 signext %b) {
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-LABEL: i_a__1:
|
|
|
|
|
; CHECK: # %bb.0: # %entry
|
|
|
|
|
; CHECK-NEXT: cmpwi r3, -1
|
|
|
|
|
; CHECK-NEXT: ble cr0, .LBB16_2
|
|
|
|
|
; CHECK-NEXT: # %bb.1: # %return
|
|
|
|
|
; CHECK-NEXT: extsw r3, r4
|
|
|
|
|
; CHECK-NEXT: blr
|
|
|
|
|
; CHECK-NEXT: .LBB16_2: # %if.end
|
|
|
|
|
; CHECK-NEXT: li r5, 1
|
[CGP] Make ICMP_EQ use CR result of ICMP_S(L|G)T dominators
For example:
long long test(long long a, long long b) {
if (a << b > 0)
return b;
if (a << b < 0)
return a;
return a*b;
}
Produces:
sld. 5, 3, 4
ble 0, .LBB0_2
mr 3, 4
blr
.LBB0_2: # %if.end
cmpldi 5, 0
li 5, 1
isel 4, 4, 5, 2
mulld 3, 4, 3
blr
But the compare (cmpldi 5, 0) is redundant and can be removed (CR0 already
contains the result of that comparison).
The root cause of this is that LLVM converts signed comparisons into equality
comparison based on dominance. Equality comparisons are unsigned by default, so
we get either a record-form or cmp (without the l for logical) feeding a cmpl.
That is the situation we want to avoid here.
Differential Revision: https://reviews.llvm.org/D60506
2019-11-12 00:15:52 +08:00
|
|
|
; CHECK-NEXT: isel r4, r5, r4, lt
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-NEXT: mullw r4, r4, r3
|
|
|
|
|
; CHECK-NEXT: extsw r3, r4
|
|
|
|
|
; CHECK-NEXT: blr
|
2019-05-09 20:26:39 +08:00
|
|
|
entry:
|
|
|
|
|
%cmp = icmp sgt i32 %a, -1
|
|
|
|
|
br i1 %cmp, label %return, label %if.end
|
|
|
|
|
|
|
|
|
|
if.end: ; preds = %entry
|
|
|
|
|
%cmp1 = icmp eq i32 %a, -1
|
|
|
|
|
%mul = select i1 %cmp1, i32 %b, i32 1
|
|
|
|
|
%spec.select = mul nsw i32 %mul, %a
|
|
|
|
|
br label %return
|
|
|
|
|
|
|
|
|
|
return: ; preds = %if.end, %entry
|
|
|
|
|
%retval.0.in = phi i32 [ %b, %entry ], [ %spec.select, %if.end ]
|
|
|
|
|
%retval.0 = sext i32 %retval.0.in to i64
|
|
|
|
|
ret i64 %retval.0
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i64 @i_a_0(i32 signext %a, i32 signext %b) {
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-LABEL: i_a_0:
|
|
|
|
|
; CHECK: # %bb.0: # %entry
|
|
|
|
|
; CHECK-NEXT: cmpwi r3, 0
|
|
|
|
|
; CHECK-NEXT: ble cr0, .LBB17_2
|
|
|
|
|
; CHECK-NEXT: # %bb.1: # %return
|
|
|
|
|
; CHECK-NEXT: extsw r3, r4
|
|
|
|
|
; CHECK-NEXT: blr
|
|
|
|
|
; CHECK-NEXT: .LBB17_2: # %if.end
|
|
|
|
|
; CHECK-NEXT: li r5, 1
|
[CGP] Make ICMP_EQ use CR result of ICMP_S(L|G)T dominators
For example:
long long test(long long a, long long b) {
if (a << b > 0)
return b;
if (a << b < 0)
return a;
return a*b;
}
Produces:
sld. 5, 3, 4
ble 0, .LBB0_2
mr 3, 4
blr
.LBB0_2: # %if.end
cmpldi 5, 0
li 5, 1
isel 4, 4, 5, 2
mulld 3, 4, 3
blr
But the compare (cmpldi 5, 0) is redundant and can be removed (CR0 already
contains the result of that comparison).
The root cause of this is that LLVM converts signed comparisons into equality
comparison based on dominance. Equality comparisons are unsigned by default, so
we get either a record-form or cmp (without the l for logical) feeding a cmpl.
That is the situation we want to avoid here.
Differential Revision: https://reviews.llvm.org/D60506
2019-11-12 00:15:52 +08:00
|
|
|
; CHECK-NEXT: isel r4, r5, r4, lt
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-NEXT: mullw r4, r4, r3
|
|
|
|
|
; CHECK-NEXT: extsw r3, r4
|
|
|
|
|
; CHECK-NEXT: blr
|
2019-05-09 20:26:39 +08:00
|
|
|
entry:
|
|
|
|
|
%cmp = icmp sgt i32 %a, 0
|
|
|
|
|
br i1 %cmp, label %return, label %if.end
|
|
|
|
|
|
|
|
|
|
if.end: ; preds = %entry
|
|
|
|
|
%cmp1 = icmp eq i32 %a, 0
|
|
|
|
|
%mul = select i1 %cmp1, i32 %b, i32 1
|
|
|
|
|
%spec.select = mul nsw i32 %mul, %a
|
|
|
|
|
br label %return
|
|
|
|
|
|
|
|
|
|
return: ; preds = %if.end, %entry
|
|
|
|
|
%retval.0.in = phi i32 [ %b, %entry ], [ %spec.select, %if.end ]
|
|
|
|
|
%retval.0 = sext i32 %retval.0.in to i64
|
|
|
|
|
ret i64 %retval.0
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i64 @i_a_1(i32 signext %a, i32 signext %b) {
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-LABEL: i_a_1:
|
|
|
|
|
; CHECK: # %bb.0: # %entry
|
|
|
|
|
; CHECK-NEXT: cmpwi r3, 1
|
|
|
|
|
; CHECK-NEXT: bgt cr0, .LBB18_2
|
|
|
|
|
; CHECK-NEXT: # %bb.1: # %if.end
|
|
|
|
|
; CHECK-NEXT: li r5, 1
|
[CGP] Make ICMP_EQ use CR result of ICMP_S(L|G)T dominators
For example:
long long test(long long a, long long b) {
if (a << b > 0)
return b;
if (a << b < 0)
return a;
return a*b;
}
Produces:
sld. 5, 3, 4
ble 0, .LBB0_2
mr 3, 4
blr
.LBB0_2: # %if.end
cmpldi 5, 0
li 5, 1
isel 4, 4, 5, 2
mulld 3, 4, 3
blr
But the compare (cmpldi 5, 0) is redundant and can be removed (CR0 already
contains the result of that comparison).
The root cause of this is that LLVM converts signed comparisons into equality
comparison based on dominance. Equality comparisons are unsigned by default, so
we get either a record-form or cmp (without the l for logical) feeding a cmpl.
That is the situation we want to avoid here.
Differential Revision: https://reviews.llvm.org/D60506
2019-11-12 00:15:52 +08:00
|
|
|
; CHECK-NEXT: isel r4, r5, r4, lt
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-NEXT: mullw r4, r4, r3
|
|
|
|
|
; CHECK-NEXT: .LBB18_2: # %return
|
|
|
|
|
; CHECK-NEXT: extsw r3, r4
|
|
|
|
|
; CHECK-NEXT: blr
|
2019-05-09 20:26:39 +08:00
|
|
|
entry:
|
|
|
|
|
%cmp = icmp sgt i32 %a, 1
|
|
|
|
|
br i1 %cmp, label %return, label %if.end
|
|
|
|
|
|
|
|
|
|
if.end: ; preds = %entry
|
|
|
|
|
%cmp1 = icmp eq i32 %a, 1
|
|
|
|
|
%mul = select i1 %cmp1, i32 %b, i32 1
|
|
|
|
|
%spec.select = mul nsw i32 %mul, %a
|
|
|
|
|
br label %return
|
|
|
|
|
|
|
|
|
|
return: ; preds = %if.end, %entry
|
|
|
|
|
%retval.0.in = phi i32 [ %b, %entry ], [ %spec.select, %if.end ]
|
|
|
|
|
%retval.0 = sext i32 %retval.0.in to i64
|
|
|
|
|
ret i64 %retval.0
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i64 @i_a_2(i32 signext %a, i32 signext %b) {
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-LABEL: i_a_2:
|
|
|
|
|
; CHECK: # %bb.0: # %entry
|
|
|
|
|
; CHECK-NEXT: cmpwi r3, 2
|
|
|
|
|
; CHECK-NEXT: bgt cr0, .LBB19_2
|
|
|
|
|
; CHECK-NEXT: # %bb.1: # %if.end
|
|
|
|
|
; CHECK-NEXT: li r5, 1
|
[CGP] Make ICMP_EQ use CR result of ICMP_S(L|G)T dominators
For example:
long long test(long long a, long long b) {
if (a << b > 0)
return b;
if (a << b < 0)
return a;
return a*b;
}
Produces:
sld. 5, 3, 4
ble 0, .LBB0_2
mr 3, 4
blr
.LBB0_2: # %if.end
cmpldi 5, 0
li 5, 1
isel 4, 4, 5, 2
mulld 3, 4, 3
blr
But the compare (cmpldi 5, 0) is redundant and can be removed (CR0 already
contains the result of that comparison).
The root cause of this is that LLVM converts signed comparisons into equality
comparison based on dominance. Equality comparisons are unsigned by default, so
we get either a record-form or cmp (without the l for logical) feeding a cmpl.
That is the situation we want to avoid here.
Differential Revision: https://reviews.llvm.org/D60506
2019-11-12 00:15:52 +08:00
|
|
|
; CHECK-NEXT: isel r4, r5, r4, lt
|
2019-10-07 13:29:11 +08:00
|
|
|
; CHECK-NEXT: mullw r4, r4, r3
|
|
|
|
|
; CHECK-NEXT: .LBB19_2: # %return
|
|
|
|
|
; CHECK-NEXT: extsw r3, r4
|
|
|
|
|
; CHECK-NEXT: blr
|
2019-05-09 20:26:39 +08:00
|
|
|
entry:
|
|
|
|
|
%cmp = icmp sgt i32 %a, 2
|
|
|
|
|
br i1 %cmp, label %return, label %if.end
|
|
|
|
|
|
|
|
|
|
if.end: ; preds = %entry
|
|
|
|
|
%cmp1 = icmp eq i32 %a, 2
|
|
|
|
|
%mul = select i1 %cmp1, i32 %b, i32 1
|
|
|
|
|
%spec.select = mul nsw i32 %mul, %a
|
|
|
|
|
br label %return
|
|
|
|
|
|
|
|
|
|
return: ; preds = %if.end, %entry
|
|
|
|
|
%retval.0.in = phi i32 [ %b, %entry ], [ %spec.select, %if.end ]
|
|
|
|
|
%retval.0 = sext i32 %retval.0.in to i64
|
|
|
|
|
ret i64 %retval.0
|
|
|
|
|
}
|
