derek.holloway
7502bf64a4
CodeQL / Analyze (actions) (push) Canceled after 0s
CodeQL / Analyze (python) (push) Canceled after 0s
pre-commit / pre-commit (push) Canceled after 0s
Multi-Arch CI / setup (push) Canceled after 0s
Publish build_manylinux_x86_64 images / publish_build_manylinux_x86_64 (push) Canceled after 0s
Setup (Multi-Arch) / setup (push) Canceled after 0s
Multi-Arch CI / Linux::${{ fromJSON(needs.setup.outputs.linux_build_config || '{}').build_variant_label || 'skip' }} (push) Canceled after 0s
Publish TheRock Docker image / build-and-push-image (push) Canceled after 0s
Publish no_rocm_image_ubi10 image / publish_no_rocm_image_ubi10 (push) Canceled after 0s
Multi-Arch CI / Windows::${{ fromJSON(needs.setup.outputs.windows_build_config || '{}').build_variant_label || 'skip' }} (push) Canceled after 0s
Publish TheRock Docker image / build-and-push-image (push) Canceled after 0s
Multi-Arch CI / Manifest Diff (push) Canceled after 0s
TheRock Manifest Diff Report / Generate Manifest Diff Report (push) Canceled after 0s
Multi-Arch CI / CI Summary (push) Canceled after 0s
Publish no_rocm_image_ubuntu24_04 images / publish_no_rocm_image_ubuntu24_04 (push) Canceled after 0s
Publish no_rocm_image_ubuntu24_04_ocl_rt images / publish_no_rocm_image_ubuntu24_04_ocl_rt (push) Canceled after 0s
Publish TheRock Docker image / build-and-push-image (push) Canceled after 0s
Publish TheRock Docker image / build-and-push-image (push) Canceled after 0s
Publish no_rocm_image_ubuntu24_04 images / publish_no_rocm_image_ubuntu24_04_rocgdb (push) Canceled after 0s
Publish no_rocm_image_ubuntu24_04_rocgdb images / publish_no_rocm_image_ubuntu24_04_rocgdb (push) Canceled after 0s
Publish no_rocm_image_ubuntu24_04 images / publish_no_rocm_image_ubuntu24_04_ocl_rt (push) Canceled after 0s
Publish TheRock Docker image / build-and-push-image (push) Canceled after 0s
Unit Tests / Unit Tests :: ubuntu-24.04 (push) Canceled after 0s
Unit Tests / Unit Tests :: windows-2022 (push) Canceled after 0s
Publish no_rocm_image_ubuntu24_04 images / publish_no_rocm_image_ubuntu24_04_media (push) Canceled after 0s
Unit Tests / Unit Tests Summary (push) Canceled after 0s
Publish no_rocm_image_ubuntu24_04 images / publish_no_rocm_image_ubuntu24_04_openmpi (push) Canceled after 0s
331 lines
12 KiB
LLVM
331 lines
12 KiB
LLVM
; Several inner-loop reduction patterns are not yet supported.
|
|
; RUN: opt < %s -passes="loop-interchange" -loop-interchange-reduction-to-mem -pass-remarks-missed='loop-interchange' \
|
|
; RUN: -pass-remarks-output=%t -S | FileCheck -check-prefix=IR %s
|
|
; RUN: FileCheck --input-file=%t %s
|
|
|
|
|
|
; 1. The initial value of the reduction is not a constant.
|
|
; for (int i = 0; i < 100; i++) {
|
|
; r = s[i];
|
|
; for (int j = 0; j < 100; j++)
|
|
; r = r + a[j][i] * b[j][i];
|
|
; s[i] = r;
|
|
; }
|
|
|
|
; CHECK: --- !Missed
|
|
; CHECK-NEXT: Pass: loop-interchange
|
|
; CHECK-NEXT: Name: UnsupportedInnerReduction
|
|
; CHECK-NEXT: Function: reduction_01
|
|
; CHECK-NEXT: Args:
|
|
; CHECK-NEXT: - String: Only supported for the reduction with a constant initial value.
|
|
|
|
; CHECK: --- !Missed
|
|
; CHECK-NEXT: Pass: loop-interchange
|
|
; CHECK-NEXT: Name: UnsupportedPHIInner
|
|
; CHECK-NEXT: Function: reduction_01
|
|
; CHECK-NEXT: Args:
|
|
; CHECK-NEXT: - String: Only inner loops with induction or reduction PHI nodes can be interchange currently.
|
|
|
|
; IR-LABEL: @reduction_01(
|
|
; IR-NOT: split
|
|
define void @reduction_01(ptr noalias readonly %a, ptr noalias readonly %b, ptr noalias writeonly %s) {
|
|
entry:
|
|
br label %outerloop_header
|
|
|
|
outerloop_header:
|
|
%index_i = phi i64 [ 0, %entry ], [ %index_i.next, %outerloop_latch ]
|
|
%addr_s = getelementptr inbounds nuw double, ptr %s, i64 %index_i
|
|
%invariant.gep.us = getelementptr inbounds nuw double, ptr %a, i64 %index_i
|
|
%invariant.gep32.us = getelementptr inbounds nuw double, ptr %b, i64 %index_i
|
|
%s_init = load double, ptr %addr_s, align 8
|
|
br label %innerloop
|
|
|
|
innerloop:
|
|
%index_j = phi i64 [ 0, %outerloop_header ], [ %index_j.next, %innerloop ]
|
|
%reduction = phi double [ %s_init, %outerloop_header ], [ %add, %innerloop ]
|
|
%addr_a_j_i = getelementptr inbounds nuw [100 x double], ptr %invariant.gep.us, i64 %index_j
|
|
%0 = load double, ptr %addr_a_j_i, align 8
|
|
%addr_b_j_i = getelementptr inbounds nuw [100 x double], ptr %invariant.gep32.us, i64 %index_j
|
|
%1 = load double, ptr %addr_b_j_i, align 8
|
|
%mul = fmul fast double %1, %0
|
|
%add = fadd fast double %mul, %reduction
|
|
%index_j.next = add nuw nsw i64 %index_j, 1
|
|
%cond1 = icmp eq i64 %index_j.next, 100
|
|
br i1 %cond1, label %outerloop_latch, label %innerloop
|
|
|
|
outerloop_latch:
|
|
%lcssa = phi double [ %add, %innerloop ]
|
|
store double %lcssa, ptr %addr_s, align 8
|
|
%index_i.next = add nuw nsw i64 %index_i, 1
|
|
%cond2 = icmp eq i64 %index_i.next, 100
|
|
br i1 %cond2, label %exit, label %outerloop_header
|
|
|
|
exit:
|
|
ret void
|
|
}
|
|
|
|
; 2. There are two or more reductions
|
|
; for (int i = 0; i < 100; i++) {
|
|
; r1 = 0;
|
|
; r2 = 0;
|
|
; for (int j = 0; j < 100; j++){
|
|
; r1 = r1 + a[j][i] * b[j][i];
|
|
; r2 = r2 + a[j][i];
|
|
; }
|
|
; s[i] = r1;
|
|
; s2[i] = r2;
|
|
; }
|
|
|
|
; CHECK: --- !Missed
|
|
; CHECK-NEXT: Pass: loop-interchange
|
|
; CHECK-NEXT: Name: UnsupportedInnerReduction
|
|
; CHECK-NEXT: Function: reduction_02
|
|
; CHECK-NEXT: Args:
|
|
; CHECK-NEXT: - String: Only supports at most one reduction.
|
|
; CHECK: --- !Missed
|
|
; CHECK-NEXT: Pass: loop-interchange
|
|
; CHECK-NEXT: Name: UnsupportedPHIInner
|
|
; CHECK-NEXT: Function: reduction_02
|
|
; CHECK-NEXT: Args:
|
|
; CHECK-NEXT: - String: Only inner loops with induction or reduction PHI nodes can be interchange currently.
|
|
|
|
; IR-LABEL: @reduction_02(
|
|
; IR-NOT: split
|
|
define void @reduction_02(ptr noalias readonly %a, ptr noalias readonly %b, ptr noalias writeonly %s, ptr noalias writeonly %s2) {
|
|
entry:
|
|
br label %outerloop_header
|
|
|
|
outerloop_header:
|
|
%index_i = phi i64 [ 0, %entry ], [ %index_i.next, %outerloop_latch ]
|
|
%addr_s = getelementptr inbounds nuw double, ptr %s, i64 %index_i
|
|
%addr_s2 = getelementptr inbounds nuw double, ptr %s2, i64 %index_i
|
|
%invariant.gep.us = getelementptr inbounds nuw double, ptr %a, i64 %index_i
|
|
%invariant.gep32.us = getelementptr inbounds nuw double, ptr %b, i64 %index_i
|
|
br label %innerloop
|
|
|
|
innerloop:
|
|
%index_j = phi i64 [ 0, %outerloop_header ], [ %index_j.next, %innerloop ]
|
|
%reduction = phi double [ 0.000000e+00, %outerloop_header ], [ %add, %innerloop ]
|
|
%reduction2 = phi double [ 0.000000e+00, %outerloop_header ], [ %add2, %innerloop ]
|
|
%addr_a_j_i = getelementptr inbounds nuw [100 x double], ptr %invariant.gep.us, i64 %index_j
|
|
%0 = load double, ptr %addr_a_j_i, align 8
|
|
%addr_b_j_i = getelementptr inbounds nuw [100 x double], ptr %invariant.gep32.us, i64 %index_j
|
|
%1 = load double, ptr %addr_b_j_i, align 8
|
|
%mul = fmul fast double %1, %0
|
|
%add = fadd fast double %mul, %reduction
|
|
%add2 = fadd fast double %reduction2, %0
|
|
%index_j.next = add nuw nsw i64 %index_j, 1
|
|
%cond1 = icmp eq i64 %index_j.next, 100
|
|
br i1 %cond1, label %outerloop_latch, label %innerloop
|
|
|
|
outerloop_latch:
|
|
%lcssa = phi double [ %add, %innerloop ]
|
|
%lcssa2 = phi double [%add2, %innerloop]
|
|
store double %lcssa, ptr %addr_s, align 8
|
|
store double %lcssa2, ptr %addr_s2, align 8
|
|
%index_i.next = add nuw nsw i64 %index_i, 1
|
|
%cond2 = icmp eq i64 %index_i.next, 100
|
|
br i1 %cond2, label %exit, label %outerloop_header
|
|
|
|
exit:
|
|
ret void
|
|
}
|
|
|
|
; 3. The reduction is used more than once in the outer loop.
|
|
; for (int i = 0; i < 100; i++) {
|
|
; r = 0;
|
|
; for (int j = 0; j < 100; j++)
|
|
; r = r + a[j][i] * b[j][i];
|
|
; r += 1;
|
|
; s[i] = r;
|
|
; }
|
|
|
|
; CHECK: --- !Missed
|
|
; CHECK-NEXT: Pass: loop-interchange
|
|
; CHECK-NEXT: Name: UnsupportedInnerReduction
|
|
; CHECK-NEXT: Function: reduction_03
|
|
; CHECK-NEXT: Args:
|
|
; CHECK-NEXT: - String: Only supported when the reduction is used once in the outer loop.
|
|
; CHECK: --- !Missed
|
|
; CHECK-NEXT: Pass: loop-interchange
|
|
; CHECK-NEXT: Name: UnsupportedPHIInner
|
|
; CHECK-NEXT: Function: reduction_03
|
|
; CHECK-NEXT: Args:
|
|
; CHECK-NEXT: - String: Only inner loops with induction or reduction PHI nodes can be interchange currently.
|
|
|
|
; IR-LABEL: @reduction_03(
|
|
; IR-NOT: split
|
|
define void @reduction_03(ptr noalias readonly %a, ptr noalias readonly %b, ptr noalias writeonly %s) {
|
|
entry:
|
|
br label %outerloop_header
|
|
|
|
outerloop_header:
|
|
%index_i = phi i64 [ 0, %entry ], [ %index_i.next, %outerloop_latch ]
|
|
%addr_s = getelementptr inbounds nuw double, ptr %s, i64 %index_i
|
|
%invariant.gep.us = getelementptr inbounds nuw double, ptr %a, i64 %index_i
|
|
%invariant.gep32.us = getelementptr inbounds nuw double, ptr %b, i64 %index_i
|
|
br label %innerloop
|
|
|
|
innerloop:
|
|
%index_j = phi i64 [ 0, %outerloop_header ], [ %index_j.next, %innerloop ]
|
|
%reduction = phi double [ 0.000000e+00, %outerloop_header ], [ %add, %innerloop ]
|
|
%addr_a_j_i = getelementptr inbounds nuw [100 x double], ptr %invariant.gep.us, i64 %index_j
|
|
%0 = load double, ptr %addr_a_j_i, align 8
|
|
%addr_b_j_i = getelementptr inbounds nuw [100 x double], ptr %invariant.gep32.us, i64 %index_j
|
|
%1 = load double, ptr %addr_b_j_i, align 8
|
|
%mul = fmul fast double %1, %0
|
|
%add = fadd fast double %mul, %reduction
|
|
%index_j.next = add nuw nsw i64 %index_j, 1
|
|
%cond1 = icmp eq i64 %index_j.next, 100
|
|
br i1 %cond1, label %outerloop_latch, label %innerloop
|
|
|
|
outerloop_latch:
|
|
%lcssa = phi double [ %add, %innerloop ]
|
|
store double %lcssa, ptr %addr_s, align 8
|
|
%add17.us = fadd fast double %lcssa, 1.000000e+00
|
|
store double %add17.us, ptr %addr_s, align 8
|
|
%index_i.next = add nuw nsw i64 %index_i, 1
|
|
%cond2 = icmp eq i64 %index_i.next, 100
|
|
br i1 %cond2, label %exit, label %outerloop_header
|
|
|
|
exit:
|
|
ret void
|
|
}
|
|
|
|
|
|
; 4. The reduction is not in the innermost loop.
|
|
; for (int i = 0; i < 100; i++) {
|
|
; r = 0;
|
|
; for (int j = 0; j < 100; j++) {
|
|
; r = r + a[j][i] * b[j][i]; // reduction
|
|
; for (int k = 0; k < 100; k++)
|
|
; c[k] = 1;
|
|
; }
|
|
; s[i] = r;
|
|
; }
|
|
|
|
; CHECK: --- !Missed
|
|
; CHECK-NEXT: Pass: loop-interchange
|
|
; CHECK-NEXT: Name: UnsupportedPHIOuter
|
|
; CHECK-NEXT: Function: reduction_04
|
|
; CHECK-NEXT: Args:
|
|
; CHECK-NEXT: - String: Only outer loops with induction or reduction PHI nodes can be interchanged currently.
|
|
; CHECK: --- !Missed
|
|
; CHECK-NEXT: Pass: loop-interchange
|
|
; CHECK-NEXT: Name: UnsupportedInnerReduction
|
|
; CHECK-NEXT: Function: reduction_04
|
|
; CHECK-NEXT: Args:
|
|
; CHECK-NEXT: - String: Only supported when the loop is the innermost.
|
|
; CHECK: --- !Missed
|
|
; CHECK-NEXT: Pass: loop-interchange
|
|
; CHECK-NEXT: Name: UnsupportedPHIInner
|
|
; CHECK-NEXT: Function: reduction_04
|
|
; CHECK-NEXT: Args:
|
|
; CHECK-NEXT: - String: Only inner loops with induction or reduction PHI nodes can be interchange currently.
|
|
|
|
; IR-LABEL: @reduction_04(
|
|
; IR-NOT: split
|
|
define void @reduction_04(ptr noalias readonly %a, ptr noalias readonly %b, ptr noalias writeonly %c, ptr noalias writeonly %s) {
|
|
entry:
|
|
br label %i_loop_header
|
|
|
|
i_loop_header:
|
|
%index_i = phi i64 [ 0, %entry ], [ %index_i.next, %i_loop_latch ]
|
|
%addr_s = getelementptr inbounds nuw double, ptr %s, i64 %index_i
|
|
%invariant.gep.us = getelementptr inbounds nuw double, ptr %a, i64 %index_i
|
|
%invariant.gep32.us = getelementptr inbounds nuw double, ptr %b, i64 %index_i
|
|
br label %j_loop
|
|
|
|
j_loop:
|
|
%index_j = phi i64 [ 0, %i_loop_header ], [ %index_j.next, %j_loop_latch ]
|
|
%reduction = phi double [ 0.000000e+00, %i_loop_header ], [ %add, %j_loop_latch ]
|
|
%addr_a_j_i = getelementptr inbounds nuw [100 x double], ptr %invariant.gep.us, i64 %index_j
|
|
%0 = load double, ptr %addr_a_j_i, align 8
|
|
%addr_b_j_i = getelementptr inbounds nuw [100 x double], ptr %invariant.gep32.us, i64 %index_j
|
|
%1 = load double, ptr %addr_b_j_i, align 8
|
|
%mul = fmul fast double %1, %0
|
|
%add = fadd fast double %mul, %reduction
|
|
br label %k_loop
|
|
|
|
k_loop:
|
|
%index_k = phi i64 [ %index_k.next, %k_loop ], [ 0, %j_loop ]
|
|
%arrayidx22.us.us = getelementptr inbounds nuw double, ptr %c, i64 %index_k
|
|
%index_k.next = add nuw nsw i64 %index_k, 1
|
|
%exitcond.not = icmp eq i64 %index_k.next, 100
|
|
br i1 %exitcond.not, label %j_loop_latch, label %k_loop
|
|
|
|
j_loop_latch:
|
|
%index_j.next = add nuw nsw i64 %index_j, 1
|
|
%cond1 = icmp eq i64 %index_j.next, 100
|
|
br i1 %cond1, label %i_loop_latch, label %j_loop
|
|
|
|
i_loop_latch:
|
|
%lcssa = phi double [ %add, %j_loop_latch ]
|
|
store double %lcssa, ptr %addr_s, align 8
|
|
%index_i.next = add nuw nsw i64 %index_i, 1
|
|
%cond2 = icmp eq i64 %index_i.next, 100
|
|
br i1 %cond2, label %exit, label %i_loop_header
|
|
|
|
exit:
|
|
ret void
|
|
}
|
|
|
|
|
|
; 5. MemRef doesn't dominate InnerLoop's HeaderBB.
|
|
; for (int i = 0; i < 100; i++) {
|
|
; r = 0;
|
|
; for (int j = 0; j < 100; j++)
|
|
; r = r + a[j][i] * b[j][i];
|
|
; s[i] = r;
|
|
; }
|
|
|
|
; CHECK: --- !Missed
|
|
; CHECK-NEXT: Pass: loop-interchange
|
|
; CHECK-NEXT: Name: UnsupportedInnerReduction
|
|
; CHECK-NEXT: Function: reduction_05
|
|
; CHECK-NEXT: Args:
|
|
; CHECK-NEXT: - String: Only supported when memory reference dominate the inner loop.
|
|
; CHECK: --- !Missed
|
|
; CHECK-NEXT: Pass: loop-interchange
|
|
; CHECK-NEXT: Name: UnsupportedPHIInner
|
|
; CHECK-NEXT: Function: reduction_05
|
|
; CHECK-NEXT: Args:
|
|
; CHECK-NEXT: - String: Only inner loops with induction or reduction PHI nodes can be interchange currently.
|
|
|
|
; IR-LABEL: @reduction_05(
|
|
; IR-NOT: split
|
|
define void @reduction_05(ptr noalias readonly %a, ptr noalias readonly %b, ptr noalias writeonly %s) {
|
|
entry:
|
|
br label %outerloop_header
|
|
|
|
outerloop_header:
|
|
%index_i = phi i64 [ 0, %entry ], [ %index_i.next, %outerloop_latch ]
|
|
%invariant.gep.us = getelementptr inbounds nuw double, ptr %a, i64 %index_i
|
|
%invariant.gep32.us = getelementptr inbounds nuw double, ptr %b, i64 %index_i
|
|
br label %innerloop
|
|
|
|
innerloop:
|
|
%index_j = phi i64 [ 0, %outerloop_header ], [ %index_j.next, %innerloop ]
|
|
%reduction = phi double [ 0.000000e+00, %outerloop_header ], [ %add, %innerloop ]
|
|
%addr_a_j_i = getelementptr inbounds nuw [100 x double], ptr %invariant.gep.us, i64 %index_j
|
|
%0 = load double, ptr %addr_a_j_i, align 8
|
|
%addr_b_j_i = getelementptr inbounds nuw [100 x double], ptr %invariant.gep32.us, i64 %index_j
|
|
%1 = load double, ptr %addr_b_j_i, align 8
|
|
%mul = fmul fast double %1, %0
|
|
%add = fadd fast double %mul, %reduction
|
|
%index_j.next = add nuw nsw i64 %index_j, 1
|
|
%cond1 = icmp eq i64 %index_j.next, 100
|
|
br i1 %cond1, label %outerloop_latch, label %innerloop
|
|
|
|
outerloop_latch:
|
|
%lcssa = phi double [ %add, %innerloop ]
|
|
%addr_s = getelementptr inbounds nuw double, ptr %s, i64 %index_i
|
|
store double %lcssa, ptr %addr_s, align 8
|
|
%index_i.next = add nuw nsw i64 %index_i, 1
|
|
%cond2 = icmp eq i64 %index_i.next, 100
|
|
br i1 %cond2, label %exit, label %outerloop_header
|
|
|
|
exit:
|
|
ret void
|
|
}
|