1/* Generated from ../../../git/cloog/test/mode.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,j) { hash(1); hash(i); hash(j); } 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 for (i=0;i<=min(M,N-1);i++) { 18 for (j=0;j<=i;j++) { 19 S1(i,j) ; 20 S2(i,j) ; 21 } 22 for (j=i+1;j<=N;j++) { 23 S2(i,j) ; 24 } 25 } 26 if ((M >= N) && (N >= 0)) { 27 for (j=0;j<=N;j++) { 28 S1(N,j) ; 29 S2(N,j) ; 30 } 31 } 32 if (N >= 0) { 33 for (i=N+1;i<=M;i++) { 34 for (j=0;j<=N;j++) { 35 S1(i,j) ; 36 S2(i,j) ; 37 } 38 for (j=N+1;j<=i;j++) { 39 S1(i,j) ; 40 } 41 } 42 } 43 if (N <= -1) { 44 for (i=0;i<=M;i++) { 45 for (j=0;j<=i;j++) { 46 S1(i,j) ; 47 } 48 } 49 } 50} 51