mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-21 20:12:56 +02:00
d06246dfe7
This change lets us prove things like
"{X,+,10} s< 5000" implies "{X+7,+,10} does not sign overflow"
It does this by replacing replacing getConstantDifference by
computeConstantDifference (which is smarter) in
isImpliedCondOperandsViaRanges.
llvm-svn: 276505
191 lines
4.6 KiB
LLVM
191 lines
4.6 KiB
LLVM
; RUN: opt -analyze -scalar-evolution < %s | FileCheck %s
|
|
|
|
declare void @llvm.experimental.guard(i1, ...)
|
|
declare void @llvm.assume(i1)
|
|
|
|
define void @s_0(i32 %n, i1* %cond) {
|
|
; CHECK-LABEL: Classifying expressions for: @s_0
|
|
entry:
|
|
br label %loop
|
|
|
|
loop:
|
|
%iv = phi i32 [ 0, %entry ], [ %iv.inc, %loop ]
|
|
%iv.inc = add i32 %iv, 1
|
|
%iv.sext = sext i32 %iv to i64
|
|
; CHECK: %iv.sext = sext i32 %iv to i64
|
|
; CHECK-NEXT: --> {0,+,1}<nuw><nsw><%loop>
|
|
%cmp = icmp slt i32 %iv, %n
|
|
call void(i1, ...) @llvm.experimental.guard(i1 %cmp) [ "deopt"() ]
|
|
%c = load volatile i1, i1* %cond
|
|
br i1 %c, label %loop, label %leave
|
|
|
|
leave:
|
|
ret void
|
|
}
|
|
|
|
define void @s_1(i1* %cond) {
|
|
; CHECK-LABEL: Classifying expressions for: @s_1
|
|
entry:
|
|
br label %loop
|
|
|
|
loop:
|
|
%iv = phi i32 [ 0, %entry ], [ %iv.inc, %loop ]
|
|
%iv.inc = add i32 %iv, 3
|
|
%iv.sext = sext i32 %iv to i64
|
|
; CHECK: %iv.sext = sext i32 %iv to i64
|
|
; CHECK-NEXT: --> {0,+,3}<nuw><nsw><%loop>
|
|
%cmp = icmp slt i32 %iv, 10000
|
|
call void(i1, ...) @llvm.experimental.guard(i1 %cmp) [ "deopt"() ]
|
|
%c = load volatile i1, i1* %cond
|
|
br i1 %c, label %loop, label %leave
|
|
|
|
leave:
|
|
ret void
|
|
}
|
|
|
|
define void @s_2(i1* %cond) {
|
|
; CHECK-LABEL: Classifying expressions for: @s_2
|
|
entry:
|
|
br label %loop
|
|
|
|
loop:
|
|
%iv = phi i32 [ 0, %entry ], [ %iv.inc, %loop ]
|
|
%iv.inc = add i32 %iv, 3
|
|
%iv.sext = sext i32 %iv to i64
|
|
%cmp = icmp slt i32 %iv, 10000
|
|
; CHECK: %iv.sext = sext i32 %iv to i64
|
|
; CHECK-NEXT: --> {0,+,3}<nuw><nsw><%loop>
|
|
call void @llvm.assume(i1 %cmp)
|
|
%c = load volatile i1, i1* %cond
|
|
br i1 %c, label %loop, label %leave
|
|
|
|
leave:
|
|
ret void
|
|
}
|
|
|
|
define void @s_3(i32 %start, i1* %cond) {
|
|
; CHECK-LABEL: Classifying expressions for: @s_3
|
|
entry:
|
|
br label %loop
|
|
|
|
loop:
|
|
%iv = phi i32 [ %start, %entry ], [ %iv.inc, %be ]
|
|
%cmp = icmp slt i32 %iv, 10000
|
|
br i1 %cmp, label %be, label %leave
|
|
|
|
be:
|
|
%iv.inc = add i32 %iv, 3
|
|
%iv.inc.sext = sext i32 %iv.inc to i64
|
|
; CHECK: %iv.inc.sext = sext i32 %iv.inc to i64
|
|
; CHECK-NEXT: --> {(sext i32 (3 + %start) to i64),+,3}<nsw><%loop>
|
|
%c = load volatile i1, i1* %cond
|
|
br i1 %c, label %loop, label %leave
|
|
|
|
leave:
|
|
ret void
|
|
}
|
|
|
|
define void @s_4(i32 %start, i1* %cond) {
|
|
; CHECK-LABEL: Classifying expressions for: @s_4
|
|
entry:
|
|
br label %loop
|
|
|
|
loop:
|
|
%iv = phi i32 [ %start, %entry ], [ %iv.inc, %be ]
|
|
%cmp = icmp sgt i32 %iv, -1000
|
|
br i1 %cmp, label %be, label %leave
|
|
|
|
be:
|
|
%iv.inc = add i32 %iv, -3
|
|
%iv.inc.sext = sext i32 %iv.inc to i64
|
|
; CHECK: %iv.inc.sext = sext i32 %iv.inc to i64
|
|
; CHECK-NEXT: --> {(sext i32 (-3 + %start) to i64),+,-3}<nsw><%loop>
|
|
%c = load volatile i1, i1* %cond
|
|
br i1 %c, label %loop, label %leave
|
|
|
|
leave:
|
|
ret void
|
|
}
|
|
|
|
define void @u_0(i32 %n, i1* %cond) {
|
|
; CHECK-LABEL: Classifying expressions for: @u_0
|
|
entry:
|
|
br label %loop
|
|
|
|
loop:
|
|
%iv = phi i32 [ 0, %entry ], [ %iv.inc, %loop ]
|
|
%iv.inc = add i32 %iv, 1
|
|
%iv.zext = zext i32 %iv to i64
|
|
; CHECK: %iv.zext = zext i32 %iv to i64
|
|
; CHECK-NEXT: --> {0,+,1}<nuw><%loop>
|
|
%cmp = icmp ult i32 %iv, %n
|
|
call void(i1, ...) @llvm.experimental.guard(i1 %cmp) [ "deopt"() ]
|
|
%c = load volatile i1, i1* %cond
|
|
br i1 %c, label %loop, label %leave
|
|
|
|
leave:
|
|
ret void
|
|
}
|
|
|
|
define void @u_1(i1* %cond) {
|
|
; CHECK-LABEL: Classifying expressions for: @u_1
|
|
entry:
|
|
br label %loop
|
|
|
|
loop:
|
|
%iv = phi i32 [ 0, %entry ], [ %iv.inc, %loop ]
|
|
%iv.inc = add i32 %iv, 3
|
|
%iv.zext = zext i32 %iv to i64
|
|
; CHECK: %iv.zext = zext i32 %iv to i64
|
|
; CHECK-NEXT: --> {0,+,3}<nuw><%loop>
|
|
%cmp = icmp ult i32 %iv, 10000
|
|
call void(i1, ...) @llvm.experimental.guard(i1 %cmp) [ "deopt"() ]
|
|
%c = load volatile i1, i1* %cond
|
|
br i1 %c, label %loop, label %leave
|
|
|
|
leave:
|
|
ret void
|
|
}
|
|
|
|
define void @u_2(i1* %cond) {
|
|
; CHECK-LABEL: Classifying expressions for: @u_2
|
|
entry:
|
|
br label %loop
|
|
|
|
loop:
|
|
%iv = phi i32 [ 30000, %entry ], [ %iv.inc, %loop ]
|
|
%iv.inc = add i32 %iv, -2
|
|
%iv.zext = zext i32 %iv to i64
|
|
%cmp = icmp ugt i32 %iv.inc, -10000
|
|
; CHECK: %iv.zext = zext i32 %iv to i64
|
|
; CHECK-NEXT: --> {30000,+,-2}<nw><%loop>
|
|
call void @llvm.assume(i1 %cmp)
|
|
%c = load volatile i1, i1* %cond
|
|
br i1 %c, label %loop, label %leave
|
|
|
|
leave:
|
|
ret void
|
|
}
|
|
|
|
define void @u_3(i32 %start, i1* %cond) {
|
|
; CHECK-LABEL: Classifying expressions for: @u_3
|
|
entry:
|
|
br label %loop
|
|
|
|
loop:
|
|
%iv = phi i32 [ %start, %entry ], [ %iv.inc, %be ]
|
|
%cmp = icmp ult i32 %iv, 10000
|
|
br i1 %cmp, label %be, label %leave
|
|
|
|
be:
|
|
%iv.inc = add i32 %iv, 3
|
|
%iv.inc.zext = zext i32 %iv.inc to i64
|
|
; CHECK: %iv.inc.zext = zext i32 %iv.inc to i64
|
|
; CHECK-NEXT: --> {(zext i32 (3 + %start) to i64),+,3}<nuw><%loop>
|
|
%c = load volatile i1, i1* %cond
|
|
br i1 %c, label %loop, label %leave
|
|
|
|
leave:
|
|
ret void
|
|
}
|