2 for (int c1
= 0; c1
<= min(np1
- i
, -i
+ 1); c1
+= 1) {
6 for (int c1
= max(0, -i
+ 2); c1
<= -((-np1
+ i
+ 4294967295) % 4294967296) + 4294967295; c1
+= 1) {
9 for (int c3
= 0; c3
<= min(19, i
+ c1
- 3); c3
+= 1) {
11 for (int c5
= 0; c5
< c3
; c5
+= 1) {
20 if (i
+ c1
<= 21 && np1
+ 4294967275 >= i
&& i
+ 20 >= np1
) {
22 for (int c5
= 0; c5
< i
+ c1
- 2; c5
+= 1) {
23 S_16(c1
, i
+ c1
- 2, c5
);
24 S_17(c1
, i
+ c1
- 2, c5
);
26 S_16(c1
, i
+ c1
- 2, i
+ c1
- 2);