35 lines · plain
1; RUN: opt %loadNPMPolly '-passes=polly<no-default-opts>' -S < %s | FileCheck %s -check-prefix=CHECK-CODE2 3; void f(long A[], long N) {4; long i;5; if (true)6; for (i = 0; i < N; ++i)7; A[i] = i;8; }9 10target 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"11 12define void @f(ptr %A, i64 %N) nounwind {13entry:14 fence seq_cst15 br label %next16 17next:18 br i1 true, label %for.i, label %return19 20for.i:21 %indvar = phi i64 [ 0, %next], [ %indvar.next, %for.i ]22 %scevgep = getelementptr i64, ptr %A, i64 %indvar23 store i64 %indvar, ptr %scevgep24 %indvar.next = add nsw i64 %indvar, 125 %exitcond = icmp eq i64 %indvar.next, %N26 br i1 %exitcond, label %return, label %for.i27 28return:29 fence seq_cst30 ret void31}32 33; CHECK-CODE: polly.split_new_and_old34; CHECK-CODE: polly.merge_new_and_old35