Mercurial > jdk8-mips64-public > hotspot / file revision
src/share/vm/interpreter/interpreter.cpp@1d7922586cf6
src/share/vm/interpreter/interpreter.cpp
Tue, 24 Jul 2012 10:51:00 -0700
- author
- twisti
- date
- Tue, 24 Jul 2012 10:51:00 -0700
- changeset 3969
- 1d7922586cf6
- parent 3787
- 6759698e3140
- child 4037
- da91efe96a93
- permissions
- -rw-r--r--
7023639: JSR 292 method handle invocation needs a fast path for compiled code
6984705: JSR 292 method handle creation should not go through JNI
Summary: remove assembly code for JDK 7 chained method handles
Reviewed-by: jrose, twisti, kvn, mhaupt
Contributed-by: John Rose <john.r.rose@oracle.com>, Christian Thalinger <christian.thalinger@oracle.com>, Michael Haupt <michael.haupt@oracle.com>
1 /*
2 * Copyright (c) 1997, 2011, 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 */
25 #include "precompiled.hpp"
26 #include "asm/assembler.hpp"
27 #include "interpreter/bytecodeHistogram.hpp"
28 #include "interpreter/bytecodeInterpreter.hpp"
29 #include "interpreter/interpreter.hpp"
30 #include "interpreter/interpreterRuntime.hpp"
31 #include "interpreter/templateTable.hpp"
32 #include "memory/allocation.inline.hpp"
33 #include "memory/resourceArea.hpp"
34 #include "oops/arrayOop.hpp"
35 #include "oops/methodDataOop.hpp"
36 #include "oops/methodOop.hpp"
37 #include "oops/oop.inline.hpp"
38 #include "prims/forte.hpp"
39 #include "prims/jvmtiExport.hpp"
40 #include "prims/methodHandles.hpp"
41 #include "runtime/handles.inline.hpp"
42 #include "runtime/sharedRuntime.hpp"
43 #include "runtime/stubRoutines.hpp"
44 #include "runtime/timer.hpp"
46 # define __ _masm->
49 //------------------------------------------------------------------------------------------------------------------------
50 // Implementation of InterpreterCodelet
52 void InterpreterCodelet::initialize(const char* description, Bytecodes::Code bytecode) {
53 _description = description;
54 _bytecode = bytecode;
55 }
58 void InterpreterCodelet::verify() {
59 }
62 void InterpreterCodelet::print_on(outputStream* st) const {
63 if (PrintInterpreter) {
64 st->cr();
65 st->print_cr("----------------------------------------------------------------------");
66 }
68 if (description() != NULL) st->print("%s ", description());
69 if (bytecode() >= 0 ) st->print("%d %s ", bytecode(), Bytecodes::name(bytecode()));
70 st->print_cr("[" INTPTR_FORMAT ", " INTPTR_FORMAT "] %d bytes",
71 code_begin(), code_end(), code_size());
73 if (PrintInterpreter) {
74 st->cr();
75 Disassembler::decode(code_begin(), code_end(), st);
76 }
77 }
80 //------------------------------------------------------------------------------------------------------------------------
81 // Implementation of platform independent aspects of Interpreter
83 void AbstractInterpreter::initialize() {
84 if (_code != NULL) return;
86 // make sure 'imported' classes are initialized
87 if (CountBytecodes || TraceBytecodes || StopInterpreterAt) BytecodeCounter::reset();
88 if (PrintBytecodeHistogram) BytecodeHistogram::reset();
89 if (PrintBytecodePairHistogram) BytecodePairHistogram::reset();
91 InvocationCounter::reinitialize(DelayCompilationDuringStartup);
93 }
95 void AbstractInterpreter::print() {
96 tty->cr();
97 tty->print_cr("----------------------------------------------------------------------");
98 tty->print_cr("Interpreter");
99 tty->cr();
100 tty->print_cr("code size = %6dK bytes", (int)_code->used_space()/1024);
101 tty->print_cr("total space = %6dK bytes", (int)_code->total_space()/1024);
102 tty->print_cr("wasted space = %6dK bytes", (int)_code->available_space()/1024);
103 tty->cr();
104 tty->print_cr("# of codelets = %6d" , _code->number_of_stubs());
105 tty->print_cr("avg codelet size = %6d bytes", _code->used_space() / _code->number_of_stubs());
106 tty->cr();
107 _code->print();
108 tty->print_cr("----------------------------------------------------------------------");
109 tty->cr();
110 }
113 void interpreter_init() {
114 Interpreter::initialize();
115 #ifndef PRODUCT
116 if (TraceBytecodes) BytecodeTracer::set_closure(BytecodeTracer::std_closure());
117 #endif // PRODUCT
118 // need to hit every safepoint in order to call zapping routine
119 // register the interpreter
120 Forte::register_stub(
121 "Interpreter",
122 AbstractInterpreter::code()->code_start(),
123 AbstractInterpreter::code()->code_end()
124 );
126 // notify JVMTI profiler
127 if (JvmtiExport::should_post_dynamic_code_generated()) {
128 JvmtiExport::post_dynamic_code_generated("Interpreter",
129 AbstractInterpreter::code()->code_start(),
130 AbstractInterpreter::code()->code_end());
131 }
132 }
134 //------------------------------------------------------------------------------------------------------------------------
135 // Implementation of interpreter
137 StubQueue* AbstractInterpreter::_code = NULL;
138 bool AbstractInterpreter::_notice_safepoints = false;
139 address AbstractInterpreter::_rethrow_exception_entry = NULL;
141 address AbstractInterpreter::_native_entry_begin = NULL;
142 address AbstractInterpreter::_native_entry_end = NULL;
143 address AbstractInterpreter::_slow_signature_handler;
144 address AbstractInterpreter::_entry_table [AbstractInterpreter::number_of_method_entries];
145 address AbstractInterpreter::_native_abi_to_tosca [AbstractInterpreter::number_of_result_handlers];
147 //------------------------------------------------------------------------------------------------------------------------
148 // Generation of complete interpreter
150 AbstractInterpreterGenerator::AbstractInterpreterGenerator(StubQueue* _code) {
151 _masm = NULL;
152 }
155 static const BasicType types[Interpreter::number_of_result_handlers] = {
156 T_BOOLEAN,
157 T_CHAR ,
158 T_BYTE ,
159 T_SHORT ,
160 T_INT ,
161 T_LONG ,
162 T_VOID ,
163 T_FLOAT ,
164 T_DOUBLE ,
165 T_OBJECT
166 };
168 void AbstractInterpreterGenerator::generate_all() {
171 { CodeletMark cm(_masm, "slow signature handler");
172 Interpreter::_slow_signature_handler = generate_slow_signature_handler();
173 }
175 }
177 //------------------------------------------------------------------------------------------------------------------------
178 // Entry points
180 AbstractInterpreter::MethodKind AbstractInterpreter::method_kind(methodHandle m) {
181 // Abstract method?
182 if (m->is_abstract()) return abstract;
184 // Method handle primitive?
185 if (m->is_method_handle_intrinsic()) {
186 vmIntrinsics::ID id = m->intrinsic_id();
187 assert(MethodHandles::is_signature_polymorphic(id), "must match an intrinsic");
188 MethodKind kind = (MethodKind)( method_handle_invoke_FIRST +
189 ((int)id - vmIntrinsics::FIRST_MH_SIG_POLY) );
190 assert(kind <= method_handle_invoke_LAST, "parallel enum ranges");
191 return kind;
192 }
194 // Native method?
195 // Note: This test must come _before_ the test for intrinsic
196 // methods. See also comments below.
197 if (m->is_native()) {
198 assert(!m->is_method_handle_intrinsic(), "overlapping bits here, watch out");
199 return m->is_synchronized() ? native_synchronized : native;
200 }
202 // Synchronized?
203 if (m->is_synchronized()) {
204 return zerolocals_synchronized;
205 }
207 if (RegisterFinalizersAtInit && m->code_size() == 1 &&
208 m->intrinsic_id() == vmIntrinsics::_Object_init) {
209 // We need to execute the special return bytecode to check for
210 // finalizer registration so create a normal frame.
211 return zerolocals;
212 }
214 // Empty method?
215 if (m->is_empty_method()) {
216 return empty;
217 }
219 // Special intrinsic method?
220 // Note: This test must come _after_ the test for native methods,
221 // otherwise we will run into problems with JDK 1.2, see also
222 // AbstractInterpreterGenerator::generate_method_entry() for
223 // for details.
224 switch (m->intrinsic_id()) {
225 case vmIntrinsics::_dsin : return java_lang_math_sin ;
226 case vmIntrinsics::_dcos : return java_lang_math_cos ;
227 case vmIntrinsics::_dtan : return java_lang_math_tan ;
228 case vmIntrinsics::_dabs : return java_lang_math_abs ;
229 case vmIntrinsics::_dsqrt : return java_lang_math_sqrt ;
230 case vmIntrinsics::_dlog : return java_lang_math_log ;
231 case vmIntrinsics::_dlog10: return java_lang_math_log10;
232 case vmIntrinsics::_dpow : return java_lang_math_pow ;
233 case vmIntrinsics::_dexp : return java_lang_math_exp ;
235 case vmIntrinsics::_Reference_get:
236 return java_lang_ref_reference_get;
237 }
239 // Accessor method?
240 if (m->is_accessor()) {
241 assert(m->size_of_parameters() == 1, "fast code for accessors assumes parameter size = 1");
242 return accessor;
243 }
245 // Note: for now: zero locals for all non-empty methods
246 return zerolocals;
247 }
250 void AbstractInterpreter::set_entry_for_kind(AbstractInterpreter::MethodKind kind, address entry) {
251 assert(kind >= method_handle_invoke_FIRST &&
252 kind <= method_handle_invoke_LAST, "late initialization only for MH entry points");
253 assert(_entry_table[kind] == _entry_table[abstract], "previous value must be AME entry");
254 _entry_table[kind] = entry;
255 }
258 // Return true if the interpreter can prove that the given bytecode has
259 // not yet been executed (in Java semantics, not in actual operation).
260 bool AbstractInterpreter::is_not_reached(methodHandle method, int bci) {
261 Bytecodes::Code code = method()->code_at(bci);
263 if (!Bytecodes::must_rewrite(code)) {
264 // might have been reached
265 return false;
266 }
268 // the bytecode might not be rewritten if the method is an accessor, etc.
269 address ientry = method->interpreter_entry();
270 if (ientry != entry_for_kind(AbstractInterpreter::zerolocals) &&
271 ientry != entry_for_kind(AbstractInterpreter::zerolocals_synchronized))
272 return false; // interpreter does not run this method!
274 // otherwise, we can be sure this bytecode has never been executed
275 return true;
276 }
279 #ifndef PRODUCT
280 void AbstractInterpreter::print_method_kind(MethodKind kind) {
281 switch (kind) {
282 case zerolocals : tty->print("zerolocals" ); break;
283 case zerolocals_synchronized: tty->print("zerolocals_synchronized"); break;
284 case native : tty->print("native" ); break;
285 case native_synchronized : tty->print("native_synchronized" ); break;
286 case empty : tty->print("empty" ); break;
287 case accessor : tty->print("accessor" ); break;
288 case abstract : tty->print("abstract" ); break;
289 case java_lang_math_sin : tty->print("java_lang_math_sin" ); break;
290 case java_lang_math_cos : tty->print("java_lang_math_cos" ); break;
291 case java_lang_math_tan : tty->print("java_lang_math_tan" ); break;
292 case java_lang_math_abs : tty->print("java_lang_math_abs" ); break;
293 case java_lang_math_sqrt : tty->print("java_lang_math_sqrt" ); break;
294 case java_lang_math_log : tty->print("java_lang_math_log" ); break;
295 case java_lang_math_log10 : tty->print("java_lang_math_log10" ); break;
296 default:
297 if (kind >= method_handle_invoke_FIRST &&
298 kind <= method_handle_invoke_LAST) {
299 const char* kind_name = vmIntrinsics::name_at(method_handle_intrinsic(kind));
300 if (kind_name[0] == '_') kind_name = &kind_name[1]; // '_invokeExact' => 'invokeExact'
301 tty->print("method_handle_%s", kind_name);
302 break;
303 }
304 ShouldNotReachHere();
305 break;
306 }
307 }
308 #endif // PRODUCT
311 //------------------------------------------------------------------------------------------------------------------------
312 // Deoptimization support
314 // If deoptimization happens, this function returns the point of next bytecode to continue execution
315 address AbstractInterpreter::deopt_continue_after_entry(methodOop method, address bcp, int callee_parameters, bool is_top_frame) {
316 assert(method->contains(bcp), "just checkin'");
317 Bytecodes::Code code = Bytecodes::java_code_at(method, bcp);
318 assert(!Interpreter::bytecode_should_reexecute(code), "should not reexecute");
319 int bci = method->bci_from(bcp);
320 int length = -1; // initial value for debugging
321 // compute continuation length
322 length = Bytecodes::length_at(method, bcp);
323 // compute result type
324 BasicType type = T_ILLEGAL;
326 switch (code) {
327 case Bytecodes::_invokevirtual :
328 case Bytecodes::_invokespecial :
329 case Bytecodes::_invokestatic :
330 case Bytecodes::_invokeinterface: {
331 Thread *thread = Thread::current();
332 ResourceMark rm(thread);
333 methodHandle mh(thread, method);
334 type = Bytecode_invoke(mh, bci).result_type();
335 // since the cache entry might not be initialized:
336 // (NOT needed for the old calling convension)
337 if (!is_top_frame) {
338 int index = Bytes::get_native_u2(bcp+1);
339 method->constants()->cache()->entry_at(index)->set_parameter_size(callee_parameters);
340 }
341 break;
342 }
344 case Bytecodes::_invokedynamic: {
345 Thread *thread = Thread::current();
346 ResourceMark rm(thread);
347 methodHandle mh(thread, method);
348 type = Bytecode_invoke(mh, bci).result_type();
349 // since the cache entry might not be initialized:
350 // (NOT needed for the old calling convension)
351 if (!is_top_frame) {
352 int index = Bytes::get_native_u4(bcp+1);
353 method->constants()->cache()->secondary_entry_at(index)->set_parameter_size(callee_parameters);
354 }
355 break;
356 }
358 case Bytecodes::_ldc :
359 case Bytecodes::_ldc_w : // fall through
360 case Bytecodes::_ldc2_w:
361 {
362 Thread *thread = Thread::current();
363 ResourceMark rm(thread);
364 methodHandle mh(thread, method);
365 type = Bytecode_loadconstant(mh, bci).result_type();
366 break;
367 }
369 default:
370 type = Bytecodes::result_type(code);
371 break;
372 }
374 // return entry point for computed continuation state & bytecode length
375 return
376 is_top_frame
377 ? Interpreter::deopt_entry (as_TosState(type), length)
378 : Interpreter::return_entry(as_TosState(type), length);
379 }
381 // If deoptimization happens, this function returns the point where the interpreter reexecutes
382 // the bytecode.
383 // Note: Bytecodes::_athrow is a special case in that it does not return
384 // Interpreter::deopt_entry(vtos, 0) like others
385 address AbstractInterpreter::deopt_reexecute_entry(methodOop method, address bcp) {
386 assert(method->contains(bcp), "just checkin'");
387 Bytecodes::Code code = Bytecodes::java_code_at(method, bcp);
388 #ifdef COMPILER1
389 if(code == Bytecodes::_athrow ) {
390 return Interpreter::rethrow_exception_entry();
391 }
392 #endif /* COMPILER1 */
393 return Interpreter::deopt_entry(vtos, 0);
394 }
396 // If deoptimization happens, the interpreter should reexecute these bytecodes.
397 // This function mainly helps the compilers to set up the reexecute bit.
398 bool AbstractInterpreter::bytecode_should_reexecute(Bytecodes::Code code) {
399 switch (code) {
400 case Bytecodes::_lookupswitch:
401 case Bytecodes::_tableswitch:
402 case Bytecodes::_fast_binaryswitch:
403 case Bytecodes::_fast_linearswitch:
404 // recompute condtional expression folded into _if<cond>
405 case Bytecodes::_lcmp :
406 case Bytecodes::_fcmpl :
407 case Bytecodes::_fcmpg :
408 case Bytecodes::_dcmpl :
409 case Bytecodes::_dcmpg :
410 case Bytecodes::_ifnull :
411 case Bytecodes::_ifnonnull :
412 case Bytecodes::_goto :
413 case Bytecodes::_goto_w :
414 case Bytecodes::_ifeq :
415 case Bytecodes::_ifne :
416 case Bytecodes::_iflt :
417 case Bytecodes::_ifge :
418 case Bytecodes::_ifgt :
419 case Bytecodes::_ifle :
420 case Bytecodes::_if_icmpeq :
421 case Bytecodes::_if_icmpne :
422 case Bytecodes::_if_icmplt :
423 case Bytecodes::_if_icmpge :
424 case Bytecodes::_if_icmpgt :
425 case Bytecodes::_if_icmple :
426 case Bytecodes::_if_acmpeq :
427 case Bytecodes::_if_acmpne :
428 // special cases
429 case Bytecodes::_getfield :
430 case Bytecodes::_putfield :
431 case Bytecodes::_getstatic :
432 case Bytecodes::_putstatic :
433 case Bytecodes::_aastore :
434 #ifdef COMPILER1
435 //special case of reexecution
436 case Bytecodes::_athrow :
437 #endif
438 return true;
440 default:
441 return false;
442 }
443 }
445 void AbstractInterpreterGenerator::bang_stack_shadow_pages(bool native_call) {
446 // Quick & dirty stack overflow checking: bang the stack & handle trap.
447 // Note that we do the banging after the frame is setup, since the exception
448 // handling code expects to find a valid interpreter frame on the stack.
449 // Doing the banging earlier fails if the caller frame is not an interpreter
450 // frame.
451 // (Also, the exception throwing code expects to unlock any synchronized
452 // method receiever, so do the banging after locking the receiver.)
454 // Bang each page in the shadow zone. We can't assume it's been done for
455 // an interpreter frame with greater than a page of locals, so each page
456 // needs to be checked. Only true for non-native.
457 if (UseStackBanging) {
458 const int start_page = native_call ? StackShadowPages : 1;
459 const int page_size = os::vm_page_size();
460 for (int pages = start_page; pages <= StackShadowPages ; pages++) {
461 __ bang_stack_with_offset(pages*page_size);
462 }
463 }
464 }
