Print this page
| Split |
Close |
| Expand all |
| Collapse all |
--- old/src/share/vm/c1/c1_Runtime1.cpp
+++ new/src/share/vm/c1/c1_Runtime1.cpp
1 1 /*
2 2 * Copyright (c) 1999, 2011, Oracle and/or its affiliates. All rights reserved.
3 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 4 *
5 5 * This code is free software; you can redistribute it and/or modify it
6 6 * under the terms of the GNU General Public License version 2 only, as
7 7 * published by the Free Software Foundation.
8 8 *
9 9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 12 * version 2 for more details (a copy is included in the LICENSE file that
13 13 * accompanied this code).
14 14 *
15 15 * You should have received a copy of the GNU General Public License version
16 16 * 2 along with this work; if not, write to the Free Software Foundation,
17 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 18 *
19 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 20 * or visit www.oracle.com if you need additional information or have any
21 21 * questions.
22 22 *
23 23 */
24 24
25 25 #include "precompiled.hpp"
26 26 #include "asm/codeBuffer.hpp"
27 27 #include "c1/c1_CodeStubs.hpp"
28 28 #include "c1/c1_Defs.hpp"
29 29 #include "c1/c1_FrameMap.hpp"
30 30 #include "c1/c1_LIRAssembler.hpp"
31 31 #include "c1/c1_MacroAssembler.hpp"
32 32 #include "c1/c1_Runtime1.hpp"
33 33 #include "classfile/systemDictionary.hpp"
34 34 #include "classfile/vmSymbols.hpp"
35 35 #include "code/codeBlob.hpp"
36 36 #include "code/compiledIC.hpp"
37 37 #include "code/pcDesc.hpp"
38 38 #include "code/scopeDesc.hpp"
39 39 #include "code/vtableStubs.hpp"
40 40 #include "compiler/disassembler.hpp"
41 41 #include "gc_interface/collectedHeap.hpp"
42 42 #include "interpreter/bytecode.hpp"
43 43 #include "interpreter/interpreter.hpp"
44 44 #include "memory/allocation.inline.hpp"
45 45 #include "memory/barrierSet.hpp"
46 46 #include "memory/oopFactory.hpp"
47 47 #include "memory/resourceArea.hpp"
48 48 #include "oops/objArrayKlass.hpp"
49 49 #include "oops/oop.inline.hpp"
50 50 #include "runtime/biasedLocking.hpp"
51 51 #include "runtime/compilationPolicy.hpp"
52 52 #include "runtime/interfaceSupport.hpp"
53 53 #include "runtime/javaCalls.hpp"
54 54 #include "runtime/sharedRuntime.hpp"
55 55 #include "runtime/threadCritical.hpp"
56 56 #include "runtime/vframe.hpp"
57 57 #include "runtime/vframeArray.hpp"
58 58 #include "utilities/copy.hpp"
59 59 #include "utilities/events.hpp"
60 60
61 61
62 62 // Implementation of StubAssembler
63 63
64 64 StubAssembler::StubAssembler(CodeBuffer* code, const char * name, int stub_id) : C1_MacroAssembler(code) {
65 65 _name = name;
66 66 _must_gc_arguments = false;
67 67 _frame_size = no_frame_size;
68 68 _num_rt_args = 0;
69 69 _stub_id = stub_id;
70 70 }
71 71
72 72
73 73 void StubAssembler::set_info(const char* name, bool must_gc_arguments) {
74 74 _name = name;
75 75 _must_gc_arguments = must_gc_arguments;
76 76 }
77 77
78 78
79 79 void StubAssembler::set_frame_size(int size) {
80 80 if (_frame_size == no_frame_size) {
81 81 _frame_size = size;
82 82 }
83 83 assert(_frame_size == size, "can't change the frame size");
84 84 }
85 85
86 86
87 87 void StubAssembler::set_num_rt_args(int args) {
88 88 if (_num_rt_args == 0) {
89 89 _num_rt_args = args;
90 90 }
91 91 assert(_num_rt_args == args, "can't change the number of args");
92 92 }
93 93
94 94 // Implementation of Runtime1
95 95
96 96 CodeBlob* Runtime1::_blobs[Runtime1::number_of_ids];
97 97 const char *Runtime1::_blob_names[] = {
98 98 RUNTIME1_STUBS(STUB_NAME, LAST_STUB_NAME)
99 99 };
100 100
101 101 #ifndef PRODUCT
102 102 // statistics
103 103 int Runtime1::_generic_arraycopy_cnt = 0;
104 104 int Runtime1::_primitive_arraycopy_cnt = 0;
105 105 int Runtime1::_oop_arraycopy_cnt = 0;
106 106 int Runtime1::_generic_arraycopystub_cnt = 0;
107 107 int Runtime1::_arraycopy_slowcase_cnt = 0;
108 108 int Runtime1::_arraycopy_checkcast_cnt = 0;
109 109 int Runtime1::_arraycopy_checkcast_attempt_cnt = 0;
110 110 int Runtime1::_new_type_array_slowcase_cnt = 0;
111 111 int Runtime1::_new_object_array_slowcase_cnt = 0;
112 112 int Runtime1::_new_instance_slowcase_cnt = 0;
113 113 int Runtime1::_new_multi_array_slowcase_cnt = 0;
114 114 int Runtime1::_monitorenter_slowcase_cnt = 0;
115 115 int Runtime1::_monitorexit_slowcase_cnt = 0;
116 116 int Runtime1::_patch_code_slowcase_cnt = 0;
117 117 int Runtime1::_throw_range_check_exception_count = 0;
118 118 int Runtime1::_throw_index_exception_count = 0;
119 119 int Runtime1::_throw_div0_exception_count = 0;
120 120 int Runtime1::_throw_null_pointer_exception_count = 0;
121 121 int Runtime1::_throw_class_cast_exception_count = 0;
122 122 int Runtime1::_throw_incompatible_class_change_error_count = 0;
123 123 int Runtime1::_throw_array_store_exception_count = 0;
124 124 int Runtime1::_throw_count = 0;
125 125
126 126 static int _byte_arraycopy_cnt = 0;
127 127 static int _short_arraycopy_cnt = 0;
128 128 static int _int_arraycopy_cnt = 0;
129 129 static int _long_arraycopy_cnt = 0;
130 130 static int _oop_arraycopy_cnt = 0;
131 131
132 132 address Runtime1::arraycopy_count_address(BasicType type) {
133 133 switch (type) {
134 134 case T_BOOLEAN:
135 135 case T_BYTE: return (address)&_byte_arraycopy_cnt;
136 136 case T_CHAR:
137 137 case T_SHORT: return (address)&_short_arraycopy_cnt;
138 138 case T_FLOAT:
139 139 case T_INT: return (address)&_int_arraycopy_cnt;
140 140 case T_DOUBLE:
141 141 case T_LONG: return (address)&_long_arraycopy_cnt;
142 142 case T_ARRAY:
143 143 case T_OBJECT: return (address)&_oop_arraycopy_cnt;
144 144 default:
145 145 ShouldNotReachHere();
146 146 return NULL;
147 147 }
148 148 }
149 149
150 150
151 151 #endif
152 152
153 153 // Simple helper to see if the caller of a runtime stub which
154 154 // entered the VM has been deoptimized
155 155
156 156 static bool caller_is_deopted() {
157 157 JavaThread* thread = JavaThread::current();
158 158 RegisterMap reg_map(thread, false);
159 159 frame runtime_frame = thread->last_frame();
160 160 frame caller_frame = runtime_frame.sender(®_map);
161 161 assert(caller_frame.is_compiled_frame(), "must be compiled");
162 162 return caller_frame.is_deoptimized_frame();
163 163 }
164 164
165 165 // Stress deoptimization
166 166 static void deopt_caller() {
167 167 if ( !caller_is_deopted()) {
168 168 JavaThread* thread = JavaThread::current();
169 169 RegisterMap reg_map(thread, false);
170 170 frame runtime_frame = thread->last_frame();
171 171 frame caller_frame = runtime_frame.sender(®_map);
172 172 Deoptimization::deoptimize_frame(thread, caller_frame.id());
173 173 assert(caller_is_deopted(), "Must be deoptimized");
174 174 }
175 175 }
176 176
177 177
178 178 void Runtime1::generate_blob_for(BufferBlob* buffer_blob, StubID id) {
179 179 assert(0 <= id && id < number_of_ids, "illegal stub id");
180 180 ResourceMark rm;
181 181 // create code buffer for code storage
182 182 CodeBuffer code(buffer_blob);
183 183
184 184 Compilation::setup_code_buffer(&code, 0);
185 185
186 186 // create assembler for code generation
187 187 StubAssembler* sasm = new StubAssembler(&code, name_for(id), id);
188 188 // generate code for runtime stub
189 189 OopMapSet* oop_maps;
190 190 oop_maps = generate_code_for(id, sasm);
191 191 assert(oop_maps == NULL || sasm->frame_size() != no_frame_size,
192 192 "if stub has an oop map it must have a valid frame size");
193 193
194 194 #ifdef ASSERT
195 195 // Make sure that stubs that need oopmaps have them
196 196 switch (id) {
197 197 // These stubs don't need to have an oopmap
198 198 case dtrace_object_alloc_id:
199 199 case g1_pre_barrier_slow_id:
200 200 case g1_post_barrier_slow_id:
201 201 case slow_subtype_check_id:
202 202 case fpu2long_stub_id:
203 203 case unwind_exception_id:
204 204 case counter_overflow_id:
205 205 #if defined(SPARC) || defined(PPC)
206 206 case handle_exception_nofpu_id: // Unused on sparc
207 207 #endif
208 208 break;
209 209
210 210 // All other stubs should have oopmaps
211 211 default:
212 212 assert(oop_maps != NULL, "must have an oopmap");
213 213 }
214 214 #endif
215 215
216 216 // align so printing shows nop's instead of random code at the end (SimpleStubs are aligned)
217 217 sasm->align(BytesPerWord);
218 218 // make sure all code is in code buffer
219 219 sasm->flush();
220 220 // create blob - distinguish a few special cases
221 221 CodeBlob* blob = RuntimeStub::new_runtime_stub(name_for(id),
222 222 &code,
223 223 CodeOffsets::frame_never_safe,
224 224 sasm->frame_size(),
225 225 oop_maps,
226 226 sasm->must_gc_arguments());
227 227 // install blob
228 228 assert(blob != NULL, "blob must exist");
229 229 _blobs[id] = blob;
230 230 }
231 231
232 232
233 233 void Runtime1::initialize(BufferBlob* blob) {
234 234 // platform-dependent initialization
235 235 initialize_pd();
236 236 // generate stubs
237 237 for (int id = 0; id < number_of_ids; id++) generate_blob_for(blob, (StubID)id);
238 238 // printing
239 239 #ifndef PRODUCT
240 240 if (PrintSimpleStubs) {
241 241 ResourceMark rm;
242 242 for (int id = 0; id < number_of_ids; id++) {
243 243 _blobs[id]->print();
244 244 if (_blobs[id]->oop_maps() != NULL) {
245 245 _blobs[id]->oop_maps()->print();
246 246 }
247 247 }
248 248 }
249 249 #endif
250 250 }
251 251
252 252
253 253 CodeBlob* Runtime1::blob_for(StubID id) {
254 254 assert(0 <= id && id < number_of_ids, "illegal stub id");
255 255 return _blobs[id];
256 256 }
257 257
258 258
259 259 const char* Runtime1::name_for(StubID id) {
260 260 assert(0 <= id && id < number_of_ids, "illegal stub id");
261 261 return _blob_names[id];
262 262 }
263 263
264 264 const char* Runtime1::name_for_address(address entry) {
265 265 for (int id = 0; id < number_of_ids; id++) {
266 266 if (entry == entry_for((StubID)id)) return name_for((StubID)id);
267 267 }
268 268
269 269 #define FUNCTION_CASE(a, f) \
270 270 if ((intptr_t)a == CAST_FROM_FN_PTR(intptr_t, f)) return #f
271 271
272 272 FUNCTION_CASE(entry, os::javaTimeMillis);
273 273 FUNCTION_CASE(entry, os::javaTimeNanos);
274 274 FUNCTION_CASE(entry, SharedRuntime::OSR_migration_end);
275 275 FUNCTION_CASE(entry, SharedRuntime::d2f);
276 276 FUNCTION_CASE(entry, SharedRuntime::d2i);
277 277 FUNCTION_CASE(entry, SharedRuntime::d2l);
278 278 FUNCTION_CASE(entry, SharedRuntime::dcos);
279 279 FUNCTION_CASE(entry, SharedRuntime::dexp);
280 280 FUNCTION_CASE(entry, SharedRuntime::dlog);
281 281 FUNCTION_CASE(entry, SharedRuntime::dlog10);
282 282 FUNCTION_CASE(entry, SharedRuntime::dpow);
283 283 FUNCTION_CASE(entry, SharedRuntime::drem);
284 284 FUNCTION_CASE(entry, SharedRuntime::dsin);
285 285 FUNCTION_CASE(entry, SharedRuntime::dtan);
286 286 FUNCTION_CASE(entry, SharedRuntime::f2i);
287 287 FUNCTION_CASE(entry, SharedRuntime::f2l);
288 288 FUNCTION_CASE(entry, SharedRuntime::frem);
289 289 FUNCTION_CASE(entry, SharedRuntime::l2d);
290 290 FUNCTION_CASE(entry, SharedRuntime::l2f);
291 291 FUNCTION_CASE(entry, SharedRuntime::ldiv);
292 292 FUNCTION_CASE(entry, SharedRuntime::lmul);
293 293 FUNCTION_CASE(entry, SharedRuntime::lrem);
294 294 FUNCTION_CASE(entry, SharedRuntime::lrem);
295 295 FUNCTION_CASE(entry, SharedRuntime::dtrace_method_entry);
296 296 FUNCTION_CASE(entry, SharedRuntime::dtrace_method_exit);
297 297 FUNCTION_CASE(entry, trace_block_entry);
298 298
299 299 #undef FUNCTION_CASE
300 300
301 301 // Soft float adds more runtime names.
302 302 return pd_name_for_address(entry);
303 303 }
304 304
305 305
306 306 JRT_ENTRY(void, Runtime1::new_instance(JavaThread* thread, klassOopDesc* klass))
307 307 NOT_PRODUCT(_new_instance_slowcase_cnt++;)
308 308
309 309 assert(oop(klass)->is_klass(), "not a class");
310 310 instanceKlassHandle h(thread, klass);
311 311 h->check_valid_for_instantiation(true, CHECK);
312 312 // make sure klass is initialized
313 313 h->initialize(CHECK);
314 314 // allocate instance and return via TLS
315 315 oop obj = h->allocate_instance(CHECK);
316 316 thread->set_vm_result(obj);
317 317 JRT_END
318 318
319 319
320 320 JRT_ENTRY(void, Runtime1::new_type_array(JavaThread* thread, klassOopDesc* klass, jint length))
321 321 NOT_PRODUCT(_new_type_array_slowcase_cnt++;)
322 322 // Note: no handle for klass needed since they are not used
323 323 // anymore after new_typeArray() and no GC can happen before.
324 324 // (This may have to change if this code changes!)
325 325 assert(oop(klass)->is_klass(), "not a class");
326 326 BasicType elt_type = typeArrayKlass::cast(klass)->element_type();
327 327 oop obj = oopFactory::new_typeArray(elt_type, length, CHECK);
328 328 thread->set_vm_result(obj);
329 329 // This is pretty rare but this runtime patch is stressful to deoptimization
330 330 // if we deoptimize here so force a deopt to stress the path.
331 331 if (DeoptimizeALot) {
332 332 deopt_caller();
333 333 }
334 334
335 335 JRT_END
336 336
337 337
338 338 JRT_ENTRY(void, Runtime1::new_object_array(JavaThread* thread, klassOopDesc* array_klass, jint length))
339 339 NOT_PRODUCT(_new_object_array_slowcase_cnt++;)
340 340
341 341 // Note: no handle for klass needed since they are not used
342 342 // anymore after new_objArray() and no GC can happen before.
343 343 // (This may have to change if this code changes!)
344 344 assert(oop(array_klass)->is_klass(), "not a class");
345 345 klassOop elem_klass = objArrayKlass::cast(array_klass)->element_klass();
346 346 objArrayOop obj = oopFactory::new_objArray(elem_klass, length, CHECK);
347 347 thread->set_vm_result(obj);
348 348 // This is pretty rare but this runtime patch is stressful to deoptimization
349 349 // if we deoptimize here so force a deopt to stress the path.
350 350 if (DeoptimizeALot) {
351 351 deopt_caller();
352 352 }
353 353 JRT_END
354 354
355 355
356 356 JRT_ENTRY(void, Runtime1::new_multi_array(JavaThread* thread, klassOopDesc* klass, int rank, jint* dims))
357 357 NOT_PRODUCT(_new_multi_array_slowcase_cnt++;)
358 358
359 359 assert(oop(klass)->is_klass(), "not a class");
360 360 assert(rank >= 1, "rank must be nonzero");
361 361 oop obj = arrayKlass::cast(klass)->multi_allocate(rank, dims, CHECK);
362 362 thread->set_vm_result(obj);
363 363 JRT_END
364 364
365 365
366 366 JRT_ENTRY(void, Runtime1::unimplemented_entry(JavaThread* thread, StubID id))
367 367 tty->print_cr("Runtime1::entry_for(%d) returned unimplemented entry point", id);
368 368 JRT_END
369 369
370 370
371 371 JRT_ENTRY(void, Runtime1::throw_array_store_exception(JavaThread* thread, oopDesc* obj))
372 372 ResourceMark rm(thread);
373 373 const char* klass_name = Klass::cast(obj->klass())->external_name();
374 374 SharedRuntime::throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_ArrayStoreException(), klass_name);
375 375 JRT_END
376 376
377 377
378 378 // counter_overflow() is called from within C1-compiled methods. The enclosing method is the method
379 379 // associated with the top activation record. The inlinee (that is possibly included in the enclosing
380 380 // method) method oop is passed as an argument. In order to do that it is embedded in the code as
381 381 // a constant.
382 382 static nmethod* counter_overflow_helper(JavaThread* THREAD, int branch_bci, methodOopDesc* m) {
383 383 nmethod* osr_nm = NULL;
384 384 methodHandle method(THREAD, m);
385 385
386 386 RegisterMap map(THREAD, false);
387 387 frame fr = THREAD->last_frame().sender(&map);
388 388 nmethod* nm = (nmethod*) fr.cb();
389 389 assert(nm!= NULL && nm->is_nmethod(), "Sanity check");
390 390 methodHandle enclosing_method(THREAD, nm->method());
391 391
392 392 CompLevel level = (CompLevel)nm->comp_level();
393 393 int bci = InvocationEntryBci;
394 394 if (branch_bci != InvocationEntryBci) {
395 395 // Compute desination bci
396 396 address pc = method()->code_base() + branch_bci;
397 397 Bytecodes::Code branch = Bytecodes::code_at(method(), pc);
398 398 int offset = 0;
399 399 switch (branch) {
400 400 case Bytecodes::_if_icmplt: case Bytecodes::_iflt:
401 401 case Bytecodes::_if_icmpgt: case Bytecodes::_ifgt:
402 402 case Bytecodes::_if_icmple: case Bytecodes::_ifle:
403 403 case Bytecodes::_if_icmpge: case Bytecodes::_ifge:
404 404 case Bytecodes::_if_icmpeq: case Bytecodes::_if_acmpeq: case Bytecodes::_ifeq:
405 405 case Bytecodes::_if_icmpne: case Bytecodes::_if_acmpne: case Bytecodes::_ifne:
406 406 case Bytecodes::_ifnull: case Bytecodes::_ifnonnull: case Bytecodes::_goto:
407 407 offset = (int16_t)Bytes::get_Java_u2(pc + 1);
408 408 break;
409 409 case Bytecodes::_goto_w:
410 410 offset = Bytes::get_Java_u4(pc + 1);
411 411 break;
412 412 default: ;
413 413 }
414 414 bci = branch_bci + offset;
415 415 }
416 416
417 417 osr_nm = CompilationPolicy::policy()->event(enclosing_method, method, branch_bci, bci, level, nm, THREAD);
418 418 return osr_nm;
419 419 }
420 420
421 421 JRT_BLOCK_ENTRY(address, Runtime1::counter_overflow(JavaThread* thread, int bci, methodOopDesc* method))
422 422 nmethod* osr_nm;
423 423 JRT_BLOCK
424 424 osr_nm = counter_overflow_helper(thread, bci, method);
425 425 if (osr_nm != NULL) {
426 426 RegisterMap map(thread, false);
427 427 frame fr = thread->last_frame().sender(&map);
428 428 Deoptimization::deoptimize_frame(thread, fr.id());
429 429 }
430 430 JRT_BLOCK_END
431 431 return NULL;
432 432 JRT_END
433 433
434 434 extern void vm_exit(int code);
435 435
436 436 // Enter this method from compiled code handler below. This is where we transition
437 437 // to VM mode. This is done as a helper routine so that the method called directly
438 438 // from compiled code does not have to transition to VM. This allows the entry
439 439 // method to see if the nmethod that we have just looked up a handler for has
440 440 // been deoptimized while we were in the vm. This simplifies the assembly code
441 441 // cpu directories.
442 442 //
443 443 // We are entering here from exception stub (via the entry method below)
444 444 // If there is a compiled exception handler in this method, we will continue there;
445 445 // otherwise we will unwind the stack and continue at the caller of top frame method
446 446 // Note: we enter in Java using a special JRT wrapper. This wrapper allows us to
447 447 // control the area where we can allow a safepoint. After we exit the safepoint area we can
448 448 // check to see if the handler we are going to return is now in a nmethod that has
449 449 // been deoptimized. If that is the case we return the deopt blob
450 450 // unpack_with_exception entry instead. This makes life for the exception blob easier
451 451 // because making that same check and diverting is painful from assembly language.
452 452 JRT_ENTRY_NO_ASYNC(static address, exception_handler_for_pc_helper(JavaThread* thread, oopDesc* ex, address pc, nmethod*& nm))
453 453 // Reset method handle flag.
454 454 thread->set_is_method_handle_return(false);
455 455
456 456 Handle exception(thread, ex);
457 457 nm = CodeCache::find_nmethod(pc);
458 458 assert(nm != NULL, "this is not an nmethod");
459 459 // Adjust the pc as needed/
460 460 if (nm->is_deopt_pc(pc)) {
461 461 RegisterMap map(thread, false);
462 462 frame exception_frame = thread->last_frame().sender(&map);
463 463 // if the frame isn't deopted then pc must not correspond to the caller of last_frame
464 464 assert(exception_frame.is_deoptimized_frame(), "must be deopted");
465 465 pc = exception_frame.pc();
466 466 }
467 467 #ifdef ASSERT
468 468 assert(exception.not_null(), "NULL exceptions should be handled by throw_exception");
469 469 assert(exception->is_oop(), "just checking");
470 470 // Check that exception is a subclass of Throwable, otherwise we have a VerifyError
471 471 if (!(exception->is_a(SystemDictionary::Throwable_klass()))) {
472 472 if (ExitVMOnVerifyError) vm_exit(-1);
473 473 ShouldNotReachHere();
474 474 }
475 475 #endif
476 476
477 477 // Check the stack guard pages and reenable them if necessary and there is
478 478 // enough space on the stack to do so. Use fast exceptions only if the guard
479 479 // pages are enabled.
480 480 bool guard_pages_enabled = thread->stack_yellow_zone_enabled();
481 481 if (!guard_pages_enabled) guard_pages_enabled = thread->reguard_stack();
482 482
483 483 if (JvmtiExport::can_post_on_exceptions()) {
484 484 // To ensure correct notification of exception catches and throws
485 485 // we have to deoptimize here. If we attempted to notify the
486 486 // catches and throws during this exception lookup it's possible
487 487 // we could deoptimize on the way out of the VM and end back in
488 488 // the interpreter at the throw site. This would result in double
489 489 // notifications since the interpreter would also notify about
490 490 // these same catches and throws as it unwound the frame.
491 491
492 492 RegisterMap reg_map(thread);
493 493 frame stub_frame = thread->last_frame();
494 494 frame caller_frame = stub_frame.sender(®_map);
495 495
496 496 // We don't really want to deoptimize the nmethod itself since we
497 497 // can actually continue in the exception handler ourselves but I
498 498 // don't see an easy way to have the desired effect.
499 499 Deoptimization::deoptimize_frame(thread, caller_frame.id());
500 500 assert(caller_is_deopted(), "Must be deoptimized");
501 501
502 502 return SharedRuntime::deopt_blob()->unpack_with_exception_in_tls();
503 503 }
504 504
505 505 // ExceptionCache is used only for exceptions at call sites and not for implicit exceptions
506 506 if (guard_pages_enabled) {
507 507 address fast_continuation = nm->handler_for_exception_and_pc(exception, pc);
508 508 if (fast_continuation != NULL) {
509 509 // Set flag if return address is a method handle call site.
510 510 thread->set_is_method_handle_return(nm->is_method_handle_return(pc));
511 511 return fast_continuation;
512 512 }
513 513 }
514 514
515 515 // If the stack guard pages are enabled, check whether there is a handler in
516 516 // the current method. Otherwise (guard pages disabled), force an unwind and
517 517 // skip the exception cache update (i.e., just leave continuation==NULL).
518 518 address continuation = NULL;
519 519 if (guard_pages_enabled) {
520 520
521 521 // New exception handling mechanism can support inlined methods
522 522 // with exception handlers since the mappings are from PC to PC
523 523
524 524 // debugging support
525 525 // tracing
526 526 if (TraceExceptions) {
527 527 ttyLocker ttyl;
528 528 ResourceMark rm;
529 529 tty->print_cr("Exception <%s> (0x%x) thrown in compiled method <%s> at PC " PTR_FORMAT " for thread 0x%x",
530 530 exception->print_value_string(), (address)exception(), nm->method()->print_value_string(), pc, thread);
531 531 }
532 532 // for AbortVMOnException flag
533 533 NOT_PRODUCT(Exceptions::debug_check_abort(exception));
534 534
535 535 // Clear out the exception oop and pc since looking up an
536 536 // exception handler can cause class loading, which might throw an
537 537 // exception and those fields are expected to be clear during
538 538 // normal bytecode execution.
539 539 thread->set_exception_oop(NULL);
540 540 thread->set_exception_pc(NULL);
541 541
542 542 continuation = SharedRuntime::compute_compiled_exc_handler(nm, pc, exception, false, false);
543 543 // If an exception was thrown during exception dispatch, the exception oop may have changed
544 544 thread->set_exception_oop(exception());
545 545 thread->set_exception_pc(pc);
546 546
547 547 // the exception cache is used only by non-implicit exceptions
548 548 if (continuation != NULL) {
549 549 nm->add_handler_for_exception_and_pc(exception, pc, continuation);
550 550 }
551 551 }
552 552
553 553 thread->set_vm_result(exception());
554 554 // Set flag if return address is a method handle call site.
555 555 thread->set_is_method_handle_return(nm->is_method_handle_return(pc));
556 556
557 557 if (TraceExceptions) {
558 558 ttyLocker ttyl;
559 559 ResourceMark rm;
560 560 tty->print_cr("Thread " PTR_FORMAT " continuing at PC " PTR_FORMAT " for exception thrown at PC " PTR_FORMAT,
561 561 thread, continuation, pc);
562 562 }
563 563
564 564 return continuation;
565 565 JRT_END
566 566
567 567 // Enter this method from compiled code only if there is a Java exception handler
568 568 // in the method handling the exception.
569 569 // We are entering here from exception stub. We don't do a normal VM transition here.
570 570 // We do it in a helper. This is so we can check to see if the nmethod we have just
571 571 // searched for an exception handler has been deoptimized in the meantime.
572 572 address Runtime1::exception_handler_for_pc(JavaThread* thread) {
573 573 oop exception = thread->exception_oop();
574 574 address pc = thread->exception_pc();
575 575 // Still in Java mode
576 576 DEBUG_ONLY(ResetNoHandleMark rnhm);
577 577 nmethod* nm = NULL;
578 578 address continuation = NULL;
579 579 {
580 580 // Enter VM mode by calling the helper
581 581 ResetNoHandleMark rnhm;
582 582 continuation = exception_handler_for_pc_helper(thread, exception, pc, nm);
583 583 }
584 584 // Back in JAVA, use no oops DON'T safepoint
585 585
586 586 // Now check to see if the nmethod we were called from is now deoptimized.
587 587 // If so we must return to the deopt blob and deoptimize the nmethod
588 588 if (nm != NULL && caller_is_deopted()) {
589 589 continuation = SharedRuntime::deopt_blob()->unpack_with_exception_in_tls();
590 590 }
591 591
592 592 assert(continuation != NULL, "no handler found");
593 593 return continuation;
594 594 }
595 595
596 596
597 597 JRT_ENTRY(void, Runtime1::throw_range_check_exception(JavaThread* thread, int index))
598 598 NOT_PRODUCT(_throw_range_check_exception_count++;)
599 599 Events::log("throw_range_check");
600 600 char message[jintAsStringSize];
601 601 sprintf(message, "%d", index);
602 602 SharedRuntime::throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_ArrayIndexOutOfBoundsException(), message);
603 603 JRT_END
604 604
605 605
606 606 JRT_ENTRY(void, Runtime1::throw_index_exception(JavaThread* thread, int index))
607 607 NOT_PRODUCT(_throw_index_exception_count++;)
608 608 Events::log("throw_index");
609 609 char message[16];
610 610 sprintf(message, "%d", index);
611 611 SharedRuntime::throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_IndexOutOfBoundsException(), message);
612 612 JRT_END
613 613
614 614
615 615 JRT_ENTRY(void, Runtime1::throw_div0_exception(JavaThread* thread))
616 616 NOT_PRODUCT(_throw_div0_exception_count++;)
617 617 SharedRuntime::throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_ArithmeticException(), "/ by zero");
618 618 JRT_END
619 619
620 620
621 621 JRT_ENTRY(void, Runtime1::throw_null_pointer_exception(JavaThread* thread))
622 622 NOT_PRODUCT(_throw_null_pointer_exception_count++;)
623 623 SharedRuntime::throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_NullPointerException());
624 624 JRT_END
625 625
626 626
627 627 JRT_ENTRY(void, Runtime1::throw_class_cast_exception(JavaThread* thread, oopDesc* object))
628 628 NOT_PRODUCT(_throw_class_cast_exception_count++;)
629 629 ResourceMark rm(thread);
630 630 char* message = SharedRuntime::generate_class_cast_message(
631 631 thread, Klass::cast(object->klass())->external_name());
632 632 SharedRuntime::throw_and_post_jvmti_exception(
633 633 thread, vmSymbols::java_lang_ClassCastException(), message);
634 634 JRT_END
635 635
636 636
637 637 JRT_ENTRY(void, Runtime1::throw_incompatible_class_change_error(JavaThread* thread))
638 638 NOT_PRODUCT(_throw_incompatible_class_change_error_count++;)
639 639 ResourceMark rm(thread);
640 640 SharedRuntime::throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_IncompatibleClassChangeError());
641 641 JRT_END
642 642
643 643
644 644 JRT_ENTRY_NO_ASYNC(void, Runtime1::monitorenter(JavaThread* thread, oopDesc* obj, BasicObjectLock* lock))
645 645 NOT_PRODUCT(_monitorenter_slowcase_cnt++;)
646 646 if (PrintBiasedLockingStatistics) {
647 647 Atomic::inc(BiasedLocking::slow_path_entry_count_addr());
648 648 }
649 649 Handle h_obj(thread, obj);
650 650 assert(h_obj()->is_oop(), "must be NULL or an object");
651 651 if (UseBiasedLocking) {
652 652 // Retry fast entry if bias is revoked to avoid unnecessary inflation
653 653 ObjectSynchronizer::fast_enter(h_obj, lock->lock(), true, CHECK);
654 654 } else {
655 655 if (UseFastLocking) {
656 656 // When using fast locking, the compiled code has already tried the fast case
657 657 assert(obj == lock->obj(), "must match");
658 658 ObjectSynchronizer::slow_enter(h_obj, lock->lock(), THREAD);
659 659 } else {
660 660 lock->set_obj(obj);
661 661 ObjectSynchronizer::fast_enter(h_obj, lock->lock(), false, THREAD);
662 662 }
663 663 }
664 664 JRT_END
665 665
666 666
667 667 JRT_LEAF(void, Runtime1::monitorexit(JavaThread* thread, BasicObjectLock* lock))
668 668 NOT_PRODUCT(_monitorexit_slowcase_cnt++;)
669 669 assert(thread == JavaThread::current(), "threads must correspond");
670 670 assert(thread->last_Java_sp(), "last_Java_sp must be set");
671 671 // monitorexit is non-blocking (leaf routine) => no exceptions can be thrown
672 672 EXCEPTION_MARK;
673 673
|
↓ open down ↓ |
673 lines elided |
↑ open up ↑ |
674 674 oop obj = lock->obj();
675 675 assert(obj->is_oop(), "must be NULL or an object");
676 676 if (UseFastLocking) {
677 677 // When using fast locking, the compiled code has already tried the fast case
678 678 ObjectSynchronizer::slow_exit(obj, lock->lock(), THREAD);
679 679 } else {
680 680 ObjectSynchronizer::fast_exit(obj, lock->lock(), THREAD);
681 681 }
682 682 JRT_END
683 683
684 +// Cf. OptoRuntime::deoptimize_caller_frame
685 +JRT_ENTRY(void, Runtime1::deoptimize(JavaThread* thread))
686 + // Called from within the owner thread, so no need for safepoint
687 + RegisterMap reg_map(thread, false);
688 + frame stub_frame = thread->last_frame();
689 + assert(stub_frame.is_runtime_frame(), "sanity check");
690 + frame caller_frame = stub_frame.sender(®_map);
691 +
692 + // We are coming from a compiled method; check this is true.
693 + assert(CodeCache::find_nmethod(caller_frame.pc()) != NULL, "sanity");
694 +
695 + // Deoptimize the caller frame.
696 + Deoptimization::deoptimize_frame(thread, caller_frame.id());
697 +
698 + // Return to the now deoptimized frame.
699 +JRT_END
700 +
684 701
685 702 static klassOop resolve_field_return_klass(methodHandle caller, int bci, TRAPS) {
686 703 Bytecode_field field_access(caller, bci);
687 704 // This can be static or non-static field access
688 705 Bytecodes::Code code = field_access.code();
689 706
690 707 // We must load class, initialize class and resolvethe field
691 708 FieldAccessInfo result; // initialize class if needed
692 709 constantPoolHandle constants(THREAD, caller->constants());
693 710 LinkResolver::resolve_field(result, constants, field_access.index(), Bytecodes::java_code(code), false, CHECK_NULL);
694 711 return result.klass()();
695 712 }
696 713
697 714
698 715 //
699 716 // This routine patches sites where a class wasn't loaded or
700 717 // initialized at the time the code was generated. It handles
701 718 // references to classes, fields and forcing of initialization. Most
702 719 // of the cases are straightforward and involving simply forcing
703 720 // resolution of a class, rewriting the instruction stream with the
704 721 // needed constant and replacing the call in this function with the
705 722 // patched code. The case for static field is more complicated since
706 723 // the thread which is in the process of initializing a class can
707 724 // access it's static fields but other threads can't so the code
708 725 // either has to deoptimize when this case is detected or execute a
709 726 // check that the current thread is the initializing thread. The
710 727 // current
711 728 //
712 729 // Patches basically look like this:
713 730 //
714 731 //
715 732 // patch_site: jmp patch stub ;; will be patched
716 733 // continue: ...
717 734 // ...
718 735 // ...
719 736 // ...
720 737 //
721 738 // They have a stub which looks like this:
722 739 //
723 740 // ;; patch body
724 741 // movl <const>, reg (for class constants)
725 742 // <or> movl [reg1 + <const>], reg (for field offsets)
726 743 // <or> movl reg, [reg1 + <const>] (for field offsets)
727 744 // <being_init offset> <bytes to copy> <bytes to skip>
728 745 // patch_stub: call Runtime1::patch_code (through a runtime stub)
729 746 // jmp patch_site
730 747 //
731 748 //
732 749 // A normal patch is done by rewriting the patch body, usually a move,
733 750 // and then copying it into place over top of the jmp instruction
734 751 // being careful to flush caches and doing it in an MP-safe way. The
735 752 // constants following the patch body are used to find various pieces
736 753 // of the patch relative to the call site for Runtime1::patch_code.
737 754 // The case for getstatic and putstatic is more complicated because
738 755 // getstatic and putstatic have special semantics when executing while
739 756 // the class is being initialized. getstatic/putstatic on a class
740 757 // which is being_initialized may be executed by the initializing
741 758 // thread but other threads have to block when they execute it. This
742 759 // is accomplished in compiled code by executing a test of the current
743 760 // thread against the initializing thread of the class. It's emitted
744 761 // as boilerplate in their stub which allows the patched code to be
745 762 // executed before it's copied back into the main body of the nmethod.
746 763 //
747 764 // being_init: get_thread(<tmp reg>
748 765 // cmpl [reg1 + <init_thread_offset>], <tmp reg>
749 766 // jne patch_stub
750 767 // movl [reg1 + <const>], reg (for field offsets) <or>
751 768 // movl reg, [reg1 + <const>] (for field offsets)
752 769 // jmp continue
753 770 // <being_init offset> <bytes to copy> <bytes to skip>
754 771 // patch_stub: jmp Runtim1::patch_code (through a runtime stub)
755 772 // jmp patch_site
756 773 //
757 774 // If the class is being initialized the patch body is rewritten and
758 775 // the patch site is rewritten to jump to being_init, instead of
759 776 // patch_stub. Whenever this code is executed it checks the current
760 777 // thread against the intializing thread so other threads will enter
761 778 // the runtime and end up blocked waiting the class to finish
762 779 // initializing inside the calls to resolve_field below. The
763 780 // initializing class will continue on it's way. Once the class is
764 781 // fully_initialized, the intializing_thread of the class becomes
765 782 // NULL, so the next thread to execute this code will fail the test,
766 783 // call into patch_code and complete the patching process by copying
767 784 // the patch body back into the main part of the nmethod and resume
768 785 // executing.
769 786 //
770 787 //
771 788
772 789 JRT_ENTRY(void, Runtime1::patch_code(JavaThread* thread, Runtime1::StubID stub_id ))
773 790 NOT_PRODUCT(_patch_code_slowcase_cnt++;)
774 791
775 792 ResourceMark rm(thread);
776 793 RegisterMap reg_map(thread, false);
777 794 frame runtime_frame = thread->last_frame();
778 795 frame caller_frame = runtime_frame.sender(®_map);
779 796
780 797 // last java frame on stack
781 798 vframeStream vfst(thread, true);
782 799 assert(!vfst.at_end(), "Java frame must exist");
783 800
784 801 methodHandle caller_method(THREAD, vfst.method());
785 802 // Note that caller_method->code() may not be same as caller_code because of OSR's
786 803 // Note also that in the presence of inlining it is not guaranteed
787 804 // that caller_method() == caller_code->method()
788 805
789 806
790 807 int bci = vfst.bci();
791 808
792 809 Events::log("patch_code @ " INTPTR_FORMAT , caller_frame.pc());
793 810
794 811 Bytecodes::Code code = caller_method()->java_code_at(bci);
795 812
796 813 #ifndef PRODUCT
797 814 // this is used by assertions in the access_field_patching_id
798 815 BasicType patch_field_type = T_ILLEGAL;
799 816 #endif // PRODUCT
800 817 bool deoptimize_for_volatile = false;
801 818 int patch_field_offset = -1;
802 819 KlassHandle init_klass(THREAD, klassOop(NULL)); // klass needed by access_field_patching code
803 820 Handle load_klass(THREAD, NULL); // oop needed by load_klass_patching code
804 821 if (stub_id == Runtime1::access_field_patching_id) {
805 822
806 823 Bytecode_field field_access(caller_method, bci);
807 824 FieldAccessInfo result; // initialize class if needed
808 825 Bytecodes::Code code = field_access.code();
809 826 constantPoolHandle constants(THREAD, caller_method->constants());
810 827 LinkResolver::resolve_field(result, constants, field_access.index(), Bytecodes::java_code(code), false, CHECK);
811 828 patch_field_offset = result.field_offset();
812 829
813 830 // If we're patching a field which is volatile then at compile it
814 831 // must not have been know to be volatile, so the generated code
815 832 // isn't correct for a volatile reference. The nmethod has to be
816 833 // deoptimized so that the code can be regenerated correctly.
817 834 // This check is only needed for access_field_patching since this
818 835 // is the path for patching field offsets. load_klass is only
819 836 // used for patching references to oops which don't need special
820 837 // handling in the volatile case.
821 838 deoptimize_for_volatile = result.access_flags().is_volatile();
822 839
823 840 #ifndef PRODUCT
824 841 patch_field_type = result.field_type();
825 842 #endif
826 843 } else if (stub_id == Runtime1::load_klass_patching_id) {
827 844 oop k;
828 845 switch (code) {
829 846 case Bytecodes::_putstatic:
830 847 case Bytecodes::_getstatic:
831 848 { klassOop klass = resolve_field_return_klass(caller_method, bci, CHECK);
832 849 // Save a reference to the class that has to be checked for initialization
833 850 init_klass = KlassHandle(THREAD, klass);
834 851 k = klass->java_mirror();
835 852 }
836 853 break;
837 854 case Bytecodes::_new:
838 855 { Bytecode_new bnew(caller_method(), caller_method->bcp_from(bci));
839 856 k = caller_method->constants()->klass_at(bnew.index(), CHECK);
840 857 }
841 858 break;
842 859 case Bytecodes::_multianewarray:
843 860 { Bytecode_multianewarray mna(caller_method(), caller_method->bcp_from(bci));
844 861 k = caller_method->constants()->klass_at(mna.index(), CHECK);
845 862 }
846 863 break;
847 864 case Bytecodes::_instanceof:
848 865 { Bytecode_instanceof io(caller_method(), caller_method->bcp_from(bci));
849 866 k = caller_method->constants()->klass_at(io.index(), CHECK);
850 867 }
851 868 break;
852 869 case Bytecodes::_checkcast:
853 870 { Bytecode_checkcast cc(caller_method(), caller_method->bcp_from(bci));
854 871 k = caller_method->constants()->klass_at(cc.index(), CHECK);
855 872 }
856 873 break;
857 874 case Bytecodes::_anewarray:
858 875 { Bytecode_anewarray anew(caller_method(), caller_method->bcp_from(bci));
859 876 klassOop ek = caller_method->constants()->klass_at(anew.index(), CHECK);
860 877 k = Klass::cast(ek)->array_klass(CHECK);
861 878 }
862 879 break;
863 880 case Bytecodes::_ldc:
864 881 case Bytecodes::_ldc_w:
865 882 {
866 883 Bytecode_loadconstant cc(caller_method, bci);
867 884 k = cc.resolve_constant(CHECK);
868 885 assert(k != NULL && !k->is_klass(), "must be class mirror or other Java constant");
869 886 }
870 887 break;
871 888 default: Unimplemented();
872 889 }
873 890 // convert to handle
874 891 load_klass = Handle(THREAD, k);
875 892 } else {
876 893 ShouldNotReachHere();
877 894 }
878 895
879 896 if (deoptimize_for_volatile) {
880 897 // At compile time we assumed the field wasn't volatile but after
881 898 // loading it turns out it was volatile so we have to throw the
882 899 // compiled code out and let it be regenerated.
883 900 if (TracePatching) {
884 901 tty->print_cr("Deoptimizing for patching volatile field reference");
885 902 }
886 903 // It's possible the nmethod was invalidated in the last
887 904 // safepoint, but if it's still alive then make it not_entrant.
888 905 nmethod* nm = CodeCache::find_nmethod(caller_frame.pc());
889 906 if (nm != NULL) {
890 907 nm->make_not_entrant();
891 908 }
892 909
893 910 Deoptimization::deoptimize_frame(thread, caller_frame.id());
894 911
895 912 // Return to the now deoptimized frame.
896 913 }
897 914
898 915 // If we are patching in a non-perm oop, make sure the nmethod
899 916 // is on the right list.
900 917 if (ScavengeRootsInCode && load_klass.not_null() && load_klass->is_scavengable()) {
901 918 MutexLockerEx ml_code (CodeCache_lock, Mutex::_no_safepoint_check_flag);
902 919 nmethod* nm = CodeCache::find_nmethod(caller_frame.pc());
903 920 guarantee(nm != NULL, "only nmethods can contain non-perm oops");
904 921 if (!nm->on_scavenge_root_list())
905 922 CodeCache::add_scavenge_root_nmethod(nm);
906 923 }
907 924
908 925 // Now copy code back
909 926
910 927 {
911 928 MutexLockerEx ml_patch (Patching_lock, Mutex::_no_safepoint_check_flag);
912 929 //
913 930 // Deoptimization may have happened while we waited for the lock.
914 931 // In that case we don't bother to do any patching we just return
915 932 // and let the deopt happen
916 933 if (!caller_is_deopted()) {
917 934 NativeGeneralJump* jump = nativeGeneralJump_at(caller_frame.pc());
918 935 address instr_pc = jump->jump_destination();
919 936 NativeInstruction* ni = nativeInstruction_at(instr_pc);
920 937 if (ni->is_jump() ) {
921 938 // the jump has not been patched yet
922 939 // The jump destination is slow case and therefore not part of the stubs
923 940 // (stubs are only for StaticCalls)
924 941
925 942 // format of buffer
926 943 // ....
927 944 // instr byte 0 <-- copy_buff
928 945 // instr byte 1
929 946 // ..
930 947 // instr byte n-1
931 948 // n
932 949 // .... <-- call destination
933 950
934 951 address stub_location = caller_frame.pc() + PatchingStub::patch_info_offset();
935 952 unsigned char* byte_count = (unsigned char*) (stub_location - 1);
936 953 unsigned char* byte_skip = (unsigned char*) (stub_location - 2);
937 954 unsigned char* being_initialized_entry_offset = (unsigned char*) (stub_location - 3);
938 955 address copy_buff = stub_location - *byte_skip - *byte_count;
939 956 address being_initialized_entry = stub_location - *being_initialized_entry_offset;
940 957 if (TracePatching) {
941 958 tty->print_cr(" Patching %s at bci %d at address 0x%x (%s)", Bytecodes::name(code), bci,
942 959 instr_pc, (stub_id == Runtime1::access_field_patching_id) ? "field" : "klass");
943 960 nmethod* caller_code = CodeCache::find_nmethod(caller_frame.pc());
944 961 assert(caller_code != NULL, "nmethod not found");
945 962
946 963 // NOTE we use pc() not original_pc() because we already know they are
947 964 // identical otherwise we'd have never entered this block of code
948 965
949 966 OopMap* map = caller_code->oop_map_for_return_address(caller_frame.pc());
950 967 assert(map != NULL, "null check");
951 968 map->print();
952 969 tty->cr();
953 970
954 971 Disassembler::decode(copy_buff, copy_buff + *byte_count, tty);
955 972 }
956 973 // depending on the code below, do_patch says whether to copy the patch body back into the nmethod
957 974 bool do_patch = true;
958 975 if (stub_id == Runtime1::access_field_patching_id) {
959 976 // The offset may not be correct if the class was not loaded at code generation time.
960 977 // Set it now.
961 978 NativeMovRegMem* n_move = nativeMovRegMem_at(copy_buff);
962 979 assert(n_move->offset() == 0 || (n_move->offset() == 4 && (patch_field_type == T_DOUBLE || patch_field_type == T_LONG)), "illegal offset for type");
963 980 assert(patch_field_offset >= 0, "illegal offset");
964 981 n_move->add_offset_in_bytes(patch_field_offset);
965 982 } else if (stub_id == Runtime1::load_klass_patching_id) {
966 983 // If a getstatic or putstatic is referencing a klass which
967 984 // isn't fully initialized, the patch body isn't copied into
968 985 // place until initialization is complete. In this case the
969 986 // patch site is setup so that any threads besides the
970 987 // initializing thread are forced to come into the VM and
971 988 // block.
972 989 do_patch = (code != Bytecodes::_getstatic && code != Bytecodes::_putstatic) ||
973 990 instanceKlass::cast(init_klass())->is_initialized();
974 991 NativeGeneralJump* jump = nativeGeneralJump_at(instr_pc);
975 992 if (jump->jump_destination() == being_initialized_entry) {
976 993 assert(do_patch == true, "initialization must be complete at this point");
977 994 } else {
978 995 // patch the instruction <move reg, klass>
979 996 NativeMovConstReg* n_copy = nativeMovConstReg_at(copy_buff);
980 997
981 998 assert(n_copy->data() == 0 ||
982 999 n_copy->data() == (intptr_t)Universe::non_oop_word(),
983 1000 "illegal init value");
984 1001 assert(load_klass() != NULL, "klass not set");
985 1002 n_copy->set_data((intx) (load_klass()));
986 1003
987 1004 if (TracePatching) {
988 1005 Disassembler::decode(copy_buff, copy_buff + *byte_count, tty);
989 1006 }
990 1007
991 1008 #if defined(SPARC) || defined(PPC)
992 1009 // Update the oop location in the nmethod with the proper
993 1010 // oop. When the code was generated, a NULL was stuffed
994 1011 // in the oop table and that table needs to be update to
995 1012 // have the right value. On intel the value is kept
996 1013 // directly in the instruction instead of in the oop
997 1014 // table, so set_data above effectively updated the value.
998 1015 nmethod* nm = CodeCache::find_nmethod(instr_pc);
999 1016 assert(nm != NULL, "invalid nmethod_pc");
1000 1017 RelocIterator oops(nm, copy_buff, copy_buff + 1);
1001 1018 bool found = false;
1002 1019 while (oops.next() && !found) {
1003 1020 if (oops.type() == relocInfo::oop_type) {
1004 1021 oop_Relocation* r = oops.oop_reloc();
1005 1022 oop* oop_adr = r->oop_addr();
1006 1023 *oop_adr = load_klass();
1007 1024 r->fix_oop_relocation();
1008 1025 found = true;
1009 1026 }
1010 1027 }
1011 1028 assert(found, "the oop must exist!");
1012 1029 #endif
1013 1030
1014 1031 }
1015 1032 } else {
1016 1033 ShouldNotReachHere();
1017 1034 }
1018 1035 if (do_patch) {
1019 1036 // replace instructions
1020 1037 // first replace the tail, then the call
1021 1038 #ifdef ARM
1022 1039 if(stub_id == Runtime1::load_klass_patching_id && !VM_Version::supports_movw()) {
1023 1040 nmethod* nm = CodeCache::find_nmethod(instr_pc);
1024 1041 oop* oop_addr = NULL;
1025 1042 assert(nm != NULL, "invalid nmethod_pc");
1026 1043 RelocIterator oops(nm, copy_buff, copy_buff + 1);
1027 1044 while (oops.next()) {
1028 1045 if (oops.type() == relocInfo::oop_type) {
1029 1046 oop_Relocation* r = oops.oop_reloc();
1030 1047 oop_addr = r->oop_addr();
1031 1048 break;
1032 1049 }
1033 1050 }
1034 1051 assert(oop_addr != NULL, "oop relocation must exist");
1035 1052 copy_buff -= *byte_count;
1036 1053 NativeMovConstReg* n_copy2 = nativeMovConstReg_at(copy_buff);
1037 1054 n_copy2->set_pc_relative_offset((address)oop_addr, instr_pc);
1038 1055 }
1039 1056 #endif
1040 1057
1041 1058 for (int i = NativeCall::instruction_size; i < *byte_count; i++) {
1042 1059 address ptr = copy_buff + i;
1043 1060 int a_byte = (*ptr) & 0xFF;
1044 1061 address dst = instr_pc + i;
1045 1062 *(unsigned char*)dst = (unsigned char) a_byte;
1046 1063 }
1047 1064 ICache::invalidate_range(instr_pc, *byte_count);
1048 1065 NativeGeneralJump::replace_mt_safe(instr_pc, copy_buff);
1049 1066
1050 1067 if (stub_id == Runtime1::load_klass_patching_id) {
1051 1068 // update relocInfo to oop
1052 1069 nmethod* nm = CodeCache::find_nmethod(instr_pc);
1053 1070 assert(nm != NULL, "invalid nmethod_pc");
1054 1071
1055 1072 // The old patch site is now a move instruction so update
1056 1073 // the reloc info so that it will get updated during
1057 1074 // future GCs.
1058 1075 RelocIterator iter(nm, (address)instr_pc, (address)(instr_pc + 1));
1059 1076 relocInfo::change_reloc_info_for_address(&iter, (address) instr_pc,
1060 1077 relocInfo::none, relocInfo::oop_type);
1061 1078 #ifdef SPARC
1062 1079 // Sparc takes two relocations for an oop so update the second one.
1063 1080 address instr_pc2 = instr_pc + NativeMovConstReg::add_offset;
1064 1081 RelocIterator iter2(nm, instr_pc2, instr_pc2 + 1);
1065 1082 relocInfo::change_reloc_info_for_address(&iter2, (address) instr_pc2,
1066 1083 relocInfo::none, relocInfo::oop_type);
1067 1084 #endif
1068 1085 #ifdef PPC
1069 1086 { address instr_pc2 = instr_pc + NativeMovConstReg::lo_offset;
1070 1087 RelocIterator iter2(nm, instr_pc2, instr_pc2 + 1);
1071 1088 relocInfo::change_reloc_info_for_address(&iter2, (address) instr_pc2, relocInfo::none, relocInfo::oop_type);
1072 1089 }
1073 1090 #endif
1074 1091 }
1075 1092
1076 1093 } else {
1077 1094 ICache::invalidate_range(copy_buff, *byte_count);
1078 1095 NativeGeneralJump::insert_unconditional(instr_pc, being_initialized_entry);
1079 1096 }
1080 1097 }
1081 1098 }
1082 1099 }
1083 1100 JRT_END
1084 1101
1085 1102 //
1086 1103 // Entry point for compiled code. We want to patch a nmethod.
1087 1104 // We don't do a normal VM transition here because we want to
1088 1105 // know after the patching is complete and any safepoint(s) are taken
1089 1106 // if the calling nmethod was deoptimized. We do this by calling a
1090 1107 // helper method which does the normal VM transition and when it
1091 1108 // completes we can check for deoptimization. This simplifies the
1092 1109 // assembly code in the cpu directories.
1093 1110 //
1094 1111 int Runtime1::move_klass_patching(JavaThread* thread) {
1095 1112 //
1096 1113 // NOTE: we are still in Java
1097 1114 //
1098 1115 Thread* THREAD = thread;
1099 1116 debug_only(NoHandleMark nhm;)
1100 1117 {
1101 1118 // Enter VM mode
1102 1119
1103 1120 ResetNoHandleMark rnhm;
1104 1121 patch_code(thread, load_klass_patching_id);
1105 1122 }
1106 1123 // Back in JAVA, use no oops DON'T safepoint
1107 1124
1108 1125 // Return true if calling code is deoptimized
1109 1126
1110 1127 return caller_is_deopted();
1111 1128 }
1112 1129
1113 1130 //
1114 1131 // Entry point for compiled code. We want to patch a nmethod.
1115 1132 // We don't do a normal VM transition here because we want to
1116 1133 // know after the patching is complete and any safepoint(s) are taken
1117 1134 // if the calling nmethod was deoptimized. We do this by calling a
1118 1135 // helper method which does the normal VM transition and when it
1119 1136 // completes we can check for deoptimization. This simplifies the
1120 1137 // assembly code in the cpu directories.
1121 1138 //
1122 1139
1123 1140 int Runtime1::access_field_patching(JavaThread* thread) {
1124 1141 //
1125 1142 // NOTE: we are still in Java
1126 1143 //
1127 1144 Thread* THREAD = thread;
1128 1145 debug_only(NoHandleMark nhm;)
1129 1146 {
1130 1147 // Enter VM mode
1131 1148
1132 1149 ResetNoHandleMark rnhm;
1133 1150 patch_code(thread, access_field_patching_id);
1134 1151 }
1135 1152 // Back in JAVA, use no oops DON'T safepoint
1136 1153
1137 1154 // Return true if calling code is deoptimized
1138 1155
1139 1156 return caller_is_deopted();
1140 1157 JRT_END
1141 1158
1142 1159
1143 1160 JRT_LEAF(void, Runtime1::trace_block_entry(jint block_id))
1144 1161 // for now we just print out the block id
1145 1162 tty->print("%d ", block_id);
1146 1163 JRT_END
1147 1164
1148 1165
1149 1166 // Array copy return codes.
1150 1167 enum {
1151 1168 ac_failed = -1, // arraycopy failed
1152 1169 ac_ok = 0 // arraycopy succeeded
1153 1170 };
1154 1171
1155 1172
1156 1173 // Below length is the # elements copied.
1157 1174 template <class T> int obj_arraycopy_work(oopDesc* src, T* src_addr,
1158 1175 oopDesc* dst, T* dst_addr,
1159 1176 int length) {
1160 1177
1161 1178 // For performance reasons, we assume we are using a card marking write
1162 1179 // barrier. The assert will fail if this is not the case.
1163 1180 // Note that we use the non-virtual inlineable variant of write_ref_array.
1164 1181 BarrierSet* bs = Universe::heap()->barrier_set();
1165 1182 assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt");
1166 1183 assert(bs->has_write_ref_array_pre_opt(), "For pre-barrier as well.");
1167 1184 if (src == dst) {
1168 1185 // same object, no check
1169 1186 bs->write_ref_array_pre(dst_addr, length);
1170 1187 Copy::conjoint_oops_atomic(src_addr, dst_addr, length);
1171 1188 bs->write_ref_array((HeapWord*)dst_addr, length);
1172 1189 return ac_ok;
1173 1190 } else {
1174 1191 klassOop bound = objArrayKlass::cast(dst->klass())->element_klass();
1175 1192 klassOop stype = objArrayKlass::cast(src->klass())->element_klass();
1176 1193 if (stype == bound || Klass::cast(stype)->is_subtype_of(bound)) {
1177 1194 // Elements are guaranteed to be subtypes, so no check necessary
1178 1195 bs->write_ref_array_pre(dst_addr, length);
1179 1196 Copy::conjoint_oops_atomic(src_addr, dst_addr, length);
1180 1197 bs->write_ref_array((HeapWord*)dst_addr, length);
1181 1198 return ac_ok;
1182 1199 }
1183 1200 }
1184 1201 return ac_failed;
1185 1202 }
1186 1203
1187 1204 // fast and direct copy of arrays; returning -1, means that an exception may be thrown
1188 1205 // and we did not copy anything
1189 1206 JRT_LEAF(int, Runtime1::arraycopy(oopDesc* src, int src_pos, oopDesc* dst, int dst_pos, int length))
1190 1207 #ifndef PRODUCT
1191 1208 _generic_arraycopy_cnt++; // Slow-path oop array copy
1192 1209 #endif
1193 1210
1194 1211 if (src == NULL || dst == NULL || src_pos < 0 || dst_pos < 0 || length < 0) return ac_failed;
1195 1212 if (!dst->is_array() || !src->is_array()) return ac_failed;
1196 1213 if ((unsigned int) arrayOop(src)->length() < (unsigned int)src_pos + (unsigned int)length) return ac_failed;
1197 1214 if ((unsigned int) arrayOop(dst)->length() < (unsigned int)dst_pos + (unsigned int)length) return ac_failed;
1198 1215
1199 1216 if (length == 0) return ac_ok;
1200 1217 if (src->is_typeArray()) {
1201 1218 const klassOop klass_oop = src->klass();
1202 1219 if (klass_oop != dst->klass()) return ac_failed;
1203 1220 typeArrayKlass* klass = typeArrayKlass::cast(klass_oop);
1204 1221 const int l2es = klass->log2_element_size();
1205 1222 const int ihs = klass->array_header_in_bytes() / wordSize;
1206 1223 char* src_addr = (char*) ((oopDesc**)src + ihs) + (src_pos << l2es);
1207 1224 char* dst_addr = (char*) ((oopDesc**)dst + ihs) + (dst_pos << l2es);
1208 1225 // Potential problem: memmove is not guaranteed to be word atomic
1209 1226 // Revisit in Merlin
1210 1227 memmove(dst_addr, src_addr, length << l2es);
1211 1228 return ac_ok;
1212 1229 } else if (src->is_objArray() && dst->is_objArray()) {
1213 1230 if (UseCompressedOops) {
1214 1231 narrowOop *src_addr = objArrayOop(src)->obj_at_addr<narrowOop>(src_pos);
1215 1232 narrowOop *dst_addr = objArrayOop(dst)->obj_at_addr<narrowOop>(dst_pos);
1216 1233 return obj_arraycopy_work(src, src_addr, dst, dst_addr, length);
1217 1234 } else {
1218 1235 oop *src_addr = objArrayOop(src)->obj_at_addr<oop>(src_pos);
1219 1236 oop *dst_addr = objArrayOop(dst)->obj_at_addr<oop>(dst_pos);
1220 1237 return obj_arraycopy_work(src, src_addr, dst, dst_addr, length);
1221 1238 }
1222 1239 }
1223 1240 return ac_failed;
1224 1241 JRT_END
1225 1242
1226 1243
1227 1244 JRT_LEAF(void, Runtime1::primitive_arraycopy(HeapWord* src, HeapWord* dst, int length))
1228 1245 #ifndef PRODUCT
1229 1246 _primitive_arraycopy_cnt++;
1230 1247 #endif
1231 1248
1232 1249 if (length == 0) return;
1233 1250 // Not guaranteed to be word atomic, but that doesn't matter
1234 1251 // for anything but an oop array, which is covered by oop_arraycopy.
1235 1252 Copy::conjoint_jbytes(src, dst, length);
1236 1253 JRT_END
1237 1254
1238 1255 JRT_LEAF(void, Runtime1::oop_arraycopy(HeapWord* src, HeapWord* dst, int num))
1239 1256 #ifndef PRODUCT
1240 1257 _oop_arraycopy_cnt++;
1241 1258 #endif
1242 1259
1243 1260 if (num == 0) return;
1244 1261 BarrierSet* bs = Universe::heap()->barrier_set();
1245 1262 assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt");
1246 1263 assert(bs->has_write_ref_array_pre_opt(), "For pre-barrier as well.");
1247 1264 if (UseCompressedOops) {
1248 1265 bs->write_ref_array_pre((narrowOop*)dst, num);
1249 1266 Copy::conjoint_oops_atomic((narrowOop*) src, (narrowOop*) dst, num);
1250 1267 } else {
1251 1268 bs->write_ref_array_pre((oop*)dst, num);
1252 1269 Copy::conjoint_oops_atomic((oop*) src, (oop*) dst, num);
1253 1270 }
1254 1271 bs->write_ref_array(dst, num);
1255 1272 JRT_END
1256 1273
1257 1274
1258 1275 #ifndef PRODUCT
1259 1276 void Runtime1::print_statistics() {
1260 1277 tty->print_cr("C1 Runtime statistics:");
1261 1278 tty->print_cr(" _resolve_invoke_virtual_cnt: %d", SharedRuntime::_resolve_virtual_ctr);
1262 1279 tty->print_cr(" _resolve_invoke_opt_virtual_cnt: %d", SharedRuntime::_resolve_opt_virtual_ctr);
1263 1280 tty->print_cr(" _resolve_invoke_static_cnt: %d", SharedRuntime::_resolve_static_ctr);
1264 1281 tty->print_cr(" _handle_wrong_method_cnt: %d", SharedRuntime::_wrong_method_ctr);
1265 1282 tty->print_cr(" _ic_miss_cnt: %d", SharedRuntime::_ic_miss_ctr);
1266 1283 tty->print_cr(" _generic_arraycopy_cnt: %d", _generic_arraycopy_cnt);
1267 1284 tty->print_cr(" _generic_arraycopystub_cnt: %d", _generic_arraycopystub_cnt);
1268 1285 tty->print_cr(" _byte_arraycopy_cnt: %d", _byte_arraycopy_cnt);
1269 1286 tty->print_cr(" _short_arraycopy_cnt: %d", _short_arraycopy_cnt);
1270 1287 tty->print_cr(" _int_arraycopy_cnt: %d", _int_arraycopy_cnt);
1271 1288 tty->print_cr(" _long_arraycopy_cnt: %d", _long_arraycopy_cnt);
1272 1289 tty->print_cr(" _primitive_arraycopy_cnt: %d", _primitive_arraycopy_cnt);
1273 1290 tty->print_cr(" _oop_arraycopy_cnt (C): %d", Runtime1::_oop_arraycopy_cnt);
1274 1291 tty->print_cr(" _oop_arraycopy_cnt (stub): %d", _oop_arraycopy_cnt);
1275 1292 tty->print_cr(" _arraycopy_slowcase_cnt: %d", _arraycopy_slowcase_cnt);
1276 1293 tty->print_cr(" _arraycopy_checkcast_cnt: %d", _arraycopy_checkcast_cnt);
1277 1294 tty->print_cr(" _arraycopy_checkcast_attempt_cnt:%d", _arraycopy_checkcast_attempt_cnt);
1278 1295
1279 1296 tty->print_cr(" _new_type_array_slowcase_cnt: %d", _new_type_array_slowcase_cnt);
1280 1297 tty->print_cr(" _new_object_array_slowcase_cnt: %d", _new_object_array_slowcase_cnt);
1281 1298 tty->print_cr(" _new_instance_slowcase_cnt: %d", _new_instance_slowcase_cnt);
1282 1299 tty->print_cr(" _new_multi_array_slowcase_cnt: %d", _new_multi_array_slowcase_cnt);
1283 1300 tty->print_cr(" _monitorenter_slowcase_cnt: %d", _monitorenter_slowcase_cnt);
1284 1301 tty->print_cr(" _monitorexit_slowcase_cnt: %d", _monitorexit_slowcase_cnt);
1285 1302 tty->print_cr(" _patch_code_slowcase_cnt: %d", _patch_code_slowcase_cnt);
1286 1303
1287 1304 tty->print_cr(" _throw_range_check_exception_count: %d:", _throw_range_check_exception_count);
1288 1305 tty->print_cr(" _throw_index_exception_count: %d:", _throw_index_exception_count);
1289 1306 tty->print_cr(" _throw_div0_exception_count: %d:", _throw_div0_exception_count);
1290 1307 tty->print_cr(" _throw_null_pointer_exception_count: %d:", _throw_null_pointer_exception_count);
1291 1308 tty->print_cr(" _throw_class_cast_exception_count: %d:", _throw_class_cast_exception_count);
1292 1309 tty->print_cr(" _throw_incompatible_class_change_error_count: %d:", _throw_incompatible_class_change_error_count);
1293 1310 tty->print_cr(" _throw_array_store_exception_count: %d:", _throw_array_store_exception_count);
1294 1311 tty->print_cr(" _throw_count: %d:", _throw_count);
1295 1312
1296 1313 SharedRuntime::print_ic_miss_histogram();
1297 1314 tty->cr();
1298 1315 }
1299 1316 #endif // PRODUCT
|
↓ open down ↓ |
606 lines elided |
↑ open up ↑ |
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX