mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-12-14 11:32:34 +00:00
12aa70b7e9
Summary: Teach SCEV to prove no overflow for an add recurrence by proving something about the range of another add recurrence a loop-invariant distance away from it. Reviewers: atrick, hfinkel Subscribers: llvm-commits Differential Revision: http://reviews.llvm.org/D7980 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@231305 91177308-0d34-0410-b5e6-96231b3b80d8
45 lines
1004 B
LLVM
45 lines
1004 B
LLVM
; RUN: opt -analyze -scalar-evolution < %s | FileCheck %s
|
|
|
|
define void @f(i1* %condition) {
|
|
; CHECK-LABEL: Classifying expressions for: @f
|
|
entry:
|
|
br label %loop
|
|
|
|
loop:
|
|
%idx = phi i32 [ 0, %entry ], [ %idx.inc, %loop ]
|
|
%idx.inc = add nsw i32 %idx, 1
|
|
|
|
%idx.inc2 = add i32 %idx.inc, 1
|
|
%idx.inc2.zext = zext i32 %idx.inc2 to i64
|
|
|
|
; CHECK: %idx.inc2.zext = zext i32 %idx.inc2 to i64
|
|
; CHECK-NEXT: --> {2,+,1}<nuw><%loop>
|
|
|
|
%c = load volatile i1, i1* %condition
|
|
br i1 %c, label %loop, label %exit
|
|
|
|
exit:
|
|
ret void
|
|
}
|
|
|
|
define void @g(i1* %condition) {
|
|
; CHECK-LABEL: Classifying expressions for: @g
|
|
entry:
|
|
br label %loop
|
|
|
|
loop:
|
|
%idx = phi i32 [ 0, %entry ], [ %idx.inc, %loop ]
|
|
%idx.inc = add nsw i32 %idx, 3
|
|
|
|
%idx.inc2 = add i32 %idx.inc, -1
|
|
%idx.inc2.sext = sext i32 %idx.inc2 to i64
|
|
; CHECK: %idx.inc2.sext = sext i32 %idx.inc2 to i64
|
|
; CHECK-NEXT: --> {2,+,3}<nuw><nsw><%loop>
|
|
|
|
%c = load volatile i1, i1* %condition
|
|
br i1 %c, label %loop, label %exit
|
|
|
|
exit:
|
|
ret void
|
|
}
|