test/thomasset.c

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