1; RUN: opt %loadPolly -polly-scops -analyze < %s | FileCheck %s
2
3; void f(int a[], int N) {
4;   int i;
5;   for (i = 0; i < N; ++i)
6;     a[i] = i;
7; }
8
9target 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"
10
11define void @f(i64* nocapture %a, i64 %N) nounwind {
12entry:
13  br label %bb
14
15bb:                                               ; preds = %bb, %entry
16  %i = phi i64 [ 0, %entry ], [ %i.inc, %bb ]
17  %scevgep = getelementptr inbounds i64, i64* %a, i64 %i
18  store i64 %i, i64* %scevgep
19  %i.inc = add nsw i64 %i, 1
20  %exitcond = icmp eq i64 %i.inc, %N
21  br i1 %exitcond, label %return, label %bb
22
23return:                                           ; preds = %bb, %entry
24  ret void
25}
26
27
28; CHECK:      Assumed Context:
29; CHECK-NEXT: [N] -> {  :  }
30;
31; CHECK:      Arrays {
32; CHECK-NEXT:     i64 MemRef_a[*]; // Element size 8
33; CHECK-NEXT: }
34;
35; CHECK:      Statements {
36; CHECK-NEXT:     Stmt_bb
37; CHECK-NEXT:         Domain :=
38; CHECK-NEXT:             [N] -> { Stmt_bb[i0] : 0 <= i0 < N };
39; CHECK-NEXT:         Schedule :=
40; CHECK-NEXT:             [N] -> { Stmt_bb[i0] -> [i0] };
41; CHECK-NEXT:         MustWriteAccess :=    [Reduction Type: NONE] [Scalar: 0]
42; CHECK-NEXT:             [N] -> { Stmt_bb[i0] -> MemRef_a[i0] };
43; CHECK-NEXT: }
44