36 lines · plain
1; RUN: opt %loadNPMPolly '-passes=polly-custom<ast>' -polly-print-ast -polly-ast-detect-parallel -disable-output < %s | FileCheck %s2;3; void f(int *A, int N) {4; CHECK: #pragma minimal dependence distance: -(N % 2) + 25; for (int i = 0; i < N; i++)6; A[i] = A[N - i] + 1;7; }8;9target datalayout = "e-m:e-p:32:32-i64:64-v128:64:128-n32-S64"10 11define void @f(ptr %A, i32 %N) {12entry:13 br label %for.cond14 15for.cond: ; preds = %for.inc, %entry16 %i.0 = phi i32 [ 0, %entry ], [ %inc, %for.inc ]17 %cmp = icmp slt i32 %i.0, %N18 br i1 %cmp, label %for.body, label %for.end19 20for.body: ; preds = %for.cond21 %sub = sub nsw i32 %N, %i.022 %arrayidx = getelementptr inbounds i32, ptr %A, i32 %sub23 %tmp = load i32, ptr %arrayidx, align 424 %add = add nsw i32 %tmp, 125 %arrayidx1 = getelementptr inbounds i32, ptr %A, i32 %i.026 store i32 %add, ptr %arrayidx1, align 427 br label %for.inc28 29for.inc: ; preds = %for.body30 %inc = add nsw i32 %i.0, 131 br label %for.cond32 33for.end: ; preds = %for.cond34 ret void35}36