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