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

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

57 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-ast -polly-ast-detect-parallel -analyze < %s | FileCheck %s
[GSoC] Add PolyhedralInfo pass - new interface to polly analysis Adding a new pass PolyhedralInfo. This pass will be the interface to Polly. Initially, we will provide the following interface: - #IsParallel(Loop *L) - return a bool depending on whether the loop is parallel or not for the given program order. Patch by Utpal Bora <cs14mtech11017@iith.ac.in> Differential Revision: https://reviews.llvm.org/D21486 llvm-svn: 276637
2016-07-25 20:48:45 +08:00
; RUN: opt %loadPolly -polyhedral-info -polly-check-parallel -analyze < %s | FileCheck %s -check-prefix=PINFO
Compute and print the minimal loop carried dependency distance During the IslAst parallelism check also compute the minimal dependency distance and store it in the IstAst for node. Reviewer: sebpop Differential Revision: http://reviews.llvm.org/D4987 llvm-svn: 217729
2014-09-14 01:34:11 +08:00
;
; void f(int *A, int N, int c, int v) {
; CHECK: #pragma minimal dependence distance: 1
[GSoC] Add PolyhedralInfo pass - new interface to polly analysis Adding a new pass PolyhedralInfo. This pass will be the interface to Polly. Initially, we will provide the following interface: - #IsParallel(Loop *L) - return a bool depending on whether the loop is parallel or not for the given program order. Patch by Utpal Bora <cs14mtech11017@iith.ac.in> Differential Revision: https://reviews.llvm.org/D21486 llvm-svn: 276637
2016-07-25 20:48:45 +08:00
; PINFO: for.cond: Loop is not parallel.
Compute and print the minimal loop carried dependency distance During the IslAst parallelism check also compute the minimal dependency distance and store it in the IstAst for node. Reviewer: sebpop Differential Revision: http://reviews.llvm.org/D4987 llvm-svn: 217729
2014-09-14 01:34:11 +08:00
; for (int j = 0; j < N; j++)
[GSoC] Add PolyhedralInfo pass - new interface to polly analysis Adding a new pass PolyhedralInfo. This pass will be the interface to Polly. Initially, we will provide the following interface: - #IsParallel(Loop *L) - return a bool depending on whether the loop is parallel or not for the given program order. Patch by Utpal Bora <cs14mtech11017@iith.ac.in> Differential Revision: https://reviews.llvm.org/D21486 llvm-svn: 276637
2016-07-25 20:48:45 +08:00
; CHECK: #pragma minimal dependence distance: max(-c - v, c + v)
; PINFO-NEXT: for.cond1: Loop is not parallel.
; for (int i = 0; i < N; i++)
; A[i + c + v] = A[i] + 1;
Compute and print the minimal loop carried dependency distance During the IslAst parallelism check also compute the minimal dependency distance and store it in the IstAst for node. Reviewer: sebpop Differential Revision: http://reviews.llvm.org/D4987 llvm-svn: 217729
2014-09-14 01:34:11 +08:00
; }
;
target datalayout = "e-m:e-p:32:32-i64:64-v128:64:128-n32-S64"
define void @f(i32* %A, i32 %N, i32 %c, i32 %v) {
entry:
br label %for.cond
for.cond: ; preds = %for.inc7, %entry
%j.0 = phi i32 [ 0, %entry ], [ %inc8, %for.inc7 ]
%cmp = icmp slt i32 %j.0, %N
br i1 %cmp, label %for.body, label %for.end9
for.body: ; preds = %for.cond
br label %for.cond1
for.cond1: ; preds = %for.inc, %for.body
%i.0 = phi i32 [ 0, %for.body ], [ %inc, %for.inc ]
%exitcond = icmp ne i32 %i.0, %N
br i1 %exitcond, label %for.body3, label %for.end
for.body3: ; preds = %for.cond1
Update Polly tests to handle explicitly typed gep changes in LLVM llvm-svn: 230784
2015-02-28 03:20:19 +08:00
%arrayidx = getelementptr inbounds i32, i32* %A, i32 %i.0
Update Polly tests to handle explicitly typed load changes in LLVM. llvm-svn: 230796
2015-02-28 05:22:50 +08:00
%tmp = load i32, i32* %arrayidx, align 4
Compute and print the minimal loop carried dependency distance During the IslAst parallelism check also compute the minimal dependency distance and store it in the IstAst for node. Reviewer: sebpop Differential Revision: http://reviews.llvm.org/D4987 llvm-svn: 217729
2014-09-14 01:34:11 +08:00
%add = add nsw i32 %tmp, 1
%add4 = add nsw i32 %i.0, %c
%add5 = add nsw i32 %add4, %v
Update Polly tests to handle explicitly typed gep changes in LLVM llvm-svn: 230784
2015-02-28 03:20:19 +08:00
%arrayidx6 = getelementptr inbounds i32, i32* %A, i32 %add5
Compute and print the minimal loop carried dependency distance During the IslAst parallelism check also compute the minimal dependency distance and store it in the IstAst for node. Reviewer: sebpop Differential Revision: http://reviews.llvm.org/D4987 llvm-svn: 217729
2014-09-14 01:34:11 +08:00
store i32 %add, i32* %arrayidx6, align 4
br label %for.inc
for.inc: ; preds = %for.body3
%inc = add nsw i32 %i.0, 1
br label %for.cond1
for.end: ; preds = %for.cond1
br label %for.inc7
for.inc7: ; preds = %for.end
%inc8 = add nsw i32 %j.0, 1
br label %for.cond
for.end9: ; preds = %for.cond
ret void
}