-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathcode.c
2531 lines (2498 loc) · 102 KB
/
code.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
#if 0
#include <stdlib.h>
#include <string.h>
#include <stdarg.h>
#include <stdio.h>
#include "java.h"
#include "opcode.h"
#include "log.h"
#include "memory.h"
#define T_BOOLEAN 4
#define T_CHAR 5
#define T_FLOAT 6
#define T_DOUBLE 7
#define T_BYTE 8
#define T_SHORT 9
#define T_INT 10
#define T_LONG 11
extern int
disassembleCode(u4 code_length, u1 *code)
{
u4 j, k;
int _defaultbyte, _lowbyte, _highbyte, _npairs, i;
logInfo("\t\t// Human-readable =\r\n");
for (j = 0u; j < code_length; j++)
{
k = j;
logInfo("\t\t%8i: ", j);
switch (code[j])
{
case OPCODE_nop:
logInfo("nop\r\n");
// do nothing
break;
case OPCODE_aconst_null:
logInfo("aconst_null\r\n");
// ... -> ..., null
break;
/* push value */
case OPCODE_iconst_m1:
logInfo("iconst_m1\r\n");
break;
case OPCODE_iconst_0:
logInfo("iconst_0\r\n");
break;
case OPCODE_iconst_1:
logInfo("iconst_1\r\n");
break;
case OPCODE_iconst_2:
logInfo("iconst_2\r\n");
break;
case OPCODE_iconst_3:
logInfo("iconst_3\r\n");
break;
case OPCODE_iconst_4:
logInfo("iconst_4\r\n");
break;
case OPCODE_iconst_5:
logInfo("iconst_5\r\n");
break;
case OPCODE_lconst_0:
logInfo("lconst_0\r\n");
break;
case OPCODE_lconst_1:
logInfo("lconst_1\r\n");
break;
case OPCODE_fconst_0:
logInfo("fconst_0\r\n");
break;
case OPCODE_fconst_1:
logInfo("fconst_1\r\n");
break;
case OPCODE_fconst_2:
logInfo("fconst_2\r\n");
break;
case OPCODE_dconst_0:
logInfo("dconst_0\r\n");
break;
case OPCODE_dconst_1:
logInfo("dconst_1\r\n");
break;
case OPCODE_bipush:
logInfo("bipush %i\r\n", code[++j]);
// bipush 'byte'
// ... -> ..., value
// The immediate 'byte' is sign-extended to an 'int' value
break;
case OPCODE_sipush:
logInfo("sipush %i\r\n", (code[++j] << 8) | code[++j]);
// push short
// ... -> ..., value
break;
case OPCODE_ldc:
logInfo("ldc #%i\r\n", code[++j]);
// push item from runtime constant pool
// ... -> ..., value
break;
case OPCODE_ldc_w:
logInfo("ldc_w #%i\r\n", (code[++j] << 8) | code[++j]);
// push item from runtime constant pool (wide index)
break;
case OPCODE_ldc2_w:
logInfo("ldc2_w #%i\r\n", (code[++j] << 8) | code[++j]);
// push long or double from runtime constant pool (wide index)
break;
/* load value from local variable */
// ... -> ..., objectref
case OPCODE_iload:
logInfo("iload %i\r\n", code[++j]);
break;
case OPCODE_lload:
logInfo("lload %i\r\n", code[++j]);
break;
case OPCODE_fload:
logInfo("fload %i\r\n", code[++j]);
break;
case OPCODE_dload:
logInfo("dload %i\r\n", code[++j]);
break;
case OPCODE_aload:
logInfo("aload %i\r\n", code[++j]);
break;
case OPCODE_iload_0:
logInfo("iload_0\r\n");
break;
case OPCODE_iload_1:
logInfo("iload_1\r\n");
break;
case OPCODE_iload_2:
logInfo("iload_2\r\n");
break;
case OPCODE_iload_3:
logInfo("iload_3\r\n");
break;
case OPCODE_lload_0:
logInfo("lload_0\r\n");
break;
case OPCODE_lload_1:
logInfo("lload_1\r\n");
break;
case OPCODE_lload_2:
logInfo("lload_2\r\n");
break;
case OPCODE_lload_3:
logInfo("lload_3\r\n");
break;
case OPCODE_fload_0:
logInfo("fload_0\r\n");
break;
case OPCODE_fload_1:
logInfo("fload_1\r\n");
break;
case OPCODE_fload_2:
logInfo("fload_2\r\n");
break;
case OPCODE_fload_3:
logInfo("fload_3\r\n");
break;
case OPCODE_dload_0:
logInfo("dload_0\r\n");
break;
case OPCODE_dload_1:
logInfo("dload_1\r\n");
break;
case OPCODE_dload_2:
logInfo("dload_2\r\n");
break;
case OPCODE_dload_3:
logInfo("dload_3\r\n");
break;
case OPCODE_aload_0:
logInfo("aload_0\r\n");
break;
case OPCODE_aload_1:
logInfo("aload_1\r\n");
break;
case OPCODE_aload_2:
logInfo("aload_2\r\n");
break;
case OPCODE_aload_3:
logInfo("aload_3\r\n");
break;
/* load value from array with given index */
// ..., arrayref, index -> ..., value
case OPCODE_iaload:
logInfo("iaload\r\n");
break;
case OPCODE_laload:
logInfo("laload\r\n");
break;
case OPCODE_faload:
logInfo("faload\r\n");
break;
case OPCODE_daload:
logInfo("daload\r\n");
break;
case OPCODE_aaload:
logInfo("aaload\r\n");
break;
case OPCODE_baload:
logInfo("baload\r\n");
break;
case OPCODE_caload:
logInfo("caload\r\n");
break;
case OPCODE_saload:
logInfo("saload\r\n");
break;
/* store value into given index of an array */
case OPCODE_istore:
logInfo("istore %i\r\n", code[++j]);
break;
case OPCODE_lstore:
logInfo("lstore %i\r\n", code[++j]);
break;
case OPCODE_fstore:
logInfo("fstore %i\r\n", code[++j]);
break;
case OPCODE_dstore:
logInfo("dstore %i\r\n", code[++j]);
break;
case OPCODE_astore:
logInfo("astore %i\r\n", code[++j]);
break;
case OPCODE_istore_0:
logInfo("istore_0\r\n");
break;
case OPCODE_istore_1:
logInfo("istore_1\r\n");
break;
case OPCODE_istore_2:
logInfo("istore_2\r\n");
break;
case OPCODE_istore_3:
logInfo("istore_3\r\n");
break;
case OPCODE_lstore_0:
logInfo("lstore_0\r\n");
break;
case OPCODE_lstore_1:
logInfo("lstore_1\r\n");
break;
case OPCODE_lstore_2:
logInfo("lstore_2\r\n");
break;
case OPCODE_lstore_3:
logInfo("lstore_3\r\n");
break;
case OPCODE_fstore_0:
logInfo("fstore_0\r\n");
break;
case OPCODE_fstore_1:
logInfo("fstore_1\r\n");
break;
case OPCODE_fstore_2:
logInfo("fstore_2\r\n");
break;
case OPCODE_fstore_3:
logInfo("fstore_3\r\n");
break;
case OPCODE_dstore_0:
logInfo("dstore_0\r\n");
break;
case OPCODE_dstore_1:
logInfo("dstore_1\r\n");
break;
case OPCODE_dstore_2:
logInfo("dstore_2\r\n");
break;
case OPCODE_dstore_3:
logInfo("dstore_3\r\n");
break;
case OPCODE_astore_0:
logInfo("astore_0\r\n");
break;
case OPCODE_astore_1:
logInfo("astore_1\r\n");
break;
case OPCODE_astore_2:
logInfo("astore_2\r\n");
break;
case OPCODE_astore_3:
logInfo("astore_3\r\n");
break;
/* store into array */
// ..., arrayref, index, value -> ...
case OPCODE_iastore:
logInfo("iastore\r\n");
break;
case OPCODE_lastore:
logInfo("lastore\r\n");
break;
case OPCODE_fastore:
logInfo("fastore\r\n");
break;
case OPCODE_dastore:
logInfo("dastore\r\n");
break;
case OPCODE_aastore:
logInfo("aastore\r\n");
break;
case OPCODE_bastore:
logInfo("bastore\r\n");
break;
case OPCODE_castore:
logInfo("castore\r\n");
break;
case OPCODE_sastore:
logInfo("sastore\r\n");
break;
/* stack access */
case OPCODE_pop:
logInfo("pop\r\n");
// pop the top operand stack value
// ..., value -> ...
break;
case OPCODE_pop2:
logInfo("pop2\r\n");
// pop the top one or two operand stack values
// (1) where each of value1 and value2 is a value of a category 1 computational type
// ..., value2, value1 -> ...
// (2) where value is a value of a category 2 computational type
// ..., value -> ...
break;
case OPCODE_dup:
logInfo("dup\r\n");
// duplicate the top operand stack value
// ..., value -> ..., value, value
break;
case OPCODE_dup_x1:
logInfo("dup_x1\r\n");
// duplicate the top operand stack value and insert two values down
// ..., value2, value1 -> ..., value1, value2, value1
break;
case OPCODE_dup_x2:
logInfo("dup_x2\r\n");
// duplicate the top operand stack value and insert two or three values down
// (1) when value1, value2, and value3 are all values of a category 1 computational type (§2.11.1)
// ..., value3, value2, value1 -> ..., value1, value3, value2, value1
// (2) when value1 is a value of a category 1 computational type and valu2 is a value of a category 2 computational type (§2.11.1)
// ..., value2, value1 -> ..., value1, value2, value1
break;
case OPCODE_dup2:
logInfo("dup2\r\n");
// duplicate the top one or two operand stack values
// (1) where both value1 and value2 are values of a category 1 computational type
// ..., value2, value1 -> ..., value2, value1, value2, value1
// (2) where value is a value of a category 2 computational type
// ..., value -> value, value
break;
case OPCODE_dup2_x1:
logInfo("dup2_x1\r\n");
// duplicate the top one or two operand stack values and insert two or three values down
// (1) where value1, value2 and value3 are all values of a category 1 computational type
// ..., value3, value2, value1 -> ..., value2, value1, value3, value2, value1
// (2) where value1 is a value of a category 2 computational type and value2 is a value of category 1 computational type
// ..., value2, value1 -> ..., value1, value2, value1
break;
case OPCODE_dup2_x2:
logInfo("dup2_x2\r\n");
// (1) where value1, value2, value3, and value4 are all values of a category 1 computational type
// ..., value4, value3, value2, value1 -> ..., value2, value1, value4, value2, value1
// (2) where value 1 is a value of a category 2 computational type and value2 and value3 are both values of a category 1 computational type
// ..., value3, value2, value1 -> ..., value1, value3, value2, value1
break;
case OPCODE_swap:
logInfo("swap\r\n");
// swap the top two operand stack values
break;
/* arithmetic calculation */
case OPCODE_iadd:
logInfo("iadd\r\n");
break;
case OPCODE_ladd:
logInfo("ladd\r\n");
break;
case OPCODE_fadd:
logInfo("fadd\r\n");
break;
case OPCODE_dadd:
logInfo("dadd\r\n");
break;
case OPCODE_isub:
logInfo("isub\r\n");
break;
case OPCODE_lsub:
logInfo("lsub\r\n");
break;
case OPCODE_fsub:
logInfo("fsub\r\n");
break;
case OPCODE_dsub:
logInfo("dsub\r\n");
break;
case OPCODE_imul:
logInfo("imul\r\n");
break;
case OPCODE_lmul:
logInfo("lmul\r\n");
break;
case OPCODE_fmul:
logInfo("fmul\r\n");
break;
case OPCODE_dmul:
logInfo("dmul\r\n");
break;
case OPCODE_idiv:
logInfo("idiv\r\n");
break;
case OPCODE_ldiv:
logInfo("ldiv\r\n");
break;
case OPCODE_fdiv:
logInfo("fdiv\r\n");
break;
case OPCODE_ddiv:
logInfo("ddiv\r\n");
break;
/* remainder */
case OPCODE_irem:
logInfo("irem\r\n");
break;
case OPCODE_lrem:
logInfo("lrem\r\n");
break;
case OPCODE_frem:
logInfo("frem\r\n");
break;
case OPCODE_drem:
logInfo("drem\r\n");
break;
/* negate value */
case OPCODE_ineg:
logInfo("ineg\r\n");
break;
case OPCODE_lneg:
logInfo("lneg\r\n");
break;
case OPCODE_fneg:
logInfo("fneg\r\n");
break;
case OPCODE_dneg:
logInfo("dneg\r\n");
break;
/* shift */
case OPCODE_ishl:
logInfo("ishl\r\n");
break;
case OPCODE_lshl:
logInfo("lshl\r\n");
break;
case OPCODE_ishr:
logInfo("ishr\r\n");
break;
case OPCODE_lshr:
logInfo("lshr\r\n");
break;
case OPCODE_iushr:
logInfo("iushr\r\n");
break;
case OPCODE_lushr:
logInfo("lushr\r\n");
break;
case OPCODE_iand:
logInfo("iand\r\n");
break;
case OPCODE_land:
logInfo("land\r\n");
break;
case OPCODE_ior:
logInfo("ior\r\n");
break;
case OPCODE_lor:
logInfo("lor\r\n");
break;
case OPCODE_ixor:
logInfo("ixor\r\n");
break;
case OPCODE_lxor:
logInfo("lxor\r\n");
break;
case OPCODE_iinc:
logInfo("iinc %i %i\r\n", code[++j], code[++j]);
// increment local variable by constant
break;
/* Type conversion */
case OPCODE_i2l:
logInfo("i2l\r\n");
break;
case OPCODE_i2f:
logInfo("i2f\r\n");
break;
case OPCODE_i2d:
logInfo("i2d\r\n");
break;
case OPCODE_l2i:
logInfo("l2i\r\n");
break;
case OPCODE_l2f:
logInfo("l2f\r\n");
break;
case OPCODE_l2d:
logInfo("l2d\r\n");
break;
case OPCODE_f2i:
logInfo("f2i\r\n");
break;
case OPCODE_f2l:
logInfo("f2l\r\n");
break;
case OPCODE_f2d:
logInfo("f2d\r\n");
break;
case OPCODE_d2i:
logInfo("d2i\r\n");
break;
case OPCODE_d2l:
logInfo("d2l\r\n");
break;
case OPCODE_d2f:
logInfo("d2f\r\n");
break;
case OPCODE_i2b:
logInfo("i2b\r\n");
break;
case OPCODE_i2c:
logInfo("i2c\r\n");
break;
case OPCODE_i2s:
logInfo("i2s\r\n");
break;
/* compare two values */
// if 'value1' is greater than 'value2', then int value 1 is pushed
// if equal, then int value 0 is pushed
// if 'value1' is less than 'value2', int value -1 is pushed
// otherwise, dcmpg pushes int value 1, while dcmpl pushes int value -1
case OPCODE_lcmp:
logInfo("lcmp\r\n");
break;
case OPCODE_fcmpl:
logInfo("fcmpl\r\n");
break;
case OPCODE_fcmpg:
logInfo("fcmpg\r\n");
break;
case OPCODE_dcmpl:
logInfo("dcmpl\r\n");
break;
case OPCODE_dcmpg:
logInfo("dcmpg\r\n");
break;
/* branch if int comparison with zero succeeds */
case OPCODE_ifeq:
logInfo("ifeq %i\r\n", k + ((code[++j] << 8) | code[++j]));
break;
case OPCODE_ifne:
logInfo("ifne %i\r\n", k + ((code[++j] << 8) | code[++j]));
break;
case OPCODE_iflt:
logInfo("iflt %i\r\n", k + ((code[++j] << 8) | code[++j]));
break;
case OPCODE_ifge:
logInfo("ifge %i\r\n", k + ((code[++j] << 8) | code[++j]));
break;
case OPCODE_ifgt:
logInfo("ifgt %i\r\n", k + ((code[++j] << 8) | code[++j]));
break;
case OPCODE_ifle:
logInfo("ifle %i\r\n", k + ((code[++j] << 8) | code[++j]));
break;
/* int value comparison */
case OPCODE_if_icmpeq:
logInfo("if_icmpeq %i\r\n", k + ((code[++j] << 8) | code[++j]));
break;
case OPCODE_if_icmpne:
logInfo("if_icmpne %i\r\n", k + ((code[++j] << 8) | code[++j]));
break;
case OPCODE_if_icmplt:
logInfo("if_icmplt %i\r\n", k + ((code[++j] << 8) | code[++j]));
break;
case OPCODE_if_icmpge:
logInfo("if_icmpge %i\r\n", k + ((code[++j] << 8) | code[++j]));
break;
case OPCODE_if_icmpgt:
logInfo("if_icmpgt %i\r\n", k + ((code[++j] << 8) | code[++j]));
break;
case OPCODE_if_icmple:
logInfo("if_icmple %i\r\n", k + ((code[++j] << 8) | code[++j]));
break;
/* branch if 'reference' comparison succeeds */
case OPCODE_if_acmpeq:
logInfo("if_acmpeq %i\r\n", k + ((code[++j] << 8) | code[++j]));
break;
case OPCODE_if_acmpne:
logInfo("if_acmpne %i\r\n", k + ((code[++j] << 8) | code[++j]));
break;
case OPCODE_goto:
logInfo("goto %i\r\n", k + ((code[++j] << 8) | code[++j]));
break;
case OPCODE_jsr:
logInfo("jsr %i\r\n", k + ((code[++j] << 8) | code[++j]));
break;
case OPCODE_ret:
logInfo("ret %i\r\n", code[++j]);
// return from subroutine
// no change on operand stack
break;
/* switch */
case OPCODE_tableswitch:
// make sure 'defaultbyte1' begins at an address that is a multiple of four bytes
// move 'j' across padding part to 'defaultbyte1' location
j += 4 - j % 4;
_defaultbyte = (code[j] << 24) | (code[++j] << 16) | (code[++j] << 8) | code[++j];
_lowbyte = (code[++j] << 24) | (code[++j] << 16) | (code[++j] << 8) | code[++j];
_highbyte = (code[++j] << 24) | (code[++j] << 16) | (code[++j] << 8) | code[++j];
logInfo("tableswitch %i %i %i\r\n", _defaultbyte, _lowbyte, _highbyte);
for (i = _lowbyte; i <= _highbyte; i++)
{
logInfo("\t\t\t\t%i: %i\r\n", i,
k + (code[++j] << 24) | (code[++j] << 16) | (code[++j] << 8) | code[++j]);
}
// both _lowbyte and _highbyte are inclusive
case OPCODE_lookupswitch:
// make sure 'defaultbyte1' begins at an address that is a multiple of four bytes
// move 'j' across padding part to 'defaultbyte1' location
j += 4 - j % 4;
_defaultbyte = (code[j] << 24) | (code[++j] << 16) | (code[++j] << 8) | code[++j];
_npairs = (code[++j] << 24) | (code[++j] << 16) | (code[++j] << 8) | code[++j];
if (_npairs < 0)
{
logError("Assertion Error: npairs < 0!\r\n");
return -1;
}
logInfo("lookupswitch %i %i {\r\n", _defaultbyte + k, _npairs);
for (i = 0; i < _npairs; i++)
{
logInfo("\t\t\t\t%i: %i\r\n",
k + ((code[++j] << 24) | (code[++j] << 16) | (code[++j] << 8) | code[++j]),
(code[++j] << 24) | (code[++j] << 16) | (code[++j] << 8) | code[++j]);
}
logInfo("\t\t}\r\n");
break;
/* return value from method */
case OPCODE_ireturn:
logInfo("dreturn\r\n");
break;
case OPCODE_lreturn:
logInfo("lreturn\r\n");
break;
case OPCODE_freturn:
logInfo("freturn\r\n");
break;
case OPCODE_dreturn:
logInfo("dreturn\r\n");
break;
case OPCODE_areturn:
logInfo("areturn\r\n");
break;
case OPCODE_return:
logInfo("return\r\n");
// return void from method
break;
case OPCODE_getstatic:
logInfo("getstatic %i\r\n", (code[++j] << 8) | code[++j]);
// get static field from class
break;
case OPCODE_putstatic:
logInfo("putstatic %i\r\n", (code[++j] << 8) | code[++j]);
break;
case OPCODE_getfield:
logInfo("getfield %i\r\n", (code[++j] << 8) | code[++j]);
// Fetch field from object
break;
case OPCODE_putfield:
logInfo("putfield %i\r\n", (code[++j] << 8) | code[++j]);
break;
case OPCODE_invokevirtual:
logInfo("invokevirtual #%i\r\n", (code[++j] << 8) | code[++j]);
break;
case OPCODE_invokespecial:
logInfo("invokespecial #%i\r\n", (code[++j] << 8) | code[++j]);
break;
case OPCODE_invokestatic:
logInfo("invokestatic #%i\r\n", (code[++j] << 8) | code[++j]);
break;
case OPCODE_invokeinterface:
logInfo("invokeinterface #%i %i\r\n", (code[++j] << 8) | code[++j], code[++j]);
++j;
// @see jvm7.pdf:p479
break;
case OPCODE_invokedynamic:
logInfo("invokedynamic #%i\r\n", (code[++j] << 8) | code[++j]);
j += 2;
// @see jvms7.pdf:p474
break;
case OPCODE_new:
logInfo("new #%i\r\n", (code[++j] << 8) | code[++j]);
// create new object
break;
case OPCODE_newarray:
switch (code[++j])
{
case T_BOOLEAN:
logInfo("newarray T_BOOLEAN\r\n");
break;
case T_CHAR:
logInfo("newarray T_CHAR\r\n");
break;
case T_FLOAT:
logInfo("newarray T_FLOAT\r\n");
break;
case T_DOUBLE:
logInfo("newarray T_DOUBLE\r\n");
break;
case T_BYTE:
logInfo("newarray T_BYTE\r\n");
break;
case T_SHORT:
logInfo("newarray T_SHORT\r\n");
break;
case T_INT:
logInfo("newarray T_INT\r\n");
break;
case T_LONG:
logInfo("newarray T_LONG\r\n");
break;
default:
logError("Unknow atype[%i]!\r\n", code[j]);
return -1;
}
break;
case OPCODE_anewarray:
logInfo("anewarray %i\r\n", (code[++j] << 8) | code[++j]);
break;
case OPCODE_arraylength:
logInfo("arraylength\r\n");
break;
case OPCODE_athrow:
logInfo("athrow\r\n");
break;
case OPCODE_checkcast:
logInfo("checkcast %i\r\n", (code[++j] << 8) | code[++j]);
// checkcast 'indexbyte1' 'indexbyte2'
// ..., objectref -> ..., objectref
break;
case OPCODE_instanceof:
logInfo("instanceof %i\r\n", (code[++j] << 8) | code[++j]);
break;
case OPCODE_monitorenter:
logInfo("monitorenter\r\n");
// enter monitor for object
break;
case OPCODE_monitorexit:
logInfo("monitorexit\r\n");
// exit monitor for object
break;
case OPCODE_wide:
// extend local variable index by additional bytes
switch (code[++j])
{
// (1) where <opcode> is one of <T>load or ret
case OPCODE_iload:
logInfo("wide iload %i\r\n", (code[++j] << 8) | code[++j]);
break;
case OPCODE_fload:
logInfo("wide fload %i\r\n", (code[++j] << 8) | code[++j]);
break;
case OPCODE_aload:
logInfo("wide aload %i\r\n", (code[++j] << 8) | code[++j]);
break;
case OPCODE_lload:
logInfo("wide lload %i\r\n", (code[++j] << 8) | code[++j]);
break;
case OPCODE_dload:
logInfo("wide dload %i\r\n", (code[++j] << 8) | code[++j]);
break;
case OPCODE_istore:
logInfo("wide istore %i\r\n", (code[++j] << 8) | code[++j]);
break;
case OPCODE_fstore:
logInfo("wide fstore %i\r\n", (code[++j] << 8) | code[++j]);
break;
case OPCODE_astore:
logInfo("wide astore %i\r\n", (code[++j] << 8) | code[++j]);
break;
case OPCODE_lstore:
logInfo("wide lstore %i\r\n", (code[++j] << 8) | code[++j]);
break;
case OPCODE_dstore:
logInfo("wide dstore %i\r\n", (code[++j] << 8) | code[++j]);
break;
case OPCODE_ret:
logInfo("wide ret %i\r\n", (code[++j] << 8) | code[++j]);
break;
// (2) iinc
case OPCODE_iinc:
logInfo("wide iinc %i %i\r\n", (code[++j] << 8) | code[++j], (code[++j] << 8) | code[++j]);
break;
default:
logError("Unsupported wide opcode[%i]!\r\n", code[j]);
return -1;
}
break;
case OPCODE_multianewarray:
logInfo("multianewarray %i %i\r\n", (code[++j] << 8) | code[++j], code[++j]);
// create new multi-dimensional array
break;
/* branch if reference null */
case OPCODE_ifnull:
logInfo("ifnull %i\r\n", k + ((code[++j] << 8) | code[++j]));
break;
/* branch if reference not null */
case OPCODE_ifnonnull:
logInfo("ifnonnull %i\r\n", k + ((code[++j] << 8) | code[++j]));
break;
case OPCODE_goto_w:
logInfo("goto_w %lli\r\n", k + ((code[++j] << 24) | (code[++j] << 16) | (code[++j] << 8) | code[++j]));
break;
case OPCODE_jsr_w:
logInfo("jsr_w %lli\r\n", k + ((code[++j] << 24) | (code[++j] << 16) | (code[++j] << 8) | code[++j]));
break;
/* reserved */
case OPCODE_breakpoint:
logInfo("breakpoint\r\n");
break;
case OPCODE_impdep1:
logInfo("impdep1\r\n");
break;
case OPCODE_impdep2:
logInfo("impdep2\r\n");
break;
default:
logError("Unknow OPCODE %i!\r\n", code[j]);
break;
} // switch
} // human-readable
return 0;
}
#if 1
struct _StackOutputEntry
{
u2 is_const;
u2 category;
u2 count;
u2 length;
u1 *bytes;
};
struct _StackOutput
{
u2 max;
u2 off;
struct _StackOutputEntry entries[];
};
static struct _StackOutput *sop_newStackOutput(u2 max_stack)
{
struct _StackOutput *output;
output = (struct _StackOutput *) allocMemory(1, sizeof (struct _StackOutput)
+ max_stack * sizeof (struct _StackOutputEntry));
if (!output) return (struct _StackOutput *) 0;
output->max = max_stack;
output->off = max_stack;
return output;
}
static int sop_push(struct _StackOutput *output, u2 is_const, u2 category,
u2 count, u2 length, u1 *bytes)
{
struct _StackOutputEntry *entry;
if (!output || !bytes)
return -1;
if (output->off - 1 < 0
|| output->off - 1 >= output->max)
return -1;
entry = &(output->entries[--output->off]);
entry->is_const = is_const;
entry->category = category;
entry->count = count;
entry->length = length;
entry->bytes = bytes;
return 0;
}
static int sop_push_c(struct _StackOutput *output, u2 category, u2 count, u1 *bytes)
{
return sop_push(output, 1, category, count, strlen((char *) bytes), bytes);
}
static int sop_push_e(struct _StackOutput *output, struct _StackOutputEntry *newentry)
{
struct _StackOutputEntry *entry;
if (!output)
return -1;
if (output->off - 1 < 0
|| output->off - 1 >= output->max)
return -1;
entry = &(output->entries[--output->off]);
entry->is_const = newentry->is_const;
entry->count = newentry->count;
entry->length = newentry->length;
entry->bytes = newentry->bytes;
return 0;
}
/* index 0 represents for top entry in the stack */
static struct _StackOutputEntry *sop_peek(struct _StackOutput *output, u2 index)
{
if (!output)
return (struct _StackOutputEntry *) 0;
return &(output->entries[output->off + index]);
}
static inline struct _StackOutputEntry *sop_pop(struct _StackOutput *output)
{
if (output->off < output->max)
return &(output->entries[output->off++]);
return (struct _StackOutputEntry *) 0;
}
static inline void sop_freeEntry(struct _StackOutputEntry *entry)
{
if (!entry)
return;
if (!entry->is_const)
free(entry->bytes);
}
static int sop_flush(struct _StackOutput *output)
{
struct _StackOutputEntry *entry;
char buff[0xffff];
char *str, **split;
int count, nbits, i, j, k;
if (!output)
return -1;
// create a copy of output
while (output->max > output->off)
{
entry = sop_pop(output);
count = entry->count;
split = (char **) allocMemory(count, sizeof (char *));
for (i = j = k = 0; i < entry->length; i++)
{
// move i until encounters single '%' mark
if (entry->bytes[i] == '%' && entry->bytes[++i] != '%')
{
// calculate new split string length
entry->length = i - k + 1;
// assign new split string to j-th entry
split[j] = (char *) allocMemory(entry->length, sizeof (char));
// copy
memcpy(split[j], &(entry->bytes[k]), entry->length);
// move k pointer to new search start point
k = i + 1;
}
}
for (i = count; i > 0;)
{
entry = sop_pop(output);
if (snprintf((char *) buff, entry->length + 1, split[--i], (char *) entry->bytes) < 0)
return -1;
}
}
return 0;
}
static u1 *
generateParameterFormat(int parameters_count)
{
u1 *res, *ptr;
int i;
if (parameters_count <= 0)
return (u1 *) 0;
res = (u1 *) allocMemory(parameters_count * 4 - 2, sizeof (u1));
if (!res)
return (u1 *) 0;
ptr = res;
memcpy(ptr, "%s", 2);
ptr += 2;
for (i = 1; i < parameters_count; i++)
{
memcpy(ptr, ", %s", 4);
ptr += 4;
}
return res;
}