Generate safety parentheses around compound expressions
[cloog.git] / test / vivien2.c
blob91a0292455baf58e89587c23c0bb31dc3b5c68df
1 /* Generated from ./vivien2.cloog by CLooG 0.18.1-2-g43fc508 gmp bits in 0.08s. */
2 for (p1=-54*n+4;p1<=4;p1++) {
3 if (p1%2 == 0) {
4 S1(((p1-2)/2));
7 S3(1);
8 S4(1,2);
9 S1(2);
10 S6(1,2);
11 for (p1=7;p1<=9;p1++) {
12 if (p1 == 8) {
13 S4(1,3);
15 if (p1 == 8) {
16 S1(3);
18 if (p1 == 8) {
19 S6(1,3);
21 if (p1 == 9) {
22 S3(2);
24 if ((p1+1)%2 == 0) {
25 S2(((p1-3)/2),1);
28 for (p1=10;p1<=2*n+58;p1++) {
29 p2 = ceild(-p1+2,4);
30 if (p2 <= min(floord(-p1+2*n,2),floord(-p1+5,4))) {
31 if (p1%2 == 0) {
32 S4(-p2,((p1+2*p2)/2));
35 if (p1 >= 4*n-4) {
36 if (p1%2 == 0) {
37 for (p3=1;p3<=floord(p1-2*n-2,2);p3++) {
38 S5(((p1-2*n)/2),n,p3);
42 p2 = ceild(-p1+6,4);
43 if (p2 <= min(floord(-p1+2*n,2),floord(-p1+9,4))) {
44 if (p1%2 == 0) {
45 S4(-p2,((p1+2*p2)/2));
47 for (p3=1;p3<=-p2;p3++) {
48 if (p1%2 == 0) {
49 S5((-p2+1),((p1+2*p2-2)/2),p3);
53 for (p2=ceild(-p1+10,4);p2<=min(-1,floord(-p1+2*n,2));p2++) {
54 if (p1%2 == 0) {
55 S4(-p2,((p1+2*p2)/2));
57 if (p1%2 == 0) {
58 S6((-p2+2),((p1+2*p2-4)/2));
60 for (p3=1;p3<=-p2;p3++) {
61 if (p1%2 == 0) {
62 S5((-p2+1),((p1+2*p2-2)/2),p3);
66 if ((p1 >= 2*n+4) && (p1 <= 4*n-6)) {
67 if (p1%2 == 0) {
68 S6(((p1-2*n+2)/2),(n-1));
69 for (p3=1;p3<=floord(p1-2*n-2,2);p3++) {
70 S5(((p1-2*n)/2),n,p3);
74 if (p1 >= 2*n+6) {
75 if (p1%2 == 0) {
76 S6(((p1-2*n)/2),n);
79 if (p1 <= 2*n+4) {
80 if (p1%2 == 0) {
81 S6(2,((p1-4)/2));
83 if ((p1+3)%4 == 0) {
84 S3(((p1-1)/4));
86 if (p1%2 == 0) {
87 S1(((p1-2)/2));
90 if (p1 >= 2*n+5) {
91 if ((p1+3)%4 == 0) {
92 S3(((p1-1)/4));
94 if (p1%2 == 0) {
95 S1(((p1-2)/2));
98 if (p1 <= 2*n+2) {
99 if (p1%2 == 0) {
100 S6(1,((p1-2)/2));
103 for (p2=max(1,ceild(p1-2*n-1,2));p2<=floord(p1-3,4);p2++) {
104 if ((p1+1)%2 == 0) {
105 S2(((p1-2*p2-1)/2),p2);
109 for (p1=2*n+59;p1<=4*n-2;p1++) {
110 p2 = ceild(-p1+2,4);
111 if (p2 <= min(floord(-p1+2*n,2),floord(-p1+5,4))) {
112 if (p1%2 == 0) {
113 S4(-p2,((p1+2*p2)/2));
116 if (p1 >= 4*n-4) {
117 if (p1%2 == 0) {
118 for (p3=1;p3<=floord(p1-2*n-2,2);p3++) {
119 S5(((p1-2*n)/2),n,p3);
123 p2 = ceild(-p1+6,4);
124 if (p2 <= min(floord(-p1+2*n,2),floord(-p1+9,4))) {
125 if (p1%2 == 0) {
126 S4(-p2,((p1+2*p2)/2));
128 for (p3=1;p3<=-p2;p3++) {
129 if (p1%2 == 0) {
130 S5((-p2+1),((p1+2*p2-2)/2),p3);
134 for (p2=ceild(-p1+10,4);p2<=floord(-p1+2*n,2);p2++) {
135 if (p1%2 == 0) {
136 S4(-p2,((p1+2*p2)/2));
138 if (p1%2 == 0) {
139 S6((-p2+2),((p1+2*p2-4)/2));
141 for (p3=1;p3<=-p2;p3++) {
142 if (p1%2 == 0) {
143 S5((-p2+1),((p1+2*p2-2)/2),p3);
147 if (p1 <= 4*n-6) {
148 if (p1%2 == 0) {
149 S6(((p1-2*n+2)/2),(n-1));
150 for (p3=1;p3<=floord(p1-2*n-2,2);p3++) {
151 S5(((p1-2*n)/2),n,p3);
155 if (p1%2 == 0) {
156 S6(((p1-2*n)/2),n);
158 if ((p1+3)%4 == 0) {
159 S3(((p1-1)/4));
161 for (p2=ceild(p1-2*n-1,2);p2<=floord(p1-3,4);p2++) {
162 if ((p1+1)%2 == 0) {
163 S2(((p1-2*p2-1)/2),p2);
167 S2(n,(n-1));
168 S3(n);