maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity
llvm-project/polly/test/ScopInfo/multiple_exiting_blocks.ll

61 lines
2.0 KiB
LLVM
Raw Normal View History

tests: Drop -polly-detect-unprofitable and -polly-no-early-exit These flags are now always passed to all tests and need to be disabled if not needed. Disabling these flags, rather than passing them to almost all tests, significantly simplfies our RUN: lines. llvm-svn: 249422
2015-10-06 23:36:44 +08:00
; RUN: opt %loadPolly -polly-scops -analyze < %s | FileCheck %s
Allow general loops with one latch As we do not rely on ScalarEvolution any more we do not need to get the backedge taken count. Additionally, our domain generation handles everything that is affine and has one latch and our ScopDetection will over-approximate everything else. This change will therefor allow loops with: - one latch - exiting conditions that are affine Additionally, it will not check for structured control flow anymore. Hence, loops and conditionals are not necessarily single entry single exit regions any more. Differential Version: http://reviews.llvm.org/D12758 llvm-svn: 247289
2015-09-10 23:27:46 +08:00
;
; CHECK: Domain :=
Update to ISL 0.16.1 llvm-svn: 257898
2016-01-15 23:54:45 +08:00
; CHECK: [N, P, Q] -> { Stmt_if_end[i0] : 0 <= i0 <= 1 + Q and i0 < N and (i0 < P or (P < 0 and i0 >= 2 + P)); Stmt_if_end[0] : N > 0 and ((P <= -2 and Q <= -2) or (P > 0 and Q <= -2) or P = -1) };
Allow general loops with one latch As we do not rely on ScalarEvolution any more we do not need to get the backedge taken count. Additionally, our domain generation handles everything that is affine and has one latch and our ScopDetection will over-approximate everything else. This change will therefor allow loops with: - one latch - exiting conditions that are affine Additionally, it will not check for structured control flow anymore. Hence, loops and conditionals are not necessarily single entry single exit regions any more. Differential Version: http://reviews.llvm.org/D12758 llvm-svn: 247289
2015-09-10 23:27:46 +08:00
;
; void f(int *A, int N, int P, int Q) {
; for (int i = 0; i < N; i++) {
; if (i == P)
; break;
; A[i]++;
; if (i > Q)
; break;
; }
; }
;
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
define void @f(i32* %A, i32 %N, i32 %P, i32 %Q) {
entry:
%tmp = sext i32 %N to i64
%tmp1 = sext i32 %Q to i64
br label %for.cond
for.cond: ; preds = %for.inc, %entry
%indvars.iv = phi i64 [ %indvars.iv.next, %for.inc ], [ 0, %entry ]
%cmp = icmp slt i64 %indvars.iv, %tmp
br i1 %cmp, label %for.body, label %for.end.loopexit
for.body: ; preds = %for.cond
%tmp2 = trunc i64 %indvars.iv to i32
%cmp1 = icmp eq i32 %tmp2, %P
br i1 %cmp1, label %if.then, label %if.end
if.then: ; preds = %for.body
br label %for.end
if.end: ; preds = %for.body
%arrayidx = getelementptr inbounds i32, i32* %A, i64 %indvars.iv
%tmp3 = load i32, i32* %arrayidx, align 4
%inc = add nsw i32 %tmp3, 1
store i32 %inc, i32* %arrayidx, align 4
%cmp2 = icmp sgt i64 %indvars.iv, %tmp1
br i1 %cmp2, label %if.then.3, label %if.end.4
if.then.3: ; preds = %if.end
br label %for.end
if.end.4: ; preds = %if.end
br label %for.inc
for.inc: ; preds = %if.end.4
%indvars.iv.next = add nuw nsw i64 %indvars.iv, 1
br label %for.cond
for.end.loopexit: ; preds = %for.cond
br label %for.end
for.end: ; preds = %for.end.loopexit, %if.then.3, %if.then
ret void
}