1 | /* |
2 | * Copyright (c) 1997, 2017, Oracle and/or its affiliates. All rights reserved. |
3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 | * |
5 | * This code is free software; you can redistribute it and/or modify it |
6 | * under the terms of the GNU General Public License version 2 only, as |
7 | * published by the Free Software Foundation. |
8 | * |
9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
12 | * version 2 for more details (a copy is included in the LICENSE file that |
13 | * accompanied this code). |
14 | * |
15 | * You should have received a copy of the GNU General Public License version |
16 | * 2 along with this work; if not, write to the Free Software Foundation, |
17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
18 | * |
19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
20 | * or visit www.oracle.com if you need additional information or have any |
21 | * questions. |
22 | * |
23 | */ |
24 | |
25 | #include "precompiled.hpp" |
26 | #include "interpreter/bytecodes.hpp" |
27 | #include "memory/resourceArea.hpp" |
28 | #include "oops/method.hpp" |
29 | #include "utilities/align.hpp" |
30 | #include "utilities/bytes.hpp" |
31 | |
32 | |
33 | #if defined(WIN32) && (defined(_MSC_VER) && (_MSC_VER < 1600)) |
34 | // Windows AMD64 Compiler Hangs compiling this file |
35 | // unless optimization is off |
36 | #ifdef _M_AMD64 |
37 | #pragma optimize ("", off) |
38 | #endif |
39 | #endif |
40 | |
41 | |
42 | bool Bytecodes::_is_initialized = false; |
43 | const char* Bytecodes::_name [Bytecodes::number_of_codes]; |
44 | BasicType Bytecodes::_result_type [Bytecodes::number_of_codes]; |
45 | s_char Bytecodes::_depth [Bytecodes::number_of_codes]; |
46 | u_char Bytecodes::_lengths [Bytecodes::number_of_codes]; |
47 | Bytecodes::Code Bytecodes::_java_code [Bytecodes::number_of_codes]; |
48 | unsigned short Bytecodes::_flags [(1<<BitsPerByte)*2]; |
49 | |
50 | #ifdef ASSERT |
51 | bool Bytecodes::check_method(const Method* method, address bcp) { |
52 | return method->contains(bcp); |
53 | } |
54 | #endif |
55 | |
56 | bool Bytecodes::check_must_rewrite(Bytecodes::Code code) { |
57 | assert(can_rewrite(code), "post-check only" ); |
58 | |
59 | // Some codes are conditionally rewriting. Look closely at them. |
60 | switch (code) { |
61 | case Bytecodes::_aload_0: |
62 | // Even if RewriteFrequentPairs is turned on, |
63 | // the _aload_0 code might delay its rewrite until |
64 | // a following _getfield rewrites itself. |
65 | return false; |
66 | |
67 | case Bytecodes::_lookupswitch: |
68 | return false; // the rewrite is not done by the interpreter |
69 | |
70 | case Bytecodes::_new: |
71 | // (Could actually look at the class here, but the profit would be small.) |
72 | return false; // the rewrite is not always done |
73 | |
74 | default: |
75 | // No other special cases. |
76 | return true; |
77 | } |
78 | } |
79 | |
80 | Bytecodes::Code Bytecodes::code_at(Method* method, int bci) { |
81 | return code_at(method, method->bcp_from(bci)); |
82 | } |
83 | |
84 | Bytecodes::Code Bytecodes::non_breakpoint_code_at(const Method* method, address bcp) { |
85 | assert(method != NULL, "must have the method for breakpoint conversion" ); |
86 | assert(method->contains(bcp), "must be valid bcp in method" ); |
87 | return method->orig_bytecode_at(method->bci_from(bcp)); |
88 | } |
89 | |
90 | int Bytecodes::special_length_at(Bytecodes::Code code, address bcp, address end) { |
91 | switch (code) { |
92 | case _wide: |
93 | if (end != NULL && bcp + 1 >= end) { |
94 | return -1; // don't read past end of code buffer |
95 | } |
96 | return wide_length_for(cast(*(bcp + 1))); |
97 | case _tableswitch: |
98 | { address aligned_bcp = align_up(bcp + 1, jintSize); |
99 | if (end != NULL && aligned_bcp + 3*jintSize >= end) { |
100 | return -1; // don't read past end of code buffer |
101 | } |
102 | jlong lo = (jint)Bytes::get_Java_u4(aligned_bcp + 1*jintSize); |
103 | jlong hi = (jint)Bytes::get_Java_u4(aligned_bcp + 2*jintSize); |
104 | jlong len = (aligned_bcp - bcp) + (3 + hi - lo + 1)*jintSize; |
105 | // only return len if it can be represented as a positive int; |
106 | // return -1 otherwise |
107 | return (len > 0 && len == (int)len) ? len : -1; |
108 | } |
109 | |
110 | case _lookupswitch: // fall through |
111 | case _fast_binaryswitch: // fall through |
112 | case _fast_linearswitch: |
113 | { address aligned_bcp = align_up(bcp + 1, jintSize); |
114 | if (end != NULL && aligned_bcp + 2*jintSize >= end) { |
115 | return -1; // don't read past end of code buffer |
116 | } |
117 | jlong npairs = (jint)Bytes::get_Java_u4(aligned_bcp + jintSize); |
118 | jlong len = (aligned_bcp - bcp) + (2 + 2*npairs)*jintSize; |
119 | // only return len if it can be represented as a positive int; |
120 | // return -1 otherwise |
121 | return (len > 0 && len == (int)len) ? len : -1; |
122 | } |
123 | default: |
124 | // Note: Length functions must return <=0 for invalid bytecodes. |
125 | return 0; |
126 | } |
127 | } |
128 | |
129 | // At a breakpoint instruction, this returns the breakpoint's length, |
130 | // otherwise, it's the same as special_length_at(). This is used by |
131 | // the RawByteCodeStream, which wants to see the actual bytecode |
132 | // values (including breakpoint). RawByteCodeStream is used by the |
133 | // verifier when reading in bytecode to verify. Other mechanisms that |
134 | // run at runtime (such as generateOopMaps) need to iterate over the code |
135 | // and don't expect to see breakpoints: they want to see the instruction |
136 | // which was replaced so that they can get the correct length and find |
137 | // the next bytecode. |
138 | // |
139 | // 'end' indicates the end of the code buffer, which we should not try to read |
140 | // past. |
141 | int Bytecodes::raw_special_length_at(address bcp, address end) { |
142 | Code code = code_or_bp_at(bcp); |
143 | if (code == _breakpoint) { |
144 | return 1; |
145 | } else { |
146 | return special_length_at(code, bcp, end); |
147 | } |
148 | } |
149 | |
150 | |
151 | |
152 | void Bytecodes::def(Code code, const char* name, const char* format, const char* wide_format, BasicType result_type, int depth, bool can_trap) { |
153 | def(code, name, format, wide_format, result_type, depth, can_trap, code); |
154 | } |
155 | |
156 | |
157 | void Bytecodes::def(Code code, const char* name, const char* format, const char* wide_format, BasicType result_type, int depth, bool can_trap, Code java_code) { |
158 | assert(wide_format == NULL || format != NULL, "short form must exist if there's a wide form" ); |
159 | int len = (format != NULL ? (int) strlen(format) : 0); |
160 | int wlen = (wide_format != NULL ? (int) strlen(wide_format) : 0); |
161 | _name [code] = name; |
162 | _result_type [code] = result_type; |
163 | _depth [code] = depth; |
164 | _lengths [code] = (wlen << 4) | (len & 0xF); |
165 | _java_code [code] = java_code; |
166 | int bc_flags = 0; |
167 | if (can_trap) bc_flags |= _bc_can_trap; |
168 | if (java_code != code) bc_flags |= _bc_can_rewrite; |
169 | _flags[(u1)code+0*(1<<BitsPerByte)] = compute_flags(format, bc_flags); |
170 | _flags[(u1)code+1*(1<<BitsPerByte)] = compute_flags(wide_format, bc_flags); |
171 | assert(is_defined(code) == (format != NULL), "" ); |
172 | assert(wide_is_defined(code) == (wide_format != NULL), "" ); |
173 | assert(length_for(code) == len, "" ); |
174 | assert(wide_length_for(code) == wlen, "" ); |
175 | } |
176 | |
177 | |
178 | // Format strings interpretation: |
179 | // |
180 | // b: bytecode |
181 | // c: signed constant, Java byte-ordering |
182 | // i: unsigned local index, Java byte-ordering (I = native byte ordering) |
183 | // j: unsigned CP cache index, Java byte-ordering (J = native byte ordering) |
184 | // k: unsigned CP index, Java byte-ordering |
185 | // o: branch offset, Java byte-ordering |
186 | // _: unused/ignored |
187 | // w: wide bytecode |
188 | // |
189 | // Note: The format strings are used for 2 purposes: |
190 | // 1. to specify the length of the bytecode |
191 | // (= number of characters in format string) |
192 | // 2. to derive bytecode format flags (_fmt_has_k, etc.) |
193 | // |
194 | // Note: For bytecodes with variable length, the format string is the empty string. |
195 | |
196 | int Bytecodes::compute_flags(const char* format, int more_flags) { |
197 | if (format == NULL) return 0; // not even more_flags |
198 | int flags = more_flags; |
199 | const char* fp = format; |
200 | switch (*fp) { |
201 | case '\0': |
202 | flags |= _fmt_not_simple; // but variable |
203 | break; |
204 | case 'b': |
205 | flags |= _fmt_not_variable; // but simple |
206 | ++fp; // skip 'b' |
207 | break; |
208 | case 'w': |
209 | flags |= _fmt_not_variable | _fmt_not_simple; |
210 | ++fp; // skip 'w' |
211 | guarantee(*fp == 'b', "wide format must start with 'wb'" ); |
212 | ++fp; // skip 'b' |
213 | break; |
214 | } |
215 | |
216 | int has_nbo = 0, has_jbo = 0, has_size = 0; |
217 | for (;;) { |
218 | int this_flag = 0; |
219 | char fc = *fp++; |
220 | switch (fc) { |
221 | case '\0': // end of string |
222 | assert(flags == (jchar)flags, "change _format_flags" ); |
223 | return flags; |
224 | |
225 | case '_': continue; // ignore these |
226 | |
227 | case 'j': this_flag = _fmt_has_j; has_jbo = 1; break; |
228 | case 'k': this_flag = _fmt_has_k; has_jbo = 1; break; |
229 | case 'i': this_flag = _fmt_has_i; has_jbo = 1; break; |
230 | case 'c': this_flag = _fmt_has_c; has_jbo = 1; break; |
231 | case 'o': this_flag = _fmt_has_o; has_jbo = 1; break; |
232 | |
233 | // uppercase versions mark native byte order (from Rewriter) |
234 | // actually, only the 'J' case happens currently |
235 | case 'J': this_flag = _fmt_has_j; has_nbo = 1; break; |
236 | case 'K': this_flag = _fmt_has_k; has_nbo = 1; break; |
237 | case 'I': this_flag = _fmt_has_i; has_nbo = 1; break; |
238 | case 'C': this_flag = _fmt_has_c; has_nbo = 1; break; |
239 | case 'O': this_flag = _fmt_has_o; has_nbo = 1; break; |
240 | default: guarantee(false, "bad char in format" ); |
241 | } |
242 | |
243 | flags |= this_flag; |
244 | |
245 | guarantee(!(has_jbo && has_nbo), "mixed byte orders in format" ); |
246 | if (has_nbo) |
247 | flags |= _fmt_has_nbo; |
248 | |
249 | int this_size = 1; |
250 | if (*fp == fc) { |
251 | // advance beyond run of the same characters |
252 | this_size = 2; |
253 | while (*++fp == fc) this_size++; |
254 | switch (this_size) { |
255 | case 2: flags |= _fmt_has_u2; break; |
256 | case 4: flags |= _fmt_has_u4; break; |
257 | default: guarantee(false, "bad rep count in format" ); |
258 | } |
259 | } |
260 | guarantee(has_size == 0 || // no field yet |
261 | this_size == has_size || // same size |
262 | this_size < has_size && *fp == '\0', // last field can be short |
263 | "mixed field sizes in format" ); |
264 | has_size = this_size; |
265 | } |
266 | } |
267 | |
268 | void Bytecodes::initialize() { |
269 | if (_is_initialized) return; |
270 | assert(number_of_codes <= 256, "too many bytecodes" ); |
271 | |
272 | // initialize bytecode tables - didn't use static array initializers |
273 | // (such as {}) so we can do additional consistency checks and init- |
274 | // code is independent of actual bytecode numbering. |
275 | // |
276 | // Note 1: NULL for the format string means the bytecode doesn't exist |
277 | // in that form. |
278 | // |
279 | // Note 2: The result type is T_ILLEGAL for bytecodes where the top of stack |
280 | // type after execution is not only determined by the bytecode itself. |
281 | |
282 | // Java bytecodes |
283 | // bytecode bytecode name format wide f. result tp stk traps |
284 | def(_nop , "nop" , "b" , NULL , T_VOID , 0, false); |
285 | def(_aconst_null , "aconst_null" , "b" , NULL , T_OBJECT , 1, false); |
286 | def(_iconst_m1 , "iconst_m1" , "b" , NULL , T_INT , 1, false); |
287 | def(_iconst_0 , "iconst_0" , "b" , NULL , T_INT , 1, false); |
288 | def(_iconst_1 , "iconst_1" , "b" , NULL , T_INT , 1, false); |
289 | def(_iconst_2 , "iconst_2" , "b" , NULL , T_INT , 1, false); |
290 | def(_iconst_3 , "iconst_3" , "b" , NULL , T_INT , 1, false); |
291 | def(_iconst_4 , "iconst_4" , "b" , NULL , T_INT , 1, false); |
292 | def(_iconst_5 , "iconst_5" , "b" , NULL , T_INT , 1, false); |
293 | def(_lconst_0 , "lconst_0" , "b" , NULL , T_LONG , 2, false); |
294 | def(_lconst_1 , "lconst_1" , "b" , NULL , T_LONG , 2, false); |
295 | def(_fconst_0 , "fconst_0" , "b" , NULL , T_FLOAT , 1, false); |
296 | def(_fconst_1 , "fconst_1" , "b" , NULL , T_FLOAT , 1, false); |
297 | def(_fconst_2 , "fconst_2" , "b" , NULL , T_FLOAT , 1, false); |
298 | def(_dconst_0 , "dconst_0" , "b" , NULL , T_DOUBLE , 2, false); |
299 | def(_dconst_1 , "dconst_1" , "b" , NULL , T_DOUBLE , 2, false); |
300 | def(_bipush , "bipush" , "bc" , NULL , T_INT , 1, false); |
301 | def(_sipush , "sipush" , "bcc" , NULL , T_INT , 1, false); |
302 | def(_ldc , "ldc" , "bk" , NULL , T_ILLEGAL, 1, true ); |
303 | def(_ldc_w , "ldc_w" , "bkk" , NULL , T_ILLEGAL, 1, true ); |
304 | def(_ldc2_w , "ldc2_w" , "bkk" , NULL , T_ILLEGAL, 2, true ); |
305 | def(_iload , "iload" , "bi" , "wbii" , T_INT , 1, false); |
306 | def(_lload , "lload" , "bi" , "wbii" , T_LONG , 2, false); |
307 | def(_fload , "fload" , "bi" , "wbii" , T_FLOAT , 1, false); |
308 | def(_dload , "dload" , "bi" , "wbii" , T_DOUBLE , 2, false); |
309 | def(_aload , "aload" , "bi" , "wbii" , T_OBJECT , 1, false); |
310 | def(_iload_0 , "iload_0" , "b" , NULL , T_INT , 1, false); |
311 | def(_iload_1 , "iload_1" , "b" , NULL , T_INT , 1, false); |
312 | def(_iload_2 , "iload_2" , "b" , NULL , T_INT , 1, false); |
313 | def(_iload_3 , "iload_3" , "b" , NULL , T_INT , 1, false); |
314 | def(_lload_0 , "lload_0" , "b" , NULL , T_LONG , 2, false); |
315 | def(_lload_1 , "lload_1" , "b" , NULL , T_LONG , 2, false); |
316 | def(_lload_2 , "lload_2" , "b" , NULL , T_LONG , 2, false); |
317 | def(_lload_3 , "lload_3" , "b" , NULL , T_LONG , 2, false); |
318 | def(_fload_0 , "fload_0" , "b" , NULL , T_FLOAT , 1, false); |
319 | def(_fload_1 , "fload_1" , "b" , NULL , T_FLOAT , 1, false); |
320 | def(_fload_2 , "fload_2" , "b" , NULL , T_FLOAT , 1, false); |
321 | def(_fload_3 , "fload_3" , "b" , NULL , T_FLOAT , 1, false); |
322 | def(_dload_0 , "dload_0" , "b" , NULL , T_DOUBLE , 2, false); |
323 | def(_dload_1 , "dload_1" , "b" , NULL , T_DOUBLE , 2, false); |
324 | def(_dload_2 , "dload_2" , "b" , NULL , T_DOUBLE , 2, false); |
325 | def(_dload_3 , "dload_3" , "b" , NULL , T_DOUBLE , 2, false); |
326 | def(_aload_0 , "aload_0" , "b" , NULL , T_OBJECT , 1, true ); // rewriting in interpreter |
327 | def(_aload_1 , "aload_1" , "b" , NULL , T_OBJECT , 1, false); |
328 | def(_aload_2 , "aload_2" , "b" , NULL , T_OBJECT , 1, false); |
329 | def(_aload_3 , "aload_3" , "b" , NULL , T_OBJECT , 1, false); |
330 | def(_iaload , "iaload" , "b" , NULL , T_INT , -1, true ); |
331 | def(_laload , "laload" , "b" , NULL , T_LONG , 0, true ); |
332 | def(_faload , "faload" , "b" , NULL , T_FLOAT , -1, true ); |
333 | def(_daload , "daload" , "b" , NULL , T_DOUBLE , 0, true ); |
334 | def(_aaload , "aaload" , "b" , NULL , T_OBJECT , -1, true ); |
335 | def(_baload , "baload" , "b" , NULL , T_INT , -1, true ); |
336 | def(_caload , "caload" , "b" , NULL , T_INT , -1, true ); |
337 | def(_saload , "saload" , "b" , NULL , T_INT , -1, true ); |
338 | def(_istore , "istore" , "bi" , "wbii" , T_VOID , -1, false); |
339 | def(_lstore , "lstore" , "bi" , "wbii" , T_VOID , -2, false); |
340 | def(_fstore , "fstore" , "bi" , "wbii" , T_VOID , -1, false); |
341 | def(_dstore , "dstore" , "bi" , "wbii" , T_VOID , -2, false); |
342 | def(_astore , "astore" , "bi" , "wbii" , T_VOID , -1, false); |
343 | def(_istore_0 , "istore_0" , "b" , NULL , T_VOID , -1, false); |
344 | def(_istore_1 , "istore_1" , "b" , NULL , T_VOID , -1, false); |
345 | def(_istore_2 , "istore_2" , "b" , NULL , T_VOID , -1, false); |
346 | def(_istore_3 , "istore_3" , "b" , NULL , T_VOID , -1, false); |
347 | def(_lstore_0 , "lstore_0" , "b" , NULL , T_VOID , -2, false); |
348 | def(_lstore_1 , "lstore_1" , "b" , NULL , T_VOID , -2, false); |
349 | def(_lstore_2 , "lstore_2" , "b" , NULL , T_VOID , -2, false); |
350 | def(_lstore_3 , "lstore_3" , "b" , NULL , T_VOID , -2, false); |
351 | def(_fstore_0 , "fstore_0" , "b" , NULL , T_VOID , -1, false); |
352 | def(_fstore_1 , "fstore_1" , "b" , NULL , T_VOID , -1, false); |
353 | def(_fstore_2 , "fstore_2" , "b" , NULL , T_VOID , -1, false); |
354 | def(_fstore_3 , "fstore_3" , "b" , NULL , T_VOID , -1, false); |
355 | def(_dstore_0 , "dstore_0" , "b" , NULL , T_VOID , -2, false); |
356 | def(_dstore_1 , "dstore_1" , "b" , NULL , T_VOID , -2, false); |
357 | def(_dstore_2 , "dstore_2" , "b" , NULL , T_VOID , -2, false); |
358 | def(_dstore_3 , "dstore_3" , "b" , NULL , T_VOID , -2, false); |
359 | def(_astore_0 , "astore_0" , "b" , NULL , T_VOID , -1, false); |
360 | def(_astore_1 , "astore_1" , "b" , NULL , T_VOID , -1, false); |
361 | def(_astore_2 , "astore_2" , "b" , NULL , T_VOID , -1, false); |
362 | def(_astore_3 , "astore_3" , "b" , NULL , T_VOID , -1, false); |
363 | def(_iastore , "iastore" , "b" , NULL , T_VOID , -3, true ); |
364 | def(_lastore , "lastore" , "b" , NULL , T_VOID , -4, true ); |
365 | def(_fastore , "fastore" , "b" , NULL , T_VOID , -3, true ); |
366 | def(_dastore , "dastore" , "b" , NULL , T_VOID , -4, true ); |
367 | def(_aastore , "aastore" , "b" , NULL , T_VOID , -3, true ); |
368 | def(_bastore , "bastore" , "b" , NULL , T_VOID , -3, true ); |
369 | def(_castore , "castore" , "b" , NULL , T_VOID , -3, true ); |
370 | def(_sastore , "sastore" , "b" , NULL , T_VOID , -3, true ); |
371 | def(_pop , "pop" , "b" , NULL , T_VOID , -1, false); |
372 | def(_pop2 , "pop2" , "b" , NULL , T_VOID , -2, false); |
373 | def(_dup , "dup" , "b" , NULL , T_VOID , 1, false); |
374 | def(_dup_x1 , "dup_x1" , "b" , NULL , T_VOID , 1, false); |
375 | def(_dup_x2 , "dup_x2" , "b" , NULL , T_VOID , 1, false); |
376 | def(_dup2 , "dup2" , "b" , NULL , T_VOID , 2, false); |
377 | def(_dup2_x1 , "dup2_x1" , "b" , NULL , T_VOID , 2, false); |
378 | def(_dup2_x2 , "dup2_x2" , "b" , NULL , T_VOID , 2, false); |
379 | def(_swap , "swap" , "b" , NULL , T_VOID , 0, false); |
380 | def(_iadd , "iadd" , "b" , NULL , T_INT , -1, false); |
381 | def(_ladd , "ladd" , "b" , NULL , T_LONG , -2, false); |
382 | def(_fadd , "fadd" , "b" , NULL , T_FLOAT , -1, false); |
383 | def(_dadd , "dadd" , "b" , NULL , T_DOUBLE , -2, false); |
384 | def(_isub , "isub" , "b" , NULL , T_INT , -1, false); |
385 | def(_lsub , "lsub" , "b" , NULL , T_LONG , -2, false); |
386 | def(_fsub , "fsub" , "b" , NULL , T_FLOAT , -1, false); |
387 | def(_dsub , "dsub" , "b" , NULL , T_DOUBLE , -2, false); |
388 | def(_imul , "imul" , "b" , NULL , T_INT , -1, false); |
389 | def(_lmul , "lmul" , "b" , NULL , T_LONG , -2, false); |
390 | def(_fmul , "fmul" , "b" , NULL , T_FLOAT , -1, false); |
391 | def(_dmul , "dmul" , "b" , NULL , T_DOUBLE , -2, false); |
392 | def(_idiv , "idiv" , "b" , NULL , T_INT , -1, true ); |
393 | def(_ldiv , "ldiv" , "b" , NULL , T_LONG , -2, true ); |
394 | def(_fdiv , "fdiv" , "b" , NULL , T_FLOAT , -1, false); |
395 | def(_ddiv , "ddiv" , "b" , NULL , T_DOUBLE , -2, false); |
396 | def(_irem , "irem" , "b" , NULL , T_INT , -1, true ); |
397 | def(_lrem , "lrem" , "b" , NULL , T_LONG , -2, true ); |
398 | def(_frem , "frem" , "b" , NULL , T_FLOAT , -1, false); |
399 | def(_drem , "drem" , "b" , NULL , T_DOUBLE , -2, false); |
400 | def(_ineg , "ineg" , "b" , NULL , T_INT , 0, false); |
401 | def(_lneg , "lneg" , "b" , NULL , T_LONG , 0, false); |
402 | def(_fneg , "fneg" , "b" , NULL , T_FLOAT , 0, false); |
403 | def(_dneg , "dneg" , "b" , NULL , T_DOUBLE , 0, false); |
404 | def(_ishl , "ishl" , "b" , NULL , T_INT , -1, false); |
405 | def(_lshl , "lshl" , "b" , NULL , T_LONG , -1, false); |
406 | def(_ishr , "ishr" , "b" , NULL , T_INT , -1, false); |
407 | def(_lshr , "lshr" , "b" , NULL , T_LONG , -1, false); |
408 | def(_iushr , "iushr" , "b" , NULL , T_INT , -1, false); |
409 | def(_lushr , "lushr" , "b" , NULL , T_LONG , -1, false); |
410 | def(_iand , "iand" , "b" , NULL , T_INT , -1, false); |
411 | def(_land , "land" , "b" , NULL , T_LONG , -2, false); |
412 | def(_ior , "ior" , "b" , NULL , T_INT , -1, false); |
413 | def(_lor , "lor" , "b" , NULL , T_LONG , -2, false); |
414 | def(_ixor , "ixor" , "b" , NULL , T_INT , -1, false); |
415 | def(_lxor , "lxor" , "b" , NULL , T_LONG , -2, false); |
416 | def(_iinc , "iinc" , "bic" , "wbiicc" , T_VOID , 0, false); |
417 | def(_i2l , "i2l" , "b" , NULL , T_LONG , 1, false); |
418 | def(_i2f , "i2f" , "b" , NULL , T_FLOAT , 0, false); |
419 | def(_i2d , "i2d" , "b" , NULL , T_DOUBLE , 1, false); |
420 | def(_l2i , "l2i" , "b" , NULL , T_INT , -1, false); |
421 | def(_l2f , "l2f" , "b" , NULL , T_FLOAT , -1, false); |
422 | def(_l2d , "l2d" , "b" , NULL , T_DOUBLE , 0, false); |
423 | def(_f2i , "f2i" , "b" , NULL , T_INT , 0, false); |
424 | def(_f2l , "f2l" , "b" , NULL , T_LONG , 1, false); |
425 | def(_f2d , "f2d" , "b" , NULL , T_DOUBLE , 1, false); |
426 | def(_d2i , "d2i" , "b" , NULL , T_INT , -1, false); |
427 | def(_d2l , "d2l" , "b" , NULL , T_LONG , 0, false); |
428 | def(_d2f , "d2f" , "b" , NULL , T_FLOAT , -1, false); |
429 | def(_i2b , "i2b" , "b" , NULL , T_BYTE , 0, false); |
430 | def(_i2c , "i2c" , "b" , NULL , T_CHAR , 0, false); |
431 | def(_i2s , "i2s" , "b" , NULL , T_SHORT , 0, false); |
432 | def(_lcmp , "lcmp" , "b" , NULL , T_VOID , -3, false); |
433 | def(_fcmpl , "fcmpl" , "b" , NULL , T_VOID , -1, false); |
434 | def(_fcmpg , "fcmpg" , "b" , NULL , T_VOID , -1, false); |
435 | def(_dcmpl , "dcmpl" , "b" , NULL , T_VOID , -3, false); |
436 | def(_dcmpg , "dcmpg" , "b" , NULL , T_VOID , -3, false); |
437 | def(_ifeq , "ifeq" , "boo" , NULL , T_VOID , -1, false); |
438 | def(_ifne , "ifne" , "boo" , NULL , T_VOID , -1, false); |
439 | def(_iflt , "iflt" , "boo" , NULL , T_VOID , -1, false); |
440 | def(_ifge , "ifge" , "boo" , NULL , T_VOID , -1, false); |
441 | def(_ifgt , "ifgt" , "boo" , NULL , T_VOID , -1, false); |
442 | def(_ifle , "ifle" , "boo" , NULL , T_VOID , -1, false); |
443 | def(_if_icmpeq , "if_icmpeq" , "boo" , NULL , T_VOID , -2, false); |
444 | def(_if_icmpne , "if_icmpne" , "boo" , NULL , T_VOID , -2, false); |
445 | def(_if_icmplt , "if_icmplt" , "boo" , NULL , T_VOID , -2, false); |
446 | def(_if_icmpge , "if_icmpge" , "boo" , NULL , T_VOID , -2, false); |
447 | def(_if_icmpgt , "if_icmpgt" , "boo" , NULL , T_VOID , -2, false); |
448 | def(_if_icmple , "if_icmple" , "boo" , NULL , T_VOID , -2, false); |
449 | def(_if_acmpeq , "if_acmpeq" , "boo" , NULL , T_VOID , -2, false); |
450 | def(_if_acmpne , "if_acmpne" , "boo" , NULL , T_VOID , -2, false); |
451 | def(_goto , "goto" , "boo" , NULL , T_VOID , 0, false); |
452 | def(_jsr , "jsr" , "boo" , NULL , T_INT , 0, false); |
453 | def(_ret , "ret" , "bi" , "wbii" , T_VOID , 0, false); |
454 | def(_tableswitch , "tableswitch" , "" , NULL , T_VOID , -1, false); // may have backward branches |
455 | def(_lookupswitch , "lookupswitch" , "" , NULL , T_VOID , -1, false); // rewriting in interpreter |
456 | def(_ireturn , "ireturn" , "b" , NULL , T_INT , -1, true); |
457 | def(_lreturn , "lreturn" , "b" , NULL , T_LONG , -2, true); |
458 | def(_freturn , "freturn" , "b" , NULL , T_FLOAT , -1, true); |
459 | def(_dreturn , "dreturn" , "b" , NULL , T_DOUBLE , -2, true); |
460 | def(_areturn , "areturn" , "b" , NULL , T_OBJECT , -1, true); |
461 | def(_return , "return" , "b" , NULL , T_VOID , 0, true); |
462 | def(_getstatic , "getstatic" , "bJJ" , NULL , T_ILLEGAL, 1, true ); |
463 | def(_putstatic , "putstatic" , "bJJ" , NULL , T_ILLEGAL, -1, true ); |
464 | def(_getfield , "getfield" , "bJJ" , NULL , T_ILLEGAL, 0, true ); |
465 | def(_putfield , "putfield" , "bJJ" , NULL , T_ILLEGAL, -2, true ); |
466 | def(_invokevirtual , "invokevirtual" , "bJJ" , NULL , T_ILLEGAL, -1, true); |
467 | def(_invokespecial , "invokespecial" , "bJJ" , NULL , T_ILLEGAL, -1, true); |
468 | def(_invokestatic , "invokestatic" , "bJJ" , NULL , T_ILLEGAL, 0, true); |
469 | def(_invokeinterface , "invokeinterface" , "bJJ__" , NULL , T_ILLEGAL, -1, true); |
470 | def(_invokedynamic , "invokedynamic" , "bJJJJ" , NULL , T_ILLEGAL, 0, true ); |
471 | def(_new , "new" , "bkk" , NULL , T_OBJECT , 1, true ); |
472 | def(_newarray , "newarray" , "bc" , NULL , T_OBJECT , 0, true ); |
473 | def(_anewarray , "anewarray" , "bkk" , NULL , T_OBJECT , 0, true ); |
474 | def(_arraylength , "arraylength" , "b" , NULL , T_VOID , 0, true ); |
475 | def(_athrow , "athrow" , "b" , NULL , T_VOID , -1, true ); |
476 | def(_checkcast , "checkcast" , "bkk" , NULL , T_OBJECT , 0, true ); |
477 | def(_instanceof , "instanceof" , "bkk" , NULL , T_INT , 0, true ); |
478 | def(_monitorenter , "monitorenter" , "b" , NULL , T_VOID , -1, true ); |
479 | def(_monitorexit , "monitorexit" , "b" , NULL , T_VOID , -1, true ); |
480 | def(_wide , "wide" , "" , NULL , T_VOID , 0, false); |
481 | def(_multianewarray , "multianewarray" , "bkkc" , NULL , T_OBJECT , 1, true ); |
482 | def(_ifnull , "ifnull" , "boo" , NULL , T_VOID , -1, false); |
483 | def(_ifnonnull , "ifnonnull" , "boo" , NULL , T_VOID , -1, false); |
484 | def(_goto_w , "goto_w" , "boooo" , NULL , T_VOID , 0, false); |
485 | def(_jsr_w , "jsr_w" , "boooo" , NULL , T_INT , 0, false); |
486 | def(_breakpoint , "breakpoint" , "" , NULL , T_VOID , 0, true); |
487 | |
488 | // JVM bytecodes |
489 | // bytecode bytecode name format wide f. result tp stk traps std code |
490 | |
491 | def(_fast_agetfield , "fast_agetfield" , "bJJ" , NULL , T_OBJECT , 0, true , _getfield ); |
492 | def(_fast_bgetfield , "fast_bgetfield" , "bJJ" , NULL , T_INT , 0, true , _getfield ); |
493 | def(_fast_cgetfield , "fast_cgetfield" , "bJJ" , NULL , T_CHAR , 0, true , _getfield ); |
494 | def(_fast_dgetfield , "fast_dgetfield" , "bJJ" , NULL , T_DOUBLE , 0, true , _getfield ); |
495 | def(_fast_fgetfield , "fast_fgetfield" , "bJJ" , NULL , T_FLOAT , 0, true , _getfield ); |
496 | def(_fast_igetfield , "fast_igetfield" , "bJJ" , NULL , T_INT , 0, true , _getfield ); |
497 | def(_fast_lgetfield , "fast_lgetfield" , "bJJ" , NULL , T_LONG , 0, true , _getfield ); |
498 | def(_fast_sgetfield , "fast_sgetfield" , "bJJ" , NULL , T_SHORT , 0, true , _getfield ); |
499 | |
500 | def(_fast_aputfield , "fast_aputfield" , "bJJ" , NULL , T_OBJECT , 0, true , _putfield ); |
501 | def(_fast_bputfield , "fast_bputfield" , "bJJ" , NULL , T_INT , 0, true , _putfield ); |
502 | def(_fast_zputfield , "fast_zputfield" , "bJJ" , NULL , T_INT , 0, true , _putfield ); |
503 | def(_fast_cputfield , "fast_cputfield" , "bJJ" , NULL , T_CHAR , 0, true , _putfield ); |
504 | def(_fast_dputfield , "fast_dputfield" , "bJJ" , NULL , T_DOUBLE , 0, true , _putfield ); |
505 | def(_fast_fputfield , "fast_fputfield" , "bJJ" , NULL , T_FLOAT , 0, true , _putfield ); |
506 | def(_fast_iputfield , "fast_iputfield" , "bJJ" , NULL , T_INT , 0, true , _putfield ); |
507 | def(_fast_lputfield , "fast_lputfield" , "bJJ" , NULL , T_LONG , 0, true , _putfield ); |
508 | def(_fast_sputfield , "fast_sputfield" , "bJJ" , NULL , T_SHORT , 0, true , _putfield ); |
509 | |
510 | def(_fast_aload_0 , "fast_aload_0" , "b" , NULL , T_OBJECT , 1, true , _aload_0 ); |
511 | def(_fast_iaccess_0 , "fast_iaccess_0" , "b_JJ" , NULL , T_INT , 1, true , _aload_0 ); |
512 | def(_fast_aaccess_0 , "fast_aaccess_0" , "b_JJ" , NULL , T_OBJECT , 1, true , _aload_0 ); |
513 | def(_fast_faccess_0 , "fast_faccess_0" , "b_JJ" , NULL , T_OBJECT , 1, true , _aload_0 ); |
514 | |
515 | def(_fast_iload , "fast_iload" , "bi" , NULL , T_INT , 1, false, _iload); |
516 | def(_fast_iload2 , "fast_iload2" , "bi_i" , NULL , T_INT , 2, false, _iload); |
517 | def(_fast_icaload , "fast_icaload" , "bi_" , NULL , T_INT , 0, false, _iload); |
518 | |
519 | // Faster method invocation. |
520 | def(_fast_invokevfinal , "fast_invokevfinal" , "bJJ" , NULL , T_ILLEGAL, -1, true, _invokevirtual ); |
521 | |
522 | def(_fast_linearswitch , "fast_linearswitch" , "" , NULL , T_VOID , -1, false, _lookupswitch ); |
523 | def(_fast_binaryswitch , "fast_binaryswitch" , "" , NULL , T_VOID , -1, false, _lookupswitch ); |
524 | |
525 | def(_return_register_finalizer , "return_register_finalizer" , "b" , NULL , T_VOID , 0, true, _return); |
526 | |
527 | def(_invokehandle , "invokehandle" , "bJJ" , NULL , T_ILLEGAL, -1, true, _invokevirtual ); |
528 | |
529 | def(_fast_aldc , "fast_aldc" , "bj" , NULL , T_OBJECT, 1, true, _ldc ); |
530 | def(_fast_aldc_w , "fast_aldc_w" , "bJJ" , NULL , T_OBJECT, 1, true, _ldc_w ); |
531 | |
532 | def(_nofast_getfield , "nofast_getfield" , "bJJ" , NULL , T_ILLEGAL, 0, true, _getfield ); |
533 | def(_nofast_putfield , "nofast_putfield" , "bJJ" , NULL , T_ILLEGAL, -2, true , _putfield ); |
534 | |
535 | def(_nofast_aload_0 , "nofast_aload_0" , "b" , NULL , T_ILLEGAL, 1, true , _aload_0 ); |
536 | def(_nofast_iload , "nofast_iload" , "bi" , NULL , T_ILLEGAL, 1, false, _iload ); |
537 | |
538 | def(_shouldnotreachhere , "_shouldnotreachhere" , "b" , NULL , T_VOID , 0, false); |
539 | |
540 | // compare can_trap information for each bytecode with the |
541 | // can_trap information for the corresponding base bytecode |
542 | // (if a rewritten bytecode can trap, so must the base bytecode) |
543 | #ifdef ASSERT |
544 | { for (int i = 0; i < number_of_codes; i++) { |
545 | if (is_defined(i)) { |
546 | Code code = cast(i); |
547 | Code java = java_code(code); |
548 | if (can_trap(code) && !can_trap(java)) |
549 | fatal("%s can trap => %s can trap, too" , name(code), name(java)); |
550 | } |
551 | } |
552 | } |
553 | #endif |
554 | |
555 | // initialization successful |
556 | _is_initialized = true; |
557 | } |
558 | |
559 | |
560 | void bytecodes_init() { |
561 | Bytecodes::initialize(); |
562 | } |
563 | |
564 | // Restore optimization |
565 | #ifdef _M_AMD64 |
566 | #pragma optimize ("", on) |
567 | #endif |
568 | |