1; RUN: opt %loadPolly -polly-scops -analyze -polly-print-instructions < %s | FileCheck %s 2; 3; CHECK: Statements { 4; CHECK-NEXT: Stmt_Stmt 5; CHECK-NEXT: Domain := 6; CHECK-NEXT: { Stmt_Stmt[i0] : 0 <= i0 <= 1023 }; 7; CHECK-NEXT: Schedule := 8; CHECK-NEXT: { Stmt_Stmt[i0] -> [i0, 0] }; 9; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0] 10; CHECK-NEXT: { Stmt_Stmt[i0] -> MemRef_A[i0] }; 11; CHECK-NEXT: Instructions { 12; CHECK-NEXT: store i32 %i.0, i32* %arrayidx, align 4 13; CHECK-NEXT: } 14; CHECK-NEXT: Stmt_Stmt_b 15; CHECK-NEXT: Domain := 16; CHECK-NEXT: { Stmt_Stmt_b[i0] : 0 <= i0 <= 1023 }; 17; CHECK-NEXT: Schedule := 18; CHECK-NEXT: { Stmt_Stmt_b[i0] -> [i0, 1] }; 19; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0] 20; CHECK-NEXT: { Stmt_Stmt_b[i0] -> MemRef_B[i0] }; 21; CHECK-NEXT: Instructions { 22; CHECK-NEXT: store i32 %i.0, i32* %arrayidx2, align 4 23; CHECK-NEXT: } 24; CHECK-NEXT: } 25; 26; Function Attrs: noinline nounwind uwtable 27define void @func(i32* %A, i32* %B, double* %C) #0 { 28entry: 29 br label %for.cond 30 31for.cond: ; preds = %for.inc, %entry 32 %i.0 = phi i32 [ 0, %entry ], [ %add, %for.inc ] 33 %cmp = icmp slt i32 %i.0, 1024 34 br i1 %cmp, label %for.body, label %for.end 35 36for.body: ; preds = %for.cond 37 br label %Stmt 38 39Stmt: 40 %idxprom = sext i32 %i.0 to i64 41 %arrayidx = getelementptr inbounds i32, i32* %A, i64 %idxprom 42 store i32 %i.0, i32* %arrayidx, align 4 43 %idxprom1 = sext i32 %i.0 to i64, !polly_split_after !0 44 %arrayidx2 = getelementptr inbounds i32, i32* %B, i64 %idxprom1 45 store i32 %i.0, i32* %arrayidx2, align 4 46 br label %for.inc 47 48for.inc: ; preds = %Stmt 49 %add = add nsw i32 %i.0, 1 50 br label %for.cond 51 52for.end: ; preds = %for.cond 53 ret void 54} 55 56!0 = !{!"polly_split_after"} 57