Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
[Polly] [NFC] [ScopDetection] Make
polly-only-func
perform regex sc…
…op name match. Summary: - We were using `.count` in `StringRef`, which matches substrings. - We may want to use this for equality as well. - Generalise this, so allow regexes as a parameter to `polly-only-func`. Differential Revision: https://reviews.llvm.org/D35728 llvm-svn: 308875
- Loading branch information
Showing
2 changed files
with
145 additions
and
6 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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,130 @@ | ||
; RUN: opt %loadPolly -polly-scops -analyze -polly-only-func=f.*,g.* < %s | FileCheck %s | ||
; | ||
; Check that the flag `-polly-only-func` works with regexes. | ||
; | ||
; CHECK: Function: f1 | ||
; CHECK-NEXT: Region: %for.cond---%for.end | ||
; | ||
; CHECK: Function: f2 | ||
; CHECK-NEXT: Region: %for.cond---%for.end | ||
; | ||
; CHECK: Function: g1 | ||
; CHECK-NEXT: Region: %for.cond---%for.end | ||
; | ||
; CHECK-NOT: Function: h | ||
; | ||
; void f1(int* sum) { | ||
; for (int i = 0; i <= 100; i++) | ||
; sum += i * 3; | ||
; } | ||
; void f2(int* sum) { | ||
; for (int i = 0; i <= 100; i++) | ||
; sum += i * 3; | ||
; } | ||
; void g1(int* sum) { | ||
; for (int i = 0; i <= 100; i++) | ||
; sum += i * 3; | ||
; } | ||
; void h(int* sum) { | ||
; for (int i = 0; i <= 100; i++) | ||
; sum += i * 3; | ||
; } | ||
target datalayout = "e-m:e-p:32:32-i64:64-v128:64:128-n32-S64" | ||
|
||
define void @f1(i32* %sum) { | ||
entry: | ||
br label %entry.split1 | ||
|
||
entry.split1: ; preds = %entry | ||
br label %entry.split | ||
|
||
entry.split: ; preds = %entry.split1 | ||
br label %for.cond | ||
|
||
for.cond: ; preds = %for.cond, %entry.split | ||
%i1.0 = phi i32 [ 0, %entry.split ], [ %inc, %for.cond ] | ||
%sum.reload = load i32, i32* %sum | ||
%mul = mul nsw i32 %i1.0, 3 | ||
%add = add nsw i32 %sum.reload, %mul | ||
%inc = add nsw i32 %i1.0, 1 | ||
store i32 %add, i32* %sum | ||
%cmp = icmp slt i32 %i1.0, 100 | ||
br i1 %cmp, label %for.cond, label %for.end | ||
|
||
for.end: ; preds = %for.cond | ||
ret void | ||
} | ||
|
||
|
||
define void @f2(i32* %sum) { | ||
entry: | ||
br label %entry.split1 | ||
|
||
entry.split1: ; preds = %entry | ||
br label %entry.split | ||
|
||
entry.split: ; preds = %entry.split1 | ||
br label %for.cond | ||
|
||
for.cond: ; preds = %for.cond, %entry.split | ||
%i1.0 = phi i32 [ 0, %entry.split ], [ %inc, %for.cond ] | ||
%sum.reload = load i32, i32* %sum | ||
%mul = mul nsw i32 %i1.0, 3 | ||
%add = add nsw i32 %sum.reload, %mul | ||
%inc = add nsw i32 %i1.0, 1 | ||
store i32 %add, i32* %sum | ||
%cmp = icmp slt i32 %i1.0, 100 | ||
br i1 %cmp, label %for.cond, label %for.end | ||
|
||
for.end: ; preds = %for.cond | ||
ret void | ||
} | ||
|
||
define void @g1(i32* %sum) { | ||
entry: | ||
br label %entry.split1 | ||
|
||
entry.split1: ; preds = %entry | ||
br label %entry.split | ||
|
||
entry.split: ; preds = %entry.split1 | ||
br label %for.cond | ||
|
||
for.cond: ; preds = %for.cond, %entry.split | ||
%i1.0 = phi i32 [ 0, %entry.split ], [ %inc, %for.cond ] | ||
%sum.reload = load i32, i32* %sum | ||
%mul = mul nsw i32 %i1.0, 3 | ||
%add = add nsw i32 %sum.reload, %mul | ||
%inc = add nsw i32 %i1.0, 1 | ||
store i32 %add, i32* %sum | ||
%cmp = icmp slt i32 %i1.0, 100 | ||
br i1 %cmp, label %for.cond, label %for.end | ||
|
||
for.end: ; preds = %for.cond | ||
ret void | ||
} | ||
|
||
define void @h(i32* %sum) { | ||
entry: | ||
br label %entry.split1 | ||
|
||
entry.split1: ; preds = %entry | ||
br label %entry.split | ||
|
||
entry.split: ; preds = %entry.split1 | ||
br label %for.cond | ||
|
||
for.cond: ; preds = %for.cond, %entry.split | ||
%i1.0 = phi i32 [ 0, %entry.split ], [ %inc, %for.cond ] | ||
%sum.reload = load i32, i32* %sum | ||
%mul = mul nsw i32 %i1.0, 3 | ||
%add = add nsw i32 %sum.reload, %mul | ||
%inc = add nsw i32 %i1.0, 1 | ||
store i32 %add, i32* %sum | ||
%cmp = icmp slt i32 %i1.0, 100 | ||
br i1 %cmp, label %for.cond, label %for.end | ||
|
||
for.end: ; preds = %for.cond | ||
ret void | ||
} | ||
|