1 ; RUN: opt %loadPolly -polly-scops -analyze < %s | FileCheck %s
4 ; void foo(long n, float A[][n]) {
5 ; for (long i = 0; i < 100; i++)
6 ; for (long j = 0; j < n; j++)
7 ; A[i][j] += A[i][n - j - 1];
10 ; Verify that the parameter in the subscript expression is correctly
13 ; CHECK: Assumed Context:
14 ; CHECK-NEXT: [n] -> { : }
16 ; CHECK: ReadAccess := [Reduction Type: NONE] [Scalar: 0]
17 ; CHECK-NEXT: [n] -> { Stmt_for_body3[i0, i1] -> MemRef_A[i0, -1 + n - i1] };
19 target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
21 define void @foo(i64 %n, float* %A) {
25 for.cond: ; preds = %for.inc8, %entry
26 %i.0 = phi i64 [ 0, %entry ], [ %inc9, %for.inc8 ]
27 %exitcond = icmp ne i64 %i.0, 100
28 br i1 %exitcond, label %for.body, label %for.end10
30 for.body: ; preds = %for.cond
33 for.cond1: ; preds = %for.inc, %for.body
34 %j.0 = phi i64 [ 0, %for.body ], [ %inc, %for.inc ]
35 %cmp2 = icmp slt i64 %j.0, %n
36 br i1 %cmp2, label %for.body3, label %for.end
38 for.body3: ; preds = %for.cond1
39 %sub = sub nsw i64 %n, %j.0
40 %sub4 = add nsw i64 %sub, -1
41 %tmp = mul nsw i64 %i.0, %n
42 %arrayidx.sum = add i64 %tmp, %sub4
43 %arrayidx5 = getelementptr inbounds float, float* %A, i64 %arrayidx.sum
44 %tmp1 = load float, float* %arrayidx5, align 4
45 %tmp2 = mul nsw i64 %i.0, %n
46 %arrayidx6.sum = add i64 %tmp2, %j.0
47 %arrayidx7 = getelementptr inbounds float, float* %A, i64 %arrayidx6.sum
48 %tmp3 = load float, float* %arrayidx7, align 4
49 %add = fadd float %tmp3, %tmp1
50 store float %add, float* %arrayidx7, align 4
53 for.inc: ; preds = %for.body3
54 %inc = add nuw nsw i64 %j.0, 1
57 for.end: ; preds = %for.cond1
60 for.inc8: ; preds = %for.end
61 %inc9 = add nuw nsw i64 %i.0, 1
64 for.end10: ; preds = %for.cond