57 lines · plain
1; RUN: opt %loadNPMPolly -aa-pipeline=basic-aa '-passes=polly-custom<scops>' -polly-print-scops -disable-output -polly-invariant-load-hoisting=true < %s 2>&1 | FileCheck %s2 3; void f(long A[], int N, int *init_ptr) {4; long i, j;5;6; for (i = 0; i < N; ++i) {7; for (i = 0; i < N; ++i) {8; init = *init_ptr;9; A[i] = init + 2;10; }11; }12; }13 14target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128"15 16; Function Attrs: nounwind17; CHECK: Invariant Accesses:18; CHECK-NEXT: ReadAccess := [Reduction Type: NONE] [Scalar: 0]19; CHECK-NEXT: [N] -> { Stmt_for_j[i0, i1] -> MemRef_init_ptr[0] };20define void @f(ptr noalias %A, i64 %N, ptr noalias %init_ptr) #0 {21entry:22 br label %for.i23 24for.i: ; preds = %for.i.end, %entry25 %indvar.i = phi i64 [ 0, %entry ], [ %indvar.i.next, %for.i.end ]26 %indvar.i.next = add nsw i64 %indvar.i, 127 br label %entry.next28 29entry.next: ; preds = %for.i30 br label %for.j31 32for.j: ; preds = %for.j, %entry.next33 %indvar.j = phi i64 [ 0, %entry.next ], [ %indvar.j.next, %for.j ]34 %init = load i64, ptr %init_ptr35 %init_plus_two = add i64 %init, 236 %scevgep = getelementptr i64, ptr %A, i64 %indvar.j37 store i64 %init_plus_two, ptr %scevgep38; CHECK: Statements {39; CHECK-NEXT: Stmt_for_j40; CHECK-NOT: ReadAccess41; CHECK: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0]42; CHECK-NEXT: [N] -> { Stmt_for_j[i0, i1] -> MemRef_A[i1] };43; CHECK-NEXT: }44 %indvar.j.next = add nsw i64 %indvar.j, 145 %exitcond.j = icmp eq i64 %indvar.j.next, %N46 br i1 %exitcond.j, label %for.i.end, label %for.j47 48for.i.end: ; preds = %for.j49 %exitcond.i = icmp eq i64 %indvar.i.next, %N50 br i1 %exitcond.i, label %return, label %for.i51 52return: ; preds = %for.i.end53 ret void54}55 56attributes #0 = { nounwind }57