forked from OSchip/llvm-project
71 lines
1.3 KiB
LLVM
71 lines
1.3 KiB
LLVM
; RUN: opt %loadPolly -polly-codegen -S < %s | FileCheck %s -check-prefix=CHECK-CODE
|
|
|
|
; void f(long A[], long N) {
|
|
; long i;
|
|
;
|
|
; if (true){
|
|
; i = 0;
|
|
; goto next;
|
|
; }else{
|
|
; i = 1;
|
|
; goto next;
|
|
; }
|
|
;
|
|
; next:
|
|
; if (true)
|
|
; goto for.i;
|
|
; else
|
|
; goto for.i;
|
|
;
|
|
; for.i:
|
|
; for (i = 0; i < N; ++i)
|
|
; A[i] = i;
|
|
; }
|
|
|
|
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"
|
|
|
|
define void @f(i64* %A, i64 %N) nounwind {
|
|
entry:
|
|
fence seq_cst
|
|
br i1 true, label %then1, label %else1
|
|
|
|
then1:
|
|
br label %next
|
|
|
|
else1:
|
|
br label %next
|
|
|
|
next:
|
|
%sg = getelementptr i64, i64* %A, i64 42
|
|
store i64 undef, i64* %sg
|
|
br i1 true, label %then, label %else
|
|
|
|
then:
|
|
br label %for.i.head
|
|
|
|
else:
|
|
br label %for.i.head
|
|
|
|
for.i.head:
|
|
br label %for.i.head1
|
|
|
|
for.i.head1:
|
|
br label %for.i
|
|
|
|
for.i:
|
|
%indvar = phi i64 [ 0, %for.i.head1], [ %indvar.next, %for.i ]
|
|
fence seq_cst
|
|
%scevgep = getelementptr i64, i64* %A, i64 %indvar
|
|
store i64 %indvar, i64* %scevgep
|
|
%indvar.next = add nsw i64 %indvar, 1
|
|
%exitcond = icmp eq i64 %indvar.next, %N
|
|
br i1 %exitcond, label %return, label %for.i
|
|
|
|
return:
|
|
fence seq_cst
|
|
ret void
|
|
}
|
|
|
|
; CHECK-CODE: polly.split_new_and_old
|
|
; CHECK-CODE: polly.merge_new_and_old
|