Add a new VPlan subdirectory as common place for tests checking VPlan printing. It contains a lit.local.cfg that only runs the tests when assertions are enabled. This removes the need to add explicit REQUIRES: asserts to VPlan tests. PR: https://github.com/llvm/llvm-project/pull/180611
202 lines
9.1 KiB
LLVM
202 lines
9.1 KiB
LLVM
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 6
|
|
; RUN: opt -passes=loop-vectorize -debug-only=loop-vectorize \
|
|
; RUN: -force-vector-width=4 -disable-output 2>&1 < %s | FileCheck %s
|
|
|
|
; This function is derived from the following C program:
|
|
; int simple_csa_int_select(int N, int *data, int a) {
|
|
; int t = -1;
|
|
; for (int i = 0; i < N; i++) {
|
|
; if (a < data[i])
|
|
; t = data[i];
|
|
; }
|
|
; return t;
|
|
; }
|
|
define i32 @simple_csa_int_select(i64 %N, ptr %data, i32 %a) {
|
|
; CHECK-LABEL: 'simple_csa_int_select'
|
|
; CHECK: VPlan 'Initial VPlan for VF={4},UF>=1' {
|
|
; CHECK-NEXT: Live-in vp<[[VP0:%[0-9]+]]> = VF
|
|
; CHECK-NEXT: Live-in vp<[[VP1:%[0-9]+]]> = VF * UF
|
|
; CHECK-NEXT: Live-in vp<[[VP2:%[0-9]+]]> = vector-trip-count
|
|
; CHECK-NEXT: Live-in ir<%N> = original trip-count
|
|
; CHECK-EMPTY:
|
|
; CHECK-NEXT: ir-bb<entry>:
|
|
; CHECK-NEXT: Successor(s): scalar.ph, vector.ph
|
|
; CHECK-EMPTY:
|
|
; CHECK-NEXT: vector.ph:
|
|
; CHECK-NEXT: Successor(s): vector loop
|
|
; CHECK-EMPTY:
|
|
; CHECK-NEXT: <x1> vector loop: {
|
|
; CHECK-NEXT: vector.body:
|
|
; CHECK-NEXT: EMIT vp<[[VP3:%[0-9]+]]> = CANONICAL-INDUCTION ir<0>, vp<%index.next>
|
|
; CHECK-NEXT: WIDEN-REDUCTION-PHI ir<%data.phi> = phi ir<-1>, vp<[[VP9:%[0-9]+]]>
|
|
; CHECK-NEXT: WIDEN-PHI vp<[[VP4:%[0-9]+]]> = phi [ ir<false>, vector.ph ], [ vp<[[VP8:%[0-9]+]]>, vector.body ]
|
|
; CHECK-NEXT: vp<[[VP5:%[0-9]+]]> = SCALAR-STEPS vp<[[VP3]]>, ir<1>, vp<[[VP0]]>
|
|
; CHECK-NEXT: CLONE ir<%ld.addr> = getelementptr inbounds ir<%data>, vp<[[VP5]]>
|
|
; CHECK-NEXT: vp<[[VP6:%[0-9]+]]> = vector-pointer inbounds ir<%ld.addr>
|
|
; CHECK-NEXT: WIDEN ir<%ld> = load vp<[[VP6]]>
|
|
; CHECK-NEXT: WIDEN ir<%select.cmp> = icmp slt ir<%a>, ir<%ld>
|
|
; CHECK-NEXT: EMIT vp<[[VP7:%[0-9]+]]> = any-of ir<%select.cmp>
|
|
; CHECK-NEXT: EMIT vp<[[VP8]]> = select vp<[[VP7]]>, ir<%select.cmp>, vp<[[VP4]]>
|
|
; CHECK-NEXT: EMIT vp<[[VP9]]> = select vp<[[VP7]]>, ir<%ld>, ir<%data.phi>
|
|
; CHECK-NEXT: EMIT vp<%index.next> = add nuw vp<[[VP3]]>, vp<[[VP1]]>
|
|
; CHECK-NEXT: EMIT branch-on-count vp<%index.next>, vp<[[VP2]]>
|
|
; CHECK-NEXT: No successors
|
|
; CHECK-NEXT: }
|
|
; CHECK-NEXT: Successor(s): middle.block
|
|
; CHECK-EMPTY:
|
|
; CHECK-NEXT: middle.block:
|
|
; CHECK-NEXT: EMIT vp<[[VP11:%[0-9]+]]> = extract-last-active vp<[[VP9]]>, vp<[[VP8]]>, ir<-1>
|
|
; CHECK-NEXT: EMIT vp<%cmp.n> = icmp eq ir<%N>, vp<[[VP2]]>
|
|
; CHECK-NEXT: EMIT branch-on-cond vp<%cmp.n>
|
|
; CHECK-NEXT: Successor(s): ir-bb<exit>, scalar.ph
|
|
; CHECK-EMPTY:
|
|
; CHECK-NEXT: ir-bb<exit>:
|
|
; CHECK-NEXT: IR %select.data.lcssa = phi i32 [ %select.data, %loop ] (extra operand: vp<[[VP11]]> from middle.block)
|
|
; CHECK-NEXT: No successors
|
|
; CHECK-EMPTY:
|
|
; CHECK-NEXT: scalar.ph:
|
|
; CHECK-NEXT: EMIT-SCALAR vp<%bc.resume.val> = phi [ vp<[[VP2]]>, middle.block ], [ ir<0>, ir-bb<entry> ]
|
|
; CHECK-NEXT: EMIT-SCALAR vp<%bc.merge.rdx> = phi [ vp<[[VP11]]>, middle.block ], [ ir<-1>, ir-bb<entry> ]
|
|
; CHECK-NEXT: Successor(s): ir-bb<loop>
|
|
; CHECK-EMPTY:
|
|
; CHECK-NEXT: ir-bb<loop>:
|
|
; CHECK-NEXT: IR %iv = phi i64 [ 0, %entry ], [ %iv.next, %loop ] (extra operand: vp<%bc.resume.val> from scalar.ph)
|
|
; CHECK-NEXT: IR %data.phi = phi i32 [ -1, %entry ], [ %select.data, %loop ] (extra operand: vp<%bc.merge.rdx> from scalar.ph)
|
|
; CHECK-NEXT: IR %ld.addr = getelementptr inbounds i32, ptr %data, i64 %iv
|
|
; CHECK-NEXT: IR %ld = load i32, ptr %ld.addr, align 4
|
|
; CHECK-NEXT: IR %select.cmp = icmp slt i32 %a, %ld
|
|
; CHECK-NEXT: IR %select.data = select i1 %select.cmp, i32 %ld, i32 %data.phi
|
|
; CHECK-NEXT: IR %iv.next = add nuw nsw i64 %iv, 1
|
|
; CHECK-NEXT: IR %exit.cmp = icmp eq i64 %iv.next, %N
|
|
; CHECK-NEXT: No successors
|
|
; CHECK-NEXT: }
|
|
;
|
|
entry:
|
|
br label %loop
|
|
|
|
loop:
|
|
%iv = phi i64 [ 0, %entry ], [ %iv.next, %loop ]
|
|
%data.phi = phi i32 [ -1, %entry ], [ %select.data, %loop ]
|
|
%ld.addr = getelementptr inbounds i32, ptr %data, i64 %iv
|
|
%ld = load i32, ptr %ld.addr, align 4
|
|
%select.cmp = icmp slt i32 %a, %ld
|
|
%select.data = select i1 %select.cmp, i32 %ld, i32 %data.phi
|
|
%iv.next = add nuw nsw i64 %iv, 1
|
|
%exit.cmp = icmp eq i64 %iv.next, %N
|
|
br i1 %exit.cmp, label %exit, label %loop
|
|
|
|
exit:
|
|
ret i32 %select.data
|
|
}
|
|
|
|
; This function is derived from the following C program:
|
|
; int simple_csa_int_load(int* a, int* b, int default_val, int N, int threshold) {
|
|
; int result = default_val;
|
|
; for (int i = 0; i < N; ++i)
|
|
; if (a[i] > threshold)
|
|
; result = b[i];
|
|
; return result;
|
|
; }
|
|
define i32 @simple_csa_int_load(ptr noalias %a, ptr noalias %b, i32 %default_val, i64 %N, i32 %threshold) {
|
|
; CHECK-LABEL: 'simple_csa_int_load'
|
|
; CHECK: VPlan 'Initial VPlan for VF={4},UF>=1' {
|
|
; CHECK-NEXT: Live-in vp<[[VP0:%[0-9]+]]> = VF
|
|
; CHECK-NEXT: Live-in vp<[[VP1:%[0-9]+]]> = VF * UF
|
|
; CHECK-NEXT: Live-in vp<[[VP2:%[0-9]+]]> = vector-trip-count
|
|
; CHECK-NEXT: Live-in ir<%N> = original trip-count
|
|
; CHECK-EMPTY:
|
|
; CHECK-NEXT: ir-bb<entry>:
|
|
; CHECK-NEXT: Successor(s): scalar.ph, vector.ph
|
|
; CHECK-EMPTY:
|
|
; CHECK-NEXT: vector.ph:
|
|
; CHECK-NEXT: Successor(s): vector loop
|
|
; CHECK-EMPTY:
|
|
; CHECK-NEXT: <x1> vector loop: {
|
|
; CHECK-NEXT: vector.body:
|
|
; CHECK-NEXT: EMIT vp<[[VP3:%[0-9]+]]> = CANONICAL-INDUCTION ir<0>, vp<%index.next>
|
|
; CHECK-NEXT: WIDEN-REDUCTION-PHI ir<%data.phi> = phi ir<%default_val>, vp<[[VP11:%[0-9]+]]>
|
|
; CHECK-NEXT: WIDEN-PHI vp<[[VP4:%[0-9]+]]> = phi [ ir<false>, vector.ph ], [ vp<[[VP10:%[0-9]+]]>, if.then.0 ]
|
|
; CHECK-NEXT: vp<[[VP5:%[0-9]+]]> = SCALAR-STEPS vp<[[VP3]]>, ir<1>, vp<[[VP0]]>
|
|
; CHECK-NEXT: CLONE ir<%a.addr> = getelementptr inbounds nuw ir<%a>, vp<[[VP5]]>
|
|
; CHECK-NEXT: vp<[[VP6:%[0-9]+]]> = vector-pointer inbounds nuw ir<%a.addr>
|
|
; CHECK-NEXT: WIDEN ir<%ld.a> = load vp<[[VP6]]>
|
|
; CHECK-NEXT: WIDEN ir<%if.cond> = icmp sgt ir<%ld.a>, ir<%threshold>
|
|
; CHECK-NEXT: Successor(s): pred.load
|
|
; CHECK-EMPTY:
|
|
; CHECK-NEXT: <xVFxUF> pred.load: {
|
|
; CHECK-NEXT: pred.load.entry:
|
|
; CHECK-NEXT: BRANCH-ON-MASK ir<%if.cond>
|
|
; CHECK-NEXT: Successor(s): pred.load.if, pred.load.continue
|
|
; CHECK-EMPTY:
|
|
; CHECK-NEXT: pred.load.if:
|
|
; CHECK-NEXT: vp<[[VP7:%[0-9]+]]> = SCALAR-STEPS vp<[[VP3]]>, ir<1>, vp<[[VP0]]>
|
|
; CHECK-NEXT: REPLICATE ir<%b.addr> = getelementptr inbounds nuw ir<%b>, vp<[[VP7]]>
|
|
; CHECK-NEXT: REPLICATE ir<%ld.b> = load ir<%b.addr> (S->V)
|
|
; CHECK-NEXT: Successor(s): pred.load.continue
|
|
; CHECK-EMPTY:
|
|
; CHECK-NEXT: pred.load.continue:
|
|
; CHECK-NEXT: PHI-PREDICATED-INSTRUCTION vp<[[VP8:%[0-9]+]]> = ir<%ld.b>
|
|
; CHECK-NEXT: No successors
|
|
; CHECK-NEXT: }
|
|
; CHECK-NEXT: Successor(s): if.then.0
|
|
; CHECK-EMPTY:
|
|
; CHECK-NEXT: if.then.0:
|
|
; CHECK-NEXT: EMIT vp<[[VP9:%[0-9]+]]> = any-of ir<%if.cond>
|
|
; CHECK-NEXT: EMIT vp<[[VP10]]> = select vp<[[VP9]]>, ir<%if.cond>, vp<[[VP4]]>
|
|
; CHECK-NEXT: EMIT vp<[[VP11]]> = select vp<[[VP9]]>, vp<[[VP8]]>, ir<%data.phi>
|
|
; CHECK-NEXT: EMIT vp<%index.next> = add nuw vp<[[VP3]]>, vp<[[VP1]]>
|
|
; CHECK-NEXT: EMIT branch-on-count vp<%index.next>, vp<[[VP2]]>
|
|
; CHECK-NEXT: No successors
|
|
; CHECK-NEXT: }
|
|
; CHECK-NEXT: Successor(s): middle.block
|
|
; CHECK-EMPTY:
|
|
; CHECK-NEXT: middle.block:
|
|
; CHECK-NEXT: EMIT vp<[[VP13:%[0-9]+]]> = extract-last-active vp<[[VP11]]>, vp<[[VP10]]>, ir<%default_val>
|
|
; CHECK-NEXT: EMIT vp<%cmp.n> = icmp eq ir<%N>, vp<[[VP2]]>
|
|
; CHECK-NEXT: EMIT branch-on-cond vp<%cmp.n>
|
|
; CHECK-NEXT: Successor(s): ir-bb<exit>, scalar.ph
|
|
; CHECK-EMPTY:
|
|
; CHECK-NEXT: ir-bb<exit>:
|
|
; CHECK-NEXT: IR %select.data.lcssa = phi i32 [ %select.data, %latch ] (extra operand: vp<[[VP13]]> from middle.block)
|
|
; CHECK-NEXT: No successors
|
|
; CHECK-EMPTY:
|
|
; CHECK-NEXT: scalar.ph:
|
|
; CHECK-NEXT: EMIT-SCALAR vp<%bc.resume.val> = phi [ vp<[[VP2]]>, middle.block ], [ ir<0>, ir-bb<entry> ]
|
|
; CHECK-NEXT: EMIT-SCALAR vp<%bc.merge.rdx> = phi [ vp<[[VP13]]>, middle.block ], [ ir<%default_val>, ir-bb<entry> ]
|
|
; CHECK-NEXT: Successor(s): ir-bb<loop>
|
|
; CHECK-EMPTY:
|
|
; CHECK-NEXT: ir-bb<loop>:
|
|
; CHECK-NEXT: IR %iv = phi i64 [ 0, %entry ], [ %iv.next, %latch ] (extra operand: vp<%bc.resume.val> from scalar.ph)
|
|
; CHECK-NEXT: IR %data.phi = phi i32 [ %default_val, %entry ], [ %select.data, %latch ] (extra operand: vp<%bc.merge.rdx> from scalar.ph)
|
|
; CHECK-NEXT: IR %a.addr = getelementptr inbounds nuw i32, ptr %a, i64 %iv
|
|
; CHECK-NEXT: IR %ld.a = load i32, ptr %a.addr, align 4
|
|
; CHECK-NEXT: IR %if.cond = icmp sgt i32 %ld.a, %threshold
|
|
; CHECK-NEXT: No successors
|
|
; CHECK-NEXT: }
|
|
;
|
|
entry:
|
|
br label %loop
|
|
|
|
loop:
|
|
%iv = phi i64 [ 0, %entry ], [ %iv.next, %latch ]
|
|
%data.phi = phi i32 [ %default_val, %entry ], [ %select.data, %latch ]
|
|
%a.addr = getelementptr inbounds nuw i32, ptr %a, i64 %iv
|
|
%ld.a = load i32, ptr %a.addr, align 4
|
|
%if.cond = icmp sgt i32 %ld.a, %threshold
|
|
br i1 %if.cond, label %if.then, label %latch
|
|
|
|
if.then:
|
|
%b.addr = getelementptr inbounds nuw i32, ptr %b, i64 %iv
|
|
%ld.b = load i32, ptr %b.addr, align 4
|
|
br label %latch
|
|
|
|
latch:
|
|
%select.data = phi i32 [ %ld.b, %if.then ], [ %data.phi, %loop ]
|
|
%iv.next = add nuw nsw i64 %iv, 1
|
|
%exit.cmp = icmp eq i64 %iv.next, %N
|
|
br i1 %exit.cmp, label %exit, label %loop
|
|
|
|
exit:
|
|
ret i32 %select.data
|
|
}
|