1 ; These tests ensure that we can compute the trip count of various forms of
2 ; loops. If the trip count of the loop is computable, then we will know what
3 ; the exit value of the loop will be for some value, allowing us to substitute
4 ; it directly into users outside of the loop, making the loop dead.
6 ; RUN: llvm-upgrade < %s | llvm-as | opt -indvars -adce -simplifycfg | llvm-dis | not grep br
8 int %linear_setne() { ;; for (i = 0; i != 100; ++i)
12 %i = phi int [ 0, %entry ], [ %i.next, %loop ]
13 %i.next = add int %i, 1
14 %c = setne int %i, 100
15 br bool %c, label %loop, label %loopexit
20 int %linear_setne_2() { ;; for (i = 0; i != 100; i += 2)
24 %i = phi int [ 0, %entry ], [ %i.next, %loop ]
25 %i.next = add int %i, 2
26 %c = setne int %i, 100
27 br bool %c, label %loop, label %loopexit
33 int %linear_setne_overflow() { ;; for (i = 1024; i != 0; i += 1024)
37 %i = phi int [ 1024, %entry ], [ %i.next, %loop ]
38 %i.next = add int %i, 1024
40 br bool %c, label %loop, label %loopexit
45 int %linear_setlt() { ;; for (i = 0; i < 100; ++i)
49 %i = phi int [ 0, %entry ], [ %i.next, %loop ]
50 %i.next = add int %i, 1
51 %c = setlt int %i, 100
52 br bool %c, label %loop, label %loopexit
57 int %quadratic_setlt() { ;; for (i = 7; i*i < 1000; i+=3)
61 %i = phi int [ 7, %entry ], [ %i.next, %loop ]
62 %i.next = add int %i, 3
64 %c = setlt int %i2, 1000
65 br bool %c, label %loop, label %loopexit
70 ;; Chained loop test - The exit value of the second loop depends on the exit
71 ;; value of the first being computed.
75 loop: ;; for (i = 0; i != 100; ++i)
76 %i = phi int [ 0, %entry ], [ %i.next, %loop ]
77 %i.next = add int %i, 1
78 %c = setne int %i, 100
79 br bool %c, label %loop, label %loopexit
82 loop2: ;; for (j = i; j != 200; ++j)
83 %j = phi int [ %i, %loopexit ], [ %j.next, %loop2 ]
84 %j.next = add int %j, 1
85 %c2 = setne int %j, 200
86 br bool %c2, label %loop2, label %loopexit2