1 ; Test that we can evaluate the exit values of various expression types. Since
2 ; these loops all have predictable exit values we can replace the use outside
3 ; of the loop with a closed-form computation, making the loop dead.
5 ; RUN: llvm-upgrade < %s | llvm-as | opt -indvars -adce -simplifycfg | \
6 ; RUN: llvm-dis | not grep br
8 int %polynomial_constant() {
11 %A1 = phi int [0, %0], [%A2, %Loop]
12 %B1 = phi int [0, %0], [%B2, %Loop]
14 %B2 = add int %B1, %A1
16 %C = seteq int %A1, 1000
17 br bool %C, label %Out, label %Loop
22 int %NSquare(int %N) {
25 %X = phi int [0, %0], [%X2, %Loop]
28 br bool %c, label %Out, label %Loop
34 int %NSquareOver2(int %N) {
37 %X = phi int [0, %0], [%X2, %Loop]
38 %Y = phi int [15, %0], [%Y2, %Loop] ;; include offset of 15 for yuks
44 br bool %c, label %Out, label %Loop
49 int %strength_reduced() {
52 %A1 = phi int [0, %0], [%A2, %Loop]
53 %B1 = phi int [0, %0], [%B2, %Loop]
55 %B2 = add int %B1, %A1
57 %C = seteq int %A1, 1000
58 br bool %C, label %Out, label %Loop
67 %i0 = phi int [ 0, %entry ], [ %i1, %no_exit ]
68 %ISq = mul int %i0, %i0
70 %tmp.1 = setne int %ISq, 10000 ; while (I*I != 1000)
71 br bool %tmp.1, label %no_exit, label %loopexit
76 ;; We should recognize B1 as being a recurrence, allowing us to compute the
77 ;; trip count and eliminate the loop.
78 short %cast_chrec_test() {
81 %A1 = phi int [0, %0], [%A2, %Loop]
82 %B1 = cast int %A1 to short
85 %C = seteq short %B1, 1000
86 br bool %C, label %Out, label %Loop
91 uint %linear_div_fold() { ;; for (i = 4; i != 68; i += 8) (exit with i/2)
95 %i = phi uint [ 4, %entry ], [ %i.next, %loop ]
96 %i.next = add uint %i, 8
98 %c = setne uint %i, 68
99 br bool %c, label %loop, label %loopexit