[llvm] r185723 - [TRE] Merged several tests into the the test basic.ll.

Michael Gottesman mgottesman at apple.com
Fri Jul 5 13:45:13 PDT 2013


Author: mgottesman
Date: Fri Jul  5 15:45:13 2013
New Revision: 185723

URL: http://llvm.org/viewvc/llvm-project?rev=185723&view=rev
Log:
[TRE] Merged several tests into the the test basic.ll.

Added:
    llvm/trunk/test/Transforms/TailCallElim/basic.ll
Removed:
    llvm/trunk/test/Transforms/TailCallElim/intervening-inst.ll
    llvm/trunk/test/Transforms/TailCallElim/move_alloca_for_tail_call.ll
    llvm/trunk/test/Transforms/TailCallElim/return_constant.ll
    llvm/trunk/test/Transforms/TailCallElim/trivial_codegen_tailcall.ll

Added: llvm/trunk/test/Transforms/TailCallElim/basic.ll
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/test/Transforms/TailCallElim/basic.ll?rev=185723&view=auto
==============================================================================
--- llvm/trunk/test/Transforms/TailCallElim/basic.ll (added)
+++ llvm/trunk/test/Transforms/TailCallElim/basic.ll Fri Jul  5 15:45:13 2013
@@ -0,0 +1,58 @@
+; RUN: opt < %s -tailcallelim -S | FileCheck %s
+
+declare void @noarg()
+declare void @use(i32*)
+
+; Trivial case. Mark @noarg with tail call.
+define void @test0() {
+; CHECK: tail call void @noarg()
+	call void @noarg()
+	ret void
+}
+
+; PR615. Make sure that we do not move the alloca so that it interferes with the tail call.
+define i32 @test1() {
+; CHECK: i32 @test1()
+; CHECK-NEXT: alloca
+	%A = alloca i32		; <i32*> [#uses=2]
+	store i32 5, i32* %A
+	call void @use(i32* %A)
+	%X = tail call i32 @test1()		; <i32> [#uses=1]
+	ret i32 %X
+}
+
+; This function contains intervening instructions which should be moved out of the way
+define i32 @test2(i32 %X) {
+; CHECK: i32 @test2
+; CHECK-NOT: call
+; CHECK: ret i32
+entry:
+	%tmp.1 = icmp eq i32 %X, 0		; <i1> [#uses=1]
+	br i1 %tmp.1, label %then.0, label %endif.0
+then.0:		; preds = %entry
+	%tmp.4 = add i32 %X, 1		; <i32> [#uses=1]
+	ret i32 %tmp.4
+endif.0:		; preds = %entry
+	%tmp.10 = add i32 %X, -1		; <i32> [#uses=1]
+	%tmp.8 = call i32 @test2(i32 %tmp.10)		; <i32> [#uses=1]
+	%DUMMY = add i32 %X, 1		; <i32> [#uses=0]
+	ret i32 %tmp.8
+}
+
+; Though this case seems to be fairly unlikely to occur in the wild, someone
+; plunked it into the demo script, so maybe they care about it.
+define i32 @test3(i32 %c) {
+; CHECK: i32 @test3
+; CHECK-NOT: call
+; CHECK: ret i32 0
+entry:
+	%tmp.1 = icmp eq i32 %c, 0		; <i1> [#uses=1]
+	br i1 %tmp.1, label %return, label %else
+else:		; preds = %entry
+	%tmp.5 = add i32 %c, -1		; <i32> [#uses=1]
+	%tmp.3 = call i32 @test3(i32 %tmp.5)		; <i32> [#uses=0]
+	ret i32 0
+return:		; preds = %entry
+	ret i32 0
+}
+

Removed: llvm/trunk/test/Transforms/TailCallElim/intervening-inst.ll
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/test/Transforms/TailCallElim/intervening-inst.ll?rev=185722&view=auto
==============================================================================
--- llvm/trunk/test/Transforms/TailCallElim/intervening-inst.ll (original)
+++ llvm/trunk/test/Transforms/TailCallElim/intervening-inst.ll (removed)
@@ -1,18 +0,0 @@
-; This function contains intervening instructions which should be moved out of the way
-; RUN: opt < %s -tailcallelim -S | FileCheck %s
-
-define i32 @Test(i32 %X) {
-entry:
-	%tmp.1 = icmp eq i32 %X, 0		; <i1> [#uses=1]
-	br i1 %tmp.1, label %then.0, label %endif.0
-then.0:		; preds = %entry
-	%tmp.4 = add i32 %X, 1		; <i32> [#uses=1]
-	ret i32 %tmp.4
-endif.0:		; preds = %entry
-	%tmp.10 = add i32 %X, -1		; <i32> [#uses=1]
-; CHECK-NOT: call
-	%tmp.8 = call i32 @Test( i32 %tmp.10 )		; <i32> [#uses=1]
-	%DUMMY = add i32 %X, 1		; <i32> [#uses=0]
-	ret i32 %tmp.8
-}
-

Removed: llvm/trunk/test/Transforms/TailCallElim/move_alloca_for_tail_call.ll
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/test/Transforms/TailCallElim/move_alloca_for_tail_call.ll?rev=185722&view=auto
==============================================================================
--- llvm/trunk/test/Transforms/TailCallElim/move_alloca_for_tail_call.ll (original)
+++ llvm/trunk/test/Transforms/TailCallElim/move_alloca_for_tail_call.ll (removed)
@@ -1,15 +0,0 @@
-; RUN: opt -tailcallelim -S < %s | FileCheck %s
-; PR615
-
-declare void @bar(i32*)
-
-define i32 @foo() {
-; CHECK: i32 @foo()
-; CHECK-NEXT: alloca
-	%A = alloca i32		; <i32*> [#uses=2]
-	store i32 17, i32* %A
-	call void @bar( i32* %A )
-	%X = tail call i32 @foo( )		; <i32> [#uses=1]
-	ret i32 %X
-}
-

Removed: llvm/trunk/test/Transforms/TailCallElim/return_constant.ll
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/test/Transforms/TailCallElim/return_constant.ll?rev=185722&view=auto
==============================================================================
--- llvm/trunk/test/Transforms/TailCallElim/return_constant.ll (original)
+++ llvm/trunk/test/Transforms/TailCallElim/return_constant.ll (removed)
@@ -1,18 +0,0 @@
-; Though this case seems to be fairly unlikely to occur in the wild, someone
-; plunked it into the demo script, so maybe they care about it.
-;
-; RUN: opt < %s -tailcallelim -S | FileCheck %s
-
-define i32 @aaa(i32 %c) {
-entry:
-	%tmp.1 = icmp eq i32 %c, 0		; <i1> [#uses=1]
-	br i1 %tmp.1, label %return, label %else
-else:		; preds = %entry
-	%tmp.5 = add i32 %c, -1		; <i32> [#uses=1]
-; CHECK-NOT: call
-	%tmp.3 = call i32 @aaa( i32 %tmp.5 )		; <i32> [#uses=0]
-	ret i32 0
-return:		; preds = %entry
-	ret i32 0
-}
-

Removed: llvm/trunk/test/Transforms/TailCallElim/trivial_codegen_tailcall.ll
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/test/Transforms/TailCallElim/trivial_codegen_tailcall.ll?rev=185722&view=auto
==============================================================================
--- llvm/trunk/test/Transforms/TailCallElim/trivial_codegen_tailcall.ll (original)
+++ llvm/trunk/test/Transforms/TailCallElim/trivial_codegen_tailcall.ll (removed)
@@ -1,11 +0,0 @@
-; RUN: opt < %s -tailcallelim -S | FileCheck %s
-
-
-declare void @foo()
-
-define void @bar() {
-; CHECK: tail call void @foo()
-	call void @foo()
-	ret void
-}
-





More information about the llvm-commits mailing list