xref: /llvm-project/polly/test/ScopDetect/cross_loop_non_single_exit_2.ll (revision e1f056f692d869708c1898d9d65a69ac5584a0ed)
1; RUN: opt %loadNPMPolly '-passes=print<polly-detect>' -disable-output < %s 2>&1 | FileCheck %s
2
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;   else
9;     for (j = 0; j < N; ++j)
10;        A[j] = j;
11; }
12
13target 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"
14
15declare i64 @foo()
16
17define void @f(ptr %A, i64 %N) nounwind {
18entry:
19  fence seq_cst
20  br i1 true, label %next, label %next2
21
22next2:
23  br i1 true, label %for.j, label %return
24
25for.j:
26  %indvar2 = phi i64 [ 0, %next2], [ %indvar2.next2, %for.j]
27  %scevgep2 = getelementptr i64, ptr %A, i64 %indvar2
28  store i64 %indvar2, ptr %scevgep2
29  %indvar2.next2 = add nsw i64 %indvar2, 1
30  %exitcond2 = icmp eq i64 %indvar2.next2, %N
31  br i1 %exitcond2, label %return, label %for.j
32
33next:
34  br i1 true, label %for.i, label %return
35
36for.i:
37  %indvar = phi i64 [ 0, %next], [ %indvar.next, %for.i ]
38  %scevgep = getelementptr i64, ptr %A, i64 %indvar
39  store i64 %indvar, ptr %scevgep
40  %i = call i64 @foo()
41  %indvar.next = add nsw i64 %indvar, 1
42  %exitcond = icmp eq i64 %indvar.next, %N
43  br i1 %exitcond, label %return, label %for.i
44
45return:
46  br i1 true, label %return_a, label %return_b
47
48return_a:
49  br label %return_join
50
51return_b:
52  br label %return_join
53
54return_join:
55  fence seq_cst
56  ret void
57}
58
59; CHECK-NOT: Valid Region for Scop: next => return
60; CHECK: Valid Region for Scop: next2 => return
61