test/thomasset.c

   1 /* Generated from thomasset.cloog by CLooG v0.14.0 gmp bits in 0.11s. */
   2 /* CLooG asked for 440 KBytes. */
   3 for (c1=0;c1<=floord(n-5,3);c1++) {
   4   for (i=max(3*c1+1,1);i<=3*c1+3;i++) {
   5     S1(j = c1) ;
   6   }
   7 }
   8 if (n == 1) {
   9   S1(i = 1,j = 0) ;
  10   for (k=0;k<=min(0,0);k++) {
  11     for (p=max(0,ceild(-3*k-1,3));p<=min(floord(-3*k+1,3),0);p++) {
  12       q = -k-p ;
  13       S2(i = 1,j = 1) ;
  14     }
  15   }
  16 }
  17 if (n >= 2) {
  18   for (c1=max(0,ceild(n-4,3));c1<=0;c1++) {
  19     S1(i = 1,j = c1) ;
  20     for (j=1;j<=min(n,3*c1-n+5);j++) {
  21       for (k=0;k<=floord(3*c1-j-n+4,3);k++) {
  22         for (p=ceild(n-2,3);p<=floord(3*c1-j-3*k+2,3);p++) {
  23           q = c1-k-p ;
  24           S2(i = 1) ;
  25         }
  26       }
  27     }
  28     for (i=2;i<=min(n,3*c1+3);i++) {
  29       S1(j = c1) ;
  30     }
  31     for (c2=1;c2<=n-1;c2++) {
  32       i = c2+1 ;
  33       for (j=1;j<=min(3*c1-n+5,n);j++) {
  34         for (k=0;k<=floord(3*c1-j-n+4,3);k++) {
  35           for (p=ceild(n-2,3);p<=floord(3*c1-j-3*k+2,3);p++) {
  36             q = c1-k-p ;
  37             S2 ;
  38           }
  39         }
  40       }
  41     }
  42   }
  43 }
  44 for (c1=max(1,ceild(n-4,3));c1<=floord(n-1,3);c1++) {
  45   for (j=1;j<=3*c1-n+5;j++) {
  46     for (k=0;k<=min(floord(3*c1-j-n+4,3),0);k++) {
  47       for (p=max(ceild(n-2,3),ceild(3*c1-j-3*k,3));p<=min(floord(3*c1-j-3*k+2,3),floord(n,3));p++) {
  48         q = c1-k-p ;
  49         S2(i = 1) ;
  50       }
  51     }
  52   }
  53   for (i=3*c1+1;i<=min(n,3*c1+3);i++) {
  54     S1(j = c1) ;
  55   }
  56   for (c2=1;c2<=n-1;c2++) {
  57     i = c2+1 ;
  58     for (j=1;j<=3*c1-n+5;j++) {
  59       for (k=0;k<=min(floord(3*c1-j-n+4,3),0);k++) {
  60         for (p=max(ceild(n-2,3),ceild(3*c1-j-3*k,3));p<=min(floord(3*c1-j-3*k+2,3),floord(n,3));p++) {
  61           q = c1-k-p ;
  62           S2 ;
  63         }
  64       }
  65     }
  66   }
  67 }
  68 if (n >= 1) {
  69   for (c1=ceild(n,3);c1<=floord(2*n+1,3);c1++) {
  70     for (c2=0;c2<=n-1;c2++) {
  71       i = c2+1 ;
  72       for (j=max(1,3*c1-n-1);j<=min(n,3*c1-n+5);j++) {
  73         for (k=max(ceild(3*c1-j-n,3),0);k<=min(floord(3*c1-j-n+4,3),0);k++) {
  74           for (p=max(ceild(n-2,3),ceild(3*c1-j-3*k,3));p<=min(floord(3*c1-j-3*k+2,3),floord(n,3));p++) {
  75             q = c1-k-p ;
  76             S2 ;
  77           }
  78         }
  79       }
  80     }
  81   }
  82 }