First commit : 0.14.0 version (with roadmap in doc instead of
[cloog/uuh.git] / test / reservoir / liu-zhuge1.c
blob1ed9465f4097831de8632656cc8e39db98266364
1 /* Generated from liu-zhuge1.cloog by CLooG v0.14.0 64 bits in 0.02s. */
2 /* CLooG asked for 160 KBytes. */
3 if ((M >= 0) && (N >= 0)) {
4 for (c2=-4;c2<=min(-1,3*M+N-4);c2++) {
5 for (c4=max(0,c2-3*M+4);c4<=min(c2+4,N);c4++) {
6 if ((c2-c4+4)%3 == 0) {
7 i = (c2-c4+4)/3 ;
8 S1(j = c4) ;
13 if ((M <= 1) && (M >= 0)) {
14 for (c2=0;c2<=3*M+N-4;c2++) {
15 for (c4=max(c2-3*M,0);c4<=c2;c4++) {
16 if ((c2-c4)%3 == 0) {
17 i = (c2-c4)/3 ;
18 S2(j = c4) ;
21 for (c4=c2-3*M+4;c4<=min(c2+4,N);c4++) {
22 if ((c2-c4+4)%3 == 0) {
23 i = (c2-c4+4)/3 ;
24 S1(j = c4) ;
27 for (c4=max(0,c2-3*M);c4<=c2;c4++) {
28 if ((c2-c4)%3 == 0) {
29 i = (c2-c4)/3 ;
30 S3(j = c4) ;
35 for (c2=0;c2<=min(3*M-4,N-1);c2++) {
36 for (c4=0;c4<=c2;c4++) {
37 if ((c2-c4)%3 == 0) {
38 i = (c2-c4)/3 ;
39 S2(j = c4) ;
41 if ((c2-c4+4)%3 == 0) {
42 i = (c2-c4+4)/3 ;
43 S1(j = c4) ;
46 for (c4=c2+1;c4<=min(c2+4,N);c4++) {
47 if ((c2-c4+4)%3 == 0) {
48 i = (c2-c4+4)/3 ;
49 S1(j = c4) ;
52 for (c4=0;c4<=c2;c4++) {
53 if ((c2-c4)%3 == 0) {
54 i = (c2-c4)/3 ;
55 S3(j = c4) ;
59 if (M >= 2) {
60 for (c2=3*M-3;c2<=N-1;c2++) {
61 for (c4=max(c2-3*M,0);c4<=c2-3*M+3;c4++) {
62 if ((c2-c4)%3 == 0) {
63 i = (c2-c4)/3 ;
64 S2(j = c4) ;
67 for (c4=c2-3*M+4;c4<=c2;c4++) {
68 if ((c2-c4)%3 == 0) {
69 i = (c2-c4)/3 ;
70 S2(j = c4) ;
72 if ((c2-c4+4)%3 == 0) {
73 i = (c2-c4+4)/3 ;
74 S1(j = c4) ;
77 for (c4=c2+1;c4<=min(c2+4,N);c4++) {
78 if ((c2-c4+4)%3 == 0) {
79 i = (c2-c4+4)/3 ;
80 S1(j = c4) ;
83 for (c4=max(0,c2-3*M);c4<=c2;c4++) {
84 if ((c2-c4)%3 == 0) {
85 i = (c2-c4)/3 ;
86 S3(j = c4) ;
91 if (N >= 0) {
92 for (c2=N;c2<=3*M-4;c2++) {
93 for (c4=0;c4<=N;c4++) {
94 if ((c2-c4)%3 == 0) {
95 i = (c2-c4)/3 ;
96 S2(j = c4) ;
98 if ((c2-c4+4)%3 == 0) {
99 i = (c2-c4+4)/3 ;
100 S1(j = c4) ;
103 for (c4=0;c4<=N;c4++) {
104 if ((c2-c4)%3 == 0) {
105 i = (c2-c4)/3 ;
106 S3(j = c4) ;
111 for (c2=max(3*M-3,N);c2<=3*M+N-4;c2++) {
112 for (c4=max(c2-3*M,0);c4<=c2-3*M+3;c4++) {
113 if ((c2-c4)%3 == 0) {
114 i = (c2-c4)/3 ;
115 S2(j = c4) ;
118 for (c4=c2-3*M+4;c4<=N;c4++) {
119 if ((c2-c4)%3 == 0) {
120 i = (c2-c4)/3 ;
121 S2(j = c4) ;
123 if ((c2-c4+4)%3 == 0) {
124 i = (c2-c4+4)/3 ;
125 S1(j = c4) ;
128 for (c4=max(0,c2-3*M);c4<=N;c4++) {
129 if ((c2-c4)%3 == 0) {
130 i = (c2-c4)/3 ;
131 S3(j = c4) ;
135 if ((M >= 0) && (N >= 0)) {
136 for (c2=max(3*M+N-3,0);c2<=3*M+N;c2++) {
137 for (c4=max(0,c2-3*M);c4<=min(c2,N);c4++) {
138 if ((c2-c4)%3 == 0) {
139 i = (c2-c4)/3 ;
140 S2(j = c4) ;
143 for (c4=max(0,c2-3*M);c4<=min(c2,N);c4++) {
144 if ((c2-c4)%3 == 0) {
145 i = (c2-c4)/3 ;
146 S3(j = c4) ;