[Inliner] Clean up a test case a bit to make it more clear what is being

tested and why.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@311228 91177308-0d34-0410-b5e6-96231b3b80d8

test/Transforms/Inline/recursive.ll

@@ -1,39 +1,42 @@
+; Inlining in the presence of recursion presents special challenges that we
+; test here.
+;
 ; RUN: opt -inline -S < %s | FileCheck %s
 ; RUN: opt -passes='cgscc(inline)' -S < %s | FileCheck %s
 
-target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f32:32:32-f64:32:64-v64:64:64-v128:128:128-a0:0:64-f80:128:128"
-target triple = "i386-apple-darwin10.0"
-
-; rdar://10853263
-
-; Make sure that the callee is still here.
-; CHECK-LABEL: define i32 @callee(
-define i32 @callee(i32 %param) {
+define i32 @large_stack_callee(i32 %param) {
+; CHECK-LABEL: define i32 @large_stack_callee(
+entry:
  %yyy = alloca [100000 x i8]
  %r = bitcast [100000 x i8]* %yyy to i8*
- call void @foo2(i8* %r)
+ call void @bar(i8* %r)
  ret i32 4
 }
 
-; CHECK-LABEL: define i32 @caller(
+; Test a recursive function which calls another function with a large stack. In
+; addition to not inlining the recursive call, we should also not inline the
+; large stack allocation into a potentially recursive frame.
+define i32 @large_stack_recursive_caller(i32 %param) {
+; CHECK-LABEL: define i32 @large_stack_recursive_caller(
+entry:
 ; CHECK-NEXT: entry:
 ; CHECK-NOT: alloca
-; CHECK: ret
-define i32 @caller(i32 %param) {
-entry:
   %t = call i32 @foo(i32 %param)
   %cmp = icmp eq i32 %t, -1
   br i1 %cmp, label %exit, label %cont
 
 cont:
-  %r = call i32 @caller(i32 %t)
-  %f = call i32 @callee(i32 %r)
-  br label %cont
+  %r = call i32 @large_stack_recursive_caller(i32 %t)
+; CHECK: call i32 @large_stack_recursive_caller
+  %f = call i32 @large_stack_callee(i32 %r)
+; CHECK: call i32 @large_stack_callee
+  br label %exit
+
 exit:
   ret i32 4
 }
 
-declare void @foo2(i8* %in)
+declare void @bar(i8* %in)
 
 declare i32 @foo(i32 %param)