1 /*
2 * Copyright (c) 1997, 2014, 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/interpreterGenerator.hpp"
33 #include "interpreter/interpreterRuntime.hpp"
34 #include "interpreter/interp_masm.hpp"
35 #include "interpreter/templateTable.hpp"
36 #include "memory/allocation.inline.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 //------------------------------------------------------------------------------------------------------------------------
54 // Implementation of InterpreterCodelet
55
56 void InterpreterCodelet::initialize(const char* description, Bytecodes::Code bytecode) {
57 _description = description;
58 _bytecode = bytecode;
59 }
60
61
62 void InterpreterCodelet::verify() {
63 }
64
65
66 void InterpreterCodelet::print_on(outputStream* st) const {
67 ttyLocker ttyl;
68
69 if (PrintInterpreter) {
70 st->cr();
71 st->print_cr("----------------------------------------------------------------------");
72 }
73
74 if (description() != NULL) st->print("%s ", description());
75 if (bytecode() >= 0 ) st->print("%d %s ", bytecode(), Bytecodes::name(bytecode()));
76 st->print_cr("[" INTPTR_FORMAT ", " INTPTR_FORMAT "] %d bytes",
77 p2i(code_begin()), p2i(code_end()), code_size());
78
79 if (PrintInterpreter) {
80 st->cr();
81 Disassembler::decode(code_begin(), code_end(), st, DEBUG_ONLY(_strings) NOT_DEBUG(CodeStrings()));
82 }
83 }
84
85 CodeletMark::CodeletMark(InterpreterMacroAssembler*& masm,
86 const char* description,
87 Bytecodes::Code bytecode) :
88 _clet((InterpreterCodelet*)AbstractInterpreter::code()->request(codelet_size())),
89 _cb(_clet->code_begin(), _clet->code_size()) {
90 // Request all space (add some slack for Codelet data).
91 assert(_clet != NULL, "we checked not enough space already");
92
93 // Initialize Codelet attributes.
94 _clet->initialize(description, bytecode);
95 // Create assembler for code generation.
96 masm = new InterpreterMacroAssembler(&_cb);
97 _masm = &masm;
98 }
99
100 CodeletMark::~CodeletMark() {
101 // Align so printing shows nop's instead of random code at the end (Codelets are aligned).
102 (*_masm)->align(wordSize);
103 // Make sure all code is in code buffer.
104 (*_masm)->flush();
105
106 // Commit Codelet.
107 AbstractInterpreter::code()->commit((*_masm)->code()->pure_insts_size(), (*_masm)->code()->strings());
108 // Make sure nobody can use _masm outside a CodeletMark lifespan.
109 *_masm = NULL;
110 }
111
112 //------------------------------------------------------------------------------------------------------------------------
113 // Implementation of platform independent aspects of Interpreter
114
115 void AbstractInterpreter::initialize() {
116 if (_code != NULL) return;
117
118 // make sure 'imported' classes are initialized
119 if (CountBytecodes || TraceBytecodes || StopInterpreterAt) BytecodeCounter::reset();
120 if (PrintBytecodeHistogram) BytecodeHistogram::reset();
121 if (PrintBytecodePairHistogram) BytecodePairHistogram::reset();
122
123 InvocationCounter::reinitialize(DelayCompilationDuringStartup);
124
125 }
126
127 void AbstractInterpreter::print() {
128 tty->cr();
129 tty->print_cr("----------------------------------------------------------------------");
130 tty->print_cr("Interpreter");
131 tty->cr();
132 tty->print_cr("code size = %6dK bytes", (int)_code->used_space()/1024);
133 tty->print_cr("total space = %6dK bytes", (int)_code->total_space()/1024);
134 tty->print_cr("wasted space = %6dK bytes", (int)_code->available_space()/1024);
135 tty->cr();
136 tty->print_cr("# of codelets = %6d" , _code->number_of_stubs());
137 tty->print_cr("avg codelet size = %6d bytes", _code->used_space() / _code->number_of_stubs());
138 tty->cr();
139 _code->print();
140 tty->print_cr("----------------------------------------------------------------------");
141 tty->cr();
142 }
143
144
145 void interpreter_init() {
146 Interpreter::initialize();
147 #ifndef PRODUCT
148 if (TraceBytecodes) BytecodeTracer::set_closure(BytecodeTracer::std_closure());
149 #endif // PRODUCT
150 // need to hit every safepoint in order to call zapping routine
151 // register the interpreter
152 Forte::register_stub(
153 "Interpreter",
154 AbstractInterpreter::code()->code_start(),
155 AbstractInterpreter::code()->code_end()
156 );
157
158 // notify JVMTI profiler
159 if (JvmtiExport::should_post_dynamic_code_generated()) {
160 JvmtiExport::post_dynamic_code_generated("Interpreter",
161 AbstractInterpreter::code()->code_start(),
162 AbstractInterpreter::code()->code_end());
163 }
164 }
165
166 //------------------------------------------------------------------------------------------------------------------------
167 // Implementation of interpreter
168
169 StubQueue* AbstractInterpreter::_code = NULL;
170 bool AbstractInterpreter::_notice_safepoints = false;
171 address AbstractInterpreter::_rethrow_exception_entry = NULL;
172
173 address AbstractInterpreter::_native_entry_begin = NULL;
174 address AbstractInterpreter::_native_entry_end = NULL;
175 address AbstractInterpreter::_slow_signature_handler;
176 address AbstractInterpreter::_entry_table [AbstractInterpreter::number_of_method_entries];
177 address AbstractInterpreter::_native_abi_to_tosca [AbstractInterpreter::number_of_result_handlers];
178
179 //------------------------------------------------------------------------------------------------------------------------
180 // Generation of complete interpreter
181
182 AbstractInterpreterGenerator::AbstractInterpreterGenerator(StubQueue* _code) {
183 _masm = NULL;
184 }
185
186
187 static const BasicType types[Interpreter::number_of_result_handlers] = {
188 T_BOOLEAN,
189 T_CHAR ,
190 T_BYTE ,
191 T_SHORT ,
192 T_INT ,
193 T_LONG ,
194 T_VOID ,
195 T_FLOAT ,
196 T_DOUBLE ,
197 T_OBJECT
198 };
199
200 void AbstractInterpreterGenerator::generate_all() {
201
202
203 { CodeletMark cm(_masm, "slow signature handler");
204 Interpreter::_slow_signature_handler = generate_slow_signature_handler();
205 }
206
207 }
208
209 //------------------------------------------------------------------------------------------------------------------------
210 // Entry points
211
212 AbstractInterpreter::MethodKind AbstractInterpreter::method_kind(methodHandle m) {
213 // Abstract method?
214 if (m->is_abstract()) return abstract;
215
216 // Method handle primitive?
217 if (m->is_method_handle_intrinsic()) {
218 vmIntrinsics::ID id = m->intrinsic_id();
219 assert(MethodHandles::is_signature_polymorphic(id), "must match an intrinsic");
220 MethodKind kind = (MethodKind)( method_handle_invoke_FIRST +
221 ((int)id - vmIntrinsics::FIRST_MH_SIG_POLY) );
222 assert(kind <= method_handle_invoke_LAST, "parallel enum ranges");
223 return kind;
224 }
225
226 #ifndef CC_INTERP
227 if (UseCRC32Intrinsics && m->is_native()) {
228 // Use optimized stub code for CRC32 native methods.
229 switch (m->intrinsic_id()) {
230 case vmIntrinsics::_updateCRC32 : return java_util_zip_CRC32_update;
231 case vmIntrinsics::_updateBytesCRC32 : return java_util_zip_CRC32_updateBytes;
232 case vmIntrinsics::_updateByteBufferCRC32 : return java_util_zip_CRC32_updateByteBuffer;
233 }
234 }
235 #endif
236
237 // Native method?
238 // Note: This test must come _before_ the test for intrinsic
239 // methods. See also comments below.
240 if (m->is_native()) {
241 assert(!m->is_method_handle_intrinsic(), "overlapping bits here, watch out");
242 return m->is_synchronized() ? native_synchronized : native;
243 }
244
245 // Synchronized?
246 if (m->is_synchronized()) {
247 return zerolocals_synchronized;
248 }
249
250 if (RegisterFinalizersAtInit && m->code_size() == 1 &&
251 m->intrinsic_id() == vmIntrinsics::_Object_init) {
252 // We need to execute the special return bytecode to check for
253 // finalizer registration so create a normal frame.
254 return zerolocals;
255 }
256
257 // Empty method?
258 if (m->is_empty_method()) {
259 return empty;
260 }
261
262 // Special intrinsic method?
263 // Note: This test must come _after_ the test for native methods,
264 // otherwise we will run into problems with JDK 1.2, see also
265 // InterpreterGenerator::generate_method_entry() for
266 // for details.
267 switch (m->intrinsic_id()) {
268 case vmIntrinsics::_dsin : return java_lang_math_sin ;
269 case vmIntrinsics::_dcos : return java_lang_math_cos ;
270 case vmIntrinsics::_dtan : return java_lang_math_tan ;
271 case vmIntrinsics::_dabs : return java_lang_math_abs ;
272 case vmIntrinsics::_dsqrt : return java_lang_math_sqrt ;
273 case vmIntrinsics::_dlog : return java_lang_math_log ;
274 case vmIntrinsics::_dlog10: return java_lang_math_log10;
275 case vmIntrinsics::_dpow : return java_lang_math_pow ;
276 case vmIntrinsics::_dexp : return java_lang_math_exp ;
277
278 case vmIntrinsics::_Reference_get:
279 return java_lang_ref_reference_get;
280 }
281
282 // Accessor method?
283 if (m->is_accessor()) {
284 assert(m->size_of_parameters() == 1, "fast code for accessors assumes parameter size = 1");
285 return accessor;
286 }
287
288 // Note: for now: zero locals for all non-empty methods
289 return zerolocals;
290 }
291
292
293 void AbstractInterpreter::set_entry_for_kind(AbstractInterpreter::MethodKind kind, address entry) {
294 assert(kind >= method_handle_invoke_FIRST &&
295 kind <= method_handle_invoke_LAST, "late initialization only for MH entry points");
296 assert(_entry_table[kind] == _entry_table[abstract], "previous value must be AME entry");
297 _entry_table[kind] = entry;
298 }
299
300
301 // Return true if the interpreter can prove that the given bytecode has
302 // not yet been executed (in Java semantics, not in actual operation).
303 bool AbstractInterpreter::is_not_reached(methodHandle method, int bci) {
304 Bytecodes::Code code = method()->code_at(bci);
305
306 if (!Bytecodes::must_rewrite(code)) {
307 // might have been reached
308 return false;
309 }
310
311 // the bytecode might not be rewritten if the method is an accessor, etc.
312 address ientry = method->interpreter_entry();
313 if (ientry != entry_for_kind(AbstractInterpreter::zerolocals) &&
314 ientry != entry_for_kind(AbstractInterpreter::zerolocals_synchronized))
315 return false; // interpreter does not run this method!
316
317 // otherwise, we can be sure this bytecode has never been executed
318 return true;
319 }
320
321
322 #ifndef PRODUCT
323 void AbstractInterpreter::print_method_kind(MethodKind kind) {
324 switch (kind) {
325 case zerolocals : tty->print("zerolocals" ); break;
326 case zerolocals_synchronized: tty->print("zerolocals_synchronized"); break;
327 case native : tty->print("native" ); break;
328 case native_synchronized : tty->print("native_synchronized" ); break;
329 case empty : tty->print("empty" ); break;
330 case accessor : tty->print("accessor" ); break;
331 case abstract : tty->print("abstract" ); break;
332 case java_lang_math_sin : tty->print("java_lang_math_sin" ); break;
333 case java_lang_math_cos : tty->print("java_lang_math_cos" ); break;
334 case java_lang_math_tan : tty->print("java_lang_math_tan" ); break;
335 case java_lang_math_abs : tty->print("java_lang_math_abs" ); break;
336 case java_lang_math_sqrt : tty->print("java_lang_math_sqrt" ); break;
337 case java_lang_math_log : tty->print("java_lang_math_log" ); break;
338 case java_lang_math_log10 : tty->print("java_lang_math_log10" ); break;
339 case java_util_zip_CRC32_update : tty->print("java_util_zip_CRC32_update"); break;
340 case java_util_zip_CRC32_updateBytes : tty->print("java_util_zip_CRC32_updateBytes"); break;
341 case java_util_zip_CRC32_updateByteBuffer : tty->print("java_util_zip_CRC32_updateByteBuffer"); break;
342 default:
343 if (kind >= method_handle_invoke_FIRST &&
344 kind <= method_handle_invoke_LAST) {
345 const char* kind_name = vmIntrinsics::name_at(method_handle_intrinsic(kind));
346 if (kind_name[0] == '_') kind_name = &kind_name[1]; // '_invokeExact' => 'invokeExact'
347 tty->print("method_handle_%s", kind_name);
348 break;
349 }
350 ShouldNotReachHere();
351 break;
352 }
353 }
354 #endif // PRODUCT
355
356
357 //------------------------------------------------------------------------------------------------------------------------
358 // Deoptimization support
359
360 /**
361 * If a deoptimization happens, this function returns the point of next bytecode to continue execution.
362 */
363 address AbstractInterpreter::deopt_continue_after_entry(Method* method, address bcp, int callee_parameters, bool is_top_frame) {
364 assert(method->contains(bcp), "just checkin'");
365
366 // Get the original and rewritten bytecode.
367 Bytecodes::Code code = Bytecodes::java_code_at(method, bcp);
368 assert(!Interpreter::bytecode_should_reexecute(code), "should not reexecute");
369
370 const int bci = method->bci_from(bcp);
371
372 // compute continuation length
373 const int length = Bytecodes::length_at(method, bcp);
374
375 // compute result type
376 BasicType type = T_ILLEGAL;
377
378 switch (code) {
379 case Bytecodes::_invokevirtual :
380 case Bytecodes::_invokespecial :
381 case Bytecodes::_invokestatic :
382 case Bytecodes::_invokeinterface: {
383 Thread *thread = Thread::current();
384 ResourceMark rm(thread);
385 methodHandle mh(thread, method);
386 type = Bytecode_invoke(mh, bci).result_type();
387 // since the cache entry might not be initialized:
388 // (NOT needed for the old calling convension)
389 if (!is_top_frame) {
390 int index = Bytes::get_native_u2(bcp+1);
391 method->constants()->cache()->entry_at(index)->set_parameter_size(callee_parameters);
392 }
393 break;
394 }
395
396 case Bytecodes::_invokedynamic: {
397 Thread *thread = Thread::current();
398 ResourceMark rm(thread);
399 methodHandle mh(thread, method);
400 type = Bytecode_invoke(mh, bci).result_type();
401 // since the cache entry might not be initialized:
402 // (NOT needed for the old calling convension)
403 if (!is_top_frame) {
404 int index = Bytes::get_native_u4(bcp+1);
405 method->constants()->invokedynamic_cp_cache_entry_at(index)->set_parameter_size(callee_parameters);
406 }
407 break;
408 }
409
410 case Bytecodes::_ldc :
411 case Bytecodes::_ldc_w : // fall through
412 case Bytecodes::_ldc2_w:
413 {
414 Thread *thread = Thread::current();
415 ResourceMark rm(thread);
416 methodHandle mh(thread, method);
417 type = Bytecode_loadconstant(mh, bci).result_type();
418 break;
419 }
420
421 default:
422 type = Bytecodes::result_type(code);
423 break;
424 }
425
426 // return entry point for computed continuation state & bytecode length
427 return
428 is_top_frame
429 ? Interpreter::deopt_entry (as_TosState(type), length)
430 : Interpreter::return_entry(as_TosState(type), length, code);
431 }
432
433 // If deoptimization happens, this function returns the point where the interpreter reexecutes
434 // the bytecode.
435 // Note: Bytecodes::_athrow is a special case in that it does not return
436 // Interpreter::deopt_entry(vtos, 0) like others
437 address AbstractInterpreter::deopt_reexecute_entry(Method* method, address bcp) {
438 assert(method->contains(bcp), "just checkin'");
439 Bytecodes::Code code = Bytecodes::java_code_at(method, bcp);
440 #ifdef COMPILER1
441 if(code == Bytecodes::_athrow ) {
442 return Interpreter::rethrow_exception_entry();
443 }
444 #endif /* COMPILER1 */
445 return Interpreter::deopt_entry(vtos, 0);
446 }
447
448 // If deoptimization happens, the interpreter should reexecute these bytecodes.
449 // This function mainly helps the compilers to set up the reexecute bit.
450 bool AbstractInterpreter::bytecode_should_reexecute(Bytecodes::Code code) {
451 switch (code) {
452 case Bytecodes::_lookupswitch:
453 case Bytecodes::_tableswitch:
454 case Bytecodes::_fast_binaryswitch:
455 case Bytecodes::_fast_linearswitch:
456 // recompute condtional expression folded into _if<cond>
457 case Bytecodes::_lcmp :
458 case Bytecodes::_fcmpl :
459 case Bytecodes::_fcmpg :
460 case Bytecodes::_dcmpl :
461 case Bytecodes::_dcmpg :
462 case Bytecodes::_ifnull :
463 case Bytecodes::_ifnonnull :
464 case Bytecodes::_goto :
465 case Bytecodes::_goto_w :
466 case Bytecodes::_ifeq :
467 case Bytecodes::_ifne :
468 case Bytecodes::_iflt :
469 case Bytecodes::_ifge :
470 case Bytecodes::_ifgt :
471 case Bytecodes::_ifle :
472 case Bytecodes::_if_icmpeq :
473 case Bytecodes::_if_icmpne :
474 case Bytecodes::_if_icmplt :
475 case Bytecodes::_if_icmpge :
476 case Bytecodes::_if_icmpgt :
477 case Bytecodes::_if_icmple :
478 case Bytecodes::_if_acmpeq :
479 case Bytecodes::_if_acmpne :
480 // special cases
481 case Bytecodes::_getfield :
482 case Bytecodes::_putfield :
483 case Bytecodes::_getstatic :
484 case Bytecodes::_putstatic :
485 case Bytecodes::_aastore :
486 #ifdef COMPILER1
487 //special case of reexecution
488 case Bytecodes::_athrow :
489 #endif
490 return true;
491
492 default:
493 return false;
494 }
495 }
496
497 void AbstractInterpreterGenerator::bang_stack_shadow_pages(bool native_call) {
498 // Quick & dirty stack overflow checking: bang the stack & handle trap.
499 // Note that we do the banging after the frame is setup, since the exception
500 // handling code expects to find a valid interpreter frame on the stack.
501 // Doing the banging earlier fails if the caller frame is not an interpreter
502 // frame.
503 // (Also, the exception throwing code expects to unlock any synchronized
504 // method receiever, so do the banging after locking the receiver.)
505
506 // Bang each page in the shadow zone. We can't assume it's been done for
507 // an interpreter frame with greater than a page of locals, so each page
508 // needs to be checked. Only true for non-native.
509 if (UseStackBanging) {
510 const int start_page = native_call ? StackShadowPages : 1;
511 const int page_size = os::vm_page_size();
512 for (int pages = start_page; pages <= StackShadowPages ; pages++) {
513 __ bang_stack_with_offset(pages*page_size);
514 }
515 }
516 }
517
518 void AbstractInterpreterGenerator::initialize_method_handle_entries() {
519 // method handle entry kinds are generated later in MethodHandlesAdapterGenerator::generate:
520 for (int i = Interpreter::method_handle_invoke_FIRST; i <= Interpreter::method_handle_invoke_LAST; i++) {
521 Interpreter::MethodKind kind = (Interpreter::MethodKind) i;
522 Interpreter::_entry_table[kind] = Interpreter::_entry_table[Interpreter::abstract];
523 }
524 }
525
526 // Generate method entries
527 address InterpreterGenerator::generate_method_entry(
528 AbstractInterpreter::MethodKind kind) {
529 // determine code generation flags
530 bool synchronized = false;
531 address entry_point = NULL;
532
533 switch (kind) {
534 case Interpreter::zerolocals : break;
535 case Interpreter::zerolocals_synchronized: synchronized = true; break;
536 case Interpreter::native : entry_point = generate_native_entry(false); break;
537 case Interpreter::native_synchronized : entry_point = generate_native_entry(true); break;
538 case Interpreter::empty : entry_point = generate_empty_entry(); break;
539 case Interpreter::accessor : entry_point = generate_accessor_entry(); break;
540 case Interpreter::abstract : entry_point = generate_abstract_entry(); break;
541
542 case Interpreter::java_lang_math_sin : // fall thru
543 case Interpreter::java_lang_math_cos : // fall thru
544 case Interpreter::java_lang_math_tan : // fall thru
545 case Interpreter::java_lang_math_abs : // fall thru
546 case Interpreter::java_lang_math_log : // fall thru
547 case Interpreter::java_lang_math_log10 : // fall thru
548 case Interpreter::java_lang_math_sqrt : // fall thru
549 case Interpreter::java_lang_math_pow : // fall thru
550 case Interpreter::java_lang_math_exp : entry_point = generate_math_entry(kind); break;
551 case Interpreter::java_lang_ref_reference_get
552 : entry_point = generate_Reference_get_entry(); break;
553 #ifndef CC_INTERP
554 case Interpreter::java_util_zip_CRC32_update
555 : entry_point = generate_CRC32_update_entry(); break;
556 case Interpreter::java_util_zip_CRC32_updateBytes
557 : // fall thru
558 case Interpreter::java_util_zip_CRC32_updateByteBuffer
559 : entry_point = generate_CRC32_updateBytes_entry(kind); break;
560 #endif // CC_INTERP
561 default:
562 fatal(err_msg("unexpected method kind: %d", kind));
563 break;
564 }
565
566 if (entry_point) {
567 return entry_point;
568 }
569
570 return generate_normal_entry(synchronized);
571 }