1 ; RUN: opt %loadPolly -polly-detect-unprofitable -basicaa -polly-analyze-ir -disable-polly-intra-scop-scalar-to-array -analyze < %s | FileCheck %s
2 ; RUN: opt %loadPolly -polly-detect-unprofitable -basicaa -polly-analyze-ir -disable-polly-intra-scop-scalar-to-array -analyze < %s | FileCheck %s
4 ; void f(long A[], int N, int *init_ptr) {
7 ; for (i = 0; i < N; ++i) {
9 ; for (i = 0; i < N; ++i) {
15 target 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"
16 target triple = "x86_64-unknown-linux-gnu"
18 ; Function Attrs: nounwind
19 define void @f(i64* noalias %A, i64 %N, i64* noalias %init_ptr) #0 {
23 for.i: ; preds = %for.i.end, %entry
24 %indvar.i = phi i64 [ 0, %entry ], [ %indvar.i.next, %for.i.end ]
25 %indvar.i.next = add nsw i64 %indvar.i, 1
28 entry.next: ; preds = %for.i
29 %init = load i64* %init_ptr
30 ; CHECK: BB: entry.next
31 ; CHECK: Read init_ptr[0]
32 ; CHECK: Write init[0]
35 for.j: ; preds = %for.j, %entry.next
36 %indvar.j = phi i64 [ 0, %entry.next ], [ %indvar.j.next, %for.j ]
37 %init_plus_two = add i64 %init, 2
39 ; CHECK: Write A[{0,+,8}<%for.j>]
40 %scevgep = getelementptr i64, i64* %A, i64 %indvar.j
41 store i64 %init_plus_two, i64* %scevgep
42 %indvar.j.next = add nsw i64 %indvar.j, 1
43 %exitcond.j = icmp eq i64 %indvar.j.next, %N
44 br i1 %exitcond.j, label %for.i.end, label %for.j
46 for.i.end: ; preds = %for.j
47 %exitcond.i = icmp eq i64 %indvar.i.next, %N
48 br i1 %exitcond.i, label %return, label %for.i
50 return: ; preds = %for.i.end
54 attributes #0 = { nounwind }