51 lines · plain
1; RUN: opt %loadNPMPolly '-passes=polly-custom<ast>' -polly-print-ast -polly-ast-detect-parallel -disable-output < %s | FileCheck %s2;3; CHECK: #pragma known-parallel reduction (^ : MemRef_sum)4; void f(int N, int M, int *sum) {5; for (int i = 0; i < N; i++)6; CHECK: #pragma simd7; for (int j = 0; j < M; j++)8; sum[j] ^= j;9; }10;11target datalayout = "e-m:e-p:32:32-i64:64-v128:64:128-n32-S64"12 13define void @f(i32 %N, i32 %M, ptr %sum) {14entry:15 br label %for.cond16 17for.cond: ; preds = %for.inc4, %entry18 %i.0 = phi i32 [ 0, %entry ], [ %inc5, %for.inc4 ]19 %cmp = icmp slt i32 %i.0, %N20 br i1 %cmp, label %for.body, label %for.end621 22for.body: ; preds = %for.cond23 br label %for.cond124 25for.cond1: ; preds = %for.inc, %for.body26 %j.0 = phi i32 [ 0, %for.body ], [ %inc, %for.inc ]27 %cmp2 = icmp slt i32 %j.0, %M28 br i1 %cmp2, label %for.body3, label %for.end29 30for.body3: ; preds = %for.cond131 %arrayidx = getelementptr inbounds i32, ptr %sum, i32 %j.032 %tmp = load i32, ptr %arrayidx, align 433 %xor = xor i32 %tmp, %j.034 store i32 %xor, ptr %arrayidx, align 435 br label %for.inc36 37for.inc: ; preds = %for.body338 %inc = add nsw i32 %j.0, 139 br label %for.cond140 41for.end: ; preds = %for.cond142 br label %for.inc443 44for.inc4: ; preds = %for.end45 %inc5 = add nsw i32 %i.0, 146 br label %for.cond47 48for.end6: ; preds = %for.cond49 ret void50}51