interpreter.cpp revision 0:a61af66fc99e 
1/*
2 * Copyright 1997-2007 Sun Microsystems, Inc.  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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
20 * CA 95054 USA or visit www.sun.com if you need additional information or
21 * have any questions.
22 *
23 */
24
25#include "incls/_precompiled.incl"
26#include "incls/_interpreter.cpp.incl"
27
28# define __ _masm->
29
30
31//------------------------------------------------------------------------------------------------------------------------
32// Implementation of InterpreterCodelet
33
34void InterpreterCodelet::initialize(const char* description, Bytecodes::Code bytecode) {
35  _description       = description;
36  _bytecode          = bytecode;
37}
38
39
40void InterpreterCodelet::verify() {
41}
42
43
44void InterpreterCodelet::print() {
45  if (PrintInterpreter) {
46    tty->cr();
47    tty->print_cr("----------------------------------------------------------------------");
48  }
49
50  if (description() != NULL) tty->print("%s  ", description());
51  if (bytecode()    >= 0   ) tty->print("%d %s  ", bytecode(), Bytecodes::name(bytecode()));
52  tty->print_cr("[" INTPTR_FORMAT ", " INTPTR_FORMAT "]  %d bytes",
53                code_begin(), code_end(), code_size());
54
55  if (PrintInterpreter) {
56    tty->cr();
57    Disassembler::decode(code_begin(), code_end(), tty);
58  }
59}
60
61
62//------------------------------------------------------------------------------------------------------------------------
63// Implementation of  platform independent aspects of Interpreter
64
65void AbstractInterpreter::initialize() {
66  if (_code != NULL) return;
67
68  // make sure 'imported' classes are initialized
69  if (CountBytecodes || TraceBytecodes || StopInterpreterAt) BytecodeCounter::reset();
70  if (PrintBytecodeHistogram)                                BytecodeHistogram::reset();
71  if (PrintBytecodePairHistogram)                            BytecodePairHistogram::reset();
72
73  InvocationCounter::reinitialize(DelayCompilationDuringStartup);
74
75}
76
77void AbstractInterpreter::print() {
78  tty->cr();
79  tty->print_cr("----------------------------------------------------------------------");
80  tty->print_cr("Interpreter");
81  tty->cr();
82  tty->print_cr("code size        = %6dK bytes", (int)_code->used_space()/1024);
83  tty->print_cr("total space      = %6dK bytes", (int)_code->total_space()/1024);
84  tty->print_cr("wasted space     = %6dK bytes", (int)_code->available_space()/1024);
85  tty->cr();
86  tty->print_cr("# of codelets    = %6d"      , _code->number_of_stubs());
87  tty->print_cr("avg codelet size = %6d bytes", _code->used_space() / _code->number_of_stubs());
88  tty->cr();
89  _code->print();
90  tty->print_cr("----------------------------------------------------------------------");
91  tty->cr();
92}
93
94
95void interpreter_init() {
96  Interpreter::initialize();
97#ifndef PRODUCT
98  if (TraceBytecodes) BytecodeTracer::set_closure(BytecodeTracer::std_closure());
99#endif // PRODUCT
100  // need to hit every safepoint in order to call zapping routine
101  // register the interpreter
102  VTune::register_stub(
103    "Interpreter",
104    AbstractInterpreter::code()->code_start(),
105    AbstractInterpreter::code()->code_end()
106  );
107  Forte::register_stub(
108    "Interpreter",
109    AbstractInterpreter::code()->code_start(),
110    AbstractInterpreter::code()->code_end()
111  );
112
113  // notify JVMTI profiler
114  if (JvmtiExport::should_post_dynamic_code_generated()) {
115    JvmtiExport::post_dynamic_code_generated("Interpreter",
116                                             AbstractInterpreter::code()->code_start(),
117                                             AbstractInterpreter::code()->code_end());
118  }
119}
120
121//------------------------------------------------------------------------------------------------------------------------
122// Implementation of interpreter
123
124StubQueue* AbstractInterpreter::_code                                       = NULL;
125bool       AbstractInterpreter::_notice_safepoints                          = false;
126address    AbstractInterpreter::_rethrow_exception_entry                    = NULL;
127
128address    AbstractInterpreter::_native_entry_begin                         = NULL;
129address    AbstractInterpreter::_native_entry_end                           = NULL;
130address    AbstractInterpreter::_slow_signature_handler;
131address    AbstractInterpreter::_entry_table            [AbstractInterpreter::number_of_method_entries];
132address    AbstractInterpreter::_native_abi_to_tosca    [AbstractInterpreter::number_of_result_handlers];
133
134//------------------------------------------------------------------------------------------------------------------------
135// Generation of complete interpreter
136
137AbstractInterpreterGenerator::AbstractInterpreterGenerator(StubQueue* _code) {
138  _masm                      = NULL;
139}
140
141
142static const BasicType types[Interpreter::number_of_result_handlers] = {
143  T_BOOLEAN,
144  T_CHAR   ,
145  T_BYTE   ,
146  T_SHORT  ,
147  T_INT    ,
148  T_LONG   ,
149  T_VOID   ,
150  T_FLOAT  ,
151  T_DOUBLE ,
152  T_OBJECT
153};
154
155void AbstractInterpreterGenerator::generate_all() {
156
157
158  { CodeletMark cm(_masm, "slow signature handler");
159    Interpreter::_slow_signature_handler = generate_slow_signature_handler();
160  }
161
162}
163
164//------------------------------------------------------------------------------------------------------------------------
165// Entry points
166
167AbstractInterpreter::MethodKind AbstractInterpreter::method_kind(methodHandle m) {
168  // Abstract method?
169  if (m->is_abstract()) return abstract;
170
171  // Native method?
172  // Note: This test must come _before_ the test for intrinsic
173  //       methods. See also comments below.
174  if (m->is_native()) {
175    return m->is_synchronized() ? native_synchronized : native;
176  }
177
178  // Synchronized?
179  if (m->is_synchronized()) {
180    return zerolocals_synchronized;
181  }
182
183  if (RegisterFinalizersAtInit && m->code_size() == 1 &&
184      m->intrinsic_id() == vmIntrinsics::_Object_init) {
185    // We need to execute the special return bytecode to check for
186    // finalizer registration so create a normal frame.
187    return zerolocals;
188  }
189
190  // Empty method?
191  if (m->is_empty_method()) {
192    return empty;
193  }
194
195  // Accessor method?
196  if (m->is_accessor()) {
197    assert(m->size_of_parameters() == 1, "fast code for accessors assumes parameter size = 1");
198    return accessor;
199  }
200
201  // Special intrinsic method?
202  // Note: This test must come _after_ the test for native methods,
203  //       otherwise we will run into problems with JDK 1.2, see also
204  //       AbstractInterpreterGenerator::generate_method_entry() for
205  //       for details.
206  switch (m->intrinsic_id()) {
207    case vmIntrinsics::_dsin  : return java_lang_math_sin  ;
208    case vmIntrinsics::_dcos  : return java_lang_math_cos  ;
209    case vmIntrinsics::_dtan  : return java_lang_math_tan  ;
210    case vmIntrinsics::_dabs  : return java_lang_math_abs  ;
211    case vmIntrinsics::_dsqrt : return java_lang_math_sqrt ;
212    case vmIntrinsics::_dlog  : return java_lang_math_log  ;
213    case vmIntrinsics::_dlog10: return java_lang_math_log10;
214  }
215
216  // Note: for now: zero locals for all non-empty methods
217  return zerolocals;
218}
219
220
221// Return true if the interpreter can prove that the given bytecode has
222// not yet been executed (in Java semantics, not in actual operation).
223bool AbstractInterpreter::is_not_reached(methodHandle method, int bci) {
224  address bcp = method->bcp_from(bci);
225
226  if (!Bytecode_at(bcp)->must_rewrite()) {
227    // might have been reached
228    return false;
229  }
230
231  // the bytecode might not be rewritten if the method is an accessor, etc.
232  address ientry = method->interpreter_entry();
233  if (ientry != entry_for_kind(AbstractInterpreter::zerolocals) &&
234      ientry != entry_for_kind(AbstractInterpreter::zerolocals_synchronized))
235    return false;  // interpreter does not run this method!
236
237  // otherwise, we can be sure this bytecode has never been executed
238  return true;
239}
240
241
242#ifndef PRODUCT
243void AbstractInterpreter::print_method_kind(MethodKind kind) {
244  switch (kind) {
245    case zerolocals             : tty->print("zerolocals"             ); break;
246    case zerolocals_synchronized: tty->print("zerolocals_synchronized"); break;
247    case native                 : tty->print("native"                 ); break;
248    case native_synchronized    : tty->print("native_synchronized"    ); break;
249    case empty                  : tty->print("empty"                  ); break;
250    case accessor               : tty->print("accessor"               ); break;
251    case abstract               : tty->print("abstract"               ); break;
252    case java_lang_math_sin     : tty->print("java_lang_math_sin"     ); break;
253    case java_lang_math_cos     : tty->print("java_lang_math_cos"     ); break;
254    case java_lang_math_tan     : tty->print("java_lang_math_tan"     ); break;
255    case java_lang_math_abs     : tty->print("java_lang_math_abs"     ); break;
256    case java_lang_math_sqrt    : tty->print("java_lang_math_sqrt"    ); break;
257    case java_lang_math_log     : tty->print("java_lang_math_log"     ); break;
258    case java_lang_math_log10   : tty->print("java_lang_math_log10"   ); break;
259    default                     : ShouldNotReachHere();
260  }
261}
262#endif // PRODUCT
263
264static BasicType constant_pool_type(methodOop method, int index) {
265  constantTag tag = method->constants()->tag_at(index);
266       if (tag.is_int              ()) return T_INT;
267  else if (tag.is_float            ()) return T_FLOAT;
268  else if (tag.is_long             ()) return T_LONG;
269  else if (tag.is_double           ()) return T_DOUBLE;
270  else if (tag.is_string           ()) return T_OBJECT;
271  else if (tag.is_unresolved_string()) return T_OBJECT;
272  else if (tag.is_klass            ()) return T_OBJECT;
273  else if (tag.is_unresolved_klass ()) return T_OBJECT;
274  ShouldNotReachHere();
275  return T_ILLEGAL;
276}
277
278
279//------------------------------------------------------------------------------------------------------------------------
280// Deoptimization support
281
282// If deoptimization happens, this method returns the point where to continue in
283// interpreter. For calls (invokexxxx, newxxxx) the continuation is at next
284// bci and the top of stack is in eax/edx/FPU tos.
285// For putfield/getfield, put/getstatic, the continuation is at the same
286// bci and the TOS is on stack.
287
288// Note: deopt_entry(type, 0) means reexecute bytecode
289//       deopt_entry(type, length) means continue at next bytecode
290
291address AbstractInterpreter::continuation_for(methodOop method, address bcp, int callee_parameters, bool is_top_frame, bool& use_next_mdp) {
292  assert(method->contains(bcp), "just checkin'");
293  Bytecodes::Code code   = Bytecodes::java_code_at(bcp);
294  int             bci    = method->bci_from(bcp);
295  int             length = -1; // initial value for debugging
296  // compute continuation length
297  length = Bytecodes::length_at(bcp);
298  // compute result type
299  BasicType type = T_ILLEGAL;
300  // when continuing after a compiler safepoint, re-execute the bytecode
301  // (an invoke is continued after the safepoint)
302  use_next_mdp = true;
303  switch (code) {
304    case Bytecodes::_lookupswitch:
305    case Bytecodes::_tableswitch:
306    case Bytecodes::_fast_binaryswitch:
307    case Bytecodes::_fast_linearswitch:
308    // recompute condtional expression folded into _if<cond>
309    case Bytecodes::_lcmp      :
310    case Bytecodes::_fcmpl     :
311    case Bytecodes::_fcmpg     :
312    case Bytecodes::_dcmpl     :
313    case Bytecodes::_dcmpg     :
314    case Bytecodes::_ifnull    :
315    case Bytecodes::_ifnonnull :
316    case Bytecodes::_goto      :
317    case Bytecodes::_goto_w    :
318    case Bytecodes::_ifeq      :
319    case Bytecodes::_ifne      :
320    case Bytecodes::_iflt      :
321    case Bytecodes::_ifge      :
322    case Bytecodes::_ifgt      :
323    case Bytecodes::_ifle      :
324    case Bytecodes::_if_icmpeq :
325    case Bytecodes::_if_icmpne :
326    case Bytecodes::_if_icmplt :
327    case Bytecodes::_if_icmpge :
328    case Bytecodes::_if_icmpgt :
329    case Bytecodes::_if_icmple :
330    case Bytecodes::_if_acmpeq :
331    case Bytecodes::_if_acmpne :
332    // special cases
333    case Bytecodes::_getfield  :
334    case Bytecodes::_putfield  :
335    case Bytecodes::_getstatic :
336    case Bytecodes::_putstatic :
337    case Bytecodes::_aastore   :
338      // reexecute the operation and TOS value is on stack
339      assert(is_top_frame, "must be top frame");
340      use_next_mdp = false;
341      return Interpreter::deopt_entry(vtos, 0);
342      break;
343
344#ifdef COMPILER1
345    case Bytecodes::_athrow    :
346      assert(is_top_frame, "must be top frame");
347      use_next_mdp = false;
348      return Interpreter::rethrow_exception_entry();
349      break;
350#endif /* COMPILER1 */
351
352    case Bytecodes::_invokevirtual  :
353    case Bytecodes::_invokespecial  :
354    case Bytecodes::_invokestatic   :
355    case Bytecodes::_invokeinterface: {
356      Thread *thread = Thread::current();
357      ResourceMark rm(thread);
358      methodHandle mh(thread, method);
359      type = Bytecode_invoke_at(mh, bci)->result_type(thread);
360      // since the cache entry might not be initialized:
361      // (NOT needed for the old calling convension)
362      if (!is_top_frame) {
363        int index = Bytes::get_native_u2(bcp+1);
364        method->constants()->cache()->entry_at(index)->set_parameter_size(callee_parameters);
365      }
366      break;
367    }
368
369    case Bytecodes::_ldc   :
370      type = constant_pool_type( method, *(bcp+1) );
371      break;
372
373    case Bytecodes::_ldc_w : // fall through
374    case Bytecodes::_ldc2_w:
375      type = constant_pool_type( method, Bytes::get_Java_u2(bcp+1) );
376      break;
377
378    default:
379      type = Bytecodes::result_type(code);
380      break;
381  }
382
383  // return entry point for computed continuation state & bytecode length
384  return
385    is_top_frame
386    ? Interpreter::deopt_entry (as_TosState(type), length)
387    : Interpreter::return_entry(as_TosState(type), length);
388}
389
390void AbstractInterpreterGenerator::bang_stack_shadow_pages(bool native_call) {
391  // Quick & dirty stack overflow checking: bang the stack & handle trap.
392  // Note that we do the banging after the frame is setup, since the exception
393  // handling code expects to find a valid interpreter frame on the stack.
394  // Doing the banging earlier fails if the caller frame is not an interpreter
395  // frame.
396  // (Also, the exception throwing code expects to unlock any synchronized
397  // method receiever, so do the banging after locking the receiver.)
398
399  // Bang each page in the shadow zone. We can't assume it's been done for
400  // an interpreter frame with greater than a page of locals, so each page
401  // needs to be checked.  Only true for non-native.
402  if (UseStackBanging) {
403    const int start_page = native_call ? StackShadowPages : 1;
404    const int page_size = os::vm_page_size();
405    for (int pages = start_page; pages <= StackShadowPages ; pages++) {
406      __ bang_stack_with_offset(pages*page_size);
407    }
408  }
409}
410