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/thomasset.c | |
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/thomasset.c')
-rw-r--r-- | test/thomasset.c | 52 |
1 files changed, 52 insertions, 0 deletions
diff --git a/test/thomasset.c b/test/thomasset.c new file mode 100644 index 0000000..479e9e4 --- /dev/null +++ b/test/thomasset.c @@ -0,0 +1,52 @@ +/* Generated from /home/skimo/git/cloog-parma/cloog-core/test/thomasset.cloog by CLooG 0.14.0-285-g341b1cd gmp bits. */ +if (n >= 1) { + for (c1=0;c1<=floord(n-5,3);c1++) { + for (i=max(1,3*c1+1);i<=3*c1+3;i++) { + S1(i,c1); + } + } + for (c1=max(0,ceild(n-4,3));c1<=floord(n-1,3);c1++) { + if (c1 <= 0) { + S1(1,c1); + for (j=1;j<=min(n,3*c1-n+5);j++) { + for (k=0;k<=min(0,floord(3*c1-j-n+4,3));k++) { + for (p=max(ceild(n-2,3),ceild(3*c1-j-3*k,3));p<=min(floord(n,3),floord(3*c1-j-3*k+2,3));p++) { + S2(1,j,k,p,c1-k-p); + } + } + } + } + if (c1 >= 1) { + for (j=1;j<=min(n,3*c1-n+5);j++) { + for (k=0;k<=min(0,floord(3*c1-j-n+4,3));k++) { + for (p=max(ceild(n-2,3),ceild(3*c1-j-3*k,3));p<=min(floord(n,3),floord(3*c1-j-3*k+2,3));p++) { + S2(1,j,k,p,c1-k-p); + } + } + } + } + for (i=max(2,3*c1+1);i<=min(n,3*c1+3);i++) { + S1(i,c1); + } + for (c2=1;c2<=n-1;c2++) { + for (j=1;j<=min(n,3*c1-n+5);j++) { + for (k=0;k<=min(0,floord(3*c1-j-n+4,3));k++) { + for (p=max(ceild(n-2,3),ceild(3*c1-j-3*k,3));p<=min(floord(n,3),floord(3*c1-j-3*k+2,3));p++) { + S2(c2+1,j,k,p,c1-k-p); + } + } + } + } + } + for (c1=ceild(n,3);c1<=floord(2*n+1,3);c1++) { + for (c2=0;c2<=n-1;c2++) { + for (j=max(1,3*c1-n-1);j<=min(n,3*c1-n+5);j++) { + for (k=max(0,ceild(3*c1-j-n,3));k<=min(0,floord(3*c1-j-n+4,3));k++) { + for (p=max(ceild(n-2,3),ceild(3*c1-j-3*k,3));p<=min(floord(n,3),floord(3*c1-j-3*k+2,3));p++) { + S2(c2+1,j,k,p,c1-k-p); + } + } + } + } + } +} |