83 lines
4.7 KiB
LLVM
83 lines
4.7 KiB
LLVM
|
; RUN: opt -loop-vectorize -force-vector-width=4 -enable-vplan-native-path -S %s | FileCheck %s
|
||
|
|
||
|
; Vectorize explict marked outer loop using vplan native path. Inner loop
|
||
|
; contains simple double add reduction. IR is compiled and modified by hand
|
||
|
; from following C code:
|
||
|
; void inner_loop_reduction(const double* restrict in_a, const double* restrict in_b, double* restrict out)
|
||
|
; {
|
||
|
; #pragma clang loop vectorize(enable)
|
||
|
; for (int i = 0; i < 1000; ++i) {
|
||
|
; double a = in_a[i];
|
||
|
; double b = in_b[i];
|
||
|
; for (int j = 0; j < 10000; ++j) {
|
||
|
; a = a + b;
|
||
|
; }
|
||
|
; out[i] = a;
|
||
|
; }
|
||
|
; }
|
||
|
define void @inner_loop_reduction(double* noalias nocapture readonly %a.in, double* noalias nocapture readonly %b.in, double* noalias nocapture %c.out) {
|
||
|
; CHECK-LABEL: @inner_loop_reduction(
|
||
|
|
||
|
; CHECK: vector.body:
|
||
|
; CHECK-NEXT: %[[FOR1_INDEX:.*]] = phi i64 [ 0, %[[LABEL_PR:.*]] ], [ %{{.*}}, %[[LABEL_FOR1_LATCH:.*]] ]
|
||
|
; CHECK: %[[VEC_INDEX:.*]] = phi <4 x i64> [ <i64 0, i64 1, i64 2, i64 3>, %[[LABEL_PR]] ], [ %{{.*}}, %[[LABEL_FOR1_LATCH]] ]
|
||
|
; CHECK-NEXT: %[[A_PTR:.*]] = getelementptr inbounds double, double* %a.in, <4 x i64> %[[VEC_INDEX]]
|
||
|
; CHECK-NEXT: %[[MASKED_GATHER1:.*]] = call <4 x double> @llvm.masked.gather.v4f64.v4p0f64(<4 x double*> %[[A_PTR]], i32 8, <4 x i1> <i1 true, i1 true, i1 true, i1 true>, <4 x double> undef)
|
||
|
; CHECK-NEXT: %[[B_PTR:.*]] = getelementptr inbounds double, double* %b.in, <4 x i64> %[[VEC_INDEX]]
|
||
|
; CHECK-NEXT: %[[MASKED_GATHER2:.*]] = call <4 x double> @llvm.masked.gather.v4f64.v4p0f64(<4 x double*> %[[B_PTR]], i32 8, <4 x i1> <i1 true, i1 true, i1 true, i1 true>, <4 x double> undef)
|
||
|
; CHECK-NEXT: br label %[[FOR2_HEADER:.*]]
|
||
|
|
||
|
; CHECK: [[FOR2_HEADER]]:
|
||
|
; CHECK-NEXT: %[[FOR2_INDEX:.*]] = phi <4 x i32> [ %[[FOR2_INDEX_NEXT:.*]], %[[FOR2_HEADER]] ], [ zeroinitializer, %vector.body ]
|
||
|
; CHECK-NEXT: %[[REDUCTION:.*]] = phi <4 x double> [ %[[REDUCTION_NEXT:.*]], %[[FOR2_HEADER]] ], [ %[[MASKED_GATHER1]], %vector.body ]
|
||
|
; CHECK-NEXT: %[[REDUCTION_NEXT]] = fadd <4 x double> %[[MASKED_GATHER2]], %[[REDUCTION]]
|
||
|
; CHECK-NEXT: %[[FOR2_INDEX_NEXT]] = add nuw nsw <4 x i32> %[[FOR2_INDEX]], <i32 1, i32 1, i32 1, i32 1>
|
||
|
; CHECK-NEXT: %[[VEC_PTR:.*]] = icmp eq <4 x i32> %[[FOR2_INDEX_NEXT]], <i32 10000, i32 10000, i32 10000, i32 10000>
|
||
|
; CHECK-NEXT: %[[EXIT_COND:.*]] = extractelement <4 x i1> %[[VEC_PTR]], i32 0
|
||
|
; CHECK-NEXT: br i1 %[[EXIT_COND]], label %[[FOR1_LATCH:.*]], label %{{.*}}
|
||
|
|
||
|
; CHECK: [[FOR1_LATCH]]:
|
||
|
; CHECK-NEXT: %[[REDUCTION:.*]] = phi <4 x double> [ %[[REDUCTION_NEXT]], %[[FOR2_HEADER]] ]
|
||
|
; CHECK-NEXT: %[[C_PTR:.*]] = getelementptr inbounds double, double* %c.out, <4 x i64> %[[VEC_INDEX]]
|
||
|
; CHECK-NEXT: call void @llvm.masked.scatter.v4f64.v4p0f64(<4 x double> %[[REDUCTION]], <4 x double*> %[[C_PTR]], i32 8, <4 x i1> <i1 true, i1 true, i1 true, i1 true>)
|
||
|
; CHECK-NEXT: %[[VEC_INDEX_NEXT:.*]] = add nuw nsw <4 x i64> %[[VEC_INDEX]], <i64 1, i64 1, i64 1, i64 1>
|
||
|
; CHECK-NEXT: %[[VEC_PTR:.*]] = icmp eq <4 x i64> %[[VEC_INDEX_NEXT]], <i64 1000, i64 1000, i64 1000, i64 1000>
|
||
|
; CHECK-NEXT: %{{.*}} = extractelement <4 x i1> %[[VEC_PTR]], i32 0
|
||
|
; CHECK-NEXT: %[[FOR1_INDEX_NEXT:.*]] = add i64 %[[FOR1_INDEX]], 4
|
||
|
; CHECK-NEXT: %{{.*}} = add <4 x i64> %[[VEC_INDEX]], <i64 4, i64 4, i64 4, i64 4>
|
||
|
; CHECK-NEXT: %[[EXIT_COND:.*]] = icmp eq i64 %[[FOR1_INDEX_NEXT]], 1000
|
||
|
; CHECK-NEXT: br i1 %[[EXIT_COND]], label %{{.*}}, label %vector.body
|
||
|
|
||
|
entry:
|
||
|
br label %for1.header
|
||
|
|
||
|
for1.header: ; preds = %entry
|
||
|
%indvar1 = phi i64 [ 0, %entry ], [ %indvar11, %for1.latch ]
|
||
|
%a.ptr = getelementptr inbounds double, double* %a.in, i64 %indvar1
|
||
|
%a = load double, double* %a.ptr, align 8
|
||
|
%b.ptr = getelementptr inbounds double, double* %b.in, i64 %indvar1
|
||
|
%b = load double, double* %b.ptr, align 8
|
||
|
br label %for2.header
|
||
|
|
||
|
for2.header: ; preds = %for1.header, %for2.header
|
||
|
%indvar2 = phi i32 [ 0, %for1.header ], [ %indvar21, %for2.header ]
|
||
|
%a.reduction = phi double [ %a, %for1.header ], [ %a.reduction1, %for2.header ]
|
||
|
%a.reduction1 = fadd double %b, %a.reduction
|
||
|
%indvar21 = add nuw nsw i32 %indvar2, 1
|
||
|
%for2.cond = icmp eq i32 %indvar21, 10000
|
||
|
br i1 %for2.cond, label %for1.latch, label %for2.header
|
||
|
|
||
|
for1.latch: ; preds = %for2.header
|
||
|
%c.ptr = getelementptr inbounds double, double* %c.out, i64 %indvar1
|
||
|
store double %a.reduction1, double* %c.ptr, align 8
|
||
|
%indvar11 = add nuw nsw i64 %indvar1, 1
|
||
|
%for1.cond = icmp eq i64 %indvar11, 1000
|
||
|
br i1 %for1.cond, label %exit, label %for1.header, !llvm.loop !0
|
||
|
|
||
|
exit: ; preds = %for1.latch
|
||
|
ret void
|
||
|
}
|
||
|
|
||
|
!0 = distinct !{!0, !1}
|
||
|
!1 = !{!"llvm.loop.vectorize.enable", i1 true}
|