From 13eb1e7817be11ea84be6571dce827a77bc9640b Mon Sep 17 00:00:00 2001 From: Nadav Rotem Date: Wed, 26 Dec 2012 19:08:17 +0000 Subject: LoopVectorizer: Optimize the vectorization of consecutive memory access when the iteration step is -1 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@171114 91177308-0d34-0410-b5e6-96231b3b80d8 --- test/Transforms/LoopVectorize/gcc-examples.ll | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) (limited to 'test/Transforms/LoopVectorize') diff --git a/test/Transforms/LoopVectorize/gcc-examples.ll b/test/Transforms/LoopVectorize/gcc-examples.ll index 4fabc8e2d3..b0f5a80d1e 100644 --- a/test/Transforms/LoopVectorize/gcc-examples.ll +++ b/test/Transforms/LoopVectorize/gcc-examples.ll @@ -537,7 +537,8 @@ define void @example14(i32** nocapture %in, i32** nocapture %coeff, i32* nocaptu } ;CHECK: @example21 -;CHECK: <4 x i32> +;CHECK: load <4 x i32> +;CHECK: shufflevector {{.*}} ;CHECK: ret i32 define i32 @example21(i32* nocapture %b, i32 %n) nounwind uwtable readonly ssp { %1 = icmp sgt i32 %n, 0 -- cgit v1.2.3-70-g09d2