Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
[ScopBuilder] Split statements on encountering store instructions.
Introduce -polly-stmt-granularity=store option. Contributed-by: Nandini Singhal <cs15mtech01004@iith.ac.in> Differential Revision: https://reviews.llvm.org/D37337 llvm-svn: 320360
- Loading branch information
1 parent
dc31c61
commit 5f0e8a4
Showing
3 changed files
with
73 additions
and
5 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,62 @@ | ||
; RUN: opt %loadPolly -polly-scops -analyze -polly-stmt-granularity=store -polly-print-instructions < %s | FileCheck %s | ||
|
||
; void func(int *A, int *B){ | ||
; for (int i = 0; i < 1024; i+=1) { | ||
; Stmt: | ||
; A[i] = i; | ||
; B[i] = i; | ||
; } | ||
; } | ||
; | ||
; CHECK: Statements { | ||
; CHECK-NEXT: Stmt_Stmt | ||
; CHECK-NEXT: Domain := | ||
; CHECK-NEXT: { Stmt_Stmt[i0] : 0 <= i0 <= 1023 }; | ||
; CHECK-NEXT: Schedule := | ||
; CHECK-NEXT: { Stmt_Stmt[i0] -> [i0, 0] }; | ||
; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0] | ||
; CHECK-NEXT: { Stmt_Stmt[i0] -> MemRef_A[i0] }; | ||
; CHECK-NEXT: Instructions { | ||
; CHECK-NEXT: store i32 %i.0, i32* %arrayidx, align 4 | ||
; CHECK-NEXT: } | ||
; CHECK-NEXT: Stmt_Stmt1 | ||
; CHECK-NEXT: Domain := | ||
; CHECK-NEXT: { Stmt_Stmt1[i0] : 0 <= i0 <= 1023 }; | ||
; CHECK-NEXT: Schedule := | ||
; CHECK-NEXT: { Stmt_Stmt1[i0] -> [i0, 1] }; | ||
; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0] | ||
; CHECK-NEXT: { Stmt_Stmt1[i0] -> MemRef_B[i0] }; | ||
; CHECK-NEXT: Instructions { | ||
; CHECK-NEXT: store i32 %i.0, i32* %arrayidx2, align 4 | ||
; CHECK-NEXT: } | ||
; CHECK-NEXT: } | ||
; | ||
; Function Attrs: noinline nounwind uwtable | ||
define void @func(i32* %A, i32* %B) #0 { | ||
entry: | ||
br label %for.cond | ||
|
||
for.cond: ; preds = %for.inc, %entry | ||
%i.0 = phi i32 [ 0, %entry ], [ %add, %for.inc ] | ||
%cmp = icmp slt i32 %i.0, 1024 | ||
br i1 %cmp, label %for.body, label %for.end | ||
|
||
for.body: ; preds = %for.cond | ||
br label %Stmt | ||
|
||
Stmt: ; preds = %for.body | ||
%idxprom = sext i32 %i.0 to i64 | ||
%arrayidx = getelementptr inbounds i32, i32* %A, i64 %idxprom | ||
store i32 %i.0, i32* %arrayidx, align 4 | ||
%idxprom1 = sext i32 %i.0 to i64 | ||
%arrayidx2 = getelementptr inbounds i32, i32* %B, i64 %idxprom1 | ||
store i32 %i.0, i32* %arrayidx2, align 4 | ||
br label %for.inc | ||
|
||
for.inc: ; preds = %Stmt | ||
%add = add nsw i32 %i.0, 1 | ||
br label %for.cond | ||
|
||
for.end: ; preds = %for.cond | ||
ret void | ||
} |