diff options
| author | jk7744.park <jk7744.park@samsung.com> | 2015-09-09 02:18:21 +0900 |
|---|---|---|
| committer | jk7744.park <jk7744.park@samsung.com> | 2015-09-09 02:18:21 +0900 |
| commit | 40ef93558be42b604f5eb912414f767972a70b8c (patch) | |
| tree | dd3a18995e2d72f452f3804d87b8a205f0f0a936 /test/published/Web/web3.cloog | |
| parent | eea72ec0021ec2c1c84631af37435123c063eaf1 (diff) | |
| download | cloog-tizen_2.3.1.tar.gz cloog-tizen_2.3.1.tar.bz2 cloog-tizen_2.3.1.zip | |
tizen 2.3.1 releasetizen_2.3.1_releasesubmit/tizen_2.3.1/20150915.095034tizen_2.3.1
Diffstat (limited to 'test/published/Web/web3.cloog')
| -rw-r--r-- | test/published/Web/web3.cloog | 73 |
1 files changed, 0 insertions, 73 deletions
diff --git a/test/published/Web/web3.cloog b/test/published/Web/web3.cloog deleted file mode 100644 index e719a5c..0000000 --- a/test/published/Web/web3.cloog +++ /dev/null @@ -1,73 +0,0 @@ -# CLooG example file #3. -# Please read the first example which is fully documented to understand the -# different parts of this input file. -# -################################################################################ -# The problem here is to generate the scanning code for the integral points # -# inside two different 2-dimensional polyhedra (geometrically two rectangles). # -# | # -# j^ | # -# | (P1)i>=2 | for (i=2;i<=p-1;i++) # -# Context: | | (P2)i>=m | | for (j=2;j<=n;j++) # -# m>n>p>2 | | | (P1)i<=n | | | S1 ; # -# | | | | (P2)i<=p | # -# P1 System: | | | | | | for (i=p;i<=n;i++) # -# 2<=i<=n m-+-+-@@@@@--(P2)j<=p | | for (j=2;j<=p-1;j++) # -# 2<=j<=n | | @@@@@ ==> | | S1 ; # -# n-+-**###@@--(P1)j<=n | | for (j=p;j<=n;j++) # -# P2 System: | **###@@ | | | S1 ; # -# p<=i<=m p-+-**###@@--(P2)j>=m | | | S2 ; # -# p<=j<=m | ***** | | | for (j=n+1;j<=m;j++) # -# 2-+-*****-+--(P1)j>=2 | | | S2 ; # -# *:P1 alone | | | | | | # -# @:P2 alone 0-+-+-+-+-+-->i | for (i=n+1;i<=m;i++) # -# #:P1 and P2 | | | | | | | for (j=p;j<=m;j++) # -# 0 2 p n m | | | S2 ; # -# | # -################################################################################ - -# 1. Language: C -c - -# 2. Parameters {m,n,p | m>n>p>2} -3 5 # 3 rows and 5 columns -# m n p 1 -1 0 0 1 -3 # p>=3 (i.e. p>2) -1 0 1 -1 -1 # n>=p+1 (i.e. n>p) -1 1 -1 0 -1 # m>=n+1 (i.e. m>n) - -# 3. We set manually the parameter name: m, n and p -1 -m n p - -# 4. Number of polyhedra: -2 - -# 5. The polyhedron description: -# - the first one -1 -# {i, j | 2<=i<=n 2<=j<=n} -4 7 # 4 rows, 7 columns -# i j m n p 1 -1 1 0 0 0 0 -2 # i>=2 -1 -1 0 0 1 0 0 # i<=n -1 0 1 0 0 0 -2 # j>=2 -1 0 -1 0 1 0 0 # j<=n -0 0 0 # 3 zeroes ! - -# - the second one -1 -# {j, j | p<=i<=m p<=j<=m} -4 7 # 4 rows, 7 columns -# i j m n p 1 -1 1 0 0 0 -1 0 # i>=p -1 -1 0 1 0 0 0 # i<=m -1 0 1 0 0 -1 0 # j>=p -1 0 -1 1 0 0 0 # j<=m -0 0 0 # 3 zeroes ! - -# 6. We let CLooG choose the iterator names -0 - -# 7. Let CLoog scan the polyhedra in the way it wants. -0 |