1; RUN: opt %loadPolly -polly-detect-unprofitable -polly-detect -analyze < %s | FileCheck %s
2; RUN: opt %loadPolly -polly-detect-unprofitable -polly-detect -analyze < %s | FileCheck %s
3
4; void f(long A[], long N) {
5;   long i;
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(i64* %A, i64 %N) nounwind {
13entry:
14  fence seq_cst
15  br label %for.i
16
17for.i:
18  %indvar = phi i64 [ 0, %entry ], [ %indvar.next, %for.i ]
19  %scevgep = getelementptr i64, i64* %A, i64 %indvar
20  store i64 %indvar, i64* %scevgep
21  %indvar.next = add nsw i64 %indvar, 1
22  %exitcond = icmp eq i64 %indvar.next, %N
23  br i1 %exitcond, label %return, label %for.i
24
25return:
26  fence seq_cst
27  ret void
28}
29
30; CHECK: Valid Region for Scop: for.i => return
31