41 lines · plain
1; RUN: opt -passes=loop-vectorize %s -force-vector-width=1 -force-vector-interleave=2 -S -o - | FileCheck %s2 3define void @foo(ptr addrspace(1) %in) {4entry:5 br label %loop6 7loop:8 %iter = phi i64 [ %next, %loop ], [ 0, %entry ]9 %ascast = addrspacecast ptr addrspace(1) %in to ptr10 %next = add i64 %iter, 111 %arrayidx = getelementptr inbounds i64, ptr %ascast, i64 %next12 store i64 %next, ptr %arrayidx, align 413 14; check that we find the two interleaved blocks with ascast, gep and store:15; CHECK: pred.store.if:16; CHECK: [[ID1:%.*]] = add i64 %{{.*}}, 117; CHECK: [[AS1:%.*]] = addrspacecast ptr addrspace(1) %{{.*}} to ptr18; CHECK: [[GEP1:%.*]] = getelementptr inbounds i64, ptr [[AS1]], i64 [[ID1]]19; CHECK: store i64 [[ID1]], ptr [[GEP1]]20 21; CHECK: pred.store.if1:22; CHECK: [[ID2:%.*]] = add i64 %{{.*}}, 123; CHECK: [[AS2:%.*]] = addrspacecast ptr addrspace(1) %in to ptr24; CHECK: [[GEP2:%.*]] = getelementptr inbounds i64, ptr [[AS2]], i64 [[ID2]]25; CHECK: store i64 [[ID2]], ptr %9, align 426 27 %cmp = icmp eq i64 %next, 728 br i1 %cmp, label %exit, label %loop29 30; check that we branch to the exit block31; CHECK: middle.block:32; CHECK: br label %exit33 34exit:35 ret void36; CHECK: exit:37; CHECK: ret void38}39 40; CHECK: !{{[0-9]*}} = !{!"llvm.loop.isvectorized", i32 1}41