1 ; RUN: opt < %s -tailcallelim -S | FileCheck %s
4 declare void @use(i32*)
6 ; Trivial case. Mark @noarg with tail call.
8 ; CHECK: tail call void @noarg()
13 ; PR615. Make sure that we do not move the alloca so that it interferes with the tail call.
17 %A = alloca i32 ; <i32*> [#uses=2]
19 call void @use(i32* %A)
20 %X = tail call i32 @test1() ; <i32> [#uses=1]
24 ; This function contains intervening instructions which should be moved out of the way
25 define i32 @test2(i32 %X) {
30 %tmp.1 = icmp eq i32 %X, 0 ; <i1> [#uses=1]
31 br i1 %tmp.1, label %then.0, label %endif.0
32 then.0: ; preds = %entry
33 %tmp.4 = add i32 %X, 1 ; <i32> [#uses=1]
35 endif.0: ; preds = %entry
36 %tmp.10 = add i32 %X, -1 ; <i32> [#uses=1]
37 %tmp.8 = call i32 @test2(i32 %tmp.10) ; <i32> [#uses=1]
38 %DUMMY = add i32 %X, 1 ; <i32> [#uses=0]
42 ; Though this case seems to be fairly unlikely to occur in the wild, someone
43 ; plunked it into the demo script, so maybe they care about it.
44 define i32 @test3(i32 %c) {
49 %tmp.1 = icmp eq i32 %c, 0 ; <i1> [#uses=1]
50 br i1 %tmp.1, label %return, label %else
51 else: ; preds = %entry
52 %tmp.5 = add i32 %c, -1 ; <i32> [#uses=1]
53 %tmp.3 = call i32 @test3(i32 %tmp.5) ; <i32> [#uses=0]
55 return: ; preds = %entry