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