1 /*
2 * Copyright (c) 1997, 2015, 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 "asm/macroAssembler.hpp"
27 #include "asm/macroAssembler.inline.hpp"
28 #include "compiler/disassembler.hpp"
29 #include "interpreter/bytecodeHistogram.hpp"
30 #include "interpreter/bytecodeInterpreter.hpp"
31 #include "interpreter/interpreter.hpp"
32 #include "interpreter/interpreterRuntime.hpp"
33 #include "interpreter/interp_masm.hpp"
34 #include "interpreter/templateTable.hpp"
35 #include "memory/allocation.inline.hpp"
36 #include "memory/metaspaceShared.hpp"
37 #include "memory/resourceArea.hpp"
38 #include "oops/arrayOop.hpp"
39 #include "oops/methodData.hpp"
40 #include "oops/method.hpp"
41 #include "oops/oop.inline.hpp"
42 #include "prims/forte.hpp"
43 #include "prims/jvmtiExport.hpp"
44 #include "prims/methodHandles.hpp"
45 #include "runtime/handles.inline.hpp"
46 #include "runtime/sharedRuntime.hpp"
47 #include "runtime/stubRoutines.hpp"
48 #include "runtime/timer.hpp"
49
50 # define __ _masm->
51
52 //------------------------------------------------------------------------------------------------------------------------
53 // Implementation of platform independent aspects of Interpreter
54
55 void AbstractInterpreter::initialize() {
56 if (_code != NULL) return;
57
58 // make sure 'imported' classes are initialized
59 if (CountBytecodes || TraceBytecodes || StopInterpreterAt) BytecodeCounter::reset();
60 if (PrintBytecodeHistogram) BytecodeHistogram::reset();
61 if (PrintBytecodePairHistogram) BytecodePairHistogram::reset();
62
63 InvocationCounter::reinitialize(DelayCompilationDuringStartup);
64
65 }
66
67 void AbstractInterpreter::print() {
68 tty->cr();
69 tty->print_cr("----------------------------------------------------------------------");
70 tty->print_cr("Interpreter");
71 tty->cr();
72 tty->print_cr("code size = %6dK bytes", (int)_code->used_space()/1024);
73 tty->print_cr("total space = %6dK bytes", (int)_code->total_space()/1024);
74 tty->print_cr("wasted space = %6dK bytes", (int)_code->available_space()/1024);
75 tty->cr();
76 tty->print_cr("# of codelets = %6d" , _code->number_of_stubs());
77 if (_code->number_of_stubs() != 0) {
78 tty->print_cr("avg codelet size = %6d bytes", _code->used_space() / _code->number_of_stubs());
79 tty->cr();
80 }
81 _code->print();
82 tty->print_cr("----------------------------------------------------------------------");
83 tty->cr();
84 }
85
86
87 //------------------------------------------------------------------------------------------------------------------------
88 // Implementation of interpreter
89
90 StubQueue* AbstractInterpreter::_code = NULL;
91 bool AbstractInterpreter::_notice_safepoints = false;
92 address AbstractInterpreter::_rethrow_exception_entry = NULL;
93
94 address AbstractInterpreter::_native_entry_begin = NULL;
95 address AbstractInterpreter::_native_entry_end = NULL;
96 address AbstractInterpreter::_slow_signature_handler;
97 address AbstractInterpreter::_entry_table [AbstractInterpreter::number_of_method_entries];
98 address AbstractInterpreter::_cds_entry_table [AbstractInterpreter::number_of_method_entries];
99 address AbstractInterpreter::_native_abi_to_tosca [AbstractInterpreter::number_of_result_handlers];
100
101 //------------------------------------------------------------------------------------------------------------------------
102 // Generation of complete interpreter
103
104 AbstractInterpreterGenerator::AbstractInterpreterGenerator(StubQueue* _code) {
105 _masm = NULL;
106 }
107
108
109 //------------------------------------------------------------------------------------------------------------------------
110 // Entry points
111
112 AbstractInterpreter::MethodKind AbstractInterpreter::method_kind(methodHandle m) {
113 // Abstract method?
114 if (m->is_abstract()) return abstract;
115
116 // Method handle primitive?
117 if (m->is_method_handle_intrinsic()) {
118 vmIntrinsics::ID id = m->intrinsic_id();
119 assert(MethodHandles::is_signature_polymorphic(id), "must match an intrinsic");
120 MethodKind kind = (MethodKind)( method_handle_invoke_FIRST +
121 ((int)id - vmIntrinsics::FIRST_MH_SIG_POLY) );
122 assert(kind <= method_handle_invoke_LAST, "parallel enum ranges");
123 return kind;
124 }
125
126 #ifndef CC_INTERP
127 switch (m->intrinsic_id()) {
128 // Use optimized stub code for CRC32 native methods.
129 case vmIntrinsics::_updateCRC32 : return java_util_zip_CRC32_update;
130 case vmIntrinsics::_updateBytesCRC32 : return java_util_zip_CRC32_updateBytes;
131 case vmIntrinsics::_updateByteBufferCRC32 : return java_util_zip_CRC32_updateByteBuffer;
132 // Use optimized stub code for CRC32C methods.
133 case vmIntrinsics::_updateBytesCRC32C : return java_util_zip_CRC32C_updateBytes;
134 case vmIntrinsics::_updateDirectByteBufferCRC32C : return java_util_zip_CRC32C_updateDirectByteBuffer;
135 case vmIntrinsics::_intBitsToFloat: return java_lang_Float_intBitsToFloat;
136 case vmIntrinsics::_floatToRawIntBits: return java_lang_Float_floatToRawIntBits;
137 case vmIntrinsics::_longBitsToDouble: return java_lang_Double_longBitsToDouble;
138 case vmIntrinsics::_doubleToRawLongBits: return java_lang_Double_doubleToRawLongBits;
139 }
140 #endif // CC_INTERP
141
142 // Native method?
143 // Note: This test must come _before_ the test for intrinsic
144 // methods. See also comments below.
145 if (m->is_native()) {
146 assert(!m->is_method_handle_intrinsic(), "overlapping bits here, watch out");
147 return m->is_synchronized() ? native_synchronized : native;
148 }
149
150 // Synchronized?
151 if (m->is_synchronized()) {
152 return zerolocals_synchronized;
153 }
154
155 if (RegisterFinalizersAtInit && m->code_size() == 1 &&
156 m->intrinsic_id() == vmIntrinsics::_Object_init) {
157 // We need to execute the special return bytecode to check for
158 // finalizer registration so create a normal frame.
159 return zerolocals;
160 }
161
162 // Empty method?
163 if (m->is_empty_method()) {
164 return empty;
165 }
166
167 // Special intrinsic method?
168 // Note: This test must come _after_ the test for native methods,
169 // otherwise we will run into problems with JDK 1.2, see also
170 // TemplateInterpreterGenerator::generate_method_entry() for
171 // for details.
172 switch (m->intrinsic_id()) {
173 case vmIntrinsics::_dsin : return java_lang_math_sin ;
174 case vmIntrinsics::_dcos : return java_lang_math_cos ;
175 case vmIntrinsics::_dtan : return java_lang_math_tan ;
176 case vmIntrinsics::_dabs : return java_lang_math_abs ;
177 case vmIntrinsics::_dsqrt : return java_lang_math_sqrt ;
178 case vmIntrinsics::_dlog : return java_lang_math_log ;
179 case vmIntrinsics::_dlog10: return java_lang_math_log10;
180 case vmIntrinsics::_dpow : return java_lang_math_pow ;
181 case vmIntrinsics::_dexp : return java_lang_math_exp ;
182 case vmIntrinsics::_fmaD : return java_lang_math_fmaD ;
183 case vmIntrinsics::_fmaF : return java_lang_math_fmaF ;
184
185 case vmIntrinsics::_Reference_get:
186 return java_lang_ref_reference_get;
187 }
188
189 // Accessor method?
190 if (m->is_getter()) {
191 // TODO: We should have used ::is_accessor above, but fast accessors in Zero expect only getters.
192 // See CppInterpreter::accessor_entry in cppInterpreter_zero.cpp. This should be fixed in Zero,
193 // then the call above updated to ::is_accessor
194 assert(m->size_of_parameters() == 1, "fast code for accessors assumes parameter size = 1");
195 return accessor;
196 }
197
198 // Note: for now: zero locals for all non-empty methods
199 return zerolocals;
200 }
201
202 #if INCLUDE_CDS
203
204 address AbstractInterpreter::get_trampoline_code_buffer(AbstractInterpreter::MethodKind kind) {
205 const size_t trampoline_size = SharedRuntime::trampoline_size();
206 address addr = MetaspaceShared::cds_i2i_entry_code_buffers((size_t)(AbstractInterpreter::number_of_method_entries) * trampoline_size);
207 addr += (size_t)(kind) * trampoline_size;
208
209 return addr;
210 }
211
212 void AbstractInterpreter::update_cds_entry_table(AbstractInterpreter::MethodKind kind) {
213 if (DumpSharedSpaces || UseSharedSpaces) {
214 address trampoline = get_trampoline_code_buffer(kind);
215 _cds_entry_table[kind] = trampoline;
216
217 CodeBuffer buffer(trampoline, (int)(SharedRuntime::trampoline_size()));
218 MacroAssembler _masm(&buffer);
219 SharedRuntime::generate_trampoline(&_masm, _entry_table[kind]);
220
221 if (PrintInterpreter) {
222 Disassembler::decode(buffer.insts_begin(), buffer.insts_end());
223 }
224 }
225 }
226
227 #endif
228
229 void AbstractInterpreter::set_entry_for_kind(AbstractInterpreter::MethodKind kind, address entry) {
230 assert(kind >= method_handle_invoke_FIRST &&
231 kind <= method_handle_invoke_LAST, "late initialization only for MH entry points");
232 assert(_entry_table[kind] == _entry_table[abstract], "previous value must be AME entry");
233 _entry_table[kind] = entry;
234
235 update_cds_entry_table(kind);
236 }
237
238 // Return true if the interpreter can prove that the given bytecode has
239 // not yet been executed (in Java semantics, not in actual operation).
240 bool AbstractInterpreter::is_not_reached(const methodHandle& method, int bci) {
241 Bytecodes::Code code = method()->code_at(bci);
242
243 if (!Bytecodes::must_rewrite(code)) {
244 // might have been reached
245 return false;
246 }
247
248 // the bytecode might not be rewritten if the method is an accessor, etc.
249 address ientry = method->interpreter_entry();
250 if (ientry != entry_for_kind(AbstractInterpreter::zerolocals) &&
251 ientry != entry_for_kind(AbstractInterpreter::zerolocals_synchronized))
252 return false; // interpreter does not run this method!
253
254 // otherwise, we can be sure this bytecode has never been executed
255 return true;
256 }
257
258
259 #ifndef PRODUCT
260 void AbstractInterpreter::print_method_kind(MethodKind kind) {
261 switch (kind) {
262 case zerolocals : tty->print("zerolocals" ); break;
263 case zerolocals_synchronized: tty->print("zerolocals_synchronized"); break;
264 case native : tty->print("native" ); break;
265 case native_synchronized : tty->print("native_synchronized" ); break;
266 case empty : tty->print("empty" ); break;
267 case accessor : tty->print("accessor" ); break;
268 case abstract : tty->print("abstract" ); break;
269 case java_lang_math_sin : tty->print("java_lang_math_sin" ); break;
270 case java_lang_math_cos : tty->print("java_lang_math_cos" ); break;
271 case java_lang_math_tan : tty->print("java_lang_math_tan" ); break;
272 case java_lang_math_abs : tty->print("java_lang_math_abs" ); break;
273 case java_lang_math_sqrt : tty->print("java_lang_math_sqrt" ); break;
274 case java_lang_math_log : tty->print("java_lang_math_log" ); break;
275 case java_lang_math_log10 : tty->print("java_lang_math_log10" ); break;
276 case java_lang_math_fmaD : tty->print("java_lang_math_fmaD" ); break;
277 case java_lang_math_fmaF : tty->print("java_lang_math_fmaF" ); break;
278 case java_util_zip_CRC32_update : tty->print("java_util_zip_CRC32_update"); break;
279 case java_util_zip_CRC32_updateBytes : tty->print("java_util_zip_CRC32_updateBytes"); break;
280 case java_util_zip_CRC32_updateByteBuffer : tty->print("java_util_zip_CRC32_updateByteBuffer"); break;
281 case java_util_zip_CRC32C_updateBytes : tty->print("java_util_zip_CRC32C_updateBytes"); break;
282 case java_util_zip_CRC32C_updateDirectByteBuffer: tty->print("java_util_zip_CRC32C_updateDirectByteByffer"); break;
283 default:
284 if (kind >= method_handle_invoke_FIRST &&
285 kind <= method_handle_invoke_LAST) {
286 const char* kind_name = vmIntrinsics::name_at(method_handle_intrinsic(kind));
287 if (kind_name[0] == '_') kind_name = &kind_name[1]; // '_invokeExact' => 'invokeExact'
288 tty->print("method_handle_%s", kind_name);
289 break;
290 }
291 ShouldNotReachHere();
292 break;
293 }
294 }
295 #endif // PRODUCT
296
297
298 //------------------------------------------------------------------------------------------------------------------------
299 // Deoptimization support
300
301 /**
302 * If a deoptimization happens, this function returns the point of next bytecode to continue execution.
303 */
304 address AbstractInterpreter::deopt_continue_after_entry(Method* method, address bcp, int callee_parameters, bool is_top_frame) {
305 assert(method->contains(bcp), "just checkin'");
306
307 // Get the original and rewritten bytecode.
308 Bytecodes::Code code = Bytecodes::java_code_at(method, bcp);
309 assert(!Interpreter::bytecode_should_reexecute(code), "should not reexecute");
310
311 const int bci = method->bci_from(bcp);
312
313 // compute continuation length
314 const int length = Bytecodes::length_at(method, bcp);
315
316 // compute result type
317 BasicType type = T_ILLEGAL;
318
319 switch (code) {
320 case Bytecodes::_invokevirtual :
321 case Bytecodes::_invokespecial :
322 case Bytecodes::_invokestatic :
323 case Bytecodes::_invokeinterface: {
324 Thread *thread = Thread::current();
325 ResourceMark rm(thread);
326 methodHandle mh(thread, method);
327 type = Bytecode_invoke(mh, bci).result_type();
328 // since the cache entry might not be initialized:
329 // (NOT needed for the old calling convension)
330 if (!is_top_frame) {
331 int index = Bytes::get_native_u2(bcp+1);
332 method->constants()->cache()->entry_at(index)->set_parameter_size(callee_parameters);
333 }
334 break;
335 }
336
337 case Bytecodes::_invokedynamic: {
338 Thread *thread = Thread::current();
339 ResourceMark rm(thread);
340 methodHandle mh(thread, method);
341 type = Bytecode_invoke(mh, bci).result_type();
342 // since the cache entry might not be initialized:
343 // (NOT needed for the old calling convension)
344 if (!is_top_frame) {
345 int index = Bytes::get_native_u4(bcp+1);
346 method->constants()->invokedynamic_cp_cache_entry_at(index)->set_parameter_size(callee_parameters);
347 }
348 break;
349 }
350
351 case Bytecodes::_ldc :
352 case Bytecodes::_ldc_w : // fall through
353 case Bytecodes::_ldc2_w:
354 {
355 Thread *thread = Thread::current();
356 ResourceMark rm(thread);
357 methodHandle mh(thread, method);
358 type = Bytecode_loadconstant(mh, bci).result_type();
359 break;
360 }
361
362 default:
363 type = Bytecodes::result_type(code);
364 break;
365 }
366
367 // return entry point for computed continuation state & bytecode length
368 return
369 is_top_frame
370 ? Interpreter::deopt_entry (as_TosState(type), length)
371 : Interpreter::return_entry(as_TosState(type), length, code);
372 }
373
374 // If deoptimization happens, this function returns the point where the interpreter reexecutes
375 // the bytecode.
376 // Note: Bytecodes::_athrow is a special case in that it does not return
377 // Interpreter::deopt_entry(vtos, 0) like others
378 address AbstractInterpreter::deopt_reexecute_entry(Method* method, address bcp) {
379 assert(method->contains(bcp), "just checkin'");
380 Bytecodes::Code code = Bytecodes::java_code_at(method, bcp);
381 #if defined(COMPILER1) || INCLUDE_JVMCI
382 if(code == Bytecodes::_athrow ) {
383 return Interpreter::rethrow_exception_entry();
384 }
385 #endif /* COMPILER1 || INCLUDE_JVMCI */
386 return Interpreter::deopt_entry(vtos, 0);
387 }
388
389 // If deoptimization happens, the interpreter should reexecute these bytecodes.
390 // This function mainly helps the compilers to set up the reexecute bit.
391 bool AbstractInterpreter::bytecode_should_reexecute(Bytecodes::Code code) {
392 switch (code) {
393 case Bytecodes::_lookupswitch:
394 case Bytecodes::_tableswitch:
395 case Bytecodes::_fast_binaryswitch:
396 case Bytecodes::_fast_linearswitch:
397 // recompute condtional expression folded into _if<cond>
398 case Bytecodes::_lcmp :
399 case Bytecodes::_fcmpl :
400 case Bytecodes::_fcmpg :
401 case Bytecodes::_dcmpl :
402 case Bytecodes::_dcmpg :
403 case Bytecodes::_ifnull :
404 case Bytecodes::_ifnonnull :
405 case Bytecodes::_goto :
406 case Bytecodes::_goto_w :
407 case Bytecodes::_ifeq :
408 case Bytecodes::_ifne :
409 case Bytecodes::_iflt :
410 case Bytecodes::_ifge :
411 case Bytecodes::_ifgt :
412 case Bytecodes::_ifle :
413 case Bytecodes::_if_icmpeq :
414 case Bytecodes::_if_icmpne :
415 case Bytecodes::_if_icmplt :
416 case Bytecodes::_if_icmpge :
417 case Bytecodes::_if_icmpgt :
418 case Bytecodes::_if_icmple :
419 case Bytecodes::_if_acmpeq :
420 case Bytecodes::_if_acmpne :
421 // special cases
422 case Bytecodes::_getfield :
423 case Bytecodes::_putfield :
424 case Bytecodes::_getstatic :
425 case Bytecodes::_putstatic :
426 case Bytecodes::_aastore :
427 #ifdef COMPILER1
428 //special case of reexecution
429 case Bytecodes::_athrow :
430 #endif
431 return true;
432
433 default:
434 return false;
435 }
436 }
437
438 void AbstractInterpreter::initialize_method_handle_entries() {
439 // method handle entry kinds are generated later in MethodHandlesAdapterGenerator::generate:
440 for (int i = method_handle_invoke_FIRST; i <= method_handle_invoke_LAST; i++) {
441 MethodKind kind = (MethodKind) i;
442 _entry_table[kind] = _entry_table[Interpreter::abstract];
443 Interpreter::update_cds_entry_table(kind);
444 }
445 }