maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity
llvm-project/polly/test/ScopDetect/invalid-latch-conditions.ll

Ignoring revisions in .git-blame-ignore-revs. Click here to bypass and see the normal blame view.

48 lines
1.9 KiB
LLVM
Raw Normal View History

Introduce -polly-process-unprofitable This single option replaces -polly-detect-unprofitable and -polly-no-early-exit and is supposed to be the only option that disables compile-time heuristics that aim to bail out early on scops that are believed to not benefit from Polly optimizations. Suggested-by: Johannes Doerfert llvm-svn: 249426
2015-10-07 00:10:29 +08:00
; RUN: opt %loadPolly -polly-process-unprofitable=false \
tests: Explicitly state if profitability tests should be used Polly's profitability heuristic saves compile time by skipping trivial scops or scops were we know no good optimization can be applied. For almost all our tests this heuristic makes little sense as we aim for minimal test cases when testing functionality. Hence, in almost all cases this heuristic is better be disabled. In preparation of disabling Polly's compile time heuristic by default in the test suite we first explicitly enable it in the couple of test cases that really use it (or run with/without heuristic side-by-side). llvm-svn: 249418
2015-10-06 23:19:35 +08:00
; RUN: -polly-detect -analyze < %s | FileCheck %s
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-allow-nonaffine-loops \
tests: Explicitly state if profitability tests should be used Polly's profitability heuristic saves compile time by skipping trivial scops or scops were we know no good optimization can be applied. For almost all our tests this heuristic makes little sense as we aim for minimal test cases when testing functionality. Hence, in almost all cases this heuristic is better be disabled. In preparation of disabling Polly's compile time heuristic by default in the test suite we first explicitly enable it in the couple of test cases that really use it (or run with/without heuristic side-by-side). llvm-svn: 249418
2015-10-06 23:19:35 +08:00
; RUN: -polly-detect -analyze < %s | FileCheck %s --check-prefix=NALOOPS
; RUN: opt %loadPolly -polly-allow-nonaffine-loops -polly-detect -analyze \
Introduce -polly-process-unprofitable This single option replaces -polly-detect-unprofitable and -polly-no-early-exit and is supposed to be the only option that disables compile-time heuristics that aim to bail out early on scops that are believed to not benefit from Polly optimizations. Suggested-by: Johannes Doerfert llvm-svn: 249426
2015-10-07 00:10:29 +08:00
; RUN: -polly-process-unprofitable=false < %s | \
tests: Explicitly state if profitability tests should be used Polly's profitability heuristic saves compile time by skipping trivial scops or scops were we know no good optimization can be applied. For almost all our tests this heuristic makes little sense as we aim for minimal test cases when testing functionality. Hence, in almost all cases this heuristic is better be disabled. In preparation of disabling Polly's compile time heuristic by default in the test suite we first explicitly enable it in the couple of test cases that really use it (or run with/without heuristic side-by-side). llvm-svn: 249418
2015-10-06 23:19:35 +08:00
; RUN: FileCheck %s --check-prefix=PROFIT
[FIX] Approximate non-affine loops correctly Before isValidCFG() could hide the fact that a loop is non-affine by over-approximation. This is problematic if a subregion of the loop contains an exit/latch block and is over-approximated. Now we do not over-approximate in the isValidCFG function if we check loop control. If such control is non-affine the whole loop is over-approximated, not only a subregion. llvm-svn: 249273
2015-10-04 22:54:27 +08:00
; The latch conditions of the outer loop are not affine, thus the loop cannot
; handled by the domain generation and needs to be overapproximated.
[FIX] Count affine loops correctly The "unprofitable" heuristic was broken and counted boxed loops even though we do not represent and optimize them. llvm-svn: 249274
2015-10-04 22:56:08 +08:00
; CHECK-NOT: Valid
; NALOOPS: Valid Region for Scop: for.body.6 => for.end.45
; PROFIT-NOT: Valid
[FIX] Approximate non-affine loops correctly Before isValidCFG() could hide the fact that a loop is non-affine by over-approximation. This is problematic if a subregion of the loop contains an exit/latch block and is over-approximated. Now we do not over-approximate in the isValidCFG function if we check loop control. If such control is non-affine the whole loop is over-approximated, not only a subregion. llvm-svn: 249273
2015-10-04 22:54:27 +08:00
; ModuleID = '/home/johannes/Downloads/bug.ll'
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
; Function Attrs: nounwind uwtable
define void @kernel_reg_detect([6 x i32]* %path) #0 {
entry:
br label %for.body.6
for.body.6: ; preds = %for.inc.43, %for.body.6, %entry
%indvars.iv9 = phi i64 [ %indvars.iv.next10, %for.body.6 ], [ 0, %for.inc.43 ], [ 0, %entry ]
%indvars.iv.next10 = add nuw nsw i64 %indvars.iv9, 1
%lftr.wideiv = trunc i64 %indvars.iv.next10 to i32
%exitcond = icmp ne i32 %lftr.wideiv, 6
br i1 %exitcond, label %for.body.6, label %for.inc.40
for.inc.40: ; preds = %for.inc.40, %for.body.6
%arrayidx28 = getelementptr inbounds [6 x i32], [6 x i32]* %path, i64 0, i64 0
%tmp = load i32, i32* %arrayidx28, align 4
%arrayidx36 = getelementptr inbounds [6 x i32], [6 x i32]* %path, i64 0, i64 0
store i32 0, i32* %arrayidx36, align 4
%exitcond22 = icmp ne i64 0, 6
br i1 %exitcond22, label %for.inc.40, label %for.inc.43
for.inc.43: ; preds = %for.inc.40
%exitcond23 = icmp ne i32 0, 10000
br i1 %exitcond23, label %for.body.6, label %for.end.45
for.end.45: ; preds = %for.inc.43
ret void
}