1; RUN: opt %loadPolly -basic-aa -polly-scops -analyze -polly-allow-nonaffine < %s | FileCheck %s 2target 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-n8:16:32:64-S128" 3 4; void foo(long n, double A[], int INDEX[]) { 5; for (long i = 0; i < n; i++) 6; A[INDEX[i]] = i; 7; } 8 9define void @foo(i64 %n, double* noalias %A, i64* noalias %INDEX) { 10entry: 11 br label %for.body 12 13for.body: 14 %i = phi i64 [ %inc, %for.body ], [ 0, %entry ] 15 %arrayidx = getelementptr inbounds i64, i64* %INDEX, i64 %i 16 %val = load i64, i64* %arrayidx 17 %arrayidx1 = getelementptr inbounds double, double* %A, i64 %val 18 store double 1.0, double* %arrayidx1 19 %inc = add nsw i64 %i, 1 20 %exitcond = icmp eq i64 %inc, %n 21 br i1 %exitcond, label %for.end, label %for.body 22 23for.end: 24 ret void 25} 26 27; CHECK: p0: %n 28; 29; CHECK: Statements { 30; CHECK-NEXT: Stmt_for_body 31; CHECK-NEXT: Domain := 32; CHECK-NEXT: [n] -> { Stmt_for_body[i0] : 0 <= i0 < n }; 33; CHECK-NEXT: Schedule := 34; CHECK-NEXT: [n] -> { Stmt_for_body[i0] -> [i0] }; 35; CHECK-NEXT: ReadAccess := [Reduction Type: NONE] [Scalar: 0] 36; CHECK-NEXT: [n] -> { Stmt_for_body[i0] -> MemRef_INDEX[i0] }; 37; CHECK-NEXT: MayWriteAccess := [Reduction Type: NONE] [Scalar: 0] 38; CHECK-NEXT: [n] -> { Stmt_for_body[i0] -> MemRef_A[o0] }; 39; CHECK-NEXT: } 40