36 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; if (true)7; for (i = 0; i < N; ++i)8; A[i] = i;9; }10 11target 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"12 13define void @f(ptr %A, i64 %N) nounwind {14entry:15 fence seq_cst16 br i1 true, label %next, label %return17 18next:19 br i1 true, label %for.i, label %return20 21for.i:22 %indvar = phi i64 [ 0, %next], [ %indvar.next, %for.i ]23 %scevgep = getelementptr i64, ptr %A, i64 %indvar24 store i64 %indvar, ptr %scevgep25 %indvar.next = add nsw i64 %indvar, 126 %exitcond = icmp eq i64 %indvar.next, %N27 br i1 %exitcond, label %return, label %for.i28 29return:30 fence seq_cst31 ret void32}33 34; CHECK-CODE: polly.split_new_and_old35; CHECK-CODE: polly.merge_new_and_old36