diff options
| author | Johannes Doerfert <jdoerfert@codeaurora.org> | 2014-07-01 20:52:51 +0000 |
|---|---|---|
| committer | Johannes Doerfert <jdoerfert@codeaurora.org> | 2014-07-01 20:52:51 +0000 |
| commit | f618339a37fbfc2a1edeb1f934fe41b73ebb65e3 (patch) | |
| tree | 97d2e7f0aeb553d6ea2a61ed5361bd2fbdd2a4fe /polly/test/ScopInfo/reduction_multiple_simple_binary.ll | |
| parent | d905da4a5fd3306eb9cac7262ef800f04badb3da (diff) | |
| download | bcm5719-llvm-f618339a37fbfc2a1edeb1f934fe41b73ebb65e3.tar.gz bcm5719-llvm-f618339a37fbfc2a1edeb1f934fe41b73ebb65e3.zip | |
Introduce reduction types
This change is particularly useful in the code generation as we need
to know which binary operator/identity element we need to combine/initialize
the privatization locations.
+ Print the reduction type for each memory access
+ Adjusted the test cases to comply with the new output format and
to test for the right reduction type
llvm-svn: 212126
Diffstat (limited to 'polly/test/ScopInfo/reduction_multiple_simple_binary.ll')
| -rw-r--r-- | polly/test/ScopInfo/reduction_multiple_simple_binary.ll | 26 |
1 files changed, 13 insertions, 13 deletions
diff --git a/polly/test/ScopInfo/reduction_multiple_simple_binary.ll b/polly/test/ScopInfo/reduction_multiple_simple_binary.ll index 52ddcd15a27..49e49188995 100644 --- a/polly/test/ScopInfo/reduction_multiple_simple_binary.ll +++ b/polly/test/ScopInfo/reduction_multiple_simple_binary.ll @@ -1,30 +1,30 @@ ; RUN: opt -basicaa %loadPolly -polly-scops -analyze < %s | FileCheck %s ; -; CHECK: ReadAccess := [Reduction like: 0] +; CHECK: ReadAccess := [Reduction Type: NONE ; CHECK: { Stmt_for_body[i0] -> MemRef_A[1 + i0] }; -; CHECK: ReadAccess := [Reduction like: 0] +; CHECK: ReadAccess := [Reduction Type: NONE ; CHECK: { Stmt_for_body[i0] -> MemRef_A[i0] }; -; CHECK: MustWriteAccess := [Reduction like: 0] +; CHECK: MustWriteAccess := [Reduction Type: NONE ; CHECK: { Stmt_for_body[i0] -> MemRef_first[0] }; -; CHECK: ReadAccess := [Reduction like: 1] +; CHECK: ReadAccess := [Reduction Type: ADD ; CHECK: { Stmt_for_body[i0] -> MemRef_sum[0] }; -; CHECK: MustWriteAccess := [Reduction like: 1] +; CHECK: MustWriteAccess := [Reduction Type: ADD ; CHECK: { Stmt_for_body[i0] -> MemRef_sum[0] }; -; CHECK: ReadAccess := [Reduction like: 0] +; CHECK: ReadAccess := [Reduction Type: NONE ; CHECK: { Stmt_for_body[i0] -> MemRef_A[-1 + i0] }; -; CHECK: ReadAccess := [Reduction like: 0] +; CHECK: ReadAccess := [Reduction Type: NONE ; CHECK: { Stmt_for_body[i0] -> MemRef_A[i0] }; -; CHECK: MustWriteAccess := [Reduction like: 0] +; CHECK: MustWriteAccess := [Reduction Type: NONE ; CHECK: { Stmt_for_body[i0] -> MemRef_middle[0] }; -; CHECK: ReadAccess := [Reduction like: 1] +; CHECK: ReadAccess := [Reduction Type: MUL ; CHECK: { Stmt_for_body[i0] -> MemRef_prod[0] }; -; CHECK: MustWriteAccess := [Reduction like: 1] +; CHECK: MustWriteAccess := [Reduction Type: MUL ; CHECK: { Stmt_for_body[i0] -> MemRef_prod[0] }; -; CHECK: ReadAccess := [Reduction like: 0] +; CHECK: ReadAccess := [Reduction Type: NONE ; CHECK: { Stmt_for_body[i0] -> MemRef_A[-1 + i0] }; -; CHECK: ReadAccess := [Reduction like: 0] +; CHECK: ReadAccess := [Reduction Type: NONE ; CHECK: { Stmt_for_body[i0] -> MemRef_A[1 + i0] }; -; CHECK: MustWriteAccess := [Reduction like: 0] +; CHECK: MustWriteAccess := [Reduction Type: NONE ; CHECK: { Stmt_for_body[i0] -> MemRef_last[0] }; ; ; int first, sum, middle, prod, last; |
