| ; The inliner should never inline recursive functions into other functions. |
| ; This effectively is just peeling off the first iteration of a loop, and the |
| ; inliner heuristics are not set up for this. |
| |
| ; RUN: opt -passes=inline -S < %s | FileCheck %s |
| ; RUN: opt -passes='cgscc(inline)' -S < %s | FileCheck %s |
| |
| 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" |
| target triple = "x86_64-apple-darwin10.3" |
| |
| @g = common global i32 0 ; <ptr> [#uses=1] |
| |
| define internal void @foo(i32 %x) nounwind ssp { |
| entry: |
| %0 = icmp slt i32 %x, 0 ; <i1> [#uses=1] |
| br i1 %0, label %return, label %bb |
| |
| bb: ; preds = %entry |
| %1 = sub nsw i32 %x, 1 ; <i32> [#uses=1] |
| call void @foo(i32 %1) nounwind ssp |
| store volatile i32 1, ptr @g, align 4 |
| ret void |
| |
| return: ; preds = %entry |
| ret void |
| } |
| |
| |
| ;; CHECK-LABEL: @bonk( |
| ;; CHECK: call void @foo(i32 42) |
| define void @bonk() nounwind ssp { |
| entry: |
| call void @foo(i32 42) nounwind ssp |
| ret void |
| } |
| |
| |
| |
| ;; Here is an indirect case that should not be infinitely inlined. |
| |
| define internal void @f1(i32 %x, ptr %Foo, ptr %Bar) nounwind ssp { |
| entry: |
| %0 = sub nsw i32 %x, 1 |
| call void %Bar(i32 %0, ptr %Foo, ptr %Bar) nounwind |
| store volatile i32 42, ptr @g, align 4 |
| ret void |
| } |
| |
| define internal void @f2(i32 %x, ptr %Foo, ptr %Bar) nounwind ssp { |
| entry: |
| %0 = icmp slt i32 %x, 0 ; <i1> [#uses=1] |
| br i1 %0, label %return, label %bb |
| |
| bb: ; preds = %entry |
| call void %Foo(i32 %x, ptr %Foo, ptr %Bar) nounwind |
| store volatile i32 13, ptr @g, align 4 |
| ret void |
| |
| return: ; preds = %entry |
| ret void |
| } |
| |
| |
| ; CHECK-LABEL: @top_level( |
| ; CHECK: call void @f2(i32 122 |
| ; Here we inline one instance of the cycle, but we don't want to completely |
| ; unroll it. |
| define void @top_level() nounwind ssp { |
| entry: |
| call void @f2(i32 123, ptr @f1, ptr @f2) nounwind ssp |
| ret void |
| } |
| |
| |
| ; Check that a recursive function, when called with a constant that makes the |
| ; recursive path dead code can actually be inlined. |
| define i32 @fib(i32 %i) { |
| entry: |
| %is.zero = icmp eq i32 %i, 0 |
| br i1 %is.zero, label %zero.then, label %zero.else |
| |
| zero.then: |
| ret i32 0 |
| |
| zero.else: |
| %is.one = icmp eq i32 %i, 1 |
| br i1 %is.one, label %one.then, label %one.else |
| |
| one.then: |
| ret i32 1 |
| |
| one.else: |
| %i1 = sub i32 %i, 1 |
| %f1 = call i32 @fib(i32 %i1) |
| %i2 = sub i32 %i, 2 |
| %f2 = call i32 @fib(i32 %i2) |
| %f = add i32 %f1, %f2 |
| ret i32 %f |
| } |
| |
| define i32 @fib_caller() { |
| ; CHECK-LABEL: @fib_caller( |
| ; CHECK-NOT: call |
| ; CHECK: ret |
| %f1 = call i32 @fib(i32 0) |
| %f2 = call i32 @fib(i32 1) |
| %result = add i32 %f1, %f2 |
| ret i32 %result |
| } |