-
Notifications
You must be signed in to change notification settings - Fork 2
/
vNesC.c
4645 lines (4176 loc) · 170 KB
/
vNesC.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// vNesC.c
// NES emulator
#include "vNesC.h"
static void serviceRepaints() { }
static void Systemgc() { }
static long SystemcurrentTimeMillis() { return 0; }
static void k() ;
static void f() ;
static void l() ;
static void xxf(int i1, int j1) ;
static void xxd(int i1, int j1) ;
static void j() ;
static void xd(int i1) ;
static boolean bbool() ;
static void m() ;
static int xxb(int i1, int j1) ;
//static void d() ;
static void c0() ;
static void avoid1int(int i1) ;
static void g() ;
static int loadROM(char *s) ;
static void avoid() ;
static void b() ;
static boolean abool() ;
static void h() ;
static int aint1int(int i1) ;
static void i() ;
static void e(int i1, int j1) ;
static void xxxxb(int i1, int j1, int k1, int l1) ;
static void avoid4int(int i1, int j1, int k1, int l1) ;
static void c(int i1, int j1) ;
static void avoid8int(int i1, int j1, int k1, int l1, int i2, int j2, int k2, int l2) ;
static void bvoid2int(int i1, int j1) ;
static int aint2int(int i1, int j1) ;
//static void b(InputStream inputstream) throws IOException
static int bint1int(int i1) ;
static void avoid2int(int i1, int j1) ;
#if defined(SAVE_LOAD)
static void c_out();
static void b_out();
static void b_in();
static void c_in();
#endif
unsigned char sbuf[sbufsize], *ebuf=sbuf;
static int main_a_int_fld, main_c_int_fld;
static boolean main_b_boolean_fld;
int getWidth, getHeight, screen_length;
static int nn; //temp
static volatile int running;
static int b_int_static_fld = 128;
static int Z = 0;
static int f_int_static_fld = 0;
static int n_int_static_fld = 0;
static int Q = 0;
static int w = 0;
static int P;
static int ad;
static int ab = 0;
static int S = 0;
static int R = 0;
static int o_int_static_fld = 0;
static int L = 128;
static int b_int_array1d_static_fld[8];
static int e_int_static_fld = 0;
static int H = 0;
// static const char *a_java_lang_String_array1d_static_fld[] = {
// "Up", "Down", "Left", "Right", "A", "B", "Start", "Select", "AA", "BB",
// "Trigger", "Quick Save", "Quick Load", "FullScreen"
// };
static int key[] = {
50, 56, 52, 54, 49, 51,
53, 48, 55, 57,
35, 64, 65, 42
};
// '2'=10 8=20 4=40 6=80 1=1 3=2 0=8 7=4
static int O = 0;
static int g_int_static_fld = 0;
static int ac = 0;
static int N = 0;
static int s_int_static_fld = 0;
static int v_int_static_fld = 0;
static int B = 100;
static int z = 0;
static boolean q_boolean_static_fld = true;
static boolean a_boolean_static_fld = false;
static boolean r_boolean_static_fld = false;
static boolean i_boolean_static_fld = false;
static int aa = -1;
static int I = 0;
static boolean e_boolean_static_fld = false;
static int F = 0;
static int k_int_static_fld = 0;
static int a_int_static_fld = 0;
static int X = 0;
static boolean o_boolean_static_fld = false;
static char *a_java_lang_String_static_fld = null;
static int y = 0;
static int D = 0;
static int c_int_static_fld = 0;
static byte *vram=0;//free?
static boolean f_boolean_static_fld = false;
static boolean g_boolean_static_fld = false;
static int T = 0;
static int W = 0;
static int U = 0;
static int d_int_static_fld = 0;
static int m_int_static_fld = 0;
static long c_long_static_fld;
static long b_long_static_fld;
static int i_int_static_fld = 0;
static int u_int_static_fld = 0;
static int K = -1;
static int t_int_static_fld = -1;
boolean t_boolean_static_fld = true;
static ushort j_int_array1d_static_fld[32];
static ushort g_int_array1d_static_fld[64];
static int e_int_array1d_static_fld[32];
static boolean p_boolean_static_fld = false;
// static NESx65 main;
static int x = 1;
static boolean b_boolean_static_fld = false;
static int i_int_array1d_static_fld[12];
static int l_int_array1d_static_fld[8];
static ushort *a_char_array1d_static_fld=0; //free!
static int j_int_static_fld = 0;
//static byte a_byte_array1d_static_fld[];
static int q_int_static_fld = 0;
static int E = 0;
static int G = 0;
static int J = 1;
static int Y = 0;
static boolean u_boolean_static_fld = false;
int A = 5;
static int d_int_array1d_static_fld[8];//=0; //free?????
static boolean v_boolean_static_fld = false;
static boolean h_boolean_static_fld = false;
static char *b_java_lang_String_static_fld;
static boolean m_boolean_static_fld = false;
static boolean s_boolean_static_fld = false;
static boolean d_boolean_static_fld = false;
// static boolean k_boolean_static_fld = false;
static int V = 4;
static int p_int_static_fld = 0;
static byte d_byte_array1d_static_fld[256];
static int C = 0;
static boolean n_boolean_static_fld = false;
static long a_long_static_fld = 0L;
static byte *b_byte_array1d_static_fld=0; //free
static const ushort a_short_array1d_static_fld[] = {
0, 17, 35, 52, 70, 87, 105, 122, 139, 156,
174, 191, 208, 225, 242, 259, 276, 292, 309, 326,
342, 358, 375, 391, 407, 423, 438, 454, 469, 485,
500, 515, 530, 545, 559, 574, 588, 602, 616, 629,
643, 656, 669, 682, 695, 707, 719, 731, 743, 755,
766, 777, 788, 799, 809, 819, 829, 839, 848, 857,
866, 875, 883, 891, 899, 906, 914, 921, 927, 934,
940, 946, 951, 956, 961, 966, 970, 974, 978, 982,
985, 988, 990, 993, 995, 996, 998, 999, 999, 1000,
1000
};
static boolean c_boolean_static_fld = false;
static boolean l_boolean_static_fld = false;
static boolean j_boolean_static_fld = false;
ushort *screens=0; //free screen!!!
static int h_int_static_fld;
static int r_int_static_fld;
static int c_int_array1d_static_fld[260];
static int h_int_array1d_static_fld[276];
static int f_int_array1d_static_fld[276];
static boolean b_boolean_array1d_static_fld[260];
static boolean a_boolean_array1d_static_fld[276];
static int l_int_static_fld = -1;
static int M = 0;
static int ram=0, ramsize=0;
static int keyindex=-1;
static void k() {
xxxxb(
(m_int_static_fld << 5) + (Z & 0x1f),
(m_int_static_fld << 5) + (f_int_static_fld & 0x1f),
(m_int_static_fld << 5) + (n_int_static_fld & 0x1f),
(m_int_static_fld << 5) + (Q & 0x1f)
);
}
static void f() {
if(abool())
xxxxb(ad - 2, J, G, ad - 1);
else
xxxxb(G, J, ad - 2, ad - 1);
}
static void l() {
if(P != 0) {
if(bbool())
avoid8int(ac, N, s_int_static_fld, v_int_static_fld, O, O + 1, g_int_static_fld, g_int_static_fld + 1);
else
avoid8int(O, O + 1, g_int_static_fld, g_int_static_fld + 1, ac, N, s_int_static_fld, v_int_static_fld);
} else
if(bbool()) {
bvoid2int(0, ac);
bvoid2int(1, N);
bvoid2int(2, s_int_static_fld);
bvoid2int(3, v_int_static_fld);
bvoid2int(4, O + 0);
bvoid2int(5, O + 1);
bvoid2int(6, g_int_static_fld + 0);
bvoid2int(7, g_int_static_fld + 1);
} else {
bvoid2int(0, O + 0);
bvoid2int(1, O + 1);
bvoid2int(2, g_int_static_fld + 0);
bvoid2int(3, g_int_static_fld + 1);
bvoid2int(4, ac);
bvoid2int(5, N);
bvoid2int(6, s_int_static_fld);
bvoid2int(7, v_int_static_fld);
}
}
static byte *abyte0;
static byte byte4,byte5,byte6,byte7,byte8,byte9,byte10,byte11,byte12,byte13,byte14;
static int k7;
static int i8,i9,i10,i11,i12,i13,i14,i15,i16,i17,i18,i19,i20,i21,i22,i23,i24,i25,i26,i27,i28,i29,i30,i31,i32,i33,i34,i35,i36,i37;
static int j8,j9,j10,j11,j12,j13,j14,j15,j16,j17,j18,j19,j20,j21,j22,j23,j24,j25,j26,j27,j28,j29,j30,j31,j32,j33,j34,j35,j36,j37;
static int k8,k9,k10,k11,k12,k13,k14,k15,k16,k17,k18,k19,k20,k21,k22,k23,k24,k25,k26,k27,k28,k29,k30,k31,k32,k33,k34,k35,k36;
static int l10,l11,l12,l13,l14,l15,l16,l17,l18,l19,l20,l21,l22,l23,l24,l25,l26,l27,l28,l29,l30,l31,l32,l33,l34,l35,l36;
static int i6,j6,i7,j7;
static int i1, j1, k1, l1, i2, byte0, j2, k2, l2, i3, j3, k3, l3, i4, j4;
static int ai[100];
static int ai1[100];
static int *ai2;
static int k4;
static int l4;
static int i5;
static int k5;
static boolean flag;
static int l5;
static long l6;
static boolean flag1;
static boolean flag2;
static boolean flag3;
static boolean flag4;
static boolean flag5;
void init_values(void) {
running=1;
abyte0 = vram;
i1 = 0;
j1 = 0;
k1 = 0;
l1 = 0;
i2 = 0;
byte0 = 4;
j2 = 255;
k2 = 0;
l2 = 1;
i3 = 0;
j3 = 0;
k3 = 0;
l3 = 0;
i4 = 0;
j4 = -1;
ai2 = b_int_array1d_static_fld;
k4 = (abyte0[ai2[7] + 65532] & 0xff) | (abyte0[ai2[7] + 65533] & 0xff) << 8;
i5 = k4 + (l4 = ai2[k4 >> 13]);
for(int j5 = 0; j5 < 100; j5++)
ai1[j5] = 0;
k5 = -50;
flag = true;
l5 = 0;
l6 = SystemcurrentTimeMillis();
c_long_static_fld = b_long_static_fld = 0L;
flag1 = false;
flag2 = i_boolean_static_fld;
flag3 = false;
flag4 = false;
m();
k_int_static_fld = 0;
l_boolean_static_fld = j_boolean_static_fld = false;
s_boolean_static_fld = true;
}
// #pragma optimize=no_code_motion
void run_step() {
//new File().debugWrite("0:/vnes","\n"+Integer.toString(i5)+" = "+Integer.toString(k4));
//debug(ai2[7],abyte0[ai2[7] + 65532]);////////////
//debug(ai2[7],abyte0[ai2[7] + 65533]);
//if(true) return; //
//new File().debugWrite("0:/vnes","\n"+Integer.toString(i5)+" = "+Integer.toString(k4));
// do {
// do {
//main_loop_step();
//debug("dodo",1,1);////////////
flag5 = k5 % A == 0;
if(t_boolean_static_fld) {
l5 = p_int_static_fld + 1;
if(l5 >= 240)
l5 = -1;
} else
if((R & 0x18) != 0)
D = y;
for(int k6 = 0; k6 <= 261; k6++) {
//debug("k6",k6,k6);////////////
if(k6 == 261)
o_int_static_fld &= 0x3f;
else
if(k6 == 241)
o_int_static_fld |= 0x80;
else
if(k6 == 242) {
if((S & 0x80) != 0) {
k4 = i5 - l4;
abyte0[j2-- + 256] = (byte)(k4 >> 8);
abyte0[j2-- + 256] = (byte)k4;
abyte0[j2-- + 256] = (byte)(k2 | (k1 == 0 ? 2 : 0) | (k1 >> 7) << 7 | l3 << 6 | l2 << 2);
k4 = (abyte0[ai2[7] + 65530] & 0xff) | (abyte0[ai2[7] + 65531] & 0xff) << 8;
i5 = k4 + (l4 = ai2[k4 >> 13]);
i1 += 7;
}
} else
if(t_boolean_static_fld && k6 == l5 + 1 && (R & 0x18) != 0)
o_int_static_fld |= 0x40;
if(k4 != j4) {
if(t_boolean_static_fld) {
if(k6 <= 239) {
if(k6 > l5) {
i1 += 116 * (240 - k6);
k6 = 240;
} else
if(k6 < l5) {
i1 += 116 * (l5 - k6);
k6 = l5;
}
} else
if(k6 >= 242 && k6 <= 259) {
i1 += 116 * (260 - k6);
k6 = 260;
}
}
i1 += 116;
//debug(999,i5);
label0:
if(!running) return;/////add
do {
if(i1 <= 0)
break;
///////debug("",i5,i1); /used!!
//if(i1==0x70){
// ;
//}
//debug(i5,i5);
//new File().debugWrite("0:/56","\n"+Integer.toString(i5)+" = "+Integer.toString(abyte0[i5]));
// boolean flag6;
// boolean flag31;
// boolean flag32;
// boolean flag33;
// boolean flag34;
// boolean flag35;
// boolean flag36;
// boolean flag37;
// boolean flag38;
// boolean flag39;
// boolean flag40;
// boolean flag41;
// boolean flag42;
// boolean flag43;
// boolean flag44;
// boolean flag45;
// boolean flag46;
// boolean flag47;
// boolean flag48;
// boolean flag49;
// boolean flag50;
// boolean flag51;
// boolean flag52;
// boolean flag53;
// boolean flag54;
// boolean flag55;
// boolean flag56;
// boolean flag57;
// boolean flag58;
// boolean flag59;
// boolean flag60;
// boolean flag61;
// boolean flag62;
// boolean flag63;
// boolean flag64;
// boolean flag65;
// boolean flag66;
// boolean flag67;
// boolean flag68;
// boolean flag69;
// boolean flag70;
// boolean flag71;
// boolean flag72;
// boolean flag73;
// boolean flag74;
// boolean flag75;
// boolean flag76;
// boolean flag77;
// boolean flag78;
//31656
// 31659//////////////
/*if(i5==31659 || i5==31656){
if(i5==31656) nnn=1;
if(i5==31659 && nnn==1)
printf("%d ",i5);
}else nnn=0;
*/ //debug("i5",abyte0[i5],i5);////////////
/* if(i5==16634){
printf("%d=%d",i5, ++nnn);
if(nnn==740)
nnn=0;
}*/
switch(abyte0[i5++]) {
default:
break;
case 0: // '\0'
k4 = (i5 - l4) + 1;
abyte0[j2-- + 256] = (byte)(k4 >> 8);
abyte0[j2-- + 256] = (byte)k4;
abyte0[j2-- + 256] = (byte)(k2 | (k1 == 0 ? 2 : 0) | (k1 >> 7) << 7 | l3 << 6 | l2 << 2);
k4 = (abyte0[ai2[7] + 65534] & 0xff) | (abyte0[ai2[7] + 65535] & 0xff) << 8;
i5 = k4 + (l4 = ai2[k4 >> 13]);
j3 = 1;
l2 = 1;
i1 -= 7;
continue;
case 1: // '\001'
k7 = (abyte0[i5++] + l1) & 0xff;
j1 |= (aint1int(abyte0[k7] & 0xff) | (abyte0[k7 + 1] & 0xff) << 8);
k1 = j1;
i1 -= 6;
continue;
case 2: // '\002'
//boolean flag7 = true;
continue;
case 3: // '\003'
//boolean flag8 = true;
continue;
case 4: // '\004'
i5++;
i1 -= 3;
continue;
case 5: // '\005'
j1 |= abyte0[abyte0[i5++] & 0xff] & 0xff;
k1 = j1;
i1 -= 3;
continue;
case 6: // '\006'
i8 = abyte0[i5++] & 0xff;
j8 = abyte0[i8] & 0xff;
k2 = j8 >> 7;
abyte0[i8] = (byte)(k1 = j8 << 1 & 0xff);
i1 -= 5;
continue;
case 7: // '\007'
//boolean flag9 = true;
continue;
case 8: // '\b'
abyte0[j2-- + 256] = (byte)(k2 | (k1 == 0 ? 2 : 0) | (k1 >> 7) << 7 | l3 << 6 | l2 << 2);
i1 -= 3;
continue;
case 9: // '\t'
j1 |= abyte0[i5++] & 0xff;
k1 = j1;
i1 -= 2;
continue;
case 10: // '\n'
k2 = j1 >> 7;
k1 = j1 = j1 << 1 & 0xff;
i1 -= 2;
continue;
case 11: // '\013'
//boolean flag10 = true;
continue;
case 12: // '\f'
i5 += 2;
i1 -= 4;
continue;
case 13: // '\r'
nn=abyte0[i5++] & 0xff;
j1 |= aint1int(nn | (abyte0[i5++] & 0xff) << 8);
k1 = j1;
i1 -= 4;
continue;
case 14: // '\016'
nn=abyte0[i5++] & 0xff;
k8 = nn | (abyte0[i5++] & 0xff) << 8;
i9 = aint1int(k8);
k2 = i9 >> 7;
avoid2int(k8, k1 = i9 << 1 & 0xff);
i1 -= 6;
continue;
case 15: // '\017'
//boolean flag11 = true;
continue;
case 16: // '\020'
//debug("16-1",k1,i5);
if(k1 >> 7 == 0) {
byte byte2 = abyte0[i5++];
i5 += byte2;
i1 -= 3;
if(byte2 < 0 && byte2 >= -5) {
byte byte3 = abyte0[i5];
if(byte2 == -5 && (byte3 == -83 || byte3 == 44))
i1 = 0;
else
if(byte2 == -4 && byte3 == 6)
i1 = 0;
}
} else {
i5++;
i1 -= 2;
}
// debug("16-2",k1,i5);
continue;
case 17: // '\021'
j9 = (abyte0[i5++]) & 0xff;
j1 |= (aint1int((abyte0[j9] & 0xff) | (abyte0[j9 + 1] & 0xff) << 8) + i2);
k1 = j1;
i1 -= 5;
continue;
case 18: // '\022'
//boolean flag12 = true;
continue;
case 19: // '\023'
//boolean flag13 = true;
continue;
case 20: // '\024'
i5++;
i1 -= 4;
continue;
case 21: // '\025'
j1 |= (abyte0[(abyte0[i5++] + l1) & 0xff]) & 0xff;
k1 = j1;
i1 -= 4;
continue;
case 22: // '\026'
k9 = (abyte0[i5++] + l1) & 0xff;
i10 = abyte0[k9] & 0xff;
k2 = i10 >> 7;
abyte0[k9] = (byte)(k1 = i10 << 1 & 0xff);
i1 -= 6;
continue;
case 23: // '\027'
//boolean flag14 = true;
continue;
case 24: // '\030'
k2 = 0;
i1 -= 2;
continue;
case 25: // '\031'
nn=abyte0[i5++] & 0xff;
j1 |= aint1int((nn | (abyte0[i5++] & 0xff) << 8) + i2);
k1 = j1;
i1 -= 4;
continue;
case 26: // '\032'
i1 -= 2;
continue;
case 27: // '\033'
//boolean flag15 = true;
continue;
case 28: // '\034'
i5 += 2;
i1 -= 4;
continue;
case 29: // '\035'
nn=abyte0[i5++] & 0xff;
j1 |= aint1int((nn | (abyte0[i5++] & 0xff) << 8) + l1);
k1 = j1;
i1 -= 5;
continue;
case 30: // '\036'
nn=abyte0[i5++] & 0xff;
j10 = (nn | (abyte0[i5++] & 0xff) << 8) + l1;
k10 = aint1int(j10);
k2 = k10 >> 7;
avoid2int(j10, k1 = k10 << 1 & 0xff);
i1 -= 7;
continue;
case 31: // '\037'
//boolean flag16 = true;
continue;
case 32: // ' '
k4 = (i5 - l4) + 1;
abyte0[j2-- + 256] = (byte)(k4 >> 8);
abyte0[j2-- + 256] = (byte)k4;
k4 = (abyte0[i5] & 0xff) | (abyte0[i5 + 1] & 0xff) << 8;
i5 = k4 + (l4 = ai2[k4 >> 13]);
i1 -= 6;
continue;
case 33: // '!'
l10 = (abyte0[i5++] + l1) & 0xff;
j1 &= aint1int((abyte0[l10] & 0xff) | (abyte0[l10 + 1] & 0xff) << 8);
k1 = j1;
i1 -= 6;
continue;
case 34: // '"'
//boolean flag17 = true;
continue;
case 35: // '#'
//boolean flag18 = true;
continue;
case 36: // '$'
i11 = abyte0[abyte0[i5++] & 0xff] & 0xff;
l3 = i11 >> 6 & 1;
byte4 = abyte0[i5];
if(byte4 == 16 || byte4 == 48)
k1 = i11;
else
k1 = j1 & i11;
i1 -= 3;
continue;
case 37: // '%'
j1 &= abyte0[abyte0[i5++] & 0xff] & 0xff;
k1 = j1;
i1 -= 3;
continue;
case 38: // '&'
j11 = abyte0[i5++] & 0xff;
k11 = abyte0[j11] & 0xff;
k11 = k11 << 1 | k2;
k2 = k11 >> 8;
abyte0[j11] = (byte)(k1 = k11 & 0xff);
i1 -= 5;
continue;
case 39: // '\''
//boolean flag19 = true;
continue;
case 40: // '('
l11 = abyte0[++j2 + 256] & 0xff;
k2 = l11 & 1;
k1 = ((l11 >> 1 & 1) == 0 ? 1 : 0) | (l11 >> 7) << 7;
l3 = l11 >> 6 & 1;
l2 = l11 >> 2 & 1;
i1 -= 4;
continue;
case 41: // ')'
j1 &= abyte0[i5++] & 0xff;
k1 = j1;
i1 -= 2;
continue;
case 42: // '*'
j1 = j1 << 1 | k2;
k2 = j1 >> 8;
j1 &= 0xff;
k1 = j1;
i1 -= 2;
continue;
case 43: // '+'
//boolean flag20 = true;
continue;
case 44: // ','
nn=abyte0[i5++] & 0xff;
i12 = aint1int( nn| (abyte0[i5++] & 0xff) << 8);
l3 = i12 >> 6 & 1;
byte5 = abyte0[i5];
if(byte5 == 16 || byte5 == 48)
k1 = i12;
else
k1 = j1 & i12;
i1 -= 4;
continue;
case 45: // '-'
nn=abyte0[i5++] & 0xff;
j1 &= aint1int(nn | (abyte0[i5++] & 0xff) << 8);
k1 = j1;
i1 -= 4;
continue;
case 46: // '.'
nn=abyte0[i5++] & 0xff;
j12 = nn | (abyte0[i5++] & 0xff) << 8;
k12 = aint1int(j12);
k12 = k12 << 1 | k2;
k2 = k12 >> 8;
avoid2int(j12, k1 = k12 & 0xff);
i1 -= 6;
continue;
case 47: // '/'
//boolean flag21 = true;
continue;
case 48: // '0'
if(k1 >> 7 != 0) {
byte6 = abyte0[i5++];
i5 += byte6;
i1--;
} else {
i5++;
}
i1 -= 2;
continue;
case 49: // '1'
l12 = abyte0[i5++] & 0xff;
j1 &= aint1int(((abyte0[l12] & 0xff) | (abyte0[l12 + 1] & 0xff) << 8) + i2);
k1 = j1;
i1 -= 5;
continue;
case 50: // '2'
//boolean flag22 = true;
continue;
case 51: // '3'
//boolean flag23 = true;
continue;
case 52: // '4'
i5++;
i1 -= 4;
continue;
case 53: // '5'
j1 &= abyte0[(abyte0[i5++] + l1) & 0xff] & 0xff;
k1 = j1;
i1 -= 4;
continue;
case 54: // '6'
i13 = (abyte0[i5++] + l1) & 0xff;
j13 = abyte0[i13] & 0xff;
j13 = j13 << 1 | k2;
k2 = j13 >> 8;
abyte0[i13] = (byte)(k1 = j13 & 0xff);
i1 -= 6;
continue;
case 55: // '7'
//boolean flag24 = true;
continue;
case 56: // '8'
k2 = 1;
i1 -= 2;
continue;
case 57: // '9'
nn=abyte0[i5++] & 0xff;
j1 &= aint1int((nn | (abyte0[i5++] & 0xff) << 8) + i2);
k1 = j1;
i1 -= 4;
continue;
case 58: // ':'
i1 -= 2;
continue;
case 59: // ';'
//boolean flag25 = true;
continue;
case 60: // '<'
i5 += 2;
i1 -= 4;
continue;
case 61: // '='
nn=abyte0[i5++] & 0xff;
j1 &= aint1int((nn | (abyte0[i5++] & 0xff) << 8) + l1);
k1 = j1;
i1 -= 5;
continue;
case 62: // '>'
nn=abyte0[i5++] & 0xff;
k13 = (nn | (abyte0[i5++] & 0xff) << 8) + l1;
l13 = aint1int(k13);
l13 = l13 << 1 | k2;
k2 = l13 >> 8;
avoid2int(k13, k1 = l13 & 0xff);
i1 -= 7;
continue;
case 63: // '?'
//boolean flag26 = true;
continue;
case 64: // '@'
i14 = abyte0[++j2 + 256] & 0xff;
k2 = i14 & 1;
k1 = ((i14 >> 1 & 1) == 0 ? 1 : 0) | (i14 >> 7) << 7;
l3 = i14 >> 6 & 1;
l2 = i14 >> 2 & 1;
nn=abyte0[++j2 + 256] & 0xff;
k4 = nn | (abyte0[++j2 + 256] & 0xff) << 8;
i5 = k4 + (l4 = ai2[k4 >> 13]);
i1 -= 6;
continue;
case 65: // 'A'
j14 = (abyte0[i5++] + l1) & 0xff;
j14 = (abyte0[j14] & 0xff) | (abyte0[j14 + 1] & 0xff) << 8;
j1 ^= aint1int(j14);
k1 = j1;
i1 -= 6;
continue;
case 66: // 'B'
//boolean flag27 = true;
continue;
case 67: // 'C'
//boolean flag28 = true;
continue;
case 68: // 'D'
i5++;
i1 -= 3;
continue;
case 69: // 'E'
j1 ^= abyte0[abyte0[i5++] & 0xff] & 0xff;
k1 = j1;
i1 -= 3;
continue;
case 70: // 'F'
k14 = abyte0[i5++] & 0xff;
l14 = abyte0[k14] & 0xff;
k2 = l14 & 1;
abyte0[k14] = (byte)(k1 = l14 >> 1);
i1 -= 5;
continue;
case 71: // 'G'
//boolean flag29 = true;
continue;
case 72: // 'H'
abyte0[j2-- + 256] = (byte)j1;
i1 -= 3;
continue;
case 73: // 'I'
j1 ^= abyte0[i5++] & 0xff;
k1 = j1;
i1 -= 2;
continue;
case 74: // 'J'
k2 = j1 & 1;
j1 >>= 1;
k1 = j1;
i1 -= 2;
continue;
case 75: // 'K'
//boolean flag30 = true;
continue;
case 76: // 'L'
i15 = i5 - 1;
k4 = (abyte0[i5] & 0xff) | (abyte0[i5 + 1] & 0xff) << 8;
i5 = k4 + (l4 = ai2[k4 >> 13]);
i1 -= 3;
if(i5 == j4 || i5 == i15) {
i1 = 0;
continue;
}
if(!flag)
continue;
j15 = 1;
k15 = 0;
do {
if(k15 >= 100)
break;
if(ai[k15] == i5) {
ai1[k15]++;
j15 = 0;
break;
}
k15++;
} while(true);
if(j15 <= 0)
continue;
k15 = 0;
do {
if(k15 >= 100)
goto label0; // continue
if(ai1[k15] == 0) {
ai1[k15]++;
ai[k15] = i5;
goto label0; //continue
}
k15++;
} while(true);
case 77: // 'M'
nn=abyte0[i5++] & 0xff;
j1 ^= aint1int(nn | (abyte0[i5++] & 0xff) << 8);
k1 = j1;
i1 -= 4;
break;
case 78: // 'N'
nn=abyte0[i5++] & 0xff;
l15 = nn | (abyte0[i5++] & 0xff) << 8;
i16 = aint1int(l15);
k2 = i16 & 1;
avoid2int(l15, k1 = i16 >> 1);
i1 -= 6;
break;
case 79: // 'O'
// flag31 = true;
break;
case 80: // 'P'
if(l3 == 0) {
byte7 = abyte0[i5++];
i5 += byte7;
i1 -= 3;
if(byte7 < 0 && byte7 >= -5) {
byte8 = abyte0[i5];
if(byte7 == -5 && byte8 == 44)
i1 = 0;
}
} else {
i5++;
i1 -= 2;
}
break;
case 81: // 'Q'
j16 = abyte0[i5++] & 0xff;
j1 ^= aint1int(((abyte0[j16] & 0xff) | (abyte0[j16 + 1] & 0xff) << 8) + i2);
k1 = j1;
i1 -= 5;
break;