1/* Generated from ../../../git/cloog/test/square+triangle-1-1-2-3.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) 14{ 15 /* Original iterators. */ 16 int i, j; 17 for (j=1;j<=M;j++) { 18 S1(1,j) ; 19 } 20 for (i=2;i<=M-1;i++) { 21 S1(i,1) ; 22 for (j=2;j<=i;j++) { 23 S1(i,j) ; 24 S2(i,j) ; 25 } 26 for (j=i+1;j<=M;j++) { 27 S1(i,j) ; 28 } 29 } 30 if (M >= 2) { 31 S1(M,1) ; 32 for (j=2;j<=M;j++) { 33 S1(M,j) ; 34 S2(M,j) ; 35 } 36 } 37} 38