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