| Chris Lattner | 4b7b42c | 2010-04-30 22:37:22 +0000 | [diff] [blame] | 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. |
| 4 | |
| Chris Lattner | 1595287 | 2010-05-01 01:05:10 +0000 | [diff] [blame^] | 5 | ; RUN: opt -inline %s -S | FileCheck %s |
| Chris Lattner | 4b7b42c | 2010-04-30 22:37:22 +0000 | [diff] [blame] | 6 | |
| 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" |
| 9 | |
| 10 | @g = common global i32 0 ; <i32*> [#uses=1] |
| 11 | |
| 12 | define internal void @foo(i32 %x) nounwind ssp { |
| 13 | entry: |
| Chris Lattner | 4b7b42c | 2010-04-30 22:37:22 +0000 | [diff] [blame] | 14 | %0 = icmp slt i32 %x, 0 ; <i1> [#uses=1] |
| 15 | br i1 %0, label %return, label %bb |
| 16 | |
| 17 | bb: ; preds = %entry |
| 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 |
| 21 | ret void |
| 22 | |
| 23 | return: ; preds = %entry |
| 24 | ret void |
| 25 | } |
| 26 | |
| Chris Lattner | 1595287 | 2010-05-01 01:05:10 +0000 | [diff] [blame^] | 27 | |
| 28 | ;; CHECK: @bonk |
| 29 | ;; CHECK: call void @foo(i32 42) |
| Chris Lattner | 4b7b42c | 2010-04-30 22:37:22 +0000 | [diff] [blame] | 30 | define void @bonk() nounwind ssp { |
| 31 | entry: |
| 32 | call void @foo(i32 42) nounwind ssp |
| 33 | ret void |
| 34 | } |
| Chris Lattner | 1595287 | 2010-05-01 01:05:10 +0000 | [diff] [blame^] | 35 | |
| 36 | |
| 37 | |
| 38 | ;; Here is an indirect case that should not be infinitely inlined. |
| 39 | |
| 40 | define internal void @f1(i32 %x, i8* %Foo, i8* %Bar) nounwind ssp { |
| 41 | entry: |
| 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 |
| 46 | ret void |
| 47 | } |
| 48 | |
| 49 | define internal void @f2(i32 %x, i8* %Foo, i8* %Bar) nounwind ssp { |
| 50 | entry: |
| 51 | %0 = icmp slt i32 %x, 0 ; <i1> [#uses=1] |
| 52 | br i1 %0, label %return, label %bb |
| 53 | |
| 54 | bb: ; preds = %entry |
| 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 |
| 58 | ret void |
| 59 | |
| 60 | return: ; preds = %entry |
| 61 | ret void |
| 62 | } |
| 63 | |
| 64 | |
| 65 | ; CHECK: @top_level |
| 66 | ; CHECK: call void @f2(i32 122 |
| 67 | ; Here we inline one instance of the cycle, but we don't want to completely |
| 68 | ; unroll it. |
| 69 | define void @top_level() nounwind ssp { |
| 70 | entry: |
| 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 |
| 72 | ret void |
| 73 | } |