1 ; The inliner should never inline recursive functions into other functions.
2 ; This effectively is just peeling off the first iteration of a loop, and the
3 ; inliner heuristics are not set up for this.
5 ; RUN: opt -inline %s -S | FileCheck %s
7 target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64"
8 target triple = "x86_64-apple-darwin10.3"
10 @g = common global i32 0 ; <i32*> [#uses=1]
12 define internal void @foo(i32 %x) nounwind ssp {
14 %0 = icmp slt i32 %x, 0 ; <i1> [#uses=1]
15 br i1 %0, label %return, label %bb
18 %1 = sub nsw i32 %x, 1 ; <i32> [#uses=1]
19 call void @foo(i32 %1) nounwind ssp
20 volatile store i32 1, i32* @g, align 4
23 return: ; preds = %entry
29 ;; CHECK: call void @foo(i32 42)
30 define void @bonk() nounwind ssp {
32 call void @foo(i32 42) nounwind ssp
38 ;; Here is an indirect case that should not be infinitely inlined.
40 define internal void @f1(i32 %x, i8* %Foo, i8* %Bar) nounwind ssp {
42 %0 = bitcast i8* %Bar to void (i32, i8*, i8*)*
43 %1 = sub nsw i32 %x, 1
44 call void %0(i32 %1, i8* %Foo, i8* %Bar) nounwind
45 volatile store i32 42, i32* @g, align 4
49 define internal void @f2(i32 %x, i8* %Foo, i8* %Bar) nounwind ssp {
51 %0 = icmp slt i32 %x, 0 ; <i1> [#uses=1]
52 br i1 %0, label %return, label %bb
55 %1 = bitcast i8* %Foo to void (i32, i8*, i8*)* ; <void (i32, i8*, i8*)*> [#uses=1]
56 call void %1(i32 %x, i8* %Foo, i8* %Bar) nounwind
57 volatile store i32 13, i32* @g, align 4
60 return: ; preds = %entry
66 ; CHECK: call void @f2(i32 122
67 ; Here we inline one instance of the cycle, but we don't want to completely
69 define void @top_level() nounwind ssp {
71 call void @f2(i32 123, i8* bitcast (void (i32, i8*, i8*)* @f1 to i8*), i8* bitcast (void (i32, i8*, i8*)* @f2 to i8*)) nounwind ssp