test/lu.good.c

   1 /* Generated from ../../../git/cloog/test/lu.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) { hash(1); hash(i); hash(j); }
  11 #define S2(i,j,k) { hash(2); hash(i); hash(j); hash(k); }
  12
  13 void test(int n)
  14 {
  15   /* Scattering iterators. */
  16   int c1, c2;
  17   /* Original iterators. */
  18   int i, j, k;
  19   if (n >= 2) {
  20     for (j=2;j<=n;j++) {
  21       S1(1,j) ;
  22     }
  23   }
  24   for (c1=2;c1<=n-1;c1++) {
  25     for (c2=2;c2<=n-1;c2++) {
  26       for (i=1;i<=min(c2-1,c1-1);i++) {
  27         S2(i,c2,c1) ;
  28       }
  29     }
  30     for (i=1;i<=c1-1;i++) {
  31       S2(i,n,c1) ;
  32     }
  33     for (j=c1+1;j<=n;j++) {
  34       S1(c1,j) ;
  35     }
  36   }
  37   if (n >= 2) {
  38     for (c2=2;c2<=n;c2++) {
  39       for (i=1;i<=c2-1;i++) {
  40         S2(i,c2,n) ;
  41       }
  42     }
  43   }
  44 }