1 ; RUN: opt %loadPolly -polly-detect-unprofitable -polly-no-early-exit -polly-detect-scops-in-regions-without-loops -polly-codegen-isl -analyze < %s | FileCheck %s
2 ; RUN: opt %loadPolly -polly-detect-unprofitable -polly-no-early-exit -polly-detect-scops-in-regions-without-loops -polly-codegen-isl -S < %s | FileCheck %s -check-prefix=CHECK-CODE
4 ; void f(long A[], long N) {
22 ; for (i = 0; i < N; ++i)
26 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"
27 target triple = "x86_64-unknown-linux-gnu"
29 define void @f(i64* %A, i64 %N) nounwind {
32 br i1 true, label %then1, label %else1
41 br i1 true, label %then, label %else
56 %indvar = phi i64 [ 0, %for.i.head1], [ %indvar.next, %for.i ]
58 %scevgep = getelementptr i64, i64* %A, i64 %indvar
59 store i64 %indvar, i64* %scevgep
60 %indvar.next = add nsw i64 %indvar, 1
61 %exitcond = icmp eq i64 %indvar.next, %N
62 br i1 %exitcond, label %return, label %for.i
69 ; CHECK: Create LLVM-IR from SCoPs' for region: 'next.split => polly.merge_new_and_old'
70 ; CHECK-CODE: polly.split_new_and_old
71 ; CHECK-CODE: polly.merge_new_and_old