· 6 years ago · May 15, 2019, 08:02 PM
1/*
2 * Decompiled with CFR <Could not determine version>.
3 *
4 * Could not load the following classes:
5 * L
6 * R
7 * T
8 * W
9 * aM
10 * ad
11 * bp
12 * dS
13 * ee
14 */
15import java.lang.invoke.CallSite;
16import java.lang.invoke.MethodHandle;
17import java.lang.invoke.MethodHandles;
18import java.lang.invoke.MethodType;
19import java.lang.invoke.MutableCallSite;
20import java.security.Key;
21import java.security.spec.AlgorithmParameterSpec;
22import java.security.spec.KeySpec;
23import java.util.HashMap;
24import java.util.Map;
25import javax.crypto.Cipher;
26import javax.crypto.SecretKey;
27import javax.crypto.SecretKeyFactory;
28import javax.crypto.spec.DESKeySpec;
29import javax.crypto.spec.IvParameterSpec;
30
31/*
32 * Duplicate member names - consider using --renamedupmembers true
33 * Exception performing whole class analysis ignored.
34 */
35public final class T
36extends R {
37 public static int E;
38 public static int v;
39 public static int w;
40 public static int n;
41 public static int q;
42 public static int f;
43 public static int a;
44 public static int t;
45 public static int[] A;
46 public static int[] g;
47 public static int[] C;
48 public static int[] u;
49 public static W[] z;
50 public static int[] j;
51 public static int m;
52 private static int o;
53 private static int[] l;
54 private static int[] r;
55 private static boolean[] B;
56 private static int[][] D;
57 private static int s;
58 private static int[] y;
59 private static int[][] x;
60 private static int p;
61 private static int[][] k;
62 private static final long F;
63 private static final String[] G;
64 private static final String[] H;
65 private static final Map I;
66
67 public static void d() {
68 A = null;
69 g = null;
70 r = null;
71 C = null;
72 u = null;
73 z = null;
74 B = null;
75 y = null;
76 k = null;
77 x = null;
78 j = null;
79 D = null;
80 }
81
82 public static int b(int n, int n2, int n3, int n4) {
83 return n3 * n2 - n4 * n >> 16;
84 }
85
86 public static int c(int n, int n2, int n3, int n4) {
87 return n * n3 + n4 * n2 >> 16;
88 }
89
90 public static int a(int n, int n2, int n3, int n4) {
91 return n * n3 + n4 * n2 >> 16;
92 }
93
94 public static int e(int n, int n2, int n3, int n4) {
95 return n3 * n2 - n4 * n >> 16;
96 }
97
98 public static int f(int n, int n2, int n3, int n4) {
99 return n * n3 - n4 * n2 >> 16;
100 }
101
102 public static int d(int n, int n2, int n3, int n4) {
103 return n4 * n + n3 * n2 >> 16;
104 }
105
106 private static int a(int n) {
107 --n;
108 n |= n >>> 1;
109 n |= n >>> 2;
110 n |= n >>> 4;
111 n |= n >>> 8;
112 n |= n >>> 16;
113 return n + 1;
114 }
115
116 public static void f() {
117 T.a((int)e, (int)d, (int)i, (int)c);
118 }
119
120 private static void a(int n, int n2, int n3, int n4) {
121 T.n = n3 - n;
122 o = n4 - n2;
123 T.g();
124 String[] arrstring = R.b();
125 if (r == null || r.length < o) {
126 r = new int[T.a((int)o)];
127 }
128 int n5 = n2 * b + n;
129 int n6 = 0;
130 do {
131 if (n6 >= o) return;
132 T.r[n6] = n5;
133 n5 += b;
134 ++n6;
135 } while (arrstring == null);
136 }
137
138 public static void a(int n, int n2) {
139 int n3 = r[0];
140 int n4 = n3 / b;
141 int n5 = n3 - n4 * b;
142 v = n - n5;
143 w = n2 - n4;
144 q = -v;
145 f = T.n - v;
146 a = -w;
147 t = o - w;
148 }
149
150 public static void g() {
151 v = n / 2;
152 w = o / 2;
153 q = -v;
154 f = n - v;
155 a = -w;
156 t = o - w;
157 }
158
159 public static void e() {
160 k = null;
161 String[] arrstring = R.b();
162 int n = 0;
163 do {
164 if (n >= 55) return;
165 T.x[n] = null;
166 ++n;
167 } while (arrstring == null);
168 }
169
170 public static void b() {
171 String[] arrstring = R.b();
172 if (k != null) return;
173 p = 20;
174 k = new int[p][65536];
175 int n = 0;
176 do {
177 if (n >= 55) return;
178 T.x[n] = null;
179 ++n;
180 } while (arrstring == null);
181 }
182
183 public static void a(dS dS2, short s, byte[][] arrby, int n, int n2) {
184 long l = ((long)s << 48 | (long)n << 32 >>> 16 | (long)n2 << 48 >>> 48) ^ F;
185 long l2 = l ^ 118433953040331L;
186 int n3 = (int)(l2 >>> 48);
187 int n4 = (int)(l2 << 16 >>> 32);
188 int n5 = (int)(l2 << 48 >>> 48);
189 T.s = 0;
190 String[] arrstring = R.b();
191 int n6 = 0;
192 do {
193 block12 : {
194 block16 : {
195 block15 : {
196 block10 : {
197 int n7;
198 byte[][] arrarrby;
199 block14 : {
200 block13 : {
201 block11 : {
202 block9 : {
203 if (n6 >= 55) return;
204 if (n6 != 50) break block11;
205 arrarrby = new byte[15][];
206 for (n7 = 0; n7 < arrarrby.length; ++n7) {
207 arrarrby[n7] = arrby[aM.f((String)((String)((Object)T.a((int)17660, (long)(1628551055916352283L ^ l))) + n7 + (String)((Object)T.a((int)27839, (long)(7648001055107476318L ^ l)))))];
208 if (arrstring == null) {
209 if (arrstring == null) continue;
210 }
211 break block9;
212 }
213 T.z[n6] = new W((byte[][])arrarrby, 30);
214 }
215 if (arrstring == null) break block12;
216 }
217 if (n6 != 51) break block13;
218 int n8 = aM.f((String)((Object)T.a((int)29288, (long)(5251445495671092622L ^ l))));
219 byte[] arrby2 = arrby[n8];
220 T.z[n6] = new W(arrby2);
221 if (arrstring == null) break block12;
222 }
223 if (n6 != 52) break block14;
224 int n9 = aM.f((String)((Object)T.a((int)24189, (long)(7658750187125496222L ^ l))));
225 byte[] arrby3 = arrby[n9];
226 T.z[n6] = new W(arrby3);
227 if (arrstring == null) break block12;
228 }
229 if (n6 != 53) break block15;
230 arrarrby = new byte[16][];
231 for (n7 = 0; n7 < arrarrby.length; ++n7) {
232 arrarrby[n7] = arrby[aM.f((String)((String)((Object)T.a((int)21273, (long)(2391860263313724669L ^ l))) + n7 + (String)((Object)T.a((int)19974, (long)(5751535731816352227L ^ l)))))];
233 if (arrstring == null) {
234 if (arrstring == null) continue;
235 }
236 break block10;
237 }
238 T.z[n6] = new W((byte[][])arrarrby, 2);
239 }
240 if (arrstring == null) break block12;
241 }
242 if (n6 != 54) break block16;
243 int n10 = aM.f((String)((Object)T.a((int)17547, (long)(4573526241918501739L ^ l))));
244 byte[] arrby4 = arrby[n10];
245 T.z[n6] = new W(arrby4);
246 if (arrstring == null) break block12;
247 }
248 T.z[n6] = new W(dS2, (short)n3, String.valueOf(n6), 0, n4, (short)n5);
249 }
250 z[n6].e();
251 ++T.s;
252 ++n6;
253 } while (arrstring == null);
254 }
255
256 public static void a(double d) {
257 int n;
258 String[] arrstring;
259 block24 : {
260 int n2;
261 block23 : {
262 int n3 = 0;
263 arrstring = R.b();
264 n = 0;
265 block0 : do {
266 int n4 = n;
267 block1 : while (n4 < 512) {
268 double d2 = (double)(n / 8) / 64.0 + 0.0078125;
269 double d3 = (double)(n & 7) / 8.0 + 0.0625;
270 n2 = 0;
271 if (arrstring != null) break block23;
272 for (int i = v5838; i < 128; ++i) {
273 double d4;
274 double d5;
275 double d6;
276 block25 : {
277 double d7;
278 block38 : {
279 double d8;
280 double d9;
281 block37 : {
282 block36 : {
283 block33 : {
284 block35 : {
285 double d10;
286 block34 : {
287 block32 : {
288 block29 : {
289 block31 : {
290 double d11;
291 block30 : {
292 block28 : {
293 double d12;
294 block27 : {
295 block26 : {
296 d5 = d12 = (double)i / 128.0;
297 d6 = d12;
298 d4 = d12;
299 n4 = (int)(d3 DCMPL 0.0);
300 if (arrstring != null) continue block1;
301 if (n4 == 0) break block25;
302 if (!(d12 < 0.5)) break block26;
303 d9 = d12 * (1.0 + d3);
304 if (arrstring == null) break block27;
305 }
306 d9 = d12 + d3 - d12 * d3;
307 }
308 d7 = 2.0 * d12 - d9;
309 d11 = d2 + 0.3333333333333333;
310 if (d11 > 1.0) {
311 d11 -= 1.0;
312 }
313 d10 = d2;
314 d8 = d2 - 0.3333333333333333;
315 if (d8 < 0.0) {
316 d8 += 1.0;
317 }
318 if (!(6.0 * d11 < 1.0)) break block28;
319 d5 = d7 + (d9 - d7) * 6.0 * d11;
320 if (arrstring == null) break block29;
321 }
322 if (!(2.0 * d11 < 1.0)) break block30;
323 d5 = d9;
324 if (arrstring == null) break block29;
325 }
326 if (!(3.0 * d11 < 2.0)) break block31;
327 d5 = d7 + (d9 - d7) * (0.6666666666666666 - d11) * 6.0;
328 if (arrstring == null) break block29;
329 }
330 d5 = d7;
331 }
332 if (!(6.0 * d10 < 1.0)) break block32;
333 d6 = d7 + (d9 - d7) * 6.0 * d10;
334 if (arrstring == null) break block33;
335 }
336 if (!(2.0 * d10 < 1.0)) break block34;
337 d6 = d9;
338 if (arrstring == null) break block33;
339 }
340 if (!(3.0 * d10 < 2.0)) break block35;
341 d6 = d7 + (d9 - d7) * (0.6666666666666666 - d10) * 6.0;
342 if (arrstring == null) break block33;
343 }
344 d6 = d7;
345 }
346 if (!(6.0 * d8 < 1.0)) break block36;
347 d4 = d7 + (d9 - d7) * 6.0 * d8;
348 if (arrstring == null) break block25;
349 }
350 if (!(2.0 * d8 < 1.0)) break block37;
351 d4 = d9;
352 if (arrstring == null) break block25;
353 }
354 if (!(3.0 * d8 < 2.0)) break block38;
355 d4 = d7 + (d9 - d7) * (0.6666666666666666 - d8) * 6.0;
356 if (arrstring == null) break block25;
357 }
358 d4 = d7;
359 }
360 int n5 = (int)(d5 * 256.0);
361 int n6 = (int)(d6 * 256.0);
362 int n7 = (int)(d4 * 256.0);
363 int n8 = (n5 << 16) + (n6 << 8) + n7;
364 if ((n8 = T.a((int)n8, (double)d)) == 0) {
365 n8 = 1;
366 }
367 ad.a3[n3++] = n8;
368 if (arrstring == null) continue;
369 }
370 ++n;
371 if (arrstring == null) continue block0;
372 }
373 break;
374 } while (true);
375 n2 = 0;
376 }
377 n = n2;
378 block3 : do {
379 int n9 = n;
380 block4 : while (n9 < 55) {
381 int[] arrn;
382 if (arrstring != null) break block24;
383 if (z[n] != null && (arrn = T.z[n].g) != null) {
384 T.D[n] = new int[arrn.length];
385 for (int i = 0; i < arrn.length; ++i) {
386 T.D[n][i] = T.a((int)arrn[i], (double)d);
387 n9 = D[n][i] & 16316671;
388 if (arrstring != null) continue block4;
389 if (n9 != 0 || i == 0) continue;
390 T.D[n][i] = 1;
391 if (arrstring == null) continue;
392 }
393 }
394 ++n;
395 if (arrstring == null) continue block3;
396 }
397 break;
398 } while (true);
399 n = 0;
400 }
401 do {
402 if (n >= 55) return;
403 T.b((int)n);
404 ++n;
405 } while (arrstring == null);
406 }
407
408 private static int a(int n, double d) {
409 double d2 = (double)(n >> 16) / 256.0;
410 double d3 = (double)(n >> 8 & 255) / 256.0;
411 double d4 = (double)(n & 255) / 256.0;
412 d2 = Math.pow(d2, d);
413 d3 = Math.pow(d3, d);
414 d4 = Math.pow(d4, d);
415 int n2 = (int)(d2 * 256.0);
416 int n3 = (int)(d3 * 256.0);
417 int n4 = (int)(d4 * 256.0);
418 return (n2 << 16) + (n3 << 8) + n4;
419 }
420
421 public static int c(int n) {
422 int n2;
423 block6 : {
424 String[] arrstring = R.b();
425 if (n > z.length) {
426 n = z.length - 1;
427 }
428 if (n >= 55) {
429 return T.z[n].h[0][0];
430 }
431 if (y[n] != 0) {
432 return y[n];
433 }
434 int n3 = 0;
435 int n4 = 0;
436 int n5 = 0;
437 int n6 = D[n].length;
438 for (n2 = 0; n2 < n6; n3 += T.D[n][n2] >> 16 & 255, n4 += T.D[n][n2] >> 8 & 255, n5 += T.D[n][n2] & 255, ++n2) {
439 if (arrstring == null) {
440 if (arrstring == null) continue;
441 }
442 break block6;
443 }
444 n2 = (n3 / n6 << 16) + (n4 / n6 << 8) + n5 / n6;
445 }
446 if ((n2 = T.a((int)n2, (double)1.4)) == 0) {
447 n2 = 1;
448 }
449 T.y[n] = n2;
450 return n2;
451 }
452
453 public static void b(int n) {
454 if (x[n] == null) {
455 return;
456 }
457 T.k[T.p++] = x[n];
458 T.x[n] = null;
459 }
460
461 /*
462 * Unable to fully structure code
463 */
464 private static int[] d(int var0) {
465 block15 : {
466 block19 : {
467 block18 : {
468 block17 : {
469 block14 : {
470 block16 : {
471 var1_1 = R.b();
472 if (aM.S().aj().hdWater && var0 == 1) {
473 var0 = 53;
474 }
475 if (var0 >= T.z.length) {
476 return null;
477 }
478 var2_2 = null;
479 if (T.z[var0] != null) {
480 var2_2 = T.z[var0].a();
481 }
482 ++T.m;
483 if (T.x[var0] != null) {
484 return T.x[var0];
485 }
486 if (T.p <= 0) break block16;
487 var3_3 = T.k[--T.p];
488 T.k[T.p] = null;
489 if (var1_1 == null) break block17;
490 }
491 var4_4 = 0;
492 var5_6 = -1;
493 for (var6_8 = 0; var6_8 < T.s; ++var6_8) {
494 v0 = T.x[var6_8];
495 if (var1_1 == null) {
496 if (v0 == null || T.j[var6_8] >= var4_4 && var5_6 != -1) continue;
497 var4_4 = T.j[var6_8];
498 var5_6 = var6_8;
499 if (var1_1 == null) continue;
500 }
501 break block14;
502 }
503 v0 = T.x[var5_6];
504 }
505 var3_3 = v0;
506 T.x[var5_6] = null;
507 }
508 T.x[var0] = var3_3;
509 var4_5 = T.z[var0];
510 var5_7 = T.D[var0];
511 if (var4_5.f != 64) break block18;
512 for (var6_8 = 0; var6_8 < 128; ++var6_8) {
513 v1 = 0;
514 if (var1_1 != null) break block15;
515 for (var7_9 = v11325; var7_9 < 128; ++var7_9) {
516 v2 = var3_3;
517 v3 = var7_9 + (var6_8 << 7);
518 if (var1_1 == null) {
519 v2[v3] = var2_2 == null ? var5_7[var4_5.i[(var7_9 >> 1) + (var6_8 >> 1 << 6)]] : var2_2[(var7_9 >> 1) + (var6_8 >> 1 << 6)];
520 if (var1_1 == null) continue;
521 }
522 ** GOTO lbl67
523 }
524 if (var1_1 == null) continue;
525 }
526 if (var1_1 == null) break block19;
527 }
528 for (var6_8 = 0; var6_8 < 16384; ++var6_8) {
529 v2 = var3_3;
530 v3 = var6_8;
531 if (var1_1 == null) {
532 v2[v3] = var2_2 == null ? var5_7[var4_5.i[var6_8]] : var2_2[var6_8];
533 if (var1_1 == null) continue;
534 }
535 ** GOTO lbl67
536 }
537 }
538 T.B[var0] = false;
539 v1 = var6_8 = 0;
540 }
541 while (var6_8 < 16384) {
542 v4 = var3_3;
543 v5 = var6_8;
544 v4[v5] = v4[v5] & 16316671;
545 v2 = var3_3;
546 if (var1_1 != null) return v2;
547 v3 = var6_8;
548lbl67: // 3 sources:
549 if ((var7_9 = v2[v3]) == 0) {
550 T.B[var0] = true;
551 }
552 var3_3[16384 + var6_8] = var7_9 - (var7_9 >>> 3) & 16316671;
553 var3_3[32768 + var6_8] = var7_9 - (var7_9 >>> 2) & 16316671;
554 var3_3[49152 + var6_8] = var7_9 - (var7_9 >>> 2) - (var7_9 >>> 3) & 16316671;
555 ++var6_8;
556 if (var1_1 == null) continue;
557 }
558 v2 = var3_3;
559 return v2;
560 }
561
562 public static void a(int n, int n2, int n3, int n4, int n5, int n6, int n7, int n8, int n9, int n10, boolean bl, boolean bl2) {
563 int n11;
564 int n12;
565 int n13;
566 int n14;
567 int n15;
568 int n16;
569 int n17;
570 String[] arrstring;
571 int n18;
572 int n19;
573 int n20;
574 block91 : {
575 block90 : {
576 block89 : {
577 block88 : {
578 block87 : {
579 block86 : {
580 n20 = n5 - n4;
581 arrstring = R.b();
582 n13 = n2 - n;
583 n18 = n6 - n4;
584 n19 = n3 - n;
585 n15 = n8 - n7;
586 n17 = n9 - n7;
587 if (n3 == n2) break block86;
588 n12 = (n6 - n5 << 14) / (n3 - n2);
589 if (arrstring == null) break block87;
590 }
591 n12 = 0;
592 }
593 if (n == n2) break block88;
594 n14 = (n20 << 14) / n13;
595 if (arrstring == null) break block89;
596 }
597 n14 = 0;
598 }
599 if (n == n3) break block90;
600 n16 = (n18 << 14) / n19;
601 if (arrstring == null) break block91;
602 }
603 n16 = 0;
604 }
605 if ((n11 = n20 * n19 - n18 * n13) == 0) return;
606 int n21 = (n15 * n19 - n17 * n13 << 8) / n11;
607 int n22 = (n17 * n20 - n15 * n18 << 8) / n11;
608 if (n <= n2 && n <= n3) {
609 if (n >= c) return;
610 if (n2 > c) {
611 n2 = c;
612 }
613 if (n3 > c) {
614 n3 = c;
615 }
616 n7 = n21 + ((n7 << 8) - n4 * n21);
617 if (n2 < n3) {
618 n6 = n4 <<= 14;
619 if (n < 0) {
620 n6 -= n * n16;
621 n4 -= n * n14;
622 n7 -= n * n22;
623 n = 0;
624 }
625 n5 <<= 14;
626 if (n2 < 0) {
627 n5 -= n12 * n2;
628 n2 = 0;
629 }
630 if (n != n2 && n16 < n14 || n == n2 && n16 > n12) {
631 n3 -= n2;
632 n2 -= n;
633 n = r[n];
634 block0 : do {
635 int n23;
636 if (--n2 < 0) {
637 do {
638 n23 = --n3;
639 if (arrstring != null) continue block0;
640 if (n23 < 0) {
641 if (arrstring != null) continue;
642 return;
643 }
644 T.a((int[])h, (int)n, (int)(n6 >> 14), (int)(n5 >> 14), (int)n7, (int)n21, (int)n10, (boolean)bl, (boolean)bl2);
645 n6 += n16;
646 n5 += n12;
647 n7 += n22;
648 n += b;
649 } while (arrstring == null);
650 }
651 T.a((int[])h, (int)n, (int)(n6 >> 14), (int)(n4 >> 14), (int)n7, (int)n21, (int)n10, (boolean)bl, (boolean)bl2);
652 n6 += n16;
653 n4 += n14;
654 n7 += n22;
655 n23 = n = n + b;
656 } while (arrstring == null);
657 }
658 n3 -= n2;
659 n2 -= n;
660 n = r[n];
661 block2 : do {
662 int n24;
663 if (--n2 < 0) {
664 do {
665 n24 = --n3;
666 if (arrstring != null) continue block2;
667 if (n24 < 0) {
668 if (arrstring != null) continue;
669 return;
670 }
671 T.a((int[])h, (int)n, (int)(n5 >> 14), (int)(n6 >> 14), (int)n7, (int)n21, (int)n10, (boolean)bl, (boolean)bl2);
672 n6 += n16;
673 n5 += n12;
674 n7 += n22;
675 n += b;
676 } while (arrstring == null);
677 }
678 T.a((int[])h, (int)n, (int)(n4 >> 14), (int)(n6 >> 14), (int)n7, (int)n21, (int)n10, (boolean)bl, (boolean)bl2);
679 n6 += n16;
680 n4 += n14;
681 n7 += n22;
682 n24 = n = n + b;
683 } while (arrstring == null);
684 }
685 n5 = n4 <<= 14;
686 if (n < 0) {
687 n5 -= n * n16;
688 n4 -= n * n14;
689 n7 -= n * n22;
690 n = 0;
691 }
692 n6 <<= 14;
693 if (n3 < 0) {
694 n6 -= n12 * n3;
695 n3 = 0;
696 }
697 if (n != n3 && n16 < n14 || n == n3 && n12 > n14) {
698 n2 -= n3;
699 n3 -= n;
700 n = r[n];
701 block4 : do {
702 int n25;
703 if (--n3 < 0) {
704 do {
705 n25 = --n2;
706 if (arrstring != null) continue block4;
707 if (n25 < 0) {
708 if (arrstring != null) continue;
709 return;
710 }
711 T.a((int[])h, (int)n, (int)(n6 >> 14), (int)(n4 >> 14), (int)n7, (int)n21, (int)n10, (boolean)bl, (boolean)bl2);
712 n6 += n12;
713 n4 += n14;
714 n7 += n22;
715 n += b;
716 } while (arrstring == null);
717 }
718 T.a((int[])h, (int)n, (int)(n5 >> 14), (int)(n4 >> 14), (int)n7, (int)n21, (int)n10, (boolean)bl, (boolean)bl2);
719 n5 += n16;
720 n4 += n14;
721 n7 += n22;
722 n25 = n = n + b;
723 } while (arrstring == null);
724 }
725 n2 -= n3;
726 n3 -= n;
727 n = r[n];
728 block6 : do {
729 int n26;
730 if (--n3 < 0) {
731 do {
732 n26 = --n2;
733 if (arrstring != null) continue block6;
734 if (n26 < 0) {
735 if (arrstring != null) continue;
736 return;
737 }
738 T.a((int[])h, (int)n, (int)(n4 >> 14), (int)(n6 >> 14), (int)n7, (int)n21, (int)n10, (boolean)bl, (boolean)bl2);
739 n6 += n12;
740 n4 += n14;
741 n7 += n22;
742 n += b;
743 } while (arrstring == null);
744 }
745 T.a((int[])h, (int)n, (int)(n4 >> 14), (int)(n5 >> 14), (int)n7, (int)n21, (int)n10, (boolean)bl, (boolean)bl2);
746 n5 += n16;
747 n4 += n14;
748 n7 += n22;
749 n26 = n = n + b;
750 } while (arrstring == null);
751 }
752 if (n2 <= n3) {
753 if (n2 >= c) return;
754 if (n3 > c) {
755 n3 = c;
756 }
757 if (n > c) {
758 n = c;
759 }
760 n8 = n21 + ((n8 << 8) - n21 * n5);
761 if (n3 < n) {
762 n4 = n5 <<= 14;
763 if (n2 < 0) {
764 n4 -= n14 * n2;
765 n5 -= n12 * n2;
766 n8 -= n22 * n2;
767 n2 = 0;
768 }
769 n6 <<= 14;
770 if (n3 < 0) {
771 n6 -= n16 * n3;
772 n3 = 0;
773 }
774 if (n3 != n2 && n14 < n12 || n3 == n2 && n14 > n16) {
775 n -= n3;
776 n3 -= n2;
777 n2 = r[n2];
778 block8 : do {
779 int n27;
780 if (--n3 < 0) {
781 do {
782 n27 = --n;
783 if (arrstring != null) continue block8;
784 if (n27 < 0) {
785 if (arrstring != null) continue;
786 return;
787 }
788 T.a((int[])h, (int)n2, (int)(n4 >> 14), (int)(n6 >> 14), (int)n8, (int)n21, (int)n10, (boolean)bl, (boolean)bl2);
789 n4 += n14;
790 n6 += n16;
791 n8 += n22;
792 n2 += b;
793 } while (arrstring == null);
794 }
795 T.a((int[])h, (int)n2, (int)(n4 >> 14), (int)(n5 >> 14), (int)n8, (int)n21, (int)n10, (boolean)bl, (boolean)bl2);
796 n4 += n14;
797 n5 += n12;
798 n8 += n22;
799 n27 = n2 = n2 + b;
800 } while (arrstring == null);
801 }
802 n -= n3;
803 n3 -= n2;
804 n2 = r[n2];
805 block10 : do {
806 int n28;
807 if (--n3 < 0) {
808 do {
809 n28 = --n;
810 if (arrstring != null) continue block10;
811 if (n28 < 0) {
812 if (arrstring != null) continue;
813 return;
814 }
815 T.a((int[])h, (int)n2, (int)(n6 >> 14), (int)(n4 >> 14), (int)n8, (int)n21, (int)n10, (boolean)bl, (boolean)bl2);
816 n4 += n14;
817 n6 += n16;
818 n8 += n22;
819 n2 += b;
820 } while (arrstring == null);
821 }
822 T.a((int[])h, (int)n2, (int)(n5 >> 14), (int)(n4 >> 14), (int)n8, (int)n21, (int)n10, (boolean)bl, (boolean)bl2);
823 n4 += n14;
824 n5 += n12;
825 n8 += n22;
826 n28 = n2 = n2 + b;
827 } while (arrstring == null);
828 }
829 n6 = n5 <<= 14;
830 if (n2 < 0) {
831 n6 -= n14 * n2;
832 n5 -= n12 * n2;
833 n8 -= n22 * n2;
834 n2 = 0;
835 }
836 n4 <<= 14;
837 if (n < 0) {
838 n4 -= n * n16;
839 n = 0;
840 }
841 if (n14 < n12) {
842 n3 -= n;
843 n -= n2;
844 n2 = r[n2];
845 block12 : do {
846 int n29;
847 if (--n < 0) {
848 do {
849 n29 = --n3;
850 if (arrstring != null) continue block12;
851 if (n29 < 0) {
852 if (arrstring != null) continue;
853 return;
854 }
855 T.a((int[])h, (int)n2, (int)(n4 >> 14), (int)(n5 >> 14), (int)n8, (int)n21, (int)n10, (boolean)bl, (boolean)bl2);
856 n4 += n16;
857 n5 += n12;
858 n8 += n22;
859 n2 += b;
860 } while (arrstring == null);
861 }
862 T.a((int[])h, (int)n2, (int)(n6 >> 14), (int)(n5 >> 14), (int)n8, (int)n21, (int)n10, (boolean)bl, (boolean)bl2);
863 n6 += n14;
864 n5 += n12;
865 n8 += n22;
866 n29 = n2 = n2 + b;
867 } while (arrstring == null);
868 }
869 n3 -= n;
870 n -= n2;
871 n2 = r[n2];
872 block14 : do {
873 int n30;
874 if (--n < 0) {
875 do {
876 n30 = --n3;
877 if (arrstring != null) continue block14;
878 if (n30 < 0) {
879 if (arrstring != null) continue;
880 return;
881 }
882 T.a((int[])h, (int)n2, (int)(n5 >> 14), (int)(n4 >> 14), (int)n8, (int)n21, (int)n10, (boolean)bl, (boolean)bl2);
883 n4 += n16;
884 n5 += n12;
885 n8 += n22;
886 n2 += b;
887 } while (arrstring == null);
888 }
889 T.a((int[])h, (int)n2, (int)(n5 >> 14), (int)(n6 >> 14), (int)n8, (int)n21, (int)n10, (boolean)bl, (boolean)bl2);
890 n6 += n14;
891 n5 += n12;
892 n8 += n22;
893 n30 = n2 = n2 + b;
894 } while (arrstring == null);
895 }
896 if (n3 >= c) return;
897 if (n > c) {
898 n = c;
899 }
900 if (n2 > c) {
901 n2 = c;
902 }
903 n9 = n21 + ((n9 << 8) - n6 * n21);
904 if (n < n2) {
905 n5 = n6 <<= 14;
906 if (n3 < 0) {
907 n5 -= n12 * n3;
908 n6 -= n16 * n3;
909 n9 -= n22 * n3;
910 n3 = 0;
911 }
912 n4 <<= 14;
913 if (n < 0) {
914 n4 -= n * n14;
915 n = 0;
916 }
917 if (n12 < n16) {
918 n2 -= n;
919 n -= n3;
920 n3 = r[n3];
921 block16 : do {
922 int n31;
923 if (--n < 0) {
924 do {
925 n31 = --n2;
926 if (arrstring != null) continue block16;
927 if (n31 < 0) {
928 if (arrstring != null) continue;
929 return;
930 }
931 T.a((int[])h, (int)n3, (int)(n5 >> 14), (int)(n4 >> 14), (int)n9, (int)n21, (int)n10, (boolean)bl, (boolean)bl2);
932 n5 += n12;
933 n4 += n14;
934 n9 += n22;
935 n3 += b;
936 } while (arrstring == null);
937 }
938 T.a((int[])h, (int)n3, (int)(n5 >> 14), (int)(n6 >> 14), (int)n9, (int)n21, (int)n10, (boolean)bl, (boolean)bl2);
939 n5 += n12;
940 n6 += n16;
941 n9 += n22;
942 n31 = n3 = n3 + b;
943 } while (arrstring == null);
944 }
945 n2 -= n;
946 n -= n3;
947 n3 = r[n3];
948 block18 : do {
949 int n32;
950 if (--n < 0) {
951 do {
952 n32 = --n2;
953 if (arrstring != null) continue block18;
954 if (n32 < 0) {
955 if (arrstring != null) continue;
956 return;
957 }
958 T.a((int[])h, (int)n3, (int)(n4 >> 14), (int)(n5 >> 14), (int)n9, (int)n21, (int)n10, (boolean)bl, (boolean)bl2);
959 n5 += n12;
960 n4 += n14;
961 n9 += n22;
962 n3 += b;
963 } while (arrstring == null);
964 }
965 T.a((int[])h, (int)n3, (int)(n6 >> 14), (int)(n5 >> 14), (int)n9, (int)n21, (int)n10, (boolean)bl, (boolean)bl2);
966 n5 += n12;
967 n6 += n16;
968 n9 += n22;
969 n32 = n3 = n3 + b;
970 } while (arrstring == null);
971 }
972 n4 = n6 <<= 14;
973 if (n3 < 0) {
974 n4 -= n12 * n3;
975 n6 -= n16 * n3;
976 n9 -= n22 * n3;
977 n3 = 0;
978 }
979 n5 <<= 14;
980 if (n2 < 0) {
981 n5 -= n14 * n2;
982 n2 = 0;
983 }
984 if (n12 < n16) {
985 n -= n2;
986 n2 -= n3;
987 n3 = r[n3];
988 block20 : do {
989 int n33;
990 if (--n2 < 0) {
991 do {
992 n33 = --n;
993 if (arrstring != null) continue block20;
994 if (n33 < 0) {
995 if (arrstring != null) continue;
996 return;
997 }
998 T.a((int[])h, (int)n3, (int)(n5 >> 14), (int)(n6 >> 14), (int)n9, (int)n21, (int)n10, (boolean)bl, (boolean)bl2);
999 n5 += n14;
1000 n6 += n16;
1001 n9 += n22;
1002 n3 += b;
1003 } while (arrstring == null);
1004 }
1005 T.a((int[])h, (int)n3, (int)(n4 >> 14), (int)(n6 >> 14), (int)n9, (int)n21, (int)n10, (boolean)bl, (boolean)bl2);
1006 n4 += n12;
1007 n6 += n16;
1008 n9 += n22;
1009 n33 = n3 = n3 + b;
1010 } while (arrstring == null);
1011 }
1012 n -= n2;
1013 n2 -= n3;
1014 n3 = r[n3];
1015 block22 : do {
1016 int n34;
1017 if (--n2 < 0) {
1018 do {
1019 n34 = --n;
1020 if (arrstring != null) continue block22;
1021 if (n34 < 0) {
1022 if (arrstring != null) continue;
1023 return;
1024 }
1025 T.a((int[])h, (int)n3, (int)(n6 >> 14), (int)(n5 >> 14), (int)n9, (int)n21, (int)n10, (boolean)bl, (boolean)bl2);
1026 n5 += n14;
1027 n6 += n16;
1028 n9 += n22;
1029 n3 += b;
1030 } while (arrstring == null);
1031 }
1032 T.a((int[])h, (int)n3, (int)(n6 >> 14), (int)(n4 >> 14), (int)n9, (int)n21, (int)n10, (boolean)bl, (boolean)bl2);
1033 n4 += n12;
1034 n6 += n16;
1035 n9 += n22;
1036 n34 = n3 = n3 + b;
1037 } while (arrstring == null);
1038 }
1039
1040 /*
1041 * Unable to fully structure code
1042 */
1043 private static void a(int[] var0, int var1_1, int var2_2, int var3_3, int var4_4, int var5_5, int var6_6, boolean var7_7, boolean var8_8) {
1044 block14 : {
1045 block16 : {
1046 block15 : {
1047 var9_9 = R.b();
1048 if (var7_7) {
1049 if (var3_3 > T.n) {
1050 var3_3 = T.n;
1051 }
1052 if (var2_2 < 0) {
1053 var2_2 = 0;
1054 }
1055 }
1056 if (var2_2 >= var3_3) return;
1057 var1_1 += var2_2;
1058 var4_4 += var2_2 * var5_5;
1059 if (!var8_8) break block14;
1060 var10_10 = var3_3 - var2_2 >> 2;
1061 var5_5 <<= 2;
1062 if (var6_6 != 0) break block15;
1063 if (var10_10 <= 0) ** GOTO lbl25
1064 block0 : do {
1065 v0 = T.C[var4_4 >> 8];
1066 do {
1067 var11_11 = v0;
1068 var4_4 += var5_5;
1069 var0[var1_1++] = var11_11;
1070 var0[var1_1++] = var11_11;
1071 var0[var1_1++] = var11_11;
1072 var0[var1_1++] = var11_11;
1073 if (--var10_10 > 0) continue block0;
1074lbl25: // 2 sources:
1075 v0 = var10_10 = var3_3 - var2_2 & 3;
1076 } while (var9_9 != null);
1077 break;
1078 } while (true);
1079 if (v0 <= 0) break block16;
1080 var11_11 = T.C[var4_4 >> 8];
1081 block2 : do {
1082 var0[var1_1++] = var11_11;
1083 do {
1084 if (--var10_10 > 0) continue block2;
1085 } while (var9_9 != null);
1086 break;
1087 } while (true);
1088 if (var9_9 == null) break block16;
1089 }
1090 var11_11 = 256 - var6_6;
1091 if (var10_10 <= 0) ** GOTO lbl53
1092 block4 : do {
1093 v1 = T.C[var4_4 >> 8];
1094 do {
1095 var12_12 = v1;
1096 var4_4 += var5_5;
1097 var12_12 = (var11_11 * (var12_12 & 65280) >> 8 & 65280) + (var11_11 * (var12_12 & 16711935) >> 8 & 16711935);
1098 var13_13 = var0[var1_1];
1099 var0[var1_1++] = ((var13_13 & 16711935) * var6_6 >> 8 & 16711935) + var12_12 + (var6_6 * (var13_13 & 65280) >> 8 & 65280);
1100 var13_13 = var0[var1_1];
1101 var0[var1_1++] = ((var13_13 & 16711935) * var6_6 >> 8 & 16711935) + var12_12 + (var6_6 * (var13_13 & 65280) >> 8 & 65280);
1102 var13_13 = var0[var1_1];
1103 var0[var1_1++] = ((var13_13 & 16711935) * var6_6 >> 8 & 16711935) + var12_12 + (var6_6 * (var13_13 & 65280) >> 8 & 65280);
1104 var13_13 = var0[var1_1];
1105 var0[var1_1++] = ((var13_13 & 16711935) * var6_6 >> 8 & 16711935) + var12_12 + (var6_6 * (var13_13 & 65280) >> 8 & 65280);
1106 if (--var10_10 > 0) continue block4;
1107lbl53: // 2 sources:
1108 v1 = var10_10 = var3_3 - var2_2 & 3;
1109 } while (var9_9 != null);
1110 break;
1111 } while (true);
1112 if (v1 > 0) {
1113 var12_12 = T.C[var4_4 >> 8];
1114 var12_12 = (var11_11 * (var12_12 & 65280) >> 8 & 65280) + (var11_11 * (var12_12 & 16711935) >> 8 & 16711935);
1115 do {
1116 var13_13 = var0[var1_1];
1117 var0[var1_1++] = ((var13_13 & 16711935) * var6_6 >> 8 & 16711935) + var12_12 + (var6_6 * (var13_13 & 65280) >> 8 & 65280);
1118 } while (--var10_10 > 0);
1119 }
1120 }
1121 if (var9_9 == null) return;
1122 }
1123 var10_10 = var3_3 - var2_2;
1124 if (var6_6 == 0) {
1125 do {
1126 var0[var1_1++] = T.C[var4_4 >> 8];
1127 var4_4 += var5_5;
1128 } while (--var10_10 > 0);
1129 return;
1130 }
1131 var11_11 = 256 - var6_6;
1132 do {
1133 var12_12 = T.C[var4_4 >> 8];
1134 var4_4 += var5_5;
1135 var12_12 = (var11_11 * (var12_12 & 65280) >> 8 & 65280) + (var11_11 * (var12_12 & 16711935) >> 8 & 16711935);
1136 var13_13 = var0[var1_1];
1137 var0[var1_1++] = ((var13_13 & 16711935) * var6_6 >> 8 & 16711935) + var12_12 + (var6_6 * (var13_13 & 65280) >> 8 & 65280);
1138 } while (--var10_10 > 0);
1139 }
1140
1141 public static void a(int n, int n2, int n3, int n4, int n5, int n6, int n7, int n8, boolean bl) {
1142 int n9 = 0;
1143 String[] arrstring = R.b();
1144 if (n != n2) {
1145 n9 = (n5 - n4 << 14) / (n2 - n);
1146 }
1147 int n10 = 0;
1148 if (n3 != n2) {
1149 n10 = (n6 - n5 << 14) / (n3 - n2);
1150 }
1151 int n11 = 0;
1152 if (n != n3) {
1153 n11 = (n4 - n6 << 14) / (n - n3);
1154 }
1155 if (n <= n2 && n <= n3) {
1156 if (n >= c) return;
1157 if (n2 > c) {
1158 n2 = c;
1159 }
1160 if (n3 > c) {
1161 n3 = c;
1162 }
1163 if (n2 < n3) {
1164 n6 = n4 <<= 14;
1165 if (n < 0) {
1166 n6 -= n * n11;
1167 n4 -= n * n9;
1168 n = 0;
1169 }
1170 n5 <<= 14;
1171 if (n2 < 0) {
1172 n5 -= n10 * n2;
1173 n2 = 0;
1174 }
1175 if (!(n != n2 && n11 < n9 || n == n2 && n11 > n10)) {
1176 n3 -= n2;
1177 n2 -= n;
1178 n = r[n];
1179 block0 : do {
1180 int n12;
1181 if (--n2 < 0) {
1182 do {
1183 n12 = --n3;
1184 if (arrstring != null) continue block0;
1185 if (n12 < 0) {
1186 if (arrstring != null) continue;
1187 return;
1188 }
1189 T.a((int[])h, (int)n, (int)n7, (int)(n5 >> 14), (int)(n6 >> 14), (int)n8, (boolean)bl);
1190 n6 += n11;
1191 n5 += n10;
1192 n += b;
1193 } while (arrstring == null);
1194 }
1195 T.a((int[])h, (int)n, (int)n7, (int)(n4 >> 14), (int)(n6 >> 14), (int)n8, (boolean)bl);
1196 n6 += n11;
1197 n4 += n9;
1198 n12 = n = n + b;
1199 } while (arrstring == null);
1200 }
1201 n3 -= n2;
1202 n2 -= n;
1203 n = r[n];
1204 block2 : do {
1205 int n13;
1206 if (--n2 < 0) {
1207 do {
1208 n13 = --n3;
1209 if (arrstring != null) continue block2;
1210 if (n13 < 0) {
1211 if (arrstring != null) continue;
1212 return;
1213 }
1214 T.a((int[])h, (int)n, (int)n7, (int)(n6 >> 14), (int)(n5 >> 14), (int)n8, (boolean)bl);
1215 n6 += n11;
1216 n5 += n10;
1217 n += b;
1218 } while (arrstring == null);
1219 }
1220 T.a((int[])h, (int)n, (int)n7, (int)(n6 >> 14), (int)(n4 >> 14), (int)n8, (boolean)bl);
1221 n6 += n11;
1222 n4 += n9;
1223 n13 = n = n + b;
1224 } while (arrstring == null);
1225 }
1226 n5 = n4 <<= 14;
1227 if (n < 0) {
1228 n5 -= n * n11;
1229 n4 -= n * n9;
1230 n = 0;
1231 }
1232 n6 <<= 14;
1233 if (n3 < 0) {
1234 n6 -= n10 * n3;
1235 n3 = 0;
1236 }
1237 if (n != n3 && n11 < n9 || n == n3 && n10 > n9) {
1238 n2 -= n3;
1239 n3 -= n;
1240 n = r[n];
1241 block4 : do {
1242 int n14;
1243 if (--n3 < 0) {
1244 do {
1245 n14 = --n2;
1246 if (arrstring != null) continue block4;
1247 if (n14 < 0) {
1248 if (arrstring != null) continue;
1249 return;
1250 }
1251 T.a((int[])h, (int)n, (int)n7, (int)(n6 >> 14), (int)(n4 >> 14), (int)n8, (boolean)bl);
1252 n6 += n10;
1253 n4 += n9;
1254 n += b;
1255 } while (arrstring == null);
1256 }
1257 T.a((int[])h, (int)n, (int)n7, (int)(n5 >> 14), (int)(n4 >> 14), (int)n8, (boolean)bl);
1258 n5 += n11;
1259 n4 += n9;
1260 n14 = n = n + b;
1261 } while (arrstring == null);
1262 }
1263 n2 -= n3;
1264 n3 -= n;
1265 n = r[n];
1266 block6 : do {
1267 int n15;
1268 if (--n3 < 0) {
1269 do {
1270 n15 = --n2;
1271 if (arrstring != null) continue block6;
1272 if (n15 < 0) {
1273 if (arrstring != null) continue;
1274 return;
1275 }
1276 T.a((int[])h, (int)n, (int)n7, (int)(n4 >> 14), (int)(n6 >> 14), (int)n8, (boolean)bl);
1277 n6 += n10;
1278 n4 += n9;
1279 n += b;
1280 } while (arrstring == null);
1281 }
1282 T.a((int[])h, (int)n, (int)n7, (int)(n4 >> 14), (int)(n5 >> 14), (int)n8, (boolean)bl);
1283 n5 += n11;
1284 n4 += n9;
1285 n15 = n = n + b;
1286 } while (arrstring == null);
1287 }
1288 if (n2 <= n3) {
1289 if (n2 >= c) return;
1290 if (n3 > c) {
1291 n3 = c;
1292 }
1293 if (n > c) {
1294 n = c;
1295 }
1296 if (n3 < n) {
1297 n4 = n5 <<= 14;
1298 if (n2 < 0) {
1299 n4 -= n9 * n2;
1300 n5 -= n10 * n2;
1301 n2 = 0;
1302 }
1303 n6 <<= 14;
1304 if (n3 < 0) {
1305 n6 -= n11 * n3;
1306 n3 = 0;
1307 }
1308 if (!(n3 != n2 && n9 < n10 || n3 == n2 && n9 > n11)) {
1309 n -= n3;
1310 n3 -= n2;
1311 n2 = r[n2];
1312 block8 : do {
1313 int n16;
1314 if (--n3 < 0) {
1315 do {
1316 n16 = --n;
1317 if (arrstring != null) continue block8;
1318 if (n16 < 0) {
1319 if (arrstring != null) continue;
1320 return;
1321 }
1322 T.a((int[])h, (int)n2, (int)n7, (int)(n6 >> 14), (int)(n4 >> 14), (int)n8, (boolean)bl);
1323 n4 += n9;
1324 n6 += n11;
1325 n2 += b;
1326 } while (arrstring == null);
1327 }
1328 T.a((int[])h, (int)n2, (int)n7, (int)(n5 >> 14), (int)(n4 >> 14), (int)n8, (boolean)bl);
1329 n4 += n9;
1330 n5 += n10;
1331 n16 = n2 = n2 + b;
1332 } while (arrstring == null);
1333 }
1334 n -= n3;
1335 n3 -= n2;
1336 n2 = r[n2];
1337 block10 : do {
1338 int n17;
1339 if (--n3 < 0) {
1340 do {
1341 n17 = --n;
1342 if (arrstring != null) continue block10;
1343 if (n17 < 0) {
1344 if (arrstring != null) continue;
1345 return;
1346 }
1347 T.a((int[])h, (int)n2, (int)n7, (int)(n4 >> 14), (int)(n6 >> 14), (int)n8, (boolean)bl);
1348 n4 += n9;
1349 n6 += n11;
1350 n2 += b;
1351 } while (arrstring == null);
1352 }
1353 T.a((int[])h, (int)n2, (int)n7, (int)(n4 >> 14), (int)(n5 >> 14), (int)n8, (boolean)bl);
1354 n4 += n9;
1355 n5 += n10;
1356 n17 = n2 = n2 + b;
1357 } while (arrstring == null);
1358 }
1359 n6 = n5 <<= 14;
1360 if (n2 < 0) {
1361 n6 -= n9 * n2;
1362 n5 -= n10 * n2;
1363 n2 = 0;
1364 }
1365 n4 <<= 14;
1366 if (n < 0) {
1367 n4 -= n * n11;
1368 n = 0;
1369 }
1370 if (n9 < n10) {
1371 n3 -= n;
1372 n -= n2;
1373 n2 = r[n2];
1374 block12 : do {
1375 int n18;
1376 if (--n < 0) {
1377 do {
1378 n18 = --n3;
1379 if (arrstring != null) continue block12;
1380 if (n18 < 0) {
1381 if (arrstring != null) continue;
1382 return;
1383 }
1384 T.a((int[])h, (int)n2, (int)n7, (int)(n4 >> 14), (int)(n5 >> 14), (int)n8, (boolean)bl);
1385 n4 += n11;
1386 n5 += n10;
1387 n2 += b;
1388 } while (arrstring == null);
1389 }
1390 T.a((int[])h, (int)n2, (int)n7, (int)(n6 >> 14), (int)(n5 >> 14), (int)n8, (boolean)bl);
1391 n6 += n9;
1392 n5 += n10;
1393 n18 = n2 = n2 + b;
1394 } while (arrstring == null);
1395 }
1396 n3 -= n;
1397 n -= n2;
1398 n2 = r[n2];
1399 block14 : do {
1400 int n19;
1401 if (--n < 0) {
1402 do {
1403 n19 = --n3;
1404 if (arrstring != null) continue block14;
1405 if (n19 < 0) {
1406 if (arrstring != null) continue;
1407 return;
1408 }
1409 T.a((int[])h, (int)n2, (int)n7, (int)(n5 >> 14), (int)(n4 >> 14), (int)n8, (boolean)bl);
1410 n4 += n11;
1411 n5 += n10;
1412 n2 += b;
1413 } while (arrstring == null);
1414 }
1415 T.a((int[])h, (int)n2, (int)n7, (int)(n5 >> 14), (int)(n6 >> 14), (int)n8, (boolean)bl);
1416 n6 += n9;
1417 n5 += n10;
1418 n19 = n2 = n2 + b;
1419 } while (arrstring == null);
1420 }
1421 if (n3 >= c) return;
1422 if (n > c) {
1423 n = c;
1424 }
1425 if (n2 > c) {
1426 n2 = c;
1427 }
1428 if (n < n2) {
1429 n5 = n6 <<= 14;
1430 if (n3 < 0) {
1431 n5 -= n10 * n3;
1432 n6 -= n11 * n3;
1433 n3 = 0;
1434 }
1435 n4 <<= 14;
1436 if (n < 0) {
1437 n4 -= n * n9;
1438 n = 0;
1439 }
1440 if (n10 < n11) {
1441 n2 -= n;
1442 n -= n3;
1443 n3 = r[n3];
1444 block16 : do {
1445 int n20;
1446 if (--n < 0) {
1447 do {
1448 n20 = --n2;
1449 if (arrstring != null) continue block16;
1450 if (n20 < 0) {
1451 if (arrstring != null) continue;
1452 return;
1453 }
1454 T.a((int[])h, (int)n3, (int)n7, (int)(n5 >> 14), (int)(n4 >> 14), (int)n8, (boolean)bl);
1455 n5 += n10;
1456 n4 += n9;
1457 n3 += b;
1458 } while (arrstring == null);
1459 }
1460 T.a((int[])h, (int)n3, (int)n7, (int)(n5 >> 14), (int)(n6 >> 14), (int)n8, (boolean)bl);
1461 n5 += n10;
1462 n6 += n11;
1463 n20 = n3 = n3 + b;
1464 } while (arrstring == null);
1465 }
1466 n2 -= n;
1467 n -= n3;
1468 n3 = r[n3];
1469 block18 : do {
1470 int n21;
1471 if (--n < 0) {
1472 do {
1473 n21 = --n2;
1474 if (arrstring != null) continue block18;
1475 if (n21 < 0) {
1476 if (arrstring != null) continue;
1477 return;
1478 }
1479 T.a((int[])h, (int)n3, (int)n7, (int)(n4 >> 14), (int)(n5 >> 14), (int)n8, (boolean)bl);
1480 n5 += n10;
1481 n4 += n9;
1482 n3 += b;
1483 } while (arrstring == null);
1484 }
1485 T.a((int[])h, (int)n3, (int)n7, (int)(n6 >> 14), (int)(n5 >> 14), (int)n8, (boolean)bl);
1486 n5 += n10;
1487 n6 += n11;
1488 n21 = n3 = n3 + b;
1489 } while (arrstring == null);
1490 }
1491 n4 = n6 <<= 14;
1492 if (n3 < 0) {
1493 n4 -= n10 * n3;
1494 n6 -= n11 * n3;
1495 n3 = 0;
1496 }
1497 n5 <<= 14;
1498 if (n2 < 0) {
1499 n5 -= n9 * n2;
1500 n2 = 0;
1501 }
1502 if (n10 < n11) {
1503 n -= n2;
1504 n2 -= n3;
1505 n3 = r[n3];
1506 block20 : do {
1507 int n22;
1508 if (--n2 < 0) {
1509 do {
1510 n22 = --n;
1511 if (arrstring != null) continue block20;
1512 if (n22 < 0) {
1513 if (arrstring != null) continue;
1514 return;
1515 }
1516 T.a((int[])h, (int)n3, (int)n7, (int)(n5 >> 14), (int)(n6 >> 14), (int)n8, (boolean)bl);
1517 n5 += n9;
1518 n6 += n11;
1519 n3 += b;
1520 } while (arrstring == null);
1521 }
1522 T.a((int[])h, (int)n3, (int)n7, (int)(n4 >> 14), (int)(n6 >> 14), (int)n8, (boolean)bl);
1523 n4 += n10;
1524 n6 += n11;
1525 n22 = n3 = n3 + b;
1526 } while (arrstring == null);
1527 }
1528 n -= n2;
1529 n2 -= n3;
1530 n3 = r[n3];
1531 block22 : do {
1532 int n23;
1533 if (--n2 < 0) {
1534 do {
1535 n23 = --n;
1536 if (arrstring != null) continue block22;
1537 if (n23 < 0) {
1538 if (arrstring != null) continue;
1539 return;
1540 }
1541 T.a((int[])h, (int)n3, (int)n7, (int)(n6 >> 14), (int)(n5 >> 14), (int)n8, (boolean)bl);
1542 n5 += n9;
1543 n6 += n11;
1544 n3 += b;
1545 } while (arrstring == null);
1546 }
1547 T.a((int[])h, (int)n3, (int)n7, (int)(n6 >> 14), (int)(n4 >> 14), (int)n8, (boolean)bl);
1548 n4 += n10;
1549 n6 += n11;
1550 n23 = n3 = n3 + b;
1551 } while (arrstring == null);
1552 }
1553
1554 private static void a(int[] arrn, int n, int n2, int n3, int n4, int n5, boolean bl) {
1555 int n6;
1556 String[] arrstring;
1557 block18 : {
1558 arrstring = R.b();
1559 if (bl) {
1560 if (n4 > T.n) {
1561 n4 = T.n;
1562 }
1563 if (n3 < 0) {
1564 n3 = 0;
1565 }
1566 }
1567 if (n3 >= n4) return;
1568 n += n3;
1569 n6 = n4 - n3 >> 2;
1570 if (n5 == 0) break block18;
1571 if (n5 == 254) {
1572 do {
1573 if (--n6 < 0) {
1574 if (arrstring != null) continue;
1575 n6 = n4 - n3 & 3;
1576 do {
1577 if (--n6 < 0) {
1578 if (arrstring != null) continue;
1579 return;
1580 }
1581 arrn[n++] = arrn[n];
1582 } while (arrstring == null);
1583 }
1584 arrn[n++] = arrn[n];
1585 arrn[n++] = arrn[n];
1586 arrn[n++] = arrn[n];
1587 arrn[n++] = arrn[n];
1588 } while (arrstring == null);
1589 }
1590 int n7 = 256 - n5;
1591 n2 = (n7 * (n2 & 65280) >> 8 & 65280) + (n7 * (n2 & 16711935) >> 8 & 16711935);
1592 do {
1593 int n8;
1594 int n9;
1595 block20 : {
1596 block19 : {
1597 if (--n6 >= 0) break block19;
1598 n8 = n4 - n3 & 3;
1599 if (arrstring != null) break block20;
1600 n6 = n8;
1601 do {
1602 if (--n6 < 0) {
1603 return;
1604 }
1605 n9 = arrn[n];
1606 arrn[n++] = ((n9 & 16711935) * n5 >> 8 & 16711935) + n2 + (n5 * (n9 & 65280) >> 8 & 65280);
1607 } while (arrstring == null);
1608 }
1609 n8 = arrn[n];
1610 }
1611 n9 = n8;
1612 arrn[n++] = ((n9 & 16711935) * n5 >> 8 & 16711935) + n2 + (n5 * (n9 & 65280) >> 8 & 65280);
1613 n9 = arrn[n];
1614 arrn[n++] = ((n9 & 16711935) * n5 >> 8 & 16711935) + n2 + (n5 * (n9 & 65280) >> 8 & 65280);
1615 n9 = arrn[n];
1616 arrn[n++] = ((n9 & 16711935) * n5 >> 8 & 16711935) + n2 + (n5 * (n9 & 65280) >> 8 & 65280);
1617 n9 = arrn[n];
1618 arrn[n++] = ((n9 & 16711935) * n5 >> 8 & 16711935) + n2 + (n5 * (n9 & 65280) >> 8 & 65280);
1619 } while (arrstring == null);
1620 }
1621 do {
1622 if (--n6 < 0) {
1623 if (arrstring != null) continue;
1624 n6 = n4 - n3 & 3;
1625 do {
1626 if (--n6 < 0) {
1627 if (arrstring != null) continue;
1628 return;
1629 }
1630 arrn[n++] = n2;
1631 } while (arrstring == null);
1632 }
1633 arrn[n++] = n2;
1634 arrn[n++] = n2;
1635 arrn[n++] = n2;
1636 arrn[n++] = n2;
1637 } while (arrstring == null);
1638 }
1639
1640 /*
1641 * Unable to fully structure code
1642 */
1643 public static void a(int var0, int var1_1, int var2_2, int var3_3, int var4_4, int var5_5, int var6_6, int var7_7, int var8_8, int var9_9, int var10_10, int var11_11, int var12_12, int var13_13, int var14_14, int var15_15, int var16_16, int var17_17, int var18_18, boolean var19_19, boolean var20_20) {
1644 block72 : {
1645 block71 : {
1646 block70 : {
1647 block69 : {
1648 block68 : {
1649 block67 : {
1650 block66 : {
1651 block65 : {
1652 block64 : {
1653 block63 : {
1654 block62 : {
1655 block61 : {
1656 block83 : {
1657 block81 : {
1658 block82 : {
1659 block77 : {
1660 block80 : {
1661 block78 : {
1662 block79 : {
1663 block73 : {
1664 block76 : {
1665 block74 : {
1666 block75 : {
1667 var22_21 = T.d((int)var18_18);
1668 var21_22 = R.b();
1669 var23_23 = T.B[var18_18] == false;
1670 var10_10 = var9_9 - var10_10;
1671 var13_13 = var12_12 - var13_13;
1672 var16_16 = var15_15 - var16_16;
1673 var24_24 = (var11_11 -= var9_9) * var12_12 - (var14_14 -= var12_12) * var9_9 << 14;
1674 var25_25 = (int)(((long)(var14_14 * var15_15 - (var17_17 -= var15_15) * var12_12) << 3 << 14) / (long)T.E);
1675 var26_26 = (int)(((long)(var17_17 * var9_9 - var11_11 * var15_15) << 14) / (long)T.E);
1676 var27_27 = var10_10 * var12_12 - var13_13 * var9_9 << 14;
1677 var28_28 = (int)(((long)(var13_13 * var15_15 - var16_16 * var12_12) << 3 << 14) / (long)T.E);
1678 var29_29 = (int)(((long)(var16_16 * var9_9 - var10_10 * var15_15) << 14) / (long)T.E);
1679 var30_30 = var13_13 * var11_11 - var10_10 * var14_14 << 14;
1680 var31_31 = (int)(((long)(var16_16 * var14_14 - var13_13 * var17_17) << 3 << 14) / (long)T.E);
1681 var32_32 = (int)(((long)(var10_10 * var17_17 - var16_16 * var11_11) << 14) / (long)T.E);
1682 var33_33 = 0;
1683 var34_34 = 0;
1684 if (!var20_20) {
1685 var25_25 = var14_14 * var15_15 - var17_17 * var12_12 << 8;
1686 var26_26 = var17_17 * var9_9 - var11_11 * var15_15 << 5;
1687 var28_28 = var13_13 * var15_15 - var16_16 * var12_12 << 8;
1688 var29_29 = var16_16 * var9_9 - var10_10 * var15_15 << 5;
1689 var31_31 = var16_16 * var14_14 - var13_13 * var17_17 << 8;
1690 var32_32 = var10_10 * var17_17 - var16_16 * var11_11 << 5;
1691 }
1692 if (var1_1 != var0) {
1693 var33_33 = (var4_4 - var3_3 << 16) / (var1_1 - var0);
1694 var34_34 = (var7_7 - var6_6 << 16) / (var1_1 - var0);
1695 }
1696 var35_35 = 0;
1697 var36_36 = 0;
1698 if (var2_2 != var1_1) {
1699 var35_35 = (var5_5 - var4_4 << 16) / (var2_2 - var1_1);
1700 var36_36 = (var8_8 - var7_7 << 16) / (var2_2 - var1_1);
1701 }
1702 var37_37 = 0;
1703 var38_38 = 0;
1704 if (var2_2 != var0) {
1705 var37_37 = (var3_3 - var5_5 << 16) / (var0 - var2_2);
1706 var38_38 = (var6_6 - var8_8 << 16) / (var0 - var2_2);
1707 }
1708 if (var0 > var1_1 || var0 > var2_2) break block73;
1709 if (var0 >= T.c) {
1710 return;
1711 }
1712 if (var1_1 > T.c) {
1713 var1_1 = T.c;
1714 }
1715 if (var2_2 > T.c) {
1716 var2_2 = T.c;
1717 }
1718 if (var1_1 >= var2_2) break block74;
1719 var5_5 = var3_3 <<= 16;
1720 var8_8 = var6_6 <<= 16;
1721 if (var0 < 0) {
1722 var5_5 -= var37_37 * var0;
1723 var3_3 -= var33_33 * var0;
1724 var8_8 -= var38_38 * var0;
1725 var6_6 -= var34_34 * var0;
1726 var0 = 0;
1727 }
1728 var4_4 <<= 16;
1729 var7_7 <<= 16;
1730 if (var1_1 < 0) {
1731 var4_4 -= var35_35 * var1_1;
1732 var7_7 -= var36_36 * var1_1;
1733 var1_1 = 0;
1734 }
1735 var39_39 = var0 - T.w;
1736 var24_24 += var26_26 * var39_39;
1737 var27_27 += var29_29 * var39_39;
1738 var30_30 += var32_32 * var39_39;
1739 if ((var0 == var1_1 || var37_37 >= var33_33) && (var0 != var1_1 || var37_37 <= var35_35)) break block75;
1740 var2_2 -= var1_1;
1741 var1_1 -= var0;
1742 var0 = T.r[var0];
1743 while (--var1_1 >= 0) {
1744 T.a((int[])T.h, (int[])var22_21, (int)var0, (int)(var5_5 >> 16), (int)(var3_3 >> 16), (int)(var8_8 >> 8), (int)(var6_6 >> 8), (int)var24_24, (int)var27_27, (int)var30_30, (int)var25_25, (int)var28_28, (int)var31_31, (boolean)var23_23, (boolean)var19_19);
1745 var5_5 += var37_37;
1746 var3_3 += var33_33;
1747 var8_8 += var38_38;
1748 var6_6 += var34_34;
1749 var0 += T.b;
1750 var24_24 += var26_26;
1751 var27_27 += var29_29;
1752 var30_30 += var32_32;
1753 if (var21_22 == null) {
1754 if (var21_22 == null) continue;
1755 L.b((String[])new String[2]);
1756 break block61;
1757 }
1758 ** GOTO lbl406
1759 }
1760 break block61;
1761 }
1762 var2_2 -= var1_1;
1763 var1_1 -= var0;
1764 var0 = T.r[var0];
1765 while (--var1_1 >= 0) {
1766 T.a((int[])T.h, (int[])var22_21, (int)var0, (int)(var3_3 >> 16), (int)(var5_5 >> 16), (int)(var6_6 >> 8), (int)(var8_8 >> 8), (int)var24_24, (int)var27_27, (int)var30_30, (int)var25_25, (int)var28_28, (int)var31_31, (boolean)var23_23, (boolean)var19_19);
1767 var5_5 += var37_37;
1768 var3_3 += var33_33;
1769 var8_8 += var38_38;
1770 var6_6 += var34_34;
1771 var0 += T.b;
1772 var24_24 += var26_26;
1773 var27_27 += var29_29;
1774 var30_30 += var32_32;
1775 if (var21_22 == null) {
1776 if (var21_22 == null) continue;
1777 break block62;
1778 }
1779 ** GOTO lbl421
1780 }
1781 break block62;
1782 }
1783 var4_4 = var3_3 <<= 16;
1784 var7_7 = var6_6 <<= 16;
1785 if (var0 < 0) {
1786 var4_4 -= var37_37 * var0;
1787 var3_3 -= var33_33 * var0;
1788 var7_7 -= var38_38 * var0;
1789 var6_6 -= var34_34 * var0;
1790 var0 = 0;
1791 }
1792 var5_5 <<= 16;
1793 var8_8 <<= 16;
1794 if (var2_2 < 0) {
1795 var5_5 -= var35_35 * var2_2;
1796 var8_8 -= var36_36 * var2_2;
1797 var2_2 = 0;
1798 }
1799 var39_40 = var0 - T.w;
1800 var24_24 += var26_26 * var39_40;
1801 var27_27 += var29_29 * var39_40;
1802 var30_30 += var32_32 * var39_40;
1803 if ((var0 == var2_2 || var37_37 >= var33_33) && (var0 != var2_2 || var35_35 <= var33_33)) break block76;
1804 var1_1 -= var2_2;
1805 var2_2 -= var0;
1806 var0 = T.r[var0];
1807 while (--var2_2 >= 0) {
1808 T.a((int[])T.h, (int[])var22_21, (int)var0, (int)(var4_4 >> 16), (int)(var3_3 >> 16), (int)(var7_7 >> 8), (int)(var6_6 >> 8), (int)var24_24, (int)var27_27, (int)var30_30, (int)var25_25, (int)var28_28, (int)var31_31, (boolean)var23_23, (boolean)var19_19);
1809 var4_4 += var37_37;
1810 var3_3 += var33_33;
1811 var7_7 += var38_38;
1812 var6_6 += var34_34;
1813 var0 += T.b;
1814 var24_24 += var26_26;
1815 var27_27 += var29_29;
1816 var30_30 += var32_32;
1817 if (var21_22 == null) {
1818 if (var21_22 == null) continue;
1819 break block63;
1820 }
1821 ** GOTO lbl436
1822 }
1823 break block63;
1824 }
1825 var1_1 -= var2_2;
1826 var2_2 -= var0;
1827 var0 = T.r[var0];
1828 while (--var2_2 >= 0) {
1829 T.a((int[])T.h, (int[])var22_21, (int)var0, (int)(var3_3 >> 16), (int)(var4_4 >> 16), (int)(var6_6 >> 8), (int)(var7_7 >> 8), (int)var24_24, (int)var27_27, (int)var30_30, (int)var25_25, (int)var28_28, (int)var31_31, (boolean)var23_23, (boolean)var19_19);
1830 var4_4 += var37_37;
1831 var3_3 += var33_33;
1832 var7_7 += var38_38;
1833 var6_6 += var34_34;
1834 var0 += T.b;
1835 var24_24 += var26_26;
1836 var27_27 += var29_29;
1837 var30_30 += var32_32;
1838 if (var21_22 == null) {
1839 if (var21_22 == null) continue;
1840 break block64;
1841 }
1842 ** GOTO lbl451
1843 }
1844 break block64;
1845 }
1846 if (var1_1 > var2_2) break block77;
1847 if (var1_1 >= T.c) {
1848 return;
1849 }
1850 if (var2_2 > T.c) {
1851 var2_2 = T.c;
1852 }
1853 if (var0 > T.c) {
1854 var0 = T.c;
1855 }
1856 if (var2_2 >= var0) break block78;
1857 var3_3 = var4_4 <<= 16;
1858 var6_6 = var7_7 <<= 16;
1859 if (var1_1 < 0) {
1860 var3_3 -= var33_33 * var1_1;
1861 var4_4 -= var35_35 * var1_1;
1862 var6_6 -= var34_34 * var1_1;
1863 var7_7 -= var36_36 * var1_1;
1864 var1_1 = 0;
1865 }
1866 var5_5 <<= 16;
1867 var8_8 <<= 16;
1868 if (var2_2 < 0) {
1869 var5_5 -= var37_37 * var2_2;
1870 var8_8 -= var38_38 * var2_2;
1871 var2_2 = 0;
1872 }
1873 var39_41 = var1_1 - T.w;
1874 var24_24 += var26_26 * var39_41;
1875 var27_27 += var29_29 * var39_41;
1876 var30_30 += var32_32 * var39_41;
1877 if ((var1_1 == var2_2 || var33_33 >= var35_35) && (var1_1 != var2_2 || var33_33 <= var37_37)) break block79;
1878 var0 -= var2_2;
1879 var2_2 -= var1_1;
1880 var1_1 = T.r[var1_1];
1881 while (--var2_2 >= 0) {
1882 T.a((int[])T.h, (int[])var22_21, (int)var1_1, (int)(var3_3 >> 16), (int)(var4_4 >> 16), (int)(var6_6 >> 8), (int)(var7_7 >> 8), (int)var24_24, (int)var27_27, (int)var30_30, (int)var25_25, (int)var28_28, (int)var31_31, (boolean)var23_23, (boolean)var19_19);
1883 var3_3 += var33_33;
1884 var4_4 += var35_35;
1885 var6_6 += var34_34;
1886 var7_7 += var36_36;
1887 var1_1 += T.b;
1888 var24_24 += var26_26;
1889 var27_27 += var29_29;
1890 var30_30 += var32_32;
1891 if (var21_22 == null) {
1892 if (var21_22 == null) continue;
1893 break block65;
1894 }
1895 ** GOTO lbl466
1896 }
1897 break block65;
1898 }
1899 var0 -= var2_2;
1900 var2_2 -= var1_1;
1901 var1_1 = T.r[var1_1];
1902 while (--var2_2 >= 0) {
1903 T.a((int[])T.h, (int[])var22_21, (int)var1_1, (int)(var4_4 >> 16), (int)(var3_3 >> 16), (int)(var7_7 >> 8), (int)(var6_6 >> 8), (int)var24_24, (int)var27_27, (int)var30_30, (int)var25_25, (int)var28_28, (int)var31_31, (boolean)var23_23, (boolean)var19_19);
1904 var3_3 += var33_33;
1905 var4_4 += var35_35;
1906 var6_6 += var34_34;
1907 var7_7 += var36_36;
1908 var1_1 += T.b;
1909 var24_24 += var26_26;
1910 var27_27 += var29_29;
1911 var30_30 += var32_32;
1912 if (var21_22 == null) {
1913 if (var21_22 == null) continue;
1914 break block66;
1915 }
1916 ** GOTO lbl481
1917 }
1918 break block66;
1919 }
1920 var5_5 = var4_4 <<= 16;
1921 var8_8 = var7_7 <<= 16;
1922 if (var1_1 < 0) {
1923 var5_5 -= var33_33 * var1_1;
1924 var4_4 -= var35_35 * var1_1;
1925 var8_8 -= var34_34 * var1_1;
1926 var7_7 -= var36_36 * var1_1;
1927 var1_1 = 0;
1928 }
1929 var3_3 <<= 16;
1930 var6_6 <<= 16;
1931 if (var0 < 0) {
1932 var3_3 -= var37_37 * var0;
1933 var6_6 -= var38_38 * var0;
1934 var0 = 0;
1935 }
1936 var39_42 = var1_1 - T.w;
1937 var24_24 += var26_26 * var39_42;
1938 var27_27 += var29_29 * var39_42;
1939 var30_30 += var32_32 * var39_42;
1940 if (var33_33 >= var35_35) break block80;
1941 var2_2 -= var0;
1942 var0 -= var1_1;
1943 var1_1 = T.r[var1_1];
1944 while (--var0 >= 0) {
1945 T.a((int[])T.h, (int[])var22_21, (int)var1_1, (int)(var5_5 >> 16), (int)(var4_4 >> 16), (int)(var8_8 >> 8), (int)(var7_7 >> 8), (int)var24_24, (int)var27_27, (int)var30_30, (int)var25_25, (int)var28_28, (int)var31_31, (boolean)var23_23, (boolean)var19_19);
1946 var5_5 += var33_33;
1947 var4_4 += var35_35;
1948 var8_8 += var34_34;
1949 var7_7 += var36_36;
1950 var1_1 += T.b;
1951 var24_24 += var26_26;
1952 var27_27 += var29_29;
1953 var30_30 += var32_32;
1954 if (var21_22 == null) {
1955 if (var21_22 == null) continue;
1956 break block67;
1957 }
1958 ** GOTO lbl496
1959 }
1960 break block67;
1961 }
1962 var2_2 -= var0;
1963 var0 -= var1_1;
1964 var1_1 = T.r[var1_1];
1965 while (--var0 >= 0) {
1966 T.a((int[])T.h, (int[])var22_21, (int)var1_1, (int)(var4_4 >> 16), (int)(var5_5 >> 16), (int)(var7_7 >> 8), (int)(var8_8 >> 8), (int)var24_24, (int)var27_27, (int)var30_30, (int)var25_25, (int)var28_28, (int)var31_31, (boolean)var23_23, (boolean)var19_19);
1967 var5_5 += var33_33;
1968 var4_4 += var35_35;
1969 var8_8 += var34_34;
1970 var7_7 += var36_36;
1971 var1_1 += T.b;
1972 var24_24 += var26_26;
1973 var27_27 += var29_29;
1974 var30_30 += var32_32;
1975 if (var21_22 == null) {
1976 if (var21_22 == null) continue;
1977 break block68;
1978 }
1979 ** GOTO lbl511
1980 }
1981 break block68;
1982 }
1983 if (var2_2 >= T.c) {
1984 return;
1985 }
1986 if (var0 > T.c) {
1987 var0 = T.c;
1988 }
1989 if (var1_1 > T.c) {
1990 var1_1 = T.c;
1991 }
1992 if (var0 >= var1_1) break block81;
1993 var4_4 = var5_5 <<= 16;
1994 var7_7 = var8_8 <<= 16;
1995 if (var2_2 < 0) {
1996 var4_4 -= var35_35 * var2_2;
1997 var5_5 -= var37_37 * var2_2;
1998 var7_7 -= var36_36 * var2_2;
1999 var8_8 -= var38_38 * var2_2;
2000 var2_2 = 0;
2001 }
2002 var3_3 <<= 16;
2003 var6_6 <<= 16;
2004 if (var0 < 0) {
2005 var3_3 -= var33_33 * var0;
2006 var6_6 -= var34_34 * var0;
2007 var0 = 0;
2008 }
2009 var39_43 = var2_2 - T.w;
2010 var24_24 += var26_26 * var39_43;
2011 var27_27 += var29_29 * var39_43;
2012 var30_30 += var32_32 * var39_43;
2013 if (var35_35 >= var37_37) break block82;
2014 var1_1 -= var0;
2015 var0 -= var2_2;
2016 var2_2 = T.r[var2_2];
2017 while (--var0 >= 0) {
2018 T.a((int[])T.h, (int[])var22_21, (int)var2_2, (int)(var4_4 >> 16), (int)(var5_5 >> 16), (int)(var7_7 >> 8), (int)(var8_8 >> 8), (int)var24_24, (int)var27_27, (int)var30_30, (int)var25_25, (int)var28_28, (int)var31_31, (boolean)var23_23, (boolean)var19_19);
2019 var4_4 += var35_35;
2020 var5_5 += var37_37;
2021 var7_7 += var36_36;
2022 var8_8 += var38_38;
2023 var2_2 += T.b;
2024 var24_24 += var26_26;
2025 var27_27 += var29_29;
2026 var30_30 += var32_32;
2027 if (var21_22 == null) {
2028 if (var21_22 == null) continue;
2029 break block69;
2030 }
2031 ** GOTO lbl526
2032 }
2033 break block69;
2034 }
2035 var1_1 -= var0;
2036 var0 -= var2_2;
2037 var2_2 = T.r[var2_2];
2038 while (--var0 >= 0) {
2039 T.a((int[])T.h, (int[])var22_21, (int)var2_2, (int)(var5_5 >> 16), (int)(var4_4 >> 16), (int)(var8_8 >> 8), (int)(var7_7 >> 8), (int)var24_24, (int)var27_27, (int)var30_30, (int)var25_25, (int)var28_28, (int)var31_31, (boolean)var23_23, (boolean)var19_19);
2040 var4_4 += var35_35;
2041 var5_5 += var37_37;
2042 var7_7 += var36_36;
2043 var8_8 += var38_38;
2044 var2_2 += T.b;
2045 var24_24 += var26_26;
2046 var27_27 += var29_29;
2047 var30_30 += var32_32;
2048 if (var21_22 == null) {
2049 if (var21_22 == null) continue;
2050 break block70;
2051 }
2052 ** GOTO lbl541
2053 }
2054 break block70;
2055 }
2056 var3_3 = var5_5 <<= 16;
2057 var6_6 = var8_8 <<= 16;
2058 if (var2_2 < 0) {
2059 var3_3 -= var35_35 * var2_2;
2060 var5_5 -= var37_37 * var2_2;
2061 var6_6 -= var36_36 * var2_2;
2062 var8_8 -= var38_38 * var2_2;
2063 var2_2 = 0;
2064 }
2065 var4_4 <<= 16;
2066 var7_7 <<= 16;
2067 if (var1_1 < 0) {
2068 var4_4 -= var33_33 * var1_1;
2069 var7_7 -= var34_34 * var1_1;
2070 var1_1 = 0;
2071 }
2072 var39_44 = var2_2 - T.w;
2073 var24_24 += var26_26 * var39_44;
2074 var27_27 += var29_29 * var39_44;
2075 var30_30 += var32_32 * var39_44;
2076 if (var35_35 >= var37_37) break block83;
2077 var0 -= var1_1;
2078 var1_1 -= var2_2;
2079 var2_2 = T.r[var2_2];
2080 while (--var1_1 >= 0) {
2081 T.a((int[])T.h, (int[])var22_21, (int)var2_2, (int)(var3_3 >> 16), (int)(var5_5 >> 16), (int)(var6_6 >> 8), (int)(var8_8 >> 8), (int)var24_24, (int)var27_27, (int)var30_30, (int)var25_25, (int)var28_28, (int)var31_31, (boolean)var23_23, (boolean)var19_19);
2082 var3_3 += var35_35;
2083 var5_5 += var37_37;
2084 var6_6 += var36_36;
2085 var8_8 += var38_38;
2086 var2_2 += T.b;
2087 var24_24 += var26_26;
2088 var27_27 += var29_29;
2089 var30_30 += var32_32;
2090 if (var21_22 == null) {
2091 if (var21_22 == null) continue;
2092 break block71;
2093 }
2094 ** GOTO lbl556
2095 }
2096 break block71;
2097 }
2098 var0 -= var1_1;
2099 var1_1 -= var2_2;
2100 var2_2 = T.r[var2_2];
2101 while (--var1_1 >= 0) {
2102 T.a((int[])T.h, (int[])var22_21, (int)var2_2, (int)(var5_5 >> 16), (int)(var3_3 >> 16), (int)(var8_8 >> 8), (int)(var6_6 >> 8), (int)var24_24, (int)var27_27, (int)var30_30, (int)var25_25, (int)var28_28, (int)var31_31, (boolean)var23_23, (boolean)var19_19);
2103 var3_3 += var35_35;
2104 var5_5 += var37_37;
2105 var6_6 += var36_36;
2106 var8_8 += var38_38;
2107 var2_2 += T.b;
2108 var24_24 += var26_26;
2109 var27_27 += var29_29;
2110 var30_30 += var32_32;
2111 if (var21_22 == null) {
2112 if (var21_22 == null) continue;
2113 break block72;
2114 }
2115 ** GOTO lbl571
2116 }
2117 break block72;
2118 }
2119 do {
2120 --var2_2;
2121lbl406: // 2 sources:
2122 if (var2_2 < 0) return;
2123 T.a((int[])T.h, (int[])var22_21, (int)var0, (int)(var5_5 >> 16), (int)(var4_4 >> 16), (int)(var8_8 >> 8), (int)(var7_7 >> 8), (int)var24_24, (int)var27_27, (int)var30_30, (int)var25_25, (int)var28_28, (int)var31_31, (boolean)var23_23, (boolean)var19_19);
2124 var5_5 += var37_37;
2125 var4_4 += var35_35;
2126 var8_8 += var38_38;
2127 var7_7 += var36_36;
2128 var0 += T.b;
2129 var24_24 += var26_26;
2130 var27_27 += var29_29;
2131 var30_30 += var32_32;
2132 } while (var21_22 == null);
2133 return;
2134 }
2135 do {
2136 --var2_2;
2137lbl421: // 2 sources:
2138 if (var2_2 < 0) return;
2139 T.a((int[])T.h, (int[])var22_21, (int)var0, (int)(var4_4 >> 16), (int)(var5_5 >> 16), (int)(var7_7 >> 8), (int)(var8_8 >> 8), (int)var24_24, (int)var27_27, (int)var30_30, (int)var25_25, (int)var28_28, (int)var31_31, (boolean)var23_23, (boolean)var19_19);
2140 var5_5 += var37_37;
2141 var4_4 += var35_35;
2142 var8_8 += var38_38;
2143 var7_7 += var36_36;
2144 var0 += T.b;
2145 var24_24 += var26_26;
2146 var27_27 += var29_29;
2147 var30_30 += var32_32;
2148 } while (var21_22 == null);
2149 return;
2150 }
2151 do {
2152 --var1_1;
2153lbl436: // 2 sources:
2154 if (var1_1 < 0) return;
2155 T.a((int[])T.h, (int[])var22_21, (int)var0, (int)(var5_5 >> 16), (int)(var3_3 >> 16), (int)(var8_8 >> 8), (int)(var6_6 >> 8), (int)var24_24, (int)var27_27, (int)var30_30, (int)var25_25, (int)var28_28, (int)var31_31, (boolean)var23_23, (boolean)var19_19);
2156 var5_5 += var35_35;
2157 var3_3 += var33_33;
2158 var8_8 += var36_36;
2159 var6_6 += var34_34;
2160 var0 += T.b;
2161 var24_24 += var26_26;
2162 var27_27 += var29_29;
2163 var30_30 += var32_32;
2164 } while (var21_22 == null);
2165 return;
2166 }
2167 do {
2168 --var1_1;
2169lbl451: // 2 sources:
2170 if (var1_1 < 0) return;
2171 T.a((int[])T.h, (int[])var22_21, (int)var0, (int)(var3_3 >> 16), (int)(var5_5 >> 16), (int)(var6_6 >> 8), (int)(var8_8 >> 8), (int)var24_24, (int)var27_27, (int)var30_30, (int)var25_25, (int)var28_28, (int)var31_31, (boolean)var23_23, (boolean)var19_19);
2172 var5_5 += var35_35;
2173 var3_3 += var33_33;
2174 var8_8 += var36_36;
2175 var6_6 += var34_34;
2176 var0 += T.b;
2177 var24_24 += var26_26;
2178 var27_27 += var29_29;
2179 var30_30 += var32_32;
2180 } while (var21_22 == null);
2181 return;
2182 }
2183 do {
2184 --var0;
2185lbl466: // 2 sources:
2186 if (var0 < 0) return;
2187 T.a((int[])T.h, (int[])var22_21, (int)var1_1, (int)(var3_3 >> 16), (int)(var5_5 >> 16), (int)(var6_6 >> 8), (int)(var8_8 >> 8), (int)var24_24, (int)var27_27, (int)var30_30, (int)var25_25, (int)var28_28, (int)var31_31, (boolean)var23_23, (boolean)var19_19);
2188 var3_3 += var33_33;
2189 var5_5 += var37_37;
2190 var6_6 += var34_34;
2191 var8_8 += var38_38;
2192 var1_1 += T.b;
2193 var24_24 += var26_26;
2194 var27_27 += var29_29;
2195 var30_30 += var32_32;
2196 } while (var21_22 == null);
2197 return;
2198 }
2199 do {
2200 --var0;
2201lbl481: // 2 sources:
2202 if (var0 < 0) return;
2203 T.a((int[])T.h, (int[])var22_21, (int)var1_1, (int)(var5_5 >> 16), (int)(var3_3 >> 16), (int)(var8_8 >> 8), (int)(var6_6 >> 8), (int)var24_24, (int)var27_27, (int)var30_30, (int)var25_25, (int)var28_28, (int)var31_31, (boolean)var23_23, (boolean)var19_19);
2204 var3_3 += var33_33;
2205 var5_5 += var37_37;
2206 var6_6 += var34_34;
2207 var8_8 += var38_38;
2208 var1_1 += T.b;
2209 var24_24 += var26_26;
2210 var27_27 += var29_29;
2211 var30_30 += var32_32;
2212 } while (var21_22 == null);
2213 return;
2214 }
2215 do {
2216 --var2_2;
2217lbl496: // 2 sources:
2218 if (var2_2 < 0) return;
2219 T.a((int[])T.h, (int[])var22_21, (int)var1_1, (int)(var3_3 >> 16), (int)(var4_4 >> 16), (int)(var6_6 >> 8), (int)(var7_7 >> 8), (int)var24_24, (int)var27_27, (int)var30_30, (int)var25_25, (int)var28_28, (int)var31_31, (boolean)var23_23, (boolean)var19_19);
2220 var3_3 += var37_37;
2221 var4_4 += var35_35;
2222 var6_6 += var38_38;
2223 var7_7 += var36_36;
2224 var1_1 += T.b;
2225 var24_24 += var26_26;
2226 var27_27 += var29_29;
2227 var30_30 += var32_32;
2228 } while (var21_22 == null);
2229 return;
2230 }
2231 do {
2232 --var2_2;
2233lbl511: // 2 sources:
2234 if (var2_2 < 0) return;
2235 T.a((int[])T.h, (int[])var22_21, (int)var1_1, (int)(var4_4 >> 16), (int)(var3_3 >> 16), (int)(var7_7 >> 8), (int)(var6_6 >> 8), (int)var24_24, (int)var27_27, (int)var30_30, (int)var25_25, (int)var28_28, (int)var31_31, (boolean)var23_23, (boolean)var19_19);
2236 var3_3 += var37_37;
2237 var4_4 += var35_35;
2238 var6_6 += var38_38;
2239 var7_7 += var36_36;
2240 var1_1 += T.b;
2241 var24_24 += var26_26;
2242 var27_27 += var29_29;
2243 var30_30 += var32_32;
2244 } while (var21_22 == null);
2245 return;
2246 }
2247 do {
2248 --var1_1;
2249lbl526: // 2 sources:
2250 if (var1_1 < 0) return;
2251 T.a((int[])T.h, (int[])var22_21, (int)var2_2, (int)(var4_4 >> 16), (int)(var3_3 >> 16), (int)(var7_7 >> 8), (int)(var6_6 >> 8), (int)var24_24, (int)var27_27, (int)var30_30, (int)var25_25, (int)var28_28, (int)var31_31, (boolean)var23_23, (boolean)var19_19);
2252 var4_4 += var35_35;
2253 var3_3 += var33_33;
2254 var7_7 += var36_36;
2255 var6_6 += var34_34;
2256 var2_2 += T.b;
2257 var24_24 += var26_26;
2258 var27_27 += var29_29;
2259 var30_30 += var32_32;
2260 } while (var21_22 == null);
2261 return;
2262 }
2263 do {
2264 --var1_1;
2265lbl541: // 2 sources:
2266 if (var1_1 < 0) return;
2267 T.a((int[])T.h, (int[])var22_21, (int)var2_2, (int)(var3_3 >> 16), (int)(var4_4 >> 16), (int)(var6_6 >> 8), (int)(var7_7 >> 8), (int)var24_24, (int)var27_27, (int)var30_30, (int)var25_25, (int)var28_28, (int)var31_31, (boolean)var23_23, (boolean)var19_19);
2268 var4_4 += var35_35;
2269 var3_3 += var33_33;
2270 var7_7 += var36_36;
2271 var6_6 += var34_34;
2272 var2_2 += T.b;
2273 var24_24 += var26_26;
2274 var27_27 += var29_29;
2275 var30_30 += var32_32;
2276 } while (var21_22 == null);
2277 return;
2278 }
2279 do {
2280 --var0;
2281lbl556: // 2 sources:
2282 if (var0 < 0) return;
2283 T.a((int[])T.h, (int[])var22_21, (int)var2_2, (int)(var4_4 >> 16), (int)(var5_5 >> 16), (int)(var7_7 >> 8), (int)(var8_8 >> 8), (int)var24_24, (int)var27_27, (int)var30_30, (int)var25_25, (int)var28_28, (int)var31_31, (boolean)var23_23, (boolean)var19_19);
2284 var4_4 += var33_33;
2285 var5_5 += var37_37;
2286 var7_7 += var34_34;
2287 var8_8 += var38_38;
2288 var2_2 += T.b;
2289 var24_24 += var26_26;
2290 var27_27 += var29_29;
2291 var30_30 += var32_32;
2292 } while (var21_22 == null);
2293 return;
2294 }
2295 do {
2296 --var0;
2297lbl571: // 2 sources:
2298 if (var0 < 0) return;
2299 T.a((int[])T.h, (int[])var22_21, (int)var2_2, (int)(var5_5 >> 16), (int)(var4_4 >> 16), (int)(var8_8 >> 8), (int)(var7_7 >> 8), (int)var24_24, (int)var27_27, (int)var30_30, (int)var25_25, (int)var28_28, (int)var31_31, (boolean)var23_23, (boolean)var19_19);
2300 var4_4 += var33_33;
2301 var5_5 += var37_37;
2302 var7_7 += var34_34;
2303 var8_8 += var38_38;
2304 var2_2 += T.b;
2305 var24_24 += var26_26;
2306 var27_27 += var29_29;
2307 var30_30 += var32_32;
2308 } while (var21_22 == null);
2309 }
2310
2311 private static void a(int[] arrn, int[] arrn2, int n, int n2, int n3, int n4, int n5, int n6, int n7, int n8, int n9, int n10, int n11, boolean bl, boolean bl2) {
2312 int n12;
2313 int n13;
2314 int n14;
2315 String[] arrstring;
2316 int n15;
2317 int n16;
2318 int n17;
2319 int n18;
2320 int n19;
2321 block37 : {
2322 int n20;
2323 int n21;
2324 int n22;
2325 int n23;
2326 block46 : {
2327 int n24;
2328 block36 : {
2329 block44 : {
2330 block45 : {
2331 int n25;
2332 block42 : {
2333 block43 : {
2334 block39 : {
2335 block41 : {
2336 block40 : {
2337 block38 : {
2338 n17 = 0;
2339 n18 = 0;
2340 arrstring = R.b();
2341 if (n2 >= n3) {
2342 return;
2343 }
2344 if (!bl2) break block38;
2345 n21 = (n5 - n4) / (n3 - n2);
2346 if (n3 > T.n) {
2347 n3 = T.n;
2348 }
2349 if (n2 < 0) {
2350 n4 -= n2 * n21;
2351 n2 = 0;
2352 }
2353 if (n2 >= n3) {
2354 return;
2355 }
2356 n22 = n3 - n2 >> 3;
2357 n21 <<= 12;
2358 n4 <<= 9;
2359 if (arrstring == null) break block39;
2360 }
2361 if (n3 - n2 <= 7) break block40;
2362 n22 = n3 - n2 >> 3;
2363 n21 = (n5 - n4) * l[n22] >> 6;
2364 if (arrstring == null) break block41;
2365 }
2366 n22 = 0;
2367 n21 = 0;
2368 }
2369 n4 <<= 9;
2370 }
2371 n += n2;
2372 n23 = 0;
2373 n20 = 0;
2374 int n26 = n2 - v;
2375 n6 += (n9 >> 3) * n26;
2376 n7 += (n10 >> 3) * n26;
2377 n25 = (n8 += (n11 >> 3) * n26) >> 14;
2378 if (n25 == 0) break block42;
2379 n17 = n6 / n25;
2380 n18 = n7 / n25;
2381 if (n17 >= 0) break block43;
2382 n17 = 0;
2383 if (arrstring == null) break block42;
2384 }
2385 if (n17 > 16256) {
2386 n17 = 16256;
2387 }
2388 }
2389 n6 += n9;
2390 n7 += n10;
2391 n25 = (n8 += n11) >> 14;
2392 if (n25 == 0) break block44;
2393 n23 = n6 / n25;
2394 n20 = n7 / n25;
2395 if (n23 >= 7) break block45;
2396 n23 = 7;
2397 if (arrstring == null) break block44;
2398 }
2399 if (n23 > 16256) {
2400 n23 = 16256;
2401 }
2402 }
2403 n14 = n23 - n17 >> 3;
2404 n12 = n20 - n18 >> 3;
2405 n17 += n4 & 6291456;
2406 n19 = n4 >> 23;
2407 if (!bl) break block46;
2408 while (n22-- > 0) {
2409 block47 : {
2410 block48 : {
2411 int n27;
2412 arrn[n++] = arrn2[(n18 & 16256) + (n17 >> 7)] >>> n19;
2413 arrn[n++] = arrn2[((n18 += n12) & 16256) + ((n17 += n14) >> 7)] >>> n19;
2414 arrn[n++] = arrn2[((n18 += n12) & 16256) + ((n17 += n14) >> 7)] >>> n19;
2415 arrn[n++] = arrn2[((n18 += n12) & 16256) + ((n17 += n14) >> 7)] >>> n19;
2416 arrn[n++] = arrn2[((n18 += n12) & 16256) + ((n17 += n14) >> 7)] >>> n19;
2417 arrn[n++] = arrn2[((n18 += n12) & 16256) + ((n17 += n14) >> 7)] >>> n19;
2418 arrn[n++] = arrn2[((n18 += n12) & 16256) + ((n17 += n14) >> 7)] >>> n19;
2419 arrn[n++] = arrn2[((n18 += n12) & 16256) + ((n17 += n14) >> 7)] >>> n19;
2420 n17 = n23;
2421 n18 = n20;
2422 n6 += n9;
2423 n7 += n10;
2424 n24 = n27 = (n8 += n11) >> 14;
2425 if (arrstring != null) break block36;
2426 if (n24 == 0) break block47;
2427 n23 = n6 / n27;
2428 n20 = n7 / n27;
2429 if (n23 >= 7) break block48;
2430 n23 = 7;
2431 if (arrstring == null) break block47;
2432 }
2433 if (n23 > 16256) {
2434 n23 = 16256;
2435 }
2436 }
2437 n14 = n23 - n17 >> 3;
2438 n12 = n20 - n18 >> 3;
2439 n17 += (n4 += n21) & 6291456;
2440 n19 = n4 >> 23;
2441 if (arrstring == null) continue;
2442 }
2443 n24 = n3 - n2 & 7;
2444 }
2445 n22 = n24;
2446 do {
2447 if (n22-- <= 0) return;
2448 arrn[n++] = arrn2[(n18 & 16256) + (n17 >> 7)] >>> n19;
2449 n17 += n14;
2450 n18 += n12;
2451 } while (arrstring == null);
2452 return;
2453 }
2454 while (n22-- > 0) {
2455 block49 : {
2456 block50 : {
2457 n13 = n16 = arrn2[(n18 & 16256) + (n17 >> 7)] >>> n19;
2458 if (arrstring != null) break block37;
2459 if (n13 != 0) {
2460 arrn[n] = n16;
2461 }
2462 ++n;
2463 n16 = arrn2[((n18 += n12) & 16256) + ((n17 += n14) >> 7)] >>> n19;
2464 if (n16 != 0) {
2465 arrn[n] = n16;
2466 }
2467 ++n;
2468 n16 = arrn2[((n18 += n12) & 16256) + ((n17 += n14) >> 7)] >>> n19;
2469 if (n16 != 0) {
2470 arrn[n] = n16;
2471 }
2472 ++n;
2473 n16 = arrn2[((n18 += n12) & 16256) + ((n17 += n14) >> 7)] >>> n19;
2474 if (n16 != 0) {
2475 arrn[n] = n16;
2476 }
2477 ++n;
2478 n16 = arrn2[((n18 += n12) & 16256) + ((n17 += n14) >> 7)] >>> n19;
2479 if (n16 != 0) {
2480 arrn[n] = n16;
2481 }
2482 ++n;
2483 n16 = arrn2[((n18 += n12) & 16256) + ((n17 += n14) >> 7)] >>> n19;
2484 if (n16 != 0) {
2485 arrn[n] = n16;
2486 }
2487 ++n;
2488 n16 = arrn2[((n18 += n12) & 16256) + ((n17 += n14) >> 7)] >>> n19;
2489 if (n16 != 0) {
2490 arrn[n] = n16;
2491 }
2492 ++n;
2493 n16 = arrn2[((n18 += n12) & 16256) + ((n17 += n14) >> 7)] >>> n19;
2494 if (n16 != 0) {
2495 arrn[n] = n16;
2496 }
2497 ++n;
2498 n17 = n23;
2499 n18 = n20;
2500 n6 += n9;
2501 n7 += n10;
2502 n15 = (n8 += n11) >> 14;
2503 if (n15 == 0) break block49;
2504 n23 = n6 / n15;
2505 n20 = n7 / n15;
2506 if (n23 >= 7) break block50;
2507 n23 = 7;
2508 if (arrstring == null) break block49;
2509 }
2510 if (n23 > 16256) {
2511 n23 = 16256;
2512 }
2513 }
2514 n14 = n23 - n17 >> 3;
2515 n12 = n20 - n18 >> 3;
2516 n17 += (n4 += n21) & 6291456;
2517 n19 = n4 >> 23;
2518 if (arrstring == null) continue;
2519 }
2520 n13 = n3 - n2 & 7;
2521 }
2522 n16 = n13;
2523 do {
2524 if (n16-- <= 0) return;
2525 n15 = arrn2[(n18 & 16256) + (n17 >> 7)] >>> n19;
2526 if (n15 != 0) {
2527 arrn[n] = n15;
2528 }
2529 ++n;
2530 n17 += n14;
2531 n18 += n12;
2532 } while (arrstring == null);
2533 }
2534
2535 /*
2536 * Unable to fully structure code
2537 * Converted monitor instructions to comments
2538 */
2539 static {
2540 // MONITORENTER : ee.g()
2541 // MONITOREXIT : ee.g()
2542 T.F = ee.a((long)5668430253633265838L, (long)-6267380084853497050L, MethodHandles.lookup().lookupClass()).a(191938641981590L);
2543 T.I = new HashMap<K, V>(13);
2544 var0 = T.F ^ 116840400785397L;
2545 var2_1 = Cipher.getInstance("DES/CBC/PKCS5Padding");
2546 v0 = new byte[8];
2547 v1 = v0;
2548 v0[0] = (byte)(var0 >>> 56);
2549 for (var3_2 = 1; var3_2 < 8; ++var3_2) {
2550 v1 = v1;
2551 v1[var3_2] = (byte)(var0 << var3_2 * 8 >>> 56);
2552 }
2553 var2_1.init(2, (Key)SecretKeyFactory.getInstance("DES").generateSecret(new DESKeySpec(v1)), new IvParameterSpec(new byte[8]));
2554 var9_3 = new String[7];
2555 var7_4 = 0;
2556 var6_5 = "2p\u00ef\u00a4\u00a0\u0081\u008dM\u00cd\u0095s\u00aa\u0087NE\u00cc\u0010\u001a\u0081\u00ce\u0005s]\u00bb\u00ca\u0018\u00f4\u00c8\u001d\"\u00dd\u00143\u0010\r\u00971\u001e\u00cb\u00b0\u00a4\u00f6'\u00f3\u00e4\u0019\u00c3\u0005\b\u00ba\u0018\u008fT\u000f\u00e5o\u0012$\u00eb\u008a\"Z\u0091V\u0015\u009a\u00fd.\u0002m\u00a0\u0007o\u0004\u00e2\u0010\u0013\u00b5\u0014~\u00f7\u00d1\u009e\"/Bb\u00e9\u00b5\u0094\u0091%";
2557 var8_6 = "2p\u00ef\u00a4\u00a0\u0081\u008dM\u00cd\u0095s\u00aa\u0087NE\u00cc\u0010\u001a\u0081\u00ce\u0005s]\u00bb\u00ca\u0018\u00f4\u00c8\u001d\"\u00dd\u00143\u0010\r\u00971\u001e\u00cb\u00b0\u00a4\u00f6'\u00f3\u00e4\u0019\u00c3\u0005\b\u00ba\u0018\u008fT\u000f\u00e5o\u0012$\u00eb\u008a\"Z\u0091V\u0015\u009a\u00fd.\u0002m\u00a0\u0007o\u0004\u00e2\u0010\u0013\u00b5\u0014~\u00f7\u00d1\u009e\"/Bb\u00e9\u00b5\u0094\u0091%".length();
2558 var5_7 = 16;
2559 var4_8 = -1;
2560 block5 : do {
2561 v2 = ++var4_8;
2562 v3 = var6_5.substring(v2, v2 + var5_7);
2563 v4 = -1;
2564 ** GOTO lbl34
2565 {
2566 var6_5 = "\u009a\u00c3\u008ft\n\u00ad\"\u0088\u0085\u00df_Hp\u00d5\u00faP\u00cd G\u0012\u008b\u00favFF\u00fd\u008b\u00a2\u00f3\u00a1\u00df\u0018\u0094\u0016\u0083\u0019&n\u0018\u00f5\u00f2>T7_\u00ec\u00a2\u008a\u0086\u00e8Ai\u00d9S\u009a(";
2567 var8_6 = "\u009a\u00c3\u008ft\n\u00ad\"\u0088\u0085\u00df_Hp\u00d5\u00faP\u00cd G\u0012\u008b\u00favFF\u00fd\u008b\u00a2\u00f3\u00a1\u00df\u0018\u0094\u0016\u0083\u0019&n\u0018\u00f5\u00f2>T7_\u00ec\u00a2\u008a\u0086\u00e8Ai\u00d9S\u009a(".length();
2568 var5_7 = 32;
2569 var4_8 = -1;
2570 do {
2571 v5 = ++var4_8;
2572 v3 = var6_5.substring(v5, v5 + var5_7);
2573 v4 = 0;
2574lbl34: // 2 sources:
2575 var10_9 = var2_1.doFinal(v3.getBytes("ISO-8859-1"));
2576 switch (v4) {
2577 default: {
2578 var9_3[var7_4++] = T.a((byte[])var10_9).intern();
2579 if ((var4_8 += var5_7) >= var8_6) continue block6;
2580 var5_7 = var6_5.charAt(var4_8);
2581 continue block5;
2582 }
2583 case 0:
2584 }
2585 var9_3[var7_4++] = T.a((byte[])var10_9).intern();
2586 if ((var4_8 += var5_7) >= var8_6) break block5;
2587 var5_7 = var6_5.charAt(var4_8);
2588 } while (true);
2589 }
2590 break;
2591 } while (true);
2592 T.G = var9_3;
2593 T.H = new String[7];
2594 T.E = 512;
2595 T.z = new W[55];
2596 T.j = new int[55];
2597 T.B = new boolean[55];
2598 T.D = new int[55][];
2599 T.y = new int[55];
2600 T.x = new int[55][];
2601 T.l = new int[512];
2602 T.A = new int[2048];
2603 T.g = new int[2048];
2604 for (var11_10 = 0; var11_10 < 2048; ++var11_10) {
2605 T.A[var11_10] = (int)(65536.0 * Math.sin((double)var11_10 * 0.0030679615));
2606 T.g[var11_10] = (int)(65536.0 * Math.cos((double)var11_10 * 0.0030679615));
2607 }
2608 for (var11_10 = 1; var11_10 < 512; ++var11_10) {
2609 T.l[var11_10] = 32768 / var11_10;
2610 }
2611 T.C = new int[65536];
2612 T.u = new int[2048];
2613 var11_10 = 1;
2614 while (var11_10 < 2048) {
2615 T.u[var11_10] = 65536 / var11_10;
2616 ++var11_10;
2617 }
2618 }
2619
2620 private static String a(byte[] arrby) {
2621 int n = 0;
2622 int n2 = arrby.length;
2623 char[] arrc = new char[n2];
2624 int n3 = 0;
2625 while (n3 < n2) {
2626 char c;
2627 int n4 = 255 & arrby[n3];
2628 if (n4 < 192) {
2629 arrc[n++] = (char)n4;
2630 } else if (n4 < 224) {
2631 c = (char)((char)(n4 & 31) << 6);
2632 n4 = arrby[++n3];
2633 c = (char)(c | (char)(n4 & 63));
2634 arrc[n++] = c;
2635 } else if (n3 < n2 - 2) {
2636 c = (char)((char)(n4 & 15) << 12);
2637 n4 = arrby[++n3];
2638 c = (char)(c | (char)(n4 & 63) << 6);
2639 n4 = arrby[++n3];
2640 c = (char)(c | (char)(n4 & 63));
2641 arrc[n++] = c;
2642 }
2643 ++n3;
2644 }
2645 return new String(arrc, 0, n);
2646 }
2647
2648 private static String a(int n, long l) {
2649 Object[] arrobject;
2650 int n2 = n ^ (int)(l & 32767L) ^ 13514;
2651 if (H[n2] != null) return H[n2];
2652 try {
2653 Long l2 = Thread.currentThread().getId();
2654 arrobject = (Object[])I.get(l2);
2655 if (arrobject == null) {
2656 arrobject = new Object[]{Cipher.getInstance("DES/CBC/PKCS5Padding"), SecretKeyFactory.getInstance("DES"), new IvParameterSpec(new byte[8])};
2657 I.put(l2, arrobject);
2658 }
2659 }
2660 catch (Exception exception) {
2661 throw new RuntimeException("T", exception);
2662 }
2663 byte[] arrby = new byte[8];
2664 arrby[0] = (byte)(l >>> 56);
2665 int n3 = 1;
2666 do {
2667 if (n3 >= 8) {
2668 DESKeySpec dESKeySpec = new DESKeySpec(arrby);
2669 SecretKey secretKey = ((SecretKeyFactory)arrobject[1]).generateSecret(dESKeySpec);
2670 ((Cipher)arrobject[0]).init(2, (Key)secretKey, (IvParameterSpec)arrobject[2]);
2671 byte[] arrby2 = G[n2].getBytes("ISO-8859-1");
2672 T.H[n2] = T.a((byte[])((Cipher)arrobject[0]).doFinal(arrby2));
2673 return H[n2];
2674 }
2675 arrby[n3] = (byte)(l << n3 * 8 >>> 56);
2676 ++n3;
2677 } while (true);
2678 }
2679
2680 private static Object a(MethodHandles.Lookup lookup, MutableCallSite mutableCallSite, String string, Object[] arrobject) {
2681 int n = (Integer)arrobject[0];
2682 long l = (Long)arrobject[1];
2683 String string2 = T.a((int)n, (long)l);
2684 MethodHandle methodHandle = MethodHandles.constant(String.class, string2);
2685 mutableCallSite.setTarget(MethodHandles.dropArguments(methodHandle, 0, Integer.TYPE, Long.TYPE));
2686 return string2;
2687 }
2688
2689 /*
2690 * Exception decompiling
2691 */
2692 private static CallSite a(MethodHandles.Lookup var0, String var1, MethodType var2) {
2693 // This method has failed to decompile. When submitting a bug report, please provide this stack trace, and (if you hold appropriate legal rights) the relevant class file.
2694 // java.lang.ClassCastException: org.benf.cfr.reader.entities.constantpool.ConstantPoolEntryMethodHandle cannot be cast to org.benf.cfr.reader.entities.constantpool.ConstantPoolEntryLiteral
2695 // org.benf.cfr.reader.bytecode.opcode.OperationFactoryLDCW.getStackDelta(OperationFactoryLDCW.java:18)
2696 // org.benf.cfr.reader.bytecode.opcode.JVMInstr.getStackDelta(JVMInstr.java:315)
2697 // org.benf.cfr.reader.bytecode.analysis.opgraph.Op02WithProcessedDataAndRefs.populateStackInfo(Op02WithProcessedDataAndRefs.java:195)
2698 // org.benf.cfr.reader.bytecode.analysis.opgraph.Op02WithProcessedDataAndRefs.populateStackInfo(Op02WithProcessedDataAndRefs.java:1489)
2699 // org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisInner(CodeAnalyser.java:311)
2700 // org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisOrWrapFail(CodeAnalyser.java:185)
2701 // org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysis(CodeAnalyser.java:130)
2702 // org.benf.cfr.reader.entities.attributes.AttributeCode.analyse(AttributeCode.java:96)
2703 // org.benf.cfr.reader.entities.Method.analyse(Method.java:397)
2704 // org.benf.cfr.reader.entities.ClassFile.analyseMid(ClassFile.java:890)
2705 // org.benf.cfr.reader.entities.ClassFile.analyseTop(ClassFile.java:792)
2706 // org.benf.cfr.reader.Driver.doClass(Driver.java:52)
2707 // org.benf.cfr.reader.CfrDriverImpl.analyse(CfrDriverImpl.java:65)
2708 // org.benf.cfr.reader.Main.main(Main.java:48)
2709 // the.bytecode.club.bytecodeviewer.decompilers.CFRDecompiler.decompileClassNode(CFRDecompiler.java:131)
2710 // the.bytecode.club.bytecodeviewer.gui.ClassViewer$12.doShit(ClassViewer.java:971)
2711 // the.bytecode.club.bytecodeviewer.gui.PaneUpdaterThread.run(PaneUpdaterThread.java:57)
2712 throw new IllegalStateException("Decompilation failed");
2713 }
2714}