Print this page
| Split |
Close |
| Expand all |
| Collapse all |
--- old/src/share/vm/runtime/sharedRuntime.cpp
+++ new/src/share/vm/runtime/sharedRuntime.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/_sharedRuntime.cpp.incl"
27 27 #include <math.h>
28 28
29 29 HS_DTRACE_PROBE_DECL4(hotspot, object__alloc, Thread*, char*, int, size_t);
30 30 HS_DTRACE_PROBE_DECL7(hotspot, method__entry, int,
31 31 char*, int, char*, int, char*, int);
32 32 HS_DTRACE_PROBE_DECL7(hotspot, method__return, int,
33 33 char*, int, char*, int, char*, int);
34 34
35 35 // Implementation of SharedRuntime
36 36
37 37 #ifndef PRODUCT
38 38 // For statistics
39 39 int SharedRuntime::_ic_miss_ctr = 0;
40 40 int SharedRuntime::_wrong_method_ctr = 0;
41 41 int SharedRuntime::_resolve_static_ctr = 0;
42 42 int SharedRuntime::_resolve_virtual_ctr = 0;
43 43 int SharedRuntime::_resolve_opt_virtual_ctr = 0;
44 44 int SharedRuntime::_implicit_null_throws = 0;
45 45 int SharedRuntime::_implicit_div0_throws = 0;
46 46 int SharedRuntime::_throw_null_ctr = 0;
47 47
48 48 int SharedRuntime::_nof_normal_calls = 0;
49 49 int SharedRuntime::_nof_optimized_calls = 0;
50 50 int SharedRuntime::_nof_inlined_calls = 0;
51 51 int SharedRuntime::_nof_megamorphic_calls = 0;
52 52 int SharedRuntime::_nof_static_calls = 0;
53 53 int SharedRuntime::_nof_inlined_static_calls = 0;
54 54 int SharedRuntime::_nof_interface_calls = 0;
55 55 int SharedRuntime::_nof_optimized_interface_calls = 0;
56 56 int SharedRuntime::_nof_inlined_interface_calls = 0;
57 57 int SharedRuntime::_nof_megamorphic_interface_calls = 0;
58 58 int SharedRuntime::_nof_removable_exceptions = 0;
59 59
60 60 int SharedRuntime::_new_instance_ctr=0;
61 61 int SharedRuntime::_new_array_ctr=0;
62 62 int SharedRuntime::_multi1_ctr=0;
63 63 int SharedRuntime::_multi2_ctr=0;
64 64 int SharedRuntime::_multi3_ctr=0;
65 65 int SharedRuntime::_multi4_ctr=0;
66 66 int SharedRuntime::_multi5_ctr=0;
67 67 int SharedRuntime::_mon_enter_stub_ctr=0;
68 68 int SharedRuntime::_mon_exit_stub_ctr=0;
69 69 int SharedRuntime::_mon_enter_ctr=0;
70 70 int SharedRuntime::_mon_exit_ctr=0;
71 71 int SharedRuntime::_partial_subtype_ctr=0;
72 72 int SharedRuntime::_jbyte_array_copy_ctr=0;
73 73 int SharedRuntime::_jshort_array_copy_ctr=0;
74 74 int SharedRuntime::_jint_array_copy_ctr=0;
75 75 int SharedRuntime::_jlong_array_copy_ctr=0;
76 76 int SharedRuntime::_oop_array_copy_ctr=0;
77 77 int SharedRuntime::_checkcast_array_copy_ctr=0;
78 78 int SharedRuntime::_unsafe_array_copy_ctr=0;
79 79 int SharedRuntime::_generic_array_copy_ctr=0;
80 80 int SharedRuntime::_slow_array_copy_ctr=0;
81 81 int SharedRuntime::_find_handler_ctr=0;
82 82 int SharedRuntime::_rethrow_ctr=0;
83 83
84 84 int SharedRuntime::_ICmiss_index = 0;
85 85 int SharedRuntime::_ICmiss_count[SharedRuntime::maxICmiss_count];
86 86 address SharedRuntime::_ICmiss_at[SharedRuntime::maxICmiss_count];
87 87
88 88 void SharedRuntime::trace_ic_miss(address at) {
89 89 for (int i = 0; i < _ICmiss_index; i++) {
90 90 if (_ICmiss_at[i] == at) {
91 91 _ICmiss_count[i]++;
92 92 return;
93 93 }
94 94 }
95 95 int index = _ICmiss_index++;
96 96 if (_ICmiss_index >= maxICmiss_count) _ICmiss_index = maxICmiss_count - 1;
97 97 _ICmiss_at[index] = at;
98 98 _ICmiss_count[index] = 1;
99 99 }
100 100
101 101 void SharedRuntime::print_ic_miss_histogram() {
102 102 if (ICMissHistogram) {
103 103 tty->print_cr ("IC Miss Histogram:");
104 104 int tot_misses = 0;
105 105 for (int i = 0; i < _ICmiss_index; i++) {
106 106 tty->print_cr(" at: " INTPTR_FORMAT " nof: %d", _ICmiss_at[i], _ICmiss_count[i]);
107 107 tot_misses += _ICmiss_count[i];
108 108 }
109 109 tty->print_cr ("Total IC misses: %7d", tot_misses);
110 110 }
111 111 }
112 112 #endif // PRODUCT
113 113
114 114 #ifndef SERIALGC
115 115
116 116 // G1 write-barrier pre: executed before a pointer store.
117 117 JRT_LEAF(void, SharedRuntime::g1_wb_pre(oopDesc* orig, JavaThread *thread))
118 118 if (orig == NULL) {
119 119 assert(false, "should be optimized out");
120 120 return;
121 121 }
122 122 assert(orig->is_oop(true /* ignore mark word */), "Error");
123 123 // store the original value that was in the field reference
124 124 thread->satb_mark_queue().enqueue(orig);
125 125 JRT_END
126 126
127 127 // G1 write-barrier post: executed after a pointer store.
128 128 JRT_LEAF(void, SharedRuntime::g1_wb_post(void* card_addr, JavaThread* thread))
129 129 thread->dirty_card_queue().enqueue(card_addr);
130 130 JRT_END
131 131
132 132 #endif // !SERIALGC
133 133
134 134
135 135 JRT_LEAF(jlong, SharedRuntime::lmul(jlong y, jlong x))
136 136 return x * y;
137 137 JRT_END
138 138
139 139
140 140 JRT_LEAF(jlong, SharedRuntime::ldiv(jlong y, jlong x))
141 141 if (x == min_jlong && y == CONST64(-1)) {
142 142 return x;
143 143 } else {
144 144 return x / y;
145 145 }
146 146 JRT_END
147 147
148 148
149 149 JRT_LEAF(jlong, SharedRuntime::lrem(jlong y, jlong x))
150 150 if (x == min_jlong && y == CONST64(-1)) {
151 151 return 0;
152 152 } else {
153 153 return x % y;
154 154 }
155 155 JRT_END
156 156
157 157
158 158 const juint float_sign_mask = 0x7FFFFFFF;
159 159 const juint float_infinity = 0x7F800000;
160 160 const julong double_sign_mask = CONST64(0x7FFFFFFFFFFFFFFF);
161 161 const julong double_infinity = CONST64(0x7FF0000000000000);
162 162
163 163 JRT_LEAF(jfloat, SharedRuntime::frem(jfloat x, jfloat y))
164 164 #ifdef _WIN64
165 165 // 64-bit Windows on amd64 returns the wrong values for
166 166 // infinity operands.
167 167 union { jfloat f; juint i; } xbits, ybits;
168 168 xbits.f = x;
169 169 ybits.f = y;
170 170 // x Mod Infinity == x unless x is infinity
171 171 if ( ((xbits.i & float_sign_mask) != float_infinity) &&
172 172 ((ybits.i & float_sign_mask) == float_infinity) ) {
173 173 return x;
174 174 }
175 175 #endif
176 176 return ((jfloat)fmod((double)x,(double)y));
177 177 JRT_END
178 178
179 179
180 180 JRT_LEAF(jdouble, SharedRuntime::drem(jdouble x, jdouble y))
181 181 #ifdef _WIN64
182 182 union { jdouble d; julong l; } xbits, ybits;
183 183 xbits.d = x;
184 184 ybits.d = y;
185 185 // x Mod Infinity == x unless x is infinity
186 186 if ( ((xbits.l & double_sign_mask) != double_infinity) &&
187 187 ((ybits.l & double_sign_mask) == double_infinity) ) {
188 188 return x;
189 189 }
190 190 #endif
191 191 return ((jdouble)fmod((double)x,(double)y));
192 192 JRT_END
193 193
194 194
195 195 JRT_LEAF(jint, SharedRuntime::f2i(jfloat x))
196 196 if (g_isnan(x))
197 197 return 0;
198 198 if (x >= (jfloat) max_jint)
199 199 return max_jint;
200 200 if (x <= (jfloat) min_jint)
201 201 return min_jint;
202 202 return (jint) x;
203 203 JRT_END
204 204
205 205
206 206 JRT_LEAF(jlong, SharedRuntime::f2l(jfloat x))
207 207 if (g_isnan(x))
208 208 return 0;
209 209 if (x >= (jfloat) max_jlong)
210 210 return max_jlong;
211 211 if (x <= (jfloat) min_jlong)
212 212 return min_jlong;
213 213 return (jlong) x;
214 214 JRT_END
215 215
216 216
217 217 JRT_LEAF(jint, SharedRuntime::d2i(jdouble x))
218 218 if (g_isnan(x))
219 219 return 0;
220 220 if (x >= (jdouble) max_jint)
221 221 return max_jint;
222 222 if (x <= (jdouble) min_jint)
223 223 return min_jint;
224 224 return (jint) x;
225 225 JRT_END
226 226
227 227
228 228 JRT_LEAF(jlong, SharedRuntime::d2l(jdouble x))
229 229 if (g_isnan(x))
230 230 return 0;
231 231 if (x >= (jdouble) max_jlong)
232 232 return max_jlong;
233 233 if (x <= (jdouble) min_jlong)
234 234 return min_jlong;
235 235 return (jlong) x;
236 236 JRT_END
237 237
238 238
239 239 JRT_LEAF(jfloat, SharedRuntime::d2f(jdouble x))
240 240 return (jfloat)x;
241 241 JRT_END
242 242
243 243
244 244 JRT_LEAF(jfloat, SharedRuntime::l2f(jlong x))
245 245 return (jfloat)x;
246 246 JRT_END
247 247
248 248
249 249 JRT_LEAF(jdouble, SharedRuntime::l2d(jlong x))
250 250 return (jdouble)x;
251 251 JRT_END
252 252
253 253 // Exception handling accross interpreter/compiler boundaries
254 254 //
255 255 // exception_handler_for_return_address(...) returns the continuation address.
256 256 // The continuation address is the entry point of the exception handler of the
257 257 // previous frame depending on the return address.
258 258
259 259 address SharedRuntime::raw_exception_handler_for_return_address(address return_address) {
260 260 assert(frame::verify_return_pc(return_address), "must be a return pc");
261 261
262 262 // the fastest case first
263 263 CodeBlob* blob = CodeCache::find_blob(return_address);
264 264 if (blob != NULL && blob->is_nmethod()) {
265 265 nmethod* code = (nmethod*)blob;
266 266 assert(code != NULL, "nmethod must be present");
267 267 // native nmethods don't have exception handlers
268 268 assert(!code->is_native_method(), "no exception handler");
269 269 assert(code->header_begin() != code->exception_begin(), "no exception handler");
270 270 if (code->is_deopt_pc(return_address)) {
271 271 return SharedRuntime::deopt_blob()->unpack_with_exception();
272 272 } else {
273 273 return code->exception_begin();
274 274 }
275 275 }
276 276
277 277 // Entry code
278 278 if (StubRoutines::returns_to_call_stub(return_address)) {
279 279 return StubRoutines::catch_exception_entry();
280 280 }
281 281 // Interpreted code
282 282 if (Interpreter::contains(return_address)) {
283 283 return Interpreter::rethrow_exception_entry();
284 284 }
285 285
286 286 // Compiled code
287 287 if (CodeCache::contains(return_address)) {
288 288 CodeBlob* blob = CodeCache::find_blob(return_address);
289 289 if (blob->is_nmethod()) {
290 290 nmethod* code = (nmethod*)blob;
291 291 assert(code != NULL, "nmethod must be present");
292 292 assert(code->header_begin() != code->exception_begin(), "no exception handler");
293 293 return code->exception_begin();
294 294 }
295 295 if (blob->is_runtime_stub()) {
296 296 ShouldNotReachHere(); // callers are responsible for skipping runtime stub frames
297 297 }
298 298 }
299 299 guarantee(!VtableStubs::contains(return_address), "NULL exceptions in vtables should have been handled already!");
300 300 #ifndef PRODUCT
301 301 { ResourceMark rm;
302 302 tty->print_cr("No exception handler found for exception at " INTPTR_FORMAT " - potential problems:", return_address);
303 303 tty->print_cr("a) exception happened in (new?) code stubs/buffers that is not handled here");
304 304 tty->print_cr("b) other problem");
305 305 }
306 306 #endif // PRODUCT
307 307 ShouldNotReachHere();
308 308 return NULL;
309 309 }
310 310
311 311
312 312 JRT_LEAF(address, SharedRuntime::exception_handler_for_return_address(address return_address))
313 313 return raw_exception_handler_for_return_address(return_address);
314 314 JRT_END
315 315
316 316 address SharedRuntime::get_poll_stub(address pc) {
317 317 address stub;
318 318 // Look up the code blob
319 319 CodeBlob *cb = CodeCache::find_blob(pc);
320 320
321 321 // Should be an nmethod
322 322 assert( cb && cb->is_nmethod(), "safepoint polling: pc must refer to an nmethod" );
323 323
324 324 // Look up the relocation information
325 325 assert( ((nmethod*)cb)->is_at_poll_or_poll_return(pc),
326 326 "safepoint polling: type must be poll" );
327 327
328 328 assert( ((NativeInstruction*)pc)->is_safepoint_poll(),
329 329 "Only polling locations are used for safepoint");
330 330
331 331 bool at_poll_return = ((nmethod*)cb)->is_at_poll_return(pc);
332 332 if (at_poll_return) {
333 333 assert(SharedRuntime::polling_page_return_handler_blob() != NULL,
334 334 "polling page return stub not created yet");
335 335 stub = SharedRuntime::polling_page_return_handler_blob()->instructions_begin();
336 336 } else {
337 337 assert(SharedRuntime::polling_page_safepoint_handler_blob() != NULL,
338 338 "polling page safepoint stub not created yet");
339 339 stub = SharedRuntime::polling_page_safepoint_handler_blob()->instructions_begin();
340 340 }
341 341 #ifndef PRODUCT
342 342 if( TraceSafepoint ) {
343 343 char buf[256];
344 344 jio_snprintf(buf, sizeof(buf),
345 345 "... found polling page %s exception at pc = "
346 346 INTPTR_FORMAT ", stub =" INTPTR_FORMAT,
347 347 at_poll_return ? "return" : "loop",
348 348 (intptr_t)pc, (intptr_t)stub);
349 349 tty->print_raw_cr(buf);
350 350 }
351 351 #endif // PRODUCT
352 352 return stub;
353 353 }
354 354
355 355
356 356 oop SharedRuntime::retrieve_receiver( symbolHandle sig, frame caller ) {
357 357 assert(caller.is_interpreted_frame(), "");
358 358 int args_size = ArgumentSizeComputer(sig).size() + 1;
359 359 assert(args_size <= caller.interpreter_frame_expression_stack_size(), "receiver must be on interpreter stack");
360 360 oop result = (oop) *caller.interpreter_frame_tos_at(args_size - 1);
361 361 assert(Universe::heap()->is_in(result) && result->is_oop(), "receiver must be an oop");
362 362 return result;
363 363 }
364 364
365 365
366 366 void SharedRuntime::throw_and_post_jvmti_exception(JavaThread *thread, Handle h_exception) {
367 367 if (JvmtiExport::can_post_exceptions()) {
368 368 vframeStream vfst(thread, true);
369 369 methodHandle method = methodHandle(thread, vfst.method());
370 370 address bcp = method()->bcp_from(vfst.bci());
371 371 JvmtiExport::post_exception_throw(thread, method(), bcp, h_exception());
372 372 }
373 373 Exceptions::_throw(thread, __FILE__, __LINE__, h_exception);
374 374 }
375 375
376 376 void SharedRuntime::throw_and_post_jvmti_exception(JavaThread *thread, symbolOop name, const char *message) {
377 377 Handle h_exception = Exceptions::new_exception(thread, name, message);
378 378 throw_and_post_jvmti_exception(thread, h_exception);
379 379 }
380 380
381 381 // The interpreter code to call this tracing function is only
382 382 // called/generated when TraceRedefineClasses has the right bits
383 383 // set. Since obsolete methods are never compiled, we don't have
384 384 // to modify the compilers to generate calls to this function.
385 385 //
386 386 JRT_LEAF(int, SharedRuntime::rc_trace_method_entry(
387 387 JavaThread* thread, methodOopDesc* method))
388 388 assert(RC_TRACE_IN_RANGE(0x00001000, 0x00002000), "wrong call");
389 389
390 390 if (method->is_obsolete()) {
391 391 // We are calling an obsolete method, but this is not necessarily
392 392 // an error. Our method could have been redefined just after we
393 393 // fetched the methodOop from the constant pool.
394 394
395 395 // RC_TRACE macro has an embedded ResourceMark
396 396 RC_TRACE_WITH_THREAD(0x00001000, thread,
397 397 ("calling obsolete method '%s'",
398 398 method->name_and_sig_as_C_string()));
399 399 if (RC_TRACE_ENABLED(0x00002000)) {
400 400 // this option is provided to debug calls to obsolete methods
401 401 guarantee(false, "faulting at call to an obsolete method.");
402 402 }
403 403 }
404 404 return 0;
405 405 JRT_END
406 406
407 407 // ret_pc points into caller; we are returning caller's exception handler
408 408 // for given exception
409 409 address SharedRuntime::compute_compiled_exc_handler(nmethod* nm, address ret_pc, Handle& exception,
410 410 bool force_unwind, bool top_frame_only) {
411 411 assert(nm != NULL, "must exist");
412 412 ResourceMark rm;
413 413
414 414 ScopeDesc* sd = nm->scope_desc_at(ret_pc);
415 415 // determine handler bci, if any
416 416 EXCEPTION_MARK;
417 417
418 418 int handler_bci = -1;
419 419 int scope_depth = 0;
420 420 if (!force_unwind) {
421 421 int bci = sd->bci();
422 422 do {
423 423 bool skip_scope_increment = false;
424 424 // exception handler lookup
425 425 KlassHandle ek (THREAD, exception->klass());
426 426 handler_bci = sd->method()->fast_exception_handler_bci_for(ek, bci, THREAD);
427 427 if (HAS_PENDING_EXCEPTION) {
428 428 // We threw an exception while trying to find the exception handler.
429 429 // Transfer the new exception to the exception handle which will
430 430 // be set into thread local storage, and do another lookup for an
431 431 // exception handler for this exception, this time starting at the
432 432 // BCI of the exception handler which caused the exception to be
433 433 // thrown (bugs 4307310 and 4546590). Set "exception" reference
434 434 // argument to ensure that the correct exception is thrown (4870175).
435 435 exception = Handle(THREAD, PENDING_EXCEPTION);
436 436 CLEAR_PENDING_EXCEPTION;
437 437 if (handler_bci >= 0) {
438 438 bci = handler_bci;
439 439 handler_bci = -1;
440 440 skip_scope_increment = true;
441 441 }
442 442 }
443 443 if (!top_frame_only && handler_bci < 0 && !skip_scope_increment) {
444 444 sd = sd->sender();
445 445 if (sd != NULL) {
446 446 bci = sd->bci();
447 447 }
448 448 ++scope_depth;
449 449 }
450 450 } while (!top_frame_only && handler_bci < 0 && sd != NULL);
451 451 }
452 452
453 453 // found handling method => lookup exception handler
454 454 int catch_pco = ret_pc - nm->instructions_begin();
455 455
456 456 ExceptionHandlerTable table(nm);
457 457 HandlerTableEntry *t = table.entry_for(catch_pco, handler_bci, scope_depth);
458 458 if (t == NULL && (nm->is_compiled_by_c1() || handler_bci != -1)) {
459 459 // Allow abbreviated catch tables. The idea is to allow a method
460 460 // to materialize its exceptions without committing to the exact
461 461 // routing of exceptions. In particular this is needed for adding
462 462 // a synthethic handler to unlock monitors when inlining
463 463 // synchonized methods since the unlock path isn't represented in
464 464 // the bytecodes.
465 465 t = table.entry_for(catch_pco, -1, 0);
466 466 }
467 467
468 468 #ifdef COMPILER1
469 469 if (nm->is_compiled_by_c1() && t == NULL && handler_bci == -1) {
470 470 // Exception is not handled by this frame so unwind. Note that
471 471 // this is not the same as how C2 does this. C2 emits a table
472 472 // entry that dispatches to the unwind code in the nmethod.
473 473 return NULL;
474 474 }
475 475 #endif /* COMPILER1 */
476 476
477 477
478 478 if (t == NULL) {
479 479 tty->print_cr("MISSING EXCEPTION HANDLER for pc " INTPTR_FORMAT " and handler bci %d", ret_pc, handler_bci);
480 480 tty->print_cr(" Exception:");
481 481 exception->print();
482 482 tty->cr();
483 483 tty->print_cr(" Compiled exception table :");
484 484 table.print();
485 485 nm->print_code();
486 486 guarantee(false, "missing exception handler");
487 487 return NULL;
488 488 }
489 489
490 490 return nm->instructions_begin() + t->pco();
491 491 }
492 492
493 493 JRT_ENTRY(void, SharedRuntime::throw_AbstractMethodError(JavaThread* thread))
494 494 // These errors occur only at call sites
495 495 throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_AbstractMethodError());
496 496 JRT_END
497 497
498 498 JRT_ENTRY(void, SharedRuntime::throw_IncompatibleClassChangeError(JavaThread* thread))
499 499 // These errors occur only at call sites
500 500 throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_IncompatibleClassChangeError(), "vtable stub");
501 501 JRT_END
502 502
503 503 JRT_ENTRY(void, SharedRuntime::throw_ArithmeticException(JavaThread* thread))
504 504 throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_ArithmeticException(), "/ by zero");
505 505 JRT_END
506 506
507 507 JRT_ENTRY(void, SharedRuntime::throw_NullPointerException(JavaThread* thread))
508 508 throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_NullPointerException());
509 509 JRT_END
510 510
511 511 JRT_ENTRY(void, SharedRuntime::throw_NullPointerException_at_call(JavaThread* thread))
512 512 // This entry point is effectively only used for NullPointerExceptions which occur at inline
513 513 // cache sites (when the callee activation is not yet set up) so we are at a call site
514 514 throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_NullPointerException());
515 515 JRT_END
516 516
517 517 JRT_ENTRY(void, SharedRuntime::throw_StackOverflowError(JavaThread* thread))
518 518 // We avoid using the normal exception construction in this case because
519 519 // it performs an upcall to Java, and we're already out of stack space.
520 520 klassOop k = SystemDictionary::StackOverflowError_klass();
521 521 oop exception_oop = instanceKlass::cast(k)->allocate_instance(CHECK);
522 522 Handle exception (thread, exception_oop);
523 523 if (StackTraceInThrowable) {
524 524 java_lang_Throwable::fill_in_stack_trace(exception);
525 525 }
526 526 throw_and_post_jvmti_exception(thread, exception);
527 527 JRT_END
528 528
529 529 address SharedRuntime::continuation_for_implicit_exception(JavaThread* thread,
530 530 address pc,
531 531 SharedRuntime::ImplicitExceptionKind exception_kind)
532 532 {
533 533 address target_pc = NULL;
534 534
535 535 if (Interpreter::contains(pc)) {
536 536 #ifdef CC_INTERP
537 537 // C++ interpreter doesn't throw implicit exceptions
538 538 ShouldNotReachHere();
539 539 #else
540 540 switch (exception_kind) {
541 541 case IMPLICIT_NULL: return Interpreter::throw_NullPointerException_entry();
542 542 case IMPLICIT_DIVIDE_BY_ZERO: return Interpreter::throw_ArithmeticException_entry();
543 543 case STACK_OVERFLOW: return Interpreter::throw_StackOverflowError_entry();
544 544 default: ShouldNotReachHere();
545 545 }
546 546 #endif // !CC_INTERP
547 547 } else {
548 548 switch (exception_kind) {
549 549 case STACK_OVERFLOW: {
550 550 // Stack overflow only occurs upon frame setup; the callee is
551 551 // going to be unwound. Dispatch to a shared runtime stub
552 552 // which will cause the StackOverflowError to be fabricated
553 553 // and processed.
554 554 // For stack overflow in deoptimization blob, cleanup thread.
555 555 if (thread->deopt_mark() != NULL) {
556 556 Deoptimization::cleanup_deopt_info(thread, NULL);
557 557 }
558 558 return StubRoutines::throw_StackOverflowError_entry();
559 559 }
560 560
561 561 case IMPLICIT_NULL: {
562 562 if (VtableStubs::contains(pc)) {
563 563 // We haven't yet entered the callee frame. Fabricate an
564 564 // exception and begin dispatching it in the caller. Since
565 565 // the caller was at a call site, it's safe to destroy all
566 566 // caller-saved registers, as these entry points do.
567 567 VtableStub* vt_stub = VtableStubs::stub_containing(pc);
568 568
569 569 // If vt_stub is NULL, then return NULL to signal handler to report the SEGV error.
570 570 if (vt_stub == NULL) return NULL;
571 571
572 572 if (vt_stub->is_abstract_method_error(pc)) {
573 573 assert(!vt_stub->is_vtable_stub(), "should never see AbstractMethodErrors from vtable-type VtableStubs");
574 574 return StubRoutines::throw_AbstractMethodError_entry();
575 575 } else {
576 576 return StubRoutines::throw_NullPointerException_at_call_entry();
577 577 }
578 578 } else {
579 579 CodeBlob* cb = CodeCache::find_blob(pc);
580 580
581 581 // If code blob is NULL, then return NULL to signal handler to report the SEGV error.
582 582 if (cb == NULL) return NULL;
583 583
584 584 // Exception happened in CodeCache. Must be either:
585 585 // 1. Inline-cache check in C2I handler blob,
586 586 // 2. Inline-cache check in nmethod, or
587 587 // 3. Implict null exception in nmethod
588 588
589 589 if (!cb->is_nmethod()) {
590 590 guarantee(cb->is_adapter_blob(),
591 591 "exception happened outside interpreter, nmethods and vtable stubs (1)");
592 592 // There is no handler here, so we will simply unwind.
593 593 return StubRoutines::throw_NullPointerException_at_call_entry();
594 594 }
595 595
596 596 // Otherwise, it's an nmethod. Consult its exception handlers.
597 597 nmethod* nm = (nmethod*)cb;
598 598 if (nm->inlinecache_check_contains(pc)) {
599 599 // exception happened inside inline-cache check code
600 600 // => the nmethod is not yet active (i.e., the frame
601 601 // is not set up yet) => use return address pushed by
602 602 // caller => don't push another return address
603 603 return StubRoutines::throw_NullPointerException_at_call_entry();
604 604 }
605 605
606 606 #ifndef PRODUCT
607 607 _implicit_null_throws++;
608 608 #endif
609 609 target_pc = nm->continuation_for_implicit_exception(pc);
610 610 guarantee(target_pc != 0, "must have a continuation point");
611 611 }
612 612
613 613 break; // fall through
614 614 }
615 615
616 616
617 617 case IMPLICIT_DIVIDE_BY_ZERO: {
618 618 nmethod* nm = CodeCache::find_nmethod(pc);
619 619 guarantee(nm != NULL, "must have containing nmethod for implicit division-by-zero exceptions");
620 620 #ifndef PRODUCT
621 621 _implicit_div0_throws++;
622 622 #endif
623 623 target_pc = nm->continuation_for_implicit_exception(pc);
624 624 guarantee(target_pc != 0, "must have a continuation point");
625 625 break; // fall through
626 626 }
627 627
628 628 default: ShouldNotReachHere();
629 629 }
630 630
631 631 guarantee(target_pc != NULL, "must have computed destination PC for implicit exception");
632 632 assert(exception_kind == IMPLICIT_NULL || exception_kind == IMPLICIT_DIVIDE_BY_ZERO, "wrong implicit exception kind");
633 633
634 634 // for AbortVMOnException flag
635 635 NOT_PRODUCT(Exceptions::debug_check_abort("java.lang.NullPointerException"));
636 636 if (exception_kind == IMPLICIT_NULL) {
637 637 Events::log("Implicit null exception at " INTPTR_FORMAT " to " INTPTR_FORMAT, pc, target_pc);
638 638 } else {
639 639 Events::log("Implicit division by zero exception at " INTPTR_FORMAT " to " INTPTR_FORMAT, pc, target_pc);
640 640 }
641 641 return target_pc;
642 642 }
643 643
644 644 ShouldNotReachHere();
645 645 return NULL;
646 646 }
647 647
648 648
649 649 JNI_ENTRY(void, throw_unsatisfied_link_error(JNIEnv* env, ...))
650 650 {
651 651 THROW(vmSymbols::java_lang_UnsatisfiedLinkError());
652 652 }
653 653 JNI_END
654 654
655 655
656 656 address SharedRuntime::native_method_throw_unsatisfied_link_error_entry() {
657 657 return CAST_FROM_FN_PTR(address, &throw_unsatisfied_link_error);
658 658 }
659 659
660 660
661 661 #ifndef PRODUCT
662 662 JRT_ENTRY(intptr_t, SharedRuntime::trace_bytecode(JavaThread* thread, intptr_t preserve_this_value, intptr_t tos, intptr_t tos2))
663 663 const frame f = thread->last_frame();
664 664 assert(f.is_interpreted_frame(), "must be an interpreted frame");
665 665 #ifndef PRODUCT
666 666 methodHandle mh(THREAD, f.interpreter_frame_method());
667 667 BytecodeTracer::trace(mh, f.interpreter_frame_bcp(), tos, tos2);
668 668 #endif // !PRODUCT
669 669 return preserve_this_value;
670 670 JRT_END
671 671 #endif // !PRODUCT
672 672
673 673
674 674 JRT_ENTRY(void, SharedRuntime::yield_all(JavaThread* thread, int attempts))
675 675 os::yield_all(attempts);
676 676 JRT_END
677 677
678 678
679 679 JRT_ENTRY_NO_ASYNC(void, SharedRuntime::register_finalizer(JavaThread* thread, oopDesc* obj))
680 680 assert(obj->is_oop(), "must be a valid oop");
681 681 assert(obj->klass()->klass_part()->has_finalizer(), "shouldn't be here otherwise");
682 682 instanceKlass::register_finalizer(instanceOop(obj), CHECK);
683 683 JRT_END
684 684
685 685
686 686 jlong SharedRuntime::get_java_tid(Thread* thread) {
687 687 if (thread != NULL) {
688 688 if (thread->is_Java_thread()) {
689 689 oop obj = ((JavaThread*)thread)->threadObj();
690 690 return (obj == NULL) ? 0 : java_lang_Thread::thread_id(obj);
691 691 }
692 692 }
693 693 return 0;
694 694 }
695 695
696 696 /**
697 697 * This function ought to be a void function, but cannot be because
698 698 * it gets turned into a tail-call on sparc, which runs into dtrace bug
699 699 * 6254741. Once that is fixed we can remove the dummy return value.
700 700 */
701 701 int SharedRuntime::dtrace_object_alloc(oopDesc* o) {
702 702 return dtrace_object_alloc_base(Thread::current(), o);
703 703 }
704 704
705 705 int SharedRuntime::dtrace_object_alloc_base(Thread* thread, oopDesc* o) {
706 706 assert(DTraceAllocProbes, "wrong call");
707 707 Klass* klass = o->blueprint();
708 708 int size = o->size();
709 709 symbolOop name = klass->name();
710 710 HS_DTRACE_PROBE4(hotspot, object__alloc, get_java_tid(thread),
711 711 name->bytes(), name->utf8_length(), size * HeapWordSize);
712 712 return 0;
713 713 }
714 714
715 715 JRT_LEAF(int, SharedRuntime::dtrace_method_entry(
716 716 JavaThread* thread, methodOopDesc* method))
717 717 assert(DTraceMethodProbes, "wrong call");
718 718 symbolOop kname = method->klass_name();
719 719 symbolOop name = method->name();
720 720 symbolOop sig = method->signature();
721 721 HS_DTRACE_PROBE7(hotspot, method__entry, get_java_tid(thread),
722 722 kname->bytes(), kname->utf8_length(),
723 723 name->bytes(), name->utf8_length(),
724 724 sig->bytes(), sig->utf8_length());
725 725 return 0;
726 726 JRT_END
727 727
728 728 JRT_LEAF(int, SharedRuntime::dtrace_method_exit(
729 729 JavaThread* thread, methodOopDesc* method))
730 730 assert(DTraceMethodProbes, "wrong call");
731 731 symbolOop kname = method->klass_name();
732 732 symbolOop name = method->name();
733 733 symbolOop sig = method->signature();
734 734 HS_DTRACE_PROBE7(hotspot, method__return, get_java_tid(thread),
735 735 kname->bytes(), kname->utf8_length(),
736 736 name->bytes(), name->utf8_length(),
737 737 sig->bytes(), sig->utf8_length());
738 738 return 0;
739 739 JRT_END
740 740
741 741
742 742 // Finds receiver, CallInfo (i.e. receiver method), and calling bytecode)
743 743 // for a call current in progress, i.e., arguments has been pushed on stack
744 744 // put callee has not been invoked yet. Used by: resolve virtual/static,
745 745 // vtable updates, etc. Caller frame must be compiled.
746 746 Handle SharedRuntime::find_callee_info(JavaThread* thread, Bytecodes::Code& bc, CallInfo& callinfo, TRAPS) {
747 747 ResourceMark rm(THREAD);
748 748
749 749 // last java frame on stack (which includes native call frames)
750 750 vframeStream vfst(thread, true); // Do not skip and javaCalls
751 751
752 752 return find_callee_info_helper(thread, vfst, bc, callinfo, CHECK_(Handle()));
753 753 }
754 754
755 755
756 756 // Finds receiver, CallInfo (i.e. receiver method), and calling bytecode
757 757 // for a call current in progress, i.e., arguments has been pushed on stack
758 758 // but callee has not been invoked yet. Caller frame must be compiled.
759 759 Handle SharedRuntime::find_callee_info_helper(JavaThread* thread,
760 760 vframeStream& vfst,
761 761 Bytecodes::Code& bc,
762 762 CallInfo& callinfo, TRAPS) {
763 763 Handle receiver;
764 764 Handle nullHandle; //create a handy null handle for exception returns
765 765
766 766 assert(!vfst.at_end(), "Java frame must exist");
767 767
768 768 // Find caller and bci from vframe
769 769 methodHandle caller (THREAD, vfst.method());
770 770 int bci = vfst.bci();
771 771
772 772 // Find bytecode
773 773 Bytecode_invoke* bytecode = Bytecode_invoke_at(caller, bci);
774 774 bc = bytecode->adjusted_invoke_code();
775 775 int bytecode_index = bytecode->index();
776 776
777 777 // Find receiver for non-static call
778 778 if (bc != Bytecodes::_invokestatic) {
779 779 // This register map must be update since we need to find the receiver for
780 780 // compiled frames. The receiver might be in a register.
781 781 RegisterMap reg_map2(thread);
782 782 frame stubFrame = thread->last_frame();
783 783 // Caller-frame is a compiled frame
784 784 frame callerFrame = stubFrame.sender(®_map2);
785 785
786 786 methodHandle callee = bytecode->static_target(CHECK_(nullHandle));
787 787 if (callee.is_null()) {
788 788 THROW_(vmSymbols::java_lang_NoSuchMethodException(), nullHandle);
789 789 }
790 790 // Retrieve from a compiled argument list
791 791 receiver = Handle(THREAD, callerFrame.retrieve_receiver(®_map2));
792 792
793 793 if (receiver.is_null()) {
794 794 THROW_(vmSymbols::java_lang_NullPointerException(), nullHandle);
|
↓ open down ↓ |
794 lines elided |
↑ open up ↑ |
795 795 }
796 796 }
797 797
798 798 // Resolve method. This is parameterized by bytecode.
799 799 constantPoolHandle constants (THREAD, caller->constants());
800 800 assert (receiver.is_null() || receiver->is_oop(), "wrong receiver");
801 801 LinkResolver::resolve_invoke(callinfo, receiver, constants, bytecode_index, bc, CHECK_(nullHandle));
802 802
803 803 #ifdef ASSERT
804 804 // Check that the receiver klass is of the right subtype and that it is initialized for virtual calls
805 - if (bc != Bytecodes::_invokestatic) {
805 + if (bc != Bytecodes::_invokestatic && bc != Bytecodes::_invokedynamic) {
806 806 assert(receiver.not_null(), "should have thrown exception");
807 807 KlassHandle receiver_klass (THREAD, receiver->klass());
808 808 klassOop rk = constants->klass_ref_at(bytecode_index, CHECK_(nullHandle));
809 809 // klass is already loaded
810 810 KlassHandle static_receiver_klass (THREAD, rk);
811 811 assert(receiver_klass->is_subtype_of(static_receiver_klass()), "actual receiver must be subclass of static receiver klass");
812 812 if (receiver_klass->oop_is_instance()) {
813 813 if (instanceKlass::cast(receiver_klass())->is_not_initialized()) {
814 814 tty->print_cr("ERROR: Klass not yet initialized!!");
815 815 receiver_klass.print();
816 816 }
817 817 assert (!instanceKlass::cast(receiver_klass())->is_not_initialized(), "receiver_klass must be initialized");
818 818 }
819 819 }
820 820 #endif
821 821
822 822 return receiver;
823 823 }
824 824
825 825 methodHandle SharedRuntime::find_callee_method(JavaThread* thread, TRAPS) {
826 826 ResourceMark rm(THREAD);
827 827 // We need first to check if any Java activations (compiled, interpreted)
828 828 // exist on the stack since last JavaCall. If not, we need
829 829 // to get the target method from the JavaCall wrapper.
830 830 vframeStream vfst(thread, true); // Do not skip any javaCalls
831 831 methodHandle callee_method;
832 832 if (vfst.at_end()) {
833 833 // No Java frames were found on stack since we did the JavaCall.
834 834 // Hence the stack can only contain an entry_frame. We need to
835 835 // find the target method from the stub frame.
836 836 RegisterMap reg_map(thread, false);
837 837 frame fr = thread->last_frame();
838 838 assert(fr.is_runtime_frame(), "must be a runtimeStub");
839 839 fr = fr.sender(®_map);
840 840 assert(fr.is_entry_frame(), "must be");
841 841 // fr is now pointing to the entry frame.
842 842 callee_method = methodHandle(THREAD, fr.entry_frame_call_wrapper()->callee_method());
843 843 assert(fr.entry_frame_call_wrapper()->receiver() == NULL || !callee_method->is_static(), "non-null receiver for static call??");
844 844 } else {
845 845 Bytecodes::Code bc;
846 846 CallInfo callinfo;
847 847 find_callee_info_helper(thread, vfst, bc, callinfo, CHECK_(methodHandle()));
848 848 callee_method = callinfo.selected_method();
849 849 }
850 850 assert(callee_method()->is_method(), "must be");
851 851 return callee_method;
852 852 }
853 853
854 854 // Resolves a call.
855 855 methodHandle SharedRuntime::resolve_helper(JavaThread *thread,
856 856 bool is_virtual,
857 857 bool is_optimized, TRAPS) {
858 858 methodHandle callee_method;
859 859 callee_method = resolve_sub_helper(thread, is_virtual, is_optimized, THREAD);
860 860 if (JvmtiExport::can_hotswap_or_post_breakpoint()) {
861 861 int retry_count = 0;
862 862 while (!HAS_PENDING_EXCEPTION && callee_method->is_old() &&
863 863 callee_method->method_holder() != SystemDictionary::object_klass()) {
864 864 // If has a pending exception then there is no need to re-try to
865 865 // resolve this method.
866 866 // If the method has been redefined, we need to try again.
867 867 // Hack: we have no way to update the vtables of arrays, so don't
868 868 // require that java.lang.Object has been updated.
869 869
870 870 // It is very unlikely that method is redefined more than 100 times
871 871 // in the middle of resolve. If it is looping here more than 100 times
872 872 // means then there could be a bug here.
873 873 guarantee((retry_count++ < 100),
874 874 "Could not resolve to latest version of redefined method");
875 875 // method is redefined in the middle of resolve so re-try.
876 876 callee_method = resolve_sub_helper(thread, is_virtual, is_optimized, THREAD);
877 877 }
878 878 }
879 879 return callee_method;
880 880 }
881 881
882 882 // Resolves a call. The compilers generate code for calls that go here
883 883 // and are patched with the real destination of the call.
884 884 methodHandle SharedRuntime::resolve_sub_helper(JavaThread *thread,
885 885 bool is_virtual,
886 886 bool is_optimized, TRAPS) {
887 887
888 888 ResourceMark rm(thread);
889 889 RegisterMap cbl_map(thread, false);
890 890 frame caller_frame = thread->last_frame().sender(&cbl_map);
891 891
892 892 CodeBlob* cb = caller_frame.cb();
893 893 guarantee(cb != NULL && cb->is_nmethod(), "must be called from nmethod");
894 894 // make sure caller is not getting deoptimized
895 895 // and removed before we are done with it.
896 896 // CLEANUP - with lazy deopt shouldn't need this lock
897 897 nmethodLocker caller_lock((nmethod*)cb);
898 898
899 899
900 900 // determine call info & receiver
901 901 // note: a) receiver is NULL for static calls
902 902 // b) an exception is thrown if receiver is NULL for non-static calls
903 903 CallInfo call_info;
904 904 Bytecodes::Code invoke_code = Bytecodes::_illegal;
905 905 Handle receiver = find_callee_info(thread, invoke_code,
906 906 call_info, CHECK_(methodHandle()));
907 907 methodHandle callee_method = call_info.selected_method();
908 908
909 909 assert((!is_virtual && invoke_code == Bytecodes::_invokestatic) ||
910 910 ( is_virtual && invoke_code != Bytecodes::_invokestatic), "inconsistent bytecode");
911 911
912 912 #ifndef PRODUCT
913 913 // tracing/debugging/statistics
914 914 int *addr = (is_optimized) ? (&_resolve_opt_virtual_ctr) :
915 915 (is_virtual) ? (&_resolve_virtual_ctr) :
916 916 (&_resolve_static_ctr);
917 917 Atomic::inc(addr);
918 918
919 919 if (TraceCallFixup) {
920 920 ResourceMark rm(thread);
921 921 tty->print("resolving %s%s (%s) call to",
922 922 (is_optimized) ? "optimized " : "", (is_virtual) ? "virtual" : "static",
923 923 Bytecodes::name(invoke_code));
924 924 callee_method->print_short_name(tty);
925 925 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code());
926 926 }
927 927 #endif
928 928
929 929 // Compute entry points. This might require generation of C2I converter
930 930 // frames, so we cannot be holding any locks here. Furthermore, the
931 931 // computation of the entry points is independent of patching the call. We
932 932 // always return the entry-point, but we only patch the stub if the call has
933 933 // not been deoptimized. Return values: For a virtual call this is an
934 934 // (cached_oop, destination address) pair. For a static call/optimized
935 935 // virtual this is just a destination address.
936 936
937 937 StaticCallInfo static_call_info;
938 938 CompiledICInfo virtual_call_info;
939 939
940 940
941 941 // Make sure the callee nmethod does not get deoptimized and removed before
942 942 // we are done patching the code.
943 943 nmethod* nm = callee_method->code();
944 944 nmethodLocker nl_callee(nm);
945 945 #ifdef ASSERT
946 946 address dest_entry_point = nm == NULL ? 0 : nm->entry_point(); // used below
947 947 #endif
948 948
949 949 if (is_virtual) {
950 950 assert(receiver.not_null(), "sanity check");
951 951 bool static_bound = call_info.resolved_method()->can_be_statically_bound();
952 952 KlassHandle h_klass(THREAD, receiver->klass());
953 953 CompiledIC::compute_monomorphic_entry(callee_method, h_klass,
954 954 is_optimized, static_bound, virtual_call_info,
955 955 CHECK_(methodHandle()));
956 956 } else {
957 957 // static call
958 958 CompiledStaticCall::compute_entry(callee_method, static_call_info);
959 959 }
960 960
961 961 // grab lock, check for deoptimization and potentially patch caller
962 962 {
963 963 MutexLocker ml_patch(CompiledIC_lock);
964 964
965 965 // Now that we are ready to patch if the methodOop was redefined then
966 966 // don't update call site and let the caller retry.
967 967
968 968 if (!callee_method->is_old()) {
969 969 #ifdef ASSERT
970 970 // We must not try to patch to jump to an already unloaded method.
971 971 if (dest_entry_point != 0) {
972 972 assert(CodeCache::find_blob(dest_entry_point) != NULL,
973 973 "should not unload nmethod while locked");
974 974 }
975 975 #endif
976 976 if (is_virtual) {
977 977 CompiledIC* inline_cache = CompiledIC_before(caller_frame.pc());
978 978 if (inline_cache->is_clean()) {
979 979 inline_cache->set_to_monomorphic(virtual_call_info);
980 980 }
981 981 } else {
982 982 CompiledStaticCall* ssc = compiledStaticCall_before(caller_frame.pc());
983 983 if (ssc->is_clean()) ssc->set(static_call_info);
984 984 }
985 985 }
986 986
987 987 } // unlock CompiledIC_lock
988 988
989 989 return callee_method;
990 990 }
991 991
992 992
993 993 // Inline caches exist only in compiled code
994 994 JRT_BLOCK_ENTRY(address, SharedRuntime::handle_wrong_method_ic_miss(JavaThread* thread))
995 995 #ifdef ASSERT
996 996 RegisterMap reg_map(thread, false);
997 997 frame stub_frame = thread->last_frame();
998 998 assert(stub_frame.is_runtime_frame(), "sanity check");
999 999 frame caller_frame = stub_frame.sender(®_map);
1000 1000 assert(!caller_frame.is_interpreted_frame() && !caller_frame.is_entry_frame(), "unexpected frame");
1001 1001 #endif /* ASSERT */
1002 1002
1003 1003 methodHandle callee_method;
1004 1004 JRT_BLOCK
1005 1005 callee_method = SharedRuntime::handle_ic_miss_helper(thread, CHECK_NULL);
1006 1006 // Return methodOop through TLS
1007 1007 thread->set_vm_result(callee_method());
1008 1008 JRT_BLOCK_END
1009 1009 // return compiled code entry point after potential safepoints
1010 1010 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1011 1011 return callee_method->verified_code_entry();
1012 1012 JRT_END
1013 1013
1014 1014
1015 1015 // Handle call site that has been made non-entrant
1016 1016 JRT_BLOCK_ENTRY(address, SharedRuntime::handle_wrong_method(JavaThread* thread))
1017 1017 // 6243940 We might end up in here if the callee is deoptimized
1018 1018 // as we race to call it. We don't want to take a safepoint if
1019 1019 // the caller was interpreted because the caller frame will look
|
↓ open down ↓ |
204 lines elided |
↑ open up ↑ |
1020 1020 // interpreted to the stack walkers and arguments are now
1021 1021 // "compiled" so it is much better to make this transition
1022 1022 // invisible to the stack walking code. The i2c path will
1023 1023 // place the callee method in the callee_target. It is stashed
1024 1024 // there because if we try and find the callee by normal means a
1025 1025 // safepoint is possible and have trouble gc'ing the compiled args.
1026 1026 RegisterMap reg_map(thread, false);
1027 1027 frame stub_frame = thread->last_frame();
1028 1028 assert(stub_frame.is_runtime_frame(), "sanity check");
1029 1029 frame caller_frame = stub_frame.sender(®_map);
1030 - if (caller_frame.is_interpreted_frame() || caller_frame.is_entry_frame() ) {
1030 +
1031 + // MethodHandle invokes don't have a CompiledIC and should always
1032 + // simply redispatch to the callee_target.
1033 + address sender_pc = caller_frame.pc();
1034 + CodeBlob* sender_cb = caller_frame.cb();
1035 + nmethod* sender_nm = sender_cb->as_nmethod_or_null();
1036 +
1037 + if (caller_frame.is_interpreted_frame() ||
1038 + caller_frame.is_entry_frame() ||
1039 + (sender_nm != NULL && sender_nm->is_method_handle_return(sender_pc))) {
1031 1040 methodOop callee = thread->callee_target();
1032 1041 guarantee(callee != NULL && callee->is_method(), "bad handshake");
1033 1042 thread->set_vm_result(callee);
1034 1043 thread->set_callee_target(NULL);
1035 - return callee->get_c2i_entry();
1044 + return callee->from_compiled_entry();
1036 1045 }
1037 1046
1038 1047 // Must be compiled to compiled path which is safe to stackwalk
1039 1048 methodHandle callee_method;
1040 1049 JRT_BLOCK
1041 1050 // Force resolving of caller (if we called from compiled frame)
1042 1051 callee_method = SharedRuntime::reresolve_call_site(thread, CHECK_NULL);
1043 1052 thread->set_vm_result(callee_method());
1044 1053 JRT_BLOCK_END
1045 1054 // return compiled code entry point after potential safepoints
1046 1055 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1047 1056 return callee_method->verified_code_entry();
1048 1057 JRT_END
1049 1058
1050 1059
1051 1060 // resolve a static call and patch code
1052 1061 JRT_BLOCK_ENTRY(address, SharedRuntime::resolve_static_call_C(JavaThread *thread ))
1053 1062 methodHandle callee_method;
1054 1063 JRT_BLOCK
1055 1064 callee_method = SharedRuntime::resolve_helper(thread, false, false, CHECK_NULL);
1056 1065 thread->set_vm_result(callee_method());
1057 1066 JRT_BLOCK_END
1058 1067 // return compiled code entry point after potential safepoints
1059 1068 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1060 1069 return callee_method->verified_code_entry();
1061 1070 JRT_END
1062 1071
1063 1072
1064 1073 // resolve virtual call and update inline cache to monomorphic
1065 1074 JRT_BLOCK_ENTRY(address, SharedRuntime::resolve_virtual_call_C(JavaThread *thread ))
1066 1075 methodHandle callee_method;
1067 1076 JRT_BLOCK
1068 1077 callee_method = SharedRuntime::resolve_helper(thread, true, false, CHECK_NULL);
1069 1078 thread->set_vm_result(callee_method());
1070 1079 JRT_BLOCK_END
1071 1080 // return compiled code entry point after potential safepoints
1072 1081 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1073 1082 return callee_method->verified_code_entry();
1074 1083 JRT_END
1075 1084
1076 1085
1077 1086 // Resolve a virtual call that can be statically bound (e.g., always
1078 1087 // monomorphic, so it has no inline cache). Patch code to resolved target.
1079 1088 JRT_BLOCK_ENTRY(address, SharedRuntime::resolve_opt_virtual_call_C(JavaThread *thread))
1080 1089 methodHandle callee_method;
1081 1090 JRT_BLOCK
1082 1091 callee_method = SharedRuntime::resolve_helper(thread, true, true, CHECK_NULL);
1083 1092 thread->set_vm_result(callee_method());
1084 1093 JRT_BLOCK_END
1085 1094 // return compiled code entry point after potential safepoints
1086 1095 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1087 1096 return callee_method->verified_code_entry();
1088 1097 JRT_END
1089 1098
1090 1099
1091 1100
1092 1101
1093 1102
1094 1103 methodHandle SharedRuntime::handle_ic_miss_helper(JavaThread *thread, TRAPS) {
1095 1104 ResourceMark rm(thread);
1096 1105 CallInfo call_info;
1097 1106 Bytecodes::Code bc;
1098 1107
1099 1108 // receiver is NULL for static calls. An exception is thrown for NULL
1100 1109 // receivers for non-static calls
1101 1110 Handle receiver = find_callee_info(thread, bc, call_info,
1102 1111 CHECK_(methodHandle()));
1103 1112 // Compiler1 can produce virtual call sites that can actually be statically bound
1104 1113 // If we fell thru to below we would think that the site was going megamorphic
1105 1114 // when in fact the site can never miss. Worse because we'd think it was megamorphic
1106 1115 // we'd try and do a vtable dispatch however methods that can be statically bound
1107 1116 // don't have vtable entries (vtable_index < 0) and we'd blow up. So we force a
1108 1117 // reresolution of the call site (as if we did a handle_wrong_method and not an
1109 1118 // plain ic_miss) and the site will be converted to an optimized virtual call site
1110 1119 // never to miss again. I don't believe C2 will produce code like this but if it
1111 1120 // did this would still be the correct thing to do for it too, hence no ifdef.
1112 1121 //
1113 1122 if (call_info.resolved_method()->can_be_statically_bound()) {
1114 1123 methodHandle callee_method = SharedRuntime::reresolve_call_site(thread, CHECK_(methodHandle()));
1115 1124 if (TraceCallFixup) {
1116 1125 RegisterMap reg_map(thread, false);
1117 1126 frame caller_frame = thread->last_frame().sender(®_map);
1118 1127 ResourceMark rm(thread);
1119 1128 tty->print("converting IC miss to reresolve (%s) call to", Bytecodes::name(bc));
1120 1129 callee_method->print_short_name(tty);
1121 1130 tty->print_cr(" from pc: " INTPTR_FORMAT, caller_frame.pc());
1122 1131 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code());
1123 1132 }
1124 1133 return callee_method;
1125 1134 }
1126 1135
1127 1136 methodHandle callee_method = call_info.selected_method();
1128 1137
1129 1138 bool should_be_mono = false;
1130 1139
1131 1140 #ifndef PRODUCT
1132 1141 Atomic::inc(&_ic_miss_ctr);
1133 1142
1134 1143 // Statistics & Tracing
1135 1144 if (TraceCallFixup) {
1136 1145 ResourceMark rm(thread);
1137 1146 tty->print("IC miss (%s) call to", Bytecodes::name(bc));
1138 1147 callee_method->print_short_name(tty);
1139 1148 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code());
1140 1149 }
1141 1150
1142 1151 if (ICMissHistogram) {
1143 1152 MutexLocker m(VMStatistic_lock);
1144 1153 RegisterMap reg_map(thread, false);
1145 1154 frame f = thread->last_frame().real_sender(®_map);// skip runtime stub
1146 1155 // produce statistics under the lock
1147 1156 trace_ic_miss(f.pc());
1148 1157 }
1149 1158 #endif
1150 1159
1151 1160 // install an event collector so that when a vtable stub is created the
1152 1161 // profiler can be notified via a DYNAMIC_CODE_GENERATED event. The
1153 1162 // event can't be posted when the stub is created as locks are held
1154 1163 // - instead the event will be deferred until the event collector goes
1155 1164 // out of scope.
1156 1165 JvmtiDynamicCodeEventCollector event_collector;
1157 1166
1158 1167 // Update inline cache to megamorphic. Skip update if caller has been
1159 1168 // made non-entrant or we are called from interpreted.
1160 1169 { MutexLocker ml_patch (CompiledIC_lock);
1161 1170 RegisterMap reg_map(thread, false);
1162 1171 frame caller_frame = thread->last_frame().sender(®_map);
1163 1172 CodeBlob* cb = caller_frame.cb();
1164 1173 if (cb->is_nmethod() && ((nmethod*)cb)->is_in_use()) {
1165 1174 // Not a non-entrant nmethod, so find inline_cache
1166 1175 CompiledIC* inline_cache = CompiledIC_before(caller_frame.pc());
1167 1176 bool should_be_mono = false;
1168 1177 if (inline_cache->is_optimized()) {
1169 1178 if (TraceCallFixup) {
1170 1179 ResourceMark rm(thread);
1171 1180 tty->print("OPTIMIZED IC miss (%s) call to", Bytecodes::name(bc));
1172 1181 callee_method->print_short_name(tty);
1173 1182 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code());
1174 1183 }
1175 1184 should_be_mono = true;
1176 1185 } else {
1177 1186 compiledICHolderOop ic_oop = (compiledICHolderOop) inline_cache->cached_oop();
1178 1187 if ( ic_oop != NULL && ic_oop->is_compiledICHolder()) {
1179 1188
1180 1189 if (receiver()->klass() == ic_oop->holder_klass()) {
1181 1190 // This isn't a real miss. We must have seen that compiled code
1182 1191 // is now available and we want the call site converted to a
1183 1192 // monomorphic compiled call site.
1184 1193 // We can't assert for callee_method->code() != NULL because it
1185 1194 // could have been deoptimized in the meantime
1186 1195 if (TraceCallFixup) {
1187 1196 ResourceMark rm(thread);
1188 1197 tty->print("FALSE IC miss (%s) converting to compiled call to", Bytecodes::name(bc));
1189 1198 callee_method->print_short_name(tty);
1190 1199 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code());
1191 1200 }
1192 1201 should_be_mono = true;
1193 1202 }
1194 1203 }
1195 1204 }
1196 1205
1197 1206 if (should_be_mono) {
1198 1207
1199 1208 // We have a path that was monomorphic but was going interpreted
1200 1209 // and now we have (or had) a compiled entry. We correct the IC
1201 1210 // by using a new icBuffer.
1202 1211 CompiledICInfo info;
1203 1212 KlassHandle receiver_klass(THREAD, receiver()->klass());
1204 1213 inline_cache->compute_monomorphic_entry(callee_method,
1205 1214 receiver_klass,
1206 1215 inline_cache->is_optimized(),
1207 1216 false,
1208 1217 info, CHECK_(methodHandle()));
1209 1218 inline_cache->set_to_monomorphic(info);
1210 1219 } else if (!inline_cache->is_megamorphic() && !inline_cache->is_clean()) {
1211 1220 // Change to megamorphic
1212 1221 inline_cache->set_to_megamorphic(&call_info, bc, CHECK_(methodHandle()));
1213 1222 } else {
1214 1223 // Either clean or megamorphic
1215 1224 }
1216 1225 }
1217 1226 } // Release CompiledIC_lock
1218 1227
1219 1228 return callee_method;
1220 1229 }
1221 1230
1222 1231 //
1223 1232 // Resets a call-site in compiled code so it will get resolved again.
1224 1233 // This routines handles both virtual call sites, optimized virtual call
1225 1234 // sites, and static call sites. Typically used to change a call sites
1226 1235 // destination from compiled to interpreted.
1227 1236 //
1228 1237 methodHandle SharedRuntime::reresolve_call_site(JavaThread *thread, TRAPS) {
1229 1238 ResourceMark rm(thread);
1230 1239 RegisterMap reg_map(thread, false);
1231 1240 frame stub_frame = thread->last_frame();
1232 1241 assert(stub_frame.is_runtime_frame(), "must be a runtimeStub");
1233 1242 frame caller = stub_frame.sender(®_map);
1234 1243
1235 1244 // Do nothing if the frame isn't a live compiled frame.
1236 1245 // nmethod could be deoptimized by the time we get here
1237 1246 // so no update to the caller is needed.
1238 1247
1239 1248 if (caller.is_compiled_frame() && !caller.is_deoptimized_frame()) {
1240 1249
1241 1250 address pc = caller.pc();
1242 1251 Events::log("update call-site at pc " INTPTR_FORMAT, pc);
1243 1252
1244 1253 // Default call_addr is the location of the "basic" call.
1245 1254 // Determine the address of the call we a reresolving. With
1246 1255 // Inline Caches we will always find a recognizable call.
1247 1256 // With Inline Caches disabled we may or may not find a
1248 1257 // recognizable call. We will always find a call for static
1249 1258 // calls and for optimized virtual calls. For vanilla virtual
1250 1259 // calls it depends on the state of the UseInlineCaches switch.
1251 1260 //
1252 1261 // With Inline Caches disabled we can get here for a virtual call
1253 1262 // for two reasons:
1254 1263 // 1 - calling an abstract method. The vtable for abstract methods
1255 1264 // will run us thru handle_wrong_method and we will eventually
1256 1265 // end up in the interpreter to throw the ame.
1257 1266 // 2 - a racing deoptimization. We could be doing a vanilla vtable
1258 1267 // call and between the time we fetch the entry address and
1259 1268 // we jump to it the target gets deoptimized. Similar to 1
1260 1269 // we will wind up in the interprter (thru a c2i with c2).
1261 1270 //
1262 1271 address call_addr = NULL;
1263 1272 {
1264 1273 // Get call instruction under lock because another thread may be
1265 1274 // busy patching it.
1266 1275 MutexLockerEx ml_patch(Patching_lock, Mutex::_no_safepoint_check_flag);
1267 1276 // Location of call instruction
1268 1277 if (NativeCall::is_call_before(pc)) {
1269 1278 NativeCall *ncall = nativeCall_before(pc);
1270 1279 call_addr = ncall->instruction_address();
1271 1280 }
1272 1281 }
1273 1282
1274 1283 // Check for static or virtual call
1275 1284 bool is_static_call = false;
1276 1285 nmethod* caller_nm = CodeCache::find_nmethod(pc);
1277 1286 // Make sure nmethod doesn't get deoptimized and removed until
1278 1287 // this is done with it.
1279 1288 // CLEANUP - with lazy deopt shouldn't need this lock
1280 1289 nmethodLocker nmlock(caller_nm);
1281 1290
1282 1291 if (call_addr != NULL) {
1283 1292 RelocIterator iter(caller_nm, call_addr, call_addr+1);
1284 1293 int ret = iter.next(); // Get item
1285 1294 if (ret) {
1286 1295 assert(iter.addr() == call_addr, "must find call");
1287 1296 if (iter.type() == relocInfo::static_call_type) {
1288 1297 is_static_call = true;
1289 1298 } else {
1290 1299 assert(iter.type() == relocInfo::virtual_call_type ||
1291 1300 iter.type() == relocInfo::opt_virtual_call_type
1292 1301 , "unexpected relocInfo. type");
1293 1302 }
1294 1303 } else {
1295 1304 assert(!UseInlineCaches, "relocation info. must exist for this address");
1296 1305 }
1297 1306
1298 1307 // Cleaning the inline cache will force a new resolve. This is more robust
1299 1308 // than directly setting it to the new destination, since resolving of calls
1300 1309 // is always done through the same code path. (experience shows that it
1301 1310 // leads to very hard to track down bugs, if an inline cache gets updated
1302 1311 // to a wrong method). It should not be performance critical, since the
1303 1312 // resolve is only done once.
1304 1313
1305 1314 MutexLocker ml(CompiledIC_lock);
1306 1315 //
1307 1316 // We do not patch the call site if the nmethod has been made non-entrant
1308 1317 // as it is a waste of time
1309 1318 //
1310 1319 if (caller_nm->is_in_use()) {
1311 1320 if (is_static_call) {
1312 1321 CompiledStaticCall* ssc= compiledStaticCall_at(call_addr);
1313 1322 ssc->set_to_clean();
1314 1323 } else {
1315 1324 // compiled, dispatched call (which used to call an interpreted method)
1316 1325 CompiledIC* inline_cache = CompiledIC_at(call_addr);
1317 1326 inline_cache->set_to_clean();
1318 1327 }
1319 1328 }
1320 1329 }
1321 1330
1322 1331 }
1323 1332
1324 1333 methodHandle callee_method = find_callee_method(thread, CHECK_(methodHandle()));
1325 1334
1326 1335
1327 1336 #ifndef PRODUCT
1328 1337 Atomic::inc(&_wrong_method_ctr);
1329 1338
1330 1339 if (TraceCallFixup) {
1331 1340 ResourceMark rm(thread);
1332 1341 tty->print("handle_wrong_method reresolving call to");
1333 1342 callee_method->print_short_name(tty);
1334 1343 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code());
1335 1344 }
1336 1345 #endif
1337 1346
1338 1347 return callee_method;
1339 1348 }
1340 1349
1341 1350 // ---------------------------------------------------------------------------
1342 1351 // We are calling the interpreter via a c2i. Normally this would mean that
1343 1352 // we were called by a compiled method. However we could have lost a race
1344 1353 // where we went int -> i2c -> c2i and so the caller could in fact be
1345 1354 // interpreted. If the caller is compiled we attampt to patch the caller
1346 1355 // so he no longer calls into the interpreter.
1347 1356 IRT_LEAF(void, SharedRuntime::fixup_callers_callsite(methodOopDesc* method, address caller_pc))
1348 1357 methodOop moop(method);
1349 1358
1350 1359 address entry_point = moop->from_compiled_entry();
1351 1360
1352 1361 // It's possible that deoptimization can occur at a call site which hasn't
1353 1362 // been resolved yet, in which case this function will be called from
1354 1363 // an nmethod that has been patched for deopt and we can ignore the
1355 1364 // request for a fixup.
1356 1365 // Also it is possible that we lost a race in that from_compiled_entry
1357 1366 // is now back to the i2c in that case we don't need to patch and if
1358 1367 // we did we'd leap into space because the callsite needs to use
1359 1368 // "to interpreter" stub in order to load up the methodOop. Don't
1360 1369 // ask me how I know this...
1361 1370 //
1362 1371
1363 1372 CodeBlob* cb = CodeCache::find_blob(caller_pc);
1364 1373 if ( !cb->is_nmethod() || entry_point == moop->get_c2i_entry()) {
1365 1374 return;
1366 1375 }
1367 1376
1368 1377 // There is a benign race here. We could be attempting to patch to a compiled
1369 1378 // entry point at the same time the callee is being deoptimized. If that is
1370 1379 // the case then entry_point may in fact point to a c2i and we'd patch the
1371 1380 // call site with the same old data. clear_code will set code() to NULL
1372 1381 // at the end of it. If we happen to see that NULL then we can skip trying
1373 1382 // to patch. If we hit the window where the callee has a c2i in the
1374 1383 // from_compiled_entry and the NULL isn't present yet then we lose the race
1375 1384 // and patch the code with the same old data. Asi es la vida.
1376 1385
1377 1386 if (moop->code() == NULL) return;
1378 1387
1379 1388 if (((nmethod*)cb)->is_in_use()) {
1380 1389
1381 1390 // Expect to find a native call there (unless it was no-inline cache vtable dispatch)
1382 1391 MutexLockerEx ml_patch(Patching_lock, Mutex::_no_safepoint_check_flag);
1383 1392 if (NativeCall::is_call_before(caller_pc + frame::pc_return_offset)) {
1384 1393 NativeCall *call = nativeCall_before(caller_pc + frame::pc_return_offset);
1385 1394 //
1386 1395 // bug 6281185. We might get here after resolving a call site to a vanilla
1387 1396 // virtual call. Because the resolvee uses the verified entry it may then
1388 1397 // see compiled code and attempt to patch the site by calling us. This would
1389 1398 // then incorrectly convert the call site to optimized and its downhill from
1390 1399 // there. If you're lucky you'll get the assert in the bugid, if not you've
1391 1400 // just made a call site that could be megamorphic into a monomorphic site
1392 1401 // for the rest of its life! Just another racing bug in the life of
1393 1402 // fixup_callers_callsite ...
1394 1403 //
1395 1404 RelocIterator iter(cb, call->instruction_address(), call->next_instruction_address());
1396 1405 iter.next();
1397 1406 assert(iter.has_current(), "must have a reloc at java call site");
1398 1407 relocInfo::relocType typ = iter.reloc()->type();
1399 1408 if ( typ != relocInfo::static_call_type &&
1400 1409 typ != relocInfo::opt_virtual_call_type &&
1401 1410 typ != relocInfo::static_stub_type) {
1402 1411 return;
1403 1412 }
1404 1413 address destination = call->destination();
1405 1414 if (destination != entry_point) {
1406 1415 CodeBlob* callee = CodeCache::find_blob(destination);
1407 1416 // callee == cb seems weird. It means calling interpreter thru stub.
1408 1417 if (callee == cb || callee->is_adapter_blob()) {
1409 1418 // static call or optimized virtual
1410 1419 if (TraceCallFixup) {
1411 1420 tty->print("fixup callsite at " INTPTR_FORMAT " to compiled code for", caller_pc);
1412 1421 moop->print_short_name(tty);
1413 1422 tty->print_cr(" to " INTPTR_FORMAT, entry_point);
1414 1423 }
1415 1424 call->set_destination_mt_safe(entry_point);
1416 1425 } else {
1417 1426 if (TraceCallFixup) {
1418 1427 tty->print("failed to fixup callsite at " INTPTR_FORMAT " to compiled code for", caller_pc);
1419 1428 moop->print_short_name(tty);
1420 1429 tty->print_cr(" to " INTPTR_FORMAT, entry_point);
1421 1430 }
1422 1431 // assert is too strong could also be resolve destinations.
1423 1432 // assert(InlineCacheBuffer::contains(destination) || VtableStubs::contains(destination), "must be");
1424 1433 }
1425 1434 } else {
1426 1435 if (TraceCallFixup) {
1427 1436 tty->print("already patched callsite at " INTPTR_FORMAT " to compiled code for", caller_pc);
1428 1437 moop->print_short_name(tty);
1429 1438 tty->print_cr(" to " INTPTR_FORMAT, entry_point);
1430 1439 }
1431 1440 }
1432 1441 }
1433 1442 }
1434 1443
1435 1444 IRT_END
1436 1445
1437 1446
1438 1447 // same as JVM_Arraycopy, but called directly from compiled code
1439 1448 JRT_ENTRY(void, SharedRuntime::slow_arraycopy_C(oopDesc* src, jint src_pos,
1440 1449 oopDesc* dest, jint dest_pos,
1441 1450 jint length,
1442 1451 JavaThread* thread)) {
1443 1452 #ifndef PRODUCT
1444 1453 _slow_array_copy_ctr++;
1445 1454 #endif
1446 1455 // Check if we have null pointers
1447 1456 if (src == NULL || dest == NULL) {
1448 1457 THROW(vmSymbols::java_lang_NullPointerException());
1449 1458 }
1450 1459 // Do the copy. The casts to arrayOop are necessary to the copy_array API,
1451 1460 // even though the copy_array API also performs dynamic checks to ensure
1452 1461 // that src and dest are truly arrays (and are conformable).
1453 1462 // The copy_array mechanism is awkward and could be removed, but
1454 1463 // the compilers don't call this function except as a last resort,
1455 1464 // so it probably doesn't matter.
1456 1465 Klass::cast(src->klass())->copy_array((arrayOopDesc*)src, src_pos,
1457 1466 (arrayOopDesc*)dest, dest_pos,
1458 1467 length, thread);
1459 1468 }
1460 1469 JRT_END
1461 1470
1462 1471 char* SharedRuntime::generate_class_cast_message(
1463 1472 JavaThread* thread, const char* objName) {
1464 1473
1465 1474 // Get target class name from the checkcast instruction
1466 1475 vframeStream vfst(thread, true);
1467 1476 assert(!vfst.at_end(), "Java frame must exist");
1468 1477 Bytecode_checkcast* cc = Bytecode_checkcast_at(
1469 1478 vfst.method()->bcp_from(vfst.bci()));
1470 1479 Klass* targetKlass = Klass::cast(vfst.method()->constants()->klass_at(
1471 1480 cc->index(), thread));
1472 1481 return generate_class_cast_message(objName, targetKlass->external_name());
1473 1482 }
1474 1483
1475 1484 char* SharedRuntime::generate_wrong_method_type_message(JavaThread* thread,
1476 1485 oopDesc* required,
1477 1486 oopDesc* actual) {
1478 1487 assert(EnableMethodHandles, "");
1479 1488 oop singleKlass = wrong_method_type_is_for_single_argument(thread, required);
1480 1489 if (singleKlass != NULL) {
1481 1490 const char* objName = "argument or return value";
1482 1491 if (actual != NULL) {
1483 1492 // be flexible about the junk passed in:
1484 1493 klassOop ak = (actual->is_klass()
1485 1494 ? (klassOop)actual
1486 1495 : actual->klass());
1487 1496 objName = Klass::cast(ak)->external_name();
1488 1497 }
1489 1498 Klass* targetKlass = Klass::cast(required->is_klass()
1490 1499 ? (klassOop)required
1491 1500 : java_lang_Class::as_klassOop(required));
1492 1501 return generate_class_cast_message(objName, targetKlass->external_name());
1493 1502 } else {
1494 1503 // %%% need to get the MethodType string, without messing around too much
1495 1504 // Get a signature from the invoke instruction
1496 1505 const char* mhName = "method handle";
1497 1506 const char* targetType = "the required signature";
1498 1507 vframeStream vfst(thread, true);
1499 1508 if (!vfst.at_end()) {
1500 1509 Bytecode_invoke* call = Bytecode_invoke_at(vfst.method(), vfst.bci());
1501 1510 methodHandle target;
1502 1511 {
1503 1512 EXCEPTION_MARK;
1504 1513 target = call->static_target(THREAD);
1505 1514 if (HAS_PENDING_EXCEPTION) { CLEAR_PENDING_EXCEPTION; }
1506 1515 }
1507 1516 if (target.not_null()
1508 1517 && target->is_method_handle_invoke()
1509 1518 && required == target->method_handle_type()) {
1510 1519 targetType = target->signature()->as_C_string();
1511 1520 }
1512 1521 }
1513 1522 klassOop kignore; int fignore;
1514 1523 methodOop actual_method = MethodHandles::decode_method(actual,
1515 1524 kignore, fignore);
1516 1525 if (actual_method != NULL) {
1517 1526 if (actual_method->name() == vmSymbols::invoke_name())
1518 1527 mhName = "$";
1519 1528 else
1520 1529 mhName = actual_method->signature()->as_C_string();
1521 1530 if (mhName[0] == '$')
1522 1531 mhName = actual_method->signature()->as_C_string();
1523 1532 }
1524 1533 return generate_class_cast_message(mhName, targetType,
1525 1534 " cannot be called as ");
1526 1535 }
1527 1536 }
1528 1537
1529 1538 oop SharedRuntime::wrong_method_type_is_for_single_argument(JavaThread* thr,
1530 1539 oopDesc* required) {
1531 1540 if (required == NULL) return NULL;
1532 1541 if (required->klass() == SystemDictionary::class_klass())
1533 1542 return required;
1534 1543 if (required->is_klass())
1535 1544 return Klass::cast(klassOop(required))->java_mirror();
1536 1545 return NULL;
1537 1546 }
1538 1547
1539 1548
1540 1549 char* SharedRuntime::generate_class_cast_message(
1541 1550 const char* objName, const char* targetKlassName, const char* desc) {
1542 1551 size_t msglen = strlen(objName) + strlen(desc) + strlen(targetKlassName) + 1;
1543 1552
1544 1553 char* message = NEW_RESOURCE_ARRAY(char, msglen);
1545 1554 if (NULL == message) {
1546 1555 // Shouldn't happen, but don't cause even more problems if it does
1547 1556 message = const_cast<char*>(objName);
1548 1557 } else {
1549 1558 jio_snprintf(message, msglen, "%s%s%s", objName, desc, targetKlassName);
1550 1559 }
1551 1560 return message;
1552 1561 }
1553 1562
1554 1563 JRT_LEAF(void, SharedRuntime::reguard_yellow_pages())
1555 1564 (void) JavaThread::current()->reguard_stack();
1556 1565 JRT_END
1557 1566
1558 1567
1559 1568 // Handles the uncommon case in locking, i.e., contention or an inflated lock.
1560 1569 #ifndef PRODUCT
1561 1570 int SharedRuntime::_monitor_enter_ctr=0;
1562 1571 #endif
1563 1572 JRT_ENTRY_NO_ASYNC(void, SharedRuntime::complete_monitor_locking_C(oopDesc* _obj, BasicLock* lock, JavaThread* thread))
1564 1573 oop obj(_obj);
1565 1574 #ifndef PRODUCT
1566 1575 _monitor_enter_ctr++; // monitor enter slow
1567 1576 #endif
1568 1577 if (PrintBiasedLockingStatistics) {
1569 1578 Atomic::inc(BiasedLocking::slow_path_entry_count_addr());
1570 1579 }
1571 1580 Handle h_obj(THREAD, obj);
1572 1581 if (UseBiasedLocking) {
1573 1582 // Retry fast entry if bias is revoked to avoid unnecessary inflation
1574 1583 ObjectSynchronizer::fast_enter(h_obj, lock, true, CHECK);
1575 1584 } else {
1576 1585 ObjectSynchronizer::slow_enter(h_obj, lock, CHECK);
1577 1586 }
1578 1587 assert(!HAS_PENDING_EXCEPTION, "Should have no exception here");
1579 1588 JRT_END
1580 1589
1581 1590 #ifndef PRODUCT
1582 1591 int SharedRuntime::_monitor_exit_ctr=0;
1583 1592 #endif
1584 1593 // Handles the uncommon cases of monitor unlocking in compiled code
1585 1594 JRT_LEAF(void, SharedRuntime::complete_monitor_unlocking_C(oopDesc* _obj, BasicLock* lock))
1586 1595 oop obj(_obj);
1587 1596 #ifndef PRODUCT
1588 1597 _monitor_exit_ctr++; // monitor exit slow
1589 1598 #endif
1590 1599 Thread* THREAD = JavaThread::current();
1591 1600 // I'm not convinced we need the code contained by MIGHT_HAVE_PENDING anymore
1592 1601 // testing was unable to ever fire the assert that guarded it so I have removed it.
1593 1602 assert(!HAS_PENDING_EXCEPTION, "Do we need code below anymore?");
1594 1603 #undef MIGHT_HAVE_PENDING
1595 1604 #ifdef MIGHT_HAVE_PENDING
1596 1605 // Save and restore any pending_exception around the exception mark.
1597 1606 // While the slow_exit must not throw an exception, we could come into
1598 1607 // this routine with one set.
1599 1608 oop pending_excep = NULL;
1600 1609 const char* pending_file;
1601 1610 int pending_line;
1602 1611 if (HAS_PENDING_EXCEPTION) {
1603 1612 pending_excep = PENDING_EXCEPTION;
1604 1613 pending_file = THREAD->exception_file();
1605 1614 pending_line = THREAD->exception_line();
1606 1615 CLEAR_PENDING_EXCEPTION;
1607 1616 }
1608 1617 #endif /* MIGHT_HAVE_PENDING */
1609 1618
1610 1619 {
1611 1620 // Exit must be non-blocking, and therefore no exceptions can be thrown.
1612 1621 EXCEPTION_MARK;
1613 1622 ObjectSynchronizer::slow_exit(obj, lock, THREAD);
1614 1623 }
1615 1624
1616 1625 #ifdef MIGHT_HAVE_PENDING
1617 1626 if (pending_excep != NULL) {
1618 1627 THREAD->set_pending_exception(pending_excep, pending_file, pending_line);
1619 1628 }
1620 1629 #endif /* MIGHT_HAVE_PENDING */
1621 1630 JRT_END
1622 1631
1623 1632 #ifndef PRODUCT
1624 1633
1625 1634 void SharedRuntime::print_statistics() {
1626 1635 ttyLocker ttyl;
1627 1636 if (xtty != NULL) xtty->head("statistics type='SharedRuntime'");
1628 1637
1629 1638 if (_monitor_enter_ctr ) tty->print_cr("%5d monitor enter slow", _monitor_enter_ctr);
1630 1639 if (_monitor_exit_ctr ) tty->print_cr("%5d monitor exit slow", _monitor_exit_ctr);
1631 1640 if (_throw_null_ctr) tty->print_cr("%5d implicit null throw", _throw_null_ctr);
1632 1641
1633 1642 SharedRuntime::print_ic_miss_histogram();
1634 1643
1635 1644 if (CountRemovableExceptions) {
1636 1645 if (_nof_removable_exceptions > 0) {
1637 1646 Unimplemented(); // this counter is not yet incremented
1638 1647 tty->print_cr("Removable exceptions: %d", _nof_removable_exceptions);
1639 1648 }
1640 1649 }
1641 1650
1642 1651 // Dump the JRT_ENTRY counters
1643 1652 if( _new_instance_ctr ) tty->print_cr("%5d new instance requires GC", _new_instance_ctr);
1644 1653 if( _new_array_ctr ) tty->print_cr("%5d new array requires GC", _new_array_ctr);
1645 1654 if( _multi1_ctr ) tty->print_cr("%5d multianewarray 1 dim", _multi1_ctr);
1646 1655 if( _multi2_ctr ) tty->print_cr("%5d multianewarray 2 dim", _multi2_ctr);
1647 1656 if( _multi3_ctr ) tty->print_cr("%5d multianewarray 3 dim", _multi3_ctr);
1648 1657 if( _multi4_ctr ) tty->print_cr("%5d multianewarray 4 dim", _multi4_ctr);
1649 1658 if( _multi5_ctr ) tty->print_cr("%5d multianewarray 5 dim", _multi5_ctr);
1650 1659
1651 1660 tty->print_cr("%5d inline cache miss in compiled", _ic_miss_ctr );
1652 1661 tty->print_cr("%5d wrong method", _wrong_method_ctr );
1653 1662 tty->print_cr("%5d unresolved static call site", _resolve_static_ctr );
1654 1663 tty->print_cr("%5d unresolved virtual call site", _resolve_virtual_ctr );
1655 1664 tty->print_cr("%5d unresolved opt virtual call site", _resolve_opt_virtual_ctr );
1656 1665
1657 1666 if( _mon_enter_stub_ctr ) tty->print_cr("%5d monitor enter stub", _mon_enter_stub_ctr );
1658 1667 if( _mon_exit_stub_ctr ) tty->print_cr("%5d monitor exit stub", _mon_exit_stub_ctr );
1659 1668 if( _mon_enter_ctr ) tty->print_cr("%5d monitor enter slow", _mon_enter_ctr );
1660 1669 if( _mon_exit_ctr ) tty->print_cr("%5d monitor exit slow", _mon_exit_ctr );
1661 1670 if( _partial_subtype_ctr) tty->print_cr("%5d slow partial subtype", _partial_subtype_ctr );
1662 1671 if( _jbyte_array_copy_ctr ) tty->print_cr("%5d byte array copies", _jbyte_array_copy_ctr );
1663 1672 if( _jshort_array_copy_ctr ) tty->print_cr("%5d short array copies", _jshort_array_copy_ctr );
1664 1673 if( _jint_array_copy_ctr ) tty->print_cr("%5d int array copies", _jint_array_copy_ctr );
1665 1674 if( _jlong_array_copy_ctr ) tty->print_cr("%5d long array copies", _jlong_array_copy_ctr );
1666 1675 if( _oop_array_copy_ctr ) tty->print_cr("%5d oop array copies", _oop_array_copy_ctr );
1667 1676 if( _checkcast_array_copy_ctr ) tty->print_cr("%5d checkcast array copies", _checkcast_array_copy_ctr );
1668 1677 if( _unsafe_array_copy_ctr ) tty->print_cr("%5d unsafe array copies", _unsafe_array_copy_ctr );
1669 1678 if( _generic_array_copy_ctr ) tty->print_cr("%5d generic array copies", _generic_array_copy_ctr );
1670 1679 if( _slow_array_copy_ctr ) tty->print_cr("%5d slow array copies", _slow_array_copy_ctr );
1671 1680 if( _find_handler_ctr ) tty->print_cr("%5d find exception handler", _find_handler_ctr );
1672 1681 if( _rethrow_ctr ) tty->print_cr("%5d rethrow handler", _rethrow_ctr );
1673 1682
1674 1683 if (xtty != NULL) xtty->tail("statistics");
1675 1684 }
1676 1685
1677 1686 inline double percent(int x, int y) {
1678 1687 return 100.0 * x / MAX2(y, 1);
1679 1688 }
1680 1689
1681 1690 class MethodArityHistogram {
1682 1691 public:
1683 1692 enum { MAX_ARITY = 256 };
1684 1693 private:
1685 1694 static int _arity_histogram[MAX_ARITY]; // histogram of #args
1686 1695 static int _size_histogram[MAX_ARITY]; // histogram of arg size in words
1687 1696 static int _max_arity; // max. arity seen
1688 1697 static int _max_size; // max. arg size seen
1689 1698
1690 1699 static void add_method_to_histogram(nmethod* nm) {
1691 1700 methodOop m = nm->method();
1692 1701 ArgumentCount args(m->signature());
1693 1702 int arity = args.size() + (m->is_static() ? 0 : 1);
1694 1703 int argsize = m->size_of_parameters();
1695 1704 arity = MIN2(arity, MAX_ARITY-1);
1696 1705 argsize = MIN2(argsize, MAX_ARITY-1);
1697 1706 int count = nm->method()->compiled_invocation_count();
1698 1707 _arity_histogram[arity] += count;
1699 1708 _size_histogram[argsize] += count;
1700 1709 _max_arity = MAX2(_max_arity, arity);
1701 1710 _max_size = MAX2(_max_size, argsize);
1702 1711 }
1703 1712
1704 1713 void print_histogram_helper(int n, int* histo, const char* name) {
1705 1714 const int N = MIN2(5, n);
1706 1715 tty->print_cr("\nHistogram of call arity (incl. rcvr, calls to compiled methods only):");
1707 1716 double sum = 0;
1708 1717 double weighted_sum = 0;
1709 1718 int i;
1710 1719 for (i = 0; i <= n; i++) { sum += histo[i]; weighted_sum += i*histo[i]; }
1711 1720 double rest = sum;
1712 1721 double percent = sum / 100;
1713 1722 for (i = 0; i <= N; i++) {
1714 1723 rest -= histo[i];
1715 1724 tty->print_cr("%4d: %7d (%5.1f%%)", i, histo[i], histo[i] / percent);
1716 1725 }
1717 1726 tty->print_cr("rest: %7d (%5.1f%%))", (int)rest, rest / percent);
1718 1727 tty->print_cr("(avg. %s = %3.1f, max = %d)", name, weighted_sum / sum, n);
1719 1728 }
1720 1729
1721 1730 void print_histogram() {
1722 1731 tty->print_cr("\nHistogram of call arity (incl. rcvr, calls to compiled methods only):");
1723 1732 print_histogram_helper(_max_arity, _arity_histogram, "arity");
1724 1733 tty->print_cr("\nSame for parameter size (in words):");
1725 1734 print_histogram_helper(_max_size, _size_histogram, "size");
1726 1735 tty->cr();
1727 1736 }
1728 1737
1729 1738 public:
1730 1739 MethodArityHistogram() {
1731 1740 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
1732 1741 _max_arity = _max_size = 0;
1733 1742 for (int i = 0; i < MAX_ARITY; i++) _arity_histogram[i] = _size_histogram [i] = 0;
1734 1743 CodeCache::nmethods_do(add_method_to_histogram);
1735 1744 print_histogram();
1736 1745 }
1737 1746 };
1738 1747
1739 1748 int MethodArityHistogram::_arity_histogram[MethodArityHistogram::MAX_ARITY];
1740 1749 int MethodArityHistogram::_size_histogram[MethodArityHistogram::MAX_ARITY];
1741 1750 int MethodArityHistogram::_max_arity;
1742 1751 int MethodArityHistogram::_max_size;
1743 1752
1744 1753 void SharedRuntime::print_call_statistics(int comp_total) {
1745 1754 tty->print_cr("Calls from compiled code:");
1746 1755 int total = _nof_normal_calls + _nof_interface_calls + _nof_static_calls;
1747 1756 int mono_c = _nof_normal_calls - _nof_optimized_calls - _nof_megamorphic_calls;
1748 1757 int mono_i = _nof_interface_calls - _nof_optimized_interface_calls - _nof_megamorphic_interface_calls;
1749 1758 tty->print_cr("\t%9d (%4.1f%%) total non-inlined ", total, percent(total, total));
1750 1759 tty->print_cr("\t%9d (%4.1f%%) virtual calls ", _nof_normal_calls, percent(_nof_normal_calls, total));
1751 1760 tty->print_cr("\t %9d (%3.0f%%) inlined ", _nof_inlined_calls, percent(_nof_inlined_calls, _nof_normal_calls));
1752 1761 tty->print_cr("\t %9d (%3.0f%%) optimized ", _nof_optimized_calls, percent(_nof_optimized_calls, _nof_normal_calls));
1753 1762 tty->print_cr("\t %9d (%3.0f%%) monomorphic ", mono_c, percent(mono_c, _nof_normal_calls));
1754 1763 tty->print_cr("\t %9d (%3.0f%%) megamorphic ", _nof_megamorphic_calls, percent(_nof_megamorphic_calls, _nof_normal_calls));
1755 1764 tty->print_cr("\t%9d (%4.1f%%) interface calls ", _nof_interface_calls, percent(_nof_interface_calls, total));
1756 1765 tty->print_cr("\t %9d (%3.0f%%) inlined ", _nof_inlined_interface_calls, percent(_nof_inlined_interface_calls, _nof_interface_calls));
1757 1766 tty->print_cr("\t %9d (%3.0f%%) optimized ", _nof_optimized_interface_calls, percent(_nof_optimized_interface_calls, _nof_interface_calls));
1758 1767 tty->print_cr("\t %9d (%3.0f%%) monomorphic ", mono_i, percent(mono_i, _nof_interface_calls));
1759 1768 tty->print_cr("\t %9d (%3.0f%%) megamorphic ", _nof_megamorphic_interface_calls, percent(_nof_megamorphic_interface_calls, _nof_interface_calls));
1760 1769 tty->print_cr("\t%9d (%4.1f%%) static/special calls", _nof_static_calls, percent(_nof_static_calls, total));
1761 1770 tty->print_cr("\t %9d (%3.0f%%) inlined ", _nof_inlined_static_calls, percent(_nof_inlined_static_calls, _nof_static_calls));
1762 1771 tty->cr();
1763 1772 tty->print_cr("Note 1: counter updates are not MT-safe.");
1764 1773 tty->print_cr("Note 2: %% in major categories are relative to total non-inlined calls;");
1765 1774 tty->print_cr(" %% in nested categories are relative to their category");
1766 1775 tty->print_cr(" (and thus add up to more than 100%% with inlining)");
1767 1776 tty->cr();
1768 1777
1769 1778 MethodArityHistogram h;
1770 1779 }
1771 1780 #endif
1772 1781
1773 1782
1774 1783 // ---------------------------------------------------------------------------
1775 1784 // Implementation of AdapterHandlerLibrary
1776 1785 const char* AdapterHandlerEntry::name = "I2C/C2I adapters";
1777 1786 GrowableArray<uint64_t>* AdapterHandlerLibrary::_fingerprints = NULL;
1778 1787 GrowableArray<AdapterHandlerEntry* >* AdapterHandlerLibrary::_handlers = NULL;
1779 1788 const int AdapterHandlerLibrary_size = 16*K;
1780 1789 BufferBlob* AdapterHandlerLibrary::_buffer = NULL;
1781 1790
1782 1791 BufferBlob* AdapterHandlerLibrary::buffer_blob() {
1783 1792 // Should be called only when AdapterHandlerLibrary_lock is active.
1784 1793 if (_buffer == NULL) // Initialize lazily
1785 1794 _buffer = BufferBlob::create("adapters", AdapterHandlerLibrary_size);
1786 1795 return _buffer;
1787 1796 }
1788 1797
1789 1798 void AdapterHandlerLibrary::initialize() {
1790 1799 if (_fingerprints != NULL) return;
1791 1800 _fingerprints = new(ResourceObj::C_HEAP)GrowableArray<uint64_t>(32, true);
1792 1801 _handlers = new(ResourceObj::C_HEAP)GrowableArray<AdapterHandlerEntry*>(32, true);
1793 1802 // Index 0 reserved for the slow path handler
1794 1803 _fingerprints->append(0/*the never-allowed 0 fingerprint*/);
1795 1804 _handlers->append(NULL);
1796 1805
1797 1806 // Create a special handler for abstract methods. Abstract methods
1798 1807 // are never compiled so an i2c entry is somewhat meaningless, but
1799 1808 // fill it in with something appropriate just in case. Pass handle
1800 1809 // wrong method for the c2i transitions.
1801 1810 address wrong_method = SharedRuntime::get_handle_wrong_method_stub();
1802 1811 _fingerprints->append(0/*the never-allowed 0 fingerprint*/);
1803 1812 assert(_handlers->length() == AbstractMethodHandler, "in wrong slot");
1804 1813 _handlers->append(new AdapterHandlerEntry(StubRoutines::throw_AbstractMethodError_entry(),
1805 1814 wrong_method, wrong_method));
1806 1815 }
1807 1816
1808 1817 int AdapterHandlerLibrary::get_create_adapter_index(methodHandle method) {
1809 1818 // Use customized signature handler. Need to lock around updates to the
1810 1819 // _fingerprints array (it is not safe for concurrent readers and a single
1811 1820 // writer: this can be fixed if it becomes a problem).
1812 1821
1813 1822 // Get the address of the ic_miss handlers before we grab the
1814 1823 // AdapterHandlerLibrary_lock. This fixes bug 6236259 which
1815 1824 // was caused by the initialization of the stubs happening
1816 1825 // while we held the lock and then notifying jvmti while
1817 1826 // holding it. This just forces the initialization to be a little
1818 1827 // earlier.
1819 1828 address ic_miss = SharedRuntime::get_ic_miss_stub();
1820 1829 assert(ic_miss != NULL, "must have handler");
1821 1830
1822 1831 int result;
1823 1832 NOT_PRODUCT(int code_size);
1824 1833 BufferBlob *B = NULL;
1825 1834 AdapterHandlerEntry* entry = NULL;
1826 1835 uint64_t fingerprint;
1827 1836 {
1828 1837 MutexLocker mu(AdapterHandlerLibrary_lock);
1829 1838 // make sure data structure is initialized
1830 1839 initialize();
1831 1840
1832 1841 if (method->is_abstract()) {
1833 1842 return AbstractMethodHandler;
1834 1843 }
1835 1844
1836 1845 // Lookup method signature's fingerprint
1837 1846 fingerprint = Fingerprinter(method).fingerprint();
1838 1847 assert( fingerprint != CONST64( 0), "no zero fingerprints allowed" );
1839 1848 // Fingerprints are small fixed-size condensed representations of
1840 1849 // signatures. If the signature is too large, it won't fit in a
1841 1850 // fingerprint. Signatures which cannot support a fingerprint get a new i2c
1842 1851 // adapter gen'd each time, instead of searching the cache for one. This -1
1843 1852 // game can be avoided if I compared signatures instead of using
1844 1853 // fingerprints. However, -1 fingerprints are very rare.
1845 1854 if( fingerprint != UCONST64(-1) ) { // If this is a cache-able fingerprint
1846 1855 // Turns out i2c adapters do not care what the return value is. Mask it
1847 1856 // out so signatures that only differ in return type will share the same
1848 1857 // adapter.
1849 1858 fingerprint &= ~(SignatureIterator::result_feature_mask << SignatureIterator::static_feature_size);
1850 1859 // Search for a prior existing i2c/c2i adapter
1851 1860 int index = _fingerprints->find(fingerprint);
1852 1861 if( index >= 0 ) return index; // Found existing handlers?
1853 1862 } else {
1854 1863 // Annoyingly, I end up adding -1 fingerprints to the array of handlers,
1855 1864 // because I need a unique handler index. It cannot be scanned for
1856 1865 // because all -1's look alike. Instead, the matching index is passed out
1857 1866 // and immediately used to collect the 2 return values (the c2i and i2c
1858 1867 // adapters).
1859 1868 }
1860 1869
1861 1870 // Create I2C & C2I handlers
1862 1871 ResourceMark rm;
1863 1872
1864 1873 BufferBlob* buf = buffer_blob(); // the temporary code buffer in CodeCache
1865 1874 if (buf != NULL) {
1866 1875 CodeBuffer buffer(buf->instructions_begin(), buf->instructions_size());
1867 1876 short buffer_locs[20];
1868 1877 buffer.insts()->initialize_shared_locs((relocInfo*)buffer_locs,
1869 1878 sizeof(buffer_locs)/sizeof(relocInfo));
1870 1879 MacroAssembler _masm(&buffer);
1871 1880
1872 1881 // Fill in the signature array, for the calling-convention call.
1873 1882 int total_args_passed = method->size_of_parameters(); // All args on stack
1874 1883
1875 1884 BasicType* sig_bt = NEW_RESOURCE_ARRAY(BasicType,total_args_passed);
1876 1885 VMRegPair * regs = NEW_RESOURCE_ARRAY(VMRegPair ,total_args_passed);
1877 1886 int i=0;
1878 1887 if( !method->is_static() ) // Pass in receiver first
1879 1888 sig_bt[i++] = T_OBJECT;
1880 1889 for( SignatureStream ss(method->signature()); !ss.at_return_type(); ss.next()) {
1881 1890 sig_bt[i++] = ss.type(); // Collect remaining bits of signature
1882 1891 if( ss.type() == T_LONG || ss.type() == T_DOUBLE )
1883 1892 sig_bt[i++] = T_VOID; // Longs & doubles take 2 Java slots
1884 1893 }
1885 1894 assert( i==total_args_passed, "" );
1886 1895
1887 1896 // Now get the re-packed compiled-Java layout.
1888 1897 int comp_args_on_stack;
1889 1898
1890 1899 // Get a description of the compiled java calling convention and the largest used (VMReg) stack slot usage
1891 1900 comp_args_on_stack = SharedRuntime::java_calling_convention(sig_bt, regs, total_args_passed, false);
1892 1901
1893 1902 entry = SharedRuntime::generate_i2c2i_adapters(&_masm,
1894 1903 total_args_passed,
1895 1904 comp_args_on_stack,
1896 1905 sig_bt,
1897 1906 regs);
1898 1907
1899 1908 B = BufferBlob::create(AdapterHandlerEntry::name, &buffer);
1900 1909 NOT_PRODUCT(code_size = buffer.code_size());
1901 1910 }
1902 1911 if (B == NULL) {
1903 1912 // CodeCache is full, disable compilation
1904 1913 // Ought to log this but compile log is only per compile thread
1905 1914 // and we're some non descript Java thread.
1906 1915 UseInterpreter = true;
1907 1916 if (UseCompiler || AlwaysCompileLoopMethods ) {
1908 1917 #ifndef PRODUCT
1909 1918 warning("CodeCache is full. Compiler has been disabled");
1910 1919 if (CompileTheWorld || ExitOnFullCodeCache) {
1911 1920 before_exit(JavaThread::current());
1912 1921 exit_globals(); // will delete tty
1913 1922 vm_direct_exit(CompileTheWorld ? 0 : 1);
1914 1923 }
1915 1924 #endif
1916 1925 UseCompiler = false;
1917 1926 AlwaysCompileLoopMethods = false;
1918 1927 }
1919 1928 return 0; // Out of CodeCache space (_handlers[0] == NULL)
1920 1929 }
1921 1930 entry->relocate(B->instructions_begin());
1922 1931 #ifndef PRODUCT
1923 1932 // debugging suppport
1924 1933 if (PrintAdapterHandlers) {
1925 1934 tty->cr();
1926 1935 tty->print_cr("i2c argument handler #%d for: %s %s (fingerprint = 0x%llx, %d bytes generated)",
1927 1936 _handlers->length(), (method->is_static() ? "static" : "receiver"),
1928 1937 method->signature()->as_C_string(), fingerprint, code_size );
1929 1938 tty->print_cr("c2i argument handler starts at %p",entry->get_c2i_entry());
1930 1939 Disassembler::decode(entry->get_i2c_entry(), entry->get_i2c_entry() + code_size);
1931 1940 }
1932 1941 #endif
1933 1942
1934 1943 // add handlers to library
1935 1944 _fingerprints->append(fingerprint);
1936 1945 _handlers->append(entry);
1937 1946 // set handler index
1938 1947 assert(_fingerprints->length() == _handlers->length(), "sanity check");
1939 1948 result = _fingerprints->length() - 1;
1940 1949 }
1941 1950 // Outside of the lock
1942 1951 if (B != NULL) {
1943 1952 char blob_id[256];
1944 1953 jio_snprintf(blob_id,
1945 1954 sizeof(blob_id),
1946 1955 "%s(" PTR64_FORMAT ")@" PTR_FORMAT,
1947 1956 AdapterHandlerEntry::name,
1948 1957 fingerprint,
1949 1958 B->instructions_begin());
1950 1959 VTune::register_stub(blob_id, B->instructions_begin(), B->instructions_end());
1951 1960 Forte::register_stub(blob_id, B->instructions_begin(), B->instructions_end());
1952 1961
1953 1962 if (JvmtiExport::should_post_dynamic_code_generated()) {
1954 1963 JvmtiExport::post_dynamic_code_generated(blob_id,
1955 1964 B->instructions_begin(),
1956 1965 B->instructions_end());
1957 1966 }
1958 1967 }
1959 1968 return result;
1960 1969 }
1961 1970
1962 1971 void AdapterHandlerEntry::relocate(address new_base) {
1963 1972 ptrdiff_t delta = new_base - _i2c_entry;
1964 1973 _i2c_entry += delta;
1965 1974 _c2i_entry += delta;
1966 1975 _c2i_unverified_entry += delta;
1967 1976 }
1968 1977
1969 1978 // Create a native wrapper for this native method. The wrapper converts the
1970 1979 // java compiled calling convention to the native convention, handlizes
1971 1980 // arguments, and transitions to native. On return from the native we transition
1972 1981 // back to java blocking if a safepoint is in progress.
1973 1982 nmethod *AdapterHandlerLibrary::create_native_wrapper(methodHandle method) {
1974 1983 ResourceMark rm;
1975 1984 nmethod* nm = NULL;
1976 1985
1977 1986 if (PrintCompilation) {
1978 1987 ttyLocker ttyl;
1979 1988 tty->print("--- n%s ", (method->is_synchronized() ? "s" : " "));
1980 1989 method->print_short_name(tty);
1981 1990 if (method->is_static()) {
1982 1991 tty->print(" (static)");
1983 1992 }
1984 1993 tty->cr();
1985 1994 }
1986 1995
1987 1996 assert(method->has_native_function(), "must have something valid to call!");
1988 1997
1989 1998 {
1990 1999 // perform the work while holding the lock, but perform any printing outside the lock
1991 2000 MutexLocker mu(AdapterHandlerLibrary_lock);
1992 2001 // See if somebody beat us to it
1993 2002 nm = method->code();
1994 2003 if (nm) {
1995 2004 return nm;
1996 2005 }
1997 2006
1998 2007 ResourceMark rm;
1999 2008
2000 2009 BufferBlob* buf = buffer_blob(); // the temporary code buffer in CodeCache
2001 2010 if (buf != NULL) {
2002 2011 CodeBuffer buffer(buf->instructions_begin(), buf->instructions_size());
2003 2012 double locs_buf[20];
2004 2013 buffer.insts()->initialize_shared_locs((relocInfo*)locs_buf, sizeof(locs_buf) / sizeof(relocInfo));
2005 2014 MacroAssembler _masm(&buffer);
2006 2015
2007 2016 // Fill in the signature array, for the calling-convention call.
2008 2017 int total_args_passed = method->size_of_parameters();
2009 2018
2010 2019 BasicType* sig_bt = NEW_RESOURCE_ARRAY(BasicType,total_args_passed);
2011 2020 VMRegPair* regs = NEW_RESOURCE_ARRAY(VMRegPair,total_args_passed);
2012 2021 int i=0;
2013 2022 if( !method->is_static() ) // Pass in receiver first
2014 2023 sig_bt[i++] = T_OBJECT;
2015 2024 SignatureStream ss(method->signature());
2016 2025 for( ; !ss.at_return_type(); ss.next()) {
2017 2026 sig_bt[i++] = ss.type(); // Collect remaining bits of signature
2018 2027 if( ss.type() == T_LONG || ss.type() == T_DOUBLE )
2019 2028 sig_bt[i++] = T_VOID; // Longs & doubles take 2 Java slots
2020 2029 }
2021 2030 assert( i==total_args_passed, "" );
2022 2031 BasicType ret_type = ss.type();
2023 2032
2024 2033 // Now get the compiled-Java layout as input arguments
2025 2034 int comp_args_on_stack;
2026 2035 comp_args_on_stack = SharedRuntime::java_calling_convention(sig_bt, regs, total_args_passed, false);
2027 2036
2028 2037 // Generate the compiled-to-native wrapper code
2029 2038 nm = SharedRuntime::generate_native_wrapper(&_masm,
2030 2039 method,
2031 2040 total_args_passed,
2032 2041 comp_args_on_stack,
2033 2042 sig_bt,regs,
2034 2043 ret_type);
2035 2044 }
2036 2045 }
2037 2046
2038 2047 // Must unlock before calling set_code
2039 2048 // Install the generated code.
2040 2049 if (nm != NULL) {
2041 2050 method->set_code(method, nm);
2042 2051 nm->post_compiled_method_load_event();
2043 2052 } else {
2044 2053 // CodeCache is full, disable compilation
2045 2054 // Ought to log this but compile log is only per compile thread
2046 2055 // and we're some non descript Java thread.
2047 2056 UseInterpreter = true;
2048 2057 if (UseCompiler || AlwaysCompileLoopMethods ) {
2049 2058 #ifndef PRODUCT
2050 2059 warning("CodeCache is full. Compiler has been disabled");
2051 2060 if (CompileTheWorld || ExitOnFullCodeCache) {
2052 2061 before_exit(JavaThread::current());
2053 2062 exit_globals(); // will delete tty
2054 2063 vm_direct_exit(CompileTheWorld ? 0 : 1);
2055 2064 }
2056 2065 #endif
2057 2066 UseCompiler = false;
2058 2067 AlwaysCompileLoopMethods = false;
2059 2068 }
2060 2069 }
2061 2070 return nm;
2062 2071 }
2063 2072
2064 2073 #ifdef HAVE_DTRACE_H
2065 2074 // Create a dtrace nmethod for this method. The wrapper converts the
2066 2075 // java compiled calling convention to the native convention, makes a dummy call
2067 2076 // (actually nops for the size of the call instruction, which become a trap if
2068 2077 // probe is enabled). The returns to the caller. Since this all looks like a
2069 2078 // leaf no thread transition is needed.
2070 2079
2071 2080 nmethod *AdapterHandlerLibrary::create_dtrace_nmethod(methodHandle method) {
2072 2081 ResourceMark rm;
2073 2082 nmethod* nm = NULL;
2074 2083
2075 2084 if (PrintCompilation) {
2076 2085 ttyLocker ttyl;
2077 2086 tty->print("--- n%s ");
2078 2087 method->print_short_name(tty);
2079 2088 if (method->is_static()) {
2080 2089 tty->print(" (static)");
2081 2090 }
2082 2091 tty->cr();
2083 2092 }
2084 2093
2085 2094 {
2086 2095 // perform the work while holding the lock, but perform any printing
2087 2096 // outside the lock
2088 2097 MutexLocker mu(AdapterHandlerLibrary_lock);
2089 2098 // See if somebody beat us to it
2090 2099 nm = method->code();
2091 2100 if (nm) {
2092 2101 return nm;
2093 2102 }
2094 2103
2095 2104 ResourceMark rm;
2096 2105
2097 2106 BufferBlob* buf = buffer_blob(); // the temporary code buffer in CodeCache
2098 2107 if (buf != NULL) {
2099 2108 CodeBuffer buffer(buf->instructions_begin(), buf->instructions_size());
2100 2109 // Need a few relocation entries
2101 2110 double locs_buf[20];
2102 2111 buffer.insts()->initialize_shared_locs(
2103 2112 (relocInfo*)locs_buf, sizeof(locs_buf) / sizeof(relocInfo));
2104 2113 MacroAssembler _masm(&buffer);
2105 2114
2106 2115 // Generate the compiled-to-native wrapper code
2107 2116 nm = SharedRuntime::generate_dtrace_nmethod(&_masm, method);
2108 2117 }
2109 2118 }
2110 2119 return nm;
2111 2120 }
2112 2121
2113 2122 // the dtrace method needs to convert java lang string to utf8 string.
2114 2123 void SharedRuntime::get_utf(oopDesc* src, address dst) {
2115 2124 typeArrayOop jlsValue = java_lang_String::value(src);
2116 2125 int jlsOffset = java_lang_String::offset(src);
2117 2126 int jlsLen = java_lang_String::length(src);
2118 2127 jchar* jlsPos = (jlsLen == 0) ? NULL :
2119 2128 jlsValue->char_at_addr(jlsOffset);
2120 2129 (void) UNICODE::as_utf8(jlsPos, jlsLen, (char *)dst, max_dtrace_string_size);
2121 2130 }
2122 2131 #endif // ndef HAVE_DTRACE_H
2123 2132
2124 2133 // -------------------------------------------------------------------------
2125 2134 // Java-Java calling convention
2126 2135 // (what you use when Java calls Java)
2127 2136
2128 2137 //------------------------------name_for_receiver----------------------------------
2129 2138 // For a given signature, return the VMReg for parameter 0.
2130 2139 VMReg SharedRuntime::name_for_receiver() {
2131 2140 VMRegPair regs;
2132 2141 BasicType sig_bt = T_OBJECT;
2133 2142 (void) java_calling_convention(&sig_bt, ®s, 1, true);
2134 2143 // Return argument 0 register. In the LP64 build pointers
2135 2144 // take 2 registers, but the VM wants only the 'main' name.
2136 2145 return regs.first();
2137 2146 }
2138 2147
2139 2148 VMRegPair *SharedRuntime::find_callee_arguments(symbolOop sig, bool is_static, int* arg_size) {
2140 2149 // This method is returning a data structure allocating as a
2141 2150 // ResourceObject, so do not put any ResourceMarks in here.
2142 2151 char *s = sig->as_C_string();
2143 2152 int len = (int)strlen(s);
2144 2153 *s++; len--; // Skip opening paren
2145 2154 char *t = s+len;
2146 2155 while( *(--t) != ')' ) ; // Find close paren
2147 2156
2148 2157 BasicType *sig_bt = NEW_RESOURCE_ARRAY( BasicType, 256 );
2149 2158 VMRegPair *regs = NEW_RESOURCE_ARRAY( VMRegPair, 256 );
2150 2159 int cnt = 0;
2151 2160 if (!is_static) {
2152 2161 sig_bt[cnt++] = T_OBJECT; // Receiver is argument 0; not in signature
2153 2162 }
2154 2163
2155 2164 while( s < t ) {
2156 2165 switch( *s++ ) { // Switch on signature character
2157 2166 case 'B': sig_bt[cnt++] = T_BYTE; break;
2158 2167 case 'C': sig_bt[cnt++] = T_CHAR; break;
2159 2168 case 'D': sig_bt[cnt++] = T_DOUBLE; sig_bt[cnt++] = T_VOID; break;
2160 2169 case 'F': sig_bt[cnt++] = T_FLOAT; break;
2161 2170 case 'I': sig_bt[cnt++] = T_INT; break;
2162 2171 case 'J': sig_bt[cnt++] = T_LONG; sig_bt[cnt++] = T_VOID; break;
2163 2172 case 'S': sig_bt[cnt++] = T_SHORT; break;
2164 2173 case 'Z': sig_bt[cnt++] = T_BOOLEAN; break;
2165 2174 case 'V': sig_bt[cnt++] = T_VOID; break;
2166 2175 case 'L': // Oop
2167 2176 while( *s++ != ';' ) ; // Skip signature
2168 2177 sig_bt[cnt++] = T_OBJECT;
2169 2178 break;
2170 2179 case '[': { // Array
2171 2180 do { // Skip optional size
2172 2181 while( *s >= '0' && *s <= '9' ) s++;
2173 2182 } while( *s++ == '[' ); // Nested arrays?
2174 2183 // Skip element type
2175 2184 if( s[-1] == 'L' )
2176 2185 while( *s++ != ';' ) ; // Skip signature
2177 2186 sig_bt[cnt++] = T_ARRAY;
2178 2187 break;
2179 2188 }
2180 2189 default : ShouldNotReachHere();
2181 2190 }
2182 2191 }
2183 2192 assert( cnt < 256, "grow table size" );
2184 2193
2185 2194 int comp_args_on_stack;
2186 2195 comp_args_on_stack = java_calling_convention(sig_bt, regs, cnt, true);
2187 2196
2188 2197 // the calling convention doesn't count out_preserve_stack_slots so
2189 2198 // we must add that in to get "true" stack offsets.
2190 2199
2191 2200 if (comp_args_on_stack) {
2192 2201 for (int i = 0; i < cnt; i++) {
2193 2202 VMReg reg1 = regs[i].first();
2194 2203 if( reg1->is_stack()) {
2195 2204 // Yuck
2196 2205 reg1 = reg1->bias(out_preserve_stack_slots());
2197 2206 }
2198 2207 VMReg reg2 = regs[i].second();
2199 2208 if( reg2->is_stack()) {
2200 2209 // Yuck
2201 2210 reg2 = reg2->bias(out_preserve_stack_slots());
2202 2211 }
2203 2212 regs[i].set_pair(reg2, reg1);
2204 2213 }
2205 2214 }
2206 2215
2207 2216 // results
2208 2217 *arg_size = cnt;
2209 2218 return regs;
2210 2219 }
2211 2220
2212 2221 // OSR Migration Code
2213 2222 //
2214 2223 // This code is used convert interpreter frames into compiled frames. It is
2215 2224 // called from very start of a compiled OSR nmethod. A temp array is
2216 2225 // allocated to hold the interesting bits of the interpreter frame. All
2217 2226 // active locks are inflated to allow them to move. The displaced headers and
2218 2227 // active interpeter locals are copied into the temp buffer. Then we return
2219 2228 // back to the compiled code. The compiled code then pops the current
2220 2229 // interpreter frame off the stack and pushes a new compiled frame. Then it
2221 2230 // copies the interpreter locals and displaced headers where it wants.
2222 2231 // Finally it calls back to free the temp buffer.
2223 2232 //
2224 2233 // All of this is done NOT at any Safepoint, nor is any safepoint or GC allowed.
2225 2234
2226 2235 JRT_LEAF(intptr_t*, SharedRuntime::OSR_migration_begin( JavaThread *thread) )
2227 2236
2228 2237 #ifdef IA64
2229 2238 ShouldNotReachHere(); // NYI
2230 2239 #endif /* IA64 */
2231 2240
2232 2241 //
2233 2242 // This code is dependent on the memory layout of the interpreter local
2234 2243 // array and the monitors. On all of our platforms the layout is identical
2235 2244 // so this code is shared. If some platform lays the their arrays out
2236 2245 // differently then this code could move to platform specific code or
2237 2246 // the code here could be modified to copy items one at a time using
2238 2247 // frame accessor methods and be platform independent.
2239 2248
2240 2249 frame fr = thread->last_frame();
2241 2250 assert( fr.is_interpreted_frame(), "" );
2242 2251 assert( fr.interpreter_frame_expression_stack_size()==0, "only handle empty stacks" );
2243 2252
2244 2253 // Figure out how many monitors are active.
2245 2254 int active_monitor_count = 0;
2246 2255 for( BasicObjectLock *kptr = fr.interpreter_frame_monitor_end();
2247 2256 kptr < fr.interpreter_frame_monitor_begin();
2248 2257 kptr = fr.next_monitor_in_interpreter_frame(kptr) ) {
2249 2258 if( kptr->obj() != NULL ) active_monitor_count++;
2250 2259 }
2251 2260
2252 2261 // QQQ we could place number of active monitors in the array so that compiled code
2253 2262 // could double check it.
2254 2263
2255 2264 methodOop moop = fr.interpreter_frame_method();
2256 2265 int max_locals = moop->max_locals();
2257 2266 // Allocate temp buffer, 1 word per local & 2 per active monitor
2258 2267 int buf_size_words = max_locals + active_monitor_count*2;
2259 2268 intptr_t *buf = NEW_C_HEAP_ARRAY(intptr_t,buf_size_words);
2260 2269
2261 2270 // Copy the locals. Order is preserved so that loading of longs works.
2262 2271 // Since there's no GC I can copy the oops blindly.
2263 2272 assert( sizeof(HeapWord)==sizeof(intptr_t), "fix this code");
2264 2273 if (TaggedStackInterpreter) {
2265 2274 for (int i = 0; i < max_locals; i++) {
2266 2275 // copy only each local separately to the buffer avoiding the tag
2267 2276 buf[i] = *fr.interpreter_frame_local_at(max_locals-i-1);
2268 2277 }
2269 2278 } else {
2270 2279 Copy::disjoint_words(
2271 2280 (HeapWord*)fr.interpreter_frame_local_at(max_locals-1),
2272 2281 (HeapWord*)&buf[0],
2273 2282 max_locals);
2274 2283 }
2275 2284
2276 2285 // Inflate locks. Copy the displaced headers. Be careful, there can be holes.
2277 2286 int i = max_locals;
2278 2287 for( BasicObjectLock *kptr2 = fr.interpreter_frame_monitor_end();
2279 2288 kptr2 < fr.interpreter_frame_monitor_begin();
2280 2289 kptr2 = fr.next_monitor_in_interpreter_frame(kptr2) ) {
2281 2290 if( kptr2->obj() != NULL) { // Avoid 'holes' in the monitor array
2282 2291 BasicLock *lock = kptr2->lock();
2283 2292 // Inflate so the displaced header becomes position-independent
2284 2293 if (lock->displaced_header()->is_unlocked())
2285 2294 ObjectSynchronizer::inflate_helper(kptr2->obj());
2286 2295 // Now the displaced header is free to move
2287 2296 buf[i++] = (intptr_t)lock->displaced_header();
2288 2297 buf[i++] = (intptr_t)kptr2->obj();
2289 2298 }
2290 2299 }
2291 2300 assert( i - max_locals == active_monitor_count*2, "found the expected number of monitors" );
2292 2301
2293 2302 return buf;
2294 2303 JRT_END
2295 2304
2296 2305 JRT_LEAF(void, SharedRuntime::OSR_migration_end( intptr_t* buf) )
2297 2306 FREE_C_HEAP_ARRAY(intptr_t,buf);
2298 2307 JRT_END
2299 2308
2300 2309 #ifndef PRODUCT
2301 2310 bool AdapterHandlerLibrary::contains(CodeBlob* b) {
2302 2311
2303 2312 if (_handlers == NULL) return false;
2304 2313
2305 2314 for (int i = 0 ; i < _handlers->length() ; i++) {
2306 2315 AdapterHandlerEntry* a = get_entry(i);
2307 2316 if ( a != NULL && b == CodeCache::find_blob(a->get_i2c_entry()) ) return true;
2308 2317 }
2309 2318 return false;
2310 2319 }
2311 2320
2312 2321 void AdapterHandlerLibrary::print_handler(CodeBlob* b) {
2313 2322
2314 2323 for (int i = 0 ; i < _handlers->length() ; i++) {
2315 2324 AdapterHandlerEntry* a = get_entry(i);
2316 2325 if ( a != NULL && b == CodeCache::find_blob(a->get_i2c_entry()) ) {
2317 2326 tty->print("Adapter for signature: ");
2318 2327 // Fingerprinter::print(_fingerprints->at(i));
2319 2328 tty->print("0x%" FORMAT64_MODIFIER "x", _fingerprints->at(i));
2320 2329 tty->print_cr(" i2c: " INTPTR_FORMAT " c2i: " INTPTR_FORMAT " c2iUV: " INTPTR_FORMAT,
2321 2330 a->get_i2c_entry(), a->get_c2i_entry(), a->get_c2i_unverified_entry());
2322 2331
2323 2332 return;
2324 2333 }
2325 2334 }
2326 2335 assert(false, "Should have found handler");
2327 2336 }
2328 2337 #endif /* PRODUCT */
|
↓ open down ↓ |
1283 lines elided |
↑ open up ↑ |
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX