llvm/test/Analysis/ValueTracking/monotonic-phi.ll
James Molloy 79c45a3954 [ValueTracking] Teach isKnownNonZero about monotonically increasing PHIs
If a PHI starts at a non-negative constant, monotonically increases
(only adds of a constant are supported at the moment) and that add
does not wrap, then the PHI is known never to be zero.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@248796 91177308-0d34-0410-b5e6-96231b3b80d8
2015-09-29 14:08:45 +00:00

50 lines
1.0 KiB
LLVM

; RUN: opt -instsimplify -S < %s | FileCheck %s
; CHECK-LABEL: @test1
define i1 @test1(i8 %p, i8* %pq, i8 %n, i8 %r) {
entry:
br label %loop
loop:
%A = phi i8 [ 1, %entry ], [ %next, %loop ]
%next = add nsw i8 %A, 1
%cmp1 = icmp eq i8 %A, %n
br i1 %cmp1, label %exit, label %loop
exit:
%add = or i8 %A, %r
%cmp = icmp eq i8 %add, 0
; CHECK: ret i1 false
ret i1 %cmp
}
; CHECK-LABEL: @test2
define i1 @test2(i8 %p, i8* %pq, i8 %n, i8 %r) {
entry:
br label %loop
loop:
%A = phi i8 [ 1, %entry ], [ %next, %loop ]
%next = add i8 %A, 1
%cmp1 = icmp eq i8 %A, %n
br i1 %cmp1, label %exit, label %loop
exit:
%add = or i8 %A, %r
%cmp = icmp eq i8 %add, 0
; CHECK-NOT: ret i1 false
ret i1 %cmp
}
; CHECK-LABEL: @test3
define i1 @test3(i8 %p, i8* %pq, i8 %n, i8 %r) {
entry:
br label %loop
loop:
%A = phi i8 [ 1, %entry ], [ %next, %loop ]
%next = add nuw i8 %A, 1
%cmp1 = icmp eq i8 %A, %n
br i1 %cmp1, label %exit, label %loop
exit:
%add = or i8 %A, %r
%cmp = icmp eq i8 %add, 0
; CHECK: ret i1 false
ret i1 %cmp
}