1 ; RUN: opt < %s -tailcallelim -verify-dom-info -S | FileCheck %s
4 declare void @use(i32*)
5 declare void @use_nocapture(i32* nocapture)
6 declare void @use2_nocapture(i32* nocapture, i32* nocapture)
8 ; Trivial case. Mark @noarg with tail call.
10 ; CHECK: tail call void @noarg()
15 ; Make sure that we do not do TRE if pointer to local stack
16 ; escapes through function call.
20 %A = alloca i32 ; <i32*> [#uses=2]
22 call void @use(i32* %A)
23 ; CHECK: call i32 @test1
24 %X = call i32 @test1() ; <i32> [#uses=1]
28 ; This function contains intervening instructions which should be moved out of the way
29 define i32 @test2(i32 %X) {
34 %tmp.1 = icmp eq i32 %X, 0 ; <i1> [#uses=1]
35 br i1 %tmp.1, label %then.0, label %endif.0
36 then.0: ; preds = %entry
37 %tmp.4 = add i32 %X, 1 ; <i32> [#uses=1]
39 endif.0: ; preds = %entry
40 %tmp.10 = add i32 %X, -1 ; <i32> [#uses=1]
41 %tmp.8 = call i32 @test2(i32 %tmp.10) ; <i32> [#uses=1]
42 %DUMMY = add i32 %X, 1 ; <i32> [#uses=0]
46 ; Though this case seems to be fairly unlikely to occur in the wild, someone
47 ; plunked it into the demo script, so maybe they care about it.
48 define i32 @test3(i32 %c) {
51 ; CHECK: %ret.tr = phi i32 [ undef, %entry ], [ %current.ret.tr, %else ]
52 ; CHECK: %ret.known.tr = phi i1 [ false, %entry ], [ true, %else ]
55 ; CHECK: %current.ret.tr = select i1 %ret.known.tr, i32 %ret.tr, i32 0
58 ; CHECK: %current.ret.tr1 = select i1 %ret.known.tr, i32 %ret.tr, i32 0
59 ; CHECK: ret i32 %current.ret.tr1
61 %tmp.1 = icmp eq i32 %c, 0 ; <i1> [#uses=1]
62 br i1 %tmp.1, label %return, label %else
63 else: ; preds = %entry
64 %tmp.5 = add i32 %c, -1 ; <i32> [#uses=1]
65 %tmp.3 = call i32 @test3(i32 %tmp.5) ; <i32> [#uses=0]
67 return: ; preds = %entry
71 ; Make sure that a nocapture pointer does not stop adding a tail call marker to
72 ; an unrelated call and additionally that we do not mark the nocapture call with
76 define void @test4() {
78 ; CHECK-NOT: tail call void @use_nocapture
79 ; CHECK: tail call void @noarg()
82 call void @use_nocapture(i32* %a)
87 ; Make sure that we do not perform TRE even with a nocapture use. This is due to
88 ; bad codegen caused by PR962.
91 define i32* @test5(i32* nocapture %A, i1 %cond) {
93 ; CHECK-NOT: tailrecurse:
94 ; CHECK: ret i32* null
96 br i1 %cond, label %cond_true, label %cond_false
98 call i32* @test5(i32* %B, i1 false)
101 call void @use2_nocapture(i32* %A, i32* %B)
106 ; PR14143: Make sure that we do not mark functions with nocapture allocas with tail.
109 define void @test6(i32* %a, i32* %b) {
110 ; CHECK-LABEL: @test6(
111 ; CHECK-NOT: tail call
113 %c = alloca [100 x i8], align 16
114 %tmp = bitcast [100 x i8]* %c to i32*
115 call void @use2_nocapture(i32* %b, i32* %tmp)
119 ; PR14143: Make sure that we do not mark functions with nocapture allocas with tail.
122 define void @test7(i32* %a, i32* %b) nounwind uwtable {
124 ; CHECK-LABEL: @test7(
125 ; CHECK-NOT: tail call
127 %c = alloca [100 x i8], align 16
128 %0 = bitcast [100 x i8]* %c to i32*
129 call void @use2_nocapture(i32* %0, i32* %a)
130 call void @use2_nocapture(i32* %b, i32* %0)
134 ; If we have a mix of escaping captured/non-captured allocas, ensure that we do
135 ; not do anything including marking callsites with the tail call marker.
138 define i32* @test8(i32* nocapture %A, i1 %cond) {
140 ; CHECK-NOT: tailrecurse:
141 ; CHECK-NOT: tail call
142 ; CHECK: ret i32* null
145 br i1 %cond, label %cond_true, label %cond_false
147 call void @use(i32* %B2)
148 call i32* @test8(i32* %B, i1 false)
151 call void @use2_nocapture(i32* %A, i32* %B)
156 ; Don't tail call if a byval arg is captured.
157 define void @test9(i32* byval(i32) %a) {
158 ; CHECK-LABEL: define void @test9(
159 ; CHECK: {{^ *}}call void @use(
160 call void @use(i32* %a)
164 %struct.X = type { i8* }
166 declare void @ctor(%struct.X*)
167 define void @test10(%struct.X* noalias sret(%struct.X) %agg.result, i1 zeroext %b) {
168 ; CHECK-LABEL: @test10
170 %x = alloca %struct.X, align 8
171 br i1 %b, label %if.then, label %if.end
173 if.then: ; preds = %entry
174 call void @ctor(%struct.X* %agg.result)
175 ; CHECK: tail call void @ctor
179 call void @ctor(%struct.X* %x)
180 ; CHECK: call void @ctor
187 declare void @test11_helper1(i8** nocapture, i8*)
188 declare void @test11_helper2(i8*)
189 define void @test11() {
190 ; CHECK-LABEL: @test11
194 call void @test11_helper1(i8** %a, i8* %b) ; a = &b
195 %c = load i8*, i8** %a
196 call void @test11_helper2(i8* %c)
197 ; CHECK: call void @test11_helper2
202 define void @test12() {
204 ; CHECK-LABEL: @test12
205 ; CHECK: {{^ *}} call void undef(i8* undef) [ "foo"(i8* %e) ]
207 call void undef(i8* undef) [ "foo"(i8* %e) ]
211 %struct.foo = type { [10 x i32] }
213 ; If an alloca is passed byval it is not a use of the alloca or an escape
214 ; point, and both calls below can be marked tail.
215 define void @test13() {
216 ; CHECK-LABEL: @test13
217 ; CHECK: tail call void @bar(%struct.foo* byval(%struct.foo) %f)
218 ; CHECK: tail call void @bar(%struct.foo* byval(%struct.foo) null)
220 %f = alloca %struct.foo
221 call void @bar(%struct.foo* byval(%struct.foo) %f)
222 call void @bar(%struct.foo* byval(%struct.foo) null)
226 ; A call which passes a byval parameter using byval can be marked tail.
227 define void @test14(%struct.foo* byval(%struct.foo) %f) {
228 ; CHECK-LABEL: @test14
229 ; CHECK: tail call void @bar
231 call void @bar(%struct.foo* byval(%struct.foo) %f)
235 ; If a byval parameter is copied into an alloca and passed byval the call can
237 define void @test15(%struct.foo* byval(%struct.foo) %f) {
238 ; CHECK-LABEL: @test15
239 ; CHECK: tail call void @bar
241 %agg.tmp = alloca %struct.foo
242 %0 = bitcast %struct.foo* %agg.tmp to i8*
243 %1 = bitcast %struct.foo* %f to i8*
244 call void @llvm.memcpy.p0i8.p0i8.i64(i8* %0, i8* %1, i64 40, i1 false)
245 call void @bar(%struct.foo* byval(%struct.foo) %agg.tmp)
249 declare void @bar(%struct.foo* byval(%struct.foo))
250 declare void @llvm.memcpy.p0i8.p0i8.i64(i8* nocapture writeonly, i8* nocapture readonly, i64, i1)