source/clast.c: clean up insert_for
[cloog/uuh.git] / test / vivien.c
blobbedba3f9a2b7a6ae3fd10016a3c6221aef3174a0
1 /* Generated from /home/skimo/git/cloog/test/vivien.cloog by CLooG 0.14.0-284-ga90f184 gmp bits in 0.18s. */
2 if (n >= 0) {
3 for (p1=-54*n+4;p1<=4;p1++) {
4 if (p1%2 == 0) {
5 S1((p1-2)/2);
8 if (n >= 1) {
9 S3(1);
11 if (n <= 1) {
12 S1(2);
14 if (n >= 2) {
15 S4(1,2);
16 S1(2);
17 S6(1,2);
19 for (p1=7;p1<=min(9,4*n-2);p1++) {
20 if (p1 == 8) {
21 S4(1,3);
23 if (p1 == 8) {
24 S1(3);
26 if (p1 == 8) {
27 S6(1,3);
29 if (p1 == 9) {
30 S3(2);
32 if ((p1+1)%2 == 0) {
33 S2((p1-3)/2,1);
36 for (p1=10;p1<=min(2*n+58,4*n-2);p1++) {
37 for (p2=ceild(-p1+2,4);p2<=min(floord(-p1+2*n,2),floord(-p1+5,4));p2++) {
38 if (p1%2 == 0) {
39 S4(-p2,(p1+2*p2)/2);
42 if (p1 >= 4*n-4) {
43 if (p1%2 == 0) {
44 for (p3=1;p3<=floord(p1-2*n-2,2);p3++) {
45 S5((p1-2*n)/2,n,p3);
49 for (p2=ceild(-p1+6,4);p2<=min(floord(-p1+2*n,2),floord(-p1+9,4));p2++) {
50 if (p1%2 == 0) {
51 S4(-p2,(p1+2*p2)/2);
53 for (p3=1;p3<=-p2;p3++) {
54 if (p1%2 == 0) {
55 S5(-p2+1,(p1+2*p2-2)/2,p3);
59 for (p2=ceild(-p1+10,4);p2<=min(-1,floord(-p1+2*n,2));p2++) {
60 if (p1%2 == 0) {
61 S4(-p2,(p1+2*p2)/2);
63 if (p1%2 == 0) {
64 S6(-p2+2,(p1+2*p2-4)/2);
66 for (p3=1;p3<=-p2;p3++) {
67 if (p1%2 == 0) {
68 S5(-p2+1,(p1+2*p2-2)/2,p3);
72 if ((p1 >= 2*n+4) && (p1 <= 4*n-6)) {
73 if (p1%2 == 0) {
74 S6((p1-2*n+2)/2,n-1);
75 for (p3=1;p3<=floord(p1-2*n-2,2);p3++) {
76 S5((p1-2*n)/2,n,p3);
80 if (p1 >= 2*n+6) {
81 if (p1%2 == 0) {
82 S6((p1-2*n)/2,n);
85 if (p1 <= 2*n+4) {
86 if (p1%2 == 0) {
87 S6(2,(p1-4)/2);
89 if ((p1+3)%4 == 0) {
90 S3((p1-1)/4);
92 if (p1%2 == 0) {
93 S1((p1-2)/2);
96 if (p1 >= 2*n+5) {
97 if ((p1+3)%4 == 0) {
98 S3((p1-1)/4);
100 if (p1%2 == 0) {
101 S1((p1-2)/2);
104 if (p1 <= 2*n+2) {
105 if (p1%2 == 0) {
106 S6(1,(p1-2)/2);
109 for (p2=max(1,ceild(p1-2*n-1,2));p2<=floord(p1-3,4);p2++) {
110 if ((p1+1)%2 == 0) {
111 S2((p1-2*p2-1)/2,p2);
115 if ((n >= 2) && (n <= 29)) {
116 S2(n,n-1);
118 if ((n >= 2) && (n <= 29)) {
119 S1(2*n-1);
121 if ((n >= 2) && (n <= 28)) {
122 S3(n);
124 for (p1=max(7,4*n+2);p1<=2*n+58;p1++) {
125 if (p1%2 == 0) {
126 S1((p1-2)/2);
129 for (p1=2*n+59;p1<=4*n-2;p1++) {
130 for (p2=ceild(-p1+2,4);p2<=min(floord(-p1+2*n,2),floord(-p1+5,4));p2++) {
131 if (p1%2 == 0) {
132 S4(-p2,(p1+2*p2)/2);
135 if (p1 >= 4*n-4) {
136 if (p1%2 == 0) {
137 for (p3=1;p3<=floord(p1-2*n-2,2);p3++) {
138 S5((p1-2*n)/2,n,p3);
142 for (p2=ceild(-p1+6,4);p2<=min(floord(-p1+2*n,2),floord(-p1+9,4));p2++) {
143 if (p1%2 == 0) {
144 S4(-p2,(p1+2*p2)/2);
146 for (p3=1;p3<=-p2;p3++) {
147 if (p1%2 == 0) {
148 S5(-p2+1,(p1+2*p2-2)/2,p3);
152 for (p2=ceild(-p1+10,4);p2<=floord(-p1+2*n,2);p2++) {
153 if (p1%2 == 0) {
154 S4(-p2,(p1+2*p2)/2);
156 if (p1%2 == 0) {
157 S6(-p2+2,(p1+2*p2-4)/2);
159 for (p3=1;p3<=-p2;p3++) {
160 if (p1%2 == 0) {
161 S5(-p2+1,(p1+2*p2-2)/2,p3);
165 if (p1 <= 4*n-6) {
166 if (p1%2 == 0) {
167 S6((p1-2*n+2)/2,n-1);
168 for (p3=1;p3<=floord(p1-2*n-2,2);p3++) {
169 S5((p1-2*n)/2,n,p3);
173 if (p1%2 == 0) {
174 S6((p1-2*n)/2,n);
176 if ((p1+3)%4 == 0) {
177 S3((p1-1)/4);
179 for (p2=ceild(p1-2*n-1,2);p2<=floord(p1-3,4);p2++) {
180 if ((p1+1)%2 == 0) {
181 S2((p1-2*p2-1)/2,p2);
185 if (n >= 30) {
186 S2(n,n-1);
188 if (n >= 29) {
189 S3(n);