llvm-project

1
; RUN: opt %loadNPMPolly -passes=polly-codegen -S < %s | FileCheck %s -check-prefix=CHECK-CODE
2

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

11
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"
12

13
define void @f(ptr %A, i64 %N) nounwind {
14
entry:
15
  fence seq_cst
16
  br i1 true, label %next, label %return
17

18
next:
19
  br i1 true, label %for.i, label %return
20

21
for.i:
22
  %indvar = phi i64 [ 0, %next], [ %indvar.next, %for.i ]
23
  %scevgep = getelementptr i64, ptr %A, i64 %indvar
24
  store i64 %indvar, ptr %scevgep
25
  %indvar.next = add nsw i64 %indvar, 1
26
  %exitcond = icmp eq i64 %indvar.next, %N
27
  br i1 %exitcond, label %return, label %for.i
28

29
return:
30
  fence seq_cst
31
  ret void
32
}
33

34
; CHECK-CODE: polly.split_new_and_old
35
; CHECK-CODE: polly.merge_new_and_old
36