Added howto file for a new CLooG release
[cloog.git] / test / yosr.good.c
blob8845a2c5c9aa17e888131aef4eaa2da93407340e
1 /* Generated from ../../../git/cloog/test/yosr.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,k) { hash(2); hash(i); hash(j); hash(k); }
13 void test(int n)
15 /* Scattering iterators. */
16 int proc;
17 /* Original iterators. */
18 int i, j, k;
19 if (n >= 2) {
20 for (j=2;j<=n;j++) {
21 S1(1,j) ;
24 for (proc=2;proc<=n-1;proc++) {
25 for (i=1;i<=proc-1;i++) {
26 for (j=i+1;j<=n;j++) {
27 S2(i,j,proc) ;
30 for (j=proc+1;j<=n;j++) {
31 S1(proc,j) ;
34 if (n >= 2) {
35 for (i=1;i<=n-1;i++) {
36 for (j=i+1;j<=n;j++) {
37 S2(i,j,n) ;