llvm-project/llvm/test/Analysis/ScalarEvolution/2008-02-11-ReversedConditio...

18 lines
371 B
LLVM

; RUN: opt < %s -scalar-evolution -analyze | FileCheck %s
; CHECK: Loop %header: backedge-taken count is (0 smax %n)
define void @foo(i32 %n) {
entry:
br label %header
header:
%i = phi i32 [ 0, %entry ], [ %i.inc, %next ]
%cond = icmp sgt i32 %n, %i
br i1 %cond, label %next, label %return
next:
%i.inc = add i32 %i, 1
br label %header
return:
ret void
}