|
236
|
1 ; RUN: opt %loadPolly -polly-codegen -S < %s | FileCheck %s -check-prefix=CHECK-CODE
|
|
|
2
|
|
|
3 ; void f(long A[], long N) {
|
|
|
4 ; long i;
|
|
|
5 ;
|
|
|
6 ; if (true){
|
|
|
7 ; i = 0;
|
|
|
8 ; goto next;
|
|
|
9 ; }else{
|
|
|
10 ; i = 1;
|
|
|
11 ; goto next;
|
|
|
12 ; }
|
|
|
13 ;
|
|
|
14 ; next:
|
|
|
15 ; if (true)
|
|
|
16 ; goto for.i;
|
|
|
17 ; else
|
|
|
18 ; goto for.i;
|
|
|
19 ;
|
|
|
20 ; for.i:
|
|
|
21 ; for (i = 0; i < N; ++i)
|
|
|
22 ; A[i] = i;
|
|
|
23 ; }
|
|
|
24
|
|
|
25 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"
|
|
|
26
|
|
252
|
27 define void @f(ptr %A, i64 %N) nounwind {
|
|
236
|
28 entry:
|
|
|
29 fence seq_cst
|
|
|
30 br i1 true, label %then1, label %else1
|
|
|
31
|
|
|
32 then1:
|
|
|
33 br label %next
|
|
|
34
|
|
|
35 else1:
|
|
|
36 br label %next
|
|
|
37
|
|
|
38 next:
|
|
252
|
39 %sg = getelementptr i64, ptr %A, i64 42
|
|
|
40 store i64 undef, ptr %sg
|
|
236
|
41 br i1 true, label %then, label %else
|
|
|
42
|
|
|
43 then:
|
|
|
44 br label %for.i.head
|
|
|
45
|
|
|
46 else:
|
|
|
47 br label %for.i.head
|
|
|
48
|
|
|
49 for.i.head:
|
|
|
50 br label %for.i.head1
|
|
|
51
|
|
|
52 for.i.head1:
|
|
|
53 br label %for.i
|
|
|
54
|
|
|
55 for.i:
|
|
|
56 %indvar = phi i64 [ 0, %for.i.head1], [ %indvar.next, %for.i ]
|
|
|
57 fence seq_cst
|
|
252
|
58 %scevgep = getelementptr i64, ptr %A, i64 %indvar
|
|
|
59 store i64 %indvar, ptr %scevgep
|
|
236
|
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
|
|
|
63
|
|
|
64 return:
|
|
|
65 fence seq_cst
|
|
|
66 ret void
|
|
|
67 }
|
|
|
68
|
|
|
69 ; CHECK-CODE: polly.split_new_and_old
|
|
|
70 ; CHECK-CODE: polly.merge_new_and_old
|
