tizen 2.3.1 releasetizen_2.3.1_releasesubmit/tizen_2.3.1/20150915.095034tizen_2.3.1

1 files changed, 0 insertions, 81 deletions

diff --git a/test/thomasset.c.ppl b/test/thomasset.c.ppl
deleted file mode 100644
index 2fa1768..0000000
--- a/test/thomasset.c.ppl
+++ /dev/null
@@ -1,81 +0,0 @@
-/* Generated from ./thomasset.cloog by CLooG 0.15 64 bits in 0.11s. */
-for (c1=0;c1<=floord(n-5,3);c1++) {
-  for (i=max(3*c1+1,1);i<=3*c1+3;i++) {
-    S1(j = c1) ;
-  }
-}
-if (n == 1) {
-  S1(i = 1,j = 0) ;
-  for (k=0;k<=min(0,0);k++) {
-    for (p=max(ceild(-3*k-1,3),0);p<=min(floord(-3*k+1,3),0);p++) {
-      q = -k-p ;
-      S2(i = 1,j = 1) ;
-    }
-  }
-}
-if (n >= 2) {
-  for (c1=max(ceild(n-4,3),0);c1<=0;c1++) {
-    S1(i = 1,j = c1) ;
-    for (j=1;j<=min(3*c1-n+5,n);j++) {
-      for (k=0;k<=floord(3*c1-j-n+4,3);k++) {
-        for (p=ceild(n-2,3);p<=floord(3*c1-j-3*k+2,3);p++) {
-          q = c1-k-p ;
-          S2(i = 1) ;
-        }
-      }
-    }
-    for (i=2;i<=min(3*c1+3,n);i++) {
-      S1(j = c1) ;
-    }
-    for (c2=1;c2<=n-1;c2++) {
-      i = c2+1 ;
-      for (j=1;j<=min(3*c1-n+5,n);j++) {
-        for (k=0;k<=floord(3*c1-j-n+4,3);k++) {
-          for (p=ceild(n-2,3);p<=floord(3*c1-j-3*k+2,3);p++) {
-            q = c1-k-p ;
-            S2 ;
-          }
-        }
-      }
-    }
-  }
-}
-for (c1=max(ceild(n-4,3),1);c1<=floord(n-1,3);c1++) {
-  for (j=1;j<=3*c1-n+5;j++) {
-    for (k=0;k<=min(floord(3*c1-j-n+4,3),0);k++) {
-      for (p=max(ceild(3*c1-j-3*k,3),ceild(n-2,3));p<=min(floord(3*c1-j-3*k+2,3),floord(n,3));p++) {
-        q = c1-k-p ;
-        S2(i = 1) ;
-      }
-    }
-  }
-  for (i=3*c1+1;i<=min(3*c1+3,n);i++) {
-    S1(j = c1) ;
-  }
-  for (c2=1;c2<=n-1;c2++) {
-    i = c2+1 ;
-    for (j=1;j<=3*c1-n+5;j++) {
-      for (k=0;k<=min(floord(3*c1-j-n+4,3),0);k++) {
-        for (p=max(ceild(3*c1-j-3*k,3),ceild(n-2,3));p<=min(floord(3*c1-j-3*k+2,3),floord(n,3));p++) {
-          q = c1-k-p ;
-          S2 ;
-        }
-      }
-    }
-  }
-}
-if (n >= 1) {
-  for (c1=ceild(n,3);c1<=floord(2*n+1,3);c1++) {
-    for (c2=0;c2<=n-1;c2++) {
-      i = c2+1 ;
-      for (j=max(3*c1-n-1,1);j<=min(3*c1-n+5,n);j++) {
-        for (k=max(ceild(3*c1-j-n,3),0);k<=min(floord(3*c1-j-n+4,3),0);k++) {
-          for (p=max(ceild(3*c1-j-3*k,3),ceild(n-2,3));p<=min(floord(3*c1-j-3*k+2,3),floord(n,3));p++) {
-            q = c1-k-p ;
-            S2 ;
-          }
-        }
-      }
-    }
-  }
-}