110 lines · plain
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 the3; inliner heuristics are not set up for this.4 5; RUN: opt -passes=inline -S < %s | FileCheck %s6; RUN: opt -passes='cgscc(inline)' -S < %s | FileCheck %s7 8target 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"9target triple = "x86_64-apple-darwin10.3"10 11@g = common global i32 0 ; <ptr> [#uses=1]12 13define internal void @foo(i32 %x) nounwind ssp {14entry:15 %0 = icmp slt i32 %x, 0 ; <i1> [#uses=1]16 br i1 %0, label %return, label %bb17 18bb: ; preds = %entry19 %1 = sub nsw i32 %x, 1 ; <i32> [#uses=1]20 call void @foo(i32 %1) nounwind ssp21 store volatile i32 1, ptr @g, align 422 ret void23 24return: ; preds = %entry25 ret void26}27 28 29;; CHECK-LABEL: @bonk(30;; CHECK: call void @foo(i32 42)31define void @bonk() nounwind ssp {32entry:33 call void @foo(i32 42) nounwind ssp34 ret void35}36 37 38 39;; Here is an indirect case that should not be infinitely inlined.40 41define internal void @f1(i32 %x, ptr %Foo, ptr %Bar) nounwind ssp {42entry:43 %0 = sub nsw i32 %x, 144 call void %Bar(i32 %0, ptr %Foo, ptr %Bar) nounwind45 store volatile i32 42, ptr @g, align 446 ret void47}48 49define internal void @f2(i32 %x, ptr %Foo, ptr %Bar) nounwind ssp {50entry:51 %0 = icmp slt i32 %x, 0 ; <i1> [#uses=1]52 br i1 %0, label %return, label %bb53 54bb: ; preds = %entry55 call void %Foo(i32 %x, ptr %Foo, ptr %Bar) nounwind56 store volatile i32 13, ptr @g, align 457 ret void58 59return: ; preds = %entry60 ret void61}62 63 64; CHECK-LABEL: @top_level(65; CHECK: call void @f2(i32 12266; Here we inline one instance of the cycle, but we don't want to completely67; unroll it.68define void @top_level() nounwind ssp {69entry:70 call void @f2(i32 123, ptr @f1, ptr @f2) nounwind ssp71 ret void72}73 74 75; Check that a recursive function, when called with a constant that makes the76; recursive path dead code can actually be inlined.77define i32 @fib(i32 %i) {78entry:79 %is.zero = icmp eq i32 %i, 080 br i1 %is.zero, label %zero.then, label %zero.else81 82zero.then:83 ret i32 084 85zero.else:86 %is.one = icmp eq i32 %i, 187 br i1 %is.one, label %one.then, label %one.else88 89one.then:90 ret i32 191 92one.else:93 %i1 = sub i32 %i, 194 %f1 = call i32 @fib(i32 %i1)95 %i2 = sub i32 %i, 296 %f2 = call i32 @fib(i32 %i2)97 %f = add i32 %f1, %f298 ret i32 %f99}100 101define i32 @fib_caller() {102; CHECK-LABEL: @fib_caller(103; CHECK-NOT: call104; CHECK: ret105 %f1 = call i32 @fib(i32 0)106 %f2 = call i32 @fib(i32 1)107 %result = add i32 %f1, %f2108 ret i32 %result109}110