Added howto file for a new CLooG release
[cloog.git] / test / lineality-2-1-2.good.c
blob78d812669e1dd2cdb18f407a32bb9c04546a5417
1 /* Generated from ../../../git/cloog/test/lineality-2-1-2.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */
2 extern void hash(int);
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))
10 #define S1(i,j) { hash(1); hash(i); hash(j); }
11 #define S2(i,j) { hash(2); hash(i); hash(j); }
13 void test(int M)
15 /* Original iterators. */
16 int i, j;
17 for (i=1;i<=M-3;i++) {
18 for (j=1;j<=i+1;j++) {
19 S1(i,j) ;
21 j = i+2 ;
22 S1(i,i+2) ;
23 S2(i,i+2) ;
24 for (j=i+3;j<=M;j++) {
25 S1(i,j) ;
28 if (M >= 3) {
29 i = M-2 ;
30 for (j=1;j<=M-1;j++) {
31 S1(M-2,j) ;
33 S1(M-2,M) ;
34 S2(M-2,M) ;
36 for (i=M-1;i<=M;i++) {
37 for (j=1;j<=M;j++) {
38 S1(i,j) ;
40 j = i+2 ;
41 S2(i,i+2) ;