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/more-than-one-loop.ll

79 lines
2.3 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 \
Remove -polly-code-generator=isl from many test cases This is the default since a long time. Setting it again does not add value in any of these test cases. llvm-svn: 253800
2015-11-22 07:05:48 +08:00
; RUN: \
ScopDetection: Correctly count the loops in a region There is no reason the loops in a region need to touch either entry or exit block. Hence, we need to look through all loops that may touch the region as well as their children to understand if our region has at least two loops. llvm-svn: 246433
2015-08-31 20:08:11 +08:00
; RUN: -polly-detect -analyze < %s | FileCheck %s
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=true \
Remove -polly-code-generator=isl from many test cases This is the default since a long time. Setting it again does not add value in any of these test cases. llvm-svn: 253800
2015-11-22 07:05:48 +08:00
; RUN: \
ScopDetection: Correctly count the loops in a region There is no reason the loops in a region need to touch either entry or exit block. Hence, we need to look through all loops that may touch the region as well as their children to understand if our region has at least two loops. llvm-svn: 246433
2015-08-31 20:08:11 +08:00
; RUN: -polly-detect -analyze < %s | FileCheck %s
; CHECK: Valid Region for Scop:
; void foo(float *A, float *B, long N) {
; if (N > 100)
; for (long i = 0; i < 100; i++)
; A[i] += i;
; else
; for (long i = 0; i < 100; i++)
; B[i] += i;
; }
;
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
define void @foo(float* %A, float* %B, i64 %N) {
Fix another typo in the subloop counting ... as well as the corresponding test cases. Thank's Johannes for finding this bug. llvm-svn: 246483
2015-09-01 05:04:51 +08:00
entry:
br label %bb
ScopDetection: Correctly count the loops in a region There is no reason the loops in a region need to touch either entry or exit block. Hence, we need to look through all loops that may touch the region as well as their children to understand if our region has at least two loops. llvm-svn: 246433
2015-08-31 20:08:11 +08:00
bb:
%tmp = icmp sgt i64 %N, 100
br i1 %tmp, label %bb2, label %bb12
bb2: ; preds = %bb
br label %bb3
bb3: ; preds = %bb9, %bb2
%i.0 = phi i64 [ 0, %bb2 ], [ %tmp10, %bb9 ]
%exitcond = icmp ne i64 %i.0, 100
br i1 %exitcond, label %bb4, label %bb11
bb4: ; preds = %bb3
%tmp5 = sitofp i64 %i.0 to float
%tmp6 = getelementptr inbounds float, float* %A, i64 %i.0
%tmp7 = load float, float* %tmp6, align 4
%tmp8 = fadd float %tmp7, %tmp5
store float %tmp8, float* %tmp6, align 4
br label %bb9
bb9: ; preds = %bb4
%tmp10 = add nsw i64 %i.0, 1
br label %bb3
bb11: ; preds = %bb3
br label %bb22
bb12: ; preds = %bb
br label %bb13
bb13: ; preds = %bb19, %bb12
%i1.0 = phi i64 [ 0, %bb12 ], [ %tmp20, %bb19 ]
%exitcond1 = icmp ne i64 %i1.0, 100
br i1 %exitcond1, label %bb14, label %bb21
bb14: ; preds = %bb13
%tmp15 = sitofp i64 %i1.0 to float
%tmp16 = getelementptr inbounds float, float* %B, i64 %i1.0
%tmp17 = load float, float* %tmp16, align 4
%tmp18 = fadd float %tmp17, %tmp15
store float %tmp18, float* %tmp16, align 4
br label %bb19
bb19: ; preds = %bb14
%tmp20 = add nsw i64 %i1.0, 1
br label %bb13
bb21: ; preds = %bb13
br label %bb22
bb22: ; preds = %bb21, %bb11
ret void
}