test/reservoir/pingali6.good.c

   1 /* Generated from ../../../git/cloog/test/./reservoir/pingali6.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.03s. */
   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, int N)
  14 {
  15   /* Scattering iterators. */
  16   int c2, c4, c6;
  17   /* Original iterators. */
  18   int i, j, k;
  19   if (N >= 3) {
  20     for (c4=2;c4<=N-1;c4++) {
  21       for (c6=2;c6<=N-1;c6++) {
  22         S1(1,c4,c6) ;
  23       }
  24     }
  25   }
  26   if (N >= 3) {
  27     for (c2=3;c2<=2*M;c2++) {
  28       for (c4=2;c4<=N-1;c4++) {
  29         for (c6=2;c6<=N-1;c6++) {
  30           if (c2%2 == 0) {
  31             S1(c2/2,c4,c6) ;
  32           }
  33         }
  34       }
  35       for (c4=2;c4<=N-1;c4++) {
  36         for (c6=2;c6<=N-1;c6++) {
  37           if ((c2+1)%2 == 0) {
  38             i = (c2-1)/2 ;
  39             S2((c2-1)/2,c4,c6) ;
  40           }
  41         }
  42       }
  43     }
  44   }
  45   if (N >= 3) {
  46     c2 = 2*M+1 ;
  47     for (c4=2;c4<=N-1;c4++) {
  48       for (c6=2;c6<=N-1;c6++) {
  49         S2(M,c4,c6) ;
  50       }
  51     }
  52   }
  53 }