X86: Align the stack on word boundaries in LowerFormalArguments()

[oota-llvm.git] / test / CodeGen / X86 / lea-recursion.ll

diff --git a/test/CodeGen/X86/lea-recursion.ll b/test/CodeGen/X86/lea-recursion.ll
index ca7b3674d27c31e9ce018de5d3054ce0dac2c9ae..9480600312ce2b53a4cf71d4df8564c7b087f414 100644 (file)
--- a/test/CodeGen/X86/lea-recursion.ll
+++ b/test/CodeGen/X86/lea-recursion.ll
@@ -1,4 +1,4 @@
-; RUN: llvm-as < %s | llc -march=x86-64 | grep lea | wc -l | grep 12
+; RUN: llc < %s -march=x86-64 | grep lea | count 13
 
 ; This testcase was written to demonstrate an instruction-selection problem,
 ; however it also happens to expose a limitation in the DAGCombiner's
@@ -44,4 +44,3 @@ entry:
        store i32 %tmp10.6, i32* getelementptr ([1000 x i32]* @g0, i32 0, i32 7)
        ret void
 }
-