test/reservoir/lim-lam4.good.c

   1 /* Generated from ../../../git/cloog/test/./reservoir/lim-lam4.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.02s. */
   2 extern void hash(int);
   3
   4 /* Useful macros. */
   5 #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d))
   6 #define ceild(n,d)  (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d))
   7 #define max(x,y)    ((x) > (y) ? (x) : (y))
   8 #define min(x,y)    ((x) < (y) ? (x) : (y))
   9
  10 #define S1(i,j,k) { hash(1); hash(i); hash(j); hash(k); }
  11 #define S2(i,j,k) { hash(2); hash(i); hash(j); hash(k); }
  12
  13 void test(int M)
  14 {
  15   /* Scattering iterators. */
  16   int c2, c4, c6;
  17   /* Original iterators. */
  18   int i, j, k;
  19   if (M >= 2) {
  20     S1(1,0,0) ;
  21   }
  22   for (c2=2;c2<=2*M-2;c2++) {
  23     for (c4=max(-M+1,-c2+1);c4<=-1;c4++) {
  24       for (i=max(1,c2-M+1);i<=min(c2+c4,M-1);i++) {
  25         j = c2+c4-i ;
  26         S1(i,c2+c4-i,-c4) ;
  27       }
  28       for (c6=max(-c4,c2-M+1);c6<=min(c2-1,M-1);c6++) {
  29         i = c2-c6 ;
  30         j = c4+c6 ;
  31         S2(c2-c6,c4+c6,c6) ;
  32       }
  33     }
  34     for (i=max(1,c2-M+1);i<=min(M-1,c2);i++) {
  35       j = c2-i ;
  36       S1(i,c2-i,0) ;
  37     }
  38   }
  39 }