Repository navigation
Expand file tree
/
Copy pathBytecodes.java
More file actions
1212 lines (1147 loc) · 57.3 KB
/
Copy pathBytecodes.java
File metadata and controls
1212 lines (1147 loc) · 57.3 KB
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
/*
* Copyright (c) 2009 Sun Microsystems, Inc. All rights reserved.
*
* Sun Microsystems, Inc. has intellectual property rights relating to technology embodied in the product
* that is described in this document. In particular, and without limitation, these intellectual property
* rights may include one or more of the U.S. patents listed at http://www.sun.com/patents and one or
* more additional patents or pending patent applications in the U.S. and in other countries.
*
* U.S. Government Rights - Commercial software. Government users are subject to the Sun
* Microsystems, Inc. standard license agreement and applicable provisions of the FAR and its
* supplements.
*
* Use is subject to license terms. Sun, Sun Microsystems, the Sun logo, Java and Solaris are trademarks or
* registered trademarks of Sun Microsystems, Inc. in the U.S. and other countries. All SPARC trademarks
* are used under license and are trademarks or registered trademarks of SPARC International, Inc. in the
* U.S. and other countries.
*
* UNIX is a registered trademark in the U.S. and other countries, exclusively licensed through X/Open
* Company, Ltd.
*/
package com.sun.cri.bytecode;
import static com.sun.cri.bytecode.Bytecodes.Flags.*;
import java.io.*;
import java.lang.reflect.*;
import java.util.*;
import java.util.regex.*;
/**
* The definitions of the bytecodes that are valid input to the compiler and
* related utility methods. This comprises two groups: the standard Java
* bytecodes defined by <a href=
* "http://java.sun.com/docs/books/jvms/second_edition/html/VMSpecTOC.doc.html">
* Java Virtual Machine Specification</a>, and a set of <i>extended</i>
* bytecodes that support low-level programming, for example, memory barriers.
*
* The extended bytecodes are one or three bytes in size. The one-byte bytecodes
* follow the values in the standard set, with no gap. The three-byte extended
* bytecodes share a common first byte and carry additional instruction-specific
* information in the second and third bytes.
*
*
* @author Ben L. Titzer
* @author Doug Simon
*/
public class Bytecodes {
public static final int NOP = 0; // 0x00
public static final int ACONST_NULL = 1; // 0x01
public static final int ICONST_M1 = 2; // 0x02
public static final int ICONST_0 = 3; // 0x03
public static final int ICONST_1 = 4; // 0x04
public static final int ICONST_2 = 5; // 0x05
public static final int ICONST_3 = 6; // 0x06
public static final int ICONST_4 = 7; // 0x07
public static final int ICONST_5 = 8; // 0x08
public static final int LCONST_0 = 9; // 0x09
public static final int LCONST_1 = 10; // 0x0A
public static final int FCONST_0 = 11; // 0x0B
public static final int FCONST_1 = 12; // 0x0C
public static final int FCONST_2 = 13; // 0x0D
public static final int DCONST_0 = 14; // 0x0E
public static final int DCONST_1 = 15; // 0x0F
public static final int BIPUSH = 16; // 0x10
public static final int SIPUSH = 17; // 0x11
public static final int LDC = 18; // 0x12
public static final int LDC_W = 19; // 0x13
public static final int LDC2_W = 20; // 0x14
public static final int ILOAD = 21; // 0x15
public static final int LLOAD = 22; // 0x16
public static final int FLOAD = 23; // 0x17
public static final int DLOAD = 24; // 0x18
public static final int ALOAD = 25; // 0x19
public static final int ILOAD_0 = 26; // 0x1A
public static final int ILOAD_1 = 27; // 0x1B
public static final int ILOAD_2 = 28; // 0x1C
public static final int ILOAD_3 = 29; // 0x1D
public static final int LLOAD_0 = 30; // 0x1E
public static final int LLOAD_1 = 31; // 0x1F
public static final int LLOAD_2 = 32; // 0x20
public static final int LLOAD_3 = 33; // 0x21
public static final int FLOAD_0 = 34; // 0x22
public static final int FLOAD_1 = 35; // 0x23
public static final int FLOAD_2 = 36; // 0x24
public static final int FLOAD_3 = 37; // 0x25
public static final int DLOAD_0 = 38; // 0x26
public static final int DLOAD_1 = 39; // 0x27
public static final int DLOAD_2 = 40; // 0x28
public static final int DLOAD_3 = 41; // 0x29
public static final int ALOAD_0 = 42; // 0x2A
public static final int ALOAD_1 = 43; // 0x2B
public static final int ALOAD_2 = 44; // 0x2C
public static final int ALOAD_3 = 45; // 0x2D
public static final int IALOAD = 46; // 0x2E
public static final int LALOAD = 47; // 0x2F
public static final int FALOAD = 48; // 0x30
public static final int DALOAD = 49; // 0x31
public static final int AALOAD = 50; // 0x32
public static final int BALOAD = 51; // 0x33
public static final int CALOAD = 52; // 0x34
public static final int SALOAD = 53; // 0x35
public static final int ISTORE = 54; // 0x36
public static final int LSTORE = 55; // 0x37
public static final int FSTORE = 56; // 0x38
public static final int DSTORE = 57; // 0x39
public static final int ASTORE = 58; // 0x3A
public static final int ISTORE_0 = 59; // 0x3B
public static final int ISTORE_1 = 60; // 0x3C
public static final int ISTORE_2 = 61; // 0x3D
public static final int ISTORE_3 = 62; // 0x3E
public static final int LSTORE_0 = 63; // 0x3F
public static final int LSTORE_1 = 64; // 0x40
public static final int LSTORE_2 = 65; // 0x41
public static final int LSTORE_3 = 66; // 0x42
public static final int FSTORE_0 = 67; // 0x43
public static final int FSTORE_1 = 68; // 0x44
public static final int FSTORE_2 = 69; // 0x45
public static final int FSTORE_3 = 70; // 0x46
public static final int DSTORE_0 = 71; // 0x47
public static final int DSTORE_1 = 72; // 0x48
public static final int DSTORE_2 = 73; // 0x49
public static final int DSTORE_3 = 74; // 0x4A
public static final int ASTORE_0 = 75; // 0x4B
public static final int ASTORE_1 = 76; // 0x4C
public static final int ASTORE_2 = 77; // 0x4D
public static final int ASTORE_3 = 78; // 0x4E
public static final int IASTORE = 79; // 0x4F
public static final int LASTORE = 80; // 0x50
public static final int FASTORE = 81; // 0x51
public static final int DASTORE = 82; // 0x52
public static final int AASTORE = 83; // 0x53
public static final int BASTORE = 84; // 0x54
public static final int CASTORE = 85; // 0x55
public static final int SASTORE = 86; // 0x56
public static final int POP = 87; // 0x57
public static final int POP2 = 88; // 0x58
public static final int DUP = 89; // 0x59
public static final int DUP_X1 = 90; // 0x5A
public static final int DUP_X2 = 91; // 0x5B
public static final int DUP2 = 92; // 0x5C
public static final int DUP2_X1 = 93; // 0x5D
public static final int DUP2_X2 = 94; // 0x5E
public static final int SWAP = 95; // 0x5F
public static final int IADD = 96; // 0x60
public static final int LADD = 97; // 0x61
public static final int FADD = 98; // 0x62
public static final int DADD = 99; // 0x63
public static final int ISUB = 100; // 0x64
public static final int LSUB = 101; // 0x65
public static final int FSUB = 102; // 0x66
public static final int DSUB = 103; // 0x67
public static final int IMUL = 104; // 0x68
public static final int LMUL = 105; // 0x69
public static final int FMUL = 106; // 0x6A
public static final int DMUL = 107; // 0x6B
public static final int IDIV = 108; // 0x6C
public static final int LDIV = 109; // 0x6D
public static final int FDIV = 110; // 0x6E
public static final int DDIV = 111; // 0x6F
public static final int IREM = 112; // 0x70
public static final int LREM = 113; // 0x71
public static final int FREM = 114; // 0x72
public static final int DREM = 115; // 0x73
public static final int INEG = 116; // 0x74
public static final int LNEG = 117; // 0x75
public static final int FNEG = 118; // 0x76
public static final int DNEG = 119; // 0x77
public static final int ISHL = 120; // 0x78
public static final int LSHL = 121; // 0x79
public static final int ISHR = 122; // 0x7A
public static final int LSHR = 123; // 0x7B
public static final int IUSHR = 124; // 0x7C
public static final int LUSHR = 125; // 0x7D
public static final int IAND = 126; // 0x7E
public static final int LAND = 127; // 0x7F
public static final int IOR = 128; // 0x80
public static final int LOR = 129; // 0x81
public static final int IXOR = 130; // 0x82
public static final int LXOR = 131; // 0x83
public static final int IINC = 132; // 0x84
public static final int I2L = 133; // 0x85
public static final int I2F = 134; // 0x86
public static final int I2D = 135; // 0x87
public static final int L2I = 136; // 0x88
public static final int L2F = 137; // 0x89
public static final int L2D = 138; // 0x8A
public static final int F2I = 139; // 0x8B
public static final int F2L = 140; // 0x8C
public static final int F2D = 141; // 0x8D
public static final int D2I = 142; // 0x8E
public static final int D2L = 143; // 0x8F
public static final int D2F = 144; // 0x90
public static final int I2B = 145; // 0x91
public static final int I2C = 146; // 0x92
public static final int I2S = 147; // 0x93
public static final int LCMP = 148; // 0x94
public static final int FCMPL = 149; // 0x95
public static final int FCMPG = 150; // 0x96
public static final int DCMPL = 151; // 0x97
public static final int DCMPG = 152; // 0x98
public static final int IFEQ = 153; // 0x99
public static final int IFNE = 154; // 0x9A
public static final int IFLT = 155; // 0x9B
public static final int IFGE = 156; // 0x9C
public static final int IFGT = 157; // 0x9D
public static final int IFLE = 158; // 0x9E
public static final int IF_ICMPEQ = 159; // 0x9F
public static final int IF_ICMPNE = 160; // 0xA0
public static final int IF_ICMPLT = 161; // 0xA1
public static final int IF_ICMPGE = 162; // 0xA2
public static final int IF_ICMPGT = 163; // 0xA3
public static final int IF_ICMPLE = 164; // 0xA4
public static final int IF_ACMPEQ = 165; // 0xA5
public static final int IF_ACMPNE = 166; // 0xA6
public static final int GOTO = 167; // 0xA7
public static final int JSR = 168; // 0xA8
public static final int RET = 169; // 0xA9
public static final int TABLESWITCH = 170; // 0xAA
public static final int LOOKUPSWITCH = 171; // 0xAB
public static final int IRETURN = 172; // 0xAC
public static final int LRETURN = 173; // 0xAD
public static final int FRETURN = 174; // 0xAE
public static final int DRETURN = 175; // 0xAF
public static final int ARETURN = 176; // 0xB0
public static final int RETURN = 177; // 0xB1
public static final int GETSTATIC = 178; // 0xB2
public static final int PUTSTATIC = 179; // 0xB3
public static final int GETFIELD = 180; // 0xB4
public static final int PUTFIELD = 181; // 0xB5
public static final int INVOKEVIRTUAL = 182; // 0xB6
public static final int INVOKESPECIAL = 183; // 0xB7
public static final int INVOKESTATIC = 184; // 0xB8
public static final int INVOKEINTERFACE = 185; // 0xB9
public static final int XXXUNUSEDXXX = 186; // 0xBA
public static final int NEW = 187; // 0xBB
public static final int NEWARRAY = 188; // 0xBC
public static final int ANEWARRAY = 189; // 0xBD
public static final int ARRAYLENGTH = 190; // 0xBE
public static final int ATHROW = 191; // 0xBF
public static final int CHECKCAST = 192; // 0xC0
public static final int INSTANCEOF = 193; // 0xC1
public static final int MONITORENTER = 194; // 0xC2
public static final int MONITOREXIT = 195; // 0xC3
public static final int WIDE = 196; // 0xC4
public static final int MULTIANEWARRAY = 197; // 0xC5
public static final int IFNULL = 198; // 0xC6
public static final int IFNONNULL = 199; // 0xC7
public static final int GOTO_W = 200; // 0xC8
public static final int JSR_W = 201; // 0xC9
public static final int BREAKPOINT = 202; // 0xCA
/**
* Constants and {@link INTRINSIC} definitions for unsigned comparisons.
*/
public static class UnsignedComparisons {
public static final int ABOVE_THAN = 1;
public static final int ABOVE_EQUAL = 2;
public static final int BELOW_THAN = 3;
public static final int BELOW_EQUAL = 4;
}
/**
* Constants for memory barriers.
*
* The documentation for each constant is taken from Doug Lea's
* <a href="http://gee.cs.oswego.edu/dl/jmm/cookbook.html">The JSR-133 Cookbook for Compiler Writers</a>.
*/
public static class MemoryBarriers {
/**
* The sequence {@code Load1; LoadLoad; Load2} ensures that {@code Load1}'s data are loaded before data accessed
* by {@code Load2} and all subsequent load instructions are loaded. In general, explicit {@code LoadLoad}
* barriers are needed on processors that perform speculative loads and/or out-of-order processing in which
* waiting load instructions can bypass waiting stores. On processors that guarantee to always preserve load
* ordering, these barriers amount to no-ops.
*/
public static final int LOAD_LOAD = 0x0001;
/**
* The sequence {@code Load1; LoadStore; Store2} ensures that {@code Load1}'s data are loaded before all data
* associated with {@code Store2} and subsequent store instructions are flushed. {@code LoadStore} barriers are
* needed only on those out-of-order processors in which waiting store instructions can bypass loads.
*/
public static final int LOAD_STORE = 0x0002;
/**
* The sequence {@code Store1; StoreLoad; Load2} ensures that {@code Store1}'s data are made visible to other
* processors (i.e., flushed to main memory) before data accessed by {@code Load2} and all subsequent load
* instructions are loaded. {@code StoreLoad} barriers protect against a subsequent load incorrectly using
* {@code Store1}'s data value rather than that from a more recent store to the same location performed by a
* different processor. Because of this, on the processors discussed below, a {@code StoreLoad} is strictly
* necessary only for separating stores from subsequent loads of the same location(s) as were stored before the
* barrier. {@code StoreLoad} barriers are needed on nearly all recent multiprocessors, and are usually the most
* expensive kind. Part of the reason they are expensive is that they must disable mechanisms that ordinarily
* bypass cache to satisfy loads from write-buffers. This might be implemented by letting the buffer fully
* flush, among other possible stalls.
*/
public static final int STORE_LOAD = 0x0004;
/**
* The sequence {@code Store1; StoreStore; Store2} ensures that {@code Store1}'s data are visible to other
* processors (i.e., flushed to memory) before the data associated with {@code Store2} and all subsequent store
* instructions. In general, {@code StoreStore} barriers are needed on processors that do not otherwise
* guarantee strict ordering of flushes from write buffers and/or caches to other processors or main memory.
*/
public static final int STORE_STORE = 0x0008;
public static final int MEMOP_STORE = STORE_STORE | LOAD_STORE;
public static final int FENCE = LOAD_LOAD | LOAD_STORE | STORE_STORE | STORE_LOAD;
}
public static final int ILLEGAL = 255;
public static final int END = 256;
/**
* The last opcode defined by the JVM specification. To iterate over all JVM bytecodes:
* <pre>
* for (int opcode = 0; opcode <= Bytecodes.LAST_JVM_OPCODE; ++opcode) {
* //
* }
* </pre>
*/
public static final int LAST_JVM_OPCODE = JSR_W;
/**
* A collection of flags describing various bytecode attributes.
*/
static class Flags {
/**
* Denotes an instruction that ends a basic block and does not let control flow fall through to its lexical successor.
*/
static final int STOP = 0x00000001;
/**
* Denotes an instruction that ends a basic block and may let control flow fall through to its lexical successor.
* In practice this means it is a conditional branch.
*/
static final int FALL_THROUGH = 0x00000002;
/**
* Denotes an instruction that has a 2 or 4 byte operand that is an offset to another instruction in the same method.
* This does not include the {@link Bytecodes#TABLESWITCH} or {@link Bytecodes#LOOKUPSWITCH} instructions.
*/
static final int BRANCH = 0x00000004;
/**
* Denotes an instruction that reads the value of a static or instance field.
*/
static final int FIELD_READ = 0x00000008;
/**
* Denotes an instruction that writes the value of a static or instance field.
*/
static final int FIELD_WRITE = 0x00000010;
/**
* Denotes an instruction that is not defined in the JVM specification.
*/
static final int EXTENSION = 0x00000020;
/**
* Denotes an instruction that can cause an implicit exception.
*/
static final int TRAP = 0x00000080;
/**
* Denotes an instruction that is commutative.
*/
static final int COMMUTATIVE = 0x00000100;
/**
* Denotes an instruction that is associative.
*/
static final int ASSOCIATIVE = 0x00000200;
/**
* Denotes an instruction that loads an operand.
*/
static final int LOAD = 0x00000400;
/**
* Denotes an instruction that stores an operand.
*/
static final int STORE = 0x00000800;
}
// Performs a sanity check that none of the flags overlap.
static {
int allFlags = 0;
try {
for (Field field : Flags.class.getDeclaredFields()) {
int flagsFilter = Modifier.FINAL | Modifier.STATIC;
if ((field.getModifiers() & flagsFilter) == flagsFilter) {
assert field.getType() == int.class : "Only " + field;
final int flag = field.getInt(null);
assert flag != 0;
assert (flag & allFlags) == 0 : field.getName() + " has a value conflicting with another flag";
allFlags |= flag;
}
}
} catch (Exception e) {
throw new InternalError(e.toString());
}
}
/**
* A array that maps from a bytecode value to a {@link String} for the corresponding instruction mnemonic.
* This will include the root instruction for the three-byte extended instructions.
*/
private static final String[] names = new String[256];
/**
* Maps from a three-byte extended bytecode value to a {@link String} for the corresponding instruction mnemonic.
*/
private static final HashMap<Integer, String> threeByteExtNames = new HashMap<Integer, String>();
/**
* A array that maps from a bytecode value to the set of {@link Flags} for the corresponding instruction.
*/
private static final int[] flags = new int[256];
/**
* A array that maps from a bytecode value to the length in bytes for the corresponding instruction.
*/
private static final int[] length = new int[256];
// Checkstyle: stop
static {
def(NOP , "nop" , "b" );
def(ACONST_NULL , "aconst_null" , "b" );
def(ICONST_M1 , "iconst_m1" , "b" );
def(ICONST_0 , "iconst_0" , "b" );
def(ICONST_1 , "iconst_1" , "b" );
def(ICONST_2 , "iconst_2" , "b" );
def(ICONST_3 , "iconst_3" , "b" );
def(ICONST_4 , "iconst_4" , "b" );
def(ICONST_5 , "iconst_5" , "b" );
def(LCONST_0 , "lconst_0" , "b" );
def(LCONST_1 , "lconst_1" , "b" );
def(FCONST_0 , "fconst_0" , "b" );
def(FCONST_1 , "fconst_1" , "b" );
def(FCONST_2 , "fconst_2" , "b" );
def(DCONST_0 , "dconst_0" , "b" );
def(DCONST_1 , "dconst_1" , "b" );
def(BIPUSH , "bipush" , "bc" );
def(SIPUSH , "sipush" , "bcc" );
def(LDC , "ldc" , "bi" , TRAP);
def(LDC_W , "ldc_w" , "bii" , TRAP);
def(LDC2_W , "ldc2_w" , "bii" , TRAP);
def(ILOAD , "iload" , "bi" , LOAD);
def(LLOAD , "lload" , "bi" , LOAD);
def(FLOAD , "fload" , "bi" , LOAD);
def(DLOAD , "dload" , "bi" , LOAD);
def(ALOAD , "aload" , "bi" , LOAD);
def(ILOAD_0 , "iload_0" , "b" , LOAD);
def(ILOAD_1 , "iload_1" , "b" , LOAD);
def(ILOAD_2 , "iload_2" , "b" , LOAD);
def(ILOAD_3 , "iload_3" , "b" , LOAD);
def(LLOAD_0 , "lload_0" , "b" , LOAD);
def(LLOAD_1 , "lload_1" , "b" , LOAD);
def(LLOAD_2 , "lload_2" , "b" , LOAD);
def(LLOAD_3 , "lload_3" , "b" , LOAD);
def(FLOAD_0 , "fload_0" , "b" , LOAD);
def(FLOAD_1 , "fload_1" , "b" , LOAD);
def(FLOAD_2 , "fload_2" , "b" , LOAD);
def(FLOAD_3 , "fload_3" , "b" , LOAD);
def(DLOAD_0 , "dload_0" , "b" , LOAD);
def(DLOAD_1 , "dload_1" , "b" , LOAD);
def(DLOAD_2 , "dload_2" , "b" , LOAD);
def(DLOAD_3 , "dload_3" , "b" , LOAD);
def(ALOAD_0 , "aload_0" , "b" , LOAD);
def(ALOAD_1 , "aload_1" , "b" , LOAD);
def(ALOAD_2 , "aload_2" , "b" , LOAD);
def(ALOAD_3 , "aload_3" , "b" , LOAD);
def(IALOAD , "iaload" , "b" , TRAP);
def(LALOAD , "laload" , "b" , TRAP);
def(FALOAD , "faload" , "b" , TRAP);
def(DALOAD , "daload" , "b" , TRAP);
def(AALOAD , "aaload" , "b" , TRAP);
def(BALOAD , "baload" , "b" , TRAP);
def(CALOAD , "caload" , "b" , TRAP);
def(SALOAD , "saload" , "b" , TRAP);
def(ISTORE , "istore" , "bi" , STORE);
def(LSTORE , "lstore" , "bi" , STORE);
def(FSTORE , "fstore" , "bi" , STORE);
def(DSTORE , "dstore" , "bi" , STORE);
def(ASTORE , "astore" , "bi" , STORE);
def(ISTORE_0 , "istore_0" , "b" , STORE);
def(ISTORE_1 , "istore_1" , "b" , STORE);
def(ISTORE_2 , "istore_2" , "b" , STORE);
def(ISTORE_3 , "istore_3" , "b" , STORE);
def(LSTORE_0 , "lstore_0" , "b" , STORE);
def(LSTORE_1 , "lstore_1" , "b" , STORE);
def(LSTORE_2 , "lstore_2" , "b" , STORE);
def(LSTORE_3 , "lstore_3" , "b" , STORE);
def(FSTORE_0 , "fstore_0" , "b" , STORE);
def(FSTORE_1 , "fstore_1" , "b" , STORE);
def(FSTORE_2 , "fstore_2" , "b" , STORE);
def(FSTORE_3 , "fstore_3" , "b" , STORE);
def(DSTORE_0 , "dstore_0" , "b" , STORE);
def(DSTORE_1 , "dstore_1" , "b" , STORE);
def(DSTORE_2 , "dstore_2" , "b" , STORE);
def(DSTORE_3 , "dstore_3" , "b" , STORE);
def(ASTORE_0 , "astore_0" , "b" , STORE);
def(ASTORE_1 , "astore_1" , "b" , STORE);
def(ASTORE_2 , "astore_2" , "b" , STORE);
def(ASTORE_3 , "astore_3" , "b" , STORE);
def(IASTORE , "iastore" , "b" , TRAP);
def(LASTORE , "lastore" , "b" , TRAP);
def(FASTORE , "fastore" , "b" , TRAP);
def(DASTORE , "dastore" , "b" , TRAP);
def(AASTORE , "aastore" , "b" , TRAP);
def(BASTORE , "bastore" , "b" , TRAP);
def(CASTORE , "castore" , "b" , TRAP);
def(SASTORE , "sastore" , "b" , TRAP);
def(POP , "pop" , "b" );
def(POP2 , "pop2" , "b" );
def(DUP , "dup" , "b" );
def(DUP_X1 , "dup_x1" , "b" );
def(DUP_X2 , "dup_x2" , "b" );
def(DUP2 , "dup2" , "b" );
def(DUP2_X1 , "dup2_x1" , "b" );
def(DUP2_X2 , "dup2_x2" , "b" );
def(SWAP , "swap" , "b" );
def(IADD , "iadd" , "b" , COMMUTATIVE | ASSOCIATIVE);
def(LADD , "ladd" , "b" , COMMUTATIVE | ASSOCIATIVE);
def(FADD , "fadd" , "b" , COMMUTATIVE | ASSOCIATIVE);
def(DADD , "dadd" , "b" , COMMUTATIVE | ASSOCIATIVE);
def(ISUB , "isub" , "b" );
def(LSUB , "lsub" , "b" );
def(FSUB , "fsub" , "b" );
def(DSUB , "dsub" , "b" );
def(IMUL , "imul" , "b" , COMMUTATIVE | ASSOCIATIVE);
def(LMUL , "lmul" , "b" , COMMUTATIVE | ASSOCIATIVE);
def(FMUL , "fmul" , "b" , COMMUTATIVE | ASSOCIATIVE);
def(DMUL , "dmul" , "b" , COMMUTATIVE | ASSOCIATIVE);
def(IDIV , "idiv" , "b" , TRAP);
def(LDIV , "ldiv" , "b" , TRAP);
def(FDIV , "fdiv" , "b" );
def(DDIV , "ddiv" , "b" );
def(IREM , "irem" , "b" , TRAP);
def(LREM , "lrem" , "b" , TRAP);
def(FREM , "frem" , "b" );
def(DREM , "drem" , "b" );
def(INEG , "ineg" , "b" );
def(LNEG , "lneg" , "b" );
def(FNEG , "fneg" , "b" );
def(DNEG , "dneg" , "b" );
def(ISHL , "ishl" , "b" );
def(LSHL , "lshl" , "b" );
def(ISHR , "ishr" , "b" );
def(LSHR , "lshr" , "b" );
def(IUSHR , "iushr" , "b" );
def(LUSHR , "lushr" , "b" );
def(IAND , "iand" , "b" , COMMUTATIVE | ASSOCIATIVE);
def(LAND , "land" , "b" , COMMUTATIVE | ASSOCIATIVE);
def(IOR , "ior" , "b" , COMMUTATIVE | ASSOCIATIVE);
def(LOR , "lor" , "b" , COMMUTATIVE | ASSOCIATIVE);
def(IXOR , "ixor" , "b" , COMMUTATIVE | ASSOCIATIVE);
def(LXOR , "lxor" , "b" , COMMUTATIVE | ASSOCIATIVE);
def(IINC , "iinc" , "bic" , LOAD | STORE);
def(I2L , "i2l" , "b" );
def(I2F , "i2f" , "b" );
def(I2D , "i2d" , "b" );
def(L2I , "l2i" , "b" );
def(L2F , "l2f" , "b" );
def(L2D , "l2d" , "b" );
def(F2I , "f2i" , "b" );
def(F2L , "f2l" , "b" );
def(F2D , "f2d" , "b" );
def(D2I , "d2i" , "b" );
def(D2L , "d2l" , "b" );
def(D2F , "d2f" , "b" );
def(I2B , "i2b" , "b" );
def(I2C , "i2c" , "b" );
def(I2S , "i2s" , "b" );
def(LCMP , "lcmp" , "b" );
def(FCMPL , "fcmpl" , "b" );
def(FCMPG , "fcmpg" , "b" );
def(DCMPL , "dcmpl" , "b" );
def(DCMPG , "dcmpg" , "b" );
def(IFEQ , "ifeq" , "boo" , FALL_THROUGH | BRANCH);
def(IFNE , "ifne" , "boo" , FALL_THROUGH | BRANCH);
def(IFLT , "iflt" , "boo" , FALL_THROUGH | BRANCH);
def(IFGE , "ifge" , "boo" , FALL_THROUGH | BRANCH);
def(IFGT , "ifgt" , "boo" , FALL_THROUGH | BRANCH);
def(IFLE , "ifle" , "boo" , FALL_THROUGH | BRANCH);
def(IF_ICMPEQ , "if_icmpeq" , "boo" , COMMUTATIVE | FALL_THROUGH | BRANCH);
def(IF_ICMPNE , "if_icmpne" , "boo" , COMMUTATIVE | FALL_THROUGH | BRANCH);
def(IF_ICMPLT , "if_icmplt" , "boo" , FALL_THROUGH | BRANCH);
def(IF_ICMPGE , "if_icmpge" , "boo" , FALL_THROUGH | BRANCH);
def(IF_ICMPGT , "if_icmpgt" , "boo" , FALL_THROUGH | BRANCH);
def(IF_ICMPLE , "if_icmple" , "boo" , FALL_THROUGH | BRANCH);
def(IF_ACMPEQ , "if_acmpeq" , "boo" , COMMUTATIVE | FALL_THROUGH | BRANCH);
def(IF_ACMPNE , "if_acmpne" , "boo" , COMMUTATIVE | FALL_THROUGH | BRANCH);
def(GOTO , "goto" , "boo" , STOP | BRANCH);
def(JSR , "jsr" , "boo" , STOP | BRANCH);
def(RET , "ret" , "bi" , STOP);
def(TABLESWITCH , "tableswitch" , "" , STOP);
def(LOOKUPSWITCH , "lookupswitch" , "" , STOP);
def(IRETURN , "ireturn" , "b" , TRAP | STOP);
def(LRETURN , "lreturn" , "b" , TRAP | STOP);
def(FRETURN , "freturn" , "b" , TRAP | STOP);
def(DRETURN , "dreturn" , "b" , TRAP | STOP);
def(ARETURN , "areturn" , "b" , TRAP | STOP);
def(RETURN , "return" , "b" , TRAP | STOP);
def(GETSTATIC , "getstatic" , "bjj" , TRAP | FIELD_READ);
def(PUTSTATIC , "putstatic" , "bjj" , TRAP | FIELD_WRITE);
def(GETFIELD , "getfield" , "bjj" , TRAP | FIELD_READ);
def(PUTFIELD , "putfield" , "bjj" , TRAP | FIELD_WRITE);
def(INVOKEVIRTUAL , "invokevirtual" , "bjj" , TRAP);
def(INVOKESPECIAL , "invokespecial" , "bjj" , TRAP);
def(INVOKESTATIC , "invokestatic" , "bjj" , TRAP);
def(INVOKEINTERFACE , "invokeinterface" , "bjja_", TRAP);
def(XXXUNUSEDXXX , "xxxunusedxxx" , "" );
def(NEW , "new" , "bii" , TRAP);
def(NEWARRAY , "newarray" , "bc" , TRAP);
def(ANEWARRAY , "anewarray" , "bii" , TRAP);
def(ARRAYLENGTH , "arraylength" , "b" , TRAP);
def(ATHROW , "athrow" , "b" , TRAP | STOP);
def(CHECKCAST , "checkcast" , "bii" , TRAP);
def(INSTANCEOF , "instanceof" , "bii" , TRAP);
def(MONITORENTER , "monitorenter" , "b" , TRAP);
def(MONITOREXIT , "monitorexit" , "b" , TRAP);
def(WIDE , "wide" , "" );
def(MULTIANEWARRAY , "multianewarray" , "biic" , TRAP);
def(IFNULL , "ifnull" , "boo" , FALL_THROUGH | BRANCH);
def(IFNONNULL , "ifnonnull" , "boo" , FALL_THROUGH | BRANCH);
def(GOTO_W , "goto_w" , "boooo", STOP | BRANCH);
def(JSR_W , "jsr_w" , "boooo", STOP | BRANCH);
def(BREAKPOINT , "breakpoint" , "b" , TRAP);
}
// Checkstyle: resume
/**
* Determines if an opcode is commutative.
* @param opcode the opcode to check
* @return {@code true} iff commutative
*/
public static boolean isCommutative(int opcode) {
return (flags[opcode & 0xff] & COMMUTATIVE) != 0;
}
/**
* Gets the length of an instruction denoted by a given opcode.
*
* @param opcode an instruction opcode
* @return the length of the instruction denoted by {@code opcode}. If {@code opcode} is an illegal instruction or denotes a
* variable length instruction (e.g. {@link #TABLESWITCH}), then 0 is returned.
*/
public static int lengthOf(int opcode) {
return length[opcode & 0xff];
}
/**
* Gets the length of an instruction at a given position in a given bytecode array.
* This methods handles variable length and {@linkplain #WIDE widened} instructions.
*
* @param code an array of bytecode
* @param bci the position in {@code code} of an instruction's opcode
* @return the length of the instruction at position {@code bci} in {@code code}
*/
public static int lengthOf(byte[] code, int bci) {
int opcode = Bytes.beU1(code, bci);
int length = Bytecodes.length[opcode & 0xff];
if (length == 0) {
switch (opcode) {
case TABLESWITCH: {
return new BytecodeTableSwitch(code, bci).size();
}
case LOOKUPSWITCH: {
return new BytecodeLookupSwitch(code, bci).size();
}
case WIDE: {
int opc = Bytes.beU1(code, bci + 1);
if (opc == RET) {
return 4;
} else if (opc == IINC) {
return 6;
} else {
return 4; // a load or store bytecode
}
}
default:
throw new Error("unknown variable-length bytecode: " + opcode);
}
}
return length;
}
/**
* Gets the lower-case mnemonic for a given opcode.
*
* @param opcode an opcode
* @return the mnemonic for {@code opcode} or {@code "<illegal opcode: " + opcode + ">"} if {@code opcode} is not a legal opcode
*/
public static String nameOf(int opcode) throws IllegalArgumentException {
String extName = threeByteExtNames.get(Integer.valueOf(opcode));
if (extName != null) {
return extName;
}
String name = names[opcode & 0xff];
if (name == null) {
return "<illegal opcode: " + opcode + ">";
}
return name;
}
/**
* Allocation-free version of {@linkplain #nameOf(int)}.
* @param opcode an opcode.
* @return the mnemonic for {@code opcode} or {@code "<illegal opcode>"} if {@code opcode} is not a legal opcode.
*/
public static String baseNameOf(int opcode) {
String name = names[opcode & 0xff];
if (name == null) {
return "<illegal opcode>";
}
return name;
}
/**
* Gets the opcode corresponding to a given mnemonic.
*
* @param name an opcode mnemonic
* @return the opcode corresponding to {@code mnemonic}
* @throws IllegalArgumentException if {@code name} does not denote a valid opcode
*/
public static int valueOf(String name) {
for (int opcode = 0; opcode < names.length; ++opcode) {
if (name.equalsIgnoreCase(names[opcode])) {
return opcode;
}
}
for (Map.Entry<Integer, String> entry : threeByteExtNames.entrySet()) {
if (entry.getValue().equalsIgnoreCase(name)) {
return entry.getKey();
}
}
throw new IllegalArgumentException("No opcode for " + name);
}
/**
* Determines if a given opcode denotes an instruction that can cause an implicit exception.
*
* @param opcode an opcode to test
* @return {@code true} iff {@code opcode} can cause an implicit exception, {@code false} otherwise
*/
public static boolean canTrap(int opcode) {
return (flags[opcode & 0xff] & TRAP) != 0;
}
/**
* Determines if a given opcode denotes an instruction that loads a local variable to the operand stack.
*
* @param opcode an opcode to test
* @return {@code true} iff {@code opcode} loads a local variable to the operand stack, {@code false} otherwise
*/
public static boolean isLoad(int opcode) {
return (flags[opcode & 0xff] & LOAD) != 0;
}
/**
* Determines if a given opcode denotes an instruction that ends a basic block and does not let control flow fall
* through to its lexical successor.
*
* @param opcode an opcode to test
* @return {@code true} iff {@code opcode} properly ends a basic block
*/
public static boolean isStop(int opcode) {
return (flags[opcode & 0xff] & STOP) != 0;
}
/**
* Determines if a given opcode denotes an instruction that stores a value to a local variable
* after popping it from the operand stack.
*
* @param opcode an opcode to test
* @return {@code true} iff {@code opcode} stores a value to a local variable, {@code false} otherwise
*/
public static boolean isStore(int opcode) {
return (flags[opcode & 0xff] & STORE) != 0;
}
/**
* Determines if a given opcode is an instruction that delimits a basic block.
*
* @param opcode an opcode to test
* @return {@code true} iff {@code opcode} delimits a basic block
*/
public static boolean isBlockEnd(int opcode) {
return (flags[opcode & 0xff] & (STOP | FALL_THROUGH)) != 0;
}
/**
* Determines if a given opcode is an instruction that has a 2 or 4 byte operand that is an offset to another
* instruction in the same method. This does not include the {@linkplain #TABLESWITCH switch} instructions.
*
* @param opcode an opcode to test
* @return {@code true} iff {@code opcode} is a branch instruction with a single operand
*/
public static boolean isBranch(int opcode) {
return (flags[opcode & 0xff] & BRANCH) != 0;
}
/**
* Determines if a given opcode denotes a conditional branch.
* @param opcode
* @return {@code true} iff {@code opcode} is a conditional branch
*/
public static boolean isConditionalBranch(int opcode) {
return (flags[opcode & 0xff] & FALL_THROUGH) != 0;
}
/**
* Determines if a given opcode denotes a standard bytecode. A standard bytecode is
* defined in the JVM specification.
*
* @param opcode an opcode to test
* @return {@code true} iff {@code opcode} is a standard bytecode
*/
public static boolean isStandard(int opcode) {
return (flags[opcode & 0xff] & EXTENSION) == 0;
}
/**
* Determines if a given opcode denotes an extended bytecode.
*
* @param opcode an opcode to test
* @return {@code true} if {@code opcode} is an extended bytecode
*/
public static boolean isExtended(int opcode) {
return (flags[opcode & 0xff] & EXTENSION) != 0;
}
/**
* Determines if a given opcode is a three-byte extended bytecode.
*
* @param opcode an opcode to test
* @return {@code true} if {@code (opcode & ~0xff) != 0}
*/
public static boolean isThreeByteExtended(int opcode) {
return (opcode & ~0xff) != 0;
}
/**
* Gets the arithmetic operator name for a given opcode. If {@code opcode} does not denote an
* arithmetic instruction, then the {@linkplain #nameOf(int) name} of the opcode is returned
* instead.
*
* @param op an opcode
* @return the arithmetic operator name
*/
public static String operator(int op) {
switch (op) {
// arithmetic ops
case IADD : // fall through
case LADD : // fall through
case FADD : // fall through
case DADD : return "+";
case ISUB : // fall through
case LSUB : // fall through
case FSUB : // fall through
case DSUB : return "-";
case IMUL : // fall through
case LMUL : // fall through
case FMUL : // fall through
case DMUL : return "*";
case IDIV : // fall through
case LDIV : // fall through
case FDIV : // fall through
case DDIV : return "/";
case IREM : // fall through
case LREM : // fall through
case FREM : // fall through
case DREM : return "%";
// shift ops
case ISHL : // fall through
case LSHL : return "<<";
case ISHR : // fall through
case LSHR : return ">>";
case IUSHR: // fall through
case LUSHR: return ">>>";
// logic ops
case IAND : // fall through
case LAND : return "&";
case IOR : // fall through
case LOR : return "|";
case IXOR : // fall through
case LXOR : return "^";
}
return nameOf(op);
}
/**
* Attempts to fold a binary operation on two constant integer inputs.
*
* @param opcode the bytecode operation to perform
* @param x the first input
* @param y the second input
* @return a {@code Integer} instance representing the result of folding the operation,
* if it is foldable, {@code null} otherwise
*/
public static Integer foldIntOp2(int opcode, int x, int y) {
// attempt to fold a binary operation with constant inputs
switch (opcode) {
case IADD: return x + y;
case ISUB: return x - y;
case IMUL: return x * y;
case IDIV: {
if (y == 0) {
return null;
}
return x / y;
}
case IREM: {
if (y == 0) {
return null;
}
return x % y;
}
case IAND: return x & y;
case IOR: return x | y;
case IXOR: return x ^ y;
case ISHL: return x << y;
case ISHR: return x >> y;
case IUSHR: return x >>> y;
}
return null;
}
/**
* Attempts to fold a binary operation on two constant long inputs.
*
* @param opcode the bytecode operation to perform
* @param x the first input
* @param y the second input
* @return a {@code Long} instance representing the result of folding the operation,
* if it is foldable, {@code null} otherwise
*/
public static Long foldLongOp2(int opcode, long x, long y) {
// attempt to fold a binary operation with constant inputs
switch (opcode) {
case LADD: return x + y;
case LSUB: return x - y;
case LMUL: return x * y;
case LDIV: {
if (y == 0) {
return null;
}
return x / y;
}
case LREM: {
if (y == 0) {
return null;
}
return x % y;
}
case LAND: return x & y;
case LOR: return x | y;
case LXOR: return x ^ y;
case LSHL: return x << y;
case LSHR: return x >> y;
case LUSHR: return x >>> y;
}
return null;
}
/**
* Attempts to fold a binary operation on two constant {@code float} inputs.
*
* @param opcode the bytecode operation to perform
* @param x the first input
* @param y the second input
* @return a {@code Float} instance representing the result of folding the operation,
* if it is foldable, {@code null} otherwise
*/
public static strictfp Float foldFloatOp2(int opcode, float x, float y) {
switch (opcode) {
case FADD: return x + y;
case FSUB: return x - y;
case FMUL: return x * y;
case FDIV: return x / y;
case FREM: return x % y;
}
return null;
}
/**
* Attempts to fold a binary operation on two constant {@code double} inputs.
*
* @param opcode the bytecode operation to perform
* @param x the first input
* @param y the second input
* @return a {@code Double} instance representing the result of folding the operation,
* if it is foldable, {@code null} otherwise
*/
public static strictfp Double foldDoubleOp2(int opcode, double x, double y) {
switch (opcode) {
case DADD: return x + y;
case DSUB: return x - y;
case DMUL: return x * y;