1 ;; RUN: opt -S < %s -indvars | FileCheck %s
3 ;; Check if llvm can narrow !range metadata based on loop entry
8 define i1 @bounded_below_slt(i32* nocapture readonly %buffer) {
9 ; CHECK-LABEL: bounded_below_slt
11 %length = load i32* %buffer, !range !0
12 %entry.pred = icmp eq i32 %length, 0
13 br i1 %entry.pred, label %abort, label %loop.preheader
20 %idx = phi i32 [ %idx.inc, %loop.next ], [ 0, %loop.preheader ]
21 %oob.pred = icmp slt i32 %idx, %length
22 br i1 %oob.pred, label %loop.next, label %oob
23 ; CHECK: br i1 true, label %loop.next, label %oob
27 %idx.inc = add i32 %idx, 1
28 %exit.pred = icmp slt i32 %idx.inc, %length
29 br i1 %exit.pred, label %loop, label %abort.loopexit
38 tail call void @abort()
42 define i1 @bounded_below_sle(i32* nocapture readonly %buffer) {
43 ; CHECK-LABEL: bounded_below_sle
45 %length = load i32* %buffer, !range !0
46 %entry.pred = icmp eq i32 %length, 0
47 br i1 %entry.pred, label %abort, label %loop.preheader
54 %idx = phi i32 [ %idx.inc, %loop.next ], [ 0, %loop.preheader ]
55 %oob.pred = icmp sle i32 %idx, %length
56 br i1 %oob.pred, label %loop.next, label %oob
57 ; CHECK: br i1 true, label %loop.next, label %oob
61 %idx.inc = add i32 %idx, 1
62 %exit.pred = icmp sle i32 %idx.inc, %length
63 br i1 %exit.pred, label %loop, label %abort.loopexit
72 tail call void @abort()
76 ;; Assert that we're not making an incorrect transform.
78 declare i32 @check(i8*)
80 define void @NoChange() {
81 ; CHECK-LABEL: NoChange
87 %i.01 = phi i64 [ 2, %entry ], [ %add, %loop.end ]
88 %cmp = icmp ugt i64 %i.01, 1
89 ; CHECK: %cmp = icmp ugt i64 %i.01, 1
90 br i1 %cmp, label %loop, label %loop.end
94 %.sum = add i64 %i.01, -2
95 %v = getelementptr inbounds i8* null, i64 %.sum
96 %r = tail call i32 @check(i8* %v)
97 %c = icmp eq i32 %r, 0
98 br i1 %c, label %loop.end, label %abort.now
101 tail call void @abort()
105 %add = add i64 %i.01, -1
106 %eq = icmp eq i64 %add, 0
107 br i1 %eq, label %exit, label %loop.begin
113 !0 = !{i32 0, i32 100}