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