Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame] | 1 | ; This test shows SCCP "proving" that the loop (from bb6 to 14) loops infinitely |
| 2 | ; this is in fact NOT the case, so the return should still be alive in the code |
| 3 | ; after sccp and CFG simplification have been performed. |
| 4 | ; |
| 5 | ; RUN: llvm-upgrade < %s | llvm-as | opt -sccp -simplifycfg | llvm-dis | \ |
| 6 | ; RUN: grep ret |
| 7 | |
| 8 | |
| 9 | void "old_main"() { |
| 10 | bb3: ;[#uses=1] |
| 11 | br label %bb6 |
| 12 | |
| 13 | bb6: ;[#uses=3] |
| 14 | %reg403 = phi int [ %reg155, %bb14 ], [ 0, %bb3 ] ; <int> [#uses=2] |
| 15 | %reg155 = add int %reg403, 1 ; <int> [#uses=3] |
| 16 | |
| 17 | br label %bb11 |
| 18 | |
| 19 | bb11: |
| 20 | %reg407 = phi int [ %reg408, %bb11 ], [ 0, %bb6 ] ; <int> [#uses=2] |
| 21 | %reg408 = add int %reg407, 1 ; <int> [#uses=2] |
| 22 | %cond550 = setle int %reg407, 1 ; <bool> [#uses=1] |
| 23 | br bool %cond550, label %bb11, label %bb12 |
| 24 | |
| 25 | bb12: ;[#uses=2] |
| 26 | br label %bb13 |
| 27 | |
| 28 | bb13: ;[#uses=3] |
| 29 | %reg409 = phi int [ %reg410, %bb13 ], [ 0, %bb12 ] ; <int> [#uses=1] |
| 30 | %reg410 = add int %reg409, 1 ; <int> [#uses=2] |
| 31 | %cond552 = setle int %reg410, 2 ; <bool> [#uses=1] |
| 32 | br bool %cond552, label %bb13, label %bb14 |
| 33 | |
| 34 | bb14: ;[#uses=2] |
| 35 | %cond553 = setle int %reg155, 31 ; <bool> [#uses=1] |
| 36 | br bool %cond553, label %bb6, label %bb15 |
| 37 | |
| 38 | bb15: ;[#uses=1] |
| 39 | ret void |
| 40 | } |