58 lines · plain
1; RUN: opt %loadNPMPolly -aa-pipeline=basic-aa '-passes=polly-custom<ast>' -polly-print-ast -polly-ast-detect-parallel -disable-output < %s | FileCheck %s2;3; This loopnest contains a reduction which imposes the same dependences as the4; accesses to the array A. We need to ensure we do __not__ parallelize anything5; here.6;7; CHECK: #pragma minimal dependence distance: 18; CHECK-NOT: pragma9; CHECK-NOT: reduction10;11; void AandSum(int *restrict sum, int *restrict A) {12; for (int i = 0; i < 1024; i++) {13; A[i] = A[i] + A[i - 1];14; A[i - 1] = A[i] + A[i - 2];15; *sum += i;16; }17; }18;19target datalayout = "e-m:e-p:32:32-i64:64-v128:64:128-n32-S64"20 21define void @AandSum(ptr noalias %sum, ptr noalias %A) {22entry:23 br label %for.cond24 25for.cond: ; preds = %for.inc, %entry26 %i.0 = phi i32 [ 0, %entry ], [ %inc, %for.inc ]27 %exitcond = icmp ne i32 %i.0, 102428 br i1 %exitcond, label %for.body, label %for.end29 30for.body: ; preds = %for.cond31 %arrayidx = getelementptr inbounds i32, ptr %A, i32 %i.032 %tmp = load i32, ptr %arrayidx, align 433 %sub = add nsw i32 %i.0, -134 %arrayidx1 = getelementptr inbounds i32, ptr %A, i32 %sub35 %tmp1 = load i32, ptr %arrayidx1, align 436 %add = add nsw i32 %tmp, %tmp137 %arrayidx2 = getelementptr inbounds i32, ptr %A, i32 %i.038 store i32 %add, ptr %arrayidx2, align 439 %sub4 = add nsw i32 %i.0, -240 %arrayidx5 = getelementptr inbounds i32, ptr %A, i32 %sub441 %tmp2 = load i32, ptr %arrayidx5, align 442 %add6 = add nsw i32 %add, %tmp243 %sub7 = add nsw i32 %i.0, -144 %arrayidx8 = getelementptr inbounds i32, ptr %A, i32 %sub745 store i32 %add6, ptr %arrayidx8, align 446 %tmp3 = load i32, ptr %sum, align 447 %add9 = add nsw i32 %tmp3, %i.048 store i32 %add9, ptr %sum, align 449 br label %for.inc50 51for.inc: ; preds = %for.body52 %inc = add nsw i32 %i.0, 153 br label %for.cond54 55for.end: ; preds = %for.cond56 ret void57}58