50 lines · plain
1; RUN: opt %loadNPMPolly -polly-invariant-load-hoisting=true '-passes=polly-custom<scops>' -polly-print-scops -disable-output < %s 2>&1 | FileCheck %s2;3; void f(int *A, unsigned N) {4; for (unsigned i = 0; i < N; i++)5; A[i / 3] = A[5 * N / 3];6; }7;8; CHECK: Invariant Accesses: {9; CHECK-NEXT: ReadAccess := [Reduction Type: NONE] [Scalar: 0]10; CHECK-NEXT: [N] -> { Stmt_for_body[i0] -> MemRef_A[o0] : -2 + 5N <= 3o0 <= 5N };11; CHECK-NEXT: Execution Context: [N] -> { : 0 < N <= 1383505805528216371 }12; CHECK-NEXT: }13;14; CHECK: Assumed Context:15; CHECK-NEXT: [N] -> { : }16; CHECK-NEXT: Invalid Context:17; CHECK-NEXT: [N] -> { : N >= 1383505805528216372 }18 19; CHECK: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0]20; CHECK-NEXT: [N] -> { Stmt_for_body[i0] -> MemRef_A[o0] : -2 + i0 <= 3o0 <= i0 };21 22target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"23 24define void @f(ptr %A, i64 %N) {25entry:26 br label %for.cond27 28for.cond: ; preds = %for.inc, %entry29 %indvars.iv = phi i64 [ %indvars.iv.next, %for.inc ], [ 0, %entry ]30 %exitcond = icmp ne i64 %indvars.iv, %N31 br i1 %exitcond, label %for.body, label %for.end32 33for.body: ; preds = %for.cond34 %mul = mul nsw i64 %N, 535 %div2 = udiv i64 %mul, 336 %arrayidx2 = getelementptr inbounds i32, ptr %A, i64 %div237 %load = load i32, ptr %arrayidx2, align 438 %div = udiv i64 %indvars.iv, 339 %arrayidx = getelementptr inbounds i32, ptr %A, i64 %div40 store i32 %load, ptr %arrayidx, align 441 br label %for.inc42 43for.inc: ; preds = %for.body44 %indvars.iv.next = add nuw nsw i64 %indvars.iv, 145 br label %for.cond46 47for.end: ; preds = %for.cond48 ret void49}50