1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
|
/* Generated from ../../../git/cloog/test/christian.cloog by CLooG 0.16.2-5-g3b3bf96 gmp bits in 0.02s. */
extern void hash(int);
/* Useful macros. */
#define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d))
#define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d))
#define max(x,y) ((x) > (y) ? (x) : (y))
#define min(x,y) ((x) < (y) ? (x) : (y))
#define S1(i,j) { hash(1); hash(i); hash(j); }
#define S2(i,j) { hash(2); hash(i); hash(j); }
void test(int N)
{
/* Scattering iterators. */
int p;
/* Original iterators. */
int i, j;
if (N >= 1) {
S1(0,N-1);
for (p=-N+2;p<=N-1;p++) {
if (p >= 1) {
S2(p-1,0);
}
for (i=max(0,p);i<=min(N-1,p+N-2);i++) {
S1(i,-p+i);
S2(i,-p+i+1);
}
if (p <= 0) {
S1(p+N-1,N-1);
}
}
S2(N-1,0);
}
}
|
