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