1 ; RUN: opt %loadPolly -polly-detect-unprofitable -polly-detect -analyze < %s | FileCheck %s
2 ; RUN: opt %loadPolly -polly-detect-unprofitable -polly-detect -polly-codegen-isl -analyze < %s | FileCheck %s
4 ; void f(long A[], long N) {
7 ; for (j = 0; j < N; ++j)
8 ; for (i = 0; i < N; ++i)
12 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"
13 target triple = "x86_64-unknown-linux-gnu"
15 define void @f(i64* %A, i64 %N) nounwind {
21 br i1 true, label %for.j, label %return
24 %j.015 = phi i64 [ %inc5, %for.inc8 ], [ 0, %next ]
28 %indvar = phi i64 [ 0, %for.j], [ %indvar.next, %for.i ]
29 %scevgep = getelementptr i64, i64* %A, i64 %indvar
30 store i64 %indvar, i64* %scevgep
31 %indvar.next = add nsw i64 %indvar, 1
32 %exitcond = icmp eq i64 %indvar.next, %N
33 br i1 %exitcond, label %for.inc8, label %for.i
35 for.inc8: ; preds = %for.body3
36 %inc5 = add nsw i64 %j.015, 1
37 %exitcond16 = icmp eq i64 %inc5, %N
38 br i1 %exitcond16, label %return, label %for.j
45 ; CHECK: Valid Region for Scop: next => return