test/non_optimal/nul_complex1.good.c

   1 /* Generated from ../../../git/cloog/test/./non_optimal/nul_complex1.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */
   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) { hash(1); hash(i); hash(j); }
  11
  12 void test(int n)
  13 {
  14   /* Scattering iterators. */
  15   int c1, c2;
  16   /* Original iterators. */
  17   int i, j;
  18   for (c1=0;c1<=5*n;c1++) {
  19     for (c2=max(c1-n,ceild(2*c1,3));c2<=min(c1,floord(2*c1+2*n,3));c2++) {
  20       if (c2%2 == 0) {
  21         i = (-2*c1+3*c2)/2 ;
  22         j = c1-c2 ;
  23         S1((-2*c1+3*c2)/2,c1-c2) ;
  24       }
  25     }
  26   }
  27 }