46 lines · plain
1; RUN: opt %loadNPMPolly '-passes=polly-custom<scops>' -polly-print-scops -disable-output < %s 2>&1 | FileCheck %s2; Verify if the following case is not detected as reduction.3;4; void f(int *A, int *sum, int i1, int i2) {5; for (int i = 0; i < 1024; i++)6; sum[i2] = sum[i1] + A[i];7; }8;9; Verify that we don't detect the reduction on sum10;11; CHECK: ReadAccess := [Reduction Type: NONE] [Scalar: 0]12; CHECK-NEXT: { Stmt_for_body[i0] -> MemRef_sum[i1] };13; CHECK-NEXT:ReadAccess := [Reduction Type: NONE] [Scalar: 0]14; CHECK-NEXT: { Stmt_for_body[i0] -> MemRef_A[i0] };15; CHECK-NEXT:MustWriteAccess := [Reduction Type: NONE] [Scalar: 0]16; CHECK-NEXT: { Stmt_for_body[i0] -> MemRef_sum[i2] };17;18target datalayout = "e-m:e-i8:8:32-i16:16:32-i64:64-i128:128-n32:64-S128"19 20; Function Attrs: nofree norecurse nosync nounwind memory(argmem: readwrite) uwtable21define dso_local void @f(ptr nocapture noundef readonly %A, ptr nocapture noundef %sum, i32 noundef %i1, i32 noundef %i2) local_unnamed_addr #0 {22entry:23 br label %entry.split24 25entry.split: ; preds = %entry26 %idxprom = sext i32 %i1 to i6427 %arrayidx = getelementptr inbounds i32, ptr %sum, i64 %idxprom28 %idxprom3 = sext i32 %i2 to i6429 %arrayidx4 = getelementptr inbounds i32, ptr %sum, i64 %idxprom330 br label %for.body31 32for.cond.cleanup: ; preds = %for.body33 ret void34 35for.body: ; preds = %entry.split, %for.body36 %indvars.iv = phi i64 [ 0, %entry.split ], [ %indvars.iv.next, %for.body ]37 %0 = load i32, ptr %arrayidx, align 438 %arrayidx2 = getelementptr inbounds i32, ptr %A, i64 %indvars.iv39 %1 = load i32, ptr %arrayidx2, align 440 %add = add nsw i32 %1, %041 store i32 %add, ptr %arrayidx4, align 442 %indvars.iv.next = add nuw nsw i64 %indvars.iv, 143 %exitcond.not = icmp eq i64 %indvars.iv.next, 102444 br i1 %exitcond.not, label %for.cond.cleanup, label %for.body45}46