regression case for faster call sequence

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

diff --git a/test/CodeGen/Alpha/bsr.ll b/test/CodeGen/Alpha/bsr.ll
new file mode 100644 (file)
index 0000000..76488bb
--- /dev/null
+++ b/test/CodeGen/Alpha/bsr.ll
@@ -0,0 +1,15 @@
+; Make sure this testcase codegens the bsr instruction
+; RUN: llvm-as < %s | llc -march=alpha | grep 'bsr'
+
+
+implementation   ; Functions:
+
+long %abc(int %x) {
+entry:
+       %tmp.2 = add int %x, -1         ; <int> [#uses=1]
+       %tmp.0 = call long %abc( int %tmp.2 )           ; <long> [#uses=1]
+       %tmp.5 = add int %x, -2         ; <int> [#uses=1]
+       %tmp.3 = call long %abc( int %tmp.5 )           ; <long> [#uses=1]
+       %tmp.6 = add long %tmp.0, %tmp.3                ; <long> [#uses=1]
+       ret long %tmp.6
+}