1/* Generated from ../../../git/cloog/test/logopar.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */ 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 (j=0;j<=m;j++) { 18 S1(1,j) ; 19 } 20 if (m >= n+1) { 21 for (i=2;i<=n;i++) { 22 for (j=0;j<=i-2;j++) { 23 S2(i,j) ; 24 } 25 for (j=i-1;j<=n;j++) { 26 S1(i,j) ; 27 S2(i,j) ; 28 } 29 for (j=n+1;j<=m;j++) { 30 S1(i,j) ; 31 } 32 } 33 } 34 if (m == n) { 35 for (i=2;i<=n;i++) { 36 for (j=0;j<=i-2;j++) { 37 S2(i,j) ; 38 } 39 for (j=i-1;j<=n;j++) { 40 S1(i,j) ; 41 S2(i,j) ; 42 } 43 } 44 } 45 for (i=n+1;i<=m+1;i++) { 46 for (j=i-1;j<=m;j++) { 47 S1(i,j) ; 48 } 49 } 50} 51