1 ; This testcase tests to see if adds and PHI's are handled in their full
2 ; generality. This testcase comes from the following C code:
6 ; for (i = 1; i < 100; i++) {
12 ; Note that this is a "feature" test, not a correctness test.
15 ; RUN: llvm-upgrade < %s | llvm-as | opt -cee -simplifycfg -disable-output &&
16 ; RUN: llvm-upgrade < %s | llvm-as | opt -cee -simplifycfg | llvm-dis | not grep cond213
18 implementation ; Functions:
23 bb0: ; No predecessors!
26 bb2: ; preds = %bb4, %bb0
27 %cann-indvar = phi int [ 0, %bb0 ], [ %add1-indvar, %bb4 ] ; <int> [#uses=2]
28 %add1-indvar = add int %cann-indvar, 1 ; <int> [#uses=2]
29 %cond213 = seteq int %add1-indvar, 0 ; <bool> [#uses=1]
30 br bool %cond213, label %bb4, label %bb3
36 bb4: ; preds = %bb3, %bb2
37 %reg109 = add int %cann-indvar, 2 ; <int> [#uses=1]
38 %cond217 = setle int %reg109, 99 ; <bool> [#uses=1]
39 br bool %cond217, label %bb2, label %bb5