1/* Generated from ../../../git/cloog/test/lu2.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.02s. */
2extern 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,l) { hash(1); hash(i); hash(j); hash(k); hash(l); }
11#define S2(i,j,k,l,m) { hash(2); hash(i); hash(j); hash(k); hash(l); hash(m); }
12
13void test(int n)
14{
15  /* Original iterators. */
16  int i, j, k, l, m;
17  if (n >= 2) {
18    for (l=2;l<=n;l++) {
19      S1(1,n,1,l) ;
20    }
21  }
22  for (i=2;i<=n-1;i++) {
23    for (j=2;j<=n-1;j++) {
24      for (k=1;k<=min(j-1,i-1);k++) {
25        S2(i,j,k,j,i) ;
26      }
27    }
28    for (k=1;k<=i-1;k++) {
29      S2(i,n,k,n,i) ;
30    }
31    for (l=i+1;l<=n;l++) {
32      S1(i,n,i,l) ;
33    }
34  }
35  if (n >= 2) {
36    for (j=2;j<=n;j++) {
37      for (k=1;k<=j-1;k++) {
38        S2(n,j,k,j,n) ;
39      }
40    }
41  }
42}
43