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