1; RUN: opt %loadPolly -polly-print-ast -polly-ast-detect-parallel -disable-output < %s | FileCheck %s 2; RUN: opt %loadPolly -print-polyhedral-info -polly-check-parallel -disable-output < %s | FileCheck %s -check-prefix=PINFO 3; 4; void f(int *A, int N) { 5; CHECK: #pragma minimal dependence distance: -(N % 2) + 2 6; PINFO: for.cond: Loop is not parallel. 7; for (int i = 0; i < N; i++) 8; A[i] = A[N - i] + 1; 9; } 10; 11target datalayout = "e-m:e-p:32:32-i64:64-v128:64:128-n32-S64" 12 13define void @f(ptr %A, i32 %N) { 14entry: 15 br label %for.cond 16 17for.cond: ; preds = %for.inc, %entry 18 %i.0 = phi i32 [ 0, %entry ], [ %inc, %for.inc ] 19 %cmp = icmp slt i32 %i.0, %N 20 br i1 %cmp, label %for.body, label %for.end 21 22for.body: ; preds = %for.cond 23 %sub = sub nsw i32 %N, %i.0 24 %arrayidx = getelementptr inbounds i32, ptr %A, i32 %sub 25 %tmp = load i32, ptr %arrayidx, align 4 26 %add = add nsw i32 %tmp, 1 27 %arrayidx1 = getelementptr inbounds i32, ptr %A, i32 %i.0 28 store i32 %add, ptr %arrayidx1, align 4 29 br label %for.inc 30 31for.inc: ; preds = %for.body 32 %inc = add nsw i32 %i.0, 1 33 br label %for.cond 34 35for.end: ; preds = %for.cond 36 ret void 37} 38