Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame^] | 1 | ; The i induction variable looks like a wrap-around, but it really is just |
| 2 | ; a simple affine IV. Make sure that indvars eliminates it. |
| 3 | |
| 4 | ; RUN: llvm-upgrade < %s | llvm-as | opt -indvars | llvm-dis | grep phi | wc -l | grep 1 |
| 5 | |
| 6 | void %foo() { |
| 7 | entry: |
| 8 | br label %bb6 |
| 9 | |
| 10 | bb6: ; preds = %cond_true, %entry |
| 11 | %j.0 = phi int [ 1, %entry ], [ %tmp5, %cond_true ] ; <int> [#uses=3] |
| 12 | %i.0 = phi int [ 0, %entry ], [ %j.0, %cond_true ] ; <int> [#uses=1] |
| 13 | %tmp7 = call int (...)* %foo2( ) ; <int> [#uses=1] |
| 14 | %tmp = setne int %tmp7, 0 ; <bool> [#uses=1] |
| 15 | br bool %tmp, label %cond_true, label %return |
| 16 | |
| 17 | cond_true: ; preds = %bb6 |
| 18 | %tmp2 = call int (...)* %bar( int %i.0, int %j.0 ) ; <int> [#uses=0] |
| 19 | %tmp5 = add int %j.0, 1 ; <int> [#uses=1] |
| 20 | br label %bb6 |
| 21 | |
| 22 | return: ; preds = %bb6 |
| 23 | ret void |
| 24 | } |
| 25 | |
| 26 | declare int %bar(...) |
| 27 | |
| 28 | declare int %foo2(...) |